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.03767
|
Multi-Agent Submodular Optimization
|
Recent years have seen many algorithmic advances in the area of submodular
optimization: (SO) $\min/\max~f(S): S \in \mathcal{F}$, where $\mathcal{F}$ is
a given family of feasible sets over a ground set $V$ and $f:2^V \rightarrow
\mathbb{R}$ is submodular. This progress has been coupled with a wealth of new
applications for these models. Our focus is on a more general class of
\emph{multi-agent submodular optimization} (MASO) which was introduced by Goel
et al. in the minimization setting: $\min \sum_i f_i(S_i): S_1 \uplus S_2
\uplus \cdots \uplus S_k \in \mathcal{F}$. Here we use $\uplus$ to denote
disjoint union and hence this model is attractive where resources are being
allocated across $k$ agents, each with its own submodular cost function
$f_i()$. In this paper we explore the extent to which the approximability of
the multi-agent problems are linked to their single-agent {\em primitives},
referred to informally as the {\em multi-agent gap}.
We present different reductions that transform a multi-agent problem into a
single-agent one. For maximization we show that (MASO) admits an
$O(\alpha)$-approximation whenever (SO) admits an $\alpha$-approximation over
the multilinear formulation, and thus substantially expanding the family of
tractable models. We also discuss several family classes (such as spanning
trees, matroids, and $p$-systems) that have a provable multi-agent gap of 1. In
the minimization setting we show that (MASO) has an $O(\alpha \cdot \min \{k,
\log^2 (n)\})$-approximation whenever (SO) admits an $\alpha$-approximation
over the convex formulation. In addition, we discuss the class of "bounded
blocker" families where there is a provably tight O$(\log n)$ gap between
(MASO) and (SO).
|
cs.DS
|
recent years have seen many algorithmic advances in the area of submodular optimization so minmaxfs s in mathcalf where mathcalf is a given family of feasible sets over a ground set v and f2v rightarrow mathbbr is submodular this progress has been coupled with a wealth of new applications for these models our focus is on a more general class of emphmultiagent submodular optimization maso which was introduced by goel et al in the minimization setting min sum_i f_is_i s_1 uplus s_2 uplus cdots uplus s_k in mathcalf here we use uplus to denote disjoint union and hence this model is attractive where resources are being allocated across k agents each with its own submodular cost function f_i in this paper we explore the extent to which the approximability of the multiagent problems are linked to their singleagent em primitives referred to informally as the em multiagent gap we present different reductions that transform a multiagent problem into a singleagent one for maximization we show that maso admits an oalphaapproximation whenever so admits an alphaapproximation over the multilinear formulation and thus substantially expanding the family of tractable models we also discuss several family classes such as spanning trees matroids and psystems that have a provable multiagent gap of 1 in the minimization setting we show that maso has an oalpha cdot min k log2 napproximation whenever so admits an alphaapproximation over the convex formulation in addition we discuss the class of bounded blocker families where there is a provably tight olog n gap between maso and so
|
[['recent', 'years', 'have', 'seen', 'many', 'algorithmic', 'advances', 'in', 'the', 'area', 'of', 'submodular', 'optimization', 'so', 'minmaxfs', 's', 'in', 'mathcalf', 'where', 'mathcalf', 'is', 'a', 'given', 'family', 'of', 'feasible', 'sets', 'over', 'a', 'ground', 'set', 'v', 'and', 'f2v', 'rightarrow', 'mathbbr', 'is', 'submodular', 'this', 'progress', 'has', 'been', 'coupled', 'with', 'a', 'wealth', 'of', 'new', 'applications', 'for', 'these', 'models', 'our', 'focus', 'is', 'on', 'a', 'more', 'general', 'class', 'of', 'emphmultiagent', 'submodular', 'optimization', 'maso', 'which', 'was', 'introduced', 'by', 'goel', 'et', 'al', 'in', 'the', 'minimization', 'setting', 'min', 'sum_i', 'f_is_i', 's_1', 'uplus', 's_2', 'uplus', 'cdots', 'uplus', 's_k', 'in', 'mathcalf', 'here', 'we', 'use', 'uplus', 'to', 'denote', 'disjoint', 'union', 'and', 'hence', 'this', 'model', 'is', 'attractive', 'where', 'resources', 'are', 'being', 'allocated', 'across', 'k', 'agents', 'each', 'with', 'its', 'own', 'submodular', 'cost', 'function', 'f_i', 'in', 'this', 'paper', 'we', 'explore', 'the', 'extent', 'to', 'which', 'the', 'approximability', 'of', 'the', 'multiagent', 'problems', 'are', 'linked', 'to', 'their', 'singleagent', 'em', 'primitives', 'referred', 'to', 'informally', 'as', 'the', 'em', 'multiagent', 'gap', 'we', 'present', 'different', 'reductions', 'that', 'transform', 'a', 'multiagent', 'problem', 'into', 'a', 'singleagent', 'one', 'for', 'maximization', 'we', 'show', 'that', 'maso', 'admits', 'an', 'oalphaapproximation', 'whenever', 'so', 'admits', 'an', 'alphaapproximation', 'over', 'the', 'multilinear', 'formulation', 'and', 'thus', 'substantially', 'expanding', 'the', 'family', 'of', 'tractable', 'models', 'we', 'also', 'discuss', 'several', 'family', 'classes', 'such', 'as', 'spanning', 'trees', 'matroids', 'and', 'psystems', 'that', 'have', 'a', 'provable', 'multiagent', 'gap', 'of', '1', 'in', 'the', 'minimization', 'setting', 'we', 'show', 'that', 'maso', 'has', 'an', 'oalpha', 'cdot', 'min', 'k', 'log2', 'napproximation', 'whenever', 'so', 'admits', 'an', 'alphaapproximation', 'over', 'the', 'convex', 'formulation', 'in', 'addition', 'we', 'discuss', 'the', 'class', 'of', 'bounded', 'blocker', 'families', 'where', 'there', 'is', 'a', 'provably', 'tight', 'olog', 'n', 'gap', 'between', 'maso', 'and', 'so']]
|
[-0.15621939917847794, 0.06514093794435696, -0.01699622595137935, 0.015776113676010325, -0.08848626476348094, -0.15999323674275176, 0.03395732060551511, 0.41423581568929163, -0.33508339522336517, -0.2656053716828494, 0.06753248816564046, -0.2858434760806854, -0.1556506975703015, 0.1534761971943154, -0.13310726935029207, 0.05372291660141531, 0.04322191481312862, 0.034622933557293865, -0.04114990884722523, -0.2835656140669591, 0.2685843404795903, -0.04442227837029594, 0.19478760816602278, 0.042982656285976584, 0.11077298142711665, 0.022810303472652442, 0.05784001848025417, 0.041703475787849144, -0.20083272954119596, 0.11157118963223069, 0.3125167115781102, 0.23954049245410197, 0.364760335864271, -0.36911130851878243, -0.17242775505717858, 0.21644511984167952, 0.14545822746153522, -0.0031112641845107364, 0.006347559410110098, -0.22548886231908744, 0.08491512815000511, -0.18261565636795588, -0.029553961413710014, -0.04782266418952053, 0.09180734899969911, 0.011357902659640717, -0.31829667131631845, -0.025118347219759304, 0.10552019525223628, 0.021984879116126496, -0.02691433065673962, -0.18393942176800573, 0.012795116343782118, 0.03387167905880646, 0.0028878527287607312, 0.12918275852941655, 0.03412739350276414, -0.08111917068298331, -0.15306618533248134, 0.35682122098496405, -0.02422148488846648, -0.18574251893911467, 0.1280739397738173, -0.048546500762212716, -0.2079090635612489, 0.10785511079273764, 0.15925040597417695, 0.19746446949080104, -0.12056783569439244, 0.19280368428591735, -0.16682603368958968, 0.1351506931513084, 0.08841636970734938, 0.054332211952087775, 0.1097190978020253, 0.15180251083020194, 0.16703276852630777, 0.1702117473331074, 0.027511495404339326, -0.09067277194266742, -0.27451173665292794, -0.11352012433542358, -0.1769226571368311, 0.0723301608643675, -0.07094578936035982, -0.14735493697722998, 0.35216961949032993, 0.09850577185466046, 0.1866945894793957, 0.15834408679140985, 0.2398486432698537, 0.09073281051917048, 0.025730551633682, 0.1672154440403743, 0.15301027719351085, 0.08979764265623018, 0.017061584752895997, -0.16343024515145615, 0.06414613649805846, 0.07691733226226781]
|
1,803.03768
|
Visco-Energetic solutions to some rate-independent systems in damage,
delamination, and plasticity
|
This paper revolves around a newly introduced weak solvability concept for
rate-independent systems, alternative to the notions of Energetic and Balanced
Viscosity solutions. Visco-Energetic solutions have been recently obtained by
passing to the time-continuous limit in a time-incremental scheme, akin to that
for Energetic solutions, but perturbed by a `viscous' correction term, as in
the case of Balanced Viscosity solutions. However, for Visco-Energetic
solutions this viscous correction is tuned by a fixed parameter. The resulting
solution notion turns out to describe a kind of evolution in between Energetic
and Balanced Viscosity evolution.
In this paper we aim to investigate the application of Visco-Energetic
solutions to the paradigmatic example of perfect plasticity, and to nonsmooth
rate-independent processes in solid mechanics such as damage and plasticity at
finite strains. With the limit passage from adhesive contact to brittle
delamination, we also provide a first result of Evolutionary Gamma-convergence
for Visco-Energetic solutions. The analysis of these applications reveals the
wide applicability of this solution concept and confirms its intermediate
character.
|
math.AP
|
this paper revolves around a newly introduced weak solvability concept for rateindependent systems alternative to the notions of energetic and balanced viscosity solutions viscoenergetic solutions have been recently obtained by passing to the timecontinuous limit in a timeincremental scheme akin to that for energetic solutions but perturbed by a viscous correction term as in the case of balanced viscosity solutions however for viscoenergetic solutions this viscous correction is tuned by a fixed parameter the resulting solution notion turns out to describe a kind of evolution in between energetic and balanced viscosity evolution in this paper we aim to investigate the application of viscoenergetic solutions to the paradigmatic example of perfect plasticity and to nonsmooth rateindependent processes in solid mechanics such as damage and plasticity at finite strains with the limit passage from adhesive contact to brittle delamination we also provide a first result of evolutionary gammaconvergence for viscoenergetic solutions the analysis of these applications reveals the wide applicability of this solution concept and confirms its intermediate character
|
[['this', 'paper', 'revolves', 'around', 'a', 'newly', 'introduced', 'weak', 'solvability', 'concept', 'for', 'rateindependent', 'systems', 'alternative', 'to', 'the', 'notions', 'of', 'energetic', 'and', 'balanced', 'viscosity', 'solutions', 'viscoenergetic', 'solutions', 'have', 'been', 'recently', 'obtained', 'by', 'passing', 'to', 'the', 'timecontinuous', 'limit', 'in', 'a', 'timeincremental', 'scheme', 'akin', 'to', 'that', 'for', 'energetic', 'solutions', 'but', 'perturbed', 'by', 'a', 'viscous', 'correction', 'term', 'as', 'in', 'the', 'case', 'of', 'balanced', 'viscosity', 'solutions', 'however', 'for', 'viscoenergetic', 'solutions', 'this', 'viscous', 'correction', 'is', 'tuned', 'by', 'a', 'fixed', 'parameter', 'the', 'resulting', 'solution', 'notion', 'turns', 'out', 'to', 'describe', 'a', 'kind', 'of', 'evolution', 'in', 'between', 'energetic', 'and', 'balanced', 'viscosity', 'evolution', 'in', 'this', 'paper', 'we', 'aim', 'to', 'investigate', 'the', 'application', 'of', 'viscoenergetic', 'solutions', 'to', 'the', 'paradigmatic', 'example', 'of', 'perfect', 'plasticity', 'and', 'to', 'nonsmooth', 'rateindependent', 'processes', 'in', 'solid', 'mechanics', 'such', 'as', 'damage', 'and', 'plasticity', 'at', 'finite', 'strains', 'with', 'the', 'limit', 'passage', 'from', 'adhesive', 'contact', 'to', 'brittle', 'delamination', 'we', 'also', 'provide', 'a', 'first', 'result', 'of', 'evolutionary', 'gammaconvergence', 'for', 'viscoenergetic', 'solutions', 'the', 'analysis', 'of', 'these', 'applications', 'reveals', 'the', 'wide', 'applicability', 'of', 'this', 'solution', 'concept', 'and', 'confirms', 'its', 'intermediate', 'character']]
|
[-0.12252874158930681, 0.0743965166035348, -0.10356457563518674, 0.05540338417718711, -0.0640406854531566, -0.11618882018660089, 0.04410041835923083, 0.29341220863520384, -0.31186688624456255, -0.26139732258963194, 0.11044535516485193, -0.25414581809326736, -0.18345395053603022, 0.14973313241505515, -0.0761217739973998, 0.10399145308099854, 0.06810947399987967, -0.032396959373553164, -0.03883966161802545, -0.18178338565846938, 0.33116787276370174, 0.050892267230491034, 0.24732626591039497, 0.06066099597241529, 0.11869667790841289, -0.018279473113264152, 0.016516913585978264, 0.08379844958687614, -0.21341398974182957, 0.06572812928993835, 0.26370516145033035, 0.0319401090030564, 0.30336096960895076, -0.4137826579550426, -0.24936232443924708, 0.08225998421155005, 0.12594051847602436, 0.12326636037114494, -0.037302336714113364, -0.2338413477158676, 0.10036010667890824, -0.19590709468874032, -0.18601159654385782, -0.0866974235197228, 0.0517548796536769, 0.06622093926186667, -0.2455834683845054, 0.09499988190026, 0.110318724450817, 0.02390923240629142, -0.13456094879475786, -0.039377051126769556, 0.0008772282211478063, 0.06022056145732944, 0.09161670895120475, -0.010107035043894754, 0.0888429137928311, -0.14807586808769801, -0.08257600115221775, 0.38404749160420576, -0.06902980406958231, -0.2213533839077025, 0.2352372372329854, -0.07006267029345928, -0.11978434786635513, 0.1463091504386442, 0.16144006359976476, 0.14465019296754353, -0.17884999914596716, 0.05496081429175352, 0.024982040794008595, 0.11072245781368459, 0.09891355257274996, -0.007661897722564772, 0.17500715633898883, 0.21252229718720084, 0.06746266457087689, 0.1912332720006119, -0.01372609657537287, -0.1445288307418277, -0.29825426146254214, -0.1586661052884545, -0.14146186236688074, 0.10167458505177324, -0.08819299988951576, -0.21315911277280952, 0.3524768532492863, 0.12289290230381052, 0.14287121354708235, 0.056363362962558505, 0.2336402106765256, 0.1179280437927827, 0.013077849541751747, 0.0503009913913058, 0.29773694296886105, 0.1615227033024442, 0.15090878584985426, -0.21712619370870115, 0.07034381601714089, 0.12694553704095815]
|
1,803.03769
|
A Minimax Surrogate Loss Approach to Conditional Difference Estimation
|
We present a new machine learning approach to estimate personalized treatment
effects in the classical potential outcomes framework with binary outcomes. To
overcome the problem that both treatment and control outcomes for the same unit
are required for supervised learning, we propose surrogate loss functions that
incorporate both treatment and control data. The new surrogates yield tighter
bounds than the sum of losses for treatment and control groups. A specific
choice of loss function, namely a type of hinge loss, yields a minimax support
vector machine formulation. The resulting optimization problem requires the
solution to only a single convex optimization problem, incorporating both
treatment and control units, and it enables the kernel trick to be used to
handle nonlinear (also non-parametric) estimation. Statistical learning bounds
are also presented for the framework, and experimental results.
|
stat.ML cs.LG
|
we present a new machine learning approach to estimate personalized treatment effects in the classical potential outcomes framework with binary outcomes to overcome the problem that both treatment and control outcomes for the same unit are required for supervised learning we propose surrogate loss functions that incorporate both treatment and control data the new surrogates yield tighter bounds than the sum of losses for treatment and control groups a specific choice of loss function namely a type of hinge loss yields a minimax support vector machine formulation the resulting optimization problem requires the solution to only a single convex optimization problem incorporating both treatment and control units and it enables the kernel trick to be used to handle nonlinear also nonparametric estimation statistical learning bounds are also presented for the framework and experimental results
|
[['we', 'present', 'a', 'new', 'machine', 'learning', 'approach', 'to', 'estimate', 'personalized', 'treatment', 'effects', 'in', 'the', 'classical', 'potential', 'outcomes', 'framework', 'with', 'binary', 'outcomes', 'to', 'overcome', 'the', 'problem', 'that', 'both', 'treatment', 'and', 'control', 'outcomes', 'for', 'the', 'same', 'unit', 'are', 'required', 'for', 'supervised', 'learning', 'we', 'propose', 'surrogate', 'loss', 'functions', 'that', 'incorporate', 'both', 'treatment', 'and', 'control', 'data', 'the', 'new', 'surrogates', 'yield', 'tighter', 'bounds', 'than', 'the', 'sum', 'of', 'losses', 'for', 'treatment', 'and', 'control', 'groups', 'a', 'specific', 'choice', 'of', 'loss', 'function', 'namely', 'a', 'type', 'of', 'hinge', 'loss', 'yields', 'a', 'minimax', 'support', 'vector', 'machine', 'formulation', 'the', 'resulting', 'optimization', 'problem', 'requires', 'the', 'solution', 'to', 'only', 'a', 'single', 'convex', 'optimization', 'problem', 'incorporating', 'both', 'treatment', 'and', 'control', 'units', 'and', 'it', 'enables', 'the', 'kernel', 'trick', 'to', 'be', 'used', 'to', 'handle', 'nonlinear', 'also', 'nonparametric', 'estimation', 'statistical', 'learning', 'bounds', 'are', 'also', 'presented', 'for', 'the', 'framework', 'and', 'experimental', 'results']]
|
[-0.01258810703753869, 0.005551982021181664, -0.10212599393675353, 0.10689521377033957, -0.14317253380735864, -0.20854076022740953, 0.09376911406488672, 0.3980471045612844, -0.2894291238053076, -0.3151308034352069, 0.10285697051640183, -0.24450884243723617, -0.17432545479117725, 0.23180209687535666, -0.12908328145242004, 0.14383629140958412, 0.11000517932628628, -0.013661584524965999, -0.0960136862774032, -0.2672824501581212, 0.2930058951232471, 0.02232111718005209, 0.3101937134555583, 0.04997380748877663, 0.13055761797621207, 0.09743599868344782, -0.008762309876784904, 0.012157097834148515, -0.10741734717950423, 0.1874189577942867, 0.279952334490285, 0.2202079856052383, 0.39043067205252485, -0.39188633071703477, -0.2656680830170526, 0.1330685830404009, 0.08578419276693863, 0.10492700090242633, -0.06719591262152613, -0.20874105677192809, 0.03731492463388105, -0.17940446538086147, -0.03692398771101525, -0.1533667895310461, -0.07873832648220375, -0.021168408965789226, -0.3898263725368723, 0.08244428949373246, 0.05502555099899756, 0.00032768130246827853, -0.1367790321107092, -0.14252341080999084, 0.06897109629822645, 0.1153165660277287, 0.04126995869342293, 0.04452024059328459, 0.144533737736351, -0.14436446799924457, -0.15610228706526555, 0.3514375542568515, -0.025778329566858688, -0.2903544549246444, 0.1709952210145655, -0.05199832608575808, -0.10715629027916619, 0.08516866853981932, 0.2815154684505968, 0.14897106298064786, -0.19203220583053668, -0.001283627461273668, 0.015225126495352015, 0.13240493798572847, -0.011916319846606521, 0.01396898812700824, 0.12434730282637166, 0.18353975097363842, 0.1003735734297722, 0.136507465643982, -0.075282939583534, -0.1149084388292325, -0.30312543265076713, -0.11480536166085069, -0.13868275528891819, -0.0349046041938796, -0.1081467259932855, -0.1776094980391938, 0.3534696034934205, 0.15272606326992114, 0.17794270551096258, 0.14188193986122843, 0.3191710422719036, 0.12898314286217982, 0.08017824587426078, 0.07664522066635927, 0.2089248061850806, 0.12190804161381588, 0.030321222521475892, -0.22555832440944026, 0.1009357327511951, 0.04972931798443254]
|
1,803.0377
|
Continuous solutions of a second order iterative equation
|
In this paper we study the existence of continuous solutions and their
constructions for a second order iterative functional equation, which involves
iterate of the unknown function and a nonlinear term. Imposing Lipschitz
conditions to those given functions, we prove the existence of continuous
solutions on the whole $\mathbb{R}$ by applying the contraction principle. In
the case without Lipschitz conditions we hardly use the contraction principle,
but we construct continuous solutions on $\mathbb{R}$ recursively with a
partition of $\mathbb{R}$.
|
math.CA
|
in this paper we study the existence of continuous solutions and their constructions for a second order iterative functional equation which involves iterate of the unknown function and a nonlinear term imposing lipschitz conditions to those given functions we prove the existence of continuous solutions on the whole mathbbr by applying the contraction principle in the case without lipschitz conditions we hardly use the contraction principle but we construct continuous solutions on mathbbr recursively with a partition of mathbbr
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'existence', 'of', 'continuous', 'solutions', 'and', 'their', 'constructions', 'for', 'a', 'second', 'order', 'iterative', 'functional', 'equation', 'which', 'involves', 'iterate', 'of', 'the', 'unknown', 'function', 'and', 'a', 'nonlinear', 'term', 'imposing', 'lipschitz', 'conditions', 'to', 'those', 'given', 'functions', 'we', 'prove', 'the', 'existence', 'of', 'continuous', 'solutions', 'on', 'the', 'whole', 'mathbbr', 'by', 'applying', 'the', 'contraction', 'principle', 'in', 'the', 'case', 'without', 'lipschitz', 'conditions', 'we', 'hardly', 'use', 'the', 'contraction', 'principle', 'but', 'we', 'construct', 'continuous', 'solutions', 'on', 'mathbbr', 'recursively', 'with', 'a', 'partition', 'of', 'mathbbr']]
|
[-0.13638204836899626, 0.04561159271994441, -0.0743167604396379, 0.044501731981216826, -0.10818435852356915, -0.06229269685506632, 0.053633779209236836, 0.3553219536507997, -0.3123604437642837, -0.18177520283321036, 0.16876337748857898, -0.22540167614204598, -0.16951385397416882, 0.1595137198750354, -0.0467710096412633, 0.10991465724132295, 0.038175184344519164, 0.04355432912471551, -0.14088843135116033, -0.24289176014511363, 0.3954676542006716, -0.09910065360084365, 0.20925721059305757, 0.032002960785610386, 0.16205982527919585, 0.005135786003444957, -0.0074778605610591985, -0.01074925999899831, -0.22250003470225801, 0.09907881965082657, 0.19957031202325715, 0.13169482725530957, 0.3362333656677717, -0.4324821438404578, -0.20297389128540136, 0.20411695162706736, 0.08741453298237882, 0.05995908321052365, -0.04562044586349703, -0.2897235856043717, 0.0808419275533738, -0.11247231775918339, -0.17562877007795474, -0.08165158693902666, -0.017788454197653677, 0.07988319748458511, -0.33913504773208614, 0.07584843217524924, 0.1104782574774721, 0.007313963008124994, -0.1594112818689333, -0.02336592979351931, -0.01731949255365548, 0.06277898333589488, 0.05503711896901361, 0.07357726616584519, 0.07289176783819176, -0.09624519322621577, -0.07228712466415725, 0.3318974343305336, -0.10006640855771123, -0.3065880193268951, 0.16651049402507045, -0.11427231069913582, -0.17282553939030895, 0.07216871576973155, 0.12142522872979694, 0.1946457128005126, -0.1447302981433046, 0.1687241182824644, -0.037689795664546985, 0.13656735054771357, 0.12016307667510796, -0.015804592260642895, 0.08900995968982484, 0.093044661739959, 0.16945401776605581, 0.17204592457111878, 0.03942747084612522, -0.09483897379788134, -0.3877055209743071, -0.12114030081495832, -0.15610085965334614, 0.1038152956509892, -0.10709230589372389, -0.2055885801917013, 0.40205220313436246, 0.1135221365839243, 0.16851278686825233, 0.1534330398920051, 0.23010377668410162, 0.18958479412418755, 0.025464695651390697, 0.046464932045038744, 0.16415326966892316, 0.11683291416980704, 0.0801724701813316, -0.17347977431144718, 0.08121693106603962, 0.17837520198354237]
|
1,803.03771
|
Noether and Abbott-Deser-Tekin conserved quantities in scalar-tensor
theory of gravity both in Jordan and Einstein frames
|
We revisit the thermodynamic aspects of the scalar-tensor theory of gravity
in the Jordan and in the Einstein frame. Examining the {\it missing links} of
this theory carefully, we establish the thermodynamic descriptions from the
conserved currents and potentials by following both the Noether and the
Abbott-Deser-Tekin (ADT) formalism. With the help of conserved Noether current
and potential, we define the thermodynamic quantities, which we show to be {\it
conformally invariant}. Moreover, the defined quantities are shown to fit
nicely in the laws of (the first and the second) black hole thermodynamics
formulated by the Wald's method. We stretch the study of the conformal
equivalence of the physical quantities in these two frames by following the ADT
formalism. Our further study reveals that there is a connection between the ADT
and the Noether conserved quantities, which signifies that the ADT approach
provide the equivalent thermodynamic description in the two frames as obtained
in Noether prescription. Our whole analysis is very general as the conserved
Noether and ADT currents and potentials are formulated {\it off-shell} and the
analysis is exempted from any prior assumption or boundary condition.
|
gr-qc hep-th
|
we revisit the thermodynamic aspects of the scalartensor theory of gravity in the jordan and in the einstein frame examining the it missing links of this theory carefully we establish the thermodynamic descriptions from the conserved currents and potentials by following both the noether and the abbottdesertekin adt formalism with the help of conserved noether current and potential we define the thermodynamic quantities which we show to be it conformally invariant moreover the defined quantities are shown to fit nicely in the laws of the first and the second black hole thermodynamics formulated by the walds method we stretch the study of the conformal equivalence of the physical quantities in these two frames by following the adt formalism our further study reveals that there is a connection between the adt and the noether conserved quantities which signifies that the adt approach provide the equivalent thermodynamic description in the two frames as obtained in noether prescription our whole analysis is very general as the conserved noether and adt currents and potentials are formulated it offshell and the analysis is exempted from any prior assumption or boundary condition
|
[['we', 'revisit', 'the', 'thermodynamic', 'aspects', 'of', 'the', 'scalartensor', 'theory', 'of', 'gravity', 'in', 'the', 'jordan', 'and', 'in', 'the', 'einstein', 'frame', 'examining', 'the', 'it', 'missing', 'links', 'of', 'this', 'theory', 'carefully', 'we', 'establish', 'the', 'thermodynamic', 'descriptions', 'from', 'the', 'conserved', 'currents', 'and', 'potentials', 'by', 'following', 'both', 'the', 'noether', 'and', 'the', 'abbottdesertekin', 'adt', 'formalism', 'with', 'the', 'help', 'of', 'conserved', 'noether', 'current', 'and', 'potential', 'we', 'define', 'the', 'thermodynamic', 'quantities', 'which', 'we', 'show', 'to', 'be', 'it', 'conformally', 'invariant', 'moreover', 'the', 'defined', 'quantities', 'are', 'shown', 'to', 'fit', 'nicely', 'in', 'the', 'laws', 'of', 'the', 'first', 'and', 'the', 'second', 'black', 'hole', 'thermodynamics', 'formulated', 'by', 'the', 'walds', 'method', 'we', 'stretch', 'the', 'study', 'of', 'the', 'conformal', 'equivalence', 'of', 'the', 'physical', 'quantities', 'in', 'these', 'two', 'frames', 'by', 'following', 'the', 'adt', 'formalism', 'our', 'further', 'study', 'reveals', 'that', 'there', 'is', 'a', 'connection', 'between', 'the', 'adt', 'and', 'the', 'noether', 'conserved', 'quantities', 'which', 'signifies', 'that', 'the', 'adt', 'approach', 'provide', 'the', 'equivalent', 'thermodynamic', 'description', 'in', 'the', 'two', 'frames', 'as', 'obtained', 'in', 'noether', 'prescription', 'our', 'whole', 'analysis', 'is', 'very', 'general', 'as', 'the', 'conserved', 'noether', 'and', 'adt', 'currents', 'and', 'potentials', 'are', 'formulated', 'it', 'offshell', 'and', 'the', 'analysis', 'is', 'exempted', 'from', 'any', 'prior', 'assumption', 'or', 'boundary', 'condition']]
|
[-0.14522446332416766, 0.08215475343393101, -0.09570887302497892, 0.11540244974231006, -0.033609623169546486, -0.11663546698838873, 0.011033146488179843, 0.2839810947426945, -0.22904297031251894, -0.281131288009165, 0.04782399838985575, -0.2645546467474071, -0.17551878526911982, 0.11068352309220861, -0.05040186228010283, 0.04549726891902185, 0.0032927172023162086, 0.06021866305641735, -0.11213044853758874, -0.20684904169531598, 0.36101247598567315, 0.037979195688060054, 0.299018556482449, 0.07066478771257705, 0.11187684796099621, 0.014883571462730767, -0.06327513285401848, 0.06805791743650472, -0.1706251772550111, 0.10515638594315337, 0.22108750894881024, 0.15006740935151816, 0.15307565903922002, -0.4220107726011706, -0.22473865710899874, 0.07752910407099833, 0.08695476776131639, 0.14407281501103514, 0.0037966777404059245, -0.29085908356743556, 0.06670368067990308, -0.17926118018165713, -0.1272725021061037, -0.11669778266623716, 0.025181284139273306, 0.007514598746834102, -0.21175140735681697, 0.12993095730060852, 0.09147419249739057, -0.0077246119999276695, -0.15288901128756102, -0.0472991228603097, -0.07515183301274514, 0.12001183978907803, 0.12295338891631853, 0.022698342679969726, 0.14849618137238288, -0.09567673490708194, -0.11882171578334785, 0.3743754609397823, -0.04265819287042744, -0.28307298024595584, 0.13596826803029305, -0.1372089911382445, -0.17835039066611438, 0.0016554082964136394, 0.03902920484367598, 0.1594694232347832, -0.255942779788447, 0.12138614172750574, -0.019101490235952562, 0.07335599691867428, 0.08254775490050995, 0.01155647574779978, 0.2520162834039819, 0.058070745454320026, 0.04011974404866417, 0.14057229829749332, 0.005514309502467112, -0.1402603521872993, -0.43380322393470555, -0.18419528747030178, -0.16978017641581916, 0.09096818232548333, -0.11673693259436604, -0.10888181007213725, 0.38769286426325, 0.1937210919364119, 0.16062954386135422, 0.08157612754517705, 0.268167779664509, 0.15652576871817933, 0.09198679882151786, 0.08901789312761638, 0.2806128690755295, 0.18746775507260996, 0.12140492087928578, -0.22773881186120917, -0.045034675701190865, 0.13573608210971277]
|
1,803.03772
|
Generalization and Expressivity for Deep Nets
|
Along with the rapid development of deep learning in practice, the
theoretical explanations for its success become urgent. Generalization and
expressivity are two widely used measurements to quantify theoretical behaviors
of deep learning. The expressivity focuses on finding functions expressible by
deep nets but cannot be approximated by shallow nets with the similar number of
neurons. It usually implies the large capacity. The generalization aims at
deriving fast learning rate for deep nets. It usually requires small capacity
to reduce the variance. Different from previous studies on deep learning,
pursuing either expressivity or generalization, we take both factors into
account to explore the theoretical advantages of deep nets. For this purpose,
we construct a deep net with two hidden layers possessing excellent
expressivity in terms of localized and sparse approximation. Then, utilizing
the well known covering number to measure the capacity, we find that deep nets
possess excellent expressive power (measured by localized and sparse
approximation) without enlarging the capacity of shallow nets. As a
consequence, we derive near optimal learning rates for implementing empirical
risk minimization (ERM) on the constructed deep nets. These results
theoretically exhibit the advantage of deep nets from learning theory
viewpoints.
|
cs.LG
|
along with the rapid development of deep learning in practice the theoretical explanations for its success become urgent generalization and expressivity are two widely used measurements to quantify theoretical behaviors of deep learning the expressivity focuses on finding functions expressible by deep nets but cannot be approximated by shallow nets with the similar number of neurons it usually implies the large capacity the generalization aims at deriving fast learning rate for deep nets it usually requires small capacity to reduce the variance different from previous studies on deep learning pursuing either expressivity or generalization we take both factors into account to explore the theoretical advantages of deep nets for this purpose we construct a deep net with two hidden layers possessing excellent expressivity in terms of localized and sparse approximation then utilizing the well known covering number to measure the capacity we find that deep nets possess excellent expressive power measured by localized and sparse approximation without enlarging the capacity of shallow nets as a consequence we derive near optimal learning rates for implementing empirical risk minimization erm on the constructed deep nets these results theoretically exhibit the advantage of deep nets from learning theory viewpoints
|
[['along', 'with', 'the', 'rapid', 'development', 'of', 'deep', 'learning', 'in', 'practice', 'the', 'theoretical', 'explanations', 'for', 'its', 'success', 'become', 'urgent', 'generalization', 'and', 'expressivity', 'are', 'two', 'widely', 'used', 'measurements', 'to', 'quantify', 'theoretical', 'behaviors', 'of', 'deep', 'learning', 'the', 'expressivity', 'focuses', 'on', 'finding', 'functions', 'expressible', 'by', 'deep', 'nets', 'but', 'can', 'not', 'be', 'approximated', 'by', 'shallow', 'nets', 'with', 'the', 'similar', 'number', 'of', 'neurons', 'it', 'usually', 'implies', 'the', 'large', 'capacity', 'the', 'generalization', 'aims', 'at', 'deriving', 'fast', 'learning', 'rate', 'for', 'deep', 'nets', 'it', 'usually', 'requires', 'small', 'capacity', 'to', 'reduce', 'the', 'variance', 'different', 'from', 'previous', 'studies', 'on', 'deep', 'learning', 'pursuing', 'either', 'expressivity', 'or', 'generalization', 'we', 'take', 'both', 'factors', 'into', 'account', 'to', 'explore', 'the', 'theoretical', 'advantages', 'of', 'deep', 'nets', 'for', 'this', 'purpose', 'we', 'construct', 'a', 'deep', 'net', 'with', 'two', 'hidden', 'layers', 'possessing', 'excellent', 'expressivity', 'in', 'terms', 'of', 'localized', 'and', 'sparse', 'approximation', 'then', 'utilizing', 'the', 'well', 'known', 'covering', 'number', 'to', 'measure', 'the', 'capacity', 'we', 'find', 'that', 'deep', 'nets', 'possess', 'excellent', 'expressive', 'power', 'measured', 'by', 'localized', 'and', 'sparse', 'approximation', 'without', 'enlarging', 'the', 'capacity', 'of', 'shallow', 'nets', 'as', 'a', 'consequence', 'we', 'derive', 'near', 'optimal', 'learning', 'rates', 'for', 'implementing', 'empirical', 'risk', 'minimization', 'erm', 'on', 'the', 'constructed', 'deep', 'nets', 'these', 'results', 'theoretically', 'exhibit', 'the', 'advantage', 'of', 'deep', 'nets', 'from', 'learning', 'theory', 'viewpoints']]
|
[-0.03449753480774308, 0.016493021484540047, -0.0352229763526791, 0.12518344890635916, -0.09109249987833315, -0.15866429136763446, 0.08076714751367377, 0.4203311455037757, -0.3007219055493783, -0.30808078742061323, 0.07639238300383432, -0.27324783312615364, -0.18080711275986797, 0.18257595981154495, -0.1129717974176602, 0.09623750346697403, 0.06936738867936704, 0.0183406978878689, -0.07232071644494187, -0.25941730207092306, 0.2687963740356493, 0.04849987536955975, 0.34856221896860995, 0.03231507484200718, 0.11047880786475796, 0.0055300050750752994, -0.01301056426491229, 0.02876273106528342, -0.08869489180273524, 0.17833248679975267, 0.3275015046583668, 0.18427457566890715, 0.32393201677894534, -0.4756938062069304, -0.24797244138512192, 0.12830200469709913, 0.1469734740292247, 0.08557607991346702, -0.0379909017840684, -0.27336473692667096, 0.0718336550372317, -0.15978385988849825, -0.053317320086345606, -0.18792206445604864, -0.04988152505759017, 0.03783716989425838, -0.24794243314175815, 0.006767584464801145, 0.1291614356905761, 0.08640928687118549, -0.036826642286292455, -0.15591251334236925, 0.04674089591841445, 0.12070490583318857, 0.042523066825257035, 0.03394972923244846, 0.06821310681498936, -0.20238950463522434, -0.09966406250977652, 0.27277369418554953, -0.09002366642642597, -0.17529348949405368, 0.21671296590537326, -0.055743947243412514, -0.1373788854662745, 0.12550981116344026, 0.22395786575542828, 0.07804029884861621, -0.14864053098699975, 0.05093492922015006, -0.017758696685133853, 0.12816573008138515, 0.041126399493639165, 0.06750387787703084, 0.21080369816686448, 0.2574772978098685, 0.009495536717562581, 0.1479952108152778, -0.08383037978995989, -0.1465009363973277, -0.22869155615766718, -0.0803116436688428, -0.1644004370265541, 0.014420331410929528, -0.09759925137757652, -0.15239358004088027, 0.3435463030860395, 0.14220200150467568, 0.22157440057525477, 0.19085177502637435, 0.3198416579543107, 0.11387301659150059, 0.17193286688490134, 0.1180469548438444, 0.2733857070762418, 0.12618295597692544, 0.08867531958825621, -0.16379071638989143, 0.10327477405216488, 0.07292996624456292]
|
1,803.03773
|
Alloy engineering of topological semimetal phase transition in
MgTa$_{2-x}$Nb$_x$N$_3$
|
Dirac, triple-point and Weyl fermions represent three topological semimetal
phases, characterized with a descending degree of band degeneracy, which have
been realized separately in specific crystalline materials with different
lattice symmetries. Here we demonstrate an alloy engineering approach to
realize all three types of fermions in one single material system of
MgTa$_{2-x}$Nb$_x$N$_3$. Based on symmetry analysis and first-principles
calculations, we map out a phase diagram of topological order in the parameter
space of alloy concentration and crystalline symmetry, where the intrinsic
MgTa$_2$N$_3$ with the highest symmetry hosts the Dirac semimetal phase which
transforms into the triple-point and then the Weyl semimetal phase with the
increasing Nb concentration that lowers the crystalline symmetries. Therefore,
alloy engineering affords a unique approach for experimental investigation of
topological transitions of semimetallic phases manifesting different fermionic
behaviors.
|
cond-mat.mtrl-sci
|
dirac triplepoint and weyl fermions represent three topological semimetal phases characterized with a descending degree of band degeneracy which have been realized separately in specific crystalline materials with different lattice symmetries here we demonstrate an alloy engineering approach to realize all three types of fermions in one single material system of mgta_2xnb_xn_3 based on symmetry analysis and firstprinciples calculations we map out a phase diagram of topological order in the parameter space of alloy concentration and crystalline symmetry where the intrinsic mgta_2n_3 with the highest symmetry hosts the dirac semimetal phase which transforms into the triplepoint and then the weyl semimetal phase with the increasing nb concentration that lowers the crystalline symmetries therefore alloy engineering affords a unique approach for experimental investigation of topological transitions of semimetallic phases manifesting different fermionic behaviors
|
[['dirac', 'triplepoint', 'and', 'weyl', 'fermions', 'represent', 'three', 'topological', 'semimetal', 'phases', 'characterized', 'with', 'a', 'descending', 'degree', 'of', 'band', 'degeneracy', 'which', 'have', 'been', 'realized', 'separately', 'in', 'specific', 'crystalline', 'materials', 'with', 'different', 'lattice', 'symmetries', 'here', 'we', 'demonstrate', 'an', 'alloy', 'engineering', 'approach', 'to', 'realize', 'all', 'three', 'types', 'of', 'fermions', 'in', 'one', 'single', 'material', 'system', 'of', 'mgta_2xnb_xn_3', 'based', 'on', 'symmetry', 'analysis', 'and', 'firstprinciples', 'calculations', 'we', 'map', 'out', 'a', 'phase', 'diagram', 'of', 'topological', 'order', 'in', 'the', 'parameter', 'space', 'of', 'alloy', 'concentration', 'and', 'crystalline', 'symmetry', 'where', 'the', 'intrinsic', 'mgta_2n_3', 'with', 'the', 'highest', 'symmetry', 'hosts', 'the', 'dirac', 'semimetal', 'phase', 'which', 'transforms', 'into', 'the', 'triplepoint', 'and', 'then', 'the', 'weyl', 'semimetal', 'phase', 'with', 'the', 'increasing', 'nb', 'concentration', 'that', 'lowers', 'the', 'crystalline', 'symmetries', 'therefore', 'alloy', 'engineering', 'affords', 'a', 'unique', 'approach', 'for', 'experimental', 'investigation', 'of', 'topological', 'transitions', 'of', 'semimetallic', 'phases', 'manifesting', 'different', 'fermionic', 'behaviors']]
|
[-0.18644739146917486, 0.24123864818035284, -0.07851466739263673, -0.05241378612386493, -0.07354217821445602, -0.19938475489974594, 0.11764025856525852, 0.37323493031928173, -0.24799940850442417, -0.29621486656117035, 0.007811686114067785, -0.3218139283430691, -0.18095539174257563, 0.09787671752811337, 0.06617099434638826, 0.04941062698355661, -0.06046995949716522, -0.06947313539433078, -0.21235497964796826, -0.2237462595481282, 0.3215856089758185, -0.06858110463318344, 0.3751969326681529, 0.01199348570438675, 0.055921507456626454, -0.03337547797888804, 0.12586946714526184, 0.009257547618024267, -0.1466220372771204, 0.045360171830711456, 0.24839515308312213, -0.11372224901480457, 0.11765962621340385, -0.42156195878409425, -0.23631220397611077, 0.041105875842129956, 0.12591509148478508, 0.10102025828001877, -0.11551256541323919, -0.3434056596830487, 0.08224942866497888, -0.1698475735755682, -0.13131818319312655, -0.12985555390612438, -0.048629317201602344, -0.08170576295815409, -0.17465863176263297, 0.04918996235355735, 0.03651899451103348, 0.12925001046337106, -0.1218032917236157, -0.10665319792191999, -0.1610234172298358, 0.0663058162237016, 0.047845343306947216, -0.028834601545419832, 0.08775550279891692, -0.11017129859672142, -0.13734607600087587, 0.4523370804694983, 0.006883222270362939, -0.11175826348794195, 0.1714541532815649, -0.14087772804621357, -0.16518879173896633, 0.16368048038835137, 0.10349234255174032, 0.05109656205973946, -0.08403141742231897, 0.10414634517286546, 0.012158056281175679, 0.14918816443532706, 0.0030759491205502015, 0.08526680439244956, 0.2860183033662347, 0.18423288577737718, 0.048785656903727125, 0.1576922377678924, -0.08064844104497192, -0.053589246585033834, -0.25811184513418434, -0.2642250314229526, -0.25270151188686635, 0.02905683481367305, -0.097006590663939, -0.22756538993607348, 0.47259527057624207, 0.11639435380135323, 0.1649298236848643, -0.10759118546624309, 0.17228821933699343, 0.10405526167999667, 0.0750249746398857, -0.0336377441453246, 0.2164040627817695, 0.12890714166614298, 0.0676787549092506, -0.2507625311577263, 0.003579063692058508, 0.0793976824157513]
|
1,803.03774
|
Long-period limit of exact periodic traveling wave solutions for the
derivative nonlinear Schr\"{o}dinger equation
|
We study the periodic traveling wave solutions of the derivative nonlinear
Schr\"{o}dinger equation (DNLS). It is known that DNLS has two types of
solitons on the whole line; one has exponential decay and the other has
algebraic decay. The latter corresponds to the soliton for the massless case.
In the new global results recently obtained by Fukaya, Hayashi and Inui, the
properties of two-parameter of the solitons are essentially used in the proof,
and especially the soliton for the massless case plays an important role. To
investigate further properties of the solitons, we construct exact periodic
traveling wave solutions which yield the solitons on the whole line including
the massless case in the long-period limit. Moreover, we study the regularity
of the convergence of these exact solutions in the long-period limit.
Throughout the paper, the theory of elliptic functions and elliptic integrals
is used in the calculation.
|
math.AP math-ph math.MP
|
we study the periodic traveling wave solutions of the derivative nonlinear schrodinger equation dnls it is known that dnls has two types of solitons on the whole line one has exponential decay and the other has algebraic decay the latter corresponds to the soliton for the massless case in the new global results recently obtained by fukaya hayashi and inui the properties of twoparameter of the solitons are essentially used in the proof and especially the soliton for the massless case plays an important role to investigate further properties of the solitons we construct exact periodic traveling wave solutions which yield the solitons on the whole line including the massless case in the longperiod limit moreover we study the regularity of the convergence of these exact solutions in the longperiod limit throughout the paper the theory of elliptic functions and elliptic integrals is used in the calculation
|
[['we', 'study', 'the', 'periodic', 'traveling', 'wave', 'solutions', 'of', 'the', 'derivative', 'nonlinear', 'schrodinger', 'equation', 'dnls', 'it', 'is', 'known', 'that', 'dnls', 'has', 'two', 'types', 'of', 'solitons', 'on', 'the', 'whole', 'line', 'one', 'has', 'exponential', 'decay', 'and', 'the', 'other', 'has', 'algebraic', 'decay', 'the', 'latter', 'corresponds', 'to', 'the', 'soliton', 'for', 'the', 'massless', 'case', 'in', 'the', 'new', 'global', 'results', 'recently', 'obtained', 'by', 'fukaya', 'hayashi', 'and', 'inui', 'the', 'properties', 'of', 'twoparameter', 'of', 'the', 'solitons', 'are', 'essentially', 'used', 'in', 'the', 'proof', 'and', 'especially', 'the', 'soliton', 'for', 'the', 'massless', 'case', 'plays', 'an', 'important', 'role', 'to', 'investigate', 'further', 'properties', 'of', 'the', 'solitons', 'we', 'construct', 'exact', 'periodic', 'traveling', 'wave', 'solutions', 'which', 'yield', 'the', 'solitons', 'on', 'the', 'whole', 'line', 'including', 'the', 'massless', 'case', 'in', 'the', 'longperiod', 'limit', 'moreover', 'we', 'study', 'the', 'regularity', 'of', 'the', 'convergence', 'of', 'these', 'exact', 'solutions', 'in', 'the', 'longperiod', 'limit', 'throughout', 'the', 'paper', 'the', 'theory', 'of', 'elliptic', 'functions', 'and', 'elliptic', 'integrals', 'is', 'used', 'in', 'the', 'calculation']]
|
[-0.1692266099263391, 0.0658717962143957, -0.0931037157185516, 0.09355210074006695, -0.06971935647354806, -0.0782262805166769, -0.02997272986638015, 0.313287789805805, -0.22654544458762832, -0.21317789185639113, 0.13439941350673645, -0.2987239496297624, -0.15652012068472088, 0.20611585465527765, 0.009337381300299543, 0.1006157687029559, 0.05557138608028627, 0.06395111302526234, -0.05022343944866618, -0.2329658457940789, 0.3708777205208444, -0.030303770433856198, 0.25072396040115863, 0.03573945062298787, 0.06503176521382308, 0.008916434997769252, 0.0003722469953896656, -0.06949075393072546, -0.2105883774653094, 0.09957649114809625, 0.20273601387512602, 0.027651701460605208, 0.22170861930369515, -0.41551973668169484, -0.21488181950703059, 0.11508647604504192, 0.20776562427476764, 0.1440547142291046, -0.03478733952992838, -0.30246176164476074, 0.06246914600073169, -0.09995324107218687, -0.24404193007100966, -0.044569834719144115, 0.03852395263934278, 0.09993060985388719, -0.19981061676134393, 0.09464907446837895, 0.09645876561112907, -0.013999289466221242, -0.1275502673465095, -0.05509397807795784, -0.0635957179323145, 0.08323207862471065, 0.1132464493618487, -0.003188364995541434, 0.019179017761441534, -0.147813842711613, -0.09875633392151292, 0.3913251401741721, -0.12211424494018676, -0.2232818832853809, 0.16561196518628157, -0.11459867613811096, -0.11337310769467628, 0.14847414697303302, 0.14114792270056445, 0.16579946002616763, -0.09153909922564683, 0.12954843961729426, -0.08487552352076594, 0.13011739715257634, 0.12439825673817262, 0.0482911384658097, 0.15008116163925767, 0.13844531756659892, 0.08449679696039386, 0.16246855746490613, -0.054884466317510996, -0.15802739838725083, -0.3183315109002264, -0.1564804417709501, -0.12248066683261566, 0.05601165220296897, -0.09357875781030113, -0.19007177996666055, 0.46410024527792043, 0.08043492291352317, 0.1345861522187415, 0.018730986497384076, 0.2126225251832033, 0.20858237071741015, 0.027430786869220743, 0.06424240077572056, 0.2946003759949634, 0.1717174738655122, 0.13969319818177808, -0.24241104031185787, -0.018030626705707344, 0.14175744547687266]
|
1,803.03775
|
Light Scattering by Fractal Dust Aggregates. II. Opacity and Asymmetry
Parameter
|
Optical properties of dust aggregates are important at various astrophysical
environments. To find a reliable approximation method for optical properties of
dust aggregates, we calculate the opacity and the asymmetry parameter of dust
aggregates by using a rigorous numerical method, the T-Matrix Method (TMM), and
then the results are compared to those obtained by approximate methods; the
Rayleigh-Gans-Debye (RGD) theory, the effective medium theory (EMT), and the
distribution of hollow spheres method (DHS). First of all, we confirm that the
RGD theory breaks down when multiple scattering is important. In addition, we
find that both EMT and DHS fail to reproduce the optical properties of dust
aggregates with fractal dimension of 2 when the incident wavelength is shorter
than the aggregate radius. In order to solve these problems, we test the mean
field theory (MFT), where multiple scattering can be taken into account. We
show that the extinction opacity of dust aggregates can be well reproduced by
MFT. However, it is also shown that MFT is not able to reproduce the scattering
and absorption opacities when multiple scattering is important. We successfully
resolve this weak point of MFT, by newly developing a modified mean field
theory (MMF). Hence, we conclude that MMF can be a useful tool to investigate
radiative transfer properties of various astrophysical environments. We also
point out an enhancement of the absorption opacity of dust aggregates in the
Rayleigh domain, which would be important to explain the large millimeter-wave
opacity inferred from observations of protoplanetary disks.
|
astro-ph.EP
|
optical properties of dust aggregates are important at various astrophysical environments to find a reliable approximation method for optical properties of dust aggregates we calculate the opacity and the asymmetry parameter of dust aggregates by using a rigorous numerical method the tmatrix method tmm and then the results are compared to those obtained by approximate methods the rayleighgansdebye rgd theory the effective medium theory emt and the distribution of hollow spheres method dhs first of all we confirm that the rgd theory breaks down when multiple scattering is important in addition we find that both emt and dhs fail to reproduce the optical properties of dust aggregates with fractal dimension of 2 when the incident wavelength is shorter than the aggregate radius in order to solve these problems we test the mean field theory mft where multiple scattering can be taken into account we show that the extinction opacity of dust aggregates can be well reproduced by mft however it is also shown that mft is not able to reproduce the scattering and absorption opacities when multiple scattering is important we successfully resolve this weak point of mft by newly developing a modified mean field theory mmf hence we conclude that mmf can be a useful tool to investigate radiative transfer properties of various astrophysical environments we also point out an enhancement of the absorption opacity of dust aggregates in the rayleigh domain which would be important to explain the large millimeterwave opacity inferred from observations of protoplanetary disks
|
[['optical', 'properties', 'of', 'dust', 'aggregates', 'are', 'important', 'at', 'various', 'astrophysical', 'environments', 'to', 'find', 'a', 'reliable', 'approximation', 'method', 'for', 'optical', 'properties', 'of', 'dust', 'aggregates', 'we', 'calculate', 'the', 'opacity', 'and', 'the', 'asymmetry', 'parameter', 'of', 'dust', 'aggregates', 'by', 'using', 'a', 'rigorous', 'numerical', 'method', 'the', 'tmatrix', 'method', 'tmm', 'and', 'then', 'the', 'results', 'are', 'compared', 'to', 'those', 'obtained', 'by', 'approximate', 'methods', 'the', 'rayleighgansdebye', 'rgd', 'theory', 'the', 'effective', 'medium', 'theory', 'emt', 'and', 'the', 'distribution', 'of', 'hollow', 'spheres', 'method', 'dhs', 'first', 'of', 'all', 'we', 'confirm', 'that', 'the', 'rgd', 'theory', 'breaks', 'down', 'when', 'multiple', 'scattering', 'is', 'important', 'in', 'addition', 'we', 'find', 'that', 'both', 'emt', 'and', 'dhs', 'fail', 'to', 'reproduce', 'the', 'optical', 'properties', 'of', 'dust', 'aggregates', 'with', 'fractal', 'dimension', 'of', '2', 'when', 'the', 'incident', 'wavelength', 'is', 'shorter', 'than', 'the', 'aggregate', 'radius', 'in', 'order', 'to', 'solve', 'these', 'problems', 'we', 'test', 'the', 'mean', 'field', 'theory', 'mft', 'where', 'multiple', 'scattering', 'can', 'be', 'taken', 'into', 'account', 'we', 'show', 'that', 'the', 'extinction', 'opacity', 'of', 'dust', 'aggregates', 'can', 'be', 'well', 'reproduced', 'by', 'mft', 'however', 'it', 'is', 'also', 'shown', 'that', 'mft', 'is', 'not', 'able', 'to', 'reproduce', 'the', 'scattering', 'and', 'absorption', 'opacities', 'when', 'multiple', 'scattering', 'is', 'important', 'we', 'successfully', 'resolve', 'this', 'weak', 'point', 'of', 'mft', 'by', 'newly', 'developing', 'a', 'modified', 'mean', 'field', 'theory', 'mmf', 'hence', 'we', 'conclude', 'that', 'mmf', 'can', 'be', 'a', 'useful', 'tool', 'to', 'investigate', 'radiative', 'transfer', 'properties', 'of', 'various', 'astrophysical', 'environments', 'we', 'also', 'point', 'out', 'an', 'enhancement', 'of', 'the', 'absorption', 'opacity', 'of', 'dust', 'aggregates', 'in', 'the', 'rayleigh', 'domain', 'which', 'would', 'be', 'important', 'to', 'explain', 'the', 'large', 'millimeterwave', 'opacity', 'inferred', 'from', 'observations', 'of', 'protoplanetary', 'disks']]
|
[-0.0372990246354434, 0.11261695876665438, -0.11189458400654385, 0.1175313485490839, -0.02115367144817509, -0.08416913812381616, -0.0069836985462917445, 0.4187710453049246, -0.2577156624214417, -0.29067631835215185, 0.0688463861415402, -0.2573140432037054, -0.1349167961169181, 0.16691462932543522, 0.009022834340491927, 0.0532591504018649, 0.019949455387856675, -0.06300291568639288, 0.002815847091533872, -0.2271178986486347, 0.3015542398749226, 0.08678048221585173, 0.23580882360926833, 0.0971373459955408, 0.04007575577349368, -0.018637833503415305, -0.050365337131387855, 0.06743338894113958, -0.13099435385273714, 0.10523521018225744, 0.2441897926820315, 0.07210908336359184, 0.19820808824600586, -0.44139612973461967, -0.2800846911899476, 0.050892676625657454, 0.16315018486074476, 0.12432968395015966, -0.008925289435996618, -0.2300064857286143, 0.0926374532319755, -0.14555043622806488, -0.17872115819299794, -0.0724624791724914, 0.018608769518790775, 0.02491070072766932, -0.2905126322513394, 0.06006364079847292, 0.024383799795923478, 0.02708893322599042, -0.10237268313398981, -0.10576619961519677, -0.022438660638975393, 0.10717293882289486, 0.029102421299756383, -0.009299494188660419, 0.17119522290921443, -0.12690509649004833, -0.03333583077131565, 0.42031898760764175, -0.08800121349682068, -0.12053774405704684, 0.18715716683844397, -0.17736702489977083, -0.10027227500999668, 0.18873289656001574, 0.1673715453684689, 0.12363840004309533, -0.15701834543463897, 0.035772437475440295, -0.061027829779824426, 0.19577832141611537, 0.05700568999930558, 0.03263487039605178, 0.24051178037282453, 0.1281386084441305, -0.014302627181159294, 0.12408322026956842, -0.13968569727195615, -0.0873610467676178, -0.2537075323471145, -0.14433491958424927, -0.16434542388032494, 0.05609623583911003, -0.128655080204485, -0.12501150380712972, 0.2863664482168509, 0.20806458560248695, 0.1876038296758777, 0.05103412438062465, 0.31354746727242944, 0.12419648778561249, 0.0862030763935062, 0.08433400899224193, 0.2833079597707015, 0.15341160195668313, 0.09643641348374656, -0.2404302709023412, 0.05691137414679948, 0.03817717127322433]
|
1,803.03776
|
Yielding of a Model Glassformer: an Interpretation with an Effective
System of Icosahedra
|
We consider the yielding under simple shear of a binary Lennard-Jones
glassformer whose super-Arrhenius dynamics are correlated with the formation of
icosahedral structures. We recast this glassformer as an effective system of
icosahedra [Pinney et al. J. Chem. Phys. 143 244507 (2015)]. Looking at the
small-strain region of sheared simulations, we observe that shear rates affect
the shear localisation behavior particularly at temperatures below the glass
transition as defined with a fit to the Vogel-Fulcher-Tamman equation. At
higher temperature, shear localisation starts immediately upon shearing for all
shear rates. At lower temperatures, faster shear rates can result in a delayed
start in shear localisation; which begins close to the yield stress. Building
from a previous work which considered steady-state shear [Pinney et al. J.
Chem. Phys. 143 244507 (2016)], we interpret the response to shear and the
shear localisation in terms of a \emph{local} effective temperature with our
system of icosahedra. We find that the effective temperatures of the regions
undergoing shear localisation increase significantly with increasing strain
(before reaching a steady state plateau).
|
cond-mat.soft cond-mat.mtrl-sci cond-mat.stat-mech
|
we consider the yielding under simple shear of a binary lennardjones glassformer whose superarrhenius dynamics are correlated with the formation of icosahedral structures we recast this glassformer as an effective system of icosahedra pinney et al j chem phys 143 244507 2015 looking at the smallstrain region of sheared simulations we observe that shear rates affect the shear localisation behavior particularly at temperatures below the glass transition as defined with a fit to the vogelfulchertamman equation at higher temperature shear localisation starts immediately upon shearing for all shear rates at lower temperatures faster shear rates can result in a delayed start in shear localisation which begins close to the yield stress building from a previous work which considered steadystate shear pinney et al j chem phys 143 244507 2016 we interpret the response to shear and the shear localisation in terms of a emphlocal effective temperature with our system of icosahedra we find that the effective temperatures of the regions undergoing shear localisation increase significantly with increasing strain before reaching a steady state plateau
|
[['we', 'consider', 'the', 'yielding', 'under', 'simple', 'shear', 'of', 'a', 'binary', 'lennardjones', 'glassformer', 'whose', 'superarrhenius', 'dynamics', 'are', 'correlated', 'with', 'the', 'formation', 'of', 'icosahedral', 'structures', 'we', 'recast', 'this', 'glassformer', 'as', 'an', 'effective', 'system', 'of', 'icosahedra', 'pinney', 'et', 'al', 'j', 'chem', 'phys', '143', '244507', '2015', 'looking', 'at', 'the', 'smallstrain', 'region', 'of', 'sheared', 'simulations', 'we', 'observe', 'that', 'shear', 'rates', 'affect', 'the', 'shear', 'localisation', 'behavior', 'particularly', 'at', 'temperatures', 'below', 'the', 'glass', 'transition', 'as', 'defined', 'with', 'a', 'fit', 'to', 'the', 'vogelfulchertamman', 'equation', 'at', 'higher', 'temperature', 'shear', 'localisation', 'starts', 'immediately', 'upon', 'shearing', 'for', 'all', 'shear', 'rates', 'at', 'lower', 'temperatures', 'faster', 'shear', 'rates', 'can', 'result', 'in', 'a', 'delayed', 'start', 'in', 'shear', 'localisation', 'which', 'begins', 'close', 'to', 'the', 'yield', 'stress', 'building', 'from', 'a', 'previous', 'work', 'which', 'considered', 'steadystate', 'shear', 'pinney', 'et', 'al', 'j', 'chem', 'phys', '143', '244507', '2016', 'we', 'interpret', 'the', 'response', 'to', 'shear', 'and', 'the', 'shear', 'localisation', 'in', 'terms', 'of', 'a', 'emphlocal', 'effective', 'temperature', 'with', 'our', 'system', 'of', 'icosahedra', 'we', 'find', 'that', 'the', 'effective', 'temperatures', 'of', 'the', 'regions', 'undergoing', 'shear', 'localisation', 'increase', 'significantly', 'with', 'increasing', 'strain', 'before', 'reaching', 'a', 'steady', 'state', 'plateau']]
|
[-0.11494498727736117, 0.1977163166880384, -0.07405996924244809, -0.06248974589023461, 0.0067625355227026104, -0.1008770845712687, 0.05034611026031211, 0.32025703361750335, -0.23669612054156416, -0.29504271048581465, 0.04164649005082768, -0.24821484648494113, -0.14555240082340423, 0.1553157554088353, -0.02517837554302693, 0.008283983984956753, 0.009898082406029919, -0.022283662583922496, -0.09882486201073418, -0.24277067306483613, 0.18575983791579975, 0.14853644288203882, 0.31352702096263857, 0.02776681951711479, 0.05816875847963745, 0.009869071341858342, 0.012693606062802947, 0.06427222007789232, -0.2707566831782949, -0.02090299124668898, 0.24632665290277794, -0.037785991729269254, 0.21339396938638783, -0.3913084339971344, -0.2370732111438852, 0.0548320292768165, 0.0961564121762526, 0.16334741312847206, 0.02714034644070606, -0.2421664826367211, 0.03232159358368994, -0.20043954459399027, -0.1362396258989285, -0.06102574019339578, 0.08283638332210395, 0.02544899764818664, -0.2872629879342242, 0.2616351534662321, 0.06956221276342911, 0.06836652285258832, -0.10767706745353008, -0.08949085225313688, -0.08282119170468215, 0.04791878629007495, 0.01907064498220865, 0.10260311045667864, 0.20681070942891996, -0.13662997789442774, -0.04212595697963375, 0.3478297216592935, -0.07365235329443644, -0.07447244133666457, 0.28169545449648353, -0.12814756896582313, -0.12482715422694368, 0.20736190432618404, 0.1645583023127147, 0.09007589512065738, -0.11322392407141027, 0.012745766798449123, -0.004674397485234357, 0.13552697056144392, 0.10780734909650196, -0.05877620712773682, 0.23357249783277084, 0.16200697000456932, 0.023598280646998822, 0.1459203147190227, -0.10641498081974857, -0.06876564728452064, -0.2578237461375779, -0.10883913699660622, -0.16203183859343182, 0.0692050850257042, -0.06686809530002319, -0.16619344324612156, 0.33392063700647534, 0.10842666073017165, 0.24286687104151874, 0.09336886259636189, 0.17440654641691725, 0.07672421615998978, 0.00038740112735279676, 0.12768868309038894, 0.31676182005789943, 0.14912930090815343, 0.14684880272506726, -0.2529705695713597, 0.025865664888954795, 0.08324923527416313]
|
1,803.03777
|
Deep Cross-media Knowledge Transfer
|
Cross-media retrieval is a research hotspot in multimedia area, which aims to
perform retrieval across different media types such as image and text. The
performance of existing methods usually relies on labeled data for model
training. However, cross-media data is very labor consuming to collect and
label, so how to transfer valuable knowledge in existing data to new data is a
key problem towards application. For achieving the goal, this paper proposes
deep cross-media knowledge transfer (DCKT) approach, which transfers knowledge
from a large-scale cross-media dataset to promote the model training on another
small-scale cross-media dataset. The main contributions of DCKT are: (1)
Two-level transfer architecture is proposed to jointly minimize the media-level
and correlation-level domain discrepancies, which allows two important and
complementary aspects of knowledge to be transferred: intra-media semantic and
inter-media correlation knowledge. It can enrich the training information and
boost the retrieval accuracy. (2) Progressive transfer mechanism is proposed to
iteratively select training samples with ascending transfer difficulties, via
the metric of cross-media domain consistency with adaptive feedback. It can
drive the transfer process to gradually reduce vast cross-media domain
discrepancy, so as to enhance the robustness of model training. For verifying
the effectiveness of DCKT, we take the largescale dataset XMediaNet as source
domain, and 3 widelyused datasets as target domain for cross-media retrieval.
Experimental results show that DCKT achieves promising improvement on retrieval
accuracy.
|
cs.MM
|
crossmedia retrieval is a research hotspot in multimedia area which aims to perform retrieval across different media types such as image and text the performance of existing methods usually relies on labeled data for model training however crossmedia data is very labor consuming to collect and label so how to transfer valuable knowledge in existing data to new data is a key problem towards application for achieving the goal this paper proposes deep crossmedia knowledge transfer dckt approach which transfers knowledge from a largescale crossmedia dataset to promote the model training on another smallscale crossmedia dataset the main contributions of dckt are 1 twolevel transfer architecture is proposed to jointly minimize the medialevel and correlationlevel domain discrepancies which allows two important and complementary aspects of knowledge to be transferred intramedia semantic and intermedia correlation knowledge it can enrich the training information and boost the retrieval accuracy 2 progressive transfer mechanism is proposed to iteratively select training samples with ascending transfer difficulties via the metric of crossmedia domain consistency with adaptive feedback it can drive the transfer process to gradually reduce vast crossmedia domain discrepancy so as to enhance the robustness of model training for verifying the effectiveness of dckt we take the largescale dataset xmedianet as source domain and 3 widelyused datasets as target domain for crossmedia retrieval experimental results show that dckt achieves promising improvement on retrieval accuracy
|
[['crossmedia', 'retrieval', 'is', 'a', 'research', 'hotspot', 'in', 'multimedia', 'area', 'which', 'aims', 'to', 'perform', 'retrieval', 'across', 'different', 'media', 'types', 'such', 'as', 'image', 'and', 'text', 'the', 'performance', 'of', 'existing', 'methods', 'usually', 'relies', 'on', 'labeled', 'data', 'for', 'model', 'training', 'however', 'crossmedia', 'data', 'is', 'very', 'labor', 'consuming', 'to', 'collect', 'and', 'label', 'so', 'how', 'to', 'transfer', 'valuable', 'knowledge', 'in', 'existing', 'data', 'to', 'new', 'data', 'is', 'a', 'key', 'problem', 'towards', 'application', 'for', 'achieving', 'the', 'goal', 'this', 'paper', 'proposes', 'deep', 'crossmedia', 'knowledge', 'transfer', 'dckt', 'approach', 'which', 'transfers', 'knowledge', 'from', 'a', 'largescale', 'crossmedia', 'dataset', 'to', 'promote', 'the', 'model', 'training', 'on', 'another', 'smallscale', 'crossmedia', 'dataset', 'the', 'main', 'contributions', 'of', 'dckt', 'are', '1', 'twolevel', 'transfer', 'architecture', 'is', 'proposed', 'to', 'jointly', 'minimize', 'the', 'medialevel', 'and', 'correlationlevel', 'domain', 'discrepancies', 'which', 'allows', 'two', 'important', 'and', 'complementary', 'aspects', 'of', 'knowledge', 'to', 'be', 'transferred', 'intramedia', 'semantic', 'and', 'intermedia', 'correlation', 'knowledge', 'it', 'can', 'enrich', 'the', 'training', 'information', 'and', 'boost', 'the', 'retrieval', 'accuracy', '2', 'progressive', 'transfer', 'mechanism', 'is', 'proposed', 'to', 'iteratively', 'select', 'training', 'samples', 'with', 'ascending', 'transfer', 'difficulties', 'via', 'the', 'metric', 'of', 'crossmedia', 'domain', 'consistency', 'with', 'adaptive', 'feedback', 'it', 'can', 'drive', 'the', 'transfer', 'process', 'to', 'gradually', 'reduce', 'vast', 'crossmedia', 'domain', 'discrepancy', 'so', 'as', 'to', 'enhance', 'the', 'robustness', 'of', 'model', 'training', 'for', 'verifying', 'the', 'effectiveness', 'of', 'dckt', 'we', 'take', 'the', 'largescale', 'dataset', 'xmedianet', 'as', 'source', 'domain', 'and', '3', 'widelyused', 'datasets', 'as', 'target', 'domain', 'for', 'crossmedia', 'retrieval', 'experimental', 'results', 'show', 'that', 'dckt', 'achieves', 'promising', 'improvement', 'on', 'retrieval', 'accuracy']]
|
[-0.016691374538433074, -0.013133659571134817, -0.0263268458116467, 0.07244500476895967, -0.16563185862674704, -0.1354362155897044, 0.055115252690094554, 0.44074615322876654, -0.29763784476173377, -0.39446200724341907, 0.08851585861598973, -0.3021286328871611, -0.11930330308262325, 0.183837377803554, -0.1271618458555963, 0.07153153855636317, 0.14641302611718338, 0.022650750596117826, -0.049639172674298085, -0.2795442085189279, 0.35833127054502256, 0.07627873831461329, 0.40005659088326084, 0.06501208491889494, 0.10960732226417999, -0.04818022651098935, -0.0698473216543789, -0.07174218187667845, -0.04618170133773804, 0.18960761535657053, 0.34660167945133125, 0.23673513014884, 0.3104688925107309, -0.370305224717023, -0.25520036719639655, 0.07771081754195361, 0.1711054530434402, 0.12478761552178444, -0.0705817223289549, -0.2976982141491525, 0.08747908645403056, -0.15600143077816547, 0.05099224083824083, -0.16713501095156452, -0.007478978378847907, -0.03436059407420901, -0.34687938664033674, 0.039500021088835116, 0.09767527663020051, 0.04914092007259439, -0.04714888647582224, -0.10276022515401044, 0.03690169009080689, 0.23178753631093837, 0.0443875939915545, 0.11112283612861315, 0.11502596347703989, -0.16757011331148014, -0.12268166157316175, 0.3742761566869116, -0.050020724241871255, -0.2094029090523171, 0.19508125628635753, -0.03010893195875854, -0.10423212903073623, 0.1002844255032999, 0.24349286087246064, 0.1081999964809646, -0.16980295306335133, -0.002256150734475731, 0.0017673388915032515, 0.21540465136058629, 0.02124294212366554, 0.001786288433192697, 0.16360889474370716, 0.27344618908162893, 0.04523510476636667, 0.16053283396312118, -0.13053190582286334, -0.09118203778676356, -0.20389316539097177, -0.12489237970450111, -0.23762745368315205, -0.021358313376757514, -0.07922133934081492, -0.09820219897665083, 0.35753127955000047, 0.265435333509231, 0.20165321861869806, 0.04229548446099735, 0.37697551728758427, -0.033128043821437005, 0.1200859784725513, 0.07865194779255294, 0.16228738976808796, 0.00035316854544881996, 0.18169400854536175, -0.1953469932081394, 0.08339249930551366, 0.024884504581028262]
|
1,803.03778
|
Driving Scene Perception Network: Real-time Joint Detection, Depth
Estimation and Semantic Segmentation
|
As the demand for enabling high-level autonomous driving has increased in
recent years and visual perception is one of the critical features to enable
fully autonomous driving, in this paper, we introduce an efficient approach for
simultaneous object detection, depth estimation and pixel-level semantic
segmentation using a shared convolutional architecture. The proposed network
model, which we named Driving Scene Perception Network (DSPNet), uses
multi-level feature maps and multi-task learning to improve the accuracy and
efficiency of object detection, depth estimation and image segmentation tasks
from a single input image. Hence, the resulting network model uses less than
850 MiB of GPU memory and achieves 14.0 fps on NVIDIA GeForce GTX 1080 with a
1024x512 input image, and both precision and efficiency have been improved over
combination of single tasks.
|
cs.CV
|
as the demand for enabling highlevel autonomous driving has increased in recent years and visual perception is one of the critical features to enable fully autonomous driving in this paper we introduce an efficient approach for simultaneous object detection depth estimation and pixellevel semantic segmentation using a shared convolutional architecture the proposed network model which we named driving scene perception network dspnet uses multilevel feature maps and multitask learning to improve the accuracy and efficiency of object detection depth estimation and image segmentation tasks from a single input image hence the resulting network model uses less than 850 mib of gpu memory and achieves 140 fps on nvidia geforce gtx 1080 with a 1024x512 input image and both precision and efficiency have been improved over combination of single tasks
|
[['as', 'the', 'demand', 'for', 'enabling', 'highlevel', 'autonomous', 'driving', 'has', 'increased', 'in', 'recent', 'years', 'and', 'visual', 'perception', 'is', 'one', 'of', 'the', 'critical', 'features', 'to', 'enable', 'fully', 'autonomous', 'driving', 'in', 'this', 'paper', 'we', 'introduce', 'an', 'efficient', 'approach', 'for', 'simultaneous', 'object', 'detection', 'depth', 'estimation', 'and', 'pixellevel', 'semantic', 'segmentation', 'using', 'a', 'shared', 'convolutional', 'architecture', 'the', 'proposed', 'network', 'model', 'which', 'we', 'named', 'driving', 'scene', 'perception', 'network', 'dspnet', 'uses', 'multilevel', 'feature', 'maps', 'and', 'multitask', 'learning', 'to', 'improve', 'the', 'accuracy', 'and', 'efficiency', 'of', 'object', 'detection', 'depth', 'estimation', 'and', 'image', 'segmentation', 'tasks', 'from', 'a', 'single', 'input', 'image', 'hence', 'the', 'resulting', 'network', 'model', 'uses', 'less', 'than', '850', 'mib', 'of', 'gpu', 'memory', 'and', 'achieves', '140', 'fps', 'on', 'nvidia', 'geforce', 'gtx', '1080', 'with', 'a', '1024x512', 'input', 'image', 'and', 'both', 'precision', 'and', 'efficiency', 'have', 'been', 'improved', 'over', 'combination', 'of', 'single', 'tasks']]
|
[-0.05127830706274606, -0.03912949871432722, -0.05480643003211012, -0.03343390063639349, -0.09620650961085803, -0.20808474073556846, 0.031869111084892585, 0.504279093391548, -0.23486300904714452, -0.4145054759267043, 0.0861100333570466, -0.23477884490358256, -0.1444129249389012, 0.21785211230547527, -0.16492944992492048, 0.14470755445264924, 0.1731617155706686, 0.07041013317079994, -0.056742643295809275, -0.24721085718249916, 0.22677585068268805, 0.07349403394298173, 0.34517114295616863, 0.03365643201790031, 0.21638178307284403, -0.0009699012812843003, -0.03469465060643558, -0.07491527879738989, 0.0026196784259179444, 0.2182651949525301, 0.2814903151753586, 0.19951323268011095, 0.3059837575451889, -0.40816001844863725, -0.2598713932881557, 0.054193393851623056, 0.14545604506668847, 0.051203815934732264, -0.020123319397405463, -0.3653010373099113, 0.09334453093217994, -0.20794915387362944, 0.08393908499402734, -0.13000678203681, 0.0054920938701962865, -0.05132984837854472, -0.3026366236832316, 0.04274652106870758, 0.06341568669867995, 0.10470964901486603, -0.06297173243617331, -0.08555437636187696, 0.024765867145006053, 0.20137461674891002, -0.08106883807019807, 0.13282288701134168, 0.1986807961508221, -0.24563324803442466, -0.15705770181535972, 0.3636420725690802, -0.07426189178636199, -0.17256571743343993, 0.20249266074750366, -0.0022819311336034864, -0.148028611891177, 0.12717478165007012, 0.25265190543562877, 0.11071198167074031, -0.14057109871600557, -0.019863512807005032, -0.0024583205786042326, 0.24586547149242613, 0.0752335688315596, 0.021159978187459662, 0.18515136614295208, 0.3454285632822604, 0.043852561051722645, 0.1496313566774658, -0.24353151514532234, -0.060088771021389584, -0.14926723857945579, -0.12693393567401007, -0.15878532667585657, -0.061257652117042094, -0.13144013113580555, -0.09378241274806517, 0.4228027825515101, 0.2746581937292752, 0.19222634849248557, 0.11938639775039554, 0.41819353741923654, 0.041625235258146945, 0.15790399680222114, 0.12369875529025659, 0.1593926000054999, -0.009230894190589273, 0.1773275361157125, -0.14703644553518408, 0.04537074341655042, 0.08111341700588506]
|
1,803.03779
|
Quantum Dimensional Transition in Spin-$\frac{1}{2}$ Antiferromagnetic
Heisenberg Model on A Square Lattice and Space Reduction in Matrix Product
State
|
We study the spin-$\frac{1}{2}$ antiferromagnetic Heisenberg model on an
infinity-by-$N$ square lattice for even $N$'s up to $14$. Previously, the
nonlinear sigma model perturbatively predicts that its spin rotational symmetry
asymptotically breaks when $N\rightarrow \infty$, i.e., when it is
two-dimensional (2D). However, we identified a critical width $N_c = 10$ for
which this symmetry breaks spontaneously. It defines a dimensional transition
from one-dimension (1D) including quasi-1D to 2D. The finite-size effect
differs from that of the $N$-by-$N$ lattice. The ground state (GS) energy per
site approaches the thermodynamic limit value, in agreement with the previously
accepted value, by one order of $1/N$ faster than when using $N$-by-$N$
lattices in the literature. We build and variationally solve a matrix product
state (MPS) on a chain, converting the $N$ sites in the rung into an effective
site. We show that the area law of entanglement entropy does not apply when $N$
increases in our method, and show that the reduced density matrix of each
effective site will have a saturating number of dominant diagonal elements with
increasing $N$. These two characteristics make the MPS rank needed to obtain a
demanded energy accuracy quickly saturate when $N$ is large, making our
algorithm efficient for large $N$'s. And, the latter enables space reduction in
MPS. Within the framework of MPS, we prove a theorem that the spin-spin
correlation at infinite separation is the square of staggered magnetization and
demonstrate that the eigenvalue structure of a building MPS unit of $\langle
g\mid g\rangle$, $\mid g\rangle$ being the GS, is responsible for order,
disorder and quasi-long-range order.
|
cond-mat.str-el
|
we study the spinfrac12 antiferromagnetic heisenberg model on an infinitybyn square lattice for even ns up to 14 previously the nonlinear sigma model perturbatively predicts that its spin rotational symmetry asymptotically breaks when nrightarrow infty ie when it is twodimensional 2d however we identified a critical width n_c 10 for which this symmetry breaks spontaneously it defines a dimensional transition from onedimension 1d including quasi1d to 2d the finitesize effect differs from that of the nbyn lattice the ground state gs energy per site approaches the thermodynamic limit value in agreement with the previously accepted value by one order of 1n faster than when using nbyn lattices in the literature we build and variationally solve a matrix product state mps on a chain converting the n sites in the rung into an effective site we show that the area law of entanglement entropy does not apply when n increases in our method and show that the reduced density matrix of each effective site will have a saturating number of dominant diagonal elements with increasing n these two characteristics make the mps rank needed to obtain a demanded energy accuracy quickly saturate when n is large making our algorithm efficient for large ns and the latter enables space reduction in mps within the framework of mps we prove a theorem that the spinspin correlation at infinite separation is the square of staggered magnetization and demonstrate that the eigenvalue structure of a building mps unit of langle gmid grangle mid grangle being the gs is responsible for order disorder and quasilongrange order
|
[['we', 'study', 'the', 'spinfrac12', 'antiferromagnetic', 'heisenberg', 'model', 'on', 'an', 'infinitybyn', 'square', 'lattice', 'for', 'even', 'ns', 'up', 'to', '14', 'previously', 'the', 'nonlinear', 'sigma', 'model', 'perturbatively', 'predicts', 'that', 'its', 'spin', 'rotational', 'symmetry', 'asymptotically', 'breaks', 'when', 'nrightarrow', 'infty', 'ie', 'when', 'it', 'is', 'twodimensional', '2d', 'however', 'we', 'identified', 'a', 'critical', 'width', 'n_c', '10', 'for', 'which', 'this', 'symmetry', 'breaks', 'spontaneously', 'it', 'defines', 'a', 'dimensional', 'transition', 'from', 'onedimension', '1d', 'including', 'quasi1d', 'to', '2d', 'the', 'finitesize', 'effect', 'differs', 'from', 'that', 'of', 'the', 'nbyn', 'lattice', 'the', 'ground', 'state', 'gs', 'energy', 'per', 'site', 'approaches', 'the', 'thermodynamic', 'limit', 'value', 'in', 'agreement', 'with', 'the', 'previously', 'accepted', 'value', 'by', 'one', 'order', 'of', '1n', 'faster', 'than', 'when', 'using', 'nbyn', 'lattices', 'in', 'the', 'literature', 'we', 'build', 'and', 'variationally', 'solve', 'a', 'matrix', 'product', 'state', 'mps', 'on', 'a', 'chain', 'converting', 'the', 'n', 'sites', 'in', 'the', 'rung', 'into', 'an', 'effective', 'site', 'we', 'show', 'that', 'the', 'area', 'law', 'of', 'entanglement', 'entropy', 'does', 'not', 'apply', 'when', 'n', 'increases', 'in', 'our', 'method', 'and', 'show', 'that', 'the', 'reduced', 'density', 'matrix', 'of', 'each', 'effective', 'site', 'will', 'have', 'a', 'saturating', 'number', 'of', 'dominant', 'diagonal', 'elements', 'with', 'increasing', 'n', 'these', 'two', 'characteristics', 'make', 'the', 'mps', 'rank', 'needed', 'to', 'obtain', 'a', 'demanded', 'energy', 'accuracy', 'quickly', 'saturate', 'when', 'n', 'is', 'large', 'making', 'our', 'algorithm', 'efficient', 'for', 'large', 'ns', 'and', 'the', 'latter', 'enables', 'space', 'reduction', 'in', 'mps', 'within', 'the', 'framework', 'of', 'mps', 'we', 'prove', 'a', 'theorem', 'that', 'the', 'spinspin', 'correlation', 'at', 'infinite', 'separation', 'is', 'the', 'square', 'of', 'staggered', 'magnetization', 'and', 'demonstrate', 'that', 'the', 'eigenvalue', 'structure', 'of', 'a', 'building', 'mps', 'unit', 'of', 'langle', 'gmid', 'grangle', 'mid', 'grangle', 'being', 'the', 'gs', 'is', 'responsible', 'for', 'order', 'disorder', 'and', 'quasilongrange', 'order']]
|
[-0.1286622346918239, 0.19314164152779278, -0.02397692923229116, 0.06340629262912616, 0.0012632995505878365, -0.15517683032159352, 0.05258717739318127, 0.36006979745701245, -0.23474337780689927, -0.26137947841838693, 0.08809785962574054, -0.3050950885063548, -0.0948370912464688, 0.13013430265350173, 0.061961000538467065, 0.03215881058938161, 0.028372552550602777, 0.08455706722890548, -0.11813655099382042, -0.23670638923966558, 0.27176538023479196, 0.015436804882146446, 0.2989769473853503, 0.03925773111427325, 0.07628252049080998, 0.019069382225066194, 0.07435470954047581, 0.015028532488252717, -0.12966061338577123, 0.07343295269458543, 0.21569936271688567, 0.024243504065853044, 0.22453768218464748, -0.4016240011958197, -0.16368290186413784, 0.10441714169504301, 0.1748452308771118, 0.14464925840707374, 0.023467490633834572, -0.24428819575613098, 0.07068150614399074, -0.20442220487570728, -0.16602676446323955, -0.0916151782735089, 0.039164419992086134, -0.027034051051546736, -0.29834893094595977, 0.09882868263527973, 0.06910423112810234, 0.03205637439130715, -0.035019076059385416, -0.1484249522621855, -0.04750990893325002, 0.11652769151147775, 0.03523747106289498, 0.0751621996126278, 0.07868825824855752, -0.10919363670443606, -0.07951754255469307, 0.37703467452445544, -0.06308850600784438, -0.16704036100879024, 0.12701119555153212, -0.15650305617420887, -0.1381960511707627, 0.14729421742037513, 0.10026816550721361, 0.07602665409368564, -0.08456928494709326, 0.12013194125939455, -0.05420857929385494, 0.23737755333905874, 0.019945201457704644, 0.012523728028823249, 0.16449565011792203, 0.16123188841947747, 0.1126413325353033, 0.1615493331126092, -0.08896726399883052, -0.11830283932722242, -0.2578296045373593, -0.16107459677181937, -0.2538787432888731, 0.1039997049055937, -0.12551756394355293, -0.1573713120094655, 0.36732865055001784, 0.14582022205887724, 0.1879729443449081, 0.06604710672883152, 0.22485651204750862, 0.12395494478452648, 0.07605252737241426, 0.10676509521417966, 0.19468560996447407, 0.13322188489006034, 0.054281806704519917, -0.2468531564944226, 0.0013429107311681546, 0.11789067836981096]
|
1,803.0378
|
Energy and Delay Optimization for Cache-Enabled Dense Small Cell
Networks
|
Caching popular files in small base stations (SBSs) has been proved to be an
effective way to reduce bandwidth pressure on the backhaul links of dense small
cell networks (DSCNs). Many existing studies on cache-enabled DSCNs attempt to
improve user experience by optimizing end-to-end file delivery delay. However,
under practical scenarios where files (e.g., video files) have diverse quality
of service requirements, energy consumption at SBSs should also be concerned
from the network perspective. In this paper,we attempt to optimize these two
critical metrics in cache-enabled DSCNs. Firstly, we formulate the energy-delay
optimization problem as a Mixed Integer Programming (MIP) problem, where file
placement, user association and power control are jointly considered. To model
the tradeoff relationship between energy consumption and end-to-end file
delivery delay, a utility function linearly combining these two metrics is used
as an objective function of the optimization problem. Then, we solve the
problem in two stages, i.e. caching stage and delivery stage, based on the
observation that caching is performed during off-peak time. At the caching
stage, a local popular file placement policy is proposed by estimating user
preference at each SBS. At the delivery stage, with given caching status at
SBSs, the MIP problem is further decomposed by Benders' decomposition method.
An efficient algorithm is proposed to approach the optimal association and
power solution by iteratively shrinking the gap of the upper and lower bounds.
Finally, extension simulations are performed to validate our analytical and
algorithmic work. The results demonstrate that the proposed algorithms can
achieve the optimal tradeoff between energy consumption and end-to-end file
delivery delay.
|
cs.NI
|
caching popular files in small base stations sbss has been proved to be an effective way to reduce bandwidth pressure on the backhaul links of dense small cell networks dscns many existing studies on cacheenabled dscns attempt to improve user experience by optimizing endtoend file delivery delay however under practical scenarios where files eg video files have diverse quality of service requirements energy consumption at sbss should also be concerned from the network perspective in this paperwe attempt to optimize these two critical metrics in cacheenabled dscns firstly we formulate the energydelay optimization problem as a mixed integer programming mip problem where file placement user association and power control are jointly considered to model the tradeoff relationship between energy consumption and endtoend file delivery delay a utility function linearly combining these two metrics is used as an objective function of the optimization problem then we solve the problem in two stages ie caching stage and delivery stage based on the observation that caching is performed during offpeak time at the caching stage a local popular file placement policy is proposed by estimating user preference at each sbs at the delivery stage with given caching status at sbss the mip problem is further decomposed by benders decomposition method an efficient algorithm is proposed to approach the optimal association and power solution by iteratively shrinking the gap of the upper and lower bounds finally extension simulations are performed to validate our analytical and algorithmic work the results demonstrate that the proposed algorithms can achieve the optimal tradeoff between energy consumption and endtoend file delivery delay
|
[['caching', 'popular', 'files', 'in', 'small', 'base', 'stations', 'sbss', 'has', 'been', 'proved', 'to', 'be', 'an', 'effective', 'way', 'to', 'reduce', 'bandwidth', 'pressure', 'on', 'the', 'backhaul', 'links', 'of', 'dense', 'small', 'cell', 'networks', 'dscns', 'many', 'existing', 'studies', 'on', 'cacheenabled', 'dscns', 'attempt', 'to', 'improve', 'user', 'experience', 'by', 'optimizing', 'endtoend', 'file', 'delivery', 'delay', 'however', 'under', 'practical', 'scenarios', 'where', 'files', 'eg', 'video', 'files', 'have', 'diverse', 'quality', 'of', 'service', 'requirements', 'energy', 'consumption', 'at', 'sbss', 'should', 'also', 'be', 'concerned', 'from', 'the', 'network', 'perspective', 'in', 'this', 'paperwe', 'attempt', 'to', 'optimize', 'these', 'two', 'critical', 'metrics', 'in', 'cacheenabled', 'dscns', 'firstly', 'we', 'formulate', 'the', 'energydelay', 'optimization', 'problem', 'as', 'a', 'mixed', 'integer', 'programming', 'mip', 'problem', 'where', 'file', 'placement', 'user', 'association', 'and', 'power', 'control', 'are', 'jointly', 'considered', 'to', 'model', 'the', 'tradeoff', 'relationship', 'between', 'energy', 'consumption', 'and', 'endtoend', 'file', 'delivery', 'delay', 'a', 'utility', 'function', 'linearly', 'combining', 'these', 'two', 'metrics', 'is', 'used', 'as', 'an', 'objective', 'function', 'of', 'the', 'optimization', 'problem', 'then', 'we', 'solve', 'the', 'problem', 'in', 'two', 'stages', 'ie', 'caching', 'stage', 'and', 'delivery', 'stage', 'based', 'on', 'the', 'observation', 'that', 'caching', 'is', 'performed', 'during', 'offpeak', 'time', 'at', 'the', 'caching', 'stage', 'a', 'local', 'popular', 'file', 'placement', 'policy', 'is', 'proposed', 'by', 'estimating', 'user', 'preference', 'at', 'each', 'sbs', 'at', 'the', 'delivery', 'stage', 'with', 'given', 'caching', 'status', 'at', 'sbss', 'the', 'mip', 'problem', 'is', 'further', 'decomposed', 'by', 'benders', 'decomposition', 'method', 'an', 'efficient', 'algorithm', 'is', 'proposed', 'to', 'approach', 'the', 'optimal', 'association', 'and', 'power', 'solution', 'by', 'iteratively', 'shrinking', 'the', 'gap', 'of', 'the', 'upper', 'and', 'lower', 'bounds', 'finally', 'extension', 'simulations', 'are', 'performed', 'to', 'validate', 'our', 'analytical', 'and', 'algorithmic', 'work', 'the', 'results', 'demonstrate', 'that', 'the', 'proposed', 'algorithms', 'can', 'achieve', 'the', 'optimal', 'tradeoff', 'between', 'energy', 'consumption', 'and', 'endtoend', 'file', 'delivery', 'delay']]
|
[-0.18227109974763664, -0.02921036183162364, -0.05186628475749844, 0.038753803532584764, -0.08112848749270968, -0.22166097027996817, 0.1345303367213399, 0.42563056444727987, -0.29792741881400175, -0.3565636699427868, 0.09636326511868562, -0.26370653938927013, -0.14020053764359014, 0.12177696180204106, -0.1253852388036292, 0.09780745954914975, 0.07222289640541425, 0.016222344780475354, -0.015361201283681302, -0.31969459810712064, 0.2874803244319528, 0.11875093384458198, 0.3847131915284257, 0.06199350106656488, 0.08240018248825401, -0.006729636211196109, -0.020226258267967222, -0.009400094736689709, -0.12049382172655287, 0.0957765180981424, 0.3721042801608321, 0.2405159697489912, 0.30988959944364347, -0.4518009949070065, -0.20182431352186678, 0.0701862502085778, 0.17434919066389645, 0.023428020935094857, -0.05855365320305365, -0.22301773338475947, 0.13940168615340295, -0.22024730409534485, -0.004014735705017363, 0.005221182220179885, -0.03604326562198169, 0.04720276749397171, -0.3359432568784251, -0.030949986776816853, -0.06631698340481633, -0.017109575114029676, -0.08862693927484519, -0.1267705576940521, 0.017737067330224943, 0.15825118539109473, 0.05771494165123547, 0.016899779233585745, 0.13123713515188984, -0.08538847394108758, -0.117574861696337, 0.38291929911347566, -0.0064127164684367076, -0.22114719486654383, 0.11026695343672861, 0.02080664869589101, -0.12629245479941764, 0.15649137765672871, 0.2737106219068623, 0.09642423738144734, -0.19540987642766985, 0.0026991450700983265, -0.015674496076190172, 0.182673322573568, 0.10494875747284643, 0.051141546909456555, 0.1576314517057823, 0.25432702755208475, 0.14738306266006912, 0.15366533074745758, -0.05206787418228832, -0.10974431546589097, -0.18438841726900054, -0.12260114182846465, -0.2062992060914664, -0.026418942984675158, -0.13843520410043963, -0.031791985858702757, 0.34918522698797655, 0.1340299728928495, 0.12601586307678725, 0.14871013958888843, 0.4211553932564199, 0.10229754558907815, 0.03187543157857273, 0.14718643405400358, 0.13631775119950987, -0.002870181730342852, 0.18615919768548228, -0.23263714216497264, 0.10360863174315357, 0.050497465492527184]
|
1,803.03781
|
The lamppost model: effects of photon trapping, the bottom lamp and disc
truncation
|
We study the lamppost model, in which the primary X-ray sources in accreting
black-hole systems are located symmetrically on the rotation axis on both sides
of the black hole surrounded by an accretion disc. We show the importance of
the emission of the source on the opposite side to the observer. Due to
gravitational light bending, its emission can increase the direct (i.e., not
re-emitted by the disc) flux by as much as an order of magnitude. This happens
for near to face-on observers when the disc is even moderately truncated. For
truncated discs, we also consider effects of emission of the top source
gravitationally bent around the black hole. We also present results for the
attenuation of the observed radiation with respect to that emitted by the
lamppost as functions of the lamppost height, black-hole spin and the degree of
disc truncation. This attenuation, which is due to the time dilation,
gravitational redshift and the loss of photons crossing the black-hole horizon,
can be as severe as by several orders of magnitude for low lamppost heights. We
also consider the contribution to the observed flux due to re-emission by
optically-thick matter within the innermost stable circular orbit.
|
astro-ph.HE
|
we study the lamppost model in which the primary xray sources in accreting blackhole systems are located symmetrically on the rotation axis on both sides of the black hole surrounded by an accretion disc we show the importance of the emission of the source on the opposite side to the observer due to gravitational light bending its emission can increase the direct ie not reemitted by the disc flux by as much as an order of magnitude this happens for near to faceon observers when the disc is even moderately truncated for truncated discs we also consider effects of emission of the top source gravitationally bent around the black hole we also present results for the attenuation of the observed radiation with respect to that emitted by the lamppost as functions of the lamppost height blackhole spin and the degree of disc truncation this attenuation which is due to the time dilation gravitational redshift and the loss of photons crossing the blackhole horizon can be as severe as by several orders of magnitude for low lamppost heights we also consider the contribution to the observed flux due to reemission by opticallythick matter within the innermost stable circular orbit
|
[['we', 'study', 'the', 'lamppost', 'model', 'in', 'which', 'the', 'primary', 'xray', 'sources', 'in', 'accreting', 'blackhole', 'systems', 'are', 'located', 'symmetrically', 'on', 'the', 'rotation', 'axis', 'on', 'both', 'sides', 'of', 'the', 'black', 'hole', 'surrounded', 'by', 'an', 'accretion', 'disc', 'we', 'show', 'the', 'importance', 'of', 'the', 'emission', 'of', 'the', 'source', 'on', 'the', 'opposite', 'side', 'to', 'the', 'observer', 'due', 'to', 'gravitational', 'light', 'bending', 'its', 'emission', 'can', 'increase', 'the', 'direct', 'ie', 'not', 'reemitted', 'by', 'the', 'disc', 'flux', 'by', 'as', 'much', 'as', 'an', 'order', 'of', 'magnitude', 'this', 'happens', 'for', 'near', 'to', 'faceon', 'observers', 'when', 'the', 'disc', 'is', 'even', 'moderately', 'truncated', 'for', 'truncated', 'discs', 'we', 'also', 'consider', 'effects', 'of', 'emission', 'of', 'the', 'top', 'source', 'gravitationally', 'bent', 'around', 'the', 'black', 'hole', 'we', 'also', 'present', 'results', 'for', 'the', 'attenuation', 'of', 'the', 'observed', 'radiation', 'with', 'respect', 'to', 'that', 'emitted', 'by', 'the', 'lamppost', 'as', 'functions', 'of', 'the', 'lamppost', 'height', 'blackhole', 'spin', 'and', 'the', 'degree', 'of', 'disc', 'truncation', 'this', 'attenuation', 'which', 'is', 'due', 'to', 'the', 'time', 'dilation', 'gravitational', 'redshift', 'and', 'the', 'loss', 'of', 'photons', 'crossing', 'the', 'blackhole', 'horizon', 'can', 'be', 'as', 'severe', 'as', 'by', 'several', 'orders', 'of', 'magnitude', 'for', 'low', 'lamppost', 'heights', 'we', 'also', 'consider', 'the', 'contribution', 'to', 'the', 'observed', 'flux', 'due', 'to', 'reemission', 'by', 'opticallythick', 'matter', 'within', 'the', 'innermost', 'stable', 'circular', 'orbit']]
|
[-0.09990166280785519, 0.12492653540693661, -0.03555466186471584, 0.09797240119686731, -0.05974881536905852, -0.06287500198878762, -0.006055165073984877, 0.3959595980969342, -0.23114830003392817, -0.3094830965776716, 0.1126503417435375, -0.2873272645672915, -0.023559129184271877, 0.22625398440427627, -0.05380360753512988, 0.0013525063319559764, -0.015656894077299952, -0.02639693637952359, -0.06933672562401184, -0.19349492571288437, 0.3726214855730609, 0.12800583891062575, 0.14940397817796716, 0.02334060098957082, 0.06442409703705573, 0.008551368393436676, 0.004925226799748612, 0.008363195323394705, -0.10524705095667741, 0.06270671428729206, 0.1861636735701162, 0.06010072147991094, 0.18497358673637865, -0.41631852238523687, -0.21407498627186122, 0.05936461101954031, 0.16739376187277488, 0.09816111579438615, -0.05458678953076779, -0.24249123742408824, 0.04985698716682053, -0.19734817790051257, -0.183335698155611, 0.07690293023908379, 0.056538966077502174, -0.004277999666895755, -0.1901593701443588, 0.10896393857414792, 0.09247293424230502, -0.01502497485107413, -0.08979628624152299, -0.02962645861047386, -0.0890395139753254, 0.06325834271021193, 0.1353185413448808, 0.06182590217889296, 0.22001338577264865, -0.12860912940878835, -0.08948518178482173, 0.3942767312571482, -0.07823186610634862, -0.11583057814983255, 0.17682605763342268, -0.2670110213485631, -0.04900829624819729, 0.19479327588436204, 0.18604830164236552, 0.1540157764802, -0.08854577507074944, 0.026193070670647425, -0.021964259936022714, 0.2082999518818476, 0.11152980329275997, 0.04927231559313533, 0.3776026310098141, 0.08685122491413201, 0.04490855159802419, 0.19219887719049844, -0.18613026080408482, -0.048831778317407676, -0.2854815457213783, -0.07574413704093207, -0.14993443242932736, 0.0646641043878679, -0.12176676822098377, -0.1645822080126799, 0.34976309937932953, 0.11014013874786671, 0.20875866016410669, 0.039460996619773786, 0.33883244276394825, 0.13561533649735424, 0.07414843133566054, 0.12038245641466494, 0.3592929998365692, 0.13449063168478792, 0.07230390816799957, -0.26701331933057215, 0.046674570939002374, 0.019216049344965604]
|
1,803.03782
|
Electrodynamics of ferroelectric films with negative capacitance
|
We construct a comprehensive theory of the electrodynamic response of
ferroelectric ultra-thin films containing periodic domain textures (PDT) with
180{\deg} polarization-oriented domains. The focal point of the theory is the
negative-capacitance phenomenon which naturally arises from the depolarization
field induced by PDT. We derive frequency-dependent dielectric permittivity
related to the PDT dynamics across the entire frequency range. We find the
resonance mode of domain oscillations in the THz spectral band and the singular
points in the phase of the reflected THz beam that are intimately related to
the negative capacitance. Our findings provide a platform for the THz negative
capacitance-based optics of ferroelectric films and for engineering the
epsilon-near-zero plasmonic THz metamaterials.
|
cond-mat.mes-hall
|
we construct a comprehensive theory of the electrodynamic response of ferroelectric ultrathin films containing periodic domain textures pdt with 180deg polarizationoriented domains the focal point of the theory is the negativecapacitance phenomenon which naturally arises from the depolarization field induced by pdt we derive frequencydependent dielectric permittivity related to the pdt dynamics across the entire frequency range we find the resonance mode of domain oscillations in the thz spectral band and the singular points in the phase of the reflected thz beam that are intimately related to the negative capacitance our findings provide a platform for the thz negative capacitancebased optics of ferroelectric films and for engineering the epsilonnearzero plasmonic thz metamaterials
|
[['we', 'construct', 'a', 'comprehensive', 'theory', 'of', 'the', 'electrodynamic', 'response', 'of', 'ferroelectric', 'ultrathin', 'films', 'containing', 'periodic', 'domain', 'textures', 'pdt', 'with', '180deg', 'polarizationoriented', 'domains', 'the', 'focal', 'point', 'of', 'the', 'theory', 'is', 'the', 'negativecapacitance', 'phenomenon', 'which', 'naturally', 'arises', 'from', 'the', 'depolarization', 'field', 'induced', 'by', 'pdt', 'we', 'derive', 'frequencydependent', 'dielectric', 'permittivity', 'related', 'to', 'the', 'pdt', 'dynamics', 'across', 'the', 'entire', 'frequency', 'range', 'we', 'find', 'the', 'resonance', 'mode', 'of', 'domain', 'oscillations', 'in', 'the', 'thz', 'spectral', 'band', 'and', 'the', 'singular', 'points', 'in', 'the', 'phase', 'of', 'the', 'reflected', 'thz', 'beam', 'that', 'are', 'intimately', 'related', 'to', 'the', 'negative', 'capacitance', 'our', 'findings', 'provide', 'a', 'platform', 'for', 'the', 'thz', 'negative', 'capacitancebased', 'optics', 'of', 'ferroelectric', 'films', 'and', 'for', 'engineering', 'the', 'epsilonnearzero', 'plasmonic', 'thz', 'metamaterials']]
|
[-0.16941927133805373, 0.1600361199626191, -0.03346785542936149, -0.04301476552976634, -0.09822631865020164, -0.09804195228286765, 0.04042286593466997, 0.4479844164378433, -0.2752360362369059, -0.23927320895547216, 0.034423956255936486, -0.28267749246548524, -0.20284354312514716, 0.23265664659821514, -0.005726950615644455, 0.02980253721841357, -0.06442566947503524, -0.1044314968714554, -0.019258399178612638, -0.07700696971944787, 0.2843899373811754, -0.01826912420457864, 0.3229037163609808, 0.10549515214833347, 0.06836874456652864, -0.0061314446258951315, 0.08098042103546586, -0.017292699180755086, -0.15062874137332652, 0.12312176330015064, 0.317951148155738, -0.0598620458167385, 0.2011986337432807, -0.42870851621370426, -0.24532889644192024, 0.0030281221959739925, 0.08145533908708867, 0.11630546642276882, -0.06625827249689874, -0.28163347374647857, 0.04126365871634334, -0.044420406958934934, -0.1571740783962675, -0.03967246493239972, -0.0310930113974874, 0.023277392611436715, -0.2573642883957787, 0.06003346427089789, 0.04120067258111455, 0.0955741598948159, -0.1147072398273105, -0.10369894970208407, -0.024658433117226444, 0.0600069039162587, 0.0412496405674822, 0.024308686750009655, 0.18804863017391074, -0.10547873690004715, -0.12023151640949602, 0.3549072296549143, -0.05011277074571064, -0.10609479904722485, 0.11284398153551262, -0.2409713895060122, 0.04973995244469155, 0.2092496016655456, 0.16227665130387653, 0.12797498054040427, -0.12781824281926013, 0.07570010170404037, 0.023717179576950995, 0.21523555878851436, 0.13468363249928436, 0.0932591724992645, 0.2688693071292205, 0.18177465619519353, 0.016228481983257964, 0.1877894942310046, -0.11123419918373904, -0.013199781893159856, -0.28444975794885646, -0.14562877836552532, -0.1998553242373005, 0.05497793873602694, -0.11037293121996547, -0.2590936999514022, 0.47105234067209745, 0.1459407916885208, 0.1028568147554655, -0.05054931786805603, 0.24045490683056414, 0.12422172092430463, 0.0830734092911536, -0.02716625612440773, 0.28652535891372033, 0.17607857080769132, 0.1867518615316261, -0.29662314780183474, -0.0240379433486272, -0.056265439656139775]
|
1,803.03783
|
Linearized stability analysis of Caputo-Katugampola fractional-order
nonlinear systems
|
In this paper, a linearized asymptotic stability result for a
Caputo-Katugampola fractional-order systems is described. An application is
given to demonstrate the validity of the proposed results.
|
math.DS
|
in this paper a linearized asymptotic stability result for a caputokatugampola fractionalorder systems is described an application is given to demonstrate the validity of the proposed results
|
[['in', 'this', 'paper', 'a', 'linearized', 'asymptotic', 'stability', 'result', 'for', 'a', 'caputokatugampola', 'fractionalorder', 'systems', 'is', 'described', 'an', 'application', 'is', 'given', 'to', 'demonstrate', 'the', 'validity', 'of', 'the', 'proposed', 'results']]
|
[-0.17563574787453506, -0.03965678920104875, -0.1082217899599561, 0.026286091332116887, -0.026574067840421642, -0.039579767354384614, -0.0136665165450217, 0.2427442172818162, -0.2290158580850672, -0.2188516183997746, 0.14633584023815477, -0.20107028095258606, -0.23353201330259996, 0.23558307825415223, -0.1338510412239918, 0.10168100231223637, 0.05238678539171815, 0.04283181415801799, -0.05731490468261419, -0.2664417354734959, 0.2968073934316635, 0.05839713697356207, 0.2755808476703586, 0.08324808147908361, 0.10675064860670655, -0.012273658963817137, 0.03827217360096121, 0.038251363361875214, -0.14458269274069202, 0.11346389987954388, 0.2539926487262602, 0.09130748768371565, 0.3209414702874643, -0.32590405601594186, -0.21150025794351543, 0.042916140225888404, 0.16090374319227757, 0.10828857530874235, -0.08494465742950086, -0.3044487505599304, 0.17077673719850955, -0.20866125132198687, -0.25901560650931466, -0.10638783209853703, -0.028026794600817893, 0.026970601813108834, -0.344644851775633, 0.06265345177854653, 0.14955563113714257, 0.07657215033692343, -0.13334984960103477, -0.031746127280510135, 0.04709962324273807, 0.07671576431366028, 0.04922081856919384, -0.04138200802521573, 0.024019883945584297, -0.07819806024673637, -0.14547293764297609, 0.3657547820497442, -0.069363367329869, -0.28065865945622875, 0.17852075615276894, -0.06389586275650395, -0.12454043494330512, 0.04105766731555815, 0.1397165959287021, 0.16512886738335644, -0.18104537921371283, 0.1072535372031443, -0.046089609877930746, 0.1928866589096961, 0.04388955973640636, -0.020234661176800728, 0.10934697006208201, 0.265023874308638, 0.06000132108521131, 0.19654834192004744, -0.012771718893890028, -0.12170140398666263, -0.33777237435181934, -0.18644226814999623, -0.22696806186879123, 0.004246940180935242, -0.058673420524293626, -0.1598539682864039, 0.4370798231274993, 0.18837531214510952, 0.15765367858801727, 0.10698568413068575, 0.2981755961836488, 0.21862452180573233, -0.061752111202588784, 0.050859270694976054, 0.27362229440499236, 0.16047065470505645, 0.12966629269498367, -0.22809481320695746, 0.042917618821202604, 0.13207208768775067]
|
1,803.03784
|
Combining Method of Alternating Projections and Augmented Lagrangian for
Task Constrained Trajectory Optimization
|
Motion planning for manipulators under task space constraints is difficult as
it constrains the joint configurations to always lie on an implicitly defined
manifold. It is possible to view task constrained motion planning as an
optimization problem with non-linear equality constraints which can be solved
by general non-linear optimization techniques. In this paper, we present a
novel custom optimizer which exploits the underlying structure present in many
task constraints.
At the core of our approach are some simple reformulations, which when
coupled with the \emph{method of alternating projection}, leads to an efficient
convex optimization based routine for computing a feasible solution to the task
constraints. We subsequently build on this result and use the concept of
Augmented Lagrangian to guide the feasible solutions towards those which also
minimize the user defined cost function. We show that the proposed optimizer is
fully distributive and thus, can be easily parallelized. We validate our
formulation on some common robotic benchmark problems. In particular, we show
that the proposed optimizer achieves cyclic motion in the joint space
corresponding to a similar nature trajectory in the task space. Furthermore, as
a baseline, we compare the proposed optimizer with an off-the-shelf non-linear
solver provide in open source package SciPy. We show that for similar task
constraint residuals and smoothness cost, it can be upto more than three times
faster than the SciPy alternative.
|
cs.RO
|
motion planning for manipulators under task space constraints is difficult as it constrains the joint configurations to always lie on an implicitly defined manifold it is possible to view task constrained motion planning as an optimization problem with nonlinear equality constraints which can be solved by general nonlinear optimization techniques in this paper we present a novel custom optimizer which exploits the underlying structure present in many task constraints at the core of our approach are some simple reformulations which when coupled with the emphmethod of alternating projection leads to an efficient convex optimization based routine for computing a feasible solution to the task constraints we subsequently build on this result and use the concept of augmented lagrangian to guide the feasible solutions towards those which also minimize the user defined cost function we show that the proposed optimizer is fully distributive and thus can be easily parallelized we validate our formulation on some common robotic benchmark problems in particular we show that the proposed optimizer achieves cyclic motion in the joint space corresponding to a similar nature trajectory in the task space furthermore as a baseline we compare the proposed optimizer with an offtheshelf nonlinear solver provide in open source package scipy we show that for similar task constraint residuals and smoothness cost it can be upto more than three times faster than the scipy alternative
|
[['motion', 'planning', 'for', 'manipulators', 'under', 'task', 'space', 'constraints', 'is', 'difficult', 'as', 'it', 'constrains', 'the', 'joint', 'configurations', 'to', 'always', 'lie', 'on', 'an', 'implicitly', 'defined', 'manifold', 'it', 'is', 'possible', 'to', 'view', 'task', 'constrained', 'motion', 'planning', 'as', 'an', 'optimization', 'problem', 'with', 'nonlinear', 'equality', 'constraints', 'which', 'can', 'be', 'solved', 'by', 'general', 'nonlinear', 'optimization', 'techniques', 'in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'custom', 'optimizer', 'which', 'exploits', 'the', 'underlying', 'structure', 'present', 'in', 'many', 'task', 'constraints', 'at', 'the', 'core', 'of', 'our', 'approach', 'are', 'some', 'simple', 'reformulations', 'which', 'when', 'coupled', 'with', 'the', 'emphmethod', 'of', 'alternating', 'projection', 'leads', 'to', 'an', 'efficient', 'convex', 'optimization', 'based', 'routine', 'for', 'computing', 'a', 'feasible', 'solution', 'to', 'the', 'task', 'constraints', 'we', 'subsequently', 'build', 'on', 'this', 'result', 'and', 'use', 'the', 'concept', 'of', 'augmented', 'lagrangian', 'to', 'guide', 'the', 'feasible', 'solutions', 'towards', 'those', 'which', 'also', 'minimize', 'the', 'user', 'defined', 'cost', 'function', 'we', 'show', 'that', 'the', 'proposed', 'optimizer', 'is', 'fully', 'distributive', 'and', 'thus', 'can', 'be', 'easily', 'parallelized', 'we', 'validate', 'our', 'formulation', 'on', 'some', 'common', 'robotic', 'benchmark', 'problems', 'in', 'particular', 'we', 'show', 'that', 'the', 'proposed', 'optimizer', 'achieves', 'cyclic', 'motion', 'in', 'the', 'joint', 'space', 'corresponding', 'to', 'a', 'similar', 'nature', 'trajectory', 'in', 'the', 'task', 'space', 'furthermore', 'as', 'a', 'baseline', 'we', 'compare', 'the', 'proposed', 'optimizer', 'with', 'an', 'offtheshelf', 'nonlinear', 'solver', 'provide', 'in', 'open', 'source', 'package', 'scipy', 'we', 'show', 'that', 'for', 'similar', 'task', 'constraint', 'residuals', 'and', 'smoothness', 'cost', 'it', 'can', 'be', 'upto', 'more', 'than', 'three', 'times', 'faster', 'than', 'the', 'scipy', 'alternative']]
|
[-0.0786501750106911, -0.015057058328206729, -0.09258467022284439, 0.0608225116062097, -0.16181344361893735, -0.15983418362535176, 0.008271075209750412, 0.4302950296509962, -0.3174050479249348, -0.3417620675285482, 0.13122106345866844, -0.19907134731550444, -0.18320494380447241, 0.22877552249522198, -0.10783941284540713, 0.0866443552333238, 0.11361706020753617, 0.011199594913424907, -0.09761129255023977, -0.2717486515873017, 0.2677720692357467, 0.05285135702751084, 0.2559639196309552, 0.020174276865023856, 0.13744279620799724, 0.021006720405203263, 0.02261534289842562, 0.04492657873966723, -0.09239075046248958, 0.14450139584561342, 0.26600579813221215, 0.19843125379837162, 0.28469864300468584, -0.4287863018951227, -0.17072818123854466, 0.0899910416273556, 0.1362770218386762, 0.07483554765836455, -0.01656454621275963, -0.2748934373316983, 0.08225717382517844, -0.1466727919111414, -0.07470452409270445, -0.12631388185371437, -0.021570031403970086, -0.020748289117368045, -0.31073178524394535, 0.008828052652293061, 0.0385608480912982, -0.006314723598586174, -0.07973406722641956, -0.09923710645046208, 0.02370005076349044, 0.08007985459897557, 0.02210537598382206, 0.08138922410955579, 0.1178490358506358, -0.0975335179499888, -0.14687364096271227, 0.40378017072762784, -0.04160707302061771, -0.2737645734273849, 0.17273150864241865, -0.018828191550341867, -0.17909723421402834, 0.11484158442392617, 0.210488192565813, 0.17674470634819192, -0.18364541832054299, 0.06194519994925043, -0.06282617144070213, 0.16705266312780145, 0.020338462593879076, -0.015945920928654215, 0.15681903809206438, 0.2148829313540741, 0.16552252369796414, 0.16266142259021638, -0.03535642631614523, -0.10808584715536126, -0.2757151794418824, -0.14264977288879618, -0.17050915911982434, -0.022339000030203275, -0.07618466885084756, -0.1208153599919341, 0.3607317906412571, 0.19065094256408446, 0.16202411922679533, 0.10799139306884636, 0.3404764563731423, 0.1144590185527456, 0.07469655135810573, 0.12405364286402724, 0.19791003274254393, 0.02214704571309241, 0.07857551481928636, -0.22444962352536832, 0.039427937476153155, 0.05981802071407766]
|
1,803.03785
|
Statistical mechanics of high-density bond percolation
|
High-density (HD) percolation describes the percolation over specific
$\kappa$ -clusters, which are the compact sets of sites each connected to
$\kappa$ nearest filled sites at least. It takes place in the classical
patterns of independently distributed sites or bonds in which the ordinary
percolation transition also exsists. Hence, the study of series of $\kappa$
-type percolations amounts to the description of structure of classical
clusters for which $\kappa$ -clusters constitute $\kappa$ -cores nested one
into another. Such data are needed for description of a number of physical,
biological information and other properties of complex systems on random
lattices, graphs and networks. They range from magnetic properties of
semiconductor alloys to anomalies in supercooled water and clustering in
biological and social networks. Here we present the statistical mechanics
approach to study HD bond percolation on arbitrary graph. It is shown that
generating function for $\kappa$ -clusters' size distribution can be obtained
from partition function of specific $q$-state Potts-Ising model in $q \to 1$
limit. Using this approach we find exact $\kappa$ -clusters' size distribution
for Bethe lattice and Erdos Renyi graph. The application of the method to
Euclidean lattices is also discussed.
|
cond-mat.stat-mech cond-mat.dis-nn
|
highdensity hd percolation describes the percolation over specific kappa clusters which are the compact sets of sites each connected to kappa nearest filled sites at least it takes place in the classical patterns of independently distributed sites or bonds in which the ordinary percolation transition also exsists hence the study of series of kappa type percolations amounts to the description of structure of classical clusters for which kappa clusters constitute kappa cores nested one into another such data are needed for description of a number of physical biological information and other properties of complex systems on random lattices graphs and networks they range from magnetic properties of semiconductor alloys to anomalies in supercooled water and clustering in biological and social networks here we present the statistical mechanics approach to study hd bond percolation on arbitrary graph it is shown that generating function for kappa clusters size distribution can be obtained from partition function of specific qstate pottsising model in q to 1 limit using this approach we find exact kappa clusters size distribution for bethe lattice and erdos renyi graph the application of the method to euclidean lattices is also discussed
|
[['highdensity', 'hd', 'percolation', 'describes', 'the', 'percolation', 'over', 'specific', 'kappa', 'clusters', 'which', 'are', 'the', 'compact', 'sets', 'of', 'sites', 'each', 'connected', 'to', 'kappa', 'nearest', 'filled', 'sites', 'at', 'least', 'it', 'takes', 'place', 'in', 'the', 'classical', 'patterns', 'of', 'independently', 'distributed', 'sites', 'or', 'bonds', 'in', 'which', 'the', 'ordinary', 'percolation', 'transition', 'also', 'exsists', 'hence', 'the', 'study', 'of', 'series', 'of', 'kappa', 'type', 'percolations', 'amounts', 'to', 'the', 'description', 'of', 'structure', 'of', 'classical', 'clusters', 'for', 'which', 'kappa', 'clusters', 'constitute', 'kappa', 'cores', 'nested', 'one', 'into', 'another', 'such', 'data', 'are', 'needed', 'for', 'description', 'of', 'a', 'number', 'of', 'physical', 'biological', 'information', 'and', 'other', 'properties', 'of', 'complex', 'systems', 'on', 'random', 'lattices', 'graphs', 'and', 'networks', 'they', 'range', 'from', 'magnetic', 'properties', 'of', 'semiconductor', 'alloys', 'to', 'anomalies', 'in', 'supercooled', 'water', 'and', 'clustering', 'in', 'biological', 'and', 'social', 'networks', 'here', 'we', 'present', 'the', 'statistical', 'mechanics', 'approach', 'to', 'study', 'hd', 'bond', 'percolation', 'on', 'arbitrary', 'graph', 'it', 'is', 'shown', 'that', 'generating', 'function', 'for', 'kappa', 'clusters', 'size', 'distribution', 'can', 'be', 'obtained', 'from', 'partition', 'function', 'of', 'specific', 'qstate', 'pottsising', 'model', 'in', 'q', 'to', '1', 'limit', 'using', 'this', 'approach', 'we', 'find', 'exact', 'kappa', 'clusters', 'size', 'distribution', 'for', 'bethe', 'lattice', 'and', 'erdos', 'renyi', 'graph', 'the', 'application', 'of', 'the', 'method', 'to', 'euclidean', 'lattices', 'is', 'also', 'discussed']]
|
[-0.10863261080960492, 0.15126802637759182, -0.051233246979160756, 0.06485354813448986, -0.04151066705934388, -0.13161473011440306, 0.0847620703267653, 0.3882819038332888, -0.271339966846561, -0.2609188279171509, 0.05097594141785213, -0.3230104709201783, -0.1366935127683319, 0.1447503859147666, 0.024604329193828912, 0.029271282217460413, 0.04140657922203737, 0.062218297598144366, 0.009195373618418459, -0.26573370331091434, 0.2999467518847071, -0.0001379253525070097, 0.27314909962227657, 0.037841686749801276, 0.03802265601649033, 0.008187797667074299, 0.04263842726254432, 0.06264458180321429, -0.1932198126696339, 0.11239394796194531, 0.22803697832515119, 0.08941813703766832, 0.19758316443120646, -0.39399958875956675, -0.2637116086309549, 0.11732000195440989, 0.15450663347950294, 0.08511067214163227, 0.03367286008565869, -0.25094724997937207, 0.09312717996478553, -0.13669548153867403, -0.14054412438371588, -0.05451513370609887, 0.06868592787548781, 0.06368194115668456, -0.26358399592819204, 0.0956680879989151, 0.0560080897168961, 0.06427004830123334, -0.05874227394137985, -0.15077715141885967, -0.0068462517349019885, 0.12795941592884008, -0.022972160470474845, 0.013757258199682588, 0.12675969959754083, -0.12766197607753965, -0.11874984443512937, 0.4041908350083287, 0.005836667830528564, -0.1492673318695139, 0.21062878078766287, -0.16841025284870906, -0.22211911694378292, 0.09775299260826417, 0.16350491128605668, 0.09298586743888716, -0.15125097728687925, 0.07726509442950831, -0.03628804623863842, 0.1789362239035428, 0.0713136252311487, 0.02909944573831227, 0.20951114837006327, 0.1845662522538708, 0.05157986135596518, 0.18745472858981452, -0.05803608371033555, -0.13688767271451455, -0.22562423305310034, -0.13731785155229131, -0.24342863623634295, 0.06776934068295218, -0.19403592259436783, -0.22959180277813518, 0.3180502112314263, 0.12369426697410678, 0.1859084531940796, 0.05260774374523116, 0.19909020254841794, 0.06627454392725315, 0.07181120175799285, 0.06281623876870428, 0.11827037047111878, 0.15842811807173318, 0.05336856006006538, -0.16174464794023644, 0.05386158769516639, 0.09828751670349409]
|
1,803.03786
|
We Built a Fake News & Click-bait Filter: What Happened Next Will Blow
Your Mind!
|
It is completely amazing! Fake news and click-baits have totally invaded the
cyber space. Let us face it: everybody hates them for three simple reasons.
Reason #2 will absolutely amaze you. What these can achieve at the time of
election will completely blow your mind! Now, we all agree, this cannot go on,
you know, somebody has to stop it. So, we did this research on fake
news/click-bait detection and trust us, it is totally great research, it really
is! Make no mistake. This is the best research ever! Seriously, come have a
look, we have it all: neural networks, attention mechanism, sentiment lexicons,
author profiling, you name it. Lexical features, semantic features, we
absolutely have it all. And we have totally tested it, trust us! We have
results, and numbers, really big numbers. The best numbers ever! Oh, and
analysis, absolutely top notch analysis. Interested? Come read the shocking
truth about fake news and click-bait in the Bulgarian cyber space. You won't
believe what we have found!
|
cs.CL
|
it is completely amazing fake news and clickbaits have totally invaded the cyber space let us face it everybody hates them for three simple reasons reason 2 will absolutely amaze you what these can achieve at the time of election will completely blow your mind now we all agree this cannot go on you know somebody has to stop it so we did this research on fake newsclickbait detection and trust us it is totally great research it really is make no mistake this is the best research ever seriously come have a look we have it all neural networks attention mechanism sentiment lexicons author profiling you name it lexical features semantic features we absolutely have it all and we have totally tested it trust us we have results and numbers really big numbers the best numbers ever oh and analysis absolutely top notch analysis interested come read the shocking truth about fake news and clickbait in the bulgarian cyber space you wont believe what we have found
|
[['it', 'is', 'completely', 'amazing', 'fake', 'news', 'and', 'clickbaits', 'have', 'totally', 'invaded', 'the', 'cyber', 'space', 'let', 'us', 'face', 'it', 'everybody', 'hates', 'them', 'for', 'three', 'simple', 'reasons', 'reason', '2', 'will', 'absolutely', 'amaze', 'you', 'what', 'these', 'can', 'achieve', 'at', 'the', 'time', 'of', 'election', 'will', 'completely', 'blow', 'your', 'mind', 'now', 'we', 'all', 'agree', 'this', 'can', 'not', 'go', 'on', 'you', 'know', 'somebody', 'has', 'to', 'stop', 'it', 'so', 'we', 'did', 'this', 'research', 'on', 'fake', 'newsclickbait', 'detection', 'and', 'trust', 'us', 'it', 'is', 'totally', 'great', 'research', 'it', 'really', 'is', 'make', 'no', 'mistake', 'this', 'is', 'the', 'best', 'research', 'ever', 'seriously', 'come', 'have', 'a', 'look', 'we', 'have', 'it', 'all', 'neural', 'networks', 'attention', 'mechanism', 'sentiment', 'lexicons', 'author', 'profiling', 'you', 'name', 'it', 'lexical', 'features', 'semantic', 'features', 'we', 'absolutely', 'have', 'it', 'all', 'and', 'we', 'have', 'totally', 'tested', 'it', 'trust', 'us', 'we', 'have', 'results', 'and', 'numbers', 'really', 'big', 'numbers', 'the', 'best', 'numbers', 'ever', 'oh', 'and', 'analysis', 'absolutely', 'top', 'notch', 'analysis', 'interested', 'come', 'read', 'the', 'shocking', 'truth', 'about', 'fake', 'news', 'and', 'clickbait', 'in', 'the', 'bulgarian', 'cyber', 'space', 'you', 'wont', 'believe', 'what', 'we', 'have', 'found']]
|
[-0.07857469955046555, 0.08548741320058882, -0.13255504191669074, 0.15819420029540285, -0.227646842690932, -0.2315628786158642, 0.0880913858519432, 0.4496782931839367, -0.21969619849250613, -0.2870582065790401, 0.11357340751031782, -0.3732949956069271, -0.16394224492442644, 0.1463868815293619, -0.1332085406627997, 0.008291003087948182, 0.08410440124069413, 0.08410567846734768, 0.040969629972771614, -0.40048752415891803, 0.28938099487773894, 0.026402741398740402, 0.2740853950269743, 0.08023590216145454, 0.05533921673704318, -0.052838410978264055, -0.07410189798269086, -0.04790533622998666, -0.11371221499584482, 0.09668680117604975, 0.3533472464347403, 0.24952469315675427, 0.35132602374710725, -0.39735029476644573, -0.14909665333804212, 0.20034535678137028, 0.1378587284041736, 0.11728231415353314, -0.008391677326673341, -0.3130302872553378, 0.08888124928755328, -0.21936097550958752, -0.0997515485181423, -0.14006736537882178, 0.04334227391658072, -0.07854817635073008, -0.10899635928984129, -0.06009475037477866, 0.08500753592108627, 0.08971608801979103, 0.023392439295654884, -0.1162236960727476, 0.01410295651405391, 0.21786428750199852, 0.08173579641221883, 0.03287181595631758, 0.13240664769702976, -0.10004444373910967, -0.09785059653780238, 0.3686932162521128, 0.026245964228170004, -0.20064250358190766, 0.17586684037518582, -0.14696062676898555, -0.18655436399007985, 0.0976481776751444, 0.13780073418970704, 0.0697567908271616, -0.13992139626807437, 0.025544435558924283, -0.09729892811542767, 0.18643071782575854, 0.1430098970872378, -0.04845071920022246, 0.25281115503379414, 0.12193419148075091, 0.05706008890654869, 0.01687232596649158, -0.024899687050753915, -0.03946352879792831, -0.21020607809148573, -0.1775099701822518, -0.12716481349400305, 0.10214252473340679, 0.012608031606166428, -0.11577781571373678, 0.3566940154066075, 0.23848668589050362, 0.1582940628342219, 0.026601760366912038, 0.29569560326747374, 0.013569582975887787, 0.12919658468757383, 0.08836111996683967, 0.23601855597776655, -0.011280609153435582, 0.21657102877932216, -0.03872156691664975, 0.15054618891657603, 0.006365095505011296]
|
1,803.03787
|
Interplay of structural design and interaction processes in
tunnel-injection semiconductor lasers
|
Tunnel-injection lasers promise various advantages in comparison to
conventional laser designs. In this paper, we present a theoretical analysis
for the physics of the tunnel-injection process in quantum-dot based laser
devices. We describe the carrier dynamics in terms of scattering between states
of the coupled system consisting of injector quantum-well, tunnel-barrier, and
quantum-dots. Our analysis demonstrates how current quantum-dot based lasers
can benefit from the tunnel-injection design. We find that the often assumed
LO-phonon resonance condition for the level alignment only weakly influences
the injection rate of carriers into the quantum-dot states. On the other hand,
our investigations show that the energetic alignment of quantum-dot and
quantum-well states modifies the injection efficiency, as it controls the
hybridization strength. Our description of tunneling includes the
phonon-mediated and the Coulomb scattering contributions and is based on
material realistic electronic structure calculations.
|
physics.app-ph cond-mat.mes-hall
|
tunnelinjection lasers promise various advantages in comparison to conventional laser designs in this paper we present a theoretical analysis for the physics of the tunnelinjection process in quantumdot based laser devices we describe the carrier dynamics in terms of scattering between states of the coupled system consisting of injector quantumwell tunnelbarrier and quantumdots our analysis demonstrates how current quantumdot based lasers can benefit from the tunnelinjection design we find that the often assumed lophonon resonance condition for the level alignment only weakly influences the injection rate of carriers into the quantumdot states on the other hand our investigations show that the energetic alignment of quantumdot and quantumwell states modifies the injection efficiency as it controls the hybridization strength our description of tunneling includes the phononmediated and the coulomb scattering contributions and is based on material realistic electronic structure calculations
|
[['tunnelinjection', 'lasers', 'promise', 'various', 'advantages', 'in', 'comparison', 'to', 'conventional', 'laser', 'designs', 'in', 'this', 'paper', 'we', 'present', 'a', 'theoretical', 'analysis', 'for', 'the', 'physics', 'of', 'the', 'tunnelinjection', 'process', 'in', 'quantumdot', 'based', 'laser', 'devices', 'we', 'describe', 'the', 'carrier', 'dynamics', 'in', 'terms', 'of', 'scattering', 'between', 'states', 'of', 'the', 'coupled', 'system', 'consisting', 'of', 'injector', 'quantumwell', 'tunnelbarrier', 'and', 'quantumdots', 'our', 'analysis', 'demonstrates', 'how', 'current', 'quantumdot', 'based', 'lasers', 'can', 'benefit', 'from', 'the', 'tunnelinjection', 'design', 'we', 'find', 'that', 'the', 'often', 'assumed', 'lophonon', 'resonance', 'condition', 'for', 'the', 'level', 'alignment', 'only', 'weakly', 'influences', 'the', 'injection', 'rate', 'of', 'carriers', 'into', 'the', 'quantumdot', 'states', 'on', 'the', 'other', 'hand', 'our', 'investigations', 'show', 'that', 'the', 'energetic', 'alignment', 'of', 'quantumdot', 'and', 'quantumwell', 'states', 'modifies', 'the', 'injection', 'efficiency', 'as', 'it', 'controls', 'the', 'hybridization', 'strength', 'our', 'description', 'of', 'tunneling', 'includes', 'the', 'phononmediated', 'and', 'the', 'coulomb', 'scattering', 'contributions', 'and', 'is', 'based', 'on', 'material', 'realistic', 'electronic', 'structure', 'calculations']]
|
[-0.13748241655809953, 0.1397468447484237, -0.04130736462061675, 0.020001988913745074, 0.003895746892411932, -0.14612169610336423, 0.060105337477423144, 0.37860158542104116, -0.24429439873561906, -0.27308467332032516, -0.01779619511886895, -0.2973721369551562, -0.1467190234781169, 0.2563576046092664, 0.025380623808278026, 0.011654448620103997, 0.07234765610677733, -0.06402668581853399, -0.029058910254724055, -0.14178138015383063, 0.30526146427150347, 0.07713827946082615, 0.3900900280987509, 0.10915167120506437, 0.06971131570230191, 0.06162258235967162, 0.0714079891297993, -0.04598531138701297, -0.10831942915861585, 0.12399935142182442, 0.2245329883378401, 0.017104941024947508, 0.23623349794216802, -0.4933197469778841, -0.2286426612299954, -0.019604223703282127, 0.15302947226060862, 0.14832248932032063, -0.10458649017114406, -0.2696186953807156, 0.02987943438054297, -0.15833851079315805, -0.07628431034820043, -0.04912437212954128, -0.0541441604719504, 0.06561212598098268, -0.2516034598074512, 0.016946722045222552, 0.06268789167616436, 0.007406445389658316, -0.06941735747794993, -0.10271236509094751, -0.030680992780420795, 0.08448488028090206, -0.0017950927602921165, -0.035910116313251486, 0.23014032581097466, -0.11921193120036301, -0.15252353478115882, 0.3571921869603207, -0.06876004169520875, -0.15199812948569763, 0.20662281095056975, -0.16763137575748155, -0.05345875656285839, 0.11206335633349933, 0.1333172459610932, 0.09932992426136662, -0.12570816122385733, 0.07847983214716099, 0.01642732914510391, 0.2018421080177851, 0.018551309978281208, 0.13675023295762515, 0.20187145419311608, 0.2470783337602298, 0.033626408125240384, 0.13478393272518535, -0.1332735124114472, -0.10307355375169851, -0.25820185220297825, -0.1453596918622581, -0.18253313495254936, 0.07815845822915435, -0.014723775502572358, -0.14455761307709777, 0.44149402697447504, 0.1933622626058174, 0.12626689471088337, -0.042917322199925674, 0.3238479249219564, 0.1259030901455059, 0.07269335916708056, -0.013420774045286419, 0.2853895720369149, 0.13930178652081987, 0.0650127253749763, -0.3185145294196609, 0.059160543830140674, -0.012069877124853808]
|
1,803.03788
|
Dimension of the repeller for a piecewise expanding affine map
|
In this paper, we study the dimension theory of a class of piecewise affine
systems in euclidean spaces suggested by Michael Barnsley, with some
applications to the fractal image compression. It is a more general version of
the class considered in the work of Keane, Simon and Solomyak [The dimension of
graph directed attractors with overlaps on the line, with an application to a
problem in fractal image recognition. {\it Fund. Math.}, {\bf 180}(3):279-292,
2003] and can be considered as the continuation of the works [On the dimension
of self-affine sets and measures with overlaps. {\it Proc. Amer. Math. Soc.},
{\bf 144}(10):4427-4440, 2016], [On the dimension of triangular self-affine
sets. {\it Erg. Th. \& Dynam. Sys.}, to appear.] by the authors. We also
present some applications of our results for the generalized Takagi functions
and fractal interpolation functions.
|
math.DS
|
in this paper we study the dimension theory of a class of piecewise affine systems in euclidean spaces suggested by michael barnsley with some applications to the fractal image compression it is a more general version of the class considered in the work of keane simon and solomyak the dimension of graph directed attractors with overlaps on the line with an application to a problem in fractal image recognition it fund math bf 1803279292 2003 and can be considered as the continuation of the works on the dimension of selfaffine sets and measures with overlaps it proc amer math soc bf 1441044274440 2016 on the dimension of triangular selfaffine sets it erg th dynam sys to appear by the authors we also present some applications of our results for the generalized takagi functions and fractal interpolation functions
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'dimension', 'theory', 'of', 'a', 'class', 'of', 'piecewise', 'affine', 'systems', 'in', 'euclidean', 'spaces', 'suggested', 'by', 'michael', 'barnsley', 'with', 'some', 'applications', 'to', 'the', 'fractal', 'image', 'compression', 'it', 'is', 'a', 'more', 'general', 'version', 'of', 'the', 'class', 'considered', 'in', 'the', 'work', 'of', 'keane', 'simon', 'and', 'solomyak', 'the', 'dimension', 'of', 'graph', 'directed', 'attractors', 'with', 'overlaps', 'on', 'the', 'line', 'with', 'an', 'application', 'to', 'a', 'problem', 'in', 'fractal', 'image', 'recognition', 'it', 'fund', 'math', 'bf', '1803279292', '2003', 'and', 'can', 'be', 'considered', 'as', 'the', 'continuation', 'of', 'the', 'works', 'on', 'the', 'dimension', 'of', 'selfaffine', 'sets', 'and', 'measures', 'with', 'overlaps', 'it', 'proc', 'amer', 'math', 'soc', 'bf', '1441044274440', '2016', 'on', 'the', 'dimension', 'of', 'triangular', 'selfaffine', 'sets', 'it', 'erg', 'th', 'dynam', 'sys', 'to', 'appear', 'by', 'the', 'authors', 'we', 'also', 'present', 'some', 'applications', 'of', 'our', 'results', 'for', 'the', 'generalized', 'takagi', 'functions', 'and', 'fractal', 'interpolation', 'functions']]
|
[-0.07814572465485307, 0.029786990169991947, -0.04793317237765425, 0.051470527922113735, -0.03741361170455262, -0.06618113749902006, 0.019699731715782372, 0.33357896011805643, -0.2433863463052721, -0.25998600072882794, 0.11666115512726484, -0.2914524392052381, -0.21245257561957395, 0.22019714537783766, -0.1425514377903676, 0.08030570064567857, 0.006526279221806261, -0.03037000150523252, -0.04016607408239334, -0.32013441435755574, 0.33581230373087306, 0.031516427852868754, 0.25969487750143916, 0.060147944630848035, 0.056751241024445606, 0.02123085060329349, -0.05814701994812047, 0.0274292510546123, -0.1789462475295834, 0.16758744889542598, 0.25433871605330044, 0.10314892384534081, 0.24201434918989737, -0.3218399421622356, -0.2091932704879178, 0.12536879142711835, 0.07010504646502712, 0.04062141660273213, 0.04566745839321003, -0.3482645895470072, 0.06285144193529117, -0.14514448578572936, -0.13263284068692613, -0.04922070977174574, 0.14469409095882266, 0.02320917287186064, -0.2661005040009817, 0.06512860713194607, 0.15124927612789044, 0.11954438707756776, -0.051757245167606956, -0.11439977371634019, -0.025655122013348672, 0.029669749288371315, -0.00785651292686385, 0.10175006426353421, 0.06037672509059862, -0.05767503464766951, -0.173662362087311, 0.36984251437501775, -0.006983510097833695, -0.23524311755576896, 0.23122913966438285, -0.10444183429806597, -0.184221188130754, 0.06694872748382666, 0.19651007534315187, 0.07824062321850322, -0.10395265028432564, 0.1747964376721669, -0.11794917254398267, 0.12031882551878138, 0.14607629938120092, -0.027818779959084675, 0.08655619063000712, 0.10492903916510167, 0.07553824681650709, 0.13856030268059974, -0.04212924139401703, -0.07615373393270636, -0.2810562866429488, -0.1645436035676135, -0.21892956634466018, 0.0992799191908152, -0.08863086381504588, -0.19027171461946435, 0.39128605290833446, 0.11647446074488538, 0.17683840090758168, 0.05269552849888526, 0.1586512016132474, 0.11484738560393452, 0.0228796636202821, 0.1405542014822088, 0.1645611546394691, 0.14633687497634026, 0.1351976783911663, -0.10757640462661922, -0.015357451201675252, 0.1691459708329704]
|
1,803.03789
|
Lyman-alpha emitters gone missing: the different evolution of the bright
and faint populations
|
We model the transmission of the Lyman-alpha line through the circum- and
intergalactic media around dark matter haloes expected to host Lyman-alpha
emitters (LAEs) at z > 5.7, using the high-dynamic-range Sherwood simulations.
We find very different CGM environments around more massive haloes (~10^11
M_sun) compared to less massive haloes (~10^9 M_sun) at these redshifts, which
can contribute to a different evolution of the Lyman-alpha transmission from
LAEs within these haloes. Additionally we confirm that part of the differential
evolution could result from bright LAEs being more likely to reside in larger
ionized regions. We conclude that a combination of the CGM environment and the
IGM ionization structure is likely to be responsible for the differential
evolution of the bright and faint ends of the LAE luminosity function at z > 6.
More generally, we confirm the suggestion that the self-shielded neutral gas in
the outskirts of the host halo can strongly attenuate the Lyman-alpha emission
from high redshift galaxies. We find that this has a stronger effect on the
more massive haloes hosting brighter LAEs. The faint-end of the LAE luminosity
function is thus a more reliable probe of the average ionization state of the
IGM. Comparing our model for LAEs with a range of observational data we find
that the favoured reionization histories are our previously advocated `Late'
and `Very Late' reionization histories, in which reionization finishes rather
rapidly at around z ~ 6.
|
astro-ph.GA astro-ph.CO
|
we model the transmission of the lymanalpha line through the circum and intergalactic media around dark matter haloes expected to host lymanalpha emitters laes at z 57 using the highdynamicrange sherwood simulations we find very different cgm environments around more massive haloes 1011 m_sun compared to less massive haloes 109 m_sun at these redshifts which can contribute to a different evolution of the lymanalpha transmission from laes within these haloes additionally we confirm that part of the differential evolution could result from bright laes being more likely to reside in larger ionized regions we conclude that a combination of the cgm environment and the igm ionization structure is likely to be responsible for the differential evolution of the bright and faint ends of the lae luminosity function at z 6 more generally we confirm the suggestion that the selfshielded neutral gas in the outskirts of the host halo can strongly attenuate the lymanalpha emission from high redshift galaxies we find that this has a stronger effect on the more massive haloes hosting brighter laes the faintend of the lae luminosity function is thus a more reliable probe of the average ionization state of the igm comparing our model for laes with a range of observational data we find that the favoured reionization histories are our previously advocated late and very late reionization histories in which reionization finishes rather rapidly at around z 6
|
[['we', 'model', 'the', 'transmission', 'of', 'the', 'lymanalpha', 'line', 'through', 'the', 'circum', 'and', 'intergalactic', 'media', 'around', 'dark', 'matter', 'haloes', 'expected', 'to', 'host', 'lymanalpha', 'emitters', 'laes', 'at', 'z', '57', 'using', 'the', 'highdynamicrange', 'sherwood', 'simulations', 'we', 'find', 'very', 'different', 'cgm', 'environments', 'around', 'more', 'massive', 'haloes', '1011', 'm_sun', 'compared', 'to', 'less', 'massive', 'haloes', '109', 'm_sun', 'at', 'these', 'redshifts', 'which', 'can', 'contribute', 'to', 'a', 'different', 'evolution', 'of', 'the', 'lymanalpha', 'transmission', 'from', 'laes', 'within', 'these', 'haloes', 'additionally', 'we', 'confirm', 'that', 'part', 'of', 'the', 'differential', 'evolution', 'could', 'result', 'from', 'bright', 'laes', 'being', 'more', 'likely', 'to', 'reside', 'in', 'larger', 'ionized', 'regions', 'we', 'conclude', 'that', 'a', 'combination', 'of', 'the', 'cgm', 'environment', 'and', 'the', 'igm', 'ionization', 'structure', 'is', 'likely', 'to', 'be', 'responsible', 'for', 'the', 'differential', 'evolution', 'of', 'the', 'bright', 'and', 'faint', 'ends', 'of', 'the', 'lae', 'luminosity', 'function', 'at', 'z', '6', 'more', 'generally', 'we', 'confirm', 'the', 'suggestion', 'that', 'the', 'selfshielded', 'neutral', 'gas', 'in', 'the', 'outskirts', 'of', 'the', 'host', 'halo', 'can', 'strongly', 'attenuate', 'the', 'lymanalpha', 'emission', 'from', 'high', 'redshift', 'galaxies', 'we', 'find', 'that', 'this', 'has', 'a', 'stronger', 'effect', 'on', 'the', 'more', 'massive', 'haloes', 'hosting', 'brighter', 'laes', 'the', 'faintend', 'of', 'the', 'lae', 'luminosity', 'function', 'is', 'thus', 'a', 'more', 'reliable', 'probe', 'of', 'the', 'average', 'ionization', 'state', 'of', 'the', 'igm', 'comparing', 'our', 'model', 'for', 'laes', 'with', 'a', 'range', 'of', 'observational', 'data', 'we', 'find', 'that', 'the', 'favoured', 'reionization', 'histories', 'are', 'our', 'previously', 'advocated', 'late', 'and', 'very', 'late', 'reionization', 'histories', 'in', 'which', 'reionization', 'finishes', 'rather', 'rapidly', 'at', 'around', 'z', '6']]
|
[-0.04606156651322358, 0.12678389079756874, -0.056219049809348685, 0.13717075074034096, -0.08737844203163114, -0.04864238829116133, 0.023125483774352227, 0.4378230607640718, -0.07287025274988664, -0.35362050669940287, -0.021317997223361848, -0.32447003957899406, -0.020969964995532588, 0.18179903212782844, 0.05291941653149674, -0.0500478026958766, -0.002565359615305111, -0.1404467270661609, -0.012688531153053425, -0.37143103135629785, 0.3221041411970834, 0.11088745506248505, 0.14813344892091418, -0.044053291408305134, 0.061597314363949066, -0.1258442681382686, -0.09090940419873303, -0.0463796351764495, -0.16171489401534725, 0.00014792743854448519, 0.25189453607041373, 0.13473918540463203, 0.26943162907126794, -0.35131965940538395, -0.20813103862778312, 0.08893700526239573, 0.26125178324426385, 0.08767716495755884, -0.09666665329388292, -0.30493659472148943, 0.09628081778534028, -0.1735936982123493, -0.13932179610240933, 0.13323349775466667, 0.008608781496790346, -0.015594088250587298, -0.19436303313405356, 0.1945913500820043, -0.04983248205629653, 0.010585940556396839, -0.04079446937417204, -0.05328881224545414, -0.11442566255922929, 0.00033185616197552165, -0.01749499012564225, 0.05214377886979429, 0.26638432267789486, -0.20506693476655163, 0.038897504328546224, 0.41563949124815636, -0.08440865991765018, 0.04291405633082933, 0.26108186750756696, -0.2577507652296353, -0.1930029578826714, 0.18732175474028132, 0.16204294857724927, 0.10432538838233686, -0.12435371170640831, -0.007269576897389004, -0.022650623420511207, 0.2488259157128912, 0.008685951471896323, 0.06122326059666634, 0.3543228750644739, 0.0797714198861559, 0.05743397221013168, 0.035765718053646645, -0.14267526139992853, 0.010241820030274117, -0.218462901316144, -0.12308327573483466, -0.09760913406518716, 0.13194137914785756, -0.15311467208446886, -0.10566753258752784, 0.32800612425983205, 0.19373291398622416, 0.24704974555935563, 0.11689433793671221, 0.3268809682677616, 0.12348808000431807, 0.09819441314091179, 0.11339137872657039, 0.2922853395870443, 0.17597700569323013, 0.07591756840552255, -0.21684362227297008, 0.06916203583458783, -0.05728123015214493]
|
1,803.0379
|
Towards a Multi-array Architecture for Accelerating Large-scale Matrix
Multiplication on FPGAs
|
Large-scale floating-point matrix multiplication is a fundamental kernel in
many scientific and engineering applications. Most existing work only focus on
accelerating matrix multiplication on FPGA by adopting a linear systolic array.
This paper towards the extension of this architecture by proposing a scalable
and highly configurable multi-array architecture. In addition, we propose a
work-stealing scheme to ensure the equality in the workload partition among
multiple linear arrays. Furthermore, an analytical model is developed to
determine the optimal design parameters. Experiments on a real-life
convolutional neural network (CNN) show that we can obtain the optimal
extension of the linear array architecture.
|
cs.AR
|
largescale floatingpoint matrix multiplication is a fundamental kernel in many scientific and engineering applications most existing work only focus on accelerating matrix multiplication on fpga by adopting a linear systolic array this paper towards the extension of this architecture by proposing a scalable and highly configurable multiarray architecture in addition we propose a workstealing scheme to ensure the equality in the workload partition among multiple linear arrays furthermore an analytical model is developed to determine the optimal design parameters experiments on a reallife convolutional neural network cnn show that we can obtain the optimal extension of the linear array architecture
|
[['largescale', 'floatingpoint', 'matrix', 'multiplication', 'is', 'a', 'fundamental', 'kernel', 'in', 'many', 'scientific', 'and', 'engineering', 'applications', 'most', 'existing', 'work', 'only', 'focus', 'on', 'accelerating', 'matrix', 'multiplication', 'on', 'fpga', 'by', 'adopting', 'a', 'linear', 'systolic', 'array', 'this', 'paper', 'towards', 'the', 'extension', 'of', 'this', 'architecture', 'by', 'proposing', 'a', 'scalable', 'and', 'highly', 'configurable', 'multiarray', 'architecture', 'in', 'addition', 'we', 'propose', 'a', 'workstealing', 'scheme', 'to', 'ensure', 'the', 'equality', 'in', 'the', 'workload', 'partition', 'among', 'multiple', 'linear', 'arrays', 'furthermore', 'an', 'analytical', 'model', 'is', 'developed', 'to', 'determine', 'the', 'optimal', 'design', 'parameters', 'experiments', 'on', 'a', 'reallife', 'convolutional', 'neural', 'network', 'cnn', 'show', 'that', 'we', 'can', 'obtain', 'the', 'optimal', 'extension', 'of', 'the', 'linear', 'array', 'architecture']]
|
[-0.15228138932958246, 0.010181728691241005, -0.01855380229651928, 0.007714934251271188, -0.10423473060131073, -0.1936044465051964, 0.016509481681277974, 0.44709514632821085, -0.2813238174014259, -0.28857447660528124, 0.12626741247368045, -0.17796331322431796, -0.26218824438226873, 0.22656592209124937, -0.08875584361079746, 0.12701384940941352, 0.11345454832538962, -0.007564513720571995, -0.06386400824645534, -0.2475294231530279, 0.26254984016530214, 0.09284668950363993, 0.3435634653270245, 0.016069965385831893, 0.13402189090847969, -0.01338407221250236, -0.028227654807269572, -0.03551033939118497, -0.04615443472088373, 0.20539188263239339, 0.3163683087006211, 0.16778882185462862, 0.3143042241036892, -0.45205842385068534, -0.17526287905871868, 0.07327190287411213, 0.1351529027079232, 0.06475916768657043, -0.06194008665042929, -0.243909355038777, 0.1070247970148921, -0.2090455332538113, -0.042368971230462196, -0.09912853152491152, -0.03252921016654, -0.00240016208961606, -0.30466669633984567, -0.05343332924414426, 0.049291680093156175, 0.007789236139506102, -0.0010703022312372923, -0.11632626463659107, 0.11886937465518713, 0.05933267433661968, -0.08423507028841414, 0.02437548997113481, 0.14376178780104965, -0.10514330849517137, -0.12815789215266704, 0.3165936833061278, -0.03499802768230438, -0.23357901211827994, 0.13722411141730845, -0.03679943392984569, -0.1698958361078985, 0.038290281780064106, 0.24912148222327232, 0.08055343744810671, -0.19207529490813613, 0.11517469880753196, -0.07751221157610416, 0.21879823863040657, 0.04362511164974421, -0.002862643664702773, 0.1676435867883265, 0.26356391368433835, 0.10195998004579451, 0.19143228144734167, -0.0436535058147274, -0.07822717915754765, -0.23824279631080572, -0.14257322295568883, -0.19746461245696992, 0.016498050023801624, -0.123114607068419, -0.1800413316115737, 0.4361327258300662, 0.18758487042039632, 0.1769278770778328, 0.11651473065139725, 0.36804643981158736, 0.05862234345637262, 0.12243662673048675, 0.12212638290598989, 0.15620014015119524, 0.09136377687100321, 0.11707671072450467, -0.19705244285054505, 0.05093431935179979, 0.08173464381136]
|
1,803.03791
|
Shtukas for reductive groups and Langlands correspondence for function
fields
|
We discuss recent developments in the Langlands program for function fields,
and in the geometric Langlands program. In particular we explain a canonical
decomposition of the space of cuspidal automorphic forms for any reductive
group G over a function field, indexed by global Langlands parameters. The
proof uses the cohomology of G-shtukas with multiple modifications and the
geometric Satake equivalence.
|
math.AG math.RT
|
we discuss recent developments in the langlands program for function fields and in the geometric langlands program in particular we explain a canonical decomposition of the space of cuspidal automorphic forms for any reductive group g over a function field indexed by global langlands parameters the proof uses the cohomology of gshtukas with multiple modifications and the geometric satake equivalence
|
[['we', 'discuss', 'recent', 'developments', 'in', 'the', 'langlands', 'program', 'for', 'function', 'fields', 'and', 'in', 'the', 'geometric', 'langlands', 'program', 'in', 'particular', 'we', 'explain', 'a', 'canonical', 'decomposition', 'of', 'the', 'space', 'of', 'cuspidal', 'automorphic', 'forms', 'for', 'any', 'reductive', 'group', 'g', 'over', 'a', 'function', 'field', 'indexed', 'by', 'global', 'langlands', 'parameters', 'the', 'proof', 'uses', 'the', 'cohomology', 'of', 'gshtukas', 'with', 'multiple', 'modifications', 'and', 'the', 'geometric', 'satake', 'equivalence']]
|
[-0.24294186495244502, 0.00999547050644954, -0.24842736134305596, 0.0820994544463853, -0.18223690629626313, -0.06885783832209806, -0.03077646220723788, 0.26569057032465937, -0.36370239943886795, -0.27881300964703165, 0.07607476189732551, -0.11966680542876323, -0.19442318313134213, 0.213512426118056, -0.15911896068913242, 0.015757175007214148, 0.007010383686671655, 0.05751099276045958, -0.16090402293484657, -0.28195939840128026, 0.4170743648738911, -0.04473403071363767, 0.2108907383400947, -0.01265234569630896, 0.1265399530141925, 0.14322325543810924, -0.02491601025685668, -0.09206838392856298, -0.14868380225573977, 0.16500705856209, 0.3558385295482973, 0.11345016940807302, 0.2062375525245443, -0.4140946957593163, -0.13284933177443842, 0.2000582750265797, 0.08216117646855613, 0.02999999458746364, 0.008750883272538583, -0.3150024287053384, 0.025101091378261723, -0.14544374325002232, -0.11440053846842299, -0.10210051025884846, 0.033221514268855876, 0.021224635280668737, -0.24853610428981482, -0.035584224356959265, 0.024012981970251226, 0.2178634692914784, -0.12437934755968551, -0.12373000089234362, -0.0332844860230883, 0.04401782616041601, 0.01763207730061064, 0.1168462865287438, 0.14742340195613604, -0.17186454034720858, -0.11946999626234174, 0.33978804311870286, -0.0973947124555707, -0.13848355530450743, 0.09409363938805958, -0.17601423133940747, -0.23359730655017, 0.0608729454378287, 0.0863381268767019, 0.12148389310265581, 0.026409781320641437, 0.22318489476844358, -0.13326127463951706, 0.011481954778234164, 0.06692489843505124, -0.026874137793978056, 0.19723764379353573, 0.05518185234783838, 0.0520325807776923, 0.11382058366046598, 0.04830216135111793, -0.021183101351683338, -0.44149598211612706, -0.2192888090076546, -0.0970658813448002, 0.025126440295328695, -0.14477526633175633, -0.11327522159554064, 0.4900307588201637, 0.07977162532818814, 0.19686788894856969, 0.14388638245873153, 0.2023245136331146, 0.04725385467754677, 0.10993671206136545, 0.0530303241374592, 0.1726420664228499, 0.2804827121823716, -0.027322645681366945, -0.1886666572963198, -0.017127953460051987, 0.23918461857053142]
|
1,803.03792
|
Hypoxia-inducible factor 1a protects peripheral sensory neurons from
diabetic peripheral neuropathy by suppressing accumulation of reactive oxygen
species
|
Diabetic peripheral neuropathy (DPN) is one of the most common diabetic
complications. Mechanisms underlying nerve damage and sensory loss following
metabolic dysfunction remain large unclear. Recently, hyperglycemia-induced
mitochondrial dysfunction and the generation of ROS have gained attention as
possible mechanisms of organ damage in diabetes. Hypoxia-inducible factor
1(HIF1a) is a key transcription factor activated by hypoxia, hyperglycemia,
nitric oxide as well as ROS, suggesting a fundamental role in DPN
susceptibility. Genetically-modified mutant mice, which conditionally lack
HIF1a in peripheral sensory neurons (SNS-HIF1a-/-), were analyzed
longitudinally up to 6 months in the streptozotocin (STZ) model of type1
diabetes. Behavioral measurements of sensitivity to thermal and mechanical
stimuli, quantitative morphological analyses of intraepidermal nerve fiber
density and measurements of reactive oxygen species (ROS) in sensory neurons in
vivo were undertaken over several months post-STZ injections to delineate the
role of HIF1a in DPN. Longitudinal behavioral and morphological analyses at 5,
13 and 24 wks post-STZ treatment revealed that SNS-HIF1a-/- developed stronger
hyperglycemia-evoked losses of peripheral nociceptive sensory axons associated
with stronger losses of mechano- and heat sensation with a faster onset than
HIF1afl/fl mice. Mechanistically, these histomorphologic and behavioral
differences were associated with significantly higher level of STZ-induced
production of ROS in sensory neurons of SNS-HIF1a-/- mice as compared with
HIF1afl/fl. Our results indicate that HIF1a is as an upstream modulator of ROS
in peripheral sensory neurons and exerts a protective function in suppressing
hyperglycemia-induced nerve damage by limiting ROS levels. HIF1a stabilization
may be thus a new strategy target for limiting sensory loss, a debilitating
late complication of diabetes.
|
q-bio.CB
|
diabetic peripheral neuropathy dpn is one of the most common diabetic complications mechanisms underlying nerve damage and sensory loss following metabolic dysfunction remain large unclear recently hyperglycemiainduced mitochondrial dysfunction and the generation of ros have gained attention as possible mechanisms of organ damage in diabetes hypoxiainducible factor 1hif1a is a key transcription factor activated by hypoxia hyperglycemia nitric oxide as well as ros suggesting a fundamental role in dpn susceptibility geneticallymodified mutant mice which conditionally lack hif1a in peripheral sensory neurons snshif1a were analyzed longitudinally up to 6 months in the streptozotocin stz model of type1 diabetes behavioral measurements of sensitivity to thermal and mechanical stimuli quantitative morphological analyses of intraepidermal nerve fiber density and measurements of reactive oxygen species ros in sensory neurons in vivo were undertaken over several months poststz injections to delineate the role of hif1a in dpn longitudinal behavioral and morphological analyses at 5 13 and 24 wks poststz treatment revealed that snshif1a developed stronger hyperglycemiaevoked losses of peripheral nociceptive sensory axons associated with stronger losses of mechano and heat sensation with a faster onset than hif1aflfl mice mechanistically these histomorphologic and behavioral differences were associated with significantly higher level of stzinduced production of ros in sensory neurons of snshif1a mice as compared with hif1aflfl our results indicate that hif1a is as an upstream modulator of ros in peripheral sensory neurons and exerts a protective function in suppressing hyperglycemiainduced nerve damage by limiting ros levels hif1a stabilization may be thus a new strategy target for limiting sensory loss a debilitating late complication of diabetes
|
[['diabetic', 'peripheral', 'neuropathy', 'dpn', 'is', 'one', 'of', 'the', 'most', 'common', 'diabetic', 'complications', 'mechanisms', 'underlying', 'nerve', 'damage', 'and', 'sensory', 'loss', 'following', 'metabolic', 'dysfunction', 'remain', 'large', 'unclear', 'recently', 'hyperglycemiainduced', 'mitochondrial', 'dysfunction', 'and', 'the', 'generation', 'of', 'ros', 'have', 'gained', 'attention', 'as', 'possible', 'mechanisms', 'of', 'organ', 'damage', 'in', 'diabetes', 'hypoxiainducible', 'factor', '1hif1a', 'is', 'a', 'key', 'transcription', 'factor', 'activated', 'by', 'hypoxia', 'hyperglycemia', 'nitric', 'oxide', 'as', 'well', 'as', 'ros', 'suggesting', 'a', 'fundamental', 'role', 'in', 'dpn', 'susceptibility', 'geneticallymodified', 'mutant', 'mice', 'which', 'conditionally', 'lack', 'hif1a', 'in', 'peripheral', 'sensory', 'neurons', 'snshif1a', 'were', 'analyzed', 'longitudinally', 'up', 'to', '6', 'months', 'in', 'the', 'streptozotocin', 'stz', 'model', 'of', 'type1', 'diabetes', 'behavioral', 'measurements', 'of', 'sensitivity', 'to', 'thermal', 'and', 'mechanical', 'stimuli', 'quantitative', 'morphological', 'analyses', 'of', 'intraepidermal', 'nerve', 'fiber', 'density', 'and', 'measurements', 'of', 'reactive', 'oxygen', 'species', 'ros', 'in', 'sensory', 'neurons', 'in', 'vivo', 'were', 'undertaken', 'over', 'several', 'months', 'poststz', 'injections', 'to', 'delineate', 'the', 'role', 'of', 'hif1a', 'in', 'dpn', 'longitudinal', 'behavioral', 'and', 'morphological', 'analyses', 'at', '5', '13', 'and', '24', 'wks', 'poststz', 'treatment', 'revealed', 'that', 'snshif1a', 'developed', 'stronger', 'hyperglycemiaevoked', 'losses', 'of', 'peripheral', 'nociceptive', 'sensory', 'axons', 'associated', 'with', 'stronger', 'losses', 'of', 'mechano', 'and', 'heat', 'sensation', 'with', 'a', 'faster', 'onset', 'than', 'hif1aflfl', 'mice', 'mechanistically', 'these', 'histomorphologic', 'and', 'behavioral', 'differences', 'were', 'associated', 'with', 'significantly', 'higher', 'level', 'of', 'stzinduced', 'production', 'of', 'ros', 'in', 'sensory', 'neurons', 'of', 'snshif1a', 'mice', 'as', 'compared', 'with', 'hif1aflfl', 'our', 'results', 'indicate', 'that', 'hif1a', 'is', 'as', 'an', 'upstream', 'modulator', 'of', 'ros', 'in', 'peripheral', 'sensory', 'neurons', 'and', 'exerts', 'a', 'protective', 'function', 'in', 'suppressing', 'hyperglycemiainduced', 'nerve', 'damage', 'by', 'limiting', 'ros', 'levels', 'hif1a', 'stabilization', 'may', 'be', 'thus', 'a', 'new', 'strategy', 'target', 'for', 'limiting', 'sensory', 'loss', 'a', 'debilitating', 'late', 'complication', 'of', 'diabetes']]
|
[-0.04681508998079907, 0.1578984895302385, -0.0011387389007486341, 0.04838329170711293, -0.025646961768057454, -0.16308753744025178, 0.05300689227614037, 0.3904613828952841, -0.1974137956262339, -0.262168423267937, 0.031384149046682915, -0.2848836683319897, -0.2455262791032229, 0.19637085407559676, -0.16222702254748494, 0.01789999096815255, 0.0889420343441813, 0.017024592579743727, 0.0945984140846299, -0.19202494923388813, 0.20640317697079882, 0.08326767647484642, 0.296785097548405, 0.04232214428522298, 0.10065906973057843, -0.031033811778420718, -0.017746102140328613, -0.05276628765012554, -0.05566898086970735, 0.12124046834367441, 0.32565718731365917, 0.14030235034708932, 0.33333288884638407, -0.4980202200633239, -0.2746760222854517, 0.0811390914401509, 0.12491645673323021, 0.06880501816872643, -0.02228328332634325, -0.24772721271946785, 0.09794714747799363, -0.18289198900707354, -0.08808867730828744, -0.017965090915379, 0.028792312341303056, 0.046664026808618315, -0.24716497359161332, 0.15613958855515453, 0.03157478249660216, 0.2010844340472202, -0.10524557489897995, -0.11568015796791126, -0.11372494749224184, 0.18035118401095998, 0.06283010245155074, 0.06108125223935775, 0.301223729496464, -0.18968460870134393, -0.1291298673003609, 0.27959991218635766, 0.023023017408310652, -0.10699381638125222, 0.21982770525304718, -0.13530443043200058, -0.13292531244649847, 0.17999873404879485, 0.17414584431732907, 0.012609283813669128, -0.19659484599667745, -0.09011165432966071, 0.05909007151064092, 0.18365222393966665, 0.1588756777961337, -0.003451025128133625, 0.09392923106462127, 0.2562433844583669, -0.017004475882466185, 0.1207663220551236, -0.09252019674655398, -0.010612728901640929, -0.23224198300584514, -0.1279868253902343, -0.014700587986536869, 0.07631337889318725, -0.08268224915750542, -0.09363999973596414, 0.3794595220815239, 0.08042906512468093, 0.16436979589710293, 0.02089961753387716, 0.2611245349696951, -0.000590677860541254, 0.15034334119636475, -0.03253354250578346, 0.1779615817954991, 0.09682167273552376, 0.11426858325551333, -0.2788087965549553, 0.1841506987083249, -0.020792664571029202]
|
1,803.03793
|
The Maker-Breaker Rado game on a random set of integers
|
Given an integer-valued matrix $A$ of dimension $\ell \times k$ and an
integer-valued vector $b$ of dimension $\ell$, the Maker-Breaker $(A,b)$-game
on a set of integers $X$ is the game where Maker and Breaker take turns
claiming previously unclaimed integers from $X$, and Maker's aim is to obtain a
solution to the system $Ax=b$, whereas Breaker's aim is to prevent this. When
$X$ is a random subset of $\{1,\dots,n\}$ where each number is included with
probability $p$ independently of all others, we determine the threshold
probability $p_0$ for when the game is Maker or Breaker's win, for a large
class of matrices and vectors. This class includes but is not limited to all
pairs $(A,b)$ for which $Ax=b$ corresponds to a single linear equation. The
Maker's win statement also extends to a much wider class of matrices which
include those which satisfy Rado's partition theorem.
|
math.CO
|
given an integervalued matrix a of dimension ell times k and an integervalued vector b of dimension ell the makerbreaker abgame on a set of integers x is the game where maker and breaker take turns claiming previously unclaimed integers from x and makers aim is to obtain a solution to the system axb whereas breakers aim is to prevent this when x is a random subset of 1dotsn where each number is included with probability p independently of all others we determine the threshold probability p_0 for when the game is maker or breakers win for a large class of matrices and vectors this class includes but is not limited to all pairs ab for which axb corresponds to a single linear equation the makers win statement also extends to a much wider class of matrices which include those which satisfy rados partition theorem
|
[['given', 'an', 'integervalued', 'matrix', 'a', 'of', 'dimension', 'ell', 'times', 'k', 'and', 'an', 'integervalued', 'vector', 'b', 'of', 'dimension', 'ell', 'the', 'makerbreaker', 'abgame', 'on', 'a', 'set', 'of', 'integers', 'x', 'is', 'the', 'game', 'where', 'maker', 'and', 'breaker', 'take', 'turns', 'claiming', 'previously', 'unclaimed', 'integers', 'from', 'x', 'and', 'makers', 'aim', 'is', 'to', 'obtain', 'a', 'solution', 'to', 'the', 'system', 'axb', 'whereas', 'breakers', 'aim', 'is', 'to', 'prevent', 'this', 'when', 'x', 'is', 'a', 'random', 'subset', 'of', '1dotsn', 'where', 'each', 'number', 'is', 'included', 'with', 'probability', 'p', 'independently', 'of', 'all', 'others', 'we', 'determine', 'the', 'threshold', 'probability', 'p_0', 'for', 'when', 'the', 'game', 'is', 'maker', 'or', 'breakers', 'win', 'for', 'a', 'large', 'class', 'of', 'matrices', 'and', 'vectors', 'this', 'class', 'includes', 'but', 'is', 'not', 'limited', 'to', 'all', 'pairs', 'ab', 'for', 'which', 'axb', 'corresponds', 'to', 'a', 'single', 'linear', 'equation', 'the', 'makers', 'win', 'statement', 'also', 'extends', 'to', 'a', 'much', 'wider', 'class', 'of', 'matrices', 'which', 'include', 'those', 'which', 'satisfy', 'rados', 'partition', 'theorem']]
|
[-0.13189123960629362, 0.10762914681570315, -0.05358022519965367, 0.021033320870603722, -0.10905487667126902, -0.21551141429989568, 0.09956004116363053, 0.3172820848123781, -0.2883223329253238, -0.22578504814501402, 0.07346974538542844, -0.32135687372004934, -0.09570601229909165, 0.119753062453699, -0.08491484714864657, 0.021164276290299565, 0.03214916495991678, 0.1340012147428532, 0.019811282966864005, -0.3200198469169695, 0.30396213741684014, -0.04143366436634598, 0.1863762820974506, 0.0018467943248306883, 0.09745823824457053, 0.04527493865100731, 0.02077404261598813, 0.025925652464402132, -0.13269880992713673, 0.03532341784990296, 0.29571026106011766, 0.14891388186028806, 0.35294336730550074, -0.330745334878307, -0.12474022621031979, 0.21701980167678717, 0.07825569575010188, 0.057999068160605585, 0.04452732919538715, -0.2443126034312721, 0.17380576112211266, -0.1496766849549423, -0.11868751367939444, -0.015227103263846246, 0.11392456529629899, 0.00362450175372691, -0.4160090592625583, -0.04409493839484639, 0.09894586449553226, 0.013820160135369877, 0.0015017872836826176, -0.18761849142209594, -0.013063999128945429, 0.11199521080245553, 0.0109237902203639, 0.10792211273942014, 0.07465277957119819, -0.09122927698531541, -0.10935872346805088, 0.38380563502553205, 0.005257541361738574, -0.22570904266763606, 0.12429920091968158, -0.16125296524179908, -0.13960212134948835, 0.14007262705086634, 0.13355510391832875, 0.13912732755315715, -0.09955340321436686, 0.128598672569055, -0.1367158295008643, 0.1831903208577042, 0.06482946210026998, 0.011079658044437909, 0.15958174348262877, 0.08678521327032097, 0.14769972134863252, 0.11002451422913322, -0.002638576842908715, -0.08026678483162461, -0.30769566018776645, -0.15757135055349047, -0.19124636890944735, 0.14001990318356547, -0.07603375769404952, -0.16953835119332733, 0.324501377902925, 0.11368682774361866, 0.2107306803022672, 0.1026661112972792, 0.21563148188950687, 0.12802366959824274, 0.02025846650639292, 0.0883367275614452, 0.09291944769692832, 0.13549593981548116, 0.015015778301990237, -0.12283262219440577, 0.08794780138815786, 0.10820836903013546]
|
1,803.03794
|
Approximation schemes for mixed optimal stopping and control problems
with nonlinear expectations and jumps
|
We propose a class of numerical schemes for mixed optimal stopping and
control of processes with infinite activity jumps and where the objective is
evaluated by a nonlinear expectation. Exploiting an approximation by switching
systems, piecewise constant policy timestepping reduces the problem to nonlocal
semi-linear equations with different control parameters, uncoupled over
individual time steps, which we solve by fully implicit monotone approximations
to the controlled diffusion and the nonlocal term, and specifically the
Lax-Friedrichs scheme for the nonlinearity in the gradient. We establish a
comparison principle for the switching system and demonstrate the convergence
of the schemes, which subsequently gives a constructive proof for the existence
of a solution to the switching system. Numerical experiments are presented for
a recursive utility maximization problem to demonstrate the effectiveness of
the new schemes.
|
math.NA math.OC
|
we propose a class of numerical schemes for mixed optimal stopping and control of processes with infinite activity jumps and where the objective is evaluated by a nonlinear expectation exploiting an approximation by switching systems piecewise constant policy timestepping reduces the problem to nonlocal semilinear equations with different control parameters uncoupled over individual time steps which we solve by fully implicit monotone approximations to the controlled diffusion and the nonlocal term and specifically the laxfriedrichs scheme for the nonlinearity in the gradient we establish a comparison principle for the switching system and demonstrate the convergence of the schemes which subsequently gives a constructive proof for the existence of a solution to the switching system numerical experiments are presented for a recursive utility maximization problem to demonstrate the effectiveness of the new schemes
|
[['we', 'propose', 'a', 'class', 'of', 'numerical', 'schemes', 'for', 'mixed', 'optimal', 'stopping', 'and', 'control', 'of', 'processes', 'with', 'infinite', 'activity', 'jumps', 'and', 'where', 'the', 'objective', 'is', 'evaluated', 'by', 'a', 'nonlinear', 'expectation', 'exploiting', 'an', 'approximation', 'by', 'switching', 'systems', 'piecewise', 'constant', 'policy', 'timestepping', 'reduces', 'the', 'problem', 'to', 'nonlocal', 'semilinear', 'equations', 'with', 'different', 'control', 'parameters', 'uncoupled', 'over', 'individual', 'time', 'steps', 'which', 'we', 'solve', 'by', 'fully', 'implicit', 'monotone', 'approximations', 'to', 'the', 'controlled', 'diffusion', 'and', 'the', 'nonlocal', 'term', 'and', 'specifically', 'the', 'laxfriedrichs', 'scheme', 'for', 'the', 'nonlinearity', 'in', 'the', 'gradient', 'we', 'establish', 'a', 'comparison', 'principle', 'for', 'the', 'switching', 'system', 'and', 'demonstrate', 'the', 'convergence', 'of', 'the', 'schemes', 'which', 'subsequently', 'gives', 'a', 'constructive', 'proof', 'for', 'the', 'existence', 'of', 'a', 'solution', 'to', 'the', 'switching', 'system', 'numerical', 'experiments', 'are', 'presented', 'for', 'a', 'recursive', 'utility', 'maximization', 'problem', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'new', 'schemes']]
|
[-0.14270165638476046, 0.013988960612936573, -0.06445238207269346, 0.041541400913212616, -0.06690665003561387, -0.1629237384662371, 0.0780063545839353, 0.35401021913540637, -0.3269545356116864, -0.26468108488144493, 0.1256532107001862, -0.2212758989595441, -0.14680724986035124, 0.20463740639035788, -0.0469432783870478, 0.11341417998350649, 0.04211401333326869, -0.04121652593003643, -0.0744759586858422, -0.25262813072538737, 0.33040472417964006, 0.008929086362265727, 0.2855212491104436, 0.02865826101112885, 0.21358132709759625, -0.011877343479709729, -0.012593985030738017, 0.035772737949931376, -0.1239829123704553, 0.11308168271507109, 0.24613878487566995, 0.07874090822103123, 0.3576070967617191, -0.4199040183148375, -0.21855950845179684, 0.07759076341762645, 0.11632385946259918, 0.13297458391488445, -0.0622890817819897, -0.27289088432338426, 0.08917844343037966, -0.14388510626458534, -0.09854023664956912, -0.09676068935853739, -0.020347211368833527, 0.0805979016744955, -0.3793633199000562, 0.05828888015248319, 0.054602553561739056, 0.015766433549508678, -0.08926177441026084, -0.06038865298350257, 0.04186374220686654, 0.07531916175856057, 0.02296995311961368, -0.033991441512074685, 0.0652812003867108, -0.09928356276853292, -0.17368918488588833, 0.33861383653041255, -0.0963061297820373, -0.27000749997343076, 0.15205113821888738, -0.048661449059815794, -0.062425676161761985, 0.13328618558377706, 0.2029741131665298, 0.18685137242727884, -0.15791933963632662, 0.0681975836610725, -0.013203994724211621, 0.150147441689941, 0.028643226168104306, -0.003501709211956371, 0.06312418674739699, 0.17524369038062904, 0.17155687906602962, 0.1535519135720802, -0.012920852277823018, -0.17927654798029724, -0.3262162501712076, -0.13633860046551985, -0.14112047010778703, 0.011073777057004698, -0.11374467569630449, -0.14919554345860062, 0.3904524498053764, 0.13459043326667708, 0.14194546219765802, 0.1285836549729786, 0.31944636181772995, 0.21396224663564653, 0.0043037164974851876, 0.07260365612720224, 0.21499230269215663, 0.1336549778559746, 0.11018069085901405, -0.3132473075494283, 0.09848338820809273, 0.13002304071084259]
|
1,803.03795
|
Classifying torsion classes for algebras with radical square zero via
sign decomposition
|
To study the set of torsion classes of a finite dimensional basic algebra, we
use a decomposition, called sign-decomposition, parametrized by elements of
$\{\pm1\}^n$ where $n$ is the number of simple modules. If $A$ is an algebra
with radical square zero, then for each $\epsilon \in \{\pm1\}^n$ there is a
hereditary algebra $A_{\epsilon}^!$ with radical square zero and a bijection
between the set of torsion classes of $A$ associated to $\epsilon$ and the set
of faithful torsion classes of $A_{\epsilon}^!$. Furthermore, this bijection
preserves the property of being functorially finite. As an application in
$\tau$-tilting theory, we prove that the number of support $\tau$-tilting
modules over Brauer line algebras (resp. Brauer odd-cycle algebras) having $n$
edges is $\binom{2n}{n}$ (resp. $2^{2n-1}$).
|
math.RT
|
to study the set of torsion classes of a finite dimensional basic algebra we use a decomposition called signdecomposition parametrized by elements of pm1n where n is the number of simple modules if a is an algebra with radical square zero then for each epsilon in pm1n there is a hereditary algebra a_epsilon with radical square zero and a bijection between the set of torsion classes of a associated to epsilon and the set of faithful torsion classes of a_epsilon furthermore this bijection preserves the property of being functorially finite as an application in tautilting theory we prove that the number of support tautilting modules over brauer line algebras resp brauer oddcycle algebras having n edges is binom2nn resp 22n1
|
[['to', 'study', 'the', 'set', 'of', 'torsion', 'classes', 'of', 'a', 'finite', 'dimensional', 'basic', 'algebra', 'we', 'use', 'a', 'decomposition', 'called', 'signdecomposition', 'parametrized', 'by', 'elements', 'of', 'pm1n', 'where', 'n', 'is', 'the', 'number', 'of', 'simple', 'modules', 'if', 'a', 'is', 'an', 'algebra', 'with', 'radical', 'square', 'zero', 'then', 'for', 'each', 'epsilon', 'in', 'pm1n', 'there', 'is', 'a', 'hereditary', 'algebra', 'a_epsilon', 'with', 'radical', 'square', 'zero', 'and', 'a', 'bijection', 'between', 'the', 'set', 'of', 'torsion', 'classes', 'of', 'a', 'associated', 'to', 'epsilon', 'and', 'the', 'set', 'of', 'faithful', 'torsion', 'classes', 'of', 'a_epsilon', 'furthermore', 'this', 'bijection', 'preserves', 'the', 'property', 'of', 'being', 'functorially', 'finite', 'as', 'an', 'application', 'in', 'tautilting', 'theory', 'we', 'prove', 'that', 'the', 'number', 'of', 'support', 'tautilting', 'modules', 'over', 'brauer', 'line', 'algebras', 'resp', 'brauer', 'oddcycle', 'algebras', 'having', 'n', 'edges', 'is', 'binom2nn', 'resp', '22n1']]
|
[-0.20856581570017113, 0.12250832886803903, -0.023027326618203846, -0.003926810981635349, -0.10268956863814417, -0.1594954145790524, -0.01165984375030585, 0.3380889044291958, -0.3877669732798548, -0.18518160327392466, 0.07104302592332937, -0.2703078221842772, -0.12306043322925933, 0.14156339363735013, -0.12792562931275167, -0.08020782436658981, 0.05661987291038537, 0.16566221187861652, -0.07210646038131491, -0.27047417015463365, 0.38818840779943253, -0.03657206769703942, 0.1961490036137089, 0.014555768598998044, 0.16420072951831488, 0.008087392998154924, 0.020068414952946406, 0.04897208069255497, -0.16305418700957328, 0.10464352070492841, 0.30335532926304754, 0.11064732934645682, 0.2554786827321313, -0.3346675781360945, -0.042624900735789485, 0.2483468153210701, 0.12493178837880309, 0.00735137376131122, -0.011429414812459791, -0.1932210161687196, 0.16145275867379763, -0.23650787647093544, -0.13667494734404845, -0.03615046881859293, 0.13555345341500616, -0.001457268264567276, -0.2850583280679308, -0.03987183553135382, 0.09666642471130531, 0.17370428569114008, -0.05732206837255791, -0.11360771797143486, -0.09541641497992355, 0.07894253830949799, -0.06394543445340413, 0.020159474971211132, 0.046630019177252256, -0.08686848437813935, -0.16761953689787976, 0.32406688082431045, -0.02014300728142418, -0.23033277665366644, 0.14262947290666214, -0.15802068900543914, -0.14689733568547653, 0.1290989154088898, 0.023772303234128392, 0.11589783107658394, -0.015134003521588888, 0.22803051039251743, -0.17958990624174476, 0.0791004726226919, 0.10103061389835442, -0.008103986392032449, 0.12146583010301683, 0.1102188212969223, 0.08848260685864116, 0.15661027498480654, 0.03882592896091509, 0.026235479184038967, -0.3941767264173186, -0.22115377573484257, -0.143276667821088, 0.11791594724069122, -0.12994425205739818, -0.2423460160249046, 0.4035433431101196, 0.0845881733439761, 0.1846731580058191, 0.1630413844524061, 0.19067962232883237, 0.059067620090067094, 0.10808182006874004, 0.050773815251886845, 0.05347407456808293, 0.297793040155754, -0.09888076987763193, -0.136970971012488, -0.025780138935298978, 0.22920198816837384]
|
1,803.03796
|
Optical control of competing exchange interactions and coherent
spin-charge coupling in two-orbital Mott insulators
|
In order to have a better understanding of ultrafast electrical control of
exchange interactions in multi-orbital systems, we study a two-orbital Hubbard
model at half filling under the action of a time-periodic electric field. Using
suitable projection operators and a generalized time-dependent canonical
transformation, we derive an effective Hamiltonian which describes two
different regimes. First, for a wide range of non-resonant frequencies, we find
a change of the bilinear Heisenberg exchange $J_{\textrm{ex}}$ that is
analogous to the single-orbital case. Moreover we demonstrate that also the
additional biquadratic exchange interaction $B_{\textrm{ex}}$ can be enhanced,
reduced and even change sign depending on the electric field. Second, for
special driving frequencies, we demonstrate a novel spin-charge coupling
phenomenon enabling coherent transfer between spin and charge degrees of
freedom of doubly ionized states. These results are confirmed by an exact
time-evolution of the full two-orbital Mott-Hubbard Hamiltonian.
|
cond-mat.str-el
|
in order to have a better understanding of ultrafast electrical control of exchange interactions in multiorbital systems we study a twoorbital hubbard model at half filling under the action of a timeperiodic electric field using suitable projection operators and a generalized timedependent canonical transformation we derive an effective hamiltonian which describes two different regimes first for a wide range of nonresonant frequencies we find a change of the bilinear heisenberg exchange j_textrmex that is analogous to the singleorbital case moreover we demonstrate that also the additional biquadratic exchange interaction b_textrmex can be enhanced reduced and even change sign depending on the electric field second for special driving frequencies we demonstrate a novel spincharge coupling phenomenon enabling coherent transfer between spin and charge degrees of freedom of doubly ionized states these results are confirmed by an exact timeevolution of the full twoorbital motthubbard hamiltonian
|
[['in', 'order', 'to', 'have', 'a', 'better', 'understanding', 'of', 'ultrafast', 'electrical', 'control', 'of', 'exchange', 'interactions', 'in', 'multiorbital', 'systems', 'we', 'study', 'a', 'twoorbital', 'hubbard', 'model', 'at', 'half', 'filling', 'under', 'the', 'action', 'of', 'a', 'timeperiodic', 'electric', 'field', 'using', 'suitable', 'projection', 'operators', 'and', 'a', 'generalized', 'timedependent', 'canonical', 'transformation', 'we', 'derive', 'an', 'effective', 'hamiltonian', 'which', 'describes', 'two', 'different', 'regimes', 'first', 'for', 'a', 'wide', 'range', 'of', 'nonresonant', 'frequencies', 'we', 'find', 'a', 'change', 'of', 'the', 'bilinear', 'heisenberg', 'exchange', 'j_textrmex', 'that', 'is', 'analogous', 'to', 'the', 'singleorbital', 'case', 'moreover', 'we', 'demonstrate', 'that', 'also', 'the', 'additional', 'biquadratic', 'exchange', 'interaction', 'b_textrmex', 'can', 'be', 'enhanced', 'reduced', 'and', 'even', 'change', 'sign', 'depending', 'on', 'the', 'electric', 'field', 'second', 'for', 'special', 'driving', 'frequencies', 'we', 'demonstrate', 'a', 'novel', 'spincharge', 'coupling', 'phenomenon', 'enabling', 'coherent', 'transfer', 'between', 'spin', 'and', 'charge', 'degrees', 'of', 'freedom', 'of', 'doubly', 'ionized', 'states', 'these', 'results', 'are', 'confirmed', 'by', 'an', 'exact', 'timeevolution', 'of', 'the', 'full', 'twoorbital', 'motthubbard', 'hamiltonian']]
|
[-0.2188862659687718, 0.18351434753627305, -0.017104000459567163, 0.08398551183855095, -0.06949105113249351, -0.14689764636403596, 0.05609453619286048, 0.37523861453333435, -0.26742885426406793, -0.27622236379633613, 0.006895179089145563, -0.24851731028810725, -0.16183329172141797, 0.18111807935217278, 0.058938673383668594, -0.024960378931293672, 0.009028955319803869, -0.007779293277479233, -0.13120676279034968, -0.18669161879530188, 0.3117798352812199, -0.003496208813550043, 0.2552968580539979, 0.08904808279950872, 0.09437602544401555, 0.07790567090483845, 0.09683815560944325, -0.0010311091401290597, -0.11140607567951959, 0.1015156018328919, 0.22365341546444936, -0.053599840125848425, 0.22488339121803536, -0.42734330967200773, -0.2106709072947608, 0.048369519240371486, 0.137332966574509, 0.18956684597506987, -0.04552091103037225, -0.28226165760618943, 0.0037574453215595293, -0.2428002035384007, -0.13819918385541713, -0.14535443060403913, -0.004565415228551901, 0.01518353104264416, -0.3308683151762325, 0.09263716062665764, 0.06185388384083061, 0.10543605176639473, -0.10408538701144833, -0.0806821054243978, -0.036041273813073836, 0.10535306581263001, 0.0062805264436884235, 0.012720137853538684, 0.11530753130634837, -0.11540735809707102, -0.12366390499907236, 0.3497940736710497, -0.1044119737575042, -0.18580399681547746, 0.17500006143624583, -0.15438774571892747, -0.08822009604133613, 0.12586747258092468, 0.15074365424547106, 0.10717341965658868, -0.1835210233949891, 0.10682290624323505, -0.028607590741590194, 0.18620342799587875, 0.004327187073542505, 0.05462181142775725, 0.20813423311849727, 0.15004888942451977, 0.08473421780702968, 0.15689147735784054, -0.060681817311701094, -0.15553394179124094, -0.2697066402581689, -0.13181600988931716, -0.17881825526991318, 0.08757271083131274, -0.09144928446008596, -0.13786095911339719, 0.456641073477395, 0.16817657081724033, 0.15038714784441898, -0.04025919488152317, 0.23326146122438055, 0.18498990694655382, 0.03756094005962847, 0.02567113197329355, 0.258172248967375, 0.15786075835935243, 0.04790563593083556, -0.30373418685036435, -0.008582514780078163, 0.06429463470724563]
|
1,803.03797
|
Efficient FPGA Implementation of Conjugate Gradient Methods for
Laplacian System using HLS
|
In this paper, we study FPGA based pipelined and superscalar design of two
variants of conjugate gradient methods for solving Laplacian equation on a
discrete grid; the first version corresponds to the original conjugate gradient
algorithm, and the second version corresponds to a slightly modified version of
the same.
In conjugate gradient method to solve partial differential equations, matrix
vector operations are required in each iteration; these operations can be
implemented as 5 point stencil operations on the grid without explicitely
constructing the matrix. We show that a pipelined and superscalar design using
high level synthesis written in C language leads to a significant reduction in
latencies for both methods. When comparing these two, we show that the later
has roughly two times lower latency than the former given the same degree of
superscalarity. These reductions in latencies for the newer variant of CG is
due to parallel implementations of stencil operation on subdomains of the grid,
and dut to overlap of these stencil operations with dot product operations. In
a superscalar design, domain needs to be partitioned, and boundary data needs
to be copied, which requires padding. In 1D partition, the padding latency
increases as the number of partitions increase. For a streaming data flow
model, we propose a novel traversal of the grid for 2D domain decomposition
that leads to 2 times reduction in latency cost involved with padding compared
to 1D partitions. Our implementation is roughly 10 times faster than software
implementation for linear system of dimension $10000 \times 10000.$
|
cs.DC
|
in this paper we study fpga based pipelined and superscalar design of two variants of conjugate gradient methods for solving laplacian equation on a discrete grid the first version corresponds to the original conjugate gradient algorithm and the second version corresponds to a slightly modified version of the same in conjugate gradient method to solve partial differential equations matrix vector operations are required in each iteration these operations can be implemented as 5 point stencil operations on the grid without explicitely constructing the matrix we show that a pipelined and superscalar design using high level synthesis written in c language leads to a significant reduction in latencies for both methods when comparing these two we show that the later has roughly two times lower latency than the former given the same degree of superscalarity these reductions in latencies for the newer variant of cg is due to parallel implementations of stencil operation on subdomains of the grid and dut to overlap of these stencil operations with dot product operations in a superscalar design domain needs to be partitioned and boundary data needs to be copied which requires padding in 1d partition the padding latency increases as the number of partitions increase for a streaming data flow model we propose a novel traversal of the grid for 2d domain decomposition that leads to 2 times reduction in latency cost involved with padding compared to 1d partitions our implementation is roughly 10 times faster than software implementation for linear system of dimension 10000 times 10000
|
[['in', 'this', 'paper', 'we', 'study', 'fpga', 'based', 'pipelined', 'and', 'superscalar', 'design', 'of', 'two', 'variants', 'of', 'conjugate', 'gradient', 'methods', 'for', 'solving', 'laplacian', 'equation', 'on', 'a', 'discrete', 'grid', 'the', 'first', 'version', 'corresponds', 'to', 'the', 'original', 'conjugate', 'gradient', 'algorithm', 'and', 'the', 'second', 'version', 'corresponds', 'to', 'a', 'slightly', 'modified', 'version', 'of', 'the', 'same', 'in', 'conjugate', 'gradient', 'method', 'to', 'solve', 'partial', 'differential', 'equations', 'matrix', 'vector', 'operations', 'are', 'required', 'in', 'each', 'iteration', 'these', 'operations', 'can', 'be', 'implemented', 'as', '5', 'point', 'stencil', 'operations', 'on', 'the', 'grid', 'without', 'explicitely', 'constructing', 'the', 'matrix', 'we', 'show', 'that', 'a', 'pipelined', 'and', 'superscalar', 'design', 'using', 'high', 'level', 'synthesis', 'written', 'in', 'c', 'language', 'leads', 'to', 'a', 'significant', 'reduction', 'in', 'latencies', 'for', 'both', 'methods', 'when', 'comparing', 'these', 'two', 'we', 'show', 'that', 'the', 'later', 'has', 'roughly', 'two', 'times', 'lower', 'latency', 'than', 'the', 'former', 'given', 'the', 'same', 'degree', 'of', 'superscalarity', 'these', 'reductions', 'in', 'latencies', 'for', 'the', 'newer', 'variant', 'of', 'cg', 'is', 'due', 'to', 'parallel', 'implementations', 'of', 'stencil', 'operation', 'on', 'subdomains', 'of', 'the', 'grid', 'and', 'dut', 'to', 'overlap', 'of', 'these', 'stencil', 'operations', 'with', 'dot', 'product', 'operations', 'in', 'a', 'superscalar', 'design', 'domain', 'needs', 'to', 'be', 'partitioned', 'and', 'boundary', 'data', 'needs', 'to', 'be', 'copied', 'which', 'requires', 'padding', 'in', '1d', 'partition', 'the', 'padding', 'latency', 'increases', 'as', 'the', 'number', 'of', 'partitions', 'increase', 'for', 'a', 'streaming', 'data', 'flow', 'model', 'we', 'propose', 'a', 'novel', 'traversal', 'of', 'the', 'grid', 'for', '2d', 'domain', 'decomposition', 'that', 'leads', 'to', '2', 'times', 'reduction', 'in', 'latency', 'cost', 'involved', 'with', 'padding', 'compared', 'to', '1d', 'partitions', 'our', 'implementation', 'is', 'roughly', '10', 'times', 'faster', 'than', 'software', 'implementation', 'for', 'linear', 'system', 'of', 'dimension', '10000', 'times', '10000']]
|
[-0.1352417916299716, 0.047276777777976044, -0.04276040368547131, 0.016292554855306028, -0.057486706659094326, -0.16609051410249243, 0.053305114250323395, 0.3888790729263472, -0.2839014224471554, -0.33725612915106234, 0.15162914780999667, -0.23172790197367293, -0.09063169983721944, 0.1931344600438717, -0.1079890765988874, 0.06945268151956419, 0.09750629258471438, 0.011156668778442378, -0.1205943522461836, -0.2843015459449297, 0.2510829754104461, 0.02935682057351288, 0.2676727325241599, -0.005678535610925229, 0.0974354988568285, -0.021446732348681146, -0.016284877110997006, 0.013009551384057554, -0.04259401954576398, 0.12754717556249706, 0.23637508651858846, 0.1462433332427671, 0.275425426933604, -0.48057949590304544, -0.14207736029805215, 0.08714390729807155, 0.16193306892056994, 0.09483814377860639, -0.005138376788679688, -0.19991400945998197, 0.13347998556370536, -0.17261523805289125, -0.054713902771399016, -0.0676095098495439, -0.010017851945742713, 0.007399443207153429, -0.2832922334260758, 0.02192926876586936, 0.034779074257202745, 0.033292554405754404, 0.0019491370157560422, -0.14082357949080196, -0.003662718617956021, 0.0677011089561376, -0.032089582289151465, 0.06988072894952012, 0.11174872855005401, -0.07337296668842938, -0.13121914479138685, 0.3971596867093698, -0.05149485253221226, -0.2521123393586123, 0.15573143154948152, -0.059367658204532096, -0.13601908901679083, 0.11731076293896574, 0.2061783992815883, 0.08870843992132457, -0.12670292803725008, 0.07116873799024025, 0.017865088115546053, 0.2079016016506348, 0.09600364816992263, -0.0036516766699533614, 0.0890658193442043, 0.18393420631648966, 0.14119609970311148, 0.16996037564933344, -0.057130400910474624, -0.12103371945069363, -0.25445633926539724, -0.18885017332292, -0.1739903027727638, 0.008623258593226117, -0.13793036361190994, -0.14837248140339931, 0.4093003460050871, 0.15941613784895117, 0.18013078072256158, 0.10582975224621358, 0.3432850843694593, 0.13634987551088829, 0.13797546026254412, 0.14648001757866172, 0.08857758269582447, 0.08653001139117848, 0.11496389034898981, -0.2028031345570713, 0.02015494061116543, 0.12234907557389565]
|
1,803.03798
|
Vacuum birefringence and the X-ray polarization from black-hole
accretion disks
|
In the next decade, x-ray polarimetry will open a new window on the
high-energy Universe, as several missions that include an x-ray polarimeter are
currently under development. Observations of the polarization of x-rays coming
from the accretion disks of stellar-mass and supermassive black holes are among
the new polarimeters' major objectives. In this paper, we show that these
observations can be affected by the quantum electrodynamic (QED) effect of
vacuum birefringence: after an x-ray photon is emitted from the accretion disk,
its polarization changes as the photon travels through the accretion disk's
magnetosphere, as a result of the vacuum becoming birefringent in presence of a
magnetic field. We show that this effect can be important for black holes in
the energy band of the upcoming polarimeters, and has to be taken into account
in a complete model of the x-ray polarization that we expect to detect from
black-hole accretion disks, both for stellar mass and for supermassive black
holes. We find that, for a chaotic magnetic field in the disk, QED can
significantly decrease the linear polarization fraction of edge-on photons,
depending on the spin of the hole and on the strength of the magnetic field.
This effect can provide, for the first time, a direct way to probe the magnetic
field strength close to the innermost stable orbit of black-hole accretion
disks and to study the role of magnetic fields in astrophysical accretion in
general.
|
astro-ph.HE
|
in the next decade xray polarimetry will open a new window on the highenergy universe as several missions that include an xray polarimeter are currently under development observations of the polarization of xrays coming from the accretion disks of stellarmass and supermassive black holes are among the new polarimeters major objectives in this paper we show that these observations can be affected by the quantum electrodynamic qed effect of vacuum birefringence after an xray photon is emitted from the accretion disk its polarization changes as the photon travels through the accretion disks magnetosphere as a result of the vacuum becoming birefringent in presence of a magnetic field we show that this effect can be important for black holes in the energy band of the upcoming polarimeters and has to be taken into account in a complete model of the xray polarization that we expect to detect from blackhole accretion disks both for stellar mass and for supermassive black holes we find that for a chaotic magnetic field in the disk qed can significantly decrease the linear polarization fraction of edgeon photons depending on the spin of the hole and on the strength of the magnetic field this effect can provide for the first time a direct way to probe the magnetic field strength close to the innermost stable orbit of blackhole accretion disks and to study the role of magnetic fields in astrophysical accretion in general
|
[['in', 'the', 'next', 'decade', 'xray', 'polarimetry', 'will', 'open', 'a', 'new', 'window', 'on', 'the', 'highenergy', 'universe', 'as', 'several', 'missions', 'that', 'include', 'an', 'xray', 'polarimeter', 'are', 'currently', 'under', 'development', 'observations', 'of', 'the', 'polarization', 'of', 'xrays', 'coming', 'from', 'the', 'accretion', 'disks', 'of', 'stellarmass', 'and', 'supermassive', 'black', 'holes', 'are', 'among', 'the', 'new', 'polarimeters', 'major', 'objectives', 'in', 'this', 'paper', 'we', 'show', 'that', 'these', 'observations', 'can', 'be', 'affected', 'by', 'the', 'quantum', 'electrodynamic', 'qed', 'effect', 'of', 'vacuum', 'birefringence', 'after', 'an', 'xray', 'photon', 'is', 'emitted', 'from', 'the', 'accretion', 'disk', 'its', 'polarization', 'changes', 'as', 'the', 'photon', 'travels', 'through', 'the', 'accretion', 'disks', 'magnetosphere', 'as', 'a', 'result', 'of', 'the', 'vacuum', 'becoming', 'birefringent', 'in', 'presence', 'of', 'a', 'magnetic', 'field', 'we', 'show', 'that', 'this', 'effect', 'can', 'be', 'important', 'for', 'black', 'holes', 'in', 'the', 'energy', 'band', 'of', 'the', 'upcoming', 'polarimeters', 'and', 'has', 'to', 'be', 'taken', 'into', 'account', 'in', 'a', 'complete', 'model', 'of', 'the', 'xray', 'polarization', 'that', 'we', 'expect', 'to', 'detect', 'from', 'blackhole', 'accretion', 'disks', 'both', 'for', 'stellar', 'mass', 'and', 'for', 'supermassive', 'black', 'holes', 'we', 'find', 'that', 'for', 'a', 'chaotic', 'magnetic', 'field', 'in', 'the', 'disk', 'qed', 'can', 'significantly', 'decrease', 'the', 'linear', 'polarization', 'fraction', 'of', 'edgeon', 'photons', 'depending', 'on', 'the', 'spin', 'of', 'the', 'hole', 'and', 'on', 'the', 'strength', 'of', 'the', 'magnetic', 'field', 'this', 'effect', 'can', 'provide', 'for', 'the', 'first', 'time', 'a', 'direct', 'way', 'to', 'probe', 'the', 'magnetic', 'field', 'strength', 'close', 'to', 'the', 'innermost', 'stable', 'orbit', 'of', 'blackhole', 'accretion', 'disks', 'and', 'to', 'study', 'the', 'role', 'of', 'magnetic', 'fields', 'in', 'astrophysical', 'accretion', 'in', 'general']]
|
[-0.11750264863113151, 0.16720745380352728, -0.04626166212601366, 0.09431895166988212, -0.08902119596536129, -0.044668430436828756, -0.013130915555925408, 0.3959304668340769, -0.21198484873383353, -0.3283052227826852, 0.08327890495706539, -0.2764082444452886, -0.051929838168119094, 0.275228974858291, -0.012296096883493207, 0.010730267912534192, 0.02460451552770653, -0.05073874764688514, -0.043495827947419644, -0.20855686560636227, 0.34557375265482687, 0.10752316562496363, 0.14944371677465515, 0.02971140771460033, 0.06249494829917548, -0.01662916183013911, 0.0020394400719127032, 0.03505395233070762, -0.11045820078538396, 0.03708637824213114, 0.23507640423979295, 0.10666870441331165, 0.20843718495314656, -0.4431683574132306, -0.21985687630278675, 0.06168677524458301, 0.1411452684768523, 0.10584601712555199, -0.09652003963523292, -0.25145437975287815, 0.04185254597184011, -0.18804479345259498, -0.13910921524136755, -0.00377301088834213, 0.031178115211995476, -0.017829186666827902, -0.24648757370522292, 0.060347574070427505, 0.07337033300477049, -0.01706884938718404, -0.12738541303985848, -0.0132516234086124, -0.04855232808336426, 0.09232865432691681, 0.11494622132948094, 0.07516267929241945, 0.2120395323687817, -0.1546406381866121, -0.1302389718843249, 0.37487731345187303, -0.08287795094410115, -0.060331709118623095, 0.15196976453752525, -0.2871824635086202, -0.12506652625486792, 0.14910989750168777, 0.21519380009938346, 0.14215663005400575, -0.1146870466399054, 0.059410062716470764, -0.021716180496249286, 0.2028123961758634, 0.06384961547180062, 0.10044095751960659, 0.4193758647454808, 0.13517029881003803, 0.03013148386291844, 0.16702592430164706, -0.1735802693183976, -0.016500229549681042, -0.25649390373599984, -0.15305206191457682, -0.1486500468483921, 0.12098894865248132, -0.11454623921531878, -0.15471329145386056, 0.36006206659978984, 0.14125136954520465, 0.1660298210513478, -0.033476724730354686, 0.3246017163249281, 0.08338199189658892, 0.06476596416905522, 0.09335903417599245, 0.40522759003264797, 0.15767456753025527, 0.1308572548042028, -0.26490025000816403, 0.02634782258468538, -0.005043459647745526]
|
1,803.03799
|
Atomic-scale structure and chemistry of YIG/GGG Interface
|
Y3Fe5O12 (YIG) is a promising candidate for spin wave devices. In the thin
film devices, the interface between YIG and substrate may play important roles
in determining the device properties. Here, we use spherical
aberration-corrected scanning electron microscopy and spectroscopy to study the
atomic arrangement, chemistry and electronic structure of the YIG/Gd3Ga5O12
(GGG) interface. We find that the chemical bonding of the interface is
FeO-GdGaO and the interface remains sharp in both atomic and electronic
structures. These results provide necessary information for understanding the
properties of interface and also for atomistic calculation.
|
cond-mat.mtrl-sci
|
y3fe5o12 yig is a promising candidate for spin wave devices in the thin film devices the interface between yig and substrate may play important roles in determining the device properties here we use spherical aberrationcorrected scanning electron microscopy and spectroscopy to study the atomic arrangement chemistry and electronic structure of the yiggd3ga5o12 ggg interface we find that the chemical bonding of the interface is feogdgao and the interface remains sharp in both atomic and electronic structures these results provide necessary information for understanding the properties of interface and also for atomistic calculation
|
[['y3fe5o12', 'yig', 'is', 'a', 'promising', 'candidate', 'for', 'spin', 'wave', 'devices', 'in', 'the', 'thin', 'film', 'devices', 'the', 'interface', 'between', 'yig', 'and', 'substrate', 'may', 'play', 'important', 'roles', 'in', 'determining', 'the', 'device', 'properties', 'here', 'we', 'use', 'spherical', 'aberrationcorrected', 'scanning', 'electron', 'microscopy', 'and', 'spectroscopy', 'to', 'study', 'the', 'atomic', 'arrangement', 'chemistry', 'and', 'electronic', 'structure', 'of', 'the', 'yiggd3ga5o12', 'ggg', 'interface', 'we', 'find', 'that', 'the', 'chemical', 'bonding', 'of', 'the', 'interface', 'is', 'feogdgao', 'and', 'the', 'interface', 'remains', 'sharp', 'in', 'both', 'atomic', 'and', 'electronic', 'structures', 'these', 'results', 'provide', 'necessary', 'information', 'for', 'understanding', 'the', 'properties', 'of', 'interface', 'and', 'also', 'for', 'atomistic', 'calculation']]
|
[-0.14942720641330298, 0.11625737974730631, -0.07723613179081844, 0.0080281753190017, -0.049458035965087924, -0.13786143648645116, 0.04009485652657329, 0.4570856993397077, -0.2767608640198078, -0.32005258835852146, 0.027587841814642564, -0.30977869149193993, -0.16452223906914393, 0.21822401728067134, 0.10379294075214097, 0.03635663270122475, -0.017844690714628086, -0.13396941145021832, -0.04749379666884326, -0.11361920305320786, 0.276756116711638, 0.07814599517732859, 0.3403997058411025, 0.1863120954690708, 0.03465665934296946, 0.042856335345034795, 0.08629432311281562, -0.014784879299501579, -0.21349061201108271, 0.1301199324015114, 0.30822469511379796, -0.06825093356892467, 0.188167097297911, -0.5581983343180683, -0.18377709433746833, -0.07552651861786014, 0.13396862661983405, 0.15109227776734366, -0.16618849634606805, -0.21160982197357547, 0.07254220426289572, -0.08016766129423761, -0.10893069549120911, -0.08173503076864613, -0.007083204098873668, 0.003815396743205686, -0.19078448646727741, 0.059579515477202624, 0.057907551325236756, 0.10987527169183725, -0.1152820925399687, -0.09396997873102211, -0.0905234956751681, 0.14223774888345764, -0.0382763950775067, 0.007564799790270626, 0.22953620462988814, -0.15119358033148778, -0.0718805553805497, 0.3841220383014944, -0.013372243089704878, -0.13430917186455593, 0.22891059949373205, -0.17891451959601706, -0.04469967165754901, 0.09195166766229602, 0.13360070491778767, 0.09877008497714997, -0.16911209782443215, 0.08535159780100608, 0.0030855656189184327, 0.2107064822067817, 0.07043604583272503, 0.11567647026127412, 0.22953655138197873, 0.21126029913624128, 0.0342545137507841, 0.14496127215679736, -0.14744304465647373, -0.007277004979550838, -0.20567396773646276, -0.29199463081442645, -0.19101622339545024, 0.04114962926073026, -0.07457142625838363, -0.1976687008721961, 0.38028639946132897, 0.1551638808580012, 0.12194209719180232, -0.13323205256213744, 0.2904452272794313, 0.03837728034187522, 0.04783043083217409, -0.018495995794526404, 0.23552694595936272, 0.19372997193907698, 0.11934851206493072, -0.27133293169447115, 0.13785465787966839, 0.005167452846136358]
|
1,803.038
|
ARMDN: Associative and Recurrent Mixture Density Networks for eRetail
Demand Forecasting
|
Accurate demand forecasts can help on-line retail organizations better plan
their supply-chain processes. The challenge, however, is the large number of
associative factors that result in large, non-stationary shifts in demand,
which traditional time series and regression approaches fail to model. In this
paper, we propose a Neural Network architecture called AR-MDN, that
simultaneously models associative factors, time-series trends and the variance
in the demand. We first identify several causal features and use a combination
of feature embeddings, MLP and LSTM to represent them. We then model the output
density as a learned mixture of Gaussian distributions. The AR-MDN can be
trained end-to-end without the need for additional supervision. We experiment
on a dataset of an year's worth of data over tens-of-thousands of products from
Flipkart. The proposed architecture yields a significant improvement in
forecasting accuracy when compared with existing alternatives.
|
cs.LG cs.AI stat.ML
|
accurate demand forecasts can help online retail organizations better plan their supplychain processes the challenge however is the large number of associative factors that result in large nonstationary shifts in demand which traditional time series and regression approaches fail to model in this paper we propose a neural network architecture called armdn that simultaneously models associative factors timeseries trends and the variance in the demand we first identify several causal features and use a combination of feature embeddings mlp and lstm to represent them we then model the output density as a learned mixture of gaussian distributions the armdn can be trained endtoend without the need for additional supervision we experiment on a dataset of an years worth of data over tensofthousands of products from flipkart the proposed architecture yields a significant improvement in forecasting accuracy when compared with existing alternatives
|
[['accurate', 'demand', 'forecasts', 'can', 'help', 'online', 'retail', 'organizations', 'better', 'plan', 'their', 'supplychain', 'processes', 'the', 'challenge', 'however', 'is', 'the', 'large', 'number', 'of', 'associative', 'factors', 'that', 'result', 'in', 'large', 'nonstationary', 'shifts', 'in', 'demand', 'which', 'traditional', 'time', 'series', 'and', 'regression', 'approaches', 'fail', 'to', 'model', 'in', 'this', 'paper', 'we', 'propose', 'a', 'neural', 'network', 'architecture', 'called', 'armdn', 'that', 'simultaneously', 'models', 'associative', 'factors', 'timeseries', 'trends', 'and', 'the', 'variance', 'in', 'the', 'demand', 'we', 'first', 'identify', 'several', 'causal', 'features', 'and', 'use', 'a', 'combination', 'of', 'feature', 'embeddings', 'mlp', 'and', 'lstm', 'to', 'represent', 'them', 'we', 'then', 'model', 'the', 'output', 'density', 'as', 'a', 'learned', 'mixture', 'of', 'gaussian', 'distributions', 'the', 'armdn', 'can', 'be', 'trained', 'endtoend', 'without', 'the', 'need', 'for', 'additional', 'supervision', 'we', 'experiment', 'on', 'a', 'dataset', 'of', 'an', 'years', 'worth', 'of', 'data', 'over', 'tensofthousands', 'of', 'products', 'from', 'flipkart', 'the', 'proposed', 'architecture', 'yields', 'a', 'significant', 'improvement', 'in', 'forecasting', 'accuracy', 'when', 'compared', 'with', 'existing', 'alternatives']]
|
[-0.04854978941985667, 0.01598442431378912, -0.0713126851905727, 0.0899412550246544, -0.09576442119457738, -0.15404566013917542, 0.06325723322547248, 0.4525553816728455, -0.28350746934469656, -0.3267415779267552, 0.08700709427093832, -0.2915679854575357, -0.17717575018081425, 0.18631577322581153, -0.12184902300334556, 0.0994570616920807, 0.13316733212789802, 0.04725751692174579, -0.03962271257551561, -0.3001788285637958, 0.2887100057418949, 0.08163497832992363, 0.33582680189995456, -0.0260400429280917, 0.11940523948965982, -0.03916475922539294, -0.0518248052229073, -0.0013326134996676294, -0.044639091878956046, 0.18779162657380158, 0.31139457130440024, 0.18931801624180708, 0.33146755200670025, -0.44824024017819825, -0.2366298064857507, 0.1357520231809601, 0.12128996159110834, 0.07879923010603425, 0.004448757144260696, -0.27385022349173216, 0.032948259926709286, -0.23823660484803239, -0.017381664251627252, -0.1478107350035872, -0.01627104995326682, 0.021329711042277568, -0.33523567347693517, 0.0612251216750056, 0.0650819192419378, 0.055163491885814306, -0.07025891187158581, -0.11541235977917802, 0.02035108529259082, 0.1576241791449745, 0.05319594775105445, 0.02862497062335233, 0.0994386406843182, -0.17162125159168898, -0.15116668495570693, 0.33434227498904834, -0.11699989976079987, -0.1982522263801355, 0.15477939320162018, -0.05908692998077935, -0.15070207941968985, 0.08899383404352468, 0.2655698690268633, 0.049854364604588676, -0.17906055041882393, 0.005047747111550981, -0.029249310390454242, 0.17899454282529706, 0.023501035129222615, -0.014173032823119233, 0.17691313498234712, 0.25233404562982775, 0.027056753310448618, 0.10243660130909905, -0.11982493351629044, -0.05851697277113554, -0.2276828149869609, -0.11865208291006023, -0.1469170305636718, 0.004929163958877325, -0.13863486838786654, -0.13024249317613598, 0.40554276712091386, 0.23097761754757262, 0.21052355476715368, 0.11877822213414252, 0.32874521069067847, 0.035299945099232385, 0.13583503993020374, 0.10545797535157997, 0.14252962428647623, -0.0004909657839712479, 0.133183712956308, -0.12549994667998696, 0.11349475908213758, 0.007293247994665297]
|
1,803.03801
|
Properties of the coordinate ring of a convex polyomino
|
We classify all convex polyomino whose coordinate rings are Gorenstein. We
also compute the Castelnuovo-Mumford regularity of the coordinate ring of any
stack polyomino in terms of the smallest interval which contains its vertices.
We give a recursive formula for computing the multiplicity of a stack
polyomino.
|
math.AC
|
we classify all convex polyomino whose coordinate rings are gorenstein we also compute the castelnuovomumford regularity of the coordinate ring of any stack polyomino in terms of the smallest interval which contains its vertices we give a recursive formula for computing the multiplicity of a stack polyomino
|
[['we', 'classify', 'all', 'convex', 'polyomino', 'whose', 'coordinate', 'rings', 'are', 'gorenstein', 'we', 'also', 'compute', 'the', 'castelnuovomumford', 'regularity', 'of', 'the', 'coordinate', 'ring', 'of', 'any', 'stack', 'polyomino', 'in', 'terms', 'of', 'the', 'smallest', 'interval', 'which', 'contains', 'its', 'vertices', 'we', 'give', 'a', 'recursive', 'formula', 'for', 'computing', 'the', 'multiplicity', 'of', 'a', 'stack', 'polyomino']]
|
[-0.2391747984084043, -0.03258041517952695, -0.07086242025995508, 0.027340353823247107, -0.07993000730911785, -0.1611057136584311, -0.0483382910742682, 0.3519598779050594, -0.35077411245475426, -0.19505896946375675, 0.1020149541994002, -0.2776207315953488, -0.07920585988842427, 0.1226543224357227, -0.150758476056, -0.0322524661686212, 0.039329590657329626, 0.09597638542664812, -0.06607332461057826, -0.3584834250443159, 0.32077552703149775, -0.04858638996139486, 0.15064812115235057, 0.03852343654378931, 0.13896359073275583, 0.0791307897108825, -0.01578559010150902, 0.06914453806870795, -0.24240137870482942, 0.15799262477679454, 0.27857358920130326, 0.15765917681633157, 0.13602990320229785, -0.4158600178804803, 0.004566683562749878, 0.23042790312319994, 0.159126785524348, 0.04199352128024986, 0.02148243372744702, -0.1179814274878578, 0.16051619131355843, -0.20953866930559595, -0.19627446445458113, -0.016560392553343416, 0.12902722263986127, 0.09948887897932783, -0.22530341643760812, -0.04877231270632152, 0.11814077319379182, 0.15511267126953981, -0.029484942488550665, -0.12105554877284994, -0.08817958058987527, 0.053262185979079696, -0.09457697691594033, -0.02245131197157613, 0.127990135923028, -0.056120723529912014, -0.16286450249955375, 0.32277276168795344, 0.002735005057555564, -0.2409689091245069, 0.08502235101099978, -0.19058911001032336, -0.08518328479035421, 0.17157229493827897, 0.10190360299608808, 0.20834004118087443, -0.0757903645330287, 0.17787674172444545, -0.21229275751938212, 0.05878250043284386, 0.17518467696859163, 0.06916442281130622, 0.16419311652475216, 0.09564086450065704, 0.12826266389976732, 0.230274165722918, -0.0173758564199856, 0.006671743417911707, -0.38151573698888436, -0.22049548262928395, -0.17797899466414163, 0.0741087369462277, -0.16589646508045336, -0.28642843447704897, 0.4661267656595149, 0.07721967904016058, 0.23081330170339726, 0.16135309173160808, 0.22531367911699604, 0.03521221574950725, 0.07952127106329228, 0.1497122011385224, 0.07920801602403059, 0.14096200032199316, -0.02436428223835661, -0.15156351518321862, 0.04687266148864589, 0.25025801408164045]
|
1,803.03802
|
Measurement of the Integrated Luminosities of Cross-section Scan Data
Samples Around the $\psi(3770)$ Mass Region
|
To investigate the nature of the $\psi(3770)$ resonance and to measure the
cross section for $e^+e^- \to D\bar{D}$, a cross-section scan data sample,
distributed among 41 center-of-mass energy points from 3.73 to 3.89~GeV, was
taken with the BESIII detector operated at the BEPCII collider in the year
2010. By analyzing the large angle Bhabha scattering events, we measure the
integrated luminosity of the data sample at each center-of-mass energy point.
The total integrated luminosity of the data sample is
$76.16\pm0.04\pm0.61$~pb$^{-1}$, where the first uncertainty is statistical and
the second systematic.
|
hep-ex
|
to investigate the nature of the psi3770 resonance and to measure the cross section for ee to dbard a crosssection scan data sample distributed among 41 centerofmass energy points from 373 to 389gev was taken with the besiii detector operated at the bepcii collider in the year 2010 by analyzing the large angle bhabha scattering events we measure the integrated luminosity of the data sample at each centerofmass energy point the total integrated luminosity of the data sample is 7616pm004pm061pb1 where the first uncertainty is statistical and the second systematic
|
[['to', 'investigate', 'the', 'nature', 'of', 'the', 'psi3770', 'resonance', 'and', 'to', 'measure', 'the', 'cross', 'section', 'for', 'ee', 'to', 'dbard', 'a', 'crosssection', 'scan', 'data', 'sample', 'distributed', 'among', '41', 'centerofmass', 'energy', 'points', 'from', '373', 'to', '389gev', 'was', 'taken', 'with', 'the', 'besiii', 'detector', 'operated', 'at', 'the', 'bepcii', 'collider', 'in', 'the', 'year', '2010', 'by', 'analyzing', 'the', 'large', 'angle', 'bhabha', 'scattering', 'events', 'we', 'measure', 'the', 'integrated', 'luminosity', 'of', 'the', 'data', 'sample', 'at', 'each', 'centerofmass', 'energy', 'point', 'the', 'total', 'integrated', 'luminosity', 'of', 'the', 'data', 'sample', 'is', '7616pm004pm061pb1', 'where', 'the', 'first', 'uncertainty', 'is', 'statistical', 'and', 'the', 'second', 'systematic']]
|
[-0.0665519892513244, 0.08870180163913491, -0.09386808288664641, 0.10382374682177958, -0.01711941480012187, -0.04193780229913748, 0.06623059333915907, 0.32100113409317355, -0.21141765735493126, -0.3753593165258115, 0.02691719018383248, -0.43688046566041355, 0.10955551034897905, 0.1720737879487305, 0.043518910988826646, 0.1518768101867119, 0.12865250614810397, 0.005347573346543041, -0.028235483697657895, -0.2130842107898471, 0.28545148015704896, 0.18020581239728595, 0.29953500448556786, 0.0613554082096512, 0.13532792407336688, 0.0528027922952209, -0.059649363123092124, -0.06624213721476156, -0.1222468629923903, 0.060855135481688194, 0.32461980409888463, 0.10581818813542751, 0.17500242913692174, -0.3365319019954272, -0.023620243067853153, 0.1671713592421094, 0.06685631654082416, 0.04068566054444422, 0.00544171530848623, -0.3406259802921506, 0.0747532645737837, -0.16958877738207692, -0.11614439381942661, 0.0495058354572393, 0.0895911889118989, -0.047014121505939824, -0.2677848298123784, 0.07464772412045435, -0.08353210968198255, 0.08613973775010725, -0.05703044440914792, -0.1554978747312403, -0.049893964304250076, -0.006807697508272461, 0.025051391096150673, 0.05674186967239207, 0.20547737189124085, -0.06680575171908872, -0.13710723827931692, 0.3276405326006087, -0.013549818128178065, -0.05710719695145434, 0.13392479518237946, -0.25245114405829966, -0.07059815813607367, 0.20775967547193763, 0.32833035388665105, 0.006161472846129486, -0.28190995736142876, 0.07130020396355329, 0.02666100903033194, 0.19297354280140347, 0.06454068621281873, 0.02916555953296748, 0.17617163133003155, 0.22841922208582136, 0.019320678579705684, 0.10413042577618564, -0.25093804727393115, -0.05062617017855783, -0.40468955420973624, -0.1249251136111773, -0.1581216331740672, 0.05595005068409426, -0.01617862855114667, -0.03250347333960235, 0.36046741491141304, 0.10818588893148857, 0.3196264414000325, -0.010152301729910752, 0.27754417226903816, 0.15537808720149437, 0.09146374737776403, 0.07915740079211404, 0.3261388538151302, 0.09832575197850185, 0.16540519858773967, -0.2523536365482538, -0.013904828705232252, -0.040381729285317386]
|
1,803.03803
|
Estimating fast mean-reverting jumps in electricity market models
|
Based on empirical evidence of fast mean-reverting spikes, we model
electricity price processes $X+Z^\beta$ as the sum of a continuous It\^o
semimartingale $X$ and a a mean-reverting compound Poisson process $Z_t^\beta =
\int_0^t \int_{\mathbb{R}} xe^{-\beta(t-s)}\underline{p}(ds,dt)$ where
$\underline{p}(ds,dt)$ is Poisson random measure with intensity $\lambda
ds\otimes dt$. In a first part, we investigate the estimation of
$(\lambda,\beta)$ from discrete observations and establish asymptotic
efficiency in various asymptotic settings. In a second part, we discuss the use
of our inference results for correcting the value of forward contracts on
electricity markets in presence of spikes. We implement our method on real data
in the French, Greman and Australian market over 2015 and 2016 and show in
particular the effect of spike modelling on the valuation of certain strip
options. In particular, we show that some out-of-the-money options have a
significant value if we incorporate spikes in our modelling, while having a
value close to $0$ otherwise.
|
math.ST stat.TH
|
based on empirical evidence of fast meanreverting spikes we model electricity price processes xzbeta as the sum of a continuous ito semimartingale x and a a meanreverting compound poisson process z_tbeta int_0t int_mathbbr xebetatsunderlinepdsdt where underlinepdsdt is poisson random measure with intensity lambda dsotimes dt in a first part we investigate the estimation of lambdabeta from discrete observations and establish asymptotic efficiency in various asymptotic settings in a second part we discuss the use of our inference results for correcting the value of forward contracts on electricity markets in presence of spikes we implement our method on real data in the french greman and australian market over 2015 and 2016 and show in particular the effect of spike modelling on the valuation of certain strip options in particular we show that some outofthemoney options have a significant value if we incorporate spikes in our modelling while having a value close to 0 otherwise
|
[['based', 'on', 'empirical', 'evidence', 'of', 'fast', 'meanreverting', 'spikes', 'we', 'model', 'electricity', 'price', 'processes', 'xzbeta', 'as', 'the', 'sum', 'of', 'a', 'continuous', 'ito', 'semimartingale', 'x', 'and', 'a', 'a', 'meanreverting', 'compound', 'poisson', 'process', 'z_tbeta', 'int_0t', 'int_mathbbr', 'xebetatsunderlinepdsdt', 'where', 'underlinepdsdt', 'is', 'poisson', 'random', 'measure', 'with', 'intensity', 'lambda', 'dsotimes', 'dt', 'in', 'a', 'first', 'part', 'we', 'investigate', 'the', 'estimation', 'of', 'lambdabeta', 'from', 'discrete', 'observations', 'and', 'establish', 'asymptotic', 'efficiency', 'in', 'various', 'asymptotic', 'settings', 'in', 'a', 'second', 'part', 'we', 'discuss', 'the', 'use', 'of', 'our', 'inference', 'results', 'for', 'correcting', 'the', 'value', 'of', 'forward', 'contracts', 'on', 'electricity', 'markets', 'in', 'presence', 'of', 'spikes', 'we', 'implement', 'our', 'method', 'on', 'real', 'data', 'in', 'the', 'french', 'greman', 'and', 'australian', 'market', 'over', '2015', 'and', '2016', 'and', 'show', 'in', 'particular', 'the', 'effect', 'of', 'spike', 'modelling', 'on', 'the', 'valuation', 'of', 'certain', 'strip', 'options', 'in', 'particular', 'we', 'show', 'that', 'some', 'outofthemoney', 'options', 'have', 'a', 'significant', 'value', 'if', 'we', 'incorporate', 'spikes', 'in', 'our', 'modelling', 'while', 'having', 'a', 'value', 'close', 'to', '0', 'otherwise']]
|
[-0.07632979077166643, 0.016580294716317636, -0.09315502653405273, 0.08617744731863965, -0.06451555515075622, -0.09787114112927787, 0.11689375819270911, 0.41943838610155443, -0.2548584214215275, -0.22748784497253546, 0.1613698771451505, -0.30238454059704023, -0.15970813316692198, 0.197397787627197, -0.11169282161966473, 0.01072670570036181, 0.03437353153618015, 0.01919779711130525, 0.004664501328920933, -0.23960031008309857, 0.27270589290237446, 0.04234258666457165, 0.2665280746486114, 0.014092508486478406, 0.1533711336364615, 0.0007997784149028412, -0.04368342302714278, -0.03776891667041041, -0.1468159527897294, 0.0902846271024073, 0.24087552759213512, 0.07323904827254551, 0.3286413567736238, -0.4268808197800298, -0.1872553730028726, 0.14548456566831966, 0.047954182794672395, 0.014161274770787937, -0.03266517401254755, -0.257559662862193, 0.04533076558110057, -0.19179742656439086, -0.10079642773612218, -0.057408283496288216, 0.044977909711119875, 0.08388719429558168, -0.3307837066573224, 0.07119013190421523, 0.07004499447779083, 0.034766471615301914, -0.05880194402982474, -0.13267181862183675, -0.0024685897558712126, 0.07122053281042953, 0.08812140761205427, -0.042812622831754236, 0.08543176765927449, -0.1171361816616184, -0.13570034001846196, 0.3218023647763291, -0.12520410478127753, -0.17236386443532647, 0.10121044854722208, -0.19898556149406296, -0.1709548308200054, 0.08070326021549348, 0.22549127193712662, 0.10622708637546115, -0.13557303125406203, 0.10352424209181942, -0.04402250543848111, 0.15143140680378392, 0.07079124165901622, -0.038930546660229666, 0.17193759276791393, 0.19072471336987454, 0.07153785060679375, 0.14377496788297228, -0.1253541596526863, -0.14664810415370022, -0.34531370497175623, -0.1599928416204037, -0.15227293584267704, 0.08076302115932157, -0.13214618383800267, -0.16188230431404244, 0.3669004752981749, 0.17248455422683334, 0.19927067604853588, 0.09356805612491507, 0.25431485849806446, 0.16025407551344306, -0.030565407816922532, 0.08573856513446741, 0.13907017885033376, 0.06565154344477013, 0.13606242448816924, -0.16047470757462953, 0.12278003296593115, 0.012056184307550125]
|
1,803.03804
|
Analog of Anderson theorem for the polar phase of liquid 3He in nematic
aerogel
|
It is shown that if impurities in superfluid 3He have form of infinitely long
non-magnetic strands, which are straight, parallel to each other and reflect
quasi-particles specularly, the temperature of transition of liquid 3He from
the normal into the polar phase coincides with that for the bulk liquid without
impurities. Magnetic scattering lowers transition temperature for the polar
phase in analogy with the conventional superconductors. These results are
discussed in connection with the recent experimental findings.
|
cond-mat.dis-nn cond-mat.supr-con
|
it is shown that if impurities in superfluid 3he have form of infinitely long nonmagnetic strands which are straight parallel to each other and reflect quasiparticles specularly the temperature of transition of liquid 3he from the normal into the polar phase coincides with that for the bulk liquid without impurities magnetic scattering lowers transition temperature for the polar phase in analogy with the conventional superconductors these results are discussed in connection with the recent experimental findings
|
[['it', 'is', 'shown', 'that', 'if', 'impurities', 'in', 'superfluid', '3he', 'have', 'form', 'of', 'infinitely', 'long', 'nonmagnetic', 'strands', 'which', 'are', 'straight', 'parallel', 'to', 'each', 'other', 'and', 'reflect', 'quasiparticles', 'specularly', 'the', 'temperature', 'of', 'transition', 'of', 'liquid', '3he', 'from', 'the', 'normal', 'into', 'the', 'polar', 'phase', 'coincides', 'with', 'that', 'for', 'the', 'bulk', 'liquid', 'without', 'impurities', 'magnetic', 'scattering', 'lowers', 'transition', 'temperature', 'for', 'the', 'polar', 'phase', 'in', 'analogy', 'with', 'the', 'conventional', 'superconductors', 'these', 'results', 'are', 'discussed', 'in', 'connection', 'with', 'the', 'recent', 'experimental', 'findings']]
|
[-0.13034599242995396, 0.3221484485976888, -0.04677735276422218, -0.0049427076362343015, -0.017616502585281666, -0.17402483384419037, 0.04827872713978745, 0.39582637757504063, -0.23023106478840896, -0.23837029292419748, 0.013644094690741775, -0.3587931132336196, -0.09525679183302839, 0.16656867210067025, 0.02819289983323726, 0.0030718153269079173, -0.044399303399443035, 0.03597158199562201, -0.1453408251308199, -0.2056879978657602, 0.3043672499786082, -0.009194705898775473, 0.3519556417901951, 0.08236206783055279, -0.010904977686311068, -0.039685020186497194, 0.07690063191234674, 0.03184219553919607, -0.11313031498732591, 0.006185449501285085, 0.2826773982838188, -0.0756433083136615, 0.09473255663914115, -0.5382657348864565, -0.24203962378056817, 0.04283051842848133, 0.14031020227795174, 0.13098613841085402, -0.09983935995689153, -0.27255558357328963, 0.019291049126829756, -0.12406936485173278, -0.13980012456580115, -0.0612280489509239, 0.023129527965609572, 0.04894573320512121, -0.18278693995977702, 0.08722446250919204, 0.10429054688613273, 0.03629162614723962, -0.10275814455541733, -0.1466210141018229, -0.03381042509633852, 0.07212857576087117, 0.10867150872639429, 0.08372793724993244, 0.12497012002361436, -0.11647088601449995, -0.05154593900385264, 0.3426443111200474, -0.05364255310575429, -0.1183795605197941, 0.1969351507355704, -0.19723363459649446, -0.06723573830248297, 0.2346800288528596, 0.0767349155595232, 0.0538679121282736, -0.08740213835660957, 0.04966474318567443, -0.06471491525390823, 0.1278695388540846, 0.04001759718123235, 0.04213544954913423, 0.2807593796353199, 0.19439055975664432, -0.0008452379506228393, 0.14301191992509352, -0.1395613887641383, -0.12275416495915699, -0.2548938996991829, -0.21802320888903187, -0.19327548787144846, -0.01928047919768448, -0.06434006310097941, -0.19961976635041587, 0.3019881589356565, 0.12491008677936502, 0.20079815839907447, -0.0541555431263987, 0.25900396348075255, 0.07350707311477316, 0.0716761681006143, 0.06561417583572238, 0.29567701844988686, 0.18652343329679416, 0.08873046027790558, -0.27134584487526137, 0.09026425293689642, 0.047675807994030615]
|
1,803.03805
|
Two comments on balls in vertex transitive graphs
|
We observe that a ball of radius $1$ in the grandfather graph can not be
realized as a ball of radius $1$ in a finite vertex transitive graph. We remark
on when a ball in a finite vertex transitive graph appears as a ball in an
infinite vertex transitive graph.
|
math.CO math.GR
|
we observe that a ball of radius 1 in the grandfather graph can not be realized as a ball of radius 1 in a finite vertex transitive graph we remark on when a ball in a finite vertex transitive graph appears as a ball in an infinite vertex transitive graph
|
[['we', 'observe', 'that', 'a', 'ball', 'of', 'radius', '1', 'in', 'the', 'grandfather', 'graph', 'can', 'not', 'be', 'realized', 'as', 'a', 'ball', 'of', 'radius', '1', 'in', 'a', 'finite', 'vertex', 'transitive', 'graph', 'we', 'remark', 'on', 'when', 'a', 'ball', 'in', 'a', 'finite', 'vertex', 'transitive', 'graph', 'appears', 'as', 'a', 'ball', 'in', 'an', 'infinite', 'vertex', 'transitive', 'graph']]
|
[-0.1268816463276744, 0.16413107388914797, -0.08302063308656216, 0.06120047740638256, -0.13122180968523026, -0.15941787691786885, 0.05232061802409589, 0.41932148069143294, -0.26828521236777303, -0.16095952820032836, 0.1325794385932386, -0.3397247136384249, -0.11038627743721008, 0.0893223251029849, -0.20747989770025016, -0.0006131722033023834, 0.12894772254861891, 0.23464223875664175, -0.051868651693221184, -0.22286889352137224, 0.2984732028283179, -0.06671975882723928, 0.1016393630951643, 0.13357026563957333, 0.13805886298418046, 0.0382625618041493, 0.0553912978246808, 0.19341332137584685, -0.18881698817553116, -0.033985033687204125, 0.27542891338467596, 0.12444428817369044, 0.315845055654645, -0.37631324119865894, -0.18776186376810075, 0.1964884893130511, 0.15411072140559554, 0.029623292684555054, -0.03079635785194114, -0.2094269580976106, 0.14471783131361007, -0.19126623775810003, -0.16276282848790288, 0.06425971147691598, 0.12320869558490813, -0.03866457663476467, -0.25253154936246575, -0.061810755226761105, 0.206602567397058, 0.031643279306590555, 0.07736886667087674, -0.0961403794027865, -0.0332458108663559, 0.07660524169739802, -0.1271729995496571, 0.14721161517314613, 0.12003692118451, -0.057997294741217044, -0.17082986366003752, 0.3989279822260141, -0.07865264483727515, -0.23864638559520246, 0.04185883950442076, -0.1919006137177348, -0.15799196107313038, 0.061369131095707415, 0.1592504270747304, 0.12001547345425934, -0.07663446463324362, 0.17216998828575014, -0.15525394767057152, 0.1581676716543734, 0.11942198526114225, -0.03224170961417258, 0.162051692456007, 0.17735348684247584, 0.20737615531310438, 0.19086331941885873, 0.015550968707539142, -0.00413693306967616, -0.3681055329740047, -0.06304107956588269, -0.27070096775889396, 0.07966516940417932, -0.2060802331380546, -0.24552212692797185, 0.3790878523513675, -0.0010618572402745486, 0.27024227917194366, 0.05326961416751146, 0.1515056562423706, 0.015015107984654606, 0.09771312174387276, 0.16638141376897692, 0.10815596044063568, 0.14567829406354577, -0.05681273008696735, -0.17681343311851377, -0.044997278801165524, 0.19034296739846468]
|
1,803.03806
|
Learning Quick Fixes from Code Repositories
|
Code analyzers such as Error Prone and FindBugs detect code patterns
symptomatic of bugs, performance issues, or bad style. These tools express
patterns as quick fixes that detect and rewrite unwanted code. However, it is
difficult to come up with new quick fixes and decide which ones are useful and
frequently appear in real code. We propose to rely on the collective wisdom of
programmers and learn quick fixes from revision histories in software
repositories. We present REVISAR, a tool for discovering common Java edit
patterns in code repositories. Given code repositories and their revision
histories, REVISAR (i) identifies code edits from revisions and (ii) clusters
edits into sets that can be described using an edit pattern. The designers of
code analyzers can then inspect the patterns and add the corresponding quick
fixes to their tools. We ran REVISAR on nine popular GitHub projects, and it
discovered 89 useful edit patterns that appeared in 3 or more projects.
Moreover, 64% of the discovered patterns did not appear in existing tools. We
then conducted a survey with 164 programmers from 124 projects and found that
programmers significantly preferred eight out of the nine of the discovered
patterns. Finally, we submitted 16 pull requests applying our patterns to 9
projects and, at the time of the writing, programmers accepted 6 (60%) of them.
The results of this work aid toolsmiths in discovering quick fixes and making
informed decisions about which quick fixes to prioritize based on patterns
programmers actually apply in practice.
|
cs.SE
|
code analyzers such as error prone and findbugs detect code patterns symptomatic of bugs performance issues or bad style these tools express patterns as quick fixes that detect and rewrite unwanted code however it is difficult to come up with new quick fixes and decide which ones are useful and frequently appear in real code we propose to rely on the collective wisdom of programmers and learn quick fixes from revision histories in software repositories we present revisar a tool for discovering common java edit patterns in code repositories given code repositories and their revision histories revisar i identifies code edits from revisions and ii clusters edits into sets that can be described using an edit pattern the designers of code analyzers can then inspect the patterns and add the corresponding quick fixes to their tools we ran revisar on nine popular github projects and it discovered 89 useful edit patterns that appeared in 3 or more projects moreover 64 of the discovered patterns did not appear in existing tools we then conducted a survey with 164 programmers from 124 projects and found that programmers significantly preferred eight out of the nine of the discovered patterns finally we submitted 16 pull requests applying our patterns to 9 projects and at the time of the writing programmers accepted 6 60 of them the results of this work aid toolsmiths in discovering quick fixes and making informed decisions about which quick fixes to prioritize based on patterns programmers actually apply in practice
|
[['code', 'analyzers', 'such', 'as', 'error', 'prone', 'and', 'findbugs', 'detect', 'code', 'patterns', 'symptomatic', 'of', 'bugs', 'performance', 'issues', 'or', 'bad', 'style', 'these', 'tools', 'express', 'patterns', 'as', 'quick', 'fixes', 'that', 'detect', 'and', 'rewrite', 'unwanted', 'code', 'however', 'it', 'is', 'difficult', 'to', 'come', 'up', 'with', 'new', 'quick', 'fixes', 'and', 'decide', 'which', 'ones', 'are', 'useful', 'and', 'frequently', 'appear', 'in', 'real', 'code', 'we', 'propose', 'to', 'rely', 'on', 'the', 'collective', 'wisdom', 'of', 'programmers', 'and', 'learn', 'quick', 'fixes', 'from', 'revision', 'histories', 'in', 'software', 'repositories', 'we', 'present', 'revisar', 'a', 'tool', 'for', 'discovering', 'common', 'java', 'edit', 'patterns', 'in', 'code', 'repositories', 'given', 'code', 'repositories', 'and', 'their', 'revision', 'histories', 'revisar', 'i', 'identifies', 'code', 'edits', 'from', 'revisions', 'and', 'ii', 'clusters', 'edits', 'into', 'sets', 'that', 'can', 'be', 'described', 'using', 'an', 'edit', 'pattern', 'the', 'designers', 'of', 'code', 'analyzers', 'can', 'then', 'inspect', 'the', 'patterns', 'and', 'add', 'the', 'corresponding', 'quick', 'fixes', 'to', 'their', 'tools', 'we', 'ran', 'revisar', 'on', 'nine', 'popular', 'github', 'projects', 'and', 'it', 'discovered', '89', 'useful', 'edit', 'patterns', 'that', 'appeared', 'in', '3', 'or', 'more', 'projects', 'moreover', '64', 'of', 'the', 'discovered', 'patterns', 'did', 'not', 'appear', 'in', 'existing', 'tools', 'we', 'then', 'conducted', 'a', 'survey', 'with', '164', 'programmers', 'from', '124', 'projects', 'and', 'found', 'that', 'programmers', 'significantly', 'preferred', 'eight', 'out', 'of', 'the', 'nine', 'of', 'the', 'discovered', 'patterns', 'finally', 'we', 'submitted', '16', 'pull', 'requests', 'applying', 'our', 'patterns', 'to', '9', 'projects', 'and', 'at', 'the', 'time', 'of', 'the', 'writing', 'programmers', 'accepted', '6', '60', 'of', 'them', 'the', 'results', 'of', 'this', 'work', 'aid', 'toolsmiths', 'in', 'discovering', 'quick', 'fixes', 'and', 'making', 'informed', 'decisions', 'about', 'which', 'quick', 'fixes', 'to', 'prioritize', 'based', 'on', 'patterns', 'programmers', 'actually', 'apply', 'in', 'practice']]
|
[-0.0847407880622097, 0.04973124294738373, -0.09775070269521041, 0.13100319551715411, -0.1510122894098137, -0.20856714570692864, 0.12552118615666216, 0.38027279235115913, -0.25099641762030533, -0.38041437709756404, 0.11079800062781073, -0.3052609371223364, -0.13355561995684323, 0.2035647245733176, -0.09149817907603001, 0.022080801580714654, 0.10303264724681654, 0.0004419491674945536, -0.06470568456226983, -0.3091074509506888, 0.2754417200756061, 0.07937365579213124, 0.24397478251340218, 0.01608176194067673, 0.00721658250489029, 0.0018510332819164158, -0.166753052189632, -0.030140514041383164, -0.09703842969202198, 0.10743529566429952, 0.32168640648800295, 0.287620997963376, 0.26601847975578413, -0.4326670761799896, -0.11138720105001965, 0.01828243038299153, 0.1477791064935007, 0.12205535945240371, -0.011121035415885397, -0.28050398154849987, 0.12105058837517438, -0.18836834659541857, -0.10225485555708864, -0.09958217801090449, 0.021245454800835097, 0.008760206986229912, -0.2036724057105598, -0.039623593801191175, 0.03664295146958042, 0.1296394595756648, 0.007439266639690562, -0.11316536736008842, 0.0002482015596501423, 0.20272726950845327, 0.06616360988714788, 0.0606957535889658, 0.15030524042064705, -0.085167289056991, -0.13872016641689114, 0.4227685121684728, -0.016477412824008435, -0.13183618704372285, 0.23606050707050133, -0.03233672310616896, -0.16841469841811013, 0.11051754598916287, 0.19869190429049324, 0.09345177106136628, -0.17982459810925236, 0.006466835348271478, 0.03145761680359163, 0.24855753680294657, 0.11293069775292021, -0.0279017229074515, 0.2222592477111289, 0.08915232917308867, -0.007526389244629676, 0.10831408413458077, -0.04110292526325267, -0.037039432229556475, -0.23813454004146728, -0.12420403427373333, -0.0742827229534676, 0.0024558743369044646, -0.045736080526709036, -0.19669303188062354, 0.3878257831597858, 0.2286440402187078, 0.11956051637111867, 0.028941799790213205, 0.24577978852926846, -0.03320056637403103, 0.16713187099312526, 0.1574908501232963, 0.1226760289037084, -0.005543359487804203, 0.13464236204291744, -0.1407781479586604, 0.11384278997530166, -0.006251539167271082]
|
1,803.03807
|
CIoTA: Collaborative IoT Anomaly Detection via Blockchain
|
Due to their rapid growth and deployment, Internet of things (IoT) devices
have become a central aspect of our daily lives. However, they tend to have
many vulnerabilities which can be exploited by an attacker. Unsupervised
techniques, such as anomaly detection, can help us secure the IoT devices.
However, an anomaly detection model must be trained for a long time in order to
capture all benign behaviors. This approach is vulnerable to adversarial
attacks since all observations are assumed to be benign while training the
anomaly detection model.
In this paper, we propose CIoTA, a lightweight framework that utilizes the
blockchain concept to perform distributed and collaborative anomaly detection
for devices with limited resources. CIoTA uses blockchain to incrementally
update a trusted anomaly detection model via self-attestation and consensus
among IoT devices. We evaluate CIoTA on our own distributed IoT simulation
platform, which consists of 48 Raspberry Pis, to demonstrate CIoTA's ability to
enhance the security of each device and the security of the network as a whole.
|
cs.CY cs.CR cs.DC cs.LG
|
due to their rapid growth and deployment internet of things iot devices have become a central aspect of our daily lives however they tend to have many vulnerabilities which can be exploited by an attacker unsupervised techniques such as anomaly detection can help us secure the iot devices however an anomaly detection model must be trained for a long time in order to capture all benign behaviors this approach is vulnerable to adversarial attacks since all observations are assumed to be benign while training the anomaly detection model in this paper we propose ciota a lightweight framework that utilizes the blockchain concept to perform distributed and collaborative anomaly detection for devices with limited resources ciota uses blockchain to incrementally update a trusted anomaly detection model via selfattestation and consensus among iot devices we evaluate ciota on our own distributed iot simulation platform which consists of 48 raspberry pis to demonstrate ciotas ability to enhance the security of each device and the security of the network as a whole
|
[['due', 'to', 'their', 'rapid', 'growth', 'and', 'deployment', 'internet', 'of', 'things', 'iot', 'devices', 'have', 'become', 'a', 'central', 'aspect', 'of', 'our', 'daily', 'lives', 'however', 'they', 'tend', 'to', 'have', 'many', 'vulnerabilities', 'which', 'can', 'be', 'exploited', 'by', 'an', 'attacker', 'unsupervised', 'techniques', 'such', 'as', 'anomaly', 'detection', 'can', 'help', 'us', 'secure', 'the', 'iot', 'devices', 'however', 'an', 'anomaly', 'detection', 'model', 'must', 'be', 'trained', 'for', 'a', 'long', 'time', 'in', 'order', 'to', 'capture', 'all', 'benign', 'behaviors', 'this', 'approach', 'is', 'vulnerable', 'to', 'adversarial', 'attacks', 'since', 'all', 'observations', 'are', 'assumed', 'to', 'be', 'benign', 'while', 'training', 'the', 'anomaly', 'detection', 'model', 'in', 'this', 'paper', 'we', 'propose', 'ciota', 'a', 'lightweight', 'framework', 'that', 'utilizes', 'the', 'blockchain', 'concept', 'to', 'perform', 'distributed', 'and', 'collaborative', 'anomaly', 'detection', 'for', 'devices', 'with', 'limited', 'resources', 'ciota', 'uses', 'blockchain', 'to', 'incrementally', 'update', 'a', 'trusted', 'anomaly', 'detection', 'model', 'via', 'selfattestation', 'and', 'consensus', 'among', 'iot', 'devices', 'we', 'evaluate', 'ciota', 'on', 'our', 'own', 'distributed', 'iot', 'simulation', 'platform', 'which', 'consists', 'of', '48', 'raspberry', 'pis', 'to', 'demonstrate', 'ciotas', 'ability', 'to', 'enhance', 'the', 'security', 'of', 'each', 'device', 'and', 'the', 'security', 'of', 'the', 'network', 'as', 'a', 'whole']]
|
[-0.16937951363219195, 0.004402733541336416, -0.06149391888280354, 0.015941339403991193, -0.13734569949243802, -0.22347937184049332, 0.0690418637942534, 0.3801521708100406, -0.2515529501167721, -0.36070355303944596, 0.1387775972168556, -0.29397290454706154, -0.1788347339796194, 0.17733709257326077, -0.1522745629772544, 0.08644959673352809, 0.023719931840447777, 0.04989441406088376, 0.02610706550532711, -0.29698032592437285, 0.2570638855027192, 0.059907716369334924, 0.3537202997985913, 0.07271943391435387, 0.060463523391230276, -0.0334384345795948, -0.015157430833878827, -0.04567801770094939, -0.008459213909530711, 0.14264976331425538, 0.3613091432545559, 0.19884982162873338, 0.32529669829520835, -0.45229345544925836, -0.20170289488419532, 0.12669433558118495, 0.19148977027072694, 0.09187614694181605, -0.05246610673360459, -0.36991018320276703, 0.16574711264363567, -0.286173495256443, -0.06242793694479357, -0.12129995529259364, -0.015184911861398583, -0.0013809687351381563, -0.24833392213850494, -0.023872175061071, -0.0015440859932856388, 0.020093494100518614, -0.013236505892871127, -0.018040090776890158, 0.02532699861260782, 0.18043460564250238, 0.04486284131136532, -0.025075215982351767, 0.22736869005104862, -0.1333621221230101, -0.1580069083650316, 0.35110360074855657, 0.004103531030775328, -0.1427142960995966, 0.19422020378988236, 0.01575845774790519, -0.15783263171787362, 0.08857850113277693, 0.26539524816536253, 0.09391089341272207, -0.21153128455695977, -0.0011615358927379732, 0.025089107021824063, 0.1894237705203424, 0.004394577701116003, 0.05476979745540723, 0.22723887902817755, 0.2397071512045019, 0.09431392971267756, 0.08338999437204708, -0.09006044446176524, -0.06890783797253866, -0.2016803423694548, -0.16848857382996882, -0.181926114757823, 0.02642543681796236, -0.052084347259474875, -0.13883442471942764, 0.3714992893826082, 0.2717933899734214, 0.1730577531957954, 0.07102478768098651, 0.40021958006321484, 0.006489580441041884, 0.19352568807052337, 0.12420733948238194, 0.1925791524727941, 0.004632875445321292, 0.17953696746957007, -0.1363807699950945, 0.1521997510368588, -0.0347544824275334]
|
1,803.03808
|
Distinct collective states due to the trade-off between attractive and
repulsive couplings
|
We investigate the effect of repulsive coupling together with an attractive
coupling in a network of nonlocally coupled oscillators. To understand the
complex interaction between these two couplings we introduce a control
parameter in the repulsive coupling which plays a crucial role in inducing
distinct complex collective patterns. In particular, we show the emergence of
various cluster chimera death states through a dynamically distinct transition
route, namely the oscillatory cluster state and coherent oscillation death
state as a function of the repulsive coupling in the presence of the attractive
coupling. In the oscillatory cluster state, the oscillators in the network are
grouped into two distinct dynamical states of homogeneous and inhomogeneous
oscillatory states. Further, the network of coupled oscillators follows the
same transition route in the entire coupling range. Depending upon distinct
coupling ranges the system displays a different number of clusters in the death
state and oscillatory state. We also observe that the number of coherent
domains in the oscillatory cluster state exponentially decreases with increase
in coupling range and obeys a power law decay. Additionally, we show analytical
stability for observed solitary state, synchronized state, and incoherent
oscillation death state.
|
nlin.AO
|
we investigate the effect of repulsive coupling together with an attractive coupling in a network of nonlocally coupled oscillators to understand the complex interaction between these two couplings we introduce a control parameter in the repulsive coupling which plays a crucial role in inducing distinct complex collective patterns in particular we show the emergence of various cluster chimera death states through a dynamically distinct transition route namely the oscillatory cluster state and coherent oscillation death state as a function of the repulsive coupling in the presence of the attractive coupling in the oscillatory cluster state the oscillators in the network are grouped into two distinct dynamical states of homogeneous and inhomogeneous oscillatory states further the network of coupled oscillators follows the same transition route in the entire coupling range depending upon distinct coupling ranges the system displays a different number of clusters in the death state and oscillatory state we also observe that the number of coherent domains in the oscillatory cluster state exponentially decreases with increase in coupling range and obeys a power law decay additionally we show analytical stability for observed solitary state synchronized state and incoherent oscillation death state
|
[['we', 'investigate', 'the', 'effect', 'of', 'repulsive', 'coupling', 'together', 'with', 'an', 'attractive', 'coupling', 'in', 'a', 'network', 'of', 'nonlocally', 'coupled', 'oscillators', 'to', 'understand', 'the', 'complex', 'interaction', 'between', 'these', 'two', 'couplings', 'we', 'introduce', 'a', 'control', 'parameter', 'in', 'the', 'repulsive', 'coupling', 'which', 'plays', 'a', 'crucial', 'role', 'in', 'inducing', 'distinct', 'complex', 'collective', 'patterns', 'in', 'particular', 'we', 'show', 'the', 'emergence', 'of', 'various', 'cluster', 'chimera', 'death', 'states', 'through', 'a', 'dynamically', 'distinct', 'transition', 'route', 'namely', 'the', 'oscillatory', 'cluster', 'state', 'and', 'coherent', 'oscillation', 'death', 'state', 'as', 'a', 'function', 'of', 'the', 'repulsive', 'coupling', 'in', 'the', 'presence', 'of', 'the', 'attractive', 'coupling', 'in', 'the', 'oscillatory', 'cluster', 'state', 'the', 'oscillators', 'in', 'the', 'network', 'are', 'grouped', 'into', 'two', 'distinct', 'dynamical', 'states', 'of', 'homogeneous', 'and', 'inhomogeneous', 'oscillatory', 'states', 'further', 'the', 'network', 'of', 'coupled', 'oscillators', 'follows', 'the', 'same', 'transition', 'route', 'in', 'the', 'entire', 'coupling', 'range', 'depending', 'upon', 'distinct', 'coupling', 'ranges', 'the', 'system', 'displays', 'a', 'different', 'number', 'of', 'clusters', 'in', 'the', 'death', 'state', 'and', 'oscillatory', 'state', 'we', 'also', 'observe', 'that', 'the', 'number', 'of', 'coherent', 'domains', 'in', 'the', 'oscillatory', 'cluster', 'state', 'exponentially', 'decreases', 'with', 'increase', 'in', 'coupling', 'range', 'and', 'obeys', 'a', 'power', 'law', 'decay', 'additionally', 'we', 'show', 'analytical', 'stability', 'for', 'observed', 'solitary', 'state', 'synchronized', 'state', 'and', 'incoherent', 'oscillation', 'death', 'state']]
|
[-0.2399990971510609, 0.26036887187918484, -0.05618021636837511, 0.032105840548562505, -0.018100942449867336, -0.16055560833592608, 0.064883560253899, 0.33405532108736224, -0.2845358169094349, -0.25636312827797764, 0.02757857350843551, -0.26771529479932116, -0.16572440683133513, 0.13475896810632548, 0.0695483445742866, -0.016113067024586297, 0.0572603763260607, 0.05965928848430243, 0.008279944026677791, -0.15048583644117267, 0.36304200731926056, -0.040850522408921584, 0.3285959092027042, 0.004834910240030392, 0.08135327722023551, -0.017528744980760774, 0.07435385657784839, 0.005030567018669292, -0.1034114319835453, 0.03930590699443807, 0.21779323663243608, 0.03269928859663196, 0.27299210252628353, -0.4312993585287283, -0.2087346547608225, 0.11583809724349219, 0.20777946441285167, 0.14946643509089577, -0.030591690291354705, -0.3207838522212114, -0.04382609604120565, -0.19919907020327324, -0.1470569312647664, -0.07559002068592235, 0.0347361369834592, 0.05655786992671589, -0.26548438892526366, 0.14994764558756893, 0.03138624741207726, 0.008521621553275812, -0.11091931542008145, -0.04002921047200895, -0.04730234760972962, 0.16145103980428152, -0.0011348831346064496, -0.005427466123364866, 0.10831895371423646, -0.169889545379192, -0.0779041110822618, 0.29361103037566255, -0.09952726618621455, -0.13780054179369472, 0.23968839723966084, -0.12361474915815052, -0.10467079773419148, 0.11407761014076338, 0.18235906220858547, 0.047248353333581385, -0.09640236344421282, 0.021494805161334323, 0.03243158406682293, 0.184197134560236, 0.06291829844849417, 0.08877996872615768, 0.20117961474170443, 0.19972581574923728, 0.06907087395666167, 0.19723634952606517, -0.06479836816773361, -0.19132118695173025, -0.2744712985198324, -0.09388080097414786, -0.15107963875198038, 0.05193619624333223, -0.11309806992077635, -0.1838382776865425, 0.4575511468913949, 0.09659329839754112, 0.20661531969623562, -0.01294713461985945, 0.1932629608127172, 0.10356599641636421, 0.02666849547919507, 0.01853651929559419, 0.30213236235431395, 0.15634432057049708, 0.09087873009169319, -0.3303138611227041, 0.054737538175838076, -0.014438466288993368]
|
1,803.03809
|
Effect of population density on epidemics
|
Investigations of a possible connection between population density and the
propagation and magnitude of epidemics have so far led to mixed and
unconvincing results. There are three reasons for that. (i) Previous studies
did not focus on the appropriate density interval. (ii) For the density to be a
meaningful variable the population must be distributed as uniformly as
possible. If an area has towns and cities where a majority of the population is
concentrated its average density is meaningless. (iii) In the propagation of an
epidemic the initial proportion of susceptibles (that is to say persons who
have not developed an immunity) is an essential, yet usually unknown, factor.
The assumption that most of the population is susceptible holds only for new
strain of diseases.
It will be shown that when these requirements are taken care of, the size of
epidemics is indeed closely connected with the population density. This
empirical observation comes as a welcome confirmation of the classical KMK
(Kermack-McKendrick 1927) model. Indeed, one of its key predictions is that the
size of the epidemic increases strongly (and in a non linear way) with the
initial density of susceptibles.
An interesting consequence is that, contrary to common beliefs, in sparsely
populated territories, like Alaska, Australia or the west coast of the United
states the size of epidemics among native populations must have been limited by
the low density even for diseases for which the natives had no immunity (i.e.,
were susceptibles).
|
physics.soc-ph physics.bio-ph q-bio.PE
|
investigations of a possible connection between population density and the propagation and magnitude of epidemics have so far led to mixed and unconvincing results there are three reasons for that i previous studies did not focus on the appropriate density interval ii for the density to be a meaningful variable the population must be distributed as uniformly as possible if an area has towns and cities where a majority of the population is concentrated its average density is meaningless iii in the propagation of an epidemic the initial proportion of susceptibles that is to say persons who have not developed an immunity is an essential yet usually unknown factor the assumption that most of the population is susceptible holds only for new strain of diseases it will be shown that when these requirements are taken care of the size of epidemics is indeed closely connected with the population density this empirical observation comes as a welcome confirmation of the classical kmk kermackmckendrick 1927 model indeed one of its key predictions is that the size of the epidemic increases strongly and in a non linear way with the initial density of susceptibles an interesting consequence is that contrary to common beliefs in sparsely populated territories like alaska australia or the west coast of the united states the size of epidemics among native populations must have been limited by the low density even for diseases for which the natives had no immunity ie were susceptibles
|
[['investigations', 'of', 'a', 'possible', 'connection', 'between', 'population', 'density', 'and', 'the', 'propagation', 'and', 'magnitude', 'of', 'epidemics', 'have', 'so', 'far', 'led', 'to', 'mixed', 'and', 'unconvincing', 'results', 'there', 'are', 'three', 'reasons', 'for', 'that', 'i', 'previous', 'studies', 'did', 'not', 'focus', 'on', 'the', 'appropriate', 'density', 'interval', 'ii', 'for', 'the', 'density', 'to', 'be', 'a', 'meaningful', 'variable', 'the', 'population', 'must', 'be', 'distributed', 'as', 'uniformly', 'as', 'possible', 'if', 'an', 'area', 'has', 'towns', 'and', 'cities', 'where', 'a', 'majority', 'of', 'the', 'population', 'is', 'concentrated', 'its', 'average', 'density', 'is', 'meaningless', 'iii', 'in', 'the', 'propagation', 'of', 'an', 'epidemic', 'the', 'initial', 'proportion', 'of', 'susceptibles', 'that', 'is', 'to', 'say', 'persons', 'who', 'have', 'not', 'developed', 'an', 'immunity', 'is', 'an', 'essential', 'yet', 'usually', 'unknown', 'factor', 'the', 'assumption', 'that', 'most', 'of', 'the', 'population', 'is', 'susceptible', 'holds', 'only', 'for', 'new', 'strain', 'of', 'diseases', 'it', 'will', 'be', 'shown', 'that', 'when', 'these', 'requirements', 'are', 'taken', 'care', 'of', 'the', 'size', 'of', 'epidemics', 'is', 'indeed', 'closely', 'connected', 'with', 'the', 'population', 'density', 'this', 'empirical', 'observation', 'comes', 'as', 'a', 'welcome', 'confirmation', 'of', 'the', 'classical', 'kmk', 'kermackmckendrick', '1927', 'model', 'indeed', 'one', 'of', 'its', 'key', 'predictions', 'is', 'that', 'the', 'size', 'of', 'the', 'epidemic', 'increases', 'strongly', 'and', 'in', 'a', 'non', 'linear', 'way', 'with', 'the', 'initial', 'density', 'of', 'susceptibles', 'an', 'interesting', 'consequence', 'is', 'that', 'contrary', 'to', 'common', 'beliefs', 'in', 'sparsely', 'populated', 'territories', 'like', 'alaska', 'australia', 'or', 'the', 'west', 'coast', 'of', 'the', 'united', 'states', 'the', 'size', 'of', 'epidemics', 'among', 'native', 'populations', 'must', 'have', 'been', 'limited', 'by', 'the', 'low', 'density', 'even', 'for', 'diseases', 'for', 'which', 'the', 'natives', 'had', 'no', 'immunity', 'ie', 'were', 'susceptibles']]
|
[-0.09636242083061118, 0.14926169760729552, -0.09315026567623914, 0.08044514918284024, -0.05610144059097111, -0.13145556307106504, 0.05560580985199032, 0.36197239019881183, -0.19517980456120362, -0.28469470079421494, 0.14396369709957146, -0.29587050229924206, -0.1448718105939144, 0.15851791049358568, -0.09719243797199578, -0.01900120186255363, 0.05351118260367923, 0.07072482709945352, 0.039936049821163305, -0.28176195007737403, 0.3101084167003601, 0.06862650032144677, 0.2769986753919212, 0.029621614733473262, 0.057889638317235335, -0.01716558416776451, -0.01799681956722658, 0.04049283857677714, -0.08845109235079252, 0.09348317190496994, 0.2794221812330278, 0.16744908184692678, 0.35138285407459235, -0.43420336543919646, -0.2288074871116038, 0.1372853088817356, 0.1446329718034086, 0.12140721246483256, -0.01637727651915632, -0.26173938365381044, 0.06649735086279396, -0.16481949462758477, -0.17716558114721329, 0.01545144321105669, 0.08291632659185233, 0.03646642716212003, -0.23404603723605227, 0.0943260823181014, 0.027897734920314127, 0.060208315351679004, -0.026882941083438357, -0.14866379149442102, -0.07286535029380341, 0.1699299107890417, 0.07984704404078623, 0.011332219032165422, 0.11544531471682368, -0.14476270315816067, -0.07260325819698503, 0.33975938736142997, 0.0009329008156962601, -0.13761426197219287, 0.2012440008791585, -0.15196025063146726, -0.13076097401359152, 0.12604522257046813, 0.14942071830960174, 0.07119517484621131, -0.16041298470788765, 0.030412442269212848, -0.06720237650596173, 0.18416458544217879, 0.04525984789976858, 0.01150009677498199, 0.1964762693600645, 0.17424466600929053, 0.09117655349807208, 0.0438407912171051, -0.09989734175385057, -0.10035983635756521, -0.24124996577784297, -0.126343729997048, -0.1698370280947705, 0.06694771288743208, -0.06748443694253224, -0.1735138265609333, 0.35774418790422285, 0.14078386684897864, 0.16581945632988732, 0.049152988066643845, 0.24217335511489538, 0.09082210423480412, 0.08094320020498516, 0.10167327511350437, 0.23083270890082505, 0.09372371384598997, 0.052759406057190254, -0.17609321170605322, 0.18924964420543408, -0.06061143292077729]
|
1,803.0381
|
Minimal sets and orbit space for group actions on local dendrites
|
We consider a group $G$ acting on a local dendrite $X$ (in particular on a
graph). We give a full characterization of minimal sets of $G$ by showing that
any minimal set $M$ of $G$ (whenever $X$ is different from a dendrite) is
either a finite orbit, or a Cantor set, or a circle. If $X$ is a graph
different from a circle, such a minimal $M$ is a finite orbit. These results
extend those of the authors for group actions on dendrites. On the other hand,
we show that, for any group $G$ acting on a local dendrite $X$ different from a
circle, the following properties are equivalent: (1) ($G, X$) is pointwise
almost periodic. (2) The orbit closure relation $R = \{(x, y)\in X\times X:
y\in \overline{G(x)}\}$ is closed. (3) Every non-endpoint of $X$ is periodic.
In addition, if $G$ is countable and $X$ is a local dendrite, then ($G, X$) is
pointwise periodic if and only if the orbit space $X/G$ is Hausdorff.
|
math.DS
|
we consider a group g acting on a local dendrite x in particular on a graph we give a full characterization of minimal sets of g by showing that any minimal set m of g whenever x is different from a dendrite is either a finite orbit or a cantor set or a circle if x is a graph different from a circle such a minimal m is a finite orbit these results extend those of the authors for group actions on dendrites on the other hand we show that for any group g acting on a local dendrite x different from a circle the following properties are equivalent 1 g x is pointwise almost periodic 2 the orbit closure relation r x yin xtimes x yin overlinegx is closed 3 every nonendpoint of x is periodic in addition if g is countable and x is a local dendrite then g x is pointwise periodic if and only if the orbit space xg is hausdorff
|
[['we', 'consider', 'a', 'group', 'g', 'acting', 'on', 'a', 'local', 'dendrite', 'x', 'in', 'particular', 'on', 'a', 'graph', 'we', 'give', 'a', 'full', 'characterization', 'of', 'minimal', 'sets', 'of', 'g', 'by', 'showing', 'that', 'any', 'minimal', 'set', 'm', 'of', 'g', 'whenever', 'x', 'is', 'different', 'from', 'a', 'dendrite', 'is', 'either', 'a', 'finite', 'orbit', 'or', 'a', 'cantor', 'set', 'or', 'a', 'circle', 'if', 'x', 'is', 'a', 'graph', 'different', 'from', 'a', 'circle', 'such', 'a', 'minimal', 'm', 'is', 'a', 'finite', 'orbit', 'these', 'results', 'extend', 'those', 'of', 'the', 'authors', 'for', 'group', 'actions', 'on', 'dendrites', 'on', 'the', 'other', 'hand', 'we', 'show', 'that', 'for', 'any', 'group', 'g', 'acting', 'on', 'a', 'local', 'dendrite', 'x', 'different', 'from', 'a', 'circle', 'the', 'following', 'properties', 'are', 'equivalent', '1', 'g', 'x', 'is', 'pointwise', 'almost', 'periodic', '2', 'the', 'orbit', 'closure', 'relation', 'r', 'x', 'yin', 'xtimes', 'x', 'yin', 'overlinegx', 'is', 'closed', '3', 'every', 'nonendpoint', 'of', 'x', 'is', 'periodic', 'in', 'addition', 'if', 'g', 'is', 'countable', 'and', 'x', 'is', 'a', 'local', 'dendrite', 'then', 'g', 'x', 'is', 'pointwise', 'periodic', 'if', 'and', 'only', 'if', 'the', 'orbit', 'space', 'xg', 'is', 'hausdorff']]
|
[-0.2238296231016426, 0.1265605141198626, -0.10047770428425837, 0.005105430356130322, -0.09064657180342914, -0.1396438604555797, 0.08695456909907345, 0.4185233500462434, -0.28331962100048436, -0.15276908299249664, 0.11967194694372621, -0.31833248279375453, -0.12458158042083108, 0.20234899338165854, -0.12117563266159467, -0.0300906127483425, 0.07712192392181151, 0.17896259894662694, -0.1096806351873433, -0.25306564504486545, 0.3392909846563892, -0.1439242745954089, 0.16697120012874464, -0.0007239971082748436, 0.16411396730180103, -7.438278904684434e-05, 0.026326033437238414, 0.06357395196622437, -0.15779245102811085, 0.07186728351459862, 0.19066229016270217, 0.07757570685409917, 0.2633115426500941, -0.3418807973678823, -0.2195615378895593, 0.19912114308965279, 0.05389531525192646, -0.05384352820266674, -0.011392441804651397, -0.2519883586167608, 0.18683216834821306, -0.12498482826404364, -0.10148260363082333, 0.008480559926616347, 0.18220360509528802, 0.03713817922142902, -0.31176941675310044, -0.04073069665989861, 0.13355079814564527, 0.08531588569521995, 0.004518929023505756, -0.06733654908517875, -0.13938733341921938, 0.1132694354405763, -0.050942504087820785, 0.15657135130689911, 0.1250259562664546, 0.0020886871157350336, -0.061139893398631545, 0.3898696662721837, -0.10539175082770426, -0.2338516315964914, 0.1764441212957225, -0.22199660610895966, -0.14333224654333984, 0.13062615713343115, 0.08874091784975197, 0.17016420992681894, -0.07448291104633316, 0.2601051734520474, -0.16848571743906998, 0.15613425677505935, 0.05331531711342949, -0.04296870991905651, 0.15679437295170273, 0.1494165352863691, 0.1975292339324724, 0.06810192789537435, -0.0037158700288273394, 0.1085978510516991, -0.37193323929635125, -0.14313892334722345, -0.17433985427203702, 0.16533014316270808, -0.10578975932109709, -0.17007360742824926, 0.3541674173987902, 0.029518364497074265, 0.21183509882198784, 0.062140134015552156, 0.2040629406806036, 0.044349678790817186, -0.01243325806415935, 0.10848417060688229, 0.06527742665266709, 0.14622676419378144, -0.10716709396631525, -0.13127116871878458, 0.009556244303495056, 0.1926071329451189]
|
1,803.03811
|
Band-offset-induced lateral shift of valley electrons in ferromagnetic
MoS$_2$/WS$_2$ planar heterojunctions
|
Low-energy coherent transport and Goos-H\"{a}nchen (GH) lateral shift of
valley electrons in planar heterojunctions composed of normal MoS$_2$ and
ferromagnetic WS$_2$ monolayers are theoretically investigated. Two types of
heterojunctions in the forms of WS$_2$/MoS$_2$/WS$_2$ (type-A) and
MoS$_2$/WS$_2$/MoS$_2$ (type-B) with incident electrons in MoS$_2$ region are
considered in which the lateral shift of electrons is induced by band
alignments of the two constituent semiconductors. It is shown that the type-A
heterojunction can act as an electron waveguide due to electron confinement
between the two WS$_2$/MoS$_2$ interfaces which cause the incident electrons
with an appropriate incidence angle to propagate along the interfaces. In this
case the spin- and valley-dependent GH shifts of totally reflected electrons
from the interface lead to separated electrons with distinct spin-valley
indexes after traveling a sufficiently long distance. In type-B heterojunction,
however, transmission resonances occur for incident electron beams passing
through the structure, and large spin- and valley-dependent lateral shift
values in propagating states can be achieved. Consequently, the transmitted
electrons are spatially well-separated into electrons with distinct spin-valley
indexes. Our findings reveal that the planar heterojunctions of transition
metal dichalcogenides can be utilized as spin-valley beam filter and/or
splitter without external gating.
|
cond-mat.mes-hall
|
lowenergy coherent transport and gooshanchen gh lateral shift of valley electrons in planar heterojunctions composed of normal mos_2 and ferromagnetic ws_2 monolayers are theoretically investigated two types of heterojunctions in the forms of ws_2mos_2ws_2 typea and mos_2ws_2mos_2 typeb with incident electrons in mos_2 region are considered in which the lateral shift of electrons is induced by band alignments of the two constituent semiconductors it is shown that the typea heterojunction can act as an electron waveguide due to electron confinement between the two ws_2mos_2 interfaces which cause the incident electrons with an appropriate incidence angle to propagate along the interfaces in this case the spin and valleydependent gh shifts of totally reflected electrons from the interface lead to separated electrons with distinct spinvalley indexes after traveling a sufficiently long distance in typeb heterojunction however transmission resonances occur for incident electron beams passing through the structure and large spin and valleydependent lateral shift values in propagating states can be achieved consequently the transmitted electrons are spatially wellseparated into electrons with distinct spinvalley indexes our findings reveal that the planar heterojunctions of transition metal dichalcogenides can be utilized as spinvalley beam filter andor splitter without external gating
|
[['lowenergy', 'coherent', 'transport', 'and', 'gooshanchen', 'gh', 'lateral', 'shift', 'of', 'valley', 'electrons', 'in', 'planar', 'heterojunctions', 'composed', 'of', 'normal', 'mos_2', 'and', 'ferromagnetic', 'ws_2', 'monolayers', 'are', 'theoretically', 'investigated', 'two', 'types', 'of', 'heterojunctions', 'in', 'the', 'forms', 'of', 'ws_2mos_2ws_2', 'typea', 'and', 'mos_2ws_2mos_2', 'typeb', 'with', 'incident', 'electrons', 'in', 'mos_2', 'region', 'are', 'considered', 'in', 'which', 'the', 'lateral', 'shift', 'of', 'electrons', 'is', 'induced', 'by', 'band', 'alignments', 'of', 'the', 'two', 'constituent', 'semiconductors', 'it', 'is', 'shown', 'that', 'the', 'typea', 'heterojunction', 'can', 'act', 'as', 'an', 'electron', 'waveguide', 'due', 'to', 'electron', 'confinement', 'between', 'the', 'two', 'ws_2mos_2', 'interfaces', 'which', 'cause', 'the', 'incident', 'electrons', 'with', 'an', 'appropriate', 'incidence', 'angle', 'to', 'propagate', 'along', 'the', 'interfaces', 'in', 'this', 'case', 'the', 'spin', 'and', 'valleydependent', 'gh', 'shifts', 'of', 'totally', 'reflected', 'electrons', 'from', 'the', 'interface', 'lead', 'to', 'separated', 'electrons', 'with', 'distinct', 'spinvalley', 'indexes', 'after', 'traveling', 'a', 'sufficiently', 'long', 'distance', 'in', 'typeb', 'heterojunction', 'however', 'transmission', 'resonances', 'occur', 'for', 'incident', 'electron', 'beams', 'passing', 'through', 'the', 'structure', 'and', 'large', 'spin', 'and', 'valleydependent', 'lateral', 'shift', 'values', 'in', 'propagating', 'states', 'can', 'be', 'achieved', 'consequently', 'the', 'transmitted', 'electrons', 'are', 'spatially', 'wellseparated', 'into', 'electrons', 'with', 'distinct', 'spinvalley', 'indexes', 'our', 'findings', 'reveal', 'that', 'the', 'planar', 'heterojunctions', 'of', 'transition', 'metal', 'dichalcogenides', 'can', 'be', 'utilized', 'as', 'spinvalley', 'beam', 'filter', 'andor', 'splitter', 'without', 'external', 'gating']]
|
[-0.1894817531810986, 0.282614484144536, -0.005571959208585516, 0.02394879482350613, -0.02363885098990674, -0.21430562164217312, 0.03837189398473129, 0.5117390332355475, -0.28956329826420796, -0.29612657918672386, -0.07891821516083534, -0.3118871595240004, -0.12912144297054814, 0.18939802606473677, 0.04849722256631139, -0.033461358204704084, -0.00043539101898204535, -0.13456502199187526, -0.06002283094130689, -0.11171644788142505, 0.26618982563256094, 0.0006775924315055212, 0.3289957726180243, 0.10485327964852331, 0.049893205184389444, 0.04651477936810503, 0.11124086112855973, 0.0035253222231403925, -0.07414475364483526, 0.05642956407943226, 0.2652703458867715, -0.14534865054603566, 0.16206343446174287, -0.49483354869880714, -0.20946762982445458, -0.002788670073641697, 0.17981309282201133, 0.13109303548723497, -0.09708067095076937, -0.2902544431581191, 0.0073267621816436685, -0.11702933945465095, -0.11538578164133166, 0.032107390919312216, -0.02360573444457259, 0.025905907037364766, -0.2331159548045131, 0.08109849841336352, 0.06023039097817673, 0.00845409215738376, -0.046438543848732174, -0.10326160651554044, -0.14676982918414674, 0.09365369815956608, 0.06090209506752823, -0.0016781222058549854, 0.16774959292570202, -0.07976104424718262, -0.15443706139922142, 0.37131218154293794, -0.044067489177299045, -0.1663923677163742, 0.1576382093359522, -0.2216588380263905, 0.04587787856022866, 0.19092551279754844, 0.14811666677026855, 0.09217691090210185, -0.11871741525616623, 0.039850337744307275, -0.004804512665335399, 0.1251177824609234, 0.17591517448211866, 0.12288129066291731, 0.29850691303727217, 0.1166017627256224, 0.0669224097176387, 0.11693763061460534, -0.13840375875345975, 0.01388293644231453, -0.21012531026038536, -0.1707704695497038, -0.21160352590474454, 0.06937504398229066, -0.05684390808240399, -0.20135276274519734, 0.45398200929291005, 0.07575415426739103, 0.1518268219612461, -0.1010996590666764, 0.2569707108086732, 0.13893697154890106, 0.09166264079249231, 0.037023112368236376, 0.2724701236450831, 0.19011285923988908, 0.05991340899527131, -0.24833270329448473, 0.04295145135256462, -0.021961205997892346]
|
1,803.03812
|
Exoplanet Diversity in the Era of Space-based Direct Imaging Missions
|
This whitepaper discusses the diversity of exoplanets that could be detected
by future observations, so that comparative exoplanetology can be performed in
the upcoming era of large space-based flagship missions. The primary focus will
be on characterizing Earth-like worlds around Sun-like stars. However, we will
also be able to characterize companion planets in the system simultaneously.
This will not only provide a contextual picture with regards to our Solar
system, but also presents a unique opportunity to observe size dependent
planetary atmospheres at different orbital distances. We propose a preliminary
scheme based on chemical behavior of gases and condensates in a planet's
atmosphere that classifies them with respect to planetary radius and incident
stellar flux.
|
astro-ph.EP
|
this whitepaper discusses the diversity of exoplanets that could be detected by future observations so that comparative exoplanetology can be performed in the upcoming era of large spacebased flagship missions the primary focus will be on characterizing earthlike worlds around sunlike stars however we will also be able to characterize companion planets in the system simultaneously this will not only provide a contextual picture with regards to our solar system but also presents a unique opportunity to observe size dependent planetary atmospheres at different orbital distances we propose a preliminary scheme based on chemical behavior of gases and condensates in a planets atmosphere that classifies them with respect to planetary radius and incident stellar flux
|
[['this', 'whitepaper', 'discusses', 'the', 'diversity', 'of', 'exoplanets', 'that', 'could', 'be', 'detected', 'by', 'future', 'observations', 'so', 'that', 'comparative', 'exoplanetology', 'can', 'be', 'performed', 'in', 'the', 'upcoming', 'era', 'of', 'large', 'spacebased', 'flagship', 'missions', 'the', 'primary', 'focus', 'will', 'be', 'on', 'characterizing', 'earthlike', 'worlds', 'around', 'sunlike', 'stars', 'however', 'we', 'will', 'also', 'be', 'able', 'to', 'characterize', 'companion', 'planets', 'in', 'the', 'system', 'simultaneously', 'this', 'will', 'not', 'only', 'provide', 'a', 'contextual', 'picture', 'with', 'regards', 'to', 'our', 'solar', 'system', 'but', 'also', 'presents', 'a', 'unique', 'opportunity', 'to', 'observe', 'size', 'dependent', 'planetary', 'atmospheres', 'at', 'different', 'orbital', 'distances', 'we', 'propose', 'a', 'preliminary', 'scheme', 'based', 'on', 'chemical', 'behavior', 'of', 'gases', 'and', 'condensates', 'in', 'a', 'planets', 'atmosphere', 'that', 'classifies', 'them', 'with', 'respect', 'to', 'planetary', 'radius', 'and', 'incident', 'stellar', 'flux']]
|
[-0.11592042406251574, 0.16956735282488491, -0.09408770849442352, 0.06547462595778558, -0.13770495583910658, -0.08645507891702911, 0.0652398085606325, 0.3787837438285351, -0.18832159468742168, -0.3375115997669206, 0.07580186276463792, -0.27803073515710625, -0.12083323144394419, 0.22164471899766636, -0.11330168269493658, 0.028752085093773253, 0.1699778800405076, -0.04229616409182832, -0.028110975057453566, -0.2753452363970649, 0.30089122455810074, 0.1193199374348573, 0.09728913654613754, 0.031730496303340336, 0.017913738403307355, -0.0910748681579919, -0.04398336003979911, -0.011778863940549934, -0.17327442422133374, 0.07669326638316978, 0.29989379676180367, 0.18777302642069432, 0.22163375350444214, -0.4021347778687335, -0.23237629947455032, 0.08081457450095078, 0.17699374337073254, 0.04205275740798401, -0.03662663494722675, -0.28248421460106643, 0.07269756488410918, -0.18893838440594465, -0.1938943135066201, -0.06503446584000536, 0.04476855063567991, 0.03380094792633115, -0.2539483149535954, -0.02345178187166786, 0.022776600250179635, 0.1101077818757166, -0.11593202464484974, -0.12997461978305616, -0.011184507776456682, 0.12312028620584423, -0.0024785650570107545, 0.01839594237668359, 0.13291677088760165, -0.06774242432160384, -0.03934103235926317, 0.41696206685965476, -0.12232746925285977, -0.08859856625431743, 0.23912616686328597, -0.2438027699518463, -0.14588271739447248, 0.0928247458503946, 0.2276417061848485, 0.12551251342115194, -0.2084239530498567, -0.008733078976080793, -0.006667204473532088, 0.2117020322414844, 0.0416911789621024, 0.08240936094409097, 0.42046716409208984, 0.20878672628542003, 0.09811394046992064, 0.08012039267619991, -0.17888275687203176, -0.023690524681106856, -0.19212439915813181, -0.15819332049349727, -0.14582562788956516, 0.03622158390037088, -0.021835058813904535, -0.1033282629902596, 0.3660947329234066, 0.23194452986607086, 0.14823129498602255, -0.0036075870850649865, 0.32130404655700145, 0.031144292281090242, 0.08173730626256893, 0.05647524320722922, 0.33582526503393995, 0.05833120127208531, 0.15150514242603727, -0.22270968644272374, 0.08912559417076409, -0.020927662944988063]
|
1,803.03813
|
Optimal partitions for Robin Laplacian eigenvalues
|
We prove the existence of an optimal partition for the multiphase shape
optimization problem which consists in minimizing the sum of the first Robin
Laplacian eigenvalue of $k$ mutually disjoint {\it open} sets which have a
$\mathcal H ^ {d-1}$-countably rectifiable boundary and are contained into a
given box $D$ in $R^d$
|
math.AP
|
we prove the existence of an optimal partition for the multiphase shape optimization problem which consists in minimizing the sum of the first robin laplacian eigenvalue of k mutually disjoint it open sets which have a mathcal h d1countably rectifiable boundary and are contained into a given box d in rd
|
[['we', 'prove', 'the', 'existence', 'of', 'an', 'optimal', 'partition', 'for', 'the', 'multiphase', 'shape', 'optimization', 'problem', 'which', 'consists', 'in', 'minimizing', 'the', 'sum', 'of', 'the', 'first', 'robin', 'laplacian', 'eigenvalue', 'of', 'k', 'mutually', 'disjoint', 'it', 'open', 'sets', 'which', 'have', 'a', 'mathcal', 'h', 'd1countably', 'rectifiable', 'boundary', 'and', 'are', 'contained', 'into', 'a', 'given', 'box', 'd', 'in', 'rd']]
|
[-0.18744528654962778, 0.06122209927329095, -0.038021067418158055, -0.01725472114980221, -0.03829638497903943, -0.12687794610857964, -0.015725402720272542, 0.31336729664355517, -0.29754413962364196, -0.20360742437653243, 0.11915366419125348, -0.3295410512760282, -0.06678337212651968, 0.10862824714742601, -0.07013757765293122, 0.11215453254058957, 0.09626699747517704, 0.05735349360853434, 0.0037863067165017127, -0.2578651474812068, 0.35062974914908407, -0.1302363301254809, 0.2022783694975078, 0.07762243690900504, 0.07490308329463005, 0.015586681426502763, -0.007388098146766425, 0.05961247355677188, -0.19613693852443248, 0.1471686242031865, 0.26133258603513243, 0.16174076124560088, 0.3164643406122923, -0.3918166313134134, -0.17179873598739503, 0.20734000535681843, 0.17225773432292044, -0.06859096531290561, 0.015622730585746467, -0.23608291664160788, 0.10775132975541055, -0.02502544466406107, -0.10224638099782168, 0.02337225233204663, 0.08198119666893035, -0.031486297994852065, -0.3404203908890486, 0.039147218684665856, 0.09536657642573118, 0.0076235082279890775, -0.10941770295146852, -0.17080258224159478, -0.03396950524300337, 0.08948881333693862, -0.046668050587177275, 0.08777582395821809, 0.03405089403851889, -0.04434636091813445, -0.09136486650444567, 0.34686752006411553, -0.0012307236320339143, -0.2749017995223403, 0.0904313456825912, -0.13728097114042612, -0.13548609687946736, 0.1276065880479291, 0.1662558360956609, 0.15980058882385492, -0.15446764251217246, 0.17205103294807486, -0.1603407056699507, 0.06756745311198756, 0.11748783198185266, -0.009082064274698496, 0.16189870346803217, 0.14419852992519736, 0.20567273392807692, 0.22832809560000897, 0.0019216864323243499, -0.07066980861127377, -0.4018013143539429, -0.13313074499368668, -0.20872251875698566, 0.09491190424188972, -0.12630175918311579, -0.2599980178102851, 0.3607646765233949, 0.03242458358407021, 0.2416435373853892, 0.05709792191628367, 0.23945080257952214, 0.10508596450090409, 0.019238937832415103, 0.16564459143206478, 0.12239554932806641, 0.12562018003314734, -0.02359353743493557, -0.23086487794294952, -0.004051164728589356, 0.1743580161780119]
|
1,803.03814
|
Detecting higher spin fields through statistical anisotropy in the CMB
bispectrum
|
Inflation may provide a suitable collider to probe physics at very high
energies. In this paper we investigate the impact on the CMB bispectrum of
higher spin fields which are long-lived on super-Hubble scales, e.g. partially
massless higher spin fields. We show that distinctive statistical anisotropic
signals on the CMB three-point correlator are induced and we investigate their
detectability.
|
astro-ph.CO gr-qc hep-ph hep-th
|
inflation may provide a suitable collider to probe physics at very high energies in this paper we investigate the impact on the cmb bispectrum of higher spin fields which are longlived on superhubble scales eg partially massless higher spin fields we show that distinctive statistical anisotropic signals on the cmb threepoint correlator are induced and we investigate their detectability
|
[['inflation', 'may', 'provide', 'a', 'suitable', 'collider', 'to', 'probe', 'physics', 'at', 'very', 'high', 'energies', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'impact', 'on', 'the', 'cmb', 'bispectrum', 'of', 'higher', 'spin', 'fields', 'which', 'are', 'longlived', 'on', 'superhubble', 'scales', 'eg', 'partially', 'massless', 'higher', 'spin', 'fields', 'we', 'show', 'that', 'distinctive', 'statistical', 'anisotropic', 'signals', 'on', 'the', 'cmb', 'threepoint', 'correlator', 'are', 'induced', 'and', 'we', 'investigate', 'their', 'detectability']]
|
[-0.17677037307392743, 0.25460954188858553, -0.0861263608923024, 0.1867945645916102, -0.09083916786742413, -0.07827269611090927, -0.10359153474120707, 0.36724203218848017, -0.22305634020338372, -0.27329783776175165, 0.07544770750603876, -0.2866993625411543, -0.08728528493162939, 0.19626996050573, 0.08492325039548894, -0.005817418337910105, 0.017139772032150776, -0.019550063729708446, -0.06515363001233061, -0.23220519001706172, 0.3150111854834072, 0.15085471402538025, 0.28483830673335975, 0.08994678127721457, 0.08837429529166449, -0.036170349551080644, -0.03589676898288525, 0.005821864104877084, -0.138484665007805, 0.0703250238379874, 0.2020471089330139, 0.08241411392040299, 0.15480687646037442, -0.4474459973684812, -0.20166254622893312, 0.1585868430339684, 0.10336917470346434, 0.19295381605269987, -0.04326265396637116, -0.28666626033767806, 0.07806486461185298, -0.14667448170988237, -0.08050588014835523, -0.15265815740577499, -0.05982756331342004, -0.05085041905926951, -0.24402943470562666, 0.13769437925163971, -0.0012069222225286698, 0.038302390962460284, 0.0009585542572756945, -0.12074433325521522, -0.02563186129555106, 0.014216285455435261, 0.06951425366608774, -0.00826880243070171, 0.1693015438030963, -0.18561292571899624, -0.11115340739725378, 0.35939330424545174, -0.14187102168167043, -0.12700801317469548, 0.2061523962292378, -0.2782639104841372, -0.2136298874077403, 0.04479694641116312, 0.27479845567969446, 0.10404040864510936, -0.11112661077246322, 0.11425727934051716, 0.07528191046410446, 0.14233165221699215, 0.1144741840534291, 0.13092474460254533, 0.3762784484868585, 0.11145253226918689, 0.0936325626226805, 0.1344664579857204, -0.11426303130022045, 0.012518291535266375, -0.31232413936355075, -0.04547356409849441, -0.17236223499590564, 0.08536883352040234, -0.10466211733494103, -0.1587919458368067, 0.46008035976250294, 0.2082303621731225, 0.19897053646460428, 0.04455384735404751, 0.29521257278777785, 0.0833301900617652, 0.018543999857699372, 0.02434685450689512, 0.3276939853173444, 0.1253725897710202, 0.09860125704179123, -0.24400742630616334, -0.035240404663007645, -0.01859652044219991]
|
1,803.03815
|
Topological Nonlinear Optics with Spin-Orbit coupled Bose-Einstein
Condensate in Cavity
|
We report topological nonlinear optics with spin-orbit coupled Bose-Einstein
condensate in a cavity. The cavity is driven by a pump laser and weak probe
laser which excite Bose-Einstein condensate to an intermediate storage level,
where the standard Raman process engineers spin-orbit coupling. We show that
the nonlinear photonic interactions at the transitional pathways of dressed
states result in new type of optical transparencies, which get completely
inverted with atom induced gain. These nonlinear interactions also implant
topological sort of features in probe transmission modes by inducing gapless
Dirac-like cones, which become gaped in presence of Raman detuning. The
topological features get interestingly enhanced in gain regime where the
gapless topological edge-like states emerge among the probe modes, which can
cause non-trivial phase transition. We show that spin-orbit coupling and Zeeman
field effects also impressively revamp fast and slow probe light. The
manipulation of dressed states for quantum nonlinear optics with topological
characteristics in our findings could be a crucial step towards topological
quantum computation.
|
physics.optics cond-mat.quant-gas physics.atom-ph quant-ph
|
we report topological nonlinear optics with spinorbit coupled boseeinstein condensate in a cavity the cavity is driven by a pump laser and weak probe laser which excite boseeinstein condensate to an intermediate storage level where the standard raman process engineers spinorbit coupling we show that the nonlinear photonic interactions at the transitional pathways of dressed states result in new type of optical transparencies which get completely inverted with atom induced gain these nonlinear interactions also implant topological sort of features in probe transmission modes by inducing gapless diraclike cones which become gaped in presence of raman detuning the topological features get interestingly enhanced in gain regime where the gapless topological edgelike states emerge among the probe modes which can cause nontrivial phase transition we show that spinorbit coupling and zeeman field effects also impressively revamp fast and slow probe light the manipulation of dressed states for quantum nonlinear optics with topological characteristics in our findings could be a crucial step towards topological quantum computation
|
[['we', 'report', 'topological', 'nonlinear', 'optics', 'with', 'spinorbit', 'coupled', 'boseeinstein', 'condensate', 'in', 'a', 'cavity', 'the', 'cavity', 'is', 'driven', 'by', 'a', 'pump', 'laser', 'and', 'weak', 'probe', 'laser', 'which', 'excite', 'boseeinstein', 'condensate', 'to', 'an', 'intermediate', 'storage', 'level', 'where', 'the', 'standard', 'raman', 'process', 'engineers', 'spinorbit', 'coupling', 'we', 'show', 'that', 'the', 'nonlinear', 'photonic', 'interactions', 'at', 'the', 'transitional', 'pathways', 'of', 'dressed', 'states', 'result', 'in', 'new', 'type', 'of', 'optical', 'transparencies', 'which', 'get', 'completely', 'inverted', 'with', 'atom', 'induced', 'gain', 'these', 'nonlinear', 'interactions', 'also', 'implant', 'topological', 'sort', 'of', 'features', 'in', 'probe', 'transmission', 'modes', 'by', 'inducing', 'gapless', 'diraclike', 'cones', 'which', 'become', 'gaped', 'in', 'presence', 'of', 'raman', 'detuning', 'the', 'topological', 'features', 'get', 'interestingly', 'enhanced', 'in', 'gain', 'regime', 'where', 'the', 'gapless', 'topological', 'edgelike', 'states', 'emerge', 'among', 'the', 'probe', 'modes', 'which', 'can', 'cause', 'nontrivial', 'phase', 'transition', 'we', 'show', 'that', 'spinorbit', 'coupling', 'and', 'zeeman', 'field', 'effects', 'also', 'impressively', 'revamp', 'fast', 'and', 'slow', 'probe', 'light', 'the', 'manipulation', 'of', 'dressed', 'states', 'for', 'quantum', 'nonlinear', 'optics', 'with', 'topological', 'characteristics', 'in', 'our', 'findings', 'could', 'be', 'a', 'crucial', 'step', 'towards', 'topological', 'quantum', 'computation']]
|
[-0.1856896838999535, 0.28033600820353743, -0.07304470785311423, 0.009768803288474506, -0.05573385126502594, -0.2484374489470544, 0.05545034210010227, 0.37314899361737797, -0.28758553928900055, -0.26469646566320304, -0.028448992066664576, -0.2793423812609257, -0.15992846547501025, 0.18264887495698953, 0.04953591479612974, 0.025684630302371593, 0.009918729496392898, -0.08323662721256657, -0.010732197909752226, -0.17106109438464046, 0.31135095054675577, -0.009966093991462869, 0.31161284477665746, 0.07845640863950659, 0.039738321141623775, -0.015816022673190187, 0.11376222630639038, -0.0422381159122579, -0.09781837037087648, 0.042591990461848424, 0.2903371339027838, -0.07721234439650732, 0.22799186542397365, -0.4724902956428506, -0.22308599694189046, 0.029218525249545078, 0.18281983282053615, 0.19754784456283853, -0.10567043053281562, -0.3658009095255161, -0.03288527160723943, -0.13039049671440409, -0.15450147815934587, -0.14559812149992668, -0.019578628198715017, -0.0401950263636181, -0.258402030513602, 0.04636708500464277, 0.05550912987418109, 0.05418326754531846, -0.027864742429256892, 0.009588779276804772, -0.08833984013152786, 0.04725910434442595, -0.033938409977985785, 0.014208633615386887, 0.15101719043138095, -0.18755157395243283, -0.1192420917881153, 0.3516796690939994, -0.10991771412422745, -0.12146973741104508, 0.17546588579397193, -0.16047188449117197, -0.0571505825955239, 0.14722001393575493, 0.16003435978484226, 0.07769766414364823, -0.06860692001788354, 0.028759257900940322, 0.03377293744805928, 0.1989342878152412, 0.0770157686968493, 0.2075383968867089, 0.2947001796295276, 0.16050927904604867, 0.051106421228657224, 0.16620376992831576, -0.0907056323485449, -0.09094090087100773, -0.2478519802509875, -0.14701228733841762, -0.1916118172201805, 0.0633144647297563, -0.04937595156812544, -0.16480728144553014, 0.41732594172084114, 0.12557846695332356, 0.15073469902172956, -0.08093214235211746, 0.28445078968922266, 0.16249887520666007, 0.06974414369750132, 0.005596022211759147, 0.3388757924066584, 0.1619393846258612, 0.0810335803175027, -0.3277110554598749, -0.02881620524212627, 0.016670101851781423]
|
1,803.03816
|
ShuffleSeg: Real-time Semantic Segmentation Network
|
Real-time semantic segmentation is of significant importance for mobile and
robotics related applications. We propose a computationally efficient
segmentation network which we term as ShuffleSeg. The proposed architecture is
based on grouped convolution and channel shuffling in its encoder for improving
the performance. An ablation study of different decoding methods is compared
including Skip architecture, UNet, and Dilation Frontend. Interesting insights
on the speed and accuracy tradeoff is discussed. It is shown that skip
architecture in the decoding method provides the best compromise for the goal
of real-time performance, while it provides adequate accuracy by utilizing
higher resolution feature maps for a more accurate segmentation. ShuffleSeg is
evaluated on CityScapes and compared against the state of the art real-time
segmentation networks. It achieves 2x GFLOPs reduction, while it provides on
par mean intersection over union of 58.3% on CityScapes test set. ShuffleSeg
runs at 15.7 frames per second on NVIDIA Jetson TX2, which makes it of great
potential for real-time applications.
|
cs.CV
|
realtime semantic segmentation is of significant importance for mobile and robotics related applications we propose a computationally efficient segmentation network which we term as shuffleseg the proposed architecture is based on grouped convolution and channel shuffling in its encoder for improving the performance an ablation study of different decoding methods is compared including skip architecture unet and dilation frontend interesting insights on the speed and accuracy tradeoff is discussed it is shown that skip architecture in the decoding method provides the best compromise for the goal of realtime performance while it provides adequate accuracy by utilizing higher resolution feature maps for a more accurate segmentation shuffleseg is evaluated on cityscapes and compared against the state of the art realtime segmentation networks it achieves 2x gflops reduction while it provides on par mean intersection over union of 583 on cityscapes test set shuffleseg runs at 157 frames per second on nvidia jetson tx2 which makes it of great potential for realtime applications
|
[['realtime', 'semantic', 'segmentation', 'is', 'of', 'significant', 'importance', 'for', 'mobile', 'and', 'robotics', 'related', 'applications', 'we', 'propose', 'a', 'computationally', 'efficient', 'segmentation', 'network', 'which', 'we', 'term', 'as', 'shuffleseg', 'the', 'proposed', 'architecture', 'is', 'based', 'on', 'grouped', 'convolution', 'and', 'channel', 'shuffling', 'in', 'its', 'encoder', 'for', 'improving', 'the', 'performance', 'an', 'ablation', 'study', 'of', 'different', 'decoding', 'methods', 'is', 'compared', 'including', 'skip', 'architecture', 'unet', 'and', 'dilation', 'frontend', 'interesting', 'insights', 'on', 'the', 'speed', 'and', 'accuracy', 'tradeoff', 'is', 'discussed', 'it', 'is', 'shown', 'that', 'skip', 'architecture', 'in', 'the', 'decoding', 'method', 'provides', 'the', 'best', 'compromise', 'for', 'the', 'goal', 'of', 'realtime', 'performance', 'while', 'it', 'provides', 'adequate', 'accuracy', 'by', 'utilizing', 'higher', 'resolution', 'feature', 'maps', 'for', 'a', 'more', 'accurate', 'segmentation', 'shuffleseg', 'is', 'evaluated', 'on', 'cityscapes', 'and', 'compared', 'against', 'the', 'state', 'of', 'the', 'art', 'realtime', 'segmentation', 'networks', 'it', 'achieves', '2x', 'gflops', 'reduction', 'while', 'it', 'provides', 'on', 'par', 'mean', 'intersection', 'over', 'union', 'of', '583', 'on', 'cityscapes', 'test', 'set', 'shuffleseg', 'runs', 'at', '157', 'frames', 'per', 'second', 'on', 'nvidia', 'jetson', 'tx2', 'which', 'makes', 'it', 'of', 'great', 'potential', 'for', 'realtime', 'applications']]
|
[-0.08987058048506748, -0.059831866606117674, -0.03396828095096031, 0.052417363860118, -0.052523534163624416, -0.19748415412982892, 0.04410320939206929, 0.4630265776472895, -0.18986739350124177, -0.3327734200920192, 0.09606466825649443, -0.26664675753100875, -0.16085752550084492, 0.27808519600896364, -0.15265352428769288, 0.10879236662157331, 0.17240109328782152, 0.06491463910209837, -0.07025784443303225, -0.3120607880351961, 0.18640340125095678, 0.12111814671213397, 0.3819448460625218, 0.06800764492172054, 0.17693840197623006, -0.011488044646030628, -0.02305889267312444, -0.061071971090805505, -0.04467956862515974, 0.14983176383022104, 0.2514972981406804, 0.18050640770769244, 0.29410073567204964, -0.383578775901787, -0.20560653833383175, 0.01190967278219528, 0.1230541929271454, 0.03149621268612859, -0.03478989384749178, -0.3233281343810908, 0.13024469762780236, -0.1868229275627166, 0.04525509960833729, -0.14268053923174956, 0.011675658225087645, -0.024050946812353657, -0.28180998758707915, 0.04795707142130929, 0.02794710210501361, 0.05321746308541631, -0.0528752411873317, -0.14368388985185335, 0.02605271015912063, 0.1515608733456281, -0.050994120600419295, 0.13276404250407395, 0.1314980626331862, -0.16859817048476905, -0.12022771603884812, 0.3871750632381957, -0.0434391779755676, -0.19990526068874676, 0.19412722721911377, -0.002037353645894468, -0.12896828248703518, 0.1413114193410422, 0.2052117230497902, 0.09101945484600822, -0.11036074387274035, 0.027185684500583188, 0.007599541026612987, 0.20122153660201508, 0.09225392138573879, 0.03009694473389883, 0.13777276237859673, 0.337963488409932, 0.09595629881043566, 0.1570116895806299, -0.14857731663234394, -0.08450339713585071, -0.20980399890415233, -0.16069395624754462, -0.16974674851303886, -0.05087193162961406, -0.12850085948693338, -0.12013979174065843, 0.4097660828659438, 0.22340579606268718, 0.14337266993170938, 0.11003416009762133, 0.38397725540797534, 0.01822822673908964, 0.1123695371076696, 0.11760599119877964, 0.1661481415008351, 0.0324315429124287, 0.1094366838307386, -0.1780642639769325, 0.06849063086823809, 0.08299095947993196]
|
1,803.03817
|
Fayet-Iliopoulos terms in supergravity and D-term inflation
|
We analyse the consequences of a new gauge invariant Fayet-Iliopoulos (FI)
term proposed recently to a class of inflation models driven by supersymmetry
breaking with the inflaton being the superpartner of the goldstino. We first
show that charged matter fields can be consistently added with the new term, as
well as the standard FI term in supergravity in a K\"ahler frame where the
$U(1)$ is not an R-symmetry. We then show that the slow-roll conditions can be
easily satisfied with inflation driven by a D-term depending on the two FI
parameters. Inflation starts at initial conditions around the maximum of the
potential where the $U(1)$ symmetry is restored and stops when the inflaton
rolls down to the minimum describing the present phase of our Universe. The
resulting tensor-to-scalar ratio of primordial perturbations can be even at
observable values in the presence of higher order terms in the K\"ahler
potential.
|
hep-th astro-ph.CO gr-qc hep-ph
|
we analyse the consequences of a new gauge invariant fayetiliopoulos fi term proposed recently to a class of inflation models driven by supersymmetry breaking with the inflaton being the superpartner of the goldstino we first show that charged matter fields can be consistently added with the new term as well as the standard fi term in supergravity in a kahler frame where the u1 is not an rsymmetry we then show that the slowroll conditions can be easily satisfied with inflation driven by a dterm depending on the two fi parameters inflation starts at initial conditions around the maximum of the potential where the u1 symmetry is restored and stops when the inflaton rolls down to the minimum describing the present phase of our universe the resulting tensortoscalar ratio of primordial perturbations can be even at observable values in the presence of higher order terms in the kahler potential
|
[['we', 'analyse', 'the', 'consequences', 'of', 'a', 'new', 'gauge', 'invariant', 'fayetiliopoulos', 'fi', 'term', 'proposed', 'recently', 'to', 'a', 'class', 'of', 'inflation', 'models', 'driven', 'by', 'supersymmetry', 'breaking', 'with', 'the', 'inflaton', 'being', 'the', 'superpartner', 'of', 'the', 'goldstino', 'we', 'first', 'show', 'that', 'charged', 'matter', 'fields', 'can', 'be', 'consistently', 'added', 'with', 'the', 'new', 'term', 'as', 'well', 'as', 'the', 'standard', 'fi', 'term', 'in', 'supergravity', 'in', 'a', 'kahler', 'frame', 'where', 'the', 'u1', 'is', 'not', 'an', 'rsymmetry', 'we', 'then', 'show', 'that', 'the', 'slowroll', 'conditions', 'can', 'be', 'easily', 'satisfied', 'with', 'inflation', 'driven', 'by', 'a', 'dterm', 'depending', 'on', 'the', 'two', 'fi', 'parameters', 'inflation', 'starts', 'at', 'initial', 'conditions', 'around', 'the', 'maximum', 'of', 'the', 'potential', 'where', 'the', 'u1', 'symmetry', 'is', 'restored', 'and', 'stops', 'when', 'the', 'inflaton', 'rolls', 'down', 'to', 'the', 'minimum', 'describing', 'the', 'present', 'phase', 'of', 'our', 'universe', 'the', 'resulting', 'tensortoscalar', 'ratio', 'of', 'primordial', 'perturbations', 'can', 'be', 'even', 'at', 'observable', 'values', 'in', 'the', 'presence', 'of', 'higher', 'order', 'terms', 'in', 'the', 'kahler', 'potential']]
|
[-0.1581435294418702, 0.23289368073262615, -0.056131015732906284, 0.09379317730683959, -0.09470135192605574, -0.1491199150031445, -0.03193606533291406, 0.2927078903737109, -0.23646521508293664, -0.2943380384224673, 0.12679066857629323, -0.21476018035646854, -0.13786680993292755, 0.10211947615627175, -0.06631954232443299, 0.0031198745511586295, -0.002630523216110598, 0.06666241538392118, -0.051094869672064516, -0.2937888218677484, 0.3383241611401607, 0.040397562606935236, 0.2003086011102048, 0.044088890526018686, 0.0962975527497396, -0.10048480215013628, 0.07184326979636384, -0.016834854795253717, -0.10356461323671522, 0.04713752332077856, 0.13602575380103635, 0.06602978902312633, 0.1824676896751727, -0.413095704523609, -0.22680921860089237, 0.18902714426422978, 0.14302094327207754, 0.13606876238005472, -0.03751558593346194, -0.31146606400409, 0.10137938805574538, -0.1795966003227654, -0.11619146374888693, -0.09934099627683726, -0.025198421512899184, -0.08409007393673762, -0.3519433413057169, 0.09175727679237923, -0.010696089709327625, -0.0003334390284296675, -0.06386012857664226, -0.05890257376552428, -0.12845249015419125, 0.019916391154265207, 0.19269223253386433, 0.05761995397808168, 0.15180250552667293, -0.21732437298726914, -0.06527114649859551, 0.4093567468851005, -0.18855453968898161, -0.18414715770944554, 0.08064273212905099, -0.12498580813548534, -0.15342633346183188, 0.08047327104855904, 0.1039807132551534, 0.11725892444710004, -0.1280234386421148, 0.18913338608038144, 0.04476479811425127, 0.1653425752805646, 0.07644537961322989, 0.021401637358803478, 0.3087497212011492, 0.12172115857606666, 0.0735075802338347, 0.14375624463240297, -0.02277649249475224, -0.09868982876807252, -0.439827719297035, -0.10187557759075958, -0.15001157364236103, 0.05815718209399488, -0.15949931696685102, -0.13107603881508112, 0.45264039778669407, 0.13917859153190765, 0.22499433766330526, 0.049829237600600956, 0.23583296217936897, 0.14214742328930996, 0.09389730519771376, 0.044714282576194746, 0.3011440982067045, 0.08488197433105951, 0.1125413445199546, -0.2321458239914637, -0.03526697675666253, 0.07454716145442236]
|
1,803.03818
|
Nuclear Reactions in the Crusts of Accreting Neutron Stars
|
X-ray observations of transiently accreting neutron stars during quiescence
provide information about the structure of neutron star crusts and the
properties of dense matter. Interpretation of the observational data requires
an understanding of the nuclear reactions that heat and cool the crust during
accretion, and define its nonequilibrium composition. We identify here in
detail the typical nuclear reaction sequences down to a depth in the inner
crust where the mass density is 2E12 g/cm^3 using a full nuclear reaction
network for a range of initial compositions. The reaction sequences differ
substantially from previous work. We find a robust reduction of crust impurity
at the transition to the inner crust regardless of initial composition, though
shell effects can delay the formation of a pure crust somewhat to densities
beyond 2E12 g/cm^3. This naturally explains the small inner crust impurity
inferred from observations of a broad range of systems. The exception are
initial compositions with A >= 102 nuclei, where the inner crust remains impure
with an impurity parameter of Qimp~20 due to the N = 82 shell closure. In
agreement with previous work we find that nuclear heating is relatively robust
and independent of initial composition, while cooling via nuclear Urca cycles
in the outer crust depends strongly on initial composition. This work forms a
basis for future studies of the sensitivity of crust models to nuclear physics
and provides profiles of composition for realistic crust models.
|
astro-ph.HE astro-ph.SR nucl-th
|
xray observations of transiently accreting neutron stars during quiescence provide information about the structure of neutron star crusts and the properties of dense matter interpretation of the observational data requires an understanding of the nuclear reactions that heat and cool the crust during accretion and define its nonequilibrium composition we identify here in detail the typical nuclear reaction sequences down to a depth in the inner crust where the mass density is 2e12 gcm3 using a full nuclear reaction network for a range of initial compositions the reaction sequences differ substantially from previous work we find a robust reduction of crust impurity at the transition to the inner crust regardless of initial composition though shell effects can delay the formation of a pure crust somewhat to densities beyond 2e12 gcm3 this naturally explains the small inner crust impurity inferred from observations of a broad range of systems the exception are initial compositions with a 102 nuclei where the inner crust remains impure with an impurity parameter of qimp20 due to the n 82 shell closure in agreement with previous work we find that nuclear heating is relatively robust and independent of initial composition while cooling via nuclear urca cycles in the outer crust depends strongly on initial composition this work forms a basis for future studies of the sensitivity of crust models to nuclear physics and provides profiles of composition for realistic crust models
|
[['xray', 'observations', 'of', 'transiently', 'accreting', 'neutron', 'stars', 'during', 'quiescence', 'provide', 'information', 'about', 'the', 'structure', 'of', 'neutron', 'star', 'crusts', 'and', 'the', 'properties', 'of', 'dense', 'matter', 'interpretation', 'of', 'the', 'observational', 'data', 'requires', 'an', 'understanding', 'of', 'the', 'nuclear', 'reactions', 'that', 'heat', 'and', 'cool', 'the', 'crust', 'during', 'accretion', 'and', 'define', 'its', 'nonequilibrium', 'composition', 'we', 'identify', 'here', 'in', 'detail', 'the', 'typical', 'nuclear', 'reaction', 'sequences', 'down', 'to', 'a', 'depth', 'in', 'the', 'inner', 'crust', 'where', 'the', 'mass', 'density', 'is', '2e12', 'gcm3', 'using', 'a', 'full', 'nuclear', 'reaction', 'network', 'for', 'a', 'range', 'of', 'initial', 'compositions', 'the', 'reaction', 'sequences', 'differ', 'substantially', 'from', 'previous', 'work', 'we', 'find', 'a', 'robust', 'reduction', 'of', 'crust', 'impurity', 'at', 'the', 'transition', 'to', 'the', 'inner', 'crust', 'regardless', 'of', 'initial', 'composition', 'though', 'shell', 'effects', 'can', 'delay', 'the', 'formation', 'of', 'a', 'pure', 'crust', 'somewhat', 'to', 'densities', 'beyond', '2e12', 'gcm3', 'this', 'naturally', 'explains', 'the', 'small', 'inner', 'crust', 'impurity', 'inferred', 'from', 'observations', 'of', 'a', 'broad', 'range', 'of', 'systems', 'the', 'exception', 'are', 'initial', 'compositions', 'with', 'a', '102', 'nuclei', 'where', 'the', 'inner', 'crust', 'remains', 'impure', 'with', 'an', 'impurity', 'parameter', 'of', 'qimp20', 'due', 'to', 'the', 'n', '82', 'shell', 'closure', 'in', 'agreement', 'with', 'previous', 'work', 'we', 'find', 'that', 'nuclear', 'heating', 'is', 'relatively', 'robust', 'and', 'independent', 'of', 'initial', 'composition', 'while', 'cooling', 'via', 'nuclear', 'urca', 'cycles', 'in', 'the', 'outer', 'crust', 'depends', 'strongly', 'on', 'initial', 'composition', 'this', 'work', 'forms', 'a', 'basis', 'for', 'future', 'studies', 'of', 'the', 'sensitivity', 'of', 'crust', 'models', 'to', 'nuclear', 'physics', 'and', 'provides', 'profiles', 'of', 'composition', 'for', 'realistic', 'crust', 'models']]
|
[-0.04785674152887814, 0.21273452974568607, -0.08656132419515189, 0.06886982788679553, -0.05792997142723701, -0.014036902516296877, 0.07861314645804497, 0.3296565035959634, -0.2463824518235768, -0.33761489580988946, 0.07713250091994908, -0.24093675126557443, -0.003156361151126897, 0.17437523236206448, -0.01665802479645661, -0.008235221940778244, 0.08687195332337155, 0.024924005145060154, -0.14679701805470488, -0.1816864546364405, 0.32348614832977945, 0.0892173955396873, 0.17263405210195637, 0.04183723684600175, -0.0030792394574020105, -0.05273305756227781, 0.011218881126605134, -0.04939941566811211, -0.16831258877824798, 0.0811129782125034, 0.26288183347278704, 0.0982231991587578, 0.16436487806924965, -0.5018016309777171, -0.26902898172688045, 0.06309546823789468, 0.11247160711401649, 0.08012370704353464, -0.05548704841000312, -0.1994028009150513, 0.03257507684839442, -0.2417729393750941, -0.12960605322415322, -0.02348662819013863, 0.08752166844360817, 0.02688985037524453, -0.2746795744911464, 0.1202956739270484, 0.08529442451072881, 0.028835630157258953, -0.18086520755761443, -0.16407418376546304, -0.03237063589389936, 0.06812237736932901, 0.03409565715424021, 0.03624244287043966, 0.25284968663302804, -0.15916285983410708, 0.03339369118497447, 0.3656869382145835, -0.04648429638148553, -0.047884815216640036, 0.20922314983996454, -0.2149950665553688, -0.14275978640113585, 0.16650139849209286, 0.14526043475761435, 0.13520507843037788, -0.15031974299440096, 0.036401372549549754, -0.03993064807298245, 0.21381610918334434, 0.05551150748346305, 0.027717603451207374, 0.2932448655650691, 0.23833536590767282, 0.021710148272044604, 0.0989163914083827, -0.15353190455617696, -0.08716209121238312, -0.25128897282698637, -0.07823364114061061, -0.11472532136042007, 0.057660011658564915, -0.08758744355779523, -0.14354089723476268, 0.3430108993987217, 0.08807999632109452, 0.1930815591356945, -0.013134646710096318, 0.25739797051744173, 0.04119227216239267, 0.060155839106675574, 0.11006829637310632, 0.28897782231085484, 0.2388489080728891, 0.08526692850327383, -0.3145096968422752, 0.13092176718117726, -0.00529681968171941]
|
1,803.03819
|
On ruled surfaces with big anti-canonical divisor and numerically
trivial divisors on weak log Fano surfaces
|
We investigate the structure of geometrically ruled surfaces whose
anti-canonical class is big. As an application we show that the Picard group of
a normal projective surface whose anti-canonical class is nef and big is a free
abelian group of finite rank.
|
math.AG
|
we investigate the structure of geometrically ruled surfaces whose anticanonical class is big as an application we show that the picard group of a normal projective surface whose anticanonical class is nef and big is a free abelian group of finite rank
|
[['we', 'investigate', 'the', 'structure', 'of', 'geometrically', 'ruled', 'surfaces', 'whose', 'anticanonical', 'class', 'is', 'big', 'as', 'an', 'application', 'we', 'show', 'that', 'the', 'picard', 'group', 'of', 'a', 'normal', 'projective', 'surface', 'whose', 'anticanonical', 'class', 'is', 'nef', 'and', 'big', 'is', 'a', 'free', 'abelian', 'group', 'of', 'finite', 'rank']]
|
[-0.2062929669128997, 0.09673306877327074, -0.07639265709024455, 0.08825412299206835, -0.12461784693767272, -0.17208260759001687, -0.021011824381449037, 0.36827543954409303, -0.35362089247930617, -0.1555293066249717, 0.12392272189303878, -0.24670521841783608, -0.17548948334574344, 0.22125651906909688, -0.19172309824664677, -0.022514668248948596, -0.02322048366269363, 0.11745675333908626, -0.1426797958778306, -0.33595481611943495, 0.5114320860732169, -0.05705892605086168, 0.25608952967671766, 0.07316757727503068, 0.16389847207548364, -0.06210401581068124, 0.04162530250669945, 0.046235417681080956, -0.11867862368377419, 0.16950515054521106, 0.31625312473624945, 0.05346732684189365, 0.188398566058216, -0.33621576242148876, -0.20431237257573576, 0.2869759483174199, 0.06788859975391201, 0.0171177482587241, -0.05730549973391351, -0.20025019551671686, 0.13232033018998446, -0.18544615388271354, -0.26416232749553664, -0.07693122810728494, 0.0472590563447392, -0.002265262994028273, -0.14767860026525645, -0.065614231684733, 0.03642731867287131, 0.2038050102779553, 0.004652656925221284, -0.061957259773321095, -0.13254828462820678, -0.0049665870056265875, 0.01682875206183997, 0.0033065701746160074, 0.13164687652481785, -0.09557134427485012, -0.019663202509816204, 0.401014227508789, -0.0900277672557249, -0.17174450241561448, 0.13286727072582358, -0.13399062766360917, -0.0988888416128854, 0.18413702363059634, 0.13229331635271332, 0.2315114778140837, 0.03951863492035218, 0.24628966700679267, -0.16637158314586573, 0.10871845266471307, 0.015450651097732285, -0.09287032060369495, 0.12169426598120481, 0.17041026186641484, 0.12202340838987202, 0.08260816712642, -0.06947276012838952, -0.014978226529256929, -0.4150026910716579, -0.2972825122997165, -0.14544474612921476, 0.23523735004432855, -0.09212303429896045, -0.25511581304350067, 0.4015463556029967, -0.0638113619892725, 0.22209769992956094, 0.0965364252491175, 0.2054395273860012, -0.008398302744830116, 0.03334512291032644, 0.06064351002680182, 0.11947897484614736, 0.19806231437472716, -0.181632587553135, -0.1593327790587431, -0.006136260781204328, 0.1893236782135708]
|
1,803.0382
|
Continuum Charge Excitations in High-Valence Transition-Metal Oxides
Revealed by Resonant Inelastic X-ray Scattering
|
We present a theoretical investigation of the origin of Raman-like and
fluorescencelike (FL) features of resonant inelastic x-ray scattering (RIXS)
spectra. Using a combination of local-density approximation + dynamical
mean-field theory and a configuration interaction solver for Anderson impurity
model, we calculate the $L$-edge RIXS and x-ray absorption spectra of
high-valence transition-metal oxides LaCuO$_3$ and NaCuO$_2$. We analyze in
detail the behavior of the FL feature and show how it is connected to the
details of electronic and crystal structure. On the studied compounds we
demonstrate how material details determine whether the electron-hole continuum
can be excited in the $L$-edge RIXS process.
|
cond-mat.str-el
|
we present a theoretical investigation of the origin of ramanlike and fluorescencelike fl features of resonant inelastic xray scattering rixs spectra using a combination of localdensity approximation dynamical meanfield theory and a configuration interaction solver for anderson impurity model we calculate the ledge rixs and xray absorption spectra of highvalence transitionmetal oxides lacuo_3 and nacuo_2 we analyze in detail the behavior of the fl feature and show how it is connected to the details of electronic and crystal structure on the studied compounds we demonstrate how material details determine whether the electronhole continuum can be excited in the ledge rixs process
|
[['we', 'present', 'a', 'theoretical', 'investigation', 'of', 'the', 'origin', 'of', 'ramanlike', 'and', 'fluorescencelike', 'fl', 'features', 'of', 'resonant', 'inelastic', 'xray', 'scattering', 'rixs', 'spectra', 'using', 'a', 'combination', 'of', 'localdensity', 'approximation', 'dynamical', 'meanfield', 'theory', 'and', 'a', 'configuration', 'interaction', 'solver', 'for', 'anderson', 'impurity', 'model', 'we', 'calculate', 'the', 'ledge', 'rixs', 'and', 'xray', 'absorption', 'spectra', 'of', 'highvalence', 'transitionmetal', 'oxides', 'lacuo_3', 'and', 'nacuo_2', 'we', 'analyze', 'in', 'detail', 'the', 'behavior', 'of', 'the', 'fl', 'feature', 'and', 'show', 'how', 'it', 'is', 'connected', 'to', 'the', 'details', 'of', 'electronic', 'and', 'crystal', 'structure', 'on', 'the', 'studied', 'compounds', 'we', 'demonstrate', 'how', 'material', 'details', 'determine', 'whether', 'the', 'electronhole', 'continuum', 'can', 'be', 'excited', 'in', 'the', 'ledge', 'rixs', 'process']]
|
[-0.09077917863864318, 0.09955631216455783, -0.10184305507573299, 0.12407230918378613, -0.045701103170915525, -0.12275533880373198, 0.1026377344767715, 0.46203672083816966, -0.2862115550681721, -0.24102196331154935, -0.011512685731072359, -0.3837264272175273, -0.17480737944988875, 0.12216507143825672, 0.1194544748726244, 0.01094355819062615, 0.011203960387264284, -0.08350341276227667, -0.06520016100827833, -0.16636502651892107, 0.30043154249290877, 0.06222276621479161, 0.24505731509048112, 0.13210058564852392, -0.0009266121826153629, 0.09623473104830756, 0.0843435412044732, -0.018758136512977735, -0.1273243430365181, 0.11195538479511682, 0.30200138758233636, -0.03318961802870035, 0.13902221224508343, -0.46292546442804894, -0.2068913625933382, -0.05789560156551247, 0.1483491274186087, 0.11929163724725723, -0.045186566091522724, -0.2463110139954607, 0.025556411299550413, -0.15935294995350496, -0.14518772554583848, -0.13807199654473487, -0.058956704354293794, 0.007827084703273372, -0.22160995773298722, 0.04472182709153513, 0.039080918546497576, 0.06553726858692244, -0.15464986097637792, -0.08785975804999091, -0.04519387257370946, 0.023978128378298515, 0.021026223095796756, -0.0273830581038278, 0.14023799133577328, -0.1095502452060048, -0.11653312229864983, 0.38329980539618896, -0.07383600299660002, -0.04061416298036977, 0.17236624480396204, -0.20550612750824312, -0.11224099748045663, 0.15234585983526647, 0.13851367799999972, 0.12913044550152, -0.14548066341049723, 0.14334863203943574, -0.047356425556449255, 0.24328172377225163, 0.012713600218543137, 0.11112645431065324, 0.19858969056180545, 0.21425082894963954, -0.07433494053096795, 0.1250338422559791, -0.16611264278988677, -0.009625717360830429, -0.21880086467658377, -0.11542075022826997, -0.19367253055263842, 0.05354602354322085, -0.020645717860078343, -0.19798728257384418, 0.4475980757697656, 0.14740119904412755, 0.19731411536471272, -0.0792937993585151, 0.24419751508655596, 0.15883284842842543, -0.02116906553107713, 0.010898680122075032, 0.2523095537148112, 0.1830408780512457, 0.09326472896037205, -0.3461703791767739, 0.06448693199520361, 0.05603622791965549]
|
1,803.03821
|
Theory of differential inclusions and its application in mechanics
|
The following chapter deals with systems of differential equations with
discontinuous right-hand sides. The key question is how to define the solutions
of such systems. The most adequate approach is to treat discontinuous systems
as systems with multivalued right-hand sides (differential inclusions). In this
work three well-known definitions of solution of discontinuous system are
considered. We will demonstrate the difference between these definitions and
their application to different mechanical problems. Mathematical models of
drilling systems with discontinuous friction torque characteristics are
considered. Here, opposite to classical Coulomb symmetric friction law, the
friction torque characteristic is asymmetrical. Problem of sudden load change
is studied. Analytical methods of investigation of systems with such
asymmetrical friction based on the use of Lyapunov functions are demonstrated.
The Watt governor and Chua system are considered to show different aspects of
computer modeling of discontinuous systems.
|
math.DS nlin.CD
|
the following chapter deals with systems of differential equations with discontinuous righthand sides the key question is how to define the solutions of such systems the most adequate approach is to treat discontinuous systems as systems with multivalued righthand sides differential inclusions in this work three wellknown definitions of solution of discontinuous system are considered we will demonstrate the difference between these definitions and their application to different mechanical problems mathematical models of drilling systems with discontinuous friction torque characteristics are considered here opposite to classical coulomb symmetric friction law the friction torque characteristic is asymmetrical problem of sudden load change is studied analytical methods of investigation of systems with such asymmetrical friction based on the use of lyapunov functions are demonstrated the watt governor and chua system are considered to show different aspects of computer modeling of discontinuous systems
|
[['the', 'following', 'chapter', 'deals', 'with', 'systems', 'of', 'differential', 'equations', 'with', 'discontinuous', 'righthand', 'sides', 'the', 'key', 'question', 'is', 'how', 'to', 'define', 'the', 'solutions', 'of', 'such', 'systems', 'the', 'most', 'adequate', 'approach', 'is', 'to', 'treat', 'discontinuous', 'systems', 'as', 'systems', 'with', 'multivalued', 'righthand', 'sides', 'differential', 'inclusions', 'in', 'this', 'work', 'three', 'wellknown', 'definitions', 'of', 'solution', 'of', 'discontinuous', 'system', 'are', 'considered', 'we', 'will', 'demonstrate', 'the', 'difference', 'between', 'these', 'definitions', 'and', 'their', 'application', 'to', 'different', 'mechanical', 'problems', 'mathematical', 'models', 'of', 'drilling', 'systems', 'with', 'discontinuous', 'friction', 'torque', 'characteristics', 'are', 'considered', 'here', 'opposite', 'to', 'classical', 'coulomb', 'symmetric', 'friction', 'law', 'the', 'friction', 'torque', 'characteristic', 'is', 'asymmetrical', 'problem', 'of', 'sudden', 'load', 'change', 'is', 'studied', 'analytical', 'methods', 'of', 'investigation', 'of', 'systems', 'with', 'such', 'asymmetrical', 'friction', 'based', 'on', 'the', 'use', 'of', 'lyapunov', 'functions', 'are', 'demonstrated', 'the', 'watt', 'governor', 'and', 'chua', 'system', 'are', 'considered', 'to', 'show', 'different', 'aspects', 'of', 'computer', 'modeling', 'of', 'discontinuous', 'systems']]
|
[-0.1968249489885888, 0.047527752836634005, -0.07739893728201942, 0.01683120394508088, -0.0720757915305772, -0.208366578411577, -0.052381547806518415, 0.3441399544610509, -0.30407996686657757, -0.2817403753155044, 0.10216781057616962, -0.2860754539757701, -0.2050586990612958, 0.23264703883656435, -0.09627716221647072, 0.11291215773422404, 0.01955981092926647, -0.01677215803148491, -0.08525290736329875, -0.20073788561193007, 0.3736890760133974, -0.0376914893310251, 0.24646456637752376, 0.04696035454315799, 0.11437020823026874, -0.04547790118958801, -0.022348862374201417, 0.04606016380047159, -0.11322848517946633, 0.08994118074271162, 0.25463059850686215, 0.022825015555801135, 0.28777702441439035, -0.4511926649005285, -0.2140307874676572, 0.05497907543820994, 0.09987108829830374, 0.09561200740634897, -0.01609329777254191, -0.2362675746869562, 0.04554846010370446, -0.1818833693878592, -0.142513681445936, -0.06265600181982986, 0.05665098294017038, 0.12483367453927972, -0.23429541802033782, 0.10733620766550303, 0.08344795467731143, 0.08790045633379902, -0.09469462326295408, -0.11986446432669513, -0.02055413346471531, 0.12189725647497524, 0.05954196469558935, -0.0646145607012191, 0.1607950234020661, -0.08630588810192422, -0.1328284657493766, 0.3956267550787223, 0.003648010019346007, -0.2381746746200536, 0.2521513476385735, -0.1280131301709584, -0.0988139620599603, 0.07172047365706281, 0.20051108274908205, 0.13131094140641966, -0.16059360166878572, 0.021322586000730684, 0.02616171007710883, 0.1540254096159645, 0.06224042185848313, -0.007341487266655479, 0.18316738786275633, 0.16958025882153638, 0.06019455973458077, 0.15193463962392084, 0.013886094886610018, -0.18952407771388868, -0.2773485739474251, -0.13481910668779165, -0.13664454606893872, 0.017901260239471282, -0.047095566788214326, -0.19130089639553002, 0.3242234335640595, 0.15230014553152224, 0.12871940941716145, 0.014232917203168783, 0.32083937887468245, 0.18960074977533492, 0.0172250474088027, 0.014878500159829855, 0.22801746723042535, 0.17019540034733446, 0.1696214696957863, -0.24368271553789134, 0.06320660724969847, 0.08923527312664581]
|
1,803.03822
|
Cut elimination, identity elimination, and interpolation in super-Belnap
logics
|
We develop a Gentzen-style proof theory for super-Belnap logics (extensions
of the four-valued Dunn-Belnap logic), expanding on an approach initiated by
Pynko. We show that just like substructural logics may be understood
proof-theoretically as logics which relax the structural rules of classical
logic but keep its logical rules as well as the rules of Identity and Cut,
super-Belnap logics may be seen as logics which relax Identity and Cut but keep
the logical rules as well as the structural rules of classical logic. A
generalization of the cut elimination theorem for classical propositional logic
is then proved and used to establish interpolation for various super-Belnap
logics. In particular, we obtain an alternative syntactic proof of a refinement
of the Craig interpolation theorem for classical propositional logic discovered
recently by Milne.
|
math.LO
|
we develop a gentzenstyle proof theory for superbelnap logics extensions of the fourvalued dunnbelnap logic expanding on an approach initiated by pynko we show that just like substructural logics may be understood prooftheoretically as logics which relax the structural rules of classical logic but keep its logical rules as well as the rules of identity and cut superbelnap logics may be seen as logics which relax identity and cut but keep the logical rules as well as the structural rules of classical logic a generalization of the cut elimination theorem for classical propositional logic is then proved and used to establish interpolation for various superbelnap logics in particular we obtain an alternative syntactic proof of a refinement of the craig interpolation theorem for classical propositional logic discovered recently by milne
|
[['we', 'develop', 'a', 'gentzenstyle', 'proof', 'theory', 'for', 'superbelnap', 'logics', 'extensions', 'of', 'the', 'fourvalued', 'dunnbelnap', 'logic', 'expanding', 'on', 'an', 'approach', 'initiated', 'by', 'pynko', 'we', 'show', 'that', 'just', 'like', 'substructural', 'logics', 'may', 'be', 'understood', 'prooftheoretically', 'as', 'logics', 'which', 'relax', 'the', 'structural', 'rules', 'of', 'classical', 'logic', 'but', 'keep', 'its', 'logical', 'rules', 'as', 'well', 'as', 'the', 'rules', 'of', 'identity', 'and', 'cut', 'superbelnap', 'logics', 'may', 'be', 'seen', 'as', 'logics', 'which', 'relax', 'identity', 'and', 'cut', 'but', 'keep', 'the', 'logical', 'rules', 'as', 'well', 'as', 'the', 'structural', 'rules', 'of', 'classical', 'logic', 'a', 'generalization', 'of', 'the', 'cut', 'elimination', 'theorem', 'for', 'classical', 'propositional', 'logic', 'is', 'then', 'proved', 'and', 'used', 'to', 'establish', 'interpolation', 'for', 'various', 'superbelnap', 'logics', 'in', 'particular', 'we', 'obtain', 'an', 'alternative', 'syntactic', 'proof', 'of', 'a', 'refinement', 'of', 'the', 'craig', 'interpolation', 'theorem', 'for', 'classical', 'propositional', 'logic', 'discovered', 'recently', 'by', 'milne']]
|
[-0.047761342942976626, 0.02760717318801653, -0.1632483233770472, 0.17823610668074252, -0.17880071204854175, -0.17453410862071905, 0.12473372326621757, 0.3277483213751111, -0.3465652502854937, -0.26266099468193715, 0.12284425154848577, -0.1886118404509034, -0.08588071993290214, 0.15390713361512098, -0.15847241917072097, 0.06449121517971435, -0.024871192799764685, 0.06271856787498109, -0.05668327850980859, -0.1956338375384803, 0.266392498060668, -0.03404912863697973, 0.20539971992002393, 0.057147890390751854, 0.10167279142842744, 0.09917299982407712, -0.008583148133766372, 0.0720425083200098, -0.08965530383494524, 0.10522683688759571, 0.33947807518416084, 0.25064367148661404, 0.2891263493838778, -0.444866601479589, -0.14162695791310398, 0.05050574201595737, 0.11103572214233282, 0.10019124824782466, 0.044770827403226576, -0.2956658323528245, 0.04705073620425537, -0.20940309546131175, -0.11633475817507133, -0.1815618610344245, 0.03602463635343156, 0.048240218675346114, -0.20558208162037772, -0.014062782232940663, 0.29608006740363635, 0.1256725585996037, -0.009502809783043631, -0.12423645814487827, 0.004156420552135387, 0.014679132775199832, -0.040219189149866, 0.009714699550386285, 0.09358727511835241, -0.07255433106911369, -0.2752891989330237, 0.3432373750547413, 0.017103868209233042, -0.16172385273966938, 0.12143444350658683, -0.02497821098950226, -0.19160051443759585, 0.009188809413899435, 0.0365987911936827, 0.16633162009452462, -0.14047110408864683, 0.12675814604017432, -0.056015078055679624, 0.1908377310501237, 0.20282249220326776, 0.11219910950239864, 0.17488553750081337, 0.1606750966875552, 0.029952624048746657, 0.1840469078215392, 0.07488590309912979, -0.13661872087686788, -0.326585084270846, -0.14845366094232304, -0.07398861099864007, -0.007353924855124205, -0.08270606079497611, -0.23264766726788366, 0.29464064081548713, 0.12766730307703256, 0.11679250144629805, 0.18958816871781892, 0.2767511116089736, 0.13989876452797034, 0.14934065219495096, -0.01682628965954791, 0.19104871097806608, 0.20867157193788444, 0.12266346088654245, -0.11494375918937294, 0.09724192831208711, 0.15348176288716786]
|
1,803.03823
|
Examining the Efficiency of Sun Lightening and Shadow Tools in AutoCAD
Program
|
The AutoCAD is one of the most famous Computer Aided Drawing programs with
high and accurate specifications in the engineering design. It is highly
qualified and contains many of the tools it needs in many engineering
departments. A useful tool is the lighting tool because it gives a simulated
rendering of reality to a great degree that benefits the architect as well as
urban designers. This tool includes simulating sunlight by date during the
year, timing of day, and position of the body on the Earth. We tested the
sunlight status tools in this program in the limit of our test region to see
how accurate it was and it turned out to have a 45% error difference. The sun
shadow in AutoCAD rendering is longer than the real by 145%. There is another
error in the direction of shadow also. It is essential to note these errors for
any designer need to calculate the shadow length and direction from the AutoCAD
program.
|
physics.pop-ph physics.app-ph
|
the autocad is one of the most famous computer aided drawing programs with high and accurate specifications in the engineering design it is highly qualified and contains many of the tools it needs in many engineering departments a useful tool is the lighting tool because it gives a simulated rendering of reality to a great degree that benefits the architect as well as urban designers this tool includes simulating sunlight by date during the year timing of day and position of the body on the earth we tested the sunlight status tools in this program in the limit of our test region to see how accurate it was and it turned out to have a 45 error difference the sun shadow in autocad rendering is longer than the real by 145 there is another error in the direction of shadow also it is essential to note these errors for any designer need to calculate the shadow length and direction from the autocad program
|
[['the', 'autocad', 'is', 'one', 'of', 'the', 'most', 'famous', 'computer', 'aided', 'drawing', 'programs', 'with', 'high', 'and', 'accurate', 'specifications', 'in', 'the', 'engineering', 'design', 'it', 'is', 'highly', 'qualified', 'and', 'contains', 'many', 'of', 'the', 'tools', 'it', 'needs', 'in', 'many', 'engineering', 'departments', 'a', 'useful', 'tool', 'is', 'the', 'lighting', 'tool', 'because', 'it', 'gives', 'a', 'simulated', 'rendering', 'of', 'reality', 'to', 'a', 'great', 'degree', 'that', 'benefits', 'the', 'architect', 'as', 'well', 'as', 'urban', 'designers', 'this', 'tool', 'includes', 'simulating', 'sunlight', 'by', 'date', 'during', 'the', 'year', 'timing', 'of', 'day', 'and', 'position', 'of', 'the', 'body', 'on', 'the', 'earth', 'we', 'tested', 'the', 'sunlight', 'status', 'tools', 'in', 'this', 'program', 'in', 'the', 'limit', 'of', 'our', 'test', 'region', 'to', 'see', 'how', 'accurate', 'it', 'was', 'and', 'it', 'turned', 'out', 'to', 'have', 'a', '45', 'error', 'difference', 'the', 'sun', 'shadow', 'in', 'autocad', 'rendering', 'is', 'longer', 'than', 'the', 'real', 'by', '145', 'there', 'is', 'another', 'error', 'in', 'the', 'direction', 'of', 'shadow', 'also', 'it', 'is', 'essential', 'to', 'note', 'these', 'errors', 'for', 'any', 'designer', 'need', 'to', 'calculate', 'the', 'shadow', 'length', 'and', 'direction', 'from', 'the', 'autocad', 'program']]
|
[-0.06594475548131609, 0.06192892250580644, -0.11001471417752148, 0.09252184889267878, -0.09511044052960865, -0.12194077858552793, 0.03252358426214225, 0.36587498630711274, -0.23772613000070414, -0.3731289132058255, 0.1594046116385186, -0.2702563028051261, -0.16263614498661613, 0.27293177291342385, -0.10908961008560696, 0.04945843276336355, 0.079897259627726, 0.023328252296689098, -0.005615237618202309, -0.24793811557254541, 0.22220576810579107, 0.09820788739637637, 0.25052896725368096, 0.06447264564614971, 0.0775580804743604, 0.03624181600253275, -0.0411530903660538, -0.0063704853488897985, -0.06192810806765205, 0.12234724195034134, 0.2878901308196728, 0.18713249942356366, 0.28920481368853634, -0.393713027753073, -0.17892964415757864, 0.07354964723416313, 0.10361281112464933, 0.10679264995840841, -0.03508587627588811, -0.26132952548460636, 0.07563654948211634, -0.14128412597927342, -0.1597490014545505, -0.03242304105671591, 0.06541277243372945, -0.04045235551893711, -0.20880769431309415, -0.013342614271542331, 0.04225267979003592, 0.08469748065772643, 0.007430180060202999, -0.10605218923119314, -0.024999614387887753, 0.19148843283507905, 0.0548419271127258, 0.07215404146325209, 0.1456532683709145, -0.10888138767799642, -0.07560468800944431, 0.4283879949351304, -0.004884948538765569, -0.17780135590240267, 0.201148488168159, -0.13360370073304653, -0.12306564257543054, 0.14145142518439577, 0.14191762800828375, 0.09294175653878393, -0.1586702746893365, 0.05461173849516017, -0.0026500906361027, 0.1932710382938842, 0.04945014483878172, -0.006476275134328867, 0.2434459601820338, 0.1895079945836879, 0.08532321952251957, 0.1352534281072761, -0.09990679372553399, -0.06804901129706117, -0.2606009435475707, -0.18174961194995237, -0.16636471127365585, 0.025523415649526874, -0.04755271985179507, -0.13687357160782704, 0.39969470485062136, 0.20881570696807894, 0.10796112376565194, -0.003145791055988863, 0.33399772147813733, 0.07436312790860085, 0.09933834729796173, 0.0826252898475601, 0.25076464449906827, 0.06821445640293664, 0.15101283399011095, -0.16080767311801436, 0.10272498814491955, -0.002700198178916621]
|
1,803.03824
|
Extraction of Heavy-Flavor Transport Coefficients in QCD Matter
|
We report on broadly based systematic investigations of the modeling
components for open heavy-flavor diffusion and energy loss in strongly
interacting matter in their application to heavy-flavor observables in
high-energy heavy-ion collisions, conducted within an EMMI Rapid Reaction Task
Force framework. Initial spectra including cold-nuclear-matter effects, a wide
variety of space-time evolution models, heavy-flavor transport coefficients,
and hadronization mechanisms are scrutinized in an effort to quantify pertinent
uncertainties in the calculations of nuclear modification factors and elliptic
flow of open heavy-flavor particles in nuclear collisions. We develop
procedures for error assessments and criteria for common model components to
improve quantitative estimates for the (low-momentum) heavy-flavor diffusion
coefficient as a long-wavelength characteristic of QCD matter as a function of
temperature, and for energy loss coefficients of high-momentum heavy-flavor
particles.
|
nucl-th hep-ph nucl-ex
|
we report on broadly based systematic investigations of the modeling components for open heavyflavor diffusion and energy loss in strongly interacting matter in their application to heavyflavor observables in highenergy heavyion collisions conducted within an emmi rapid reaction task force framework initial spectra including coldnuclearmatter effects a wide variety of spacetime evolution models heavyflavor transport coefficients and hadronization mechanisms are scrutinized in an effort to quantify pertinent uncertainties in the calculations of nuclear modification factors and elliptic flow of open heavyflavor particles in nuclear collisions we develop procedures for error assessments and criteria for common model components to improve quantitative estimates for the lowmomentum heavyflavor diffusion coefficient as a longwavelength characteristic of qcd matter as a function of temperature and for energy loss coefficients of highmomentum heavyflavor particles
|
[['we', 'report', 'on', 'broadly', 'based', 'systematic', 'investigations', 'of', 'the', 'modeling', 'components', 'for', 'open', 'heavyflavor', 'diffusion', 'and', 'energy', 'loss', 'in', 'strongly', 'interacting', 'matter', 'in', 'their', 'application', 'to', 'heavyflavor', 'observables', 'in', 'highenergy', 'heavyion', 'collisions', 'conducted', 'within', 'an', 'emmi', 'rapid', 'reaction', 'task', 'force', 'framework', 'initial', 'spectra', 'including', 'coldnuclearmatter', 'effects', 'a', 'wide', 'variety', 'of', 'spacetime', 'evolution', 'models', 'heavyflavor', 'transport', 'coefficients', 'and', 'hadronization', 'mechanisms', 'are', 'scrutinized', 'in', 'an', 'effort', 'to', 'quantify', 'pertinent', 'uncertainties', 'in', 'the', 'calculations', 'of', 'nuclear', 'modification', 'factors', 'and', 'elliptic', 'flow', 'of', 'open', 'heavyflavor', 'particles', 'in', 'nuclear', 'collisions', 'we', 'develop', 'procedures', 'for', 'error', 'assessments', 'and', 'criteria', 'for', 'common', 'model', 'components', 'to', 'improve', 'quantitative', 'estimates', 'for', 'the', 'lowmomentum', 'heavyflavor', 'diffusion', 'coefficient', 'as', 'a', 'longwavelength', 'characteristic', 'of', 'qcd', 'matter', 'as', 'a', 'function', 'of', 'temperature', 'and', 'for', 'energy', 'loss', 'coefficients', 'of', 'highmomentum', 'heavyflavor', 'particles']]
|
[-0.05998824402195169, 0.17516043512137003, -0.15219080024166942, 0.12336574696746538, -0.018614092277857708, -0.08698783377258223, -0.022924900978978258, 0.3690758130978793, -0.24927931575803086, -0.2808295444556279, -0.021276534809658187, -0.326198543960345, 0.018694650832912885, 0.19548739999663667, 0.03214180866598326, 0.1429552931138005, 0.12293546589717153, -0.046157262342603644, -0.037783874227898195, -0.18444656205883803, 0.31998737257526955, 0.10712313337353407, 0.2206265440036077, 0.1876408332173014, 0.059419811877887696, 0.05303614102740539, -0.08678835146201891, -0.009972225510864519, -0.17022918097063666, 0.08657895243666758, 0.2747686294655125, 0.031208541364321718, 0.207228456323719, -0.4129537193439319, -0.24817000974871917, 0.06379857795400312, 0.1508605649682977, 0.11586661990440916, -0.0846943483893483, -0.23593876459926832, 0.026777337578096194, -0.21675538285489893, -0.14400566346739652, -0.11264749287329323, 0.015031134898890741, 0.026259091511491306, -0.3141516317919013, 0.16023090133967344, -0.020308898798248265, 0.10762291338818386, -0.07661936088879884, -0.17144388810811506, 0.03483216656604782, 0.07917344276211224, 0.0893310813289645, 0.033915506075800295, 0.23836284655408235, -0.2217734692767408, -0.15053437104506884, 0.4204426670985413, -0.04969552543479949, -0.17311353490367765, 0.18673358323758293, -0.14785669325647177, -0.15399222833730164, 0.12131169942222186, 0.30579934361594496, 0.0889339853238198, -0.2536388405824255, 0.04024518104006347, 0.044352866359986365, 0.15302586706638976, 0.01315164096558874, 0.09460149790538708, 0.16751437036327843, 0.18978897421402507, -0.04036537756849157, 0.04659318530957535, -0.05439104525248695, -0.08833812078955816, -0.3470963518557255, -0.11411131044042122, -0.09313920814747689, 0.05226185368883307, -0.08712389260415421, -0.148051841423694, 0.3736917351925513, 0.0938440288809943, 0.20755971299331577, -0.08137929914119013, 0.29347281291120453, 0.04543588377600827, 0.005742753645535004, 0.07986532349923436, 0.2331474349148266, 0.19373769724370504, 0.13394681198042235, -0.2927281796291936, 0.054331960523995804, 0.06908601845861995]
|
1,803.03825
|
Observation of Chiral character deep in the topological insulating
regime in Bi$_{1-x}$Sb$_x$
|
Bi$_{1-x}$Sb$_x$ is a topological insulator (TI) for $x \approx 0.03
$--$0.20$. Close to the Topological phase transition at $x = 0.03$, a magnetic
field induced Weyl semi-metal (WSM) state is stabilized due to the splitting of
the Dirac cone into two Weyl cones of opposite chirality. A signature of the
Weyl state is the observation of a Chiral anomaly [negative longitudnal
magnetoresistance (LMR)] and a violation of the Ohm's law (non-linear $I-V$).
We report the unexpected discovery of a Chiral anomaly in the whole range ($x =
0.032, 0.072, 0.16$) of the TI state. This points to a field induced WSM state
in an extended $x$ range and not just near the topological transition at $x =
0.03$. Surprisingly, the strongest Weyl phase is found at $x = 0.16$ with a
non-saturating negative LMR much larger than observed for $x = 0.03$. The
negative LMR vanishes rapidly with increasing angle between $B$ and $I$.
Additionally, non-linear $I$--$V$ is found for $x = 0.16$ indicating a
violation of Ohm's law. This unexpected observation of a strong Weyl state in
the whole TI regime in Bi$_{1-x}$Sb$_x$ points to a gap in our understanding of
the detailed electronic structure evolution in this alloy system.
|
cond-mat.mtrl-sci cond-mat.str-el
|
bi_1xsb_x is a topological insulator ti for x approx 003 020 close to the topological phase transition at x 003 a magnetic field induced weyl semimetal wsm state is stabilized due to the splitting of the dirac cone into two weyl cones of opposite chirality a signature of the weyl state is the observation of a chiral anomaly negative longitudnal magnetoresistance lmr and a violation of the ohms law nonlinear iv we report the unexpected discovery of a chiral anomaly in the whole range x 0032 0072 016 of the ti state this points to a field induced wsm state in an extended x range and not just near the topological transition at x 003 surprisingly the strongest weyl phase is found at x 016 with a nonsaturating negative lmr much larger than observed for x 003 the negative lmr vanishes rapidly with increasing angle between b and i additionally nonlinear iv is found for x 016 indicating a violation of ohms law this unexpected observation of a strong weyl state in the whole ti regime in bi_1xsb_x points to a gap in our understanding of the detailed electronic structure evolution in this alloy system
|
[['bi_1xsb_x', 'is', 'a', 'topological', 'insulator', 'ti', 'for', 'x', 'approx', '003', '020', 'close', 'to', 'the', 'topological', 'phase', 'transition', 'at', 'x', '003', 'a', 'magnetic', 'field', 'induced', 'weyl', 'semimetal', 'wsm', 'state', 'is', 'stabilized', 'due', 'to', 'the', 'splitting', 'of', 'the', 'dirac', 'cone', 'into', 'two', 'weyl', 'cones', 'of', 'opposite', 'chirality', 'a', 'signature', 'of', 'the', 'weyl', 'state', 'is', 'the', 'observation', 'of', 'a', 'chiral', 'anomaly', 'negative', 'longitudnal', 'magnetoresistance', 'lmr', 'and', 'a', 'violation', 'of', 'the', 'ohms', 'law', 'nonlinear', 'iv', 'we', 'report', 'the', 'unexpected', 'discovery', 'of', 'a', 'chiral', 'anomaly', 'in', 'the', 'whole', 'range', 'x', '0032', '0072', '016', 'of', 'the', 'ti', 'state', 'this', 'points', 'to', 'a', 'field', 'induced', 'wsm', 'state', 'in', 'an', 'extended', 'x', 'range', 'and', 'not', 'just', 'near', 'the', 'topological', 'transition', 'at', 'x', '003', 'surprisingly', 'the', 'strongest', 'weyl', 'phase', 'is', 'found', 'at', 'x', '016', 'with', 'a', 'nonsaturating', 'negative', 'lmr', 'much', 'larger', 'than', 'observed', 'for', 'x', '003', 'the', 'negative', 'lmr', 'vanishes', 'rapidly', 'with', 'increasing', 'angle', 'between', 'b', 'and', 'i', 'additionally', 'nonlinear', 'iv', 'is', 'found', 'for', 'x', '016', 'indicating', 'a', 'violation', 'of', 'ohms', 'law', 'this', 'unexpected', 'observation', 'of', 'a', 'strong', 'weyl', 'state', 'in', 'the', 'whole', 'ti', 'regime', 'in', 'bi_1xsb_x', 'points', 'to', 'a', 'gap', 'in', 'our', 'understanding', 'of', 'the', 'detailed', 'electronic', 'structure', 'evolution', 'in', 'this', 'alloy', 'system']]
|
[-0.24331359112014372, 0.203691978503141, -0.05507239860733255, 0.006077772771748595, -0.06200577935729271, -0.18676108450700457, 0.1359621971582946, 0.32096838746697476, -0.2605566571991986, -0.285322383686136, -0.006569524112945565, -0.35281344272721654, -0.099050228869638, 0.12074633395920197, 0.016340860459380425, -0.016774143467251305, -0.06616710276366808, -0.006427790099181808, -0.16614440124607288, -0.16252477097635468, 0.2720576350326435, -0.017016073584090918, 0.31416319732028897, 0.060789782518688114, 0.06694284834278126, -0.07773790167381939, 0.1207460834692495, 0.0704810668905385, -0.12284487147848361, -0.0017352121906020702, 0.23725645552055002, -0.10964537127874792, 0.1869583907525222, -0.310543566240141, -0.17574412270138662, 0.057039089426875876, 0.10346120276655524, 0.053928885826220116, -0.10337863054771262, -0.3302693696047824, 0.11576494779915382, -0.14256557353819982, -0.14634138755977918, -0.025683422435898908, 0.0682982362460536, -0.128991873213687, -0.24741365711282318, 0.13206554076228386, 0.07133883795318886, 0.09797983288955994, -0.06326962066217302, -0.1421506260205299, -0.09642166127211964, 0.01519353900057001, 0.05700870398432016, 0.10295690274804843, 0.09122924650661074, -0.10836178541589432, -0.06463436612334007, 0.39227597194317826, -0.09335692675152901, -0.05302761480248032, 0.11305385183972808, -0.2554307183680626, -0.08741966104731919, 0.20901926486538006, 0.1215479143250447, 0.1040663774761831, -0.07046681243287495, 0.08920402247369145, -0.014884032809939713, 0.17461269995412573, -0.012030052011593795, 0.053877811663999006, 0.30077807063666673, 0.1548815155091385, 0.06943433035929233, 0.07382105999650099, -0.14564141786764734, -0.0032737105165441065, -0.31501927794172213, -0.23455229252338028, -0.20576749376188486, 0.14555344244305535, -0.08214211714885329, -0.18250105548650025, 0.39129338312941864, 0.08903351963903659, 0.24218732345944796, -0.045268488611252856, 0.19071542005747175, 0.11814945075505724, 0.049854606381939864, 0.03504209027936061, 0.2820992550884302, 0.18721537249019513, 0.17517398006449908, -0.2452981145467418, 0.07305205296247433, 0.022668747388972687]
|
1,803.03826
|
The shift map on Floer trajectory spaces
|
In this article we give a uniform proof why the shift map on Floer homology
trajectory spaces is scale smooth. This proof works for various Floer
homologies, periodic, Lagrangian, Hyperk\"ahler, elliptic or parabolic, and
uses Hilbert space valued Sobolev theory.
|
math.SG math.FA
|
in this article we give a uniform proof why the shift map on floer homology trajectory spaces is scale smooth this proof works for various floer homologies periodic lagrangian hyperkahler elliptic or parabolic and uses hilbert space valued sobolev theory
|
[['in', 'this', 'article', 'we', 'give', 'a', 'uniform', 'proof', 'why', 'the', 'shift', 'map', 'on', 'floer', 'homology', 'trajectory', 'spaces', 'is', 'scale', 'smooth', 'this', 'proof', 'works', 'for', 'various', 'floer', 'homologies', 'periodic', 'lagrangian', 'hyperkahler', 'elliptic', 'or', 'parabolic', 'and', 'uses', 'hilbert', 'space', 'valued', 'sobolev', 'theory']]
|
[-0.22456572729861363, 0.047262962395325306, -0.16840565703460014, 0.19454535403638146, -0.194111622357741, -0.18161560943699442, -0.0758745765866479, 0.33849620767869054, -0.3426916484721005, -0.1881633996090386, 0.08831327184743713, -0.19650360175874085, -0.2075265801802743, 0.1541990995348897, -0.2890498131280765, 0.04012440554797649, 0.10541109154000879, 0.036550680897198616, -0.13263500499306247, -0.2678474479354918, 0.49100242817075923, -0.07828781760763377, 0.16424783379770816, 0.12968076328979805, 0.12236585798673331, 0.05388799796346575, -0.0355923444731161, -0.09431483957523597, -0.26011939158197495, 0.16150708483473863, 0.3403881636913866, -0.05841353699797765, 0.17376838196069003, -0.3771004798356444, -0.15734584125457332, 0.22448308810126036, 0.15421243819291702, 0.021547315735369922, -0.037801193495397456, -0.33649387743789705, 0.003207956743426621, -0.11284221287351101, -0.19129427522420883, -0.1647523220104631, 0.008701241377275437, 0.031101310253143312, -0.19913195923436433, -0.04004438486881554, 0.08782783541828394, 0.198380609578453, -0.07790866422001272, -0.03003023334313184, -0.009766166112967767, 0.021826403279555963, 0.013049328530905768, 0.17943249996751548, 0.16056261857738718, 0.021673223620746286, -0.11728851776570082, 0.338841519318521, -0.08530979717470473, -0.33086022939532994, 0.060132397594861685, -0.08249174975790083, -0.24186558295041322, 0.17015177315333857, 0.04937221235595644, 0.17315118173137306, 0.009460019937250763, 0.24596264669526136, -0.12765774866566063, 0.10265546734444797, 0.1306820245925337, -0.010530763119459153, 0.0548795135691762, 0.07755474539007992, 0.224853498628363, 0.07923764146398753, 0.0165924490254838, -0.19068999358423752, -0.38803605902940036, -0.23129147621802987, -0.12904697412159294, 0.16998296699021012, -0.12769746067897358, -0.2373522337875329, 0.4031874230480753, 0.020864194119349123, 0.15844262782484292, 0.2151259280508384, 0.3018000608659349, 0.023259482288267463, -0.01199550114106387, -0.005669578715605894, 0.10148427575477399, 0.2067821053264197, 0.14339888811227866, -0.06044638321618549, -0.08589514077175409, 0.42461213504429907]
|
1,803.03827
|
Face2Text: Collecting an Annotated Image Description Corpus for the
Generation of Rich Face Descriptions
|
The past few years have witnessed renewed interest in NLP tasks at the
interface between vision and language. One intensively-studied problem is that
of automatically generating text from images. In this paper, we extend this
problem to the more specific domain of face description. Unlike scene
descriptions, face descriptions are more fine-grained and rely on attributes
extracted from the image, rather than objects and relations. Given that no data
exists for this task, we present an ongoing crowdsourcing study to collect a
corpus of descriptions of face images taken `in the wild'. To gain a better
understanding of the variation we find in face description and the possible
issues that this may raise, we also conducted an annotation study on a subset
of the corpus. Primarily, we found descriptions to refer to a mixture of
attributes, not only physical, but also emotional and inferential, which is
bound to create further challenges for current image-to-text methods.
|
cs.CL cs.AI cs.CV
|
the past few years have witnessed renewed interest in nlp tasks at the interface between vision and language one intensivelystudied problem is that of automatically generating text from images in this paper we extend this problem to the more specific domain of face description unlike scene descriptions face descriptions are more finegrained and rely on attributes extracted from the image rather than objects and relations given that no data exists for this task we present an ongoing crowdsourcing study to collect a corpus of descriptions of face images taken in the wild to gain a better understanding of the variation we find in face description and the possible issues that this may raise we also conducted an annotation study on a subset of the corpus primarily we found descriptions to refer to a mixture of attributes not only physical but also emotional and inferential which is bound to create further challenges for current imagetotext methods
|
[['the', 'past', 'few', 'years', 'have', 'witnessed', 'renewed', 'interest', 'in', 'nlp', 'tasks', 'at', 'the', 'interface', 'between', 'vision', 'and', 'language', 'one', 'intensivelystudied', 'problem', 'is', 'that', 'of', 'automatically', 'generating', 'text', 'from', 'images', 'in', 'this', 'paper', 'we', 'extend', 'this', 'problem', 'to', 'the', 'more', 'specific', 'domain', 'of', 'face', 'description', 'unlike', 'scene', 'descriptions', 'face', 'descriptions', 'are', 'more', 'finegrained', 'and', 'rely', 'on', 'attributes', 'extracted', 'from', 'the', 'image', 'rather', 'than', 'objects', 'and', 'relations', 'given', 'that', 'no', 'data', 'exists', 'for', 'this', 'task', 'we', 'present', 'an', 'ongoing', 'crowdsourcing', 'study', 'to', 'collect', 'a', 'corpus', 'of', 'descriptions', 'of', 'face', 'images', 'taken', 'in', 'the', 'wild', 'to', 'gain', 'a', 'better', 'understanding', 'of', 'the', 'variation', 'we', 'find', 'in', 'face', 'description', 'and', 'the', 'possible', 'issues', 'that', 'this', 'may', 'raise', 'we', 'also', 'conducted', 'an', 'annotation', 'study', 'on', 'a', 'subset', 'of', 'the', 'corpus', 'primarily', 'we', 'found', 'descriptions', 'to', 'refer', 'to', 'a', 'mixture', 'of', 'attributes', 'not', 'only', 'physical', 'but', 'also', 'emotional', 'and', 'inferential', 'which', 'is', 'bound', 'to', 'create', 'further', 'challenges', 'for', 'current', 'imagetotext', 'methods']]
|
[-0.052273444441304384, -0.008345240054088161, -0.07210904460811576, 0.0723322756802391, -0.1371718902539994, -0.10739396575402904, 0.03615958941533448, 0.4217312807797805, -0.2525400347378734, -0.3411007046506002, 0.0900207801522421, -0.30793418378762705, -0.14540835369874228, 0.22093964726724602, -0.1602801452088472, 0.007768705757123164, 0.11828597247685221, 0.06666858164690338, -0.06458242019137984, -0.2583143613845497, 0.3294935824172632, -0.003542216586904576, 0.30125536132821595, 0.0743284395430237, 0.09871773336418335, -0.048927663520051096, -0.06292260342652535, -0.00768672265475253, -0.10957272504920301, 0.20313119380160344, 0.3414226823377532, 0.22742608073167503, 0.29840715841145266, -0.4380923326568702, -0.2006062915149544, 0.10013509844883357, 0.14346454268647962, 0.13844819003700992, -0.06571583530291848, -0.3202455282247589, 0.09843537411894407, -0.16232512396300672, 0.006627580051177314, -0.09769182920519431, 0.055498118689223254, -0.07039177795802545, -0.22495146652958778, 0.0309968866062405, 0.09084767063583743, 0.12655449988374898, -0.05398301971628778, -0.09598038469852468, 0.03059311139143326, 0.1817715576541453, 0.08126087936379209, 0.052991882725558305, 0.10557589199781031, -0.2399096837835749, -0.12414882797143095, 0.40950347647651447, 0.003936508617060737, -0.21517513425682078, 0.23342840488419517, -0.10304111235944385, -0.1765052806858167, 0.08705961904730405, 0.22822622441408502, 0.10960726021462447, -0.18599510611966252, -0.009463149983535655, -0.09138307536274871, 0.21918565028818784, 0.06520482424235383, 0.02375553196293072, 0.22008310682321716, 0.20513623639602552, 0.016345559010076543, 0.14604897965229563, -0.07566445619895958, -0.03729481018464347, -0.2448773355066002, -0.11148019248578854, -0.16660906444001314, -0.009014677906362793, -0.03346617838816472, -0.15181977023346374, 0.3917282854702759, 0.2549085243063255, 0.23222648530182513, 0.041493408763690474, 0.29484869898584154, 0.022910519010181745, 0.08805340726545395, 0.03305093171460518, 0.15274931665346655, -0.013094933495657253, 0.13473980082198977, -0.1349086214224324, 0.07880851635165126, 0.035368458779117505]
|
1,803.03828
|
Fire detection in a still image using colour information
|
Colour analysis is a crucial step in image-based fire detection algorithms.
Many of the proposed fire detection algorithms in a still image are prone to
false alarms caused by objects with a colour similar to fire. To design a
colour-based system with a better false alarm rate, a new
colour-differentiating conversion matrix, efficient on images of high colour
complexity, is proposed. The elements of this conversion matrix are obtained by
performing K-medoids clustering and Particle Swarm Optimisation procedures on a
fire sample image with a background of high fire-colour similarity. The
proposed conversion matrix is then used to construct two new fire colour
detection frameworks. The first detection method is a two-stage non-linear
image transformation framework, while the second is a direct transformation of
an image with the proposed conversion matrix. A performance comparison of the
proposed methods with alternate methods in the literature was carried out.
Experimental results indicate that the linear image transformation method
outperforms other methods regarding false alarm rate while the non-linear
two-stage image transformation method has the best performance on the F-score
metric and provides a better trade-off between missed detection and false alarm
rate.
|
eess.IV cs.CV
|
colour analysis is a crucial step in imagebased fire detection algorithms many of the proposed fire detection algorithms in a still image are prone to false alarms caused by objects with a colour similar to fire to design a colourbased system with a better false alarm rate a new colourdifferentiating conversion matrix efficient on images of high colour complexity is proposed the elements of this conversion matrix are obtained by performing kmedoids clustering and particle swarm optimisation procedures on a fire sample image with a background of high firecolour similarity the proposed conversion matrix is then used to construct two new fire colour detection frameworks the first detection method is a twostage nonlinear image transformation framework while the second is a direct transformation of an image with the proposed conversion matrix a performance comparison of the proposed methods with alternate methods in the literature was carried out experimental results indicate that the linear image transformation method outperforms other methods regarding false alarm rate while the nonlinear twostage image transformation method has the best performance on the fscore metric and provides a better tradeoff between missed detection and false alarm rate
|
[['colour', 'analysis', 'is', 'a', 'crucial', 'step', 'in', 'imagebased', 'fire', 'detection', 'algorithms', 'many', 'of', 'the', 'proposed', 'fire', 'detection', 'algorithms', 'in', 'a', 'still', 'image', 'are', 'prone', 'to', 'false', 'alarms', 'caused', 'by', 'objects', 'with', 'a', 'colour', 'similar', 'to', 'fire', 'to', 'design', 'a', 'colourbased', 'system', 'with', 'a', 'better', 'false', 'alarm', 'rate', 'a', 'new', 'colourdifferentiating', 'conversion', 'matrix', 'efficient', 'on', 'images', 'of', 'high', 'colour', 'complexity', 'is', 'proposed', 'the', 'elements', 'of', 'this', 'conversion', 'matrix', 'are', 'obtained', 'by', 'performing', 'kmedoids', 'clustering', 'and', 'particle', 'swarm', 'optimisation', 'procedures', 'on', 'a', 'fire', 'sample', 'image', 'with', 'a', 'background', 'of', 'high', 'firecolour', 'similarity', 'the', 'proposed', 'conversion', 'matrix', 'is', 'then', 'used', 'to', 'construct', 'two', 'new', 'fire', 'colour', 'detection', 'frameworks', 'the', 'first', 'detection', 'method', 'is', 'a', 'twostage', 'nonlinear', 'image', 'transformation', 'framework', 'while', 'the', 'second', 'is', 'a', 'direct', 'transformation', 'of', 'an', 'image', 'with', 'the', 'proposed', 'conversion', 'matrix', 'a', 'performance', 'comparison', 'of', 'the', 'proposed', 'methods', 'with', 'alternate', 'methods', 'in', 'the', 'literature', 'was', 'carried', 'out', 'experimental', 'results', 'indicate', 'that', 'the', 'linear', 'image', 'transformation', 'method', 'outperforms', 'other', 'methods', 'regarding', 'false', 'alarm', 'rate', 'while', 'the', 'nonlinear', 'twostage', 'image', 'transformation', 'method', 'has', 'the', 'best', 'performance', 'on', 'the', 'fscore', 'metric', 'and', 'provides', 'a', 'better', 'tradeoff', 'between', 'missed', 'detection', 'and', 'false', 'alarm', 'rate']]
|
[-0.04449899909532371, -0.03145837145812619, -0.08071032251439433, 0.04632229037691859, -0.06658359242484291, -0.16752920025325518, 0.08427586260330962, 0.4220160923135328, -0.19063570045004102, -0.3430579344623108, 0.11587194143732554, -0.28969938492778924, -0.19264501794408562, 0.19922667730195903, -0.1331079820631706, 0.1296696201625696, 0.0977334765657941, 0.030134488307088217, -0.07186243770287391, -0.30079328743282685, 0.22014376606812028, 0.10238163749826082, 0.36015527982740325, -0.017275282682137603, 0.1576507052907007, -0.02635476446154458, -0.08886389855847773, -0.0048338659330608045, -0.05292107104070694, 0.0984862733454607, 0.26730703443110465, 0.21942574512263008, 0.30437369723407987, -0.3440614947700483, -0.2177685731922851, 0.0878985056014573, 0.12470892274336136, 0.10230288128219941, -0.13939394418861062, -0.3268653532178042, 0.10391467883055931, -0.14161273694418847, 0.006742190094070232, -0.06752536820242816, -0.016040617133802833, -0.02083474940290932, -0.32026752283421417, 0.08966512925496531, 0.045041331069056625, 0.0314870671507843, -0.032661498613417786, -0.10889976950141879, 0.038676192528231346, 0.11064802102021318, 0.02776411976392797, 0.04971384018055223, 0.1645675261574302, -0.1541194691250913, -0.14799836483050852, 0.37547007149600603, -0.07253685707171903, -0.20797903224840722, 0.2020053493015052, -0.04727520635788096, -0.1246897291548134, 0.20734599547242707, 0.1835715715981465, 0.12454451194052842, -0.16055138727174478, -0.01749092554320591, 0.0213093005413031, 0.1948570974290054, 0.055758329909641614, -0.03593977166066055, 0.18117722350499652, 0.2385067703410428, 0.09212355964607807, 0.1200383743317674, -0.15719697454404283, -0.015403213586281748, -0.23131214251662505, -0.15190837025008302, -0.17383840646931625, -0.03662138488304682, -0.12759097606001576, -0.13319326267686693, 0.40727542855459803, 0.19030257353578953, 0.17098788612774832, 0.0663504529858325, 0.3795980677068075, 0.11066654510300686, 0.0872166542202591, 0.029120767947306184, 0.23053853413426972, 0.05018428049887471, 0.05414550872569151, -0.22650811998709228, 0.08285764026197981, 0.11222107484664252]
|
1,803.03829
|
Optically induced phonon blockade in an optomechanical system with
second-order nonlinearity
|
Quantum control of phonons has being become a focus of attention for
developing quantum technologies. Here, we propose a proposal to realize phonon
blockade in a quadratically coupled optomechanical system, where a strong
nonlinear interaction between photons and phonons can be induced by an external
field coherently driving the cavity, and the effective coupling strength is
tunable by adjusting the amplitude of the driving field. This optically induced
nonlinearity is different from standard methods for realization of phonon
blockade, where the nonlinearity is achieved by coupling the mechanical system
to superconducting qubits. We both analytically and numerically study the
phonon statistical properties via the steady-state solution of the second-order
correlation function, and find phonon blockade can be efficiently realized for
a large cooperativity of the system, which is achievable based on the optically
enhanced nonlinear coupling and high quality mechanical system.
|
quant-ph
|
quantum control of phonons has being become a focus of attention for developing quantum technologies here we propose a proposal to realize phonon blockade in a quadratically coupled optomechanical system where a strong nonlinear interaction between photons and phonons can be induced by an external field coherently driving the cavity and the effective coupling strength is tunable by adjusting the amplitude of the driving field this optically induced nonlinearity is different from standard methods for realization of phonon blockade where the nonlinearity is achieved by coupling the mechanical system to superconducting qubits we both analytically and numerically study the phonon statistical properties via the steadystate solution of the secondorder correlation function and find phonon blockade can be efficiently realized for a large cooperativity of the system which is achievable based on the optically enhanced nonlinear coupling and high quality mechanical system
|
[['quantum', 'control', 'of', 'phonons', 'has', 'being', 'become', 'a', 'focus', 'of', 'attention', 'for', 'developing', 'quantum', 'technologies', 'here', 'we', 'propose', 'a', 'proposal', 'to', 'realize', 'phonon', 'blockade', 'in', 'a', 'quadratically', 'coupled', 'optomechanical', 'system', 'where', 'a', 'strong', 'nonlinear', 'interaction', 'between', 'photons', 'and', 'phonons', 'can', 'be', 'induced', 'by', 'an', 'external', 'field', 'coherently', 'driving', 'the', 'cavity', 'and', 'the', 'effective', 'coupling', 'strength', 'is', 'tunable', 'by', 'adjusting', 'the', 'amplitude', 'of', 'the', 'driving', 'field', 'this', 'optically', 'induced', 'nonlinearity', 'is', 'different', 'from', 'standard', 'methods', 'for', 'realization', 'of', 'phonon', 'blockade', 'where', 'the', 'nonlinearity', 'is', 'achieved', 'by', 'coupling', 'the', 'mechanical', 'system', 'to', 'superconducting', 'qubits', 'we', 'both', 'analytically', 'and', 'numerically', 'study', 'the', 'phonon', 'statistical', 'properties', 'via', 'the', 'steadystate', 'solution', 'of', 'the', 'secondorder', 'correlation', 'function', 'and', 'find', 'phonon', 'blockade', 'can', 'be', 'efficiently', 'realized', 'for', 'a', 'large', 'cooperativity', 'of', 'the', 'system', 'which', 'is', 'achievable', 'based', 'on', 'the', 'optically', 'enhanced', 'nonlinear', 'coupling', 'and', 'high', 'quality', 'mechanical', 'system']]
|
[-0.1826637673872054, 0.22271051313754928, -0.034928645469671026, -0.00794914042897496, -0.04868497233837843, -0.20885406121122815, 0.04970068088154712, 0.39383545943456605, -0.2799822153153677, -0.26753192064715614, 0.016462732452390622, -0.2608340283755068, -0.14758348538943217, 0.2450952105990327, 0.01885809846460185, 0.053549537488014984, 0.014606202125271901, -0.034444832678963526, 0.007604379741910925, -0.16433058865120673, 0.29846036866313863, 0.03698201476701978, 0.3339246116571974, 0.07990010476056883, 0.13240214164454675, 0.0029863898959407147, 0.11872879160421154, 0.012604799983587036, -0.09749101889683, 0.11284388279780111, 0.22534837714497144, -0.029236574792666427, 0.30227720757933163, -0.426509688799897, -0.21845740999973623, 0.054180239776400387, 0.16654494884324836, 0.19909021334230556, -0.042104937120486075, -0.296725904658199, -0.006202255124688571, -0.16935801675794185, -0.07715674951765025, -0.10053473534987223, -0.012884427976616203, 0.017067994050523068, -0.30064239828510486, 0.061994553707723325, 0.030883198762510684, 0.061782281039982824, -0.011875202464838083, 0.01903875658605644, -0.0057373406226806185, 0.07702454927225486, -0.02214417963426297, 0.014453926782539867, 0.20227587410308262, -0.16322539452337892, -0.0999892346774796, 0.3561235947521232, -0.10903841064555954, -0.16756623727764855, 0.16255307354937895, -0.10149328073103589, -0.004912871963192596, 0.1275664484821894, 0.16722562233091776, 0.08101682939091102, -0.1772521177392638, 0.08436071577173136, 0.0546422237332197, 0.2174301741402002, 0.027949376977940508, 0.12683663323046046, 0.22136225538156556, 0.19438279165840106, 0.040923191881771626, 0.19370852210162642, -0.05427740382093355, -0.07168359331892314, -0.24622080659374912, -0.11735954020066676, -0.23619648488238454, 0.0781375868790882, -0.07875371494457202, -0.13359481844298066, 0.40249099728406956, 0.15717892903927053, 0.13608570339435594, -0.03589351070922608, 0.31094891439251443, 0.22460120809363557, 0.08207961753116431, 0.019465954289012027, 0.3723355270393774, 0.16896910061035966, 0.04392075727872075, -0.37337010558067113, 0.004092946518972147, 0.0005472566278532465]
|
1,803.0383
|
Evaluation of the Einstein's strength of difference schemes for some
chemical reaction-diffusion equations
|
In this paper we present a difference algebraic technique for the evaluation
of the Einstein's strength of a system of partial difference equations and
apply this technique to the comparative analysis of difference schemes for
chemical reaction-diffusion equations. In particular, we analyze
finite-difference schemes for the Murray, Fisher, Burgers and some other
reaction-diffusion equations, as well as mass balance PDEs of chromatography
from the point of view of their strength.
|
math.AP physics.chem-ph
|
in this paper we present a difference algebraic technique for the evaluation of the einsteins strength of a system of partial difference equations and apply this technique to the comparative analysis of difference schemes for chemical reactiondiffusion equations in particular we analyze finitedifference schemes for the murray fisher burgers and some other reactiondiffusion equations as well as mass balance pdes of chromatography from the point of view of their strength
|
[['in', 'this', 'paper', 'we', 'present', 'a', 'difference', 'algebraic', 'technique', 'for', 'the', 'evaluation', 'of', 'the', 'einsteins', 'strength', 'of', 'a', 'system', 'of', 'partial', 'difference', 'equations', 'and', 'apply', 'this', 'technique', 'to', 'the', 'comparative', 'analysis', 'of', 'difference', 'schemes', 'for', 'chemical', 'reactiondiffusion', 'equations', 'in', 'particular', 'we', 'analyze', 'finitedifference', 'schemes', 'for', 'the', 'murray', 'fisher', 'burgers', 'and', 'some', 'other', 'reactiondiffusion', 'equations', 'as', 'well', 'as', 'mass', 'balance', 'pdes', 'of', 'chromatography', 'from', 'the', 'point', 'of', 'view', 'of', 'their', 'strength']]
|
[-0.13195565835173642, -0.014054477241422449, -0.09593298085299985, 0.048826094965417205, -0.06370822085466768, -0.10040357179407562, 0.05590110599296168, 0.28079590366687623, -0.2876609503690686, -0.29003602344143603, 0.08780440538789012, -0.27686454436874813, -0.1717474999172347, 0.21457949398650922, -0.028260485056255544, 0.0962401834848736, 0.03842814015224576, -0.01125888273984726, -0.12169427018047177, -0.20834207799551743, 0.40473881464983735, -0.00416847009743963, 0.25059787249192594, 0.03183162489107677, 0.16012192371168307, -0.05809532508719713, -0.07951779220519321, 0.02517676003543394, -0.15169923787803521, 0.08601068436899888, 0.2500309666510605, 0.09436186136943954, 0.2769339566784246, -0.3968447024534856, -0.22838492268430335, 0.06648291113919445, 0.154543135953801, 0.16404858053262744, -0.06084570932601179, -0.27244358408663955, 0.04762990259166275, -0.17573197896459272, -0.16024898162909917, -0.0522871607914567, -0.0010166816945586885, 0.10947792301220553, -0.25936211944956866, 0.1283078757912985, 0.04895305306417867, 0.11525506780682397, -0.09034089414801981, -0.11257498561338122, -0.0007511250175801771, 0.0854890478309244, 0.03509966161301625, -0.0348111347494913, 0.06729430984705687, -0.09431733287471745, -0.09339059491176158, 0.4179567277963672, -0.10776418723897742, -0.27578389583421603, 0.18769571078675135, -0.08235034141689539, -0.11753082814892488, 0.08340242085978389, 0.21829003461836172, 0.16120722825372857, -0.1890261092422796, 0.06032299155070047, -0.022384079612259355, 0.14770169886303067, 0.06345963938427823, -0.0060274038064692705, 0.089795401639172, 0.18015877888870557, 0.052125207973378045, 0.10706466282801037, -0.04394524752029351, -0.15012360491922924, -0.3219366725800293, -0.21717965112599943, -0.10228878391374435, 0.039107444218825546, -0.09906988200299176, -0.17846521957378303, 0.375904010449137, 0.19219584190951927, 0.12318309991221343, 0.04635340045206249, 0.27756691456306726, 0.1580726150789165, -0.03528904799438481, -0.010699665286977376, 0.21657771866843437, 0.22060741831415465, 0.20329002834457371, -0.29155315539600063, 0.013319353938901, 0.15118154087769134]
|
1,803.03831
|
Graph-based Clustering under Differential Privacy
|
In this paper, we present the first differentially private clustering method
for arbitrary-shaped node clusters in a graph. This algorithm takes as input
only an approximate Minimum Spanning Tree (MST) $\mathcal{T}$ released under
weight differential privacy constraints from the graph. Then, the underlying
nonconvex clustering partition is successfully recovered from cutting optimal
cuts on $\mathcal{T}$. As opposed to existing methods, our algorithm is
theoretically well-motivated. Experiments support our theoretical findings.
|
cs.DS cs.LG
|
in this paper we present the first differentially private clustering method for arbitraryshaped node clusters in a graph this algorithm takes as input only an approximate minimum spanning tree mst mathcalt released under weight differential privacy constraints from the graph then the underlying nonconvex clustering partition is successfully recovered from cutting optimal cuts on mathcalt as opposed to existing methods our algorithm is theoretically wellmotivated experiments support our theoretical findings
|
[['in', 'this', 'paper', 'we', 'present', 'the', 'first', 'differentially', 'private', 'clustering', 'method', 'for', 'arbitraryshaped', 'node', 'clusters', 'in', 'a', 'graph', 'this', 'algorithm', 'takes', 'as', 'input', 'only', 'an', 'approximate', 'minimum', 'spanning', 'tree', 'mst', 'mathcalt', 'released', 'under', 'weight', 'differential', 'privacy', 'constraints', 'from', 'the', 'graph', 'then', 'the', 'underlying', 'nonconvex', 'clustering', 'partition', 'is', 'successfully', 'recovered', 'from', 'cutting', 'optimal', 'cuts', 'on', 'mathcalt', 'as', 'opposed', 'to', 'existing', 'methods', 'our', 'algorithm', 'is', 'theoretically', 'wellmotivated', 'experiments', 'support', 'our', 'theoretical', 'findings']]
|
[-0.07874987738739167, -0.022984099416186968, -0.12135743237366634, 0.1017549304424652, -0.1427868697492938, -0.12686983652279846, 0.11943429329133193, 0.39749388493530985, -0.3452013730204531, -0.32737237831045474, 0.08150893910455384, -0.2682177571313722, -0.18102564687973688, 0.13455647568750595, -0.07640895638614893, 0.12571698701940476, 0.10180749032380325, 0.05552601476332971, 0.006220610705869539, -0.303887917917122, 0.287774163564401, 0.048784453089215925, 0.29375324049698454, 0.0035526175808627157, 0.10600547617900052, 0.03231448059502457, -0.027391976903059653, 0.07285896765201219, -0.16466075676892486, 0.08874442305033362, 0.29835560949785367, 0.23343486158576396, 0.253123254807932, -0.39679273585123676, -0.16604240142873355, 0.11723524692268776, 0.16450100259057113, 0.12607231592493398, -0.05695871870598889, -0.24480909439069884, 0.12615727216138373, -0.1197007056192628, -0.0037053905028317656, -0.06439530717075935, -0.02791540262987837, -0.028156574980987767, -0.3230256728295769, 0.033094037367430114, 0.036256521906969805, -0.0056284542195498945, -0.049113288694726566, -0.1589500429374831, -0.03068870024622551, 0.0715369919414765, -0.01486292094424633, 0.0785402732701706, 0.1166883944001581, -0.08353572917569961, -0.17609109208653015, 0.3663433216512203, -0.019203788742223487, -0.18055664371433003, 0.10302053133824042, -0.021147962749403504, -0.22981260471445109, 0.11899185159376689, 0.2183221973412271, 0.1609546550682613, -0.16895269070352828, 0.12363672776679907, -0.11877798364231629, 0.12718926250402415, 0.06420112769452056, -0.030452944065577216, 0.14688625814659254, 0.21611392077590738, 0.16457113526828054, 0.20085480923963978, -0.05608970209889646, -0.07358048759134753, -0.2966768188651518, -0.059457922846611055, -0.24813914727419614, -0.01839567313769034, -0.17509763441048562, -0.16014959840103984, 0.3862085776935731, 0.1748512674123049, 0.2336582850465285, 0.14137154620672976, 0.3909397264011204, 0.07178509317870652, 0.043547042539077145, 0.1515750751298453, 0.14077562945229666, 0.09619196328733648, 0.03970697260062609, -0.16283004297874867, 0.10634905270708259, 0.082165787635105]
|
1,803.03832
|
Viscosity Solution for Optimal Stopping Problems of Feller Processes
|
We study an optimal stopping problem when the state process is governed by a
general Feller process. In particular, we examine viscosity properties of the
associated value function with no a priori assumption on the stochastic
differential equation satisfied by the state process. Our approach relies on
properties of the Feller semigroup. We present conditions on the state process
under which the value function is the unique viscosity solution to an
Hamilton-Jacobi-Bellman (HJB) equation associated with a particular operator.
More specifically, assuming that the state process is a Feller process, we
prove uniqueness of the viscosity solution which was conjectured in [26]. We
then apply our results to study viscosity property of optimal stopping problems
for some particular Feller processes, namely diffusion processes with piecewise
coefficients and semi-Markov processes. Finally, we obtain explicit value
functions for optimal stopping of straddle options, when the state process is a
reflected Brownian motion, Brownian motion with jump at boundary and regime
switching Feller diffusion, respectively (see Section 8).
|
math.OC
|
we study an optimal stopping problem when the state process is governed by a general feller process in particular we examine viscosity properties of the associated value function with no a priori assumption on the stochastic differential equation satisfied by the state process our approach relies on properties of the feller semigroup we present conditions on the state process under which the value function is the unique viscosity solution to an hamiltonjacobibellman hjb equation associated with a particular operator more specifically assuming that the state process is a feller process we prove uniqueness of the viscosity solution which was conjectured in 26 we then apply our results to study viscosity property of optimal stopping problems for some particular feller processes namely diffusion processes with piecewise coefficients and semimarkov processes finally we obtain explicit value functions for optimal stopping of straddle options when the state process is a reflected brownian motion brownian motion with jump at boundary and regime switching feller diffusion respectively see section 8
|
[['we', 'study', 'an', 'optimal', 'stopping', 'problem', 'when', 'the', 'state', 'process', 'is', 'governed', 'by', 'a', 'general', 'feller', 'process', 'in', 'particular', 'we', 'examine', 'viscosity', 'properties', 'of', 'the', 'associated', 'value', 'function', 'with', 'no', 'a', 'priori', 'assumption', 'on', 'the', 'stochastic', 'differential', 'equation', 'satisfied', 'by', 'the', 'state', 'process', 'our', 'approach', 'relies', 'on', 'properties', 'of', 'the', 'feller', 'semigroup', 'we', 'present', 'conditions', 'on', 'the', 'state', 'process', 'under', 'which', 'the', 'value', 'function', 'is', 'the', 'unique', 'viscosity', 'solution', 'to', 'an', 'hamiltonjacobibellman', 'hjb', 'equation', 'associated', 'with', 'a', 'particular', 'operator', 'more', 'specifically', 'assuming', 'that', 'the', 'state', 'process', 'is', 'a', 'feller', 'process', 'we', 'prove', 'uniqueness', 'of', 'the', 'viscosity', 'solution', 'which', 'was', 'conjectured', 'in', '26', 'we', 'then', 'apply', 'our', 'results', 'to', 'study', 'viscosity', 'property', 'of', 'optimal', 'stopping', 'problems', 'for', 'some', 'particular', 'feller', 'processes', 'namely', 'diffusion', 'processes', 'with', 'piecewise', 'coefficients', 'and', 'semimarkov', 'processes', 'finally', 'we', 'obtain', 'explicit', 'value', 'functions', 'for', 'optimal', 'stopping', 'of', 'straddle', 'options', 'when', 'the', 'state', 'process', 'is', 'a', 'reflected', 'brownian', 'motion', 'brownian', 'motion', 'with', 'jump', 'at', 'boundary', 'and', 'regime', 'switching', 'feller', 'diffusion', 'respectively', 'see', 'section', '8']]
|
[-0.08087754400489344, 0.07260133376165123, -0.10743307432046893, 0.05328149933399497, -0.10288794733104155, -0.11944720643770063, 0.05830726813609627, 0.3817831931466406, -0.3582978924002611, -0.18132451687741913, 0.16783252359389073, -0.2789077472365038, -0.1232352284319473, 0.1704808882522312, -0.04564881375708589, 0.11097136740572751, 0.08437787226090829, 0.008021213644833276, -0.008064247299493715, -0.19831649419766936, 0.3859195419530751, 0.024142312553400793, 0.2559638419216781, 0.040262262600431725, 0.19875406754682912, -0.010602607281709258, 0.0241716857519791, -0.023451569547989604, -0.21639493506875376, 0.015575103277594529, 0.18709362805256563, 0.062220756663538684, 0.2968198689547452, -0.39691932389907764, -0.18272923750407769, 0.12201992685502663, 0.07741530669666122, 0.059283811385940875, -0.049998558964315716, -0.28167357085216227, 0.050118615845161855, -0.11336612783118405, -0.16608399845038851, -0.03897522928926981, 0.053890815030106086, 0.03980542197964634, -0.3697951384650713, 0.11545686914345644, 0.1093536689101408, 0.0006729226305403493, -0.11026701027541562, -0.0906746795041148, -0.017263569121220797, 0.044833596901982235, 0.0634384842972257, -0.03204293093559417, 0.1353672025838133, -0.14867590390935992, -0.14449642954789327, 0.301189752916495, -0.11098748562243682, -0.2822476825930855, 0.18160427888206235, -0.1705310670108619, -0.12815492829928796, 0.16068242221054704, 0.14968095359323674, 0.17928398600779474, -0.2291977917784331, 0.11602374595999153, -0.021417820864977937, 0.13265710727057672, 0.038702619405971334, -0.011360008169713458, 0.07065181272725264, 0.18016103381206366, 0.1519136570168264, 0.17378091163735723, 0.0030207444285748133, -0.16548796156139084, -0.3588636385756686, -0.18907413174906237, -0.13904993860333253, 0.1307788156734949, -0.12517021167159054, -0.16054348171208843, 0.3004735805122464, 0.16638214188543232, 0.1774685495815268, 0.08624216687978443, 0.17453487472552243, 0.2591468146564721, -0.08984986442700381, 0.11011055203888452, 0.1832588043157364, 0.16207835362469214, 0.1360207700057689, -0.23163277038062613, 0.1625657413013731, 0.14175082183245458]
|
1,803.03833
|
Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral
Clustering
|
We introduce submodular hypergraphs, a family of hypergraphs that have
different submodular weights associated with different cuts of hyperedges.
Submodular hypergraphs arise in clustering applications in which higher-order
structures carry relevant information. For such hypergraphs, we define the
notion of p-Laplacians and derive corresponding nodal domain theorems and k-way
Cheeger inequalities. We conclude with the description of algorithms for
computing the spectra of 1- and 2-Laplacians that constitute the basis of new
spectral hypergraph clustering methods.
|
cs.LG cs.DM cs.DS cs.SI
|
we introduce submodular hypergraphs a family of hypergraphs that have different submodular weights associated with different cuts of hyperedges submodular hypergraphs arise in clustering applications in which higherorder structures carry relevant information for such hypergraphs we define the notion of plaplacians and derive corresponding nodal domain theorems and kway cheeger inequalities we conclude with the description of algorithms for computing the spectra of 1 and 2laplacians that constitute the basis of new spectral hypergraph clustering methods
|
[['we', 'introduce', 'submodular', 'hypergraphs', 'a', 'family', 'of', 'hypergraphs', 'that', 'have', 'different', 'submodular', 'weights', 'associated', 'with', 'different', 'cuts', 'of', 'hyperedges', 'submodular', 'hypergraphs', 'arise', 'in', 'clustering', 'applications', 'in', 'which', 'higherorder', 'structures', 'carry', 'relevant', 'information', 'for', 'such', 'hypergraphs', 'we', 'define', 'the', 'notion', 'of', 'plaplacians', 'and', 'derive', 'corresponding', 'nodal', 'domain', 'theorems', 'and', 'kway', 'cheeger', 'inequalities', 'we', 'conclude', 'with', 'the', 'description', 'of', 'algorithms', 'for', 'computing', 'the', 'spectra', 'of', '1', 'and', '2laplacians', 'that', 'constitute', 'the', 'basis', 'of', 'new', 'spectral', 'hypergraph', 'clustering', 'methods']]
|
[-0.11854269940406084, 0.018778938736456138, -0.07055686897287766, 0.11619917795062065, -0.10538755763942996, -0.16193194732690852, 0.011404092082132895, 0.38990408562899875, -0.3014561277658989, -0.32268866982931893, 0.04476570257451385, -0.2824508542815844, -0.13633768456677595, 0.11109215850941837, -0.08397368240480621, 0.07642020687460899, 0.08778624053423603, -0.008169624830285709, -0.04707856309910615, -0.22662659643528363, 0.3984537398815155, -0.061322568142786624, 0.2180930744546155, 0.10025955125689506, 0.024720304226114726, 0.03606020046398044, -0.06693549764032165, 0.10418244254464905, -0.2547570555356409, 0.21208760250359773, 0.32632979832589626, 0.250109984750549, 0.28289839704831443, -0.3755353370557229, -0.16996734584371248, 0.20371558357030153, 0.11607717974732319, 0.06884561814522992, 0.009097461078005532, -0.22078830420970916, 0.08814678489541014, -0.12647820204496385, -0.04386723887485763, -0.12871860224443177, 0.0026155054072539013, 0.10766569224496682, -0.28699287892629705, 0.04313237536077698, 0.12298754078646501, 0.03549523105379194, -0.031111351003249486, -0.21900188555940986, -0.0016530001380791266, 0.033154480972637734, -0.04937932297587395, -0.01683459512423724, 0.07315856855362654, -0.12604568526148796, -0.24688533930728832, 0.33772931035840886, -0.007953494585429629, -0.18790102798491717, 0.10685729756951332, -0.06845511267582575, -0.2734127458060781, 0.10218099996447563, 0.20944317393004894, 0.1915069364166508, -0.09841749402383963, 0.10454022532096133, -0.1291651411789159, 0.048856966458261014, 0.13063729126006365, 0.16708222728222608, 0.12336215853691102, 0.1000161390627424, 0.17642244146826366, 0.2185632783205559, -0.01263137508261328, -0.05161554727703333, -0.26911228060722353, -0.0894621547156324, -0.2169510935495297, 0.010284632596497735, -0.2178415796806803, -0.2519023129468163, 0.43611331162353356, 0.13194371114174525, 0.19779717036212485, 0.16162964441037425, 0.19388525674430032, 0.0910622665596505, 0.06142648828526338, 0.1202503360187014, 0.1353870914845417, 0.206502416630586, 0.02911634767583261, -0.09348731711506844, 0.008163088423510392, 0.11353176805501183]
|
1,803.03834
|
Learning and analyzing vector encoding of symbolic representations
|
We present a formal language with expressions denoting general symbol
structures and queries which access information in those structures. A
sequence-to-sequence network processing this language learns to encode symbol
structures and query them. The learned representation (approximately) shares a
simple linearity property with theoretical techniques for performing this task.
|
cs.AI
|
we present a formal language with expressions denoting general symbol structures and queries which access information in those structures a sequencetosequence network processing this language learns to encode symbol structures and query them the learned representation approximately shares a simple linearity property with theoretical techniques for performing this task
|
[['we', 'present', 'a', 'formal', 'language', 'with', 'expressions', 'denoting', 'general', 'symbol', 'structures', 'and', 'queries', 'which', 'access', 'information', 'in', 'those', 'structures', 'a', 'sequencetosequence', 'network', 'processing', 'this', 'language', 'learns', 'to', 'encode', 'symbol', 'structures', 'and', 'query', 'them', 'the', 'learned', 'representation', 'approximately', 'shares', 'a', 'simple', 'linearity', 'property', 'with', 'theoretical', 'techniques', 'for', 'performing', 'this', 'task']]
|
[-0.12172839446207129, -0.03459840437055242, -0.09059137573503719, 0.11816630396060646, -0.22898502254440467, -0.22810998316664172, 0.07130210775863, 0.4517883374830898, -0.3672348566505374, -0.2921013845777025, 0.01166992083106342, -0.28341145334499224, -0.2049163652165812, 0.14038693771830626, -0.11792168217920224, 0.08372290565499238, 0.10534340048170819, 0.12609942793389972, -0.12207373047285543, -0.2328271704098704, 0.26159949893397944, 0.04903940489629702, 0.2844589528418621, -0.08042318034651023, 0.13407620212671403, 0.0069103160117543775, -0.03916173204019362, -0.06314323671703816, -0.1068261672685645, 0.2323673466714669, 0.38272778197590795, 0.23281714879926674, 0.26996863344494176, -0.40730834098494784, -0.20915627665817738, 0.02644182623326018, 0.10214366119507017, 0.1159846445198684, -0.013426142383594903, -0.3288682252928919, 0.12178496451934381, -0.1796352533975198, 0.054393825938507, -0.12853350653788265, 0.00452567153249164, -0.05643693747341025, -0.3183945342090589, -0.04684084399166156, 0.14511700875448938, 0.11144610058174145, -0.018929537723068983, -0.03203993465285748, 0.06761047236231744, 0.16317925285738039, -0.033906485676309286, 0.06062750603614033, 0.12410436866196747, -0.12890223979151674, -0.20545333970993834, 0.39288608897097255, -0.001193107709250584, -0.26397260879071394, 0.14653317468735028, -0.06750808873365881, -0.20397491262731504, 0.07256544620863029, 0.15431649732042332, 0.06494213100902889, -0.16335684425026484, 0.07074375380999504, -0.04228143255245321, 0.22964538839094492, 0.1366034946689496, 0.09616517574569135, 0.19562381084020042, 0.18781554506977602, -0.034510037738221644, 0.1332062240689993, -0.0013363141886063147, -0.06521257237360185, -0.2194150904079481, -0.11543922875152558, -0.1557074343709617, -0.024261161076779267, -0.13075466825548387, -0.16671380020525992, 0.4113914403228127, 0.1404540500014412, 0.21189255618053127, 0.21404086095423494, 0.33688867646649634, 0.06466778474194664, 0.11963419977347461, 0.14085724031699973, -0.0017487897171771952, 0.060433090721466104, 0.16202462235541673, -0.09173544413381618, 0.10631328970859093, 0.0758943587009396]
|
1,803.03835
|
Kickstarting Deep Reinforcement Learning
|
We present a method for using previously-trained 'teacher' agents to
kickstart the training of a new 'student' agent. To this end, we leverage ideas
from policy distillation and population based training. Our method places no
constraints on the architecture of the teacher or student agents, and it
regulates itself to allow the students to surpass their teachers in
performance. We show that, on a challenging and computationally-intensive
multi-task benchmark (DMLab-30), kickstarted training improves the data
efficiency of new agents, making it significantly easier to iterate on their
design. We also show that the same kickstarting pipeline can allow a single
student agent to leverage multiple 'expert' teachers which specialize on
individual tasks. In this setting kickstarting yields surprisingly large gains,
with the kickstarted agent matching the performance of an agent trained from
scratch in almost 10x fewer steps, and surpassing its final performance by 42
percent. Kickstarting is conceptually simple and can easily be incorporated
into reinforcement learning experiments.
|
cs.LG
|
we present a method for using previouslytrained teacher agents to kickstart the training of a new student agent to this end we leverage ideas from policy distillation and population based training our method places no constraints on the architecture of the teacher or student agents and it regulates itself to allow the students to surpass their teachers in performance we show that on a challenging and computationallyintensive multitask benchmark dmlab30 kickstarted training improves the data efficiency of new agents making it significantly easier to iterate on their design we also show that the same kickstarting pipeline can allow a single student agent to leverage multiple expert teachers which specialize on individual tasks in this setting kickstarting yields surprisingly large gains with the kickstarted agent matching the performance of an agent trained from scratch in almost 10x fewer steps and surpassing its final performance by 42 percent kickstarting is conceptually simple and can easily be incorporated into reinforcement learning experiments
|
[['we', 'present', 'a', 'method', 'for', 'using', 'previouslytrained', 'teacher', 'agents', 'to', 'kickstart', 'the', 'training', 'of', 'a', 'new', 'student', 'agent', 'to', 'this', 'end', 'we', 'leverage', 'ideas', 'from', 'policy', 'distillation', 'and', 'population', 'based', 'training', 'our', 'method', 'places', 'no', 'constraints', 'on', 'the', 'architecture', 'of', 'the', 'teacher', 'or', 'student', 'agents', 'and', 'it', 'regulates', 'itself', 'to', 'allow', 'the', 'students', 'to', 'surpass', 'their', 'teachers', 'in', 'performance', 'we', 'show', 'that', 'on', 'a', 'challenging', 'and', 'computationallyintensive', 'multitask', 'benchmark', 'dmlab30', 'kickstarted', 'training', 'improves', 'the', 'data', 'efficiency', 'of', 'new', 'agents', 'making', 'it', 'significantly', 'easier', 'to', 'iterate', 'on', 'their', 'design', 'we', 'also', 'show', 'that', 'the', 'same', 'kickstarting', 'pipeline', 'can', 'allow', 'a', 'single', 'student', 'agent', 'to', 'leverage', 'multiple', 'expert', 'teachers', 'which', 'specialize', 'on', 'individual', 'tasks', 'in', 'this', 'setting', 'kickstarting', 'yields', 'surprisingly', 'large', 'gains', 'with', 'the', 'kickstarted', 'agent', 'matching', 'the', 'performance', 'of', 'an', 'agent', 'trained', 'from', 'scratch', 'in', 'almost', '10x', 'fewer', 'steps', 'and', 'surpassing', 'its', 'final', 'performance', 'by', '42', 'percent', 'kickstarting', 'is', 'conceptually', 'simple', 'and', 'can', 'easily', 'be', 'incorporated', 'into', 'reinforcement', 'learning', 'experiments']]
|
[0.012421609852865983, 0.026587055940184748, -0.10407834113142692, 0.04405142598746655, -0.17410515133554164, -0.2095786016389656, 0.13951940215282285, 0.45869698584414065, -0.24880256902617523, -0.36698252816374105, 0.028860792275130127, -0.2477370398477293, -0.1568723262342899, 0.21537006455204952, -0.1603132274795849, 0.02934024881725259, 0.16909972604853699, 0.06647073906526949, -0.016348775806060683, -0.3829182993071393, 0.27434956153574136, 0.08198211435079336, 0.29231078148586676, 0.0038680678848415995, 0.15878865787034066, -0.02726171254657973, 0.03132197767561779, -0.028148571071095575, -0.04034835508868221, 0.1596207636604772, 0.3152863552020743, 0.23034117904563362, 0.37255258701789457, -0.42776168162564343, -0.13400857902627486, 0.07072401599128707, 0.11227212015849848, 0.11467810781920353, -0.01602165782465958, -0.3325221329339398, 0.06529895472788037, -0.20205060937531436, 0.003276996926452296, -0.12975346015987155, -0.09331372565177914, -0.024603589879683196, -0.30980196304899904, -0.02511400483770278, 0.08846792145721757, 0.06040338930996278, -0.050036030487927534, -0.16071295726877183, 0.02786082116057141, 0.20185919455103338, 0.020553412980800018, 0.032096077902958944, 0.1818607501202048, -0.1840304464657003, -0.1506914921457139, 0.333185719129128, -0.045873647660184175, -0.18025751622059408, 0.22691922220670116, -0.06967025603919935, -0.1317687940258437, 0.08689806040657015, 0.27005212080294794, 0.10513298607801493, -0.15571473639171857, -0.0023869407629647935, -0.01907354527606796, 0.2103923970224479, 0.025301206537570137, -0.059781588499810405, 0.1464501955801657, 0.2416329327522992, 0.08384746747712295, 0.13569049731207392, -0.03780834310544798, -0.0897273820084639, -0.2115608844163571, -0.14636667150532445, -0.18826899342000103, 0.027699220525578428, -0.10395838369349338, -0.07885820791684986, 0.38038510176090473, 0.2437335584903709, 0.18085378133773936, 0.1460559598046343, 0.3263719799832847, 0.029295074128850292, 0.1277412740030111, 0.13536380191679853, 0.22652547280095184, -0.03837156521293741, 0.13589224295738417, -0.18627002080663657, 0.11480474476971161, -0.012977281662945947]
|
1,803.03836
|
Large values of Dirichlet $L$- functions inside the critical strip
|
In the present paper, we study large values of Dirichlet $L$- functions
inside the critical strip. For every $1/2<\sigma<1$, we show that for $q$
sufficiently large, there exists a non-principal character $\chi$ modulo $q$
and a constant $c(\sigma)>0$ such that $\log \vert L(\sigma,\chi)\vert \gg
c(\sigma)(\log q)^{1-\sigma}(\log\log q)^{-\sigma}$. This matches the believed
prediction for these values which was previously known only for the Riemann
zeta function since Montgomery, or conditionally on GRH for quadratic $L$-
functions due to Lamzouri. In a recent work involving the author, a new
implementation of the resonance method was presented in order to exhibit large
values of the Riemann zeta function on the line $\Re(s)=1$. We show how to
adapt the argument to our setting.
|
math.NT
|
in the present paper we study large values of dirichlet l functions inside the critical strip for every 12sigma1 we show that for q sufficiently large there exists a nonprincipal character chi modulo q and a constant csigma0 such that log vert lsigmachivert gg csigmalog q1sigmaloglog qsigma this matches the believed prediction for these values which was previously known only for the riemann zeta function since montgomery or conditionally on grh for quadratic l functions due to lamzouri in a recent work involving the author a new implementation of the resonance method was presented in order to exhibit large values of the riemann zeta function on the line res1 we show how to adapt the argument to our setting
|
[['in', 'the', 'present', 'paper', 'we', 'study', 'large', 'values', 'of', 'dirichlet', 'l', 'functions', 'inside', 'the', 'critical', 'strip', 'for', 'every', '12sigma1', 'we', 'show', 'that', 'for', 'q', 'sufficiently', 'large', 'there', 'exists', 'a', 'nonprincipal', 'character', 'chi', 'modulo', 'q', 'and', 'a', 'constant', 'csigma0', 'such', 'that', 'log', 'vert', 'lsigmachivert', 'gg', 'csigmalog', 'q1sigmaloglog', 'qsigma', 'this', 'matches', 'the', 'believed', 'prediction', 'for', 'these', 'values', 'which', 'was', 'previously', 'known', 'only', 'for', 'the', 'riemann', 'zeta', 'function', 'since', 'montgomery', 'or', 'conditionally', 'on', 'grh', 'for', 'quadratic', 'l', 'functions', 'due', 'to', 'lamzouri', 'in', 'a', 'recent', 'work', 'involving', 'the', 'author', 'a', 'new', 'implementation', 'of', 'the', 'resonance', 'method', 'was', 'presented', 'in', 'order', 'to', 'exhibit', 'large', 'values', 'of', 'the', 'riemann', 'zeta', 'function', 'on', 'the', 'line', 'res1', 'we', 'show', 'how', 'to', 'adapt', 'the', 'argument', 'to', 'our', 'setting']]
|
[-0.1654962119464155, 0.07940300888503375, -0.06655068566172344, 0.07610303040330663, -0.08039635487062775, -0.1392082850286818, 0.04988204329780748, 0.31635484418467336, -0.23289028995305947, -0.26741062074737704, 0.08083456558398093, -0.24239390790462495, -0.16651150940553003, 0.23790144321670675, -0.044575969020471624, 0.06455422369497525, 0.0375410634578894, 0.06378752526057803, -0.05440786614123246, -0.26625912363018395, 0.3613013926769465, -0.015315291285514832, 0.19949090537696104, 0.08896677999797722, 0.063043503989668, 0.018889145030761542, 0.019333960150328018, -0.042881422923148976, -0.18241007983666824, 0.08221823805538209, 0.24756226404772505, 0.0540459719122104, 0.2711426009869446, -0.33200131723044807, -0.15883195588527166, 0.1556571122592963, 0.12345963958650827, 0.013973861696886952, -0.0008128036684154168, -0.21051110928149327, 0.1501932526341356, -0.13546096314878567, -0.13967774042900166, -0.07431853258901316, 0.10071842922707615, 0.019300609574977146, -0.3224505077318653, 0.048420314741847305, 0.08532013927140962, 0.04747681490591039, -0.053697754009424344, -0.18940353969354992, 0.04738029592832469, 0.05301636251944886, 0.08881658205924475, 0.11394667222933924, 0.04151523358988292, -0.12300011135597268, -0.07225254872489882, 0.31137096621096133, -0.0906603005643853, -0.20773887985750386, 0.15874146234406078, -0.19016540647362884, -0.1818232979423002, 0.08298008778415944, 0.1287007986324961, 0.1805486072624183, -0.023908866735418206, 0.1581087046641978, -0.10618246738677439, 0.18205080444965024, 0.10577749481991582, -0.06272179282310864, 0.15044694440844267, 0.0503523534629494, 0.03416532674075469, 0.1380316007801372, -0.07661559917437641, -0.04363201114794482, -0.3506667909576841, -0.1909293100905969, -0.2098338183015585, 0.08226326268227042, -0.07025390029264837, -0.2083182626221653, 0.3452794572257477, 0.1301639070066259, 0.24375374029269037, 0.12919166399186235, 0.2142553693037885, 0.15806323841072456, 0.1047320769381021, 0.08679335458285135, 0.16283099223738132, 0.12390288740963391, 0.047409638867754005, -0.17371012123463594, 0.05597877426012217, 0.11023638601941259]
|
1,803.03837
|
Sample-Relaxed Two-Dimensional Color Principal Component Analysis for
Face Recognition and Image Reconstruction
|
A sample-relaxed two-dimensional color principal component analysis
(SR-2DCPCA) approach is presented for face recognition and image reconstruction
based on quaternion models. A relaxation vector is automatically generated
according to the variances of training color face images with the same label. A
sample-relaxed, low-dimensional covariance matrix is constructed based on all
the training samples relaxed by a relaxation vector, and its eigenvectors
corresponding to the $r$ largest eigenvalues are defined as the optimal
projection. The SR-2DCPCA aims to enlarge the global variance rather than to
maximize the variance of the projected training samples. The numerical results
based on real face data sets validate that SR-2DCPCA has a higher recognition
rate than state-of-the-art methods and is efficient in image reconstruction.
|
cs.CV
|
a samplerelaxed twodimensional color principal component analysis sr2dcpca approach is presented for face recognition and image reconstruction based on quaternion models a relaxation vector is automatically generated according to the variances of training color face images with the same label a samplerelaxed lowdimensional covariance matrix is constructed based on all the training samples relaxed by a relaxation vector and its eigenvectors corresponding to the r largest eigenvalues are defined as the optimal projection the sr2dcpca aims to enlarge the global variance rather than to maximize the variance of the projected training samples the numerical results based on real face data sets validate that sr2dcpca has a higher recognition rate than stateoftheart methods and is efficient in image reconstruction
|
[['a', 'samplerelaxed', 'twodimensional', 'color', 'principal', 'component', 'analysis', 'sr2dcpca', 'approach', 'is', 'presented', 'for', 'face', 'recognition', 'and', 'image', 'reconstruction', 'based', 'on', 'quaternion', 'models', 'a', 'relaxation', 'vector', 'is', 'automatically', 'generated', 'according', 'to', 'the', 'variances', 'of', 'training', 'color', 'face', 'images', 'with', 'the', 'same', 'label', 'a', 'samplerelaxed', 'lowdimensional', 'covariance', 'matrix', 'is', 'constructed', 'based', 'on', 'all', 'the', 'training', 'samples', 'relaxed', 'by', 'a', 'relaxation', 'vector', 'and', 'its', 'eigenvectors', 'corresponding', 'to', 'the', 'r', 'largest', 'eigenvalues', 'are', 'defined', 'as', 'the', 'optimal', 'projection', 'the', 'sr2dcpca', 'aims', 'to', 'enlarge', 'the', 'global', 'variance', 'rather', 'than', 'to', 'maximize', 'the', 'variance', 'of', 'the', 'projected', 'training', 'samples', 'the', 'numerical', 'results', 'based', 'on', 'real', 'face', 'data', 'sets', 'validate', 'that', 'sr2dcpca', 'has', 'a', 'higher', 'recognition', 'rate', 'than', 'stateoftheart', 'methods', 'and', 'is', 'efficient', 'in', 'image', 'reconstruction']]
|
[-0.03229584813053752, 0.011963527622544367, -0.07203336190111165, 0.06288643702382929, -0.09442533962910288, -0.11786811241623142, -0.018019220408389408, 0.4073032846610094, -0.24320937405693635, -0.2582373578695516, 0.145692511890204, -0.294787615457357, -0.12910874076348183, 0.17067655625528302, -0.10804421862523103, 0.09958271150277016, 0.11089911152496292, 0.0823630511877127, -0.13805167356722764, -0.30823380823632507, 0.28518668749843373, 0.052118938376099384, 0.36808873973947404, -0.05835896399642887, 0.13944539925232047, 0.0025997030988319553, -0.04531516477160541, -0.004033757510742048, -0.05764056088088997, 0.18183415957349192, 0.25703486144394794, 0.19087812915476488, 0.27494785547706074, -0.3575039430730173, -0.1640934833879422, 0.11521671029361735, 0.12882318060668507, 0.10106746494320445, -0.03823245662678001, -0.31232627200219654, 0.15381966666960767, -0.07525740618464248, -0.004698361262101038, -0.09752967749955133, 0.0063557592953218086, -0.025927724991122197, -0.335601458462469, 0.08486205007246664, 0.053950584003830265, 0.08365320368541469, -0.09022660195076806, -0.18074059166849174, -0.03680739350263672, 0.1211904135918052, 0.033536772364108215, 0.06071033800052929, 0.1513192654780016, -0.12928190972688125, -0.12320431718474319, 0.3758463472416946, -0.0481260326695488, -0.254151265554387, 0.16007944329537388, -0.09121090895195234, -0.06184919430986689, 0.14948864258496605, 0.22084080856614585, 0.12001922437600021, -0.15256321985989102, 0.04989719705441405, -0.05729304705264753, 0.17016607042450202, 0.012481571821463776, -0.037367019742117105, 0.13997523442858123, 0.189633294530534, 0.09907042881843217, 0.13989311957266182, -0.15862727601629087, -0.0393745915217582, -0.2369182415964917, -0.10533143015144843, -0.301410089844059, -0.013888167766332305, -0.1438273698055629, -0.15632498015324456, 0.44319183863538864, 0.17630403048101942, 0.2559220541975108, 0.09714163240478856, 0.3501471168098666, 0.07935192167722813, 0.1280742824711869, 0.07393145210768, 0.16548865047034583, 0.10559402739956317, 0.029549752141284788, -0.20875678092676841, 0.0650774404599235, 0.10632467820260931]
|
1,803.03838
|
Search for a heavy resonance decaying into a Z boson and a vector boson
in the $\nu\overline{\nu}\mathrm{q}\overline{\mathrm{q}}$ final state
|
A search is presented for a heavy resonance decaying into either a pair of Z
bosons or a Z boson and a W boson (ZZ or WZ), with a Z boson decaying into a
pair of neutrinos and the other boson decaying hadronically into two collimated
quarks that are reconstructed as a highly energetic large-cone jet. The search
is performed using the data collected with the CMS detector at the CERN LHC
during 2016 in proton-proton collisions at a center-of-mass energy of 13 TeV,
corresponding to a total integrated luminosity of 35.9 fb$^{-1}$. No excess is
observed in data with regard to background expectations. Results are
interpreted in scenarios of physics beyond the standard model. Limits at 95%
confidence level on production cross sections are set at 0.9 fb (63 fb) for
spin-1 W$'$ bosons, included in the heavy vector triplet model, with mass 4.0
TeV (1.0 TeV), and at 0.5 fb (40 fb) for spin-2 bulk gravitons with mass 4.0
TeV (1.0 TeV). Lower limits are set on the masses of W$'$ bosons in the context
of two versions of the heavy vector triplet model of 3.1 TeV and 3.4 TeV,
respectively.
|
hep-ex
|
a search is presented for a heavy resonance decaying into either a pair of z bosons or a z boson and a w boson zz or wz with a z boson decaying into a pair of neutrinos and the other boson decaying hadronically into two collimated quarks that are reconstructed as a highly energetic largecone jet the search is performed using the data collected with the cms detector at the cern lhc during 2016 in protonproton collisions at a centerofmass energy of 13 tev corresponding to a total integrated luminosity of 359 fb1 no excess is observed in data with regard to background expectations results are interpreted in scenarios of physics beyond the standard model limits at 95 confidence level on production cross sections are set at 09 fb 63 fb for spin1 w bosons included in the heavy vector triplet model with mass 40 tev 10 tev and at 05 fb 40 fb for spin2 bulk gravitons with mass 40 tev 10 tev lower limits are set on the masses of w bosons in the context of two versions of the heavy vector triplet model of 31 tev and 34 tev respectively
|
[['a', 'search', 'is', 'presented', 'for', 'a', 'heavy', 'resonance', 'decaying', 'into', 'either', 'a', 'pair', 'of', 'z', 'bosons', 'or', 'a', 'z', 'boson', 'and', 'a', 'w', 'boson', 'zz', 'or', 'wz', 'with', 'a', 'z', 'boson', 'decaying', 'into', 'a', 'pair', 'of', 'neutrinos', 'and', 'the', 'other', 'boson', 'decaying', 'hadronically', 'into', 'two', 'collimated', 'quarks', 'that', 'are', 'reconstructed', 'as', 'a', 'highly', 'energetic', 'largecone', 'jet', 'the', 'search', 'is', 'performed', 'using', 'the', 'data', 'collected', 'with', 'the', 'cms', 'detector', 'at', 'the', 'cern', 'lhc', 'during', '2016', 'in', 'protonproton', 'collisions', 'at', 'a', 'centerofmass', 'energy', 'of', '13', 'tev', 'corresponding', 'to', 'a', 'total', 'integrated', 'luminosity', 'of', '359', 'fb1', 'no', 'excess', 'is', 'observed', 'in', 'data', 'with', 'regard', 'to', 'background', 'expectations', 'results', 'are', 'interpreted', 'in', 'scenarios', 'of', 'physics', 'beyond', 'the', 'standard', 'model', 'limits', 'at', '95', 'confidence', 'level', 'on', 'production', 'cross', 'sections', 'are', 'set', 'at', '09', 'fb', '63', 'fb', 'for', 'spin1', 'w', 'bosons', 'included', 'in', 'the', 'heavy', 'vector', 'triplet', 'model', 'with', 'mass', '40', 'tev', '10', 'tev', 'and', 'at', '05', 'fb', '40', 'fb', 'for', 'spin2', 'bulk', 'gravitons', 'with', 'mass', '40', 'tev', '10', 'tev', 'lower', 'limits', 'are', 'set', 'on', 'the', 'masses', 'of', 'w', 'bosons', 'in', 'the', 'context', 'of', 'two', 'versions', 'of', 'the', 'heavy', 'vector', 'triplet', 'model', 'of', '31', 'tev', 'and', '34', 'tev', 'respectively']]
|
[-0.04191266336662617, 0.26561548347854114, -0.006922545214668692, 0.17893309076256023, -0.005403920406630884, -0.17567719457474595, 0.0259120287373662, 0.3522024617365484, -0.1763005825948009, -0.37438080853704986, -0.0018630693430168321, -0.38516062139145407, 0.16801006069605742, 0.1640849187533604, 0.14452980700783277, 0.06632005015368729, 0.15012743904662784, 0.028088323816821987, -0.034856446095849, -0.2683808677732789, 0.24445727095614225, 0.06285441414729576, 0.19088182170526125, 0.05859326284068326, 0.08578317566934857, 0.023826314704516943, -0.042800913999902455, -0.12672288785203514, -0.06519820052824343, 0.06566246682768906, 0.19183657380350874, 0.04382318149631222, 0.15107617530156858, -0.27468469985372695, -0.047630045673334585, 0.14367690629539234, 0.16730180784694917, 0.014924550843109804, -0.0801337491296484, -0.3644883667099445, 0.1798052451449621, -0.24278473821565663, -0.10835864666538934, 0.09070168571755251, 0.0039611601969227195, -0.11358919636889671, -0.32539672737766523, 0.14496145519054457, -0.05840271865114725, 0.07326936203874841, -0.03784660200957054, -0.2137718605918053, -0.1378211594953124, -0.11808116362711492, 0.08735266988423973, 0.08277114862130475, 0.18231526703069298, -0.17478023705734813, -0.2395175935816951, 0.35290637727788027, -0.09695782890776172, -0.15352812669152627, 0.25283348781522363, -0.1725686634381418, -0.11578032674272738, 0.2170027173803343, 0.3126451831628098, 0.009836380855025103, -0.24351914858925738, 0.14815297960376483, -0.00598977741416699, 0.19689051631697416, 0.047164004708368644, 0.07530802784155337, 0.2583583251337889, 0.22853074705926701, -0.03535517334482089, 0.041233934473893896, -0.18640798328245486, -0.020067049665764596, -0.46060798258986324, -0.11938568329787813, -0.051976101502077654, 0.06646591372797654, -0.05909272748946629, -0.023779034098955282, 0.3635527045989875, 0.08177120967396452, 0.3542243422853062, -0.002068277489646183, 0.22631608119263547, 0.10798302125067494, 0.07004378286728752, 0.09909961667775254, 0.3442861036261699, 0.136452530384607, 0.16125483431096654, -0.10138396916590864, -0.08265893247759475, 0.05623791950468634]
|
1,803.03839
|
Efficient Enumeration of Bipartite Subgraphs in Graphs
|
Subgraph enumeration problems ask to output all subgraphs of an input graph
that belongs to the specified graph class or satisfy the given constraint.
These problems have been widely studied in theoretical computer science. As
far, many efficient enumeration algorithms for the fundamental substructures
such as spanning trees, cycles, and paths, have been developed. This paper
addresses the enumeration problem of bipartite subgraphs. Even though bipartite
graphs are quite fundamental and have numerous applications in both theory and
application, its enumeration algorithms have not been intensively studied, to
the best of our knowledge. We propose the first non-trivial algorithms for
enumerating all bipartite subgraphs in a given graph. As the main results, we
develop two efficient algorithms: the one enumerates all bipartite induced
subgraphs of a graph with degeneracy $k$ in $O(k)$ time per solution. The other
enumerates all bipartite subgraphs in $O(1)$ time per solution.
|
cs.DS
|
subgraph enumeration problems ask to output all subgraphs of an input graph that belongs to the specified graph class or satisfy the given constraint these problems have been widely studied in theoretical computer science as far many efficient enumeration algorithms for the fundamental substructures such as spanning trees cycles and paths have been developed this paper addresses the enumeration problem of bipartite subgraphs even though bipartite graphs are quite fundamental and have numerous applications in both theory and application its enumeration algorithms have not been intensively studied to the best of our knowledge we propose the first nontrivial algorithms for enumerating all bipartite subgraphs in a given graph as the main results we develop two efficient algorithms the one enumerates all bipartite induced subgraphs of a graph with degeneracy k in ok time per solution the other enumerates all bipartite subgraphs in o1 time per solution
|
[['subgraph', 'enumeration', 'problems', 'ask', 'to', 'output', 'all', 'subgraphs', 'of', 'an', 'input', 'graph', 'that', 'belongs', 'to', 'the', 'specified', 'graph', 'class', 'or', 'satisfy', 'the', 'given', 'constraint', 'these', 'problems', 'have', 'been', 'widely', 'studied', 'in', 'theoretical', 'computer', 'science', 'as', 'far', 'many', 'efficient', 'enumeration', 'algorithms', 'for', 'the', 'fundamental', 'substructures', 'such', 'as', 'spanning', 'trees', 'cycles', 'and', 'paths', 'have', 'been', 'developed', 'this', 'paper', 'addresses', 'the', 'enumeration', 'problem', 'of', 'bipartite', 'subgraphs', 'even', 'though', 'bipartite', 'graphs', 'are', 'quite', 'fundamental', 'and', 'have', 'numerous', 'applications', 'in', 'both', 'theory', 'and', 'application', 'its', 'enumeration', 'algorithms', 'have', 'not', 'been', 'intensively', 'studied', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'we', 'propose', 'the', 'first', 'nontrivial', 'algorithms', 'for', 'enumerating', 'all', 'bipartite', 'subgraphs', 'in', 'a', 'given', 'graph', 'as', 'the', 'main', 'results', 'we', 'develop', 'two', 'efficient', 'algorithms', 'the', 'one', 'enumerates', 'all', 'bipartite', 'induced', 'subgraphs', 'of', 'a', 'graph', 'with', 'degeneracy', 'k', 'in', 'ok', 'time', 'per', 'solution', 'the', 'other', 'enumerates', 'all', 'bipartite', 'subgraphs', 'in', 'o1', 'time', 'per', 'solution']]
|
[-0.1459385075013166, 0.07909561385018257, 0.0005504793251469119, 0.0794863458124806, -0.11572933740505617, -0.12495305290611537, 0.04221545355968585, 0.4237077474109318, -0.28128811232235335, -0.3761422942481833, 0.13730316320577737, -0.28948596603402943, -0.17201212851158407, 0.16015939083594624, -0.07706461606662057, 0.12199090800705774, 0.13062917878085825, 0.07660847615884388, 0.022471623412295156, -0.31691780309144996, 0.243512286513628, -0.044095442702113456, 0.22536477238762714, 0.06453426346288076, 0.046292430386329964, 0.025098071577129503, -0.013086971509500011, 0.08033281769475913, -0.1762148788239594, 0.08509663361593545, 0.35613898612711936, 0.22833038527480237, 0.25788394230328604, -0.4281703737908847, -0.21277897817095462, 0.24487490981039017, 0.14788672926019214, 0.1326722359501642, -0.017351569151760986, -0.1907736248375006, 0.10654540143648723, -0.11653379361744817, -0.02177231596489373, -0.06632585469505763, 0.06630669749495, -0.0005191148143925078, -0.20878713391561776, -0.03277843998273044, 0.09528607022087408, 0.030111788606194602, 0.049980510513406656, -0.1878547578322867, 0.03233601130730128, 0.15036863420471192, -0.03746257745341895, 0.03151851019834819, 0.033927786846530354, -0.12521786121364478, -0.26457053703600414, 0.40693296936072715, 0.051946332888703234, -0.14621653704910398, 0.1457323294048427, -0.08598227972565027, -0.27788349685310193, 0.1220466641658177, 0.14806427094728164, 0.17089114531121943, -0.1643002367170196, 0.12028746102332163, -0.09988702917216372, 0.09368127441250604, 0.13675796085879308, 0.042625304668733516, 0.13316361922037162, 0.1558071887726602, 0.16105766172723346, 0.1971263739536357, 0.044483747784796246, -0.06370607389006382, -0.19944456585185372, -0.087677289451128, -0.2569967010170094, -0.004471020841526907, -0.154016184840333, -0.22377253440527678, 0.45507719486390485, 0.14569308909217585, 0.16705882904910777, 0.10358879571678499, 0.2742159804393065, 0.04632238739597522, 0.052142373786933004, 0.17014396929162975, 0.1449642598865018, 0.15412406566910036, 0.011978728773250971, -0.12851993219084937, 0.1006263390897888, 0.12532938709992864]
|
1,803.0384
|
Efficient lattice constants and energy band gaps for condensed systems
from a meta-GGA level screened range separated hybrid functional
|
A meta generalized gradient level screened range-separated hybrid functional
is developed for solid-state electronic structure theory. Assessment of the
present range-separated hybrid functional for solid-state lattice constants and
band gaps indicate that the present functional can be used for describing those
properties efficiently in meta-GGA level. Specifically, the performance of the
present functional for band gap of solids indicates that the present meta-GGA
level screened hybrids functional is quite productive beyond the GGA level. The
most appealing feature of the present formalism is that a method has been
suggested which is based upon an accurate semilocal functional.
|
cond-mat.mtrl-sci
|
a meta generalized gradient level screened rangeseparated hybrid functional is developed for solidstate electronic structure theory assessment of the present rangeseparated hybrid functional for solidstate lattice constants and band gaps indicate that the present functional can be used for describing those properties efficiently in metagga level specifically the performance of the present functional for band gap of solids indicates that the present metagga level screened hybrids functional is quite productive beyond the gga level the most appealing feature of the present formalism is that a method has been suggested which is based upon an accurate semilocal functional
|
[['a', 'meta', 'generalized', 'gradient', 'level', 'screened', 'rangeseparated', 'hybrid', 'functional', 'is', 'developed', 'for', 'solidstate', 'electronic', 'structure', 'theory', 'assessment', 'of', 'the', 'present', 'rangeseparated', 'hybrid', 'functional', 'for', 'solidstate', 'lattice', 'constants', 'and', 'band', 'gaps', 'indicate', 'that', 'the', 'present', 'functional', 'can', 'be', 'used', 'for', 'describing', 'those', 'properties', 'efficiently', 'in', 'metagga', 'level', 'specifically', 'the', 'performance', 'of', 'the', 'present', 'functional', 'for', 'band', 'gap', 'of', 'solids', 'indicates', 'that', 'the', 'present', 'metagga', 'level', 'screened', 'hybrids', 'functional', 'is', 'quite', 'productive', 'beyond', 'the', 'gga', 'level', 'the', 'most', 'appealing', 'feature', 'of', 'the', 'present', 'formalism', 'is', 'that', 'a', 'method', 'has', 'been', 'suggested', 'which', 'is', 'based', 'upon', 'an', 'accurate', 'semilocal', 'functional']]
|
[-0.0835521712313531, 0.04288162573102079, -0.15674726072622022, 0.1336791706625516, -0.007602083314325392, -0.1301477226985561, 0.07313129461500026, 0.39205603946730033, -0.23468780684280066, -0.300664519276662, -0.050845884906425685, -0.25012991916791527, -0.20307753697882608, 0.14488561689546428, 0.01593056250094753, 0.07338486341567538, 0.05418348339261468, -0.02059947771317873, -0.10199788863021765, -0.17689894745126367, 0.27368918720383156, 0.08990106689287637, 0.2965997610452403, 0.10445460666585521, 0.01291623915132788, 0.014494360126939016, 0.08308994103722352, 0.0437193376578621, -0.10765571554169508, 0.23996257498745144, 0.3279440591361412, -0.0021470366597905292, 0.3278876726453183, -0.5011348657156389, -0.2938757905371718, -0.059634221271256505, 0.05917636052820563, 0.11894625815510097, -0.07609280600145306, -0.23858303523420826, 0.1113696421602184, -0.2053563188300612, -0.0976051823212045, -0.21662758712263144, -0.04814235937119145, 0.030744139172290404, -0.23515999862580972, 0.13483394660804535, -0.04123065063067395, 0.02448585103643991, -0.08877569089101185, -0.2170536842139572, -0.024804406616952, 0.03991733887472872, -0.03556316665232124, 0.07805982939346895, 0.16350999363150792, -0.06828124886954721, -0.08229991798553155, 0.3842386010189339, -0.0941539520023333, -0.1396159984593846, 0.16320634009460583, -0.04571201250955616, -0.20072876550641255, 0.09274010465374773, 0.07496066550368961, 0.13071495457792404, -0.2230400473519094, 0.17453627609443784, 0.056325499861280326, 0.22304705818202922, -0.012621632537122854, 0.07077043243808691, 0.15950247784356406, 0.22719228039159603, 0.0708466943007769, 0.06839245744409596, -0.09256909295950162, -0.11209327864854299, -0.2537433222205061, -0.17305699717236195, -0.20403737465361343, -0.04239764084833069, -0.03761573469961787, -0.24851737459929488, 0.4249393942852303, 0.12653706195168965, 0.06990337165879067, 0.01658472032214217, 0.22076090966764184, 0.15229947290013632, 0.10467637418625281, 0.06607409908205808, 0.2783606009769071, 0.12099966784151867, 0.025819280871295744, -0.1983830337364649, 0.07103981655667123, 0.0914785936450797]
|
1,803.03841
|
Spectral statistics in spatially extended chaotic quantum many-body
systems
|
We study spectral statistics in spatially extended chaotic quantum many-body
systems, using simple lattice Floquet models without time-reversal symmetry.
Computing the spectral form factor $K(t)$ analytically and numerically, we show
that it follows random matrix theory (RMT) at times longer than a many-body
Thouless time, $t_{\rm Th}$. We obtain a striking dependence of $t_{\rm Th}$ on
the spatial dimension $d$ and size of the system. For $d>1$, $t_{\rm Th}$ is
finite in the thermodynamic limit and set by the inter-site coupling strength.
By contrast, in one dimension $t_{\rm Th}$ diverges with system size, and for
large systems there is a wide window in which spectral correlations are not of
RMT form.
|
cond-mat.stat-mech cond-mat.str-el hep-th quant-ph
|
we study spectral statistics in spatially extended chaotic quantum manybody systems using simple lattice floquet models without timereversal symmetry computing the spectral form factor kt analytically and numerically we show that it follows random matrix theory rmt at times longer than a manybody thouless time t_rm th we obtain a striking dependence of t_rm th on the spatial dimension d and size of the system for d1 t_rm th is finite in the thermodynamic limit and set by the intersite coupling strength by contrast in one dimension t_rm th diverges with system size and for large systems there is a wide window in which spectral correlations are not of rmt form
|
[['we', 'study', 'spectral', 'statistics', 'in', 'spatially', 'extended', 'chaotic', 'quantum', 'manybody', 'systems', 'using', 'simple', 'lattice', 'floquet', 'models', 'without', 'timereversal', 'symmetry', 'computing', 'the', 'spectral', 'form', 'factor', 'kt', 'analytically', 'and', 'numerically', 'we', 'show', 'that', 'it', 'follows', 'random', 'matrix', 'theory', 'rmt', 'at', 'times', 'longer', 'than', 'a', 'manybody', 'thouless', 'time', 't_rm', 'th', 'we', 'obtain', 'a', 'striking', 'dependence', 'of', 't_rm', 'th', 'on', 'the', 'spatial', 'dimension', 'd', 'and', 'size', 'of', 'the', 'system', 'for', 'd1', 't_rm', 'th', 'is', 'finite', 'in', 'the', 'thermodynamic', 'limit', 'and', 'set', 'by', 'the', 'intersite', 'coupling', 'strength', 'by', 'contrast', 'in', 'one', 'dimension', 't_rm', 'th', 'diverges', 'with', 'system', 'size', 'and', 'for', 'large', 'systems', 'there', 'is', 'a', 'wide', 'window', 'in', 'which', 'spectral', 'correlations', 'are', 'not', 'of', 'rmt', 'form']]
|
[-0.14429677176700384, 0.20881334523594863, -0.0660572010428049, 0.06519846361642284, 0.05344719907084295, -0.19251293537148215, 0.06396436527358822, 0.32593972818204414, -0.24135606557231498, -0.2400709573800365, 0.04873224356639627, -0.2996845711305788, -0.12314129355657208, 0.1622391062293638, 0.03682302548717875, 0.05263382003292324, -0.03404111731461845, 0.047631169405035874, -0.11849465351006402, -0.21399725055078733, 0.28221332395935916, 0.011229340606872496, 0.24885084404534585, 0.05687848674049517, -0.00042008267933720943, 0.014788084440059154, 0.06854749939127548, 0.035618310409329564, -0.14351968126412668, 0.019486472125979024, 0.2289809588428971, 0.04645149143693784, 0.2006240332717294, -0.37792846822255366, -0.22131542660094597, 0.11100239792276544, 0.1389702925676698, 0.12325133514477292, 0.03324101945733534, -0.2577482836849585, 0.07124736106342024, -0.1864712814305414, -0.1451007718648258, -0.10376855856235567, 0.09637067819366583, -0.02168924366082023, -0.2888788889867027, 0.12752452158780248, 0.06768989168644489, 0.1327379584975272, -0.0037609409721282958, -0.09062933740373869, 0.007519105808003931, 0.048979682724100644, -0.01757092038390404, 0.012023356626741588, 0.09377574037261274, -0.08288081586444834, -0.0662229047576385, 0.3730024399135161, -0.11065227854097585, -0.10230280821387833, 0.18129846709570638, -0.17143917009066623, -0.1386873333983392, 0.1490609426353429, 0.11483764242347297, 0.08775213271010297, -0.1208392073324806, 0.16603623502384368, -0.007850207950550693, 0.24940693339853137, 0.027454642602032772, 0.08187331858737108, 0.18371157275999453, 0.1591884343473761, 0.05867422875520345, 0.08276799742367354, -0.07862168288923935, -0.13417078182940279, -0.276824931958103, -0.107826996660741, -0.26106268286637896, 0.09337801812859021, -0.16274084722956744, -0.13894434481741744, 0.39753763936040504, 0.14599293903321833, 0.21628377318113773, 0.06307131736350523, 0.21474646582679302, 0.2134299182516852, 0.0518831554800272, 0.12229124869026982, 0.17566049669508463, 0.1593496444685435, 0.10803839766109984, -0.2780802403031303, -0.016173584508365608, 0.10337083496841358]
|
1,803.03842
|
Turbulence in the TW Hya Disk
|
Turbulence is a fundamental parameter in models of grain growth during the
early stages of planet formation. As such, observational constraints on its
magnitude are crucial. Here we self-consistently analyze ALMA CO(2-1), SMA
CO(3-2), and SMA CO(6-5) observations of the disk around TW Hya and find an
upper limit on the turbulent broadening of $<$0.08c$_s$ ($\alpha<$0.007 for
$\alpha$ defined only within 2-3 pressure scale heights above the midplane),
lower than the tentative detection previously found from an analysis of the
CO(2-1) data. We examine in detail the challenges of image plane fitting vs
directly fitting the visibilities, while also considering the role of the
vertical temperature gradient, systematic uncertainty in the amplitude
calibration, and assumptions about the CO abundance, as potential sources of
the discrepancy in the turbulence measurements. These tests result in
variations of the turbulence limit between $<$0.04c$_s$ and $<$0.13c$_s$,
consistently lower than the 0.2-0.4c$_s$ found previously. Having ruled out
numerous factors, we restrict the source of the discrepancy to our assumed
coupling between temperature and density through hydrostatic equilibrium in the
presence of a vertical temperature gradient and/or the confinement of CO to a
thin molecular layer above the midplane, although further work is needed to
quantify the influence of these prescriptions. Assumptions about hydrostatic
equilibrium and the CO distribution are physically motivated, and may have a
small influence on measuring the kinematics of the gas, but they become
important when constraining small effects such as the strength of the
turbulence within a protoplanetary disk.
|
astro-ph.EP
|
turbulence is a fundamental parameter in models of grain growth during the early stages of planet formation as such observational constraints on its magnitude are crucial here we selfconsistently analyze alma co21 sma co32 and sma co65 observations of the disk around tw hya and find an upper limit on the turbulent broadening of 008c_s alpha0007 for alpha defined only within 23 pressure scale heights above the midplane lower than the tentative detection previously found from an analysis of the co21 data we examine in detail the challenges of image plane fitting vs directly fitting the visibilities while also considering the role of the vertical temperature gradient systematic uncertainty in the amplitude calibration and assumptions about the co abundance as potential sources of the discrepancy in the turbulence measurements these tests result in variations of the turbulence limit between 004c_s and 013c_s consistently lower than the 0204c_s found previously having ruled out numerous factors we restrict the source of the discrepancy to our assumed coupling between temperature and density through hydrostatic equilibrium in the presence of a vertical temperature gradient andor the confinement of co to a thin molecular layer above the midplane although further work is needed to quantify the influence of these prescriptions assumptions about hydrostatic equilibrium and the co distribution are physically motivated and may have a small influence on measuring the kinematics of the gas but they become important when constraining small effects such as the strength of the turbulence within a protoplanetary disk
|
[['turbulence', 'is', 'a', 'fundamental', 'parameter', 'in', 'models', 'of', 'grain', 'growth', 'during', 'the', 'early', 'stages', 'of', 'planet', 'formation', 'as', 'such', 'observational', 'constraints', 'on', 'its', 'magnitude', 'are', 'crucial', 'here', 'we', 'selfconsistently', 'analyze', 'alma', 'co21', 'sma', 'co32', 'and', 'sma', 'co65', 'observations', 'of', 'the', 'disk', 'around', 'tw', 'hya', 'and', 'find', 'an', 'upper', 'limit', 'on', 'the', 'turbulent', 'broadening', 'of', '008c_s', 'alpha0007', 'for', 'alpha', 'defined', 'only', 'within', '23', 'pressure', 'scale', 'heights', 'above', 'the', 'midplane', 'lower', 'than', 'the', 'tentative', 'detection', 'previously', 'found', 'from', 'an', 'analysis', 'of', 'the', 'co21', 'data', 'we', 'examine', 'in', 'detail', 'the', 'challenges', 'of', 'image', 'plane', 'fitting', 'vs', 'directly', 'fitting', 'the', 'visibilities', 'while', 'also', 'considering', 'the', 'role', 'of', 'the', 'vertical', 'temperature', 'gradient', 'systematic', 'uncertainty', 'in', 'the', 'amplitude', 'calibration', 'and', 'assumptions', 'about', 'the', 'co', 'abundance', 'as', 'potential', 'sources', 'of', 'the', 'discrepancy', 'in', 'the', 'turbulence', 'measurements', 'these', 'tests', 'result', 'in', 'variations', 'of', 'the', 'turbulence', 'limit', 'between', '004c_s', 'and', '013c_s', 'consistently', 'lower', 'than', 'the', '0204c_s', 'found', 'previously', 'having', 'ruled', 'out', 'numerous', 'factors', 'we', 'restrict', 'the', 'source', 'of', 'the', 'discrepancy', 'to', 'our', 'assumed', 'coupling', 'between', 'temperature', 'and', 'density', 'through', 'hydrostatic', 'equilibrium', 'in', 'the', 'presence', 'of', 'a', 'vertical', 'temperature', 'gradient', 'andor', 'the', 'confinement', 'of', 'co', 'to', 'a', 'thin', 'molecular', 'layer', 'above', 'the', 'midplane', 'although', 'further', 'work', 'is', 'needed', 'to', 'quantify', 'the', 'influence', 'of', 'these', 'prescriptions', 'assumptions', 'about', 'hydrostatic', 'equilibrium', 'and', 'the', 'co', 'distribution', 'are', 'physically', 'motivated', 'and', 'may', 'have', 'a', 'small', 'influence', 'on', 'measuring', 'the', 'kinematics', 'of', 'the', 'gas', 'but', 'they', 'become', 'important', 'when', 'constraining', 'small', 'effects', 'such', 'as', 'the', 'strength', 'of', 'the', 'turbulence', 'within', 'a', 'protoplanetary', 'disk']]
|
[-0.0766246042220562, 0.10121677599479866, -0.0475250874385391, 0.07184085159163937, -0.03298937158377404, -0.04156355792560726, 0.06362249440065136, 0.3759639486996265, -0.2356940138013842, -0.3542740092969235, 0.09906561421172946, -0.2314446643473956, -0.04614120564297026, 0.17629066807191068, 0.013658818160279543, 0.03616270783511585, 0.0061822949924004176, -0.08811831418348193, -0.06277203167081569, -0.1988263562812236, 0.32360504872123463, 0.12010829602061568, 0.20536097144988777, 0.06819198590534674, 0.02795535180550749, -0.13117536023995022, -0.06606054316186671, -0.003498456507936549, -0.19428642928684628, 0.04470545892055633, 0.19098916255127663, 0.0630882327950755, 0.22902694075663454, -0.4262163856070596, -0.24739766632299678, 0.06715132742511767, 0.16832983882143449, 0.0751086349940165, -0.00418298102775397, -0.23669596055068398, 0.03988509440273353, -0.12354798069024467, -0.15196738882112956, 0.01784658409490292, 0.04328887444420683, 0.0176217009437006, -0.2537408857697376, 0.1246804860505561, 0.057240090520722875, 0.12010546239491057, -0.10981054298834561, -0.14659122904042096, -0.08945094676853116, 0.09753772781200327, 0.057105288837955875, 0.05264683598039265, 0.21152666412531532, -0.16492237519557154, -0.015898080165172187, 0.3804271723279814, -0.09461365163663053, -0.12331795789408709, 0.21009436260943334, -0.20103316748928693, -0.1687815744418329, 0.13019299758272437, 0.14152073440115148, 0.08455822105546301, -0.11563271281402605, 0.031781584946409924, -0.03291057103549211, 0.22380449814978726, 0.08888630059436577, 0.026151314676727776, 0.2877853769586717, 0.14104754961605487, 0.04642904712626933, 0.1164815816913306, -0.21664366757769307, -0.1036570515510446, -0.2764990979560302, -0.11465569280869799, -0.1280525908685661, 0.05242006386747131, -0.13695994666122416, -0.1250048952697922, 0.3166483749286751, 0.1765723819128207, 0.22088513093992854, 0.012160278603802492, 0.3378375439249255, 0.10618002405782985, 0.0796448191869314, 0.09413076936911194, 0.318250574158129, 0.17429418845721156, 0.09995738424198106, -0.2518224565517311, 0.12451492847468505, -0.03221038103854828]
|
1,803.03843
|
The intersection of three spheres in a sphere and a new application of
the Sato-Levine invariant
|
Take transverse immersions f from a disjoint unin of the three 4-spheres
$S^4_1$, $S^4_2$, and $S^4_3$ into $S^6$ with the following properties:
(1) The restriction of $f$ to $S^4_i$ is an embedding,
(2) The intersection of $f(S^4_i)$ and $f(S^4_j)$ is not empty and connected,
(3)The intersection among $f(S^4_1)$, $f(S^4_2)$, and $f(S^4_3)$ is not
empty.
Then we obtain three surface-links $L_i=(S^4_i\cap S^4_j, S^4_i\cap S^4_k)$
in $S^4_i$, where $(i,j,k)=(1,2,3), (2,3,1), (3,1,2).$ We prove that, we have
the equality $\beta(L_1)+\beta(L_2)+\beta(L_3)=0$, where $\beta(L_i)$ is the
Sato-Levine invariant of $L_i$, if all $L_i$ are semi-boundary links.
|
math.GT
|
take transverse immersions f from a disjoint unin of the three 4spheres s4_1 s4_2 and s4_3 into s6 with the following properties 1 the restriction of f to s4_i is an embedding 2 the intersection of fs4_i and fs4_j is not empty and connected 3the intersection among fs4_1 fs4_2 and fs4_3 is not empty then we obtain three surfacelinks l_is4_icap s4_j s4_icap s4_k in s4_i where ijk123 231 312 we prove that we have the equality betal_1betal_2betal_30 where betal_i is the satolevine invariant of l_i if all l_i are semiboundary links
|
[['take', 'transverse', 'immersions', 'f', 'from', 'a', 'disjoint', 'unin', 'of', 'the', 'three', '4spheres', 's4_1', 's4_2', 'and', 's4_3', 'into', 's6', 'with', 'the', 'following', 'properties', '1', 'the', 'restriction', 'of', 'f', 'to', 's4_i', 'is', 'an', 'embedding', '2', 'the', 'intersection', 'of', 'fs4_i', 'and', 'fs4_j', 'is', 'not', 'empty', 'and', 'connected', '3the', 'intersection', 'among', 'fs4_1', 'fs4_2', 'and', 'fs4_3', 'is', 'not', 'empty', 'then', 'we', 'obtain', 'three', 'surfacelinks', 'l_is4_icap', 's4_j', 's4_icap', 's4_k', 'in', 's4_i', 'where', 'ijk123', '231', '312', 'we', 'prove', 'that', 'we', 'have', 'the', 'equality', 'betal_1betal_2betal_30', 'where', 'betal_i', 'is', 'the', 'satolevine', 'invariant', 'of', 'l_i', 'if', 'all', 'l_i', 'are', 'semiboundary', 'links']]
|
[-0.17074046331147352, 0.15615749926170489, -0.04682192957028747, 0.04296332639331619, -0.060016507785767316, -0.14960267570490637, -0.008944971077144146, 0.35840544631083804, -0.2711538881373902, -0.2387321034198006, 0.11280718389743317, -0.33694361670253176, -0.0858774858340621, 0.11877439629286528, -0.06004577441761891, -0.04496313388769825, -0.0027386903576552867, 0.08991600623975197, -0.03746270332174997, -0.26432533994317053, 0.3513711446026961, -0.1321300056328376, 0.18630224648863078, 0.09559725434829791, 0.09235158996656537, 0.005116622634232044, 0.00978295160457492, 0.026623343173414468, -0.17849037610353358, 0.09012540283923348, 0.2204180449495713, 0.1556541054043919, 0.18552929552892844, -0.3849436095356941, -0.08879428257544836, 0.19613183878362178, 0.14746816581115127, -0.04961906086653471, 0.06277679158685108, -0.21988456145549815, 0.14640295979566872, -0.11771214486410221, -0.054479368406658374, -0.016808933032055696, 0.08163313716650009, 0.04180388633782665, -0.25226976625621317, -0.0027019597046698133, 0.14038099928448597, 0.0493659713678062, -0.04801843904579679, -0.09463291751841704, -0.09089873360469937, 0.14146955915416282, 0.010342762283980846, 0.0798019382978479, 0.02853805825735132, -0.059064275836572054, -0.09390164172276855, 0.3886589988755683, -0.033998557936865834, -0.22607872441411017, 0.1482361969165504, -0.15781275746276757, -0.19621584927042326, 0.11948945357774694, 0.07992195510305464, 0.11398135515550772, -0.07770224618415038, 0.1785482432724287, -0.0870470633606116, 0.09528018667052189, 0.10155807653752466, -0.017247255655626455, 0.13684748583783707, 0.08662812148531278, 0.10278282828265219, 0.14632629906758665, -0.0606641101030012, -0.008943209478165954, -0.3474259727199872, -0.1916444040214022, -0.15199741518280158, 0.1290307554792768, -0.07103306021463747, -0.12957792576402427, 0.392136338998874, 0.04076607203731934, 0.2463783985376358, 0.09574447901919485, 0.2556653844332322, 0.04727031052112579, 0.05679247366885344, 0.14537316198150316, 0.18063622151191036, 0.11860287086417277, -0.074052607404689, -0.10443852704328795, -0.038948176437988875, 0.13819281242166956]
|
1,803.03844
|
Exploring the hadron resonance gas phase on the QCD phase diagram
|
Lattice computations of strongly interacting matter at finite temperature $T$
and baryon chemical potential $\mu_B$ suggest that the QCD thermodynamics deep
in the hadronic phase can be adequately modeled by an ideal hadron resonance
gas (I-HRG). However, it is not clear where on the $(\mu_B, T)$ plane this
description breaks down, making it essential to account for hadronic
interactions and change in the nature of the degrees of freedom. We have
studied several thermodynamic functions within the I-HRG model and try to
identify the region of the QCD phase diagram where it becomes essential to
include non-ideal effects into the I-HRG model. We work with only those
thermodynamic quantities that show a monotonic rise with $T$ and $\mu_B$ in
I-HRG. Their high temperature limiting values where QCD becomes simply a
Stefan-Boltzmann (SB) gas of massless quarks and gluons is known. The rise of
these quantities in I-HRG beyond the corresponding SB limit values indicate the
need to include interactions into I-HRG to study QCD thermodynamics. This works
as a guiding principle on the QCD phase diagram where interacting HRG can take
over from I-HRG. For $\mu_B/T\leq2$, $\chi^Q_2$ shoots the SB limit at the
smallest $T$, while for higher values of
$\mu_B/T$,$C_{BS}=-3\chi^{BS}_{11}/\chi^S_2$ takes over. We further comment on
the relative positions between the freezeout curve obtained by thermal fits to
the measured hadron yields and the obtained line where I-HRG overshoots SB
limit.
|
hep-ph nucl-th
|
lattice computations of strongly interacting matter at finite temperature t and baryon chemical potential mu_b suggest that the qcd thermodynamics deep in the hadronic phase can be adequately modeled by an ideal hadron resonance gas ihrg however it is not clear where on the mu_b t plane this description breaks down making it essential to account for hadronic interactions and change in the nature of the degrees of freedom we have studied several thermodynamic functions within the ihrg model and try to identify the region of the qcd phase diagram where it becomes essential to include nonideal effects into the ihrg model we work with only those thermodynamic quantities that show a monotonic rise with t and mu_b in ihrg their high temperature limiting values where qcd becomes simply a stefanboltzmann sb gas of massless quarks and gluons is known the rise of these quantities in ihrg beyond the corresponding sb limit values indicate the need to include interactions into ihrg to study qcd thermodynamics this works as a guiding principle on the qcd phase diagram where interacting hrg can take over from ihrg for mu_btleq2 chiq_2 shoots the sb limit at the smallest t while for higher values of mu_btc_bs3chibs_11chis_2 takes over we further comment on the relative positions between the freezeout curve obtained by thermal fits to the measured hadron yields and the obtained line where ihrg overshoots sb limit
|
[['lattice', 'computations', 'of', 'strongly', 'interacting', 'matter', 'at', 'finite', 'temperature', 't', 'and', 'baryon', 'chemical', 'potential', 'mu_b', 'suggest', 'that', 'the', 'qcd', 'thermodynamics', 'deep', 'in', 'the', 'hadronic', 'phase', 'can', 'be', 'adequately', 'modeled', 'by', 'an', 'ideal', 'hadron', 'resonance', 'gas', 'ihrg', 'however', 'it', 'is', 'not', 'clear', 'where', 'on', 'the', 'mu_b', 't', 'plane', 'this', 'description', 'breaks', 'down', 'making', 'it', 'essential', 'to', 'account', 'for', 'hadronic', 'interactions', 'and', 'change', 'in', 'the', 'nature', 'of', 'the', 'degrees', 'of', 'freedom', 'we', 'have', 'studied', 'several', 'thermodynamic', 'functions', 'within', 'the', 'ihrg', 'model', 'and', 'try', 'to', 'identify', 'the', 'region', 'of', 'the', 'qcd', 'phase', 'diagram', 'where', 'it', 'becomes', 'essential', 'to', 'include', 'nonideal', 'effects', 'into', 'the', 'ihrg', 'model', 'we', 'work', 'with', 'only', 'those', 'thermodynamic', 'quantities', 'that', 'show', 'a', 'monotonic', 'rise', 'with', 't', 'and', 'mu_b', 'in', 'ihrg', 'their', 'high', 'temperature', 'limiting', 'values', 'where', 'qcd', 'becomes', 'simply', 'a', 'stefanboltzmann', 'sb', 'gas', 'of', 'massless', 'quarks', 'and', 'gluons', 'is', 'known', 'the', 'rise', 'of', 'these', 'quantities', 'in', 'ihrg', 'beyond', 'the', 'corresponding', 'sb', 'limit', 'values', 'indicate', 'the', 'need', 'to', 'include', 'interactions', 'into', 'ihrg', 'to', 'study', 'qcd', 'thermodynamics', 'this', 'works', 'as', 'a', 'guiding', 'principle', 'on', 'the', 'qcd', 'phase', 'diagram', 'where', 'interacting', 'hrg', 'can', 'take', 'over', 'from', 'ihrg', 'for', 'mu_btleq2', 'chiq_2', 'shoots', 'the', 'sb', 'limit', 'at', 'the', 'smallest', 't', 'while', 'for', 'higher', 'values', 'of', 'mu_btc_bs3chibs_11chis_2', 'takes', 'over', 'we', 'further', 'comment', 'on', 'the', 'relative', 'positions', 'between', 'the', 'freezeout', 'curve', 'obtained', 'by', 'thermal', 'fits', 'to', 'the', 'measured', 'hadron', 'yields', 'and', 'the', 'obtained', 'line', 'where', 'ihrg', 'overshoots', 'sb', 'limit']]
|
[-0.06792950004544597, 0.20041411437556061, -0.10813657846759321, 0.06429270311516982, -0.02584662546676189, -0.10578513377464038, 0.09733777484392918, 0.32341625466617435, -0.2163599087015622, -0.2676052787467252, 0.01601793389466457, -0.3106898816585069, -0.02583372660843436, 0.12482203041126048, 0.04689604835368705, -0.002203695471289234, -0.010513271658587795, 0.0408472964035827, -0.08816976818422824, -0.22268639822128558, 0.27076427243227, 0.038170600595541386, 0.21667790898491981, 0.13510726998238845, 0.0578746279909003, 0.014232110526965826, 0.010244895874583122, 0.04687057360681384, -0.15364046604912698, -0.009601032591168667, 0.2328059582576546, 0.010675576680205665, 0.15579169134174242, -0.3920399736019266, -0.23178531373210462, 0.12739347987635444, 0.15459609542735425, 0.10508497318509137, 0.014999519094649914, -0.22917449325892472, 0.047419905244407354, -0.16525403929947505, -0.15673098975094035, -0.12121844732133452, 0.0004410288992081667, -0.002584113931338258, -0.26423472721601415, 0.09375251392024574, 0.039583844024090424, 0.04849037782423296, -0.0428354199975729, -0.1722513763844056, -0.0649241304043355, 0.0789435089018814, 0.04413617410166184, 0.06933208732986741, 0.15918394289992133, -0.16770874790025786, -0.04004647908630622, 0.4529402392619497, -0.04317221731124405, -0.11316915718008923, 0.17370651569776643, -0.19156875159575168, -0.13712582451303584, 0.1498803212795423, 0.1316986425035515, 0.06696207041958424, -0.15393734029717906, 0.1144071774131224, 0.0066686622080633084, 0.15474212224652187, 0.0399767731755614, 0.043256107872295065, 0.2815054412951538, 0.15716792324376924, -0.007394585004035692, 0.12272785956092895, -0.053742696711077766, -0.142504647244012, -0.33372590230476906, -0.11336067533649212, -0.16262794139654696, 0.0622972295656785, -0.11185485995783853, -0.14268028261709356, 0.33525532898066085, 0.16062051129952382, 0.25386095346016685, 0.010962827147419796, 0.28717316934375264, 0.12203801800466374, 0.07634289711449442, 0.06648651221726398, 0.2544996253088702, 0.16212902828190867, 0.14317983435873577, -0.263550682838266, 0.012813990392750657, 0.08490629044999917]
|
1,803.03845
|
5G NR Jamming, Spoofing, and Sniffing: Threat Assessment and Mitigation
|
In December 2017, the Third Generation Partnership Project (3GPP) released
the first set of specifications for 5G New Radio (NR), which is currently the
most widely accepted 5G cellular standard. 5G NR is expected to replace LTE and
previous generations of cellular technology over the next several years,
providing higher throughput, lower latency, and a host of new features. Similar
to LTE, the 5G NR physical layer consists of several physical channels and
signals, most of which are vital to the operation of the network.
Unfortunately, like for any wireless technology, disruption through radio
jamming is possible. This paper investigates the extent to which 5G NR is
vulnerable to jamming and spoofing, by analyzing the physical downlink and
uplink control channels and signals. We identify the weakest links in the 5G NR
frame, and propose mitigation strategies that should be taken into account
during implementation of 5G NR chipsets and base stations.
|
cs.NI
|
in december 2017 the third generation partnership project 3gpp released the first set of specifications for 5g new radio nr which is currently the most widely accepted 5g cellular standard 5g nr is expected to replace lte and previous generations of cellular technology over the next several years providing higher throughput lower latency and a host of new features similar to lte the 5g nr physical layer consists of several physical channels and signals most of which are vital to the operation of the network unfortunately like for any wireless technology disruption through radio jamming is possible this paper investigates the extent to which 5g nr is vulnerable to jamming and spoofing by analyzing the physical downlink and uplink control channels and signals we identify the weakest links in the 5g nr frame and propose mitigation strategies that should be taken into account during implementation of 5g nr chipsets and base stations
|
[['in', 'december', '2017', 'the', 'third', 'generation', 'partnership', 'project', '3gpp', 'released', 'the', 'first', 'set', 'of', 'specifications', 'for', '5g', 'new', 'radio', 'nr', 'which', 'is', 'currently', 'the', 'most', 'widely', 'accepted', '5g', 'cellular', 'standard', '5g', 'nr', 'is', 'expected', 'to', 'replace', 'lte', 'and', 'previous', 'generations', 'of', 'cellular', 'technology', 'over', 'the', 'next', 'several', 'years', 'providing', 'higher', 'throughput', 'lower', 'latency', 'and', 'a', 'host', 'of', 'new', 'features', 'similar', 'to', 'lte', 'the', '5g', 'nr', 'physical', 'layer', 'consists', 'of', 'several', 'physical', 'channels', 'and', 'signals', 'most', 'of', 'which', 'are', 'vital', 'to', 'the', 'operation', 'of', 'the', 'network', 'unfortunately', 'like', 'for', 'any', 'wireless', 'technology', 'disruption', 'through', 'radio', 'jamming', 'is', 'possible', 'this', 'paper', 'investigates', 'the', 'extent', 'to', 'which', '5g', 'nr', 'is', 'vulnerable', 'to', 'jamming', 'and', 'spoofing', 'by', 'analyzing', 'the', 'physical', 'downlink', 'and', 'uplink', 'control', 'channels', 'and', 'signals', 'we', 'identify', 'the', 'weakest', 'links', 'in', 'the', '5g', 'nr', 'frame', 'and', 'propose', 'mitigation', 'strategies', 'that', 'should', 'be', 'taken', 'into', 'account', 'during', 'implementation', 'of', '5g', 'nr', 'chipsets', 'and', 'base', 'stations']]
|
[-0.25194686830754537, 0.04613308258826452, 0.07573116531995383, 0.02039743937156776, -0.057551574642083755, -0.19466148470497788, 0.08442255175491721, 0.3304278320681892, -0.21232611254182351, -0.24643038984044993, 0.11242406873038578, -0.24751437405786036, -0.20237918661357407, 0.17962714214502884, -0.09028607116718042, 0.07826216698250439, 0.031375929596833885, -0.03448007280301107, -0.008239649994816557, -0.2460940525825687, 0.2720485905163897, 0.15997063357223706, 0.36523029593579276, 0.03035765258889449, -0.018510864545150024, -0.05692587570918381, -0.09544957080307588, -0.09644782388855483, -0.06794410774440812, 0.08938890955821414, 0.34823084414222794, 0.2394596436060965, 0.27551778173993197, -0.4802864560808398, -0.2888770411526294, 0.07916708261243337, 0.1405432115486627, 0.021595207733059254, -0.011401172355123746, -0.2849539385918577, 0.1895624780966165, -0.3220144910645965, -0.06412745814304799, 0.05906864197995195, 0.007954440416621142, 0.07929385742356412, -0.2968730418575241, -0.04105288751031223, 0.004994210872897192, 0.02020783684718864, -0.022723787508623087, -0.08369706375646944, 0.0015734969224707272, 0.21192987693633003, 0.029101610395101535, 0.028258700220919166, 0.10087587862807068, -0.09393935208879013, -0.10948566079605371, 0.4756798456717086, 0.02608417246588751, -0.10246788286358903, 0.18898076340280423, -0.08963692517595757, -0.14325957224048724, 0.10837967327710143, 0.2387329247829161, -0.013846678132387368, -0.24985201840632057, -0.008562020004702438, 0.05630984669551253, 0.16157353127307847, 0.10501736792502925, 0.13697536515093434, 0.242741740734537, 0.2529863307748823, 0.12270747165894136, 0.0702146516437336, -0.15358787529954784, -0.09776414640433168, -0.24142839828518367, -0.14118844195342573, -0.17235281994094534, 0.024842225220422016, -0.04184648920330035, -0.07062645723252851, 0.41562572273572806, 0.17633111273569643, 0.043021335885369855, 0.09076786465486389, 0.4209611619283494, 0.06038376281436573, 0.14243080077913442, 0.11416656267216527, 0.23712264704763106, 0.054233491985972875, 0.1854534331076521, -0.1042713976685742, 0.04991095691711005, 0.016136414449551682]
|
1,803.03846
|
Gradient estimates for SDEs without monotonicity type conditions
|
We prove gradient estimates for transition Markov semigroups $(P_t)$
associated to SDEs driven by multiplicative Brownian noise having possibly
unbounded $C^1$-coefficients, without requiring any monotonicity type
condition. In particular, first derivatives of coefficients can grow
polynomially and even exponentially. We establish pointwise estimates with
weights for $D_x P_t\varphi$ of the form \[ {\sqrt{t}} \, |D_x P_t \varphi (x)
| \le c \, (1+ |x|^k) \, \| \varphi\|_{\infty} \] $t \in (0,1]$, $\varphi \in
C_b ({\mathbb R}^d)$, $x \in {\mathbb R}^d.$ To prove the result we use two
main tools. First, we consider a Feynman--Kac semigroup with potential $V$
related to the growth of the coefficients and of their derivatives for which we
can use a Bismut-Elworthy-Li type formula. Second, we introduce a new regular
approximation for the coefficients of the SDE. At the end of the paper we
provide an example of SDE with additive noise and drift $b$ having sublinear
growth together with its derivative such that uniform estimates for $D_x P_t
\varphi$ without weights do not hold.
|
math.PR math.AP
|
we prove gradient estimates for transition markov semigroups p_t associated to sdes driven by multiplicative brownian noise having possibly unbounded c1coefficients without requiring any monotonicity type condition in particular first derivatives of coefficients can grow polynomially and even exponentially we establish pointwise estimates with weights for d_x p_tvarphi of the form sqrtt d_x p_t varphi x le c 1 xk varphi_infty t in 01 varphi in c_b mathbb rd x in mathbb rd to prove the result we use two main tools first we consider a feynmankac semigroup with potential v related to the growth of the coefficients and of their derivatives for which we can use a bismutelworthyli type formula second we introduce a new regular approximation for the coefficients of the sde at the end of the paper we provide an example of sde with additive noise and drift b having sublinear growth together with its derivative such that uniform estimates for d_x p_t varphi without weights do not hold
|
[['we', 'prove', 'gradient', 'estimates', 'for', 'transition', 'markov', 'semigroups', 'p_t', 'associated', 'to', 'sdes', 'driven', 'by', 'multiplicative', 'brownian', 'noise', 'having', 'possibly', 'unbounded', 'c1coefficients', 'without', 'requiring', 'any', 'monotonicity', 'type', 'condition', 'in', 'particular', 'first', 'derivatives', 'of', 'coefficients', 'can', 'grow', 'polynomially', 'and', 'even', 'exponentially', 'we', 'establish', 'pointwise', 'estimates', 'with', 'weights', 'for', 'd_x', 'p_tvarphi', 'of', 'the', 'form', 'sqrtt', 'd_x', 'p_t', 'varphi', 'x', 'le', 'c', '1', 'xk', 'varphi_infty', 't', 'in', '01', 'varphi', 'in', 'c_b', 'mathbb', 'rd', 'x', 'in', 'mathbb', 'rd', 'to', 'prove', 'the', 'result', 'we', 'use', 'two', 'main', 'tools', 'first', 'we', 'consider', 'a', 'feynmankac', 'semigroup', 'with', 'potential', 'v', 'related', 'to', 'the', 'growth', 'of', 'the', 'coefficients', 'and', 'of', 'their', 'derivatives', 'for', 'which', 'we', 'can', 'use', 'a', 'bismutelworthyli', 'type', 'formula', 'second', 'we', 'introduce', 'a', 'new', 'regular', 'approximation', 'for', 'the', 'coefficients', 'of', 'the', 'sde', 'at', 'the', 'end', 'of', 'the', 'paper', 'we', 'provide', 'an', 'example', 'of', 'sde', 'with', 'additive', 'noise', 'and', 'drift', 'b', 'having', 'sublinear', 'growth', 'together', 'with', 'its', 'derivative', 'such', 'that', 'uniform', 'estimates', 'for', 'd_x', 'p_t', 'varphi', 'without', 'weights', 'do', 'not', 'hold']]
|
[-0.13052911903359926, 0.1225380610362663, -0.03857105133429286, 0.04238781956373714, -0.08805055634584277, -0.1660650880425237, 0.013208362495788606, 0.38358181950170545, -0.3339195825858042, -0.17567308201250853, 0.11011865620384924, -0.3006089574948419, -0.08569134480203502, 0.18028447782053264, -0.11398373280535452, 0.07536497210421658, 0.010835916720679961, 0.07252246186708362, -0.0947852321958635, -0.24716686780229793, 0.32665186368103605, -0.07714766743156361, 0.1261940531185246, 0.01805983021040447, 0.14044493514193163, -0.01550861461146269, -0.021317964169429614, -0.025832152093062177, -0.2381582629650893, 0.09846925721212756, 0.20631768152234145, 0.041246789212164, 0.308438752242364, -0.3778557241486851, -0.145684309428907, 0.20820761263457827, 0.12824063157604543, -0.007291429419274209, -0.05516743136831792, -0.24955788381339516, 0.11732524322142127, -0.1558287340507377, -0.1745105029680417, -0.08659183250711067, 0.04211331697879359, 0.09323186007459298, -0.3922489711432718, 0.1000105003680801, 0.15395888165803626, 0.03644012568256585, -0.042821957477281104, -0.13729661062097875, -0.03618447537883185, 0.07153136819251812, 0.028282571754971286, 0.08544047593532014, 0.08076079207239673, -0.09390483228198718, -0.10181759115366731, 0.2795348564221058, -0.1489489027459058, -0.2665908718830906, 0.12765306681285438, -0.2397645655757515, -0.15025834168773144, 0.11311949931463232, 0.15319616911929188, 0.1348189931246452, -0.10408668696763926, 0.2005258259643597, 0.01050414307974279, 0.13430828893906438, 0.08480771999747957, 0.042649108509067446, 0.03621114604175091, 0.08031760594894877, 0.15021517284149014, 0.12553135884227232, -0.017322679926655836, -0.03786454551300267, -0.3962251606804784, -0.18741676058562007, -0.15639627429482061, 0.14409315078091822, -0.15301381817525908, -0.1920581275044242, 0.3036920342245139, 0.11744071208668175, 0.21932255551364505, 0.16105352613230933, 0.1970926894020522, 0.18994391960441134, -0.017899748612035183, 0.09709682628599695, 0.09447710902313702, 0.1574123560116277, 0.11290855886763893, -0.15980352371570916, 0.10901033904519863, 0.14986721503955777]
|
1,803.03847
|
Structure and Stability of Charged Colloid-Nanoparticle Mixtures
|
Physical properties of colloidal materials can be modified by addition of
nanoparticles. Within a model of like-charged mixtures of particles governed by
effective electrostatic interactions, we explore the influence of charged
nanoparticles on the structure and thermodynamic phase stability of
charge-stabilized colloidal suspensions. Focusing on salt-free mixtures of
particles of high size and charge asymmetry, interacting via repulsive Yukawa
effective pair potentials, we perform molecular dynamics simulations and
compute radial distribution functions and static structure factors. Analysis of
these structural properties indicates that increasing the charge and
concentration of nanoparticles progressively weakens correlations between
charged colloids. We show that addition of charged nanoparticles to a
suspension of like-charged colloids can induce a colloidal crystal to melt and
can facilitate aggregation of a fluid suspension due to attractive van der
Waals interactions. We attribute the destabilizing influence of charged
nanoparticles to enhanced screening of electrostatic interactions, which
weakens repulsion between charged colloids. This interpretation is consistent
with recent predictions of an effective interaction theory of charged
colloid-nanoparticle mixtures.
|
cond-mat.soft
|
physical properties of colloidal materials can be modified by addition of nanoparticles within a model of likecharged mixtures of particles governed by effective electrostatic interactions we explore the influence of charged nanoparticles on the structure and thermodynamic phase stability of chargestabilized colloidal suspensions focusing on saltfree mixtures of particles of high size and charge asymmetry interacting via repulsive yukawa effective pair potentials we perform molecular dynamics simulations and compute radial distribution functions and static structure factors analysis of these structural properties indicates that increasing the charge and concentration of nanoparticles progressively weakens correlations between charged colloids we show that addition of charged nanoparticles to a suspension of likecharged colloids can induce a colloidal crystal to melt and can facilitate aggregation of a fluid suspension due to attractive van der waals interactions we attribute the destabilizing influence of charged nanoparticles to enhanced screening of electrostatic interactions which weakens repulsion between charged colloids this interpretation is consistent with recent predictions of an effective interaction theory of charged colloidnanoparticle mixtures
|
[['physical', 'properties', 'of', 'colloidal', 'materials', 'can', 'be', 'modified', 'by', 'addition', 'of', 'nanoparticles', 'within', 'a', 'model', 'of', 'likecharged', 'mixtures', 'of', 'particles', 'governed', 'by', 'effective', 'electrostatic', 'interactions', 'we', 'explore', 'the', 'influence', 'of', 'charged', 'nanoparticles', 'on', 'the', 'structure', 'and', 'thermodynamic', 'phase', 'stability', 'of', 'chargestabilized', 'colloidal', 'suspensions', 'focusing', 'on', 'saltfree', 'mixtures', 'of', 'particles', 'of', 'high', 'size', 'and', 'charge', 'asymmetry', 'interacting', 'via', 'repulsive', 'yukawa', 'effective', 'pair', 'potentials', 'we', 'perform', 'molecular', 'dynamics', 'simulations', 'and', 'compute', 'radial', 'distribution', 'functions', 'and', 'static', 'structure', 'factors', 'analysis', 'of', 'these', 'structural', 'properties', 'indicates', 'that', 'increasing', 'the', 'charge', 'and', 'concentration', 'of', 'nanoparticles', 'progressively', 'weakens', 'correlations', 'between', 'charged', 'colloids', 'we', 'show', 'that', 'addition', 'of', 'charged', 'nanoparticles', 'to', 'a', 'suspension', 'of', 'likecharged', 'colloids', 'can', 'induce', 'a', 'colloidal', 'crystal', 'to', 'melt', 'and', 'can', 'facilitate', 'aggregation', 'of', 'a', 'fluid', 'suspension', 'due', 'to', 'attractive', 'van', 'der', 'waals', 'interactions', 'we', 'attribute', 'the', 'destabilizing', 'influence', 'of', 'charged', 'nanoparticles', 'to', 'enhanced', 'screening', 'of', 'electrostatic', 'interactions', 'which', 'weakens', 'repulsion', 'between', 'charged', 'colloids', 'this', 'interpretation', 'is', 'consistent', 'with', 'recent', 'predictions', 'of', 'an', 'effective', 'interaction', 'theory', 'of', 'charged', 'colloidnanoparticle', 'mixtures']]
|
[-0.12805845901224178, 0.2676823636474325, -0.0877274124464441, 0.034980892265462374, 0.02072696417643049, -0.1598265689253493, 0.0068195744057141065, 0.368825286183596, -0.23370758945638515, -0.3122963452857571, -0.0858114606059852, -0.33323474755757543, -0.15354692144038895, 0.048078432060632274, 0.06542515807858029, 0.028211340256293405, 0.00319712238767779, -0.08934176564272718, -0.03800669212612402, -0.15362575772521367, 0.25976447142374487, 0.07218718276701373, 0.2672643629968705, 0.17134199699061553, 0.08472518851778593, 0.06871989517225828, 0.06268829555974442, 0.11350462934933603, -0.19510950842153083, 0.12180823582527509, 0.15777109094919267, -0.08949312120844352, 0.192215285359332, -0.4866012211058693, -0.22504573214395218, 0.1011518100865679, 0.19403070366958222, 0.14035294394370684, -0.13877667058736132, -0.28767820949952333, 0.036517157920647456, -0.17017958124998553, -0.1440704707505114, -0.12096623601027237, 0.03295232720058748, 0.13725228417743313, -0.28980614971832364, 0.15352916314721765, 0.07178738887186151, 0.058488153010965827, -0.14238469623848346, -0.08155943811113711, -0.040178548830774534, 0.07360173306632675, 0.09092815452204815, -0.05495409654167267, 0.32906415580816745, -0.17645734410413194, -0.04053188743720572, 0.4017104295149715, -0.06312132407265929, -0.20636480518740163, 0.2999167175099523, -0.11410489376544593, -0.03986283386454368, 0.18299756467297493, 0.21572631824563862, 0.12128807787491705, -0.17689159481171854, 0.07612768493113052, -0.0012322116295347013, 0.23968774835994267, 0.10106071433282446, -0.0008736076092919761, 0.29881378693831523, 0.20752295334430704, -0.020012569972818875, 0.19038884308545412, -0.033811842367692614, -0.1282611726443087, -0.1635548681531281, -0.20225303493305502, -0.177762085361496, 0.023474092356049237, -0.1503927448271081, -0.22069903006440544, 0.31261410298252323, 0.10419901371905468, 0.16049383967239633, -0.021872487767032874, 0.19216108017990993, -0.019421547796459396, 0.03636471967560699, -0.07939500466033995, 0.2979740992508245, 0.17612212293231524, 0.0928237628898617, -0.28776137744278524, 0.06400926308832636, 0.0838572388018358]
|
1,803.03848
|
WDEC - A code for modeling white dwarf structure and pulsations
|
The White Dwarf Evolution Code (WDEC), written in Fortran, makes models of
white dwarf stars. It is fast, versatile, and includes the latest physics. The
code evolves hot (~ 100,000 K) input models down to a chosen effective
temperature by relaxing the models to be solutions of the equations of stellar
structure. The code can also be used to obtain g-mode oscillation modes for the
models. WDEC has a long history going back to the late 1960's. Over the years,
it has been updated and re-packaged for modern computer architectures, and has
specifically been used in computationally intensive asteroseismic fitting.
Generations of white dwarf astronomers and dozens of publications have made use
of the WDEC, although the last true instrument paper is the original one,
published in 1975. This paper discusses the history of the code, necessary to
understand why it works the way it does, details the physics and features in
the code today, and points the reader to where to find the code and a user
guide.
|
astro-ph.IM astro-ph.SR
|
the white dwarf evolution code wdec written in fortran makes models of white dwarf stars it is fast versatile and includes the latest physics the code evolves hot 100000 k input models down to a chosen effective temperature by relaxing the models to be solutions of the equations of stellar structure the code can also be used to obtain gmode oscillation modes for the models wdec has a long history going back to the late 1960s over the years it has been updated and repackaged for modern computer architectures and has specifically been used in computationally intensive asteroseismic fitting generations of white dwarf astronomers and dozens of publications have made use of the wdec although the last true instrument paper is the original one published in 1975 this paper discusses the history of the code necessary to understand why it works the way it does details the physics and features in the code today and points the reader to where to find the code and a user guide
|
[['the', 'white', 'dwarf', 'evolution', 'code', 'wdec', 'written', 'in', 'fortran', 'makes', 'models', 'of', 'white', 'dwarf', 'stars', 'it', 'is', 'fast', 'versatile', 'and', 'includes', 'the', 'latest', 'physics', 'the', 'code', 'evolves', 'hot', '100000', 'k', 'input', 'models', 'down', 'to', 'a', 'chosen', 'effective', 'temperature', 'by', 'relaxing', 'the', 'models', 'to', 'be', 'solutions', 'of', 'the', 'equations', 'of', 'stellar', 'structure', 'the', 'code', 'can', 'also', 'be', 'used', 'to', 'obtain', 'gmode', 'oscillation', 'modes', 'for', 'the', 'models', 'wdec', 'has', 'a', 'long', 'history', 'going', 'back', 'to', 'the', 'late', '1960s', 'over', 'the', 'years', 'it', 'has', 'been', 'updated', 'and', 'repackaged', 'for', 'modern', 'computer', 'architectures', 'and', 'has', 'specifically', 'been', 'used', 'in', 'computationally', 'intensive', 'asteroseismic', 'fitting', 'generations', 'of', 'white', 'dwarf', 'astronomers', 'and', 'dozens', 'of', 'publications', 'have', 'made', 'use', 'of', 'the', 'wdec', 'although', 'the', 'last', 'true', 'instrument', 'paper', 'is', 'the', 'original', 'one', 'published', 'in', '1975', 'this', 'paper', 'discusses', 'the', 'history', 'of', 'the', 'code', 'necessary', 'to', 'understand', 'why', 'it', 'works', 'the', 'way', 'it', 'does', 'details', 'the', 'physics', 'and', 'features', 'in', 'the', 'code', 'today', 'and', 'points', 'the', 'reader', 'to', 'where', 'to', 'find', 'the', 'code', 'and', 'a', 'user', 'guide']]
|
[-0.03532231497367667, 0.0818688988497126, -0.11623030505143106, 0.11333779521477741, -0.1421837351490034, -0.14175025970845517, 0.03378838286845989, 0.35346327984007075, -0.2358388334534885, -0.3575009636392462, 0.10868455847126565, -0.27984274922692703, -0.09522386122539285, 0.22105126040488748, -0.07225251357158413, 0.0586319665460559, 0.11844405392669917, 0.014650651701750965, -0.04460469446937731, -0.3433146787449784, 0.25489248260037994, 0.13963806878642313, 0.18568347572969893, -0.03482121050806849, 0.05554360083849696, -0.069079515585188, -0.09717819746029341, -0.07896458756347004, -0.1435667265572452, 0.040039545776727165, 0.25739509714436454, 0.19044618970725596, 0.2646685785494767, -0.4261926890217832, -0.2473062844940051, 0.04116719127133755, 0.17137618241776226, 0.12945520035975192, -0.03247690951130131, -0.21936320976376356, 0.07152656186302747, -0.20675355542473317, -0.11713263175417003, -0.03295255409223804, 0.07023859800149997, -0.007702551597314293, -0.22327394790738167, -0.005230475094798575, 0.059353581036529726, 0.06412144586127917, -0.0301857467004863, -0.13029993080445343, -0.004239213226052622, 0.16726854700495355, 0.053724101056494486, 0.06808665039716288, 0.0777205564442002, -0.10126272007723205, -0.038478201321032385, 0.3993061223393722, -0.09005739799925193, -0.10049715916240876, 0.21949515132361003, -0.10493815277004614, -0.12804990674721056, 0.0703106086751047, 0.18522290768201596, 0.12070479203802756, -0.1854880449969815, 0.11072963047696421, 0.0056235603710991285, 0.17551054572686553, 0.04619349090873064, -0.007907948348951149, 0.2844940108008727, 0.1650355726427127, -0.04096322376253305, 0.08613373640054349, -0.09784964614387025, -0.08190155385195144, -0.2048056464672776, -0.13468979570149844, -0.1431840783417491, 0.041881880606524646, 0.00503818279434026, -0.16601820969074088, 0.4420606875126915, 0.18991726674860165, 0.13465350406477228, -0.007741764420643449, 0.3191264186364909, 0.06042868451636639, 0.14096376237873864, 0.13124288580591037, 0.23113453521814553, 0.1586000654039838, 0.15316146514808116, -0.16799401138199582, 0.07962304231200722, 0.012864583124783599]
|
1,803.03849
|
Learning to Localize Sound Source in Visual Scenes
|
Visual events are usually accompanied by sounds in our daily lives. We pose
the question: Can the machine learn the correspondence between visual scene and
the sound, and localize the sound source only by observing sound and visual
scene pairs like human? In this paper, we propose a novel unsupervised
algorithm to address the problem of localizing the sound source in visual
scenes. A two-stream network structure which handles each modality, with
attention mechanism is developed for sound source localization. Moreover,
although our network is formulated within the unsupervised learning framework,
it can be extended to a unified architecture with a simple modification for the
supervised and semi-supervised learning settings as well. Meanwhile, a new
sound source dataset is developed for performance evaluation. Our empirical
evaluation shows that the unsupervised method eventually go through false
conclusion in some cases. We show that even with a few supervision, false
conclusion is able to be corrected and the source of sound in a visual scene
can be localized effectively.
|
cs.CV cs.AI cs.MM
|
visual events are usually accompanied by sounds in our daily lives we pose the question can the machine learn the correspondence between visual scene and the sound and localize the sound source only by observing sound and visual scene pairs like human in this paper we propose a novel unsupervised algorithm to address the problem of localizing the sound source in visual scenes a twostream network structure which handles each modality with attention mechanism is developed for sound source localization moreover although our network is formulated within the unsupervised learning framework it can be extended to a unified architecture with a simple modification for the supervised and semisupervised learning settings as well meanwhile a new sound source dataset is developed for performance evaluation our empirical evaluation shows that the unsupervised method eventually go through false conclusion in some cases we show that even with a few supervision false conclusion is able to be corrected and the source of sound in a visual scene can be localized effectively
|
[['visual', 'events', 'are', 'usually', 'accompanied', 'by', 'sounds', 'in', 'our', 'daily', 'lives', 'we', 'pose', 'the', 'question', 'can', 'the', 'machine', 'learn', 'the', 'correspondence', 'between', 'visual', 'scene', 'and', 'the', 'sound', 'and', 'localize', 'the', 'sound', 'source', 'only', 'by', 'observing', 'sound', 'and', 'visual', 'scene', 'pairs', 'like', 'human', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'unsupervised', 'algorithm', 'to', 'address', 'the', 'problem', 'of', 'localizing', 'the', 'sound', 'source', 'in', 'visual', 'scenes', 'a', 'twostream', 'network', 'structure', 'which', 'handles', 'each', 'modality', 'with', 'attention', 'mechanism', 'is', 'developed', 'for', 'sound', 'source', 'localization', 'moreover', 'although', 'our', 'network', 'is', 'formulated', 'within', 'the', 'unsupervised', 'learning', 'framework', 'it', 'can', 'be', 'extended', 'to', 'a', 'unified', 'architecture', 'with', 'a', 'simple', 'modification', 'for', 'the', 'supervised', 'and', 'semisupervised', 'learning', 'settings', 'as', 'well', 'meanwhile', 'a', 'new', 'sound', 'source', 'dataset', 'is', 'developed', 'for', 'performance', 'evaluation', 'our', 'empirical', 'evaluation', 'shows', 'that', 'the', 'unsupervised', 'method', 'eventually', 'go', 'through', 'false', 'conclusion', 'in', 'some', 'cases', 'we', 'show', 'that', 'even', 'with', 'a', 'few', 'supervision', 'false', 'conclusion', 'is', 'able', 'to', 'be', 'corrected', 'and', 'the', 'source', 'of', 'sound', 'in', 'a', 'visual', 'scene', 'can', 'be', 'localized', 'effectively']]
|
[-0.03636530481772442, 0.04507537677460267, -0.1035748313342829, 0.08810767985832972, -0.14754708133035613, -0.18474648481034145, 0.03485136884083403, 0.46095706549233306, -0.2709025645344156, -0.3342580716160522, 0.056574162125760344, -0.26325746384744875, -0.20003969609893546, 0.19644631816263863, -0.17542098846403648, 0.04693829359188341, 0.13371590757324264, 0.10463425086275814, -0.01161826926724104, -0.23131808658108857, 0.29032199757179233, 0.027245135177596067, 0.31398242382433067, 0.0624256835006802, 0.14155040151289033, -0.03115616524787229, -0.03266068434720569, 0.0203262605408166, 0.0037682729247437434, 0.17796414210614442, 0.3612785434662671, 0.22308994725368872, 0.3124466268973102, -0.36628960192197946, -0.2651303743519737, 0.05237995767910145, 0.16143549608155908, 0.145876623081562, -0.06153502479588758, -0.39667441532528863, 0.09618049700922907, -0.17151131779847745, -0.00267269907374225, -0.11929102429930499, -0.017496164698532955, -0.07707469780723046, -0.2698038784012583, 0.062126273168027844, 0.10653829742236966, 0.06815918789295379, -0.0760519729333255, -0.005454272695421101, 0.05654177841211775, 0.16464985627959855, 0.04526863779738813, 0.07399910214792067, 0.13192687194841818, -0.19602198721032343, -0.09879272542670815, 0.3732755715083219, -0.07637698747619183, -0.2293978657804898, 0.2085248298139986, -0.024732641044803366, -0.11344162845415269, 0.10833876840993316, 0.21705843266768904, 0.13010012677976648, -0.18384953558550934, -0.014860444337277378, -0.05673416960610824, 0.19886786430031284, 0.07093813603682567, -0.021460368710675998, 0.22195075185862118, 0.249712873820472, 0.007068356409150282, 0.15576344536977102, -0.13860147432730852, -0.00960884290094861, -0.2660989720405018, -0.1109318639351122, -0.16259758622060713, -0.05810271203378494, -0.0839852027111083, -0.14501906959397487, 0.415295446634538, 0.244341824334784, 0.21058247092704171, 0.1037610046360586, 0.35022730870216995, 0.045268638710586166, 0.0765688724113171, 0.10894893830876329, 0.21747764047813145, -0.01763012930109517, 0.13221571064473292, -0.16228379208865035, 0.0882217399134652, 0.06617913868495759]
|
1,803.0385
|
Long-range phase coexistence models: recent progress on the fractional
Allen-Cahn equation
|
In this set of notes, we present some recent developments on the fractional
Allen-Cahn equation $$ (-\Delta)^s u = u-u^3,$$ with special attention to
$\Gamma$-convergence results, energy and density estimates, convergence of
level sets, Hamiltonian estimates, rigidity and symmetry results.
|
math.AP
|
in this set of notes we present some recent developments on the fractional allencahn equation deltas u uu3 with special attention to gammaconvergence results energy and density estimates convergence of level sets hamiltonian estimates rigidity and symmetry results
|
[['in', 'this', 'set', 'of', 'notes', 'we', 'present', 'some', 'recent', 'developments', 'on', 'the', 'fractional', 'allencahn', 'equation', 'deltas', 'u', 'uu3', 'with', 'special', 'attention', 'to', 'gammaconvergence', 'results', 'energy', 'and', 'density', 'estimates', 'convergence', 'of', 'level', 'sets', 'hamiltonian', 'estimates', 'rigidity', 'and', 'symmetry', 'results']]
|
[-0.1255170455888698, 0.03429535992051426, -0.03569885038182532, 0.053499922459626474, -0.10239243982849937, -0.0766405993092217, 0.04482773835403159, 0.3262959654001813, -0.25017723154374644, -0.2695535779072854, 0.1351695652211722, -0.38062444074986207, -0.13056236833922172, 0.14875855277243413, -0.13322764938991322, 0.11622544723611913, 0.13461441889797388, -0.012270345499641016, -0.1297978655386128, -0.23185149482206294, 0.33814606129338864, -0.03012351321644689, 0.2229759255179057, 0.1132931854502347, 0.04495019080901617, -0.026150731915166897, 0.0167650702948633, -0.0166459385501711, -0.3439031149701853, 0.19860988796541565, 0.22708090187638605, 0.003538043078917422, 0.35002061383994787, -0.42973642962935726, -0.23232607170326733, 0.07400156471780256, 0.05898776981293371, 0.08930996227029123, -0.07151726362797872, -0.35759260054481656, 0.032946791671412554, -0.10896703556768204, -0.19137763315321585, -0.11970545161564491, 0.019303637703782635, 0.12722435809279742, -0.2362734764128139, 0.14638142227685372, 0.09455548512663595, 0.02724639024879587, -0.1585779274617763, -0.185154630312402, -0.04759530852377219, 0.0008568993254907822, 0.11358194391390211, 0.04954771548402373, 0.05086513634734346, -0.10591931218943118, -0.06785749379349382, 0.33179536361345335, -0.0891933052763833, -0.24421936219656154, 0.12154289045812268, -0.15370793409008338, -0.23201662164769674, 0.0764414963808744, 0.18115964664244338, 0.10124594921638307, -0.13592299125402382, 0.15804133707302084, -0.013773563148309844, 0.11394792960613574, 0.06317868554278423, 0.03491687465851244, 0.007663709748732417, 0.15903073081158495, 0.13409027604288176, 0.05860279513964135, -0.015950164187846606, -0.11554695667061758, -0.4033279103275977, -0.06470220910973455, -0.17388824167612352, 0.10136283600800916, -0.10708949516303715, -0.1571194339347513, 0.4000341555005626, 0.1567293740563879, 0.15503405320065977, 0.08428000435723286, 0.2069641373757469, 0.1997130690360791, -0.06501755504378755, 0.08030535182670544, 0.12162858314312823, 0.21962935413773121, 0.13605866876528844, -0.16546626771359066, -0.06931300804104754, 0.22082179400604218]
|
1,803.03851
|
Revisiting Decomposable Submodular Function Minimization with Incidence
Relations
|
We introduce a new approach to decomposable submodular function minimization
(DSFM) that exploits incidence relations. Incidence relations describe which
variables effectively influence the component functions, and when properly
utilized, they allow for improving the convergence rates of DSFM solvers. Our
main results include the precise parametrization of the DSFM problem based on
incidence relations, the development of new scalable alternative projections
and parallel coordinate descent methods and an accompanying rigorous analysis
of their convergence rates.
|
cs.LG cs.CV cs.DM
|
we introduce a new approach to decomposable submodular function minimization dsfm that exploits incidence relations incidence relations describe which variables effectively influence the component functions and when properly utilized they allow for improving the convergence rates of dsfm solvers our main results include the precise parametrization of the dsfm problem based on incidence relations the development of new scalable alternative projections and parallel coordinate descent methods and an accompanying rigorous analysis of their convergence rates
|
[['we', 'introduce', 'a', 'new', 'approach', 'to', 'decomposable', 'submodular', 'function', 'minimization', 'dsfm', 'that', 'exploits', 'incidence', 'relations', 'incidence', 'relations', 'describe', 'which', 'variables', 'effectively', 'influence', 'the', 'component', 'functions', 'and', 'when', 'properly', 'utilized', 'they', 'allow', 'for', 'improving', 'the', 'convergence', 'rates', 'of', 'dsfm', 'solvers', 'our', 'main', 'results', 'include', 'the', 'precise', 'parametrization', 'of', 'the', 'dsfm', 'problem', 'based', 'on', 'incidence', 'relations', 'the', 'development', 'of', 'new', 'scalable', 'alternative', 'projections', 'and', 'parallel', 'coordinate', 'descent', 'methods', 'and', 'an', 'accompanying', 'rigorous', 'analysis', 'of', 'their', 'convergence', 'rates']]
|
[-0.07983252104992668, 0.022771805927040988, -0.11810105949640275, 0.12346504901225368, -0.11441474656263988, -0.11546679052834709, 0.06575519501542051, 0.39168602096537747, -0.30543612930302816, -0.257520585283637, 0.1076756512063245, -0.21607447050511838, -0.1769051137000012, 0.23268344851831596, -0.05511415398369233, 0.07524149175733327, 0.08061974088350932, -0.06780980564343432, -0.127904560030438, -0.27189629145897926, 0.3025456660147756, 0.05805338238676389, 0.3457733942071597, 0.038703430891036984, 0.12090803492193421, 0.10972463648145397, -0.08398719374711315, 0.007110254072273771, -0.1612213386724276, 0.2010826667631045, 0.240295813800379, 0.22887493514145413, 0.27257032671322423, -0.4135996622343858, -0.12301123542090257, 0.0791894644436737, 0.14753116349379222, 0.07346656618174166, -0.06366212787261853, -0.21016975094253817, 0.024265220407396555, -0.15128479267160097, -0.1246996608407547, -0.13406541973973313, -0.03926035551975171, 0.09745116615047057, -0.29213674042373894, 0.05076100043952465, 0.08412361766522129, 0.06064802603175243, -0.047502423183371625, -0.14800428121661147, 0.04107749787159264, 0.10720226160444629, 0.04079367840041717, 0.007754375208169222, 0.09081185555706421, -0.08464269381637375, -0.12777147656927507, 0.3186479507510861, -0.027335530317698916, -0.25138683314124743, 0.18773640322498977, -0.06290722981095315, -0.14100196570468446, 0.10061529193073511, 0.23807186940064032, 0.18862140280505021, -0.1517283750055746, 0.04448739625280723, -0.01910896656413873, 0.1262620253364245, 0.016648109663898746, 0.018629496321082115, 0.12862767758468788, 0.11638165233967204, 0.12525619259725015, 0.10566307291698952, -0.019482002863660454, -0.07549050753936172, -0.28841043790181475, -0.1331342156790197, -0.09641698026098311, -0.014525454831309617, -0.14272033354830152, -0.16976382746671637, 0.3926941345259547, 0.15525188932195305, 0.16949461193134388, 0.11830260863061995, 0.2984215233102441, 0.13751462079118937, 0.0885198293843617, 0.08708132316668828, 0.20578729619582495, 0.19955200373195112, 0.04685803902025024, -0.20832885045558214, 0.10983737802753846, 0.11807551060492794]
|
1,803.03852
|
A Deep Learning Approach for Pose Estimation from Volumetric OCT Data
|
Tracking the pose of instruments is a central problem in image-guided
surgery. For microscopic scenarios, optical coherence tomography (OCT) is
increasingly used as an imaging modality. OCT is suitable for accurate pose
estimation due to its micrometer range resolution and volumetric field of view.
However, OCT image processing is challenging due to speckle noise and
reflection artifacts in addition to the images' 3D nature. We address pose
estimation from OCT volume data with a new deep learning-based tracking
framework. For this purpose, we design a new 3D convolutional neural network
(CNN) architecture to directly predict the 6D pose of a small marker geometry
from OCT volumes. We use a hexapod robot to automatically acquire labeled data
points which we use to train 3D CNN architectures for multi-output regression.
We use this setup to provide an in-depth analysis on deep learning-based pose
estimation from volumes. Specifically, we demonstrate that exploiting volume
information for pose estimation yields higher accuracy than relying on 2D
representations with depth information. Supporting this observation, we provide
quantitative and qualitative results that 3D CNNs effectively exploit the depth
structure of marker objects. Regarding the deep learning aspect, we present
efficient design principles for 3D CNNs, making use of insights from the 2D
deep learning community. In particular, we present Inception3D as a new
architecture which performs best for our application. We show that our deep
learning approach reaches errors at our ground-truth label's resolution. We
achieve a mean average error of $\SI{14.89 \pm 9.3}{\micro\metre}$ and
$\SI{0.096 \pm 0.072}{\degree}$ for position and orientation learning,
respectively.
|
cs.CV
|
tracking the pose of instruments is a central problem in imageguided surgery for microscopic scenarios optical coherence tomography oct is increasingly used as an imaging modality oct is suitable for accurate pose estimation due to its micrometer range resolution and volumetric field of view however oct image processing is challenging due to speckle noise and reflection artifacts in addition to the images 3d nature we address pose estimation from oct volume data with a new deep learningbased tracking framework for this purpose we design a new 3d convolutional neural network cnn architecture to directly predict the 6d pose of a small marker geometry from oct volumes we use a hexapod robot to automatically acquire labeled data points which we use to train 3d cnn architectures for multioutput regression we use this setup to provide an indepth analysis on deep learningbased pose estimation from volumes specifically we demonstrate that exploiting volume information for pose estimation yields higher accuracy than relying on 2d representations with depth information supporting this observation we provide quantitative and qualitative results that 3d cnns effectively exploit the depth structure of marker objects regarding the deep learning aspect we present efficient design principles for 3d cnns making use of insights from the 2d deep learning community in particular we present inception3d as a new architecture which performs best for our application we show that our deep learning approach reaches errors at our groundtruth labels resolution we achieve a mean average error of si1489 pm 93micrometre and si0096 pm 0072degree for position and orientation learning respectively
|
[['tracking', 'the', 'pose', 'of', 'instruments', 'is', 'a', 'central', 'problem', 'in', 'imageguided', 'surgery', 'for', 'microscopic', 'scenarios', 'optical', 'coherence', 'tomography', 'oct', 'is', 'increasingly', 'used', 'as', 'an', 'imaging', 'modality', 'oct', 'is', 'suitable', 'for', 'accurate', 'pose', 'estimation', 'due', 'to', 'its', 'micrometer', 'range', 'resolution', 'and', 'volumetric', 'field', 'of', 'view', 'however', 'oct', 'image', 'processing', 'is', 'challenging', 'due', 'to', 'speckle', 'noise', 'and', 'reflection', 'artifacts', 'in', 'addition', 'to', 'the', 'images', '3d', 'nature', 'we', 'address', 'pose', 'estimation', 'from', 'oct', 'volume', 'data', 'with', 'a', 'new', 'deep', 'learningbased', 'tracking', 'framework', 'for', 'this', 'purpose', 'we', 'design', 'a', 'new', '3d', 'convolutional', 'neural', 'network', 'cnn', 'architecture', 'to', 'directly', 'predict', 'the', '6d', 'pose', 'of', 'a', 'small', 'marker', 'geometry', 'from', 'oct', 'volumes', 'we', 'use', 'a', 'hexapod', 'robot', 'to', 'automatically', 'acquire', 'labeled', 'data', 'points', 'which', 'we', 'use', 'to', 'train', '3d', 'cnn', 'architectures', 'for', 'multioutput', 'regression', 'we', 'use', 'this', 'setup', 'to', 'provide', 'an', 'indepth', 'analysis', 'on', 'deep', 'learningbased', 'pose', 'estimation', 'from', 'volumes', 'specifically', 'we', 'demonstrate', 'that', 'exploiting', 'volume', 'information', 'for', 'pose', 'estimation', 'yields', 'higher', 'accuracy', 'than', 'relying', 'on', '2d', 'representations', 'with', 'depth', 'information', 'supporting', 'this', 'observation', 'we', 'provide', 'quantitative', 'and', 'qualitative', 'results', 'that', '3d', 'cnns', 'effectively', 'exploit', 'the', 'depth', 'structure', 'of', 'marker', 'objects', 'regarding', 'the', 'deep', 'learning', 'aspect', 'we', 'present', 'efficient', 'design', 'principles', 'for', '3d', 'cnns', 'making', 'use', 'of', 'insights', 'from', 'the', '2d', 'deep', 'learning', 'community', 'in', 'particular', 'we', 'present', 'inception3d', 'as', 'a', 'new', 'architecture', 'which', 'performs', 'best', 'for', 'our', 'application', 'we', 'show', 'that', 'our', 'deep', 'learning', 'approach', 'reaches', 'errors', 'at', 'our', 'groundtruth', 'labels', 'resolution', 'we', 'achieve', 'a', 'mean', 'average', 'error', 'of', 'si1489', 'pm', '93micrometre', 'and', 'si0096', 'pm', '0072degree', 'for', 'position', 'and', 'orientation', 'learning', 'respectively']]
|
[-0.01852243765819049, -0.04380074094152651, -0.06730053218133333, 0.04809225815217129, -0.09705892593474201, -0.18013818439887097, 0.0010617398121024644, 0.4806934656900546, -0.26362428649343433, -0.35438130595832174, 0.10941968962322876, -0.24398833691948169, -0.21951639033403128, 0.20805576895844072, -0.20659716383347082, 0.10957384595831317, 0.15676551562778296, 0.0015772563658954044, -0.08867167931009409, -0.20947217020321182, 0.27284654699374983, 0.03201070163500151, 0.3390457043692189, 0.013044328223230199, 0.1649909596719284, 0.03479802804363389, -0.024984642939035972, -0.004021769024095395, -0.11107214368620055, 0.22788255229095247, 0.3012491387522055, 0.18752272155954472, 0.2660818739871805, -0.4187217106384831, -0.23882446448884107, 0.05147806887832722, 0.14043286708848818, 0.14906432419841636, -0.052496500495296444, -0.34729631398139255, 0.06721406454213023, -0.1167440659769382, -0.03347765724544251, -0.14848597778288264, -0.018704440172841136, -0.07469468497734014, -0.3036056252241242, 0.06796010269502563, 0.003565870578602208, 0.11214447290440725, -0.08197771944382805, -0.08498130463911886, 0.07875234805812527, 0.2123202852228479, -0.03868244631106906, 0.09189851155009357, 0.13561528466276027, -0.24081100641180658, -0.1004245292828677, 0.34065576520792784, -0.009466652512018631, -0.20308319769988192, 0.18392349813606532, -0.058070685895573765, -0.14820652458048056, 0.14842255448272068, 0.268340352788708, 0.09911283715406344, -0.13529286090499862, -0.0223655037737603, -0.03478839833636783, 0.243167052266746, 0.03756867380191883, 0.0178117887662088, 0.19830912141413945, 0.3009058307266853, 0.0467940201550456, 0.11842495452710575, -0.26403585328195717, -0.009911030667671373, -0.20957536813211702, -0.1400766612474861, -0.18742115872391013, 0.015181401922341643, -0.10435625033549889, -0.14474798711423303, 0.37719493657572284, 0.2792141170773123, 0.21362602619254695, 0.1122428560749598, 0.38370426350997555, 0.019052990929580235, 0.11102157635318619, 0.06611887711499419, 0.2087133416109917, 0.04819707398853516, 0.1427545853454383, -0.16171446906232703, 0.020167242658476064, 0.07139103745234139]
|
1,803.03853
|
Low-altitude ion heating, downflowing ions, and BBELF waves in the
return current region
|
Heavy (O+) ion energization and field-aligned motion in and near the
ionosphere are still not well understood. Based on observations from the
CASSIOPE Enhanced Polar Outflow Probe (e-POP) at altitudes between 325 km and
730 km over one year, we present a statistical study (24 events) of ion heating
and its relation to field-aligned ion bulk flow velocity, low-frequency waves
and field-aligned currents (FACs). The ion temperature and field-aligned bulk
flow velocity are derived from 2-D ion velocity distribution functions measured
by the suprathermal electron imager (SEI) instrument. Consistent ion heating
and flow velocity characteristics are observed from both the SEI and the
rapid-scanning ion mass spectrometer (IRM) instruments. We find that transverse
O+ ion heating in the ionosphere can be intense (up to 4.5 eV), confined to
very narrow regions (~ 2 km across B), is more likely to occur in the downward
current region, and is associated with broadband extremely low frequency
(BBELF) waves. These waves are interpreted as linearly polarized perpendicular
to the magnetic field. The amount of ion heating cannot be explained by
frictional heating, and the correlation of ion heating with BBELF waves suggest
that significant wave-ion heating is occurring and even dominating at altitudes
as low as 350 km, a boundary that is lower than previously reported.
Surprisingly, the majority of these heating events (17 out 24) are associated
with core ion downflows rather than upflows. This may be explained by a
downward-pointing electric field in the low-altitude return current region.
|
physics.space-ph physics.plasm-ph
|
heavy o ion energization and fieldaligned motion in and near the ionosphere are still not well understood based on observations from the cassiope enhanced polar outflow probe epop at altitudes between 325 km and 730 km over one year we present a statistical study 24 events of ion heating and its relation to fieldaligned ion bulk flow velocity lowfrequency waves and fieldaligned currents facs the ion temperature and fieldaligned bulk flow velocity are derived from 2d ion velocity distribution functions measured by the suprathermal electron imager sei instrument consistent ion heating and flow velocity characteristics are observed from both the sei and the rapidscanning ion mass spectrometer irm instruments we find that transverse o ion heating in the ionosphere can be intense up to 45 ev confined to very narrow regions 2 km across b is more likely to occur in the downward current region and is associated with broadband extremely low frequency bbelf waves these waves are interpreted as linearly polarized perpendicular to the magnetic field the amount of ion heating cannot be explained by frictional heating and the correlation of ion heating with bbelf waves suggest that significant waveion heating is occurring and even dominating at altitudes as low as 350 km a boundary that is lower than previously reported surprisingly the majority of these heating events 17 out 24 are associated with core ion downflows rather than upflows this may be explained by a downwardpointing electric field in the lowaltitude return current region
|
[['heavy', 'o', 'ion', 'energization', 'and', 'fieldaligned', 'motion', 'in', 'and', 'near', 'the', 'ionosphere', 'are', 'still', 'not', 'well', 'understood', 'based', 'on', 'observations', 'from', 'the', 'cassiope', 'enhanced', 'polar', 'outflow', 'probe', 'epop', 'at', 'altitudes', 'between', '325', 'km', 'and', '730', 'km', 'over', 'one', 'year', 'we', 'present', 'a', 'statistical', 'study', '24', 'events', 'of', 'ion', 'heating', 'and', 'its', 'relation', 'to', 'fieldaligned', 'ion', 'bulk', 'flow', 'velocity', 'lowfrequency', 'waves', 'and', 'fieldaligned', 'currents', 'facs', 'the', 'ion', 'temperature', 'and', 'fieldaligned', 'bulk', 'flow', 'velocity', 'are', 'derived', 'from', '2d', 'ion', 'velocity', 'distribution', 'functions', 'measured', 'by', 'the', 'suprathermal', 'electron', 'imager', 'sei', 'instrument', 'consistent', 'ion', 'heating', 'and', 'flow', 'velocity', 'characteristics', 'are', 'observed', 'from', 'both', 'the', 'sei', 'and', 'the', 'rapidscanning', 'ion', 'mass', 'spectrometer', 'irm', 'instruments', 'we', 'find', 'that', 'transverse', 'o', 'ion', 'heating', 'in', 'the', 'ionosphere', 'can', 'be', 'intense', 'up', 'to', '45', 'ev', 'confined', 'to', 'very', 'narrow', 'regions', '2', 'km', 'across', 'b', 'is', 'more', 'likely', 'to', 'occur', 'in', 'the', 'downward', 'current', 'region', 'and', 'is', 'associated', 'with', 'broadband', 'extremely', 'low', 'frequency', 'bbelf', 'waves', 'these', 'waves', 'are', 'interpreted', 'as', 'linearly', 'polarized', 'perpendicular', 'to', 'the', 'magnetic', 'field', 'the', 'amount', 'of', 'ion', 'heating', 'can', 'not', 'be', 'explained', 'by', 'frictional', 'heating', 'and', 'the', 'correlation', 'of', 'ion', 'heating', 'with', 'bbelf', 'waves', 'suggest', 'that', 'significant', 'waveion', 'heating', 'is', 'occurring', 'and', 'even', 'dominating', 'at', 'altitudes', 'as', 'low', 'as', '350', 'km', 'a', 'boundary', 'that', 'is', 'lower', 'than', 'previously', 'reported', 'surprisingly', 'the', 'majority', 'of', 'these', 'heating', 'events', '17', 'out', '24', 'are', 'associated', 'with', 'core', 'ion', 'downflows', 'rather', 'than', 'upflows', 'this', 'may', 'be', 'explained', 'by', 'a', 'downwardpointing', 'electric', 'field', 'in', 'the', 'lowaltitude', 'return', 'current', 'region']]
|
[-0.12055702960646143, 0.2841631399305282, 0.022156211819994377, 0.07843995532088553, -0.02247191766562922, -0.11759062240871647, -0.02236984854301291, 0.43053233374636696, -0.2359629879885303, -0.3386198275730292, 0.06838026171727918, -0.29195240115229026, 0.01147174564889667, 0.25186440267496746, 0.009778964403037105, -0.0335430398922031, 0.05575650613812954, -0.05288664706213655, -0.0075006702203782765, -0.10848950425209285, 0.20925509370476997, 0.14662890714357502, 0.24246070952409746, 0.0934519156827147, 0.06830112210617892, -0.12945595286647438, -0.002104621282176074, 0.04977277323943698, -0.10132128163962408, 0.042532856851725365, 0.24046751181498416, 0.031545605387778265, 0.2082542343494092, -0.46241517636356916, -0.24573048318183643, -0.02001074956405398, 0.1624964046150956, 0.05688542465165381, -0.050776766697961655, -0.23674682362770266, 0.023403378992575257, -0.1572280407987566, -0.14526076890195863, 0.03072325505810902, 0.036769011872337505, 0.056397251461157226, -0.2723955839207682, 0.1483787620832363, 0.027277698912812374, 0.1332219062465788, -0.10920088014061102, -0.11140960770663014, -0.10672792159426664, 0.012497324814355287, 0.07092898882755476, 0.09391002317878931, 0.2504968751295319, -0.09076657104237541, -0.02703202729518197, 0.3604303731919262, -0.09616202373152764, -0.06091944882994, 0.2199822482367962, -0.2592211220842396, -0.039455053004285486, 0.2567187450339253, 0.17530831321011223, 0.07611712436790721, -0.13267671532641045, -0.050464782056193876, -0.017775702852991515, 0.1321461251706045, 0.13455136444350063, 0.030140268220276382, 0.30181116049653267, 0.09491966126237404, 0.06318758198357655, 0.07484034446126799, -0.2329311407662936, -0.016631762570550827, -0.269442573025498, -0.09577330887796844, -0.09894715413969025, 0.027781962154407047, -0.04324772086554097, -0.10030554554278333, 0.3640214719141049, 0.16390651430697006, 0.17450210637184965, -0.0498217814004182, 0.2998173259666259, 0.11382227514134295, 0.07837723588297546, 0.18244567455209915, 0.2993328373268618, 0.17449204492985554, 0.1712307015900535, -0.2612750533943092, 0.091456421073217, 0.010632060300095076]
|
1,803.03854
|
Multiparametric shell eigenvalue problems
|
The eigenproblem for thin shells of revolution under uncertainty in material
parameters is discussed. Here the focus is on the smallest eigenpairs. Shells
of revolution have natural eigenclusters due to symmetries, moreover, the
eigenpairs depend on a deterministic parameter, the dimensionless thickness.
The stochastic subspace iteration algorithms presented here are capable of
resolving the smallest eigenclusters. In the case of random material
parameters, it is possible that the eigenmodes cross in the stochastic
parameter space. This interesting phenomenon is demonstrated via numerical
experiments. Finally, the effect of the chosen material model on the
asymptotics in relation to the deterministic parameter is shown to be
negligible.
|
math.NA
|
the eigenproblem for thin shells of revolution under uncertainty in material parameters is discussed here the focus is on the smallest eigenpairs shells of revolution have natural eigenclusters due to symmetries moreover the eigenpairs depend on a deterministic parameter the dimensionless thickness the stochastic subspace iteration algorithms presented here are capable of resolving the smallest eigenclusters in the case of random material parameters it is possible that the eigenmodes cross in the stochastic parameter space this interesting phenomenon is demonstrated via numerical experiments finally the effect of the chosen material model on the asymptotics in relation to the deterministic parameter is shown to be negligible
|
[['the', 'eigenproblem', 'for', 'thin', 'shells', 'of', 'revolution', 'under', 'uncertainty', 'in', 'material', 'parameters', 'is', 'discussed', 'here', 'the', 'focus', 'is', 'on', 'the', 'smallest', 'eigenpairs', 'shells', 'of', 'revolution', 'have', 'natural', 'eigenclusters', 'due', 'to', 'symmetries', 'moreover', 'the', 'eigenpairs', 'depend', 'on', 'a', 'deterministic', 'parameter', 'the', 'dimensionless', 'thickness', 'the', 'stochastic', 'subspace', 'iteration', 'algorithms', 'presented', 'here', 'are', 'capable', 'of', 'resolving', 'the', 'smallest', 'eigenclusters', 'in', 'the', 'case', 'of', 'random', 'material', 'parameters', 'it', 'is', 'possible', 'that', 'the', 'eigenmodes', 'cross', 'in', 'the', 'stochastic', 'parameter', 'space', 'this', 'interesting', 'phenomenon', 'is', 'demonstrated', 'via', 'numerical', 'experiments', 'finally', 'the', 'effect', 'of', 'the', 'chosen', 'material', 'model', 'on', 'the', 'asymptotics', 'in', 'relation', 'to', 'the', 'deterministic', 'parameter', 'is', 'shown', 'to', 'be', 'negligible']]
|
[-0.12800903983518155, 0.12219476204329324, -0.026363430472398267, 0.039356779365899784, -0.08999405130382301, -0.08993572005278712, 0.019381850194954538, 0.36205840948064927, -0.28693575443229774, -0.2600052233297125, 0.11331030744064635, -0.27024609367679625, -0.1602001503580114, 0.23459382496041797, -0.05470542254116278, 0.11046147983955237, 0.05719027839130857, 0.02652513838002404, -0.052125014218352556, -0.21830559028674243, 0.34498408160543126, 0.08893033676216767, 0.25843743051320894, 0.03359071630701983, 0.10943219740196918, -0.07649129560416185, 0.010052861067131885, 0.014806682813304557, -0.1746250053224729, 0.04800974036955718, 0.22394147336096457, 0.06816068154678327, 0.2603496463598629, -0.41262051044484077, -0.19594091729450863, 0.0974174938842799, 0.1416121902372643, 0.10348883473757402, -0.03502440279308996, -0.23103564846311306, 0.061825908734056266, -0.11139305581528584, -0.1471621220348204, -0.05345779753208739, 0.06975337676364857, 0.0116122822521381, -0.26317287161234243, 0.06417538447405022, 0.056707320272587965, -0.006010829228048836, -0.04359655457919518, -0.11543078491581803, -0.011489560221801105, 0.06944686530194091, 0.09479741500441925, -0.04470497407742496, 0.12696454089894457, -0.08007019226330793, -0.07000612873511697, 0.4065837792111832, -0.01786030891172823, -0.2730821186626608, 0.10754546770844066, -0.14629202393037313, -0.10595526856153263, 0.12738747715959053, 0.17869421553564058, 0.14808566477240145, -0.10981048799110847, 0.14554180967106115, -0.058230033931005926, 0.16724018150379935, 0.033457382512052804, 0.016032584730391073, 0.15079470178636822, 0.20167771988159533, 0.07190499961425921, 0.14046447685110447, -0.07777193406804746, -0.1320255043740086, -0.29032678958209396, -0.14831386776460173, -0.24081052501586456, -0.01110448243855996, -0.1422451938642641, -0.17372133442764712, 0.3930714400530368, 0.15388817740694702, 0.20700647520100318, -0.016749339042575036, 0.27469519019416233, 0.1367975983099596, 0.0675661766413346, 0.0467283292935604, 0.3058784187712607, 0.15916713814531425, 0.030779231434775, -0.2464470037675092, 0.11226538534827747, 0.06691860239184236]
|
1,803.03855
|
Determination of the 4-genus of a complete graph (with an appendix)
|
In this paper, the quadrangular genus (4-genus) of the complete graph $K_p$
is shown to be $\gamma_4 (K_p) = \lceil {p(p-5)}/{8} \rceil +1$ for orientable
surfaces. This means that $K_p$ is minimally embeddable in the closed
orientable surface of genus $\gamma_4 (K_p)$ under the constraint that each
face has length at least 4. In the most general setting, the genus of the
complete graph was established by Ringel and Youngs and was mainly concerned
with triangulations of surfaces. Nonetheless, since then a great deal of
interest has also been generated in quadrangulations of surfaces. Hartsfield
and Ringel were the first who considered minimal quadrangulations of surfaces.
Sections 1--4 of this paper are essentially a reproduction of the original
1998 version as follows: Chen B., Lawrencenko S., Yang H. Determination of the
4-genus of a complete graph, submitted to Discrete Mathematics and withdrawn by
S. Lawrencenko, June 1998, URL: https://t.co/cUg6R9Jwyw . More discussion on
this 1998 version is held and some copyright issues around the quadrangular
genus of complete graphs are clarified in the Appendix to the current version
of the paper; the Appendix was written in 2017.
|
math.CO
|
in this paper the quadrangular genus 4genus of the complete graph k_p is shown to be gamma_4 k_p lceil pp58 rceil 1 for orientable surfaces this means that k_p is minimally embeddable in the closed orientable surface of genus gamma_4 k_p under the constraint that each face has length at least 4 in the most general setting the genus of the complete graph was established by ringel and youngs and was mainly concerned with triangulations of surfaces nonetheless since then a great deal of interest has also been generated in quadrangulations of surfaces hartsfield and ringel were the first who considered minimal quadrangulations of surfaces sections 14 of this paper are essentially a reproduction of the original 1998 version as follows chen b lawrencenko s yang h determination of the 4genus of a complete graph submitted to discrete mathematics and withdrawn by s lawrencenko june 1998 url httpstcocug6r9jwyw more discussion on this 1998 version is held and some copyright issues around the quadrangular genus of complete graphs are clarified in the appendix to the current version of the paper the appendix was written in 2017
|
[['in', 'this', 'paper', 'the', 'quadrangular', 'genus', '4genus', 'of', 'the', 'complete', 'graph', 'k_p', 'is', 'shown', 'to', 'be', 'gamma_4', 'k_p', 'lceil', 'pp58', 'rceil', '1', 'for', 'orientable', 'surfaces', 'this', 'means', 'that', 'k_p', 'is', 'minimally', 'embeddable', 'in', 'the', 'closed', 'orientable', 'surface', 'of', 'genus', 'gamma_4', 'k_p', 'under', 'the', 'constraint', 'that', 'each', 'face', 'has', 'length', 'at', 'least', '4', 'in', 'the', 'most', 'general', 'setting', 'the', 'genus', 'of', 'the', 'complete', 'graph', 'was', 'established', 'by', 'ringel', 'and', 'youngs', 'and', 'was', 'mainly', 'concerned', 'with', 'triangulations', 'of', 'surfaces', 'nonetheless', 'since', 'then', 'a', 'great', 'deal', 'of', 'interest', 'has', 'also', 'been', 'generated', 'in', 'quadrangulations', 'of', 'surfaces', 'hartsfield', 'and', 'ringel', 'were', 'the', 'first', 'who', 'considered', 'minimal', 'quadrangulations', 'of', 'surfaces', 'sections', '14', 'of', 'this', 'paper', 'are', 'essentially', 'a', 'reproduction', 'of', 'the', 'original', '1998', 'version', 'as', 'follows', 'chen', 'b', 'lawrencenko', 's', 'yang', 'h', 'determination', 'of', 'the', '4genus', 'of', 'a', 'complete', 'graph', 'submitted', 'to', 'discrete', 'mathematics', 'and', 'withdrawn', 'by', 's', 'lawrencenko', 'june', '1998', 'url', 'httpstcocug6r9jwyw', 'more', 'discussion', 'on', 'this', '1998', 'version', 'is', 'held', 'and', 'some', 'copyright', 'issues', 'around', 'the', 'quadrangular', 'genus', 'of', 'complete', 'graphs', 'are', 'clarified', 'in', 'the', 'appendix', 'to', 'the', 'current', 'version', 'of', 'the', 'paper', 'the', 'appendix', 'was', 'written', 'in', '2017']]
|
[-0.14867616542541032, 0.10162707288538553, -0.057940839717771794, 0.033668195295600396, -0.07960760443778811, -0.15513353101981198, -0.014513613471570964, 0.32640505171746265, -0.2149086919316034, -0.3136398074312331, 0.11333761450986363, -0.32045447804774696, -0.1449359618821979, 0.16686351350457176, -0.1968153706129167, 0.01972508390410932, 0.0723382444018035, 0.04661629936215339, -0.008160635095748289, -0.3634520707629783, 0.2921365647427532, 0.02187982125681161, 0.1983705879959602, 0.11716283556911322, 0.05941345135665895, 0.026312220491113873, -0.03617097642427074, 0.03626641469045403, -0.21731106180593807, 0.11620188583954345, 0.2714341547937024, 0.0596626219661258, 0.19163583545786075, -0.38057961822770414, -0.16430932353122046, 0.12975362554650485, 0.08673066554786586, 0.036367757186725816, 0.009114401968365191, -0.2568451552600368, 0.12036916639820482, -0.10794481033078544, -0.13806279485232265, 0.027994757837188838, 0.12324174962814341, -0.05327260962980722, -0.17754345544670497, 0.02059281697655637, 0.14258991330038776, 0.14644819376244111, 0.037265815211264465, -0.16109583810555816, -0.09315789006496085, 0.09066345259413452, 0.006557495061832979, 0.13720540771677636, 0.007253802808526471, -0.10316261278146374, -0.12361597695429064, 0.35633571731513214, -0.020922244549600295, -0.16714254034508164, 0.12204397578842073, -0.13404636712261161, -0.1760597053673427, 0.14082090861745467, 0.11969917420380188, 0.15371303462799, -0.14105695459055226, 0.18366897669691562, -0.10729186017277204, 0.11304466879942059, 0.17837271706113664, -0.0770430100206363, 0.13190506055091833, 0.11603671991625204, 0.0688323248203494, 0.16000953547396693, -0.011119858461473323, 0.00035306491801587257, -0.3196245014399949, -0.18833074457325988, -0.18049036897204362, 0.07841038572838664, -0.04587405098456496, -0.1437299528848367, 0.41834103593921795, 0.048714045288545484, 0.1538133640073816, 0.07161778847568602, 0.19716676073509026, 0.036561023698636015, 0.012744901851025404, 0.14368819242899014, 0.1687511071063982, 0.19404297936591963, 0.05306253304450325, -0.10029412417940137, 0.03532773958524246, 0.18403190227729674]
|
1,803.03856
|
Light-cone velocities after a global quench in a non-interacting model
|
We study the light-cone velocity for global quenches in the non-interacting
XY chain starting from a class of initial states that are eigenstates of the
local $z$-component of the spin. We point out how translation invariance of the
initial state can affect the maximal speed at which correlations spread. As a
consequence the light-cone velocity can be state-dependent also for
non-interacting systems: a new effect of which we provide clear numerical
evidence and analytic predictions. Analogous considerations, based on numerical
results, are drawn for the evolution of the entanglement entropy.
|
cond-mat.str-el cond-mat.stat-mech
|
we study the lightcone velocity for global quenches in the noninteracting xy chain starting from a class of initial states that are eigenstates of the local zcomponent of the spin we point out how translation invariance of the initial state can affect the maximal speed at which correlations spread as a consequence the lightcone velocity can be statedependent also for noninteracting systems a new effect of which we provide clear numerical evidence and analytic predictions analogous considerations based on numerical results are drawn for the evolution of the entanglement entropy
|
[['we', 'study', 'the', 'lightcone', 'velocity', 'for', 'global', 'quenches', 'in', 'the', 'noninteracting', 'xy', 'chain', 'starting', 'from', 'a', 'class', 'of', 'initial', 'states', 'that', 'are', 'eigenstates', 'of', 'the', 'local', 'zcomponent', 'of', 'the', 'spin', 'we', 'point', 'out', 'how', 'translation', 'invariance', 'of', 'the', 'initial', 'state', 'can', 'affect', 'the', 'maximal', 'speed', 'at', 'which', 'correlations', 'spread', 'as', 'a', 'consequence', 'the', 'lightcone', 'velocity', 'can', 'be', 'statedependent', 'also', 'for', 'noninteracting', 'systems', 'a', 'new', 'effect', 'of', 'which', 'we', 'provide', 'clear', 'numerical', 'evidence', 'and', 'analytic', 'predictions', 'analogous', 'considerations', 'based', 'on', 'numerical', 'results', 'are', 'drawn', 'for', 'the', 'evolution', 'of', 'the', 'entanglement', 'entropy']]
|
[-0.14522307844211657, 0.16541154684188467, -0.14383057505409752, 0.0874357209333943, -0.022984993354313903, -0.09554890347127286, 0.0427328513831728, 0.3544761110511091, -0.2442425285281691, -0.21505991071462632, 0.07193243413672058, -0.28127049673348664, -0.09497337731946674, 0.20332577538987, 0.035383727732631896, 0.07234448620842562, 0.07656276063579652, 0.04141279117288327, -0.14545528213752226, -0.203110250354641, 0.3420315854044424, 0.020530380815681485, 0.2830447307270434, 0.04953703488119775, 0.0767478686136504, 0.018432555280418858, 0.017802399976385965, 0.04927625126308865, -0.1495040115568069, 0.05649413396798385, 0.1681967774199115, 0.09360412495314246, 0.21295830903367863, -0.41867852302061187, -0.19856488440806666, 0.10039349142462015, 0.1797510740476557, 0.20566493770262848, -0.05003126882042529, -0.29885537439129417, 0.020969369152428245, -0.17638731998287968, -0.1940215403938459, -0.09488755865539941, 0.020919820995631097, 0.046440642076130544, -0.2625560839401765, 0.1452513352938695, 0.07035537646928182, 0.07759297154843807, -0.06332364746162461, -0.07796628668697345, -0.09195671203391005, 0.14816629766590064, 0.03490115750270585, 0.028249804543641708, 0.1358510597764204, -0.12059139466534058, -0.12133065408302678, 0.35857963752415445, -0.07383913041816817, -0.2228911551155357, 0.17490209609063134, -0.15130624225777056, -0.14750145700139303, 0.08785679176346295, 0.16666314124336673, 0.07590960978219906, -0.13384636046571863, 0.04883650283574954, -0.0861971085684167, 0.12957874155868518, 0.0052929946635332376, 0.07459118162902693, 0.2561556319395701, 0.09389116754237976, 0.06546788742351863, 0.14957506699202996, -0.08482737470120709, -0.17481329451418584, -0.3695157650444243, -0.152867682899038, -0.20937548159725136, 0.1126152068686982, -0.09691045703867632, -0.1249196685022778, 0.4258393810337616, 0.1754197968800731, 0.20380910332832072, 0.06737147517398828, 0.23324647490969963, 0.1439695926784124, 0.015630074481790265, 0.0737211543859707, 0.24891557465824815, 0.11666934152858124, 0.06457056011115331, -0.26615897063942007, 0.04512168034497235, 0.06494263590106533]
|
1,803.03857
|
Learning from Noisy Web Data with Category-level Supervision
|
As tons of photos are being uploaded to public websites (e.g., Flickr, Bing,
and Google) every day, learning from web data has become an increasingly
popular research direction because of freely available web resources, which is
also referred to as webly supervised learning. Nevertheless, the performance
gap between webly supervised learning and traditional supervised learning is
still very large, owning to the label noise of web data. To be exact, the
labels of images crawled from public websites are very noisy and often
inaccurate. Some existing works tend to facilitate learning from web data with
the aid of extra information, such as augmenting or purifying web data by
virtue of instance-level supervision, which is usually in demand of heavy
manual annotation. Instead, we propose to tackle the label noise by leveraging
more accessible category-level supervision. In particular, we build our method
upon variational autoencoder (VAE), in which the classification network is
attached on the hidden layer of VAE in a way that the classification network
and VAE can jointly leverage the category-level hybrid semantic information.
The effectiveness of our proposed method is clearly demonstrated by extensive
experiments on three benchmark datasets.
|
cs.CV
|
as tons of photos are being uploaded to public websites eg flickr bing and google every day learning from web data has become an increasingly popular research direction because of freely available web resources which is also referred to as webly supervised learning nevertheless the performance gap between webly supervised learning and traditional supervised learning is still very large owning to the label noise of web data to be exact the labels of images crawled from public websites are very noisy and often inaccurate some existing works tend to facilitate learning from web data with the aid of extra information such as augmenting or purifying web data by virtue of instancelevel supervision which is usually in demand of heavy manual annotation instead we propose to tackle the label noise by leveraging more accessible categorylevel supervision in particular we build our method upon variational autoencoder vae in which the classification network is attached on the hidden layer of vae in a way that the classification network and vae can jointly leverage the categorylevel hybrid semantic information the effectiveness of our proposed method is clearly demonstrated by extensive experiments on three benchmark datasets
|
[['as', 'tons', 'of', 'photos', 'are', 'being', 'uploaded', 'to', 'public', 'websites', 'eg', 'flickr', 'bing', 'and', 'google', 'every', 'day', 'learning', 'from', 'web', 'data', 'has', 'become', 'an', 'increasingly', 'popular', 'research', 'direction', 'because', 'of', 'freely', 'available', 'web', 'resources', 'which', 'is', 'also', 'referred', 'to', 'as', 'webly', 'supervised', 'learning', 'nevertheless', 'the', 'performance', 'gap', 'between', 'webly', 'supervised', 'learning', 'and', 'traditional', 'supervised', 'learning', 'is', 'still', 'very', 'large', 'owning', 'to', 'the', 'label', 'noise', 'of', 'web', 'data', 'to', 'be', 'exact', 'the', 'labels', 'of', 'images', 'crawled', 'from', 'public', 'websites', 'are', 'very', 'noisy', 'and', 'often', 'inaccurate', 'some', 'existing', 'works', 'tend', 'to', 'facilitate', 'learning', 'from', 'web', 'data', 'with', 'the', 'aid', 'of', 'extra', 'information', 'such', 'as', 'augmenting', 'or', 'purifying', 'web', 'data', 'by', 'virtue', 'of', 'instancelevel', 'supervision', 'which', 'is', 'usually', 'in', 'demand', 'of', 'heavy', 'manual', 'annotation', 'instead', 'we', 'propose', 'to', 'tackle', 'the', 'label', 'noise', 'by', 'leveraging', 'more', 'accessible', 'categorylevel', 'supervision', 'in', 'particular', 'we', 'build', 'our', 'method', 'upon', 'variational', 'autoencoder', 'vae', 'in', 'which', 'the', 'classification', 'network', 'is', 'attached', 'on', 'the', 'hidden', 'layer', 'of', 'vae', 'in', 'a', 'way', 'that', 'the', 'classification', 'network', 'and', 'vae', 'can', 'jointly', 'leverage', 'the', 'categorylevel', 'hybrid', 'semantic', 'information', 'the', 'effectiveness', 'of', 'our', 'proposed', 'method', 'is', 'clearly', 'demonstrated', 'by', 'extensive', 'experiments', 'on', 'three', 'benchmark', 'datasets']]
|
[-0.004939467912534964, 0.003142636524179965, -0.04197818325730089, 0.08536697179825699, -0.18611486303663924, -0.19733080031174718, 0.056586330802867395, 0.46217752144676855, -0.28310893968976447, -0.3850776212221665, 0.09464417010331184, -0.3509101046356543, -0.1316062185013696, 0.19951651245721308, -0.15130312039385213, 0.049113735974722426, 0.15781154242436846, 0.0860881397326316, -0.029558755951709266, -0.3276249122164695, 0.33252223171488776, 0.07188151841641877, 0.38070980127393733, 0.0212687761449689, 0.08945783698463237, -0.04283990812273355, -0.0874715754009554, -0.03201644167825775, -0.010598640330813897, 0.21011960470021326, 0.3761942577377664, 0.2307715917284069, 0.3417280068113932, -0.39984260847793857, -0.21763242038298417, 0.07145124697004547, 0.15655107348046512, 0.11126638734988997, -0.050045312841009, -0.4287221222013937, 0.06570589722436487, -0.18513856010014162, 0.0649868278091905, -0.1617296319991272, -0.04850190224830568, -0.01748978782259903, -0.27189677948600255, 0.037386600343670195, 0.036910123183545585, 0.08428586368492917, -0.006002621788590054, -0.08043723754494583, -0.04201827872195891, 0.1719572345021605, 0.09602389152525041, 0.06767027114435094, 0.15113766986422036, -0.22728535902189062, -0.12797006765040397, 0.3428198600636493, -0.0465931152883449, -0.17656748383964233, 0.21945501020890099, 0.03151738253807288, -0.16472846420033205, 0.10361494260952267, 0.22707525131972847, 0.10435400879576179, -0.22210739203363034, 0.02265669679737294, -0.07033050360148334, 0.21143152857143238, 0.05005755954597594, -0.005229698011349321, 0.1610592738713055, 0.26684360245257344, 0.03399175948204951, 0.12763968513759233, -0.1283162415255573, -0.04565547838659606, -0.1657293753537559, -0.1163013671416331, -0.26427019320803824, -0.010091222486219792, -0.09680624368097097, -0.14861342224599647, 0.3389665525289574, 0.2541681731836529, 0.18672639885868544, 0.06964997989820385, 0.3545238446658818, -0.06163069885803133, 0.15236100670028263, 0.13065657692507923, 0.14211725849912413, -0.04509705350324707, 0.17236238233355014, -0.08627680054724372, 0.10962039861628171, 0.028645503846684676]
|
1,803.03858
|
Testing One Hypothesis Multiple Times: The Multidimensional Case
|
The identification of new rare signals in data, the detection of a sudden
change in a trend, and the selection of competing models, are among the most
challenging problems in statistical practice. These challenges can be tackled
using a test of hypothesis where a nuisance parameter is present only under the
alternative, and a computationally efficient solution can be obtained by the
"Testing One Hypothesis Multiple times" (TOHM) method. In the one-dimensional
setting, a fine discretization of the space of the non-identifiable parameter
is specified, and a global p-value is obtained by approximating the
distribution of the supremum of the resulting stochastic process. In this
paper, we propose a computationally efficient inferential tool to perform TOHM
in the multidimensional setting. Here, the approximations of interest typically
involve the expected Euler Characteristics (EC) of the excursion set of the
underlying random field. We introduce a simple algorithm to compute the EC in
multiple dimensions and for arbitrary large significance levels. This leads to
an highly generalizable computational tool to perform inference under
non-standard regularity conditions.
|
stat.ME astro-ph.IM physics.data-an stat.AP stat.CO
|
the identification of new rare signals in data the detection of a sudden change in a trend and the selection of competing models are among the most challenging problems in statistical practice these challenges can be tackled using a test of hypothesis where a nuisance parameter is present only under the alternative and a computationally efficient solution can be obtained by the testing one hypothesis multiple times tohm method in the onedimensional setting a fine discretization of the space of the nonidentifiable parameter is specified and a global pvalue is obtained by approximating the distribution of the supremum of the resulting stochastic process in this paper we propose a computationally efficient inferential tool to perform tohm in the multidimensional setting here the approximations of interest typically involve the expected euler characteristics ec of the excursion set of the underlying random field we introduce a simple algorithm to compute the ec in multiple dimensions and for arbitrary large significance levels this leads to an highly generalizable computational tool to perform inference under nonstandard regularity conditions
|
[['the', 'identification', 'of', 'new', 'rare', 'signals', 'in', 'data', 'the', 'detection', 'of', 'a', 'sudden', 'change', 'in', 'a', 'trend', 'and', 'the', 'selection', 'of', 'competing', 'models', 'are', 'among', 'the', 'most', 'challenging', 'problems', 'in', 'statistical', 'practice', 'these', 'challenges', 'can', 'be', 'tackled', 'using', 'a', 'test', 'of', 'hypothesis', 'where', 'a', 'nuisance', 'parameter', 'is', 'present', 'only', 'under', 'the', 'alternative', 'and', 'a', 'computationally', 'efficient', 'solution', 'can', 'be', 'obtained', 'by', 'the', 'testing', 'one', 'hypothesis', 'multiple', 'times', 'tohm', 'method', 'in', 'the', 'onedimensional', 'setting', 'a', 'fine', 'discretization', 'of', 'the', 'space', 'of', 'the', 'nonidentifiable', 'parameter', 'is', 'specified', 'and', 'a', 'global', 'pvalue', 'is', 'obtained', 'by', 'approximating', 'the', 'distribution', 'of', 'the', 'supremum', 'of', 'the', 'resulting', 'stochastic', 'process', 'in', 'this', 'paper', 'we', 'propose', 'a', 'computationally', 'efficient', 'inferential', 'tool', 'to', 'perform', 'tohm', 'in', 'the', 'multidimensional', 'setting', 'here', 'the', 'approximations', 'of', 'interest', 'typically', 'involve', 'the', 'expected', 'euler', 'characteristics', 'ec', 'of', 'the', 'excursion', 'set', 'of', 'the', 'underlying', 'random', 'field', 'we', 'introduce', 'a', 'simple', 'algorithm', 'to', 'compute', 'the', 'ec', 'in', 'multiple', 'dimensions', 'and', 'for', 'arbitrary', 'large', 'significance', 'levels', 'this', 'leads', 'to', 'an', 'highly', 'generalizable', 'computational', 'tool', 'to', 'perform', 'inference', 'under', 'nonstandard', 'regularity', 'conditions']]
|
[-0.10096287927001543, 0.06508574471884239, -0.09364921352344341, 0.11084709008699212, -0.06710333347818333, -0.13660913743560427, 0.057086956043642056, 0.3495289564994766, -0.2736241577478158, -0.3102659770319688, 0.12403056053939843, -0.1837418135402767, -0.13263042297096517, 0.19734609959347324, -0.0746442155682364, 0.07944766087149772, 0.07151408006581639, 0.00729139790142319, -0.05431422447295988, -0.22796173899932282, 0.2925783477940372, 0.06346638710505662, 0.2846156451810986, -0.016149397244296926, 0.0884595364392414, -0.008987859766609195, -0.04243645472612617, 0.03300779050830939, -0.10713707596791544, 0.1579969061923952, 0.26754513300444555, 0.16184239332489242, 0.3358686400320509, -0.4019113481151818, -0.21321875204488733, 0.13393430881123272, 0.12337336361113181, 0.0950184092875677, -0.02706278894824543, -0.2600528960405239, 0.07550375281977628, -0.14249789023563805, -0.1156159107394024, -0.10588948699463716, -0.016315358390512437, -0.013598709624132206, -0.340821970730549, 0.09233372855192885, 0.04424347513858443, 0.04755035446871115, -0.02741815460492568, -0.09039654162840853, 0.062159841025151825, 0.09231423547969135, 0.07454779690072, -0.004867240478787786, 0.0894126340602364, -0.13197393520017978, -0.12440446950762865, 0.39104077872959364, -0.05158239624385411, -0.2599292722806313, 0.20105944918308022, -0.10337584809903269, -0.17385015611258475, 0.13574382109867258, 0.1917391385583357, 0.16793568548211163, -0.18474084431648083, 0.09818225462476712, -0.01357516854594665, 0.13765798629400047, 0.013784622187437168, -0.016663231181740845, 0.1667440302359561, 0.20606805461501682, 0.08265065879229157, 0.14209548794750082, -0.11511164480832341, -0.09028539163911523, -0.2948748037749607, -0.14982815584617443, -0.17803773047916335, 0.02881784199860118, -0.12353536409784868, -0.19974162886668553, 0.40416209972142403, 0.1937919229271704, 0.19754546263453218, 0.06169886254684079, 0.29441641162460047, 0.14335965246021354, 0.015949169987405854, 0.044751407491610565, 0.1912148668238058, 0.07904581232772519, 0.046728670710815524, -0.1736043873055699, 0.1182417070891858, 0.027948929189608014]
|
1,803.03859
|
Language Identification of Bengali-English Code-Mixed data using
Character & Phonetic based LSTM Models
|
Language identification of social media text still remains a challenging task
due to properties like code-mixing and inconsistent phonetic transliterations.
In this paper, we present a supervised learning approach for language
identification at the word level of low resource Bengali-English code-mixed
data taken from social media. We employ two methods of word encoding, namely
character based and root phone based to train our deep LSTM models. Utilizing
these two models we created two ensemble models using stacking and threshold
technique which gave 91.78% and 92.35% accuracies respectively on our testing
data.
|
cs.CL
|
language identification of social media text still remains a challenging task due to properties like codemixing and inconsistent phonetic transliterations in this paper we present a supervised learning approach for language identification at the word level of low resource bengalienglish codemixed data taken from social media we employ two methods of word encoding namely character based and root phone based to train our deep lstm models utilizing these two models we created two ensemble models using stacking and threshold technique which gave 9178 and 9235 accuracies respectively on our testing data
|
[['language', 'identification', 'of', 'social', 'media', 'text', 'still', 'remains', 'a', 'challenging', 'task', 'due', 'to', 'properties', 'like', 'codemixing', 'and', 'inconsistent', 'phonetic', 'transliterations', 'in', 'this', 'paper', 'we', 'present', 'a', 'supervised', 'learning', 'approach', 'for', 'language', 'identification', 'at', 'the', 'word', 'level', 'of', 'low', 'resource', 'bengalienglish', 'codemixed', 'data', 'taken', 'from', 'social', 'media', 'we', 'employ', 'two', 'methods', 'of', 'word', 'encoding', 'namely', 'character', 'based', 'and', 'root', 'phone', 'based', 'to', 'train', 'our', 'deep', 'lstm', 'models', 'utilizing', 'these', 'two', 'models', 'we', 'created', 'two', 'ensemble', 'models', 'using', 'stacking', 'and', 'threshold', 'technique', 'which', 'gave', '9178', 'and', '9235', 'accuracies', 'respectively', 'on', 'our', 'testing', 'data']]
|
[-0.03665059089158358, 0.008658928801881129, -0.06452076619993267, 0.09902373391983173, -0.13591754435708098, -0.20315974584539956, 0.08542672590629899, 0.4650956272995204, -0.2754967984209737, -0.33078850472994736, 0.06286770903657117, -0.3003171051569869, -0.17463078860355688, 0.19594233433893893, -0.07859569649850384, 0.06621984374615249, 0.13566900838135082, 0.06649793460873595, -0.018703804864140038, -0.269055349788932, 0.33516239669707637, 0.01018476279765064, 0.39168771943391373, 0.009885047907742221, 0.15006238144163167, -0.0015243610885161698, -0.08797261926732707, -0.04254320960654092, -0.05176618300231822, 0.21313744211331365, 0.34137449396038894, 0.20888893237714184, 0.3030670638708921, -0.41512057704202243, -0.19522687640784078, 0.06345181990666, 0.1500573398498295, 0.13666467317720102, -0.03972319989815731, -0.3421902711178814, 0.08411361596787746, -0.18930538730130772, 0.06816404049148721, -0.10685527333047952, -0.01671492604256262, -0.03532881574872672, -0.22975587935626424, 0.07863477168583803, 0.09391325292062391, 0.14418175927457516, -0.05762993122890508, -0.13609135466408026, 0.07607328014322713, 0.15085141893130927, 0.04186241209423274, 0.02416743309494746, 0.09889396488813035, -0.19358520309984936, -0.1673756567761302, 0.39736007063994916, -0.07992445446257845, -0.19358076228959004, 0.24066899220323126, 0.016559407970439016, -0.21512721760951903, 0.023906814588464043, 0.26456648042279013, 0.07505330719378138, -0.17261192090076843, -0.019089502096372352, -0.03020139342027434, 0.24377796655583583, 0.0961195236448659, -0.009087462292126055, 0.1675098506273346, 0.27947962951710387, -0.08292035694401502, 0.09784385983654287, -0.12681766525680216, -0.021182637023373266, -0.1634673802378284, -0.0640703828775146, -0.16671099995126884, -0.003980606280298632, -0.07387840485113956, -0.174309367031445, 0.3862278965940134, 0.242436726472937, 0.16899993529626994, 0.12234773795680258, 0.2807240058573779, 0.008655058615056149, 0.07990517705846369, 0.09036775350798278, 0.1188342798072217, -0.003908341865609871, 0.142450070516154, -0.13659655676076837, 0.05963848957143138, 0.08115151334616742]
|
1,803.0386
|
Jet Launching Radius in Low-Power Radio-Loud AGNs in Advection-Dominated
Accretion Flows
|
Using our theory for the production of relativistic outflows, we estimate the
jet launching radius and the inferred mass accretion rate for 52 low-power
radio-loud AGNs based on the observed jet powers. Our analysis indicates that
(1) a significant fraction of the accreted energy is required to convert the
accreted mass to relativistic energy particles for the production of the jets
near the event horizon, (2) the jets launching radius moves radially toward the
horizon as the mass accretion rate or jets power increases, and (3) no
jet/outflow formation is possible beyond 44 gravitational radii.
|
astro-ph.HE
|
using our theory for the production of relativistic outflows we estimate the jet launching radius and the inferred mass accretion rate for 52 lowpower radioloud agns based on the observed jet powers our analysis indicates that 1 a significant fraction of the accreted energy is required to convert the accreted mass to relativistic energy particles for the production of the jets near the event horizon 2 the jets launching radius moves radially toward the horizon as the mass accretion rate or jets power increases and 3 no jetoutflow formation is possible beyond 44 gravitational radii
|
[['using', 'our', 'theory', 'for', 'the', 'production', 'of', 'relativistic', 'outflows', 'we', 'estimate', 'the', 'jet', 'launching', 'radius', 'and', 'the', 'inferred', 'mass', 'accretion', 'rate', 'for', '52', 'lowpower', 'radioloud', 'agns', 'based', 'on', 'the', 'observed', 'jet', 'powers', 'our', 'analysis', 'indicates', 'that', '1', 'a', 'significant', 'fraction', 'of', 'the', 'accreted', 'energy', 'is', 'required', 'to', 'convert', 'the', 'accreted', 'mass', 'to', 'relativistic', 'energy', 'particles', 'for', 'the', 'production', 'of', 'the', 'jets', 'near', 'the', 'event', 'horizon', '2', 'the', 'jets', 'launching', 'radius', 'moves', 'radially', 'toward', 'the', 'horizon', 'as', 'the', 'mass', 'accretion', 'rate', 'or', 'jets', 'power', 'increases', 'and', '3', 'no', 'jetoutflow', 'formation', 'is', 'possible', 'beyond', '44', 'gravitational', 'radii']]
|
[-0.11012484058033135, 0.1461711110400134, -0.03079697457387259, 0.15676145334237893, -0.08166210936676514, -0.05483469332715398, 0.012523110645921215, 0.3488280328676889, -0.16764152800958407, -0.3405164279043674, 0.051584187447779664, -0.3016642359134398, 0.10232017204153204, 0.2119335893713134, 0.03581275466437402, 0.005669630007622274, 0.01890573698390079, -0.032850049347861815, -0.05349870853089286, -0.1559151863238137, 0.3312620749942174, 0.17807886253699268, 0.14968369073283516, 0.05566154924760523, 0.09962591614182058, -0.05681738839239666, -0.0413897863478939, -0.027042845871887707, -0.16836658184650954, 0.02471235160666861, 0.1584176954739776, 0.13702446142407623, 0.23986649941790875, -0.3727590151915425, -0.21104821739718319, 0.05688447851923564, 0.2013647906188118, 0.036637583513143716, -0.1329045556742992, -0.178769139362205, 0.07393685860657379, -0.2811798338043062, -0.18771493239818435, 0.08411177560490997, 0.07877811748338373, -0.0018889390293655819, -0.2572518573289639, 0.14947751460498884, 0.04961805855365176, -0.02829441938451246, -0.10383723151232852, -0.06613408212402934, -0.13281312361359596, 0.03701668431933381, 0.1462145217345096, 0.1081711028800591, 0.3232093628741016, -0.15520620169608215, -0.10939587103693109, 0.3930540195421169, 0.002890803047308796, -0.05455480343417118, 0.20329025271348655, -0.2559881802109119, -0.12446843544664597, 0.23291689459430545, 0.24118065973253627, 0.14686616244970968, -0.06936092445577838, -0.06625578888373351, -0.0026339455140068344, 0.2123960587098018, 0.046779251446653354, 0.040761772365505364, 0.34842857687096845, 0.13812893561430667, 0.021623016874256887, 0.07513790246295302, -0.2309242390365781, -0.05762790583478483, -0.3233824940790471, -0.12717371120264656, -0.1266923232984386, 0.1183876782913055, -0.1581815895621395, -0.04866367379987711, 0.3056719174682114, 0.05938098521682581, 0.21936738194995806, 0.06619846384825283, 0.32966522809706233, 0.10254321930881001, 0.09200369412765691, 0.253523825530551, 0.4066870725664653, 0.1684702817154558, 0.13366507397057784, -0.2560730414857206, 0.029502505794363587, 0.05355470262859997]
|
1,803.03861
|
Reality-check for Econophysics: Likelihood-based fitting of
physics-inspired market models to empirical data
|
The statistical description and modeling of volatility plays a prominent role
in econometrics, risk management and finance. GARCH and stochastic volatility
models have been extensively studied and are routinely fitted to market data,
albeit providing a phenomenological description only.
In contrast, the field of econophysics starts from the premise that modern
economies consist of a vast number of individual actors with heterogeneous
expectations and incentives. In turn explaining observed market statistics as
emerging from the collective dynamics of many actors following heterogeneous,
yet simple, rather mechanistic rules. While such models generate volatility
dynamics qualitatively matching several stylized facts and thus illustrate the
possible role of different mechanisms, such as chartist trading, herding
behavior etc., rigorous and quantitative statistical fits are still mostly
lacking.
Here, we show how Stan, a modern probabilistic programming language for
Bayesian modeling, can be used to fit several models from econophysics. In
contrast to the method of moment matching, which is currently popular, our fits
are purely likelihood based with many advantages, including systematic model
comparison and principled generation of model predictions conditional on the
observed price history. In particular, we investigate models by Vikram & Sinha
and Franke & Westerhoff, and provide a quantitative comparison with standard
econometric models.
|
cs.CE q-fin.GN
|
the statistical description and modeling of volatility plays a prominent role in econometrics risk management and finance garch and stochastic volatility models have been extensively studied and are routinely fitted to market data albeit providing a phenomenological description only in contrast the field of econophysics starts from the premise that modern economies consist of a vast number of individual actors with heterogeneous expectations and incentives in turn explaining observed market statistics as emerging from the collective dynamics of many actors following heterogeneous yet simple rather mechanistic rules while such models generate volatility dynamics qualitatively matching several stylized facts and thus illustrate the possible role of different mechanisms such as chartist trading herding behavior etc rigorous and quantitative statistical fits are still mostly lacking here we show how stan a modern probabilistic programming language for bayesian modeling can be used to fit several models from econophysics in contrast to the method of moment matching which is currently popular our fits are purely likelihood based with many advantages including systematic model comparison and principled generation of model predictions conditional on the observed price history in particular we investigate models by vikram sinha and franke westerhoff and provide a quantitative comparison with standard econometric models
|
[['the', 'statistical', 'description', 'and', 'modeling', 'of', 'volatility', 'plays', 'a', 'prominent', 'role', 'in', 'econometrics', 'risk', 'management', 'and', 'finance', 'garch', 'and', 'stochastic', 'volatility', 'models', 'have', 'been', 'extensively', 'studied', 'and', 'are', 'routinely', 'fitted', 'to', 'market', 'data', 'albeit', 'providing', 'a', 'phenomenological', 'description', 'only', 'in', 'contrast', 'the', 'field', 'of', 'econophysics', 'starts', 'from', 'the', 'premise', 'that', 'modern', 'economies', 'consist', 'of', 'a', 'vast', 'number', 'of', 'individual', 'actors', 'with', 'heterogeneous', 'expectations', 'and', 'incentives', 'in', 'turn', 'explaining', 'observed', 'market', 'statistics', 'as', 'emerging', 'from', 'the', 'collective', 'dynamics', 'of', 'many', 'actors', 'following', 'heterogeneous', 'yet', 'simple', 'rather', 'mechanistic', 'rules', 'while', 'such', 'models', 'generate', 'volatility', 'dynamics', 'qualitatively', 'matching', 'several', 'stylized', 'facts', 'and', 'thus', 'illustrate', 'the', 'possible', 'role', 'of', 'different', 'mechanisms', 'such', 'as', 'chartist', 'trading', 'herding', 'behavior', 'etc', 'rigorous', 'and', 'quantitative', 'statistical', 'fits', 'are', 'still', 'mostly', 'lacking', 'here', 'we', 'show', 'how', 'stan', 'a', 'modern', 'probabilistic', 'programming', 'language', 'for', 'bayesian', 'modeling', 'can', 'be', 'used', 'to', 'fit', 'several', 'models', 'from', 'econophysics', 'in', 'contrast', 'to', 'the', 'method', 'of', 'moment', 'matching', 'which', 'is', 'currently', 'popular', 'our', 'fits', 'are', 'purely', 'likelihood', 'based', 'with', 'many', 'advantages', 'including', 'systematic', 'model', 'comparison', 'and', 'principled', 'generation', 'of', 'model', 'predictions', 'conditional', 'on', 'the', 'observed', 'price', 'history', 'in', 'particular', 'we', 'investigate', 'models', 'by', 'vikram', 'sinha', 'and', 'franke', 'westerhoff', 'and', 'provide', 'a', 'quantitative', 'comparison', 'with', 'standard', 'econometric', 'models']]
|
[-0.009425514660293783, 0.022092312509518357, -0.11328175337985158, 0.18154696325611658, -0.11206611829684741, -0.14547530004745396, 0.03649240065642878, 0.4001611737298098, -0.26423187024974776, -0.33682805498881235, 0.10733343154265526, -0.28869475740059025, -0.17592962821065194, 0.20349753731560535, -0.10251031760172687, 0.053756428715675625, 0.034109731838431454, -0.018583238442093645, 0.044394965106053785, -0.20566645578831083, 0.23736055900078656, 0.055038743437527314, 0.3333528843703703, 0.0009907670584055526, 0.07640928790275592, -0.024117072101853862, -0.08950248144483611, 0.02191221333671806, -0.11764179912775284, 0.17061018376565998, 0.29546656962358514, 0.14423419486277214, 0.32950989915919837, -0.4818168072289421, -0.2490046799914976, 0.11102183211238045, 0.10418163599438887, 0.07865192455329946, -0.03477967930500122, -0.23742981299072208, -0.015804377303398516, -0.23133074765574924, -0.06688532261965584, -0.16045418080053667, -0.001917119094504238, 0.041642258414623344, -0.27280391577517715, 0.09528557542162433, 0.062222286316320596, 0.1294712297129271, -0.02727235084056706, -0.1603104278250639, -0.00356277596756853, 0.11723817551082269, 0.10572187484598797, -0.041902996213360695, 0.12372145152839586, -0.16699285433246563, -0.19225488532223364, 0.39499196532733777, -0.056287238726494326, -0.13871350943977337, 0.20220240719027965, -0.09657429533765016, -0.18132212502761416, 0.053948735568060804, 0.19595743567492832, 0.037751666732382644, -0.22744540926254359, 0.05542982578108467, -0.04141020373874506, 0.15396271336508627, 0.013365254248608256, 0.007008542302087765, 0.2299365433308282, 0.22620568903445715, -0.014616505063917321, 0.058725349052545076, -0.038867925651677286, -0.2365551052712928, -0.24904001034351428, -0.07152697007954861, -0.11657526138335911, 0.014929860064630113, -0.11397496757456055, -0.17870431364889242, 0.40065418636491196, 0.2020272760632024, 0.16427698084607892, 0.07451875865823168, 0.293076182738762, 0.08286122712584686, 0.009270432268487132, 0.050547386552045, 0.18986050081143935, 0.07191312699625037, 0.12035841501980502, -0.12667858878217766, 0.18577519224131878, -0.008768852283501655]
|
1,803.03862
|
The Rudin-Kisler ordering of P-points under $\mathfrak{b} =
\mathfrak{c}$
|
M. E. Rudin proved under CH that for each P-point there exists another
P-point strictly RK-greater (M. E. Rudin, Partial orders on the types of $\beta
\mathbb{N}$ , Trans. Amer. Math. Soc., 155 (1971), 353-362). Assuming
$\mathfrak{p}=\mathfrak{c}$ A. Blass showed the same, and proved that each
RK-increasing $\omega$-sequence of P-points is upper bounded by a P-point, and
that there is an order embedding of the real line into the class of P-points
with respect to the RK-(pre)ordering (A. Blass, Rudin - Keisler ordering on
P-points, Trans. Amer. Math. Soc., 179 (1973), 145-166). In the present paper
the results cited above are proved under a (weaker) assumption
$\mathfrak{b}=\mathfrak{c}$.
A. Blass also asked in (A. Blass, Rudin - Keisler ordering on P-points,
Trans. Amer. Math. Soc., 179 (1973), 145-166) what ordinals can be embedded in
the set of P-points and pointed out, that such an ordinal may not be greater
then $\mathfrak{c}^+$. In the present paper the question is answered showing
(under $\mathfrak{b} = \mathfrak{c}$) that there is an order embedding of
$\mathfrak{c}^+$ into P-points.
|
math.LO
|
m e rudin proved under ch that for each ppoint there exists another ppoint strictly rkgreater m e rudin partial orders on the types of beta mathbbn trans amer math soc 155 1971 353362 assuming mathfrakpmathfrakc a blass showed the same and proved that each rkincreasing omegasequence of ppoints is upper bounded by a ppoint and that there is an order embedding of the real line into the class of ppoints with respect to the rkpreordering a blass rudin keisler ordering on ppoints trans amer math soc 179 1973 145166 in the present paper the results cited above are proved under a weaker assumption mathfrakbmathfrakc a blass also asked in a blass rudin keisler ordering on ppoints trans amer math soc 179 1973 145166 what ordinals can be embedded in the set of ppoints and pointed out that such an ordinal may not be greater then mathfrakc in the present paper the question is answered showing under mathfrakb mathfrakc that there is an order embedding of mathfrakc into ppoints
|
[['m', 'e', 'rudin', 'proved', 'under', 'ch', 'that', 'for', 'each', 'ppoint', 'there', 'exists', 'another', 'ppoint', 'strictly', 'rkgreater', 'm', 'e', 'rudin', 'partial', 'orders', 'on', 'the', 'types', 'of', 'beta', 'mathbbn', 'trans', 'amer', 'math', 'soc', '155', '1971', '353362', 'assuming', 'mathfrakpmathfrakc', 'a', 'blass', 'showed', 'the', 'same', 'and', 'proved', 'that', 'each', 'rkincreasing', 'omegasequence', 'of', 'ppoints', 'is', 'upper', 'bounded', 'by', 'a', 'ppoint', 'and', 'that', 'there', 'is', 'an', 'order', 'embedding', 'of', 'the', 'real', 'line', 'into', 'the', 'class', 'of', 'ppoints', 'with', 'respect', 'to', 'the', 'rkpreordering', 'a', 'blass', 'rudin', 'keisler', 'ordering', 'on', 'ppoints', 'trans', 'amer', 'math', 'soc', '179', '1973', '145166', 'in', 'the', 'present', 'paper', 'the', 'results', 'cited', 'above', 'are', 'proved', 'under', 'a', 'weaker', 'assumption', 'mathfrakbmathfrakc', 'a', 'blass', 'also', 'asked', 'in', 'a', 'blass', 'rudin', 'keisler', 'ordering', 'on', 'ppoints', 'trans', 'amer', 'math', 'soc', '179', '1973', '145166', 'what', 'ordinals', 'can', 'be', 'embedded', 'in', 'the', 'set', 'of', 'ppoints', 'and', 'pointed', 'out', 'that', 'such', 'an', 'ordinal', 'may', 'not', 'be', 'greater', 'then', 'mathfrakc', 'in', 'the', 'present', 'paper', 'the', 'question', 'is', 'answered', 'showing', 'under', 'mathfrakb', 'mathfrakc', 'that', 'there', 'is', 'an', 'order', 'embedding', 'of', 'mathfrakc', 'into', 'ppoints']]
|
[-0.14016463696706769, 0.10124784185813396, -0.014609959842523605, 0.059932561474852264, -0.05013610642380649, -0.1434244189877063, 0.0691023838213679, 0.34196360783492463, -0.26438339991159965, -0.22939218915097426, 0.09653103994361761, -0.2719642672710484, -0.11508200210859863, 0.16194017932795715, -0.17173169098053379, -0.037784731582466584, 0.02457576093108467, 0.006599304913656741, 0.001401572577689388, -0.34040356662959176, 0.27729820764464574, -0.015467293569023108, 0.22294586597055924, 0.05486790178856165, 0.06649137544321469, -0.002391437676212773, -0.025686611938176722, 0.025794411841893523, -0.20426353342834153, 0.07073213015512632, 0.27945650153702534, 0.1291526307084984, 0.32913040347175854, -0.270737865337784, -0.13304583178180066, 0.14842239575369692, 0.04733394399014154, -0.06459018641162845, 0.06680589914960763, -0.3738128452720802, 0.14793393626083653, -0.13926870084549414, -0.049665327144150694, -0.03033080317432106, 0.20493449111718956, -0.024349893535566856, -0.31727762536497833, 0.014190894280235204, 0.29085461850698313, 0.1465793551943512, -0.04364807329072458, -0.17995886681260678, -0.09542983457610783, -0.0009297743573126088, 0.0053184520433338855, 0.12688009294102015, 0.017975941683710892, 0.011275230202733017, -0.15317474143500098, 0.3497315182963886, -0.06390119697447871, -0.17109941570769724, 0.19505727204363565, -0.08971907148313732, -0.1717593398246142, 0.11238672588128461, 0.022692421843047914, 0.08640463265772091, -0.0898832923708918, 0.22851920828951533, -0.19860134177760325, 0.18839105717247215, 0.22651105094417112, -0.05284602426435435, 0.0864378393020072, 0.061049009409233385, 0.11560269501968855, 0.10549075546867509, 0.02096820389709958, -0.02064900277267642, -0.26610048803523545, -0.17654593797718607, -0.13598977991595593, 0.1657056068426045, -0.01095848724807871, -0.14419684724785706, 0.3024730327561861, 0.09968273667831587, 0.1286239838126476, 0.0384796128633841, 0.04955342472971008, 0.08654821426659133, -0.030890278001429468, 0.1676293960850538, 0.18634079897310585, 0.17106482017041388, 0.04804742080727365, -0.09960845581017344, 0.04262106085377859, 0.15698844963631794]
|
1,803.03863
|
Smartphone apps usage patterns as a predictor of perceived stress levels
at workplace
|
Explosion of number of smartphone apps and their diversity has created a
fertile ground to study behaviour of smartphone users. Patterns of app usage,
specifically types of apps and their duration are influenced by the state of
the user and this information can be correlated with the self-reported state of
the users. The work in this paper is along the line of understanding patterns
of app usage and investigating relationship of these patterns with the
perceived stress level within the workplace context. Our results show that
using a subject-centric behaviour model we can predict stress levels based on
smartphone app usage. The results we have achieved, of average accuracy of 75%
and precision of 85.7%, can be used as an indicator of overall stress levels in
work environments and in turn inform stress reduction organisational policies,
especially when considering interrelation between stress and productivity of
workers.
|
cs.CY
|
explosion of number of smartphone apps and their diversity has created a fertile ground to study behaviour of smartphone users patterns of app usage specifically types of apps and their duration are influenced by the state of the user and this information can be correlated with the selfreported state of the users the work in this paper is along the line of understanding patterns of app usage and investigating relationship of these patterns with the perceived stress level within the workplace context our results show that using a subjectcentric behaviour model we can predict stress levels based on smartphone app usage the results we have achieved of average accuracy of 75 and precision of 857 can be used as an indicator of overall stress levels in work environments and in turn inform stress reduction organisational policies especially when considering interrelation between stress and productivity of workers
|
[['explosion', 'of', 'number', 'of', 'smartphone', 'apps', 'and', 'their', 'diversity', 'has', 'created', 'a', 'fertile', 'ground', 'to', 'study', 'behaviour', 'of', 'smartphone', 'users', 'patterns', 'of', 'app', 'usage', 'specifically', 'types', 'of', 'apps', 'and', 'their', 'duration', 'are', 'influenced', 'by', 'the', 'state', 'of', 'the', 'user', 'and', 'this', 'information', 'can', 'be', 'correlated', 'with', 'the', 'selfreported', 'state', 'of', 'the', 'users', 'the', 'work', 'in', 'this', 'paper', 'is', 'along', 'the', 'line', 'of', 'understanding', 'patterns', 'of', 'app', 'usage', 'and', 'investigating', 'relationship', 'of', 'these', 'patterns', 'with', 'the', 'perceived', 'stress', 'level', 'within', 'the', 'workplace', 'context', 'our', 'results', 'show', 'that', 'using', 'a', 'subjectcentric', 'behaviour', 'model', 'we', 'can', 'predict', 'stress', 'levels', 'based', 'on', 'smartphone', 'app', 'usage', 'the', 'results', 'we', 'have', 'achieved', 'of', 'average', 'accuracy', 'of', '75', 'and', 'precision', 'of', '857', 'can', 'be', 'used', 'as', 'an', 'indicator', 'of', 'overall', 'stress', 'levels', 'in', 'work', 'environments', 'and', 'in', 'turn', 'inform', 'stress', 'reduction', 'organisational', 'policies', 'especially', 'when', 'considering', 'interrelation', 'between', 'stress', 'and', 'productivity', 'of', 'workers']]
|
[-0.11734236535969479, 0.0895750194556152, -0.08713167792764204, 0.044485422926312634, -0.05252262122832752, -0.11195693193324681, 0.11040873471567214, 0.3988107609080857, -0.23138664658341943, -0.4047992076724768, 0.08423017295607334, -0.2972398307607991, -0.169242732946215, 0.18607361079514798, -0.11710808650301448, 0.0018988003954291343, 0.06354723046533764, 0.056700008865124704, -0.03174758065524029, -0.28917161046591555, 0.32321731891033467, 0.10520412764263115, 0.35285623304802793, 0.09990548433029446, 0.03582490890383207, -0.022079487649145826, -0.057595946209440974, 0.030658593304969114, -0.08142207782451617, 0.1626998920732274, 0.29276454856394435, 0.18272097836858753, 0.30569613753207797, -0.4365144477450642, -0.1723556428071882, 0.05539800994868936, 0.12996019952396606, 0.06021092532459518, -0.01833244404707361, -0.34074018412622914, 0.11515723872480207, -0.2266454947020473, -0.09177756005083211, -0.05291589171914705, 0.0008104568186762004, 0.0650996357427332, -0.23290537845921414, 0.05496228323799783, 0.0015203961717157528, 0.15770517746307727, -0.0789595561094004, -0.06649917876749331, -0.056972359173834836, 0.23486170731585249, 0.11020559251452956, -0.03664604395061956, 0.19009332268274037, -0.18593437609680255, -0.12426304545590718, 0.36546544311889284, -0.015601928219006493, -0.15691524084400513, 0.1801315935184087, -0.10134022036599445, -0.07516898615767473, 0.07670497273833587, 0.2562090927734971, 0.06599094502563621, -0.14004094239278167, -0.021358199967954565, 0.010281971344274693, 0.2019355620638917, 0.0608607896218269, 0.045219755924210465, 0.20128968366068498, 0.1991980777555627, 0.000702900932860914, 0.10307295153214564, -0.07346445373382424, -0.0514960999921735, -0.21348899992961629, -0.18398901912672766, -0.13692645052736946, 0.0189345247529704, -0.0983032898199624, -0.09948889939435597, 0.4330286622689716, 0.19243933976274627, 0.14044463757008058, 0.04815289457810336, 0.2520415492998115, 0.07479625249217296, 0.04861995902811659, 0.0726848452022813, 0.19186960728277036, 0.016223976425505403, 0.16273313493243066, -0.1979463420968888, 0.15296806109555322, -0.03752453331674995]
|
1,803.03864
|
Probabilistic Analysis of Block Wiedemann for Leading Invariant Factors
|
We determine the probability, structure dependent, that the block Wiedemann
algorithm correctly computes leading invariant factors. This leads to a tight
lower bound for the probability, structure independent. We show, using block
size slightly larger than $r$, that the leading $r$ invariant factors are
computed correctly with high probability over any field. Moreover, an algorithm
is provided to compute the probability bound for a given matrix size and thus
to select the block size needed to obtain the desired probability. The worst
case probability bound is improved, post hoc, by incorporating the partial
information about the invariant factors.
|
cs.SC
|
we determine the probability structure dependent that the block wiedemann algorithm correctly computes leading invariant factors this leads to a tight lower bound for the probability structure independent we show using block size slightly larger than r that the leading r invariant factors are computed correctly with high probability over any field moreover an algorithm is provided to compute the probability bound for a given matrix size and thus to select the block size needed to obtain the desired probability the worst case probability bound is improved post hoc by incorporating the partial information about the invariant factors
|
[['we', 'determine', 'the', 'probability', 'structure', 'dependent', 'that', 'the', 'block', 'wiedemann', 'algorithm', 'correctly', 'computes', 'leading', 'invariant', 'factors', 'this', 'leads', 'to', 'a', 'tight', 'lower', 'bound', 'for', 'the', 'probability', 'structure', 'independent', 'we', 'show', 'using', 'block', 'size', 'slightly', 'larger', 'than', 'r', 'that', 'the', 'leading', 'r', 'invariant', 'factors', 'are', 'computed', 'correctly', 'with', 'high', 'probability', 'over', 'any', 'field', 'moreover', 'an', 'algorithm', 'is', 'provided', 'to', 'compute', 'the', 'probability', 'bound', 'for', 'a', 'given', 'matrix', 'size', 'and', 'thus', 'to', 'select', 'the', 'block', 'size', 'needed', 'to', 'obtain', 'the', 'desired', 'probability', 'the', 'worst', 'case', 'probability', 'bound', 'is', 'improved', 'post', 'hoc', 'by', 'incorporating', 'the', 'partial', 'information', 'about', 'the', 'invariant', 'factors']]
|
[-0.10970400417299599, 0.0954148886947743, -0.07422391357546558, 0.09983462565792345, -0.043989829521873317, -0.1583550072237089, 0.10214506790673893, 0.33533768785395185, -0.23314450239306506, -0.31439334207347464, 0.06955647173489692, -0.21382169674473758, -0.14639681995827325, 0.13656308457293376, -0.05851146132134053, 0.07910990929801245, 0.03113871585691766, 0.138104463575826, -0.09257545277039159, -0.2948590893992128, 0.2950781140101085, 0.1374009870638957, 0.2775733739479768, 0.039474908917030434, 0.09899170401183013, 0.022055716939687452, -0.05758451046992322, 0.010573856028899247, -0.18574697305807697, 0.11911901337693312, 0.21087602111130802, 0.15757897522647055, 0.22523906051979534, -0.3815358655375181, -0.14190106163257543, 0.10683454324643375, 0.14242587947258156, 0.12106907992310138, 0.020198767273021594, -0.24003988390845454, 0.17339760876659835, -0.16327045430020637, -0.15381085559516688, -0.05577813704944767, 0.04789789678286571, -0.023024110807752123, -0.3755952433590321, 0.045500233907214534, 0.05375272641908758, -0.04522656472352314, 0.0037221833493332472, -0.15749047128293586, 0.023563041370742176, 0.15986519508783667, 0.01933800132127897, 0.06539020979449114, 0.14427330542583855, -0.09272515003768993, -0.07536326566406963, 0.3283232865018808, -0.0765457575891597, -0.23029157810141238, 0.09442987732294643, -0.1362478594742335, -0.11287946511079006, 0.19150840652137235, 0.1617507857308552, 0.10748353674508897, -0.09652555629620518, 0.0897739737915892, -0.054154146548208534, 0.21546167867229682, 0.08570639328669985, 0.06466301413709108, 0.1018454716475538, 0.08629381593449839, 0.13367747605246091, 0.1261296920972515, -0.0574733326449154, -0.08163839387849961, -0.2656982801474479, -0.15485236306653397, -0.19903171649772902, 0.0487506797142821, -0.16710718969796068, -0.14797305991416987, 0.36016492423962576, 0.1240232261562986, 0.25856266595062094, 0.13987676329834728, 0.2760874139601175, 0.1684388857030747, 0.053235587283816874, 0.16880877568310468, 0.14148655423552406, 0.10555207989967372, -0.0514838848588513, -0.19780478547374736, 0.14565143327950975, 0.09318973390119416]
|
1,803.03865
|
Charge sensitivity enhancement via mechanical oscillation in suspended
carbon nanotube devices
|
Single electron transistors (SETs) fabricated from single-walled carbon
nanotubes (SWNTs) can be operated as highly sensitive charge detectors reaching
sensitivity levels comparable to metallic radio frequency SETs (rf-SETs). Here
we demonstrate how the charge sensitivity of the device can be improved by
using the mechanical oscillations of a single-walled carbon nanotube quantum
dot. To optimize the charge sensitivity $\delta Q$, we drive the mechanical
resonator far into the nonlinear regime and bias it to an operating point where
the mechanical third order nonlinearity is cancelled out. This way we enhance
$\delta Q$, from 6 $\mu e/\sqrt{\textrm{Hz}}$ for the static case, to 0.97 $\mu
e/\sqrt{\textrm{Hz}}$, at a probe frequency of $\sim$ 1.3 kHz.
|
cond-mat.mes-hall
|
single electron transistors sets fabricated from singlewalled carbon nanotubes swnts can be operated as highly sensitive charge detectors reaching sensitivity levels comparable to metallic radio frequency sets rfsets here we demonstrate how the charge sensitivity of the device can be improved by using the mechanical oscillations of a singlewalled carbon nanotube quantum dot to optimize the charge sensitivity delta q we drive the mechanical resonator far into the nonlinear regime and bias it to an operating point where the mechanical third order nonlinearity is cancelled out this way we enhance delta q from 6 mu esqrttextrmhz for the static case to 097 mu esqrttextrmhz at a probe frequency of sim 13 khz
|
[['single', 'electron', 'transistors', 'sets', 'fabricated', 'from', 'singlewalled', 'carbon', 'nanotubes', 'swnts', 'can', 'be', 'operated', 'as', 'highly', 'sensitive', 'charge', 'detectors', 'reaching', 'sensitivity', 'levels', 'comparable', 'to', 'metallic', 'radio', 'frequency', 'sets', 'rfsets', 'here', 'we', 'demonstrate', 'how', 'the', 'charge', 'sensitivity', 'of', 'the', 'device', 'can', 'be', 'improved', 'by', 'using', 'the', 'mechanical', 'oscillations', 'of', 'a', 'singlewalled', 'carbon', 'nanotube', 'quantum', 'dot', 'to', 'optimize', 'the', 'charge', 'sensitivity', 'delta', 'q', 'we', 'drive', 'the', 'mechanical', 'resonator', 'far', 'into', 'the', 'nonlinear', 'regime', 'and', 'bias', 'it', 'to', 'an', 'operating', 'point', 'where', 'the', 'mechanical', 'third', 'order', 'nonlinearity', 'is', 'cancelled', 'out', 'this', 'way', 'we', 'enhance', 'delta', 'q', 'from', '6', 'mu', 'esqrttextrmhz', 'for', 'the', 'static', 'case', 'to', '097', 'mu', 'esqrttextrmhz', 'at', 'a', 'probe', 'frequency', 'of', 'sim', '13', 'khz']]
|
[-0.11780508982694962, 0.1817153966404889, 0.014327222936448048, -0.03775906013536521, 0.0027141862104392866, -0.20269145070659844, 0.12248825225132433, 0.41738794967532156, -0.2543801185505634, -0.2985353102314879, 0.012352578261528503, -0.32156454318372363, -0.07666999946179037, 0.22352546508931978, -0.015388520566788926, 0.032417532202419934, 0.030834894271736794, -0.03882699809460478, -0.027392094624652103, -0.14435930733822963, 0.20111893862485886, 0.09270041132324629, 0.3214486252855171, 0.0715574325231666, 0.08882348844146526, -0.07222192194101147, 0.10162121038883924, 0.015476476329124786, -0.1314915525887045, 0.029659491569989108, 0.25903557673392985, -0.04758368977980519, 0.23491634344682097, -0.4318063420836221, -0.14678485098887573, 0.09468228034251792, 0.16191385449333626, 0.09269829451699149, 0.023657479226081208, -0.2707248299446126, 0.11779482642992992, -0.17334854528519578, -0.12876913250339303, -0.06155144160782749, -0.01368043587373739, 0.002421446948904883, -0.26605471740900116, 0.05061952126932077, 0.009909173721362921, 0.02157054472587664, -0.02939405642074152, -0.12353201806968586, -0.02765718457839367, 0.07471213341817598, -0.0370785187591206, 0.043678644879467106, 0.3077945925083689, -0.09562690142880786, -0.08727997282350605, 0.3463861130685969, -0.09370676514967768, -0.15755431668155573, 0.13074008346408267, -0.20496360403485597, -0.02610807539895177, 0.14734877515160902, 0.14275689666498115, 0.0904815143397586, -0.18404654842161108, 0.03516340428402393, 0.08526897736909715, 0.23945269567008257, 0.1580256320959465, 0.12030546377328309, 0.2758631768721071, 0.2327536388385025, 0.06210563564673066, 0.1303201682071879, -0.16140199818394402, 0.05538863071587085, -0.22469877431867644, -0.11352066526782106, -0.18044329530728812, 0.17061859484423292, -0.08267561273466774, -0.12375844178551977, 0.40683470920405607, 0.12815188629214058, 0.12762459918687288, -0.031595692950808864, 0.28855383697558534, 0.14867172281744637, 0.10220829985019836, -0.03719791612926532, 0.3105674348157746, 0.16637453646610745, 0.11778416246260431, -0.27227948438799515, -0.04777687233449383, -0.06759716699069196]
|
1,803.03866
|
Time-Staging Enhancement of Hybrid System Falsification
|
Optimization-based falsification employs stochastic optimization algorithms
to search for error input of hybrid systems. In this paper we introduce a
simple idea to enhance falsification, namely time staging, that allows the
time-causal structure of time-dependent signals to be exploited by the
optimizers. Time staging consists of running a falsification solver multiple
times, from one interval to another, incrementally constructing an input signal
candidate. Our experiments show that time staging can dramatically increase
performance in some realistic examples. We also present theoretical results
that suggest the kinds of models and specifications for which time staging is
likely to be effective.
|
cs.SY eess.SY
|
optimizationbased falsification employs stochastic optimization algorithms to search for error input of hybrid systems in this paper we introduce a simple idea to enhance falsification namely time staging that allows the timecausal structure of timedependent signals to be exploited by the optimizers time staging consists of running a falsification solver multiple times from one interval to another incrementally constructing an input signal candidate our experiments show that time staging can dramatically increase performance in some realistic examples we also present theoretical results that suggest the kinds of models and specifications for which time staging is likely to be effective
|
[['optimizationbased', 'falsification', 'employs', 'stochastic', 'optimization', 'algorithms', 'to', 'search', 'for', 'error', 'input', 'of', 'hybrid', 'systems', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'simple', 'idea', 'to', 'enhance', 'falsification', 'namely', 'time', 'staging', 'that', 'allows', 'the', 'timecausal', 'structure', 'of', 'timedependent', 'signals', 'to', 'be', 'exploited', 'by', 'the', 'optimizers', 'time', 'staging', 'consists', 'of', 'running', 'a', 'falsification', 'solver', 'multiple', 'times', 'from', 'one', 'interval', 'to', 'another', 'incrementally', 'constructing', 'an', 'input', 'signal', 'candidate', 'our', 'experiments', 'show', 'that', 'time', 'staging', 'can', 'dramatically', 'increase', 'performance', 'in', 'some', 'realistic', 'examples', 'we', 'also', 'present', 'theoretical', 'results', 'that', 'suggest', 'the', 'kinds', 'of', 'models', 'and', 'specifications', 'for', 'which', 'time', 'staging', 'is', 'likely', 'to', 'be', 'effective']]
|
[-0.09649441964134123, 0.048667730463843914, -0.09406516325161463, 0.05673429434278256, -0.1112117042407544, -0.16808207251244422, 0.06261663121580513, 0.37247254906429184, -0.28161264955997467, -0.3537339065600224, 0.11434747358887559, -0.20725789718048276, -0.175257236626225, 0.22623195776461877, -0.07810750167177181, 0.09192603530192917, 0.10500422285074801, -0.01919340876147452, -0.06727340284292821, -0.2409135740346774, 0.24226684490162315, 0.08078088307743798, 0.2529435630398567, 0.003879258009332298, 0.08195065841022314, 0.00844401479557608, -0.01350798862845157, 0.008616341324993457, -0.06266899973104385, 0.10663434472687618, 0.30238677544515336, 0.21220723535827915, 0.3130107396164664, -0.4557679962046971, -0.24022761669193365, 0.10610282972379766, 0.12929536264849534, 0.14986698496781026, -0.07918556771509236, -0.2962521513632376, 0.11477449018628139, -0.15049423321592387, -0.06919858651470882, -0.1193883175387828, -0.02812903935578887, 0.0051675251299383666, -0.34839541967217386, 0.023306111140162542, 0.04709629937441963, -0.04211288680218988, -0.04519583411441853, -0.0927652625856225, 0.05852905948025485, 0.08387888136856032, 0.01999712641106335, 0.02867713457236838, 0.13259830629109698, -0.055982037773120656, -0.21133919063757992, 0.3490119077020673, -0.08638715347971278, -0.1896316397587082, 0.20738293096479593, -0.006912598409925146, -0.1551385782470908, 0.1331225520827704, 0.2348215078295331, 0.1248045281196634, -0.16133587767494692, 0.023359721699950632, 0.01839205500378151, 0.23276697153771164, 0.0013926212106727892, 0.00803352050210415, 0.16225873916456945, 0.23870498323907155, 0.07512716025189319, 0.1501107643819367, -0.05742771083940611, -0.08405741777346291, -0.278226579631199, -0.15869443600696295, -0.1325135984260476, -0.017611768726386468, -0.08253140161928105, -0.12834179383053473, 0.45182375154561466, 0.24642195589746338, 0.17090749589143076, 0.09018651491402639, 0.34214721542943005, 0.11401982752799122, 0.07947483111285802, 0.061517679029040866, 0.17650058848525849, -0.011164923196169312, 0.09115548623782216, -0.20780500872389912, 0.10052476392358052, 0.05280600859774182]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.