id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.02967 | Decomposition of Nonlinear Dynamical Networks via Comparison Systems | In analysis and control of large-scale nonlinear dynamical systems, a
distributed approach is often an attractive option due to its computational
tractability and usually low communication requirements. Success of the
distributed control design relies on the separability of the network into
weakly interacting subsystems such that minimal information exchange between
subsystems is sufficient to achieve satisfactory control performance. While
distributed analysis and control design for dynamical network have been well
studied, decomposition of nonlinear networks into weakly interacting subsystems
has not received as much attention. In this article we propose a vector
Lyapunov functions based approach to quantify the energy-flow in a dynamical
network via a model of a comparison system. Introducing a notion of power and
energy flow in a dynamical network, we use sum-of-squares programming tools to
partition polynomial networks into weakly interacting subsystems. Examples are
provided to illustrate the proposed method of decomposition.
| math.DS math.OC | in analysis and control of largescale nonlinear dynamical systems a distributed approach is often an attractive option due to its computational tractability and usually low communication requirements success of the distributed control design relies on the separability of the network into weakly interacting subsystems such that minimal information exchange between subsystems is sufficient to achieve satisfactory control performance while distributed analysis and control design for dynamical network have been well studied decomposition of nonlinear networks into weakly interacting subsystems has not received as much attention in this article we propose a vector lyapunov functions based approach to quantify the energyflow in a dynamical network via a model of a comparison system introducing a notion of power and energy flow in a dynamical network we use sumofsquares programming tools to partition polynomial networks into weakly interacting subsystems examples are provided to illustrate the proposed method of decomposition | [['in', 'analysis', 'and', 'control', 'of', 'largescale', 'nonlinear', 'dynamical', 'systems', 'a', 'distributed', 'approach', 'is', 'often', 'an', 'attractive', 'option', 'due', 'to', 'its', 'computational', 'tractability', 'and', 'usually', 'low', 'communication', 'requirements', 'success', 'of', 'the', 'distributed', 'control', 'design', 'relies', 'on', 'the', 'separability', 'of', 'the', 'network', 'into', 'weakly', 'interacting', 'subsystems', 'such', 'that', 'minimal', 'information', 'exchange', 'between', 'subsystems', 'is', 'sufficient', 'to', 'achieve', 'satisfactory', 'control', 'performance', 'while', 'distributed', 'analysis', 'and', 'control', 'design', 'for', 'dynamical', 'network', 'have', 'been', 'well', 'studied', 'decomposition', 'of', 'nonlinear', 'networks', 'into', 'weakly', 'interacting', 'subsystems', 'has', 'not', 'received', 'as', 'much', 'attention', 'in', 'this', 'article', 'we', 'propose', 'a', 'vector', 'lyapunov', 'functions', 'based', 'approach', 'to', 'quantify', 'the', 'energyflow', 'in', 'a', 'dynamical', 'network', 'via', 'a', 'model', 'of', 'a', 'comparison', 'system', 'introducing', 'a', 'notion', 'of', 'power', 'and', 'energy', 'flow', 'in', 'a', 'dynamical', 'network', 'we', 'use', 'sumofsquares', 'programming', 'tools', 'to', 'partition', 'polynomial', 'networks', 'into', 'weakly', 'interacting', 'subsystems', 'examples', 'are', 'provided', 'to', 'illustrate', 'the', 'proposed', 'method', 'of', 'decomposition']] | [-0.1615399834763718, 0.030856901294275103, -0.09934011775496326, 0.04550068398175302, -0.0770841346852711, -0.18999995785918444, 0.023357393618749632, 0.35928944576442345, -0.29942376883572913, -0.2966141209408182, 0.11294502476931945, -0.23209474773635794, -0.19803278021393217, 0.17697480484709296, -0.06187579770291811, 0.11416092389925026, 0.05990989673292672, 0.020877751839117543, -0.03943071385673311, -0.22925714391908825, 0.3049758725045313, 0.04858505230537322, 0.31502050248274505, 0.03796783517344459, 0.13911413102831743, 0.02341914231520567, -0.010728282271884382, 0.03954725774373438, -0.07510839691187282, 0.1588637587990714, 0.2662395770112946, 0.16792922164154023, 0.35543083159686767, -0.4331702418268135, -0.22388080948938247, 0.11488098872678788, 0.16401660088003192, 0.07680328654154038, -0.03738251530680142, -0.26737850723941237, 0.07030548705888452, -0.20793630024545814, -0.057561475136125945, -0.13952348844071671, -0.02096280904186966, 0.03200401618322421, -0.3021653486345576, 0.019851903672320512, 0.05666002684770382, 0.06557031118387535, -0.04781154006454864, -0.05538148511032102, -0.007263257075739029, 0.10546280070182497, -0.018165085589902298, -0.022437203687468977, 0.1382295515975111, -0.11813324421790926, -0.12286548524750524, 0.36675564611126504, -0.016093178837215654, -0.2593169635040558, 0.2369063191182835, -0.03965518053793285, -0.15621604796256616, 0.11603335240115858, 0.2713457892699907, 0.07892195614412019, -0.21398388034957525, 0.07002242767488845, -0.013419754414066468, 0.19562513809108928, -0.027066727774855616, 0.07782179499300171, 0.17434761192400824, 0.25291696502125427, 0.11595946382444147, 0.17371959902652323, 0.014053054222492629, -0.1634758059597217, -0.2129601401576696, -0.12007633529042136, -0.20745673959385857, 0.010672638014262726, -0.07003677542893892, -0.1526374175812896, 0.4110832123328255, 0.13379582133756518, 0.15941465977094557, 0.09510077974338034, 0.347018672127838, 0.11073946990495331, 0.06657211911507359, 0.0763880707585087, 0.22631461057757754, 0.16596539680246417, 0.09898590518971778, -0.20365556666933715, 0.04949814350063568, 0.05895827525001887] |
1,803.02968 | Learning Deep Models: Critical Points and Local Openness | With the increasing popularity of non-convex deep models, developing a
unifying theory for studying the optimization problems that arise from training
these models becomes very significant. Toward this end, we present in this
paper a unifying landscape analysis framework that can be used when the
training objective function is the composite of simple functions.
Using the local openness property of the underlying training models, we
provide simple sufficient conditions under which any local optimum of the
resulting optimization problem is globally optimal. We first completely
characterize the local openness of the symmetric and non-symmetric matrix
multiplication mapping . Then we use our characterization to: 1) provide a
simple proof for the classical result of Burer-Monteiro and extend it to
non-continuous loss functions. 2) Show that every local optimum of two layer
linear networks is globally optimal. Unlike many existing results in the
literature, our result requires no assumption on the target data matrix Y, and
input data matrix X. 3) Develop a complete characterization of the local/global
optima equivalence of multi-layer linear neural networks. We provide various
counterexamples to show the necessity of each of our assumptions. 4) Show
global/local optima equivalence of over-parameterized non-linear deep models
having a certain pyramidal structure. In contrast to existing works, our result
requires no assumption on the differentiability of the activation functions and
can go beyond "full-rank" cases.
| math.OC | with the increasing popularity of nonconvex deep models developing a unifying theory for studying the optimization problems that arise from training these models becomes very significant toward this end we present in this paper a unifying landscape analysis framework that can be used when the training objective function is the composite of simple functions using the local openness property of the underlying training models we provide simple sufficient conditions under which any local optimum of the resulting optimization problem is globally optimal we first completely characterize the local openness of the symmetric and nonsymmetric matrix multiplication mapping then we use our characterization to 1 provide a simple proof for the classical result of burermonteiro and extend it to noncontinuous loss functions 2 show that every local optimum of two layer linear networks is globally optimal unlike many existing results in the literature our result requires no assumption on the target data matrix y and input data matrix x 3 develop a complete characterization of the localglobal optima equivalence of multilayer linear neural networks we provide various counterexamples to show the necessity of each of our assumptions 4 show globallocal optima equivalence of overparameterized nonlinear deep models having a certain pyramidal structure in contrast to existing works our result requires no assumption on the differentiability of the activation functions and can go beyond fullrank cases | [['with', 'the', 'increasing', 'popularity', 'of', 'nonconvex', 'deep', 'models', 'developing', 'a', 'unifying', 'theory', 'for', 'studying', 'the', 'optimization', 'problems', 'that', 'arise', 'from', 'training', 'these', 'models', 'becomes', 'very', 'significant', 'toward', 'this', 'end', 'we', 'present', 'in', 'this', 'paper', 'a', 'unifying', 'landscape', 'analysis', 'framework', 'that', 'can', 'be', 'used', 'when', 'the', 'training', 'objective', 'function', 'is', 'the', 'composite', 'of', 'simple', 'functions', 'using', 'the', 'local', 'openness', 'property', 'of', 'the', 'underlying', 'training', 'models', 'we', 'provide', 'simple', 'sufficient', 'conditions', 'under', 'which', 'any', 'local', 'optimum', 'of', 'the', 'resulting', 'optimization', 'problem', 'is', 'globally', 'optimal', 'we', 'first', 'completely', 'characterize', 'the', 'local', 'openness', 'of', 'the', 'symmetric', 'and', 'nonsymmetric', 'matrix', 'multiplication', 'mapping', 'then', 'we', 'use', 'our', 'characterization', 'to', '1', 'provide', 'a', 'simple', 'proof', 'for', 'the', 'classical', 'result', 'of', 'burermonteiro', 'and', 'extend', 'it', 'to', 'noncontinuous', 'loss', 'functions', '2', 'show', 'that', 'every', 'local', 'optimum', 'of', 'two', 'layer', 'linear', 'networks', 'is', 'globally', 'optimal', 'unlike', 'many', 'existing', 'results', 'in', 'the', 'literature', 'our', 'result', 'requires', 'no', 'assumption', 'on', 'the', 'target', 'data', 'matrix', 'y', 'and', 'input', 'data', 'matrix', 'x', '3', 'develop', 'a', 'complete', 'characterization', 'of', 'the', 'localglobal', 'optima', 'equivalence', 'of', 'multilayer', 'linear', 'neural', 'networks', 'we', 'provide', 'various', 'counterexamples', 'to', 'show', 'the', 'necessity', 'of', 'each', 'of', 'our', 'assumptions', '4', 'show', 'globallocal', 'optima', 'equivalence', 'of', 'overparameterized', 'nonlinear', 'deep', 'models', 'having', 'a', 'certain', 'pyramidal', 'structure', 'in', 'contrast', 'to', 'existing', 'works', 'our', 'result', 'requires', 'no', 'assumption', 'on', 'the', 'differentiability', 'of', 'the', 'activation', 'functions', 'and', 'can', 'go', 'beyond', 'fullrank', 'cases']] | [-0.08652854111694198, 5.0959383120893366e-05, -0.09546417325951292, 0.09412599692950607, -0.07522924986863343, -0.1539656870154431, 0.03703952833893709, 0.3879663945491692, -0.30755805964872707, -0.26534492831394474, 0.10770674046008415, -0.21737684525572018, -0.22914561735316447, 0.16156133101139858, -0.08246900623115445, 0.07955096571614766, 0.0820826741255587, -0.012009610667908939, -0.13104810548975365, -0.2861281514040976, 0.3361389810680911, 0.010863144673878975, 0.2973295707046678, 0.042435133366909995, 0.11556410305326738, 0.03420486183313187, 0.004102605550932432, 0.009440134470220787, -0.10712021130630742, 0.1655683728110619, 0.2767532931817576, 0.1949513087352638, 0.32783133507161566, -0.44015655374031276, -0.2205230330582708, 0.1586118166388977, 0.09276245861526279, 0.11291426186289755, -0.05282896187626258, -0.22553444215321047, 0.12239888066583912, -0.11742239286832046, -0.11109891714503257, -0.09933786940902271, -0.042568330097960176, 0.038939535322632376, -0.3271222460797227, 0.04078042902567956, 0.13051420093064994, 0.05446725391500097, -0.07436968670767133, -0.10942922860184419, 0.007925454541171868, 0.11614202122564166, 0.024347967559151584, 0.02873631213982922, 0.10999593682494638, -0.12560766410336197, -0.10052190220085322, 0.319258569390513, -0.05110289433962732, -0.22113047483435366, 0.20621802410875847, -0.0770220109199207, -0.16013468787943047, 0.10880485881144912, 0.16766763596180162, 0.1371693617537468, -0.1439513322959231, 0.11055013595094872, -0.09750417793942948, 0.1591814525823533, 0.0389410308188027, 0.008552661375558403, 0.11815769146128982, 0.18483246814451246, 0.14936960672457644, 0.1504480650208799, -0.01921375029321228, -0.08321196419793912, -0.3144299383358365, -0.11455184000702243, -0.17067308755628932, 0.05950160605061683, -0.12431819021600989, -0.16803380975034088, 0.3987558655956361, 0.15142126031085873, 0.21577936596752675, 0.13360895786536275, 0.27840624221633853, 0.09453793532234808, 0.0737110013963372, 0.07989067642691745, 0.2223484151368861, 0.1073513116851765, 0.07596041828271284, -0.14369413765754352, 0.07546628484435912, 0.06270233038854453] |
1,803.02969 | On isomorphisms of generalized multifold extensions of algebras without
nonzero oriented cycles | Assume that a basic algebra $A$ over an algebraically closed field $\Bbbk$
with a basic set $A_0$ of primitive idempotents has the property that
$eAe=\Bbbk$ for all $e \in A_0$. Let $n$ be a nonzero integer, and $\phi$ and
$\psi$ two automorphisms of the repetitive category $\hat{A}$ of $A$ with jump
$n$ (namely, they send $A^{[0]}$ to $A^{[n]}$, where $A^{[i]}$ is the $i$-th
copy of $A$ in $\hat{A}$ for all $i \in \mathbb{Z}$). If $\phi$ and $\psi$
coincide on the objects and if there exists a map $\rho \colon A_0 \to \Bbbk$
such that $\rho_0(y)\phi_0(a)=\psi_0(a)\rho _0(x)$ for all morphisms $a\in
A(x,y)$, then the orbit categories $\hat{A}/\langle \phi \rangle$ and
$\hat{A}/\langle \psi \rangle$ are isomorphic as $\mathbb{Z}$-graded
categories.
| math.RA | assume that a basic algebra a over an algebraically closed field bbbk with a basic set a_0 of primitive idempotents has the property that eaebbbk for all e in a_0 let n be a nonzero integer and phi and psi two automorphisms of the repetitive category hata of a with jump n namely they send a0 to an where ai is the ith copy of a in hata for all i in mathbbz if phi and psi coincide on the objects and if there exists a map rho colon a_0 to bbbk such that rho_0yphi_0apsi_0arho _0x for all morphisms ain axy then the orbit categories hatalangle phi rangle and hatalangle psi rangle are isomorphic as mathbbzgraded categories | [['assume', 'that', 'a', 'basic', 'algebra', 'a', 'over', 'an', 'algebraically', 'closed', 'field', 'bbbk', 'with', 'a', 'basic', 'set', 'a_0', 'of', 'primitive', 'idempotents', 'has', 'the', 'property', 'that', 'eaebbbk', 'for', 'all', 'e', 'in', 'a_0', 'let', 'n', 'be', 'a', 'nonzero', 'integer', 'and', 'phi', 'and', 'psi', 'two', 'automorphisms', 'of', 'the', 'repetitive', 'category', 'hata', 'of', 'a', 'with', 'jump', 'n', 'namely', 'they', 'send', 'a0', 'to', 'an', 'where', 'ai', 'is', 'the', 'ith', 'copy', 'of', 'a', 'in', 'hata', 'for', 'all', 'i', 'in', 'mathbbz', 'if', 'phi', 'and', 'psi', 'coincide', 'on', 'the', 'objects', 'and', 'if', 'there', 'exists', 'a', 'map', 'rho', 'colon', 'a_0', 'to', 'bbbk', 'such', 'that', 'rho_0yphi_0apsi_0arho', '_0x', 'for', 'all', 'morphisms', 'ain', 'axy', 'then', 'the', 'orbit', 'categories', 'hatalangle', 'phi', 'rangle', 'and', 'hatalangle', 'psi', 'rangle', 'are', 'isomorphic', 'as', 'mathbbzgraded', 'categories']] | [-0.19877312751486897, 0.17313180350200646, -0.049082305980846286, -0.023753578409274008, -0.032675655325874686, -0.22257750019447745, -0.06823850314997669, 0.37170329452159684, -0.38087426455292317, -0.1055358629008489, 0.05423040884800555, -0.3159223543022693, -0.08872339020412515, 0.19084404081305756, -0.08533150197555577, -0.07357379947539552, 0.04544603666831141, 0.2213987237690682, -0.04855545077069629, -0.2267673942852915, 0.3467800103660141, -0.11318161483255348, 0.11426114657245177, -0.030355943400146707, 0.13577669295149722, -0.0016770887928682246, 0.06951078912035362, -0.0031106308638949747, -0.1680794764521514, 0.013414089559643929, 0.2833616546371819, 0.16098792025669745, 0.25309632740910665, -0.3359872032306157, -0.03667764848796651, 0.273459762517762, 0.158889547360429, -0.10397758509342177, -0.009767378209549602, -0.2490681277273065, 0.18418896736849483, -0.1905392060829659, -0.06350630525516213, -0.05051726783027074, 0.23686044914003496, 0.001667522020787666, -0.37636445655620526, -0.0433707000733453, 0.08485061050825086, 0.11850068358346887, -0.04155382081600172, -0.15165250335537298, -0.0679031227628002, 0.08573063512968863, -0.03612769060211057, 0.17752931307976333, 0.11398924311756023, -0.115659789406761, -0.08415970708613583, 0.37521784140595366, -0.07746139547089115, -0.2455748367023521, 0.07745847180142716, -0.1859374052479065, -0.1518583385332022, 0.09569478429953701, 0.03476283670170233, 0.11434459474237103, -0.016328128877960677, 0.2548238159896365, -0.14921938309661137, 0.13255427621438035, 0.07072571697790409, 7.597772180036242e-05, 0.17577025808610156, 0.009369749027038259, 0.05284522687257517, 0.04653307454905838, 0.03579917057192818, 0.027815226282525276, -0.42969882843317464, -0.1972682293375588, -0.09983299902419926, 0.1753049585053564, -0.0703524632214924, -0.1820653766709646, 0.34160766490302713, 0.07902763625731625, 0.22866251781150432, 0.0888152682247372, 0.22061124016077624, 0.06012230861298511, 0.0649953171627463, 0.1006554998790047, 0.05870441673323512, 0.20976932479035376, -0.04130016935960157, -0.14448607125918247, -0.017850164531929686, 0.12607839286127792] |
1,803.0297 | Eigenvalues of Matrices whose Elements are Ramanujan Sums or Kloosterman
Sums | Let $c_q(n)$ be the Ramanujan sums and let $S(m,n;q)$ be the Kloosterman
sums. We study the eigenvalues of $q \times q$ matrices whose $(m,n)$ entry is
$c_q (m-n)$ or $S(m,n;q)$ where $q$ is a fixed positive integer. We also study
the eigenvalues of matrices whose entries are sums of Ramanujan sums or sums of
Kloosterman sums.
| math.NT | let c_qn be the ramanujan sums and let smnq be the kloosterman sums we study the eigenvalues of q times q matrices whose mn entry is c_q mn or smnq where q is a fixed positive integer we also study the eigenvalues of matrices whose entries are sums of ramanujan sums or sums of kloosterman sums | [['let', 'c_qn', 'be', 'the', 'ramanujan', 'sums', 'and', 'let', 'smnq', 'be', 'the', 'kloosterman', 'sums', 'we', 'study', 'the', 'eigenvalues', 'of', 'q', 'times', 'q', 'matrices', 'whose', 'mn', 'entry', 'is', 'c_q', 'mn', 'or', 'smnq', 'where', 'q', 'is', 'a', 'fixed', 'positive', 'integer', 'we', 'also', 'study', 'the', 'eigenvalues', 'of', 'matrices', 'whose', 'entries', 'are', 'sums', 'of', 'ramanujan', 'sums', 'or', 'sums', 'of', 'kloosterman', 'sums']] | [-0.3009216851658291, 0.15054279346777885, -0.04400583325574795, -0.00042443387469069823, -0.019782529622143892, -0.15442825590812223, 0.06069190422918096, 0.29694724007061235, -0.3268997175274072, -0.1842178734605787, 0.10608607187384257, -0.409781305740277, -0.13776296043458083, 0.1226140923573877, -0.019209260120987892, -0.01533216819236124, 0.010962099716481235, 0.10503435598824311, -0.12342372517687855, -0.39592189990259985, 0.31383730688442785, -0.08605609354735524, 0.08614691039029923, 0.07183405343029234, 0.001757769362518081, 0.013695101115714621, 0.01374220244448494, -0.09235301506015714, -0.11714289977249724, 0.1495690191578534, 0.2949526183721092, 0.0593907424007301, 0.268559154778443, -0.37712338380515575, -0.028375217087428878, 0.32751701803257066, 0.22630022224728708, -0.1055648874629427, 0.07644192043139979, -0.23680682357452396, 0.1496368312207913, -0.13655239785159076, -0.08426727182059376, -0.0704044830398979, 0.09584466464541576, 0.15638543482593917, -0.4331258161476365, 0.05301776253650638, 0.09909618266478733, 0.10447393078356981, 0.020990664855128637, -0.37498828389302447, 0.09180353409438222, 0.05302430697958226, 0.057240465474832386, -0.034202193843493996, 0.0091918734661131, 0.016293712012055848, -0.12930815221948755, 0.34668560132936194, 0.0007017508571691535, -0.2333043659519818, -0.06721815495337877, -0.2960128653449593, -0.07959350356314746, 0.12317448604369054, 0.16268788614413804, 0.1991209107692595, 0.029220448013533046, 0.20809688025770742, -0.16865442729882757, 0.08430786880974968, 0.19364818867675407, -0.011377738047115228, 0.22231882926145638, -0.11733253034590571, 0.04767834966036456, 0.13700183546084357, 0.07487535911301772, 0.03650229375085069, -0.2956950766275878, -0.19410549007632114, -0.3252891334015186, 0.294752043671906, -0.2380278190957378, -0.25786829087883234, 0.3483814161822752, -0.02272940782347211, 0.19347215906061507, 0.1932452494037096, 0.1734482676687616, 0.22101421444030064, 0.026953044140504465, 0.02122334513330349, -0.09132702303705392, 0.333367348027726, -0.04638441462345697, -0.07983938282079718, 0.026245150904826545, 0.2435152010164327] |
1,803.02971 | Weighted Hardy's inequality in a limiting case and the perturbed
Kolmogorov equation | In this paper, we show a weighted Hardy inequality in a limiting case for
functions in weighted Sobolev spaces with respect to an invariant measure. We
also prove that the constant in the left-hand side of the inequality is
optimal. As applications, we establish the existence and nonexistence of
positive exponentially bounded weak solutions to a parabolic problem involving
the Ornstein-Uhlenbeck operator perturbed by a critical singular potential in
two dimensional case, according to the size of the coefficient of the critical
potential. These results can be considered as counterparts in the limiting case
of results which established in \cite{GGR(AA)} \cite{Hauer-Rhandi} in the
non-critical cases, and are also considered as extensions of a result in
\cite{Cabre-Martel} to the Kolmogorov operator case perturbed by a critical
singular potential.
| math.AP | in this paper we show a weighted hardy inequality in a limiting case for functions in weighted sobolev spaces with respect to an invariant measure we also prove that the constant in the lefthand side of the inequality is optimal as applications we establish the existence and nonexistence of positive exponentially bounded weak solutions to a parabolic problem involving the ornsteinuhlenbeck operator perturbed by a critical singular potential in two dimensional case according to the size of the coefficient of the critical potential these results can be considered as counterparts in the limiting case of results which established in citeggraa citehauerrhandi in the noncritical cases and are also considered as extensions of a result in citecabremartel to the kolmogorov operator case perturbed by a critical singular potential | [['in', 'this', 'paper', 'we', 'show', 'a', 'weighted', 'hardy', 'inequality', 'in', 'a', 'limiting', 'case', 'for', 'functions', 'in', 'weighted', 'sobolev', 'spaces', 'with', 'respect', 'to', 'an', 'invariant', 'measure', 'we', 'also', 'prove', 'that', 'the', 'constant', 'in', 'the', 'lefthand', 'side', 'of', 'the', 'inequality', 'is', 'optimal', 'as', 'applications', 'we', 'establish', 'the', 'existence', 'and', 'nonexistence', 'of', 'positive', 'exponentially', 'bounded', 'weak', 'solutions', 'to', 'a', 'parabolic', 'problem', 'involving', 'the', 'ornsteinuhlenbeck', 'operator', 'perturbed', 'by', 'a', 'critical', 'singular', 'potential', 'in', 'two', 'dimensional', 'case', 'according', 'to', 'the', 'size', 'of', 'the', 'coefficient', 'of', 'the', 'critical', 'potential', 'these', 'results', 'can', 'be', 'considered', 'as', 'counterparts', 'in', 'the', 'limiting', 'case', 'of', 'results', 'which', 'established', 'in', 'citeggraa', 'citehauerrhandi', 'in', 'the', 'noncritical', 'cases', 'and', 'are', 'also', 'considered', 'as', 'extensions', 'of', 'a', 'result', 'in', 'citecabremartel', 'to', 'the', 'kolmogorov', 'operator', 'case', 'perturbed', 'by', 'a', 'critical', 'singular', 'potential']] | [-0.11084751702184158, 0.07153433836321064, -0.039955587509358605, 0.09318917412911693, -0.023796728301432826, -0.1305027718565637, 0.0172144093695322, 0.3124393283149167, -0.2996672982567801, -0.18950909276111727, 0.15944010065774614, -0.3093302796534713, -0.17050822981963715, 0.22357826441105816, -0.08133181507488893, 0.09474598042171208, 0.006650963989687303, 0.09095563652414468, -0.08178223638453581, -0.24139571642210225, 0.4048260669956254, -0.010037870521867467, 0.20957836241371208, 0.09477764120205276, 0.045944901851696834, -0.01891304145101458, 0.015685278445392126, 0.04601746808878987, -0.15781049431150737, 0.11587143608935989, 0.2509278271670243, 0.04332418478236744, 0.3149677173745248, -0.3626413713209331, -0.18766030326725974, 0.18180467533473407, 0.15722279633477992, 0.04746999469446769, -0.0422547840411895, -0.28415070168651463, 0.09390754405514247, -0.11203055906169597, -0.22821589432761916, -0.04216515370869949, 0.01451304156592326, 0.07342062576583797, -0.31642943218861136, 0.11368784908113265, 0.10818168541957293, 0.0019589706038635585, -0.1442569932382133, -0.08402528711068895, 0.012377201237775866, 0.07925659204803166, 0.07611028141635019, 0.02962711092080891, 0.04210394786130036, -0.1287475716041128, -0.11874012204427872, 0.33937514732937296, -0.1302581617398368, -0.28679702195128604, 0.13903989466357855, -0.1629227523676931, -0.11656435676700165, 0.03240837716317225, 0.1604674405741295, 0.14553529808237667, -0.10228834478485008, 0.12970866504286777, -0.06849304777419855, 0.08315891424764789, 0.09927833134744075, 0.0402018571865835, 0.08105093030439268, 0.09398318011118399, 0.18706222470275186, 0.21287843109495308, -0.015297105167724846, -0.12297537669890575, -0.3563337373967853, -0.17831606780283996, -0.1830525367423111, 0.08856929975351499, -0.13163604828009884, -0.1979272478032902, 0.365548359425438, 0.10875577859781427, 0.21421283535047195, 0.07305793924681511, 0.21694969890391333, 0.17509689944094017, 0.02245639872478111, 0.0564412711619591, 0.2371669937706282, 0.15544429674158775, 0.11862855323312443, -0.15356607037416148, 0.022083603416479403, 0.1304735414379402] |
1,803.02972 | SLADS-Net: Supervised Learning Approach for Dynamic Sampling using Deep
Neural Networks | In scanning microscopy based imaging techniques, there is a need to develop
novel data acquisition schemes that can reduce the time for data acquisition
and minimize sample exposure to the probing radiation. Sparse sampling schemes
are ideally suited for such applications where the images can be reconstructed
from a sparse set of measurements. In particular, dynamic sparse sampling based
on supervised learning has shown promising results for practical applications.
However, a particular drawback of such methods is that it requires training
image sets with similar information content which may not always be available.
In this paper, we introduce a Supervised Learning Approach for Dynamic Sampling
(SLADS) algorithm that uses a deep neural network based training approach. We
call this algorithm SLADS- Net. We have performed simulated experiments for
dynamic sampling using SLADS-Net in which the training images either have
similar information content or completely different information content, when
compared to the testing images. We compare the performance across various
methods for training such as least- squares, support vector regression and deep
neural networks. From these results we observe that deep neural network based
training results in superior performance when the training and testing images
are not similar. We also discuss the development of a pre-trained SLADS-Net
that uses generic images for training. Here, the neural network parameters are
pre-trained so that users can directly apply SLADS-Net for imaging experiments.
| eess.SP | in scanning microscopy based imaging techniques there is a need to develop novel data acquisition schemes that can reduce the time for data acquisition and minimize sample exposure to the probing radiation sparse sampling schemes are ideally suited for such applications where the images can be reconstructed from a sparse set of measurements in particular dynamic sparse sampling based on supervised learning has shown promising results for practical applications however a particular drawback of such methods is that it requires training image sets with similar information content which may not always be available in this paper we introduce a supervised learning approach for dynamic sampling slads algorithm that uses a deep neural network based training approach we call this algorithm slads net we have performed simulated experiments for dynamic sampling using sladsnet in which the training images either have similar information content or completely different information content when compared to the testing images we compare the performance across various methods for training such as least squares support vector regression and deep neural networks from these results we observe that deep neural network based training results in superior performance when the training and testing images are not similar we also discuss the development of a pretrained sladsnet that uses generic images for training here the neural network parameters are pretrained so that users can directly apply sladsnet for imaging experiments | [['in', 'scanning', 'microscopy', 'based', 'imaging', 'techniques', 'there', 'is', 'a', 'need', 'to', 'develop', 'novel', 'data', 'acquisition', 'schemes', 'that', 'can', 'reduce', 'the', 'time', 'for', 'data', 'acquisition', 'and', 'minimize', 'sample', 'exposure', 'to', 'the', 'probing', 'radiation', 'sparse', 'sampling', 'schemes', 'are', 'ideally', 'suited', 'for', 'such', 'applications', 'where', 'the', 'images', 'can', 'be', 'reconstructed', 'from', 'a', 'sparse', 'set', 'of', 'measurements', 'in', 'particular', 'dynamic', 'sparse', 'sampling', 'based', 'on', 'supervised', 'learning', 'has', 'shown', 'promising', 'results', 'for', 'practical', 'applications', 'however', 'a', 'particular', 'drawback', 'of', 'such', 'methods', 'is', 'that', 'it', 'requires', 'training', 'image', 'sets', 'with', 'similar', 'information', 'content', 'which', 'may', 'not', 'always', 'be', 'available', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'supervised', 'learning', 'approach', 'for', 'dynamic', 'sampling', 'slads', 'algorithm', 'that', 'uses', 'a', 'deep', 'neural', 'network', 'based', 'training', 'approach', 'we', 'call', 'this', 'algorithm', 'slads', 'net', 'we', 'have', 'performed', 'simulated', 'experiments', 'for', 'dynamic', 'sampling', 'using', 'sladsnet', 'in', 'which', 'the', 'training', 'images', 'either', 'have', 'similar', 'information', 'content', 'or', 'completely', 'different', 'information', 'content', 'when', 'compared', 'to', 'the', 'testing', 'images', 'we', 'compare', 'the', 'performance', 'across', 'various', 'methods', 'for', 'training', 'such', 'as', 'least', 'squares', 'support', 'vector', 'regression', 'and', 'deep', 'neural', 'networks', 'from', 'these', 'results', 'we', 'observe', 'that', 'deep', 'neural', 'network', 'based', 'training', 'results', 'in', 'superior', 'performance', 'when', 'the', 'training', 'and', 'testing', 'images', 'are', 'not', 'similar', 'we', 'also', 'discuss', 'the', 'development', 'of', 'a', 'pretrained', 'sladsnet', 'that', 'uses', 'generic', 'images', 'for', 'training', 'here', 'the', 'neural', 'network', 'parameters', 'are', 'pretrained', 'so', 'that', 'users', 'can', 'directly', 'apply', 'sladsnet', 'for', 'imaging', 'experiments']] | [-0.0017229809001795785, 0.028072854558892517, -0.08566806815141674, 0.07978033610008552, -0.1251389855116313, -0.19654166324300015, 0.024443651623993413, 0.4847579492727807, -0.2722524608928694, -0.31062532961292305, 0.11930834920416021, -0.25080473010131366, -0.21695577208152017, 0.2264541462378975, -0.13352391533309585, 0.10409291672996168, 0.16203577186521875, 0.02167098403920513, -0.08541452224182339, -0.3058737379785497, 0.3006253328375665, 0.04010574373004637, 0.36377587923617405, -0.011763155483742403, 0.12954545345088248, 0.0022586923291882314, -0.03003056383565654, 0.02995325393993082, -0.0629983418132458, 0.13264749395583786, 0.34549175127507004, 0.23217542964647886, 0.3219898254122569, -0.4385121930185662, -0.2354236943159236, 0.1212277875757699, 0.16357992590185433, 0.12865511923987727, -0.0869334236185949, -0.2903628635289367, 0.1095316176624017, -0.11605464004378717, 0.04848784348707825, -0.17774652796655113, -0.07869979334480687, 0.021581821648940836, -0.3438277041120658, 0.021290834998080557, 0.025046042750251997, 0.06909826330791785, -0.05376730691722907, -0.11151545406949573, 0.04396761296058733, 0.1358037517738008, 0.001022297309459427, 0.050587989811330024, 0.11706214561025453, -0.16459490692570367, -0.14809338719376636, 0.33680074137338645, -0.05559537060432722, -0.2065863049707038, 0.19915647801737743, -0.02602888459917239, -0.16449997970004723, 0.12402725031225247, 0.2507296129674793, 0.12190901799591088, -0.1806147581925382, 0.00943560575721704, -0.04654456363425602, 0.17976580408918286, 0.04071071663847006, 0.019763514138229483, 0.1354781942926022, 0.26428720019920426, 0.038256072610063585, 0.12157190540057147, -0.1942669204405741, -0.019469315458625947, -0.20636786609953148, -0.10963960693575703, -0.24529742907862867, -0.01617178946972914, -0.09262656985140785, -0.13707299823870203, 0.354313668567183, 0.25527136976267395, 0.19925307247616902, 0.10808651448991537, 0.38133193069345045, 0.024161561199641322, 0.15851294834219634, 0.10739311232235624, 0.18021481548889445, 0.01866495519608064, 0.12023834226750586, -0.1391246878307142, 0.08258476391674617, 0.008831960941140244] |
1,803.02973 | On properties of a class of strong limits for supercritical
superprocesses | Suppose that $X=\{X_t, t\ge 0; \mathbb{P}_{\mu}\}$ is a supercritical
superprocess in a locally compact separable metric space $E$. Let $\phi_0$ be a
positive
eigenfunction corresponding to the first eigenvalue $\lambda_0$ of the
generator of the mean semigroup of $X$. Then
$M_t:=e^{-\lambda_0t}\langle\phi_0, X_t\rangle$ is a positive martingale. Let
$M_\infty$ be the limit of $M_t$. It is known that $M_\infty$ is non-degenerate
iff the $L\log L$ condition is satisfied. When the $L\log L$ condition may not
be satisfied, we recently proved in (arXiv:1708.04422) that there exist a
non-negative function $\gamma_t$ on $[0, \infty)$ and a non-degenerate random
variable $W$ such that for any finite nonzero Borel measure $\mu$ on $E$, $$
\lim_{t\to\infty}\gamma_t\langle \phi_0,X_t\rangle
=W,\qquad\mbox{a.s.-}\mathbb{P}_{\mu}. $$ In this paper, we mainly investigate
properties of $W$. We prove that $W$ has strictly positive density on
$(0,\infty)$. We also investigate the small value probability and tail
probability problems of $W$.
| math.PR | suppose that xx_t tge 0 mathbbp_mu is a supercritical superprocess in a locally compact separable metric space e let phi_0 be a positive eigenfunction corresponding to the first eigenvalue lambda_0 of the generator of the mean semigroup of x then m_telambda_0tlanglephi_0 x_trangle is a positive martingale let m_infty be the limit of m_t it is known that m_infty is nondegenerate iff the llog l condition is satisfied when the llog l condition may not be satisfied we recently proved in arxiv170804422 that there exist a nonnegative function gamma_t on 0 infty and a nondegenerate random variable w such that for any finite nonzero borel measure mu on e lim_ttoinftygamma_tlangle phi_0x_trangle wqquadmboxasmathbbp_mu in this paper we mainly investigate properties of w we prove that w has strictly positive density on 0infty we also investigate the small value probability and tail probability problems of w | [['suppose', 'that', 'xx_t', 'tge', '0', 'mathbbp_mu', 'is', 'a', 'supercritical', 'superprocess', 'in', 'a', 'locally', 'compact', 'separable', 'metric', 'space', 'e', 'let', 'phi_0', 'be', 'a', 'positive', 'eigenfunction', 'corresponding', 'to', 'the', 'first', 'eigenvalue', 'lambda_0', 'of', 'the', 'generator', 'of', 'the', 'mean', 'semigroup', 'of', 'x', 'then', 'm_telambda_0tlanglephi_0', 'x_trangle', 'is', 'a', 'positive', 'martingale', 'let', 'm_infty', 'be', 'the', 'limit', 'of', 'm_t', 'it', 'is', 'known', 'that', 'm_infty', 'is', 'nondegenerate', 'iff', 'the', 'llog', 'l', 'condition', 'is', 'satisfied', 'when', 'the', 'llog', 'l', 'condition', 'may', 'not', 'be', 'satisfied', 'we', 'recently', 'proved', 'in', 'arxiv170804422', 'that', 'there', 'exist', 'a', 'nonnegative', 'function', 'gamma_t', 'on', '0', 'infty', 'and', 'a', 'nondegenerate', 'random', 'variable', 'w', 'such', 'that', 'for', 'any', 'finite', 'nonzero', 'borel', 'measure', 'mu', 'on', 'e', 'lim_ttoinftygamma_tlangle', 'phi_0x_trangle', 'wqquadmboxasmathbbp_mu', 'in', 'this', 'paper', 'we', 'mainly', 'investigate', 'properties', 'of', 'w', 'we', 'prove', 'that', 'w', 'has', 'strictly', 'positive', 'density', 'on', '0infty', 'we', 'also', 'investigate', 'the', 'small', 'value', 'probability', 'and', 'tail', 'probability', 'problems', 'of', 'w']] | [-0.1760165914740196, 0.17465348477240816, -0.09071798972703897, 0.06318862873034375, -0.06631199536627552, -0.20215194919792406, 0.02932420285354049, 0.35263730784075975, -0.30188997355663644, -0.10570584807925633, 0.10558167222061324, -0.30483346751952256, -0.08121011819500122, 0.16291204870195827, -0.07310957986399205, 0.03270425787195563, 0.05936868577502179, 0.12024514542987746, -0.05555406297271541, -0.21076850220561028, 0.3591275773840501, -0.07802881566250194, 0.18626801887812622, 0.08261525867095584, 0.14420462683026752, -0.038789860006884065, 0.02904071907655601, 0.007449280523081535, -0.24583587823670408, 0.006428857889692605, 0.22050882525143833, 0.10030412610898977, 0.3241192979099107, -0.26623583267728396, -0.1503344441655289, 0.2816315097063032, 0.12787251127034044, -0.08916016685076221, 0.009864714050182842, -0.27674646350643495, 0.2086309497516575, -0.12004548673735538, -0.16884942923121862, -0.012030339550845542, 0.1489354954169125, 0.0119924975124045, -0.3780804663169177, 0.057035996291206904, 0.13935088006997087, -0.015875997997303732, -0.018990339517566193, -0.15334137562444827, -0.08387983725644159, 0.027019526649064242, 0.006205162820304288, 0.11875332485167242, 0.05332319524791772, -0.03030789404067408, -0.05549685101289928, 0.3210407172560855, -0.1283344365350467, -0.2836649446564652, 0.09966054921425933, -0.24694449019645523, -0.1375105240089941, 0.10014585835560069, 0.117024689647675, 0.16009176557163035, -0.06445028063092112, 0.2594247638871621, -0.11744332979781635, 0.14375031747291014, 0.07959970796521562, 0.006602075695311719, 0.11103252150852533, 0.06989984861812996, 0.1682440930379242, 0.08974727739522192, -0.002826782033513606, 0.019799674198330536, -0.39201839359300417, -0.1753044849445187, -0.2544164968651114, 0.22780109750437058, -0.09597169850204296, -0.17393029591979553, 0.2728241197458965, 0.05974781580726501, 0.21900103687832173, 0.12025452812413012, 0.16906397899843917, 0.21025045977286777, -0.036366911393413526, 0.10678625638073269, 0.10587433969642776, 0.17893014486749947, 0.021319168908725473, -0.15721321588910667, 0.058969452005070054, 0.11146269057347119] |
1,803.02974 | Optimal Portfolio Design for Statistical Arbitrage in Finance | In this paper, the optimal mean-reverting portfolio (MRP) design problem is
considered, which plays an important role for the statistical arbitrage (a.k.a.
pairs trading) strategy in financial markets. The target of the optimal MRP
design is to construct a portfolio from the underlying assets that can exhibit
a satisfactory mean reversion property and a desirable variance property. A
general problem formulation is proposed by considering these two targets and an
investment leverage constraint. To solve this problem, a successive convex
approximation method is used. The performance of the proposed model and
algorithms are verified by numerical simulations.
| q-fin.PM | in this paper the optimal meanreverting portfolio mrp design problem is considered which plays an important role for the statistical arbitrage aka pairs trading strategy in financial markets the target of the optimal mrp design is to construct a portfolio from the underlying assets that can exhibit a satisfactory mean reversion property and a desirable variance property a general problem formulation is proposed by considering these two targets and an investment leverage constraint to solve this problem a successive convex approximation method is used the performance of the proposed model and algorithms are verified by numerical simulations | [['in', 'this', 'paper', 'the', 'optimal', 'meanreverting', 'portfolio', 'mrp', 'design', 'problem', 'is', 'considered', 'which', 'plays', 'an', 'important', 'role', 'for', 'the', 'statistical', 'arbitrage', 'aka', 'pairs', 'trading', 'strategy', 'in', 'financial', 'markets', 'the', 'target', 'of', 'the', 'optimal', 'mrp', 'design', 'is', 'to', 'construct', 'a', 'portfolio', 'from', 'the', 'underlying', 'assets', 'that', 'can', 'exhibit', 'a', 'satisfactory', 'mean', 'reversion', 'property', 'and', 'a', 'desirable', 'variance', 'property', 'a', 'general', 'problem', 'formulation', 'is', 'proposed', 'by', 'considering', 'these', 'two', 'targets', 'and', 'an', 'investment', 'leverage', 'constraint', 'to', 'solve', 'this', 'problem', 'a', 'successive', 'convex', 'approximation', 'method', 'is', 'used', 'the', 'performance', 'of', 'the', 'proposed', 'model', 'and', 'algorithms', 'are', 'verified', 'by', 'numerical', 'simulations']] | [-0.08957639495966975, -0.01790210680247611, -0.11456823822821385, 0.1445259481462045, -0.08895314947615579, -0.1567231261449837, 0.06851240246047832, 0.4151675047103277, -0.32607112913248465, -0.2729102181865997, 0.14622688657104893, -0.24416072685847579, -0.20824946359414415, 0.1705620755254262, -0.1598881164412062, 0.09771070372044426, 0.06125161540454503, -0.03757084402034885, 0.011184332645066158, -0.28433640535978466, 0.2647050224993493, 0.09180722453453838, 0.3306363580614021, 0.020883172702466705, 0.1849900059517204, 0.009199470852876139, -0.011437405251235384, 0.051439138820644506, -0.11320950028754485, 0.1543908993456724, 0.3097795217571607, 0.15610417835510423, 0.40817410671680243, -0.39829497496338234, -0.16828904880844442, 0.14937003019275433, 0.07349996664801363, 0.05248921353384353, -0.04909176206139406, -0.20186077926749574, 0.05059275097818565, -0.16989657919393064, -0.10219868650832742, -0.06983923754587616, -0.03094080890788092, -0.013176804778079703, -0.37888958583557114, 0.03380579454344265, 0.06998531076788288, 0.0005542671598359635, -0.05817179930319568, -0.12556803616162235, 0.03597353791971643, 0.10469606647042308, 0.10549022463635187, -0.029649107817790864, 0.0961698075113146, -0.0832094073285992, -0.20446585670123166, 0.3976006509793788, -0.013079381567070779, -0.23706754510166103, 0.08449967432114266, -0.02468189752670293, -0.11606936188673928, 0.1441245148841714, 0.2143287196678599, 0.10106047674936731, -0.2200204925899653, 0.08910354825286387, -0.08889666270733494, 0.14790007371705063, 0.027423864883399502, -0.010623528859122013, 0.16121174043558115, 0.21315884450930603, 0.16581899667946026, 0.15829638285159142, -0.03459431853183766, -0.1694174846538256, -0.26690769178274365, -0.11955160158206277, -0.1782211223245147, 7.324253410561797e-05, -0.12975812753252614, -0.15303698055369339, 0.3651419203325184, 0.163758316715776, 0.08947170675568974, 0.09921506890359805, 0.29335593032775464, 0.1471357111262215, -0.03055533668033529, 0.0971408067967205, 0.20132093652170727, 0.04882793343078691, 0.090992616940789, -0.2342874124434959, 0.1647328859406341, 0.06241805876422789] |
1,803.02975 | Verifying nonlinear analog and mixed-signal circuits with inputs | We present a new technique for verifying nonlinear and hybrid models with
inputs. We observe that once an input signal is fixed, the sensitivity analysis
of the model can be computed much more precisely. Based on this result, we
propose a new simulation-driven verification algorithm and apply it to a suite
of nonlinear and hybrid models of CMOS digital circuits under different input
signals. The models are low-dimensional but with highly nonlinear ODEs, with
nearly hundreds of logarithmic and exponential terms. Some of our experiments
analyze the metastability of bistable circuits with very sensitive ODEs and
rigorously establish the connection between metastability recovery time and
sensitivity.
| cs.SY cs.FL | we present a new technique for verifying nonlinear and hybrid models with inputs we observe that once an input signal is fixed the sensitivity analysis of the model can be computed much more precisely based on this result we propose a new simulationdriven verification algorithm and apply it to a suite of nonlinear and hybrid models of cmos digital circuits under different input signals the models are lowdimensional but with highly nonlinear odes with nearly hundreds of logarithmic and exponential terms some of our experiments analyze the metastability of bistable circuits with very sensitive odes and rigorously establish the connection between metastability recovery time and sensitivity | [['we', 'present', 'a', 'new', 'technique', 'for', 'verifying', 'nonlinear', 'and', 'hybrid', 'models', 'with', 'inputs', 'we', 'observe', 'that', 'once', 'an', 'input', 'signal', 'is', 'fixed', 'the', 'sensitivity', 'analysis', 'of', 'the', 'model', 'can', 'be', 'computed', 'much', 'more', 'precisely', 'based', 'on', 'this', 'result', 'we', 'propose', 'a', 'new', 'simulationdriven', 'verification', 'algorithm', 'and', 'apply', 'it', 'to', 'a', 'suite', 'of', 'nonlinear', 'and', 'hybrid', 'models', 'of', 'cmos', 'digital', 'circuits', 'under', 'different', 'input', 'signals', 'the', 'models', 'are', 'lowdimensional', 'but', 'with', 'highly', 'nonlinear', 'odes', 'with', 'nearly', 'hundreds', 'of', 'logarithmic', 'and', 'exponential', 'terms', 'some', 'of', 'our', 'experiments', 'analyze', 'the', 'metastability', 'of', 'bistable', 'circuits', 'with', 'very', 'sensitive', 'odes', 'and', 'rigorously', 'establish', 'the', 'connection', 'between', 'metastability', 'recovery', 'time', 'and', 'sensitivity']] | [-0.08859211688900788, 0.06409178336520507, -0.08131456766980437, 0.04282954816304516, -0.05244719381400226, -0.1912148509148227, 0.029425481966101424, 0.36292815008112844, -0.27202031617316436, -0.33860143943566756, 0.13901088942492487, -0.2404028094452718, -0.21406933387416363, 0.24227243376113825, -0.026915582169269054, 0.11527584999237421, 0.06846246458062867, -0.009198584295106385, -0.07774081383502322, -0.23101024437730885, 0.2826570477424506, 0.03535836677611718, 0.26359564359360244, -0.013153320963094715, 0.13009908971956596, -0.043421439703483625, -0.00487677613273263, 0.003023140308148456, -0.11273666375728801, 0.12232876999989012, 0.23713222878815837, 0.13573874038081826, 0.26317908677254925, -0.4549113941677618, -0.1973396187894187, 0.13022362418529876, 0.09140814325271421, 0.14671052121425504, -0.07499959984893652, -0.2785422502542442, 0.11025392352208004, -0.12355340162362412, -0.07959455695389858, -0.15224066341541848, -0.028758858383264183, 0.04867556585736994, -0.28295848322680817, 0.04921911797433529, 0.06713468921897968, 0.03923961429259265, -0.02767245982057538, -0.06905937428972772, 0.011954795437390512, 0.08278729328622092, -0.015556586031002467, -0.01684695632495689, 0.08439695586907273, -0.12262464463513098, -0.1243954810823472, 0.34471691997264914, -0.09826245229199247, -0.20467551783570703, 0.2220033693395309, -0.1015086914236956, -0.12344690486525167, 0.10436056005188597, 0.22434457350645284, 0.1367801336422211, -0.1730841502661483, 0.03918797449090184, -0.004554388504299634, 0.24315795828017212, 0.02026801824982647, 0.051137553387374246, 0.15398114025021709, 0.24471084684361968, 0.06690451363980207, 0.17344707945462773, -0.07389625526288138, -0.09772933579823177, -0.29507257216686894, -0.11677565849122573, -0.11862225934230494, 0.016795451156487513, -0.11842369590364264, -0.1658421481151204, 0.42158662575244343, 0.1845529365203923, 0.2056530334125712, 0.12354242474385449, 0.3085396430578153, 0.1570462947985913, 0.05696656592717429, 0.04271890417987619, 0.2269593478009689, 0.12938011905072994, 0.09464230517997353, -0.1891433137671073, 0.06272744213643852, 0.012624343057637507] |
1,803.02976 | Semantical Equivalence of the Control Flow Graph and the Program
Dependence Graph | The program dependence graph (PDG) represents data and control dependence
between statements in a program. This paper presents an operational semantics
of program dependence graphs. Since PDGs exclude artificial order of statements
that resides in sequential programs, executions of PDGs are not unique.
However, we identified a class of PDGs that have unique final states of
executions, called deterministic PDGs. We prove that the operational semantics
of control flow graphs is equivalent to that of deterministic PDGs. The class
of deterministic PDGs properly include PDGs obtained from well-structured
programs. Thus, our operational semantics of PDGs is more general than that of
PDGs for well-structured programs, which are already established in literature.
| cs.PL | the program dependence graph pdg represents data and control dependence between statements in a program this paper presents an operational semantics of program dependence graphs since pdgs exclude artificial order of statements that resides in sequential programs executions of pdgs are not unique however we identified a class of pdgs that have unique final states of executions called deterministic pdgs we prove that the operational semantics of control flow graphs is equivalent to that of deterministic pdgs the class of deterministic pdgs properly include pdgs obtained from wellstructured programs thus our operational semantics of pdgs is more general than that of pdgs for wellstructured programs which are already established in literature | [['the', 'program', 'dependence', 'graph', 'pdg', 'represents', 'data', 'and', 'control', 'dependence', 'between', 'statements', 'in', 'a', 'program', 'this', 'paper', 'presents', 'an', 'operational', 'semantics', 'of', 'program', 'dependence', 'graphs', 'since', 'pdgs', 'exclude', 'artificial', 'order', 'of', 'statements', 'that', 'resides', 'in', 'sequential', 'programs', 'executions', 'of', 'pdgs', 'are', 'not', 'unique', 'however', 'we', 'identified', 'a', 'class', 'of', 'pdgs', 'that', 'have', 'unique', 'final', 'states', 'of', 'executions', 'called', 'deterministic', 'pdgs', 'we', 'prove', 'that', 'the', 'operational', 'semantics', 'of', 'control', 'flow', 'graphs', 'is', 'equivalent', 'to', 'that', 'of', 'deterministic', 'pdgs', 'the', 'class', 'of', 'deterministic', 'pdgs', 'properly', 'include', 'pdgs', 'obtained', 'from', 'wellstructured', 'programs', 'thus', 'our', 'operational', 'semantics', 'of', 'pdgs', 'is', 'more', 'general', 'than', 'that', 'of', 'pdgs', 'for', 'wellstructured', 'programs', 'which', 'are', 'already', 'established', 'in', 'literature']] | [-0.12224835731605119, 0.05274999584399084, -0.11938362746228892, 0.10604550153423974, -0.13898253840234903, -0.1595261354536355, 0.06414828604812994, 0.37404401521492114, -0.2699311231892254, -0.31436963849659033, 0.10925223448666165, -0.22806880682673272, -0.09514577121280872, 0.19686351953124678, -0.11004748735744674, 0.07586192775114968, 0.09827195376636007, -0.004722226411104202, -0.03269256476254144, -0.2379155046621711, 0.29968298549621225, -0.01418234860977611, 0.19362065100387946, 0.00971994764666568, 0.08785515427610392, 0.011499428022485058, -0.007147000676759325, 0.09130346203046674, -0.09716524746273444, 0.10546943299243697, 0.352786924228542, 0.2629277326408768, 0.2848468251392111, -0.3971570977555202, -0.1232454194519501, 0.11509815508684328, 0.06921663519565587, 0.10904598479717131, 0.01289819958260564, -0.2754700216926164, 0.09288077714626451, -0.13877247476757312, -0.03855174668930337, -0.09942679407561685, 0.0570690319999247, -0.01609010333960943, -0.23430065986666795, -0.04010570067325019, 0.15658078195846026, 0.09978751312135845, -0.013322785773591415, -0.11402509947882143, -0.0664832444655969, 0.0930713059565237, -0.010941838459657119, 0.001494264408425839, 0.09244728641299245, -0.07350249863061886, -0.22155500707627684, 0.3497378401508605, -0.03537616124421228, -0.14492437969379313, 0.1627269479328649, -0.10008813934148969, -0.23074002101228716, 0.15612538492827266, 0.1504586457541246, 0.11882158427557966, -0.20025091010003207, 0.10206083603452908, -0.11177854549961987, 0.21694577954340358, 0.048602659196534136, 0.08678579082144089, 0.1493994055970295, 0.17740728271504244, 0.10444706651331806, 0.17875552932136096, 0.06956502413461069, -0.12753166626039725, -0.33451333688991564, -0.1393085692732318, -0.10508731140142626, -0.01655010427419109, -0.026964757677355386, -0.21669909264472825, 0.3505794421962655, 0.18642019440193433, 0.11065841692726354, 0.17649424657632537, 0.26160366933893514, 0.08348362292226001, 0.09696921212011361, 0.11493018711497588, 0.18717729592242757, 0.10166142085516774, 0.11814839518964626, -0.15702834434918472, 0.19339935084477672, 0.030523875774396164] |
1,803.02977 | Accelerating a fluvial incision and landscape evolution model with
parallelism | Solving inverse problems and achieving statistical rigour in landscape
evolution models requires running many model realizations. Parallel computation
is necessary to achieve this in a reasonable time. However, no previous
algorithm is well-suited to leveraging modern parallelism. Here, I describe an
algorithm that can utilize the parallel potential of GPUs, many-core
processors, and SIMD instructions, in addition to working well in serial. The
new algorithm runs 43x faster (70s vs. 3,000s on a 10,000x10,000 input) than
the previous state of the art and exhibits sublinear scaling with input size. I
also identify methods for using multidirectional flow routing and quickly
eliminating landscape depressions and local minima. Tips for parallelization
and a step-by-step guide to achieving it are given to help others achieve good
performance with their own code. Complete, well-commented, easily adaptable
source code for all versions of the algorithm is available as a supplement and
on Github.
| cs.CE cs.DS | solving inverse problems and achieving statistical rigour in landscape evolution models requires running many model realizations parallel computation is necessary to achieve this in a reasonable time however no previous algorithm is wellsuited to leveraging modern parallelism here i describe an algorithm that can utilize the parallel potential of gpus manycore processors and simd instructions in addition to working well in serial the new algorithm runs 43x faster 70s vs 3000s on a 10000x10000 input than the previous state of the art and exhibits sublinear scaling with input size i also identify methods for using multidirectional flow routing and quickly eliminating landscape depressions and local minima tips for parallelization and a stepbystep guide to achieving it are given to help others achieve good performance with their own code complete wellcommented easily adaptable source code for all versions of the algorithm is available as a supplement and on github | [['solving', 'inverse', 'problems', 'and', 'achieving', 'statistical', 'rigour', 'in', 'landscape', 'evolution', 'models', 'requires', 'running', 'many', 'model', 'realizations', 'parallel', 'computation', 'is', 'necessary', 'to', 'achieve', 'this', 'in', 'a', 'reasonable', 'time', 'however', 'no', 'previous', 'algorithm', 'is', 'wellsuited', 'to', 'leveraging', 'modern', 'parallelism', 'here', 'i', 'describe', 'an', 'algorithm', 'that', 'can', 'utilize', 'the', 'parallel', 'potential', 'of', 'gpus', 'manycore', 'processors', 'and', 'simd', 'instructions', 'in', 'addition', 'to', 'working', 'well', 'in', 'serial', 'the', 'new', 'algorithm', 'runs', '43x', 'faster', '70s', 'vs', '3000s', 'on', 'a', '10000x10000', 'input', 'than', 'the', 'previous', 'state', 'of', 'the', 'art', 'and', 'exhibits', 'sublinear', 'scaling', 'with', 'input', 'size', 'i', 'also', 'identify', 'methods', 'for', 'using', 'multidirectional', 'flow', 'routing', 'and', 'quickly', 'eliminating', 'landscape', 'depressions', 'and', 'local', 'minima', 'tips', 'for', 'parallelization', 'and', 'a', 'stepbystep', 'guide', 'to', 'achieving', 'it', 'are', 'given', 'to', 'help', 'others', 'achieve', 'good', 'performance', 'with', 'their', 'own', 'code', 'complete', 'wellcommented', 'easily', 'adaptable', 'source', 'code', 'for', 'all', 'versions', 'of', 'the', 'algorithm', 'is', 'available', 'as', 'a', 'supplement', 'and', 'on', 'github']] | [-0.08545655133139317, 0.02371476852063004, -0.07850857356525197, 0.07273233492009747, -0.118892076631159, -0.21905360046495387, 0.04265327670383362, 0.44753461013719137, -0.26361195210899624, -0.3889098150186798, 0.09388864369585852, -0.223459642809708, -0.09920467225974108, 0.2512485461933602, -0.07166605814004501, 0.09317872083277068, 0.1297228426742209, 0.0021543001413953547, -0.06041089748032391, -0.3170972504513655, 0.19618345790251226, 0.1273763874469667, 0.2839980856832244, 0.009455239031223112, 0.0833200523515943, -0.022167440392963943, -0.03538428630907925, 0.0013117770427603552, -0.08166662780006716, 0.11672935322509939, 0.25422098570168006, 0.2071965674815864, 0.2749219813865616, -0.4603994171377461, -0.152558638163063, 0.06788405463048795, 0.16874666149105536, 0.12842740147963774, -0.03429091084894224, -0.207963920694136, 0.10195700778644912, -0.1196973574898985, -0.06474224021214814, -0.12565406412965235, -0.010009802895325685, 0.0337840990966414, -0.26932700425006295, 0.009919051804578211, 0.021880578664917463, 0.07474043220281601, -0.020560263972856156, -0.12599760764690282, 0.0481056750856568, 0.12126410978713206, -0.020655875590781927, 0.08986011891290038, 0.10836289177385798, -0.1407093777373547, -0.16865098889169544, 0.3818127639769089, -0.02462892089528903, -0.17635254604507516, 0.20779246832307455, -0.016596508231394146, -0.13430094427498832, 0.10004764034564854, 0.19532817089296625, 0.09381363010287386, -0.12619099953547627, 0.09358168785582252, 0.030219716346208132, 0.18940773757877855, 0.058721535272110686, 0.018609164747548906, 0.1414314094490568, 0.21321626160084745, 0.08165093450165563, 0.13324761528023446, -0.031699115693961985, -0.1361249747660746, -0.23933142324795528, -0.17220371694392747, -0.16445131045272202, -0.03745659332101544, -0.09539982574117975, -0.16716847729039233, 0.3862257612881815, 0.20287332581482878, 0.1603537968606973, 0.1119018900530891, 0.356598482669971, 0.037589953093295346, 0.12216710954188642, 0.20155427970948825, 0.12916775060766916, 0.0479053882493948, 0.1482299935693542, -0.204694360288709, 0.0696799934645291, 0.008434149361616254] |
1,803.02978 | Light curves of a shock-breakout material and a relativistic off-axis
jet from a Binary Neutron Star system | Binary neutron star mergers are believed to eject significant masses with a
diverse range of velocities. Once these ejected materials begin to be
decelerated by a homogeneous medium, relativistic electrons are mainly cooled
down by synchrotron radiation, generating a multiwavelength long-lived
afterglow. Analytic and numerical methods illustrate that the outermost matter,
the merger shock-breakout material, can be parametrized by power-law velocity
distributions $\propto \left(\beta_{\rm c}\Gamma \right)^{-\alpha_s}$.
Considering that the shock-breakout material is moving on-axis towards the
observer and the relativistic jet off-axis, we compute the light curves during
the relativistic and the lateral expansion phase. As a particular case, we
successfully describe the X-ray, optical and radio light curves alongside the
spectral energy distribution from the recently discovered gravitational-wave
transient GW170817, when the merger shock-breakout material moves with mildly
relativistic velocities near-Newtonian phase and the jet with relativistic
velocities. Future electromagnetic counterpart observations of this binary
system could be able to evaluate different properties of these light curves.
| astro-ph.HE | binary neutron star mergers are believed to eject significant masses with a diverse range of velocities once these ejected materials begin to be decelerated by a homogeneous medium relativistic electrons are mainly cooled down by synchrotron radiation generating a multiwavelength longlived afterglow analytic and numerical methods illustrate that the outermost matter the merger shockbreakout material can be parametrized by powerlaw velocity distributions propto leftbeta_rm cgamma rightalpha_s considering that the shockbreakout material is moving onaxis towards the observer and the relativistic jet offaxis we compute the light curves during the relativistic and the lateral expansion phase as a particular case we successfully describe the xray optical and radio light curves alongside the spectral energy distribution from the recently discovered gravitationalwave transient gw170817 when the merger shockbreakout material moves with mildly relativistic velocities nearnewtonian phase and the jet with relativistic velocities future electromagnetic counterpart observations of this binary system could be able to evaluate different properties of these light curves | [['binary', 'neutron', 'star', 'mergers', 'are', 'believed', 'to', 'eject', 'significant', 'masses', 'with', 'a', 'diverse', 'range', 'of', 'velocities', 'once', 'these', 'ejected', 'materials', 'begin', 'to', 'be', 'decelerated', 'by', 'a', 'homogeneous', 'medium', 'relativistic', 'electrons', 'are', 'mainly', 'cooled', 'down', 'by', 'synchrotron', 'radiation', 'generating', 'a', 'multiwavelength', 'longlived', 'afterglow', 'analytic', 'and', 'numerical', 'methods', 'illustrate', 'that', 'the', 'outermost', 'matter', 'the', 'merger', 'shockbreakout', 'material', 'can', 'be', 'parametrized', 'by', 'powerlaw', 'velocity', 'distributions', 'propto', 'leftbeta_rm', 'cgamma', 'rightalpha_s', 'considering', 'that', 'the', 'shockbreakout', 'material', 'is', 'moving', 'onaxis', 'towards', 'the', 'observer', 'and', 'the', 'relativistic', 'jet', 'offaxis', 'we', 'compute', 'the', 'light', 'curves', 'during', 'the', 'relativistic', 'and', 'the', 'lateral', 'expansion', 'phase', 'as', 'a', 'particular', 'case', 'we', 'successfully', 'describe', 'the', 'xray', 'optical', 'and', 'radio', 'light', 'curves', 'alongside', 'the', 'spectral', 'energy', 'distribution', 'from', 'the', 'recently', 'discovered', 'gravitationalwave', 'transient', 'gw170817', 'when', 'the', 'merger', 'shockbreakout', 'material', 'moves', 'with', 'mildly', 'relativistic', 'velocities', 'nearnewtonian', 'phase', 'and', 'the', 'jet', 'with', 'relativistic', 'velocities', 'future', 'electromagnetic', 'counterpart', 'observations', 'of', 'this', 'binary', 'system', 'could', 'be', 'able', 'to', 'evaluate', 'different', 'properties', 'of', 'these', 'light', 'curves']] | [-0.08035151905890915, 0.23504551616947977, -0.12538918830874946, 0.10529712885017356, -0.14906231915247778, -0.1127344228807957, -0.0008537211389686431, 0.44986593968445254, -0.23715291756896242, -0.3064950571350393, 0.04537296460250453, -0.29045004127847573, -0.012850261503650297, 0.24415522350539123, 0.01731173419885313, 0.006212916820039672, 0.10200878216644689, -0.0718897760590358, -0.1056140829087986, -0.18233342547225015, 0.2845442009308646, 0.10675192849650499, 0.1579891092234081, -0.039901131920276146, 0.07235484192628533, -0.03186209322584252, -0.023056373009157756, -0.014229295498901798, -0.10323434011708389, 0.005120471897985666, 0.19888032048099463, 0.07571253104946546, 0.16619120265146897, -0.42671948119757636, -0.28129349576549667, 0.0730732086910716, 0.16423269227267273, 0.08386207570532156, -0.10180366905631437, -0.2995427349492186, 0.015197706729128596, -0.2578202241280627, -0.22786792763959496, 0.011371797978156998, 0.02176182206960455, 0.09366425756485232, -0.1737255258906272, 0.0894105079488532, 0.0042780235955198745, -0.020046383131205315, -0.09111984880761273, -0.0241602455738992, -0.0572438562589307, 0.0030168998349953684, 0.08865378052521977, 0.0831601608995228, 0.1833031786267736, -0.13573700737225966, -0.04899591694796278, 0.4378418081229733, -0.0405106354587441, -0.018896507753731473, 0.17758156262458333, -0.22104784924416773, -0.09631800222541055, 0.2334590343195164, 0.200673768603273, 0.11980243515253307, -0.16902951182574108, -0.03638839228566916, 0.00142940194496224, 0.14356143187295886, 0.06851917467861166, 0.03238395726788909, 0.3524569161236286, 0.09346082086539677, -0.07744234192575658, 0.11759591831134693, -0.19805171662911533, -0.005428681504957738, -0.27065818692227045, -0.10170149445653923, -0.14691629229984696, 0.10246787057408402, -0.1365957750339857, -0.0961711606093412, 0.3599809936247766, 0.0736067934817965, 0.1601944203999254, 0.001122409890916559, 0.3245721550057492, 0.1066143358479284, 0.022710198494455505, 0.1566088309000817, 0.35660444279351544, 0.16686225992842435, 0.11234816089572926, -0.23390143662691115, 0.06551034118859998, 0.02858675538952793] |
1,803.02979 | Routing on the Visibility Graph | We consider the problem of routing on a network in the presence of line
segment constraints (i.e., obstacles that edges in our network are not allowed
to cross). Let $P$ be a set of $n$ points in the plane and let $S$ be a set of
non-crossing line segments whose endpoints are in $P$. We present two
deterministic 1-local $O(1)$-memory routing algorithms that are guaranteed to
find a path of at most linear size between any pair of vertices of the
\emph{visibility graph} of $P$ with respect to a set of constraints $S$ (i.e.,
the algorithms never look beyond the direct neighbours of the current location
and store only a constant amount of additional information). Contrary to {\em
all} existing deterministic local routing algorithms, our routing algorithms do
not route on a plane subgraph of the visibility graph. Additionally, we provide
lower bounds on the routing ratio of any deterministic local routing algorithm
on the visibility graph.
| cs.CG | we consider the problem of routing on a network in the presence of line segment constraints ie obstacles that edges in our network are not allowed to cross let p be a set of n points in the plane and let s be a set of noncrossing line segments whose endpoints are in p we present two deterministic 1local o1memory routing algorithms that are guaranteed to find a path of at most linear size between any pair of vertices of the emphvisibility graph of p with respect to a set of constraints s ie the algorithms never look beyond the direct neighbours of the current location and store only a constant amount of additional information contrary to em all existing deterministic local routing algorithms our routing algorithms do not route on a plane subgraph of the visibility graph additionally we provide lower bounds on the routing ratio of any deterministic local routing algorithm on the visibility graph | [['we', 'consider', 'the', 'problem', 'of', 'routing', 'on', 'a', 'network', 'in', 'the', 'presence', 'of', 'line', 'segment', 'constraints', 'ie', 'obstacles', 'that', 'edges', 'in', 'our', 'network', 'are', 'not', 'allowed', 'to', 'cross', 'let', 'p', 'be', 'a', 'set', 'of', 'n', 'points', 'in', 'the', 'plane', 'and', 'let', 's', 'be', 'a', 'set', 'of', 'noncrossing', 'line', 'segments', 'whose', 'endpoints', 'are', 'in', 'p', 'we', 'present', 'two', 'deterministic', '1local', 'o1memory', 'routing', 'algorithms', 'that', 'are', 'guaranteed', 'to', 'find', 'a', 'path', 'of', 'at', 'most', 'linear', 'size', 'between', 'any', 'pair', 'of', 'vertices', 'of', 'the', 'emphvisibility', 'graph', 'of', 'p', 'with', 'respect', 'to', 'a', 'set', 'of', 'constraints', 's', 'ie', 'the', 'algorithms', 'never', 'look', 'beyond', 'the', 'direct', 'neighbours', 'of', 'the', 'current', 'location', 'and', 'store', 'only', 'a', 'constant', 'amount', 'of', 'additional', 'information', 'contrary', 'to', 'em', 'all', 'existing', 'deterministic', 'local', 'routing', 'algorithms', 'our', 'routing', 'algorithms', 'do', 'not', 'route', 'on', 'a', 'plane', 'subgraph', 'of', 'the', 'visibility', 'graph', 'additionally', 'we', 'provide', 'lower', 'bounds', 'on', 'the', 'routing', 'ratio', 'of', 'any', 'deterministic', 'local', 'routing', 'algorithm', 'on', 'the', 'visibility', 'graph']] | [-0.21369713601104826, 0.04638459516736942, -0.04581352951339422, -0.003525802243250207, -0.10237059961759652, -0.16886257336367494, 0.14239020468234323, 0.4210460903123021, -0.27215483322372447, -0.3103636978212774, 0.06426676189920937, -0.29587251344361365, -0.09469984237027045, 0.14216162660830797, -0.05719986002599725, 0.05233557642070362, 0.08492581562425655, 0.10103834383297884, -0.003294324290413314, -0.2635252767267491, 0.2924181784530027, -0.021483844405828185, 0.22677576193848673, 0.05397594841615034, 0.05576789997613583, 0.03622019553119735, -0.02158653601192129, 0.08205290587965208, -0.14858189776723754, 0.11039038134353737, 0.23565874216206467, 0.1916827607768564, 0.2374068386763191, -0.4353382808562273, -0.1742145746635894, 0.22904613912881663, 0.1450750604062938, 0.08852355873051028, 0.03813581841472441, -0.2516046624156073, 0.13936937739027855, -0.08026957171610914, -0.04260305754126957, 0.023887417076203305, 0.056736803658378236, 0.04377988968581821, -0.2702907491326093, -0.048159507798771255, 0.052106367179359764, 0.00825954008495244, 0.014827417988831608, -0.11841382582086879, -0.0372603719901795, 0.09630170765703018, -0.053960449923089564, 0.07107622119320485, 0.10369148496866752, -0.10742595139592408, -0.20276149860225046, 0.39082071931364065, -0.008763578880088737, -0.1980277913598678, 0.1358996055638179, -0.09789278861791946, -0.13554176037462476, 0.14923914435964364, 0.2010726403319635, 0.13192275943210682, -0.12196898727844922, 0.09961639312379515, -0.08153080026834057, 0.15220529665179455, 0.07371929848196511, 0.04628755870119979, 0.15061817655343754, 0.12507629360763345, 0.20256303009750226, 0.09642668110870709, -0.06212967808227031, -0.06055671429166045, -0.31400756734924823, -0.11127736631971903, -0.20954422605110523, 0.019348893246131364, -0.15144795076570844, -0.2012253203063618, 0.366657920086231, 0.1493677680965704, 0.262803695931768, 0.11267749988473952, 0.31456315191462636, 0.05701520680313712, 0.03365225647874654, 0.18445403306768873, 0.16869718016674504, 0.06253077196052824, 0.0298449012140433, -0.19114706955121782, 0.1255441706803723, 0.09271424195060554] |
1,803.0298 | Remarks on semiclassical wavefront set | The essential support of the symbol of a semiclassical pseudodifferentail
operator is characterized by semiclassical wavefront sets of distributions. The
proof employs a coherent state whose center in phase space is dependent on
Planck's constant.
| math.AP | the essential support of the symbol of a semiclassical pseudodifferentail operator is characterized by semiclassical wavefront sets of distributions the proof employs a coherent state whose center in phase space is dependent on plancks constant | [['the', 'essential', 'support', 'of', 'the', 'symbol', 'of', 'a', 'semiclassical', 'pseudodifferentail', 'operator', 'is', 'characterized', 'by', 'semiclassical', 'wavefront', 'sets', 'of', 'distributions', 'the', 'proof', 'employs', 'a', 'coherent', 'state', 'whose', 'center', 'in', 'phase', 'space', 'is', 'dependent', 'on', 'plancks', 'constant']] | [-0.17828862807329962, 0.19624229463036447, -0.13431351226480567, 0.047347636379794604, -0.06130428486229742, -0.09478059485006858, 0.06490334252457079, 0.3143950825118843, -0.2511138898484847, -0.17061505870729246, 0.09992765569169183, -0.2451446174424799, -0.10669698510045077, 0.19718153172117822, -0.0967809638583704, 0.08335565698935705, 0.04060282919775037, 0.11088813994737233, -0.04890622067100862, -0.14108473621308804, 0.435564724399763, 0.08665492692414452, 0.27744751157896486, -0.008611369768486303, 0.17749283418935888, 0.06475192433058777, -0.06079114816041992, -0.03358434484535417, -0.09544618498972234, 0.13062637790982776, 0.204243882367497, 0.09448783405070357, 0.2481861471554593, -0.3800306748598814, -0.2064550955341581, 0.05360169248545871, 0.1473873015775633, 0.09099820771199815, 0.009744683468906098, -0.31247593856909694, 0.039520000080194545, -0.1077825140536708, -0.1628843713003923, -0.06034301845904659, 0.018077598528607804, 0.010658078991314945, -0.2605279680231915, 0.07355452301528524, 0.06520426186376854, 0.038882043815272695, -0.10651869362439303, -0.06985392766621183, 0.0020449934047920737, 0.07330516276381198, -0.055100045454524016, 0.08328190521912321, 0.10947443783173666, -0.043927947826245255, -0.11110132343738395, 0.3523521849009044, -0.07832367290907047, -0.21516312823137818, 0.05112202870933449, -0.18733657447634922, -0.04059710467289038, 0.15247203300104423, 0.07036478685982087, 0.12639387343626687, -0.07702116627136574, 0.19367810640045824, 0.002552691148594022, 0.1905864947475493, 0.0601504754877704, 0.09607662342707901, 0.19015024344929876, 0.15081177405355609, 0.1172817415859112, 0.10715172735645491, -0.054397766224985176, -0.15574581436265042, -0.38586680415798635, -0.13156149043318102, -0.30861362149281535, 0.05800272466833977, -0.11050497507676482, -0.2424799861276851, 0.4001219854279257, 0.03641849655575831, 0.20727372358840726, -0.0005345438497469706, 0.2917326552902951, 0.18409965755691862, 0.03508007339448394, 0.049817187903339374, 0.21728142339955359, 0.1902039551299394, 0.09118119738174274, -0.2134945922640755, 0.056294425486532206, 0.13406119605197625] |
1,803.02981 | The Role of Galaxies and AGN in Reionising the IGM - I: Keck
Spectroscopy of 5 < z < 7 Galaxies in the QSO Field J1148+5251 | We introduce a new method for determining the influence of galaxies and
active galactic nuclei (AGN) on the physical state of the intergalactic medium
(IGM) at high redshift and illustrate its potential via a first application to
the field of the $z=6.42$ QSO J1148+5251. By correlating the spatial positions
of spectroscopically-confirmed Lyman break galaxies (LBGs) with fluctuations in
the Lyman alpha forest seen in the high signal-to-noise spectrum of a
background QSO, we provide a statistical measure of the typical escape fraction
of Lyman continuum photons close to the end of cosmic reionisation. Here we use
Keck DEIMOS spectroscopy to locate 7 colour-selected LBGs in the redshift range
$5.3\lesssim z\lesssim 6.4$ and confirm a faint $z=5.701$ AGN. We then examine
the spatial correlation between this sample and Ly$\alpha$/Ly$\beta$
transmission fluctuations in a Keck ESI spectrum of the QSO. Interpreting the
statistical HI proximity effect as arising from faint galaxies clustered around
the detected LBGs, we translate the observed mean Ly$\alpha$ transmitted flux
around an average detected LBG into a constraint on the mean escape fraction
$\langle f_{\rm esc}\rangle\geq0.08$ at $z\simeq6$. We also report evidence of
the individual transverse HI proximity effect of a $z=6.177$ luminous LBG via a
Ly$\beta$ transmission spike and two broad Ly$\alpha$ transmission spikes
around the $z=5.701$ AGN. We discuss the possible origin of such associations
which suggest that while faint galaxies are primarily driving reionisation,
luminous galaxies and AGN may provide important contributions to the UV
background or thermal fluctuations of the IGM at $z\simeq6$. Although a limited
sample, our results demonstrate the potential of making progress using this
method in resolving one of the most challenging aspects of the contribution of
galaxies and AGN to cosmic reionisation.
| astro-ph.GA astro-ph.CO | we introduce a new method for determining the influence of galaxies and active galactic nuclei agn on the physical state of the intergalactic medium igm at high redshift and illustrate its potential via a first application to the field of the z642 qso j11485251 by correlating the spatial positions of spectroscopicallyconfirmed lyman break galaxies lbgs with fluctuations in the lyman alpha forest seen in the high signaltonoise spectrum of a background qso we provide a statistical measure of the typical escape fraction of lyman continuum photons close to the end of cosmic reionisation here we use keck deimos spectroscopy to locate 7 colourselected lbgs in the redshift range 53lesssim zlesssim 64 and confirm a faint z5701 agn we then examine the spatial correlation between this sample and lyalphalybeta transmission fluctuations in a keck esi spectrum of the qso interpreting the statistical hi proximity effect as arising from faint galaxies clustered around the detected lbgs we translate the observed mean lyalpha transmitted flux around an average detected lbg into a constraint on the mean escape fraction langle f_rm escranglegeq008 at zsimeq6 we also report evidence of the individual transverse hi proximity effect of a z6177 luminous lbg via a lybeta transmission spike and two broad lyalpha transmission spikes around the z5701 agn we discuss the possible origin of such associations which suggest that while faint galaxies are primarily driving reionisation luminous galaxies and agn may provide important contributions to the uv background or thermal fluctuations of the igm at zsimeq6 although a limited sample our results demonstrate the potential of making progress using this method in resolving one of the most challenging aspects of the contribution of galaxies and agn to cosmic reionisation | [['we', 'introduce', 'a', 'new', 'method', 'for', 'determining', 'the', 'influence', 'of', 'galaxies', 'and', 'active', 'galactic', 'nuclei', 'agn', 'on', 'the', 'physical', 'state', 'of', 'the', 'intergalactic', 'medium', 'igm', 'at', 'high', 'redshift', 'and', 'illustrate', 'its', 'potential', 'via', 'a', 'first', 'application', 'to', 'the', 'field', 'of', 'the', 'z642', 'qso', 'j11485251', 'by', 'correlating', 'the', 'spatial', 'positions', 'of', 'spectroscopicallyconfirmed', 'lyman', 'break', 'galaxies', 'lbgs', 'with', 'fluctuations', 'in', 'the', 'lyman', 'alpha', 'forest', 'seen', 'in', 'the', 'high', 'signaltonoise', 'spectrum', 'of', 'a', 'background', 'qso', 'we', 'provide', 'a', 'statistical', 'measure', 'of', 'the', 'typical', 'escape', 'fraction', 'of', 'lyman', 'continuum', 'photons', 'close', 'to', 'the', 'end', 'of', 'cosmic', 'reionisation', 'here', 'we', 'use', 'keck', 'deimos', 'spectroscopy', 'to', 'locate', '7', 'colourselected', 'lbgs', 'in', 'the', 'redshift', 'range', '53lesssim', 'zlesssim', '64', 'and', 'confirm', 'a', 'faint', 'z5701', 'agn', 'we', 'then', 'examine', 'the', 'spatial', 'correlation', 'between', 'this', 'sample', 'and', 'lyalphalybeta', 'transmission', 'fluctuations', 'in', 'a', 'keck', 'esi', 'spectrum', 'of', 'the', 'qso', 'interpreting', 'the', 'statistical', 'hi', 'proximity', 'effect', 'as', 'arising', 'from', 'faint', 'galaxies', 'clustered', 'around', 'the', 'detected', 'lbgs', 'we', 'translate', 'the', 'observed', 'mean', 'lyalpha', 'transmitted', 'flux', 'around', 'an', 'average', 'detected', 'lbg', 'into', 'a', 'constraint', 'on', 'the', 'mean', 'escape', 'fraction', 'langle', 'f_rm', 'escranglegeq008', 'at', 'zsimeq6', 'we', 'also', 'report', 'evidence', 'of', 'the', 'individual', 'transverse', 'hi', 'proximity', 'effect', 'of', 'a', 'z6177', 'luminous', 'lbg', 'via', 'a', 'lybeta', 'transmission', 'spike', 'and', 'two', 'broad', 'lyalpha', 'transmission', 'spikes', 'around', 'the', 'z5701', 'agn', 'we', 'discuss', 'the', 'possible', 'origin', 'of', 'such', 'associations', 'which', 'suggest', 'that', 'while', 'faint', 'galaxies', 'are', 'primarily', 'driving', 'reionisation', 'luminous', 'galaxies', 'and', 'agn', 'may', 'provide', 'important', 'contributions', 'to', 'the', 'uv', 'background', 'or', 'thermal', 'fluctuations', 'of', 'the', 'igm', 'at', 'zsimeq6', 'although', 'a', 'limited', 'sample', 'our', 'results', 'demonstrate', 'the', 'potential', 'of', 'making', 'progress', 'using', 'this', 'method', 'in', 'resolving', 'one', 'of', 'the', 'most', 'challenging', 'aspects', 'of', 'the', 'contribution', 'of', 'galaxies', 'and', 'agn', 'to', 'cosmic', 'reionisation']] | [-0.04365583478947194, 0.0855682439810957, -0.04178382558848991, 0.12394160473137583, -0.09125198586927963, -0.059744244886878274, 0.07440483370511743, 0.4530542643357485, -0.10756539139730203, -0.3243585261364975, -0.004902366239876765, -0.3452518963345767, -0.026977989160067432, 0.15486110688313998, 0.025423405271709394, -0.02901759293432169, -0.015086294115187002, -0.1281324440101918, 0.022233753847038133, -0.3038534654854101, 0.30426183306369997, 0.13015405704613628, 0.20260030477617058, -0.01317884788566037, 0.12897782013684322, -0.08362631233146797, -0.14093408887089642, -0.019354232132606317, -0.15250005387875612, 0.023418599295863606, 0.25777752133210724, 0.1400358142030328, 0.2878756288563068, -0.3168124873659196, -0.214009175782297, 0.11942722827418024, 0.2414309719984255, 0.07446819211949766, -0.07922869264013689, -0.3087635652535336, 0.03598313171577065, -0.12863043655510253, -0.14357785808531037, 0.09356081230054855, -0.0144103748588537, 0.032640444563444546, -0.18132985085047218, 0.15937182671776703, -0.016503239947367822, 0.10785471484912323, -0.07470094465309357, -0.0514086638089767, -0.07226310115532836, 0.07249240081552215, 0.0004918655441125808, 0.03729304529327562, 0.23132856854738582, -0.2001744179266912, -0.010196280521332262, 0.4029844453497807, -0.06729026513665054, 0.04819737846075493, 0.18514651609032032, -0.23621906535464612, -0.2149906780223811, 0.17048786023282025, 0.2009582494211968, 0.08706924382654785, -0.11948458120791705, -0.006367728440048986, 0.006716434026829602, 0.2531537903793869, -0.0045591699798332545, 0.10418685150605085, 0.3176029566515721, 0.06717023950840081, 0.05022241067332939, 0.11638802591297735, -0.25718657220654956, 0.05516959612139262, -0.2579022828138195, -0.10124836325063791, -0.14662170187075915, 0.14408137571200685, -0.15079812746372498, -0.12294471540088203, 0.35880205316287517, 0.1752354631234895, 0.25944222291319596, 0.10933031660499595, 0.33682535153339593, 0.11105495487110326, 0.04996942181017465, 0.0577368916765474, 0.3241609841717965, 0.16751898533415843, 0.06474006630340338, -0.25985097547317265, 0.0312540737301824, -0.002058053895619291] |
1,803.02982 | Beyond perturbation 2: asymptotics and Beilinson-Drinfeld Grassmannians
in differential geometry | We prove that for any k greater or equal to 2, given a smooth compact
k-dimensional manifold and a multiplicative k-1-gerbe on a Lie group, together
with an integrable connection, there is a line bundle on the corresponding
Beilinson-Drinfeld Grassmannian having the factorization property. We show that
taking global sections of this line bundle we obtain a factorization algebra.
| math.DG math.RT | we prove that for any k greater or equal to 2 given a smooth compact kdimensional manifold and a multiplicative k1gerbe on a lie group together with an integrable connection there is a line bundle on the corresponding beilinsondrinfeld grassmannian having the factorization property we show that taking global sections of this line bundle we obtain a factorization algebra | [['we', 'prove', 'that', 'for', 'any', 'k', 'greater', 'or', 'equal', 'to', '2', 'given', 'a', 'smooth', 'compact', 'kdimensional', 'manifold', 'and', 'a', 'multiplicative', 'k1gerbe', 'on', 'a', 'lie', 'group', 'together', 'with', 'an', 'integrable', 'connection', 'there', 'is', 'a', 'line', 'bundle', 'on', 'the', 'corresponding', 'beilinsondrinfeld', 'grassmannian', 'having', 'the', 'factorization', 'property', 'we', 'show', 'that', 'taking', 'global', 'sections', 'of', 'this', 'line', 'bundle', 'we', 'obtain', 'a', 'factorization', 'algebra']] | [-0.2005298153039646, 0.016436661850783477, -0.09575422554565914, 0.048756665582286904, -0.12635660674904697, -0.15451671524326607, 0.0001833699081606906, 0.43109298079949, -0.2633160439095107, -0.13029764338942437, 0.11363941537826483, -0.23834676838255134, -0.15053344792927262, 0.13920112043731556, -0.08817628131986692, -0.04811189744364599, 0.06925986049664688, 0.13315640507137466, -0.15262534077568302, -0.23037018275675203, 0.45131139386573743, -0.030233611449085433, 0.20212921986741753, 0.054962571300887345, 0.22232607772959204, 0.01527214293360132, -0.0015850134458842463, 0.025669919656075794, -0.12818035151902787, 0.14366158879972224, 0.2563061897225421, 0.08993941856596362, 0.19860952439846408, -0.3577280043592227, -0.14286491438617993, 0.23211111104244303, 0.12991171989365127, 0.0012993324098402057, -0.010979124886818743, -0.24826951157943955, 0.167128725563465, -0.1314874561021811, -0.15461514591528425, -0.05088432253627428, 0.0835767034120087, -0.050904157892640294, -0.26053952416083936, -0.06981095299124718, 0.11994595726116977, 0.10960604632594462, -0.07579651502250083, -0.12034557133527665, -0.034377590383820496, 0.04283744319550822, -0.04523377233297275, 0.11135659580407985, 0.11336490900480542, -0.05023467981112029, -0.1326270656808729, 0.368663779813154, -0.07602338852553532, -0.27181104085697183, 0.1156482719896554, -0.1453115841421973, -0.180972458569911, 0.1754781953862001, 0.13146584585373258, 0.10288375995025553, 0.007837914363962823, 0.152376634348786, -0.15855158454385296, 0.12106464647463169, 0.04222440754930521, -0.04299307465232138, 0.12926550790795993, 0.11327237091508918, 0.13744620799793508, 0.06526088299518772, -0.011038904063251063, -0.06277900124932158, -0.3743932634303025, -0.23389929809190077, -0.11273346928847504, 0.20899725873986708, -0.14539674772245706, -0.16806104503058153, 0.35409580800553847, 0.017426898333661515, 0.32195400947640684, 0.15822073468007147, 0.2401565344169222, 0.13436248299167974, 0.08551276854143061, 0.10271595120590565, 0.13700154940758286, 0.22455550718988324, -0.031226834964713658, -0.1165248255911765, -0.06461457623136711, 0.15743154213474742] |
1,803.02983 | A framework with updateable joint images re-ranking for Person
Re-identification | Person re-identification plays an important role in realistic video
surveillance with increasing demand for public safety. In this paper, we
propose a novel framework with rules of updating images for person
re-identification in real-world surveillance system. First, Image Pool is
generated by using mean-shift tracking method to automatically select video
frame fragments of the target person. Second, features extracted from Image
Pool by convolutional network work together to re-rank original ranking list of
the main image and matching results will be generated. In addition, updating
rules are designed for replacing images in Image Pool when a new image
satiating with our updating critical formula in video system. These rules fall
into two categories: if the new image is from the same camera as the previous
updated image, it will replace one of assist images; otherwise, it will replace
the main image directly. Experiments are conduced on Market-1501, iLIDS-VID and
PRID-2011 and our ITSD datasets to validate that our framework outperforms on
rank-1 accuracy and mAP for person re-identification. Furthermore, the update
ability of our framework provides consistently remarkable accuracy rate in
real-world surveillance system.
| cs.CV | person reidentification plays an important role in realistic video surveillance with increasing demand for public safety in this paper we propose a novel framework with rules of updating images for person reidentification in realworld surveillance system first image pool is generated by using meanshift tracking method to automatically select video frame fragments of the target person second features extracted from image pool by convolutional network work together to rerank original ranking list of the main image and matching results will be generated in addition updating rules are designed for replacing images in image pool when a new image satiating with our updating critical formula in video system these rules fall into two categories if the new image is from the same camera as the previous updated image it will replace one of assist images otherwise it will replace the main image directly experiments are conduced on market1501 ilidsvid and prid2011 and our itsd datasets to validate that our framework outperforms on rank1 accuracy and map for person reidentification furthermore the update ability of our framework provides consistently remarkable accuracy rate in realworld surveillance system | [['person', 'reidentification', 'plays', 'an', 'important', 'role', 'in', 'realistic', 'video', 'surveillance', 'with', 'increasing', 'demand', 'for', 'public', 'safety', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'framework', 'with', 'rules', 'of', 'updating', 'images', 'for', 'person', 'reidentification', 'in', 'realworld', 'surveillance', 'system', 'first', 'image', 'pool', 'is', 'generated', 'by', 'using', 'meanshift', 'tracking', 'method', 'to', 'automatically', 'select', 'video', 'frame', 'fragments', 'of', 'the', 'target', 'person', 'second', 'features', 'extracted', 'from', 'image', 'pool', 'by', 'convolutional', 'network', 'work', 'together', 'to', 'rerank', 'original', 'ranking', 'list', 'of', 'the', 'main', 'image', 'and', 'matching', 'results', 'will', 'be', 'generated', 'in', 'addition', 'updating', 'rules', 'are', 'designed', 'for', 'replacing', 'images', 'in', 'image', 'pool', 'when', 'a', 'new', 'image', 'satiating', 'with', 'our', 'updating', 'critical', 'formula', 'in', 'video', 'system', 'these', 'rules', 'fall', 'into', 'two', 'categories', 'if', 'the', 'new', 'image', 'is', 'from', 'the', 'same', 'camera', 'as', 'the', 'previous', 'updated', 'image', 'it', 'will', 'replace', 'one', 'of', 'assist', 'images', 'otherwise', 'it', 'will', 'replace', 'the', 'main', 'image', 'directly', 'experiments', 'are', 'conduced', 'on', 'market1501', 'ilidsvid', 'and', 'prid2011', 'and', 'our', 'itsd', 'datasets', 'to', 'validate', 'that', 'our', 'framework', 'outperforms', 'on', 'rank1', 'accuracy', 'and', 'map', 'for', 'person', 'reidentification', 'furthermore', 'the', 'update', 'ability', 'of', 'our', 'framework', 'provides', 'consistently', 'remarkable', 'accuracy', 'rate', 'in', 'realworld', 'surveillance', 'system']] | [-0.019488781566506477, -0.049095297855843795, -0.07598086092768207, 0.016103256184858486, -0.08932773823911262, -0.1895933428812506, 0.022399361143630652, 0.45570264129827803, -0.2295092234751312, -0.3481200093219241, 0.09310905509538805, -0.30725371035245747, -0.16018963473654546, 0.19850351191944554, -0.20771806992099182, 0.07761996938235505, 0.18362465844512663, 0.0628899155084842, 0.009613875222934798, -0.33852312952832697, 0.31890368490264964, 0.023254269334886755, 0.34010632141687713, 0.01901304616802628, 0.1285948075282459, 0.00898498071198976, -0.08662542352353089, -0.012225838749705313, -0.021262342585092422, 0.14902467973489356, 0.3397338564794224, 0.24168099554071387, 0.29718198214790653, -0.39150086401419326, -0.18751995819032316, 0.053570685005020144, 0.13711884031891003, 0.10587699052400869, -0.07760117937948882, -0.4050372252291949, 0.1268665767249211, -0.16968068978646872, 0.02637677320668085, -0.13123882051229804, -0.016872186723528533, -0.025892060155376463, -0.3121941974488916, 0.018303237685288947, 0.03613614971278706, 0.04756748382959024, -0.07893019318734142, -0.10543548009053876, 0.026259949419309724, 0.236942430873239, 0.03845691780756729, 0.08593906421255279, 0.1725656371416555, -0.2198379256616725, -0.11087729442470635, 0.4036159644947275, -0.0689854454799238, -0.17284838240696015, 0.15287792126924454, -0.02409988868428947, -0.15345772005909297, 0.12264789650498142, 0.2172469474774386, 0.1354503389025762, -0.1856217622328556, -0.038437298395425326, -0.11429495671201129, 0.18521592643234755, 0.08033630878992051, -0.037905601517215455, 0.2087569713623232, 0.23968692184752108, 0.052466646988510286, 0.14579934287742088, -0.1627539894057458, -0.06544882136558254, -0.23093010309653786, -0.10605913197882678, -0.19266550838537924, -0.07469015196989198, -0.1055642412767546, -0.08350284432526678, 0.4118958548540352, 0.2842688520699944, 0.17607585161174058, 0.08716737357566931, 0.36794142149757225, -0.02115421105178769, 0.12467960998957087, 0.037008201506418675, 0.14728124328674033, -0.06266024173749099, 0.13307276799773368, -0.16417679318388703, 0.06367715427160754, 0.11613444234295697] |
1,803.02984 | Del Pezzo Surfaces, Rigid Line Configurations and Hirzebruch-Kummer
Coverings | We prove the equisingular rigidity of the singular Hirzebruch-Kummer
coverings $X(n, \mathcal{L})$ of the projective plane branched on line
configurations $\mathcal{L}$, satisfying some technical condition.
In the case, $\mathcal{L}$ = the complete quadrangle, we give explicit
equations of the Hirzebruch-Kummer covering $S_n$ (=the minimal
desingularisation of $X(n, \mathcal{L})$) in a product of four Fermat curves of
degree n.
Since $S_n$ is the $(\mathbb{Z}/n)^5$ covering of the Del Pezzo surface $Y_5$
of degree 5 branched on the 10 lines, these equations are derived from explicit
equations of the image of $Y_5$ in $(\mathbb{P}^1)^4$.
Version2: We added a new section, describing more generally determinantal
equations for all Del Pezzo surfaces of degree $9-k \leq 6$ as subvarieties of
the k-fold product of the projective line.
| math.AG | we prove the equisingular rigidity of the singular hirzebruchkummer coverings xn mathcall of the projective plane branched on line configurations mathcall satisfying some technical condition in the case mathcall the complete quadrangle we give explicit equations of the hirzebruchkummer covering s_n the minimal desingularisation of xn mathcall in a product of four fermat curves of degree n since s_n is the mathbbzn5 covering of the del pezzo surface y_5 of degree 5 branched on the 10 lines these equations are derived from explicit equations of the image of y_5 in mathbbp14 version2 we added a new section describing more generally determinantal equations for all del pezzo surfaces of degree 9k leq 6 as subvarieties of the kfold product of the projective line | [['we', 'prove', 'the', 'equisingular', 'rigidity', 'of', 'the', 'singular', 'hirzebruchkummer', 'coverings', 'xn', 'mathcall', 'of', 'the', 'projective', 'plane', 'branched', 'on', 'line', 'configurations', 'mathcall', 'satisfying', 'some', 'technical', 'condition', 'in', 'the', 'case', 'mathcall', 'the', 'complete', 'quadrangle', 'we', 'give', 'explicit', 'equations', 'of', 'the', 'hirzebruchkummer', 'covering', 's_n', 'the', 'minimal', 'desingularisation', 'of', 'xn', 'mathcall', 'in', 'a', 'product', 'of', 'four', 'fermat', 'curves', 'of', 'degree', 'n', 'since', 's_n', 'is', 'the', 'mathbbzn5', 'covering', 'of', 'the', 'del', 'pezzo', 'surface', 'y_5', 'of', 'degree', '5', 'branched', 'on', 'the', '10', 'lines', 'these', 'equations', 'are', 'derived', 'from', 'explicit', 'equations', 'of', 'the', 'image', 'of', 'y_5', 'in', 'mathbbp14', 'version2', 'we', 'added', 'a', 'new', 'section', 'describing', 'more', 'generally', 'determinantal', 'equations', 'for', 'all', 'del', 'pezzo', 'surfaces', 'of', 'degree', '9k', 'leq', '6', 'as', 'subvarieties', 'of', 'the', 'kfold', 'product', 'of', 'the', 'projective', 'line']] | [-0.2621453828168645, 0.014740196677545706, -0.027972012030659243, 0.06439971068272522, -0.03577637549800177, -0.16368645266241705, -0.014065562828909606, 0.2805853964644484, -0.24332935806984704, -0.23938921626346807, 0.09181064727114668, -0.3128346557651336, -0.09434659319425312, 0.20142767739016562, -0.10538565538978825, 0.020759553050932786, 0.016364021849585696, 0.07117363456248617, -0.14107123750727624, -0.36163331229860585, 0.41377962961948167, -0.09235579511150718, 0.18210546189220622, 0.07709074073160688, 0.1536876584442022, 0.021839478507172317, 0.001727761076957298, -0.0405304751979808, -0.22189916770439594, 0.129058110085316, 0.2959455750882626, 0.09905010337436883, 0.09029457000627493, -0.3692281644015262, -0.12542697900207714, 0.2036817759857513, 0.11987730557254204, -0.018107534541438024, 0.06883944703865079, -0.22712807257000048, 0.0489249133078071, -0.10559166507385574, -0.22766916984692215, 0.007842921455934022, 0.052628949959762396, 0.07387271380284802, -0.17591899828985333, -0.010783123979733016, 0.1147782316353793, 0.19089724244428605, 0.013214928559803715, -0.17824566963245161, -0.14170368005094738, 0.017716160606748115, -0.060915248703289154, 0.030556254762147243, 0.05028791191289202, -0.09420854753261665, -0.05081795818017175, 0.353747549088439, -0.05527522591097901, -0.2114954329871883, 0.044312443163168305, -0.18186396268041183, -0.18981871492772673, 0.2346590962066936, 0.12138795702533874, 0.2342868826216242, -0.01369012677265952, 0.18242425592422176, -0.12623689926695078, 0.08996992983738891, 0.16088085025936985, -0.06720385315323558, 0.1187485198645542, 0.08146102903410793, 0.08807156992455324, 0.11752539560693549, -0.059873679687734695, -0.03123454758509373, -0.4307649480799834, -0.1884852391279613, -0.07168781433138065, 0.22083342359595312, -0.17375078782594452, -0.16589565163788697, 0.39172464563841153, -0.0006276177087177833, 0.2011997272304143, 0.11072412696278965, 0.17151210388789576, 0.0029955867163759344, 0.01575741166404138, 0.024167909212216423, 0.1041505967589425, 0.22023919191366684, -0.02755250456587722, -0.10780397988273763, -0.006182469920410464, 0.19004744349901254] |
1,803.02985 | Models of chromosome architecture and connection with the regulation of
genetic expression | Increasing evidence suggests that chromosome folding and genetic expression
are intimately connected. For example, the co-expression of a large number of
genes can benefit from their spatial co-localization in the cellular space.
Furthermore, functional structures can result from the particular folding of
the chromosome. Such phenomena have in common to result from the binding of
divalent proteins that can bridge regions sometimes far away on the DNA
sequence. The physical system consisting of the chromosome interacting with
divalent proteins can be very complex. As such, most of the mechanisms
responsible for chromosome folding and for the formation of functional
structures have remained elusive.
Using methods from statistical physics, we investigated models of chromosome
architecture. A common denominator of our approach has been to represent the
chromosome as a polymer with bending rigidity and consider its interaction with
a solution of DNA-binding proteins. Structures entailed by the binding of such
proteins were then characterized at the thermodynamical equilibrium.
Furthermore, we complemented theoretical results with Brownian dynamics
simulations, allowing to reproduce more of the biological complexity.
The main contributions of this thesis have been: (i) to provide a model for
the existence of transcription factories characterized in vivo with
fluorescence microscopy; (ii) to propose a physical basis for a conjectured
regulatory mechanism of the transcription involving the formation of DNA
hairpin loops by the H-NS protein as characterized with atomic-force microscopy
experiments; (iii) to propose a physical model of the chromosome that
reproduces contacts measured in chromosome conformation capture (CCC)
experiments. Consequences on the regulation of transcription are discussed in
each of these studies.
| cond-mat.soft physics.bio-ph q-bio.QM | increasing evidence suggests that chromosome folding and genetic expression are intimately connected for example the coexpression of a large number of genes can benefit from their spatial colocalization in the cellular space furthermore functional structures can result from the particular folding of the chromosome such phenomena have in common to result from the binding of divalent proteins that can bridge regions sometimes far away on the dna sequence the physical system consisting of the chromosome interacting with divalent proteins can be very complex as such most of the mechanisms responsible for chromosome folding and for the formation of functional structures have remained elusive using methods from statistical physics we investigated models of chromosome architecture a common denominator of our approach has been to represent the chromosome as a polymer with bending rigidity and consider its interaction with a solution of dnabinding proteins structures entailed by the binding of such proteins were then characterized at the thermodynamical equilibrium furthermore we complemented theoretical results with brownian dynamics simulations allowing to reproduce more of the biological complexity the main contributions of this thesis have been i to provide a model for the existence of transcription factories characterized in vivo with fluorescence microscopy ii to propose a physical basis for a conjectured regulatory mechanism of the transcription involving the formation of dna hairpin loops by the hns protein as characterized with atomicforce microscopy experiments iii to propose a physical model of the chromosome that reproduces contacts measured in chromosome conformation capture ccc experiments consequences on the regulation of transcription are discussed in each of these studies | [['increasing', 'evidence', 'suggests', 'that', 'chromosome', 'folding', 'and', 'genetic', 'expression', 'are', 'intimately', 'connected', 'for', 'example', 'the', 'coexpression', 'of', 'a', 'large', 'number', 'of', 'genes', 'can', 'benefit', 'from', 'their', 'spatial', 'colocalization', 'in', 'the', 'cellular', 'space', 'furthermore', 'functional', 'structures', 'can', 'result', 'from', 'the', 'particular', 'folding', 'of', 'the', 'chromosome', 'such', 'phenomena', 'have', 'in', 'common', 'to', 'result', 'from', 'the', 'binding', 'of', 'divalent', 'proteins', 'that', 'can', 'bridge', 'regions', 'sometimes', 'far', 'away', 'on', 'the', 'dna', 'sequence', 'the', 'physical', 'system', 'consisting', 'of', 'the', 'chromosome', 'interacting', 'with', 'divalent', 'proteins', 'can', 'be', 'very', 'complex', 'as', 'such', 'most', 'of', 'the', 'mechanisms', 'responsible', 'for', 'chromosome', 'folding', 'and', 'for', 'the', 'formation', 'of', 'functional', 'structures', 'have', 'remained', 'elusive', 'using', 'methods', 'from', 'statistical', 'physics', 'we', 'investigated', 'models', 'of', 'chromosome', 'architecture', 'a', 'common', 'denominator', 'of', 'our', 'approach', 'has', 'been', 'to', 'represent', 'the', 'chromosome', 'as', 'a', 'polymer', 'with', 'bending', 'rigidity', 'and', 'consider', 'its', 'interaction', 'with', 'a', 'solution', 'of', 'dnabinding', 'proteins', 'structures', 'entailed', 'by', 'the', 'binding', 'of', 'such', 'proteins', 'were', 'then', 'characterized', 'at', 'the', 'thermodynamical', 'equilibrium', 'furthermore', 'we', 'complemented', 'theoretical', 'results', 'with', 'brownian', 'dynamics', 'simulations', 'allowing', 'to', 'reproduce', 'more', 'of', 'the', 'biological', 'complexity', 'the', 'main', 'contributions', 'of', 'this', 'thesis', 'have', 'been', 'i', 'to', 'provide', 'a', 'model', 'for', 'the', 'existence', 'of', 'transcription', 'factories', 'characterized', 'in', 'vivo', 'with', 'fluorescence', 'microscopy', 'ii', 'to', 'propose', 'a', 'physical', 'basis', 'for', 'a', 'conjectured', 'regulatory', 'mechanism', 'of', 'the', 'transcription', 'involving', 'the', 'formation', 'of', 'dna', 'hairpin', 'loops', 'by', 'the', 'hns', 'protein', 'as', 'characterized', 'with', 'atomicforce', 'microscopy', 'experiments', 'iii', 'to', 'propose', 'a', 'physical', 'model', 'of', 'the', 'chromosome', 'that', 'reproduces', 'contacts', 'measured', 'in', 'chromosome', 'conformation', 'capture', 'ccc', 'experiments', 'consequences', 'on', 'the', 'regulation', 'of', 'transcription', 'are', 'discussed', 'in', 'each', 'of', 'these', 'studies']] | [-0.10004893633428577, 0.12679008631309394, -0.046493914220055554, 0.07524936031932296, -0.006048756637361668, -0.14836714958295738, 0.058580351654859614, 0.3911059902668113, -0.2642088630969835, -0.2678031974351247, 0.010480718608529713, -0.25408997109252246, -0.24263359601547757, 0.1793240884102113, -0.035679374745058764, 0.009655853743195704, 0.08125889377281041, 0.029908432421840565, 0.0435015452334316, -0.16763824530617683, 0.2752445039929438, 0.07349062984620883, 0.23088618393237384, 0.0653624095036897, 0.0986381117698829, -0.06555590726602253, 0.0035764410410197237, 0.016936084530063022, -0.17003756907600479, 0.18330491825810258, 0.28015663433559906, 0.15534398496241614, 0.2642467071227587, -0.4713747893310799, -0.2529158143767419, 0.06764154974104594, 0.18328645697062593, 0.14437053259462118, -0.05603234711813408, -0.2582777366095457, 0.09744096891901222, -0.11896400330437149, -0.08907237416222151, -0.08887842650354648, 0.01687324967391732, 0.09689048381223705, -0.20556437105779315, 0.11212186179948501, 0.021352627689644466, 0.11116962489238336, -0.09349072293533041, -0.11746003082198027, -0.06079106278386934, 0.18541405204983913, 0.09217094304439974, 0.02941275675752634, 0.21197272634901504, -0.12575875729222902, -0.15511132820459608, 0.3683306493277427, 0.014285167576993978, -0.18144347880192044, 0.23317967598745956, -0.14134822434653307, -0.19608555363050398, 0.16007215263613478, 0.10381891104243411, 0.07274521705225725, -0.19014897360999622, 0.052554696421752124, -0.01389237510694461, 0.1819281246324731, 0.1087639260315514, 0.019974145273151913, 0.1934309824910157, 0.23802673924609463, -0.007932829195171425, 0.13018265155229347, -0.106189580661785, -0.12251353074035799, -0.22554225001736536, -0.15798826145633826, -0.15517297826302132, 0.05620877121025092, -0.056766001534133255, -0.18320648429306238, 0.3707295302319419, 0.07132225283528217, 0.21720447260282139, 0.04495068045087756, 0.21079368656501174, -0.006097674809701969, 0.11973936837575334, -0.04041862420698642, 0.1672298045302848, 0.09674987248820431, 0.04189551988872522, -0.2561041770275426, 0.14501879200115372, 0.05076912948897265] |
1,803.02986 | Asymptotic of steady vortex pairs in the lake equation | We bring new results in the study the asymptotic behavior of shrinking vortex
pairs obtained by maximization of the kinetic energy in a 2-dimensional lake
over a class of rearrangements. After improving recent results obtained for the
first order asymptotic behavior of such pairs, we focus on second order
asymptotic properties. We show that among all points of maximal depth, the
vortex locates according to an adaptation of the Kirchoff-Routh function, and
we study the asymptotic shape of optimal vortices. We also explore a relaxed
maximization problem with uniform constraints, for which we prove that the
distribution consists of two vortex patches.
| math.AP | we bring new results in the study the asymptotic behavior of shrinking vortex pairs obtained by maximization of the kinetic energy in a 2dimensional lake over a class of rearrangements after improving recent results obtained for the first order asymptotic behavior of such pairs we focus on second order asymptotic properties we show that among all points of maximal depth the vortex locates according to an adaptation of the kirchoffrouth function and we study the asymptotic shape of optimal vortices we also explore a relaxed maximization problem with uniform constraints for which we prove that the distribution consists of two vortex patches | [['we', 'bring', 'new', 'results', 'in', 'the', 'study', 'the', 'asymptotic', 'behavior', 'of', 'shrinking', 'vortex', 'pairs', 'obtained', 'by', 'maximization', 'of', 'the', 'kinetic', 'energy', 'in', 'a', '2dimensional', 'lake', 'over', 'a', 'class', 'of', 'rearrangements', 'after', 'improving', 'recent', 'results', 'obtained', 'for', 'the', 'first', 'order', 'asymptotic', 'behavior', 'of', 'such', 'pairs', 'we', 'focus', 'on', 'second', 'order', 'asymptotic', 'properties', 'we', 'show', 'that', 'among', 'all', 'points', 'of', 'maximal', 'depth', 'the', 'vortex', 'locates', 'according', 'to', 'an', 'adaptation', 'of', 'the', 'kirchoffrouth', 'function', 'and', 'we', 'study', 'the', 'asymptotic', 'shape', 'of', 'optimal', 'vortices', 'we', 'also', 'explore', 'a', 'relaxed', 'maximization', 'problem', 'with', 'uniform', 'constraints', 'for', 'which', 'we', 'prove', 'that', 'the', 'distribution', 'consists', 'of', 'two', 'vortex', 'patches']] | [-0.15460581659791198, 0.06021777011288704, -0.09136860677050335, 0.044286713686467395, -0.04725093272339442, -0.02932614579077552, 0.0539166236222528, 0.3319924298655426, -0.24107900569860888, -0.26453680656896444, 0.08288991042311386, -0.2671311096113064, -0.15473745979995715, 0.17714608405338655, -0.03745870823317235, 0.05644186664520219, 0.03778397018034564, 0.05100147440882012, -0.09408953685848283, -0.2709124116699608, 0.35143744438370267, 0.013199411157407973, 0.3147978973897672, 0.037646610713978804, 0.12067119235467941, 0.025826546955982795, -0.014729489484746562, 0.059006037178381904, -0.22807002493879402, 0.14139695328978436, 0.17466438514650753, 0.09964618827031907, 0.281193678774456, -0.4222830493132224, -0.18765316346641814, 0.1345302552021671, 0.1583832887803564, 0.09571083489745523, -0.03325423123291924, -0.2484691376926949, 0.1332011761992137, -0.12420553156165498, -0.15856342390640685, -0.03809411102666123, -0.016076554004840628, 0.10635069991913762, -0.285928501038683, 0.0489396224888203, 0.10654550492486889, 0.030195616662852687, -0.09241215818294204, -0.10269053926285689, -0.015381886365611365, 0.11829921071611271, 0.08408401454660562, -0.04187581359436459, 0.06844678823144572, -0.16547343671543174, -0.1044523622932853, 0.3210060619795234, -0.07266331973282786, -0.16115498140749365, 0.138145070163404, -0.14105447387267459, -0.1369147646231669, 0.1254667268494273, 0.17746654169468007, 0.1514418627329097, -0.12103980453223875, 0.042798868702646195, -0.09010869705367207, 0.11472478792034459, 0.07446753999015482, 0.043236018805119146, 0.1962751447785609, 0.19031531809561766, 0.12287320733291678, 0.23198742375681453, -0.10961319107589966, -0.11456664224238236, -0.31733683542357666, -0.16565877290461029, -0.18670694680658564, 0.015517210200576498, -0.1020181318513051, -0.14817245151400382, 0.4262871320018231, 0.12849596411100414, 0.25932716066392353, 0.09096156993055587, 0.22759969489151002, 0.10107688695229221, 0.006462995686780403, 0.09501506402249457, 0.22290986269196073, 0.0823632958252905, 0.07364225490733355, -0.24956031932206224, 0.018576964916947235, 0.11406911563331096] |
1,803.02987 | Improved Deep Hashing with Soft Pairwise Similarity for Multi-label
Image Retrieval | Hash coding has been widely used in the approximate nearest neighbor search
for large-scale image retrieval. Recently, many deep hashing methods have been
proposed and shown largely improved performance over traditional
feature-learning-based methods. Most of these methods examine the pairwise
similarity on the semantic-level labels, where the pairwise similarity is
generally defined in a hard-assignment way. That is, the pairwise similarity is
'1' if they share no less than one class label and '0' if they do not share
any. However, such similarity definition cannot reflect the similarity ranking
for pairwise images that hold multiple labels. In this paper, a new deep
hashing method is proposed for multi-label image retrieval by re-defining the
pairwise similarity into an instance similarity, where the instance similarity
is quantified into a percentage based on the normalized semantic labels. Based
on the instance similarity, a weighted cross-entropy loss and a minimum mean
square error loss are tailored for loss-function construction, and are
efficiently used for simultaneous feature learning and hash coding. Experiments
on three popular datasets demonstrate that, the proposed method outperforms the
competing methods and achieves the state-of-the-art performance in multi-label
image retrieval.
| cs.CV | hash coding has been widely used in the approximate nearest neighbor search for largescale image retrieval recently many deep hashing methods have been proposed and shown largely improved performance over traditional featurelearningbased methods most of these methods examine the pairwise similarity on the semanticlevel labels where the pairwise similarity is generally defined in a hardassignment way that is the pairwise similarity is 1 if they share no less than one class label and 0 if they do not share any however such similarity definition cannot reflect the similarity ranking for pairwise images that hold multiple labels in this paper a new deep hashing method is proposed for multilabel image retrieval by redefining the pairwise similarity into an instance similarity where the instance similarity is quantified into a percentage based on the normalized semantic labels based on the instance similarity a weighted crossentropy loss and a minimum mean square error loss are tailored for lossfunction construction and are efficiently used for simultaneous feature learning and hash coding experiments on three popular datasets demonstrate that the proposed method outperforms the competing methods and achieves the stateoftheart performance in multilabel image retrieval | [['hash', 'coding', 'has', 'been', 'widely', 'used', 'in', 'the', 'approximate', 'nearest', 'neighbor', 'search', 'for', 'largescale', 'image', 'retrieval', 'recently', 'many', 'deep', 'hashing', 'methods', 'have', 'been', 'proposed', 'and', 'shown', 'largely', 'improved', 'performance', 'over', 'traditional', 'featurelearningbased', 'methods', 'most', 'of', 'these', 'methods', 'examine', 'the', 'pairwise', 'similarity', 'on', 'the', 'semanticlevel', 'labels', 'where', 'the', 'pairwise', 'similarity', 'is', 'generally', 'defined', 'in', 'a', 'hardassignment', 'way', 'that', 'is', 'the', 'pairwise', 'similarity', 'is', '1', 'if', 'they', 'share', 'no', 'less', 'than', 'one', 'class', 'label', 'and', '0', 'if', 'they', 'do', 'not', 'share', 'any', 'however', 'such', 'similarity', 'definition', 'can', 'not', 'reflect', 'the', 'similarity', 'ranking', 'for', 'pairwise', 'images', 'that', 'hold', 'multiple', 'labels', 'in', 'this', 'paper', 'a', 'new', 'deep', 'hashing', 'method', 'is', 'proposed', 'for', 'multilabel', 'image', 'retrieval', 'by', 'redefining', 'the', 'pairwise', 'similarity', 'into', 'an', 'instance', 'similarity', 'where', 'the', 'instance', 'similarity', 'is', 'quantified', 'into', 'a', 'percentage', 'based', 'on', 'the', 'normalized', 'semantic', 'labels', 'based', 'on', 'the', 'instance', 'similarity', 'a', 'weighted', 'crossentropy', 'loss', 'and', 'a', 'minimum', 'mean', 'square', 'error', 'loss', 'are', 'tailored', 'for', 'lossfunction', 'construction', 'and', 'are', 'efficiently', 'used', 'for', 'simultaneous', 'feature', 'learning', 'and', 'hash', 'coding', 'experiments', 'on', 'three', 'popular', 'datasets', 'demonstrate', 'that', 'the', 'proposed', 'method', 'outperforms', 'the', 'competing', 'methods', 'and', 'achieves', 'the', 'stateoftheart', 'performance', 'in', 'multilabel', 'image', 'retrieval']] | [-0.039240279886995424, -0.02438302205863441, -0.07490894797832724, 0.12470925826470348, -0.08239252808035669, -0.19319685143567225, 0.021625209194137417, 0.5129797376848341, -0.27451844290307564, -0.3146855782945343, 0.046141388970972134, -0.32590771909212407, -0.1750694325917024, 0.18605003581181703, -0.11185816648426129, 0.11298345722768337, 0.11823572505741044, 0.11737076241394227, -0.13107190528101823, -0.3376840787538466, 0.31426284203746735, 0.006324530520632447, 0.3685923010814301, 0.033564422656707664, 0.10900748050969808, 0.0030045445111798164, -0.0613613754289195, 0.04526698500651153, -0.03339255132468292, 0.18903925178691428, 0.29232432758138377, 0.24178129690946973, 0.3408390212422633, -0.31727596586867374, -0.2508060983120541, 0.1497801117613872, 0.15049087638134492, 0.054483452418703275, -0.07047776705145767, -0.30402932159275686, 0.10178227920179314, -0.15005026150871306, 0.11704156928983062, -0.1385572951880254, 0.00028526629482277053, 0.016183272793646307, -0.3098164882109639, 0.0483144854004693, 0.07685187623660858, 0.0400543469574025, -0.020903356753517576, -0.14589366134370063, 0.04102808080782044, 0.1489229847644852, 0.0026974533498782586, 0.08397434702628549, 0.07598596988642152, -0.144882101784807, -0.15933194491972633, 0.3964017342894952, -0.04742843298740906, -0.24912743523662434, 0.20902258779592267, 0.0038038831640114174, -0.1428917620357734, 0.10281778650080904, 0.19799927404110737, 0.14087061473648957, -0.16466726330009865, 0.008780601703774859, -0.08057736852107213, 0.20987002594654072, 0.08433495508878433, 0.02708369123370466, 0.16085537505692782, 0.185350106915142, 0.06331619473689414, 0.09514006477919348, -0.14921774280237707, -0.0873619296483973, -0.1534488076084675, -0.1207027473931877, -0.26855624596677485, -0.06871456293958274, -0.14504571097727711, -0.16844692621723764, 0.3710947456928168, 0.2079810807357562, 0.21080291191948222, 0.07849123885488495, 0.3283324597522299, 0.02620745280589116, 0.15361502530806243, 0.1228859588854322, 0.20675055820128305, 0.015818515283481636, 0.03645445695710418, -0.1518058283923273, 0.14327454477043308, 0.14820891380696458] |
1,803.02988 | Rethinking Feature Distribution for Loss Functions in Image
Classification | We propose a large-margin Gaussian Mixture (L-GM) loss for deep neural
networks in classification tasks. Different from the softmax cross-entropy
loss, our proposal is established on the assumption that the deep features of
the training set follow a Gaussian Mixture distribution. By involving a
classification margin and a likelihood regularization, the L-GM loss
facilitates both a high classification performance and an accurate modeling of
the training feature distribution. As such, the L-GM loss is superior to the
softmax loss and its major variants in the sense that besides classification,
it can be readily used to distinguish abnormal inputs, such as the adversarial
examples, based on their features' likelihood to the training feature
distribution. Extensive experiments on various recognition benchmarks like
MNIST, CIFAR, ImageNet and LFW, as well as on adversarial examples demonstrate
the effectiveness of our proposal.
| cs.CV | we propose a largemargin gaussian mixture lgm loss for deep neural networks in classification tasks different from the softmax crossentropy loss our proposal is established on the assumption that the deep features of the training set follow a gaussian mixture distribution by involving a classification margin and a likelihood regularization the lgm loss facilitates both a high classification performance and an accurate modeling of the training feature distribution as such the lgm loss is superior to the softmax loss and its major variants in the sense that besides classification it can be readily used to distinguish abnormal inputs such as the adversarial examples based on their features likelihood to the training feature distribution extensive experiments on various recognition benchmarks like mnist cifar imagenet and lfw as well as on adversarial examples demonstrate the effectiveness of our proposal | [['we', 'propose', 'a', 'largemargin', 'gaussian', 'mixture', 'lgm', 'loss', 'for', 'deep', 'neural', 'networks', 'in', 'classification', 'tasks', 'different', 'from', 'the', 'softmax', 'crossentropy', 'loss', 'our', 'proposal', 'is', 'established', 'on', 'the', 'assumption', 'that', 'the', 'deep', 'features', 'of', 'the', 'training', 'set', 'follow', 'a', 'gaussian', 'mixture', 'distribution', 'by', 'involving', 'a', 'classification', 'margin', 'and', 'a', 'likelihood', 'regularization', 'the', 'lgm', 'loss', 'facilitates', 'both', 'a', 'high', 'classification', 'performance', 'and', 'an', 'accurate', 'modeling', 'of', 'the', 'training', 'feature', 'distribution', 'as', 'such', 'the', 'lgm', 'loss', 'is', 'superior', 'to', 'the', 'softmax', 'loss', 'and', 'its', 'major', 'variants', 'in', 'the', 'sense', 'that', 'besides', 'classification', 'it', 'can', 'be', 'readily', 'used', 'to', 'distinguish', 'abnormal', 'inputs', 'such', 'as', 'the', 'adversarial', 'examples', 'based', 'on', 'their', 'features', 'likelihood', 'to', 'the', 'training', 'feature', 'distribution', 'extensive', 'experiments', 'on', 'various', 'recognition', 'benchmarks', 'like', 'mnist', 'cifar', 'imagenet', 'and', 'lfw', 'as', 'well', 'as', 'on', 'adversarial', 'examples', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'proposal']] | [0.017445312241894485, -0.04410472045468598, -0.07931229226753442, 0.12566584543270623, -0.07235800678821376, -0.16091688895720418, 0.05187960504044364, 0.4628981138124083, -0.2647506869500027, -0.33201184104592707, 0.10063918634916037, -0.28783508766796034, -0.21982806253444104, 0.20868734160546948, -0.16601540013998203, 0.15126271341905256, 0.16244412418182966, 0.04671760254971221, -0.09948497031387078, -0.34226999875076497, 0.311653677788801, 0.05742733378641403, 0.38250154909914885, 0.02285318547880182, 0.14108372429032287, -0.02704187612776665, 0.03134613549744669, -0.05201000800478633, 0.008611523413186873, 0.15099895578880462, 0.24773662748923322, 0.21803488212902725, 0.3358274787854757, -0.33340586444539744, -0.2887775303088944, 0.09532750031509757, 0.11395320897398475, 0.07542463853601775, -0.03279480023860224, -0.3317649361956185, 0.04968461090780414, -0.19789107689076532, 0.04407238158784861, -0.19528523417543212, -0.06774616568437676, 0.024033768891091763, -0.34172505395908426, 0.07740090857939727, 0.12475267963324177, 0.06487157802950645, -0.042751865411333634, -0.1699586453351335, -0.032457277407346254, 0.12106999558954071, 0.043825674282019805, 0.0380848927413161, 0.1551464156291862, -0.22775290279316096, -0.14726454304466635, 0.31998538917243263, -0.10988227483972798, -0.23651309426275702, 0.23214293574662812, 0.03475014353170991, -0.09644461445931862, 0.060714224710326344, 0.269653944556948, 0.13345271762440075, -0.1306100480707131, -0.04616789664753652, -0.051950775270425055, 0.13978357640958397, 0.06676470223018886, -0.029280958051392195, 0.1555564589407567, 0.27996324987769344, 0.004128153357709194, 0.1928727063647791, -0.20745853276882512, -0.07463720861659215, -0.26702082401182314, -0.0842347448141727, -0.25816126981491805, -0.008039340839116242, -0.12870149728017824, -0.18386599564258635, 0.39783454335627766, 0.19775347378662358, 0.28144699202537754, 0.15191395539300936, 0.34748082265366603, 0.014362638773006578, 0.13396126403894792, 0.07267446103199882, 0.20479191278437167, 0.030036809828717016, 0.05279730526852782, -0.18040999654428966, 0.12610479734198998, 0.012595869757126283] |
1,803.02989 | Secondary breakup of drops at moderate Weber numbers: Effect of Density
ratio and Reynolds number | Breakup of liquid drops occurs in several natural and industrial settings.
Fully resolved Volume of Fluid based simulations presented in this study reveal
the complete flow physics and droplet dynamics that lead to the breakup of a
drop in a particular mode. We have investigated the effects of density ratio
and Reynolds number on the dynamics of drop deformation and subsequent breakup.
A density ratio-Weber number phase plot is presented that indicates the
variation in the deformation of the drop at various density ratios and Weber
numbers. We show that the breakup dynamics of the droplets at low density
ratios is significantly different to that observed at high density ratios. We
also study the temporal characteristics of the droplet deformation and motion.
| physics.flu-dyn | breakup of liquid drops occurs in several natural and industrial settings fully resolved volume of fluid based simulations presented in this study reveal the complete flow physics and droplet dynamics that lead to the breakup of a drop in a particular mode we have investigated the effects of density ratio and reynolds number on the dynamics of drop deformation and subsequent breakup a density ratioweber number phase plot is presented that indicates the variation in the deformation of the drop at various density ratios and weber numbers we show that the breakup dynamics of the droplets at low density ratios is significantly different to that observed at high density ratios we also study the temporal characteristics of the droplet deformation and motion | [['breakup', 'of', 'liquid', 'drops', 'occurs', 'in', 'several', 'natural', 'and', 'industrial', 'settings', 'fully', 'resolved', 'volume', 'of', 'fluid', 'based', 'simulations', 'presented', 'in', 'this', 'study', 'reveal', 'the', 'complete', 'flow', 'physics', 'and', 'droplet', 'dynamics', 'that', 'lead', 'to', 'the', 'breakup', 'of', 'a', 'drop', 'in', 'a', 'particular', 'mode', 'we', 'have', 'investigated', 'the', 'effects', 'of', 'density', 'ratio', 'and', 'reynolds', 'number', 'on', 'the', 'dynamics', 'of', 'drop', 'deformation', 'and', 'subsequent', 'breakup', 'a', 'density', 'ratioweber', 'number', 'phase', 'plot', 'is', 'presented', 'that', 'indicates', 'the', 'variation', 'in', 'the', 'deformation', 'of', 'the', 'drop', 'at', 'various', 'density', 'ratios', 'and', 'weber', 'numbers', 'we', 'show', 'that', 'the', 'breakup', 'dynamics', 'of', 'the', 'droplets', 'at', 'low', 'density', 'ratios', 'is', 'significantly', 'different', 'to', 'that', 'observed', 'at', 'high', 'density', 'ratios', 'we', 'also', 'study', 'the', 'temporal', 'characteristics', 'of', 'the', 'droplet', 'deformation', 'and', 'motion']] | [-0.13791084077501717, 0.18639619342890407, -0.1425086822368451, 0.03056153329955183, 0.04220987143656932, -0.03806382998793332, 0.012873843928013952, 0.30942592606687347, -0.23736643890488493, -0.3210839484164045, 0.05724805663147372, -0.2459268000377111, -0.1322288739972186, 0.1515088622301455, -0.01990482368899032, 0.052176754706162065, 0.04402132600176433, -0.0161066429500953, -0.0680921264531568, -0.19104765756708744, 0.2961479680581896, 0.05076523549269792, 0.32962577534485454, 0.12067658448791947, 0.0892306312010431, -0.027386577549767643, 0.007580723355655089, 0.08089498883836772, -0.212642126202185, 0.0287889417083857, 0.20972525744029313, 0.038659734070331846, 0.2126797785105045, -0.4469122286301014, -0.2278479535040284, 0.03388228479095481, 0.12704438071366986, 0.10652236718961522, -0.05768573993512945, -0.20990030718428537, 0.05738301224206105, -0.1873355886691119, -0.14094983858310364, -0.05152811857001964, 0.08388311631423383, 0.06818025177397596, -0.20600905671161562, 0.1369773572335339, 0.014615804869065847, 0.0620089858416314, -0.0472060125051759, -0.10849071857480963, -0.05126257503332093, 0.08408368038002031, 0.07851578256938883, -0.023465989711732905, 0.2363237745959835, -0.17524626467969606, -0.020276463798378126, 0.3755682811664402, -0.0519050310542884, -0.1685980986034082, 0.2167755641862904, -0.22664320875297894, -0.11205899038098076, 0.2317942300357294, 0.22854279963037938, 0.11274179235901222, -0.03400946132577032, -0.025881593597404398, -0.019303463400372357, 0.17537134606968457, 0.11378170618371776, -0.0437081767446246, 0.18583618061355323, 0.22441219255782294, 0.0054537244891547714, 0.12734850628776784, -0.17388534122954838, -0.12421969308764173, -0.3027223569806665, -0.1429673661323926, -0.13090040322276764, -0.010550189084057842, -0.07537950697659962, -0.13675990315492859, 0.36728965759677584, 0.09373832289283433, 0.25381846187543894, 0.03518760397506893, 0.2601728020312865, 0.10586686084558802, 0.020543169738216835, 0.04586866910546279, 0.26597103117080023, 0.15381960538485326, 0.12134070344623332, -0.3048291269031715, 0.07074673711861029, 0.016301460285124577] |
1,803.0299 | The electrostatic instability for realistic pair distributions in
blazar/EBL cascades | This work revisits the electrostatic instability for blazar-induced pair
beams propagating through IGM with the methods of linear analysis and PIC
simulations. We study the impact of the realistic distribution function of
pairs resulting from interaction of high-energy gamma-rays with the
extragalactic background light. We present analytical and numerical
calculations of the linear growth rate of the instability for arbitrary
orientation of wave vectors. Our results explicitly demonstrate that the finite
angular spread of the beam dramatically affects the growth rate of the waves,
leading to fastest growth for wave vectors quasi-parallel to the beam direction
and a growth rate at oblique directions that is only by a factor of 2-4 smaller
compared to the maximum. To study the non-linear beam relaxation, we performed
PIC simulations that take into account a realistic wide-energy distribution of
beam particles. The parameters of the simulated beam-plasma system provide an
adequate physical picture that can be extrapolated to realistic blazar-induced
pairs. In our simulations the beam looses only 1\% percent of its energy, and
we analytically estimate that the beam would lose its total energy over about
$100$ simulation times. Analytical scaling is then used to extrapolate to the
parameters of realistic blazar-induced pair beams. We find that they can
dissipate their energy slightly faster by the electrostatic instability than
through inverse-Compton scattering. The uncertainties arising from, e.g.,
details of the primary gamma-ray spectrum are too large to make firm statements
for individual blazars, and an analysis based on their specific properties is
required.
| astro-ph.HE | this work revisits the electrostatic instability for blazarinduced pair beams propagating through igm with the methods of linear analysis and pic simulations we study the impact of the realistic distribution function of pairs resulting from interaction of highenergy gammarays with the extragalactic background light we present analytical and numerical calculations of the linear growth rate of the instability for arbitrary orientation of wave vectors our results explicitly demonstrate that the finite angular spread of the beam dramatically affects the growth rate of the waves leading to fastest growth for wave vectors quasiparallel to the beam direction and a growth rate at oblique directions that is only by a factor of 24 smaller compared to the maximum to study the nonlinear beam relaxation we performed pic simulations that take into account a realistic wideenergy distribution of beam particles the parameters of the simulated beamplasma system provide an adequate physical picture that can be extrapolated to realistic blazarinduced pairs in our simulations the beam looses only 1 percent of its energy and we analytically estimate that the beam would lose its total energy over about 100 simulation times analytical scaling is then used to extrapolate to the parameters of realistic blazarinduced pair beams we find that they can dissipate their energy slightly faster by the electrostatic instability than through inversecompton scattering the uncertainties arising from eg details of the primary gammaray spectrum are too large to make firm statements for individual blazars and an analysis based on their specific properties is required | [['this', 'work', 'revisits', 'the', 'electrostatic', 'instability', 'for', 'blazarinduced', 'pair', 'beams', 'propagating', 'through', 'igm', 'with', 'the', 'methods', 'of', 'linear', 'analysis', 'and', 'pic', 'simulations', 'we', 'study', 'the', 'impact', 'of', 'the', 'realistic', 'distribution', 'function', 'of', 'pairs', 'resulting', 'from', 'interaction', 'of', 'highenergy', 'gammarays', 'with', 'the', 'extragalactic', 'background', 'light', 'we', 'present', 'analytical', 'and', 'numerical', 'calculations', 'of', 'the', 'linear', 'growth', 'rate', 'of', 'the', 'instability', 'for', 'arbitrary', 'orientation', 'of', 'wave', 'vectors', 'our', 'results', 'explicitly', 'demonstrate', 'that', 'the', 'finite', 'angular', 'spread', 'of', 'the', 'beam', 'dramatically', 'affects', 'the', 'growth', 'rate', 'of', 'the', 'waves', 'leading', 'to', 'fastest', 'growth', 'for', 'wave', 'vectors', 'quasiparallel', 'to', 'the', 'beam', 'direction', 'and', 'a', 'growth', 'rate', 'at', 'oblique', 'directions', 'that', 'is', 'only', 'by', 'a', 'factor', 'of', '24', 'smaller', 'compared', 'to', 'the', 'maximum', 'to', 'study', 'the', 'nonlinear', 'beam', 'relaxation', 'we', 'performed', 'pic', 'simulations', 'that', 'take', 'into', 'account', 'a', 'realistic', 'wideenergy', 'distribution', 'of', 'beam', 'particles', 'the', 'parameters', 'of', 'the', 'simulated', 'beamplasma', 'system', 'provide', 'an', 'adequate', 'physical', 'picture', 'that', 'can', 'be', 'extrapolated', 'to', 'realistic', 'blazarinduced', 'pairs', 'in', 'our', 'simulations', 'the', 'beam', 'looses', 'only', '1', 'percent', 'of', 'its', 'energy', 'and', 'we', 'analytically', 'estimate', 'that', 'the', 'beam', 'would', 'lose', 'its', 'total', 'energy', 'over', 'about', '100', 'simulation', 'times', 'analytical', 'scaling', 'is', 'then', 'used', 'to', 'extrapolate', 'to', 'the', 'parameters', 'of', 'realistic', 'blazarinduced', 'pair', 'beams', 'we', 'find', 'that', 'they', 'can', 'dissipate', 'their', 'energy', 'slightly', 'faster', 'by', 'the', 'electrostatic', 'instability', 'than', 'through', 'inversecompton', 'scattering', 'the', 'uncertainties', 'arising', 'from', 'eg', 'details', 'of', 'the', 'primary', 'gammaray', 'spectrum', 'are', 'too', 'large', 'to', 'make', 'firm', 'statements', 'for', 'individual', 'blazars', 'and', 'an', 'analysis', 'based', 'on', 'their', 'specific', 'properties', 'is', 'required']] | [-0.10721763571440036, 0.1459166619574406, -0.08374755722227466, 0.09663969450200119, -0.06354653091173634, -0.06745424581412039, 0.024332642984430653, 0.38749519535097254, -0.2505196067616792, -0.3096431332404714, 0.05210494663824428, -0.2803536724962152, -0.04118546383781733, 0.23495966299945661, 0.057160469381013386, 0.04503040212434698, 0.0807321209939249, -0.03129836388227313, -0.05517659882732469, -0.20907557720550332, 0.292792407231944, 0.1570763416133866, 0.2762781085005127, 0.04152817878896468, 0.09605030808223777, 0.014939841753092546, -0.017919750633578462, -0.02761485257623605, -0.15778573334910653, 0.07969421047547151, 0.17164781916279712, 0.11092217693509288, 0.23046292896569173, -0.47198146212861003, -0.23837368219789776, 0.06405517827517476, 0.17661017285589545, 0.12046005331301486, -0.05505595649975954, -0.22459996618465128, 0.09295576118235757, -0.1548699874629128, -0.16780172873767146, -0.01492399383938486, 0.0015249147975675192, 0.07499362874190352, -0.2774051329696992, 0.09259013278058255, 0.03355137662715223, 0.01371097807880808, -0.06338740430723681, -0.09525550156410963, -0.05285573682661755, 0.08739663266070022, 0.08890483642784945, 0.03211898936976092, 0.1605556456953751, -0.12858163987204102, -0.059882424971187884, 0.39382600601777495, -0.03441405008308801, -0.17767638795032917, 0.18478563048009083, -0.2004181583744874, -0.04233463131916152, 0.20035293770123677, 0.22690054466461682, 0.08699888571882695, -0.11717138525208899, -0.0032280163821225695, -0.010643173437299073, 0.18596616339398525, 0.06400554088490405, 0.014742558356374502, 0.20133875442568744, 0.147707451817516, 0.025597748583197653, 0.12247454528051642, -0.12741300520154247, -0.06397802808535206, -0.3081431318613061, -0.10038256231063311, -0.144288004506903, 0.06533408286664766, -0.09109080127171797, -0.10434937284021342, 0.4225672131972799, 0.17228353710993086, 0.173210529214048, 0.0344375443783211, 0.32018783262530603, 0.1369833640109497, 0.04647215906003243, 0.07422170454045257, 0.28730780283086393, 0.11380129206054151, 0.06973638990660194, -0.2509251536491017, 0.04808867751456139, -0.015427009711915395] |
1,803.02991 | Disentangled Sequential Autoencoder | We present a VAE architecture for encoding and generating high dimensional
sequential data, such as video or audio. Our deep generative model learns a
latent representation of the data which is split into a static and dynamic
part, allowing us to approximately disentangle latent time-dependent features
(dynamics) from features which are preserved over time (content). This
architecture gives us partial control over generating content and dynamics by
conditioning on either one of these sets of features. In our experiments on
artificially generated cartoon video clips and voice recordings, we show that
we can convert the content of a given sequence into another one by such content
swapping. For audio, this allows us to convert a male speaker into a female
speaker and vice versa, while for video we can separately manipulate shapes and
dynamics. Furthermore, we give empirical evidence for the hypothesis that
stochastic RNNs as latent state models are more efficient at compressing and
generating long sequences than deterministic ones, which may be relevant for
applications in video compression.
| cs.LG | we present a vae architecture for encoding and generating high dimensional sequential data such as video or audio our deep generative model learns a latent representation of the data which is split into a static and dynamic part allowing us to approximately disentangle latent timedependent features dynamics from features which are preserved over time content this architecture gives us partial control over generating content and dynamics by conditioning on either one of these sets of features in our experiments on artificially generated cartoon video clips and voice recordings we show that we can convert the content of a given sequence into another one by such content swapping for audio this allows us to convert a male speaker into a female speaker and vice versa while for video we can separately manipulate shapes and dynamics furthermore we give empirical evidence for the hypothesis that stochastic rnns as latent state models are more efficient at compressing and generating long sequences than deterministic ones which may be relevant for applications in video compression | [['we', 'present', 'a', 'vae', 'architecture', 'for', 'encoding', 'and', 'generating', 'high', 'dimensional', 'sequential', 'data', 'such', 'as', 'video', 'or', 'audio', 'our', 'deep', 'generative', 'model', 'learns', 'a', 'latent', 'representation', 'of', 'the', 'data', 'which', 'is', 'split', 'into', 'a', 'static', 'and', 'dynamic', 'part', 'allowing', 'us', 'to', 'approximately', 'disentangle', 'latent', 'timedependent', 'features', 'dynamics', 'from', 'features', 'which', 'are', 'preserved', 'over', 'time', 'content', 'this', 'architecture', 'gives', 'us', 'partial', 'control', 'over', 'generating', 'content', 'and', 'dynamics', 'by', 'conditioning', 'on', 'either', 'one', 'of', 'these', 'sets', 'of', 'features', 'in', 'our', 'experiments', 'on', 'artificially', 'generated', 'cartoon', 'video', 'clips', 'and', 'voice', 'recordings', 'we', 'show', 'that', 'we', 'can', 'convert', 'the', 'content', 'of', 'a', 'given', 'sequence', 'into', 'another', 'one', 'by', 'such', 'content', 'swapping', 'for', 'audio', 'this', 'allows', 'us', 'to', 'convert', 'a', 'male', 'speaker', 'into', 'a', 'female', 'speaker', 'and', 'vice', 'versa', 'while', 'for', 'video', 'we', 'can', 'separately', 'manipulate', 'shapes', 'and', 'dynamics', 'furthermore', 'we', 'give', 'empirical', 'evidence', 'for', 'the', 'hypothesis', 'that', 'stochastic', 'rnns', 'as', 'latent', 'state', 'models', 'are', 'more', 'efficient', 'at', 'compressing', 'and', 'generating', 'long', 'sequences', 'than', 'deterministic', 'ones', 'which', 'may', 'be', 'relevant', 'for', 'applications', 'in', 'video', 'compression']] | [-0.04383427864043316, 0.09567820862182141, -0.11808523293036749, 0.08039528862504727, -0.1226695302682107, -0.1705507911659558, 0.035457813021425595, 0.45681222453713416, -0.30718038713230805, -0.29753819081439253, 0.06817588654812426, -0.2791660600986421, -0.15022187330349185, 0.1956613537225434, -0.08494299471049624, 0.01904946324922254, 0.08301405381849583, 0.055533438340267714, -0.02893748293247293, -0.25919571865130875, 0.2816399093196892, -0.0049293059761540085, 0.3154563472414499, -0.033617191350854496, 0.15003761657486286, 0.008595874719321727, -0.0603847782673684, -0.03334095748278367, -0.028303936454347638, 0.15914720801417442, 0.3106636965273484, 0.22578111268573112, 0.28184031608344573, -0.4570945402388187, -0.24340954377531648, 0.07152416813187301, 0.15121444840008147, 0.13858474559794345, -0.06385473882384009, -0.343519243756857, 0.10064980987842907, -0.14858073955675696, 0.04202411426573663, -0.17177665375501794, 0.01594986265853924, -0.015804164687185273, -0.327432186412625, 0.058173731506993884, 0.10443051901837701, 0.034293722833835465, -0.08784102293806534, -0.06493102141436846, 0.0003866966512492474, 0.1985695431515684, 0.027343810435302335, 0.02283605694058625, 0.10633605731760755, -0.17560166329584556, -0.10601451418307774, 0.37029966487110977, -0.08136825127080288, -0.2265783602371812, 0.2020921744789709, -0.030426381670815104, -0.12845774458118658, 0.11515172292368815, 0.2467236647135852, 0.09966240650357898, -0.16779221778680734, -0.04856432182543144, -0.061428002358469014, 0.22891422432559708, 0.0979041475967011, 0.014944987694787628, 0.23285352745956248, 0.19451082349919221, 0.02102378060876885, 0.1834478897665737, -0.10846312098643358, -0.07582920253386392, -0.21514654340332046, -0.13442724645137788, -0.15239897125729304, 0.03540888859287781, -0.09516437911481583, -0.1214781376752345, 0.45591602333657005, 0.20026129524066003, 0.22236464769195985, 0.09989528775639722, 0.32734839085708645, 0.04830045137170921, 0.09194746752173695, 0.05830100020667647, 0.06653231474338099, 0.007904754247625961, 0.11355335666962406, -0.13624686572070727, 0.09732857254635105, 0.049701486930579825] |
1,803.02992 | Pointing consensus for rooted out-branching graphs | Given a network of multiple agents, the pointing consensus problem asks all
agents to point toward a common target. This paper proposes a simple method to
solve the pointing consensus problem in the plane. In our formulation, each
agent does not know its own position, but has information about its own heading
vector expressed in a common coordinate frame and some desired relative angles
to the neighbors. By exchanging the heading vectors via a communication network
described by a rooted out-branching graph and controlling the angle between the
heading vectors, we show that all agents' heading vectors asymptotically point
towards the same target for almost all initial conditions. Simulations are
provided to validate the effectiveness of the proposed method.
| math.OC | given a network of multiple agents the pointing consensus problem asks all agents to point toward a common target this paper proposes a simple method to solve the pointing consensus problem in the plane in our formulation each agent does not know its own position but has information about its own heading vector expressed in a common coordinate frame and some desired relative angles to the neighbors by exchanging the heading vectors via a communication network described by a rooted outbranching graph and controlling the angle between the heading vectors we show that all agents heading vectors asymptotically point towards the same target for almost all initial conditions simulations are provided to validate the effectiveness of the proposed method | [['given', 'a', 'network', 'of', 'multiple', 'agents', 'the', 'pointing', 'consensus', 'problem', 'asks', 'all', 'agents', 'to', 'point', 'toward', 'a', 'common', 'target', 'this', 'paper', 'proposes', 'a', 'simple', 'method', 'to', 'solve', 'the', 'pointing', 'consensus', 'problem', 'in', 'the', 'plane', 'in', 'our', 'formulation', 'each', 'agent', 'does', 'not', 'know', 'its', 'own', 'position', 'but', 'has', 'information', 'about', 'its', 'own', 'heading', 'vector', 'expressed', 'in', 'a', 'common', 'coordinate', 'frame', 'and', 'some', 'desired', 'relative', 'angles', 'to', 'the', 'neighbors', 'by', 'exchanging', 'the', 'heading', 'vectors', 'via', 'a', 'communication', 'network', 'described', 'by', 'a', 'rooted', 'outbranching', 'graph', 'and', 'controlling', 'the', 'angle', 'between', 'the', 'heading', 'vectors', 'we', 'show', 'that', 'all', 'agents', 'heading', 'vectors', 'asymptotically', 'point', 'towards', 'the', 'same', 'target', 'for', 'almost', 'all', 'initial', 'conditions', 'simulations', 'are', 'provided', 'to', 'validate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method']] | [-0.17959277504984633, 0.04380781275509786, -0.05850417013700754, -0.005415974258241721, -0.11786667165393401, -0.17893682938106278, 0.12397740005824652, 0.43158928104558913, -0.3218278400286907, -0.26054762404005066, 0.08890075773536815, -0.24624140548105, -0.15145064179762072, 0.09280128197885361, -0.1037179870494308, 0.04913443257198708, 0.10075682091346684, 0.1237316737655832, -0.03480890339843052, -0.25776774621839604, 0.27571090911867235, 0.06387054395447132, 0.27347768889348795, -0.01950502707896864, 0.20317289594388685, 0.0648345923800356, -0.028875023052252893, 0.03150368505940154, -0.07531581993417534, 0.10010067941503552, 0.2715152182671077, 0.20560579941834972, 0.34590210574639946, -0.3889822764517818, -0.15572482049308656, 0.1274228272176966, 0.15438738063431712, 0.11711173995296244, -0.015044116397474367, -0.31556990243369293, 0.09737851301662061, -0.11540208638160482, -0.1672422507574328, -0.014435507419730435, 0.0029491823589225777, 0.030388301254070105, -0.2585633509369771, -0.04881303670557858, 0.0620588249267796, 0.04843375625620995, -0.09516363601129846, -0.12461036492624328, -0.034252891909847615, 0.20744972219084146, 0.05218135739261864, 0.10250297789324951, 0.14464521736391828, -0.10979486029289913, -0.13921214180348926, 0.4109025879316971, 0.03032935835115862, -0.26128930304866643, 0.16053063042868837, -0.11151337818078258, -0.09357146631550639, 0.09807265155651301, 0.17813131005988464, 0.1125171619913533, -0.18575038081582854, 0.005766777481217066, -0.07747028132571894, 0.13332440258256167, 0.07323454163514641, -0.025522978322877855, 0.21917734227824112, 0.10912713763781455, 0.16400472497755364, 0.08464913735823597, -0.05612688944596766, -0.1538831000764142, -0.27875573645167817, -0.1348889158777462, -0.20192142281712605, -0.02264803166082031, -0.11337291239932015, -0.1011109708988366, 0.40686741880602945, 0.19540621884981124, 0.2351801977492869, 0.08745580552803243, 0.33908232209123984, 0.03810558987080957, 0.010238631008713342, 0.15201865969922299, 0.22941995450973457, 0.0886838160134351, 0.08907790788832833, -0.18988350819612407, 0.1432304359452032, 0.0758500786404274] |
1,803.02993 | Dynamical Resonances and Stepped Current in an Attractive Quantum Pump | We report on the transport properties of a single mode quantum pump that
operates by the simultaneous translation and oscillation of a potential well.
We examine the dynamics comparatively using quantum, classical and
semiclassical simulations. The use of an attractive or well potential is found
to present several striking features absent if a barrier potential is used
instead, as usually favored. The trapping of particles by the well for variable
durations and subsequent release leads to a fractal-like structure in the
distribution of the classical scattering trajectories. Interference among them
leads to a rich dynamical structure in the quantum current, conspicuously
missing in the classical current. Specifically, we observe sharp steps, spikes
and dips in the current as a function of the incident energy of the carriers,
and determine that a dynamical version of Fano resonance has a role that
depends on the direction of incidence and on multiple scattering by the
potential.
| cond-mat.quant-gas | we report on the transport properties of a single mode quantum pump that operates by the simultaneous translation and oscillation of a potential well we examine the dynamics comparatively using quantum classical and semiclassical simulations the use of an attractive or well potential is found to present several striking features absent if a barrier potential is used instead as usually favored the trapping of particles by the well for variable durations and subsequent release leads to a fractallike structure in the distribution of the classical scattering trajectories interference among them leads to a rich dynamical structure in the quantum current conspicuously missing in the classical current specifically we observe sharp steps spikes and dips in the current as a function of the incident energy of the carriers and determine that a dynamical version of fano resonance has a role that depends on the direction of incidence and on multiple scattering by the potential | [['we', 'report', 'on', 'the', 'transport', 'properties', 'of', 'a', 'single', 'mode', 'quantum', 'pump', 'that', 'operates', 'by', 'the', 'simultaneous', 'translation', 'and', 'oscillation', 'of', 'a', 'potential', 'well', 'we', 'examine', 'the', 'dynamics', 'comparatively', 'using', 'quantum', 'classical', 'and', 'semiclassical', 'simulations', 'the', 'use', 'of', 'an', 'attractive', 'or', 'well', 'potential', 'is', 'found', 'to', 'present', 'several', 'striking', 'features', 'absent', 'if', 'a', 'barrier', 'potential', 'is', 'used', 'instead', 'as', 'usually', 'favored', 'the', 'trapping', 'of', 'particles', 'by', 'the', 'well', 'for', 'variable', 'durations', 'and', 'subsequent', 'release', 'leads', 'to', 'a', 'fractallike', 'structure', 'in', 'the', 'distribution', 'of', 'the', 'classical', 'scattering', 'trajectories', 'interference', 'among', 'them', 'leads', 'to', 'a', 'rich', 'dynamical', 'structure', 'in', 'the', 'quantum', 'current', 'conspicuously', 'missing', 'in', 'the', 'classical', 'current', 'specifically', 'we', 'observe', 'sharp', 'steps', 'spikes', 'and', 'dips', 'in', 'the', 'current', 'as', 'a', 'function', 'of', 'the', 'incident', 'energy', 'of', 'the', 'carriers', 'and', 'determine', 'that', 'a', 'dynamical', 'version', 'of', 'fano', 'resonance', 'has', 'a', 'role', 'that', 'depends', 'on', 'the', 'direction', 'of', 'incidence', 'and', 'on', 'multiple', 'scattering', 'by', 'the', 'potential']] | [-0.1362919602923558, 0.134367248010795, -0.09093419966756616, 0.09005981322310962, -0.03419836083262721, -0.10542322781843931, 0.07316478268468594, 0.35458314552708387, -0.2789943847817436, -0.2855942098216878, 0.061190087889211583, -0.278416814404278, -0.16790898067015375, 0.19478170910478856, -0.01105689718783681, 0.039830700056079554, 0.038337498598159866, 0.04836762709287452, -0.027413389713996473, -0.18292303121910472, 0.3308171896671791, 0.06395366257802261, 0.2800665598825302, 0.06715985163254967, 0.09275455952141118, 0.06616432572641939, 0.016648061524808796, 0.0023143576135481493, -0.1065645776102696, 0.08876546145130704, 0.16435060684654398, 0.04598952199216762, 0.23983994611764167, -0.4425315641405463, -0.2311386256813516, 0.0638128497205626, 0.15730931347516042, 0.14074788369950564, -0.09574624528618396, -0.24458780596215351, 0.025256620866118695, -0.1126246080441656, -0.13279360628327708, -0.06157653601048819, 0.020862799328051847, 0.059444334756680366, -0.24122625884475007, 0.10703727514696082, 0.05355865805386261, 0.03764844872209615, -0.04233791469824592, -0.07276223692890817, -0.007994854553401763, 0.10675315042345912, 0.02348861421208853, 0.012933350340128432, 0.1400002445873433, -0.1698222264500633, -0.14077513084025578, 0.38869220367784985, -0.08600638431247348, -0.14542851171584106, 0.2048849257902285, -0.1517411782771495, -0.05801087549870097, 0.12305420491953983, 0.1421556703600229, 0.10966616689404046, -0.12929006713348154, 0.06150663957027171, 0.0010280187479129025, 0.16148054550152297, 0.05886459191713263, 0.056767607104714984, 0.23371184117836402, 0.17223891898307925, 0.05282115599055306, 0.14941615003215916, -0.1468570964698896, -0.11839893527231575, -0.2856597463190221, -0.13492764746374603, -0.1748775715071912, 0.06673446907266195, -0.03574994070325321, -0.18122238101395077, 0.4490978441523005, 0.12223357379206706, 0.25573032576091637, -0.013886700055616744, 0.29789123530773554, 0.134166922297, 0.07769600078889649, 0.027058101184605287, 0.2642130420354554, 0.11687545572693636, 0.10212416998323759, -0.2510413210899904, 0.06616064942490578, -0.014512597645626835] |
1,803.02994 | How Images Inspire Poems: Generating Classical Chinese Poetry from
Images with Memory Networks | With the recent advances of neural models and natural language processing,
automatic generation of classical Chinese poetry has drawn significant
attention due to its artistic and cultural value. Previous works mainly focus
on generating poetry given keywords or other text information, while visual
inspirations for poetry have been rarely explored. Generating poetry from
images is much more challenging than generating poetry from text, since images
contain very rich visual information which cannot be described completely using
several keywords, and a good poem should convey the image accurately. In this
paper, we propose a memory based neural model which exploits images to generate
poems. Specifically, an Encoder-Decoder model with a topic memory network is
proposed to generate classical Chinese poetry from images. To the best of our
knowledge, this is the first work attempting to generate classical Chinese
poetry from images with neural networks. A comprehensive experimental
investigation with both human evaluation and quantitative analysis demonstrates
that the proposed model can generate poems which convey images accurately.
| cs.CL | with the recent advances of neural models and natural language processing automatic generation of classical chinese poetry has drawn significant attention due to its artistic and cultural value previous works mainly focus on generating poetry given keywords or other text information while visual inspirations for poetry have been rarely explored generating poetry from images is much more challenging than generating poetry from text since images contain very rich visual information which cannot be described completely using several keywords and a good poem should convey the image accurately in this paper we propose a memory based neural model which exploits images to generate poems specifically an encoderdecoder model with a topic memory network is proposed to generate classical chinese poetry from images to the best of our knowledge this is the first work attempting to generate classical chinese poetry from images with neural networks a comprehensive experimental investigation with both human evaluation and quantitative analysis demonstrates that the proposed model can generate poems which convey images accurately | [['with', 'the', 'recent', 'advances', 'of', 'neural', 'models', 'and', 'natural', 'language', 'processing', 'automatic', 'generation', 'of', 'classical', 'chinese', 'poetry', 'has', 'drawn', 'significant', 'attention', 'due', 'to', 'its', 'artistic', 'and', 'cultural', 'value', 'previous', 'works', 'mainly', 'focus', 'on', 'generating', 'poetry', 'given', 'keywords', 'or', 'other', 'text', 'information', 'while', 'visual', 'inspirations', 'for', 'poetry', 'have', 'been', 'rarely', 'explored', 'generating', 'poetry', 'from', 'images', 'is', 'much', 'more', 'challenging', 'than', 'generating', 'poetry', 'from', 'text', 'since', 'images', 'contain', 'very', 'rich', 'visual', 'information', 'which', 'can', 'not', 'be', 'described', 'completely', 'using', 'several', 'keywords', 'and', 'a', 'good', 'poem', 'should', 'convey', 'the', 'image', 'accurately', 'in', 'this', 'paper', 'we', 'propose', 'a', 'memory', 'based', 'neural', 'model', 'which', 'exploits', 'images', 'to', 'generate', 'poems', 'specifically', 'an', 'encoderdecoder', 'model', 'with', 'a', 'topic', 'memory', 'network', 'is', 'proposed', 'to', 'generate', 'classical', 'chinese', 'poetry', 'from', 'images', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'work', 'attempting', 'to', 'generate', 'classical', 'chinese', 'poetry', 'from', 'images', 'with', 'neural', 'networks', 'a', 'comprehensive', 'experimental', 'investigation', 'with', 'both', 'human', 'evaluation', 'and', 'quantitative', 'analysis', 'demonstrates', 'that', 'the', 'proposed', 'model', 'can', 'generate', 'poems', 'which', 'convey', 'images', 'accurately']] | [0.023325499331907643, -0.0023911946283585064, -0.09169786036973764, 0.11964854096483528, -0.18733073079478954, -0.15037967571096417, -0.009005278746965537, 0.42513001359954566, -0.2500903439306526, -0.3521259962804169, 0.06759850404637972, -0.30965172078928904, -0.2209498896542379, 0.23305368118411945, -0.1624944678390633, 0.04307708486846319, 0.13367383056013526, 0.06354056006788227, 0.0016619377472566184, -0.2721783845841572, 0.2706803579167825, 0.05345963850662023, 0.3591673202480853, -0.020310260600850966, 0.11710591839339227, -0.07101361191982103, -0.10255532730705366, -0.062106150342569784, -0.03162284970757012, 0.2338977813676089, 0.3343901754921613, 0.2303592823459739, 0.29935511941380216, -0.46402249160127906, -0.26161794271180683, 0.07637941615633712, 0.1200934017887813, 0.15011046214996765, -0.0782875533089004, -0.36522922915835937, 0.08978281967888424, -0.1457505418743358, 0.08509260378108767, -0.12040909073346233, 0.022256876217980535, -0.02367855549802513, -0.24719015750504228, 0.0018256246446893957, 0.11836787068123321, 0.09876999379453545, -0.009090393721711582, -0.11969008506972811, 0.012747836587141953, 0.21135124639875652, 0.04665769547332792, 0.1164317469790154, 0.08865529057272838, -0.19636899993676848, -0.15534335979425018, 0.43144286029085427, -0.03065830830132246, -0.19768889753488145, 0.18569755095927168, -0.06982275460077127, -0.14666604857981028, 0.09361771859987053, 0.19189501610099377, 0.10591293503613976, -0.20460867579513325, -0.02433784468887021, -0.10501377733457766, 0.2454759040122439, 0.08882502790451229, 0.014801802267013732, 0.23289047565010046, 0.2340721637400949, -0.08930910150743575, 0.1458043967715944, -0.09326381278001218, -0.08909613987107477, -0.13246208168900833, -0.09440253025288889, -0.21660555478096186, 0.0030278048770325146, -0.01435098595761075, -0.14375527362579, 0.4318540122159227, 0.2633895284672613, 0.16715854929180113, 0.08242247421168973, 0.35381285234878657, 0.004933680848965789, 0.13911805283780138, 0.04121566722225286, 0.12666954546553377, -0.0027061534521287075, 0.17392139979303553, -0.07831468018368556, 0.12704073870484855, 0.05988710928808697] |
1,803.02995 | Strong and weak second-order topological insulators with hexagonal
symmetry and $\mathbb{Z}_3$ index | We propose second-order topological insulators (SOTIs) whose lattice
structure has the hexagonal symmetry $C_{6}$ in three and two dimensions. We
start with a three-dimensional weak topological insulator constructed on the
stacked triangular lattice, which has only side topological surface states. We
then introduce an additional mass term which gaps out the side surface states
but preserves the hinge states. The resultant system is a three-dimensional
SOTI. The bulk topological quantum number is shown to be the $\mathbb{Z}_{3}$
index protected by the inversion time-reversal symmetry $IT$ and the
rotoinversion symmetry $C_{6}I$. We obtain three phases; trivial, strong and
weak SOTI phases. We argue the origin of these two types of SOTIs. A hexagonal
prism is a typical structure respecting these symmetries, where six topological
hinge states emerge at the side. The building block is a hexagon in two
dimensions, where topological corner states emerge at the six corners in the
SOTI phase. Strong and weak SOTIs are obtained when the interlayer hopping
interaction is strong and weak, respectively. They are characterized by the
emergence of hinge states attached to or detached from the bulk bands.
| cond-mat.mes-hall cond-mat.mtrl-sci | we propose secondorder topological insulators sotis whose lattice structure has the hexagonal symmetry c_6 in three and two dimensions we start with a threedimensional weak topological insulator constructed on the stacked triangular lattice which has only side topological surface states we then introduce an additional mass term which gaps out the side surface states but preserves the hinge states the resultant system is a threedimensional soti the bulk topological quantum number is shown to be the mathbbz_3 index protected by the inversion timereversal symmetry it and the rotoinversion symmetry c_6i we obtain three phases trivial strong and weak soti phases we argue the origin of these two types of sotis a hexagonal prism is a typical structure respecting these symmetries where six topological hinge states emerge at the side the building block is a hexagon in two dimensions where topological corner states emerge at the six corners in the soti phase strong and weak sotis are obtained when the interlayer hopping interaction is strong and weak respectively they are characterized by the emergence of hinge states attached to or detached from the bulk bands | [['we', 'propose', 'secondorder', 'topological', 'insulators', 'sotis', 'whose', 'lattice', 'structure', 'has', 'the', 'hexagonal', 'symmetry', 'c_6', 'in', 'three', 'and', 'two', 'dimensions', 'we', 'start', 'with', 'a', 'threedimensional', 'weak', 'topological', 'insulator', 'constructed', 'on', 'the', 'stacked', 'triangular', 'lattice', 'which', 'has', 'only', 'side', 'topological', 'surface', 'states', 'we', 'then', 'introduce', 'an', 'additional', 'mass', 'term', 'which', 'gaps', 'out', 'the', 'side', 'surface', 'states', 'but', 'preserves', 'the', 'hinge', 'states', 'the', 'resultant', 'system', 'is', 'a', 'threedimensional', 'soti', 'the', 'bulk', 'topological', 'quantum', 'number', 'is', 'shown', 'to', 'be', 'the', 'mathbbz_3', 'index', 'protected', 'by', 'the', 'inversion', 'timereversal', 'symmetry', 'it', 'and', 'the', 'rotoinversion', 'symmetry', 'c_6i', 'we', 'obtain', 'three', 'phases', 'trivial', 'strong', 'and', 'weak', 'soti', 'phases', 'we', 'argue', 'the', 'origin', 'of', 'these', 'two', 'types', 'of', 'sotis', 'a', 'hexagonal', 'prism', 'is', 'a', 'typical', 'structure', 'respecting', 'these', 'symmetries', 'where', 'six', 'topological', 'hinge', 'states', 'emerge', 'at', 'the', 'side', 'the', 'building', 'block', 'is', 'a', 'hexagon', 'in', 'two', 'dimensions', 'where', 'topological', 'corner', 'states', 'emerge', 'at', 'the', 'six', 'corners', 'in', 'the', 'soti', 'phase', 'strong', 'and', 'weak', 'sotis', 'are', 'obtained', 'when', 'the', 'interlayer', 'hopping', 'interaction', 'is', 'strong', 'and', 'weak', 'respectively', 'they', 'are', 'characterized', 'by', 'the', 'emergence', 'of', 'hinge', 'states', 'attached', 'to', 'or', 'detached', 'from', 'the', 'bulk', 'bands']] | [-0.23184346991191654, 0.2228084237435152, -0.046167813235120286, 0.04609351708296727, -0.052104114087888856, -0.19623450207895513, 0.03541013286538076, 0.36564812878441944, -0.2928027011367589, -0.2528465056303339, 0.09866104785243528, -0.3212029536361577, -0.16753905601265123, 0.08255899386210723, 0.03184433360685864, 0.025548802641642793, -0.03640263441497144, -0.00991568234087543, -0.12537354776569606, -0.22297987949657838, 0.34064889071722987, -0.07397786017235043, 0.3183327144001677, 0.06480145357966505, 0.023356155767181856, -0.01962006178460608, 0.09549521652299686, 0.0375957398985823, -0.13549430576176, 0.08431100895783554, 0.170118718991079, -0.0756398433631113, 0.13825510616052916, -0.46073906611182974, -0.19311225906146762, 0.023334494167862492, 0.08360299087877644, 0.1450024407708132, -0.05628482276342219, -0.3324690056567798, 0.08102716911390749, -0.13482805866305334, -0.11338071633369504, -0.09018139551900063, -0.03497502421502207, -0.07409911948800739, -0.2061972814984874, 0.061117757201484844, 0.07421954200078881, 0.0758320046194366, -0.03508276326322287, -0.1019265650220653, -0.16821303424842737, 0.12205189804987386, 0.032815097076716565, 0.0017858236402151038, 0.040034491054159, -0.13780584743836782, -0.1297929406858207, 0.38845083817758197, -0.01656629953754791, -0.1656440846301371, 0.2272283798121832, -0.1324567913048827, -0.13787922498520688, 0.1382869472243706, 0.09234378936247585, 0.08119344352215323, -0.06241364218970529, 0.10042898059037611, -0.06615223119015007, 0.15530346438181816, 0.039747303139286046, 0.09615827542398878, 0.2778802078034057, 0.10870500318985941, 0.10821222458179477, 0.18573067160615891, -0.12256659607179056, -0.08411247289581784, -0.2869511552847148, -0.15582234315228105, -0.23491939119587504, 0.050411632882502395, -0.053775865747386596, -0.20538642661072837, 0.42982242062250203, 0.04126802184542672, 0.2085150826195652, -0.025982984991825588, 0.20994207795577052, 0.11106798079760512, 0.09584537805999563, 0.06039199250612835, 0.25748431676606864, 0.11731992274792509, 0.0070191856226858385, -0.21203083442835788, -0.004850659616128669, 0.12426962202944146] |
1,803.02996 | Bifurcation from Infinity and Multiplicity of the Landesman-Lazer Type
Problem of Elliptic Equations | This paper deals with the Landesman-Lazer type problem of elliptic equations
associated with homogeneous Dirichlet boundary conditions. By using some
dynamical arguments we derive some new results on bifurcation from infinity and
multiplicity of the problems.
| math.DS | this paper deals with the landesmanlazer type problem of elliptic equations associated with homogeneous dirichlet boundary conditions by using some dynamical arguments we derive some new results on bifurcation from infinity and multiplicity of the problems | [['this', 'paper', 'deals', 'with', 'the', 'landesmanlazer', 'type', 'problem', 'of', 'elliptic', 'equations', 'associated', 'with', 'homogeneous', 'dirichlet', 'boundary', 'conditions', 'by', 'using', 'some', 'dynamical', 'arguments', 'we', 'derive', 'some', 'new', 'results', 'on', 'bifurcation', 'from', 'infinity', 'and', 'multiplicity', 'of', 'the', 'problems']] | [-0.16016976017918852, 0.04612314109949188, -0.11386095634144214, 0.041513113625114784, -0.14792507580973002, -0.14473757115774788, -0.006705575231333367, 0.24920181583406198, -0.2814936957050425, -0.22137100653102001, 0.2081262376030079, -0.2712357088199092, -0.16656019548989004, 0.21630811479796344, -0.13413614596033263, 0.1353971730503771, 0.13429715065285563, 0.07468066117467566, -0.10860257049919003, -0.19762452132999897, 0.5253510802156396, -0.07637145776405102, 0.1721185487177637, 0.03216940009345611, 0.06522779449490675, -0.014860813376597233, -0.05013880867045373, 0.0366330423599316, -0.28369936790032724, 0.1291664690458371, 0.21408403382196817, 0.044512856140499935, 0.2869884013198316, -0.443740143130223, -0.19794050684302217, 0.10510365530434582, 0.11989271850325167, 0.06902275081908253, -0.044334730628179386, -0.2878359297497405, 0.10913799405615363, -0.09946760268778437, -0.26096252793084, 0.002411119465250522, -0.10914343913706641, 0.11026115009574117, -0.2848973337871333, 0.13291085440303302, 0.06929771090815645, 0.12141997835391925, -0.19904972304195528, -0.11725764208111084, 0.025308472000890307, 0.015060853394162323, 0.09755386218764922, -0.05685081611025251, -0.01978281972050253, -0.11672857956727967, -0.12244011565215057, 0.3234368493366573, -0.014174542761692364, -0.27326016197265646, 0.21729155143515932, -0.10949506482575089, -0.1853924347475792, 0.11113834103323622, 0.17303415092950067, 0.17115956327567497, -0.163355273168741, 0.13997361019816404, -0.07243678819375216, 0.07503394653192824, 0.11699089640751481, -0.055740420085688434, 0.09888271591626108, 0.09639062742806143, 0.10068490876195331, 0.19663894425482592, 0.010061444648373354, -0.10216897736406988, -0.40349722043093705, -0.10160536453541782, -0.09867344295424926, 0.11234679903524618, -0.14782399191325465, -0.18292555179343456, 0.36132402655978996, 0.13195885992091563, 0.22271086120357117, 0.08624512828989989, 0.19604385111273992, 0.18728620499475962, -0.06851788294605082, 0.06235654331329796, 0.12185781087706953, 0.19079292630906114, 0.1652456958286671, -0.22756505190368947, 0.010795907583087683, 0.18845750434168926] |
1,803.02997 | Quantum transport in coupled Majorana box systems | We present a theoretical analysis of low-energy quantum transport in coupled
Majorana box devices. A single Majorana box represents a Coulomb-blockaded
mesoscopic superconductor proximitizing two or more long topological nanowires.
The box thus harbors at least four Majorana zero modes (MZMs). Setups with
several Majorana boxes, where MZMs on different boxes are tunnel-coupled via
short nanowire segments, are key ingredients to recent Majorana qubit and code
network proposals. We construct and study the low-energy theory for
multi-terminal junctions with normal leads connected to the coupled box device
by lead-MZM tunnel contacts. Transport experiments in such setups can test the
nonlocality of Majorana-based systems and the integrity of the underlying
Majorana qubits. For a single box, we recover the previously described
topological Kondo effect which can be captured by a purely bosonic theory. For
several coupled boxes, however, non-conserved local fermion parities require
the inclusion of additional local sets of Pauli operators. We present a
renormalization group analysis and develop a nonperturbative strong-coupling
approach to quantum transport in such systems. Our findings are illustrated for
several examples, including a loop qubit device and different two-box setups.
| cond-mat.mes-hall | we present a theoretical analysis of lowenergy quantum transport in coupled majorana box devices a single majorana box represents a coulombblockaded mesoscopic superconductor proximitizing two or more long topological nanowires the box thus harbors at least four majorana zero modes mzms setups with several majorana boxes where mzms on different boxes are tunnelcoupled via short nanowire segments are key ingredients to recent majorana qubit and code network proposals we construct and study the lowenergy theory for multiterminal junctions with normal leads connected to the coupled box device by leadmzm tunnel contacts transport experiments in such setups can test the nonlocality of majoranabased systems and the integrity of the underlying majorana qubits for a single box we recover the previously described topological kondo effect which can be captured by a purely bosonic theory for several coupled boxes however nonconserved local fermion parities require the inclusion of additional local sets of pauli operators we present a renormalization group analysis and develop a nonperturbative strongcoupling approach to quantum transport in such systems our findings are illustrated for several examples including a loop qubit device and different twobox setups | [['we', 'present', 'a', 'theoretical', 'analysis', 'of', 'lowenergy', 'quantum', 'transport', 'in', 'coupled', 'majorana', 'box', 'devices', 'a', 'single', 'majorana', 'box', 'represents', 'a', 'coulombblockaded', 'mesoscopic', 'superconductor', 'proximitizing', 'two', 'or', 'more', 'long', 'topological', 'nanowires', 'the', 'box', 'thus', 'harbors', 'at', 'least', 'four', 'majorana', 'zero', 'modes', 'mzms', 'setups', 'with', 'several', 'majorana', 'boxes', 'where', 'mzms', 'on', 'different', 'boxes', 'are', 'tunnelcoupled', 'via', 'short', 'nanowire', 'segments', 'are', 'key', 'ingredients', 'to', 'recent', 'majorana', 'qubit', 'and', 'code', 'network', 'proposals', 'we', 'construct', 'and', 'study', 'the', 'lowenergy', 'theory', 'for', 'multiterminal', 'junctions', 'with', 'normal', 'leads', 'connected', 'to', 'the', 'coupled', 'box', 'device', 'by', 'leadmzm', 'tunnel', 'contacts', 'transport', 'experiments', 'in', 'such', 'setups', 'can', 'test', 'the', 'nonlocality', 'of', 'majoranabased', 'systems', 'and', 'the', 'integrity', 'of', 'the', 'underlying', 'majorana', 'qubits', 'for', 'a', 'single', 'box', 'we', 'recover', 'the', 'previously', 'described', 'topological', 'kondo', 'effect', 'which', 'can', 'be', 'captured', 'by', 'a', 'purely', 'bosonic', 'theory', 'for', 'several', 'coupled', 'boxes', 'however', 'nonconserved', 'local', 'fermion', 'parities', 'require', 'the', 'inclusion', 'of', 'additional', 'local', 'sets', 'of', 'pauli', 'operators', 'we', 'present', 'a', 'renormalization', 'group', 'analysis', 'and', 'develop', 'a', 'nonperturbative', 'strongcoupling', 'approach', 'to', 'quantum', 'transport', 'in', 'such', 'systems', 'our', 'findings', 'are', 'illustrated', 'for', 'several', 'examples', 'including', 'a', 'loop', 'qubit', 'device', 'and', 'different', 'twobox', 'setups']] | [-0.21964681105695807, 0.19017718254421515, -0.01792252513721747, 0.06405793004365556, -0.023776352105652102, -0.285393980058396, 0.052365029536304064, 0.3174306832863848, -0.18074312212917468, -0.30162947591262584, 0.01571902117006096, -0.33173673439001583, -0.10246694936422104, 0.2123153450299034, 0.004370829601691145, 0.10598907573148608, 0.04174605070653817, -0.012193590174834042, -0.06692357201372152, -0.23435191826517796, 0.3228132513417538, -0.037374857689112265, 0.2985264108941445, 0.05272109377825552, 0.04630447243866713, -0.01787356207458525, 0.04887183765000056, 0.01698921316204613, -0.11871714271736615, 0.06985699834426075, 0.24866375880336147, -0.03942986949519052, 0.19231984210352454, -0.5363883291087721, -0.22963137562265215, 0.018609541083645563, 0.1789863790036179, 0.18423026579662488, -0.05334499601564818, -0.34690919267924747, 0.06985493691425528, -0.19421442804488595, -0.07553755466276767, -0.11448191661822973, -0.048347967780579856, -0.07006964185838234, -0.24585844666327591, 0.059172711064963114, 0.020690301672995858, 0.04530072225885385, 0.05342259575920015, -0.061315116389026945, 0.011003509528287079, 0.11597833286783577, -0.029368511584123, -0.03887120075397315, 0.15659920929386356, -0.11999679121198943, -0.19539676374077555, 0.3031341246646859, -0.02957229059614727, -0.2083581476092703, 0.21806332294363528, -0.09739180086889183, -0.07160646577983204, 0.04613608160845773, 0.10887436320848318, 0.10116945918517835, -0.16868726738966475, 0.08569752846933229, -0.06965409006680483, 0.13881526825666105, 0.00940835867811035, 0.11378610817179002, 0.30277759165239887, 0.20422264222946504, 0.05836911616674827, 0.14437002243674057, -0.10294082225553448, -0.11011865035676316, -0.3423795257745635, -0.16957345857720255, -0.22976003179792315, 0.07577929775984756, -0.0513573384854997, -0.20245466446099075, 0.4395943437601723, 0.15238971711685578, 0.16276817347059716, -0.015230271357880987, 0.27525775452111545, 0.08889163667449991, 0.11468901543032742, 0.03333907312480733, 0.16636994397065238, 0.15898934181820115, 0.015776181040564552, -0.28008397550231323, -0.04306650886744889, 0.06902047842690397] |
1,803.02998 | DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware
Scheduling | We consider networked control systems consisting of multiple independent
controlled subsystems, operating over a shared communication network. Such
systems are ubiquitous in cyber-physical systems, Internet of Things, and
large-scale industrial systems. In many large-scale settings, the size of the
communication network is smaller than the size of the system. In consequence,
scheduling issues arise. The main contribution of this paper is to develop a
deep reinforcement learning-based \emph{control-aware} scheduling
(\textsc{DeepCAS}) algorithm to tackle these issues. We use the following
(optimal) design strategy: First, we synthesize an optimal controller for each
subsystem; next, we design a learning algorithm that adapts to the chosen
subsystems (plants) and controllers. As a consequence of this adaptation, our
algorithm finds a schedule that minimizes the \emph{control loss}. We present
empirical results to show that \textsc{DeepCAS} finds schedules with better
performance than periodic ones.
| cs.SY cs.AI | we consider networked control systems consisting of multiple independent controlled subsystems operating over a shared communication network such systems are ubiquitous in cyberphysical systems internet of things and largescale industrial systems in many largescale settings the size of the communication network is smaller than the size of the system in consequence scheduling issues arise the main contribution of this paper is to develop a deep reinforcement learningbased emphcontrolaware scheduling textscdeepcas algorithm to tackle these issues we use the following optimal design strategy first we synthesize an optimal controller for each subsystem next we design a learning algorithm that adapts to the chosen subsystems plants and controllers as a consequence of this adaptation our algorithm finds a schedule that minimizes the emphcontrol loss we present empirical results to show that textscdeepcas finds schedules with better performance than periodic ones | [['we', 'consider', 'networked', 'control', 'systems', 'consisting', 'of', 'multiple', 'independent', 'controlled', 'subsystems', 'operating', 'over', 'a', 'shared', 'communication', 'network', 'such', 'systems', 'are', 'ubiquitous', 'in', 'cyberphysical', 'systems', 'internet', 'of', 'things', 'and', 'largescale', 'industrial', 'systems', 'in', 'many', 'largescale', 'settings', 'the', 'size', 'of', 'the', 'communication', 'network', 'is', 'smaller', 'than', 'the', 'size', 'of', 'the', 'system', 'in', 'consequence', 'scheduling', 'issues', 'arise', 'the', 'main', 'contribution', 'of', 'this', 'paper', 'is', 'to', 'develop', 'a', 'deep', 'reinforcement', 'learningbased', 'emphcontrolaware', 'scheduling', 'textscdeepcas', 'algorithm', 'to', 'tackle', 'these', 'issues', 'we', 'use', 'the', 'following', 'optimal', 'design', 'strategy', 'first', 'we', 'synthesize', 'an', 'optimal', 'controller', 'for', 'each', 'subsystem', 'next', 'we', 'design', 'a', 'learning', 'algorithm', 'that', 'adapts', 'to', 'the', 'chosen', 'subsystems', 'plants', 'and', 'controllers', 'as', 'a', 'consequence', 'of', 'this', 'adaptation', 'our', 'algorithm', 'finds', 'a', 'schedule', 'that', 'minimizes', 'the', 'emphcontrol', 'loss', 'we', 'present', 'empirical', 'results', 'to', 'show', 'that', 'textscdeepcas', 'finds', 'schedules', 'with', 'better', 'performance', 'than', 'periodic', 'ones']] | [-0.20677970639533466, 0.020574142519250962, -0.04924777252944531, 0.02024276205511005, -0.06491902236033369, -0.17857269227021821, 0.04904931252110853, 0.400985524893083, -0.30612147934734824, -0.31404637590878537, 0.10514464446395222, -0.2360926849345021, -0.22570894759286333, 0.22872045563740862, -0.16229976631907952, 0.10480366770729975, 0.08557186970763185, -0.012503562044973176, -0.012841741638947968, -0.2665821247164988, 0.3117185450055533, 0.03169212298342717, 0.29849278923744954, -0.04068397429806215, 0.11697631772193644, 0.01366011750349706, 0.016496776865312347, -0.003500139245901395, -0.08899547157510554, 0.1560798593486349, 0.33235423407620857, 0.21171996126644513, 0.38340900764559155, -0.41089002573517736, -0.1954170269055154, 0.14190711493914326, 0.1603054593903599, 0.0991242762344579, -0.03514594120766829, -0.22740937795283067, 0.10380820870158021, -0.19660261761811043, -0.06912112186352412, -0.060373237698028485, -0.031673317595764444, 0.0338897222644408, -0.31201750695946867, -0.021176360054286542, 0.029692442435771228, 0.028125225269684084, -0.08707771359046024, -0.10312417010966413, 0.05735204669871126, 0.1736613563330913, 0.003707462203412972, -0.013151570823457507, 0.1934202454328813, -0.09154124921877627, -0.18147800159813077, 0.3694802503205008, 0.012890637525210708, -0.16434092102227388, 0.20179996549117343, -0.0033843406027665845, -0.17712696346764764, 0.08587189945564777, 0.2859674228200068, 0.09916703332801936, -0.17472403319207608, 0.005149080834558441, -0.04007871618701352, 0.21117652546165994, -0.00305309165959005, 0.04875996058668803, 0.1286145878593541, 0.2865450486402821, 0.19157566887593863, 0.17305877547693888, -0.013006536921279298, -0.1278921753720001, -0.23988657912058342, -0.12887015588305614, -0.173815730234815, -0.007692334443951647, -0.07708924924243345, -0.13356253594694728, 0.3675524490299048, 0.22166935787018802, 0.16263692869149424, 0.10729466056520189, 0.3757627664582321, 0.05752631608802066, 0.08779164751025814, 0.15522916244204948, 0.17544778536280825, 0.025981519266066178, 0.15538478065540806, -0.23220207428697634, 0.07495181318717423, -0.005057814573282721] |
1,803.02999 | On First-Order Meta-Learning Algorithms | This paper considers meta-learning problems, where there is a distribution of
tasks, and we would like to obtain an agent that performs well (i.e., learns
quickly) when presented with a previously unseen task sampled from this
distribution. We analyze a family of algorithms for learning a parameter
initialization that can be fine-tuned quickly on a new task, using only
first-order derivatives for the meta-learning updates. This family includes and
generalizes first-order MAML, an approximation to MAML obtained by ignoring
second-order derivatives. It also includes Reptile, a new algorithm that we
introduce here, which works by repeatedly sampling a task, training on it, and
moving the initialization towards the trained weights on that task. We expand
on the results from Finn et al. showing that first-order meta-learning
algorithms perform well on some well-established benchmarks for few-shot
classification, and we provide theoretical analysis aimed at understanding why
these algorithms work.
| cs.LG | this paper considers metalearning problems where there is a distribution of tasks and we would like to obtain an agent that performs well ie learns quickly when presented with a previously unseen task sampled from this distribution we analyze a family of algorithms for learning a parameter initialization that can be finetuned quickly on a new task using only firstorder derivatives for the metalearning updates this family includes and generalizes firstorder maml an approximation to maml obtained by ignoring secondorder derivatives it also includes reptile a new algorithm that we introduce here which works by repeatedly sampling a task training on it and moving the initialization towards the trained weights on that task we expand on the results from finn et al showing that firstorder metalearning algorithms perform well on some wellestablished benchmarks for fewshot classification and we provide theoretical analysis aimed at understanding why these algorithms work | [['this', 'paper', 'considers', 'metalearning', 'problems', 'where', 'there', 'is', 'a', 'distribution', 'of', 'tasks', 'and', 'we', 'would', 'like', 'to', 'obtain', 'an', 'agent', 'that', 'performs', 'well', 'ie', 'learns', 'quickly', 'when', 'presented', 'with', 'a', 'previously', 'unseen', 'task', 'sampled', 'from', 'this', 'distribution', 'we', 'analyze', 'a', 'family', 'of', 'algorithms', 'for', 'learning', 'a', 'parameter', 'initialization', 'that', 'can', 'be', 'finetuned', 'quickly', 'on', 'a', 'new', 'task', 'using', 'only', 'firstorder', 'derivatives', 'for', 'the', 'metalearning', 'updates', 'this', 'family', 'includes', 'and', 'generalizes', 'firstorder', 'maml', 'an', 'approximation', 'to', 'maml', 'obtained', 'by', 'ignoring', 'secondorder', 'derivatives', 'it', 'also', 'includes', 'reptile', 'a', 'new', 'algorithm', 'that', 'we', 'introduce', 'here', 'which', 'works', 'by', 'repeatedly', 'sampling', 'a', 'task', 'training', 'on', 'it', 'and', 'moving', 'the', 'initialization', 'towards', 'the', 'trained', 'weights', 'on', 'that', 'task', 'we', 'expand', 'on', 'the', 'results', 'from', 'finn', 'et', 'al', 'showing', 'that', 'firstorder', 'metalearning', 'algorithms', 'perform', 'well', 'on', 'some', 'wellestablished', 'benchmarks', 'for', 'fewshot', 'classification', 'and', 'we', 'provide', 'theoretical', 'analysis', 'aimed', 'at', 'understanding', 'why', 'these', 'algorithms', 'work']] | [-0.016345118789153325, 0.028284512282659085, -0.09577214418646149, 0.05221344221767189, -0.14112325841749743, -0.18669564198589306, 0.08610328804914733, 0.4483313899364549, -0.24322354393960857, -0.32873570821499704, 0.06797777042831168, -0.23430357560376963, -0.2063894411800681, 0.2197175847643332, -0.13097462596602485, 0.07529413277232969, 0.10871558026033076, 0.03117748352284449, -0.08115494551885924, -0.3011841853086308, 0.3039636078252885, 0.03787401429931256, 0.2497983656515292, -0.0018294416808498067, 0.1384550747963068, 0.00472853724794412, -0.005867585275523566, 0.02313612457176016, -0.11607861639645675, 0.11322684232633233, 0.28537747511054967, 0.1996818995952757, 0.3386302185999985, -0.35006330135228064, -0.20894576192556605, 0.08021436256476099, 0.14627442216953715, 0.15376051826594472, -0.061729788960341515, -0.31641834648955314, 0.071916894807883, -0.1504779121322507, -0.009401916930565258, -0.19027069889046755, -0.03440073679824284, -0.017005993289294075, -0.3193549344983153, 0.03261926046370472, 0.11922357587703832, 0.021258183034464112, -0.04588396960045085, -0.13519545126316213, 0.08174591980610244, 0.09567707499140729, 0.01656184725406756, 0.0687996122476368, 0.09709738313245612, -0.1282985833067623, -0.15779627549361336, 0.3506115920789779, -0.0526200034309531, -0.19358281938459826, 0.19687206807508562, -0.017428021279409074, -0.21112613793387003, 0.06332914197087489, 0.20879988351559922, 0.19277814202281218, -0.13585317896797425, 0.040914048011276266, -0.06679385745381886, 0.15985564737442276, 0.04258660496074102, -0.06721460406441947, 0.1262130851556887, 0.22322257100195447, 0.08152618691501384, 0.15522706544898274, -0.07241243729367852, -0.11552746848689355, -0.26174678708225285, -0.1085445551340141, -0.20591544071715828, -0.012506664157184344, -0.05062588354583666, -0.15684645439535883, 0.3856822209231354, 0.22511046853331798, 0.2487371078302228, 0.13865484666736871, 0.33268373813857705, 0.06333119419050982, 0.05892641580588109, 0.1408395203242607, 0.19231890281288716, 0.0035038261982687823, 0.11265852113295272, -0.1618238694594569, 0.10479273070479787, 0.08813652661282921] |
1,803.03 | Heavy-Light Mesons in the Non-Relativistic Quark Model Using Laplace
Transformation Method | An analytic solution of the N-dimensional radial Schr\"odinger equation with
the mixture of vector and scalar potentials via the Laplace transformation
method (LTM) is studied. The present potential is extended to include the spin
hyperfine, spin-orbit and tensor interactions. The energy eigenvalues and the
corresponding eigenfunctions have been determined in the N-dimensional space.
The present results are employed to study the different properties of the
heavy-light mesons. The masses of the scalar, vector, pseudoscalar and
pseudovector of B, Bs, D and Ds mesons have been calculated in the three
dimensional space. The effect of the dimensional number space is studied on the
masses of the heavy-light mesons. We find that the meson mass increases with
increasing dimensional space. The decay constants of the pseudoscalar and
vector mesons have been computed. In addition, the leptonic decay widths and
branching ratio for the B+, D+ and Ds+ mesons have been studied. Therefore, the
present method with the present potential gives good results which are in good
agreement with experimental data and are improved in comparison with recently
theoretical works.
| hep-ph | an analytic solution of the ndimensional radial schrodinger equation with the mixture of vector and scalar potentials via the laplace transformation method ltm is studied the present potential is extended to include the spin hyperfine spinorbit and tensor interactions the energy eigenvalues and the corresponding eigenfunctions have been determined in the ndimensional space the present results are employed to study the different properties of the heavylight mesons the masses of the scalar vector pseudoscalar and pseudovector of b bs d and ds mesons have been calculated in the three dimensional space the effect of the dimensional number space is studied on the masses of the heavylight mesons we find that the meson mass increases with increasing dimensional space the decay constants of the pseudoscalar and vector mesons have been computed in addition the leptonic decay widths and branching ratio for the b d and ds mesons have been studied therefore the present method with the present potential gives good results which are in good agreement with experimental data and are improved in comparison with recently theoretical works | [['an', 'analytic', 'solution', 'of', 'the', 'ndimensional', 'radial', 'schrodinger', 'equation', 'with', 'the', 'mixture', 'of', 'vector', 'and', 'scalar', 'potentials', 'via', 'the', 'laplace', 'transformation', 'method', 'ltm', 'is', 'studied', 'the', 'present', 'potential', 'is', 'extended', 'to', 'include', 'the', 'spin', 'hyperfine', 'spinorbit', 'and', 'tensor', 'interactions', 'the', 'energy', 'eigenvalues', 'and', 'the', 'corresponding', 'eigenfunctions', 'have', 'been', 'determined', 'in', 'the', 'ndimensional', 'space', 'the', 'present', 'results', 'are', 'employed', 'to', 'study', 'the', 'different', 'properties', 'of', 'the', 'heavylight', 'mesons', 'the', 'masses', 'of', 'the', 'scalar', 'vector', 'pseudoscalar', 'and', 'pseudovector', 'of', 'b', 'bs', 'd', 'and', 'ds', 'mesons', 'have', 'been', 'calculated', 'in', 'the', 'three', 'dimensional', 'space', 'the', 'effect', 'of', 'the', 'dimensional', 'number', 'space', 'is', 'studied', 'on', 'the', 'masses', 'of', 'the', 'heavylight', 'mesons', 'we', 'find', 'that', 'the', 'meson', 'mass', 'increases', 'with', 'increasing', 'dimensional', 'space', 'the', 'decay', 'constants', 'of', 'the', 'pseudoscalar', 'and', 'vector', 'mesons', 'have', 'been', 'computed', 'in', 'addition', 'the', 'leptonic', 'decay', 'widths', 'and', 'branching', 'ratio', 'for', 'the', 'b', 'd', 'and', 'ds', 'mesons', 'have', 'been', 'studied', 'therefore', 'the', 'present', 'method', 'with', 'the', 'present', 'potential', 'gives', 'good', 'results', 'which', 'are', 'in', 'good', 'agreement', 'with', 'experimental', 'data', 'and', 'are', 'improved', 'in', 'comparison', 'with', 'recently', 'theoretical', 'works']] | [-0.09506242260985381, 0.1780701371221073, -0.04420412456160306, 0.06156819153742833, -0.04165820201390586, -0.11947567660445715, -0.009363696494765874, 0.3737406646832824, -0.1697870844627841, -0.2377992954189326, 0.0182513268605285, -0.2980605910379587, -0.07104231732750133, 0.1180811145258699, 0.08414469448860082, 0.12616471865998402, 0.06399862671870801, 0.08355284705994871, -0.08817350908214132, -0.22814470579279428, 0.3532834164850877, -0.020388469762973867, 0.22407477870609843, 0.09596265298656403, 0.03199055778865024, -0.002963241136772295, -0.03347010306203685, -0.01439293727902222, -0.1445782553856501, 0.1143042238950098, 0.16661524584801016, 0.08318894387270181, 0.17361922345339914, -0.3665059924041484, -0.19756685307586178, 0.13367214876800607, 0.17157387630593052, 0.09235487651674466, -0.053838435958381635, -0.33525699351014476, 0.08991152025814468, -0.14289983830251599, -0.13691693878506367, -0.14705642886817624, 0.050493514809841655, -0.0017388578896321313, -0.3147352351728132, 0.09731067098863538, -0.04288104110223762, 0.030688506977285368, -0.13279363995096988, -0.23880577437306022, -0.04338707209769952, 0.0700437274635217, 0.1239705838876024, 0.08600801635023185, 0.08253263690019563, -0.0888148496301281, -0.12560002743213905, 0.4017892555665162, -0.10863695182642863, -0.24375904637496093, 0.1472832540649984, -0.15750521125198252, -0.08829805570721, 0.11067933386907318, 0.20448949172998132, 0.08374387672234138, -0.1456485823386133, 0.16675234993486954, -0.06017090592238694, 0.11671482063672048, 0.063656988840466, 0.08446481321522496, 0.16471572650207134, 0.14636135016604837, -0.04799389866007082, 0.09437631580210422, -0.07238107897988441, -0.10399792703278994, -0.2808297345004344, -0.16216523711185502, -0.1532984368343927, 0.030382350334466176, -0.10316556824381413, -0.09500214424363132, 0.39721337892115116, 0.04816806224328703, 0.24858257849602092, 0.031843841439612885, 0.28583917698144157, 0.14143057398519104, 0.06163901824433104, 0.0850945994347376, 0.3227550550672261, 0.23484646689836042, 0.13351498549477867, -0.27972663233930106, -0.031069853153648012, 0.074142501158061] |
1,803.03001 | Gravitational field of global monopole within the Eddington-inspired
Born-Infeld theory of gravity | Within the framework of the recent Eddington-inspired Born-Infeld (EiBI)
theory we study gravitational field around an $SO(3)$ global monopole. The
solution also suffers from the deficit solid angle as in the Barriola-Vilenkin
metric but shows a distinct feature that cannot be transformed away unless in
the vanishing EiBI coupling constant, $\kappa$. When seen as a black hole
eating up a global monopole, the corresponding Schwarzschild horizon is shrunk
by $\kappa$. The deficit solid angle makes the space is globally not Euclidean,
and to first order in $\kappa$ (weak-field limit) the deflection angle of light
is smaller than its Barriola-Vilenkin counterpart.
| gr-qc hep-th | within the framework of the recent eddingtoninspired borninfeld eibi theory we study gravitational field around an so3 global monopole the solution also suffers from the deficit solid angle as in the barriolavilenkin metric but shows a distinct feature that cannot be transformed away unless in the vanishing eibi coupling constant kappa when seen as a black hole eating up a global monopole the corresponding schwarzschild horizon is shrunk by kappa the deficit solid angle makes the space is globally not euclidean and to first order in kappa weakfield limit the deflection angle of light is smaller than its barriolavilenkin counterpart | [['within', 'the', 'framework', 'of', 'the', 'recent', 'eddingtoninspired', 'borninfeld', 'eibi', 'theory', 'we', 'study', 'gravitational', 'field', 'around', 'an', 'so3', 'global', 'monopole', 'the', 'solution', 'also', 'suffers', 'from', 'the', 'deficit', 'solid', 'angle', 'as', 'in', 'the', 'barriolavilenkin', 'metric', 'but', 'shows', 'a', 'distinct', 'feature', 'that', 'can', 'not', 'be', 'transformed', 'away', 'unless', 'in', 'the', 'vanishing', 'eibi', 'coupling', 'constant', 'kappa', 'when', 'seen', 'as', 'a', 'black', 'hole', 'eating', 'up', 'a', 'global', 'monopole', 'the', 'corresponding', 'schwarzschild', 'horizon', 'is', 'shrunk', 'by', 'kappa', 'the', 'deficit', 'solid', 'angle', 'makes', 'the', 'space', 'is', 'globally', 'not', 'euclidean', 'and', 'to', 'first', 'order', 'in', 'kappa', 'weakfield', 'limit', 'the', 'deflection', 'angle', 'of', 'light', 'is', 'smaller', 'than', 'its', 'barriolavilenkin', 'counterpart']] | [-0.15826155155629731, 0.1319097449870764, -0.082527360708296, 0.09222840430044413, -0.11046695531723966, -0.14093445448924113, 0.012713455275798419, 0.30452911959647544, -0.23277685769123607, -0.2837079641326229, 0.08766490643000285, -0.3051397119657976, -0.1270941961003412, 0.1548948424434898, -0.06797272011886656, 0.0012061406511324688, -0.04990836817743533, 0.09085643368123081, -0.1403183538840143, -0.15281710298824133, 0.3315684730417584, 0.0828467909209799, 0.2390233115915504, 0.01278371081715173, 0.07688299147873232, -0.02481556081646445, 0.06639658735308906, 0.13434009853315926, -0.1343982079240527, 0.0071384947802318206, 0.16683480815298043, 0.09215981424278995, 0.20387149270275828, -0.36296782360439844, -0.23111862788728374, 0.10769257011205548, 0.16532542778750753, 0.12996879395208147, -0.025762130969692723, -0.30090660625828963, 0.05634529311394337, -0.18205825310191232, -0.2024369142894255, -0.0386184692096961, 0.07676908945189881, -0.10157533030781785, -0.2015970959835271, 0.11109766445444243, 0.05326120960203433, -0.03411125899799684, -0.09157243743077806, -0.07829852568649567, -0.06454005173527368, 0.07270209563551425, 0.1655269383411338, 0.14271060644077266, 0.15925189470503442, -0.14800135842939416, -0.05684433430248853, 0.3932281903332413, -0.1301902251977688, -0.20593334208611436, 0.08910756941774103, -0.23863883027438038, -0.056546643625317826, 0.15007548527515466, 0.09801431361696508, 0.1921134539096072, -0.10493136978651152, 0.16166618824095033, -0.03727676956176684, 0.20761521182733006, 0.12876867733683695, 0.020151001627160475, 0.30844605668899744, 0.11726544515949001, 0.10034595682553135, 0.1251643651826676, -0.0944361972200712, -0.1173578764745357, -0.32583554962069017, -0.1317858701770074, -0.1477427516077267, 0.1063694724087525, -0.17303659471364502, -0.16175649230263833, 0.27695733363196107, 0.06472413254311622, 0.14493871186998222, 0.03872751107550051, 0.2784717932970512, 0.10057072375444603, 0.06004198120289141, 0.11192029890244698, 0.41053383620133127, 0.11350962517801488, 0.11788576783723023, -0.22449407054544748, -0.011944617014516625, 0.08866812533579103] |
1,803.03002 | Energy budget of cosmological first-order phase transition in FLRW
background | We study the hydrodynamics of bubble expansion in cosmological first-order
phase transition in the Friedmann-Lema\^{\i}tre-Robertson-Walker (FLRW)
background with probe limit. Different from previous studies for fast
first-order phase transition in flat background, we find that, for slow
first-order phase transition in FLRW background with a given peculiar velocity
of the bubble wall, the efficiency factor of energy transfer into bulk motion
of thermal fluid is significantly reduced, thus decreasing the
previously-thought dominated contribution from sound wave to the stochastic
gravitational-wave background.
| gr-qc astro-ph.CO hep-ph | we study the hydrodynamics of bubble expansion in cosmological firstorder phase transition in the friedmannlemaitrerobertsonwalker flrw background with probe limit different from previous studies for fast firstorder phase transition in flat background we find that for slow firstorder phase transition in flrw background with a given peculiar velocity of the bubble wall the efficiency factor of energy transfer into bulk motion of thermal fluid is significantly reduced thus decreasing the previouslythought dominated contribution from sound wave to the stochastic gravitationalwave background | [['we', 'study', 'the', 'hydrodynamics', 'of', 'bubble', 'expansion', 'in', 'cosmological', 'firstorder', 'phase', 'transition', 'in', 'the', 'friedmannlemaitrerobertsonwalker', 'flrw', 'background', 'with', 'probe', 'limit', 'different', 'from', 'previous', 'studies', 'for', 'fast', 'firstorder', 'phase', 'transition', 'in', 'flat', 'background', 'we', 'find', 'that', 'for', 'slow', 'firstorder', 'phase', 'transition', 'in', 'flrw', 'background', 'with', 'a', 'given', 'peculiar', 'velocity', 'of', 'the', 'bubble', 'wall', 'the', 'efficiency', 'factor', 'of', 'energy', 'transfer', 'into', 'bulk', 'motion', 'of', 'thermal', 'fluid', 'is', 'significantly', 'reduced', 'thus', 'decreasing', 'the', 'previouslythought', 'dominated', 'contribution', 'from', 'sound', 'wave', 'to', 'the', 'stochastic', 'gravitationalwave', 'background']] | [-0.11159412841956465, 0.1818804646278789, -0.09916339470303537, 0.011795721133239567, -0.0773886772631495, -0.06274298239315365, -0.008162322937062493, 0.3446498900467967, -0.2565986522829827, -0.271061488098097, 0.026607825748484443, -0.28129087915115153, -0.04884853555222996, 0.12707560018486816, 0.021927603026047165, 0.012886227556952724, -0.004733627719551693, -0.004503554940499642, -0.09951371811962698, -0.13285731244832277, 0.3334721293973012, 0.09842733187991896, 0.2986989224984966, -0.030816622791282923, 0.08222667152567963, -0.09749559258170286, -0.049294569736553565, 0.08797725142888081, -0.18069573488694768, -0.0362760295206106, 0.2253197483074518, 0.07039000800764764, 0.15555302469910662, -0.43174118353168905, -0.2787721740702788, 0.07824392693496689, 0.15661334935079882, 0.19405663328498235, -0.07939318295591223, -0.3167264791274512, -0.004889870671854343, -0.1597104639729002, -0.1356355817011201, -0.03188054098598199, 0.011392806852121412, -0.040047276155724204, -0.19529647219144267, 0.20341247711100696, 0.061564072483667624, -0.034974143334468945, -0.08239395566928534, -0.04252295430611681, -0.022043172063099012, 0.0484357702827518, 0.07764603353369935, 0.08348868954581795, 0.1735383906217729, -0.18944448887451013, -0.029780021385738143, 0.4012737016733966, -0.20125830033219155, -0.11949282541963054, 0.15562314108979922, -0.23051341416107285, -0.08515168286078138, 0.27992025130416875, 0.17422705872220068, 0.10208734538820055, -0.12730598829134745, 0.08125862151522327, 0.12483836838671575, 0.18371922035132432, 0.10220803027213723, -0.005660717576788163, 0.26710602753784185, 0.18252675764170695, 0.021498824441000635, 0.1589989195589298, -0.07930462780971954, -0.16057655273902197, -0.3391125697677058, -0.12247689677845043, -0.13784421314657838, 0.045216087574379255, -0.19776812117592787, -0.23659255125640352, 0.33253532461247143, 0.15189050160992293, 0.14325655959431588, 0.022560770358936288, 0.3006511067017269, 0.11118353971058825, -0.05355951257831888, 0.0974070504480214, 0.35176149369389925, 0.11910757108557003, 0.1514316868657867, -0.268607567857813, -0.007047508886359908, 0.07159974191475797] |
1,803.03003 | An interpolant in predicate G\"odel logic | A logic satisfies the interpolation property provided that whenever a formula
{\Delta} is a consequence of another formula {\Gamma}, then this is witnessed
by a formula {\Theta} which only refers to the language common to {\Gamma} and
{\Delta}. That is, the relational (and functional) symbols occurring in
{\Theta} occur in both {\Gamma} and {\Delta}, {\Gamma} has {\Theta} as a
consequence, and {\Theta} has {\Delta} as a consequence. Both classical and
intuitionistic predicate logic have the interpolation property, but it is a
long open problem which intermediate predicate logics enjoy it. In 2013 Mints,
Olkhovikov, and Urquhart showed that constant domain intuitionistic logic does
not have the interpolation property, while leaving open whether predicate
G\"odel logic does. In this short note, we show that their counterexample for
constant domain intuitionistic logic does admit an interpolant in predicate
G\"odel logic. While this has no impact on settling the question for predicate
G\"odel logic, it lends some credence to a common belief that it does satisfy
interpolation. Also, our method is based on an analysis of the semantic tools
of Olkhovikov and it is our hope that this might eventually be useful in
settling this question.
| math.LO | a logic satisfies the interpolation property provided that whenever a formula delta is a consequence of another formula gamma then this is witnessed by a formula theta which only refers to the language common to gamma and delta that is the relational and functional symbols occurring in theta occur in both gamma and delta gamma has theta as a consequence and theta has delta as a consequence both classical and intuitionistic predicate logic have the interpolation property but it is a long open problem which intermediate predicate logics enjoy it in 2013 mints olkhovikov and urquhart showed that constant domain intuitionistic logic does not have the interpolation property while leaving open whether predicate godel logic does in this short note we show that their counterexample for constant domain intuitionistic logic does admit an interpolant in predicate godel logic while this has no impact on settling the question for predicate godel logic it lends some credence to a common belief that it does satisfy interpolation also our method is based on an analysis of the semantic tools of olkhovikov and it is our hope that this might eventually be useful in settling this question | [['a', 'logic', 'satisfies', 'the', 'interpolation', 'property', 'provided', 'that', 'whenever', 'a', 'formula', 'delta', 'is', 'a', 'consequence', 'of', 'another', 'formula', 'gamma', 'then', 'this', 'is', 'witnessed', 'by', 'a', 'formula', 'theta', 'which', 'only', 'refers', 'to', 'the', 'language', 'common', 'to', 'gamma', 'and', 'delta', 'that', 'is', 'the', 'relational', 'and', 'functional', 'symbols', 'occurring', 'in', 'theta', 'occur', 'in', 'both', 'gamma', 'and', 'delta', 'gamma', 'has', 'theta', 'as', 'a', 'consequence', 'and', 'theta', 'has', 'delta', 'as', 'a', 'consequence', 'both', 'classical', 'and', 'intuitionistic', 'predicate', 'logic', 'have', 'the', 'interpolation', 'property', 'but', 'it', 'is', 'a', 'long', 'open', 'problem', 'which', 'intermediate', 'predicate', 'logics', 'enjoy', 'it', 'in', '2013', 'mints', 'olkhovikov', 'and', 'urquhart', 'showed', 'that', 'constant', 'domain', 'intuitionistic', 'logic', 'does', 'not', 'have', 'the', 'interpolation', 'property', 'while', 'leaving', 'open', 'whether', 'predicate', 'godel', 'logic', 'does', 'in', 'this', 'short', 'note', 'we', 'show', 'that', 'their', 'counterexample', 'for', 'constant', 'domain', 'intuitionistic', 'logic', 'does', 'admit', 'an', 'interpolant', 'in', 'predicate', 'godel', 'logic', 'while', 'this', 'has', 'no', 'impact', 'on', 'settling', 'the', 'question', 'for', 'predicate', 'godel', 'logic', 'it', 'lends', 'some', 'credence', 'to', 'a', 'common', 'belief', 'that', 'it', 'does', 'satisfy', 'interpolation', 'also', 'our', 'method', 'is', 'based', 'on', 'an', 'analysis', 'of', 'the', 'semantic', 'tools', 'of', 'olkhovikov', 'and', 'it', 'is', 'our', 'hope', 'that', 'this', 'might', 'eventually', 'be', 'useful', 'in', 'settling', 'this', 'question']] | [-0.1107772515418365, 0.05972376174472605, -0.14023265080198336, 0.11961405597361156, -0.1863168086374053, -0.1725439977943125, 0.09275339279140447, 0.34944656006195657, -0.32587507123928616, -0.2387176710597138, 0.09791889932058472, -0.24184613598636087, -0.14050946430028102, 0.18484692508113507, -0.1477066788368815, 0.03717756724959828, 0.014146263880650344, 0.09700879021764883, -0.04557336080780764, -0.224267403131901, 0.2908686388530069, -0.02485370676822169, 0.20068384320451033, 0.10480408193398788, 0.09558164285872267, 0.01930689712301128, 0.022673458448451957, 0.0325937203464576, -0.11399346793188359, 0.06199852761226209, 0.3052943606084029, 0.2404979444784474, 0.3184789176161734, -0.3729469077420358, -0.15729438311811247, 0.11409475029943211, 0.11604692552894971, 0.05771418769573648, -0.014465006920653806, -0.25668207506306584, 0.0991401698794988, -0.16570478940498412, -0.08446759312929962, -0.08745544736751312, 0.10687632106939438, -0.009528264288134256, -0.25048482414863404, 0.018451840665470086, 0.2660349955685181, 0.05800202772156408, -0.004330493852983524, -0.0528679776584206, 0.008304761652714076, 0.037280797061433175, 0.019408577297925177, 0.13254705547244128, 0.03474918017260383, -0.06776581189614465, -0.14547607668137438, 0.3516782993158818, -0.016093503490785244, -0.2206992550372747, 0.12545809352775272, -0.136094537685466, -0.19453612520538, 0.07638422843223254, 0.03875398745161959, 0.11214243206937455, -0.09130483658241176, 0.1992919738286831, -0.10370555689432924, 0.25060626755738774, 0.16408604787363443, 0.05108170141767556, 0.1970404705679324, 0.1384911535897683, 0.0421893569409191, 0.1074599643193253, 0.020015514805584837, -0.06421610190644088, -0.32658430694607254, -0.19210835887418357, -0.13884910183398952, 0.026880593780489095, -0.08310750346949597, -0.22478953577635974, 0.30413510440969405, 0.14955375280920077, 0.14678219819219465, 0.1268932651909348, 0.2605881689338332, 0.1333844908042642, 0.10687509604604249, 0.05764247503836152, 0.1827232716057674, 0.13479985264757252, 0.11344050778404187, -0.13131971366358486, 0.1422417068086719, 0.08941369507476263] |
1,803.03004 | Learning Effective Binary Visual Representations with Deep Networks | Although traditionally binary visual representations are mainly designed to
reduce computational and storage costs in the image retrieval research, this
paper argues that binary visual representations can be applied to large scale
recognition and detection problems in addition to hashing in retrieval.
Furthermore, the binary nature may make it generalize better than its
real-valued counterparts. Existing binary hashing methods are either two-stage
or hinging on loss term regularization or saturated functions, hence converge
slowly and only emit soft binary values. This paper proposes Approximately
Binary Clamping (ABC), which is non-saturating, end-to-end trainable, with fast
convergence and can output true binary visual representations. ABC achieves
comparable accuracy in ImageNet classification as its real-valued counterpart,
and even generalizes better in object detection. On benchmark image retrieval
datasets, ABC also outperforms existing hashing methods.
| cs.CV | although traditionally binary visual representations are mainly designed to reduce computational and storage costs in the image retrieval research this paper argues that binary visual representations can be applied to large scale recognition and detection problems in addition to hashing in retrieval furthermore the binary nature may make it generalize better than its realvalued counterparts existing binary hashing methods are either twostage or hinging on loss term regularization or saturated functions hence converge slowly and only emit soft binary values this paper proposes approximately binary clamping abc which is nonsaturating endtoend trainable with fast convergence and can output true binary visual representations abc achieves comparable accuracy in imagenet classification as its realvalued counterpart and even generalizes better in object detection on benchmark image retrieval datasets abc also outperforms existing hashing methods | [['although', 'traditionally', 'binary', 'visual', 'representations', 'are', 'mainly', 'designed', 'to', 'reduce', 'computational', 'and', 'storage', 'costs', 'in', 'the', 'image', 'retrieval', 'research', 'this', 'paper', 'argues', 'that', 'binary', 'visual', 'representations', 'can', 'be', 'applied', 'to', 'large', 'scale', 'recognition', 'and', 'detection', 'problems', 'in', 'addition', 'to', 'hashing', 'in', 'retrieval', 'furthermore', 'the', 'binary', 'nature', 'may', 'make', 'it', 'generalize', 'better', 'than', 'its', 'realvalued', 'counterparts', 'existing', 'binary', 'hashing', 'methods', 'are', 'either', 'twostage', 'or', 'hinging', 'on', 'loss', 'term', 'regularization', 'or', 'saturated', 'functions', 'hence', 'converge', 'slowly', 'and', 'only', 'emit', 'soft', 'binary', 'values', 'this', 'paper', 'proposes', 'approximately', 'binary', 'clamping', 'abc', 'which', 'is', 'nonsaturating', 'endtoend', 'trainable', 'with', 'fast', 'convergence', 'and', 'can', 'output', 'true', 'binary', 'visual', 'representations', 'abc', 'achieves', 'comparable', 'accuracy', 'in', 'imagenet', 'classification', 'as', 'its', 'realvalued', 'counterpart', 'and', 'even', 'generalizes', 'better', 'in', 'object', 'detection', 'on', 'benchmark', 'image', 'retrieval', 'datasets', 'abc', 'also', 'outperforms', 'existing', 'hashing', 'methods']] | [-0.06580901695530904, 0.00400024181843259, -0.04926754734905451, 0.08257182997132417, -0.15162445107592226, -0.2397287747989771, 0.016148360672705444, 0.48105884661883797, -0.2827468495993726, -0.32031467906732597, 0.12153393340755596, -0.297221731312772, -0.17557789208829575, 0.18638746935753364, -0.19391178600987746, 0.12171296744248812, 0.1694672743626337, 0.04584074552874756, -0.13873455202462906, -0.35827430670561966, 0.24698092763930674, 0.06839252695910462, 0.30193934949889834, -0.03448844163941632, 0.07278988728454587, 0.0012859066749233326, -0.021097333948056834, -0.03521751333028078, 0.007116375369886701, 0.16278369076379384, 0.3388830814226211, 0.1733915117313332, 0.2403400545772734, -0.3328173636309518, -0.23449614209670375, 0.13541992661500535, 0.2045345501254405, 0.06639924017436542, -0.050209982315334314, -0.2863818421144081, 0.11342796617194668, -0.19236380711663514, 0.09367052300385277, -0.1725517539840675, 0.008779659085260093, -0.008196918777254467, -0.30357720262107957, 0.08467814536522612, 0.12424857578531817, 0.038436644140076436, -0.09018300560512758, -0.15247719975913526, 0.05997286106900575, 0.077618200484777, 0.03477714436647717, 0.118850973614368, 0.1267737551745141, -0.20675851365210104, -0.14910530945186623, 0.3855122077058404, -0.05640499023749504, -0.23394594034393326, 0.2633658121802083, -0.026336008277615064, -0.15697520508391796, 0.1363945477108919, 0.251058547256358, 0.16161397305310113, -0.11840278181098117, 0.022752200510576793, -0.0014100559837831796, 0.24460868247809556, 0.11156715516743912, 0.037969429045915604, 0.18983225685096425, 0.20870496183527165, 0.052634444840000016, 0.17360087786890027, -0.12701170130269354, -0.08371210629955815, -0.11879349483944873, -0.0792556248662126, -0.20917588595535522, -0.012564571300621023, -0.11713618988769736, -0.17085451648734112, 0.3291017960842329, 0.23064394120059423, 0.1879526121716925, 0.1251655769550405, 0.35057882848728933, 0.0450105216515869, 0.12685451346968535, 0.11169093607334804, 0.21326232089693054, 0.0034295340843555583, 0.10497163904818373, -0.15157620572549013, 0.1272122020911397, 0.09456284799904541] |
1,803.03005 | Post-processed Galerkin approximation of improved order for wave
equations | We introduce and analyze a post-processing for a family of variational
space-time approximations to wave problems. The discretization in space and
time is based on continuous finite element methods. The post-processing lifts
the fully discrete approximations in time from continuous to continuously
differentiable ones. Further, it increases the order of convergence of the
discretization in time which can be be exploited nicely, for instance, for
a-posteriori error control. The convergence behavior is shown by proving error
estimates of optimal order in various norms. A bound of superconvergence at the
discrete times nodes is included. To show the error estimates, a special
approach is developed. Firstly, error estimates for the time derivative of the
post-processed solution are proved. Then, in a second step these results are
used to establish the desired error estimates for the post-processed solution
itself. The need for this approach comes through the structure of the wave
equation providing only stability estimates that preclude us from using
absorption arguments for the control of certain error quantities. A further key
ingredient of this work is the construction of a new time-interpolate of the
exact solution that is needed in an essential way for deriving the error
estimates. Finally, a conservation of energy property is shown for the
post-processed solution which is a key feature for approximation schemes to
wave equations. The error estimates given in this work are confirmed by
numerical experiments.
| math.NA | we introduce and analyze a postprocessing for a family of variational spacetime approximations to wave problems the discretization in space and time is based on continuous finite element methods the postprocessing lifts the fully discrete approximations in time from continuous to continuously differentiable ones further it increases the order of convergence of the discretization in time which can be be exploited nicely for instance for aposteriori error control the convergence behavior is shown by proving error estimates of optimal order in various norms a bound of superconvergence at the discrete times nodes is included to show the error estimates a special approach is developed firstly error estimates for the time derivative of the postprocessed solution are proved then in a second step these results are used to establish the desired error estimates for the postprocessed solution itself the need for this approach comes through the structure of the wave equation providing only stability estimates that preclude us from using absorption arguments for the control of certain error quantities a further key ingredient of this work is the construction of a new timeinterpolate of the exact solution that is needed in an essential way for deriving the error estimates finally a conservation of energy property is shown for the postprocessed solution which is a key feature for approximation schemes to wave equations the error estimates given in this work are confirmed by numerical experiments | [['we', 'introduce', 'and', 'analyze', 'a', 'postprocessing', 'for', 'a', 'family', 'of', 'variational', 'spacetime', 'approximations', 'to', 'wave', 'problems', 'the', 'discretization', 'in', 'space', 'and', 'time', 'is', 'based', 'on', 'continuous', 'finite', 'element', 'methods', 'the', 'postprocessing', 'lifts', 'the', 'fully', 'discrete', 'approximations', 'in', 'time', 'from', 'continuous', 'to', 'continuously', 'differentiable', 'ones', 'further', 'it', 'increases', 'the', 'order', 'of', 'convergence', 'of', 'the', 'discretization', 'in', 'time', 'which', 'can', 'be', 'be', 'exploited', 'nicely', 'for', 'instance', 'for', 'aposteriori', 'error', 'control', 'the', 'convergence', 'behavior', 'is', 'shown', 'by', 'proving', 'error', 'estimates', 'of', 'optimal', 'order', 'in', 'various', 'norms', 'a', 'bound', 'of', 'superconvergence', 'at', 'the', 'discrete', 'times', 'nodes', 'is', 'included', 'to', 'show', 'the', 'error', 'estimates', 'a', 'special', 'approach', 'is', 'developed', 'firstly', 'error', 'estimates', 'for', 'the', 'time', 'derivative', 'of', 'the', 'postprocessed', 'solution', 'are', 'proved', 'then', 'in', 'a', 'second', 'step', 'these', 'results', 'are', 'used', 'to', 'establish', 'the', 'desired', 'error', 'estimates', 'for', 'the', 'postprocessed', 'solution', 'itself', 'the', 'need', 'for', 'this', 'approach', 'comes', 'through', 'the', 'structure', 'of', 'the', 'wave', 'equation', 'providing', 'only', 'stability', 'estimates', 'that', 'preclude', 'us', 'from', 'using', 'absorption', 'arguments', 'for', 'the', 'control', 'of', 'certain', 'error', 'quantities', 'a', 'further', 'key', 'ingredient', 'of', 'this', 'work', 'is', 'the', 'construction', 'of', 'a', 'new', 'timeinterpolate', 'of', 'the', 'exact', 'solution', 'that', 'is', 'needed', 'in', 'an', 'essential', 'way', 'for', 'deriving', 'the', 'error', 'estimates', 'finally', 'a', 'conservation', 'of', 'energy', 'property', 'is', 'shown', 'for', 'the', 'postprocessed', 'solution', 'which', 'is', 'a', 'key', 'feature', 'for', 'approximation', 'schemes', 'to', 'wave', 'equations', 'the', 'error', 'estimates', 'given', 'in', 'this', 'work', 'are', 'confirmed', 'by', 'numerical', 'experiments']] | [-0.08972481773475763, 0.01877365660396302, -0.11884725284471642, 0.08424829963066792, -0.04046307815688437, -0.09880055264160358, 0.0620100599219862, 0.3501478928133267, -0.2817033163255787, -0.27747264267186283, 0.16092219940689795, -0.23366098459920412, -0.12508409332427806, 0.22741799766663462, -0.06960691586397749, 0.14087634471020308, 0.07928894123299336, 0.027393845530178654, -0.10915716779558791, -0.2407119023143956, 0.3139192185380721, 0.0494267566225909, 0.25514318812076514, 0.030113197407476474, 0.12211341870515126, -0.057333124917743686, -0.044127836827477764, 0.0022576301566130433, -0.15462191736935046, 0.13958619310167328, 0.247952938498327, 0.09196243334886746, 0.33944108463916123, -0.393127144218005, -0.22680327146359747, 0.08530711686160367, 0.16144767165252263, 0.14819077533420882, -0.0593864839059373, -0.28151559587447617, 0.11025934958637788, -0.12288304297895782, -0.14188852536809182, -0.11102039249140191, -0.03432267967306463, 0.05604011261863794, -0.35535754713450374, 0.08510594610987905, 0.07500817703087172, 0.0013171093626718584, -0.09271991278063947, -0.07337962044904747, 0.006388872951180835, 0.15062179513966087, 0.05412444776498135, 0.03529934624434802, 0.04105924244905854, -0.07582728517370234, -0.08983873721495159, 0.369261521951181, -0.0707934208092348, -0.2641446723779342, 0.11473592923269688, -0.10057890600502764, -0.1099618263729569, 0.15660682445404903, 0.17993233165230024, 0.13447039899544727, -0.14751489333289572, 0.07946186176057632, -0.003535084199405713, 0.17495684621650887, 0.02534599291614321, 0.02217672361414237, 0.08772011232915623, 0.15678937465016698, 0.14546317389989594, 0.09940662877714454, -0.06255559584703939, -0.09575602431893991, -0.363107413483045, -0.18893712959922188, -0.21337635020709372, 0.013410357499040026, -0.10687730699721905, -0.1569973127828642, 0.38383600469638496, 0.17112732665504907, 0.15041702470977003, 0.09928146319801052, 0.30494630838551656, 0.18848497151589855, 0.03319174494265161, 0.08999612037511943, 0.23382423572033514, 0.1354222134466219, 0.0631646822319077, -0.19515181290688785, 0.09623356516962743, 0.16061048929234326] |
1,803.03006 | From Brownian motion formalism to fluctuation-induced force in a general
fluctuating medium | Starting from a microscopic approach and using the formalism of quantum
Brownian motion, partition function of a system composed of two separated
pieces of anisotropic matter and a fluctuating medium in finite temperature is
obtained rigorously. A general expression for fluctuation-induced free energy
between the separated anisotropic pieces of matter is obtained and it is shown
that in the framework of induced-force, the free energy of mean-force and
effective free energy are equivalent.
| quant-ph cond-mat.stat-mech | starting from a microscopic approach and using the formalism of quantum brownian motion partition function of a system composed of two separated pieces of anisotropic matter and a fluctuating medium in finite temperature is obtained rigorously a general expression for fluctuationinduced free energy between the separated anisotropic pieces of matter is obtained and it is shown that in the framework of inducedforce the free energy of meanforce and effective free energy are equivalent | [['starting', 'from', 'a', 'microscopic', 'approach', 'and', 'using', 'the', 'formalism', 'of', 'quantum', 'brownian', 'motion', 'partition', 'function', 'of', 'a', 'system', 'composed', 'of', 'two', 'separated', 'pieces', 'of', 'anisotropic', 'matter', 'and', 'a', 'fluctuating', 'medium', 'in', 'finite', 'temperature', 'is', 'obtained', 'rigorously', 'a', 'general', 'expression', 'for', 'fluctuationinduced', 'free', 'energy', 'between', 'the', 'separated', 'anisotropic', 'pieces', 'of', 'matter', 'is', 'obtained', 'and', 'it', 'is', 'shown', 'that', 'in', 'the', 'framework', 'of', 'inducedforce', 'the', 'free', 'energy', 'of', 'meanforce', 'and', 'effective', 'free', 'energy', 'are', 'equivalent']] | [-0.12335717922380557, 0.19894475698432265, -0.16367318840800887, 0.07586458127965064, 0.005453594675701525, -0.10748967984949963, -0.01916298529249616, 0.341057569719851, -0.27438302762392497, -0.31433417868619373, -0.006095682888472866, -0.28110433708126137, -0.10094484283278386, 0.2012967684228594, 0.039494727815811835, 0.017730840145506792, 0.0038836146575502222, 0.06349168756302485, -0.042614588543074206, -0.15775981581666404, 0.3317212396197849, -0.005698605565056723, 0.26060368105148274, 0.06939440950777175, 0.17290679190773517, 0.029059901937014528, -0.024012446668671653, 0.11593982288872616, -0.15413824257737158, 0.1396318586776033, 0.2021929608082347, 0.014785738467859725, 0.22245813851865628, -0.415225876107191, -0.22416042585650253, 0.06275282494930758, 0.11394515555972855, 0.1108649466962864, -0.040968756998255335, -0.2540506219957024, 0.04946868572248301, -0.18585422195287216, -0.14948670841598263, -0.03231939270497403, 0.014809617594841661, 0.00661881361156702, -0.25963652493535644, 0.15112965624939534, 0.029742363048070628, 0.013041668416311344, -0.1356698316893825, -0.08696560988189755, -0.0254804832705607, 0.12234109378833738, 0.02586454324126761, 0.023199776957173728, 0.14083339294625652, -0.12780906786469537, -0.03764358926047054, 0.39080190746527577, -0.07129358908665988, -0.21084359815965095, 0.16326225099490127, -0.07875710038933903, -0.047256348861588374, 0.16384575667325407, 0.10472865187976924, 0.12466627713163486, -0.20623349175891942, 0.1258566249841048, -0.01998311365928708, 0.1327208529950844, 0.048828674486786544, 0.021461167971817, 0.24172231156585944, 0.16880558046977967, 0.03652169664079944, 0.16361809287142628, -0.021407632700478036, -0.16322084511112836, -0.3434024119180524, -0.16152235419945604, -0.26115474212888834, 0.0688223726530042, -0.08673445274325786, -0.1914297978716301, 0.36871684363318813, 0.0786036990757566, 0.1366155008242155, 0.011989232644231783, 0.2888492900981671, 0.12647485647660991, 0.0057603862369433045, 0.06551814588278325, 0.20539180014748126, 0.15635148868831392, 0.07389587897341698, -0.20081922143193273, -0.03249971854974218, 0.08463662557510866] |
1,803.03007 | Universal Transport Dynamics of Complex Fluids | Thermal motion in complex fluids is a complicated stochastic process but
ubiquitously exhibits initial ballistic, intermediate sub-diffusive, and
long-time non-Gaussian diffusive motion, unless interrupted. Despite its
relevance to numerous dynamical processes of interest in modern science, a
unified, quantitative understanding of thermal motion in complex fluids remains
a long-standing problem. Here, we present a new transport equation and its
solutions, which yield a unified quantitative explanation of the mean square
displacement (MSD) and the non-Gaussian parameter (NGP) of various fluid
systems. We find the environment-coupled diffusion kernel and its time
correlation function are two essential quantities determining transport
dynamics of complex fluids. From our analysis, we construct a general, explicit
model of the complex fluid transport dynamics. This model quantitatively
explains not only the MSD and NGP, but also the time-dependent relaxation of
the displacement distribution for various systems. We introduce the concepts of
intrinsic disorder and extrinsic disorder that have distinct effects on
transport dynamics and different dependencies on temperature and density. This
work presents a new paradigm for quantitative understanding of transport and
transport-coupled processes in complex disordered media.
| cond-mat.dis-nn cond-mat.soft | thermal motion in complex fluids is a complicated stochastic process but ubiquitously exhibits initial ballistic intermediate subdiffusive and longtime nongaussian diffusive motion unless interrupted despite its relevance to numerous dynamical processes of interest in modern science a unified quantitative understanding of thermal motion in complex fluids remains a longstanding problem here we present a new transport equation and its solutions which yield a unified quantitative explanation of the mean square displacement msd and the nongaussian parameter ngp of various fluid systems we find the environmentcoupled diffusion kernel and its time correlation function are two essential quantities determining transport dynamics of complex fluids from our analysis we construct a general explicit model of the complex fluid transport dynamics this model quantitatively explains not only the msd and ngp but also the timedependent relaxation of the displacement distribution for various systems we introduce the concepts of intrinsic disorder and extrinsic disorder that have distinct effects on transport dynamics and different dependencies on temperature and density this work presents a new paradigm for quantitative understanding of transport and transportcoupled processes in complex disordered media | [['thermal', 'motion', 'in', 'complex', 'fluids', 'is', 'a', 'complicated', 'stochastic', 'process', 'but', 'ubiquitously', 'exhibits', 'initial', 'ballistic', 'intermediate', 'subdiffusive', 'and', 'longtime', 'nongaussian', 'diffusive', 'motion', 'unless', 'interrupted', 'despite', 'its', 'relevance', 'to', 'numerous', 'dynamical', 'processes', 'of', 'interest', 'in', 'modern', 'science', 'a', 'unified', 'quantitative', 'understanding', 'of', 'thermal', 'motion', 'in', 'complex', 'fluids', 'remains', 'a', 'longstanding', 'problem', 'here', 'we', 'present', 'a', 'new', 'transport', 'equation', 'and', 'its', 'solutions', 'which', 'yield', 'a', 'unified', 'quantitative', 'explanation', 'of', 'the', 'mean', 'square', 'displacement', 'msd', 'and', 'the', 'nongaussian', 'parameter', 'ngp', 'of', 'various', 'fluid', 'systems', 'we', 'find', 'the', 'environmentcoupled', 'diffusion', 'kernel', 'and', 'its', 'time', 'correlation', 'function', 'are', 'two', 'essential', 'quantities', 'determining', 'transport', 'dynamics', 'of', 'complex', 'fluids', 'from', 'our', 'analysis', 'we', 'construct', 'a', 'general', 'explicit', 'model', 'of', 'the', 'complex', 'fluid', 'transport', 'dynamics', 'this', 'model', 'quantitatively', 'explains', 'not', 'only', 'the', 'msd', 'and', 'ngp', 'but', 'also', 'the', 'timedependent', 'relaxation', 'of', 'the', 'displacement', 'distribution', 'for', 'various', 'systems', 'we', 'introduce', 'the', 'concepts', 'of', 'intrinsic', 'disorder', 'and', 'extrinsic', 'disorder', 'that', 'have', 'distinct', 'effects', 'on', 'transport', 'dynamics', 'and', 'different', 'dependencies', 'on', 'temperature', 'and', 'density', 'this', 'work', 'presents', 'a', 'new', 'paradigm', 'for', 'quantitative', 'understanding', 'of', 'transport', 'and', 'transportcoupled', 'processes', 'in', 'complex', 'disordered', 'media']] | [-0.14373731426894665, 0.14054065547862699, -0.13050179194409253, 0.0779133988359499, -0.03937150796747886, -0.12737591368310133, -0.009719567921002235, 0.3523187896850722, -0.3218364974603515, -0.26974282319548243, 0.06509373411432158, -0.2551966382154165, -0.21133911615502943, 0.17492452542448428, -0.00682766067759035, 0.0774535052598631, 0.02292715635505689, -0.03880239668297035, -0.025312547635692875, -0.14435901566065182, 0.2765136476613935, 0.02268914301104469, 0.29710848399635675, 0.07355479830836971, 0.1310111282556903, 0.0022078548002929244, -0.027130099697631666, 0.05588380385752164, -0.1739912895792162, 0.08385270681198395, 0.19373591118830377, 0.023834103952531376, 0.2497604259877731, -0.4446622669832084, -0.30005846950992965, 0.0795066694666595, 0.16617754716494423, 0.13094136008131707, -0.06717831222210392, -0.24225296843380734, -0.03109269232655662, -0.12401239510609992, -0.1421149569893953, -0.12010527988271423, 0.0658234450979127, 0.0317611430573938, -0.21526905993134948, 0.20192525550243756, 0.07753486613084187, 0.07832766754042836, -0.086629380538992, -0.09458811587313264, 0.02565878894382973, 0.13518533328360768, 0.02744806521717204, -0.020080112467140126, 0.1710724414107728, -0.1883878608327879, -0.08577038457535217, 0.3836152280769285, -0.044544043886350394, -0.22041001197343493, 0.25275324475457217, -0.172316502980685, -0.1182451219302498, 0.14559375362564397, 0.20024582970231855, 0.11796780578842823, -0.21090194744489796, 0.05885205126735616, -0.00827733051440257, 0.13819332349545962, -0.01917342059496353, 0.034650560719801334, 0.21035612278290133, 0.21941397199667365, 0.02039623851549692, 0.10290568016531913, -0.07355082912406984, -0.1943372768068988, -0.2847440973985628, -0.17413973031460186, -0.16252151673253853, 0.08818494584991833, -0.11421873469051044, -0.21857412929995265, 0.4142365491241425, 0.1832062407948243, 0.17845070115017428, 0.034093358822546736, 0.2773245229156865, 0.10772043923449354, -0.03595023087158217, 0.06541643468350922, 0.21076915292173373, 0.1396312091470951, 0.15285140745778822, -0.25182545160505315, 0.11039582015842449, 0.011398982434525732] |
1,803.03008 | Generalized Volterra operators mapping between Banach spaces of analytic
functions | We characterize boundedness and compactness of the classical Volterra
operator $T_g \colon H_{v_{\alpha}}^{\infty} \to H^{\infty}$ induced by a
univalent function $g$ for standard weights $v_{\alpha}$ with $0 \leq \alpha <
1$, partly answering an open problem posed by A. Anderson, M. Jovovic and W.
Smith. We also study boundedness, compactness and weak compactness of the
generalized Volterra operator $T_g^{\varphi}$ mapping between Banach spaces of
analytic functions on the unit disc satisfying certain general conditions.
| math.FA | we characterize boundedness and compactness of the classical volterra operator t_g colon h_v_alphainfty to hinfty induced by a univalent function g for standard weights v_alpha with 0 leq alpha 1 partly answering an open problem posed by a anderson m jovovic and w smith we also study boundedness compactness and weak compactness of the generalized volterra operator t_gvarphi mapping between banach spaces of analytic functions on the unit disc satisfying certain general conditions | [['we', 'characterize', 'boundedness', 'and', 'compactness', 'of', 'the', 'classical', 'volterra', 'operator', 't_g', 'colon', 'h_v_alphainfty', 'to', 'hinfty', 'induced', 'by', 'a', 'univalent', 'function', 'g', 'for', 'standard', 'weights', 'v_alpha', 'with', '0', 'leq', 'alpha', '1', 'partly', 'answering', 'an', 'open', 'problem', 'posed', 'by', 'a', 'anderson', 'm', 'jovovic', 'and', 'w', 'smith', 'we', 'also', 'study', 'boundedness', 'compactness', 'and', 'weak', 'compactness', 'of', 'the', 'generalized', 'volterra', 'operator', 't_gvarphi', 'mapping', 'between', 'banach', 'spaces', 'of', 'analytic', 'functions', 'on', 'the', 'unit', 'disc', 'satisfying', 'certain', 'general', 'conditions']] | [-0.11714153543912939, 0.09462914276789108, 0.04044904707531844, 0.14349753665737808, -0.11826892781370718, -0.12783767924244915, 0.026416238437273674, 0.3611999217953001, -0.3655574660482151, -0.15340705887813652, 0.13684625895194977, -0.25396208695269057, -0.11198564733245543, 0.18118054652253965, -0.131290207924446, 0.06342524806968868, 0.026211434366580633, -0.02191856208124331, -0.14468830809263247, -0.24830486928778037, 0.4662263869174889, -0.060007971107760176, 0.10507664308617158, 0.06592265987253215, 0.10167093097323751, 0.036919308620105895, -0.007236233313700983, -0.055892327088596566, -0.27496389492215323, 0.11457929261128551, 0.21567274233592407, 0.10676573963303651, 0.35585288334903975, -0.335913938124265, -0.16676264901512436, 0.19505308200106292, 0.06925090363116136, -0.16670272329023905, -0.021745531362414892, -0.3357062332930842, 0.10977582802463855, -0.09310591112423156, -0.16147431300154755, -0.06735890980011651, 0.07518867725905563, 0.08553869582579604, -0.35132656350199665, 0.08261829503836841, 0.19569998644292355, 0.05760848369183285, -0.16094714909392807, -0.07732512679982133, -0.037174825842625325, 0.051786804917667593, -0.04091234592986959, 0.1352238887688145, 0.06848578253494841, -0.07427427262799548, -0.06006117244916303, 0.2775322559389419, -0.12094492642208934, -0.24411601001795913, 0.13151732897385954, -0.22086225996858308, -0.11316577520753657, 0.024544392220143763, 0.0598472731720124, 0.17286657386326365, -0.11715514698464956, 0.24712580929793018, -0.10523210959509015, 0.12345234057367115, 0.13002872331334012, 0.02961010472666073, 0.06318345293402672, 0.08876491656992584, 0.14643731948786548, 0.14017018480559013, 0.06144914624746889, 0.0003473273653071374, -0.3367764438502491, -0.14039539511182478, -0.1480255661665329, 0.16675123952861343, -0.12980391560060006, -0.19236959640734963, 0.3299188836344651, 0.055582042134067575, 0.19151823462120124, 0.12453347974057709, 0.16203732008912733, 0.17506203558295966, -0.0025609858932771853, 0.03378228340360303, 0.09463824088286077, 0.2665756969546367, 0.06695891571663586, -0.19754647688407984, -0.023960117576643826, 0.2546228811410921] |
1,803.03009 | Confining solitons in the Higgs phase of ${\mathbb C}P^{N-1}$ model:
Self-consistent exact solutions in large-$N$ limit | The quantum ${\mathbb C}P^{N-1}$ model is in the confining (or unbroken)
phase with a full mass gap in an infinite space, while it is in the Higgs
(broken or deconfinement) phase accompanied with Nambu-Goldstone modes in a
finite space such as a ring or finite interval smaller than a certain critical
size. We find a new self-consistent exact solution describing a soliton in the
Higgs phase of the ${\mathbb C}P^{N-1}$ model in the large-$N$ limit on a ring.
We call it a confining soliton. We show that all eigenmodes have real and
positive energy and thus it is stable.
| hep-th cond-mat.supr-con | the quantum mathbb cpn1 model is in the confining or unbroken phase with a full mass gap in an infinite space while it is in the higgs broken or deconfinement phase accompanied with nambugoldstone modes in a finite space such as a ring or finite interval smaller than a certain critical size we find a new selfconsistent exact solution describing a soliton in the higgs phase of the mathbb cpn1 model in the largen limit on a ring we call it a confining soliton we show that all eigenmodes have real and positive energy and thus it is stable | [['the', 'quantum', 'mathbb', 'cpn1', 'model', 'is', 'in', 'the', 'confining', 'or', 'unbroken', 'phase', 'with', 'a', 'full', 'mass', 'gap', 'in', 'an', 'infinite', 'space', 'while', 'it', 'is', 'in', 'the', 'higgs', 'broken', 'or', 'deconfinement', 'phase', 'accompanied', 'with', 'nambugoldstone', 'modes', 'in', 'a', 'finite', 'space', 'such', 'as', 'a', 'ring', 'or', 'finite', 'interval', 'smaller', 'than', 'a', 'certain', 'critical', 'size', 'we', 'find', 'a', 'new', 'selfconsistent', 'exact', 'solution', 'describing', 'a', 'soliton', 'in', 'the', 'higgs', 'phase', 'of', 'the', 'mathbb', 'cpn1', 'model', 'in', 'the', 'largen', 'limit', 'on', 'a', 'ring', 'we', 'call', 'it', 'a', 'confining', 'soliton', 'we', 'show', 'that', 'all', 'eigenmodes', 'have', 'real', 'and', 'positive', 'energy', 'and', 'thus', 'it', 'is', 'stable']] | [-0.16731797271605695, 0.22484970672042556, -0.0812788126764424, 0.08073883245327519, -0.04982474790133461, -0.14362577776038887, 0.0196018533832911, 0.37101087314688197, -0.20265024732516118, -0.18484057602707785, 0.10502558956722344, -0.26934321659306687, -0.1264645338900425, 0.10867430182935839, 0.0068743008217125225, 0.05814200621850864, -0.009748006465308594, 0.10111956853852277, -0.10375492983836342, -0.2195792097711202, 0.30462715443402455, -0.055708386903544044, 0.2482379333332482, 0.06262847139603561, 0.09751129691192711, -0.02356663517268243, 0.07369374979118054, 0.009011595551691235, -0.1538156221760819, 0.01536605010430018, 0.18714870143719395, 0.005149893091069628, 0.2127129158588371, -0.3715840984662675, -0.2341291805566994, 0.18964871959384494, 0.2089307617038639, 0.13884966292493797, -0.05162716983474151, -0.290340042543701, 0.07921625528898504, -0.1915182400320779, -0.16131780408510957, -0.05980869122037683, 0.03172027584014818, -0.06284688706709674, -0.2822396342567347, 0.060956490211979006, 0.03667262601054678, 0.07044318270242791, -0.0628821560360416, -0.034039120683728746, -0.08931503421391802, 0.034776604717898396, 0.04181040482915411, 0.07843578740780364, 0.08252875973009552, -0.15135673864396534, -0.06854780726934398, 0.42610978808329264, -0.10413716497170772, -0.20917960848527575, 0.13836306912090743, -0.16741510068602633, -0.09460837858719658, 0.17426066239825402, 0.11208054802446353, 0.121379015388701, -0.03030636189787677, 0.18904948225033216, -0.07863272749113315, 0.17976489495674167, 0.04559137833050706, 0.017653162998025013, 0.26885092724114656, 0.18658536794887046, 0.0948203048143169, 0.15231659191406585, -0.0053644265821956175, -0.15676487429065142, -0.37205949371134994, -0.1717965270362023, -0.16991882792067234, 0.0607534773327937, -0.12001686971699302, -0.22683798694851423, 0.3978502147482953, 0.08080015521534163, 0.23769170452247967, 0.039382216652309655, 0.25153982492558885, 0.1444670913748048, 0.07901879185528467, 0.08402897381327218, 0.2103056236160825, 0.10129355496581118, 0.0668753506333539, -0.22769915548181444, -0.09293731913026987, 0.11266309736447051] |
1,803.0301 | Water under the Ridge: Evaporation, Translation, Crumpling and
Encapsulation of a Water Droplet atop a Liquid Polymeric Film | The intriguing dynamics of a compound liquid-system comprising of water and
(uncured) poly-dimethylsiloxane is explored in the present work. The
viscoelastic nature of the film, coupled with the dynamics of evaporation,
triggered a self-propulsion in the droplet, which gradually segued into the
crumpling of the film, and finally culminated in the encapsulation of the water
droplet by the polymer. The physics of the hitherto unreported phenomena has
been explained via the development of an analytical model, by taking into
account all the germane forces. It is conjectured that this symbiotic and
self-sustained dynamics, aided with the non-requirement of any complex
fabrication procedures, would pave the path for the development of precision
drug-delivery, unmediated flow-focusing, self-mixed microreactors, the study of
micro-swimmers, surface encapsulation, and photonics, to name a few.
| cond-mat.soft | the intriguing dynamics of a compound liquidsystem comprising of water and uncured polydimethylsiloxane is explored in the present work the viscoelastic nature of the film coupled with the dynamics of evaporation triggered a selfpropulsion in the droplet which gradually segued into the crumpling of the film and finally culminated in the encapsulation of the water droplet by the polymer the physics of the hitherto unreported phenomena has been explained via the development of an analytical model by taking into account all the germane forces it is conjectured that this symbiotic and selfsustained dynamics aided with the nonrequirement of any complex fabrication procedures would pave the path for the development of precision drugdelivery unmediated flowfocusing selfmixed microreactors the study of microswimmers surface encapsulation and photonics to name a few | [['the', 'intriguing', 'dynamics', 'of', 'a', 'compound', 'liquidsystem', 'comprising', 'of', 'water', 'and', 'uncured', 'polydimethylsiloxane', 'is', 'explored', 'in', 'the', 'present', 'work', 'the', 'viscoelastic', 'nature', 'of', 'the', 'film', 'coupled', 'with', 'the', 'dynamics', 'of', 'evaporation', 'triggered', 'a', 'selfpropulsion', 'in', 'the', 'droplet', 'which', 'gradually', 'segued', 'into', 'the', 'crumpling', 'of', 'the', 'film', 'and', 'finally', 'culminated', 'in', 'the', 'encapsulation', 'of', 'the', 'water', 'droplet', 'by', 'the', 'polymer', 'the', 'physics', 'of', 'the', 'hitherto', 'unreported', 'phenomena', 'has', 'been', 'explained', 'via', 'the', 'development', 'of', 'an', 'analytical', 'model', 'by', 'taking', 'into', 'account', 'all', 'the', 'germane', 'forces', 'it', 'is', 'conjectured', 'that', 'this', 'symbiotic', 'and', 'selfsustained', 'dynamics', 'aided', 'with', 'the', 'nonrequirement', 'of', 'any', 'complex', 'fabrication', 'procedures', 'would', 'pave', 'the', 'path', 'for', 'the', 'development', 'of', 'precision', 'drugdelivery', 'unmediated', 'flowfocusing', 'selfmixed', 'microreactors', 'the', 'study', 'of', 'microswimmers', 'surface', 'encapsulation', 'and', 'photonics', 'to', 'name', 'a', 'few']] | [-0.11870238779309561, 0.17847476604432946, -0.09542006929594327, -0.04197693830715659, -0.0403812007752856, -0.11708951850868458, 0.02856549484905128, 0.31973312299214, -0.24579976929154823, -0.28973738659869847, 0.0912941229440711, -0.2231287223748802, -0.18059874011763954, 0.1906233996482248, -0.01608056631279973, 0.05009048071508182, 0.01562291330362602, -0.049276867569083484, 0.0047654973407374405, -0.17962773653065287, 0.24813440358796254, 0.06352384624306143, 0.2705904340212483, 0.10210078678612514, 0.13031597931422595, -0.0018262961288777794, 0.039006695620776195, 0.013431265450468877, -0.18676021235373402, 0.11484609037728571, 0.20733480605607232, 0.02334573707255588, 0.2557550456329453, -0.5001184888547514, -0.2835690737096214, 0.03131747254874648, 0.13636156698268634, 0.12204201530941527, -0.09678745004007729, -0.2899147753747619, 0.03149581804485401, -0.1602692992116014, -0.14167278077513948, -0.025303208710232037, 0.017853678855287835, 0.022512085752834272, -0.17142652176562848, 0.04297630369239222, 0.10100372078094055, 0.06368446656752651, -0.07968155603583266, -0.0769995580109336, -0.05302777192063206, 0.11821571570665886, 0.055342018420664156, -0.017080172080531475, 0.19014488570808577, -0.16127153472573594, -0.09485863722345936, 0.4075009500024825, -0.0171185050891311, -0.13071214459927344, 0.20268501650269438, -0.13503837229577992, -0.0748199553804366, 0.20208392192692898, 0.15919639744864003, 0.09669014722169415, -0.1826749249319811, 0.03689234510132271, -0.019323796340514246, 0.16057535315053614, 0.06252443656416201, -0.009082530977249873, 0.23995014434337011, 0.3018074223423392, -0.03658375505933432, 0.17919697694109404, -0.08674478834699385, -0.10399124866381772, -0.23340866215455125, -0.2346258389846823, -0.1450607777976363, 0.049397318419523356, -0.04844862307806128, -0.1760446148492941, 0.39976047418587574, 0.10749645032957802, 0.1555947676316146, -0.02135575966572586, 0.250894470026762, 0.03257780005716211, 0.0847900414279079, 0.005602492619593575, 0.295789783706934, 0.14656591127301014, 0.12192105164948275, -0.24953095754987098, 0.12357536137361473, 0.01990870292094059] |
1,803.03011 | Inverse Sturm-Liouville problems with summable potential | We describe the necessary and sufficient conditions for two sequences
{\mu_n}^\infty_n=0 and {a_n}^\infty_n=0 to be correspondingly the set of
eigenvalues and the set of norming constants of a Sturm-Liouville problem with
real summable potential q and in advance fixed separated boundary conditions.
| math.SP math.CA | we describe the necessary and sufficient conditions for two sequences mu_ninfty_n0 and a_ninfty_n0 to be correspondingly the set of eigenvalues and the set of norming constants of a sturmliouville problem with real summable potential q and in advance fixed separated boundary conditions | [['we', 'describe', 'the', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'two', 'sequences', 'mu_ninfty_n0', 'and', 'a_ninfty_n0', 'to', 'be', 'correspondingly', 'the', 'set', 'of', 'eigenvalues', 'and', 'the', 'set', 'of', 'norming', 'constants', 'of', 'a', 'sturmliouville', 'problem', 'with', 'real', 'summable', 'potential', 'q', 'and', 'in', 'advance', 'fixed', 'separated', 'boundary', 'conditions']] | [-0.15292143817059695, 0.10212646361906082, -0.04088878487236798, 0.04474308965727687, -0.05030494513339363, -0.14951269547455012, 0.0296181216603145, 0.3944933760911226, -0.29334334917366506, -0.2357789573725313, 0.16333451529208104, -0.24360557217150927, -0.12130743800662458, 0.18510291450656952, -0.06506612873636186, 0.1424179682508111, 0.09372663432732224, 0.0894928659312427, -0.057114134880248454, -0.24331917152740062, 0.4063245508819818, -0.08090891870670021, 0.15826156720868312, 0.1090440972475335, 0.08106151386164129, -0.03501350173028186, 0.013875871716300026, 0.0018159589264541865, -0.18886297544813715, 0.09331495466758497, 0.23553290544077754, 0.11578868366777897, 0.270671670883894, -0.39971179189160466, -0.11544259609654546, 0.21705968983005733, 0.10256138110999018, 0.017703092470765115, 0.010548880044370889, -0.2786136023118161, 0.12227032375521958, -0.06456053461879492, -0.18268890536855906, -0.08686373826349154, 0.06941558513790369, 0.04773978046432603, -0.42190786488354204, 0.04365450900513679, 0.03005929562204983, 0.06418025975581258, -0.16485735770547763, -0.1223255826625973, 0.003919660008978099, 0.17473846523789688, 0.02357932322192937, -0.03675506504951045, 0.019981937773991376, -0.07051507271826267, -0.050573600851930675, 0.3677447219379246, -0.03021500720642507, -0.2549058983102441, 0.16126105738803745, -0.1734403288573958, -0.09316934759262949, 0.09177372411359101, 0.13407189561985433, 0.14887056039879099, -0.15152482993435115, 0.12940200305893085, 0.008840818449971265, 0.10967574431560934, 0.1531850765401032, 0.04393043662421405, 0.1620471615693532, 0.05506834594998509, 0.12693839247804134, 0.11689219238178339, 0.022680083621526136, -0.04985037744045258, -0.4013524644076824, -0.12121689438354225, -0.2186060186184477, 0.03670870820060372, -0.12811092816846212, -0.2524221498053521, 0.4038322820328176, 0.12897593604866414, 0.23847502132412046, 0.050482345814816657, 0.17742735310457647, 0.1462708340601239, -0.015437718221801334, 0.026533713936805724, 0.11443098867312074, 0.16627902272157372, 0.06235641025705263, -0.20715038664638996, -0.023753720696549862, 0.1004645629436709] |
1,803.03012 | A summation formula for a ${}_3F_2(1)$ hypergeometric series | A summation formula is derived for the hypergeometric series of unit argument
${}_3F_2(1,1,c;d,n+2;1)$, where $n=0, 1, 2, \ldots$ and $\Re (d-c+n)>0$.
| math.CA | a summation formula is derived for the hypergeometric series of unit argument _3f_211cdn21 where n0 1 2 ldots and re dcn0 | [['a', 'summation', 'formula', 'is', 'derived', 'for', 'the', 'hypergeometric', 'series', 'of', 'unit', 'argument', '_3f_211cdn21', 'where', 'n0', '1', '2', 'ldots', 'and', 're', 'dcn0']] | [-0.19377788626833967, 0.04648014393291975, -0.03534252990625406, 0.0511258311483911, -0.011917847723356988, -0.21968828256879197, 0.04661787644420799, 0.24325155515811944, -0.2831931561231613, -0.22304652650889598, 0.10691925819571081, -0.3329250279225801, -0.10502005956674877, 0.2368198540551882, 0.016850012844722522, -0.02607380010579762, -0.074466991287313, 0.042188945863591995, -0.05963873858318517, -0.2282300541471494, 0.26027257627758543, -0.10218272598362282, 0.1625271363085822, 0.004877352449846895, 0.14998468982153818, 0.007348828042220128, -0.002024007176882342, -0.14139958529880173, -0.18217256640721308, 0.10735162553426467, 0.24037240200528973, 0.12109034155544482, 0.3298732905011428, -0.3606467212697393, -0.07108479238262302, 0.028934078830245295, 0.27836678216331884, -0.09900029091850708, 0.041581464980385806, -0.1453161041840519, 0.12137313495929304, -0.2350606673250073, -0.15774642955511808, -0.06143444149117721, 0.15574123533932785, 0.07755402854251627, -0.45893792337492895, 0.11609519889431172, 0.1169348475768378, 0.16722043162505879, -0.055531512455720654, -0.2510356122725888, 0.021585236793678058, 0.07838876650815732, 0.09081422217729453, 0.09786794280731365, 0.01876052008255532, -0.06060765477779664, -0.05006385898511661, 0.33966236639963954, 0.015342602457262967, -0.2340021551047501, -0.05195430336569093, -0.23506106696042575, -0.2064047062916583, 0.08330998040343586, 0.011778863244935087, 0.18809700811183766, -0.018051740272264732, 0.13652578581700495, -0.07999212667346, 0.12408486591946137, 0.17586777800400005, -0.07175916542397126, 0.06928100064396858, 0.0016871736826081026, -0.058858073218480536, 0.10030794476992205, -0.03202181015359728, -0.05997085022298913, -0.4025169391381113, -0.2080407215184287, -0.29523924029490445, 0.16582582248864988, -0.18032131660162887, -0.13749136530647152, 0.3211985646109832, 0.011509872531812442, 0.184138135935523, 0.21026148823531052, 0.2246435719885324, 0.2709388669678255, 0.007673094245164018, -0.03719370319557033, -0.04278444616418136, 0.16271674887914406, 0.02055981627812511, -0.05934788085716335, -0.08243587792017742, 0.23156423925569183] |
1,803.03013 | Prime lattice points in ovals | We study the distribution of lattice points with prime coordinates lying in
the dilate of a convex planar domain having smooth boundary, with nowhere
vanishing curvature. Counting lattice points weighted by a von Mangoldt
function gives an asymptotic formula, with the main term being the area of the
dilated domain, and our goal is to study the remainder term. Assuming the
Riemann Hypothesis, we give a sharp upper bound, and further assuming that the
positive imaginary parts of the zeros of the Riemann zeta functions are
linearly independent over the rationals allows us to give a formula for the
value distribution function of the properly normalized remainder term.
| math.NT math.PR | we study the distribution of lattice points with prime coordinates lying in the dilate of a convex planar domain having smooth boundary with nowhere vanishing curvature counting lattice points weighted by a von mangoldt function gives an asymptotic formula with the main term being the area of the dilated domain and our goal is to study the remainder term assuming the riemann hypothesis we give a sharp upper bound and further assuming that the positive imaginary parts of the zeros of the riemann zeta functions are linearly independent over the rationals allows us to give a formula for the value distribution function of the properly normalized remainder term | [['we', 'study', 'the', 'distribution', 'of', 'lattice', 'points', 'with', 'prime', 'coordinates', 'lying', 'in', 'the', 'dilate', 'of', 'a', 'convex', 'planar', 'domain', 'having', 'smooth', 'boundary', 'with', 'nowhere', 'vanishing', 'curvature', 'counting', 'lattice', 'points', 'weighted', 'by', 'a', 'von', 'mangoldt', 'function', 'gives', 'an', 'asymptotic', 'formula', 'with', 'the', 'main', 'term', 'being', 'the', 'area', 'of', 'the', 'dilated', 'domain', 'and', 'our', 'goal', 'is', 'to', 'study', 'the', 'remainder', 'term', 'assuming', 'the', 'riemann', 'hypothesis', 'we', 'give', 'a', 'sharp', 'upper', 'bound', 'and', 'further', 'assuming', 'that', 'the', 'positive', 'imaginary', 'parts', 'of', 'the', 'zeros', 'of', 'the', 'riemann', 'zeta', 'functions', 'are', 'linearly', 'independent', 'over', 'the', 'rationals', 'allows', 'us', 'to', 'give', 'a', 'formula', 'for', 'the', 'value', 'distribution', 'function', 'of', 'the', 'properly', 'normalized', 'remainder', 'term']] | [-0.19560632366833655, 0.07317995008081736, -0.1426163987748118, 0.054640708296102715, -0.09197176857937679, -0.08803332354700952, 0.06107679971804222, 0.2895131691841892, -0.26725089585374073, -0.2114638637846198, 0.09735634452900505, -0.3000033703931506, -0.11998400326680254, 0.16988684716461985, -0.0636904179635975, 0.05945423703545843, 0.014610886502648808, 0.06954305856143711, -0.07746476614934013, -0.2845111252843506, 0.38998243264440036, -0.025273068579500197, 0.2147043443509136, 0.11615020457948386, 0.08616930869606289, 0.024996472854615637, -0.007824346430155586, -0.0341323750714461, -0.16251555639050988, 0.13310521947547654, 0.2035462272318977, 0.06233638273901037, 0.2566532002141078, -0.38044331617722354, -0.15043268648959282, 0.17386566242634285, 0.11582872248578092, -0.01202162019735961, 0.031976063647393686, -0.22120013060393157, 0.08674964946543763, -0.10447313195241063, -0.21759004270899351, -0.030503227274123305, 0.028576988239634643, 0.042198695026821005, -0.29119426704279183, 0.07525340796672497, 0.09786862409587398, 0.07086631348890175, -0.09788029919501343, -0.1631976151644873, 0.018131826251865952, 0.1112944733230742, 0.07721893811227616, 0.11503784174392759, 0.04601147023236586, -0.09379738842620065, -0.04246652398594759, 0.2931504390737111, -0.10364501600809119, -0.2777685971749533, 0.08650133895032384, -0.2140745406202903, -0.05537498206400347, 0.12918935563518769, 0.1136370856375261, 0.1428100028316732, -0.08384071536258692, 0.15770659195496356, -0.09536081111744149, 0.1312507668874416, 0.1018170353533976, -0.017360749736393767, 0.19133516410538168, 0.05684328428469598, 0.12112855401614474, 0.2236953757668811, -0.06330679617692819, -0.09320193829653026, -0.4070935786391298, -0.1720002019994556, -0.24980618540818492, 0.08932431486728429, -0.1674250922447687, -0.27135747860841175, 0.3967607071605959, 0.030383817092687997, 0.22976412482697656, 0.1845326905173284, 0.25262484328683327, 0.177747353882296, 0.0824127131210709, 0.07570257040896211, 0.1167727943846128, 0.16869285763715636, 0.013761415718666589, -0.17389049460568154, 0.025875047280418652, 0.17998745450232592] |
1,803.03014 | Bondi or not Bondi: the impact of resolution on accretion and drag force
modelling for Supermassive Black Holes | Whilst in galaxy-size simulations, supermassive black holes (SMBH) are
entirely handled by sub-grid algorithms, computational power now allows the
accretion radius of such objects to be resolved in smaller scale simulations.
In this paper, we investigate the impact of resolution on two commonly used
SMBH sub-grid algorithms; the Bondi-Hoyle-Lyttleton (BHL) formula for accretion
onto a point mass, and the related estimate of the drag force exerted onto a
point mass by a gaseous medium. We find that when the accretion region around
the black hole scales with resolution, and the BHL formula is evaluated using
local mass-averaged quantities, the accretion algorithm smoothly transitions
from the analytic BHL formula (at low resolution) to a supply limited accretion
(SLA) scheme (at high resolution). However, when a similar procedure is
employed to estimate the drag force it can lead to significant errors in its
magnitude, and/or apply this force in the wrong direction in highly resolved
simulations. At high Mach numbers and for small accretors, we also find
evidence of the advective-acoustic instability operating in the adiabatic case,
and of an instability developing around the wake's stagnation point in the
quasi-isothermal case. Moreover, at very high resolution, and Mach numbers
above $\mathcal{M}_\infty \geq 3$, the flow behind the accretion bow shock
becomes entirely dominated by these instabilities. As a result, accretion rates
onto the black hole drop by about an order of magnitude in the adiabatic case,
compared to the analytic BHL formula.
| astro-ph.HE astro-ph.GA astro-ph.SR | whilst in galaxysize simulations supermassive black holes smbh are entirely handled by subgrid algorithms computational power now allows the accretion radius of such objects to be resolved in smaller scale simulations in this paper we investigate the impact of resolution on two commonly used smbh subgrid algorithms the bondihoylelyttleton bhl formula for accretion onto a point mass and the related estimate of the drag force exerted onto a point mass by a gaseous medium we find that when the accretion region around the black hole scales with resolution and the bhl formula is evaluated using local massaveraged quantities the accretion algorithm smoothly transitions from the analytic bhl formula at low resolution to a supply limited accretion sla scheme at high resolution however when a similar procedure is employed to estimate the drag force it can lead to significant errors in its magnitude andor apply this force in the wrong direction in highly resolved simulations at high mach numbers and for small accretors we also find evidence of the advectiveacoustic instability operating in the adiabatic case and of an instability developing around the wakes stagnation point in the quasiisothermal case moreover at very high resolution and mach numbers above mathcalm_infty geq 3 the flow behind the accretion bow shock becomes entirely dominated by these instabilities as a result accretion rates onto the black hole drop by about an order of magnitude in the adiabatic case compared to the analytic bhl formula | [['whilst', 'in', 'galaxysize', 'simulations', 'supermassive', 'black', 'holes', 'smbh', 'are', 'entirely', 'handled', 'by', 'subgrid', 'algorithms', 'computational', 'power', 'now', 'allows', 'the', 'accretion', 'radius', 'of', 'such', 'objects', 'to', 'be', 'resolved', 'in', 'smaller', 'scale', 'simulations', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'impact', 'of', 'resolution', 'on', 'two', 'commonly', 'used', 'smbh', 'subgrid', 'algorithms', 'the', 'bondihoylelyttleton', 'bhl', 'formula', 'for', 'accretion', 'onto', 'a', 'point', 'mass', 'and', 'the', 'related', 'estimate', 'of', 'the', 'drag', 'force', 'exerted', 'onto', 'a', 'point', 'mass', 'by', 'a', 'gaseous', 'medium', 'we', 'find', 'that', 'when', 'the', 'accretion', 'region', 'around', 'the', 'black', 'hole', 'scales', 'with', 'resolution', 'and', 'the', 'bhl', 'formula', 'is', 'evaluated', 'using', 'local', 'massaveraged', 'quantities', 'the', 'accretion', 'algorithm', 'smoothly', 'transitions', 'from', 'the', 'analytic', 'bhl', 'formula', 'at', 'low', 'resolution', 'to', 'a', 'supply', 'limited', 'accretion', 'sla', 'scheme', 'at', 'high', 'resolution', 'however', 'when', 'a', 'similar', 'procedure', 'is', 'employed', 'to', 'estimate', 'the', 'drag', 'force', 'it', 'can', 'lead', 'to', 'significant', 'errors', 'in', 'its', 'magnitude', 'andor', 'apply', 'this', 'force', 'in', 'the', 'wrong', 'direction', 'in', 'highly', 'resolved', 'simulations', 'at', 'high', 'mach', 'numbers', 'and', 'for', 'small', 'accretors', 'we', 'also', 'find', 'evidence', 'of', 'the', 'advectiveacoustic', 'instability', 'operating', 'in', 'the', 'adiabatic', 'case', 'and', 'of', 'an', 'instability', 'developing', 'around', 'the', 'wakes', 'stagnation', 'point', 'in', 'the', 'quasiisothermal', 'case', 'moreover', 'at', 'very', 'high', 'resolution', 'and', 'mach', 'numbers', 'above', 'mathcalm_infty', 'geq', '3', 'the', 'flow', 'behind', 'the', 'accretion', 'bow', 'shock', 'becomes', 'entirely', 'dominated', 'by', 'these', 'instabilities', 'as', 'a', 'result', 'accretion', 'rates', 'onto', 'the', 'black', 'hole', 'drop', 'by', 'about', 'an', 'order', 'of', 'magnitude', 'in', 'the', 'adiabatic', 'case', 'compared', 'to', 'the', 'analytic', 'bhl', 'formula']] | [-0.11179824152018361, 0.10620341755395704, -0.07913025601661791, 0.115893843189217, -0.04518870948268311, -0.0912706799986363, 0.043238820746311114, 0.3492393814822246, -0.23102400900901268, -0.33879394281195735, 0.11131620873886094, -0.25314771250056184, -0.03389625836341061, 0.2421749480274237, -0.05954231488507214, 0.02559976538455223, 0.0230937414114835, -0.04814633630142084, -0.08471481620419817, -0.18300760135728725, 0.31828580478451773, 0.12597661696483525, 0.19237763543660016, 0.03559800911164807, 0.09346108437441757, -0.08057089658087767, -0.018646431547125888, 0.019025181155168613, -0.19077101825151585, 0.008632577064341894, 0.22384359288588557, 0.05653077229530118, 0.25091010307752876, -0.43245563902366113, -0.20430919882173115, 0.032715461658173586, 0.1960974475398083, 0.10301997028797802, -0.08560977042623441, -0.18545018028171742, 0.07311829060820714, -0.2390006902748446, -0.16920453423797835, -0.003889268856480032, 0.03636227322598163, -0.004229525546932975, -0.2507141105943675, 0.1507232145144006, 0.057443109263030805, 0.007603475364182284, -0.07521604131649065, -0.03017730598832835, -0.04782791641661625, 0.061447749028097305, 0.09769608624616567, 0.06627450899949695, 0.22178999381919223, -0.16348326665244092, -0.03690039345246416, 0.38310154438969607, -0.052203803373867, -0.1575666654506254, 0.21909608457736265, -0.23224824107404035, -0.08825855220134164, 0.1986319279613823, 0.17364854455188064, 0.1495628368117258, -0.07222312707787625, 0.010514711398435522, -0.001192053383952747, 0.17326321951627524, 0.115654743915603, -0.030067001324279474, 0.32352127016338844, 0.14436893827948236, 0.033413450319366725, 0.10411618731937383, -0.1303579811714044, -0.0729852129255176, -0.23690698177370567, -0.08575903522006575, -0.17279097110726657, 0.07536088274480097, -0.16043346032867292, -0.10954523638327252, 0.2832503458909235, 0.15087817985930765, 0.23208721603216237, 0.03040477475268322, 0.3576046529830275, 0.13293179316557244, 0.0679651587367619, 0.15463098913828635, 0.29963213738607375, 0.13392908993142044, 0.10790413456080505, -0.25912498034610876, 0.039861725886823865, 0.09381173389757277] |
1,803.03015 | An FPGA-based Massively Parallel Neuromorphic Cortex Simulator | This paper presents a massively parallel and scalable neuromorphic cortex
simulator designed for simulating large and structurally connected spiking
neural networks, such as complex models of various areas of the cortex. The
main novelty of this work is the abstraction of a neuromorphic architecture
into clusters represented by minicolumns and hypercolumns, analogously to the
fundamental structural units observed in neurobiology. Without this approach,
simulating large-scale fully connected networks needs prohibitively large
memory to store look-up tables for point-to-point connections. Instead, we use
a novel architecture, based on the structural connectivity in the neocortex,
such that all the required parameters and connections can be stored in on-chip
memory. The cortex simulator can be easily reconfigured for simulating
different neural networks without any change in hardware structure by
programming the memory. A hierarchical communication scheme allows one neuron
to have a fan-out of up to 200k neurons. As a proof-of-concept, an
implementation on one Altera Stratix V FPGA was able to simulate 20 million to
2.6 billion leaky-integrate-and-fire (LIF) neurons in real time. We verified
the system by emulating a simplified auditory cortex (with 100 million
neurons). This cortex simulator achieved a low power dissipation of 1.62 {\mu}W
per neuron. With the advent of commercially available FPGA boards, our system
offers an accessible and scalable tool for the design, real-time simulation,
and analysis of large-scale spiking neural networks.
| cs.NE | this paper presents a massively parallel and scalable neuromorphic cortex simulator designed for simulating large and structurally connected spiking neural networks such as complex models of various areas of the cortex the main novelty of this work is the abstraction of a neuromorphic architecture into clusters represented by minicolumns and hypercolumns analogously to the fundamental structural units observed in neurobiology without this approach simulating largescale fully connected networks needs prohibitively large memory to store lookup tables for pointtopoint connections instead we use a novel architecture based on the structural connectivity in the neocortex such that all the required parameters and connections can be stored in onchip memory the cortex simulator can be easily reconfigured for simulating different neural networks without any change in hardware structure by programming the memory a hierarchical communication scheme allows one neuron to have a fanout of up to 200k neurons as a proofofconcept an implementation on one altera stratix v fpga was able to simulate 20 million to 26 billion leakyintegrateandfire lif neurons in real time we verified the system by emulating a simplified auditory cortex with 100 million neurons this cortex simulator achieved a low power dissipation of 162 muw per neuron with the advent of commercially available fpga boards our system offers an accessible and scalable tool for the design realtime simulation and analysis of largescale spiking neural networks | [['this', 'paper', 'presents', 'a', 'massively', 'parallel', 'and', 'scalable', 'neuromorphic', 'cortex', 'simulator', 'designed', 'for', 'simulating', 'large', 'and', 'structurally', 'connected', 'spiking', 'neural', 'networks', 'such', 'as', 'complex', 'models', 'of', 'various', 'areas', 'of', 'the', 'cortex', 'the', 'main', 'novelty', 'of', 'this', 'work', 'is', 'the', 'abstraction', 'of', 'a', 'neuromorphic', 'architecture', 'into', 'clusters', 'represented', 'by', 'minicolumns', 'and', 'hypercolumns', 'analogously', 'to', 'the', 'fundamental', 'structural', 'units', 'observed', 'in', 'neurobiology', 'without', 'this', 'approach', 'simulating', 'largescale', 'fully', 'connected', 'networks', 'needs', 'prohibitively', 'large', 'memory', 'to', 'store', 'lookup', 'tables', 'for', 'pointtopoint', 'connections', 'instead', 'we', 'use', 'a', 'novel', 'architecture', 'based', 'on', 'the', 'structural', 'connectivity', 'in', 'the', 'neocortex', 'such', 'that', 'all', 'the', 'required', 'parameters', 'and', 'connections', 'can', 'be', 'stored', 'in', 'onchip', 'memory', 'the', 'cortex', 'simulator', 'can', 'be', 'easily', 'reconfigured', 'for', 'simulating', 'different', 'neural', 'networks', 'without', 'any', 'change', 'in', 'hardware', 'structure', 'by', 'programming', 'the', 'memory', 'a', 'hierarchical', 'communication', 'scheme', 'allows', 'one', 'neuron', 'to', 'have', 'a', 'fanout', 'of', 'up', 'to', '200k', 'neurons', 'as', 'a', 'proofofconcept', 'an', 'implementation', 'on', 'one', 'altera', 'stratix', 'v', 'fpga', 'was', 'able', 'to', 'simulate', '20', 'million', 'to', '26', 'billion', 'leakyintegrateandfire', 'lif', 'neurons', 'in', 'real', 'time', 'we', 'verified', 'the', 'system', 'by', 'emulating', 'a', 'simplified', 'auditory', 'cortex', 'with', '100', 'million', 'neurons', 'this', 'cortex', 'simulator', 'achieved', 'a', 'low', 'power', 'dissipation', 'of', '162', 'muw', 'per', 'neuron', 'with', 'the', 'advent', 'of', 'commercially', 'available', 'fpga', 'boards', 'our', 'system', 'offers', 'an', 'accessible', 'and', 'scalable', 'tool', 'for', 'the', 'design', 'realtime', 'simulation', 'and', 'analysis', 'of', 'largescale', 'spiking', 'neural', 'networks']] | [-0.14958812915137487, 0.07076649782590391, 0.018926986871262503, 0.007054574902486716, -0.07761656848787932, -0.22025107908417033, 0.03478596102811017, 0.4233407939380381, -0.2710714217551481, -0.3553661034623804, 0.0688693772958163, -0.22555342174514528, -0.24859811188869457, 0.23505990760219572, -0.08262290970208042, 0.08212344023910047, 0.10844550871823923, 0.021896805876940158, 0.02438862098430374, -0.23908110763115265, 0.18764689377822247, 0.08493491599698906, 0.29861411806072347, -0.028623930634006103, 0.14224228995596677, -0.06823460244062661, 0.01906250755867171, -0.045223998451869175, -0.03202742040358856, 0.18422811472014755, 0.2991578890866863, 0.15338856721064076, 0.3127256997817699, -0.5529381887970772, -0.23162871600845747, 0.07555313482756966, 0.14743949102950735, 0.07982422296468795, -0.014090638992013987, -0.2930645523561923, 0.1318622760112043, -0.21150748622892176, -0.028753495158574057, -0.11296559449190488, 0.005712540901628677, 0.02250738395996128, -0.2276160223484225, -0.0014244661691178262, 0.01611386530669983, 0.09860948840696035, -0.004375858026591698, -0.04632090792509076, 0.013093466387826751, 0.14808428541147273, -0.1323301628184612, 0.059103725927230795, 0.19177286444330768, -0.10607474732657779, -0.14803596623128576, 0.306486572184295, -0.012273265157550145, -0.16890899661724432, 0.18563941665523298, -0.028572576329695676, -0.1472935075212303, 0.09953457295386722, 0.23958721165225916, 0.03415965236542103, -0.2205380600677758, 0.014655090290131007, 0.019085886315401413, 0.2596228142017581, 0.034155341006395105, -0.004039841552627627, 0.185444224640249, 0.31344067649009216, -0.012657801150880029, 0.1742131992591446, -0.09174427074540933, -0.08658410890534751, -0.21679856233500702, -0.1342855766415596, -0.19835378589011746, 0.03669270306188959, -0.11781378332651694, -0.12918629895780334, 0.43337347752376204, 0.1777554149595213, 0.17007387331604495, 0.11825140824941177, 0.35257682609279123, 0.02022296075340344, 0.19995747598102398, 0.12266636982485982, 0.11153230083185821, 0.09590721527316434, 0.19366937682477642, -0.16618641478058974, 0.06943250844457013, -0.0325572037888048] |
1,803.03016 | Compactly supported solution of the time-fractional porous medium
equation on the half-line | In this work we prove that the time-fractional porous medium equation on the
half-line with Dirichlet boundary condition has a unique compactly supported
solution. The approach we make is based on a transformation of the fractional
integro-differential equation into a nonlinear Volterra integral equation.
Then, the shooting method is applied in order to facilitate the analysis of the
free-boundary problem. We further show that there exists an exactly one choice
of initial conditions for which the solution has a zero which guarantees the
no-flux condition. Then, our previous considerations imply the unique solution
of the original problem.
| math.AP | in this work we prove that the timefractional porous medium equation on the halfline with dirichlet boundary condition has a unique compactly supported solution the approach we make is based on a transformation of the fractional integrodifferential equation into a nonlinear volterra integral equation then the shooting method is applied in order to facilitate the analysis of the freeboundary problem we further show that there exists an exactly one choice of initial conditions for which the solution has a zero which guarantees the noflux condition then our previous considerations imply the unique solution of the original problem | [['in', 'this', 'work', 'we', 'prove', 'that', 'the', 'timefractional', 'porous', 'medium', 'equation', 'on', 'the', 'halfline', 'with', 'dirichlet', 'boundary', 'condition', 'has', 'a', 'unique', 'compactly', 'supported', 'solution', 'the', 'approach', 'we', 'make', 'is', 'based', 'on', 'a', 'transformation', 'of', 'the', 'fractional', 'integrodifferential', 'equation', 'into', 'a', 'nonlinear', 'volterra', 'integral', 'equation', 'then', 'the', 'shooting', 'method', 'is', 'applied', 'in', 'order', 'to', 'facilitate', 'the', 'analysis', 'of', 'the', 'freeboundary', 'problem', 'we', 'further', 'show', 'that', 'there', 'exists', 'an', 'exactly', 'one', 'choice', 'of', 'initial', 'conditions', 'for', 'which', 'the', 'solution', 'has', 'a', 'zero', 'which', 'guarantees', 'the', 'noflux', 'condition', 'then', 'our', 'previous', 'considerations', 'imply', 'the', 'unique', 'solution', 'of', 'the', 'original', 'problem']] | [-0.11479593883508567, -0.0063772059953951556, -0.16666480170361236, 0.00844401458503928, -0.13697468105117916, -0.131384196143943, -0.001992740543539991, 0.3369597648222422, -0.3130671549156385, -0.20038750443185113, 0.16109084828694342, -0.27319126082680273, -0.16448902402231566, 0.1677190399315861, -0.034775693036769466, 0.11528623619683318, 0.11942342164705402, 0.05697500731642406, -0.05708550526904538, -0.22495169695658782, 0.386305725297977, -0.058230395323222446, 0.2656624814802685, 0.07833857657675891, 0.16933139290218963, -0.0464653891568869, 0.012465203046491466, 0.010578739447231145, -0.2062070190664393, 0.07187110690649637, 0.19067491081149615, 0.08431666945203294, 0.35406003738801506, -0.4426167785890938, -0.22893292445343794, 0.09917796779539167, 0.122953558571099, 0.08472043596275304, -0.07540694780086081, -0.29242047934418486, 0.09594530677998957, -0.0943118260150833, -0.20204076930381282, -0.014936813498972003, -0.005644323942779573, 0.02690853826706442, -0.34726126553471554, 0.0805836581919008, 0.09268084780994765, -0.04175864673248425, -0.18600463845584655, -0.06849597943178617, -0.0036919166492394256, 0.046643051051189065, 0.05488182675842311, 0.025507516011634132, 0.015211972753642146, -0.10315283893645961, -0.05522654581210125, 0.3735517496819195, -0.07457981763297174, -0.3238362311049528, 0.13723918906240196, -0.11161080021987256, -0.1283876203557419, 0.13161842883132474, 0.11567291023075274, 0.15654560146354063, -0.17851537308108406, 0.13962263230368802, -0.11818814635596037, 0.17312493112379895, 0.06607469528452638, -0.04445657067807372, 0.09789118718010248, 0.18045410642714826, 0.16864419985831397, 0.1581424256383451, 0.021083814934491345, -0.10350561294567857, -0.3357666137330618, -0.186256668290373, -0.18441658319194906, 0.0808605414289578, -0.0910248447296008, -0.21438985393795462, 0.3653271735271381, 0.17631702993266746, 0.1403279419815571, 0.042154637926267745, 0.25548528382895497, 0.2414864995816876, -0.011634016436519888, 0.0679681330016747, 0.1771428873858501, 0.12925820812803798, 0.138305515012483, -0.23851448017143712, 0.04158704243024293, 0.15664593848524636] |
1,803.03017 | Infinite Reduced Words, Lattice Property And Braid Graph of Affine Weyl
Groups | In this paper, we establish a bijection between the infinite reduced words of
an affine Weyl group and certain biclosed sets of its positive system and
determine all finitely generated biclosed sets in the positive system of an
affine Weyl group. Using these results, we show first that the biclosed sets in
the standard positive system of rank 3 affine Weyl groups when ordered by
inclusion form a complete algebraic ortholattice and secondly that the
(generalized) braid graphs of those Coxeter groups are connected, which can be
thought of as an infinite version of Tit's solution to the word problem.
| math.RT math.CO math.GR | in this paper we establish a bijection between the infinite reduced words of an affine weyl group and certain biclosed sets of its positive system and determine all finitely generated biclosed sets in the positive system of an affine weyl group using these results we show first that the biclosed sets in the standard positive system of rank 3 affine weyl groups when ordered by inclusion form a complete algebraic ortholattice and secondly that the generalized braid graphs of those coxeter groups are connected which can be thought of as an infinite version of tits solution to the word problem | [['in', 'this', 'paper', 'we', 'establish', 'a', 'bijection', 'between', 'the', 'infinite', 'reduced', 'words', 'of', 'an', 'affine', 'weyl', 'group', 'and', 'certain', 'biclosed', 'sets', 'of', 'its', 'positive', 'system', 'and', 'determine', 'all', 'finitely', 'generated', 'biclosed', 'sets', 'in', 'the', 'positive', 'system', 'of', 'an', 'affine', 'weyl', 'group', 'using', 'these', 'results', 'we', 'show', 'first', 'that', 'the', 'biclosed', 'sets', 'in', 'the', 'standard', 'positive', 'system', 'of', 'rank', '3', 'affine', 'weyl', 'groups', 'when', 'ordered', 'by', 'inclusion', 'form', 'a', 'complete', 'algebraic', 'ortholattice', 'and', 'secondly', 'that', 'the', 'generalized', 'braid', 'graphs', 'of', 'those', 'coxeter', 'groups', 'are', 'connected', 'which', 'can', 'be', 'thought', 'of', 'as', 'an', 'infinite', 'version', 'of', 'tits', 'solution', 'to', 'the', 'word', 'problem']] | [-0.176397446077317, 0.13811583232527483, -0.04762856762856245, 0.043801582645392044, -0.09361331943364348, -0.12321209538262337, 0.034068093654932456, 0.33162345077842476, -0.38589212514460086, -0.21062164604198189, 0.0986686391395051, -0.29148781412281094, -0.16922110830899328, 0.19744659497926478, -0.11946315241977573, -0.025868893042788842, 0.04467969207791612, 0.130517268741969, -0.10414555400144308, -0.31874024095013737, 0.41969367923215034, -0.05238531114184298, 0.2401172027667053, -0.0012912804633378983, 0.1306023718509823, -0.013298228259664029, -0.02065714356023818, 0.0767991758696735, -0.10001504115600256, 0.13061039736378008, 0.3051560269924812, 0.08123220512177795, 0.2186080024205148, -0.3683832063851878, -0.09857375483494252, 0.19589294175617397, 0.1528388488991186, 0.048273998495424165, -0.03451618109829724, -0.3239129304513335, 0.1315499570965767, -0.2229370346199721, -0.13235464569181205, -0.040375223476439716, 0.04149558137287386, -0.00043760242639109495, -0.21455002388218417, -0.008371767764911055, 0.12974913003854455, 0.11008026094641536, -0.10052399277337827, -0.09035722523927689, -0.04144933694042265, 0.14261020889884093, -0.03435963274911046, -0.0024558659398462622, 0.038549713629763574, -0.045728697821032255, -0.1781337081734091, 0.397918604160659, -0.018509338439907878, -0.23371587820351125, 0.15602625967934727, -0.15434076270554214, -0.14531923976261168, 0.10804120667278766, 0.12779183679260314, 0.08995184418308781, -0.07165829590565409, 0.149962166454643, -0.19611074828542768, 0.08087476054206491, 0.09188463416416198, -0.026868734555318952, 0.14202238477766513, 0.06320660386700183, 0.09917990131303668, 0.15734568596002646, 0.07343639973551035, 0.0047669558576308195, -0.3614153899624944, -0.2016808880167082, -0.14661882518674246, 0.0766421156236902, -0.15215838409450952, -0.24733961258549242, 0.3684577513183467, 0.06825265250634402, 0.15048300261842087, 0.11766125117545016, 0.17507436916232108, 0.0684271023410838, 0.054592052795924245, 0.05184819177724421, 0.07759611028712243, 0.18667831480968744, -0.0759784270543605, -0.1694018959905952, -0.005168296447955072, 0.21062046978157015] |
1,803.03018 | Cross-domain Recommendation via Deep Domain Adaptation | The behavior of users in certain services could be a clue that can be used to
infer their preferences and may be used to make recommendations for other
services they have never used. However, the cross-domain relationships between
items and user consumption patterns are not simple, especially when there are
few or no common users and items across domains. To address this problem, we
propose a content-based cross-domain recommendation method for cold-start users
that does not require user- and item- overlap. We formulate recommendation as
extreme multi-class classification where labels (items) corresponding to the
users are predicted. With this formulation, the problem is reduced to a domain
adaptation setting, in which a classifier trained in the source domain is
adapted to the target domain. For this, we construct a neural network that
combines an architecture for domain adaptation, Domain Separation Network, with
a denoising autoencoder for item representation. We assess the performance of
our approach in experiments on a pair of data sets collected from movie and
news services of Yahoo! JAPAN and show that our approach outperforms several
baseline methods including a cross-domain collaborative filtering method.
| cs.LG cs.CL cs.IR | the behavior of users in certain services could be a clue that can be used to infer their preferences and may be used to make recommendations for other services they have never used however the crossdomain relationships between items and user consumption patterns are not simple especially when there are few or no common users and items across domains to address this problem we propose a contentbased crossdomain recommendation method for coldstart users that does not require user and item overlap we formulate recommendation as extreme multiclass classification where labels items corresponding to the users are predicted with this formulation the problem is reduced to a domain adaptation setting in which a classifier trained in the source domain is adapted to the target domain for this we construct a neural network that combines an architecture for domain adaptation domain separation network with a denoising autoencoder for item representation we assess the performance of our approach in experiments on a pair of data sets collected from movie and news services of yahoo japan and show that our approach outperforms several baseline methods including a crossdomain collaborative filtering method | [['the', 'behavior', 'of', 'users', 'in', 'certain', 'services', 'could', 'be', 'a', 'clue', 'that', 'can', 'be', 'used', 'to', 'infer', 'their', 'preferences', 'and', 'may', 'be', 'used', 'to', 'make', 'recommendations', 'for', 'other', 'services', 'they', 'have', 'never', 'used', 'however', 'the', 'crossdomain', 'relationships', 'between', 'items', 'and', 'user', 'consumption', 'patterns', 'are', 'not', 'simple', 'especially', 'when', 'there', 'are', 'few', 'or', 'no', 'common', 'users', 'and', 'items', 'across', 'domains', 'to', 'address', 'this', 'problem', 'we', 'propose', 'a', 'contentbased', 'crossdomain', 'recommendation', 'method', 'for', 'coldstart', 'users', 'that', 'does', 'not', 'require', 'user', 'and', 'item', 'overlap', 'we', 'formulate', 'recommendation', 'as', 'extreme', 'multiclass', 'classification', 'where', 'labels', 'items', 'corresponding', 'to', 'the', 'users', 'are', 'predicted', 'with', 'this', 'formulation', 'the', 'problem', 'is', 'reduced', 'to', 'a', 'domain', 'adaptation', 'setting', 'in', 'which', 'a', 'classifier', 'trained', 'in', 'the', 'source', 'domain', 'is', 'adapted', 'to', 'the', 'target', 'domain', 'for', 'this', 'we', 'construct', 'a', 'neural', 'network', 'that', 'combines', 'an', 'architecture', 'for', 'domain', 'adaptation', 'domain', 'separation', 'network', 'with', 'a', 'denoising', 'autoencoder', 'for', 'item', 'representation', 'we', 'assess', 'the', 'performance', 'of', 'our', 'approach', 'in', 'experiments', 'on', 'a', 'pair', 'of', 'data', 'sets', 'collected', 'from', 'movie', 'and', 'news', 'services', 'of', 'yahoo', 'japan', 'and', 'show', 'that', 'our', 'approach', 'outperforms', 'several', 'baseline', 'methods', 'including', 'a', 'crossdomain', 'collaborative', 'filtering', 'method']] | [-0.04652488530479013, -0.035118889778196924, -0.06777980734399933, 0.099654411379731, -0.18734792922000915, -0.19651136694246912, 0.0943045209605187, 0.4947325177490711, -0.2736632319535801, -0.3266421191986989, 0.07822728305850409, -0.3172722360428004, -0.17043701338178333, 0.16505208943637753, -0.1459822235977586, 0.02811800714900946, 0.12471757967829365, 0.08090589416990265, -0.04692842919232553, -0.3173033839127766, 0.3213484027886136, -0.00025594901208850473, 0.34234035465826484, 0.05779232141277927, 0.0872716376673739, -0.020906409943466358, -0.053598700591143876, 0.005559068678674054, -0.046927374477135915, 0.15778840273832853, 0.4125106216154315, 0.24032108588044576, 0.34780753383980717, -0.38503147316860026, -0.21245563164711956, 0.10432585322218424, 0.15508524561798906, 0.08469399190345968, -0.04281653854672244, -0.34962223268507475, 0.11996495930159236, -0.2224725785037692, 0.016367070717870302, -0.10654528523897404, -0.035913622158674156, 0.018585957111765875, -0.35733182266115504, 0.015092477300777075, 0.03775512587863025, 0.032357030827054045, -0.06471744639410533, -0.08688484088213926, 0.058613589553929424, 0.1959876859055416, 0.06640022755276791, 0.02009507249990966, 0.12352854265696941, -0.16571943539463702, -0.16965091209435326, 0.4019129952306257, -0.033394217588266426, -0.2533527213064107, 0.21126577914767167, -0.029087667555154805, -0.12452712267721919, 0.05880814472482326, 0.2549003747006739, 0.10464827389640605, -0.192627174395431, -0.025176581772876017, -0.08638772104473356, 0.21343504892472914, 0.06880373125870956, -0.015657201287944247, 0.19015202526299452, 0.242347073321664, 0.08868924048380618, 0.09520000398232487, -0.07914394076619756, -0.038121184649165064, -0.1797882398182058, -0.10754794898482767, -0.20875483910667705, -0.024528736342460583, -0.0997926862059064, -0.14569468613350414, 0.38323042214036307, 0.21537419834440663, 0.20457322474937628, 0.07728782753920167, 0.2894318433015303, 0.0344212000304335, 0.10499375740708634, 0.10392094533990093, 0.11076142525370108, -0.05249399520123108, 0.18727980067525157, -0.13710949561847524, 0.10757945280118701, 0.036442803502839835] |
1,803.03019 | Generalized Linear Models for Geometrical Current predictors. An
application to predict garment fit | The aim of this paper is to model an ordinal response variable in terms of
vector-valued functional data included on a vector-valued RKHS. In particular,
we focus on the vector-valued RKHS obtained when a geometrical object (body) is
characterized by a current and on the ordinal regression model. A common way to
solve this problem in functional data analysis is to express the data in the
orthonormal basis given by decomposition of the covariance operator. But our
data present very important differences with respect to the usual functional
data setting. On the one hand, they are vector-valued functions, and on the
other, they are functions in an RKHS with a previously defined norm. We propose
to use three different bases: the orthonormal basis given by the kernel that
defines the RKHS, a basis obtained from decomposition of the integral operator
defined using the covariance function, and a third basis that combines the
previous two. The three approaches are compared and applied to an interesting
problem: building a model to predict the fit of children's garment sizes, based
on a 3D database of the Spanish child population.
| stat.AP | the aim of this paper is to model an ordinal response variable in terms of vectorvalued functional data included on a vectorvalued rkhs in particular we focus on the vectorvalued rkhs obtained when a geometrical object body is characterized by a current and on the ordinal regression model a common way to solve this problem in functional data analysis is to express the data in the orthonormal basis given by decomposition of the covariance operator but our data present very important differences with respect to the usual functional data setting on the one hand they are vectorvalued functions and on the other they are functions in an rkhs with a previously defined norm we propose to use three different bases the orthonormal basis given by the kernel that defines the rkhs a basis obtained from decomposition of the integral operator defined using the covariance function and a third basis that combines the previous two the three approaches are compared and applied to an interesting problem building a model to predict the fit of childrens garment sizes based on a 3d database of the spanish child population | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'model', 'an', 'ordinal', 'response', 'variable', 'in', 'terms', 'of', 'vectorvalued', 'functional', 'data', 'included', 'on', 'a', 'vectorvalued', 'rkhs', 'in', 'particular', 'we', 'focus', 'on', 'the', 'vectorvalued', 'rkhs', 'obtained', 'when', 'a', 'geometrical', 'object', 'body', 'is', 'characterized', 'by', 'a', 'current', 'and', 'on', 'the', 'ordinal', 'regression', 'model', 'a', 'common', 'way', 'to', 'solve', 'this', 'problem', 'in', 'functional', 'data', 'analysis', 'is', 'to', 'express', 'the', 'data', 'in', 'the', 'orthonormal', 'basis', 'given', 'by', 'decomposition', 'of', 'the', 'covariance', 'operator', 'but', 'our', 'data', 'present', 'very', 'important', 'differences', 'with', 'respect', 'to', 'the', 'usual', 'functional', 'data', 'setting', 'on', 'the', 'one', 'hand', 'they', 'are', 'vectorvalued', 'functions', 'and', 'on', 'the', 'other', 'they', 'are', 'functions', 'in', 'an', 'rkhs', 'with', 'a', 'previously', 'defined', 'norm', 'we', 'propose', 'to', 'use', 'three', 'different', 'bases', 'the', 'orthonormal', 'basis', 'given', 'by', 'the', 'kernel', 'that', 'defines', 'the', 'rkhs', 'a', 'basis', 'obtained', 'from', 'decomposition', 'of', 'the', 'integral', 'operator', 'defined', 'using', 'the', 'covariance', 'function', 'and', 'a', 'third', 'basis', 'that', 'combines', 'the', 'previous', 'two', 'the', 'three', 'approaches', 'are', 'compared', 'and', 'applied', 'to', 'an', 'interesting', 'problem', 'building', 'a', 'model', 'to', 'predict', 'the', 'fit', 'of', 'childrens', 'garment', 'sizes', 'based', 'on', 'a', '3d', 'database', 'of', 'the', 'spanish', 'child', 'population']] | [-0.05756853069103653, 0.00953188111405677, -0.11211494784517419, 0.09649245318160543, -0.09919727118235201, -0.08448406395762759, 0.015853965341398914, 0.3748280272608803, -0.2847963061273819, -0.24849543936196364, 0.12493118347777855, -0.29058806974721213, -0.15949838461294288, 0.18631197355552426, -0.08530466684881317, 0.08981148635978581, 0.06681203108621381, 0.07002505006629133, -0.08082342245340628, -0.2355570178829454, 0.39618294512332286, 0.04184935210142485, 0.27601146941844334, -0.05034467250719586, 0.12042385980647097, 0.021987700938767885, -0.06575489775227603, -0.0067983528559086145, -0.08724967392278217, 0.2047214393932072, 0.2776137225289819, 0.15952933899637672, 0.32346275645328226, -0.4237406449655311, -0.17793335165748353, 0.09510895138686543, 0.09714660770384975, 0.03286088504753406, -0.009297051032634592, -0.2803754454418536, 0.005857677779771308, -0.1439218300861627, -0.08822742292296983, -0.10322166680889104, -0.010460708876170458, 0.006247437191045572, -0.31993711856444196, 0.05451723029937155, 0.03046638340193538, 0.06501288551671972, -0.12760121980682015, -0.15515157961479378, 0.0027045639800108087, 0.1054329757313607, 0.03199567554596191, 0.08908208505931481, 0.08718674031076251, -0.0916353562153295, -0.10086770635630224, 0.36414045137503454, -0.07918627981987772, -0.2893053104197206, 0.1628618207822744, -0.14273005437296166, -0.14031041314404818, 0.037050413383391274, 0.18548170414250043, 0.10598109765804463, -0.17444142020191378, 0.09680430718912914, -0.07981801184735471, 0.15479236744063837, 0.00979581649286262, 0.0025372355775807494, 0.1191613832939296, 0.15283388009805593, 0.04847463202833008, 0.15697901067855988, -0.05503839889280899, -0.0745682487497732, -0.2919819152723717, -0.12738655496423723, -0.20995231124607505, -0.02160586235902062, -0.11290071937674907, -0.19374203491675598, 0.42801370215351864, 0.13397396667560021, 0.24431197387566891, 0.07263920543044405, 0.2824695680580873, 0.13036681470894304, 0.09809079312535393, 0.03752833843401443, 0.1809267880788113, 0.0956280202572284, 0.060529133517755775, -0.15133822739489816, 0.08235205547077962, 0.09764710777083672] |
1,803.0302 | The string equation for non-univalent functions | For conformal maps defined in the unit disk one can define a certain Poisson
bracket that involves the harmonic moments of the image domain. When this
bracket is applied to the conformal map itself together with its conformally
reflected map the result is identically one. This is called the string
equation, and it is closely connected to the governing equation, the
Polubarinova-Galin equation, for the evolution of a Hele-Shaw blob of a viscous
fluid (or, by another name, Laplacian growth). In the present paper we
investigate to what extent the string equation makes sense and holds for
non-univalent analytic functions.
We give positive answers in two cases: for polynomials and for a special
class of rational functions.
| math.CV | for conformal maps defined in the unit disk one can define a certain poisson bracket that involves the harmonic moments of the image domain when this bracket is applied to the conformal map itself together with its conformally reflected map the result is identically one this is called the string equation and it is closely connected to the governing equation the polubarinovagalin equation for the evolution of a heleshaw blob of a viscous fluid or by another name laplacian growth in the present paper we investigate to what extent the string equation makes sense and holds for nonunivalent analytic functions we give positive answers in two cases for polynomials and for a special class of rational functions | [['for', 'conformal', 'maps', 'defined', 'in', 'the', 'unit', 'disk', 'one', 'can', 'define', 'a', 'certain', 'poisson', 'bracket', 'that', 'involves', 'the', 'harmonic', 'moments', 'of', 'the', 'image', 'domain', 'when', 'this', 'bracket', 'is', 'applied', 'to', 'the', 'conformal', 'map', 'itself', 'together', 'with', 'its', 'conformally', 'reflected', 'map', 'the', 'result', 'is', 'identically', 'one', 'this', 'is', 'called', 'the', 'string', 'equation', 'and', 'it', 'is', 'closely', 'connected', 'to', 'the', 'governing', 'equation', 'the', 'polubarinovagalin', 'equation', 'for', 'the', 'evolution', 'of', 'a', 'heleshaw', 'blob', 'of', 'a', 'viscous', 'fluid', 'or', 'by', 'another', 'name', 'laplacian', 'growth', 'in', 'the', 'present', 'paper', 'we', 'investigate', 'to', 'what', 'extent', 'the', 'string', 'equation', 'makes', 'sense', 'and', 'holds', 'for', 'nonunivalent', 'analytic', 'functions', 'we', 'give', 'positive', 'answers', 'in', 'two', 'cases', 'for', 'polynomials', 'and', 'for', 'a', 'special', 'class', 'of', 'rational', 'functions']] | [-0.14651293606043625, 0.08326504610351518, -0.07719033818110389, 0.07961464210604437, -0.13280026242932957, -0.14090505979843757, -0.0442600012727034, 0.3064474913562274, -0.32471619798348117, -0.19823394900856492, 0.09158204277304725, -0.2640682217071995, -0.17445688575315169, 0.16971908227747512, -0.08025365419144559, 0.03839475938077204, 0.0313675502458444, 0.07838141219690442, -0.05884614906027021, -0.24238776435188025, 0.4138178071245933, 0.00029413913113948627, 0.22217927952933833, 0.030889665707945824, 0.16470833146610322, -0.021570566890395094, -0.018682554427884582, -0.015631304660695233, -0.17764059330256404, 0.10244136673107775, 0.2233743132251259, 0.08870018410504374, 0.23563825929314536, -0.3942661213680592, -0.18852506598266652, 0.09426271006401278, 0.13928626125487378, 0.0729044939781356, -0.011579031708777651, -0.22700933687006816, 0.0811587633121297, -0.09296256667560238, -0.1824644851561986, -0.019372995065238614, 0.03141320023176252, 0.030737634064156052, -0.273241623559505, 0.08902100769755168, 0.10182363372773696, 0.007029575789267691, -0.08141564811146063, -0.03815090377679747, -0.013403423910594394, 0.09362018361322494, 0.0193411011256787, 0.09987617945039852, 0.10456627715900381, -0.1347430380420465, -0.0668569309806101, 0.40663377160174596, -0.07101652131646745, -0.3135536611537871, 0.12138798135595444, -0.1710851463751915, -0.1504399905122546, 0.08080885786678578, 0.09736096803258118, 0.11056047860278279, -0.14731482295262224, 0.13962016386252582, -0.08149977345974782, 0.10422999039093335, 0.10911115958618048, -0.05873362122016012, 0.18760974339854258, 0.08593227831113479, 0.09498583095876548, 0.20376236700954345, -0.011628635235764604, -0.11941491656053142, -0.3292658362760503, -0.20646424503981048, -0.16801980125685978, 0.10106901814922309, -0.1018485700430271, -0.2242902947955916, 0.4024343903606328, 0.09094546692178218, 0.19218330750337395, 0.08946556183429928, 0.23368470216146073, 0.17638339232016578, 0.04782548814247816, 0.07279773534108432, 0.14997286037104124, 0.19028531728336254, 0.11798854327052195, -0.1601031996263987, 0.020190303062653948, 0.1673653670029444] |
1,803.03021 | SA-IGA: A Multiagent Reinforcement Learning Method Towards Socially
Optimal Outcomes | In multiagent environments, the capability of learning is important for an
agent to behave appropriately in face of unknown opponents and dynamic
environment. From the system designer's perspective, it is desirable if the
agents can learn to coordinate towards socially optimal outcomes, while also
avoiding being exploited by selfish opponents. To this end, we propose a novel
gradient ascent based algorithm (SA-IGA) which augments the basic
gradient-ascent algorithm by incorporating social awareness into the policy
update process. We theoretically analyze the learning dynamics of SA-IGA using
dynamical system theory and SA-IGA is shown to have linear dynamics for a wide
range of games including symmetric games. The learning dynamics of two
representative games (the prisoner's dilemma game and the coordination game)
are analyzed in details. Based on the idea of SA-IGA, we further propose a
practical multiagent learning algorithm, called SA-PGA, based on Q-learning
update rule. Simulation results show that SA-PGA agent can achieve higher
social welfare than previous social-optimality oriented Conditional Joint
Action Learner (CJAL) and also is robust against individually rational
opponents by reaching Nash equilibrium solutions.
| cs.AI | in multiagent environments the capability of learning is important for an agent to behave appropriately in face of unknown opponents and dynamic environment from the system designers perspective it is desirable if the agents can learn to coordinate towards socially optimal outcomes while also avoiding being exploited by selfish opponents to this end we propose a novel gradient ascent based algorithm saiga which augments the basic gradientascent algorithm by incorporating social awareness into the policy update process we theoretically analyze the learning dynamics of saiga using dynamical system theory and saiga is shown to have linear dynamics for a wide range of games including symmetric games the learning dynamics of two representative games the prisoners dilemma game and the coordination game are analyzed in details based on the idea of saiga we further propose a practical multiagent learning algorithm called sapga based on qlearning update rule simulation results show that sapga agent can achieve higher social welfare than previous socialoptimality oriented conditional joint action learner cjal and also is robust against individually rational opponents by reaching nash equilibrium solutions | [['in', 'multiagent', 'environments', 'the', 'capability', 'of', 'learning', 'is', 'important', 'for', 'an', 'agent', 'to', 'behave', 'appropriately', 'in', 'face', 'of', 'unknown', 'opponents', 'and', 'dynamic', 'environment', 'from', 'the', 'system', 'designers', 'perspective', 'it', 'is', 'desirable', 'if', 'the', 'agents', 'can', 'learn', 'to', 'coordinate', 'towards', 'socially', 'optimal', 'outcomes', 'while', 'also', 'avoiding', 'being', 'exploited', 'by', 'selfish', 'opponents', 'to', 'this', 'end', 'we', 'propose', 'a', 'novel', 'gradient', 'ascent', 'based', 'algorithm', 'saiga', 'which', 'augments', 'the', 'basic', 'gradientascent', 'algorithm', 'by', 'incorporating', 'social', 'awareness', 'into', 'the', 'policy', 'update', 'process', 'we', 'theoretically', 'analyze', 'the', 'learning', 'dynamics', 'of', 'saiga', 'using', 'dynamical', 'system', 'theory', 'and', 'saiga', 'is', 'shown', 'to', 'have', 'linear', 'dynamics', 'for', 'a', 'wide', 'range', 'of', 'games', 'including', 'symmetric', 'games', 'the', 'learning', 'dynamics', 'of', 'two', 'representative', 'games', 'the', 'prisoners', 'dilemma', 'game', 'and', 'the', 'coordination', 'game', 'are', 'analyzed', 'in', 'details', 'based', 'on', 'the', 'idea', 'of', 'saiga', 'we', 'further', 'propose', 'a', 'practical', 'multiagent', 'learning', 'algorithm', 'called', 'sapga', 'based', 'on', 'qlearning', 'update', 'rule', 'simulation', 'results', 'show', 'that', 'sapga', 'agent', 'can', 'achieve', 'higher', 'social', 'welfare', 'than', 'previous', 'socialoptimality', 'oriented', 'conditional', 'joint', 'action', 'learner', 'cjal', 'and', 'also', 'is', 'robust', 'against', 'individually', 'rational', 'opponents', 'by', 'reaching', 'nash', 'equilibrium', 'solutions']] | [-0.07686405933927745, 0.03311974869051482, -0.14070049737047935, 0.07035260013210064, -0.12081489675811359, -0.22763169560215568, 0.09268539812083224, 0.4797473371135337, -0.28634973134313313, -0.29209400327077933, 0.05650505201824542, -0.22062528484101807, -0.2432688792688506, 0.07803839719056019, -0.16659462545562875, 0.058553178613739355, 0.054589628050369876, 0.046680736133296576, 0.037861837690163935, -0.2923812140524387, 0.32790841452511293, 0.06260701763576695, 0.27997143504342864, -0.02137894471841199, 0.17170978297080314, 0.040122080125313785, 0.030100281107838134, 0.04827924014202186, -0.09672853462551886, 0.11134753349104098, 0.3204483155307493, 0.23713269082563265, 0.4166545558082206, -0.4174396093535636, -0.1596718816632139, 0.10935731365744557, 0.14651702893448862, 0.1163210940558929, -0.03754540646315686, -0.3346341742894479, 0.08271688170065837, -0.20030529120803944, -0.050277501169059956, -0.11185903027653694, -0.03813040253440184, 0.03760085003264976, -0.305527268871665, -0.04924566820297124, 0.04138974944312525, 0.0808398877669658, -0.0633019696084583, -0.1172526260691562, 0.020916408376236047, 0.15656030939093657, 0.010871433285563918, -0.007735372045343475, 0.2093217873307211, -0.15273176305661243, -0.21859194334596396, 0.3764431057763951, -0.02865486005429245, -0.17694276967218944, 0.15782261694781483, -0.016438856855300922, -0.13219137360607938, 0.0944349411449262, 0.23265508091010687, 0.15464591873543604, -0.1699122086533212, 0.03462471606076828, -0.06682024114366089, 0.16150406133250467, -0.005965891243623836, -0.003620814135564225, 0.1475825569060232, 0.2234920985730631, 0.17321903286900903, 0.11550631071174783, 0.022597615890470997, -0.24557616460536208, -0.17851167440414428, -0.0883660767440285, -0.13908630712889136, 0.01493509456116174, -0.10865614705818838, -0.09443329108005855, 0.35048887025032727, 0.2046289611980319, 0.1216176805831492, 0.12988343134588962, 0.3209262057127697, 0.0708353638236544, 0.006553198061883449, 0.1116527523339859, 0.21556713684062873, 0.03241328360113714, 0.13252044185596917, -0.24213511515807892, 0.1692096935605098, 0.06066021757466453] |
1,803.03022 | Direct imaging of antiferromagnetic domains in Mn$_2$Au manipulated by
high magnetic fields | In the field of antiferromagnetic (AFM) spintronics, information about the
N\'eel vector, AFM domain sizes, and spin-flop fields is a prerequisite for
device applications but is not available easily. We have investigated AFM
domains and spin-flop induced changes of domain patterns in Mn2Au(001)
epitaxial thin films by X-ray magnetic linear dichroism photoemission electron
microscopy (XMLD-PEEM) using magnetic fields up to 70 T. As-prepared Mn$_2$Au
films exhibit AFM domains with an average size $\sim$ 1 $\mu$m. Application of
a 30T field, exceeding the spin-flop field, along a magnetocrystalline easy
axis, dramatically increases the AFM domain size with N\'eel vectors
perpendicular to the applied field direction. The width of N\'eel type domain
walls (DW) is below the spatial resolution of the PEEM and therefore can only
be estimated from an analysis of the DW profile to be smaller than 80 nm.
Furthermore, using the values for the DW width and the spin-flop field, we
evaluate an in-plane anisotropy constant ranging between 1 and 17 $\mu$eV/f.u.
| cond-mat.mtrl-sci | in the field of antiferromagnetic afm spintronics information about the neel vector afm domain sizes and spinflop fields is a prerequisite for device applications but is not available easily we have investigated afm domains and spinflop induced changes of domain patterns in mn2au001 epitaxial thin films by xray magnetic linear dichroism photoemission electron microscopy xmldpeem using magnetic fields up to 70 t asprepared mn_2au films exhibit afm domains with an average size sim 1 mum application of a 30t field exceeding the spinflop field along a magnetocrystalline easy axis dramatically increases the afm domain size with neel vectors perpendicular to the applied field direction the width of neel type domain walls dw is below the spatial resolution of the peem and therefore can only be estimated from an analysis of the dw profile to be smaller than 80 nm furthermore using the values for the dw width and the spinflop field we evaluate an inplane anisotropy constant ranging between 1 and 17 muevfu | [['in', 'the', 'field', 'of', 'antiferromagnetic', 'afm', 'spintronics', 'information', 'about', 'the', 'neel', 'vector', 'afm', 'domain', 'sizes', 'and', 'spinflop', 'fields', 'is', 'a', 'prerequisite', 'for', 'device', 'applications', 'but', 'is', 'not', 'available', 'easily', 'we', 'have', 'investigated', 'afm', 'domains', 'and', 'spinflop', 'induced', 'changes', 'of', 'domain', 'patterns', 'in', 'mn2au001', 'epitaxial', 'thin', 'films', 'by', 'xray', 'magnetic', 'linear', 'dichroism', 'photoemission', 'electron', 'microscopy', 'xmldpeem', 'using', 'magnetic', 'fields', 'up', 'to', '70', 't', 'asprepared', 'mn_2au', 'films', 'exhibit', 'afm', 'domains', 'with', 'an', 'average', 'size', 'sim', '1', 'mum', 'application', 'of', 'a', '30t', 'field', 'exceeding', 'the', 'spinflop', 'field', 'along', 'a', 'magnetocrystalline', 'easy', 'axis', 'dramatically', 'increases', 'the', 'afm', 'domain', 'size', 'with', 'neel', 'vectors', 'perpendicular', 'to', 'the', 'applied', 'field', 'direction', 'the', 'width', 'of', 'neel', 'type', 'domain', 'walls', 'dw', 'is', 'below', 'the', 'spatial', 'resolution', 'of', 'the', 'peem', 'and', 'therefore', 'can', 'only', 'be', 'estimated', 'from', 'an', 'analysis', 'of', 'the', 'dw', 'profile', 'to', 'be', 'smaller', 'than', '80', 'nm', 'furthermore', 'using', 'the', 'values', 'for', 'the', 'dw', 'width', 'and', 'the', 'spinflop', 'field', 'we', 'evaluate', 'an', 'inplane', 'anisotropy', 'constant', 'ranging', 'between', '1', 'and', '17', 'muevfu']] | [-0.1647229637237615, 0.20640236579447446, 0.0023408786044456066, -0.017296969373273897, -0.11836359580047429, -0.12463202236867801, 0.03038910418836167, 0.49539599360723513, -0.3079671267303638, -0.3305330318864435, 0.06324781738330784, -0.2823122897236317, -0.018322322549647652, 0.21935114511288703, 0.07095603024645243, -0.027715804048330028, -0.06245884319214383, -0.03853008527948987, -0.08921476173200063, -0.19884345441168988, 0.21919734700932167, -0.04216381634469144, 0.34420724830124527, 0.08079174094018526, 0.06408315866719931, 0.00013446451630443333, 0.16357664269162342, 0.05725093731307425, -0.18646201714873314, 0.04599621104248399, 0.2449776203953661, -0.09382129488876671, 0.18050642707094083, -0.4267148332444776, -0.1614602826353803, -0.011656323220813647, 0.17618479683651458, 0.1353009300335543, -0.018128178227925673, -0.30922685378754977, 0.13118992078234443, -0.06626855153590441, -0.11630964163086902, -0.09864661890314892, 0.01384822203181102, 0.0007234867778606712, -0.2659101374734746, 0.12121008994290605, 0.07871569921408081, 0.21810438499087467, -0.12387069674878148, -0.125224774092203, -0.05652805957943201, 0.03232712406315841, 0.09636897127638804, 0.21695213756393059, 0.21861433353333268, -0.13167458223574613, -0.15393071387661622, 0.2959161716978997, -0.05412106525591298, -0.07550127672730014, 0.12249112351273653, -0.21693140241259243, 0.021960851920266578, 0.21387508038897068, 0.08158200003672392, 0.10048661944456398, -0.09847278626111802, 0.0893404511425615, 0.06499820373719559, 0.2958192223100923, 0.12605143295950255, 0.014863891247659921, 0.22732206137297908, 0.16414071239996703, 0.07200797838304425, 0.15309006329771363, -0.19990715125168207, -0.006050178466830402, -0.1857463269494474, -0.18541981829330326, -0.23868989572802093, 0.040179499922032846, -0.15990201293852807, -0.17179491526039783, 0.35619040903693533, 0.19011935330636334, 0.17892909739457535, -0.0804443234228529, 0.2665113609866239, 0.053200084269337825, 0.11323038661648752, 0.0437209632305894, 0.2156874889973551, 0.22911581846456103, 0.191501884428817, -0.23222472050547366, 0.05816354482085444, -0.07124921226059086] |
1,803.03023 | Double Soft Graviton Theorems and BMS Symmetries | It is now well understood that Ward identities associated to the (extended)
BMS algebra are equivalent to single soft graviton theorems. In this work, we
show that if we consider nested Ward identities constructed out of two BMS
charges, a class of double soft factorization theorems can be recovered. By
making connections with earlier works in the literature, we argue that at the
sub-leading order, these double soft graviton theorems are the so-called
consecutive double soft graviton theorems. We also show how these nested Ward
identities can be understood as Ward identities associated to BMS symmetries in
scattering states defined around (non-Fock) vacua parametrized by
supertranslations or superrotations.
| hep-th gr-qc | it is now well understood that ward identities associated to the extended bms algebra are equivalent to single soft graviton theorems in this work we show that if we consider nested ward identities constructed out of two bms charges a class of double soft factorization theorems can be recovered by making connections with earlier works in the literature we argue that at the subleading order these double soft graviton theorems are the socalled consecutive double soft graviton theorems we also show how these nested ward identities can be understood as ward identities associated to bms symmetries in scattering states defined around nonfock vacua parametrized by supertranslations or superrotations | [['it', 'is', 'now', 'well', 'understood', 'that', 'ward', 'identities', 'associated', 'to', 'the', 'extended', 'bms', 'algebra', 'are', 'equivalent', 'to', 'single', 'soft', 'graviton', 'theorems', 'in', 'this', 'work', 'we', 'show', 'that', 'if', 'we', 'consider', 'nested', 'ward', 'identities', 'constructed', 'out', 'of', 'two', 'bms', 'charges', 'a', 'class', 'of', 'double', 'soft', 'factorization', 'theorems', 'can', 'be', 'recovered', 'by', 'making', 'connections', 'with', 'earlier', 'works', 'in', 'the', 'literature', 'we', 'argue', 'that', 'at', 'the', 'subleading', 'order', 'these', 'double', 'soft', 'graviton', 'theorems', 'are', 'the', 'socalled', 'consecutive', 'double', 'soft', 'graviton', 'theorems', 'we', 'also', 'show', 'how', 'these', 'nested', 'ward', 'identities', 'can', 'be', 'understood', 'as', 'ward', 'identities', 'associated', 'to', 'bms', 'symmetries', 'in', 'scattering', 'states', 'defined', 'around', 'nonfock', 'vacua', 'parametrized', 'by', 'supertranslations', 'or', 'superrotations']] | [-0.14719313924649247, 0.18798216860913844, -0.12254262146005337, 0.17193902332197736, -0.11603404536489742, -0.14670129374307753, 0.03279009865838344, 0.3713813405139027, -0.2803233404152302, -0.24301307928248275, 0.12267517153479814, -0.2746405263810798, -0.18927618394890386, 0.1259528334323679, -0.09999223255241911, 0.019876706496385548, -0.00047290723563896283, 0.013845416074791164, -0.10510986561119487, -0.25116307781879893, 0.34669620223791786, -0.022326337930280715, 0.24181311919905799, 0.039989388388238255, 0.07131211018983137, 0.060500156138678665, -0.07094375535638796, 0.002085527978596036, -0.06795073924385414, 0.061945728782491105, 0.27239619407811444, 0.04540508888075473, 0.13612910801829356, -0.4222498335185702, -0.13765468372514955, 0.06060936959908792, 0.19158260905425306, 0.058683706895896685, 0.010133008153557225, -0.27418543907158355, 0.11388760318988245, -0.21998997058512437, -0.2420791723992874, -0.12915485446703517, -0.058023768015792246, -0.052054095426919286, -0.20364173633236163, 0.10301379325095762, 0.08802020982774492, -0.06760427568116467, -0.031333773828077095, -0.09619265843475996, -0.07748572100859343, 0.08520948326999873, 0.15083933860619758, -0.022659795065582904, 0.1065202871578987, -0.1421146220894082, -0.22829826381402435, 0.2748131601924629, 0.0007323904611877407, -0.21650797505086908, 0.1346488428427148, -0.13416541696750317, -0.27100489874094447, 0.09197188832331449, 0.045304284676805966, 0.12931555213354942, -0.23149941163137555, 0.16819397775732256, -0.07943470195082396, 0.07408793287403467, 0.16913460877172096, 0.07984681905643945, 0.22625891592664024, -0.018527640646358055, -0.05569271490633212, 0.17545598251443287, 0.035791791081902814, -0.09270110095126761, -0.39991761881996085, -0.09394233495846425, -0.11254568556668582, 0.13290802375585944, -0.09315389533596183, -0.16037370761666722, 0.27663612734586757, 0.1058888179336295, 0.12608359702345398, 0.08332242609726058, 0.1969840949513363, 0.17284471173318, 0.19666596327442676, 0.06526153820083926, 0.22526536537851724, 0.17966469099176013, 0.06375841803296849, -0.1498823480435897, -0.08448983840989294, 0.19017936524728107] |
1,803.03024 | Magnetic-field gradiometer based on ultracold collisions | We present a detailed analysis of the usefulness of ultracold atomic
collisions for sensing the strength of an external magnetic field as well as
its spatial gradient. The core idea of the sensor, which we recently proposed
in K. Jachymski \emph{et al.}, Phys. Rev. Lett. {\bf 120}, 013401 (2018), is to
probe the transmission of the atoms through a set of quasi-one-dimensional
waveguides that contain an impurity. Magnetic field-dependent interactions
between the incoming atoms and the impurity naturally lead to narrow resonances
that can act as sensitive field probes since they strongly affect the
transmission. We illustrate our findings with concrete examples of experimental
relevance, demonstrating that a sensitivity of the order of 1 nT for the field
strength and $100\,\mathrm{nT}/\mathrm{mm}$ for the gradient can be reached
using our scheme.
| quant-ph cond-mat.quant-gas physics.atom-ph | we present a detailed analysis of the usefulness of ultracold atomic collisions for sensing the strength of an external magnetic field as well as its spatial gradient the core idea of the sensor which we recently proposed in k jachymski emphet al phys rev lett bf 120 013401 2018 is to probe the transmission of the atoms through a set of quasionedimensional waveguides that contain an impurity magnetic fielddependent interactions between the incoming atoms and the impurity naturally lead to narrow resonances that can act as sensitive field probes since they strongly affect the transmission we illustrate our findings with concrete examples of experimental relevance demonstrating that a sensitivity of the order of 1 nt for the field strength and 100mathrmntmathrmmm for the gradient can be reached using our scheme | [['we', 'present', 'a', 'detailed', 'analysis', 'of', 'the', 'usefulness', 'of', 'ultracold', 'atomic', 'collisions', 'for', 'sensing', 'the', 'strength', 'of', 'an', 'external', 'magnetic', 'field', 'as', 'well', 'as', 'its', 'spatial', 'gradient', 'the', 'core', 'idea', 'of', 'the', 'sensor', 'which', 'we', 'recently', 'proposed', 'in', 'k', 'jachymski', 'emphet', 'al', 'phys', 'rev', 'lett', 'bf', '120', '013401', '2018', 'is', 'to', 'probe', 'the', 'transmission', 'of', 'the', 'atoms', 'through', 'a', 'set', 'of', 'quasionedimensional', 'waveguides', 'that', 'contain', 'an', 'impurity', 'magnetic', 'fielddependent', 'interactions', 'between', 'the', 'incoming', 'atoms', 'and', 'the', 'impurity', 'naturally', 'lead', 'to', 'narrow', 'resonances', 'that', 'can', 'act', 'as', 'sensitive', 'field', 'probes', 'since', 'they', 'strongly', 'affect', 'the', 'transmission', 'we', 'illustrate', 'our', 'findings', 'with', 'concrete', 'examples', 'of', 'experimental', 'relevance', 'demonstrating', 'that', 'a', 'sensitivity', 'of', 'the', 'order', 'of', '1', 'nt', 'for', 'the', 'field', 'strength', 'and', '100mathrmntmathrmmm', 'for', 'the', 'gradient', 'can', 'be', 'reached', 'using', 'our', 'scheme']] | [-0.1072191556359735, 0.145678791194268, -0.02137931988099879, -0.045211780613266625, -0.04269809446969004, -0.09344166595161199, 0.06333024916058594, 0.39052318332738484, -0.21299830020961258, -0.3476369204071834, 0.010920883025504764, -0.2701883293948201, -0.1446276909216892, 0.20063600105110757, -0.011474744561164416, 0.012570914853898477, 0.005617374020029408, 0.014247120534928963, -0.023273954650769806, -0.2530354138196612, 0.2403560187053946, 0.11428986764115881, 0.2741336320046798, 0.13177026347112805, 0.06944094731764824, 0.03825487592438048, 0.048729548447353895, 0.03820290403483912, -0.1114068365386347, 0.08129519877559144, 0.21369482802638654, 0.0684732645001017, 0.23891193360855528, -0.4388646415124337, -0.22740608398881992, 0.04897462817038908, 0.14453975183441659, 0.14030333183427854, -0.059810071907461036, -0.34693886747930286, 0.049633088155266965, -0.16107800583059126, -0.1296299871448933, -0.1268531701657488, 0.03559562633113661, 0.06312757291399708, -0.3284550738816922, 0.08442766204938408, 0.05001305685606027, 0.06859092016671893, -0.03533216260369983, -0.07785287442393313, -0.018039086709058908, 0.05305141302063888, -0.008151494105555868, 0.05143863376042293, 0.17373891869855887, -0.0842921096274611, -0.10879299103087464, 0.35545906807158806, -0.08149890805858137, -0.12411106340117868, 0.21729514239601386, -0.10273328925259123, -0.07733405197342468, 0.09979310116275798, 0.18165839115252932, 0.12408839566849691, -0.10661617255329277, 0.07680681513626013, -0.06424965292699057, 0.17496201510147674, 0.06583412397380327, 0.0654722203125152, 0.21038259748845947, 0.14411679062227062, 0.01193257127058252, 0.1129266726883677, -0.1412745726515012, -0.07108951625892489, -0.314423326883003, -0.17090906099914466, -0.20803502054755077, 0.03429494051771715, -0.04265794757904319, -0.13023995328694582, 0.39557074431551403, 0.2038201524392348, 0.24086421361741747, -0.07588357405372455, 0.23874033469158087, 0.10444243002311568, 0.03459984862945916, 0.06902965839028127, 0.282878518869826, 0.20053988021740676, 0.09823281903816171, -0.27409631027226417, -0.005721586269088263, -0.01652804180048406] |
1,803.03025 | Insights into the robustness of control point configurations for
homography and planar pose estimation | In this paper, we investigate the influence of the spatial configuration of a
number of $n \geq 4$ control points on the accuracy and robustness of space
resection methods, e.g. used by a fiducial marker for pose estimation. We find
robust configurations of control points by minimizing the first order perturbed
solution of the DLT algorithm which is equivalent to minimizing the condition
number of the data matrix. An empirical statistical evaluation is presented
verifying that these optimized control point configurations not only increase
the performance of the DLT homography estimation but also improve the
performance of planar pose estimation methods like IPPE and EPnP, including the
iterative minimization of the reprojection error which is the most accurate
algorithm. We provide the characteristics of stable control point
configurations for real-world noisy camera data that are practically
independent on the camera pose and form certain symmetric patterns dependent on
the number of points. Finally, we present a comparison of optimized
configuration versus the number of control points.
| cs.CV | in this paper we investigate the influence of the spatial configuration of a number of n geq 4 control points on the accuracy and robustness of space resection methods eg used by a fiducial marker for pose estimation we find robust configurations of control points by minimizing the first order perturbed solution of the dlt algorithm which is equivalent to minimizing the condition number of the data matrix an empirical statistical evaluation is presented verifying that these optimized control point configurations not only increase the performance of the dlt homography estimation but also improve the performance of planar pose estimation methods like ippe and epnp including the iterative minimization of the reprojection error which is the most accurate algorithm we provide the characteristics of stable control point configurations for realworld noisy camera data that are practically independent on the camera pose and form certain symmetric patterns dependent on the number of points finally we present a comparison of optimized configuration versus the number of control points | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'influence', 'of', 'the', 'spatial', 'configuration', 'of', 'a', 'number', 'of', 'n', 'geq', '4', 'control', 'points', 'on', 'the', 'accuracy', 'and', 'robustness', 'of', 'space', 'resection', 'methods', 'eg', 'used', 'by', 'a', 'fiducial', 'marker', 'for', 'pose', 'estimation', 'we', 'find', 'robust', 'configurations', 'of', 'control', 'points', 'by', 'minimizing', 'the', 'first', 'order', 'perturbed', 'solution', 'of', 'the', 'dlt', 'algorithm', 'which', 'is', 'equivalent', 'to', 'minimizing', 'the', 'condition', 'number', 'of', 'the', 'data', 'matrix', 'an', 'empirical', 'statistical', 'evaluation', 'is', 'presented', 'verifying', 'that', 'these', 'optimized', 'control', 'point', 'configurations', 'not', 'only', 'increase', 'the', 'performance', 'of', 'the', 'dlt', 'homography', 'estimation', 'but', 'also', 'improve', 'the', 'performance', 'of', 'planar', 'pose', 'estimation', 'methods', 'like', 'ippe', 'and', 'epnp', 'including', 'the', 'iterative', 'minimization', 'of', 'the', 'reprojection', 'error', 'which', 'is', 'the', 'most', 'accurate', 'algorithm', 'we', 'provide', 'the', 'characteristics', 'of', 'stable', 'control', 'point', 'configurations', 'for', 'realworld', 'noisy', 'camera', 'data', 'that', 'are', 'practically', 'independent', 'on', 'the', 'camera', 'pose', 'and', 'form', 'certain', 'symmetric', 'patterns', 'dependent', 'on', 'the', 'number', 'of', 'points', 'finally', 'we', 'present', 'a', 'comparison', 'of', 'optimized', 'configuration', 'versus', 'the', 'number', 'of', 'control', 'points']] | [-0.14579024722248815, 0.007710583721768117, -0.057365521804213795, 0.03018457054873224, -0.019787620909216746, -0.14357992651497536, 0.06277774419371471, 0.3770860355438256, -0.23403059537650267, -0.3502170211754785, 0.14320308975122936, -0.25375717134703313, -0.1707737761529776, 0.2090025753785129, -0.12597672581791924, 0.11683888059278394, 0.10277417879239316, 0.03949428426840757, -0.09825378857842623, -0.27821142608853533, 0.31234524619095483, 0.02837947129467843, 0.3082295123242103, 0.00012060746028110748, 0.13046870983586215, 0.04675009871425573, -0.02410039159315979, 0.04550786370041684, -0.11526119825190641, 0.14308498743154882, 0.226614111930802, 0.16584318261922773, 0.26400323692005034, -0.38008254321814494, -0.17168294242583215, 0.13598848480969758, 0.12082972117334465, 0.08568226220192694, -0.0531028577058417, -0.27608612058513865, 0.10782553184644046, -0.1037642528947511, -0.09434122350861932, -0.07624445133984498, -0.020088118310767886, 0.0563463753305103, -0.3124008494480399, 0.034381724431402354, 0.030593408950286487, 0.06860034833889364, -0.07326239644033017, -0.12017344228679133, 0.004977662800584079, 0.1627498100076592, 0.01574407502577254, 0.03138514872208783, 0.14166244670816855, -0.14615274276783144, -0.10110515519755142, 0.3549775945863164, -0.0009631364043410186, -0.26433111617069055, 0.12684396742388787, -0.06599108985534347, -0.11016891175943495, 0.15246693338778597, 0.2128315414472415, 0.14428222007345318, -0.11736614826112622, 0.050674699756910274, -0.03475722357653445, 0.18051070440950998, 0.05307706153281487, 0.016246756413815226, 0.1407901796415766, 0.18011880229034166, 0.14054210677106932, 0.127066128939765, -0.1640721972160064, -0.08862508550320365, -0.30149833362254247, -0.1284551478264159, -0.1904823408581362, -0.019174949867170298, -0.14743760701458086, -0.1909388385730137, 0.4077280048045284, 0.1992963809440503, 0.20211106444362598, 0.061970202617131445, 0.33384013677969937, 0.09239653041359128, 0.004426405254734408, 0.0711142234348056, 0.2154211192107873, 0.058020011381325655, 0.026984481172204564, -0.24435121831824866, 0.0828832491164709, 0.060336371490493326] |
1,803.03026 | S-wave elastic scattering of ${\it o}$-Ps from $\text{H}_2$ at low
energy | The confined variational method is applied to investigate the low-energy
elastic scattering of ortho-positronium from $\text{H}_2$ by first-principles
quantum mechanics. Describing the correlation effect with explicitly correlated
Gaussians, we obtain accurate $S$-wave phase shifts and pick-off annihilation
parameters for different incident momenta. By a least-squares fit of the data
to the effective-range theory, we determine the $S$-wave scattering length,
$A_s=2.06a_0$, and the zero-energy value of the pick-off annihilation
parameter, $^1\!\text{Z}_\text{eff}=0.1858$. The obtained
$^1\!\text{Z}_\text{eff}$ agrees well with the precise experimental value of
$0.186(1)$ (J.\ Phys.\ B \textbf{16}, 4065 (1983)) and the obtained $A_s$
agrees well with the value of $2.1(2)a_0$ estimated from the average
experimental momentum-transfer cross section for Ps energy below 0.3 eV (J.\
Phys.\ B \textbf{36}, 4191 (2003)).
| physics.atom-ph | the confined variational method is applied to investigate the lowenergy elastic scattering of orthopositronium from texth_2 by firstprinciples quantum mechanics describing the correlation effect with explicitly correlated gaussians we obtain accurate swave phase shifts and pickoff annihilation parameters for different incident momenta by a leastsquares fit of the data to the effectiverange theory we determine the swave scattering length a_s206a_0 and the zeroenergy value of the pickoff annihilation parameter 1textz_texteff01858 the obtained 1textz_texteff agrees well with the precise experimental value of 01861 j phys b textbf16 4065 1983 and the obtained a_s agrees well with the value of 212a_0 estimated from the average experimental momentumtransfer cross section for ps energy below 03 ev j phys b textbf36 4191 2003 | [['the', 'confined', 'variational', 'method', 'is', 'applied', 'to', 'investigate', 'the', 'lowenergy', 'elastic', 'scattering', 'of', 'orthopositronium', 'from', 'texth_2', 'by', 'firstprinciples', 'quantum', 'mechanics', 'describing', 'the', 'correlation', 'effect', 'with', 'explicitly', 'correlated', 'gaussians', 'we', 'obtain', 'accurate', 'swave', 'phase', 'shifts', 'and', 'pickoff', 'annihilation', 'parameters', 'for', 'different', 'incident', 'momenta', 'by', 'a', 'leastsquares', 'fit', 'of', 'the', 'data', 'to', 'the', 'effectiverange', 'theory', 'we', 'determine', 'the', 'swave', 'scattering', 'length', 'a_s206a_0', 'and', 'the', 'zeroenergy', 'value', 'of', 'the', 'pickoff', 'annihilation', 'parameter', '1textz_texteff01858', 'the', 'obtained', '1textz_texteff', 'agrees', 'well', 'with', 'the', 'precise', 'experimental', 'value', 'of', '01861', 'j', 'phys', 'b', 'textbf16', '4065', '1983', 'and', 'the', 'obtained', 'a_s', 'agrees', 'well', 'with', 'the', 'value', 'of', '212a_0', 'estimated', 'from', 'the', 'average', 'experimental', 'momentumtransfer', 'cross', 'section', 'for', 'ps', 'energy', 'below', '03', 'ev', 'j', 'phys', 'b', 'textbf36', '4191', '2003']] | [-0.08244823623579323, 0.16296295577807254, -0.0464729273471197, 0.05258593137739553, -0.0210030686371682, -0.11401296218473203, 0.0697333370815358, 0.3309266034660763, -0.21102430794525662, -0.33910343101607604, -0.05697440478558603, -0.3245193269757325, -0.037271116586532774, 0.1768070221020791, 0.0458800054335019, 0.1003106503886285, 0.04523112142474897, 0.013957886560411569, -0.08738278251513022, -0.17494301223441175, 0.24760181535639914, 0.07727107283426449, 0.26500873056469126, 0.09378230521912899, 0.03408191077872751, 0.11603318454121779, -0.023440422686307055, -0.03987956322778605, -0.2524207269102989, 0.09269925838708061, 0.23305439402470815, -0.0062977172017685676, 0.09899208054412156, -0.3479873800666578, -0.17388672286056375, 0.04845126981748954, 0.10872292885426105, 0.09258692910723192, 0.06555776528425906, -0.34018320209559116, 0.0009640480653105074, -0.18891939375214606, -0.1455418724615715, -0.05868659693780437, 0.09742603632376383, -0.0008894142678432297, -0.3126494710644086, 0.20054426706567602, -0.05356268984420846, 0.03128305056184457, -0.09505334314522579, -0.2227762288234213, -0.03132419890965123, 0.01409158183735583, 0.046629524624318276, 0.07037153936056584, 0.14382077644889554, -0.08250819054981612, -0.08959874915563616, 0.3599885950812645, -0.0840115567175018, -0.09008836104910363, 0.09235306112340798, -0.10933641882321242, -0.029842881896337003, 0.1820980928707541, 0.10409608302155934, 0.08549635504472494, -0.12167936180138209, 0.13215355174217716, -0.037627973855450636, 0.16875809825152127, 0.11623737079565201, -0.005990186432507216, 0.1603180372621864, 0.11420033758571535, -0.03641610740471566, 0.05399684012017883, -0.1519371149448776, -0.08766530377978231, -0.32044941169748964, -0.09187101725610933, -0.20307364901364372, 0.0754221585587386, -0.03751052318821486, -0.10459123766575654, 0.3261688735474947, 0.1156677232050386, 0.2819986905383861, 0.030318982862426264, 0.2574654717464, 0.15916937493041092, 0.004656904533284863, 0.07544666856298582, 0.31186168708658796, 0.21101325984100663, 0.07983182077071417, -0.29220731978165804, 0.006113097467868213, 0.04194567195679012] |
1,803.03027 | The Podles sphere as a spectral metric space | We study the spectral metric aspects of the standard Podles sphere, which is
a homogeneous space for quantum SU(2). The point of departure is the real
equivariant spectral triple investigated by Dabrowski and Sitarz. The Dirac
operator of this spectral triple interprets the standard Podles sphere as a
0-dimensional space and is therefore not isospectral to the Dirac operator on
the 2-sphere. We show that the seminorm coming from commutators with this Dirac
operator provides the Podles sphere with the structure of a compact quantum
metric space in the sense of Rieffel.
| math.OA math.FA | we study the spectral metric aspects of the standard podles sphere which is a homogeneous space for quantum su2 the point of departure is the real equivariant spectral triple investigated by dabrowski and sitarz the dirac operator of this spectral triple interprets the standard podles sphere as a 0dimensional space and is therefore not isospectral to the dirac operator on the 2sphere we show that the seminorm coming from commutators with this dirac operator provides the podles sphere with the structure of a compact quantum metric space in the sense of rieffel | [['we', 'study', 'the', 'spectral', 'metric', 'aspects', 'of', 'the', 'standard', 'podles', 'sphere', 'which', 'is', 'a', 'homogeneous', 'space', 'for', 'quantum', 'su2', 'the', 'point', 'of', 'departure', 'is', 'the', 'real', 'equivariant', 'spectral', 'triple', 'investigated', 'by', 'dabrowski', 'and', 'sitarz', 'the', 'dirac', 'operator', 'of', 'this', 'spectral', 'triple', 'interprets', 'the', 'standard', 'podles', 'sphere', 'as', 'a', '0dimensional', 'space', 'and', 'is', 'therefore', 'not', 'isospectral', 'to', 'the', 'dirac', 'operator', 'on', 'the', '2sphere', 'we', 'show', 'that', 'the', 'seminorm', 'coming', 'from', 'commutators', 'with', 'this', 'dirac', 'operator', 'provides', 'the', 'podles', 'sphere', 'with', 'the', 'structure', 'of', 'a', 'compact', 'quantum', 'metric', 'space', 'in', 'the', 'sense', 'of', 'rieffel']] | [-0.12859470101640277, 0.09217341978143415, -0.11064763786271214, 0.08598310845200499, -0.09478875456641064, -0.09940771629487205, -0.007012180447497446, 0.3282950420499496, -0.2853391357980993, -0.19472717163760378, 0.09378943466151174, -0.2923484801456494, -0.19018590135459343, 0.1789235859380468, -0.1248673417949644, 0.05432968357901858, 0.057430500863752655, 0.09115554348417114, -0.15981742175316196, -0.19531909491880747, 0.4706790424559427, 0.024337869114748646, 0.2131545153223788, 0.03380218917584937, 0.10677937392155519, 0.045030370142067906, -0.0014435644210923624, -0.018433087989725882, -0.11989059381013921, 0.13460199695849873, 0.19704053439604846, 0.05544542471761815, 0.16654287131108425, -0.32549955992473534, -0.21231421068027292, 0.14228970657669657, 0.07514642131433863, -0.041271953905537805, -0.010480909564016063, -0.34429290848176763, 0.06508804456857235, -0.14195567338079537, -0.1473710045380437, -0.05966290784999728, -0.018103971966015903, -0.06537812647824782, -0.20850187701327502, 0.02072673822429193, 0.09768156814591392, 0.04286529826324271, -0.06227062147556116, -0.04502458623914129, -0.07083097726369844, 0.09180643105292288, -0.01958172556022992, 0.06581670320947128, 0.11869091502613509, -0.031884030190944344, -0.13903289124921328, 0.44096389601928304, -0.1056973286803164, -0.27538819406586496, 0.1013548189531202, -0.20461926163356428, -0.10705915784321564, 0.06688686727505663, 0.04704434427169516, 0.12837491217879174, -0.07379032303035037, 0.2772742970631478, -0.10346738537064874, 0.09496228871316618, 0.042911937470426376, 0.04052050903935552, 0.16782139017975525, 0.09904910368925851, 0.11222475599598787, 0.11834523537317695, -0.0638039683260064, -0.15070533224776306, -0.3482075605703437, -0.24671238183762637, -0.21827297690122024, 0.13736475953777225, -0.1278071667611189, -0.24373028470385497, 0.41052144549726305, 0.03487177521152341, 0.2104398941851484, 0.035405138255673985, 0.249327022784754, 0.10996648234583478, 0.059856371083499296, 0.042515059067543756, 0.2177770675625652, 0.16994357644833383, 0.07033002519291705, -0.17280228221637156, -0.14255187693355686, 0.19822637369329837] |
1,803.03028 | Classification of one-class spinor genera for quaternary quadratic forms | A quadratic form has a one-class spinor genus if its spinor genus consists of
a single equivalence class. In this paper, we determine that there is only one
primitive quaternary genus which has a one-class spinor genus but not a
one-class genus. In all other cases, the genera of primitive quaternary
lattices either have a genus and spinor genus which coincide, or the the genus
splits into multiple spinor genera, which in turn split into multiple
equivalence classes.
| math.NT | a quadratic form has a oneclass spinor genus if its spinor genus consists of a single equivalence class in this paper we determine that there is only one primitive quaternary genus which has a oneclass spinor genus but not a oneclass genus in all other cases the genera of primitive quaternary lattices either have a genus and spinor genus which coincide or the the genus splits into multiple spinor genera which in turn split into multiple equivalence classes | [['a', 'quadratic', 'form', 'has', 'a', 'oneclass', 'spinor', 'genus', 'if', 'its', 'spinor', 'genus', 'consists', 'of', 'a', 'single', 'equivalence', 'class', 'in', 'this', 'paper', 'we', 'determine', 'that', 'there', 'is', 'only', 'one', 'primitive', 'quaternary', 'genus', 'which', 'has', 'a', 'oneclass', 'spinor', 'genus', 'but', 'not', 'a', 'oneclass', 'genus', 'in', 'all', 'other', 'cases', 'the', 'genera', 'of', 'primitive', 'quaternary', 'lattices', 'either', 'have', 'a', 'genus', 'and', 'spinor', 'genus', 'which', 'coincide', 'or', 'the', 'the', 'genus', 'splits', 'into', 'multiple', 'spinor', 'genera', 'which', 'in', 'turn', 'split', 'into', 'multiple', 'equivalence', 'classes']] | [-0.20246259941874692, 0.163175272086683, -0.10420049488162383, 0.040424517749880366, -0.12242785610186939, -0.2553638299652495, -0.01669190421503467, 0.30275639648047775, -0.25247548723545593, -0.21014077703838643, -0.0019758568721441314, -0.25189598933017504, -0.15928545901372743, 0.2107308347655747, -0.05358810535369393, -0.022180010254930656, 0.05968278537516315, 0.13503881422086403, -0.13134499499275804, -0.4206004965578755, 0.43160734755488545, -0.18044024926777452, 0.22742616112093225, 0.007318470883780183, 0.12879908234119797, -0.04937014796245748, 0.10925090082515126, -0.03024688674843044, -0.04430676519451737, 0.11357176906835192, 0.3615100130629845, 0.0813883582655436, 0.17420366819864377, -0.36418791270504397, -0.2650086274967553, 0.23527907129998007, 0.14641896686636102, 0.021278555079614028, 0.009680372477771763, -0.1676834327682184, 0.06535287023050329, -0.1472251263136665, -0.1437330818376862, -0.10725074139638589, 0.02878650086812484, -0.09853000507857172, -0.15288691822654352, -0.03567430077311702, 0.12260729977144645, 0.13919177604839206, -0.03150245651023653, -0.18493215120039308, -0.0903908626582378, 0.0694022302199394, 0.010262632763419205, 0.09419520405264428, -0.04245890267432118, -0.16240034426431146, -0.12035203894648032, 0.32340263006969905, -0.07440508559393959, -0.27778228343679356, 0.15421121113766462, -0.09085223770055634, -0.2066202455510696, 0.15527122935805565, 0.1347943152575634, 0.19449204712724075, -0.07089957335772805, 0.1587124193581239, -0.13306989359448496, 0.14359458278452691, 0.19174465446326977, -0.08384536091500941, 0.259160500103369, 0.05415121579351716, 0.010014572056929748, 0.18479041121258305, -0.048043886151833415, -0.03559124196927326, -0.2931315397787003, -0.2986704793263179, -0.08742073117546403, 0.15370943826098646, -0.07151543799745223, -0.24667976557826385, 0.5207388563505493, -0.0008672937655296081, 0.13344736090407538, 0.1552149639987291, 0.2799135761287732, 0.0742015999634392, 0.1533126424675664, 0.0869983287068466, 0.1320260047721557, 0.17087246106268886, -0.10079588238388681, -0.10634852915954514, -0.037143152016095624, 0.22684929702574244] |
1,803.03029 | Digital Identity: The Effect of Trust and Reputation Information on User
Judgement in the Sharing Economy | The Sharing Economy (SE) is a growing ecosystem focusing on peer-to-peer
enterprise. In the SE the information available to assist individuals (users)
in making decisions focuses predominantly on community generated trust and
reputation information. However, how such information impacts user judgement is
still being understood. To explore such effects, we constructed an artificial
SE accommodation platform where we varied the elements related to hosts'
digital identity, measuring users' perceptions and decisions to interact.
Across three studies, we find that trust and reputation information increases
not only the users' perceived trustworthiness, credibility, and sociability of
hosts, but also the propensity to rent a private room in their home. This
effect is seen when providing users both with complete profiles and profiles
with partial user-selected information. Closer investigations reveal that three
elements relating to the host's digital identity are sufficient to produce such
positive perceptions and increased rental decisions, regardless of which three
elements are presented. Our findings have relevant implications for human
judgment and privacy in the SE, and question its current culture of ever
increasing information-sharing.
| cs.CY cs.SI | the sharing economy se is a growing ecosystem focusing on peertopeer enterprise in the se the information available to assist individuals users in making decisions focuses predominantly on community generated trust and reputation information however how such information impacts user judgement is still being understood to explore such effects we constructed an artificial se accommodation platform where we varied the elements related to hosts digital identity measuring users perceptions and decisions to interact across three studies we find that trust and reputation information increases not only the users perceived trustworthiness credibility and sociability of hosts but also the propensity to rent a private room in their home this effect is seen when providing users both with complete profiles and profiles with partial userselected information closer investigations reveal that three elements relating to the hosts digital identity are sufficient to produce such positive perceptions and increased rental decisions regardless of which three elements are presented our findings have relevant implications for human judgment and privacy in the se and question its current culture of ever increasing informationsharing | [['the', 'sharing', 'economy', 'se', 'is', 'a', 'growing', 'ecosystem', 'focusing', 'on', 'peertopeer', 'enterprise', 'in', 'the', 'se', 'the', 'information', 'available', 'to', 'assist', 'individuals', 'users', 'in', 'making', 'decisions', 'focuses', 'predominantly', 'on', 'community', 'generated', 'trust', 'and', 'reputation', 'information', 'however', 'how', 'such', 'information', 'impacts', 'user', 'judgement', 'is', 'still', 'being', 'understood', 'to', 'explore', 'such', 'effects', 'we', 'constructed', 'an', 'artificial', 'se', 'accommodation', 'platform', 'where', 'we', 'varied', 'the', 'elements', 'related', 'to', 'hosts', 'digital', 'identity', 'measuring', 'users', 'perceptions', 'and', 'decisions', 'to', 'interact', 'across', 'three', 'studies', 'we', 'find', 'that', 'trust', 'and', 'reputation', 'information', 'increases', 'not', 'only', 'the', 'users', 'perceived', 'trustworthiness', 'credibility', 'and', 'sociability', 'of', 'hosts', 'but', 'also', 'the', 'propensity', 'to', 'rent', 'a', 'private', 'room', 'in', 'their', 'home', 'this', 'effect', 'is', 'seen', 'when', 'providing', 'users', 'both', 'with', 'complete', 'profiles', 'and', 'profiles', 'with', 'partial', 'userselected', 'information', 'closer', 'investigations', 'reveal', 'that', 'three', 'elements', 'relating', 'to', 'the', 'hosts', 'digital', 'identity', 'are', 'sufficient', 'to', 'produce', 'such', 'positive', 'perceptions', 'and', 'increased', 'rental', 'decisions', 'regardless', 'of', 'which', 'three', 'elements', 'are', 'presented', 'our', 'findings', 'have', 'relevant', 'implications', 'for', 'human', 'judgment', 'and', 'privacy', 'in', 'the', 'se', 'and', 'question', 'its', 'current', 'culture', 'of', 'ever', 'increasing', 'informationsharing']] | [-0.12757330150634516, 0.04697953022307708, -0.02048150714571503, 0.0926833735459447, -0.17053738466082988, -0.1970598604397806, 0.1331105975494376, 0.40506403266292845, -0.24625988519983366, -0.3244930518558249, 0.10301401798311748, -0.3816898100988262, -0.15531756898367763, 0.12958940099203822, -0.10913244740169664, -0.032881962336680524, 0.014023045999982225, 0.07198375018312865, 0.014282234534303743, -0.32697883655596754, 0.314552673085762, 0.06836999088144777, 0.3620867708615895, 0.11269874969730154, 0.04774993699869479, -0.004030072636934082, -0.10342517031577617, 0.002544034010497853, -0.10158105346677489, 0.15737862919577725, 0.3587762431707233, 0.23602604727123186, 0.35900674694990314, -0.41834179392423143, -0.14951792361336463, 0.08141262782473033, 0.16921889727448367, 0.06741700344917428, -0.08053873006164478, -0.33194065282375296, 0.08033004422693259, -0.22282540451587093, -0.08736400703095239, -0.0361855377506634, -0.0048720341450958085, 0.01907436967568091, -0.2506789416524539, -0.00018836950651100116, -0.0015047627014362, 0.13817232025691986, -0.060771567913682455, -0.09481919270580295, -0.0801624482549166, 0.255492076891063, 0.07141186681970298, -0.05119589874811936, 0.21723270199303937, -0.14785351715743839, -0.11441509201540612, 0.3797839743545575, 0.03675818326221567, -0.18400306447239761, 0.19582589418595572, -0.11397847196415321, -0.11482681288329001, 0.05794808128848672, 0.2013080846571194, 0.013761512334564362, -0.17178083692893284, -0.04329082015002231, -0.0010119667038617824, 0.2106070336310288, 0.028550193160878156, 0.077785850933155, 0.2269765333939259, 0.16213292179533959, 0.05415439092559444, 0.021864760968707164, 0.022684249706799164, -0.114856242059349, -0.13724275125621882, -0.17202286174605516, -0.1382472174908881, 0.02250488773552206, -0.08776383058433236, -0.12196353131598285, 0.35651821458040184, 0.20262633024222768, 0.1419242282466836, 0.026977651981889558, 0.31120181948327547, 0.02520134792410483, 0.08388363447474231, 0.09098292879422264, 0.195207656892969, -0.009268410144035111, 0.17054432173344222, -0.1701565801079348, 0.19489737072250468, -0.052803859809170135] |
1,803.0303 | Sample Complexity of Total Variation Minimization | This work considers the use of Total variation (TV) minimization in the
recovery of a given gradient sparse vector from Gaussian linear measurements.
It has been shown in recent studies that there exist a sharp phase transition
behavior in TV minimization in asymptotic regimes. The phase transition curve
specifies the boundary of success and failure of TV minimization for large
number of measurements. It is a challenging task to obtain a theoretical bound
that reflects this curve. In this work, we present a novel upper-bound that
suitably approximates this curve and is asymptotically sharp. Numerical results
show that our bound is closer to the empirical TV phase transition curve than
the previously known bound obtained by Kabanava.
| cs.IT math.IT | this work considers the use of total variation tv minimization in the recovery of a given gradient sparse vector from gaussian linear measurements it has been shown in recent studies that there exist a sharp phase transition behavior in tv minimization in asymptotic regimes the phase transition curve specifies the boundary of success and failure of tv minimization for large number of measurements it is a challenging task to obtain a theoretical bound that reflects this curve in this work we present a novel upperbound that suitably approximates this curve and is asymptotically sharp numerical results show that our bound is closer to the empirical tv phase transition curve than the previously known bound obtained by kabanava | [['this', 'work', 'considers', 'the', 'use', 'of', 'total', 'variation', 'tv', 'minimization', 'in', 'the', 'recovery', 'of', 'a', 'given', 'gradient', 'sparse', 'vector', 'from', 'gaussian', 'linear', 'measurements', 'it', 'has', 'been', 'shown', 'in', 'recent', 'studies', 'that', 'there', 'exist', 'a', 'sharp', 'phase', 'transition', 'behavior', 'in', 'tv', 'minimization', 'in', 'asymptotic', 'regimes', 'the', 'phase', 'transition', 'curve', 'specifies', 'the', 'boundary', 'of', 'success', 'and', 'failure', 'of', 'tv', 'minimization', 'for', 'large', 'number', 'of', 'measurements', 'it', 'is', 'a', 'challenging', 'task', 'to', 'obtain', 'a', 'theoretical', 'bound', 'that', 'reflects', 'this', 'curve', 'in', 'this', 'work', 'we', 'present', 'a', 'novel', 'upperbound', 'that', 'suitably', 'approximates', 'this', 'curve', 'and', 'is', 'asymptotically', 'sharp', 'numerical', 'results', 'show', 'that', 'our', 'bound', 'is', 'closer', 'to', 'the', 'empirical', 'tv', 'phase', 'transition', 'curve', 'than', 'the', 'previously', 'known', 'bound', 'obtained', 'by', 'kabanava']] | [-0.14432536430379922, 0.06631331226451258, -0.1305397386213058, 0.04915111695701289, -0.06271673085826353, -0.13392931430054636, 0.09807412844785521, 0.37320608641663244, -0.2406966488503305, -0.29220905111588796, 0.1073176756627649, -0.28536292155883436, -0.23980227547119662, 0.1890216021124145, -0.12338432713797123, 0.08777214429373371, 0.06333773543833401, 0.06672495662471568, -0.12423938343799192, -0.24474643082719233, 0.2754194213334343, 0.0028829856631185473, 0.30453116229960114, 0.054652754755305316, 0.05865639573814155, 0.0029094657250519455, 0.025986482052068258, 0.002889967973119226, -0.17298185302808697, 0.11380929253786674, 0.2692660606498348, 0.14140197235472693, 0.2671933390585513, -0.3635556103244167, -0.27119055576823203, 0.14469136432885063, 0.11457832308550334, 0.079627897967745, -0.08629141263021477, -0.21485944485677214, 0.07727859622461657, -0.12881964776697086, -0.08535659880024092, -0.06501025598142939, 0.0155723395131143, -0.017439798201064997, -0.2884802286822252, 0.10797308486533062, 0.06910862560897808, 0.038192606567212475, -0.07396923533263455, -0.11110391387121817, 0.03172400083336658, 0.07505762173216148, 0.09177870895304106, 0.0943702735902003, 0.04917281793012958, -0.09769916056318144, -0.06593869550249956, 0.33171802645163806, -0.1201653650321783, -0.14031024396435582, 0.14050437540522423, -0.13519497858440696, -0.10863899092735915, 0.1619322781033557, 0.17178897773505766, 0.13686835088221164, -0.1416380387201006, 0.06788220688809063, -0.09748209536312437, 0.1675744196159187, 0.027407389784488697, 0.004124464314623639, 0.09073474784060542, 0.17905365174700474, 0.13610071651155836, 0.17545963490807354, -0.0877554538230219, -0.10833869899366179, -0.3013867341014075, -0.1237572827291121, -0.25628817356833866, 0.01225640670926278, -0.07743470896219087, -0.1561591893136963, 0.3713386692829302, 0.1192291516465424, 0.2581560325102302, 0.08151232597321786, 0.33061842420861, 0.15117579498549055, 0.026069155340243517, 0.09931342105796673, 0.2758857159602359, 0.11338952822201274, 0.07765001695249872, -0.20158389283912176, 0.10083847275256694, 0.0644227443503794] |
1,803.03031 | Redundancy in Distributed Proofs | Distributed proofs are mechanisms enabling the nodes of a network to
collectivity and efficiently check the correctness of Boolean predicates on the
structure of the network, or on data-structures distributed over the nodes
(e.g., spanning trees or routing tables). We consider mechanisms consisting of
two components: a \emph{prover} assigning a \emph{certificate} to each node,
and a distributed algorithm called \emph{verifier} that is in charge of
verifying the distributed proof formed by the collection of all certificates.
In this paper, we show that many network predicates have distributed proofs
offering a high level of redundancy, explicitly or implicitly. We use this
remarkable property of distributed proofs for establishing perfect tradeoffs
between the \emph{size of the certificate} stored at every node, and the
\emph{number of rounds} of the verification protocol. If we allow every node to
communicate to distance at most $t$, one might expect that the certificate
sizes can be reduced by a multiplicative factor of at least~$t$. In trees,
cycles and grids, we show that such tradeoffs can be established for \emph{all}
network predicates, i.e., it is always possible to linearly decrease the
certificate size. In arbitrary graphs, we show that any part of the
certificates common to all nodes can be evenly redistributed among these nodes,
achieving even a better tradeoff: this common part of the certificate can be
reduced by the size of a smallest ball of radius $t$ in the network.
In addition to these general results, we establish several upper and lower
bounds on the certificate sizes used for distributed proofs for spanning trees,
minimum-weight spanning trees, diameter, additive and multiplicative spanners,
and more, improving and generalizing previous results from the literature.
| cs.DC | distributed proofs are mechanisms enabling the nodes of a network to collectivity and efficiently check the correctness of boolean predicates on the structure of the network or on datastructures distributed over the nodes eg spanning trees or routing tables we consider mechanisms consisting of two components a emphprover assigning a emphcertificate to each node and a distributed algorithm called emphverifier that is in charge of verifying the distributed proof formed by the collection of all certificates in this paper we show that many network predicates have distributed proofs offering a high level of redundancy explicitly or implicitly we use this remarkable property of distributed proofs for establishing perfect tradeoffs between the emphsize of the certificate stored at every node and the emphnumber of rounds of the verification protocol if we allow every node to communicate to distance at most t one might expect that the certificate sizes can be reduced by a multiplicative factor of at leastt in trees cycles and grids we show that such tradeoffs can be established for emphall network predicates ie it is always possible to linearly decrease the certificate size in arbitrary graphs we show that any part of the certificates common to all nodes can be evenly redistributed among these nodes achieving even a better tradeoff this common part of the certificate can be reduced by the size of a smallest ball of radius t in the network in addition to these general results we establish several upper and lower bounds on the certificate sizes used for distributed proofs for spanning trees minimumweight spanning trees diameter additive and multiplicative spanners and more improving and generalizing previous results from the literature | [['distributed', 'proofs', 'are', 'mechanisms', 'enabling', 'the', 'nodes', 'of', 'a', 'network', 'to', 'collectivity', 'and', 'efficiently', 'check', 'the', 'correctness', 'of', 'boolean', 'predicates', 'on', 'the', 'structure', 'of', 'the', 'network', 'or', 'on', 'datastructures', 'distributed', 'over', 'the', 'nodes', 'eg', 'spanning', 'trees', 'or', 'routing', 'tables', 'we', 'consider', 'mechanisms', 'consisting', 'of', 'two', 'components', 'a', 'emphprover', 'assigning', 'a', 'emphcertificate', 'to', 'each', 'node', 'and', 'a', 'distributed', 'algorithm', 'called', 'emphverifier', 'that', 'is', 'in', 'charge', 'of', 'verifying', 'the', 'distributed', 'proof', 'formed', 'by', 'the', 'collection', 'of', 'all', 'certificates', 'in', 'this', 'paper', 'we', 'show', 'that', 'many', 'network', 'predicates', 'have', 'distributed', 'proofs', 'offering', 'a', 'high', 'level', 'of', 'redundancy', 'explicitly', 'or', 'implicitly', 'we', 'use', 'this', 'remarkable', 'property', 'of', 'distributed', 'proofs', 'for', 'establishing', 'perfect', 'tradeoffs', 'between', 'the', 'emphsize', 'of', 'the', 'certificate', 'stored', 'at', 'every', 'node', 'and', 'the', 'emphnumber', 'of', 'rounds', 'of', 'the', 'verification', 'protocol', 'if', 'we', 'allow', 'every', 'node', 'to', 'communicate', 'to', 'distance', 'at', 'most', 't', 'one', 'might', 'expect', 'that', 'the', 'certificate', 'sizes', 'can', 'be', 'reduced', 'by', 'a', 'multiplicative', 'factor', 'of', 'at', 'leastt', 'in', 'trees', 'cycles', 'and', 'grids', 'we', 'show', 'that', 'such', 'tradeoffs', 'can', 'be', 'established', 'for', 'emphall', 'network', 'predicates', 'ie', 'it', 'is', 'always', 'possible', 'to', 'linearly', 'decrease', 'the', 'certificate', 'size', 'in', 'arbitrary', 'graphs', 'we', 'show', 'that', 'any', 'part', 'of', 'the', 'certificates', 'common', 'to', 'all', 'nodes', 'can', 'be', 'evenly', 'redistributed', 'among', 'these', 'nodes', 'achieving', 'even', 'a', 'better', 'tradeoff', 'this', 'common', 'part', 'of', 'the', 'certificate', 'can', 'be', 'reduced', 'by', 'the', 'size', 'of', 'a', 'smallest', 'ball', 'of', 'radius', 't', 'in', 'the', 'network', 'in', 'addition', 'to', 'these', 'general', 'results', 'we', 'establish', 'several', 'upper', 'and', 'lower', 'bounds', 'on', 'the', 'certificate', 'sizes', 'used', 'for', 'distributed', 'proofs', 'for', 'spanning', 'trees', 'minimumweight', 'spanning', 'trees', 'diameter', 'additive', 'and', 'multiplicative', 'spanners', 'and', 'more', 'improving', 'and', 'generalizing', 'previous', 'results', 'from', 'the', 'literature']] | [-0.1820443555895027, 0.07202977009685985, -0.043096144128974306, 0.04441537433911649, -0.057220211555592385, -0.16024295716060272, 0.12457133988166735, 0.37863721426316155, -0.3164048781948034, -0.32291745681569034, 0.10357544308199602, -0.265558102476301, -0.1099866888817975, 0.1719575574311688, -0.08709500291554244, 0.04576844066211967, 0.06650881335029707, 0.04871766316885923, -0.011941291308176005, -0.3040769223135773, 0.304708463134268, 0.03570301758522606, 0.22307401764042237, 0.06663400268606733, 0.08793900768710848, 0.017255107689433155, -0.017558237547157605, 0.05089745239049936, -0.10210470931336685, 0.13373526551218032, 0.2988529215183328, 0.1951732050476815, 0.27311131085341056, -0.4283118699052412, -0.15017746305966284, 0.1630925552714924, 0.14798185945956527, 0.10918975859428481, 0.019312963586183767, -0.22197937087313382, 0.1666227773487609, -0.15980680976131492, -0.08019358135574936, -0.03811976225252318, 0.022713826881954446, 0.05582185243624468, -0.27700562203779766, -0.020445210044272244, 0.09114276808566715, 0.026410097013949245, 0.001470932934727684, -0.11880941079160788, -0.025396780517493264, 0.14232951448716716, -0.03794441042469664, -0.0016955256102365263, 0.1013863682954466, -0.07320825280861326, -0.16341470391724963, 0.3342686794485952, 0.008713121359024252, -0.1692804444944212, 0.16623676455449587, -0.06751155415515635, -0.16549932801931658, 0.09186571478494443, 0.18431156215271638, 0.11885686822701888, -0.12371249626727042, 0.05425773050998995, -0.08133667157338043, 0.20041138614503914, 0.12979192643679732, 0.0677743643635254, 0.1637558198246338, 0.14234850307505387, 0.1364189339934081, 0.14717316542587736, -0.0021865573413807023, -0.07421191248495769, -0.27313258453368155, -0.15457059812786825, -0.2023809420532095, -0.008574068518903325, -0.17732593685393702, -0.1676419493087451, 0.3908190576476045, 0.1482874595141552, 0.2007272698871983, 0.13878652407712413, 0.29666789145523903, 0.061816450641558995, 0.10563934109899599, 0.17903149105105137, 0.15944378443836124, 0.09031917114642805, 0.05694138728594065, -0.1273665110467632, 0.1380880965195555, 0.06328931764908381] |
1,803.03032 | CMOS compatible W/CoFeB/MgO spin Hall nano-oscillators with wide
frequency tunability | We demonstrate low-operational-current W/Co$_{20}$Fe$_{60}$B$_{20}$/MgO spin
Hall nano-oscillators (SHNOs) on highly resistive silicon (HiR-Si) substrates.
Thanks to a record high spin Hall angle of the $\beta$-phase W ($\theta_{SH}$ =
-0.53), a very low threshold current density of 3.3 $\times$ 10$^{7}$ A/cm$^2$
can be achieved. Together with their very wide frequency tunability (7-28 GHz),
promoted by a moderate perpendicular magnetic anisotropy, this makes
HiR-Si/W/CoFeB based SHNOs potential candidates for wide-band microwave signal
generation. Their CMOS compatibility offers a promising route towards the
integration of spintronic microwave devices with other on-chip semiconductor
microwave components.
| physics.app-ph | we demonstrate lowoperationalcurrent wco_20fe_60b_20mgo spin hall nanooscillators shnos on highly resistive silicon hirsi substrates thanks to a record high spin hall angle of the betaphase w theta_sh 053 a very low threshold current density of 33 times 107 acm2 can be achieved together with their very wide frequency tunability 728 ghz promoted by a moderate perpendicular magnetic anisotropy this makes hirsiwcofeb based shnos potential candidates for wideband microwave signal generation their cmos compatibility offers a promising route towards the integration of spintronic microwave devices with other onchip semiconductor microwave components | [['we', 'demonstrate', 'lowoperationalcurrent', 'wco_20fe_60b_20mgo', 'spin', 'hall', 'nanooscillators', 'shnos', 'on', 'highly', 'resistive', 'silicon', 'hirsi', 'substrates', 'thanks', 'to', 'a', 'record', 'high', 'spin', 'hall', 'angle', 'of', 'the', 'betaphase', 'w', 'theta_sh', '053', 'a', 'very', 'low', 'threshold', 'current', 'density', 'of', '33', 'times', '107', 'acm2', 'can', 'be', 'achieved', 'together', 'with', 'their', 'very', 'wide', 'frequency', 'tunability', '728', 'ghz', 'promoted', 'by', 'a', 'moderate', 'perpendicular', 'magnetic', 'anisotropy', 'this', 'makes', 'hirsiwcofeb', 'based', 'shnos', 'potential', 'candidates', 'for', 'wideband', 'microwave', 'signal', 'generation', 'their', 'cmos', 'compatibility', 'offers', 'a', 'promising', 'route', 'towards', 'the', 'integration', 'of', 'spintronic', 'microwave', 'devices', 'with', 'other', 'onchip', 'semiconductor', 'microwave', 'components']] | [-0.23039489297932664, 0.2078860688759664, 0.04535035338512687, -0.10468095317306972, -0.09222538551846303, -0.22114155867115357, 0.08866617934193549, 0.4497821322360704, -0.20327399468569216, -0.3576834575316414, 0.042302246083001885, -0.2408857564225273, -0.050741497259370466, 0.3186943603917783, 0.025702335887386695, 0.06200280740348146, -0.027188493897272056, -0.14077416328756615, -0.06049654945097647, -0.13647485334090456, 0.11793003908120268, 0.11059947538752715, 0.4214591517351394, 0.06098462993192465, 0.16115897412000355, -0.07155277929810244, 0.07333797950644133, -0.057666117357913146, -0.0821408703490052, 0.078414962475383, 0.30558861729277426, -0.10035770212646661, 0.20280994491944046, -0.434178841668506, -0.167495145727772, 0.003963424694226231, 0.08424066622514105, 0.12217440618591946, -0.11118762229899551, -0.28811445467304003, 0.12753802477003096, -0.21609633025269262, -0.11274189331151172, -0.0669977142432228, 0.011918484698981047, -0.014604644562919126, -0.23084373605372602, 0.07353139228761456, -0.016908425447899243, 0.04909520036389315, -0.032578919471551525, -0.1600226848711108, -0.04336511044828004, -0.03232172786171526, -0.07658445998094976, 0.1053876070898611, 0.23859877516393724, -0.13797840900275163, -0.17907810832243845, 0.31070957777393593, -0.08977603909916916, -0.07537724415035268, 0.18083880248826084, -0.1924163920501637, -0.04084570202766647, 0.1498095698405577, 0.12339441244338833, 0.05521387350745499, -0.14720664455874843, 0.05685914157609574, 0.11575754617508717, 0.2003534861006449, 0.08628314942782095, 0.16233529930197915, 0.35208506694843256, 0.2474777733847542, 0.07613306492220186, 0.12041671718213555, -0.18319175889726383, 0.08750516536840519, -0.14881061344829843, -0.14549576182481508, -0.20067074617132719, 0.18030706107167008, -0.14561409972673064, -0.13088592713655428, 0.3870491715429654, 0.19043084907042251, 0.15451310539271595, -0.013320957437742415, 0.31989551916025405, 0.09905691494553372, 0.11737446953288042, -0.015681895746871136, 0.28682376114045116, 0.25073380979741816, 0.20468360505629937, -0.20993873143438682, 0.04620075707735364, -0.12918019903076508] |
1,803.03033 | Subsonic structure and optically thick winds from Wolf--Rayet stars | Wolf-Rayet star's winds can be so dense and so optically thick that the
photosphere appears in the highly supersonic part of the outflow, veiling the
underlying subsonic part of the star, and leaving the initial acceleration of
the wind inaccessible to observations. We investigate the conditions and the
structure of the subsonic part of the outflow of Galactic WR stars, in
particular of the WNE subclass; our focus is on the conditions at the sonic
point. We compute 1D hydrodynamic stellar structure models for massive helium
stars adopting outer boundaries at the sonic point. We find that the outflows
of our models are accelerated to supersonic velocities by the radiative force
from opacity bumps either at temperatures of the order of 200kK by the Fe
opacity bump or of the order of 50kK by the HeII opacity bump. For a given
mass-loss rate, the conditions in the subsonic part of the outflow are
independent from the detailed physical conditions in the supersonic part. The
close proximity to the Eddington limit at the sonic point allows us to
construct a Sonic HR diagram, relating the sonic point temperature to the L/M
ratio and the stellar mass-loss rate, thereby constraining the sonic point
conditions, the subsonic structure, and the stellar wind mass-loss rates from
observations. The minimum mass-loss rate necessary to have the flow accelerated
to supersonic velocities by the Fe opacity bump is derived. A comparison of the
observed parameters of Galactic WNE stars to this minimum mass-loss rate
indicates that their winds are launched to supersonic velocities by the
radiation pressure arising from the Fe-bump. Conversely, models which do not
show transonic flows from the Fe opacity bump form inflated envelopes. We
derive an analytic criterion for the appearance of envelope inflation in the
subphotospheric layers.
| astro-ph.SR | wolfrayet stars winds can be so dense and so optically thick that the photosphere appears in the highly supersonic part of the outflow veiling the underlying subsonic part of the star and leaving the initial acceleration of the wind inaccessible to observations we investigate the conditions and the structure of the subsonic part of the outflow of galactic wr stars in particular of the wne subclass our focus is on the conditions at the sonic point we compute 1d hydrodynamic stellar structure models for massive helium stars adopting outer boundaries at the sonic point we find that the outflows of our models are accelerated to supersonic velocities by the radiative force from opacity bumps either at temperatures of the order of 200kk by the fe opacity bump or of the order of 50kk by the heii opacity bump for a given massloss rate the conditions in the subsonic part of the outflow are independent from the detailed physical conditions in the supersonic part the close proximity to the eddington limit at the sonic point allows us to construct a sonic hr diagram relating the sonic point temperature to the lm ratio and the stellar massloss rate thereby constraining the sonic point conditions the subsonic structure and the stellar wind massloss rates from observations the minimum massloss rate necessary to have the flow accelerated to supersonic velocities by the fe opacity bump is derived a comparison of the observed parameters of galactic wne stars to this minimum massloss rate indicates that their winds are launched to supersonic velocities by the radiation pressure arising from the febump conversely models which do not show transonic flows from the fe opacity bump form inflated envelopes we derive an analytic criterion for the appearance of envelope inflation in the subphotospheric layers | [['wolfrayet', 'stars', 'winds', 'can', 'be', 'so', 'dense', 'and', 'so', 'optically', 'thick', 'that', 'the', 'photosphere', 'appears', 'in', 'the', 'highly', 'supersonic', 'part', 'of', 'the', 'outflow', 'veiling', 'the', 'underlying', 'subsonic', 'part', 'of', 'the', 'star', 'and', 'leaving', 'the', 'initial', 'acceleration', 'of', 'the', 'wind', 'inaccessible', 'to', 'observations', 'we', 'investigate', 'the', 'conditions', 'and', 'the', 'structure', 'of', 'the', 'subsonic', 'part', 'of', 'the', 'outflow', 'of', 'galactic', 'wr', 'stars', 'in', 'particular', 'of', 'the', 'wne', 'subclass', 'our', 'focus', 'is', 'on', 'the', 'conditions', 'at', 'the', 'sonic', 'point', 'we', 'compute', '1d', 'hydrodynamic', 'stellar', 'structure', 'models', 'for', 'massive', 'helium', 'stars', 'adopting', 'outer', 'boundaries', 'at', 'the', 'sonic', 'point', 'we', 'find', 'that', 'the', 'outflows', 'of', 'our', 'models', 'are', 'accelerated', 'to', 'supersonic', 'velocities', 'by', 'the', 'radiative', 'force', 'from', 'opacity', 'bumps', 'either', 'at', 'temperatures', 'of', 'the', 'order', 'of', '200kk', 'by', 'the', 'fe', 'opacity', 'bump', 'or', 'of', 'the', 'order', 'of', '50kk', 'by', 'the', 'heii', 'opacity', 'bump', 'for', 'a', 'given', 'massloss', 'rate', 'the', 'conditions', 'in', 'the', 'subsonic', 'part', 'of', 'the', 'outflow', 'are', 'independent', 'from', 'the', 'detailed', 'physical', 'conditions', 'in', 'the', 'supersonic', 'part', 'the', 'close', 'proximity', 'to', 'the', 'eddington', 'limit', 'at', 'the', 'sonic', 'point', 'allows', 'us', 'to', 'construct', 'a', 'sonic', 'hr', 'diagram', 'relating', 'the', 'sonic', 'point', 'temperature', 'to', 'the', 'lm', 'ratio', 'and', 'the', 'stellar', 'massloss', 'rate', 'thereby', 'constraining', 'the', 'sonic', 'point', 'conditions', 'the', 'subsonic', 'structure', 'and', 'the', 'stellar', 'wind', 'massloss', 'rates', 'from', 'observations', 'the', 'minimum', 'massloss', 'rate', 'necessary', 'to', 'have', 'the', 'flow', 'accelerated', 'to', 'supersonic', 'velocities', 'by', 'the', 'fe', 'opacity', 'bump', 'is', 'derived', 'a', 'comparison', 'of', 'the', 'observed', 'parameters', 'of', 'galactic', 'wne', 'stars', 'to', 'this', 'minimum', 'massloss', 'rate', 'indicates', 'that', 'their', 'winds', 'are', 'launched', 'to', 'supersonic', 'velocities', 'by', 'the', 'radiation', 'pressure', 'arising', 'from', 'the', 'febump', 'conversely', 'models', 'which', 'do', 'not', 'show', 'transonic', 'flows', 'from', 'the', 'fe', 'opacity', 'bump', 'form', 'inflated', 'envelopes', 'we', 'derive', 'an', 'analytic', 'criterion', 'for', 'the', 'appearance', 'of', 'envelope', 'inflation', 'in', 'the', 'subphotospheric', 'layers']] | [-0.0869168768646418, 0.14622719296530953, -0.06181123214105743, 0.08069143023019269, -0.08514297465514074, -0.03317124137508686, 0.054602121060782466, 0.392372100717315, -0.23581286858840378, -0.26959699968594436, 0.07281045380577686, -0.23833103502514325, 0.01974243398695396, 0.1873467053503669, -0.028289515326441656, -0.002891277284091243, 0.0662357941072803, -0.05069196176434686, -0.05017693151216064, -0.20199529005535607, 0.383526682357841, 0.09449197136186724, 0.1697632706209178, 0.009611085821705976, 0.06150858729770117, -0.1951334146652037, -0.012237353005634029, -0.03766324660985543, -0.20308505344550176, 0.030381837570499438, 0.18514346555774067, 0.1030523466213168, 0.22314267727771775, -0.40424778030107733, -0.2582128519097378, 0.022170552847201302, 0.18226102160912885, 0.07665385904069513, -0.03992526785910778, -0.21829476529842007, 0.04255389183268599, -0.16862348292647533, -0.19190623199427342, 0.059629737264578035, 0.01295055704129345, 0.05605187496081401, -0.28258477081206973, 0.11510950031252451, 0.0665957209079625, 0.08024025899072022, -0.09083699866070066, -0.047850141502001384, -0.1377299623261921, 0.06997191356796988, 0.07958961104093686, 0.017388182387086514, 0.1810371486689425, -0.18243798387789964, 0.03215850348689247, 0.4281982176336412, -0.07840157798634455, -0.037903490419095895, 0.24175520983219478, -0.21363692496801526, -0.09067858137037771, 0.21733684188594132, 0.1712834460520958, 0.13542889492227075, -0.10675191161609747, -0.010093919846424737, -0.021369155351733695, 0.14204760833888525, 0.0869993860165846, -0.008374851567308345, 0.3162421770330277, 0.07099676243690678, 0.014771381286592715, 0.09918568061097324, -0.21615984193971158, -0.057416851042671316, -0.28947688989760834, -0.10646289771219315, -0.1140556145906798, 0.0708962510492984, -0.17763155258141272, -0.17117212062110368, 0.30596979724166995, 0.16293695032296213, 0.21916181856405575, -0.0022232439420615093, 0.31375728295988853, 0.14283490655749065, 0.04823544827677666, 0.2088522729273161, 0.33814579236667613, 0.19034378915793126, 0.136760985019852, -0.2762339901975308, 0.10385811596921304, 0.09407251856191268] |
1,803.03034 | Slant and semi-slant submanifolds in metallic Riemannian manifolds | The aim of our paper is to focus on some properties of slant and semi-slant submanifolds of metallic Riemannian manifolds. We give some characterizations for submanifolds to be slant or semi-slant submanifolds in metallic or Golden Riemannian manifolds and we obtain integrability conditions for the distributions involved in the semi-slant submanifolds of Riemannian manifolds endowed with metallic or Golden Riemannian structures. Examples of semi-slant submanifolds of the metallic and Golden Riemannian manifolds are given. | math.DG | the aim of our paper is to focus on some properties of slant and semislant submanifolds of metallic riemannian manifolds we give some characterizations for submanifolds to be slant or semislant submanifolds in metallic or golden riemannian manifolds and we obtain integrability conditions for the distributions involved in the semislant submanifolds of riemannian manifolds endowed with metallic or golden riemannian structures examples of semislant submanifolds of the metallic and golden riemannian manifolds are given | [['the', 'aim', 'of', 'our', 'paper', 'is', 'to', 'focus', 'on', 'some', 'properties', 'of', 'slant', 'and', 'semislant', 'submanifolds', 'of', 'metallic', 'riemannian', 'manifolds', 'we', 'give', 'some', 'characterizations', 'for', 'submanifolds', 'to', 'be', 'slant', 'or', 'semislant', 'submanifolds', 'in', 'metallic', 'or', 'golden', 'riemannian', 'manifolds', 'and', 'we', 'obtain', 'integrability', 'conditions', 'for', 'the', 'distributions', 'involved', 'in', 'the', 'semislant', 'submanifolds', 'of', 'riemannian', 'manifolds', 'endowed', 'with', 'metallic', 'or', 'golden', 'riemannian', 'structures', 'examples', 'of', 'semislant', 'submanifolds', 'of', 'the', 'metallic', 'and', 'golden', 'riemannian', 'manifolds', 'are', 'given']] | [-0.22891011869383826, 0.0697476781552305, -0.006373345575018509, 0.18775863965148912, -0.14919145569847142, -0.19970024437517733, -0.09232658117449515, 0.45094269101281426, -0.1917975657191631, -0.1839950357286914, 0.148400667686695, -0.3538915331198557, -0.2228456402317042, 0.17802295539012128, -0.24937999799117647, 0.0339842495320497, 0.1076720555413615, 0.03335695287741318, -0.21638767004667506, -0.2651460187862048, 0.5692274153131891, -0.018709756257767614, 0.1702018999368758, 0.12804294051602483, 0.09809638287343488, -0.07031521259026753, 0.08470955898834241, 0.018479402127480636, -0.2805288339008552, 0.1408716138779513, 0.2251312044210027, 0.017403758225358418, 0.10020223158613048, -0.41940209785526666, -0.1313901011190201, 0.17246728126475638, 0.10496646174657587, -0.09411072323249804, -0.005679813020145269, -0.3804306182129359, -0.027658659058648186, 0.01959191297961248, -0.1955286937363043, -0.15515051590832504, -0.055620426163423456, -0.010011318819345656, -0.1542698154729363, 0.017669053697908246, 0.17431009626582367, 0.14681102383277705, -0.11989435450350111, -0.16065068871437296, -0.045860455456391176, 0.071659142588819, 0.035168509637760755, -0.00932195588845659, 0.1254889153548189, 0.04461059350570714, -0.08657153894671717, 0.3723338141603194, -0.08499763957602349, -0.41040568300397007, 0.08744510876115512, -0.15086534648907143, -0.15834269028886952, 0.10938017135108444, 0.20606588885641178, 0.19832208239146182, -0.1481078193472648, 0.12072708117665497, 0.0001230464392417186, -0.08866185182390886, 0.11197421918119732, 0.03577113649933725, 0.10767966591929262, 0.16213943060437166, 0.17284946153066247, 0.13722190158787761, -0.04507327669086186, -0.05835967621690518, -0.32558591069804654, -0.3446113072537087, -0.10351010155234788, 0.26486792207720716, -0.13061575555636679, -0.2728278630387944, 0.3683749449414176, -0.10674090763692416, 0.19248918844135227, 0.15120204626205, 0.2217905331856093, -0.1375374439899256, -0.03103653314787693, 0.12820257190489084, 0.26264341481775677, 0.29665296640549155, 0.046090577150116094, 0.010879429755732417, -0.06585994809614243, 0.1142408090165338] |
1,803.03035 | Input-to-State Safety With Control Barrier Functions | This letter presents a new notion of input-to-state safe control barrier
functions (ISSf-CBFs), which ensure safety of nonlinear dynamical systems under
input disturbances. Similar to how safety conditions are specified in terms of
forward invariance of a set, input-to-state safety (ISSf) conditions are
specified in terms of forward invariance of a slightly larger set. In this
context, invariance of the larger set implies that the states stay either
inside or very close to the smaller safe set; and this closeness is bounded by
the magnitude of the disturbances. The main contribution of the letter is the
methodology used for obtaining a valid ISSf-CBF, given a control barrier
function (CBF). The associated universal control law will also be provided.
Towards the end, we will study unified quadratic programs (QPs) that combine
control Lyapunov functions (CLFs) and ISSf-CBFs in order to obtain a single
control law that ensures both safety and stability in systems with input
disturbances.
| math.OC | this letter presents a new notion of inputtostate safe control barrier functions issfcbfs which ensure safety of nonlinear dynamical systems under input disturbances similar to how safety conditions are specified in terms of forward invariance of a set inputtostate safety issf conditions are specified in terms of forward invariance of a slightly larger set in this context invariance of the larger set implies that the states stay either inside or very close to the smaller safe set and this closeness is bounded by the magnitude of the disturbances the main contribution of the letter is the methodology used for obtaining a valid issfcbf given a control barrier function cbf the associated universal control law will also be provided towards the end we will study unified quadratic programs qps that combine control lyapunov functions clfs and issfcbfs in order to obtain a single control law that ensures both safety and stability in systems with input disturbances | [['this', 'letter', 'presents', 'a', 'new', 'notion', 'of', 'inputtostate', 'safe', 'control', 'barrier', 'functions', 'issfcbfs', 'which', 'ensure', 'safety', 'of', 'nonlinear', 'dynamical', 'systems', 'under', 'input', 'disturbances', 'similar', 'to', 'how', 'safety', 'conditions', 'are', 'specified', 'in', 'terms', 'of', 'forward', 'invariance', 'of', 'a', 'set', 'inputtostate', 'safety', 'issf', 'conditions', 'are', 'specified', 'in', 'terms', 'of', 'forward', 'invariance', 'of', 'a', 'slightly', 'larger', 'set', 'in', 'this', 'context', 'invariance', 'of', 'the', 'larger', 'set', 'implies', 'that', 'the', 'states', 'stay', 'either', 'inside', 'or', 'very', 'close', 'to', 'the', 'smaller', 'safe', 'set', 'and', 'this', 'closeness', 'is', 'bounded', 'by', 'the', 'magnitude', 'of', 'the', 'disturbances', 'the', 'main', 'contribution', 'of', 'the', 'letter', 'is', 'the', 'methodology', 'used', 'for', 'obtaining', 'a', 'valid', 'issfcbf', 'given', 'a', 'control', 'barrier', 'function', 'cbf', 'the', 'associated', 'universal', 'control', 'law', 'will', 'also', 'be', 'provided', 'towards', 'the', 'end', 'we', 'will', 'study', 'unified', 'quadratic', 'programs', 'qps', 'that', 'combine', 'control', 'lyapunov', 'functions', 'clfs', 'and', 'issfcbfs', 'in', 'order', 'to', 'obtain', 'a', 'single', 'control', 'law', 'that', 'ensures', 'both', 'safety', 'and', 'stability', 'in', 'systems', 'with', 'input', 'disturbances']] | [-0.18347008457088745, 0.10416327858049619, -0.10077681271726951, 0.06715369895238454, -0.049149159014249516, -0.12989442188700195, 0.05304628843594784, 0.3006110910914446, -0.2824378714798705, -0.2875382098442826, 0.12329818034700829, -0.21265205079505808, -0.1188028736857967, 0.1948321092870748, -0.13951656813568852, 0.13794784663600454, 0.016475275109865163, 0.024078384317506692, -0.04442397789802941, -0.19688911193148478, 0.31425807343820406, 0.023186029284261167, 0.2677722874405414, 0.026792448456322553, 0.10098079801537097, 1.1414516178008757e-05, 0.022229901717142446, 0.05147900708145339, -0.10346476943763455, 0.12574763863008948, 0.24247208313011614, 0.1311230813643258, 0.3291224858686818, -0.404173183775703, -0.16813152312150983, 0.10322484443589162, 0.12077850209990222, 0.06919572655476115, -0.030934033909273382, -0.2750173614813799, 0.14092735564841669, -0.16898036064996727, -0.18506327038324488, -0.07508746924270925, -0.0023833236926676413, 0.036849394898653326, -0.30018893008635034, 0.020022079227362013, 0.08033893750823488, 0.05995392149289776, -0.09189294334684842, -0.029384383616209226, -0.031302594146262366, 0.12931430745888256, 0.01423451739001872, 0.03597753694875313, 0.1422571477749826, -0.1264675364877085, -0.09173224950944514, 0.3719223079234852, -0.028167389743765325, -0.23018946800316611, 0.1794693614172406, -0.13467368875679217, -0.12790867254922264, 0.12404932652440805, 0.20641478328922713, 0.10944550771981947, -0.20185068777094498, 0.06770159569944219, -0.011478163592983037, 0.17600215492328922, 0.06007424030011814, 0.07104168464368406, 0.16870290856068573, 0.1529592607939297, 0.16579232984038658, 0.1710228874236284, 0.015655062317244683, -0.11125291535618569, -0.3959513840657708, -0.09766695545649302, -0.09790915001404325, -0.003675999623067726, -0.0657060132389712, -0.16745714117821894, 0.3953451199049596, 0.1636677037275053, 0.16704558945677586, 0.13528586186753513, 0.28703998525528923, 0.18338274898154563, 0.06412365015191761, 0.06895696279886913, 0.25305142018049465, 0.09943507700901184, 0.09314010296963572, -0.21184021457616167, 0.12184947686220862, 0.05106650997827513] |
1,803.03036 | Efficient Bethe-Salpeter equations' treatment in dynamical mean-field
theory | We present here two alternative schemes designed to correct the
high-frequency truncation errors in the numerical treatment of the
Bethe-Salpeter equations. The schemes are applicable to all Bethe-Salpeter
calculations with a local two-particle irreducible local, which is relevant,
e.g., for the dynamical mean-field theory (DMFT) and its diagrammatic
extensions. In particular, within a purely diagrammatic framework, we could
extend existing algorithms for treating the static case in the particle-hole
sector to more general procedures applicable to all bosonic frequencies and all
channels. After illustrating the derivation and the theoretical interrelation
of the two proposed schemes, these have been applied to the Bethe-Salpeter
equations for the auxiliary Anderson impurity models of selected DMFT
calculations, where results can be compared against a numerically "exact"
solution. The successful performance of the proposed schemes suggests that
their implementation can significantly improve the accuracy of dynamical
mean-field theory (DMFT) calculations at the two-particle level, in particular
for more realistic multi-orbital calculations where the large number of degrees
of freedom substantially restricts the actual frequency range for numerical
calculations, as well as -on a broader perspective- of the diagrammatic
extensions of DMFT.
| cond-mat.str-el | we present here two alternative schemes designed to correct the highfrequency truncation errors in the numerical treatment of the bethesalpeter equations the schemes are applicable to all bethesalpeter calculations with a local twoparticle irreducible local which is relevant eg for the dynamical meanfield theory dmft and its diagrammatic extensions in particular within a purely diagrammatic framework we could extend existing algorithms for treating the static case in the particlehole sector to more general procedures applicable to all bosonic frequencies and all channels after illustrating the derivation and the theoretical interrelation of the two proposed schemes these have been applied to the bethesalpeter equations for the auxiliary anderson impurity models of selected dmft calculations where results can be compared against a numerically exact solution the successful performance of the proposed schemes suggests that their implementation can significantly improve the accuracy of dynamical meanfield theory dmft calculations at the twoparticle level in particular for more realistic multiorbital calculations where the large number of degrees of freedom substantially restricts the actual frequency range for numerical calculations as well as on a broader perspective of the diagrammatic extensions of dmft | [['we', 'present', 'here', 'two', 'alternative', 'schemes', 'designed', 'to', 'correct', 'the', 'highfrequency', 'truncation', 'errors', 'in', 'the', 'numerical', 'treatment', 'of', 'the', 'bethesalpeter', 'equations', 'the', 'schemes', 'are', 'applicable', 'to', 'all', 'bethesalpeter', 'calculations', 'with', 'a', 'local', 'twoparticle', 'irreducible', 'local', 'which', 'is', 'relevant', 'eg', 'for', 'the', 'dynamical', 'meanfield', 'theory', 'dmft', 'and', 'its', 'diagrammatic', 'extensions', 'in', 'particular', 'within', 'a', 'purely', 'diagrammatic', 'framework', 'we', 'could', 'extend', 'existing', 'algorithms', 'for', 'treating', 'the', 'static', 'case', 'in', 'the', 'particlehole', 'sector', 'to', 'more', 'general', 'procedures', 'applicable', 'to', 'all', 'bosonic', 'frequencies', 'and', 'all', 'channels', 'after', 'illustrating', 'the', 'derivation', 'and', 'the', 'theoretical', 'interrelation', 'of', 'the', 'two', 'proposed', 'schemes', 'these', 'have', 'been', 'applied', 'to', 'the', 'bethesalpeter', 'equations', 'for', 'the', 'auxiliary', 'anderson', 'impurity', 'models', 'of', 'selected', 'dmft', 'calculations', 'where', 'results', 'can', 'be', 'compared', 'against', 'a', 'numerically', 'exact', 'solution', 'the', 'successful', 'performance', 'of', 'the', 'proposed', 'schemes', 'suggests', 'that', 'their', 'implementation', 'can', 'significantly', 'improve', 'the', 'accuracy', 'of', 'dynamical', 'meanfield', 'theory', 'dmft', 'calculations', 'at', 'the', 'twoparticle', 'level', 'in', 'particular', 'for', 'more', 'realistic', 'multiorbital', 'calculations', 'where', 'the', 'large', 'number', 'of', 'degrees', 'of', 'freedom', 'substantially', 'restricts', 'the', 'actual', 'frequency', 'range', 'for', 'numerical', 'calculations', 'as', 'well', 'as', 'on', 'a', 'broader', 'perspective', 'of', 'the', 'diagrammatic', 'extensions', 'of', 'dmft']] | [-0.10403239501825463, 0.0754822270840817, -0.0974612087537084, 0.11369863140048779, -0.04962582373866431, -0.13697260745265272, 0.05709518087709883, 0.34503288992670594, -0.20430257275039632, -0.2524571740919704, 0.034285546875038056, -0.2616114422794111, -0.14650033394085063, 0.19450691698234207, 0.006501578035519048, 0.08163712556713, 0.042646630409909715, 0.01170677794844553, -0.15006644955600904, -0.2663977540658927, 0.28124774469097735, 0.04674309739963182, 0.25347138755899723, 0.07976271293216175, 0.03137729232705208, 0.07331214642142175, -0.004400248741931332, 0.04903459212973073, -0.10847309966821515, 0.08581851505904749, 0.30545165121483114, 0.050213943725021214, 0.2743380968984697, -0.46729324331321825, -0.25311390560255537, 0.0094841437073805, 0.17189322791576464, 0.21472611653015158, -0.021640978207948157, -0.3017658437639775, 0.08112257906305854, -0.23525057738566751, -0.1559612036442324, -0.15554519409754425, -0.04785136159594541, 0.004591017247988812, -0.2720240453121713, 0.09186298162325897, -0.005869991617635273, 0.03872105711707263, -0.07141770809821243, -0.16060626486464033, 0.0020225244156155055, 0.09030218815471056, 0.013185971411525882, -0.011306769509833576, 0.10665402997545498, -0.13568798428831963, -0.13893170516201925, 0.40656272465643545, -0.05213276952660332, -0.2246110537164514, 0.2135476208572346, -0.10307750128890558, -0.12758229347947303, 0.1234929685428318, 0.12846592545349111, 0.14056453820172776, -0.16856012378896898, 0.11591555770162383, -0.02284918329177765, 0.14164039068630024, -0.012751699626816297, 0.07556871044285525, 0.12711853518148244, 0.14006275244267477, 0.010917636126803075, 0.08202990161828316, -0.05032835561176261, -0.1955595679846542, -0.30789929927797405, -0.06828093629578248, -0.1435034329651214, -0.007607578677976484, -0.09942979827970429, -0.1547107291290529, 0.43780580569579397, 0.2263783973370058, 0.10164807908492343, 0.0658079422691146, 0.31574110894073404, 0.1599714570360819, 0.04902172873863169, 0.03990407739089982, 0.23176906548155052, 0.16925052046069816, 0.024291108590200224, -0.2701439256704743, 0.0013747329107655954, 0.09430142233688985] |
1,803.03037 | On the nonexistence of degenerate phase-shift multibreathers in a zigzag
Klein-Gordon model | In this work, we study the existence of low amplitude four-site phase-shift
multibreathers for small values of the coupling $\epsilon$ in Klein-Gordon (KG)
chains with interactions longer than the classical nearest-neighbour ones. In
the proper parameter regimes, the considered lattices bear connections to
models beyond one spatial dimension, namely the so-called zigzag lattice, as
well as the two-dimensional square lattice. We examine initially the
persistence conditions of the system, in order to seek for vortex-like
waveforms. Although this approach provides useful insights, due to the
degeneracy of these solutions, it does not allow us to determine if they
constitute true solutions of our system. In order to overcome this obstacle, we
follow a different route. In the case of the zigzag configuration, by means of
a Lyapunov-Schmidt decomposition, we are able to establish that the bifurcation
equation for our model can be considered, in the small energy and small
coupling regime, as a perturbation of a corresponding non-local discrete
nonlinear Schr\"odinger (NL-dNLS) equation. There, nonexistence results of
degenerate phase-shift discrete solitons can be demonstrated by exploiting the
expansion of a suitable density current of the NL-dNLS, obtained in recent
literature. Finally, briefly considering a one-dimensional model bearing
similarities to the square lattice, we conclude that the above strategy is not
efficient for the proof of the existence or nonexistence of vortices due to the
higher degeneracy of this configuration.
| nlin.PS | in this work we study the existence of low amplitude foursite phaseshift multibreathers for small values of the coupling epsilon in kleingordon kg chains with interactions longer than the classical nearestneighbour ones in the proper parameter regimes the considered lattices bear connections to models beyond one spatial dimension namely the socalled zigzag lattice as well as the twodimensional square lattice we examine initially the persistence conditions of the system in order to seek for vortexlike waveforms although this approach provides useful insights due to the degeneracy of these solutions it does not allow us to determine if they constitute true solutions of our system in order to overcome this obstacle we follow a different route in the case of the zigzag configuration by means of a lyapunovschmidt decomposition we are able to establish that the bifurcation equation for our model can be considered in the small energy and small coupling regime as a perturbation of a corresponding nonlocal discrete nonlinear schrodinger nldnls equation there nonexistence results of degenerate phaseshift discrete solitons can be demonstrated by exploiting the expansion of a suitable density current of the nldnls obtained in recent literature finally briefly considering a onedimensional model bearing similarities to the square lattice we conclude that the above strategy is not efficient for the proof of the existence or nonexistence of vortices due to the higher degeneracy of this configuration | [['in', 'this', 'work', 'we', 'study', 'the', 'existence', 'of', 'low', 'amplitude', 'foursite', 'phaseshift', 'multibreathers', 'for', 'small', 'values', 'of', 'the', 'coupling', 'epsilon', 'in', 'kleingordon', 'kg', 'chains', 'with', 'interactions', 'longer', 'than', 'the', 'classical', 'nearestneighbour', 'ones', 'in', 'the', 'proper', 'parameter', 'regimes', 'the', 'considered', 'lattices', 'bear', 'connections', 'to', 'models', 'beyond', 'one', 'spatial', 'dimension', 'namely', 'the', 'socalled', 'zigzag', 'lattice', 'as', 'well', 'as', 'the', 'twodimensional', 'square', 'lattice', 'we', 'examine', 'initially', 'the', 'persistence', 'conditions', 'of', 'the', 'system', 'in', 'order', 'to', 'seek', 'for', 'vortexlike', 'waveforms', 'although', 'this', 'approach', 'provides', 'useful', 'insights', 'due', 'to', 'the', 'degeneracy', 'of', 'these', 'solutions', 'it', 'does', 'not', 'allow', 'us', 'to', 'determine', 'if', 'they', 'constitute', 'true', 'solutions', 'of', 'our', 'system', 'in', 'order', 'to', 'overcome', 'this', 'obstacle', 'we', 'follow', 'a', 'different', 'route', 'in', 'the', 'case', 'of', 'the', 'zigzag', 'configuration', 'by', 'means', 'of', 'a', 'lyapunovschmidt', 'decomposition', 'we', 'are', 'able', 'to', 'establish', 'that', 'the', 'bifurcation', 'equation', 'for', 'our', 'model', 'can', 'be', 'considered', 'in', 'the', 'small', 'energy', 'and', 'small', 'coupling', 'regime', 'as', 'a', 'perturbation', 'of', 'a', 'corresponding', 'nonlocal', 'discrete', 'nonlinear', 'schrodinger', 'nldnls', 'equation', 'there', 'nonexistence', 'results', 'of', 'degenerate', 'phaseshift', 'discrete', 'solitons', 'can', 'be', 'demonstrated', 'by', 'exploiting', 'the', 'expansion', 'of', 'a', 'suitable', 'density', 'current', 'of', 'the', 'nldnls', 'obtained', 'in', 'recent', 'literature', 'finally', 'briefly', 'considering', 'a', 'onedimensional', 'model', 'bearing', 'similarities', 'to', 'the', 'square', 'lattice', 'we', 'conclude', 'that', 'the', 'above', 'strategy', 'is', 'not', 'efficient', 'for', 'the', 'proof', 'of', 'the', 'existence', 'or', 'nonexistence', 'of', 'vortices', 'due', 'to', 'the', 'higher', 'degeneracy', 'of', 'this', 'configuration']] | [-0.16532556325700318, 0.11223967294444613, -0.0695712671029004, 0.07637574580869338, -0.06522319549725428, -0.13504207094860496, 0.04103115638143625, 0.34269454075835876, -0.270786436485939, -0.2612315500893585, 0.11336828449726646, -0.24623714052222767, -0.15250137424617513, 0.1693389554023907, -0.007130755399792796, 0.04198251831088069, 0.05194489074007317, 0.024679582952706364, -0.06450954779094323, -0.22962802517846317, 0.3201315703551543, 0.02458859748301396, 0.2546356455935781, 0.04745944391005639, 0.0661175244217041, -0.0011598315461239233, 0.033865663821969004, 0.025069348466898508, -0.18149733562505801, 0.1045899353234204, 0.2168972228572732, 0.02554022051837082, 0.24673267376367083, -0.4316305792172509, -0.22109122195235958, 0.1212339882455799, 0.16221294761019953, 0.1787697064150781, -0.018237840831443863, -0.28128224939809465, 0.08440437721137761, -0.15514255581743655, -0.2024081435856114, -0.0957899052559476, -0.003742842770915987, 0.0535835902799446, -0.255524613164234, 0.10401656890251071, 0.09674440933794547, 0.006673365548285882, -0.08560327636560072, -0.08969703294123453, -0.01918054044365653, 0.09866711197447622, 0.04851774873785338, 0.0014221354229744967, 0.03327226170465875, -0.11916948443520732, -0.1085922329990185, 0.38993340400909177, -0.07806994789337691, -0.2281812015204949, 0.19107288977496392, -0.14435579852992875, -0.10156405508663867, 0.11690593912524667, 0.13904100648919326, 0.09822782996779365, -0.1106756296427305, 0.07927721688236183, -0.03605385839381144, 0.16388603290509626, 0.07207388845467243, 0.040688029670931956, 0.1898946629033018, 0.15806818823227536, 0.10578215275460337, 0.1465926750256405, -0.057524568398200006, -0.13498199018875406, -0.2999082442418167, -0.1182439746601827, -0.1787050836329812, 0.06107333983976234, -0.08122182001265141, -0.17597806203181113, 0.38800048500726136, 0.1711412232298925, 0.19445531847394412, 0.01566896634791785, 0.23571688965135273, 0.13914293356779306, 0.05784720609719467, 0.027225032909814317, 0.2679042737143287, 0.14462458369186731, 0.08767371694557369, -0.21992179882068533, -0.001430529332309469, 0.08210093785735824] |
1,803.03038 | Signature of Lepton flavor universality violation in $B_s \to
D_s\tau\nu$ semileptonic decays | Deviation from the standard model prediction is observed in many semileptonic
$B$ decays mediated via $b \to c$ charged current interactions. In particular,
current experimental measurements of the ratio of branching ratio $R_D$ and
$R_{D^{\ast}}$ in $B \rightarrow D^{(*)}l \nu$ decays disagree with standard
model expectations at the level of about $4.1\sigma$. Moreover, recent
measurement of the ratio of branching ratio $R_{J/\Psi}$ by LHCb, where
$R_{J/\Psi} = \mathcal B(B_c \to J/\Psi\,\tau\nu)/\mathcal B(B_c \to
J/\Psi\,\mu\nu)$, is more than $2\sigma$ away from the standard model
prediction. In this context, we consider an effective Lagrangian in the
presence of vector and scalar new physics couplings to study the implications
of $R_D$ and $R_{D^{\ast}}$ anomalies in $B_s \to D_s\,\tau\nu$ decays. We give
prediction of several observables such as branching ratio, ratio of branching
ratio, forward backward asymmetry parameter, $\tau$ polarization fraction, and
the convexity parameter for the $B_s \to D_s\,\tau\nu$ decays within the
standard model and within various new physics scenarios.
| hep-ph | deviation from the standard model prediction is observed in many semileptonic b decays mediated via b to c charged current interactions in particular current experimental measurements of the ratio of branching ratio r_d and r_dast in b rightarrow dl nu decays disagree with standard model expectations at the level of about 41sigma moreover recent measurement of the ratio of branching ratio r_jpsi by lhcb where r_jpsi mathcal bb_c to jpsitaunumathcal bb_c to jpsimunu is more than 2sigma away from the standard model prediction in this context we consider an effective lagrangian in the presence of vector and scalar new physics couplings to study the implications of r_d and r_dast anomalies in b_s to d_staunu decays we give prediction of several observables such as branching ratio ratio of branching ratio forward backward asymmetry parameter tau polarization fraction and the convexity parameter for the b_s to d_staunu decays within the standard model and within various new physics scenarios | [['deviation', 'from', 'the', 'standard', 'model', 'prediction', 'is', 'observed', 'in', 'many', 'semileptonic', 'b', 'decays', 'mediated', 'via', 'b', 'to', 'c', 'charged', 'current', 'interactions', 'in', 'particular', 'current', 'experimental', 'measurements', 'of', 'the', 'ratio', 'of', 'branching', 'ratio', 'r_d', 'and', 'r_dast', 'in', 'b', 'rightarrow', 'dl', 'nu', 'decays', 'disagree', 'with', 'standard', 'model', 'expectations', 'at', 'the', 'level', 'of', 'about', '41sigma', 'moreover', 'recent', 'measurement', 'of', 'the', 'ratio', 'of', 'branching', 'ratio', 'r_jpsi', 'by', 'lhcb', 'where', 'r_jpsi', 'mathcal', 'bb_c', 'to', 'jpsitaunumathcal', 'bb_c', 'to', 'jpsimunu', 'is', 'more', 'than', '2sigma', 'away', 'from', 'the', 'standard', 'model', 'prediction', 'in', 'this', 'context', 'we', 'consider', 'an', 'effective', 'lagrangian', 'in', 'the', 'presence', 'of', 'vector', 'and', 'scalar', 'new', 'physics', 'couplings', 'to', 'study', 'the', 'implications', 'of', 'r_d', 'and', 'r_dast', 'anomalies', 'in', 'b_s', 'to', 'd_staunu', 'decays', 'we', 'give', 'prediction', 'of', 'several', 'observables', 'such', 'as', 'branching', 'ratio', 'ratio', 'of', 'branching', 'ratio', 'forward', 'backward', 'asymmetry', 'parameter', 'tau', 'polarization', 'fraction', 'and', 'the', 'convexity', 'parameter', 'for', 'the', 'b_s', 'to', 'd_staunu', 'decays', 'within', 'the', 'standard', 'model', 'and', 'within', 'various', 'new', 'physics', 'scenarios']] | [-0.07899485558415395, 0.19715771206900076, 0.01791708759533082, 0.07236400416111696, -0.0287442413269003, -0.16497903094492167, 0.09538462831896093, 0.24679682945440473, -0.2534806381843641, -0.2715416985079891, -0.006405768188415095, -0.3354167641679707, -0.02041629817655408, 0.12905603749554997, 0.036309383282633986, 0.09642616361011996, 0.04045944811782407, 0.014922768010843643, -0.05840977493024088, -0.14884418678794695, 0.19834132044036923, 0.052280026820402496, 0.23508446218176304, 0.0971744941902886, -0.03976484430390165, -0.017792864768508526, -0.03541230734768569, 0.009451664060562555, -0.1841890428438905, 0.04112391257781143, 0.16342190110529037, 0.15910396439492042, 0.11714906849604297, -0.33709785590364943, -0.08473835075672373, 0.20921971732260367, 0.1620386948052328, 0.030119333796105104, -0.000739089515551122, -0.3393113890324098, 0.10659792383452632, -0.1613596086512859, -0.03616571342450028, -0.04005068186425457, 0.08605349422003583, -0.09492307173633507, -0.3817746759266715, 0.1503784221673222, -0.0532854847168844, 0.04458017728144401, 0.005853829501000674, -0.24230519489930502, 0.014931595246276916, 0.012937186426777197, 0.17020845853977862, 0.08862413609600289, 0.18926903610975532, -0.16727321576955115, -0.17548481976279473, 0.3910302858689408, -0.16809598808561677, -0.21975039860760598, 0.16676659773924926, -0.23660150715333753, -0.1748448516131918, 0.10354680204794645, 0.2441017180512733, 0.058820500571623836, -0.14830406144947597, 0.1470101739836728, -0.026345714145463717, 0.12802980596040325, 0.015661821008267764, 0.049988667805385044, 0.20243696309626102, 0.1970053569989671, -0.016749113081651126, 0.042660069863287436, -0.10098900021004834, -0.10574330394401361, -0.37915394469899566, -0.13543194664127536, -0.024203169261454605, 0.08787864759582781, -0.0960014876996674, -0.07166208332622964, 0.3427228389099534, 0.1468412644156304, 0.3369217811238119, 0.07982512660581913, 0.3035430364604843, 0.10185733865900577, 0.03711495765731486, 0.006374356857697039, 0.34134138106846396, 0.1962903949913054, 0.10333605597062208, -0.24197015192322924, 0.08631845792268378, 0.024701644372391075] |
1,803.03039 | Design of a nickel-base superalloy using a neural network | A new computational tool has been developed to model, discover, and optimize
new alloys that simultaneously satisfy up to eleven physical criteria. An
artificial neural network is trained from pre-existing materials data that
enables the prediction of individual material properties both as a function of
composition and heat treatment routine, which allows it to optimize the
material properties to search for the material with properties most likely to
exceed a target criteria. We design a new polycrystalline nickel-base
superalloy with the optimal combination of cost, density, gamma' phase content
and solvus, phase stability, fatigue life, yield stress, ultimate tensile
strength, stress rupture, oxidation resistance, and tensile elongation.
Experimental data demonstrates that the proposed alloy fulfills the
computational predictions, possessing multiple physical properties,
particularly oxidation resistance and yield stress, that exceed existing
commercially available alloys.
| cond-mat.mtrl-sci cs.LG physics.comp-ph | a new computational tool has been developed to model discover and optimize new alloys that simultaneously satisfy up to eleven physical criteria an artificial neural network is trained from preexisting materials data that enables the prediction of individual material properties both as a function of composition and heat treatment routine which allows it to optimize the material properties to search for the material with properties most likely to exceed a target criteria we design a new polycrystalline nickelbase superalloy with the optimal combination of cost density gamma phase content and solvus phase stability fatigue life yield stress ultimate tensile strength stress rupture oxidation resistance and tensile elongation experimental data demonstrates that the proposed alloy fulfills the computational predictions possessing multiple physical properties particularly oxidation resistance and yield stress that exceed existing commercially available alloys | [['a', 'new', 'computational', 'tool', 'has', 'been', 'developed', 'to', 'model', 'discover', 'and', 'optimize', 'new', 'alloys', 'that', 'simultaneously', 'satisfy', 'up', 'to', 'eleven', 'physical', 'criteria', 'an', 'artificial', 'neural', 'network', 'is', 'trained', 'from', 'preexisting', 'materials', 'data', 'that', 'enables', 'the', 'prediction', 'of', 'individual', 'material', 'properties', 'both', 'as', 'a', 'function', 'of', 'composition', 'and', 'heat', 'treatment', 'routine', 'which', 'allows', 'it', 'to', 'optimize', 'the', 'material', 'properties', 'to', 'search', 'for', 'the', 'material', 'with', 'properties', 'most', 'likely', 'to', 'exceed', 'a', 'target', 'criteria', 'we', 'design', 'a', 'new', 'polycrystalline', 'nickelbase', 'superalloy', 'with', 'the', 'optimal', 'combination', 'of', 'cost', 'density', 'gamma', 'phase', 'content', 'and', 'solvus', 'phase', 'stability', 'fatigue', 'life', 'yield', 'stress', 'ultimate', 'tensile', 'strength', 'stress', 'rupture', 'oxidation', 'resistance', 'and', 'tensile', 'elongation', 'experimental', 'data', 'demonstrates', 'that', 'the', 'proposed', 'alloy', 'fulfills', 'the', 'computational', 'predictions', 'possessing', 'multiple', 'physical', 'properties', 'particularly', 'oxidation', 'resistance', 'and', 'yield', 'stress', 'that', 'exceed', 'existing', 'commercially', 'available', 'alloys']] | [-0.05496705576989282, 0.09380230667252056, -0.09385103350540244, -0.027091780196896342, -0.11703032875587617, -0.17131449399109847, 0.08435771988242641, 0.4231237033312034, -0.2737965868983796, -0.3463814681381884, 0.054629044468983784, -0.26271982878217687, -0.15791094764941058, 0.2151296104836677, -0.031203896031343846, 0.11254993645925972, 0.05904130266517177, -0.02924198229426056, -0.0750338647088309, -0.23964664320412435, 0.21628643779514736, 0.10470426687270515, 0.3877801971047893, 0.04767710005136249, 0.06176133665669346, -0.04307551853904935, 0.07384765766652063, 0.016202140856828345, -0.16272428747431963, 0.08890436902026036, 0.2627375559545213, 0.08782523824777314, 0.23322384367842242, -0.45174520343710156, -0.25512709776009607, 0.059806739484289086, 0.039990860961825775, 0.06533367699788992, -0.054260523569651116, -0.19644700323364564, 0.08150519738218893, -0.1430787217551212, -0.11172948993700452, -0.12668464703422347, -0.008091305760680734, 0.013553808844574777, -0.2860210945906776, 0.054929589127939674, 0.01048406790171687, 0.07096652230650495, -0.15292118752201936, -0.15925352886333166, -0.09409442100029691, 0.11934806083686146, 0.06293047681412331, 0.016926322874606103, 0.24508094654551574, -0.1315457021950611, -0.07821074525888701, 0.37642818563302655, 0.0011633029417660004, -0.13374951584054565, 0.21207264878373958, -0.07212523953583007, -0.11389774018093328, 0.1927001494074002, 0.1912343046781992, 0.05073979319094267, -0.22051121460105805, -0.024611217301090324, 0.0684132456343579, 0.19350240595246615, 0.02725721169368161, 0.035504995456623625, 0.18430735857166433, 0.24855361940493262, -0.0021355788510544855, 0.1611725116180102, -0.10225941760367468, -0.0009637051997216124, -0.23882038807680242, -0.20656481839513363, -0.17640124602222296, 0.05314860575223215, -0.12118279122293636, -0.19169932980741605, 0.3523201155126151, 0.1851626999345363, 0.12091143035042778, 0.04277928533204096, 0.24891894223532618, 0.027802646519875338, 0.12444120150227302, 0.030804501034151343, 0.271149516749875, 0.1418177263055844, 0.12196118979805842, -0.2276575098696508, 0.18996816148099147, -0.0028391226205302586] |
1,803.0304 | Carleman estimates and boundedness of associated multiplier operators | Let $P(D)$ be the Laplacian $\Delta,$ or the wave operator $\square$. The
following type of Carleman estimate is known to be true on a certain range of
$p,q$: \[ \|e^{v\cdot x}u\|_{L^q(\mathbb{R}^d)} \le C\|e^{v\cdot
x}P(D)u\|_{L^p(\mathbb{R}^d)} \] with $C$ independent of $v\in \mathbb{R}^d$.
The estimates are consequences of the uniform Sobolev type estimates for second
order differential operators due to Kenig-Ruiz-Sogge \cite{KRS} and
Jeong-Kwon-Lee \cite{JKL}. The range of $p,q$ for which the uniform Sobolev
type estimates hold was completely characterized for the second order
differential operators with nondegenerate principal part. But the optimal range
of $p,q$ for which the Carleman estimate holds has not been clarified before.
When $P(D)=\Delta$, $\square$, or the heat operator, we obtain a complete
characterization of the admissible $p,q$ for the aforementioned type of
Carleman estimate. For this purpose we investigate $L^p$-$L^q$ boundedness of
related multiplier operators. As applications, we also obtain some unique
continuation results.
| math.AP math.CA | let pd be the laplacian delta or the wave operator square the following type of carleman estimate is known to be true on a certain range of pq evcdot xu_lqmathbbrd le cevcdot xpdu_lpmathbbrd with c independent of vin mathbbrd the estimates are consequences of the uniform sobolev type estimates for second order differential operators due to kenigruizsogge citekrs and jeongkwonlee citejkl the range of pq for which the uniform sobolev type estimates hold was completely characterized for the second order differential operators with nondegenerate principal part but the optimal range of pq for which the carleman estimate holds has not been clarified before when pddelta square or the heat operator we obtain a complete characterization of the admissible pq for the aforementioned type of carleman estimate for this purpose we investigate lplq boundedness of related multiplier operators as applications we also obtain some unique continuation results | [['let', 'pd', 'be', 'the', 'laplacian', 'delta', 'or', 'the', 'wave', 'operator', 'square', 'the', 'following', 'type', 'of', 'carleman', 'estimate', 'is', 'known', 'to', 'be', 'true', 'on', 'a', 'certain', 'range', 'of', 'pq', 'evcdot', 'xu_lqmathbbrd', 'le', 'cevcdot', 'xpdu_lpmathbbrd', 'with', 'c', 'independent', 'of', 'vin', 'mathbbrd', 'the', 'estimates', 'are', 'consequences', 'of', 'the', 'uniform', 'sobolev', 'type', 'estimates', 'for', 'second', 'order', 'differential', 'operators', 'due', 'to', 'kenigruizsogge', 'citekrs', 'and', 'jeongkwonlee', 'citejkl', 'the', 'range', 'of', 'pq', 'for', 'which', 'the', 'uniform', 'sobolev', 'type', 'estimates', 'hold', 'was', 'completely', 'characterized', 'for', 'the', 'second', 'order', 'differential', 'operators', 'with', 'nondegenerate', 'principal', 'part', 'but', 'the', 'optimal', 'range', 'of', 'pq', 'for', 'which', 'the', 'carleman', 'estimate', 'holds', 'has', 'not', 'been', 'clarified', 'before', 'when', 'pddelta', 'square', 'or', 'the', 'heat', 'operator', 'we', 'obtain', 'a', 'complete', 'characterization', 'of', 'the', 'admissible', 'pq', 'for', 'the', 'aforementioned', 'type', 'of', 'carleman', 'estimate', 'for', 'this', 'purpose', 'we', 'investigate', 'lplq', 'boundedness', 'of', 'related', 'multiplier', 'operators', 'as', 'applications', 'we', 'also', 'obtain', 'some', 'unique', 'continuation', 'results']] | [-0.10588013916611404, 0.05223545801604716, -0.013431192122788416, 0.09934658971246627, -0.11708901452550517, -0.14141480969734116, -0.0019232955771304077, 0.30528413336858046, -0.28693923920982606, -0.21793663754670634, 0.19885253214416354, -0.2754155610078316, -0.08122165119166573, 0.21585207405037804, -0.06489982681094314, 0.06576344504593971, 0.014496893059167501, 0.08263594841772168, -0.11349244846580483, -0.2249768934708437, 0.39407372370147875, -0.04686626860965713, 0.18045753275091164, 0.07005497822270011, 0.07523990792922489, 0.020725848099632228, -0.02227004897854418, -0.04647424897654719, -0.2215257620827543, 0.1366849332338487, 0.2212490233133728, 0.05220348792348062, 0.2906306055273941, -0.3586659499933179, -0.20179601707462247, 0.22693792573869792, 0.14137342140386752, 0.0050708664658231485, -0.028259262855486314, -0.28340854913853913, 0.1434116340443331, -0.10305480845942558, -0.20979837828697703, -0.08030340547854309, 0.030065368683405702, 0.09710752708743588, -0.38928844575039884, 0.10551017963494135, 0.13180798412762956, 0.03403934841412756, -0.1334100674767476, -0.1334878021395571, -0.01210937730083577, 0.10959142606254003, 0.015702010291501235, 0.03945071090401398, 0.0332786103496127, -0.07352290077892085, -0.072473906764506, 0.3242616763861059, -0.06205067977731337, -0.2124699309950681, 0.08619765557973519, -0.18334816386688688, -0.10751538784259917, 0.07260210919294426, 0.1341406386395876, 0.15723258612020838, -0.14190406182652301, 0.14450504841817302, -0.04135995010479786, 0.12495544418799791, 0.0843852786389146, 0.06184365375222062, 0.06087590303446213, 0.07166064636976116, 0.18193878125853288, 0.10444317914867143, -0.052291433120870014, -0.02307512417683552, -0.3854901762210208, -0.1683692153586785, -0.1949774013068393, 0.1105903818162339, -0.12661216309176432, -0.18746460554786296, 0.38973041714953005, 0.09863260658390874, 0.1664292395295803, 0.07875822265565449, 0.1598623047160695, 0.19854951716152106, 0.05736156964838746, 0.05067082120963245, 0.21354016564931325, 0.1824073064167776, 0.12132630095542442, -0.1533257713589127, 0.04187681644873546, 0.2186429803025165] |
1,803.03041 | Hydrodynamics of Binary Fluid Mixtures - An Augmented Multiparticle
Collison Dynamics Approach | The Multiparticle Collision Dynamics technique (MPC) for hydrodynamics
simulations is generalized to binary fluid mixtures and multiphase flows, by
coupling the particle-based fluid dynamics to a Ginzburg-Landau free-energy
functional for phase-separating binary fluids. To describe fluids with a
non-ideal equation of state, an additional density-dependent term is
introduced. The new approach is verified by applying it to thermodynamics near
the critical demixing point, and interface fluctuations of droplets. The
interfacial tension obtained from the analysis of the capillary wave spectrum
agrees well with the results based on the Laplace-Young equation.
Phase-separation dynamics follows the Lifshitz-Slyozov law.
| cond-mat.soft | the multiparticle collision dynamics technique mpc for hydrodynamics simulations is generalized to binary fluid mixtures and multiphase flows by coupling the particlebased fluid dynamics to a ginzburglandau freeenergy functional for phaseseparating binary fluids to describe fluids with a nonideal equation of state an additional densitydependent term is introduced the new approach is verified by applying it to thermodynamics near the critical demixing point and interface fluctuations of droplets the interfacial tension obtained from the analysis of the capillary wave spectrum agrees well with the results based on the laplaceyoung equation phaseseparation dynamics follows the lifshitzslyozov law | [['the', 'multiparticle', 'collision', 'dynamics', 'technique', 'mpc', 'for', 'hydrodynamics', 'simulations', 'is', 'generalized', 'to', 'binary', 'fluid', 'mixtures', 'and', 'multiphase', 'flows', 'by', 'coupling', 'the', 'particlebased', 'fluid', 'dynamics', 'to', 'a', 'ginzburglandau', 'freeenergy', 'functional', 'for', 'phaseseparating', 'binary', 'fluids', 'to', 'describe', 'fluids', 'with', 'a', 'nonideal', 'equation', 'of', 'state', 'an', 'additional', 'densitydependent', 'term', 'is', 'introduced', 'the', 'new', 'approach', 'is', 'verified', 'by', 'applying', 'it', 'to', 'thermodynamics', 'near', 'the', 'critical', 'demixing', 'point', 'and', 'interface', 'fluctuations', 'of', 'droplets', 'the', 'interfacial', 'tension', 'obtained', 'from', 'the', 'analysis', 'of', 'the', 'capillary', 'wave', 'spectrum', 'agrees', 'well', 'with', 'the', 'results', 'based', 'on', 'the', 'laplaceyoung', 'equation', 'phaseseparation', 'dynamics', 'follows', 'the', 'lifshitzslyozov', 'law']] | [-0.14294711170562854, 0.14139371918417964, -0.17064324324019253, 0.03662406784496852, -0.035859667793071516, -0.15339894131951345, -0.013732110285976281, 0.23674967993671694, -0.28202426750794984, -0.27469313591230576, 0.025389533761578303, -0.29078503808705136, -0.14251195268298034, 0.14401892650251588, 0.034191550308605656, 0.12308736358560661, 0.01866209556465037, -0.05906985022011213, -0.008594218645157525, -0.14593514594404647, 0.3247297697234899, 0.08928749390543089, 0.2777247916480216, 0.06669939118243444, 0.13884171007278687, -0.006562640793466319, 0.029537359902557608, 0.0726766844309168, -0.24765096358411634, 0.01635110338490146, 0.2084142784733558, -0.02771202593188112, 0.184372058477796, -0.44961311848601326, -0.3345019219171566, -0.006102426380190688, 0.1136715717439074, 0.16580134736917293, -0.036234424198482884, -0.286874885741175, 0.00939747501979582, -0.17615337891038507, -0.17938571052764019, -0.07125187948501359, -0.00013557075484034917, 0.07134991471199707, -0.2529643065063283, 0.19553794925741386, 0.036216822893038625, 0.03314624306707022, -0.113964321113599, -0.07219605809465672, -0.04008154403466809, 0.024590029096240567, 0.040612409092621725, 0.025658662469747167, 0.18613756131768847, -0.168782612333113, -0.04909247644051599, 0.4097631006152369, -0.07124709243847367, -0.20686677715275437, 0.23931751531927148, -0.08518655569059774, -0.05958864698671581, 0.19106763416978842, 0.14986876050534192, 0.09070761528141702, -0.18374055461026728, 0.03562607366742062, -0.004612021148053221, 0.1905222571625321, 0.03176403272906706, -0.13758433514158241, 0.1982796124093511, 0.22392928213230334, -0.009237070626113564, 0.15873137319431407, -0.06677225663103552, -0.2193268186044103, -0.2956725128654701, -0.14837821281010596, -0.21731104760692688, 0.024571883513241726, -0.12623207881460985, -0.16441035285242833, 0.29211821188315906, 0.1025356105916823, 0.1086497291107662, 0.05801764582429314, 0.25235943314328324, 0.11312261610873975, -0.026424581214087084, 0.08348293994883231, 0.24125411148027828, 0.20694211452791933, 0.16485502982201675, -0.29796283504159266, 0.030362477201075915, 0.13785163280651128] |
1,803.03042 | Some Problems in Compact Message Passing | This paper seeks to address the question of designing distributed algorithms
for the setting of compact memory i.e. sublinear bits working memory for
arbitrary connected networks. The nodes in our networks may have much lower
internal memory as compared to the number of their possible neighbours implying
that a node may not be able to store all the IDs of its neighbours. These
algorithms are useful for large networks of small devices such as the Internet
of Things, for wireless or ad-hoc networks, and, in general, as memory
efficient algorithms. We introduce the Compact Message Passing(CMP) model;an
extension of the standard message passing model considered at a finer
granularity where a node can interleave reads and writes with internal
computations, using a port only once in a round. The interleaving is required
for meaningful computations due to the low memory requirement and is akin to a
distributed network with nodes executing streaming algorithms. Note that the
internal memory size upper bounds the message sizes and hence e.g. for
log-memory, the model is weaker than the Congest model; for such models our
algorithms will work directly too. We present early results in the CMP model
for nodes with log^2-memory. We introduce the concepts of local compact
functions and compact protocols and give solutions for some classic distributed
problems (leader election, tree constructions and traversals). We build on
these to solve the open problem of compact preprocessing for the compact
self-healing routing algorithm CompactFTZ posed in Compact Routing Messages in
Self-Healing Trees(TCS2017) by designing local compact functions for finding
particular subtrees of labeled binary trees. Hence, we introduce the first
fully compact self-healing routing algorithm. We also give independent fully
compact versions of the Forgiving Tree[PODC08] and Thorup-Zwick's tree based
compact routing[SPAA01].
| cs.DC | this paper seeks to address the question of designing distributed algorithms for the setting of compact memory ie sublinear bits working memory for arbitrary connected networks the nodes in our networks may have much lower internal memory as compared to the number of their possible neighbours implying that a node may not be able to store all the ids of its neighbours these algorithms are useful for large networks of small devices such as the internet of things for wireless or adhoc networks and in general as memory efficient algorithms we introduce the compact message passingcmp modelan extension of the standard message passing model considered at a finer granularity where a node can interleave reads and writes with internal computations using a port only once in a round the interleaving is required for meaningful computations due to the low memory requirement and is akin to a distributed network with nodes executing streaming algorithms note that the internal memory size upper bounds the message sizes and hence eg for logmemory the model is weaker than the congest model for such models our algorithms will work directly too we present early results in the cmp model for nodes with log2memory we introduce the concepts of local compact functions and compact protocols and give solutions for some classic distributed problems leader election tree constructions and traversals we build on these to solve the open problem of compact preprocessing for the compact selfhealing routing algorithm compactftz posed in compact routing messages in selfhealing treestcs2017 by designing local compact functions for finding particular subtrees of labeled binary trees hence we introduce the first fully compact selfhealing routing algorithm we also give independent fully compact versions of the forgiving treepodc08 and thorupzwicks tree based compact routingspaa01 | [['this', 'paper', 'seeks', 'to', 'address', 'the', 'question', 'of', 'designing', 'distributed', 'algorithms', 'for', 'the', 'setting', 'of', 'compact', 'memory', 'ie', 'sublinear', 'bits', 'working', 'memory', 'for', 'arbitrary', 'connected', 'networks', 'the', 'nodes', 'in', 'our', 'networks', 'may', 'have', 'much', 'lower', 'internal', 'memory', 'as', 'compared', 'to', 'the', 'number', 'of', 'their', 'possible', 'neighbours', 'implying', 'that', 'a', 'node', 'may', 'not', 'be', 'able', 'to', 'store', 'all', 'the', 'ids', 'of', 'its', 'neighbours', 'these', 'algorithms', 'are', 'useful', 'for', 'large', 'networks', 'of', 'small', 'devices', 'such', 'as', 'the', 'internet', 'of', 'things', 'for', 'wireless', 'or', 'adhoc', 'networks', 'and', 'in', 'general', 'as', 'memory', 'efficient', 'algorithms', 'we', 'introduce', 'the', 'compact', 'message', 'passingcmp', 'modelan', 'extension', 'of', 'the', 'standard', 'message', 'passing', 'model', 'considered', 'at', 'a', 'finer', 'granularity', 'where', 'a', 'node', 'can', 'interleave', 'reads', 'and', 'writes', 'with', 'internal', 'computations', 'using', 'a', 'port', 'only', 'once', 'in', 'a', 'round', 'the', 'interleaving', 'is', 'required', 'for', 'meaningful', 'computations', 'due', 'to', 'the', 'low', 'memory', 'requirement', 'and', 'is', 'akin', 'to', 'a', 'distributed', 'network', 'with', 'nodes', 'executing', 'streaming', 'algorithms', 'note', 'that', 'the', 'internal', 'memory', 'size', 'upper', 'bounds', 'the', 'message', 'sizes', 'and', 'hence', 'eg', 'for', 'logmemory', 'the', 'model', 'is', 'weaker', 'than', 'the', 'congest', 'model', 'for', 'such', 'models', 'our', 'algorithms', 'will', 'work', 'directly', 'too', 'we', 'present', 'early', 'results', 'in', 'the', 'cmp', 'model', 'for', 'nodes', 'with', 'log2memory', 'we', 'introduce', 'the', 'concepts', 'of', 'local', 'compact', 'functions', 'and', 'compact', 'protocols', 'and', 'give', 'solutions', 'for', 'some', 'classic', 'distributed', 'problems', 'leader', 'election', 'tree', 'constructions', 'and', 'traversals', 'we', 'build', 'on', 'these', 'to', 'solve', 'the', 'open', 'problem', 'of', 'compact', 'preprocessing', 'for', 'the', 'compact', 'selfhealing', 'routing', 'algorithm', 'compactftz', 'posed', 'in', 'compact', 'routing', 'messages', 'in', 'selfhealing', 'treestcs2017', 'by', 'designing', 'local', 'compact', 'functions', 'for', 'finding', 'particular', 'subtrees', 'of', 'labeled', 'binary', 'trees', 'hence', 'we', 'introduce', 'the', 'first', 'fully', 'compact', 'selfhealing', 'routing', 'algorithm', 'we', 'also', 'give', 'independent', 'fully', 'compact', 'versions', 'of', 'the', 'forgiving', 'treepodc08', 'and', 'thorupzwicks', 'tree', 'based', 'compact', 'routingspaa01']] | [-0.1659705381467818, 0.08243271077386248, -0.030644045431088184, 0.06771554071706241, -0.11595607919595532, -0.20354947573210205, 0.10763515109519317, 0.40542917194920525, -0.27230878027884003, -0.31799948620806695, 0.12325088487192824, -0.2231164105559542, -0.13812788782729832, 0.17259124248586988, -0.11619064358635281, 0.06737586620823696, 0.0799325846523394, 0.061070979410506994, -0.0006418491996132808, -0.28711800544742416, 0.3118029701196372, 0.07026280367642011, 0.24225312757427137, 0.02388583986469033, 0.09227129951952366, 0.007641131715016098, -0.04425618220424004, 0.01773036991428046, -0.08405374663720656, 0.14146067785110628, 0.2870491033722508, 0.17660272493976406, 0.27172841790171576, -0.4833745858074546, -0.18831026181711857, 0.14567970990000004, 0.1533014948936782, 0.11834865663951577, -0.0318515590038708, -0.2715756036566643, 0.16113376707940455, -0.16331559320432987, -0.06390952098204444, -0.07105825868055829, 0.029574414534809093, 0.040765981133748505, -0.25438800326082855, -0.019577783790788398, 0.0744434771685532, -0.028547700977507934, -0.025198222970367414, -0.07393548029850394, 0.03417032708177789, 0.13973802075849218, -0.04903068699187174, 0.03333497161872055, 0.11257406645520053, -0.10748606079346566, -0.17537384230108985, 0.37051930788635523, -0.0021194363003994277, -0.200200533212743, 0.18722325137449086, -0.011041161337372204, -0.1888950778676433, 0.07751578082737158, 0.23826620979300162, 0.13123987195439454, -0.14171954728072692, 0.05980321550407713, -0.029851044226490275, 0.15513843743103511, 0.06327196940145141, 0.08909878494569698, 0.13634906418975706, 0.2087713959110363, 0.12694507059526408, 0.14400199634673952, -0.03963260758179568, -0.08275552388484766, -0.24358578280112902, -0.15389964028350142, -0.19361631648879807, 0.0018559244476626857, -0.14787752422648417, -0.18171267165485966, 0.36756202809735605, 0.15601508258956706, 0.18128658064582032, 0.14717226287542307, 0.34500527270564574, 0.046621264604946706, 0.10811888562489963, 0.2171682810212459, 0.13041995281427787, 0.07456314922589152, 0.11076328904235991, -0.1349679292171446, 0.11501487554050982, 0.049791323954016496] |
1,803.03043 | Nonlocal superconducting correlations in graphene in the quantum Hall
regime | We study Andreev processes and nonlocal transport in a three-terminal
graphene-superconductor hybrid system under a quantizing perpendicular magnetic
field [G.-H. Lee et al., Nature Phys. 13, 693 (2017)]. We find that the
amplitude of the crossed Andreev reflection (CAR) processes crucially depends
on the orientation of the lattice. By employing Landauer-B\"{u}ttiker
scattering theory, we find that CAR is generally very small for a zigzag edge,
while for an armchair edge it can be larger than the normal transmission,
thereby resulting in a negative nonlocal resistance. In the case of an armchair
edge and with a wide superconducting region (as compared to the superconducting
coherence length), CAR exhibits large oscillations as a function of the
magnetic field due to interference effects. This results in sign changes of the
nonlocal resistance.
| cond-mat.mes-hall cond-mat.supr-con | we study andreev processes and nonlocal transport in a threeterminal graphenesuperconductor hybrid system under a quantizing perpendicular magnetic field gh lee et al nature phys 13 693 2017 we find that the amplitude of the crossed andreev reflection car processes crucially depends on the orientation of the lattice by employing landauerbuttiker scattering theory we find that car is generally very small for a zigzag edge while for an armchair edge it can be larger than the normal transmission thereby resulting in a negative nonlocal resistance in the case of an armchair edge and with a wide superconducting region as compared to the superconducting coherence length car exhibits large oscillations as a function of the magnetic field due to interference effects this results in sign changes of the nonlocal resistance | [['we', 'study', 'andreev', 'processes', 'and', 'nonlocal', 'transport', 'in', 'a', 'threeterminal', 'graphenesuperconductor', 'hybrid', 'system', 'under', 'a', 'quantizing', 'perpendicular', 'magnetic', 'field', 'gh', 'lee', 'et', 'al', 'nature', 'phys', '13', '693', '2017', 'we', 'find', 'that', 'the', 'amplitude', 'of', 'the', 'crossed', 'andreev', 'reflection', 'car', 'processes', 'crucially', 'depends', 'on', 'the', 'orientation', 'of', 'the', 'lattice', 'by', 'employing', 'landauerbuttiker', 'scattering', 'theory', 'we', 'find', 'that', 'car', 'is', 'generally', 'very', 'small', 'for', 'a', 'zigzag', 'edge', 'while', 'for', 'an', 'armchair', 'edge', 'it', 'can', 'be', 'larger', 'than', 'the', 'normal', 'transmission', 'thereby', 'resulting', 'in', 'a', 'negative', 'nonlocal', 'resistance', 'in', 'the', 'case', 'of', 'an', 'armchair', 'edge', 'and', 'with', 'a', 'wide', 'superconducting', 'region', 'as', 'compared', 'to', 'the', 'superconducting', 'coherence', 'length', 'car', 'exhibits', 'large', 'oscillations', 'as', 'a', 'function', 'of', 'the', 'magnetic', 'field', 'due', 'to', 'interference', 'effects', 'this', 'results', 'in', 'sign', 'changes', 'of', 'the', 'nonlocal', 'resistance']] | [-0.2114023678762795, 0.16059846604669778, -0.05295932044585546, -0.0027472694887682187, -0.07092365428449789, -0.15477972749174868, 0.06934164593072045, 0.3713787277842792, -0.2420022126590443, -0.2972804154630375, -0.004775603926314633, -0.2818400757603867, -0.17670126297229596, 0.1956143188759569, -0.05315981138260248, 0.014879478899718718, 0.0364881027417705, -0.028799830735552798, -0.06919655065203822, -0.18141344160404663, 0.29841741096849245, 0.051570540564784474, 0.33743337059552353, 0.10082043384972512, 0.004926002494153358, 0.07257692820334792, 0.06173122756890664, 0.07036482922501805, -0.12019706339134957, 0.0034136696454781005, 0.2009883616462552, -0.09471788311868097, 0.1852318627846449, -0.460408982041097, -0.21422909545827687, 0.02322971549015059, 0.12147183679703032, 0.12799418126160728, -0.0025279112710696896, -0.2906921140600516, 0.06583620247735336, -0.15636512308287642, -0.10290540839805333, 0.004044271099503881, 0.06694910840073585, -0.0378041280629366, -0.29369312706006356, 0.11422071947856959, 0.04754467473488099, 0.05024628503637951, -0.02975153074736974, -0.09567831144325233, -0.05961560340266126, 0.04695286977920653, -0.012770687138784475, 0.031782747445765216, 0.15554124363874042, -0.16282641210109572, -0.14841753475425778, 0.32328550329850625, -0.08313270989327616, -0.13193689251333013, 0.1651065297850747, -0.17257791173882608, -0.05226580207615138, 0.14312658713437443, 0.12617684725686446, 0.10634255165580747, -0.13125501782091897, 0.07712399989796095, -0.0752789176668423, 0.10404900279502537, 0.09341890492129984, 0.06816515692531369, 0.19876503093933412, 0.16078378349116665, 0.09850066776076953, 0.14073808172937888, -0.16005070037533378, -0.05770065745766556, -0.2584125830524767, -0.17225363949501468, -0.17256760686751485, 0.08766644987703641, -0.046106052173205916, -0.22034560341041448, 0.39477086561739216, 0.14889167326632455, 0.22077553753936013, -0.04619242107069712, 0.2654411243635786, 0.1818548287210856, 0.07165514829373637, 0.10417258261897883, 0.22665960873051208, 0.19185317943121719, 0.11346750489306139, -0.3208908817330159, 0.06607655285724057, -0.040007085210910835] |
1,803.03044 | Renormalisation of parabolic stochastic PDEs | We give a survey of recent result regarding scaling limits of systems from
statistical mechanics, as well as the universality of the behaviour of such
systems in so-called cross-over regimes. It transpires that some of these
universal objects are described by singular stochastic PDEs. We then give a
survey of the recently developed theory of regularity structures which allows
to build these objects and to describe some of their properties. We place
particular emphasis on the renormalisation procedure required to give meaning
to these equations.
These are expanded notes of the 20th Takagi lectures held at Tokyo University
on November 4, 2017.
| math.PR math-ph math.AP math.MP | we give a survey of recent result regarding scaling limits of systems from statistical mechanics as well as the universality of the behaviour of such systems in socalled crossover regimes it transpires that some of these universal objects are described by singular stochastic pdes we then give a survey of the recently developed theory of regularity structures which allows to build these objects and to describe some of their properties we place particular emphasis on the renormalisation procedure required to give meaning to these equations these are expanded notes of the 20th takagi lectures held at tokyo university on november 4 2017 | [['we', 'give', 'a', 'survey', 'of', 'recent', 'result', 'regarding', 'scaling', 'limits', 'of', 'systems', 'from', 'statistical', 'mechanics', 'as', 'well', 'as', 'the', 'universality', 'of', 'the', 'behaviour', 'of', 'such', 'systems', 'in', 'socalled', 'crossover', 'regimes', 'it', 'transpires', 'that', 'some', 'of', 'these', 'universal', 'objects', 'are', 'described', 'by', 'singular', 'stochastic', 'pdes', 'we', 'then', 'give', 'a', 'survey', 'of', 'the', 'recently', 'developed', 'theory', 'of', 'regularity', 'structures', 'which', 'allows', 'to', 'build', 'these', 'objects', 'and', 'to', 'describe', 'some', 'of', 'their', 'properties', 'we', 'place', 'particular', 'emphasis', 'on', 'the', 'renormalisation', 'procedure', 'required', 'to', 'give', 'meaning', 'to', 'these', 'equations', 'these', 'are', 'expanded', 'notes', 'of', 'the', '20th', 'takagi', 'lectures', 'held', 'at', 'tokyo', 'university', 'on', 'november', '4', '2017']] | [-0.08922749926226542, 0.09483645622636758, -0.1456606660150083, 0.07823630525529676, -0.08682807458235937, -0.10252410615680228, 0.028952102819411997, 0.290908052599715, -0.22802891831972874, -0.34102073352893486, 0.15624372381488702, -0.26777029990954165, -0.17826440890191816, 0.21792596257428692, -0.0887102193390841, 0.06259446881948878, 0.025245527517707908, 0.007682304162824271, -0.06553876722761083, -0.3151833745194416, 0.3473051809112304, 0.05703431627183568, 0.24256070857004755, 0.05088068576365271, 0.12657352733224922, -0.034973428461371976, -0.06676530942558219, 0.0060528934825960475, -0.18430189584992773, 0.13699647027305237, 0.2953870826681583, 0.11531205028500956, 0.24128553883044743, -0.44111296465145605, -0.16157614358919947, 0.03395622837877668, 0.081890672431316, 0.0999917446889038, 0.005059983250319811, -0.3170846027011673, 0.036593236303066504, -0.16097814067467756, -0.16616303201162202, -0.0789275927761314, 0.0318591984299322, 0.06924104209824958, -0.15096009875574679, 0.04931465411723098, 0.10101206385069435, 0.11094270237520629, -0.045988547196269366, -0.134621476722589, 0.023933853769181845, 0.13622370358629554, 0.03628030629125515, -0.02291446309262777, 0.09341610465929204, -0.11940094508121118, -0.1188671145104237, 0.38072656820226897, -0.0001991319164232004, -0.10095607279343348, 0.23295570236137686, -0.15156002917929606, -0.2063856920565241, 0.06405715477954158, 0.22753351569568336, 0.10699947406172607, -0.14708222523696868, 0.10576989706190515, -0.03311335124196964, 0.11200786182912541, 0.07221063449933175, 0.04012137129628921, 0.20271937139606214, 0.112928366932251, 0.0016290018284766405, 0.10117123238559739, -0.019840686417677823, -0.13596427694930896, -0.3673884355481349, -0.1047558723309753, -0.1194491889944081, 0.08649538565134886, -0.013995957008292488, -0.1757097161448031, 0.3744828098672716, 0.19403480693661407, 0.20255917006208762, 0.045521404138793624, 0.1626174356149254, 0.13403760511702037, 0.0019796620985931333, 0.027352718200406755, 0.23239915702302538, 0.1553944850673753, 0.1557569040542505, -0.11728259446966809, 0.0034298052082258257, 0.15546103571678566] |
1,803.03045 | Deep spectroscopy of nearby galaxy clusters: IV The quench of the star
formation in galaxies in the infall region of Abell\ 85 | Our aim is to understand the role of the environment in the quenching of star
formation of galaxies located in the infall cluster region of Abell 85 (A85).
This is achieved by studying the post-starburst galaxy population as tracer of
recent quenching. By measuring the equivalent width (EW) of the [OII] and
Hdelta spectral lines, we classify the galaxies in three groups: passive (PAS),
emission line (EL), and post-starburst (PSB) galaxies. The PSB galaxy
population represents about 4.5% of the full sample. Dwarf galaxies (Mr >
-18.0) account for about 70 - 80% of PSBs, which indicates that most of the
galaxies undergoing recent quenching are low-mass objects. Independently of the
environment, PSB galaxies are disk-like objects with g - r colour between the
blue ELs and the red PAS ones. The PSB and EL galaxies in low-density
environments show similar luminosities and local galaxy densities. The dynamics
and local galaxy density of the PSB population in high density environments are
shared with PAS galaxies. However, PSB galaxies inside A85 are at shorter
clustercentric radius than PAS and EL ones. The value of the EW(Hdelta) is
larger for those PSBs closer to the cluster centre. We propose two different
physical mechanisms producing PSB galaxies depending on the environment. In low
density environments, gas-rich minor mergers or accretions could produce the
PSB galaxies. For high density environments like A85, PSBs would be produced by
the removal of the gas reservoirs of EL galaxies by ram-pressure stripping when
they pass near to the cluster centre.
| astro-ph.GA | our aim is to understand the role of the environment in the quenching of star formation of galaxies located in the infall cluster region of abell 85 a85 this is achieved by studying the poststarburst galaxy population as tracer of recent quenching by measuring the equivalent width ew of the oii and hdelta spectral lines we classify the galaxies in three groups passive pas emission line el and poststarburst psb galaxies the psb galaxy population represents about 45 of the full sample dwarf galaxies mr 180 account for about 70 80 of psbs which indicates that most of the galaxies undergoing recent quenching are lowmass objects independently of the environment psb galaxies are disklike objects with g r colour between the blue els and the red pas ones the psb and el galaxies in lowdensity environments show similar luminosities and local galaxy densities the dynamics and local galaxy density of the psb population in high density environments are shared with pas galaxies however psb galaxies inside a85 are at shorter clustercentric radius than pas and el ones the value of the ewhdelta is larger for those psbs closer to the cluster centre we propose two different physical mechanisms producing psb galaxies depending on the environment in low density environments gasrich minor mergers or accretions could produce the psb galaxies for high density environments like a85 psbs would be produced by the removal of the gas reservoirs of el galaxies by rampressure stripping when they pass near to the cluster centre | [['our', 'aim', 'is', 'to', 'understand', 'the', 'role', 'of', 'the', 'environment', 'in', 'the', 'quenching', 'of', 'star', 'formation', 'of', 'galaxies', 'located', 'in', 'the', 'infall', 'cluster', 'region', 'of', 'abell', '85', 'a85', 'this', 'is', 'achieved', 'by', 'studying', 'the', 'poststarburst', 'galaxy', 'population', 'as', 'tracer', 'of', 'recent', 'quenching', 'by', 'measuring', 'the', 'equivalent', 'width', 'ew', 'of', 'the', 'oii', 'and', 'hdelta', 'spectral', 'lines', 'we', 'classify', 'the', 'galaxies', 'in', 'three', 'groups', 'passive', 'pas', 'emission', 'line', 'el', 'and', 'poststarburst', 'psb', 'galaxies', 'the', 'psb', 'galaxy', 'population', 'represents', 'about', '45', 'of', 'the', 'full', 'sample', 'dwarf', 'galaxies', 'mr', '180', 'account', 'for', 'about', '70', '80', 'of', 'psbs', 'which', 'indicates', 'that', 'most', 'of', 'the', 'galaxies', 'undergoing', 'recent', 'quenching', 'are', 'lowmass', 'objects', 'independently', 'of', 'the', 'environment', 'psb', 'galaxies', 'are', 'disklike', 'objects', 'with', 'g', 'r', 'colour', 'between', 'the', 'blue', 'els', 'and', 'the', 'red', 'pas', 'ones', 'the', 'psb', 'and', 'el', 'galaxies', 'in', 'lowdensity', 'environments', 'show', 'similar', 'luminosities', 'and', 'local', 'galaxy', 'densities', 'the', 'dynamics', 'and', 'local', 'galaxy', 'density', 'of', 'the', 'psb', 'population', 'in', 'high', 'density', 'environments', 'are', 'shared', 'with', 'pas', 'galaxies', 'however', 'psb', 'galaxies', 'inside', 'a85', 'are', 'at', 'shorter', 'clustercentric', 'radius', 'than', 'pas', 'and', 'el', 'ones', 'the', 'value', 'of', 'the', 'ewhdelta', 'is', 'larger', 'for', 'those', 'psbs', 'closer', 'to', 'the', 'cluster', 'centre', 'we', 'propose', 'two', 'different', 'physical', 'mechanisms', 'producing', 'psb', 'galaxies', 'depending', 'on', 'the', 'environment', 'in', 'low', 'density', 'environments', 'gasrich', 'minor', 'mergers', 'or', 'accretions', 'could', 'produce', 'the', 'psb', 'galaxies', 'for', 'high', 'density', 'environments', 'like', 'a85', 'psbs', 'would', 'be', 'produced', 'by', 'the', 'removal', 'of', 'the', 'gas', 'reservoirs', 'of', 'el', 'galaxies', 'by', 'rampressure', 'stripping', 'when', 'they', 'pass', 'near', 'to', 'the', 'cluster', 'centre']] | [-0.06851222280092185, 0.09154949924276476, -0.08170960523023543, 0.11463384785636582, -0.046572475103160225, -0.03341707458951507, 0.007530040313381268, 0.4538171838774499, -0.07797649645117527, -0.35836938332324947, -0.004307540411309126, -0.2730251581905537, -0.009561879970843953, 0.1546518910619202, -0.036163129558694176, -0.09906997974918984, -0.003283058031579951, -0.13841400864575223, 0.0004918871220223695, -0.32279640097399226, 0.3042129354521512, 0.07690048001586912, 0.18918268515141196, -0.0976283369514807, 0.04758729744538007, -0.06897071007280106, -0.08489627461977692, -0.02664369296836087, -0.1332589910305388, -0.013849695772306627, 0.2792820528574591, 0.10940849023635488, 0.2676947218250019, -0.3481849901609057, -0.16801060241344104, 0.08689048783524041, 0.23811728380339728, 0.04461759404535499, -0.12060153779871088, -0.3110945270280821, 0.10818232158872199, -0.17822900528310756, -0.13826341857108845, 0.13783940273602624, 0.02895438279507749, 0.06960533119422051, -0.17578394051330784, 0.2125007731757729, 0.048195811965452307, 0.08936205021588199, -0.061151554318515204, -0.09916339892834186, -0.1055292656185128, 0.07048036500189292, -0.06583074543037896, 0.05836240301866189, 0.3312934991636175, -0.17699293538191202, 0.020793473756643963, 0.41069439253264883, -0.015451372392397527, 0.06104910521147152, 0.31138671621919634, -0.23036627390190031, -0.1699334162448245, 0.11301826858373142, 0.1362406627577075, 0.08646625190450581, -0.13333542215999966, -0.0037971898240372016, 0.004423117336637554, 0.1833443974147562, 0.028396426529874164, 0.07474032141400097, 0.3164985560434291, 0.072238761101322, 0.05511754031768106, 0.05450834275385081, -0.17871481858953145, -0.026278068481693905, -0.17559092360582337, -0.09873351596864352, -0.10425409681002898, 0.063975640259829, -0.1639040386726557, -0.07347763870397665, 0.32768499779413984, 0.06071862590360833, 0.26263137147518767, 0.07791093021423656, 0.2796005385808168, 0.05539146570879667, 0.14517149774929936, 0.1331985937749376, 0.2755679218509949, 0.1865354654440903, 0.03984837753926853, -0.2624598877293144, 0.10153840709548728, -0.02543004224521957] |
1,803.03046 | Isospin influence on dynamical production of Intermediate Mass Fragments
at Fermi Energies | The Intermediate Mass Fragments emission probability from Projectile-Like
Fragment break-up in semi-peripheral reactions has been measured in collisions
of $^{124}$Xe projectiles with two different targets of $^{64}$Ni and $^{64}$Zn
at the laboratory energy of 35 \amev. The two colliding systems differ only for
the target atomic number Z and, consequently, for the Isospin $N/Z$ ratio. An
enhancement of Intermediate Mass Fragments production for the neutron rich
$^{64}$Ni target, with respect to the $^{64}$Zn, is found. In the case of one
Intermediate Mass Fragment emission, the contributions of the dynamical and
statistical emissions have been evaluated, showing that the increase of the
effect above is due to an enhancement of the dynamical emission probability,
especially for heavy IMFs (Z$\gtrsim$ 7). This proves an influence of the
target Isospin on inducing the dynamical fragment production from
Projectile-Like Fragment break-up. In addition, a comparison of the Xe+Ni,Zn
results with the previously studied $^{112,124}Sn+^{58,64}Ni$ systems is
discussed in order to investigate the influence of the projectile Isospin alone
and to disentangle between Isospin effects against system-size effects on the
emission probability. These comparisons suggest that the prompt-dynamical
emission is mainly ruled by the $N/Z$ content of, both, projectile and target;
for the cases here investigated, the influence of the system size on the
dynamical emission probability can be excluded.
| nucl-ex | the intermediate mass fragments emission probability from projectilelike fragment breakup in semiperipheral reactions has been measured in collisions of 124xe projectiles with two different targets of 64ni and 64zn at the laboratory energy of 35 amev the two colliding systems differ only for the target atomic number z and consequently for the isospin nz ratio an enhancement of intermediate mass fragments production for the neutron rich 64ni target with respect to the 64zn is found in the case of one intermediate mass fragment emission the contributions of the dynamical and statistical emissions have been evaluated showing that the increase of the effect above is due to an enhancement of the dynamical emission probability especially for heavy imfs zgtrsim 7 this proves an influence of the target isospin on inducing the dynamical fragment production from projectilelike fragment breakup in addition a comparison of the xenizn results with the previously studied 112124sn5864ni systems is discussed in order to investigate the influence of the projectile isospin alone and to disentangle between isospin effects against systemsize effects on the emission probability these comparisons suggest that the promptdynamical emission is mainly ruled by the nz content of both projectile and target for the cases here investigated the influence of the system size on the dynamical emission probability can be excluded | [['the', 'intermediate', 'mass', 'fragments', 'emission', 'probability', 'from', 'projectilelike', 'fragment', 'breakup', 'in', 'semiperipheral', 'reactions', 'has', 'been', 'measured', 'in', 'collisions', 'of', '124xe', 'projectiles', 'with', 'two', 'different', 'targets', 'of', '64ni', 'and', '64zn', 'at', 'the', 'laboratory', 'energy', 'of', '35', 'amev', 'the', 'two', 'colliding', 'systems', 'differ', 'only', 'for', 'the', 'target', 'atomic', 'number', 'z', 'and', 'consequently', 'for', 'the', 'isospin', 'nz', 'ratio', 'an', 'enhancement', 'of', 'intermediate', 'mass', 'fragments', 'production', 'for', 'the', 'neutron', 'rich', '64ni', 'target', 'with', 'respect', 'to', 'the', '64zn', 'is', 'found', 'in', 'the', 'case', 'of', 'one', 'intermediate', 'mass', 'fragment', 'emission', 'the', 'contributions', 'of', 'the', 'dynamical', 'and', 'statistical', 'emissions', 'have', 'been', 'evaluated', 'showing', 'that', 'the', 'increase', 'of', 'the', 'effect', 'above', 'is', 'due', 'to', 'an', 'enhancement', 'of', 'the', 'dynamical', 'emission', 'probability', 'especially', 'for', 'heavy', 'imfs', 'zgtrsim', '7', 'this', 'proves', 'an', 'influence', 'of', 'the', 'target', 'isospin', 'on', 'inducing', 'the', 'dynamical', 'fragment', 'production', 'from', 'projectilelike', 'fragment', 'breakup', 'in', 'addition', 'a', 'comparison', 'of', 'the', 'xenizn', 'results', 'with', 'the', 'previously', 'studied', '112124sn5864ni', 'systems', 'is', 'discussed', 'in', 'order', 'to', 'investigate', 'the', 'influence', 'of', 'the', 'projectile', 'isospin', 'alone', 'and', 'to', 'disentangle', 'between', 'isospin', 'effects', 'against', 'systemsize', 'effects', 'on', 'the', 'emission', 'probability', 'these', 'comparisons', 'suggest', 'that', 'the', 'promptdynamical', 'emission', 'is', 'mainly', 'ruled', 'by', 'the', 'nz', 'content', 'of', 'both', 'projectile', 'and', 'target', 'for', 'the', 'cases', 'here', 'investigated', 'the', 'influence', 'of', 'the', 'system', 'size', 'on', 'the', 'dynamical', 'emission', 'probability', 'can', 'be', 'excluded']] | [-0.055455151973907255, 0.1936291145434123, -0.09774023285113662, 0.13873151455125068, 0.05428835036966704, -0.06573101427001914, 0.02852179211529218, 0.35219266219064593, -0.2040197141754072, -0.30283448008632613, -0.02698557155771304, -0.32618633071443875, 0.041419524631357556, 0.13953669268290847, 0.05709462581676835, 0.039842611547770364, 0.05129482316397974, 0.028041971620075615, -0.041886874446030356, -0.18153632891129368, 0.3573661130360978, 0.09095437041009372, 0.22271433974976457, 0.14520844697231813, 0.05756590481926325, -0.0035604695657175914, -0.01133499403192029, -0.02696411450055818, -0.10055450537553076, 0.050957586553814285, 0.22719998249151516, 0.0969783477562058, 0.17219854495747228, -0.3673666018491857, -0.1866716203534589, 0.10495052333341313, 0.16578191482760715, 0.1154252261687773, -0.08464738850719032, -0.28652334255429934, 0.07289210362672885, -0.2357936855800942, -0.13625206166610918, 0.009150940604191625, 0.07965856392451623, 0.08049469281488783, -0.25085324898937644, 0.0765255084362887, 0.03142010868045958, 0.07886262701270785, -0.08015107994960656, -0.20883474023867166, -0.07587235910765264, 0.06670894900793736, 0.09818576145939142, 0.014395296715314166, 0.2117850668201188, -0.12507843751985281, -0.06256950057533411, 0.39625533659643725, -0.0031138317091698, -0.12882915507334303, 0.201937130217458, -0.1920977797038537, -0.16969164615092835, 0.2184550466556415, 0.195999582157523, 0.13019531170789808, -0.16400049294274793, 0.027064349856787746, 0.013321599731977397, 0.22424191378830177, 0.11846802993853278, 0.054942180784770624, 0.17923300933830863, 0.1905836863569555, -0.04010176325364056, 0.11699224224770968, -0.18333684663696848, -0.1264927210214873, -0.2607687418173366, -0.09610686442589075, -0.09352196490706191, 0.023877374368790043, -0.04050192135386993, -0.049471544776713686, 0.3215557624462922, 0.0777155554684248, 0.2186341621355101, 0.016506035625495297, 0.27023766351037853, 0.10152353193909633, 0.06841780755335009, 0.015621153689384952, 0.31076248587583594, 0.17221527223426955, 0.06790718286823183, -0.3149016377678633, 0.12636674341925788, -0.018187187450612843] |
1,803.03047 | Neutron-proton scattering and singular potentials | We consider a Bargmann-type rational parametrization of the nucleon
scattering phase shifts. Applying Marchenko's method of quantum inverse
scattering we show that the scattering data suggest a singular repulsive core
of the potential of the form $2/r^2$ and $6/r^2$ in natural units, for the
${}^3S_1$ and ${}^1S_0$ channels respectively. The simplest solution in the
${}^3S_1$ channel contains three parameters only but reproduces all features of
the potential and bound state wave function within one percent error. We also
consider the ${}^3S_1$-${}^3D_1$ coupled channel problem with the coupled
channel Marchenko inversion method.
| nucl-th quant-ph | we consider a bargmanntype rational parametrization of the nucleon scattering phase shifts applying marchenkos method of quantum inverse scattering we show that the scattering data suggest a singular repulsive core of the potential of the form 2r2 and 6r2 in natural units for the 3s_1 and 1s_0 channels respectively the simplest solution in the 3s_1 channel contains three parameters only but reproduces all features of the potential and bound state wave function within one percent error we also consider the 3s_13d_1 coupled channel problem with the coupled channel marchenko inversion method | [['we', 'consider', 'a', 'bargmanntype', 'rational', 'parametrization', 'of', 'the', 'nucleon', 'scattering', 'phase', 'shifts', 'applying', 'marchenkos', 'method', 'of', 'quantum', 'inverse', 'scattering', 'we', 'show', 'that', 'the', 'scattering', 'data', 'suggest', 'a', 'singular', 'repulsive', 'core', 'of', 'the', 'potential', 'of', 'the', 'form', '2r2', 'and', '6r2', 'in', 'natural', 'units', 'for', 'the', '3s_1', 'and', '1s_0', 'channels', 'respectively', 'the', 'simplest', 'solution', 'in', 'the', '3s_1', 'channel', 'contains', 'three', 'parameters', 'only', 'but', 'reproduces', 'all', 'features', 'of', 'the', 'potential', 'and', 'bound', 'state', 'wave', 'function', 'within', 'one', 'percent', 'error', 'we', 'also', 'consider', 'the', '3s_13d_1', 'coupled', 'channel', 'problem', 'with', 'the', 'coupled', 'channel', 'marchenko', 'inversion', 'method']] | [-0.15462119192711674, 0.12386331768651504, -0.04052828756694713, 0.06697899024682434, -0.016464471764695107, -0.1865794812381435, 0.041051989554668246, 0.33287061150238084, -0.26816272800605157, -0.2151619814168871, 0.04027183861680998, -0.3256645008419337, -0.15093504443890257, 0.1331523706655154, 0.06918820258219506, 0.06453346238952926, 0.07141720921878986, 0.0796156339504327, -0.08675307065531025, -0.18096741253844975, 0.3628795813413316, -0.043623796675950705, 0.2372563620506043, 0.0994876255438234, 0.09468275839279751, 0.06809249533905407, 0.02246058817555228, -0.1026336182683204, -0.10808304344669176, 0.07287920709945303, 0.22219934762361343, 0.06554864907344238, 0.17026192742514978, -0.40490384218858533, -0.20422520712436584, 0.09232685453352633, 0.16104815362460828, 0.1456595721204629, -0.036658510032078526, -0.29143132789458115, 0.006800053831519496, -0.1810600542348255, -0.12697831881389524, -0.036328609331688855, 0.0055455124382390066, 0.014270609872562161, -0.3222604557620675, 0.1393581119708042, 0.006136364332306084, -0.012063030394191822, -0.12570893294387236, -0.19629830285237077, 0.02018798016576787, 0.06835629754919517, 0.003526291809976101, 0.013502418080585474, 0.0913373565018763, -0.15346550106121948, -0.05835389204616292, 0.3741905374604204, -0.08941520923706756, -0.21122050154535624, 0.0884873919951562, -0.11445620007750192, -0.0773048216602608, 0.1576257940653837, 0.160886663273814, 0.10115745136242234, -0.13633110528037454, 0.09845572987144939, -0.04016955295467116, 0.19364055132348185, 0.08998508771536139, 0.05460017317320021, 0.1218308498873637, 0.14509780564753527, 0.01795971781810683, 0.14473320659919736, -0.14185526699685816, -0.11729018610452166, -0.33426944128750413, -0.12862066810314932, -0.1765026063828342, 0.006036432227610317, -0.07221801968810039, -0.13356866972622974, 0.3778093123384699, 0.1156008014994349, 0.19080433344960296, 0.034002228786520074, 0.27631613012570677, 0.1431472222268414, 0.059876280407724754, 0.08664097910056288, 0.25120813500010564, 0.1959948009403234, 0.03811498875258846, -0.2735692774196773, -0.016996380124827116, 0.04710110467387719] |
1,803.03048 | Double Perovskite Structure Induced by Co Addition to PbTiO$_3$ :
Insights from DFT and Experimental Solid State NMR Spectroscopy | The effects of Co addition on the chemical and electronic structure of
PbTiO$_3$ were explored both by theory and through experiment. Cobalt was
incorporated to PbTiO$_3$ during sol gel process. The XRD data of the compounds
confirmed the perovskite structure for the pure samples. The XRD lines
broadened and showed emerging cubic-like features as the Co incorporation
increased. The changes in the XRD pattern were interpreted as double perovskite
structure formation. $^{207}$Pb NMR measurements revealed a growing isotropic
component in the presence of Co. In line with the experiments, DFT calculated
chemical-shift values corroborate isotropic coordination of Pb suggesting the
formation of cubic Pb$_2$CoTiO$_6$ domains in the prepared samples. The
state-of-the-art hybrid functional first-principles calculations indicate
formation of Pb$_2$CoTiO$_6$ with cubic structure and confirms that Co addition
can decrease oxygen binding energy significantly. Experimental UV-Vis
spectroscopy results indicate that upon addition of Co, the band gap is shifted
towards visible wavelengths which was confirmed by the energy bands and
absorption spectra calculations. The oxygen binding energies were determined by
temperature programmed reduction (TPR) measurements. Upon addition of Co, TPR
lines shifted to lower temperatures and new features appeared in the TPR
patterns. This shift was interpreted as weakening of oxygen cobalt bond
strength. The change in the electronic structure by the alterations of oxygen
vacancy formation energy and bond lengths upon Co insertion are determined by
DFT calculations.
| cond-mat.str-el cond-mat.mtrl-sci | the effects of co addition on the chemical and electronic structure of pbtio_3 were explored both by theory and through experiment cobalt was incorporated to pbtio_3 during sol gel process the xrd data of the compounds confirmed the perovskite structure for the pure samples the xrd lines broadened and showed emerging cubiclike features as the co incorporation increased the changes in the xrd pattern were interpreted as double perovskite structure formation 207pb nmr measurements revealed a growing isotropic component in the presence of co in line with the experiments dft calculated chemicalshift values corroborate isotropic coordination of pb suggesting the formation of cubic pb_2cotio_6 domains in the prepared samples the stateoftheart hybrid functional firstprinciples calculations indicate formation of pb_2cotio_6 with cubic structure and confirms that co addition can decrease oxygen binding energy significantly experimental uvvis spectroscopy results indicate that upon addition of co the band gap is shifted towards visible wavelengths which was confirmed by the energy bands and absorption spectra calculations the oxygen binding energies were determined by temperature programmed reduction tpr measurements upon addition of co tpr lines shifted to lower temperatures and new features appeared in the tpr patterns this shift was interpreted as weakening of oxygen cobalt bond strength the change in the electronic structure by the alterations of oxygen vacancy formation energy and bond lengths upon co insertion are determined by dft calculations | [['the', 'effects', 'of', 'co', 'addition', 'on', 'the', 'chemical', 'and', 'electronic', 'structure', 'of', 'pbtio_3', 'were', 'explored', 'both', 'by', 'theory', 'and', 'through', 'experiment', 'cobalt', 'was', 'incorporated', 'to', 'pbtio_3', 'during', 'sol', 'gel', 'process', 'the', 'xrd', 'data', 'of', 'the', 'compounds', 'confirmed', 'the', 'perovskite', 'structure', 'for', 'the', 'pure', 'samples', 'the', 'xrd', 'lines', 'broadened', 'and', 'showed', 'emerging', 'cubiclike', 'features', 'as', 'the', 'co', 'incorporation', 'increased', 'the', 'changes', 'in', 'the', 'xrd', 'pattern', 'were', 'interpreted', 'as', 'double', 'perovskite', 'structure', 'formation', '207pb', 'nmr', 'measurements', 'revealed', 'a', 'growing', 'isotropic', 'component', 'in', 'the', 'presence', 'of', 'co', 'in', 'line', 'with', 'the', 'experiments', 'dft', 'calculated', 'chemicalshift', 'values', 'corroborate', 'isotropic', 'coordination', 'of', 'pb', 'suggesting', 'the', 'formation', 'of', 'cubic', 'pb_2cotio_6', 'domains', 'in', 'the', 'prepared', 'samples', 'the', 'stateoftheart', 'hybrid', 'functional', 'firstprinciples', 'calculations', 'indicate', 'formation', 'of', 'pb_2cotio_6', 'with', 'cubic', 'structure', 'and', 'confirms', 'that', 'co', 'addition', 'can', 'decrease', 'oxygen', 'binding', 'energy', 'significantly', 'experimental', 'uvvis', 'spectroscopy', 'results', 'indicate', 'that', 'upon', 'addition', 'of', 'co', 'the', 'band', 'gap', 'is', 'shifted', 'towards', 'visible', 'wavelengths', 'which', 'was', 'confirmed', 'by', 'the', 'energy', 'bands', 'and', 'absorption', 'spectra', 'calculations', 'the', 'oxygen', 'binding', 'energies', 'were', 'determined', 'by', 'temperature', 'programmed', 'reduction', 'tpr', 'measurements', 'upon', 'addition', 'of', 'co', 'tpr', 'lines', 'shifted', 'to', 'lower', 'temperatures', 'and', 'new', 'features', 'appeared', 'in', 'the', 'tpr', 'patterns', 'this', 'shift', 'was', 'interpreted', 'as', 'weakening', 'of', 'oxygen', 'cobalt', 'bond', 'strength', 'the', 'change', 'in', 'the', 'electronic', 'structure', 'by', 'the', 'alterations', 'of', 'oxygen', 'vacancy', 'formation', 'energy', 'and', 'bond', 'lengths', 'upon', 'co', 'insertion', 'are', 'determined', 'by', 'dft', 'calculations']] | [-0.07293041356256133, 0.14057811504370013, 0.0003869122268211723, 0.013402115158438005, 0.017781688258941986, -0.08624827906085525, 0.12432545682248469, 0.4529614692451628, -0.24460643406316587, -0.3232404428608386, 0.004996419411391613, -0.33110551272036787, -0.10184588442470022, 0.11962929779387582, 0.07083717942991302, -0.006362312640188637, 0.033415269433207544, -0.08255709945692978, -0.11512332248287194, -0.21567413878247998, 0.252238319528421, 0.12857784682769427, 0.3265322403224037, 0.11712970143695058, -0.03540599739861024, -0.030054400711056604, 0.018461317258713916, 0.025720813746391014, -0.15994927586723104, 0.1056686460359686, 0.2556815599833112, -0.03085439650556155, 0.15173652711369723, -0.4522635080991725, -0.2790039927673946, -0.04448112850571958, 0.13251937033229433, 0.10367934623953631, -0.08113946905230848, -0.2519470263010847, 0.054103529433600306, -0.08893845426907714, -0.12687413458325034, -0.06812715656340403, -0.034662770459725135, 0.03943712954034419, -0.23355507191535357, 0.12454416311811656, 0.017782305642360805, 0.1426597803161004, -0.175895690808765, -0.1990408195425814, -0.17116738966072753, 0.030452356836552508, 0.023676409970621776, 0.041904744638575124, 0.23906226823955312, -0.028234066115074122, -0.10760655847946758, 0.35686501734107073, -0.08054136336509106, -0.013440026445015523, 0.15540114217396594, -0.16138985199210917, -0.13781240526009844, 0.24252351481401552, 0.051405224172332516, 0.09436171558022137, -0.11086185685223982, 0.0557026827125295, 0.03753257811775707, 0.25460182701492995, 0.1254889690512956, 0.020433516765221444, 0.19724868510930132, 0.1495082845181985, -0.03278309035947365, 0.12717421436053908, -0.16148617006766205, -0.05409103765181241, -0.15727474591571144, -0.16171530959509578, -0.17443579668179154, 0.022957970019413437, -0.08391802865591784, -0.14877317551383337, 0.34222473391636676, 0.03092233036166733, 0.18899962001076315, -0.06889211552874885, 0.2149924102148651, 0.08007921348506197, 0.12128241496383155, -0.027560332602516346, 0.2582437188974458, 0.17704325863489864, 0.14635145013525555, -0.31234533474286114, 0.1805275527459561, -0.005418325883575377] |
1,803.03049 | Preserving Semantic Relations for Zero-Shot Learning | Zero-shot learning has gained popularity due to its potential to scale
recognition models without requiring additional training data. This is usually
achieved by associating categories with their semantic information like
attributes. However, we believe that the potential offered by this paradigm is
not yet fully exploited. In this work, we propose to utilize the structure of
the space spanned by the attributes using a set of relations. We devise
objective functions to preserve these relations in the embedding space, thereby
inducing semanticity to the embedding space. Through extensive experimental
evaluation on five benchmark datasets, we demonstrate that inducing semanticity
to the embedding space is beneficial for zero-shot learning. The proposed
approach outperforms the state-of-the-art on the standard zero-shot setting as
well as the more realistic generalized zero-shot setting. We also demonstrate
how the proposed approach can be useful for making approximate semantic
inferences about an image belonging to a category for which attribute
information is not available.
| cs.CV | zeroshot learning has gained popularity due to its potential to scale recognition models without requiring additional training data this is usually achieved by associating categories with their semantic information like attributes however we believe that the potential offered by this paradigm is not yet fully exploited in this work we propose to utilize the structure of the space spanned by the attributes using a set of relations we devise objective functions to preserve these relations in the embedding space thereby inducing semanticity to the embedding space through extensive experimental evaluation on five benchmark datasets we demonstrate that inducing semanticity to the embedding space is beneficial for zeroshot learning the proposed approach outperforms the stateoftheart on the standard zeroshot setting as well as the more realistic generalized zeroshot setting we also demonstrate how the proposed approach can be useful for making approximate semantic inferences about an image belonging to a category for which attribute information is not available | [['zeroshot', 'learning', 'has', 'gained', 'popularity', 'due', 'to', 'its', 'potential', 'to', 'scale', 'recognition', 'models', 'without', 'requiring', 'additional', 'training', 'data', 'this', 'is', 'usually', 'achieved', 'by', 'associating', 'categories', 'with', 'their', 'semantic', 'information', 'like', 'attributes', 'however', 'we', 'believe', 'that', 'the', 'potential', 'offered', 'by', 'this', 'paradigm', 'is', 'not', 'yet', 'fully', 'exploited', 'in', 'this', 'work', 'we', 'propose', 'to', 'utilize', 'the', 'structure', 'of', 'the', 'space', 'spanned', 'by', 'the', 'attributes', 'using', 'a', 'set', 'of', 'relations', 'we', 'devise', 'objective', 'functions', 'to', 'preserve', 'these', 'relations', 'in', 'the', 'embedding', 'space', 'thereby', 'inducing', 'semanticity', 'to', 'the', 'embedding', 'space', 'through', 'extensive', 'experimental', 'evaluation', 'on', 'five', 'benchmark', 'datasets', 'we', 'demonstrate', 'that', 'inducing', 'semanticity', 'to', 'the', 'embedding', 'space', 'is', 'beneficial', 'for', 'zeroshot', 'learning', 'the', 'proposed', 'approach', 'outperforms', 'the', 'stateoftheart', 'on', 'the', 'standard', 'zeroshot', 'setting', 'as', 'well', 'as', 'the', 'more', 'realistic', 'generalized', 'zeroshot', 'setting', 'we', 'also', 'demonstrate', 'how', 'the', 'proposed', 'approach', 'can', 'be', 'useful', 'for', 'making', 'approximate', 'semantic', 'inferences', 'about', 'an', 'image', 'belonging', 'to', 'a', 'category', 'for', 'which', 'attribute', 'information', 'is', 'not', 'available']] | [-0.03335235033193188, -0.007692860690695174, -0.07846877909158682, 0.09158505441896783, -0.16538561474543753, -0.13114420693385515, 0.049474012029541145, 0.4549391602112609, -0.29802972522926086, -0.3504660528829428, 0.07634579427362342, -0.24006495671050185, -0.17560694262142157, 0.2084210203859694, -0.12548002735326055, 0.04901301165542915, 0.10319977123987309, 0.06528413377088275, -0.10066795373442257, -0.2853605506591689, 0.3724445370500492, 0.04950534403961816, 0.3389068040062501, 0.04398840626666121, 0.13111026538758402, -0.00882215485285232, -0.024830140048121903, 0.019379844573907744, -0.06425619745157306, 0.21693787577852702, 0.31066333584941697, 0.21893621913519254, 0.29822818409268903, -0.3679372127743284, -0.2626824164540643, 0.12404629767866461, 0.158947142481709, 0.10572172838397054, -0.0506720111174635, -0.36907479442228935, 0.0732731651813222, -0.1859337836726432, 0.008367537419982017, -0.2077919787899324, -0.031051738841672706, -0.06648339562126951, -0.28664918367752423, 0.012984524853045572, 0.0825657133983632, 0.03711340956650912, -0.06181303361967609, -0.07886452250817352, 0.015718829818069935, 0.1579718615171636, 0.028792822646766095, 0.05960321465283217, 0.10511057983763564, -0.16506910665927657, -0.14030596521344912, 0.3979456949872291, -0.056919056278576324, -0.25564474367483214, 0.2065118156302317, -0.038922607848290235, -0.1338362623255249, 0.057277007556407696, 0.18098469572082446, 0.11399938071934079, -0.1627624159753708, 0.06812125231453757, -0.059362249051452064, 0.15249835700241576, 0.038006239121328965, 0.032866301308652965, 0.17602181552084767, 0.2450084010684851, 0.03260635618108568, 0.15230673899396566, -0.09259049457373322, -0.0737332725411008, -0.22597233190017332, -0.12555338954849607, -0.19859655798786574, -0.018431689415036576, -0.08973046030350931, -0.10921860065690842, 0.3737144323042149, 0.25740959235781413, 0.21672604632249493, 0.08051218866047324, 0.32015085533546034, 0.033044018934775224, 0.14279693438802032, 0.06657019287205426, 0.20115760962588558, 0.005385197424715397, 0.0941976556987472, -0.15011213877635776, 0.1037344383950802, 0.06017672407565413] |
1,803.0305 | Topological Properties and Functionalities in Oxide Thin Films and
Interfaces | As symbolized by the Nobel Prize in Physics 2016, "topology" has been
recognized as an essential standpoint to understand and control the physics of
condensed matter. This concept may be spreading even into application areas
such as novel electronics. In this trend, there has been reported a number of
study for the oxide films and heterostructures with topologically non-trivial
electronic or magnetic states. In this review, we overview the trends of new
topological properties and functionalities in oxide materials with sorting out
a number of examples. The technological advances in oxide film growth achieved
over the last few decades are now opening the door for harnessing novel
topological properties.
| cond-mat.str-el cond-mat.mtrl-sci | as symbolized by the nobel prize in physics 2016 topology has been recognized as an essential standpoint to understand and control the physics of condensed matter this concept may be spreading even into application areas such as novel electronics in this trend there has been reported a number of study for the oxide films and heterostructures with topologically nontrivial electronic or magnetic states in this review we overview the trends of new topological properties and functionalities in oxide materials with sorting out a number of examples the technological advances in oxide film growth achieved over the last few decades are now opening the door for harnessing novel topological properties | [['as', 'symbolized', 'by', 'the', 'nobel', 'prize', 'in', 'physics', '2016', 'topology', 'has', 'been', 'recognized', 'as', 'an', 'essential', 'standpoint', 'to', 'understand', 'and', 'control', 'the', 'physics', 'of', 'condensed', 'matter', 'this', 'concept', 'may', 'be', 'spreading', 'even', 'into', 'application', 'areas', 'such', 'as', 'novel', 'electronics', 'in', 'this', 'trend', 'there', 'has', 'been', 'reported', 'a', 'number', 'of', 'study', 'for', 'the', 'oxide', 'films', 'and', 'heterostructures', 'with', 'topologically', 'nontrivial', 'electronic', 'or', 'magnetic', 'states', 'in', 'this', 'review', 'we', 'overview', 'the', 'trends', 'of', 'new', 'topological', 'properties', 'and', 'functionalities', 'in', 'oxide', 'materials', 'with', 'sorting', 'out', 'a', 'number', 'of', 'examples', 'the', 'technological', 'advances', 'in', 'oxide', 'film', 'growth', 'achieved', 'over', 'the', 'last', 'few', 'decades', 'are', 'now', 'opening', 'the', 'door', 'for', 'harnessing', 'novel', 'topological', 'properties']] | [-0.11497060241126413, 0.16226142278881509, -0.054878775004741795, -0.007807214111046985, -0.06990612864733563, -0.12800211895154703, 0.025621334586395036, 0.3696628131705054, -0.28640178426963475, -0.36265917332552444, 0.0876646668793326, -0.3052867172411942, -0.20448084444943987, 0.2515143098442072, -0.04782252543853647, 0.07852988086059826, -0.029731453994477013, -0.07850563428321973, -0.061653057931401176, -0.23741658090041318, 0.22712339275866883, 0.017378220212893612, 0.30001307103714536, 0.1257787046125244, 0.03584950246395321, -0.04500103855095462, 0.03353186927248784, 0.020695130131421012, -0.1642180504960888, 0.10790816498567872, 0.3280943817535945, 0.05747859859881803, 0.3182323383970545, -0.4904593127446437, -0.2677772152120111, 0.04873976816739374, 0.13880863018897832, 0.11241398202020401, -0.1949473839603501, -0.2706544906533229, 0.0600730895199343, -0.1895973042909637, -0.12047824789470898, -0.11288250354011842, 0.05210678763858496, -0.01931089830933002, -0.1170797859897427, -0.021405026790848294, 0.03534721271690289, 0.11553366774257375, -0.024043692087908405, -0.14872599056486144, -0.005039393645497637, 0.11563586743351995, 0.05586495695618588, 0.028120987204868997, 0.12307713535580135, -0.19510618160871807, -0.19033259204631553, 0.3822708426197188, 0.01963564850936789, -0.08855152661365312, 0.20822657544460627, -0.13355661581864223, -0.13930826598710014, 0.09401051660267655, 0.18145495530115355, 0.05818430496670238, -0.17193436667049697, 0.11421342148635656, -0.01872766859521833, 0.14827512991518518, 0.041813984346670025, 0.12063656793480072, 0.2945421668423186, 0.2754651110943988, 0.05810480853628128, 0.13362711186439585, -0.0293466614285877, -0.07352876295805524, -0.2129813328453707, -0.24688685076618824, -0.1835364461919173, 0.08386483298905126, 0.020507769296431718, -0.1922537186738411, 0.45676740778422137, 0.13010522180318046, 0.14002407218837992, -0.09707768408393641, 0.23429774011083698, 0.029828911676037406, 0.09350439865962354, 0.008560518772606182, 0.26211324684458587, 0.14241305007941063, 0.1542152952084557, -0.11902333609973413, 0.14285255514871364, 0.019660668077808165] |
1,803.03051 | Log Gaussian Cox processes on the sphere | A log Gaussian Cox process (LGCP) is a doubly stochastic construction
consisting of a Poisson point process with a random log-intensity given by a
Gaussian random field. Statistical methodology have mainly been developed for
LGCPs defined in the $d$-dimensional Euclidean space. This paper concerns the
case of LGCPs on the $d$-dimensional sphere, with $d=2$ of primary interest. We
discuss the existence problem of such LGCPs, provide sufficient existence
conditions, and establish further useful theoretical properties. The results
are applied for the description of sky positions of galaxies, in comparison
with previous analysis based on a Thomas process, using simple estimation
procedures and making a careful model checking. We account for inhomogeneity in
our models, and as the model checking is based on a thinning procedure which
produces homogeneous/isotropic LGCPs, we discuss its sensitivity.
| math.ST stat.TH | a log gaussian cox process lgcp is a doubly stochastic construction consisting of a poisson point process with a random logintensity given by a gaussian random field statistical methodology have mainly been developed for lgcps defined in the ddimensional euclidean space this paper concerns the case of lgcps on the ddimensional sphere with d2 of primary interest we discuss the existence problem of such lgcps provide sufficient existence conditions and establish further useful theoretical properties the results are applied for the description of sky positions of galaxies in comparison with previous analysis based on a thomas process using simple estimation procedures and making a careful model checking we account for inhomogeneity in our models and as the model checking is based on a thinning procedure which produces homogeneousisotropic lgcps we discuss its sensitivity | [['a', 'log', 'gaussian', 'cox', 'process', 'lgcp', 'is', 'a', 'doubly', 'stochastic', 'construction', 'consisting', 'of', 'a', 'poisson', 'point', 'process', 'with', 'a', 'random', 'logintensity', 'given', 'by', 'a', 'gaussian', 'random', 'field', 'statistical', 'methodology', 'have', 'mainly', 'been', 'developed', 'for', 'lgcps', 'defined', 'in', 'the', 'ddimensional', 'euclidean', 'space', 'this', 'paper', 'concerns', 'the', 'case', 'of', 'lgcps', 'on', 'the', 'ddimensional', 'sphere', 'with', 'd2', 'of', 'primary', 'interest', 'we', 'discuss', 'the', 'existence', 'problem', 'of', 'such', 'lgcps', 'provide', 'sufficient', 'existence', 'conditions', 'and', 'establish', 'further', 'useful', 'theoretical', 'properties', 'the', 'results', 'are', 'applied', 'for', 'the', 'description', 'of', 'sky', 'positions', 'of', 'galaxies', 'in', 'comparison', 'with', 'previous', 'analysis', 'based', 'on', 'a', 'thomas', 'process', 'using', 'simple', 'estimation', 'procedures', 'and', 'making', 'a', 'careful', 'model', 'checking', 'we', 'account', 'for', 'inhomogeneity', 'in', 'our', 'models', 'and', 'as', 'the', 'model', 'checking', 'is', 'based', 'on', 'a', 'thinning', 'procedure', 'which', 'produces', 'homogeneousisotropic', 'lgcps', 'we', 'discuss', 'its', 'sensitivity']] | [-0.06654632316650193, 0.037050127048269474, -0.09795330970064926, 0.05592896946406032, -0.06399264601689476, -0.1257179939482165, 0.0485488050170873, 0.369687083695448, -0.19294753552701577, -0.23989040496640077, 0.13474018078146824, -0.2148561831773784, -0.15267850368378222, 0.1982339971376709, -0.07936406107199259, 0.07486989428210457, 0.053524899958191735, 0.003995921702826172, -0.0442722333469113, -0.2512530993383126, 0.3175735619703406, 0.06728155454410646, 0.28181056329924475, -0.0013197246812900207, 0.11239031451068034, 0.07460900079817827, -0.07661425811238587, 0.026191504657946008, -0.16177069143168069, 0.11016823918142013, 0.1984675741728268, 0.12617564790434016, 0.27349940149631713, -0.39067117998698603, -0.24188282074475892, 0.132331084326974, 0.10015036100919947, 0.10401164074568428, -0.05611439444093188, -0.28374627527878865, 0.07308885383794322, -0.13316159225524143, -0.14669336908833033, -0.0698809206590347, -0.015151941897592655, 0.04451606157971056, -0.30964233301565947, 0.05580633234003335, 0.11385802299447736, 0.08739977575754537, -0.04367905825155934, -0.10742986192436595, 0.02668583550476434, 0.06712333121007882, 0.009680662928472967, 0.011288101121405126, 0.10763973317851305, -0.0730634697895021, -0.13508395570561402, 0.36471224774403455, -0.05744357114041546, -0.2425130185972255, 0.17299192323860593, -0.0958503939769812, -0.17488629869150377, 0.08879517622754202, 0.1813520054924617, 0.13229378343636827, -0.16689665599453046, 0.13678722237490637, -0.05636269021849323, 0.11908109022651911, 0.034839738766081575, -0.021328069159368936, 0.19296883838601353, 0.2144779396152362, 0.04990797318847276, 0.1701700065207941, -0.11460692056146611, -0.12112197942359555, -0.33002039564675406, -0.12478337524116523, -0.16094613842021926, 0.05603884085855286, -0.1094120988843103, -0.19993349039380937, 0.36520970164959254, 0.14418053601455308, 0.2206813525548555, 0.0763911176411631, 0.2756061980892953, 0.12025111146346505, -0.029448156654694697, 0.04592286915294266, 0.16076724057582983, 0.16477266290309117, 0.048857387849409836, -0.13843704913427732, 0.07926474298049409, 0.09239511617417343] |
1,803.03052 | A frequency-constrained geometric Pontryagin maximum principle on matrix
Lie groups | In this article we present a geometric discrete-time Pontryagin maximum
principle (PMP) on matrix Lie groups that incorporates frequency constraints on
the controls in addition to pointwise constraints on the states and control
actions directly at the stage of the problem formulation. This PMP gives first
order necessary conditions for optimality, and leads to two-point boundary
value problems that may be solved by shooting techniques to arrive at optimal
trajectories. We validate our theoretical results with a numerical experiment
on the attitude control of a spacecraft on the Lie group SO(3).
| cs.SY math.OC | in this article we present a geometric discretetime pontryagin maximum principle pmp on matrix lie groups that incorporates frequency constraints on the controls in addition to pointwise constraints on the states and control actions directly at the stage of the problem formulation this pmp gives first order necessary conditions for optimality and leads to twopoint boundary value problems that may be solved by shooting techniques to arrive at optimal trajectories we validate our theoretical results with a numerical experiment on the attitude control of a spacecraft on the lie group so3 | [['in', 'this', 'article', 'we', 'present', 'a', 'geometric', 'discretetime', 'pontryagin', 'maximum', 'principle', 'pmp', 'on', 'matrix', 'lie', 'groups', 'that', 'incorporates', 'frequency', 'constraints', 'on', 'the', 'controls', 'in', 'addition', 'to', 'pointwise', 'constraints', 'on', 'the', 'states', 'and', 'control', 'actions', 'directly', 'at', 'the', 'stage', 'of', 'the', 'problem', 'formulation', 'this', 'pmp', 'gives', 'first', 'order', 'necessary', 'conditions', 'for', 'optimality', 'and', 'leads', 'to', 'twopoint', 'boundary', 'value', 'problems', 'that', 'may', 'be', 'solved', 'by', 'shooting', 'techniques', 'to', 'arrive', 'at', 'optimal', 'trajectories', 'we', 'validate', 'our', 'theoretical', 'results', 'with', 'a', 'numerical', 'experiment', 'on', 'the', 'attitude', 'control', 'of', 'a', 'spacecraft', 'on', 'the', 'lie', 'group', 'so3']] | [-0.14674844539591245, 0.0540223075153695, -0.13751043441991967, 0.02020484908348158, -0.1374654244570123, -0.10679856098799424, 0.09815505174740863, 0.3709648660496696, -0.2797407132501786, -0.2914022620931104, 0.17431437758125037, -0.21299406052004177, -0.14602919291336458, 0.21048433158116844, -0.13400685755474553, 0.07392374346042974, 0.08820755102231607, 0.0730938875413203, -0.11445148045115255, -0.22937259234099105, 0.3290053989513071, 0.03269683899214634, 0.27021344117615576, 0.04583797583760755, 0.180774494529712, 0.02025801151642924, 0.025525315483689186, 0.013709900383888692, -0.17007928213010579, 0.11608454173975778, 0.2718493867215219, 0.10598480564818441, 0.2761450913212784, -0.42808730089729957, -0.17305149330378888, 0.08505752541452319, 0.07150327306430132, 0.0880876969914515, -0.031167557269877213, -0.30797391498440896, 0.08256286368858846, -0.11143865264123204, -0.11735410162421701, -0.051217748172028545, -0.054202761219630205, -0.03320090856293093, -0.32665636403752224, 0.06590458436019636, -0.00717048579826951, 0.02058145481642786, -0.1150675267441669, -0.07213320965356715, 0.02298847135862561, 0.12883779405779971, 0.030929808023866717, -0.01593036175920413, 0.1258802981586656, -0.04010841717104335, -0.1616417029360821, 0.3902733454948987, -0.01961608586837998, -0.2302962796414619, 0.16827714452929385, -0.1161387134189871, -0.17081611117368545, 0.09556471785673729, 0.21870111443798293, 0.1455591173412708, -0.15556567333060428, 0.07814558043149761, -0.05493535769586502, 0.12024001316627958, 0.024884254942842566, -0.03293715109843966, 0.12938177859881422, 0.12905467215127178, 0.20606670653508916, 0.10528317029500933, -0.00010416398316130534, -0.10861674531434591, -0.3735879563859531, -0.11099013207214219, -0.14071834281823792, 0.01624115002290397, -0.09755345419078687, -0.07081782158239039, 0.39407365191932564, 0.18114012235693716, 0.15172028387538516, 0.14173474223455312, 0.2894059296206131, 0.14441643532104587, 0.015970472246408463, 0.06025835105146353, 0.2522761949023314, 0.15925338689575566, 0.06081046541681984, -0.27420108823571354, 0.0302085191277521, 0.15110663783091766] |
1,803.03053 | Active Particles Bound by Information Flows | Self-organization is the generation of order out of local interactions in
non-equilibrium [1]. It is deeply connected to all fields of science from
physics, chemistry to biology where functional living structures
self-assemble[2] and constantly evolve[3] all based on physical interactions.
The emergence of collective animal behavior[4], of society or language are the
results of self-organization processes as well though they involve abstract
interactions arising from sensory inputs, information processing, storage and
feedback[5-7]. Resulting collective behaviors are found for example in crowds
of people, flocks of birds, schools of fish or swarms of bacteria[8,9]. Here we
introduce such information based interactions to the behavior of active
microparticles. A real time feedback of active particle positions controls the
propulsion direction these active particles. The emerging structures are bound
by dissipation and reveal frustrated geometries due to confinement to two
dimensions. They diffuse like passive clusters of colloids, but possess
internal dynamical degrees of freedom that are determined by the feed- back and
the noise in the system. As the information processing in the feedback loops
can be designed almost arbitrarily, new perspectives for self-organization
studies involving coupled feedback systems with separate timescales, machine
learning and swarm intelligence arise.
| cond-mat.soft | selforganization is the generation of order out of local interactions in nonequilibrium 1 it is deeply connected to all fields of science from physics chemistry to biology where functional living structures selfassemble2 and constantly evolve3 all based on physical interactions the emergence of collective animal behavior4 of society or language are the results of selforganization processes as well though they involve abstract interactions arising from sensory inputs information processing storage and feedback57 resulting collective behaviors are found for example in crowds of people flocks of birds schools of fish or swarms of bacteria89 here we introduce such information based interactions to the behavior of active microparticles a real time feedback of active particle positions controls the propulsion direction these active particles the emerging structures are bound by dissipation and reveal frustrated geometries due to confinement to two dimensions they diffuse like passive clusters of colloids but possess internal dynamical degrees of freedom that are determined by the feed back and the noise in the system as the information processing in the feedback loops can be designed almost arbitrarily new perspectives for selforganization studies involving coupled feedback systems with separate timescales machine learning and swarm intelligence arise | [['selforganization', 'is', 'the', 'generation', 'of', 'order', 'out', 'of', 'local', 'interactions', 'in', 'nonequilibrium', '1', 'it', 'is', 'deeply', 'connected', 'to', 'all', 'fields', 'of', 'science', 'from', 'physics', 'chemistry', 'to', 'biology', 'where', 'functional', 'living', 'structures', 'selfassemble2', 'and', 'constantly', 'evolve3', 'all', 'based', 'on', 'physical', 'interactions', 'the', 'emergence', 'of', 'collective', 'animal', 'behavior4', 'of', 'society', 'or', 'language', 'are', 'the', 'results', 'of', 'selforganization', 'processes', 'as', 'well', 'though', 'they', 'involve', 'abstract', 'interactions', 'arising', 'from', 'sensory', 'inputs', 'information', 'processing', 'storage', 'and', 'feedback57', 'resulting', 'collective', 'behaviors', 'are', 'found', 'for', 'example', 'in', 'crowds', 'of', 'people', 'flocks', 'of', 'birds', 'schools', 'of', 'fish', 'or', 'swarms', 'of', 'bacteria89', 'here', 'we', 'introduce', 'such', 'information', 'based', 'interactions', 'to', 'the', 'behavior', 'of', 'active', 'microparticles', 'a', 'real', 'time', 'feedback', 'of', 'active', 'particle', 'positions', 'controls', 'the', 'propulsion', 'direction', 'these', 'active', 'particles', 'the', 'emerging', 'structures', 'are', 'bound', 'by', 'dissipation', 'and', 'reveal', 'frustrated', 'geometries', 'due', 'to', 'confinement', 'to', 'two', 'dimensions', 'they', 'diffuse', 'like', 'passive', 'clusters', 'of', 'colloids', 'but', 'possess', 'internal', 'dynamical', 'degrees', 'of', 'freedom', 'that', 'are', 'determined', 'by', 'the', 'feed', 'back', 'and', 'the', 'noise', 'in', 'the', 'system', 'as', 'the', 'information', 'processing', 'in', 'the', 'feedback', 'loops', 'can', 'be', 'designed', 'almost', 'arbitrarily', 'new', 'perspectives', 'for', 'selforganization', 'studies', 'involving', 'coupled', 'feedback', 'systems', 'with', 'separate', 'timescales', 'machine', 'learning', 'and', 'swarm', 'intelligence', 'arise']] | [-0.14239791154322648, 0.23366051238683583, -0.07626310187874664, 0.05683250210969587, -0.08492665211987042, -0.14677816490991363, 0.006961792545315093, 0.3498025961776132, -0.2974506252401396, -0.35129007828758335, 0.07315309970098406, -0.28620518900024955, -0.2070594997369533, 0.17207241531873502, -0.03549970058189139, -0.0030808047786433034, 0.009351681166996506, 0.032153409626578706, 0.07797080119437884, -0.22235894880905296, 0.2867753774449424, 0.03151088826850798, 0.2686989450952494, 0.003010179125825772, 0.1245242224205334, -0.020543487723648588, -0.015435122779975231, 0.019218780509322998, -0.08321356880973022, 0.13985301486334728, 0.29104227580481173, 0.11702934261874652, 0.270830222302068, -0.49205484336086047, -0.2520765599243694, 0.07223116641825172, 0.1755392094159801, 0.10965073795340644, -0.06797579958174299, -0.2921425965468336, -0.006823761031489956, -0.1207457203503347, -0.12334693107310273, -0.10476917093583134, 0.017468198329327306, 0.09236074420227874, -0.23085676176724615, 0.07093669897852299, 0.06494210277247019, 0.126458436867505, -0.07323341242144986, -0.07809550259737737, -0.02658232956812644, 0.20410455923273926, 0.030067617256506418, -0.04511115455778111, 0.2594079602560326, -0.20153584146167575, -0.17670369951337264, 0.4187862196064393, 0.042242360996760195, -0.1875478108722841, 0.2940813057247735, -0.12191536530354963, -0.1226910210887448, 0.13407274214453332, 0.2539745069484358, 0.07104167809797675, -0.16733230639697683, 0.018687732239480555, 0.005411403434087781, 0.1623767112181839, 0.03838272315220839, 0.07287266516219337, 0.23855509850103895, 0.1911752725578357, 0.039286205425909694, 0.09973681207894987, -0.041860499702081944, -0.1827957966506325, -0.219475849256095, -0.11031178804510638, -0.15257997970896436, 0.04424734396070086, -0.05667571290309299, -0.13573993519387398, 0.32556040999991576, 0.1324523649402743, 0.15048403070669095, -0.004556625638966551, 0.2711634718379035, 0.013994057353156867, 0.09948986036585966, 0.07008626978327545, 0.2383093304581043, 0.09637246858474861, 0.13933369202822135, -0.21178425890174132, 0.0601943786504693, 0.009064549099927018] |
1,803.03054 | Multiple Killing Horizons | Killing horizons which can be such for two or more linearly independent
Killing vectors are studied. We provide a rigorous definition and then show
that the set of Killing vectors sharing a Killing horizon is a Lie algebra
$\mathcal{A}_{\mathcal{H}}$ of dimension at most the dimension of the
spacetime. We prove that one cannot attach different surface gravities to such
multiple Killing horizons, as they have an essentially unique non-zero surface
gravity (or none). $\mathcal{A}_{\mathcal{H}}$ always contains an Abelian
(sub)-algebra ---whose elements all have vanishing surface gravity--- of
dimension equal to or one less than dim $\mathcal{A}_{\mathcal{H}}$. There
arise only two inequivalent possibilities, depending on whether or not there
exists the non-zero surface gravity. We show the connection with Near Horizon
geometries, and also present a linear system of PDEs, the master equation, for
the proportionality function on the horizon between two Killing vectors of a
multiple Killing horizon, with its integrability conditions. We provide
explicit examples of all possible types of multiple Killing horizons, as well
as a full classification of them in maximally symmetric spacetimes.
| gr-qc | killing horizons which can be such for two or more linearly independent killing vectors are studied we provide a rigorous definition and then show that the set of killing vectors sharing a killing horizon is a lie algebra mathcala_mathcalh of dimension at most the dimension of the spacetime we prove that one cannot attach different surface gravities to such multiple killing horizons as they have an essentially unique nonzero surface gravity or none mathcala_mathcalh always contains an abelian subalgebra whose elements all have vanishing surface gravity of dimension equal to or one less than dim mathcala_mathcalh there arise only two inequivalent possibilities depending on whether or not there exists the nonzero surface gravity we show the connection with near horizon geometries and also present a linear system of pdes the master equation for the proportionality function on the horizon between two killing vectors of a multiple killing horizon with its integrability conditions we provide explicit examples of all possible types of multiple killing horizons as well as a full classification of them in maximally symmetric spacetimes | [['killing', 'horizons', 'which', 'can', 'be', 'such', 'for', 'two', 'or', 'more', 'linearly', 'independent', 'killing', 'vectors', 'are', 'studied', 'we', 'provide', 'a', 'rigorous', 'definition', 'and', 'then', 'show', 'that', 'the', 'set', 'of', 'killing', 'vectors', 'sharing', 'a', 'killing', 'horizon', 'is', 'a', 'lie', 'algebra', 'mathcala_mathcalh', 'of', 'dimension', 'at', 'most', 'the', 'dimension', 'of', 'the', 'spacetime', 'we', 'prove', 'that', 'one', 'can', 'not', 'attach', 'different', 'surface', 'gravities', 'to', 'such', 'multiple', 'killing', 'horizons', 'as', 'they', 'have', 'an', 'essentially', 'unique', 'nonzero', 'surface', 'gravity', 'or', 'none', 'mathcala_mathcalh', 'always', 'contains', 'an', 'abelian', 'subalgebra', 'whose', 'elements', 'all', 'have', 'vanishing', 'surface', 'gravity', 'of', 'dimension', 'equal', 'to', 'or', 'one', 'less', 'than', 'dim', 'mathcala_mathcalh', 'there', 'arise', 'only', 'two', 'inequivalent', 'possibilities', 'depending', 'on', 'whether', 'or', 'not', 'there', 'exists', 'the', 'nonzero', 'surface', 'gravity', 'we', 'show', 'the', 'connection', 'with', 'near', 'horizon', 'geometries', 'and', 'also', 'present', 'a', 'linear', 'system', 'of', 'pdes', 'the', 'master', 'equation', 'for', 'the', 'proportionality', 'function', 'on', 'the', 'horizon', 'between', 'two', 'killing', 'vectors', 'of', 'a', 'multiple', 'killing', 'horizon', 'with', 'its', 'integrability', 'conditions', 'we', 'provide', 'explicit', 'examples', 'of', 'all', 'possible', 'types', 'of', 'multiple', 'killing', 'horizons', 'as', 'well', 'as', 'a', 'full', 'classification', 'of', 'them', 'in', 'maximally', 'symmetric', 'spacetimes']] | [-0.18433922543492967, 0.13041684802047418, -0.05342313240803147, 0.055307650780121106, -0.13060271700365353, -0.20209302691746725, -0.05546205678999445, 0.3535562524898241, -0.23978415159784824, -0.22919301970961825, 0.14429827613820517, -0.29965728526871843, -0.14011838933121476, 0.1832838658306558, -0.05720319912247991, -0.008011870806718424, 0.00932772015944902, 0.15137212052263876, -0.11294006390495773, -0.29357286180122255, 0.4158014000398712, -0.02155928441065516, 0.23918043346523102, 0.009337382222720458, 0.19909699369711265, -0.027505966636094416, 0.035069947067837594, 0.05288341489362683, -0.12240835436066352, 0.04900084876607956, 0.2395670768228691, 0.14909333855831716, 0.2208792222453292, -0.42194112418693, -0.20125350137741047, 0.15985092063602796, 0.15884033857323862, 0.11590570912993707, -0.025440013542324752, -0.23990722487833205, 0.06736851767978846, -0.15537162620500572, -0.1707551532667025, -0.0857796435215442, 0.061129674307560014, -0.07688729482897594, -0.19618175030122958, 0.06381637459778026, 0.07438770954373508, 0.07146039146845792, -0.13653877263528288, -0.10439462153212099, -0.10089600369555213, 0.10515735316087654, 0.08073830735438245, -0.004706745500949943, 0.09151783431906485, -0.08269807807479637, -0.1586870784584517, 0.31887479299826726, -0.034861702335578136, -0.3129276425319876, 0.22133898059903293, -0.1926265330616869, -0.09280764433623707, 0.10324136962414335, 0.1262019316871035, 0.184962963102659, -0.1372326610394159, 0.09820331278649069, -0.060512503340714056, 0.09744845374058511, 0.14234940076541513, 0.03978472346134779, 0.26898032408944295, 0.05955009790147934, 0.13339494884219336, 0.0735473103714728, -0.012062859359903703, -0.04461782423405787, -0.40979536434755226, -0.19673634178694444, -0.13499323188558768, 0.11648802041739757, -0.16722714115380793, -0.21066308952341814, 0.3388363825483511, 0.08114627566278022, 0.17957355660823104, 0.062119844864848686, 0.19639906357897519, 0.08564801768560586, 0.09685252943749692, 0.14587881347417073, 0.2264015747202655, 0.11180905024731522, 0.006874609363691534, -0.16750393542697875, -0.032348671151945986, 0.08592347100924301] |
1,803.03055 | Tunable electronic properties of partially edge-hydrogenated armchair
boron-nitrogen-carbon nanoribbons | We employ first-principles calculations based density-functional-theory (DFT)
approach to study electronic properties of partially and fully
edge-hydrogenated armchair boron-nitrogen-carbon (BNC) nanoribbons (ABNCNRs),
with widths between 0.85 nm to 2.3 nm. Due to the partial passivation of edges,
electrons which do not participate in the bonding, form new energy states
located near the Fermi-level. Because of these additional bands, some ABNCNRs
exhibit metallic behavior, which is quite uncommon in armchair nanoribbons. Our
calculations reveal that the metallic behavior is observed for the following
passivation patterns: (i) when B atom from one edge, and N atom from another
edge, are unpassivated. (ii) when N atoms from both the edges are unpassivated.
(iii) when C atom from one edge, and N atom from another edge, are
unpassivated. Furthermore, spin-polarization is also observed for certain
passivation schemes, which is also quite uncommon for armchair nanoribbons.
Thus, our results suggest that ABNCNRs exhibit a wide range of electronic and
{magnetic }properties in that the fully edge-hydrogenated ABNCNRs are direct
band gap semiconductors, while partially edge-hydrogenated ones are either
semiconducting, or metallic, while simultaneously exhibiting spin polarization,
based on the nature of passivation. We also find that the ribbons with larger
widths are more stable, as compared to the narrower ones.
| cond-mat.mtrl-sci cond-mat.mes-hall | we employ firstprinciples calculations based densityfunctionaltheory dft approach to study electronic properties of partially and fully edgehydrogenated armchair boronnitrogencarbon bnc nanoribbons abncnrs with widths between 085 nm to 23 nm due to the partial passivation of edges electrons which do not participate in the bonding form new energy states located near the fermilevel because of these additional bands some abncnrs exhibit metallic behavior which is quite uncommon in armchair nanoribbons our calculations reveal that the metallic behavior is observed for the following passivation patterns i when b atom from one edge and n atom from another edge are unpassivated ii when n atoms from both the edges are unpassivated iii when c atom from one edge and n atom from another edge are unpassivated furthermore spinpolarization is also observed for certain passivation schemes which is also quite uncommon for armchair nanoribbons thus our results suggest that abncnrs exhibit a wide range of electronic and magnetic properties in that the fully edgehydrogenated abncnrs are direct band gap semiconductors while partially edgehydrogenated ones are either semiconducting or metallic while simultaneously exhibiting spin polarization based on the nature of passivation we also find that the ribbons with larger widths are more stable as compared to the narrower ones | [['we', 'employ', 'firstprinciples', 'calculations', 'based', 'densityfunctionaltheory', 'dft', 'approach', 'to', 'study', 'electronic', 'properties', 'of', 'partially', 'and', 'fully', 'edgehydrogenated', 'armchair', 'boronnitrogencarbon', 'bnc', 'nanoribbons', 'abncnrs', 'with', 'widths', 'between', '085', 'nm', 'to', '23', 'nm', 'due', 'to', 'the', 'partial', 'passivation', 'of', 'edges', 'electrons', 'which', 'do', 'not', 'participate', 'in', 'the', 'bonding', 'form', 'new', 'energy', 'states', 'located', 'near', 'the', 'fermilevel', 'because', 'of', 'these', 'additional', 'bands', 'some', 'abncnrs', 'exhibit', 'metallic', 'behavior', 'which', 'is', 'quite', 'uncommon', 'in', 'armchair', 'nanoribbons', 'our', 'calculations', 'reveal', 'that', 'the', 'metallic', 'behavior', 'is', 'observed', 'for', 'the', 'following', 'passivation', 'patterns', 'i', 'when', 'b', 'atom', 'from', 'one', 'edge', 'and', 'n', 'atom', 'from', 'another', 'edge', 'are', 'unpassivated', 'ii', 'when', 'n', 'atoms', 'from', 'both', 'the', 'edges', 'are', 'unpassivated', 'iii', 'when', 'c', 'atom', 'from', 'one', 'edge', 'and', 'n', 'atom', 'from', 'another', 'edge', 'are', 'unpassivated', 'furthermore', 'spinpolarization', 'is', 'also', 'observed', 'for', 'certain', 'passivation', 'schemes', 'which', 'is', 'also', 'quite', 'uncommon', 'for', 'armchair', 'nanoribbons', 'thus', 'our', 'results', 'suggest', 'that', 'abncnrs', 'exhibit', 'a', 'wide', 'range', 'of', 'electronic', 'and', 'magnetic', 'properties', 'in', 'that', 'the', 'fully', 'edgehydrogenated', 'abncnrs', 'are', 'direct', 'band', 'gap', 'semiconductors', 'while', 'partially', 'edgehydrogenated', 'ones', 'are', 'either', 'semiconducting', 'or', 'metallic', 'while', 'simultaneously', 'exhibiting', 'spin', 'polarization', 'based', 'on', 'the', 'nature', 'of', 'passivation', 'we', 'also', 'find', 'that', 'the', 'ribbons', 'with', 'larger', 'widths', 'are', 'more', 'stable', 'as', 'compared', 'to', 'the', 'narrower', 'ones']] | [-0.09481913297991816, 0.1654178507634046, -0.0069114847414597285, 0.0003933800891151323, -0.01652297471745816, -0.23222891964456616, 0.08855956382410345, 0.5009092547035977, -0.23909143498738059, -0.30855682789914163, 0.0020580580555057773, -0.3463959262076327, -0.13505687359857427, 0.13300674323474204, 0.042672647911982206, -0.011003669069752647, 0.08215239786003105, -0.08793775842858333, -0.07789877267136677, -0.18591851354290603, 0.26246109174227217, -0.008452307994422667, 0.28843570757182496, 0.11303683117776196, -0.08773875177618773, -0.022166013063671178, 0.12182346261882533, 0.05304541930958044, -0.12051100533654772, 0.09826172342353874, 0.2686348741762249, -0.09814580361240123, 0.19952408188963125, -0.4998913767482793, -0.15762987639526746, -0.0216593334528928, 0.1451508968585746, 0.15152849850311018, -0.04289158715105527, -0.27394274834945215, 0.13341120004228216, -0.0952663359896499, -0.09381373470201723, -0.04163675140829154, 0.017019071340031337, 0.010741470337676468, -0.21027910919156947, 0.08010727874252731, 0.040116907585887054, 0.04416590621750562, -0.08111295033492805, -0.18979874621464998, -0.1429700663783496, 0.03792025929750012, 0.018425999489480482, -0.02831740428262171, 0.1716558205479683, -0.10103957458654893, -0.09442874715280007, 0.40119860955860975, -0.032627749350378474, -0.08937194123270684, 0.19853205095940069, -0.17083998224481156, -0.08624173826811944, 0.19222869486639313, 0.04813907341974532, 0.10222910321089347, -0.10613803982992334, 0.06275027912160308, -0.03142663063872354, 0.1628174788829889, 0.09408024298574995, 0.13712273040494205, 0.22075796317920893, 0.10794308800912261, 0.08853350918141979, 0.08193375605304598, -0.13234475842168025, -0.029511768185971853, -0.20493944199737527, -0.174456263191578, -0.20894239328381622, 0.0713803018455413, -0.04495532426374791, -0.21274652521641851, 0.3880307007222619, 0.11901096240976852, 0.19934239503288387, -0.01066524080085276, 0.21502607102578908, 0.0755126861468478, 0.08080911567387875, 0.08179221312314564, 0.24266525777584677, 0.15225904200319657, 0.04585853329969242, -0.22995897624915576, 0.09189041983564476, -0.04617991078046936] |
1,803.03056 | Construction of KdV flow I. Tau function via Weyl function | Sato introduced the tau-function to describe solutions to a wide class of
completely integrable differential equations. Later Segal-Wilson represented it
in terms of the relevant integral operators on Hardy space of the unit disc.
This paper gives another representation of the tau-functions by the Weyl
functions for 1d Schr\"odinger operators with real valued potentials, which
will make it possible to extend the class of initial data for the KdV equation
to more general one.
| math.SP | sato introduced the taufunction to describe solutions to a wide class of completely integrable differential equations later segalwilson represented it in terms of the relevant integral operators on hardy space of the unit disc this paper gives another representation of the taufunctions by the weyl functions for 1d schrodinger operators with real valued potentials which will make it possible to extend the class of initial data for the kdv equation to more general one | [['sato', 'introduced', 'the', 'taufunction', 'to', 'describe', 'solutions', 'to', 'a', 'wide', 'class', 'of', 'completely', 'integrable', 'differential', 'equations', 'later', 'segalwilson', 'represented', 'it', 'in', 'terms', 'of', 'the', 'relevant', 'integral', 'operators', 'on', 'hardy', 'space', 'of', 'the', 'unit', 'disc', 'this', 'paper', 'gives', 'another', 'representation', 'of', 'the', 'taufunctions', 'by', 'the', 'weyl', 'functions', 'for', '1d', 'schrodinger', 'operators', 'with', 'real', 'valued', 'potentials', 'which', 'will', 'make', 'it', 'possible', 'to', 'extend', 'the', 'class', 'of', 'initial', 'data', 'for', 'the', 'kdv', 'equation', 'to', 'more', 'general', 'one']] | [-0.1074301479305644, 0.053983203928313545, -0.04542621064025003, 0.0941093933589228, -0.13433390902984585, -0.14343734142823597, -0.04461422299406164, 0.2688149830477463, -0.3201217990670655, -0.1913498160806862, 0.0806742230968273, -0.2597003868982397, -0.17959158157778754, 0.21570712111487583, -0.07069904068359048, 0.09115705719670734, 0.05243555978695686, 0.0355393894998407, -0.12977229970007054, -0.3147990770096815, 0.4350783180797825, -0.021108546193588425, 0.15982040057487384, -0.00865743012243026, 0.11974912388029986, 0.024698945272059458, -0.03532187337279194, -0.08417473286052071, -0.1524734703849095, 0.16015015756459655, 0.2938735606778111, 0.07441690933538249, 0.22972298461969035, -0.4020653238167634, -0.20962856620600498, 0.13800676969962344, 0.15486978983657584, 0.05778082143483885, 0.021468187242430145, -0.33757588905408176, 0.004481151869923279, -0.15232447575072985, -0.23078599575328063, -0.11340507433271489, 0.08453883666142419, 0.034203032978709684, -0.26631316347236467, 0.0512650287332567, 0.045590459507562825, -0.026022772241786524, -0.15371952243652698, -0.07645705449111709, -0.03788603597471642, 0.04414513473701034, -0.011845910295567199, 0.05370042398666359, 0.02306152614009743, -0.08590047297734968, -0.08462826321782493, 0.3867203664361826, -0.06296276238218353, -0.30561600509728937, 0.13109977534544226, -0.18151237612992926, -0.1336146729268335, 0.08854751227222182, 0.13109246258170823, 0.1332474722766091, -0.1782660137710942, 0.15067071666487972, -0.07705834061788344, 0.0808863097902488, 0.07378695064186547, 0.024300711670720548, 0.12285854695113124, 0.0842733525645894, 0.09268507350085152, 0.14246738895245298, 0.035909586400619545, -0.14941537925246726, -0.33079524708257335, -0.18517896753257593, -0.14599713199532818, 0.08859918875670111, -0.07802617951371782, -0.2354685033646387, 0.43630401657365664, 0.12253007131653863, 0.18058212903938634, 0.0800233825685683, 0.16574325358079797, 0.20262009048255514, 0.11704841527357898, 0.0038914868444506383, 0.12805574185944893, 0.2004926051925616, 0.19141480294559654, -0.16509886825696338, -0.052472148458725096, 0.18870943885397268] |
1,803.03057 | Normalised Degree Variance | Finding graph indices which are unbiased to network size and density is of
high importance both within a given field and across fields for enhancing
comparability of modern network science studies. The degree variance is an
important metric for characterising network degree heterogeneity. Here, we
provide an analytically valid normalisation of degree variance to replace
previous normalisations which are either invalid or not applicable to all
networks. It is shown that this normalisation provides equal values for graphs
and their complements; it is maximal in the star graph (and its complement);
and its expected value is constant with respect to density for Erd\"os-R\'enyi
(ER) random graphs of the same size. We strengthen these results with model
observations in ER random graphs, random geometric graphs, scale-free networks,
random hierarchy networks and resting-state brain networks, showing that the
proposed normalisation is generally less affected by both network size and
density than previous normalisation attempts. The closed form expression
proposed also benefits from high computational efficiency and straightforward
mathematical analysis. Analysis of 184 real-world binary networks across
different disciplines shows that normalised degree variance is not correlated
with average degree and is robust to node and edge subsampling. Comparisons
across subdomains of biological networks reveals greater degree heterogeneity
among brain connectomes and food webs than in protein interaction networks.
| cs.SI physics.soc-ph | finding graph indices which are unbiased to network size and density is of high importance both within a given field and across fields for enhancing comparability of modern network science studies the degree variance is an important metric for characterising network degree heterogeneity here we provide an analytically valid normalisation of degree variance to replace previous normalisations which are either invalid or not applicable to all networks it is shown that this normalisation provides equal values for graphs and their complements it is maximal in the star graph and its complement and its expected value is constant with respect to density for erdosrenyi er random graphs of the same size we strengthen these results with model observations in er random graphs random geometric graphs scalefree networks random hierarchy networks and restingstate brain networks showing that the proposed normalisation is generally less affected by both network size and density than previous normalisation attempts the closed form expression proposed also benefits from high computational efficiency and straightforward mathematical analysis analysis of 184 realworld binary networks across different disciplines shows that normalised degree variance is not correlated with average degree and is robust to node and edge subsampling comparisons across subdomains of biological networks reveals greater degree heterogeneity among brain connectomes and food webs than in protein interaction networks | [['finding', 'graph', 'indices', 'which', 'are', 'unbiased', 'to', 'network', 'size', 'and', 'density', 'is', 'of', 'high', 'importance', 'both', 'within', 'a', 'given', 'field', 'and', 'across', 'fields', 'for', 'enhancing', 'comparability', 'of', 'modern', 'network', 'science', 'studies', 'the', 'degree', 'variance', 'is', 'an', 'important', 'metric', 'for', 'characterising', 'network', 'degree', 'heterogeneity', 'here', 'we', 'provide', 'an', 'analytically', 'valid', 'normalisation', 'of', 'degree', 'variance', 'to', 'replace', 'previous', 'normalisations', 'which', 'are', 'either', 'invalid', 'or', 'not', 'applicable', 'to', 'all', 'networks', 'it', 'is', 'shown', 'that', 'this', 'normalisation', 'provides', 'equal', 'values', 'for', 'graphs', 'and', 'their', 'complements', 'it', 'is', 'maximal', 'in', 'the', 'star', 'graph', 'and', 'its', 'complement', 'and', 'its', 'expected', 'value', 'is', 'constant', 'with', 'respect', 'to', 'density', 'for', 'erdosrenyi', 'er', 'random', 'graphs', 'of', 'the', 'same', 'size', 'we', 'strengthen', 'these', 'results', 'with', 'model', 'observations', 'in', 'er', 'random', 'graphs', 'random', 'geometric', 'graphs', 'scalefree', 'networks', 'random', 'hierarchy', 'networks', 'and', 'restingstate', 'brain', 'networks', 'showing', 'that', 'the', 'proposed', 'normalisation', 'is', 'generally', 'less', 'affected', 'by', 'both', 'network', 'size', 'and', 'density', 'than', 'previous', 'normalisation', 'attempts', 'the', 'closed', 'form', 'expression', 'proposed', 'also', 'benefits', 'from', 'high', 'computational', 'efficiency', 'and', 'straightforward', 'mathematical', 'analysis', 'analysis', 'of', '184', 'realworld', 'binary', 'networks', 'across', 'different', 'disciplines', 'shows', 'that', 'normalised', 'degree', 'variance', 'is', 'not', 'correlated', 'with', 'average', 'degree', 'and', 'is', 'robust', 'to', 'node', 'and', 'edge', 'subsampling', 'comparisons', 'across', 'subdomains', 'of', 'biological', 'networks', 'reveals', 'greater', 'degree', 'heterogeneity', 'among', 'brain', 'connectomes', 'and', 'food', 'webs', 'than', 'in', 'protein', 'interaction', 'networks']] | [-0.11089792526574994, 0.07746998477779454, -0.038715202738617165, 0.07718965385882054, -0.07094076695351827, -0.14381153309929046, 0.030395824869090034, 0.42621309828569387, -0.23307575571514597, -0.3230918664434015, 0.04786836973842044, -0.2828778652986296, -0.2001844530157676, 0.15801459727393835, -0.0811903328479578, 0.04483591842458905, 0.08096666090919084, 0.0535014681616438, 0.015676916040117957, -0.26629124211790944, 0.2818315326024916, 0.08046976385068977, 0.33301542213841995, 0.05258291551284923, 0.05127250730354852, -0.00134805653619373, -0.052308323105939455, 0.09539108045390565, -0.11288709857624915, 0.14671589366237944, 0.2783407234579769, 0.17999748713595587, 0.26919167261156773, -0.39330697104472806, -0.25283287334928495, 0.17610559412774077, 0.13250620142746442, 0.07152710211596934, 0.04502763202698487, -0.2424538770654989, 0.12263485698538178, -0.12636565291675786, -0.0945934183330758, -0.08079780025959567, 0.05610468961094739, 0.052349355642002555, -0.2699216605612525, 0.100163350404694, 0.05062530974316393, 0.09416297485155088, 0.0069560354200398754, -0.1648411733891677, -0.04465658712218067, 0.15287101694223196, 0.008391494993214076, 0.040189926514695225, 0.12967996087563397, -0.15498656827279506, -0.12213465456928436, 0.3168844865264233, -0.012517430748024102, -0.19208303068471314, 0.20079072951058927, -0.12463817266419668, -0.18296139749819068, 0.11428244545587168, 0.16279406811291766, 0.06385994322718708, -0.13933328191611777, 0.03680978618110573, -0.0025172126129123003, 0.20014914728192337, 0.07099643630014423, 0.0343782078361309, 0.13557302079560166, 0.18149178314315914, 0.10390461508952151, 0.12123057253538044, -0.05042453544511874, -0.10494994981369625, -0.2018030937631718, -0.08323736728764036, -0.23060622958291788, 0.038023041547906665, -0.22880236196033366, -0.16533372371446198, 0.40324590635740337, 0.14984841289912798, 0.17714150700097284, 0.15293900236873822, 0.2745706990115448, 0.07239298822349627, 0.0829845150324723, 0.12101320199737395, 0.17068688124763193, 0.17840543858969962, 0.0710744197756328, -0.14675911138248113, 0.14725672419795213, 0.0005069247832849484] |
1,803.03058 | An exploratory study on how Internet of Things developing companies
handle User Experience Requirements | [Context and motivation] Internet of Things (IoT) is becoming common
throughout everyday lives. However, the interaction is often different from
when using e.g. computers and other smart devices. Furthermore, an IoT device
is often dependent on several other systems, heavily impacting the user
experience (UX). Finally, the domain is changing rapidly and is driven by
technological innovation.
[Question/problem] In this qualitative study, we explore how companies elicit
UX requirements in the context of IoT. A key part of contemporary IoT
development is also data-driven approaches. Thus, these are also considered in
the study.
[Principal idea / Results] There is a knowledge gap around data-driven
methodologies, there are examples of companies that collect large amount of
data but do not always know how to utilize it. Furthermore, many of the
companies struggle to handle the larger system context, where their products
and the UX they control are only one part of the complete IoT ecosystem.
[Contribution] We provide qualitative empirical data from IoT developing
companies. Based on our findings, we identify challenges for the companies and
areas for future work.
| cs.SE | context and motivation internet of things iot is becoming common throughout everyday lives however the interaction is often different from when using eg computers and other smart devices furthermore an iot device is often dependent on several other systems heavily impacting the user experience ux finally the domain is changing rapidly and is driven by technological innovation questionproblem in this qualitative study we explore how companies elicit ux requirements in the context of iot a key part of contemporary iot development is also datadriven approaches thus these are also considered in the study principal idea results there is a knowledge gap around datadriven methodologies there are examples of companies that collect large amount of data but do not always know how to utilize it furthermore many of the companies struggle to handle the larger system context where their products and the ux they control are only one part of the complete iot ecosystem contribution we provide qualitative empirical data from iot developing companies based on our findings we identify challenges for the companies and areas for future work | [['context', 'and', 'motivation', 'internet', 'of', 'things', 'iot', 'is', 'becoming', 'common', 'throughout', 'everyday', 'lives', 'however', 'the', 'interaction', 'is', 'often', 'different', 'from', 'when', 'using', 'eg', 'computers', 'and', 'other', 'smart', 'devices', 'furthermore', 'an', 'iot', 'device', 'is', 'often', 'dependent', 'on', 'several', 'other', 'systems', 'heavily', 'impacting', 'the', 'user', 'experience', 'ux', 'finally', 'the', 'domain', 'is', 'changing', 'rapidly', 'and', 'is', 'driven', 'by', 'technological', 'innovation', 'questionproblem', 'in', 'this', 'qualitative', 'study', 'we', 'explore', 'how', 'companies', 'elicit', 'ux', 'requirements', 'in', 'the', 'context', 'of', 'iot', 'a', 'key', 'part', 'of', 'contemporary', 'iot', 'development', 'is', 'also', 'datadriven', 'approaches', 'thus', 'these', 'are', 'also', 'considered', 'in', 'the', 'study', 'principal', 'idea', 'results', 'there', 'is', 'a', 'knowledge', 'gap', 'around', 'datadriven', 'methodologies', 'there', 'are', 'examples', 'of', 'companies', 'that', 'collect', 'large', 'amount', 'of', 'data', 'but', 'do', 'not', 'always', 'know', 'how', 'to', 'utilize', 'it', 'furthermore', 'many', 'of', 'the', 'companies', 'struggle', 'to', 'handle', 'the', 'larger', 'system', 'context', 'where', 'their', 'products', 'and', 'the', 'ux', 'they', 'control', 'are', 'only', 'one', 'part', 'of', 'the', 'complete', 'iot', 'ecosystem', 'contribution', 'we', 'provide', 'qualitative', 'empirical', 'data', 'from', 'iot', 'developing', 'companies', 'based', 'on', 'our', 'findings', 'we', 'identify', 'challenges', 'for', 'the', 'companies', 'and', 'areas', 'for', 'future', 'work']] | [-0.11222782262648048, 0.058985261478166365, -0.037933549758379106, 0.06975662236996623, -0.14857665950097562, -0.13792645413261118, 0.03941262275336331, 0.400135226652361, -0.2617942489699325, -0.31168933674494287, 0.16259854872321208, -0.3409488425417437, -0.18798671302312378, 0.2549458861493589, -0.14399189284997416, 0.005593701982556769, 0.06632697019527216, 0.027722072706648063, 0.01883581882470884, -0.2647210606112239, 0.36375657407033224, -0.00013038019513648548, 0.3330128738353175, 0.07909333581900162, -0.002682830995796353, -0.05586745582973543, -0.0801088603898841, -0.045734062581584696, -0.09628242506058475, 0.1752718551780275, 0.35801188763148634, 0.20883704256004748, 0.3867998182501518, -0.4804247289247225, -0.1783936310486261, 0.09300720128963251, 0.1742291516670009, 0.043891235718567685, -0.07148266254905926, -0.2914288453548477, 0.09939723878181958, -0.2249684397384964, -0.12110058360939435, -0.09732792123477237, 0.032964105359435586, 0.04176843027928268, -0.20633203488397883, -0.02949040324271531, 0.02160525771663681, 0.0698269040852241, -0.042589476567269906, -0.09812104982242846, 0.001448277639110018, 0.21240150308144262, 0.12540707609215962, -0.019754830862950074, 0.18635470974468366, -0.16999012500497648, -0.09583169845419444, 0.37074197297183314, 0.03926750183794805, -0.16218152447614106, 0.21541956749095928, -0.10082119947895826, -0.1642392065056882, 0.031665565593909144, 0.21006979022745378, 0.06257312732429526, -0.19759784989868973, 0.061695873327592514, 0.022281989142602165, 0.17578865043829414, -0.01107330075654808, 0.04380975440633418, 0.2240809232631425, 0.2351014283786559, 0.08312876559918213, 0.043526712283779856, 0.00467129038147147, -0.13068912536026178, -0.2367519030786967, -0.16132375787619208, -0.1759902572575198, 0.024910882683134027, -0.06036189584847307, -0.13814378038488245, 0.35060061738313586, 0.2281775231017951, 0.13604435606420123, -0.0015696222446544953, 0.3540091596836789, 0.03783930086019303, 0.11017086859295416, 0.08644052698758295, 0.1894823231922693, -0.006005573893499592, 0.23323217342513497, -0.10842440857844993, 0.11544840021995471, -0.06304524735066244] |
1,803.03059 | Hierarchical Heuristic Learning towards Effcient Norm Emergence | Social norms serve as an important mechanism to regulate the behaviors of
agents and to facilitate coordination among them in multiagent systems. One
important research question is how a norm can rapidly emerge through repeated
local interaction within an agent society under different environments when
their coordination space becomes large. To address this problem, we propose a
Hierarchically Heuristic Learning Strategy (HHLS) under the hierarchical social
learning framework, in which subordinate agents report their information to
their supervisors, while supervisors can generate instructions (rules and
suggestions) based on the information collected from their subordinates.
Subordinate agents heuristically update their strategies based on both their
own experience and the instructions from their supervisors. Extensive
experiment evaluations show that HHLS can support the emergence of desirable
social norms more efficiently and is applicable in a much wider range of
multiagent interaction scenarios compared with previous work. We also
investigate the effectiveness of HHLS by separating out the different
components of the HHLS and evaluating the relative importance of those
components. The influence of key related factors (e.g., hierarchical factors,
non-hierarchical factors, fixed-strategy agents) are investigated as well.
| cs.MA | social norms serve as an important mechanism to regulate the behaviors of agents and to facilitate coordination among them in multiagent systems one important research question is how a norm can rapidly emerge through repeated local interaction within an agent society under different environments when their coordination space becomes large to address this problem we propose a hierarchically heuristic learning strategy hhls under the hierarchical social learning framework in which subordinate agents report their information to their supervisors while supervisors can generate instructions rules and suggestions based on the information collected from their subordinates subordinate agents heuristically update their strategies based on both their own experience and the instructions from their supervisors extensive experiment evaluations show that hhls can support the emergence of desirable social norms more efficiently and is applicable in a much wider range of multiagent interaction scenarios compared with previous work we also investigate the effectiveness of hhls by separating out the different components of the hhls and evaluating the relative importance of those components the influence of key related factors eg hierarchical factors nonhierarchical factors fixedstrategy agents are investigated as well | [['social', 'norms', 'serve', 'as', 'an', 'important', 'mechanism', 'to', 'regulate', 'the', 'behaviors', 'of', 'agents', 'and', 'to', 'facilitate', 'coordination', 'among', 'them', 'in', 'multiagent', 'systems', 'one', 'important', 'research', 'question', 'is', 'how', 'a', 'norm', 'can', 'rapidly', 'emerge', 'through', 'repeated', 'local', 'interaction', 'within', 'an', 'agent', 'society', 'under', 'different', 'environments', 'when', 'their', 'coordination', 'space', 'becomes', 'large', 'to', 'address', 'this', 'problem', 'we', 'propose', 'a', 'hierarchically', 'heuristic', 'learning', 'strategy', 'hhls', 'under', 'the', 'hierarchical', 'social', 'learning', 'framework', 'in', 'which', 'subordinate', 'agents', 'report', 'their', 'information', 'to', 'their', 'supervisors', 'while', 'supervisors', 'can', 'generate', 'instructions', 'rules', 'and', 'suggestions', 'based', 'on', 'the', 'information', 'collected', 'from', 'their', 'subordinates', 'subordinate', 'agents', 'heuristically', 'update', 'their', 'strategies', 'based', 'on', 'both', 'their', 'own', 'experience', 'and', 'the', 'instructions', 'from', 'their', 'supervisors', 'extensive', 'experiment', 'evaluations', 'show', 'that', 'hhls', 'can', 'support', 'the', 'emergence', 'of', 'desirable', 'social', 'norms', 'more', 'efficiently', 'and', 'is', 'applicable', 'in', 'a', 'much', 'wider', 'range', 'of', 'multiagent', 'interaction', 'scenarios', 'compared', 'with', 'previous', 'work', 'we', 'also', 'investigate', 'the', 'effectiveness', 'of', 'hhls', 'by', 'separating', 'out', 'the', 'different', 'components', 'of', 'the', 'hhls', 'and', 'evaluating', 'the', 'relative', 'importance', 'of', 'those', 'components', 'the', 'influence', 'of', 'key', 'related', 'factors', 'eg', 'hierarchical', 'factors', 'nonhierarchical', 'factors', 'fixedstrategy', 'agents', 'are', 'investigated', 'as', 'well']] | [-0.0995086895209565, 0.09200633627267013, -0.06160379113118878, 0.09202627760026624, -0.11495028702420709, -0.1340838857982105, 0.09919304953402151, 0.43479098529433424, -0.28184091902854247, -0.3282787790926902, 0.08155172442291034, -0.24520893921726383, -0.19664901496877935, 0.14281425489183597, -0.08444120677861224, 0.03199623215882837, 0.061377395256346536, 0.04259612305031624, 0.016320578011167843, -0.27381448620302684, 0.346406621119958, 0.06763325708806919, 0.31203513672453875, 0.03148499950348987, 0.07951958947523963, 0.00204235676969604, -0.0600092936403361, 0.004987754903397771, -0.08207466695907699, 0.1629575275804635, 0.312961026690217, 0.21335317560663933, 0.3868661964383057, -0.4544758949550274, -0.166070262519339, 0.09981196011042061, 0.14950495713879797, 0.07502904621461588, -0.011337851350459538, -0.34717382008776715, 0.05983074203528383, -0.18526042101439089, -0.06917445961659288, -0.12076181846508838, -0.01516912347363794, 0.06647372416045982, -0.27160474902484566, -0.0003944757717481875, 0.05388745850758942, 0.08161685664115635, -0.08404000476002693, -0.12914602587419644, 0.01221911306746061, 0.2149297281609071, 0.06848937913056706, -0.034791556590631524, 0.20862059501941194, -0.1560745554588325, -0.16609319592395838, 0.4121275493045054, 0.016670082794482132, -0.18960115945336167, 0.23778188924441804, -0.03820166635041065, -0.11781708786577877, 0.059453416613193796, 0.25073547916405875, 0.13198531714759, -0.16838614829809914, 0.009550123876302361, -0.009089969800856046, 0.1471863588502975, 0.0091313722441555, 0.048600316191922226, 0.1934629058080685, 0.1684180112927646, 0.07772815826976275, 0.10975019606437696, 0.024247646826394055, -0.15593210755279238, -0.19913230109807994, -0.11120361012644539, -0.12804554930746392, -0.013904891898045722, -0.10512844977972197, -0.08836833437469424, 0.3529532793884004, 0.1888389839947669, 0.19468798138389146, 0.06131076941243879, 0.2827944903148581, 0.033174795428867976, 0.08370333030420031, 0.06645658414028889, 0.19544667308218777, 0.038463721645277234, 0.12239354953762023, -0.20802275249709212, 0.15827708921405365, -0.0044647576091254295] |
1,803.0306 | A note on two-colorability of nonuniform hypergraphs | For a hypergraph $H$, let $q(H)$ denote the expected number of monochromatic
edges when the color of each vertex in $H$ is sampled uniformly at random from
the set of size 2. Let $s_{\min}(H)$ denote the minimum size of an edge in $H$.
Erd\H{o}s asked in 1963 whether there exists an unbounded function $g(k)$ such
that any hypergraph $H$ with $s_{\min}(H) \geq k$ and $q(H) \leq g(k)$ is two
colorable. Beck in 1978 answered this question in the affirmative for a
function $g(k) = \Theta(\log^* k)$. We improve this result by showing that, for
an absolute constant $\delta>0$, a version of random greedy coloring procedure
is likely to find a proper two coloring for any hypergraph $H$ with
$s_{\min}(H) \geq k$ and $q(H) \leq \delta \cdot \log k$.
| math.CO cs.DM cs.DS | for a hypergraph h let qh denote the expected number of monochromatic edges when the color of each vertex in h is sampled uniformly at random from the set of size 2 let s_minh denote the minimum size of an edge in h erdhos asked in 1963 whether there exists an unbounded function gk such that any hypergraph h with s_minh geq k and qh leq gk is two colorable beck in 1978 answered this question in the affirmative for a function gk thetalog k we improve this result by showing that for an absolute constant delta0 a version of random greedy coloring procedure is likely to find a proper two coloring for any hypergraph h with s_minh geq k and qh leq delta cdot log k | [['for', 'a', 'hypergraph', 'h', 'let', 'qh', 'denote', 'the', 'expected', 'number', 'of', 'monochromatic', 'edges', 'when', 'the', 'color', 'of', 'each', 'vertex', 'in', 'h', 'is', 'sampled', 'uniformly', 'at', 'random', 'from', 'the', 'set', 'of', 'size', '2', 'let', 's_minh', 'denote', 'the', 'minimum', 'size', 'of', 'an', 'edge', 'in', 'h', 'erdhos', 'asked', 'in', '1963', 'whether', 'there', 'exists', 'an', 'unbounded', 'function', 'gk', 'such', 'that', 'any', 'hypergraph', 'h', 'with', 's_minh', 'geq', 'k', 'and', 'qh', 'leq', 'gk', 'is', 'two', 'colorable', 'beck', 'in', '1978', 'answered', 'this', 'question', 'in', 'the', 'affirmative', 'for', 'a', 'function', 'gk', 'thetalog', 'k', 'we', 'improve', 'this', 'result', 'by', 'showing', 'that', 'for', 'an', 'absolute', 'constant', 'delta0', 'a', 'version', 'of', 'random', 'greedy', 'coloring', 'procedure', 'is', 'likely', 'to', 'find', 'a', 'proper', 'two', 'coloring', 'for', 'any', 'hypergraph', 'h', 'with', 's_minh', 'geq', 'k', 'and', 'qh', 'leq', 'delta', 'cdot', 'log', 'k']] | [-0.16594660299734806, 0.17896692831686598, -0.022440402574221214, -0.009677773234287762, -0.046743701498104834, -0.22354124846142226, 0.09628959208374888, 0.37296749458384265, -0.29052007578929345, -0.3276222794954702, -0.007392356455450746, -0.3261267825902447, -0.06176325944288978, 0.10981628881752725, -0.10783765613702749, -0.036822893180129095, 0.06814338142917616, 0.10858422740707248, 0.016919816752499716, -0.29489117785994934, 0.22679423515164243, -0.08993524171074661, 0.09826771259549859, 0.06796241685102775, 0.03463096939775301, 0.04714549898433932, 0.016438155226028105, 0.05892626540442034, -0.24209346136458193, -0.008741462339214452, 0.2759743631766068, 0.16287147297384583, 0.32763745288151924, -0.30006734387377115, -0.144021548519615, 0.25116756793815553, 0.14990833427346362, -0.05131805263547681, 0.02593724898935303, -0.19720465619131688, 0.1994255301359249, -0.06520329512276239, -0.1050360518687324, 0.0793322333259376, 0.19998173191996776, -0.07368428749948974, -0.3620451121686364, -0.02600409982058652, 0.1334067425419261, 0.07331478735065367, 0.05921237308561333, -0.23042584741928093, -0.04810028710387882, 0.042050939861100214, -0.11138265406690889, 0.17060215553034128, -0.012812363464150607, -0.11402093166280097, -0.14069827860147935, 0.34603558508605936, -0.1050033705624363, -0.12405191063440925, 0.05590096677059499, -0.17668381401183686, -0.15632934955601382, 0.11045668919490079, 0.07116388387640747, 0.18583763838543071, -0.052447835878926465, 0.2091250661751402, -0.181276418635343, 0.1361935872201419, 0.1478440113359692, 0.0037798639680222262, 0.0950020107561649, 0.07463699067928131, 0.16841278215466932, 0.13491045732755125, -0.007930411099214253, 0.09125886511013616, -0.329729079129541, -0.15235549556898084, -0.26248857464392, 0.15667602283638118, -0.18641321847236378, -0.14619061846550055, 0.3032207283756043, 0.08788450557269215, 0.23803893154061687, 0.07155174954875013, 0.19238580373669498, 0.11141154602984439, -0.0401504165511285, 0.22980053478294588, 0.05366482695758959, 0.1939937674796106, -0.050432003283777865, -0.1994189245765662, 0.04947635416293473, 0.14629252993421057] |
1,803.03061 | UltraFast Optical Imaging using Multimode Fiber based Compressed Sensing
and Photonic Time Stretch | An ultrafast single-pixel optical 2D imaging system using a single multimode
fiber (MF) is proposed. The MF acted as the all-optical random pattern
generator. Light with different wavelengths pass through a single MF will
generator all-optical random speckle patterns, which have a low correlation of
0.074 with 0.1nm wavelength step from 1518.0nm to 1567.9nm. The all-optical
random speckle patterns are perfect for compressive sensing (CS) imaging with
the advantage of low cost in comparison with the conventional expensive
pseudorandom binary sequence (PRBS). Besides, with the employment of photonic
time stretch (PTS), light of different wavelengths will go through a single
capsuled MF in time serial within a short pulse time, which makes ultrafast
single-pixel all-optical CS imaging possible. In our work, the all-optical
random speckle patterns are analyzed and used to perform CS imaging in our
proposed system and the results shows a single-pixel photo-detector can be
employed in CS imaging system and a 27 by 27 pixels image is reconstructed
within 500 measurements. In our proposed imaging system, the fast Fourier
transform (FFT) spatial resolution, which is a combination of multiple
Gaussians, is analyzed. Considering 4 optical speckle patterns, the FFT spatial
resolution is 50 by 50 pixels. This resolution limit has been obtained by
removing the central low frequency components and observing the significant
spectral power along all the radial directions.
| physics.optics | an ultrafast singlepixel optical 2d imaging system using a single multimode fiber mf is proposed the mf acted as the alloptical random pattern generator light with different wavelengths pass through a single mf will generator alloptical random speckle patterns which have a low correlation of 0074 with 01nm wavelength step from 15180nm to 15679nm the alloptical random speckle patterns are perfect for compressive sensing cs imaging with the advantage of low cost in comparison with the conventional expensive pseudorandom binary sequence prbs besides with the employment of photonic time stretch pts light of different wavelengths will go through a single capsuled mf in time serial within a short pulse time which makes ultrafast singlepixel alloptical cs imaging possible in our work the alloptical random speckle patterns are analyzed and used to perform cs imaging in our proposed system and the results shows a singlepixel photodetector can be employed in cs imaging system and a 27 by 27 pixels image is reconstructed within 500 measurements in our proposed imaging system the fast fourier transform fft spatial resolution which is a combination of multiple gaussians is analyzed considering 4 optical speckle patterns the fft spatial resolution is 50 by 50 pixels this resolution limit has been obtained by removing the central low frequency components and observing the significant spectral power along all the radial directions | [['an', 'ultrafast', 'singlepixel', 'optical', '2d', 'imaging', 'system', 'using', 'a', 'single', 'multimode', 'fiber', 'mf', 'is', 'proposed', 'the', 'mf', 'acted', 'as', 'the', 'alloptical', 'random', 'pattern', 'generator', 'light', 'with', 'different', 'wavelengths', 'pass', 'through', 'a', 'single', 'mf', 'will', 'generator', 'alloptical', 'random', 'speckle', 'patterns', 'which', 'have', 'a', 'low', 'correlation', 'of', '0074', 'with', '01nm', 'wavelength', 'step', 'from', '15180nm', 'to', '15679nm', 'the', 'alloptical', 'random', 'speckle', 'patterns', 'are', 'perfect', 'for', 'compressive', 'sensing', 'cs', 'imaging', 'with', 'the', 'advantage', 'of', 'low', 'cost', 'in', 'comparison', 'with', 'the', 'conventional', 'expensive', 'pseudorandom', 'binary', 'sequence', 'prbs', 'besides', 'with', 'the', 'employment', 'of', 'photonic', 'time', 'stretch', 'pts', 'light', 'of', 'different', 'wavelengths', 'will', 'go', 'through', 'a', 'single', 'capsuled', 'mf', 'in', 'time', 'serial', 'within', 'a', 'short', 'pulse', 'time', 'which', 'makes', 'ultrafast', 'singlepixel', 'alloptical', 'cs', 'imaging', 'possible', 'in', 'our', 'work', 'the', 'alloptical', 'random', 'speckle', 'patterns', 'are', 'analyzed', 'and', 'used', 'to', 'perform', 'cs', 'imaging', 'in', 'our', 'proposed', 'system', 'and', 'the', 'results', 'shows', 'a', 'singlepixel', 'photodetector', 'can', 'be', 'employed', 'in', 'cs', 'imaging', 'system', 'and', 'a', '27', 'by', '27', 'pixels', 'image', 'is', 'reconstructed', 'within', '500', 'measurements', 'in', 'our', 'proposed', 'imaging', 'system', 'the', 'fast', 'fourier', 'transform', 'fft', 'spatial', 'resolution', 'which', 'is', 'a', 'combination', 'of', 'multiple', 'gaussians', 'is', 'analyzed', 'considering', '4', 'optical', 'speckle', 'patterns', 'the', 'fft', 'spatial', 'resolution', 'is', '50', 'by', '50', 'pixels', 'this', 'resolution', 'limit', 'has', 'been', 'obtained', 'by', 'removing', 'the', 'central', 'low', 'frequency', 'components', 'and', 'observing', 'the', 'significant', 'spectral', 'power', 'along', 'all', 'the', 'radial', 'directions']] | [-0.11036434098469644, 0.13281886038874455, -0.0975255580936474, -0.014182106928307224, -0.029268809306350622, -0.16029485419223255, 0.012321339078268713, 0.49093307928944174, -0.2727240609110926, -0.29843601248311724, 0.12116451876513153, -0.23740589101481335, -0.1314316516276449, 0.20372703443387186, -0.05613525768699632, 0.09960825557672334, 0.07102191269990396, -0.04226962303827432, -0.04560613797247325, -0.17727622841484844, 0.17824576614181173, 0.09101112810339228, 0.32209481142239055, -0.07278091954490677, 0.1288591847860847, 0.06279296167856294, -0.062356003536842765, -0.027539994732730767, -0.014563537635099651, 0.0754313957089008, 0.26600270669891457, 0.09481361901240565, 0.25430099277714774, -0.4225797790949318, -0.2571178329092535, 0.054199032278054136, 0.16817622887372802, 0.10374386816931126, -0.10324306040578946, -0.2872071806791196, 0.09530250790465454, -0.09281876827325587, -0.07983938674389554, -0.03641377723542973, -0.020707171787084505, 0.04583964863876727, -0.2762879118619656, 0.04646106648750984, 0.004839300516654144, 0.09847411329604008, -0.021565623449119317, -0.08749051440126178, 0.04172653493905355, 0.07579946254210716, -0.07388097943251275, 0.0706439365632832, 0.1443841077493165, -0.10200181544059887, -0.11383370219237722, 0.3463536948727613, -0.09301996866071766, -0.13523381628752262, 0.16698181326501071, -0.16856323212242305, -0.06215532780624926, 0.21849575001450086, 0.14036083323140205, 0.10294917470521547, -0.13661134683220139, 0.009358648606972896, -0.00561774498783052, 0.2707310599719428, 0.13450439318972215, 0.12114475712137805, 0.18046943456230854, 0.20577634852379562, 0.028387982052961228, 0.1495085437110075, -0.2653841983421113, -0.0248593607729576, -0.19040200264029078, -0.12190281782637943, -0.21559613072472117, 0.030990725897506555, -0.14628725662928033, -0.0935373185583475, 0.4169282613703134, 0.1479526088848202, 0.16861128050156615, 0.015014841859969734, 0.3926905410448936, 0.11717560358652422, 0.12783268117451702, -0.008259365430355749, 0.22785998973995447, 0.13596521074333312, 0.16903358648361808, -0.20026297154942188, -0.027826150195588442, -0.0062299241587011655] |
1,803.03062 | Effect of Grain Size on Differential Desorption of Volatile Species and
on Non-ideal MHD Diffusivity | We developed a chemical network for modeling the chemistry and non-ideal MHD
effects from the collapsing dense molecular clouds to protostellar disks.
First, we re-formulated the cosmic-ray desorption rate by considering the
variations of desorption rate over the grain size distribution. We find that
the differential desorption of volatile species is amplified by the grains
larger than 0.1 $\mu$m, because larger grains are heated to a lower temperature
by cosmic-rays and hence more sensitive to the variations in binding energies.
As a result, atomic nitrogen N is $\sim$2 orders of magnitude more abundant
than CO; N$_2$H$^+$ also becomes a few times more abundant than HCO$^+$ due to
the increased gas-phase N$_2$. However, the changes in ionization fraction due
to freeze-out and desorption only have minor effects on the non-ideal MHD
diffusivities. Our chemical network confirms that the very small grains (VSGs:
below a few 100 $\AA$) weakens the efficiency of both ambipolar diffusion and
Hall effect. In collapsing dense cores, a maximum ambipolar diffusion is
achieved when truncating the MRN size distribution at 0.1 $\mu$m, and for a
maximum Hall effect, the truncation occurs at 0.04 $\mu$m. We conclude that the
grain size distribution is crucial to the differential depletion between CO and
N$_2$ related molecules, as well as to the non-ideal MHD diffusivities in dense
cores.
| astro-ph.SR astro-ph.GA | we developed a chemical network for modeling the chemistry and nonideal mhd effects from the collapsing dense molecular clouds to protostellar disks first we reformulated the cosmicray desorption rate by considering the variations of desorption rate over the grain size distribution we find that the differential desorption of volatile species is amplified by the grains larger than 01 mum because larger grains are heated to a lower temperature by cosmicrays and hence more sensitive to the variations in binding energies as a result atomic nitrogen n is sim2 orders of magnitude more abundant than co n_2h also becomes a few times more abundant than hco due to the increased gasphase n_2 however the changes in ionization fraction due to freezeout and desorption only have minor effects on the nonideal mhd diffusivities our chemical network confirms that the very small grains vsgs below a few 100 aa weakens the efficiency of both ambipolar diffusion and hall effect in collapsing dense cores a maximum ambipolar diffusion is achieved when truncating the mrn size distribution at 01 mum and for a maximum hall effect the truncation occurs at 004 mum we conclude that the grain size distribution is crucial to the differential depletion between co and n_2 related molecules as well as to the nonideal mhd diffusivities in dense cores | [['we', 'developed', 'a', 'chemical', 'network', 'for', 'modeling', 'the', 'chemistry', 'and', 'nonideal', 'mhd', 'effects', 'from', 'the', 'collapsing', 'dense', 'molecular', 'clouds', 'to', 'protostellar', 'disks', 'first', 'we', 'reformulated', 'the', 'cosmicray', 'desorption', 'rate', 'by', 'considering', 'the', 'variations', 'of', 'desorption', 'rate', 'over', 'the', 'grain', 'size', 'distribution', 'we', 'find', 'that', 'the', 'differential', 'desorption', 'of', 'volatile', 'species', 'is', 'amplified', 'by', 'the', 'grains', 'larger', 'than', '01', 'mum', 'because', 'larger', 'grains', 'are', 'heated', 'to', 'a', 'lower', 'temperature', 'by', 'cosmicrays', 'and', 'hence', 'more', 'sensitive', 'to', 'the', 'variations', 'in', 'binding', 'energies', 'as', 'a', 'result', 'atomic', 'nitrogen', 'n', 'is', 'sim2', 'orders', 'of', 'magnitude', 'more', 'abundant', 'than', 'co', 'n_2h', 'also', 'becomes', 'a', 'few', 'times', 'more', 'abundant', 'than', 'hco', 'due', 'to', 'the', 'increased', 'gasphase', 'n_2', 'however', 'the', 'changes', 'in', 'ionization', 'fraction', 'due', 'to', 'freezeout', 'and', 'desorption', 'only', 'have', 'minor', 'effects', 'on', 'the', 'nonideal', 'mhd', 'diffusivities', 'our', 'chemical', 'network', 'confirms', 'that', 'the', 'very', 'small', 'grains', 'vsgs', 'below', 'a', 'few', '100', 'aa', 'weakens', 'the', 'efficiency', 'of', 'both', 'ambipolar', 'diffusion', 'and', 'hall', 'effect', 'in', 'collapsing', 'dense', 'cores', 'a', 'maximum', 'ambipolar', 'diffusion', 'is', 'achieved', 'when', 'truncating', 'the', 'mrn', 'size', 'distribution', 'at', '01', 'mum', 'and', 'for', 'a', 'maximum', 'hall', 'effect', 'the', 'truncation', 'occurs', 'at', '004', 'mum', 'we', 'conclude', 'that', 'the', 'grain', 'size', 'distribution', 'is', 'crucial', 'to', 'the', 'differential', 'depletion', 'between', 'co', 'and', 'n_2', 'related', 'molecules', 'as', 'well', 'as', 'to', 'the', 'nonideal', 'mhd', 'diffusivities', 'in', 'dense', 'cores']] | [-0.06569728715836676, 0.19981681040921656, 0.0162903101522527, 0.05652598846137249, 0.025681786191937287, -0.07415743098564205, 0.02647357515793311, 0.3857610278895923, -0.24842619926514198, -0.32266940217259155, 0.028431458731314967, -0.2590664350749573, -0.008964356158920113, 0.138833364115573, 0.004408758039230026, -0.013471099821242293, 0.03698132913302166, -0.12967788311760134, -0.040781345702857984, -0.24024795475823607, 0.27509869221374733, 0.13899532323789007, 0.17664056299104086, 0.11094290293642634, 0.0199643091968162, -0.16023605341340677, -0.0011039600387850801, 0.0029363863648683656, -0.16841103934758953, 0.055371838941300246, 0.20802535606153344, -0.003844344254565953, 0.21912126188179315, -0.47058642697670766, -0.2773330961933471, 0.05716242829620975, 0.15980051225265873, 0.09666244328571355, -0.016097132115952633, -0.18565549912287377, 0.06599418476571582, -0.17340319446064875, -0.10976216999877218, 0.03647158434078063, 0.11303190029041696, -0.0028878921746975884, -0.28594436913472276, 0.1451972944495399, 0.04717288604853803, 0.08608374701038192, -0.07230024537809777, -0.1910223871885803, -0.11045522649111526, 0.04697847900623005, 0.009979828238809933, 0.015460861603244452, 0.29250730551813603, -0.13903423940788628, 0.013863901573357769, 0.44230982917039074, -0.12017772322694163, -0.10736766936523574, 0.2502827185167489, -0.21146462727896012, -0.11670074859190913, 0.2785455560449013, 0.11803861616382134, 0.14947680948722747, -0.09894105289400983, -0.01923892439036171, -0.0068420432679664155, 0.21561119019178338, 0.12196368893848793, 0.03368512525611873, 0.23169486239243486, 0.1803339254035945, 0.07578017924802832, 0.12159630969276197, -0.187536730481449, -0.08477146588780914, -0.1938249210640359, -0.1652520180289303, -0.17626063465752342, 0.12016081387683543, -0.13915542826393923, -0.10708995904421545, 0.25785983843548643, 0.15058335290029687, 0.2246375386774849, 0.011667801771626254, 0.33273100709190706, 0.09737169818817487, 0.10314394355309518, 0.11374186480435015, 0.21082240428930055, 0.1727423519644487, 0.13679285006638411, -0.27884070362792723, 0.1687649298472167, -0.0038194400151067066] |
1,803.03063 | The Large Sky Area Multi-Object Fibre Spectroscopic Telescope (LAMOST)
Quasar Survey: Quasar Properties from Data Release Two and Three | This is the second installment for the Large Sky Area Multi-Object Fibre
Spectroscopic Telescope (LAMOST) Quasar Survey, which includes quasars observed
from September 2013 to June 2015. There are 9024 confirmed quasars in DR2 and
10911 in DR3. After cross-match with the SDSS quasar catalogs and NED, 12126
quasars are discovered independently. Among them 2225 quasars were released by
SDSS DR12 QSO catalogue in 2014 after we finalised the survey candidates. 1801
sources were identified by SDSS DR14 as QSOs. The remaining 8100 quasars are
considered as newly founded, and among them 6887 quasars can be given reliable
emission line measurements and the estimated black hole masses. Quasars found
in LAMOST are mostly located at low-to-moderate redshifts, with a mean value of
1.5. The highest redshift observed in DR2 and DR3 is 5. We applied emission
line measurements to H$\alpha$, H$\beta$, Mg{\sc ii} and C{\sc iv}. We deduced
the monochromatic continuum luminosities using photometry data, and estimated
the virial black hole masses for the newly discovered quasars. Results are
compiled into a quasar catalog, which will be available online.
| astro-ph.GA | this is the second installment for the large sky area multiobject fibre spectroscopic telescope lamost quasar survey which includes quasars observed from september 2013 to june 2015 there are 9024 confirmed quasars in dr2 and 10911 in dr3 after crossmatch with the sdss quasar catalogs and ned 12126 quasars are discovered independently among them 2225 quasars were released by sdss dr12 qso catalogue in 2014 after we finalised the survey candidates 1801 sources were identified by sdss dr14 as qsos the remaining 8100 quasars are considered as newly founded and among them 6887 quasars can be given reliable emission line measurements and the estimated black hole masses quasars found in lamost are mostly located at lowtomoderate redshifts with a mean value of 15 the highest redshift observed in dr2 and dr3 is 5 we applied emission line measurements to halpha hbeta mgsc ii and csc iv we deduced the monochromatic continuum luminosities using photometry data and estimated the virial black hole masses for the newly discovered quasars results are compiled into a quasar catalog which will be available online | [['this', 'is', 'the', 'second', 'installment', 'for', 'the', 'large', 'sky', 'area', 'multiobject', 'fibre', 'spectroscopic', 'telescope', 'lamost', 'quasar', 'survey', 'which', 'includes', 'quasars', 'observed', 'from', 'september', '2013', 'to', 'june', '2015', 'there', 'are', '9024', 'confirmed', 'quasars', 'in', 'dr2', 'and', '10911', 'in', 'dr3', 'after', 'crossmatch', 'with', 'the', 'sdss', 'quasar', 'catalogs', 'and', 'ned', '12126', 'quasars', 'are', 'discovered', 'independently', 'among', 'them', '2225', 'quasars', 'were', 'released', 'by', 'sdss', 'dr12', 'qso', 'catalogue', 'in', '2014', 'after', 'we', 'finalised', 'the', 'survey', 'candidates', '1801', 'sources', 'were', 'identified', 'by', 'sdss', 'dr14', 'as', 'qsos', 'the', 'remaining', '8100', 'quasars', 'are', 'considered', 'as', 'newly', 'founded', 'and', 'among', 'them', '6887', 'quasars', 'can', 'be', 'given', 'reliable', 'emission', 'line', 'measurements', 'and', 'the', 'estimated', 'black', 'hole', 'masses', 'quasars', 'found', 'in', 'lamost', 'are', 'mostly', 'located', 'at', 'lowtomoderate', 'redshifts', 'with', 'a', 'mean', 'value', 'of', '15', 'the', 'highest', 'redshift', 'observed', 'in', 'dr2', 'and', 'dr3', 'is', '5', 'we', 'applied', 'emission', 'line', 'measurements', 'to', 'halpha', 'hbeta', 'mgsc', 'ii', 'and', 'csc', 'iv', 'we', 'deduced', 'the', 'monochromatic', 'continuum', 'luminosities', 'using', 'photometry', 'data', 'and', 'estimated', 'the', 'virial', 'black', 'hole', 'masses', 'for', 'the', 'newly', 'discovered', 'quasars', 'results', 'are', 'compiled', 'into', 'a', 'quasar', 'catalog', 'which', 'will', 'be', 'available', 'online']] | [0.005982002470998115, 0.06501647879191663, 0.0028283208205751825, 0.11388096475275233, -0.1769173143358294, -0.10736250457761998, 0.06734624262271302, 0.46898391034475034, -0.038227380392026535, -0.38411075231001784, 0.09450482618550278, -0.4371339099251487, 0.04567199667884309, 0.247011953774183, -0.03793058253751461, -0.02440192023543327, 0.06757133144243055, -0.18113947714145265, 0.03424003879152816, -0.4031887844183974, 0.26412508587530825, 0.0708082423367527, 0.19527904926851558, -0.13850243025187278, 0.10990543456962647, -0.10720292491356978, -0.22081953080716343, 0.029465896036904932, -0.19239155084072623, 0.006454098807501324, 0.33985348780288915, 0.1760718943211093, 0.1985825454355793, -0.1564351298971876, -0.12642843276654694, 0.04301634469913879, 0.1900084024017907, 0.08091500661534708, -0.041859185916968106, -0.37203762846674476, 0.08791717204358167, -0.1910329156540847, -0.1425238986096732, 0.08739871317730023, 0.059057204201922155, 0.0791856316101392, -0.15094903758870898, 0.1495604452643062, -0.056511679636785404, 0.16021847924782653, -0.15276625979524316, -0.11947441184265392, -0.1461429179474722, 0.06478853062255664, -0.02380749403781603, 0.09048805372747645, 0.1309164945072798, -0.09182825390214501, -0.03259055055494765, 0.38939622308132815, -0.04547668411004033, 0.1520123996593979, 0.10041227816650514, -0.1879644024217229, -0.21881262311094513, 0.13079574531378496, 0.19226875002077373, 0.1264870383657693, -0.24523249913263395, -0.002395930590455975, -0.011362728461187615, 0.2709209839813411, 0.02534844205463619, 0.05772684172863204, 0.32327836354032913, -0.018161508751761042, -0.018375834806565863, 0.0830707105420781, -0.32523443376458394, 0.05408837003214808, -0.26270981665093746, -0.031868786295336994, -0.16404369950629352, 0.11407261141942124, -0.10135044186747845, -0.0728327265356568, 0.3208931068565403, 0.08077058844919724, 0.2086301831760067, 0.05740083192653033, 0.27639402001259034, 0.03702574987958573, 0.13526427729076215, 0.12563720179376392, 0.421565379774763, 0.14113253581055094, 0.1539425664356376, -0.09204700259440134, -0.009101772542226683, 0.0564820884250816] |
1,803.03064 | QREME - Quality Requirements Management Model for Supporting
Decision-Making | [Context and motivation] Quality requirements (QRs) are inherently diffi-cult
to manage as they are often subjective, context-dependent and hard to fully
grasp by various stakeholders. Furthermore, there are many sources that can
provide input on important QRs and suitable levels. Responding timely to
customer needs and realizing them in product portfolio and product scope
decisions remain the main challenge. [Question/problem] Data-driven
methodologies based on product usage data analysis gain popularity and enable
new (bottom-up, feedback-driven) ways of planning and evaluating QRs in product
development. Can these be effi-ciently combined with established top-down,
forward-driven management of QRs? [Principal idea / Results] We propose a model
for how to handle decisions about QRs at a strategic and operational level,
encompassing product deci-sions as well as business intelligence and usage
data. We inferred the model from an extensive empirical investigation of five
years of decision making history at a large B2C company. We illustrate the
model by assessing two in-dustrial case studies from different domains.
[Contribution] We believe that utilizing the right approach in the right
situa-tion will be key for handling QRs, as both different groups of QRs and
do-mains have their special characteristics.
| cs.SE | context and motivation quality requirements qrs are inherently difficult to manage as they are often subjective contextdependent and hard to fully grasp by various stakeholders furthermore there are many sources that can provide input on important qrs and suitable levels responding timely to customer needs and realizing them in product portfolio and product scope decisions remain the main challenge questionproblem datadriven methodologies based on product usage data analysis gain popularity and enable new bottomup feedbackdriven ways of planning and evaluating qrs in product development can these be efficiently combined with established topdown forwarddriven management of qrs principal idea results we propose a model for how to handle decisions about qrs at a strategic and operational level encompassing product decisions as well as business intelligence and usage data we inferred the model from an extensive empirical investigation of five years of decision making history at a large b2c company we illustrate the model by assessing two industrial case studies from different domains contribution we believe that utilizing the right approach in the right situation will be key for handling qrs as both different groups of qrs and domains have their special characteristics | [['context', 'and', 'motivation', 'quality', 'requirements', 'qrs', 'are', 'inherently', 'difficult', 'to', 'manage', 'as', 'they', 'are', 'often', 'subjective', 'contextdependent', 'and', 'hard', 'to', 'fully', 'grasp', 'by', 'various', 'stakeholders', 'furthermore', 'there', 'are', 'many', 'sources', 'that', 'can', 'provide', 'input', 'on', 'important', 'qrs', 'and', 'suitable', 'levels', 'responding', 'timely', 'to', 'customer', 'needs', 'and', 'realizing', 'them', 'in', 'product', 'portfolio', 'and', 'product', 'scope', 'decisions', 'remain', 'the', 'main', 'challenge', 'questionproblem', 'datadriven', 'methodologies', 'based', 'on', 'product', 'usage', 'data', 'analysis', 'gain', 'popularity', 'and', 'enable', 'new', 'bottomup', 'feedbackdriven', 'ways', 'of', 'planning', 'and', 'evaluating', 'qrs', 'in', 'product', 'development', 'can', 'these', 'be', 'efficiently', 'combined', 'with', 'established', 'topdown', 'forwarddriven', 'management', 'of', 'qrs', 'principal', 'idea', 'results', 'we', 'propose', 'a', 'model', 'for', 'how', 'to', 'handle', 'decisions', 'about', 'qrs', 'at', 'a', 'strategic', 'and', 'operational', 'level', 'encompassing', 'product', 'decisions', 'as', 'well', 'as', 'business', 'intelligence', 'and', 'usage', 'data', 'we', 'inferred', 'the', 'model', 'from', 'an', 'extensive', 'empirical', 'investigation', 'of', 'five', 'years', 'of', 'decision', 'making', 'history', 'at', 'a', 'large', 'b2c', 'company', 'we', 'illustrate', 'the', 'model', 'by', 'assessing', 'two', 'industrial', 'case', 'studies', 'from', 'different', 'domains', 'contribution', 'we', 'believe', 'that', 'utilizing', 'the', 'right', 'approach', 'in', 'the', 'right', 'situation', 'will', 'be', 'key', 'for', 'handling', 'qrs', 'as', 'both', 'different', 'groups', 'of', 'qrs', 'and', 'domains', 'have', 'their', 'special', 'characteristics']] | [-0.04782084444488742, 0.053040813268116355, -0.04588996589085773, 0.09649300584324488, -0.12194554326369574, -0.1409895368140975, 0.062437876451172325, 0.4560442580204261, -0.25318771534427803, -0.340792404854131, 0.15980391534302676, -0.24828430982429142, -0.16420982840814088, 0.2070838652685971, -0.13044907843792125, 0.04441987354014265, 0.06971758708333302, 0.0065348296103030935, 0.013274172183101703, -0.24735729025039627, 0.31749358075719913, 0.05605439088111253, 0.3481597439533001, 0.04818012838276397, 0.049015946730995845, 0.008443810217278568, -0.08279499006947796, 0.0014920386730840332, -0.06574893563681, 0.17491040199651922, 0.3830084766800466, 0.2208803965293459, 0.33915591773233916, -0.47359754373564533, -0.14984134465186416, 0.061023820840560614, 0.14592681736317709, 0.037082304684966066, -0.007061869325728989, -0.29747684058537216, 0.07641353098381506, -0.2177362275824539, -0.06084653859173781, -0.15451094794246417, -0.007097693250857686, -0.006757248147684885, -0.25002060354393174, -0.006424555407935067, 0.016843474209676253, 0.06104350775284202, -0.06291735053405557, -0.13112952707727488, 0.014501909994348687, 0.22171953277368295, 0.08761293845140915, -0.022838436074610065, 0.16754064606809008, -0.1299343301951395, -0.1720822136095529, 0.4012032287636478, 0.014843158301358161, -0.17316166954605203, 0.21745134361799023, -0.07018591307079125, -0.16385945597124335, 0.06560649695280804, 0.20821718942668094, 0.08111991742258205, -0.16425507563705508, 0.014069172901125918, 0.0436470485488443, 0.14696581104255624, 0.05353040957186175, 0.037562009399239045, 0.22786995845258629, 0.21070713863070858, 0.0430456513682944, 0.1004936879917391, -0.024006249139385642, -0.1082346503022372, -0.2443917060699804, -0.1365750552213285, -0.1103019115907189, 0.029643540227277155, -0.09705403808452262, -0.11882589889144966, 0.382062216247677, 0.1939856737778571, 0.14576071892668935, 0.03499232209655211, 0.34269216290773136, 0.0687129280992514, 0.06205320862538524, 0.03071604931825086, 0.14065787704220337, 0.020722057964456708, 0.13129606222010856, -0.12498424810014273, 0.1270751975746335, -0.02235266182228531] |
1,803.03065 | Leptonic D_s decays in two-flavour lattice QCD | We report on a two-flavour lattice QCD study of the D_s and D_s^* leptonic
decays parameterized by the decay constants f_{D_s} and f_{D_s^*}. As the
phenomenology in the D_s sector seems very promising in the next years with the
experiments LHCb and Belle II, it is worth putting a big effort in lattice
computations regarding its non-perturbative QCD contributions. Before examining
more challenging processes such as hadron-hadron transitions, a natural first
step is to address some basic aspects in the context of leptonic decays, where
systematic uncertainties from excited state contaminations and cut-off effects
in the computation of charmed meson decay matrix elements can be investigated
in a more straightforward setting.
| hep-lat | we report on a twoflavour lattice qcd study of the d_s and d_s leptonic decays parameterized by the decay constants f_d_s and f_d_s as the phenomenology in the d_s sector seems very promising in the next years with the experiments lhcb and belle ii it is worth putting a big effort in lattice computations regarding its nonperturbative qcd contributions before examining more challenging processes such as hadronhadron transitions a natural first step is to address some basic aspects in the context of leptonic decays where systematic uncertainties from excited state contaminations and cutoff effects in the computation of charmed meson decay matrix elements can be investigated in a more straightforward setting | [['we', 'report', 'on', 'a', 'twoflavour', 'lattice', 'qcd', 'study', 'of', 'the', 'd_s', 'and', 'd_s', 'leptonic', 'decays', 'parameterized', 'by', 'the', 'decay', 'constants', 'f_d_s', 'and', 'f_d_s', 'as', 'the', 'phenomenology', 'in', 'the', 'd_s', 'sector', 'seems', 'very', 'promising', 'in', 'the', 'next', 'years', 'with', 'the', 'experiments', 'lhcb', 'and', 'belle', 'ii', 'it', 'is', 'worth', 'putting', 'a', 'big', 'effort', 'in', 'lattice', 'computations', 'regarding', 'its', 'nonperturbative', 'qcd', 'contributions', 'before', 'examining', 'more', 'challenging', 'processes', 'such', 'as', 'hadronhadron', 'transitions', 'a', 'natural', 'first', 'step', 'is', 'to', 'address', 'some', 'basic', 'aspects', 'in', 'the', 'context', 'of', 'leptonic', 'decays', 'where', 'systematic', 'uncertainties', 'from', 'excited', 'state', 'contaminations', 'and', 'cutoff', 'effects', 'in', 'the', 'computation', 'of', 'charmed', 'meson', 'decay', 'matrix', 'elements', 'can', 'be', 'investigated', 'in', 'a', 'more', 'straightforward', 'setting']] | [-0.0365825188199377, 0.23533686449298183, -0.06267806330511162, 0.133062548192348, -0.08024072903418192, -0.12711534957476966, 0.10439975103069735, 0.3341061325643111, -0.2238165739302834, -0.19370396622364316, 0.05574501479287875, -0.3432782528468886, -0.046772790101549784, 0.1135756966095787, 0.0589970959990751, 0.13417407412969232, 0.1258156751618125, -0.03612703027891683, -0.09416688080071597, -0.21117550186678632, 0.27276489376887547, 0.05476054405743206, 0.17878241184469615, 0.14792819133422733, -0.04913342762256025, -0.04183004550144982, -0.06867181338990729, -0.06736836012092058, -0.15184698211918543, 0.06867158649329869, 0.23408065164075778, 0.10580678567340648, 0.18628509536905735, -0.37739030818815705, -0.13421868451719954, 0.12255243422161485, 0.19000035526046344, 0.12216933320044657, -0.024395184719626716, -0.3502696493162295, 0.0778440632647625, -0.16969702032033926, -0.09681389147315074, -0.13382389834717018, 0.04404163691173266, -0.1286864928368412, -0.29252569036776416, 0.07076810362228604, -0.08830419939372118, 0.043716405585475335, 0.017180207381570327, -0.2399762212256859, 0.06375341534379635, 0.07669343842143142, 0.15270216848384244, 0.06626364857017121, 0.14200980569076566, -0.16520096344856527, -0.1995741491885604, 0.4838714994120974, -0.04277377079350052, -0.15519624327619871, 0.10558971708959287, -0.16797203723936938, -0.2013383956944889, 0.10494568516072389, 0.19587435560649144, 0.08224666988721478, -0.17298667621589056, 0.14504408156541218, -0.012459097920942146, 0.15696084947820316, 0.04880685222687552, 0.1014021224182871, 0.17349089659867925, 0.25655247935572184, -0.04537386403561713, 0.07555357294538906, -0.0038720985920680266, -0.09005486961823327, -0.3936876472052153, -0.10399115809684133, -0.1261141897800068, 0.11059424615263738, -0.04350069859893657, -0.07884252756448076, 0.3922375559278235, 0.05109889660584363, 0.27232006574385204, -0.012117289602420889, 0.3233468005148409, 0.04224036685778416, 0.03944947389961296, 0.06505391805491469, 0.3017816755782733, 0.19326271047303872, 0.1527196296348094, -0.29562510913951107, 0.03400212055835705, 0.05408493551081634] |
1,803.03066 | The complex moment problem: determinacy and extendibility | Complex moment sequences are exactly those which admit positive definite
extensions on the integer lattice points of the upper diagonal half-plane. Here
we prove that the aforesaid extension is unique provided the complex moment
sequence is determinate and its only representing measure has no atom at $0$.
The question of converting the relation is posed as an open problem. A partial
solution to this problem is established when at least one of representing
measures is supported in a plane algebraic curve whose intersection with every
straight line passing through $0$ is at most one point set. Further study
concerns representing measures whose supports are Zariski dense in $\mathbb C$
as well as complex moment sequences which are constant on a family of parallel
"Diophantine lines". All this is supported by a bunch of illustrative examples.
| math.FA | complex moment sequences are exactly those which admit positive definite extensions on the integer lattice points of the upper diagonal halfplane here we prove that the aforesaid extension is unique provided the complex moment sequence is determinate and its only representing measure has no atom at 0 the question of converting the relation is posed as an open problem a partial solution to this problem is established when at least one of representing measures is supported in a plane algebraic curve whose intersection with every straight line passing through 0 is at most one point set further study concerns representing measures whose supports are zariski dense in mathbb c as well as complex moment sequences which are constant on a family of parallel diophantine lines all this is supported by a bunch of illustrative examples | [['complex', 'moment', 'sequences', 'are', 'exactly', 'those', 'which', 'admit', 'positive', 'definite', 'extensions', 'on', 'the', 'integer', 'lattice', 'points', 'of', 'the', 'upper', 'diagonal', 'halfplane', 'here', 'we', 'prove', 'that', 'the', 'aforesaid', 'extension', 'is', 'unique', 'provided', 'the', 'complex', 'moment', 'sequence', 'is', 'determinate', 'and', 'its', 'only', 'representing', 'measure', 'has', 'no', 'atom', 'at', '0', 'the', 'question', 'of', 'converting', 'the', 'relation', 'is', 'posed', 'as', 'an', 'open', 'problem', 'a', 'partial', 'solution', 'to', 'this', 'problem', 'is', 'established', 'when', 'at', 'least', 'one', 'of', 'representing', 'measures', 'is', 'supported', 'in', 'a', 'plane', 'algebraic', 'curve', 'whose', 'intersection', 'with', 'every', 'straight', 'line', 'passing', 'through', '0', 'is', 'at', 'most', 'one', 'point', 'set', 'further', 'study', 'concerns', 'representing', 'measures', 'whose', 'supports', 'are', 'zariski', 'dense', 'in', 'mathbb', 'c', 'as', 'well', 'as', 'complex', 'moment', 'sequences', 'which', 'are', 'constant', 'on', 'a', 'family', 'of', 'parallel', 'diophantine', 'lines', 'all', 'this', 'is', 'supported', 'by', 'a', 'bunch', 'of', 'illustrative', 'examples']] | [-0.18568628559371939, 0.07596509844782608, -0.016508079020099507, 0.04643228269026925, -0.07822067794493504, -0.15203854262880567, 0.013755473820923793, 0.37266353697826465, -0.304897160143419, -0.21280668584836854, 0.15260652429726043, -0.3250448735775771, -0.10203435931578968, 0.2034839928219164, -0.03152949831586469, 0.034844541678601806, 0.033419097377056325, 0.10091233307202518, -0.042928578502809005, -0.2413759500340179, 0.3666131946603181, -0.04088768257276604, 0.1884134690363512, 0.05702260422554833, 0.12446356036320881, -0.02708409996703267, 0.009690903510070509, 0.025490287612019866, -0.1008120357251351, 0.10861601582771443, 0.24643146961203052, 0.143647984513599, 0.24857438811687407, -0.357395599791737, -0.1642165094545042, 0.14759312548364203, 0.14969230536716405, 0.045209578740307024, -0.02849194357447602, -0.24291282998466934, 0.13484615261528504, -0.05639325391621915, -0.1809252210582296, -0.046090732583845107, 0.07934629081800167, 0.04011033275164664, -0.2573131543066767, -0.0018986564267564703, 0.09845545376840703, 0.1194180482478933, -0.03347438620317175, -0.12248284363412057, -0.009680646875252327, 0.08746333270338019, 0.022084985364711394, 0.12082698233166916, 0.06126617896844874, -0.04941711700004008, -0.10626802494128545, 0.38991287361821847, -0.03157710278130792, -0.2558358631890129, 0.15367199560558353, -0.14677154110848076, -0.1363735083236221, 0.14354072097274992, 0.09334464137683864, 0.13699399344968022, -0.09045853433942991, 0.16210593908671633, -0.13641664333365583, 0.13844008688422577, 0.12378036847889975, -0.026212256019762546, 0.22773341775216438, 0.11347328761627001, 0.1164582394408407, 0.14368725232995563, -0.00358607099150066, -0.10412532309139216, -0.32822210957054737, -0.16786626630842133, -0.20627723747951746, 0.09619336472306815, -0.07572049892225079, -0.2312103722796396, 0.36854163057826184, 0.0437040815440317, 0.22474209106768722, 0.04973694214562851, 0.25853885910301294, 0.162350926424174, -0.01273270955964647, 0.0764420264262568, 0.11881925490926261, 0.14703520709924675, 0.0006828952028795524, -0.14773950907229275, 0.06066115619269786, 0.11374843244751294] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.