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.03867
|
Attosecond electronic recollision as field detector
|
We demonstrate the complete reconstruction of the electric field of
visible-infrared pulses with energy as low as a few tens of nanojoules. The
technique allows for the reconstruction of the instantaneous electric field
vector direction and magnitude, thus giving access to the characterisation of
pulses with an arbitrary time-dependent polarisation state. The technique
combines extreme ultraviolet interferometry with the generation of isolated
attosecond pulses.
|
physics.optics
|
we demonstrate the complete reconstruction of the electric field of visibleinfrared pulses with energy as low as a few tens of nanojoules the technique allows for the reconstruction of the instantaneous electric field vector direction and magnitude thus giving access to the characterisation of pulses with an arbitrary timedependent polarisation state the technique combines extreme ultraviolet interferometry with the generation of isolated attosecond pulses
|
[['we', 'demonstrate', 'the', 'complete', 'reconstruction', 'of', 'the', 'electric', 'field', 'of', 'visibleinfrared', 'pulses', 'with', 'energy', 'as', 'low', 'as', 'a', 'few', 'tens', 'of', 'nanojoules', 'the', 'technique', 'allows', 'for', 'the', 'reconstruction', 'of', 'the', 'instantaneous', 'electric', 'field', 'vector', 'direction', 'and', 'magnitude', 'thus', 'giving', 'access', 'to', 'the', 'characterisation', 'of', 'pulses', 'with', 'an', 'arbitrary', 'timedependent', 'polarisation', 'state', 'the', 'technique', 'combines', 'extreme', 'ultraviolet', 'interferometry', 'with', 'the', 'generation', 'of', 'isolated', 'attosecond', 'pulses']]
|
[-0.1325521600956563, 0.14507355163573266, -0.06366349207382882, 0.008376513547773357, -0.03179139716303325, -0.08831796468439279, 0.02132126827200409, 0.4433687721611932, -0.23995375928643625, -0.3960637618438341, 0.05552611336315749, -0.2288153631127443, -0.0163378962315619, 0.23618056715349667, 0.00887068855081452, 0.05613198185892543, 0.034429296320013236, 0.01982498228608165, -0.05528757617867086, -0.13577885503764264, 0.26266131360898726, 0.08598642438300885, 0.28095515331369825, 0.02502164175530197, 0.17222845836658962, 0.09024141711779521, -0.019094910443527624, -0.03524441805711831, -0.03295124266878702, 0.11632517647421992, 0.18676450103521347, 0.0804053136962466, 0.2522258599929046, -0.45369965786812827, -0.21883912516204873, 0.06560685994918458, 0.11680278921267018, 0.16488227489753626, -0.08930839176173322, -0.27122468464949634, 0.023655313183553517, -0.14094794860557158, -0.1897067472600611, -0.09037864119454753, -0.013139816081093159, 0.10678660641497117, -0.3171098022139631, 0.03751128125441028, 0.0006128600980446208, 0.05203580514353234, -0.0858318058481018, -0.021979387936880812, 0.023368291382212192, 0.09433725501730805, 0.0018331110186409205, 0.1118000001879409, 0.11856589512080973, -0.1700431061690324, -0.1354586823435966, 0.3334387420909479, -0.11764027605204319, -0.07428088679444045, 0.1472926725546131, -0.20409959503740538, -0.011001795639458578, 0.21775232162326574, 0.14087779787041654, 0.1904456422344083, -0.10458907333668321, 0.02028424377522242, 0.037926919692836236, 0.1690098117396701, 0.09942263143602759, 0.12439960365009028, 0.22147347294958308, 0.1701379070582334, 0.11277935295947827, 0.15489486921251228, -0.17555093558621593, -0.000785370768426219, -0.28781523962970823, -0.08928193870815448, -0.16809656246914528, 0.10059999951045029, -0.07719135934144106, -0.18650494181201793, 0.4848159676330397, 0.15700436390761752, 0.13218682290244033, -0.013691849182578153, 0.37016140058403835, 0.14301241650173324, 0.051877739759220276, 0.006620604981435463, 0.26075095077976584, 0.20242113593485556, 0.12575770403054776, -0.23400934565870557, -0.01646439908654429, 0.0029894432809669524]
|
1,803.03868
|
Perturbation bounds for eigenspaces under a relative gap condition
|
A basic problem in operator theory is to estimate how a small perturbation
effects the eigenspaces of a self-adjoint compact operator. In this paper, we
prove upper bounds for the subspace distance, taylored for structured random
perturbations. As a main example, we consider the empirical covariance
operator, and show that a sharp bound can be achieved under a relative gap
condition. The proof is based on a novel contraction phenomenon, contrasting
previous spectral perturbation approaches.
|
math.PR math.FA
|
a basic problem in operator theory is to estimate how a small perturbation effects the eigenspaces of a selfadjoint compact operator in this paper we prove upper bounds for the subspace distance taylored for structured random perturbations as a main example we consider the empirical covariance operator and show that a sharp bound can be achieved under a relative gap condition the proof is based on a novel contraction phenomenon contrasting previous spectral perturbation approaches
|
[['a', 'basic', 'problem', 'in', 'operator', 'theory', 'is', 'to', 'estimate', 'how', 'a', 'small', 'perturbation', 'effects', 'the', 'eigenspaces', 'of', 'a', 'selfadjoint', 'compact', 'operator', 'in', 'this', 'paper', 'we', 'prove', 'upper', 'bounds', 'for', 'the', 'subspace', 'distance', 'taylored', 'for', 'structured', 'random', 'perturbations', 'as', 'a', 'main', 'example', 'we', 'consider', 'the', 'empirical', 'covariance', 'operator', 'and', 'show', 'that', 'a', 'sharp', 'bound', 'can', 'be', 'achieved', 'under', 'a', 'relative', 'gap', 'condition', 'the', 'proof', 'is', 'based', 'on', 'a', 'novel', 'contraction', 'phenomenon', 'contrasting', 'previous', 'spectral', 'perturbation', 'approaches']]
|
[-0.1345052999847879, 0.09960471090084563, -0.1323139593191445, 0.12335896210900198, -0.07700845178837577, -0.11377336695169409, 0.04585658095777035, 0.33551659145702917, -0.2831375589470069, -0.2170087033758561, 0.13692984015059967, -0.25601778204242387, -0.21862494071091837, 0.1635798102244735, -0.12361232177664837, 0.061814577070375284, 0.09389379393309355, 0.06655493191753825, -0.11749054255895316, -0.15309471587340037, 0.3898501132490734, 0.03005304873494121, 0.24666872281581165, 0.09357413755031302, 0.06390608722964923, -0.03099004726856947, 0.018658810518682, 0.004595727771520615, -0.13737763928918867, 0.14047471123281866, 0.2169918412193268, 0.11167887223574023, 0.32967079506566127, -0.3914123890300592, -0.2141602403546373, 0.12672500474378467, 0.1459474280422243, 0.11095886814213979, -0.06719145990132044, -0.2731346488247315, 0.09582597786250213, -0.15020073605080445, -0.14756605827560026, -0.06413036473095417, 0.010158864681919415, -0.030484613974889118, -0.3630735529772937, 0.09148848360404373, 0.1370329025920364, 0.03637530984628635, -0.0728895077854395, -0.10309984812823435, 0.05519297550121943, 0.05645549297332764, 0.012804923428532978, 0.014547030051859717, 0.10626652917514244, -0.019934946947420637, -0.10588867445165913, 0.31213980038960776, -0.1450501126050949, -0.23666141447979802, 0.09956625717692077, -0.10888720001404484, -0.13973898222359518, 0.017185741526385148, 0.18235689509039124, 0.17300374515354633, -0.13256512615208824, 0.15034663715632632, -0.09056952590743701, 0.1563120920335253, 0.04254781052470207, 0.055666093907008565, 0.10208530396378289, 0.1423770073801279, 0.1857370536774397, 0.15126735815623155, -0.006917173385930558, -0.05144496500492096, -0.3388396062205235, -0.11080788085625197, -0.24057997753222785, 0.05785300536702077, -0.13625334890539914, -0.19773009074075767, 0.39673643474777537, 0.14114171708002687, 0.25608489220341046, 0.09571902963022391, 0.303954925040404, 0.1722108978483205, 0.014025420378893615, 0.08028873100876809, 0.2159131856014331, 0.1901173315445582, 0.02497369548305869, -0.16506216378261646, 0.04150903464915852, 0.16719986762851477]
|
1,803.03869
|
Jamming in Perspective
|
Jamming occurs when objects like grains are packed tightly together (e.g.
grain silos). It is highly cooperative and can lead to phenomena like
earthquakes, traffic jams, etc. In this Letter we point out the paramount
importance of the underlying contact network for jammed systems; the network
must have one contact in excess of isostaticity and a finite bulk modulus.
Isostatic means that the number of degrees of freedom are exactly balanced by
the number of constraints. This defines a large class of networks that can be
constructed without the necessity of packing particles together compressively
(either in the lab or computationally). One such construction, which we explore
here, involves setting up the Delaunay triangulation of a Poisson disk sampling
and then removing edges to maximize the bulk modulus until the isostatic plus
one point is reached. This construction works in any dimensions and here we
give results in 2D where we also show how such networks can be transformed into
a disk pack.
|
cond-mat.dis-nn cond-mat.soft
|
jamming occurs when objects like grains are packed tightly together eg grain silos it is highly cooperative and can lead to phenomena like earthquakes traffic jams etc in this letter we point out the paramount importance of the underlying contact network for jammed systems the network must have one contact in excess of isostaticity and a finite bulk modulus isostatic means that the number of degrees of freedom are exactly balanced by the number of constraints this defines a large class of networks that can be constructed without the necessity of packing particles together compressively either in the lab or computationally one such construction which we explore here involves setting up the delaunay triangulation of a poisson disk sampling and then removing edges to maximize the bulk modulus until the isostatic plus one point is reached this construction works in any dimensions and here we give results in 2d where we also show how such networks can be transformed into a disk pack
|
[['jamming', 'occurs', 'when', 'objects', 'like', 'grains', 'are', 'packed', 'tightly', 'together', 'eg', 'grain', 'silos', 'it', 'is', 'highly', 'cooperative', 'and', 'can', 'lead', 'to', 'phenomena', 'like', 'earthquakes', 'traffic', 'jams', 'etc', 'in', 'this', 'letter', 'we', 'point', 'out', 'the', 'paramount', 'importance', 'of', 'the', 'underlying', 'contact', 'network', 'for', 'jammed', 'systems', 'the', 'network', 'must', 'have', 'one', 'contact', 'in', 'excess', 'of', 'isostaticity', 'and', 'a', 'finite', 'bulk', 'modulus', 'isostatic', 'means', 'that', 'the', 'number', 'of', 'degrees', 'of', 'freedom', 'are', 'exactly', 'balanced', 'by', 'the', 'number', 'of', 'constraints', 'this', 'defines', 'a', 'large', 'class', 'of', 'networks', 'that', 'can', 'be', 'constructed', 'without', 'the', 'necessity', 'of', 'packing', 'particles', 'together', 'compressively', 'either', 'in', 'the', 'lab', 'or', 'computationally', 'one', 'such', 'construction', 'which', 'we', 'explore', 'here', 'involves', 'setting', 'up', 'the', 'delaunay', 'triangulation', 'of', 'a', 'poisson', 'disk', 'sampling', 'and', 'then', 'removing', 'edges', 'to', 'maximize', 'the', 'bulk', 'modulus', 'until', 'the', 'isostatic', 'plus', 'one', 'point', 'is', 'reached', 'this', 'construction', 'works', 'in', 'any', 'dimensions', 'and', 'here', 'we', 'give', 'results', 'in', '2d', 'where', 'we', 'also', 'show', 'how', 'such', 'networks', 'can', 'be', 'transformed', 'into', 'a', 'disk', 'pack']]
|
[-0.13933543069520252, 0.19182981394996945, -0.0739959662414493, 0.01622605454276653, -0.0679647205140373, -0.13875026483820077, 0.06835463942897055, 0.3708128888114281, -0.30114715972035394, -0.2901519347336486, 0.10866933888284364, -0.28635145546697033, -0.1956968389557206, 0.11982063989532095, -0.09226379336709259, 0.04516462479329502, 0.0547239547641805, 0.01024873896381972, -0.02564404999688725, -0.24975124560439377, 0.30921109013282266, 0.029215225481365355, 0.23759321195924757, 0.04573356593134842, 0.0792548829986731, 0.01051319992466847, 0.012722799554467201, 0.10325732965885084, -0.14568675238043827, 0.08006583582438483, 0.2459027371654984, 0.06711988746434268, 0.24002133045299837, -0.4661082278799974, -0.23913871242909013, 0.1509119213438747, 0.13855207337670392, 0.10072772105101588, 0.0003946481216870294, -0.21783762849993044, 0.11733596036753452, -0.1371353947917468, -0.13570634405660026, -0.05934831949716514, -0.012297346493789206, 0.015810339431638367, -0.2349043304580578, 0.039673048891291376, 0.07602358058072124, 0.027666804767813694, -0.019648523724129414, -0.08926281126421745, -0.051169485310835344, 0.12817483162739532, 0.01812313051367224, 0.01812541193294516, 0.1849378783261529, -0.14597332760537374, -0.07549357574370238, 0.4313538896799819, 0.02267676658008499, -0.2106782019486868, 0.20906394601091058, -0.10640741463899156, -0.14985288891861318, 0.15758958514822657, 0.18522272355843084, 0.07236594185154553, -0.1407980424559288, 0.0344706606912638, -0.05035209288374961, 0.13523636935914415, 0.10034440139571399, 0.014133978475805121, 0.24345553859259841, 0.1816568748141279, 0.10056189854023692, 0.18248554661104377, -0.0936386663340992, -0.10202974588410255, -0.2586158329586676, -0.16104578309973838, -0.2369126314068773, 0.06333487523016891, -0.11555363169187063, -0.16113395029621805, 0.3216768830466124, 0.11248029083759165, 0.2148887933563281, 0.057709847001267446, 0.25888802832209623, 0.05404445247587525, 0.0934411540307516, 0.09575421858487503, 0.22891091873749314, 0.07088672432247149, 0.07370748314892221, -0.14168179039436285, 0.06796188131414005, 0.0480100988650386]
|
1,803.0387
|
Detecting Adversarial Examples via Neural Fingerprinting
|
Deep neural networks are vulnerable to adversarial examples, which
dramatically alter model output using small input changes. We propose Neural
Fingerprinting, a simple, yet effective method to detect adversarial examples
by verifying whether model behavior is consistent with a set of secret
fingerprints, inspired by the use of biometric and cryptographic signatures.
The benefits of our method are that 1) it is fast, 2) it is prohibitively
expensive for an attacker to reverse-engineer which fingerprints were used, and
3) it does not assume knowledge of the adversary. In this work, we pose a
formal framework to analyze fingerprints under various threat models, and
characterize Neural Fingerprinting for linear models. For complex neural
networks, we empirically demonstrate that Neural Fingerprinting significantly
improves on state-of-the-art detection mechanisms by detecting the strongest
known adversarial attacks with 98-100% AUC-ROC scores on the MNIST, CIFAR-10
and MiniImagenet (20 classes) datasets. In particular, the detection accuracy
of Neural Fingerprinting generalizes well to unseen test-data under various
black- and whitebox threat models, and is robust over a wide range of
hyperparameters and choices of fingerprints.
|
cs.LG
|
deep neural networks are vulnerable to adversarial examples which dramatically alter model output using small input changes we propose neural fingerprinting a simple yet effective method to detect adversarial examples by verifying whether model behavior is consistent with a set of secret fingerprints inspired by the use of biometric and cryptographic signatures the benefits of our method are that 1 it is fast 2 it is prohibitively expensive for an attacker to reverseengineer which fingerprints were used and 3 it does not assume knowledge of the adversary in this work we pose a formal framework to analyze fingerprints under various threat models and characterize neural fingerprinting for linear models for complex neural networks we empirically demonstrate that neural fingerprinting significantly improves on stateoftheart detection mechanisms by detecting the strongest known adversarial attacks with 98100 aucroc scores on the mnist cifar10 and miniimagenet 20 classes datasets in particular the detection accuracy of neural fingerprinting generalizes well to unseen testdata under various black and whitebox threat models and is robust over a wide range of hyperparameters and choices of fingerprints
|
[['deep', 'neural', 'networks', 'are', 'vulnerable', 'to', 'adversarial', 'examples', 'which', 'dramatically', 'alter', 'model', 'output', 'using', 'small', 'input', 'changes', 'we', 'propose', 'neural', 'fingerprinting', 'a', 'simple', 'yet', 'effective', 'method', 'to', 'detect', 'adversarial', 'examples', 'by', 'verifying', 'whether', 'model', 'behavior', 'is', 'consistent', 'with', 'a', 'set', 'of', 'secret', 'fingerprints', 'inspired', 'by', 'the', 'use', 'of', 'biometric', 'and', 'cryptographic', 'signatures', 'the', 'benefits', 'of', 'our', 'method', 'are', 'that', '1', 'it', 'is', 'fast', '2', 'it', 'is', 'prohibitively', 'expensive', 'for', 'an', 'attacker', 'to', 'reverseengineer', 'which', 'fingerprints', 'were', 'used', 'and', '3', 'it', 'does', 'not', 'assume', 'knowledge', 'of', 'the', 'adversary', 'in', 'this', 'work', 'we', 'pose', 'a', 'formal', 'framework', 'to', 'analyze', 'fingerprints', 'under', 'various', 'threat', 'models', 'and', 'characterize', 'neural', 'fingerprinting', 'for', 'linear', 'models', 'for', 'complex', 'neural', 'networks', 'we', 'empirically', 'demonstrate', 'that', 'neural', 'fingerprinting', 'significantly', 'improves', 'on', 'stateoftheart', 'detection', 'mechanisms', 'by', 'detecting', 'the', 'strongest', 'known', 'adversarial', 'attacks', 'with', '98100', 'aucroc', 'scores', 'on', 'the', 'mnist', 'cifar10', 'and', 'miniimagenet', '20', 'classes', 'datasets', 'in', 'particular', 'the', 'detection', 'accuracy', 'of', 'neural', 'fingerprinting', 'generalizes', 'well', 'to', 'unseen', 'testdata', 'under', 'various', 'black', 'and', 'whitebox', 'threat', 'models', 'and', 'is', 'robust', 'over', 'a', 'wide', 'range', 'of', 'hyperparameters', 'and', 'choices', 'of', 'fingerprints']]
|
[-0.06994919420373205, -0.014529069524444507, -0.024903368829988934, 0.1024521613897398, -0.09226386242488262, -0.2557152272215229, 0.042221360149303985, 0.40636431730725925, -0.2512458026998461, -0.35338160613457026, 0.0798338523337165, -0.27034431878979825, -0.25586088850836425, 0.23386387972655776, -0.1493508058105527, 0.12324331526770808, 0.07632875909218512, 0.0274223676977395, -0.02930028692261437, -0.3087544482106627, 0.31735551902777015, 0.045094018195470334, 0.3292509012534625, 0.0331331091586995, 0.1006912320068285, -0.05264998378895097, 0.014755785734903088, -0.03006940142982929, -0.05826389854012576, 0.12032999748882534, 0.29529711042313705, 0.22500166874694622, 0.293773477570822, -0.40016463207209874, -0.2431060498643477, 0.12739918303694364, 0.11830072639915187, 0.16616614034478644, -0.050448594126839844, -0.3654110821958442, 0.17025883843080472, -0.21154666983517212, -0.0026443884734295856, -0.18762086871301092, -0.02533197786795807, -0.0022002615581798017, -0.2876390869424042, 0.0044478449678130045, 0.08066027794404239, 0.09316735621804824, -0.03324953984406035, -0.08479219435656306, 0.038114495718151876, 0.14787600536194057, 0.026488275598671476, 0.015868655647319548, 0.1773457530159819, -0.19254707199084642, -0.15377898073799928, 0.3254863644692268, -0.07640820247578924, -0.20105195198981565, 0.21984052830665124, 0.018182410171918444, -0.14309569958750012, 0.10854307906754777, 0.24331907207135764, 0.1609774362348483, -0.14046346108392302, 0.016744001971434087, -0.04402483746246303, 0.2206835001417683, 0.02982616432453111, 0.011657071760250519, 0.1547263008410816, 0.2142118560452814, 0.01844439700793075, 0.13648001692852393, -0.14604010359146685, -0.06399466684232807, -0.1888260067845721, -0.054968611784489814, -0.17894080285006597, 0.013237574275949375, -0.07952913221987662, -0.14766702567106166, 0.43094060393208167, 0.2669990791776086, 0.20876440249835956, 0.1262398595108761, 0.3669010248392989, -0.017501249748836586, 0.1274157422726269, 0.11752083786568568, 0.2036282499084028, 0.021559928317612175, 0.057397119597647615, -0.14328413035873178, 0.17875178530023006, 0.0042326925786101595]
|
1,803.03871
|
The Dynamical Mordell-Lang Conjecture for skew-linear self-maps
|
Let k be an algebraically closed field of characteristic 0, let X=P^1\times
A^N and let f be a rational endomorphism of X given by (x,y)--->(g(x), A(x)y),
where g is a rational function, while A is an N-by-N matrix with entries in
k(x). We prove that if g is of the form x--->ax+b, then each irreducible curve
C of X which intersects some orbit of f in infinitely many points must be
periodic under the action of f. In the case g is an endomorphism of degree
greater than 1, then we prove that each irreducible subvariety Y of X
intersecting an orbit of f in a Zariski dense set of points must be periodic as
well. Our results provide the desired conclusion in the Dynamical Mordell-Lang
Conjecture in a couple new instances. Also, our results have interesting
consequences towards a conjecture of Rubel and towards a generalized
Skolem-Mahler-Lech problem proposed by Wibmer in the context of difference
equations. In the appendix it is shown that the results can also be used to
construct Picard-Vessiot extensions in the ring of sequences.
|
math.NT math.AG math.DS
|
let k be an algebraically closed field of characteristic 0 let xp1times an and let f be a rational endomorphism of x given by xygx axy where g is a rational function while a is an nbyn matrix with entries in kx we prove that if g is of the form xaxb then each irreducible curve c of x which intersects some orbit of f in infinitely many points must be periodic under the action of f in the case g is an endomorphism of degree greater than 1 then we prove that each irreducible subvariety y of x intersecting an orbit of f in a zariski dense set of points must be periodic as well our results provide the desired conclusion in the dynamical mordelllang conjecture in a couple new instances also our results have interesting consequences towards a conjecture of rubel and towards a generalized skolemmahlerlech problem proposed by wibmer in the context of difference equations in the appendix it is shown that the results can also be used to construct picardvessiot extensions in the ring of sequences
|
[['let', 'k', 'be', 'an', 'algebraically', 'closed', 'field', 'of', 'characteristic', '0', 'let', 'xp1times', 'an', 'and', 'let', 'f', 'be', 'a', 'rational', 'endomorphism', 'of', 'x', 'given', 'by', 'xygx', 'axy', 'where', 'g', 'is', 'a', 'rational', 'function', 'while', 'a', 'is', 'an', 'nbyn', 'matrix', 'with', 'entries', 'in', 'kx', 'we', 'prove', 'that', 'if', 'g', 'is', 'of', 'the', 'form', 'xaxb', 'then', 'each', 'irreducible', 'curve', 'c', 'of', 'x', 'which', 'intersects', 'some', 'orbit', 'of', 'f', 'in', 'infinitely', 'many', 'points', 'must', 'be', 'periodic', 'under', 'the', 'action', 'of', 'f', 'in', 'the', 'case', 'g', 'is', 'an', 'endomorphism', 'of', 'degree', 'greater', 'than', '1', 'then', 'we', 'prove', 'that', 'each', 'irreducible', 'subvariety', 'y', 'of', 'x', 'intersecting', 'an', 'orbit', 'of', 'f', 'in', 'a', 'zariski', 'dense', 'set', 'of', 'points', 'must', 'be', 'periodic', 'as', 'well', 'our', 'results', 'provide', 'the', 'desired', 'conclusion', 'in', 'the', 'dynamical', 'mordelllang', 'conjecture', 'in', 'a', 'couple', 'new', 'instances', 'also', 'our', 'results', 'have', 'interesting', 'consequences', 'towards', 'a', 'conjecture', 'of', 'rubel', 'and', 'towards', 'a', 'generalized', 'skolemmahlerlech', 'problem', 'proposed', 'by', 'wibmer', 'in', 'the', 'context', 'of', 'difference', 'equations', 'in', 'the', 'appendix', 'it', 'is', 'shown', 'that', 'the', 'results', 'can', 'also', 'be', 'used', 'to', 'construct', 'picardvessiot', 'extensions', 'in', 'the', 'ring', 'of', 'sequences']]
|
[-0.20733991970135804, 0.08309627967693588, -0.12160612837448295, -0.01793317837406497, -0.04444831822035929, -0.14920564623560104, -0.01619817638548754, 0.33639594398459977, -0.32136493387216397, -0.1867171131642693, 0.07024829631531875, -0.26479927167864675, -0.1426350550310381, 0.2186129484167796, -0.11820864316930163, -0.03176054968840658, 0.04917531857651127, 0.14235445727494883, -0.06412938508299827, -0.31175435596477175, 0.3429300171549374, -0.06806541732604494, 0.14256162778079762, 0.05179233870983366, 0.10805854880603524, -0.011825874531105566, 0.069887931006145, 0.018587091575918646, -0.1269147223115114, 0.07420540014926429, 0.30402726534817176, 0.12363561530897425, 0.2670389165349389, -0.35287778758270255, -0.16577319686411549, 0.22397650578085565, 0.17162908786792033, -0.01914726690149808, -0.0209306434170464, -0.25798625814844195, 0.16932802190635837, -0.14354393702458476, -0.2004416383418786, -0.044049587473010195, 0.13293692875406204, 0.02965270040660707, -0.3211276176264562, -0.03543694945095675, 0.11307717337503918, 0.10745186528643477, -0.04067215399479883, -0.12660907599864538, -0.06592545578536435, 0.057211209025423405, 0.00548556073447742, 0.13115089806717542, 0.05543725272261743, -0.07331075140217182, -0.0913657073331418, 0.3785364940488911, -0.10459145700592234, -0.23813477449255896, 0.09808814628996838, -0.17379025964981923, -0.14292585330168153, 0.14822200043646536, 0.10879370442849431, 0.16594784801015577, -0.07184549357931493, 0.20101298213249735, -0.16573294998070298, 0.1254731681392565, 0.06101370179278534, -0.027838091589615675, 0.1945898872300309, 0.07322269527499412, 0.10375351950083596, 0.142203520826264, 0.014376567556959508, 0.02916928292331049, -0.3584507736088024, -0.17173055283814712, -0.14849779810691546, 0.14790259446885626, -0.10881638560903859, -0.1513422965787359, 0.386513368929026, 0.10952924404787899, 0.22264363189717218, 0.057304574535123075, 0.20644317274271262, 0.10418909999660655, 0.00834740622437396, 0.09822101270635929, 0.09910176667114483, 0.18793430020059274, -0.06343692812560874, -0.13581495082510983, 0.030482753969223824, 0.13750287868861255]
|
1,803.03872
|
Continuous Combinatorics of Abelian Group Actions
|
This paper develops techniques which are used to answer a number of questions
in the theory of equivalence relations generated by continuous actions of
abelian groups. The methods center around the construction of certain
specialized hyper-aperiodic elements, which produce compact subflows with
useful properties. For example, we show that there is no continuous
$3$-coloring of the Cayley graph on $F(2^{\mathbb{Z}^2})$, the free part of the
shift action of $\mathbb{Z}^2$ on $2^{\mathbb{Z}^2}$. With earlier work of the
authors this computes the continuous chromatic number of $F(2^{\mathbb{Z}^2})$
to be exactly $4$. Combined with marker arguments for the positive directions,
our methods allow us to analyze continuous homomorphisms into graphs, and more
generally equivariant maps into subshifts of finite type. We present a general
construction of a finite set of "tiles" for $2^{\mathbb{Z}^n}$ (there are $12$
for $n=2$) such that questions about the existence of continuous homomorphisms
into various structures reduce to finitary combinatorial questions about the
tiles. This tile analysis is used to deduce a number of results about
$F(2^{\mathbb{Z}^n})$.
|
math.LO math.CO math.GR
|
this paper develops techniques which are used to answer a number of questions in the theory of equivalence relations generated by continuous actions of abelian groups the methods center around the construction of certain specialized hyperaperiodic elements which produce compact subflows with useful properties for example we show that there is no continuous 3coloring of the cayley graph on f2mathbbz2 the free part of the shift action of mathbbz2 on 2mathbbz2 with earlier work of the authors this computes the continuous chromatic number of f2mathbbz2 to be exactly 4 combined with marker arguments for the positive directions our methods allow us to analyze continuous homomorphisms into graphs and more generally equivariant maps into subshifts of finite type we present a general construction of a finite set of tiles for 2mathbbzn there are 12 for n2 such that questions about the existence of continuous homomorphisms into various structures reduce to finitary combinatorial questions about the tiles this tile analysis is used to deduce a number of results about f2mathbbzn
|
[['this', 'paper', 'develops', 'techniques', 'which', 'are', 'used', 'to', 'answer', 'a', 'number', 'of', 'questions', 'in', 'the', 'theory', 'of', 'equivalence', 'relations', 'generated', 'by', 'continuous', 'actions', 'of', 'abelian', 'groups', 'the', 'methods', 'center', 'around', 'the', 'construction', 'of', 'certain', 'specialized', 'hyperaperiodic', 'elements', 'which', 'produce', 'compact', 'subflows', 'with', 'useful', 'properties', 'for', 'example', 'we', 'show', 'that', 'there', 'is', 'no', 'continuous', '3coloring', 'of', 'the', 'cayley', 'graph', 'on', 'f2mathbbz2', 'the', 'free', 'part', 'of', 'the', 'shift', 'action', 'of', 'mathbbz2', 'on', '2mathbbz2', 'with', 'earlier', 'work', 'of', 'the', 'authors', 'this', 'computes', 'the', 'continuous', 'chromatic', 'number', 'of', 'f2mathbbz2', 'to', 'be', 'exactly', '4', 'combined', 'with', 'marker', 'arguments', 'for', 'the', 'positive', 'directions', 'our', 'methods', 'allow', 'us', 'to', 'analyze', 'continuous', 'homomorphisms', 'into', 'graphs', 'and', 'more', 'generally', 'equivariant', 'maps', 'into', 'subshifts', 'of', 'finite', 'type', 'we', 'present', 'a', 'general', 'construction', 'of', 'a', 'finite', 'set', 'of', 'tiles', 'for', '2mathbbzn', 'there', 'are', '12', 'for', 'n2', 'such', 'that', 'questions', 'about', 'the', 'existence', 'of', 'continuous', 'homomorphisms', 'into', 'various', 'structures', 'reduce', 'to', 'finitary', 'combinatorial', 'questions', 'about', 'the', 'tiles', 'this', 'tile', 'analysis', 'is', 'used', 'to', 'deduce', 'a', 'number', 'of', 'results', 'about', 'f2mathbbzn']]
|
[-0.10330392364455664, 0.1158574797431536, -0.0809512489485101, 0.06847358828289779, -0.09605586944423893, -0.10831117658749406, 0.06554496259123868, 0.3712519746687677, -0.29038102240416647, -0.2843191523599312, 0.12101248827731283, -0.2609587221831819, -0.13323481403935103, 0.2183192245113192, -0.10637163851168696, 0.015233344369694406, 0.05774295686479704, 0.06871409886545375, -0.0654768893361091, -0.2731107762061853, 0.34996786686005416, -0.03862355338599257, 0.20974403300342714, 0.039560935040360984, 0.10178613045467007, 0.01821987213060996, -0.07204964128610344, 0.053272022200276915, -0.16765206775034816, 0.16311105903680723, 0.28641879309060764, 0.14685506673161813, 0.248031517073949, -0.40253528862915655, -0.18655987015751443, 0.17203754833956927, 0.0862620869309377, 0.08270442366663275, -0.048753485685687964, -0.2638891441345123, 0.1444144349740703, -0.13529751246366045, -0.12527788283280383, -0.058195731369778514, 0.04792404785913266, 0.02358093493859525, -0.24942759798701714, -0.023050146450484057, 0.13601465837959556, 0.09021362558835083, -0.04405553065589629, -0.09286085352011278, -0.0068856051779513094, 0.1688457769083066, 0.019497969275685867, 0.026977089336458135, 0.07785268013874345, -0.0811102411545882, -0.1651784717593986, 0.37474659039857394, -0.01914668389176375, -0.20687795105177542, 0.19087914318812113, -0.1326330503029174, -0.20303277256266203, 0.14385948419056396, 0.14362070012412229, 0.12158940735066102, -0.06825205468699153, 0.09872825333617202, -0.1200776639132887, 0.17501444165755844, 0.09480312006709016, 0.006189885107659517, 0.16442615593737567, 0.10646725837198764, 0.12197271625534344, 0.1694876523767483, 0.04313287472950272, -0.0515566534265002, -0.3134266053337926, -0.13926052081112658, -0.1202118022016675, 0.07588941482668972, -0.08680486013057546, -0.20839454709511987, 0.4193884004942245, 0.14725633674835856, 0.1808591090734864, 0.09639816546243513, 0.2251341513208585, 0.07184301011767713, 0.06879777746436036, 0.043403118692592134, 0.11106670529072828, 0.16872169609026363, 0.0030507359992896703, -0.13462008315607055, -0.0043892890148807635, 0.16118323015922933]
|
1,803.03873
|
Non--geodesic circular motion of massive spinning test bodies
|
Recent interest on studying possible violations of the Equivalence Principle
has led to the development of space satellite missions testing it for bodies
moving on circular orbits around Earth. This experiment establishes that the
validity of the Equivalence Principle is independent of the composition of
bodies. However, the internal degrees of freedom of the bodies (such as spin)
were not taken into account. In this work, it is shown exactly that the
circular orbit motion of test bodies does present a departure from geodesic
motion when spin effects are not negligible. Using a Lagrangian theory for
spinning massive bodies, an exact solution for their circular motion is found
showing that the non--geodesic behavior manifests through different tangential
velocities of the test bodies, depending on the orientation of its spin with
respect to the total angular momentum of the satellite. Besides, for circular
orbits, spinning test bodies present no tangential acceleration. We estimate
the difference of the two possible tangential velocities for the case of
circular motion of spinning test bodies orbiting Earth.
|
gr-qc
|
recent interest on studying possible violations of the equivalence principle has led to the development of space satellite missions testing it for bodies moving on circular orbits around earth this experiment establishes that the validity of the equivalence principle is independent of the composition of bodies however the internal degrees of freedom of the bodies such as spin were not taken into account in this work it is shown exactly that the circular orbit motion of test bodies does present a departure from geodesic motion when spin effects are not negligible using a lagrangian theory for spinning massive bodies an exact solution for their circular motion is found showing that the nongeodesic behavior manifests through different tangential velocities of the test bodies depending on the orientation of its spin with respect to the total angular momentum of the satellite besides for circular orbits spinning test bodies present no tangential acceleration we estimate the difference of the two possible tangential velocities for the case of circular motion of spinning test bodies orbiting earth
|
[['recent', 'interest', 'on', 'studying', 'possible', 'violations', 'of', 'the', 'equivalence', 'principle', 'has', 'led', 'to', 'the', 'development', 'of', 'space', 'satellite', 'missions', 'testing', 'it', 'for', 'bodies', 'moving', 'on', 'circular', 'orbits', 'around', 'earth', 'this', 'experiment', 'establishes', 'that', 'the', 'validity', 'of', 'the', 'equivalence', 'principle', 'is', 'independent', 'of', 'the', 'composition', 'of', 'bodies', 'however', 'the', 'internal', 'degrees', 'of', 'freedom', 'of', 'the', 'bodies', 'such', 'as', 'spin', 'were', 'not', 'taken', 'into', 'account', 'in', 'this', 'work', 'it', 'is', 'shown', 'exactly', 'that', 'the', 'circular', 'orbit', 'motion', 'of', 'test', 'bodies', 'does', 'present', 'a', 'departure', 'from', 'geodesic', 'motion', 'when', 'spin', 'effects', 'are', 'not', 'negligible', 'using', 'a', 'lagrangian', 'theory', 'for', 'spinning', 'massive', 'bodies', 'an', 'exact', 'solution', 'for', 'their', 'circular', 'motion', 'is', 'found', 'showing', 'that', 'the', 'nongeodesic', 'behavior', 'manifests', 'through', 'different', 'tangential', 'velocities', 'of', 'the', 'test', 'bodies', 'depending', 'on', 'the', 'orientation', 'of', 'its', 'spin', 'with', 'respect', 'to', 'the', 'total', 'angular', 'momentum', 'of', 'the', 'satellite', 'besides', 'for', 'circular', 'orbits', 'spinning', 'test', 'bodies', 'present', 'no', 'tangential', 'acceleration', 'we', 'estimate', 'the', 'difference', 'of', 'the', 'two', 'possible', 'tangential', 'velocities', 'for', 'the', 'case', 'of', 'circular', 'motion', 'of', 'spinning', 'test', 'bodies', 'orbiting', 'earth']]
|
[-0.17323329082560227, 0.1505368268206143, -0.10700489580631256, 0.024302874123244438, -0.09609365687694747, -0.04180927031002073, -0.019860846205881178, 0.3258631133723484, -0.22727216453410598, -0.2979639449233303, 0.06035777597571723, -0.2656522022484433, -0.07263399383525614, 0.23694668630094723, -0.07262459376469514, 0.05881145434571852, 0.11105501510711863, 0.04091563012023175, -0.07867956283802795, -0.20464083377466818, 0.29070747557345256, 0.04436466346500268, 0.19095201531105654, -0.010043452290796437, 0.15482044649895194, 0.048495393180759454, 0.008760378319705121, 0.06671963118508778, -0.11565232719493547, 0.12085198346717652, 0.15300688872433288, 0.10874417409205878, 0.1933180638751405, -0.41324782569697777, -0.1830462846352697, 0.07448551470283853, 0.09952802309863876, 0.09953560868581367, -0.04654849438080672, -0.28944253315472285, 0.03767453246684962, -0.1696624366030487, -0.24858251685103358, -0.0279644159545992, 0.14193518805252606, 0.007038121402052469, -0.20979356598839988, 0.08908374069615939, 0.1403538981766635, 0.08205171684236374, -0.11868745543476909, -0.08973675698101477, -0.04843777900312616, 0.12308869699268672, 0.15690371996403651, -0.005542719070691355, 0.17516846073179526, -0.05428108294916794, -0.09625439354500105, 0.47638316300351086, -0.03628900680869688, -0.2264990735268437, 0.2312757113953879, -0.22846160995568213, -0.09813164005889882, 0.12585457706915995, 0.20414320908779235, 0.1608384530422776, -0.1684595460826321, 0.07582402363051335, -0.04583605533319547, 0.11835701016812088, 0.13525333907996673, 0.001944656022905567, 0.3393824715167284, 0.11163536725473742, 0.1003759767167097, 0.10488474992683244, -0.15872472965532133, -0.10717646591162287, -0.29710534465401756, -0.17546117578316373, -0.17666816382755546, 0.022505015132273275, -0.08551759825380476, -0.12932993217116237, 0.3153718288061967, 0.12246366838456219, 0.15580449415760678, 0.04138441969705529, 0.28761121403252665, 0.04704435011520874, 0.06342571122209044, 0.07035310023820784, 0.36500543342946573, 0.13760127264703081, 0.040453972192047986, -0.255976083335131, 0.057058446028751736, 0.04058975955406421]
|
1,803.03874
|
Tracking of the Internal Jugular Vein in Ultrasound Images Using Optical
Flow
|
Detection of relative changes in circulating blood volume is important to
guide resuscitation and manage variety of medical conditions including sepsis,
trauma, dialysis and congestive heart failure. Recent studies have shown that
estimates of circulating blood volume can be obtained from ultrasound imagery
of the of the internal jugular vein (IJV). However, segmentation and tracking
of the IJV is significantly influenced by speckle noise and shadowing which
introduce uncertainty in the boundaries of the vessel. In this paper, we
investigate the use of optical flow algorithms for segmentation and tracking of
the IJV and show that the classical Lucas-Kanade (LK) algorithm provides the
best performance among well-known flow tracking algorithms.
|
eess.IV
|
detection of relative changes in circulating blood volume is important to guide resuscitation and manage variety of medical conditions including sepsis trauma dialysis and congestive heart failure recent studies have shown that estimates of circulating blood volume can be obtained from ultrasound imagery of the of the internal jugular vein ijv however segmentation and tracking of the ijv is significantly influenced by speckle noise and shadowing which introduce uncertainty in the boundaries of the vessel in this paper we investigate the use of optical flow algorithms for segmentation and tracking of the ijv and show that the classical lucaskanade lk algorithm provides the best performance among wellknown flow tracking algorithms
|
[['detection', 'of', 'relative', 'changes', 'in', 'circulating', 'blood', 'volume', 'is', 'important', 'to', 'guide', 'resuscitation', 'and', 'manage', 'variety', 'of', 'medical', 'conditions', 'including', 'sepsis', 'trauma', 'dialysis', 'and', 'congestive', 'heart', 'failure', 'recent', 'studies', 'have', 'shown', 'that', 'estimates', 'of', 'circulating', 'blood', 'volume', 'can', 'be', 'obtained', 'from', 'ultrasound', 'imagery', 'of', 'the', 'of', 'the', 'internal', 'jugular', 'vein', 'ijv', 'however', 'segmentation', 'and', 'tracking', 'of', 'the', 'ijv', 'is', 'significantly', 'influenced', 'by', 'speckle', 'noise', 'and', 'shadowing', 'which', 'introduce', 'uncertainty', 'in', 'the', 'boundaries', 'of', 'the', 'vessel', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'use', 'of', 'optical', 'flow', 'algorithms', 'for', 'segmentation', 'and', 'tracking', 'of', 'the', 'ijv', 'and', 'show', 'that', 'the', 'classical', 'lucaskanade', 'lk', 'algorithm', 'provides', 'the', 'best', 'performance', 'among', 'wellknown', 'flow', 'tracking', 'algorithms']]
|
[-0.06100933867062188, 0.06138439415530725, -0.08273951699533923, 0.011118200502824038, -0.025909351148981262, -0.09759775302796202, -0.012427426160270856, 0.35950420442968606, -0.23460880412550814, -0.2980260025074875, 0.14813492066353898, -0.25298338154838845, -0.19343130305748094, 0.23487874410030515, -0.22792598569173028, 0.08628233761568978, 0.12165106330913576, 0.054472975940866905, 0.024146369597027924, -0.20934820869323714, 0.23853209399279546, 0.035052395973947235, 0.35302406495267696, 0.06543987218967894, 0.12486737321596593, 0.0253746145140295, -0.08967486274513331, 0.04703464442440732, -0.12536856336585267, 0.14484789323608063, 0.2758789318275045, 0.14916997360996903, 0.2858734840696508, -0.4152654618702152, -0.25457773537121037, 0.10571281365965578, 0.16300705002451485, 0.09502068520206111, -0.0394022495824505, -0.32529852028819733, 0.09010197457603433, -0.14460712490201166, -0.06621211024466903, -0.0604410418393937, -0.011510643130168318, 0.05699598256138746, -0.2550133796408772, 0.13065756538205525, 0.038705250877286414, 0.12068642371926795, -0.08723062700168653, -0.08449652006383986, -0.004960878886049613, 0.20343664932826702, 0.055481303214434195, 0.054369685756550594, 0.21715961566872216, -0.2180149640993808, -0.11019704716957428, 0.3763721018013629, -0.001562769694084471, -0.15528392674803565, 0.2062778946541419, -0.13288885641165754, -0.09056146452626722, 0.15812506079462102, 0.21389659241857853, 0.0871333376462148, -0.1465388200923123, -0.04027305591364645, 0.016361911268904804, 0.13083381728184493, 0.12284704590724273, -0.03369885048067028, 0.12339226636739278, 0.219623964025893, 0.04848482054552402, 0.14592910283721391, -0.17457717740908266, -0.013593523153527217, -0.21008470859696074, -0.14908013999123465, -0.09121982672421092, -0.04490672830830921, -0.060358488580095584, -0.16418256173307202, 0.3756575909866528, 0.20342697527164338, 0.13558699323753404, 0.0007704835818995806, 0.3527087161486799, 0.01595723281550983, 0.0727274415506558, 0.04816315912810916, 0.21706806829791855, 0.07882036203227472, 0.11017092960801991, -0.2946616125779904, 0.11866567661160264, 0.05868325231766159]
|
1,803.03875
|
Empirical Likelihood Based Summary ROC Curve for Meta-Analysis of
Diagnostic Studies
|
Objectives: This study provides an effective model selection method based on
the empirical likelihood approach for constructing summary receiver operating
characteristic (sROC) curves from meta-analyses of diagnostic studies.
Methods: We considered models from combinations of family indices and
specific pairs of transformations, which cover several widely used methods for
bivariate summary of sensitivity and specificity. Then a final model was
selected using the proposed empirical likelihood method. Simulation scenarios
were conducted based on different number of studies and different population
distributions for the disease and non-disease cases. The performance of our
proposal and other model selection criteria was also compared.
Results: Although parametric likelihood-based methods are often applied in
practice due to its asymptotic property, they fail to consistently choose
appropriate models for summary under the limited number of studies. For these
situations, our proposed method almost always performs better.
Conclusion: When the number of studies is as small as 10 or 5, we recommend
choosing a summary model via the proposed empirical likelihood method.
|
stat.ME
|
objectives this study provides an effective model selection method based on the empirical likelihood approach for constructing summary receiver operating characteristic sroc curves from metaanalyses of diagnostic studies methods we considered models from combinations of family indices and specific pairs of transformations which cover several widely used methods for bivariate summary of sensitivity and specificity then a final model was selected using the proposed empirical likelihood method simulation scenarios were conducted based on different number of studies and different population distributions for the disease and nondisease cases the performance of our proposal and other model selection criteria was also compared results although parametric likelihoodbased methods are often applied in practice due to its asymptotic property they fail to consistently choose appropriate models for summary under the limited number of studies for these situations our proposed method almost always performs better conclusion when the number of studies is as small as 10 or 5 we recommend choosing a summary model via the proposed empirical likelihood method
|
[['objectives', 'this', 'study', 'provides', 'an', 'effective', 'model', 'selection', 'method', 'based', 'on', 'the', 'empirical', 'likelihood', 'approach', 'for', 'constructing', 'summary', 'receiver', 'operating', 'characteristic', 'sroc', 'curves', 'from', 'metaanalyses', 'of', 'diagnostic', 'studies', 'methods', 'we', 'considered', 'models', 'from', 'combinations', 'of', 'family', 'indices', 'and', 'specific', 'pairs', 'of', 'transformations', 'which', 'cover', 'several', 'widely', 'used', 'methods', 'for', 'bivariate', 'summary', 'of', 'sensitivity', 'and', 'specificity', 'then', 'a', 'final', 'model', 'was', 'selected', 'using', 'the', 'proposed', 'empirical', 'likelihood', 'method', 'simulation', 'scenarios', 'were', 'conducted', 'based', 'on', 'different', 'number', 'of', 'studies', 'and', 'different', 'population', 'distributions', 'for', 'the', 'disease', 'and', 'nondisease', 'cases', 'the', 'performance', 'of', 'our', 'proposal', 'and', 'other', 'model', 'selection', 'criteria', 'was', 'also', 'compared', 'results', 'although', 'parametric', 'likelihoodbased', 'methods', 'are', 'often', 'applied', 'in', 'practice', 'due', 'to', 'its', 'asymptotic', 'property', 'they', 'fail', 'to', 'consistently', 'choose', 'appropriate', 'models', 'for', 'summary', 'under', 'the', 'limited', 'number', 'of', 'studies', 'for', 'these', 'situations', 'our', 'proposed', 'method', 'almost', 'always', 'performs', 'better', 'conclusion', 'when', 'the', 'number', 'of', 'studies', 'is', 'as', 'small', 'as', '10', 'or', '5', 'we', 'recommend', 'choosing', 'a', 'summary', 'model', 'via', 'the', 'proposed', 'empirical', 'likelihood', 'method']]
|
[-0.0044350347830913964, -0.01763495418417733, -0.10371636514072165, 0.11303281681329914, -0.054964681604707785, -0.17650060183227514, 0.08070160506970503, 0.4268803744379318, -0.17214822651038764, -0.36181882504148016, 0.10353713009548797, -0.2522049025322, -0.16490902549474304, 0.26352238589721366, -0.07203102869292101, 0.10161570249739188, 0.09245205469090831, 0.0159591069445014, -0.038833635971726226, -0.3127468777030255, 0.2714171735132395, 0.08243301589832161, 0.37305574122618773, -0.019927012778211836, 0.0652005953305034, -0.0009838723182452448, -0.07561351776574597, 0.040793236175092965, -0.13785300497812303, 0.10482128290741732, 0.2571956205582617, 0.21673635662335788, 0.3060675166293301, -0.35026413972972836, -0.22814957721187085, 0.12332823657797592, 0.13679371682052133, 0.0920837338837428, -0.017939277750327054, -0.24770542087992936, 0.06500098022039641, -0.17849185096812575, -0.08479211036906098, -0.11258198559199545, -0.05531495861765562, 0.056156942758455196, -0.33076879833683825, 0.07103921313360897, 0.02338810848693053, 0.09419690051087827, -0.04391546599411716, -0.2109550235383777, 0.014570321484158436, 0.09975914802829114, 0.0941078694537282, -0.02351225782961895, 0.11418330403835034, -0.08840488638644191, -0.12119557725223289, 0.3293423185640043, -0.042719423158489395, -0.2274363689999463, 0.2265805608169599, -0.0622875580648807, -0.16070033640628964, 0.09635503915223208, 0.19373941748847506, 0.16308219214957773, -0.17493271108789044, -0.01215935567796061, -0.021028412874985598, 0.14076526301673079, 0.012486636079847813, -0.01840510018113436, 0.171051882733732, 0.19215702548284422, 0.0009909386795973688, 0.11274389837635682, -0.12442596020656779, -0.08015400576264117, -0.28133252088093397, -0.0788448677793371, -0.17645506263625893, -0.03495029640440462, -0.10041675180801769, -0.13105016733717287, 0.4163764285135337, 0.21963557197975178, 0.15509188237854027, 0.07133405290783919, 0.31264164613164735, 0.06472159368762126, 0.04807185900349533, 0.02030870317566124, 0.190102488970892, 0.08295552802332112, 0.027568408146952137, -0.16350370786209223, 0.11558878254568712, 0.036594342901794745]
|
1,803.03876
|
Correlation Measurements Between Flow Harmonics in Au+Au Collisions at
RHIC
|
Flow harmonics ($v_n$) in the Fourier expansion of the azimuthal distribution
of particles are widely used to quantify the anisotropy in particle emission in
high-energy heavy-ion collisions. The symmetric cumulants, $SC(m,n)$, are used
to measure the correlations between different orders of flow harmonics. These
correlations are used to constrain the initial conditions and the transport
properties of the medium in theoretical models. In this Letter, we present the
first measurements of the four-particle symmetric cumulants in Au+Au collisions
at $\sqrt{s_{NN}}$ = 39 and 200 GeV from data collected by the STAR experiment
at RHIC. We observe that $v_{2}$ and $v_{3}$ are anti-correlated in all
centrality intervals with similar correlation strengths from 39 GeV Au+Au to
2.76 TeV Pb+Pb (measured by the ALICE experiment). The $v_{2}$-$v_{4}$
correlation seems to be stronger at 39 GeV than at higher collision energies.
The initial-stage anti-correlations between second and third order
eccentricities are sufficient to describe the measured correlations between
$v_{2}$ and $v_{3}$. The best description of $v_{2}$-$v_{4}$ correlations at
$\sqrt{s_{NN}}$ = 200 GeV is obtained with inclusion of the system's nonlinear
response to initial eccentricities accompanied by the viscous effect with
$\eta/s$ $>$ 0.08. Theoretical calculations using different initial conditions,
equations of state and viscous coefficients need to be further explored to
extract $\eta/s$ of the medium created at RHIC.
|
nucl-ex hep-ex
|
flow harmonics v_n in the fourier expansion of the azimuthal distribution of particles are widely used to quantify the anisotropy in particle emission in highenergy heavyion collisions the symmetric cumulants scmn are used to measure the correlations between different orders of flow harmonics these correlations are used to constrain the initial conditions and the transport properties of the medium in theoretical models in this letter we present the first measurements of the fourparticle symmetric cumulants in auau collisions at sqrts_nn 39 and 200 gev from data collected by the star experiment at rhic we observe that v_2 and v_3 are anticorrelated in all centrality intervals with similar correlation strengths from 39 gev auau to 276 tev pbpb measured by the alice experiment the v_2v_4 correlation seems to be stronger at 39 gev than at higher collision energies the initialstage anticorrelations between second and third order eccentricities are sufficient to describe the measured correlations between v_2 and v_3 the best description of v_2v_4 correlations at sqrts_nn 200 gev is obtained with inclusion of the systems nonlinear response to initial eccentricities accompanied by the viscous effect with etas 008 theoretical calculations using different initial conditions equations of state and viscous coefficients need to be further explored to extract etas of the medium created at rhic
|
[['flow', 'harmonics', 'v_n', 'in', 'the', 'fourier', 'expansion', 'of', 'the', 'azimuthal', 'distribution', 'of', 'particles', 'are', 'widely', 'used', 'to', 'quantify', 'the', 'anisotropy', 'in', 'particle', 'emission', 'in', 'highenergy', 'heavyion', 'collisions', 'the', 'symmetric', 'cumulants', 'scmn', 'are', 'used', 'to', 'measure', 'the', 'correlations', 'between', 'different', 'orders', 'of', 'flow', 'harmonics', 'these', 'correlations', 'are', 'used', 'to', 'constrain', 'the', 'initial', 'conditions', 'and', 'the', 'transport', 'properties', 'of', 'the', 'medium', 'in', 'theoretical', 'models', 'in', 'this', 'letter', 'we', 'present', 'the', 'first', 'measurements', 'of', 'the', 'fourparticle', 'symmetric', 'cumulants', 'in', 'auau', 'collisions', 'at', 'sqrts_nn', '39', 'and', '200', 'gev', 'from', 'data', 'collected', 'by', 'the', 'star', 'experiment', 'at', 'rhic', 'we', 'observe', 'that', 'v_2', 'and', 'v_3', 'are', 'anticorrelated', 'in', 'all', 'centrality', 'intervals', 'with', 'similar', 'correlation', 'strengths', 'from', '39', 'gev', 'auau', 'to', '276', 'tev', 'pbpb', 'measured', 'by', 'the', 'alice', 'experiment', 'the', 'v_2v_4', 'correlation', 'seems', 'to', 'be', 'stronger', 'at', '39', 'gev', 'than', 'at', 'higher', 'collision', 'energies', 'the', 'initialstage', 'anticorrelations', 'between', 'second', 'and', 'third', 'order', 'eccentricities', 'are', 'sufficient', 'to', 'describe', 'the', 'measured', 'correlations', 'between', 'v_2', 'and', 'v_3', 'the', 'best', 'description', 'of', 'v_2v_4', 'correlations', 'at', 'sqrts_nn', '200', 'gev', 'is', 'obtained', 'with', 'inclusion', 'of', 'the', 'systems', 'nonlinear', 'response', 'to', 'initial', 'eccentricities', 'accompanied', 'by', 'the', 'viscous', 'effect', 'with', 'etas', '008', 'theoretical', 'calculations', 'using', 'different', 'initial', 'conditions', 'equations', 'of', 'state', 'and', 'viscous', 'coefficients', 'need', 'to', 'be', 'further', 'explored', 'to', 'extract', 'etas', 'of', 'the', 'medium', 'created', 'at', 'rhic']]
|
[-0.08923732484975051, 0.2316987514189781, -0.17572069725572642, 0.11963668827758883, 0.027858201860332152, -0.0805206424840879, -0.13236619265828753, 0.37077033102753937, -0.22765501900335572, -0.3354740624836353, -0.05550717191602335, -0.40293333907458634, 0.08712277933080712, 0.1617044838153027, 0.0856430183381756, 0.10139079787221873, 0.10192328029718827, -0.0008233522071542454, -0.0608905893258593, -0.20502250333766983, 0.2742857450833588, 0.10259094342705247, 0.22628818068023718, 0.14154072834764708, 0.03940693263736217, 0.007906250591158097, -0.0020636328673121376, 0.018053799819533534, -0.19287238251150748, 0.05866752063638002, 0.2920073983977701, -0.0018685648497631293, 0.15220426982640345, -0.36360699972881116, -0.12543852994996757, 0.12259839913270003, 0.10692057329855265, 0.06378546213739915, -0.0317722733303065, -0.25164689512774696, 0.10611816283199005, -0.2324201660739048, -0.1257097362365766, -0.04091184353237281, 0.023259794601882006, 0.06258885687907957, -0.3155826411271214, 0.214282267320324, -0.01039167607428305, 0.11762122814775146, -0.03868075903776176, -0.15401520558628537, -0.08952368659671274, 0.02963058720342815, 0.062029943506325215, 0.06662848182110019, 0.13472140754656123, -0.09996673603216405, -0.12463036557701045, 0.40133318827080894, -0.021912565375932388, -0.1098397544032059, 0.20166756563105057, -0.271713041046748, -0.12065395369837192, 0.14193301022428792, 0.25953103634233676, 0.07100803316122646, -0.19606458086262463, -0.06274573355771058, 0.010914678401160689, 0.20463116995513683, 0.13068574147207113, 0.04128833706578144, 0.1747456688342065, 0.0987621996045646, -0.0019436909903514203, 0.11604462737740048, -0.1021931422905929, -0.06720721913816434, -0.3508436531047096, -0.01855049643254546, -0.15092430341969126, 0.010557803833647303, -0.13294109928997194, 0.006921669756862479, 0.3810980113599222, 0.16259786048947786, 0.27278887988338707, -0.012135319334144393, 0.2543150968062626, 0.10257076829624856, 0.040540595390798934, 0.12379687860337012, 0.32060750694551937, 0.17314347609147396, 0.23690930634579607, -0.23225030696422339, 0.05899393170123194, 0.05547470274761739]
|
1,803.03877
|
On dynamic ensemble selection and data preprocessing for multi-class
imbalance learning
|
Class-imbalance refers to classification problems in which many more
instances are available for certain classes than for others. Such imbalanced
datasets require special attention because traditional classifiers generally
favor the majority class which has a large number of instances. Ensemble of
classifiers have been reported to yield promising results. However, the
majority of ensemble methods applied too imbalanced learning are static ones.
Moreover, they only deal with binary imbalanced problems. Hence, this paper
presents an empirical analysis of dynamic selection techniques and data
preprocessing methods for dealing with multi-class imbalanced problems. We
considered five variations of preprocessing methods and four dynamic selection
methods. Our experiments conducted on 26 multi-class imbalanced problems show
that the dynamic ensemble improves the F-measure and the G-mean as compared to
the static ensemble. Moreover, data preprocessing plays an important role in
such cases.
|
stat.ML cs.LG
|
classimbalance refers to classification problems in which many more instances are available for certain classes than for others such imbalanced datasets require special attention because traditional classifiers generally favor the majority class which has a large number of instances ensemble of classifiers have been reported to yield promising results however the majority of ensemble methods applied too imbalanced learning are static ones moreover they only deal with binary imbalanced problems hence this paper presents an empirical analysis of dynamic selection techniques and data preprocessing methods for dealing with multiclass imbalanced problems we considered five variations of preprocessing methods and four dynamic selection methods our experiments conducted on 26 multiclass imbalanced problems show that the dynamic ensemble improves the fmeasure and the gmean as compared to the static ensemble moreover data preprocessing plays an important role in such cases
|
[['classimbalance', 'refers', 'to', 'classification', 'problems', 'in', 'which', 'many', 'more', 'instances', 'are', 'available', 'for', 'certain', 'classes', 'than', 'for', 'others', 'such', 'imbalanced', 'datasets', 'require', 'special', 'attention', 'because', 'traditional', 'classifiers', 'generally', 'favor', 'the', 'majority', 'class', 'which', 'has', 'a', 'large', 'number', 'of', 'instances', 'ensemble', 'of', 'classifiers', 'have', 'been', 'reported', 'to', 'yield', 'promising', 'results', 'however', 'the', 'majority', 'of', 'ensemble', 'methods', 'applied', 'too', 'imbalanced', 'learning', 'are', 'static', 'ones', 'moreover', 'they', 'only', 'deal', 'with', 'binary', 'imbalanced', 'problems', 'hence', 'this', 'paper', 'presents', 'an', 'empirical', 'analysis', 'of', 'dynamic', 'selection', 'techniques', 'and', 'data', 'preprocessing', 'methods', 'for', 'dealing', 'with', 'multiclass', 'imbalanced', 'problems', 'we', 'considered', 'five', 'variations', 'of', 'preprocessing', 'methods', 'and', 'four', 'dynamic', 'selection', 'methods', 'our', 'experiments', 'conducted', 'on', '26', 'multiclass', 'imbalanced', 'problems', 'show', 'that', 'the', 'dynamic', 'ensemble', 'improves', 'the', 'fmeasure', 'and', 'the', 'gmean', 'as', 'compared', 'to', 'the', 'static', 'ensemble', 'moreover', 'data', 'preprocessing', 'plays', 'an', 'important', 'role', 'in', 'such', 'cases']]
|
[-0.04545704754106565, 0.026718817454082822, -0.018030365689428174, 0.12236518410508575, -0.07559817597485971, -0.2037383216176776, 0.04100618808466158, 0.4257060452161924, -0.1961483891641694, -0.3640663380653638, 0.12369401806263604, -0.2876208581560143, -0.1508289887772306, 0.2638464483189518, -0.11348850391400249, 0.1227689845001568, 0.1905140220761245, 0.03328801678709578, -0.07951562173759052, -0.3526602886698168, 0.33416051776620787, 0.030914393794365173, 0.38819437414623686, -0.018547686687468187, 0.06446640360324334, 0.00533640611430873, -0.07268211650965817, 0.09068019149844327, -0.0076623107123705795, 0.1369060849757406, 0.3582585640926508, 0.1565496451103304, 0.3390943044121715, -0.34287353792646225, -0.2611271940387677, 0.16674826575816015, 0.16101579115712555, 0.13866205746234156, -0.04557528286006899, -0.2674501073399923, 0.061569184544023825, -0.15817256054910156, -0.019232626005575276, -0.16702322095996983, 0.003364935426203453, 0.024547116361065782, -0.2950919008732814, 0.08757807778201296, 0.08826264701581196, 0.07101713014307662, -0.08532349491640386, -0.21504627238702623, 0.09685558687551352, 0.12320956556747358, 0.07521053015564878, 0.010556018300543445, 0.099350267747903, -0.1776519182080781, -0.17006776371862795, 0.40472968976836704, 0.005535251578544705, -0.2059991387945627, 0.2730689118143873, 0.026417450341598495, -0.22512107706912185, 0.112323091757666, 0.22575964060682885, 0.15860058474556907, -0.11266338605892615, -0.00015989456290338674, -0.06192054375466229, 0.16634757147319074, 0.04874671333422209, -0.007720802752031148, 0.13359358032787408, 0.2204640029720368, 0.04855541517473825, 0.16545587322721933, -0.12113665691003257, -0.1081912155377854, -0.16071916540301795, -0.03902629302288203, -0.14667893091783576, -0.039885745133253055, -0.10674386337853756, -0.1993988143352697, 0.3190096651635848, 0.20889405793159443, 0.20829088615752972, 0.04558808487406392, 0.2976518209645714, 0.04962645225105402, 0.10596134258515161, 0.09292236631196263, 0.19885556241480526, 0.04309169132181484, 0.12133383465697989, -0.17177089803896006, 0.0818111188304813, 0.008434790567886354]
|
1,803.03878
|
Identification of SM-OFDM and AL-OFDM Signals Based on Their
Second-Order Cyclostationarity
|
Automatic signal identification (ASI) has important applications to both
commercial and military communications, such as software defined radio,
cognitive radio, spectrum surveillance and monitoring, and electronic warfare.
While ASI has been intensively studied for single-input single-output systems,
only a few investigations have been recently presented for multiple-input
multiple-output systems. This paper introduces a novel algorithm for the
identification of spatial multiplexing (SM) and Alamouti coded (AL) orthogonal
frequency division multiplexing (OFDM) signals, which relies on the
second-order signal cyclostationarity. Analytical expressions for the
second-order cyclic statistics of SM-OFDM and AL-OFDM signals are derived and
further exploited for the algorithm development. The proposed algorithm
provides a good identification performance with low sensitivity to impairments
in the received signal, such as phase noise, timing offset, and channel
conditions.
|
eess.SP
|
automatic signal identification asi has important applications to both commercial and military communications such as software defined radio cognitive radio spectrum surveillance and monitoring and electronic warfare while asi has been intensively studied for singleinput singleoutput systems only a few investigations have been recently presented for multipleinput multipleoutput systems this paper introduces a novel algorithm for the identification of spatial multiplexing sm and alamouti coded al orthogonal frequency division multiplexing ofdm signals which relies on the secondorder signal cyclostationarity analytical expressions for the secondorder cyclic statistics of smofdm and alofdm signals are derived and further exploited for the algorithm development the proposed algorithm provides a good identification performance with low sensitivity to impairments in the received signal such as phase noise timing offset and channel conditions
|
[['automatic', 'signal', 'identification', 'asi', 'has', 'important', 'applications', 'to', 'both', 'commercial', 'and', 'military', 'communications', 'such', 'as', 'software', 'defined', 'radio', 'cognitive', 'radio', 'spectrum', 'surveillance', 'and', 'monitoring', 'and', 'electronic', 'warfare', 'while', 'asi', 'has', 'been', 'intensively', 'studied', 'for', 'singleinput', 'singleoutput', 'systems', 'only', 'a', 'few', 'investigations', 'have', 'been', 'recently', 'presented', 'for', 'multipleinput', 'multipleoutput', 'systems', 'this', 'paper', 'introduces', 'a', 'novel', 'algorithm', 'for', 'the', 'identification', 'of', 'spatial', 'multiplexing', 'sm', 'and', 'alamouti', 'coded', 'al', 'orthogonal', 'frequency', 'division', 'multiplexing', 'ofdm', 'signals', 'which', 'relies', 'on', 'the', 'secondorder', 'signal', 'cyclostationarity', 'analytical', 'expressions', 'for', 'the', 'secondorder', 'cyclic', 'statistics', 'of', 'smofdm', 'and', 'alofdm', 'signals', 'are', 'derived', 'and', 'further', 'exploited', 'for', 'the', 'algorithm', 'development', 'the', 'proposed', 'algorithm', 'provides', 'a', 'good', 'identification', 'performance', 'with', 'low', 'sensitivity', 'to', 'impairments', 'in', 'the', 'received', 'signal', 'such', 'as', 'phase', 'noise', 'timing', 'offset', 'and', 'channel', 'conditions']]
|
[-0.23566681187930366, 0.017163731664749642, -0.028856556794996702, -0.018172129865683194, -0.0987417115942545, -0.2401382081818977, 0.007074315522444404, 0.41721756895253015, -0.19357885688077658, -0.27822387454310255, 0.15910069592909196, -0.21802603819167182, -0.2316220290132708, 0.22947431668909568, -0.1057099423356234, 0.13187912326811196, 0.009790134595541825, -0.006309066185607544, -0.040332540770196504, -0.19843187257497302, 0.17750376040461444, 0.13790207294627063, 0.40840417441100846, 0.0006211405815256219, 0.11970971880157688, 0.05695248358026748, -0.0775487755027209, -0.09265052135789677, -0.06160981863767149, 0.04872336477488246, 0.3986603374172363, 0.2094988438156208, 0.26367565118257075, -0.3539658628869802, -0.30872468850124746, 0.11899081316791595, 0.20345863009448117, 0.06113687690418784, -0.13289003737830377, -0.3353715613409276, 0.1187789844510506, -0.2530708996759307, -0.01343924339650379, -0.016409983400315527, -0.025241784169338644, 0.03355769507705249, -0.3182477777853848, 0.029713910255175564, 0.028627983519747373, 0.13507143003986247, -0.03479611077871654, -0.14924253695719544, 0.0647983931844318, 0.14549366886832663, -0.011377416748268109, -0.033693364258074475, 0.09318230609830108, -0.05096650640517773, -0.1570444188621496, 0.37920617719083244, -0.013048408594312928, -0.19988459729469352, 0.19505167337774765, -0.09009635900034599, -0.1512893095917412, 0.16165845706728438, 0.2696277208836569, 0.02473198647250331, -0.21284316235969233, 0.05610917331984139, 0.06390946919489052, 0.19888898148952472, 0.1001061457885249, 0.1823423246124519, 0.16283454761404784, 0.19785890497657802, 0.0969115718448114, 0.09545623297021995, -0.15620889936033036, -0.0692644042714927, -0.12435094387957736, -0.1116319987021627, -0.18133716491772042, -0.024422261954074907, -0.050509992982340685, -0.11082417064256245, 0.4058604166888061, 0.1260236395568016, 0.027688323542655956, 0.04580356144335031, 0.42855406396331325, 0.10645713528896111, 0.06312225671717897, 0.05803335937220724, 0.2348096027046502, 0.15862889253654547, 0.17768096386627744, -0.1986902370943778, 0.058097571160854594, -0.030269851018073817]
|
1,803.03879
|
Knowledge Aided Consistency for Weakly Supervised Phrase Grounding
|
Given a natural language query, a phrase grounding system aims to localize
mentioned objects in an image. In weakly supervised scenario, mapping between
image regions (i.e., proposals) and language is not available in the training
set. Previous methods address this deficiency by training a grounding system
via learning to reconstruct language information contained in input queries
from predicted proposals. However, the optimization is solely guided by the
reconstruction loss from the language modality, and ignores rich visual
information contained in proposals and useful cues from external knowledge. In
this paper, we explore the consistency contained in both visual and language
modalities, and leverage complementary external knowledge to facilitate weakly
supervised grounding. We propose a novel Knowledge Aided Consistency Network
(KAC Net) which is optimized by reconstructing input query and proposal's
information. To leverage complementary knowledge contained in the visual
features, we introduce a Knowledge Based Pooling (KBP) gate to focus on
query-related proposals. Experiments show that KAC Net provides a significant
improvement on two popular datasets.
|
cs.CV
|
given a natural language query a phrase grounding system aims to localize mentioned objects in an image in weakly supervised scenario mapping between image regions ie proposals and language is not available in the training set previous methods address this deficiency by training a grounding system via learning to reconstruct language information contained in input queries from predicted proposals however the optimization is solely guided by the reconstruction loss from the language modality and ignores rich visual information contained in proposals and useful cues from external knowledge in this paper we explore the consistency contained in both visual and language modalities and leverage complementary external knowledge to facilitate weakly supervised grounding we propose a novel knowledge aided consistency network kac net which is optimized by reconstructing input query and proposals information to leverage complementary knowledge contained in the visual features we introduce a knowledge based pooling kbp gate to focus on queryrelated proposals experiments show that kac net provides a significant improvement on two popular datasets
|
[['given', 'a', 'natural', 'language', 'query', 'a', 'phrase', 'grounding', 'system', 'aims', 'to', 'localize', 'mentioned', 'objects', 'in', 'an', 'image', 'in', 'weakly', 'supervised', 'scenario', 'mapping', 'between', 'image', 'regions', 'ie', 'proposals', 'and', 'language', 'is', 'not', 'available', 'in', 'the', 'training', 'set', 'previous', 'methods', 'address', 'this', 'deficiency', 'by', 'training', 'a', 'grounding', 'system', 'via', 'learning', 'to', 'reconstruct', 'language', 'information', 'contained', 'in', 'input', 'queries', 'from', 'predicted', 'proposals', 'however', 'the', 'optimization', 'is', 'solely', 'guided', 'by', 'the', 'reconstruction', 'loss', 'from', 'the', 'language', 'modality', 'and', 'ignores', 'rich', 'visual', 'information', 'contained', 'in', 'proposals', 'and', 'useful', 'cues', 'from', 'external', 'knowledge', 'in', 'this', 'paper', 'we', 'explore', 'the', 'consistency', 'contained', 'in', 'both', 'visual', 'and', 'language', 'modalities', 'and', 'leverage', 'complementary', 'external', 'knowledge', 'to', 'facilitate', 'weakly', 'supervised', 'grounding', 'we', 'propose', 'a', 'novel', 'knowledge', 'aided', 'consistency', 'network', 'kac', 'net', 'which', 'is', 'optimized', 'by', 'reconstructing', 'input', 'query', 'and', 'proposals', 'information', 'to', 'leverage', 'complementary', 'knowledge', 'contained', 'in', 'the', 'visual', 'features', 'we', 'introduce', 'a', 'knowledge', 'based', 'pooling', 'kbp', 'gate', 'to', 'focus', 'on', 'queryrelated', 'proposals', 'experiments', 'show', 'that', 'kac', 'net', 'provides', 'a', 'significant', 'improvement', 'on', 'two', 'popular', 'datasets']]
|
[-0.035423975391593955, -0.014058959201109422, -0.03613673665010965, 0.08729659237250888, -0.1781115573522332, -0.18636675176760517, 0.06627115705513384, 0.43856764208884486, -0.2884532187739948, -0.3317197066821517, 0.01339822057185762, -0.2860272065904665, -0.15833234578281283, 0.12703299534181695, -0.1883119344928706, 0.05533882191580726, 0.1372555573106216, 0.10013215640189507, -0.06742914599164512, -0.2472967850551057, 0.3220978600354529, 0.024145932675967645, 0.3404520351765116, 0.01858768397829978, 0.14985846627380206, -0.0008093748881245952, -0.09751843964451004, -0.032479670541837855, -0.08959843246821148, 0.2161925543928575, 0.36390946174870775, 0.2730748730105718, 0.31405078559687516, -0.42416304050305165, -0.22517383134508706, 0.05277295583993735, 0.14707892236625214, 0.11540355659743942, -0.054969925890643014, -0.3655537278335317, 0.04917372404583674, -0.13239603183310794, 0.09969436659348613, -0.12362919186791742, -0.008023834150531385, -0.05783520405340648, -0.29363249441965045, 0.0022411318243402674, 0.14871925545866174, 0.10234333701145622, -0.051838106200862, -0.04445985091025436, 0.03867339762629021, 0.168798999656104, -0.016462840989837985, 0.10746843353298167, 0.15297219341800336, -0.20220528193749487, -0.1695359133419592, 0.3508810382111963, -0.07501532435866005, -0.24164404808291157, 0.21241119894036373, -0.05160049980517522, -0.13881769993746407, 0.08220360393100137, 0.19303085041058485, 0.09720447906068559, -0.20505038015432206, 0.06717861902476456, -0.03709145581506821, 0.22917172679094128, 0.08321684373806354, 0.02233461412974263, 0.2523533779951037, 0.24261946547832564, -0.005335156741293977, 0.16291205308060666, -0.07968557907930429, -0.0288758347738753, -0.23697215555297457, -0.09856795233461153, -0.22686792132220265, -0.07048567719271909, -0.057382625123206805, -0.1187259401755789, 0.3767183061958437, 0.2733364119138344, 0.23233563881311342, 0.06199004691366263, 0.36677083042338043, -0.01514522961952025, 0.12619791263349758, 0.08590811355802488, 0.12928818586473184, 0.006456852328110801, 0.12190750336445622, -0.13997580296309464, 0.11523166431551687, 0.08135891192401927]
|
1,803.0388
|
Combating Adversarial Attacks Using Sparse Representations
|
It is by now well-known that small adversarial perturbations can induce
classification errors in deep neural networks (DNNs). In this paper, we make
the case that sparse representations of the input data are a crucial tool for
combating such attacks. For linear classifiers, we show that a sparsifying
front end is provably effective against $\ell_{\infty}$-bounded attacks,
reducing output distortion due to the attack by a factor of roughly $K / N$
where $N$ is the data dimension and $K$ is the sparsity level. We then extend
this concept to DNNs, showing that a "locally linear" model can be used to
develop a theoretical foundation for crafting attacks and defenses.
Experimental results for the MNIST dataset show the efficacy of the proposed
sparsifying front end.
|
stat.ML cs.IT cs.LG math.IT
|
it is by now wellknown that small adversarial perturbations can induce classification errors in deep neural networks dnns in this paper we make the case that sparse representations of the input data are a crucial tool for combating such attacks for linear classifiers we show that a sparsifying front end is provably effective against ell_inftybounded attacks reducing output distortion due to the attack by a factor of roughly k n where n is the data dimension and k is the sparsity level we then extend this concept to dnns showing that a locally linear model can be used to develop a theoretical foundation for crafting attacks and defenses experimental results for the mnist dataset show the efficacy of the proposed sparsifying front end
|
[['it', 'is', 'by', 'now', 'wellknown', 'that', 'small', 'adversarial', 'perturbations', 'can', 'induce', 'classification', 'errors', 'in', 'deep', 'neural', 'networks', 'dnns', 'in', 'this', 'paper', 'we', 'make', 'the', 'case', 'that', 'sparse', 'representations', 'of', 'the', 'input', 'data', 'are', 'a', 'crucial', 'tool', 'for', 'combating', 'such', 'attacks', 'for', 'linear', 'classifiers', 'we', 'show', 'that', 'a', 'sparsifying', 'front', 'end', 'is', 'provably', 'effective', 'against', 'ell_inftybounded', 'attacks', 'reducing', 'output', 'distortion', 'due', 'to', 'the', 'attack', 'by', 'a', 'factor', 'of', 'roughly', 'k', 'n', 'where', 'n', 'is', 'the', 'data', 'dimension', 'and', 'k', 'is', 'the', 'sparsity', 'level', 'we', 'then', 'extend', 'this', 'concept', 'to', 'dnns', 'showing', 'that', 'a', 'locally', 'linear', 'model', 'can', 'be', 'used', 'to', 'develop', 'a', 'theoretical', 'foundation', 'for', 'crafting', 'attacks', 'and', 'defenses', 'experimental', 'results', 'for', 'the', 'mnist', 'dataset', 'show', 'the', 'efficacy', 'of', 'the', 'proposed', 'sparsifying', 'front', 'end']]
|
[-0.10023071316498347, 0.051267015782078026, -0.07273038608006767, 0.07828289805720637, -0.07961454855461346, -0.19154168293643437, 0.04781731188423229, 0.39053164175558897, -0.28170157160579423, -0.269675275089494, 0.10481521234366677, -0.27196914185464505, -0.25678731902258195, 0.19574971056779938, -0.1312425290043542, 0.11953070067770047, 0.08329335717698101, 0.03277033353491579, -0.027795929198351797, -0.33900025523206617, 0.3269270434288583, 0.07172581224228049, 0.30916966714697786, 0.027846213540856223, 0.07007248349274035, -0.04786186000774996, 0.01598369532844937, 0.017147362707411778, -0.04134674389659595, 0.12462867625233275, 0.34322037507021763, 0.19800392196887767, 0.34471202618633323, -0.39828693030066176, -0.22139987768414507, 0.1066293004426922, 0.11938360513027635, 0.17599702473790918, -0.04693538672672432, -0.3185944663127884, 0.1820706230718032, -0.1654122899282632, -0.06209892071936218, -0.15943803949773952, 0.005594877986099998, -0.026041068716860207, -0.3174223390023308, 0.0026942015018172898, 0.1182760414285738, 0.026965021865717212, -0.011372765766639934, -0.10131247641640853, 0.02988551210489918, 0.10515309736174608, 0.03891184799216657, 0.041278119028410415, 0.13810495125725256, -0.14166167355524223, -0.11151194775125897, 0.3319210639857061, -0.08006169669879754, -0.1948191071173451, 0.14729243928001676, -0.013517973257503549, -0.1332460374830932, 0.09798370526538643, 0.26191130910282495, 0.0984413599648864, -0.11363930345253377, 0.056295792731555695, -0.05428090978597031, 0.20714509764545003, 0.05703961059496906, -0.015905289006129395, 0.11099112617065672, 0.21894888266478282, 0.09228395992798395, 0.17686318482423094, -0.11902514051767181, -0.0082265431448802, -0.2552132120720477, -0.08112733376204784, -0.18712181199845843, 0.01564673282629257, -0.08616061403285369, -0.12054271198671739, 0.3798404422466506, 0.21610750348811023, 0.23844623023292935, 0.14017427969937685, 0.3741653713657231, 0.03867136978651168, 0.09257533811185448, 0.14596630987848658, 0.2049029457123309, 0.07925039937063197, 0.03708197394782891, -0.14925430408587342, 0.10972510195398306, 0.03587496564456369]
|
1,803.03881
|
The linear stability of the Schwarzschild spacetime in the harmonic
gauge: odd part
|
In this paper, we study the odd solution of the linearlized Einstein equation
on the Schwarzschild background and in the harmonic gauge. With the aid of
Regge-Wheeler quantities, we are able to estimate the odd part of Lichnerowicz
d'Alembertian equation. In particular, we prove the solution decays at rate
$\tau^{-1+\delta}$ to a linearlized Kerr solution.
|
math.DG math.AP
|
in this paper we study the odd solution of the linearlized einstein equation on the schwarzschild background and in the harmonic gauge with the aid of reggewheeler quantities we are able to estimate the odd part of lichnerowicz dalembertian equation in particular we prove the solution decays at rate tau1delta to a linearlized kerr solution
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'odd', 'solution', 'of', 'the', 'linearlized', 'einstein', 'equation', 'on', 'the', 'schwarzschild', 'background', 'and', 'in', 'the', 'harmonic', 'gauge', 'with', 'the', 'aid', 'of', 'reggewheeler', 'quantities', 'we', 'are', 'able', 'to', 'estimate', 'the', 'odd', 'part', 'of', 'lichnerowicz', 'dalembertian', 'equation', 'in', 'particular', 'we', 'prove', 'the', 'solution', 'decays', 'at', 'rate', 'tau1delta', 'to', 'a', 'linearlized', 'kerr', 'solution']]
|
[-0.16487692369936177, 0.033804340252222925, -0.08903939836622718, 0.09223916187049606, -0.09843944077594922, -0.09301899447858047, -0.047116361742015354, 0.27917199635591644, -0.20609096838877752, -0.23721206492672747, 0.08947944608203565, -0.35194232837798506, -0.14664496538842706, 0.1438829955071784, -0.04093587821206221, 0.07522018388128625, 0.030010274027098112, 0.10471391437861782, -0.07084750573938856, -0.25042823271808, 0.396780656865583, 0.027122680044088226, 0.19022191487825835, 0.03974952305165621, 0.11710330451695392, -0.02608790014906285, 0.0024613430365346945, -0.01214859656129892, -0.1912305774883582, 0.06618130561680748, 0.20083333512481588, 0.0719207091662191, 0.22622015735564324, -0.4050643803874174, -0.1502819627774163, 0.12415939551563217, 0.16206131730891335, 0.1643107853238829, -0.0489524587644085, -0.30735634804631656, 0.08734163937445444, -0.14068724837404892, -0.22467666441046347, -0.050282499533540644, 0.010373086417810274, -0.0056624741409905255, -0.2681759942385655, 0.10856187101811744, 0.05997441289946437, -0.036674041856223576, -0.17441801369512597, -0.03929674894047471, 0.015366953466302501, 0.05452774222402905, 0.14133334783120796, 0.02713903782513136, 0.04743090806564746, -0.12603869394381315, -0.0493179581557902, 0.37104331157528436, -0.17021054208565217, -0.31378774574169743, 0.08268567088704842, -0.2236552961045303, -0.11132905576736309, 0.07431885773817506, 0.18792775278248322, 0.20608369794745857, -0.138622811028304, 0.1552033649540345, -0.006717863170286784, 0.13820505000722522, 0.13885563895858538, 0.015237694239028944, 0.18277583916026813, 0.07510288116575864, 0.06636540016804177, 0.17925392164705464, -0.02394381783848915, -0.055619374490701236, -0.38577323277982384, -0.20813103494359753, -0.1554289233082762, 0.11851434946919863, -0.12213320885040538, -0.14202755596488714, 0.385597698820325, 0.14377526317436534, 0.1218743569110162, 0.05497305523245954, 0.2653104015267812, 0.18193025079269248, -0.004419400858191343, 0.09443839163241836, 0.2974784816794384, 0.16759295081451106, 0.15892907820391253, -0.2707759292724614, -0.09867130390977344, 0.18516923141522476]
|
1,803.03882
|
An Iterative Global Structure-Assisted Labeled Network Aligner
|
Integrating data from heterogeneous sources is often modeled as merging
graphs. Given two or more 'compatible', but not-isomorphic graphs, the first
step is to identify a graph alignment, where a potentially partial mapping of
vertices between two graphs is computed. A significant portion of the
literature on this problem only takes the global structure of the input graphs
into account. Only more recent ones additionally use vertex and edge attributes
to achieve a more accurate alignment. However, these methods are not designed
to scale to map large graphs arising in many modern applications. We propose a
new iterative graph aligner, gsaNA, that uses the global structure of the
graphs to significantly reduce the problem size and align large graphs with a
minimal loss of information. Concretely, we show that our proposed technique is
highly flexible, can be used to achieve higher recall, and it is orders of
magnitudes faster than the current state of the art techniques.
|
cs.SI
|
integrating data from heterogeneous sources is often modeled as merging graphs given two or more compatible but notisomorphic graphs the first step is to identify a graph alignment where a potentially partial mapping of vertices between two graphs is computed a significant portion of the literature on this problem only takes the global structure of the input graphs into account only more recent ones additionally use vertex and edge attributes to achieve a more accurate alignment however these methods are not designed to scale to map large graphs arising in many modern applications we propose a new iterative graph aligner gsana that uses the global structure of the graphs to significantly reduce the problem size and align large graphs with a minimal loss of information concretely we show that our proposed technique is highly flexible can be used to achieve higher recall and it is orders of magnitudes faster than the current state of the art techniques
|
[['integrating', 'data', 'from', 'heterogeneous', 'sources', 'is', 'often', 'modeled', 'as', 'merging', 'graphs', 'given', 'two', 'or', 'more', 'compatible', 'but', 'notisomorphic', 'graphs', 'the', 'first', 'step', 'is', 'to', 'identify', 'a', 'graph', 'alignment', 'where', 'a', 'potentially', 'partial', 'mapping', 'of', 'vertices', 'between', 'two', 'graphs', 'is', 'computed', 'a', 'significant', 'portion', 'of', 'the', 'literature', 'on', 'this', 'problem', 'only', 'takes', 'the', 'global', 'structure', 'of', 'the', 'input', 'graphs', 'into', 'account', 'only', 'more', 'recent', 'ones', 'additionally', 'use', 'vertex', 'and', 'edge', 'attributes', 'to', 'achieve', 'a', 'more', 'accurate', 'alignment', 'however', 'these', 'methods', 'are', 'not', 'designed', 'to', 'scale', 'to', 'map', 'large', 'graphs', 'arising', 'in', 'many', 'modern', 'applications', 'we', 'propose', 'a', 'new', 'iterative', 'graph', 'aligner', 'gsana', 'that', 'uses', 'the', 'global', 'structure', 'of', 'the', 'graphs', 'to', 'significantly', 'reduce', 'the', 'problem', 'size', 'and', 'align', 'large', 'graphs', 'with', 'a', 'minimal', 'loss', 'of', 'information', 'concretely', 'we', 'show', 'that', 'our', 'proposed', 'technique', 'is', 'highly', 'flexible', 'can', 'be', 'used', 'to', 'achieve', 'higher', 'recall', 'and', 'it', 'is', 'orders', 'of', 'magnitudes', 'faster', 'than', 'the', 'current', 'state', 'of', 'the', 'art', 'techniques']]
|
[-0.09930866753697515, 0.04874321611057366, -0.05434758733477323, 0.0777720526792109, -0.13701887601505844, -0.12277770675268145, 0.01947486881136654, 0.4183681869068213, -0.2878053546988315, -0.3489440866896222, 0.11966258110778948, -0.2749376383940539, -0.1482798252374895, 0.18738577150919986, -0.08461950666631662, 0.03386562105508581, 0.12616980406005054, 0.039073532555372485, -0.056626561518398025, -0.2520420739956711, 0.3071333573395086, 0.020877296056958938, 0.2713598368509162, 0.032265790855331766, 0.11358246370950985, -0.013653569235917061, -0.041856413460787265, 0.08046404315579322, -0.07794740840599257, 0.17499269748617324, 0.2623693585395813, 0.14973118932497118, 0.2582791241564161, -0.4414695073640154, -0.21988850251561212, 0.15084608247683895, 0.12735052618588652, 0.14298624826234677, -0.0025799772077833394, -0.2499729827301757, 0.1319878313960808, -0.14030603179407697, -0.029649880768791322, -0.08290731807449653, 0.004386961700454835, -0.019113713819082948, -0.2815081581570989, 0.02222488398453401, 0.0699551644629889, -0.0009378639425361349, 0.017951853448645243, -0.12874067487014879, -0.022342116468315645, 0.16452743157353852, -0.022019404061739484, 0.06749688652118728, 0.08999119600912016, -0.16137061461415741, -0.15250308236047144, 0.3935655503143226, -0.024925078533218063, -0.1948964265776017, 0.18446267632046534, -0.09766261838376522, -0.15622642319949884, 0.14482888334520883, 0.19537374668063656, 0.1531467725823243, -0.14939352963795705, 0.015169442350780892, -0.017321459412755025, 0.2041444661891869, 0.04965052687292618, 0.020401528177242126, 0.14049758090066813, 0.19584622037627042, 0.14396477510792113, 0.1540211422751928, -0.05389610189914463, -0.07470963051422469, -0.21295753917506627, -0.09792745484765844, -0.1886561604096524, 0.0009450335522189796, -0.12957401495762996, -0.1771852100827551, 0.4126918567765144, 0.18460544746429208, 0.23713595923336764, 0.0726630883171193, 0.3213872037227115, 0.06807673534889135, 0.1267690535995268, 0.11516907220826514, 0.18342333852403586, 0.08758409646670184, 0.0543260729451093, -0.1374895707591467, 0.08541578774625856, 0.04385408368355955]
|
1,803.03883
|
Deformation of product of complex Fano manifolds
|
Let X be a connected family of complex Fano manifolds. We show that if some
fiber is the product of two manifolds of lower dimensions, then so is every
fiber. Combining with previous work of Hwang and Mok, this implies immediately
that if a fiber is (possibly reducible) Hermitian symmetric space of compact
type, then all fibers are isomorphic to the same variety.
|
math.AG
|
let x be a connected family of complex fano manifolds we show that if some fiber is the product of two manifolds of lower dimensions then so is every fiber combining with previous work of hwang and mok this implies immediately that if a fiber is possibly reducible hermitian symmetric space of compact type then all fibers are isomorphic to the same variety
|
[['let', 'x', 'be', 'a', 'connected', 'family', 'of', 'complex', 'fano', 'manifolds', 'we', 'show', 'that', 'if', 'some', 'fiber', 'is', 'the', 'product', 'of', 'two', 'manifolds', 'of', 'lower', 'dimensions', 'then', 'so', 'is', 'every', 'fiber', 'combining', 'with', 'previous', 'work', 'of', 'hwang', 'and', 'mok', 'this', 'implies', 'immediately', 'that', 'if', 'a', 'fiber', 'is', 'possibly', 'reducible', 'hermitian', 'symmetric', 'space', 'of', 'compact', 'type', 'then', 'all', 'fibers', 'are', 'isomorphic', 'to', 'the', 'same', 'variety']]
|
[-0.17662017990554135, 0.13089724102367958, -0.07468573315926487, -0.0353605614167579, -0.1166383882407986, -0.20307269803292693, -0.05339303005131937, 0.4195399399004167, -0.2567546293065543, -0.13651113915774557, 0.14072562249318238, -0.2503699860609477, -0.2239472589913815, 0.237858765034212, -0.15201315183251624, -0.07507942288759209, 0.08086281943149747, 0.08231191487894171, -0.10302327415861544, -0.3210226119466362, 0.4634490405165014, -0.10609980912080832, 0.22372288827503484, 0.04676809606866704, 0.11018198086983627, -0.008899226636877136, 0.031003404778265763, 0.04283319576597211, -0.11733458121053113, 0.15457110459147583, 0.27371246757961454, 0.08711146184849361, 0.20581260830762663, -0.3193394166305624, -0.20768228349172407, 0.2455370514505794, 0.11940049250713652, 0.011673064000668034, 0.03403974704385277, -0.2473894384290491, 0.16870209154865098, -0.15547019846382595, -0.1788618355871193, -0.046384850945619366, 0.05032109566742465, 0.03407430295492449, -0.22969948178127644, -0.07349619995211325, 0.13178125697942006, 0.0255332374353967, -0.0021256227341909257, -0.06576964948030692, -0.09913390967994928, 0.06689436055926813, -0.05039959384261498, 0.07452868652485665, 0.0781974268713153, -0.013575060925047313, -0.07989052033406638, 0.3599748143894849, -0.08316707668737286, -0.218601516787968, 0.1304515931008768, -0.17009964594913143, -0.157868473428405, 0.20195739927317297, 0.0984496015700556, 0.15198048896023206, -0.05506223038075462, 0.14334065903122314, -0.1315724484711176, 0.1327218189225754, 0.12531925162063942, 0.02455027320141357, 0.10647707243287374, 0.11738832034761944, 0.12275192041009192, 0.08540178289718275, 0.010851742492781745, -0.004721918801170966, -0.33085148763798533, -0.2156286301564366, -0.16228454442702175, 0.20697798603583897, -0.10290050506938271, -0.12103517595974225, 0.355991289189588, -0.03686447163659429, 0.22232928103397762, 0.08886250488216146, 0.24776767933415988, 0.04398201683550955, 0.03785040557369708, 0.10415554647555664, 0.16937651863138722, 0.19965253347560527, -0.0684047591177717, -0.07550422646962697, -0.04113589763079607, 0.11177787009537929]
|
1,803.03884
|
Fibered varieties over curves with low slope and sharp bounds in
dimension three
|
In this paper, we first construct varieties of any dimension $n>2$ fibered
over curves with low slopes. These examples violate the conjectural slope
inequality of Barja and Stoppino [BS14b].
Led by their conjecture, we focus on finding the lowest possible slope when
$n=3$. Based on a characteristic $p > 0$ method, we prove that the sharp lower
bound of the slope of fibered $3$-folds over curves is $4/3$, and it occurs
only when the general fiber is a $(1, 2)$-surface. Otherwise, the sharp lower
bound is $2$. We also obtain a Cornalba-Harris-Xiao type slope inequality for
families of surfaces of general type over curves, and it is sharper than all
previously known results.
As an application of the slope bound, we deduce a sharp Noether-Severi type
inequality that $K_X^3 \ge 2\chi(X, \omega_X)$ for an irregular minimal
$3$-fold $X$ of general type not having a $(1,2)$-surface Albanese fibration.
It answers a question in [Zha15] and thus completes the full Severi type
inequality for irregular $3$-folds of general type.
|
math.AG
|
in this paper we first construct varieties of any dimension n2 fibered over curves with low slopes these examples violate the conjectural slope inequality of barja and stoppino bs14b led by their conjecture we focus on finding the lowest possible slope when n3 based on a characteristic p 0 method we prove that the sharp lower bound of the slope of fibered 3folds over curves is 43 and it occurs only when the general fiber is a 1 2surface otherwise the sharp lower bound is 2 we also obtain a cornalbaharrisxiao type slope inequality for families of surfaces of general type over curves and it is sharper than all previously known results as an application of the slope bound we deduce a sharp noetherseveri type inequality that k_x3 ge 2chix omega_x for an irregular minimal 3fold x of general type not having a 12surface albanese fibration it answers a question in zha15 and thus completes the full severi type inequality for irregular 3folds of general type
|
[['in', 'this', 'paper', 'we', 'first', 'construct', 'varieties', 'of', 'any', 'dimension', 'n2', 'fibered', 'over', 'curves', 'with', 'low', 'slopes', 'these', 'examples', 'violate', 'the', 'conjectural', 'slope', 'inequality', 'of', 'barja', 'and', 'stoppino', 'bs14b', 'led', 'by', 'their', 'conjecture', 'we', 'focus', 'on', 'finding', 'the', 'lowest', 'possible', 'slope', 'when', 'n3', 'based', 'on', 'a', 'characteristic', 'p', '0', 'method', 'we', 'prove', 'that', 'the', 'sharp', 'lower', 'bound', 'of', 'the', 'slope', 'of', 'fibered', '3folds', 'over', 'curves', 'is', '43', 'and', 'it', 'occurs', 'only', 'when', 'the', 'general', 'fiber', 'is', 'a', '1', '2surface', 'otherwise', 'the', 'sharp', 'lower', 'bound', 'is', '2', 'we', 'also', 'obtain', 'a', 'cornalbaharrisxiao', 'type', 'slope', 'inequality', 'for', 'families', 'of', 'surfaces', 'of', 'general', 'type', 'over', 'curves', 'and', 'it', 'is', 'sharper', 'than', 'all', 'previously', 'known', 'results', 'as', 'an', 'application', 'of', 'the', 'slope', 'bound', 'we', 'deduce', 'a', 'sharp', 'noetherseveri', 'type', 'inequality', 'that', 'k_x3', 'ge', '2chix', 'omega_x', 'for', 'an', 'irregular', 'minimal', '3fold', 'x', 'of', 'general', 'type', 'not', 'having', 'a', '12surface', 'albanese', 'fibration', 'it', 'answers', 'a', 'question', 'in', 'zha15', 'and', 'thus', 'completes', 'the', 'full', 'severi', 'type', 'inequality', 'for', 'irregular', '3folds', 'of', 'general', 'type']]
|
[-0.14366143610791168, 0.04741964188024384, -0.09560054845217639, 0.12041062386867549, -0.06669803984234778, -0.23560537686044314, 0.047325057487893826, 0.3051538651943816, -0.22380884675859655, -0.28680152817974863, 0.0856843227183786, -0.24801095878359797, -0.17646009589504427, 0.27967796313324533, -0.16158026892328695, -0.014742208146870887, -0.00462058887073079, 0.04231106163933873, -0.10609614936694936, -0.33777996491195644, 0.3871589398726165, -0.057005122424404975, 0.2462473831889249, 0.08025825540857308, 0.05554414121726961, -0.006000051359827601, 0.0390159268087397, -0.0354133906698077, -0.22850862026857813, 0.14899650062236688, 0.21976149438312217, 0.08150744307112628, 0.1775715613983712, -0.34488281646872276, -0.1740874289403195, 0.20579164875334469, 0.12589506071014037, 0.06588955079176047, -0.017626962180245, -0.18767479317754787, 0.09725945023819804, -0.11164835286795297, -0.24068763600545204, -0.016862209985887854, 0.07151597564009095, 0.0031898096115943395, -0.23113271768304444, 0.08458706889277377, 0.14192167777310377, 0.11212352862722187, -0.06698694224059347, -0.10721134358530852, -0.030880525886848476, 0.0364985633989263, 0.010386364054192536, 0.055342595382160124, 0.020066254379069608, -0.11757364025509348, -0.06873935039752638, 0.2843827797105805, -0.06252137304962035, -0.15740228694447744, 0.11979005228195035, -0.15968880396184026, -0.17503006023767773, 0.17360063024310382, 0.09361860251388038, 0.19427060832579932, -0.014834623723239609, 0.13931764818675985, -0.11122077643437861, 0.15134836013469868, 0.1306496919162056, 0.011920838875977217, 0.09022080129797354, 0.08747027805895081, 0.14051929111856054, 0.11077487472014255, -0.06489769101974631, 0.006706709178009381, -0.3804500205852326, -0.1962568482274992, -0.1368035458814669, 0.16722174186953973, -0.12480143005132335, -0.1272976857861914, 0.3479316690350947, -0.027310451428236078, 0.20978175842865082, 0.15230823020046613, 0.21578695112546473, 0.08793055591738706, 0.036994426029459015, 0.09556785161437104, 0.2012382217319741, 0.1606837169943764, 0.0033907052839713746, -0.10028312155397011, 0.03066247932535286, 0.14249755467329198]
|
1,803.03885
|
Parallel FPGA Router using Sub-Gradient method and Steiner tree
|
In the FPGA (Field Programmable Gate Arrays) design flow, one of the most
time-consuming step is the routing of nets. Therefore, there is a need to
accelerate it. In a recent paper by Hoo et. al., the authors have developed a
Linear Programming based framework that parallelizes this routing process to
achieve significant speedups (the algorithm is termed as ParaLaR). However,
this approach has certain weaknesses. Namely, the constraints violation by the
solution and a local minima that could be improved. We address these two issues
here.
In our paper, we use this framework and solve it using the Primal-Dual
sub-gradient method that better exploits the problem properties. We also
propose a better way to update the size of the step taken by this iterative
algorithm. We perform experiments on a set of standard benchmarks, where we
show that our algorithm outperforms the standard existing algorithms (VPR and
ParaLaR).
We achieve up to 22% improvement in the constraints violation and the
standard metric of the minimum channel width when compared with ParaLaR (which
is same as in VPR). We achieve about 20% savings in another standard metric of
the total wire length (when compared with VPR), which is the same as for
ParaLaR. Hence, our algorithm achieves minimum value for all the three
parameters. Also, the critical path delay for our algorithm is almost same as
compared to VPR and ParaLaR. We achieve relative speedups of 3 times when we
run a parallel version of our algorithm using 4 threads.
|
cs.DC math.OC
|
in the fpga field programmable gate arrays design flow one of the most timeconsuming step is the routing of nets therefore there is a need to accelerate it in a recent paper by hoo et al the authors have developed a linear programming based framework that parallelizes this routing process to achieve significant speedups the algorithm is termed as paralar however this approach has certain weaknesses namely the constraints violation by the solution and a local minima that could be improved we address these two issues here in our paper we use this framework and solve it using the primaldual subgradient method that better exploits the problem properties we also propose a better way to update the size of the step taken by this iterative algorithm we perform experiments on a set of standard benchmarks where we show that our algorithm outperforms the standard existing algorithms vpr and paralar we achieve up to 22 improvement in the constraints violation and the standard metric of the minimum channel width when compared with paralar which is same as in vpr we achieve about 20 savings in another standard metric of the total wire length when compared with vpr which is the same as for paralar hence our algorithm achieves minimum value for all the three parameters also the critical path delay for our algorithm is almost same as compared to vpr and paralar we achieve relative speedups of 3 times when we run a parallel version of our algorithm using 4 threads
|
[['in', 'the', 'fpga', 'field', 'programmable', 'gate', 'arrays', 'design', 'flow', 'one', 'of', 'the', 'most', 'timeconsuming', 'step', 'is', 'the', 'routing', 'of', 'nets', 'therefore', 'there', 'is', 'a', 'need', 'to', 'accelerate', 'it', 'in', 'a', 'recent', 'paper', 'by', 'hoo', 'et', 'al', 'the', 'authors', 'have', 'developed', 'a', 'linear', 'programming', 'based', 'framework', 'that', 'parallelizes', 'this', 'routing', 'process', 'to', 'achieve', 'significant', 'speedups', 'the', 'algorithm', 'is', 'termed', 'as', 'paralar', 'however', 'this', 'approach', 'has', 'certain', 'weaknesses', 'namely', 'the', 'constraints', 'violation', 'by', 'the', 'solution', 'and', 'a', 'local', 'minima', 'that', 'could', 'be', 'improved', 'we', 'address', 'these', 'two', 'issues', 'here', 'in', 'our', 'paper', 'we', 'use', 'this', 'framework', 'and', 'solve', 'it', 'using', 'the', 'primaldual', 'subgradient', 'method', 'that', 'better', 'exploits', 'the', 'problem', 'properties', 'we', 'also', 'propose', 'a', 'better', 'way', 'to', 'update', 'the', 'size', 'of', 'the', 'step', 'taken', 'by', 'this', 'iterative', 'algorithm', 'we', 'perform', 'experiments', 'on', 'a', 'set', 'of', 'standard', 'benchmarks', 'where', 'we', 'show', 'that', 'our', 'algorithm', 'outperforms', 'the', 'standard', 'existing', 'algorithms', 'vpr', 'and', 'paralar', 'we', 'achieve', 'up', 'to', '22', 'improvement', 'in', 'the', 'constraints', 'violation', 'and', 'the', 'standard', 'metric', 'of', 'the', 'minimum', 'channel', 'width', 'when', 'compared', 'with', 'paralar', 'which', 'is', 'same', 'as', 'in', 'vpr', 'we', 'achieve', 'about', '20', 'savings', 'in', 'another', 'standard', 'metric', 'of', 'the', 'total', 'wire', 'length', 'when', 'compared', 'with', 'vpr', 'which', 'is', 'the', 'same', 'as', 'for', 'paralar', 'hence', 'our', 'algorithm', 'achieves', 'minimum', 'value', 'for', 'all', 'the', 'three', 'parameters', 'also', 'the', 'critical', 'path', 'delay', 'for', 'our', 'algorithm', 'is', 'almost', 'same', 'as', 'compared', 'to', 'vpr', 'and', 'paralar', 'we', 'achieve', 'relative', 'speedups', 'of', '3', 'times', 'when', 'we', 'run', 'a', 'parallel', 'version', 'of', 'our', 'algorithm', 'using', '4', 'threads']]
|
[-0.08391558485105634, 0.009348940063267946, -0.08119351616874337, 0.027118987690926587, -0.06022194571234286, -0.1505133404377848, 0.07192435973836109, 0.4085598911922425, -0.2587926419959404, -0.3639086230099201, 0.11213586829043924, -0.23201484483480453, -0.16271509517729282, 0.22007643120083958, -0.08920941489748657, 0.0887079775549937, 0.09532301911665127, 0.008888248664326966, -0.09167053313553333, -0.31750278508663177, 0.24504736293572932, 0.06968820015341043, 0.28700306796794756, 0.047073333226144314, 0.12107318817358464, -0.023451497653499246, 0.021744919062126427, 0.05042656568717212, -0.08365151676826645, 0.12820041181286798, 0.21877945159375667, 0.16966296415030957, 0.28657494727522137, -0.40286893327347933, -0.1643012015707791, 0.1068067301120609, 0.15104203971661628, 0.11804664372373372, -0.02798437548382208, -0.24237155041936784, 0.14505022571934387, -0.15856256749201567, -0.04113685559108853, -0.0637638594135642, -0.02436038371687755, -0.005050401521380991, -0.29686023281887175, 0.03870747197489254, 0.0565388008581067, 0.006735166054219008, -0.008382878995500505, -0.12810301546374103, 0.07724085571244359, 0.09912158191844356, 0.033341919585014694, 0.09514538798574358, 0.10006916069611907, -0.08854571776185184, -0.1912496777283959, 0.3834576567709446, -0.07433507965318858, -0.19640795715339482, 0.1530179246913176, -0.03446023697219789, -0.1422172961262986, 0.10799177078297362, 0.1816029525734484, 0.13368912089802326, -0.13213079046079657, 0.06997167360479943, -0.050949140284210444, 0.18322799880802632, 0.05814225215651095, 0.01860259128175676, 0.09767828481542529, 0.22288268611300738, 0.13561123481858522, 0.13280427242582665, -0.08227187700755895, -0.09651440398511477, -0.2658521386049688, -0.16883958265557886, -0.15302251070877537, -0.015059445139952004, -0.10358623638161225, -0.11364386216551066, 0.39588280869275333, 0.22896047102939338, 0.198108536362648, 0.11271024645958096, 0.3465185428932309, 0.08293703770614229, 0.10908439806778915, 0.15512546874582767, 0.24019989944796544, 0.05231312180729583, 0.10247336485632695, -0.21276924637518824, 0.04941855380358175, 0.05162362854462117]
|
1,803.03886
|
Structure preserving schemes for the continuum Kuramoto model: phase
transitions
|
The construction of numerical schemes for the Kuramoto model is challenging
due to the structural properties of the system which are essential in order to
capture the correct physical behavior, like the description of stationary
states and phase transitions. Additional difficulties are represented by the
high dimensionality of the problem in presence of multiple frequencies. In this
paper, we develop numerical methods which are capable to preserve these
structural properties of the Kuramoto equation in the presence of diffusion and
to solve efficiently the multiple frequencies case. The novel schemes are then
used to numerically investigate the phase transitions in the case of identical
and non identical oscillators.
|
math.NA math.AP
|
the construction of numerical schemes for the kuramoto model is challenging due to the structural properties of the system which are essential in order to capture the correct physical behavior like the description of stationary states and phase transitions additional difficulties are represented by the high dimensionality of the problem in presence of multiple frequencies in this paper we develop numerical methods which are capable to preserve these structural properties of the kuramoto equation in the presence of diffusion and to solve efficiently the multiple frequencies case the novel schemes are then used to numerically investigate the phase transitions in the case of identical and non identical oscillators
|
[['the', 'construction', 'of', 'numerical', 'schemes', 'for', 'the', 'kuramoto', 'model', 'is', 'challenging', 'due', 'to', 'the', 'structural', 'properties', 'of', 'the', 'system', 'which', 'are', 'essential', 'in', 'order', 'to', 'capture', 'the', 'correct', 'physical', 'behavior', 'like', 'the', 'description', 'of', 'stationary', 'states', 'and', 'phase', 'transitions', 'additional', 'difficulties', 'are', 'represented', 'by', 'the', 'high', 'dimensionality', 'of', 'the', 'problem', 'in', 'presence', 'of', 'multiple', 'frequencies', 'in', 'this', 'paper', 'we', 'develop', 'numerical', 'methods', 'which', 'are', 'capable', 'to', 'preserve', 'these', 'structural', 'properties', 'of', 'the', 'kuramoto', 'equation', 'in', 'the', 'presence', 'of', 'diffusion', 'and', 'to', 'solve', 'efficiently', 'the', 'multiple', 'frequencies', 'case', 'the', 'novel', 'schemes', 'are', 'then', 'used', 'to', 'numerically', 'investigate', 'the', 'phase', 'transitions', 'in', 'the', 'case', 'of', 'identical', 'and', 'non', 'identical', 'oscillators']]
|
[-0.14460031986150337, 0.10747381057202195, -0.04021639642478139, 0.0504262094640311, -0.032740380614995956, -0.11512752156704664, 0.017971096087152277, 0.34402870666235685, -0.27805847221450813, -0.30962670786754676, 0.09806472793355135, -0.25465592958412514, -0.1964103930319349, 0.16059306881140434, -0.03430902255543818, 0.09583401451904879, 0.0187743465153121, 0.012734117699976734, -0.05281314947124985, -0.2063821176653383, 0.3461242665933376, 0.030623374643188005, 0.29312713809863283, -0.011287763766530488, 0.07530005668565908, -0.041573167690162165, 0.00936147416359745, 0.014088027653525825, -0.10151877400629153, 0.10337118677314182, 0.264548416732362, 0.05178072733839077, 0.24458610194010866, -0.44722093343389807, -0.2387297216431492, 0.12339774705254024, 0.13800429155256738, 0.15373231502275708, 0.018749324104714173, -0.2734637264188172, 0.08520593617490872, -0.12246476745025979, -0.15158210252842833, -0.14027912054141914, -0.040903256016059056, 0.04885501869419521, -0.2538866728794313, 0.09205724273083939, 0.068280304333678, 0.02018125040491146, -0.07478089401222489, -0.052170537104959495, 0.015184975729358417, 0.16726534402308366, 0.035872563703580655, -0.07255561058237045, 0.03818108544564219, -0.12363807769725099, -0.0975312328114847, 0.4212372629661803, -0.02919519537331157, -0.22438386924288892, 0.23941697036261084, -0.11900524160052926, -0.1372347544723501, 0.15474932924068222, 0.19992726558336504, 0.12821683772037634, -0.15208100920750034, 0.04362135620936493, 0.031196554355254327, 0.14573601036574002, 0.027194851767961627, 0.06534045768246331, 0.16947102909735232, 0.14554992871772912, 0.020480622822004888, 0.177196311859276, -0.05945399382876025, -0.1563606883390565, -0.26637127186727916, -0.11386654202861893, -0.16001639066746942, -0.021096653287747392, -0.07428030825731521, -0.17671671546823173, 0.4205690600771319, 0.19065003559269286, 0.1981864913153307, 0.005655279807763657, 0.2943566567803457, 0.13347707741895984, 0.0005338396084779459, 0.042198371461213184, 0.23924051496821144, 0.1573404269142042, 0.09376118916380047, -0.28225740178108766, 0.06873842529226008, 0.07074519265356853]
|
1,803.03887
|
Path of Vowel Raising in Chengdu Dialect of Mandarin
|
He and Rao (2013) reported a raising phenomenon of /a/ in /Xan/ (X being a
consonant or a vowel) in Chengdu dialect of Mandarin, i.e. /a/ is realized as
[epsilon] for young speakers but [ae] for older speakers, but they offered no
acoustic analysis. We designed an acoustic study that examined the realization
of /Xan/ in speakers of different age (old vs. young) and gender (male vs.
female) groups, where X represents three conditions: 1) unaspirated consonants:
C ([p], [t], [k]), 2) aspirated consonants: Ch ([ph], [th], [kh]), and 3) high
vowels: V ([i], [y], [u]). 17 native speakers were asked to read /Xan/
characters and the F1 values are extracted for comparison. Our results
confirmed the raising effect in He and Rao (2013), i.e., young speakers realize
/a/ as [epsilon] in /an/, whereas older speakers in the most part realize it as
[ae]. Also, female speakers raise more than male speakers within the same age
group. Interestingly, within the /Van/ condition, older speakers do raise /a/
in /ian/ and /yan/. We interpret this as /a/ first assimilates to its preceding
front high vowels /i/ and /y/ for older speakers, which then becomes
phonologized in younger speakers in all conditions, including /Chan/ and /Can/.
This shows a possible trajectory of the ongoing sound change in the Chengdu
dialect.
|
cs.CL
|
he and rao 2013 reported a raising phenomenon of a in xan x being a consonant or a vowel in chengdu dialect of mandarin ie a is realized as epsilon for young speakers but ae for older speakers but they offered no acoustic analysis we designed an acoustic study that examined the realization of xan in speakers of different age old vs young and gender male vs female groups where x represents three conditions 1 unaspirated consonants c p t k 2 aspirated consonants ch ph th kh and 3 high vowels v i y u 17 native speakers were asked to read xan characters and the f1 values are extracted for comparison our results confirmed the raising effect in he and rao 2013 ie young speakers realize a as epsilon in an whereas older speakers in the most part realize it as ae also female speakers raise more than male speakers within the same age group interestingly within the van condition older speakers do raise a in ian and yan we interpret this as a first assimilates to its preceding front high vowels i and y for older speakers which then becomes phonologized in younger speakers in all conditions including chan and can this shows a possible trajectory of the ongoing sound change in the chengdu dialect
|
[['he', 'and', 'rao', '2013', 'reported', 'a', 'raising', 'phenomenon', 'of', 'a', 'in', 'xan', 'x', 'being', 'a', 'consonant', 'or', 'a', 'vowel', 'in', 'chengdu', 'dialect', 'of', 'mandarin', 'ie', 'a', 'is', 'realized', 'as', 'epsilon', 'for', 'young', 'speakers', 'but', 'ae', 'for', 'older', 'speakers', 'but', 'they', 'offered', 'no', 'acoustic', 'analysis', 'we', 'designed', 'an', 'acoustic', 'study', 'that', 'examined', 'the', 'realization', 'of', 'xan', 'in', 'speakers', 'of', 'different', 'age', 'old', 'vs', 'young', 'and', 'gender', 'male', 'vs', 'female', 'groups', 'where', 'x', 'represents', 'three', 'conditions', '1', 'unaspirated', 'consonants', 'c', 'p', 't', 'k', '2', 'aspirated', 'consonants', 'ch', 'ph', 'th', 'kh', 'and', '3', 'high', 'vowels', 'v', 'i', 'y', 'u', '17', 'native', 'speakers', 'were', 'asked', 'to', 'read', 'xan', 'characters', 'and', 'the', 'f1', 'values', 'are', 'extracted', 'for', 'comparison', 'our', 'results', 'confirmed', 'the', 'raising', 'effect', 'in', 'he', 'and', 'rao', '2013', 'ie', 'young', 'speakers', 'realize', 'a', 'as', 'epsilon', 'in', 'an', 'whereas', 'older', 'speakers', 'in', 'the', 'most', 'part', 'realize', 'it', 'as', 'ae', 'also', 'female', 'speakers', 'raise', 'more', 'than', 'male', 'speakers', 'within', 'the', 'same', 'age', 'group', 'interestingly', 'within', 'the', 'van', 'condition', 'older', 'speakers', 'do', 'raise', 'a', 'in', 'ian', 'and', 'yan', 'we', 'interpret', 'this', 'as', 'a', 'first', 'assimilates', 'to', 'its', 'preceding', 'front', 'high', 'vowels', 'i', 'and', 'y', 'for', 'older', 'speakers', 'which', 'then', 'becomes', 'phonologized', 'in', 'younger', 'speakers', 'in', 'all', 'conditions', 'including', 'chan', 'and', 'can', 'this', 'shows', 'a', 'possible', 'trajectory', 'of', 'the', 'ongoing', 'sound', 'change', 'in', 'the', 'chengdu', 'dialect']]
|
[-0.07864768415122482, 0.13893318375287184, -0.03857928099939643, 0.09751718428742606, -0.08743063639202672, -0.19357871869578958, 0.09890760844508703, 0.3858550562419825, -0.19794988158833735, -0.32527992820487944, 0.0332981047772423, -0.308587123325668, -0.10673213680274785, 0.18268797645308682, -0.15232737056363407, -0.09489841488397764, 0.03577904490952345, 0.07761136627825047, -0.015340577892655145, -0.31240854506904725, 0.23909891894544233, 0.01735265437404181, 0.2039204967193116, -0.012902150618578566, 0.07373087731374889, -0.06211358649064399, -0.05187254756310722, -0.049753419327316806, -0.08452032028425391, 0.07996456171773995, 0.3142870940457754, 0.15703465716689136, 0.30097419401109043, -0.32867309802936184, -0.1275758165176268, 0.04915937250997457, 0.13164347316328698, 0.04852322110619517, -0.015336820475567947, -0.3481595157322267, 0.10974639491663159, -0.16979601512732054, -0.03924005261311928, 0.056903012493556296, 0.14940127311732526, -0.006094654156455632, -0.21357661111849463, 0.10988126858905566, 0.12140847799309995, 0.20129132852781806, -0.09430749199614015, -0.2109257950430253, -0.018308628530508873, 0.16357255651706104, 0.029198965561119148, 0.07684775952711115, 0.09096392187401997, -0.1501180928230665, -0.08736441469604701, 0.35524316502118447, -0.07080145109978696, -0.14316153894435923, 0.23345606676863367, -0.14901996265312104, -0.10983495704864187, 0.032161617836983944, 0.13413743458955582, 0.10192587345523794, -0.12163226878503876, 0.014280713000011424, -0.040763098474902414, 0.21231534753126283, 0.1872692514271303, -0.0581002442852844, 0.16020750582726948, 0.11909148115524591, -0.03227547728063116, 0.0874568833225769, -0.06780152986498757, 0.0299373641564334, -0.24269587942399085, -0.19023698529862385, -0.09968641500853226, 0.039463345897578016, -0.029143818392724456, -0.1290322164951013, 0.3587416357929922, 0.11067772740541303, 0.17396542057179398, 0.04278299080572281, 0.17550421467576935, 0.01686613091657852, 0.04239652741374879, 0.1066230637327492, 0.150529202026384, 0.07297666678830327, 0.14064168645159547, -0.15762652246781658, 0.10878106727021211, 0.020796568293546983]
|
1,803.03888
|
Large Leptonic Dirac CP Phase from Broken Democracy with Random
Perturbations
|
A large value of the leptonic Dirac CP phase can arise from broken democracy,
where the mass matrices are democratic up to small random perturbations. Such
perturbations are a natural consequence of broken residual $\mathbb S_3$
symmetries that dictate the democratic mass matrices at leading order. With
random perturbations, the leptonic Dirac CP phase has a higher probability to
attain a value around $\pm \pi/2$. Comparing with the anarchy model, broken
democracy can benefit from residual $\mathbb S_3$ symmetries, and it can
produce much better, realistic predictions for the mass hierarchy, mixing
angles, and Dirac CP phase in both quark and lepton sectors. Our approach
provides a general framework for a class of models in which a residual symmetry
determines the general features at leading order, and where, in the absence of
other fundamental principles, the symmetry breaking appears in the form of
random perturbations.
|
hep-ph
|
a large value of the leptonic dirac cp phase can arise from broken democracy where the mass matrices are democratic up to small random perturbations such perturbations are a natural consequence of broken residual mathbb s_3 symmetries that dictate the democratic mass matrices at leading order with random perturbations the leptonic dirac cp phase has a higher probability to attain a value around pm pi2 comparing with the anarchy model broken democracy can benefit from residual mathbb s_3 symmetries and it can produce much better realistic predictions for the mass hierarchy mixing angles and dirac cp phase in both quark and lepton sectors our approach provides a general framework for a class of models in which a residual symmetry determines the general features at leading order and where in the absence of other fundamental principles the symmetry breaking appears in the form of random perturbations
|
[['a', 'large', 'value', 'of', 'the', 'leptonic', 'dirac', 'cp', 'phase', 'can', 'arise', 'from', 'broken', 'democracy', 'where', 'the', 'mass', 'matrices', 'are', 'democratic', 'up', 'to', 'small', 'random', 'perturbations', 'such', 'perturbations', 'are', 'a', 'natural', 'consequence', 'of', 'broken', 'residual', 'mathbb', 's_3', 'symmetries', 'that', 'dictate', 'the', 'democratic', 'mass', 'matrices', 'at', 'leading', 'order', 'with', 'random', 'perturbations', 'the', 'leptonic', 'dirac', 'cp', 'phase', 'has', 'a', 'higher', 'probability', 'to', 'attain', 'a', 'value', 'around', 'pm', 'pi2', 'comparing', 'with', 'the', 'anarchy', 'model', 'broken', 'democracy', 'can', 'benefit', 'from', 'residual', 'mathbb', 's_3', 'symmetries', 'and', 'it', 'can', 'produce', 'much', 'better', 'realistic', 'predictions', 'for', 'the', 'mass', 'hierarchy', 'mixing', 'angles', 'and', 'dirac', 'cp', 'phase', 'in', 'both', 'quark', 'and', 'lepton', 'sectors', 'our', 'approach', 'provides', 'a', 'general', 'framework', 'for', 'a', 'class', 'of', 'models', 'in', 'which', 'a', 'residual', 'symmetry', 'determines', 'the', 'general', 'features', 'at', 'leading', 'order', 'and', 'where', 'in', 'the', 'absence', 'of', 'other', 'fundamental', 'principles', 'the', 'symmetry', 'breaking', 'appears', 'in', 'the', 'form', 'of', 'random', 'perturbations']]
|
[-0.14345177915589563, 0.24492050127351078, -0.03715482185562623, 0.08815931732573642, -0.07242964321811651, -0.15068805549486444, 0.05176278799290544, 0.2914195545949042, -0.2642445472679262, -0.2973358066078147, 0.0909355052730775, -0.2756811881726929, -0.10711428534464333, 0.06209074821291042, -0.005518732724133237, 0.06079807305258923, -0.03492919377789929, 0.02017736996299234, -0.17034216314746903, -0.18501925176202222, 0.30122315785365883, -0.012913028484788435, 0.28860677168543997, 0.022163102348688346, 0.0384273396608227, -0.06913596718925341, 0.035125404689460994, -0.04228800686782804, -0.04997824271202513, 0.03218230811943268, 0.17721432926454922, 0.06258385528906665, 0.1582287422028081, -0.3828259115845993, -0.16347044810235242, 0.18103340542393512, 0.12110263805932783, 0.12407920232347759, -0.08459509814093853, -0.32194720672459565, 0.08303180745770705, -0.19475875419147057, -0.1726397641516965, -0.11005470564655141, -0.04435501544704211, -0.10282126213664768, -0.37660163842655464, 0.12924436009328427, 0.01491479043816698, 0.008220012656188217, 0.023822187773626425, -0.14312299415950888, -0.10201802924757117, 0.10585656838876933, 0.14062372746572283, 0.014086221624165774, 0.08989762661111508, -0.12840157437041916, -0.09519774629734457, 0.5158699718014947, -0.05501295942973731, -0.21053908671581603, 0.11519133749193158, -0.17415617161334074, -0.17419619101003325, 0.12732396204153013, 0.19826588922276578, 0.06200887398585549, -0.09339156829719913, 0.12172782046335011, -0.07078972470561234, 0.12852086985547995, 0.05215765574368937, 0.039088775205490145, 0.2714058318817667, 0.13300786414665394, 0.0976321877911687, 0.04248858382965534, -0.04408776956642496, -0.13414939077860066, -0.33504471920173745, -0.09788183898761355, -0.13774116756715651, 0.08694878853696944, -0.15115704682037426, -0.10417057126760483, 0.45517250746328, 0.10617823311095607, 0.20603185445712557, 0.08367648865156486, 0.23734537505641065, 0.1107989904735687, 0.09979443246948308, 0.05721376849466871, 0.24363104181428408, 0.12895826230323393, 0.08485210410736758, -0.21235032266583936, 0.052627554773513614, 0.06362084933267585]
|
1,803.03889
|
Fast algorithms for Jacobi expansions via nonoscillatory phase functions
|
We describe a suite of fast algorithms for evaluating Jacobi polynomials,
applying the corresponding discrete Sturm-Liouville eigentransforms and
calculating Gauss-Jacobi quadrature rules. Our approach is based on the
well-known fact that Jacobi's differential equation admits a nonoscillatory
phase function which can be loosely approximated via an affine function over
much of its domain. Our algorithms perform better than currently available
methods in most respects. We illustrate this with several numerical
experiments, the source code for which is publicly available.
|
math.NA
|
we describe a suite of fast algorithms for evaluating jacobi polynomials applying the corresponding discrete sturmliouville eigentransforms and calculating gaussjacobi quadrature rules our approach is based on the wellknown fact that jacobis differential equation admits a nonoscillatory phase function which can be loosely approximated via an affine function over much of its domain our algorithms perform better than currently available methods in most respects we illustrate this with several numerical experiments the source code for which is publicly available
|
[['we', 'describe', 'a', 'suite', 'of', 'fast', 'algorithms', 'for', 'evaluating', 'jacobi', 'polynomials', 'applying', 'the', 'corresponding', 'discrete', 'sturmliouville', 'eigentransforms', 'and', 'calculating', 'gaussjacobi', 'quadrature', 'rules', 'our', 'approach', 'is', 'based', 'on', 'the', 'wellknown', 'fact', 'that', 'jacobis', 'differential', 'equation', 'admits', 'a', 'nonoscillatory', 'phase', 'function', 'which', 'can', 'be', 'loosely', 'approximated', 'via', 'an', 'affine', 'function', 'over', 'much', 'of', 'its', 'domain', 'our', 'algorithms', 'perform', 'better', 'than', 'currently', 'available', 'methods', 'in', 'most', 'respects', 'we', 'illustrate', 'this', 'with', 'several', 'numerical', 'experiments', 'the', 'source', 'code', 'for', 'which', 'is', 'publicly', 'available']]
|
[-0.0768419081548181, -0.007167642279222118, -0.12857780941069508, 0.08060848349496388, -0.1367171064663965, -0.1502265710180673, 0.0012069327058270574, 0.39091085247361124, -0.27933802861177054, -0.24506188191186923, 0.14404903415990516, -0.2550495049725167, -0.17466432264206025, 0.31992181363061833, -0.03197564513315088, 0.10012941865492254, 0.11475471724108315, 0.027361811855091497, -0.13005812455100033, -0.28112747561998475, 0.319294091887199, 0.05413594256895475, 0.2524752250711362, 0.01929172829318887, 0.13120196575824267, -0.024571679198207, -0.07599091715812205, -0.02958267350615456, -0.11056863434528051, 0.11403701885436208, 0.26546960447628337, 0.1706999386421954, 0.2530316459015012, -0.387004171187679, -0.1872551710350821, 0.11324594618800359, 0.18424787225488287, 0.09476836254665007, -0.030801566135591995, -0.2764901857441052, 0.06913816310966817, -0.16270160459829733, -0.10838670903243698, -0.15193670574957743, -0.043536724689870306, 0.06651141069447383, -0.3024614008430105, 0.060015280095215603, -0.002715932593370477, 0.06027385969765675, -0.023508105425534245, -0.1572509037080006, 0.03318231649553546, 0.05661806988959702, -0.01064924460549194, 0.05390896825478054, 0.059840730033241786, -0.06467884830020082, -0.14419879222240967, 0.37615383230149746, -0.059828453468351375, -0.26263329978936756, 0.1385775029939862, -0.07428216907040526, -0.11549214832484722, 0.11909701706220706, 0.13042343474733523, 0.22257602368839657, -0.15267314026669526, 0.07155845495678174, -0.057663728936742514, 0.17916048808286014, 0.04981789574958384, -0.0383413876822884, 0.10354415535067137, 0.15073374893444663, 0.052489822378191046, 0.1526222136692526, -0.017935728455762356, -0.16180573458759448, -0.3057180133287031, -0.1216251317722102, -0.21250178311199236, -0.017210122168016356, -0.12607716426879426, -0.2119380266716083, 0.40246879964326626, 0.15081848500248712, 0.1252683055925165, 0.09706245111271691, 0.34745215757105213, 0.19043320447552758, 0.07387559007829389, 0.11257498176434101, 0.1800161451459504, 0.09064931046659461, 0.04965315575156218, -0.20150233983086088, 0.04802237834351567, 0.13264173086290845]
|
1,803.0389
|
Multigrid preconditioners for the Newton-Krylov method in the optimal
control of the stationary Navier-Stokes equations
|
The focus of this work is on the construction and analysis of optimal-order
multigrid preconditioners to be used in the Newton-Krylov method for a
distributed optimal control problem constrained by the stationary Navier-Stokes
equations. As in our earlier work [7] on the optimal control of the stationary
Stokes equations, the strategy is to eliminate the state and adjoint variables
from the optimality system and solve the reduced nonlinear system in the
control variables. While the construction of the preconditioners extends
naturally the work in [7], the analysis shown in this paper presents a set of
significant challenges that are rooted in the nonlinearity of the constraints.
We also include numerical results that showcase the behavior of the proposed
preconditioners and show that for low to moderate Reynolds numbers they can
lead to significant drops in number of iterations and wall-clock savings.
|
math.NA
|
the focus of this work is on the construction and analysis of optimalorder multigrid preconditioners to be used in the newtonkrylov method for a distributed optimal control problem constrained by the stationary navierstokes equations as in our earlier work 7 on the optimal control of the stationary stokes equations the strategy is to eliminate the state and adjoint variables from the optimality system and solve the reduced nonlinear system in the control variables while the construction of the preconditioners extends naturally the work in 7 the analysis shown in this paper presents a set of significant challenges that are rooted in the nonlinearity of the constraints we also include numerical results that showcase the behavior of the proposed preconditioners and show that for low to moderate reynolds numbers they can lead to significant drops in number of iterations and wallclock savings
|
[['the', 'focus', 'of', 'this', 'work', 'is', 'on', 'the', 'construction', 'and', 'analysis', 'of', 'optimalorder', 'multigrid', 'preconditioners', 'to', 'be', 'used', 'in', 'the', 'newtonkrylov', 'method', 'for', 'a', 'distributed', 'optimal', 'control', 'problem', 'constrained', 'by', 'the', 'stationary', 'navierstokes', 'equations', 'as', 'in', 'our', 'earlier', 'work', '7', 'on', 'the', 'optimal', 'control', 'of', 'the', 'stationary', 'stokes', 'equations', 'the', 'strategy', 'is', 'to', 'eliminate', 'the', 'state', 'and', 'adjoint', 'variables', 'from', 'the', 'optimality', 'system', 'and', 'solve', 'the', 'reduced', 'nonlinear', 'system', 'in', 'the', 'control', 'variables', 'while', 'the', 'construction', 'of', 'the', 'preconditioners', 'extends', 'naturally', 'the', 'work', 'in', '7', 'the', 'analysis', 'shown', 'in', 'this', 'paper', 'presents', 'a', 'set', 'of', 'significant', 'challenges', 'that', 'are', 'rooted', 'in', 'the', 'nonlinearity', 'of', 'the', 'constraints', 'we', 'also', 'include', 'numerical', 'results', 'that', 'showcase', 'the', 'behavior', 'of', 'the', 'proposed', 'preconditioners', 'and', 'show', 'that', 'for', 'low', 'to', 'moderate', 'reynolds', 'numbers', 'they', 'can', 'lead', 'to', 'significant', 'drops', 'in', 'number', 'of', 'iterations', 'and', 'wallclock', 'savings']]
|
[-0.12363962647224387, 0.03978934159819433, -0.08246932293664902, 0.0016545890450662543, -0.04048025945749741, -0.10361003432528558, 0.03822969336554752, 0.29091274156565416, -0.2894289498151353, -0.3356849396244643, 0.14507501926487773, -0.23647006520182423, -0.16251030311662149, 0.23193684054030014, -0.11694728220806372, 0.11271653791017672, 0.09375929592362216, -0.03002161503908165, -0.08019447459340598, -0.2762839005771258, 0.3094476956373794, 0.041650546397617526, 0.274111280336659, 0.020274444001046478, 0.11878047635488159, -0.06019545512617374, -0.03450330882333219, 0.03145539188585805, -0.08522205290227512, 0.11722899654282402, 0.2805108095103122, 0.10577170106133195, 0.31467651604866304, -0.42582555551161155, -0.1850962091913506, 0.07362052659233305, 0.1672032677026875, 0.1313523347638151, -0.029072826000009763, -0.23710549655799748, 0.11463565705013824, -0.15092367461241835, -0.13004723872910154, -0.09802036018751509, -0.02485790866565831, 0.06727448829527323, -0.3001752420599368, 0.06144959548077916, 0.09340993540051083, 0.02087068493999805, -0.0991167857787235, -0.12817383274363342, -0.002339816774433175, 0.06885295785824827, 0.06620695633509903, -0.010981782894343772, 0.06800464082654592, -0.12103949274194051, -0.10228474734182608, 0.3697461023768212, -0.04325657635464841, -0.2569516169209469, 0.16653886318523833, -0.08991998106122334, -0.1367514230218445, 0.14598546224045203, 0.24343402809892775, 0.15621975865149013, -0.12045908305159908, 0.09749014698714513, -0.05001152083211651, 0.1635485152013811, 0.03168182173109752, -0.014289100347284941, 0.08363356566756752, 0.16352648281731522, 0.13915115237526648, 0.14507208926791443, -0.03509933421890258, -0.12883739294616361, -0.3071507956859068, -0.1439235667629557, -0.1673149538510446, -0.01206526226786804, -0.10646086884610906, -0.1361215441553368, 0.39460453337573625, 0.21868562313615747, 0.16493039089089906, 0.06182521617317453, 0.2996329497942265, 0.1593965837354846, 0.036442752236067744, 0.10444230830019459, 0.2448531397492856, 0.14005504610142439, 0.1425480620476503, -0.2785102797478953, 0.022077098515228176, 0.08066428771427443]
|
1,803.03891
|
Predestined Dark Matter in Gauge Extensions of the Standard Model
|
In any gauge extension of the standard model (SM) of quarks and leptons,
there is a minimal set of fermion and scalar multiplets which encompasses all
the particles and interactions of the SM. Included within this set, there may
be a suitable dark-matter candidate. If not, one may still exist from the
judicious addition of a simple fermion or scalar multiplet without any imposed
symmetry. Some new examples of such predestined dark matter are discussed.
|
hep-ph
|
in any gauge extension of the standard model sm of quarks and leptons there is a minimal set of fermion and scalar multiplets which encompasses all the particles and interactions of the sm included within this set there may be a suitable darkmatter candidate if not one may still exist from the judicious addition of a simple fermion or scalar multiplet without any imposed symmetry some new examples of such predestined dark matter are discussed
|
[['in', 'any', 'gauge', 'extension', 'of', 'the', 'standard', 'model', 'sm', 'of', 'quarks', 'and', 'leptons', 'there', 'is', 'a', 'minimal', 'set', 'of', 'fermion', 'and', 'scalar', 'multiplets', 'which', 'encompasses', 'all', 'the', 'particles', 'and', 'interactions', 'of', 'the', 'sm', 'included', 'within', 'this', 'set', 'there', 'may', 'be', 'a', 'suitable', 'darkmatter', 'candidate', 'if', 'not', 'one', 'may', 'still', 'exist', 'from', 'the', 'judicious', 'addition', 'of', 'a', 'simple', 'fermion', 'or', 'scalar', 'multiplet', 'without', 'any', 'imposed', 'symmetry', 'some', 'new', 'examples', 'of', 'such', 'predestined', 'dark', 'matter', 'are', 'discussed']]
|
[-0.12202825270593166, 0.24661756813526153, -0.025560433589077246, 0.13479012542714675, -0.1300155258613328, -0.19893219366048773, 0.019581056653211516, 0.30842525356138745, -0.19165032607813676, -0.29784044772386553, 0.033917498320030666, -0.2711112957447767, -0.07458058085603018, 0.10578992883364359, 0.02026029142861565, 0.013629856010278066, 0.024741634366412957, 0.09171708578864733, -0.048166091678043206, -0.26821331851494806, 0.3174294629506767, -0.07254359513521194, 0.1423438743253549, 0.07054255691046517, 0.1049054647423327, 0.007993377316743135, 0.0032387512363493444, -0.024992259865781914, -0.059922322798520326, 0.07488611232877398, 0.16413221953436732, 0.12505184234430392, 0.17167610690308113, -0.4068062310044964, -0.21897500024487576, 0.22230082929134368, 0.16055017068982125, 0.11630043289158493, -0.1306870037006835, -0.28552002385258674, 0.11559768953671058, -0.1934783038496971, -0.12737486427805075, -0.09160601792236168, -0.08146253322561582, -0.07760787227501471, -0.3201026007346809, 0.0639739243624111, 0.028620166356364884, 0.030560324167211852, -0.029534923421839873, -0.15274100797871748, -0.0953075915761292, 0.010939804927135506, 0.15293506789486855, 0.012116183585797746, 0.12727656616053235, -0.19087036459706724, -0.12713138054125012, 0.4865999753276507, -0.08065226835509141, -0.26199077603717646, 0.21034544760982196, -0.10139855506829917, -0.15753106549032964, 0.09894117129966616, 0.08987499927481016, 0.08048919639239709, -0.18627661716192961, 0.2060706713896555, -0.10969759297867616, 0.18173577093829713, 0.05768847693689168, 0.06499811818202336, 0.30627945887545743, 0.13402726645270982, 0.0467516028881073, 0.02314126387083282, 0.004698173155387243, -0.07830345133319497, -0.44680020650227864, -0.17085585329681635, -0.139412914069059, 0.020303318442505162, -0.10191171666549054, -0.1609935727653404, 0.41712328062703213, 0.11619945890270174, 0.16064545342077813, -0.024078489428696535, 0.23637987467770774, 0.04815715136355721, 0.13891927801072598, 0.06876586816584071, 0.2571165242686402, 0.11084136802703143, 0.02201311199615399, -0.16065322828401501, -0.055254717680315174, 0.02151143890184661]
|
1,803.03892
|
Toward Understanding the B[e] Phenomenon. VII. AS 386, a single-lined
binary with a candidate black hole component
|
We report the results of spectroscopic and photometric observations of the
emission-line object AS 386. For the first time, we found that it exhibits the
B[e] phenomenon and fits the definition of an FS CMa type object. The optical
spectrum shows the presence of a B-type star with the following properties: T_
eff = 11000+/-500 K, log L/L_sun = 3.7+/-0.3, a mass of 7+/-1 M_sun, and a
distance D = 2.4+/-0.3 kpc from the Sun. We detected regular radial velocity
variations of both absorption and emission lines with the following orbital
parameters: P_orb = 131.27+/-0.09 days, semi-amplitude K_1 = 51.7+/-3.0 km/s,
systemic radial velocity gamma = -31.8+/-2.6 km/s, and a mass function of f(m)
= 1.9+/-0.3 M_sun. AS 386 exhibits irregular variations of the optical
brightness (V=10.92+/-0.05 mag), while the near-IR brightness varies up to ~0.3
mag following the spectroscopic period. We explain this behavior by a variable
illumination of the dusty disk inner rim by the B-type component. Doppler
tomography based on the orbital variations of emission-line profiles shows that
the material is distributed near the B-type component and in a circumbinary
disk. We conclude that the system has undergone a strong mass transfer that
created the circumstellar material and increased the B-type component mass. The
absence of any traces of a secondary component, whose mass should be >= 7
M_sun, suggests that it is most likely a black hole.
|
astro-ph.SR
|
we report the results of spectroscopic and photometric observations of the emissionline object as 386 for the first time we found that it exhibits the be phenomenon and fits the definition of an fs cma type object the optical spectrum shows the presence of a btype star with the following properties t_ eff 11000500 k log ll_sun 3703 a mass of 71 m_sun and a distance d 2403 kpc from the sun we detected regular radial velocity variations of both absorption and emission lines with the following orbital parameters p_orb 13127009 days semiamplitude k_1 51730 kms systemic radial velocity gamma 31826 kms and a mass function of fm 1903 m_sun as 386 exhibits irregular variations of the optical brightness v1092005 mag while the nearir brightness varies up to 03 mag following the spectroscopic period we explain this behavior by a variable illumination of the dusty disk inner rim by the btype component doppler tomography based on the orbital variations of emissionline profiles shows that the material is distributed near the btype component and in a circumbinary disk we conclude that the system has undergone a strong mass transfer that created the circumstellar material and increased the btype component mass the absence of any traces of a secondary component whose mass should be 7 m_sun suggests that it is most likely a black hole
|
[['we', 'report', 'the', 'results', 'of', 'spectroscopic', 'and', 'photometric', 'observations', 'of', 'the', 'emissionline', 'object', 'as', '386', 'for', 'the', 'first', 'time', 'we', 'found', 'that', 'it', 'exhibits', 'the', 'be', 'phenomenon', 'and', 'fits', 'the', 'definition', 'of', 'an', 'fs', 'cma', 'type', 'object', 'the', 'optical', 'spectrum', 'shows', 'the', 'presence', 'of', 'a', 'btype', 'star', 'with', 'the', 'following', 'properties', 't_', 'eff', '11000500', 'k', 'log', 'll_sun', '3703', 'a', 'mass', 'of', '71', 'm_sun', 'and', 'a', 'distance', 'd', '2403', 'kpc', 'from', 'the', 'sun', 'we', 'detected', 'regular', 'radial', 'velocity', 'variations', 'of', 'both', 'absorption', 'and', 'emission', 'lines', 'with', 'the', 'following', 'orbital', 'parameters', 'p_orb', '13127009', 'days', 'semiamplitude', 'k_1', '51730', 'kms', 'systemic', 'radial', 'velocity', 'gamma', '31826', 'kms', 'and', 'a', 'mass', 'function', 'of', 'fm', '1903', 'm_sun', 'as', '386', 'exhibits', 'irregular', 'variations', 'of', 'the', 'optical', 'brightness', 'v1092005', 'mag', 'while', 'the', 'nearir', 'brightness', 'varies', 'up', 'to', '03', 'mag', 'following', 'the', 'spectroscopic', 'period', 'we', 'explain', 'this', 'behavior', 'by', 'a', 'variable', 'illumination', 'of', 'the', 'dusty', 'disk', 'inner', 'rim', 'by', 'the', 'btype', 'component', 'doppler', 'tomography', 'based', 'on', 'the', 'orbital', 'variations', 'of', 'emissionline', 'profiles', 'shows', 'that', 'the', 'material', 'is', 'distributed', 'near', 'the', 'btype', 'component', 'and', 'in', 'a', 'circumbinary', 'disk', 'we', 'conclude', 'that', 'the', 'system', 'has', 'undergone', 'a', 'strong', 'mass', 'transfer', 'that', 'created', 'the', 'circumstellar', 'material', 'and', 'increased', 'the', 'btype', 'component', 'mass', 'the', 'absence', 'of', 'any', 'traces', 'of', 'a', 'secondary', 'component', 'whose', 'mass', 'should', 'be', '7', 'm_sun', 'suggests', 'that', 'it', 'is', 'most', 'likely', 'a', 'black', 'hole']]
|
[-0.126722669797404, 0.10204644885226291, -0.09324499218033919, 0.019236493333981912, -0.08150276926200871, -0.08869979194570504, 0.04701589004600147, 0.424755714434293, -0.17716352725155873, -0.32673896619849285, 0.06772613114999915, -0.294911126418193, -0.03518511616377109, 0.18750302209476127, -0.06781646380320601, -0.028759270156156955, 0.09110423074095347, -0.04134138078544152, -0.0933649872606962, -0.2128503435887311, 0.2744891077473358, 0.018674600572104207, 0.11136386497373428, -0.012562868574104451, 0.05383167141373483, -0.08550600381461271, -0.036183059582547625, -0.05214113889928531, -0.14120009826225097, 0.04183532193051053, 0.16886415370150443, 0.11270281589812163, 0.19233549763704863, -0.2623266582836508, -0.21023219061049914, 0.03038991835404085, 0.18426890274159474, -0.00755934607677606, -0.029163460807400593, -0.26357598589955394, 0.07562919971511758, -0.19011303598121013, -0.22363060105639004, 0.08978793909559625, 0.13655199811990382, 0.0029257467353541334, -0.2388568777129601, 0.1684265351371515, 0.061055580070220924, 0.14362037474601402, -0.14086570020513012, -0.10772383719236257, -0.1074969238567448, 0.02901809830154472, 0.04288687358541978, 0.10844479263717428, 0.1787894447868126, -0.09863666168717376, -0.003728715494625407, 0.3904521720945288, -0.12876931063130226, 0.03399039148717506, 0.1907389542133838, -0.18648175420581337, -0.13739208208285955, 0.1891352157471616, 0.1257081638675593, 0.13640184977669653, -0.1432433204357982, -0.013627499168676777, -0.0289019870042049, 0.2806644999046186, 0.06309029893787287, 0.07369987796426007, 0.3356592845184506, 0.08439169302857759, 0.015510557564359944, 0.0739475305455442, -0.2907735350146232, 0.0008213878780124931, -0.22745529797201583, -0.10750070208504181, -0.1162964491314605, 0.11057339728929512, -0.15584775044348084, -0.12456375696277673, 0.3824050072580576, 0.09228966616888727, 0.2650428525807786, 0.020389147738310926, 0.28500079157027425, 0.11200955268978184, 0.09203469786781512, 0.1515155527997044, 0.30507806825255035, 0.2080193835023872, 0.12059608982222308, -0.27556632738453635, 0.062201205395384256, 0.0010616121730348523]
|
1,803.03893
|
Unsupervised Learning of Monocular Depth Estimation and Visual Odometry
with Deep Feature Reconstruction
|
Despite learning based methods showing promising results in single view depth
estimation and visual odometry, most existing approaches treat the tasks in a
supervised manner. Recent approaches to single view depth estimation explore
the possibility of learning without full supervision via minimizing photometric
error. In this paper, we explore the use of stereo sequences for learning depth
and visual odometry. The use of stereo sequences enables the use of both
spatial (between left-right pairs) and temporal (forward backward) photometric
warp error, and constrains the scene depth and camera motion to be in a common,
real-world scale. At test time our framework is able to estimate single view
depth and two-view odometry from a monocular sequence. We also show how we can
improve on a standard photometric warp loss by considering a warp of deep
features. We show through extensive experiments that: (i) jointly training for
single view depth and visual odometry improves depth prediction because of the
additional constraint imposed on depths and achieves competitive results for
visual odometry; (ii) deep feature-based warping loss improves upon simple
photometric warp loss for both single view depth estimation and visual
odometry. Our method outperforms existing learning based methods on the KITTI
driving dataset in both tasks. The source code is available at
https://github.com/Huangying-Zhan/Depth-VO-Feat
|
cs.CV
|
despite learning based methods showing promising results in single view depth estimation and visual odometry most existing approaches treat the tasks in a supervised manner recent approaches to single view depth estimation explore the possibility of learning without full supervision via minimizing photometric error in this paper we explore the use of stereo sequences for learning depth and visual odometry the use of stereo sequences enables the use of both spatial between leftright pairs and temporal forward backward photometric warp error and constrains the scene depth and camera motion to be in a common realworld scale at test time our framework is able to estimate single view depth and twoview odometry from a monocular sequence we also show how we can improve on a standard photometric warp loss by considering a warp of deep features we show through extensive experiments that i jointly training for single view depth and visual odometry improves depth prediction because of the additional constraint imposed on depths and achieves competitive results for visual odometry ii deep featurebased warping loss improves upon simple photometric warp loss for both single view depth estimation and visual odometry our method outperforms existing learning based methods on the kitti driving dataset in both tasks the source code is available at httpsgithubcomhuangyingzhandepthvofeat
|
[['despite', 'learning', 'based', 'methods', 'showing', 'promising', 'results', 'in', 'single', 'view', 'depth', 'estimation', 'and', 'visual', 'odometry', 'most', 'existing', 'approaches', 'treat', 'the', 'tasks', 'in', 'a', 'supervised', 'manner', 'recent', 'approaches', 'to', 'single', 'view', 'depth', 'estimation', 'explore', 'the', 'possibility', 'of', 'learning', 'without', 'full', 'supervision', 'via', 'minimizing', 'photometric', 'error', 'in', 'this', 'paper', 'we', 'explore', 'the', 'use', 'of', 'stereo', 'sequences', 'for', 'learning', 'depth', 'and', 'visual', 'odometry', 'the', 'use', 'of', 'stereo', 'sequences', 'enables', 'the', 'use', 'of', 'both', 'spatial', 'between', 'leftright', 'pairs', 'and', 'temporal', 'forward', 'backward', 'photometric', 'warp', 'error', 'and', 'constrains', 'the', 'scene', 'depth', 'and', 'camera', 'motion', 'to', 'be', 'in', 'a', 'common', 'realworld', 'scale', 'at', 'test', 'time', 'our', 'framework', 'is', 'able', 'to', 'estimate', 'single', 'view', 'depth', 'and', 'twoview', 'odometry', 'from', 'a', 'monocular', 'sequence', 'we', 'also', 'show', 'how', 'we', 'can', 'improve', 'on', 'a', 'standard', 'photometric', 'warp', 'loss', 'by', 'considering', 'a', 'warp', 'of', 'deep', 'features', 'we', 'show', 'through', 'extensive', 'experiments', 'that', 'i', 'jointly', 'training', 'for', 'single', 'view', 'depth', 'and', 'visual', 'odometry', 'improves', 'depth', 'prediction', 'because', 'of', 'the', 'additional', 'constraint', 'imposed', 'on', 'depths', 'and', 'achieves', 'competitive', 'results', 'for', 'visual', 'odometry', 'ii', 'deep', 'featurebased', 'warping', 'loss', 'improves', 'upon', 'simple', 'photometric', 'warp', 'loss', 'for', 'both', 'single', 'view', 'depth', 'estimation', 'and', 'visual', 'odometry', 'our', 'method', 'outperforms', 'existing', 'learning', 'based', 'methods', 'on', 'the', 'kitti', 'driving', 'dataset', 'in', 'both', 'tasks', 'the', 'source', 'code', 'is', 'available', 'at', 'httpsgithubcomhuangyingzhandepthvofeat']]
|
[-0.03795724633105454, -0.03540922942615691, -0.07383582113598962, 0.02434050232765176, -0.12297397017301548, -0.1784069652303255, 0.032507600638616296, 0.501410434253159, -0.2867638755262652, -0.3405700583631794, 0.057706770131785774, -0.26150818663604913, -0.1724342040753635, 0.23239503590656177, -0.20289068475276942, 0.12636407069346337, 0.20303462744590695, 0.006259265598020561, -0.1187107455135057, -0.26084980091102244, 0.2749390741721505, 0.03513873149169653, 0.3159312332935986, 0.02286013281859812, 0.16550308030231722, 0.03978669649943532, -0.08119764095851376, -0.011034894951929648, -0.07041430163901947, 0.18706916060099113, 0.2426584449330611, 0.2163022845623172, 0.27232304087928716, -0.3657638367531555, -0.24986438768738436, 0.030200280051767118, 0.1758501675556458, 0.09839873378431159, -0.04297896369105382, -0.3841631872135968, 0.04255811346894396, -0.11012325018278456, 0.04430728364691493, -0.10292774826243875, -0.025311589314203176, -0.030640791536175778, -0.32980221329323417, 0.06161335842514832, 0.04097512033989742, 0.13251003273984507, -0.0813195766537406, -0.09534945871592278, 0.04058003594344925, 0.19063654546404168, 0.019264426459336563, 0.08494083684691715, 0.13955185323776234, -0.24008520657218815, -0.1260782117988648, 0.35394089001541335, -0.11514267797714897, -0.20090474251302934, 0.22209665099203232, -0.034487471649689336, -0.13853319322113836, 0.10948725205269598, 0.22501194557740486, 0.12576650958064767, -0.1455954195355021, 0.031017502773985534, -0.037044391532739, 0.21140706824870514, 0.05948554750287994, 0.01643085034586312, 0.20067644754335995, 0.2631476778847476, 0.06279277561587238, 0.10104871644760438, -0.25908305027322576, -0.03680679914985029, -0.22496113362943843, -0.06308653016347393, -0.15987312469542736, -0.08349579917544145, -0.13805398775778788, -0.10665906208589496, 0.3715658841565961, 0.29211977828693175, 0.23362616967365502, 0.15283936045154753, 0.4518146679160141, 0.010100806474552623, 0.09343939780235468, 0.08764528039998064, 0.24738745233487516, -0.034383368336906035, 0.1091608710434576, -0.19336554921354124, 0.07470428529916154, 0.09552730805174048]
|
1,803.03894
|
Twistor geometry of Hermitian surfaces induced by canonical connections
|
In this paper, following the constructions of N. R. O'Brian, J. H. Rawnsley
and I. Vaisman, we define four almost Hermitian structures (up to conjugation)
on the twistor space of a Hermitian surface by using canonical connections,
including the Lichnerowicz connection and the Chern connection. We also study
the relations between the natural geometry of the twistor spaces and the
geometry of Hermitian surfaces.
|
math.DG
|
in this paper following the constructions of n r obrian j h rawnsley and i vaisman we define four almost hermitian structures up to conjugation on the twistor space of a hermitian surface by using canonical connections including the lichnerowicz connection and the chern connection we also study the relations between the natural geometry of the twistor spaces and the geometry of hermitian surfaces
|
[['in', 'this', 'paper', 'following', 'the', 'constructions', 'of', 'n', 'r', 'obrian', 'j', 'h', 'rawnsley', 'and', 'i', 'vaisman', 'we', 'define', 'four', 'almost', 'hermitian', 'structures', 'up', 'to', 'conjugation', 'on', 'the', 'twistor', 'space', 'of', 'a', 'hermitian', 'surface', 'by', 'using', 'canonical', 'connections', 'including', 'the', 'lichnerowicz', 'connection', 'and', 'the', 'chern', 'connection', 'we', 'also', 'study', 'the', 'relations', 'between', 'the', 'natural', 'geometry', 'of', 'the', 'twistor', 'spaces', 'and', 'the', 'geometry', 'of', 'hermitian', 'surfaces']]
|
[-0.20532367604651622, 0.10361703763168956, -0.0504655476570839, 0.08310686482582241, -0.10345921894564988, -0.1228569341187794, 0.013925808487415668, 0.3641390378276507, -0.2621632766215101, -0.26576860018429305, 0.06334260887178104, -0.25030741188675165, -0.273235000377994, 0.12824979765961567, -0.10056142055148644, -0.004603610034026797, 0.0012408708710046042, 0.006787232019835048, -0.21911575813733397, -0.2762910246808407, 0.4975244175820124, 0.020677254254382754, 0.21082647821712602, 0.04230140349890072, 0.09680844416531424, 0.020118443676019237, -0.06347937356414539, -0.014334733295346803, -0.1909466111692526, 0.18310535859523547, 0.21992803834718727, 0.07855755971035078, 0.11005683258057587, -0.3844763339526715, -0.14426685534861117, 0.14379855322222862, 0.07205748587240657, -0.018882320151619968, 0.032462677643043066, -0.2768019987122407, 0.024026221998307545, -0.10541638711260425, -0.1052846757183221, -0.07737969627810849, 0.09939860539244753, -0.017107389604909314, -0.1452993724369518, -0.05139067653051045, 0.13030354310536668, 0.09455289730122166, -0.05053771615383171, -0.07573575331341653, -0.08251449808714882, 0.07470849610953814, 0.006252821150516707, 0.03389891846445463, 0.0461512879128494, -0.04746089671324524, -0.11365145282997262, 0.350523260702926, -0.09668849670283851, -0.2478165960175887, 0.13044972599498808, -0.12612524475636228, -0.14499688308153832, 0.07973830607379713, 0.11764223876202272, 0.17720146288740493, -0.05490212962918338, 0.21997197668367466, -0.09885148473438762, 0.03407839245148121, 0.13998588730418493, 0.007751787288321389, 0.1542143153455404, 0.05057214179800616, 0.08498641531470985, 0.10404828944731326, -0.04336363348799447, -0.10741960658185509, -0.38176360064082676, -0.2737104590568278, -0.1405307413596246, 0.1659060827611635, -0.12107362853116467, -0.15669479218148996, 0.4216245878709569, 0.021395857179803506, 0.23874454543231025, 0.07154691510552925, 0.1833167273129913, 0.010701641854312684, 0.029263528655209238, 0.0891053362025155, 0.18575869221979427, 0.2945161725889655, 0.06832195267022129, -0.170451693650749, -0.12274640732045684, 0.15853729248342532]
|
1,803.03895
|
Reduction of Restricted Maximum Likelihood for Random Coefficient Models
|
The restricted maximum likelihood (REML) estimator of the dispersion matrix
for random coefficient models is rewritten in terms of the sufficient
statistics of the individual regressions.
|
stat.ME math.ST stat.TH
|
the restricted maximum likelihood reml estimator of the dispersion matrix for random coefficient models is rewritten in terms of the sufficient statistics of the individual regressions
|
[['the', 'restricted', 'maximum', 'likelihood', 'reml', 'estimator', 'of', 'the', 'dispersion', 'matrix', 'for', 'random', 'coefficient', 'models', 'is', 'rewritten', 'in', 'terms', 'of', 'the', 'sufficient', 'statistics', 'of', 'the', 'individual', 'regressions']]
|
[-0.08410304471348914, 0.03696138755633281, -0.07385815669280979, 0.1104248665103044, -0.03895687999633642, -0.1594438158835356, 0.032166385682872854, 0.313378698264177, -0.2754519647703721, -0.28777504440110463, 0.11700299508923379, -0.26475748075888705, -0.12493589291205773, 0.12476645628563486, -0.05793906855755127, 0.1867246745297542, 0.055221549714378156, 0.08922428759531333, -0.11717822374059604, -0.3367641441380748, 0.21760900522797152, 0.08859597318447553, 0.35269015482985056, -0.05054538661184219, 0.1648105989711789, 0.09309459663927555, -0.0547988488464258, 0.03410035057011275, -0.11588376173033164, 0.1298409373445723, 0.20320356021763403, 0.1658830215724615, 0.328261627887304, -0.30877781179375374, -0.195203526948507, 0.18371878331527114, 0.13671576095153937, 0.023370923331150643, 0.1102352269853537, -0.2019027738043895, 0.032476542848878756, -0.18425587679331118, -0.10678499098867178, -0.025715680157120984, -0.05460416396649984, 0.07310410918524632, -0.39392863471920675, 0.2679436213265245, 0.06156477204058319, 0.0844749599480285, 0.02306216575491887, -0.21998972531694633, -0.009321506291878624, 0.04743991206543377, 0.03539381601596968, -0.12745505650169575, 0.0687279026561345, -0.15523984034259158, -0.015832364845734376, 0.3256139920021479, -0.10265230423269364, -0.2711278758943081, 0.045332697399247154, -0.1406946561585825, -0.09725679170626861, 0.1094817456144553, 0.2396530628634187, 0.09197196113662078, -0.2127878939589629, 0.08168502839711997, -0.06448606537798277, 0.10965768725145608, 0.018777926846478995, -0.02090834152813141, 0.18188296847018556, 0.06982257752679288, 0.06056309912282114, 0.15058002504520118, -0.09231730120686385, -0.04368510011297006, -0.32043206920990575, -0.13310986578177947, -0.28276862404667413, -0.04082411359279202, -0.26245962146024865, -0.257554777929237, 0.4127461944635098, 0.13700925558805466, 0.1654359045653389, 0.1560707465172387, 0.23702647622961265, 0.2508033840231991, 0.04035041266335891, 0.051824030394737534, 0.20814475134158364, 0.280189552416022, -0.010153684048698498, -0.21913408160281295, 0.21690912385327885, 0.10088163188013893]
|
1,803.03896
|
Improved Asymptotics for Zeros of Kernel Estimates via a Reformulation
of the Leadbetter-Cryer Integral
|
The expected number of false inflection points of kernel smoothers is
evaluated. To obtain the small noise limit, we use a reformulation of the
Leadbetter-Cryer integral for the expected number of zero crossings of a
differentiable Gaussian process.
|
stat.ME eess.SP math.PR math.ST physics.data-an stat.TH
|
the expected number of false inflection points of kernel smoothers is evaluated to obtain the small noise limit we use a reformulation of the leadbettercryer integral for the expected number of zero crossings of a differentiable gaussian process
|
[['the', 'expected', 'number', 'of', 'false', 'inflection', 'points', 'of', 'kernel', 'smoothers', 'is', 'evaluated', 'to', 'obtain', 'the', 'small', 'noise', 'limit', 'we', 'use', 'a', 'reformulation', 'of', 'the', 'leadbettercryer', 'integral', 'for', 'the', 'expected', 'number', 'of', 'zero', 'crossings', 'of', 'a', 'differentiable', 'gaussian', 'process']]
|
[-0.17660444431208275, 0.03941717412876519, -0.09837526762606325, 0.1366169472790667, -0.06383792886737029, -0.10692758981541202, 0.13200086685577156, 0.28741376625524984, -0.26473251851023855, -0.26800942239729136, 0.10138961495328191, -0.26622779788512335, -0.14988388876254494, 0.1949155841626831, -0.09909704615789894, 0.11023494420019356, 0.06118642694845393, 0.09543144964688532, -0.09356444047109501, -0.31719191727303975, 0.315221093997762, 0.0366261379440894, 0.2192200570291764, -0.022820567057744878, 0.151934692686474, 0.0036139548126910186, -0.02142528409289347, 0.0008605318269818216, -0.08939632869048698, 0.10349412454996963, 0.22862929850816727, 0.07726105856960891, 0.3202425988667921, -0.3514812526771346, -0.16768079885357134, 0.18192195969105168, 0.12676809668364758, 0.06521913238071106, 0.027897639351116645, -0.247521006099477, 0.0873626680994356, -0.11168657945519364, -0.1900667047404961, -0.06720698156670944, -0.004807428242890416, 0.04761555086116533, -0.32389556343440673, 0.04044351585813471, 0.06353460378139406, 0.05477271432912833, -0.0004163414390908705, -0.16481030365685, -0.00605668208083591, 0.07191902142320131, 0.061165690238782634, 0.0338029968426437, 0.1488329336374394, -0.16065883963696054, -0.08582650662425, 0.300343499921665, -0.12417886212367464, -0.21426843388660535, 0.1486213099261796, -0.11716115537628129, -0.06810421149271566, 0.2219629822349226, 0.1593561083128726, 0.11623872625263962, -0.08773691355678681, 0.11313215673372552, 0.007020653993193363, 0.10624474438058364, 0.10247529527122104, 0.00362361703269385, 0.16705038529392835, 0.13337870828203252, 0.12545281034466382, 0.1915248383742732, -0.17479498184764306, -0.0775418828266698, -0.382630852730693, -0.18554797315516988, -0.28518526563169183, 0.07100352432855682, -0.13106356909800623, -0.28029429338671064, 0.3634227977914585, 0.16440644076194716, 0.24905205439977549, 0.14661615150603088, 0.28678106214549093, 0.23099796403501485, 0.013443508009250099, 0.05710424919537193, 0.15543224886563178, 0.1190866525914218, 0.03678136897852292, -0.16920655383099173, 0.020455708840509523, 0.07363763111769348]
|
1,803.03897
|
Optimal Data-based Kernel Estimation of Evolutionary Spectra
|
Complex demodulation of evolutionary spectra is formulated as a
two-dimensional kernel smoother in the time-frequency domain. In the first
stage, a tapered Fourier transform, $y_{nu}(f,t)$, is calculated. Second, the
log-spectral estimate, $\hat{\theta}_{\nu}(f,t) \equiv \ln(|y_{nu}(f,t)|^2$, is
smoothed. As the characteristic widths of the kernel smoother increase, the
bias from temporal and frequency averaging increases while the variance
decreases. The demodulation parameters, such as the order, length, and
bandwidth of spectral taper and the kernel smoother, are determined by
minimizing the expected error. For well-resolved evolutionary spectra, the
optimal taper length is a small fraction of the optimal kernel half-width. The
optimal frequency bandwidth, $w$, for the spectral window scales as $w^2
\approx \lambda_F/ \tau $, where $\tau$ is the characteristic time, and
$\lambda_F$ is the characteristic frequency scale-length. In contrast, the
optimal half-widths for the second stage kernel smoother scales as $h \approx
1/(\tau \lambda_F)^{1 \over ( p+2) }$, where $p$ is the order of the kernel
smoother. The ratio of the optimal frequency half-width to the optimal time
half-width satisfies $h_F / h_T ~ (|\partial_t ^p \theta | / |\partial_f^p
\theta|)$. Since the expected loss depends on the unknown evolutionary spectra,
we initially estimate $|\partial_t^p \theta|^2$ and $|\partial_f^p \theta|^2$
using a higher order kernel smoothers, and then substitute the estimated
derivatives into the expected loss criteria.
|
stat.ME eess.AS eess.IV eess.SP physics.data-an
|
complex demodulation of evolutionary spectra is formulated as a twodimensional kernel smoother in the timefrequency domain in the first stage a tapered fourier transform y_nuft is calculated second the logspectral estimate hattheta_nuft equiv lny_nuft2 is smoothed as the characteristic widths of the kernel smoother increase the bias from temporal and frequency averaging increases while the variance decreases the demodulation parameters such as the order length and bandwidth of spectral taper and the kernel smoother are determined by minimizing the expected error for wellresolved evolutionary spectra the optimal taper length is a small fraction of the optimal kernel halfwidth the optimal frequency bandwidth w for the spectral window scales as w2 approx lambda_f tau where tau is the characteristic time and lambda_f is the characteristic frequency scalelength in contrast the optimal halfwidths for the second stage kernel smoother scales as h approx 1tau lambda_f1 over p2 where p is the order of the kernel smoother the ratio of the optimal frequency halfwidth to the optimal time halfwidth satisfies h_f h_t partial_t p theta partial_fp theta since the expected loss depends on the unknown evolutionary spectra we initially estimate partial_tp theta2 and partial_fp theta2 using a higher order kernel smoothers and then substitute the estimated derivatives into the expected loss criteria
|
[['complex', 'demodulation', 'of', 'evolutionary', 'spectra', 'is', 'formulated', 'as', 'a', 'twodimensional', 'kernel', 'smoother', 'in', 'the', 'timefrequency', 'domain', 'in', 'the', 'first', 'stage', 'a', 'tapered', 'fourier', 'transform', 'y_nuft', 'is', 'calculated', 'second', 'the', 'logspectral', 'estimate', 'hattheta_nuft', 'equiv', 'lny_nuft2', 'is', 'smoothed', 'as', 'the', 'characteristic', 'widths', 'of', 'the', 'kernel', 'smoother', 'increase', 'the', 'bias', 'from', 'temporal', 'and', 'frequency', 'averaging', 'increases', 'while', 'the', 'variance', 'decreases', 'the', 'demodulation', 'parameters', 'such', 'as', 'the', 'order', 'length', 'and', 'bandwidth', 'of', 'spectral', 'taper', 'and', 'the', 'kernel', 'smoother', 'are', 'determined', 'by', 'minimizing', 'the', 'expected', 'error', 'for', 'wellresolved', 'evolutionary', 'spectra', 'the', 'optimal', 'taper', 'length', 'is', 'a', 'small', 'fraction', 'of', 'the', 'optimal', 'kernel', 'halfwidth', 'the', 'optimal', 'frequency', 'bandwidth', 'w', 'for', 'the', 'spectral', 'window', 'scales', 'as', 'w2', 'approx', 'lambda_f', 'tau', 'where', 'tau', 'is', 'the', 'characteristic', 'time', 'and', 'lambda_f', 'is', 'the', 'characteristic', 'frequency', 'scalelength', 'in', 'contrast', 'the', 'optimal', 'halfwidths', 'for', 'the', 'second', 'stage', 'kernel', 'smoother', 'scales', 'as', 'h', 'approx', '1tau', 'lambda_f1', 'over', 'p2', 'where', 'p', 'is', 'the', 'order', 'of', 'the', 'kernel', 'smoother', 'the', 'ratio', 'of', 'the', 'optimal', 'frequency', 'halfwidth', 'to', 'the', 'optimal', 'time', 'halfwidth', 'satisfies', 'h_f', 'h_t', 'partial_t', 'p', 'theta', 'partial_fp', 'theta', 'since', 'the', 'expected', 'loss', 'depends', 'on', 'the', 'unknown', 'evolutionary', 'spectra', 'we', 'initially', 'estimate', 'partial_tp', 'theta2', 'and', 'partial_fp', 'theta2', 'using', 'a', 'higher', 'order', 'kernel', 'smoothers', 'and', 'then', 'substitute', 'the', 'estimated', 'derivatives', 'into', 'the', 'expected', 'loss', 'criteria']]
|
[-0.1113263233518689, 0.11594539303286462, -0.07458808309500023, 0.1016427171001635, -0.0660748932842571, -0.13277252062597303, 0.013878339415734247, 0.40729159106947666, -0.3165443331270599, -0.2527455004337843, 0.1103384703113052, -0.24918667909384953, -0.06490896452082284, 0.1854115226121601, 0.010266576064888868, 0.09511761258743556, -0.0017276346593597296, 0.04672800204808833, -0.1046928577228809, -0.17692675103783828, 0.2642106910439042, 0.10612881658564202, 0.23803586265219762, -0.03198721243580342, 0.08919499707546565, -0.0028828942507394765, -0.03772192418178783, -0.06736516048624595, -0.18009768911443724, 0.014165423902692181, 0.2158177623209442, 0.0433572264927633, 0.3243713867435656, -0.2973358897575279, -0.1683634403945491, 0.12485123908499919, 0.17560090401583342, -0.024283942352694522, 0.06712037970434118, -0.20897913846823543, 0.08813875386638954, -0.0884649570867659, -0.11465972181557134, 0.029478527447623706, 0.06051453952199208, 0.03716306747334991, -0.363371179171718, 0.1467117398555418, 0.05295041821767936, 0.01158425459029651, -0.06524325014981856, -0.19642698414402432, -0.02237522420312029, 0.0631794863228345, 0.029456596359343147, 0.07385954000447684, 0.1420596932080611, -0.10633315571634523, -0.011271997984258993, 0.32532804445847685, -0.11710875263693513, -0.15441340662462355, 0.0797195081088443, -0.15711005812852025, -0.013929806472900748, 0.1848663754489199, 0.15786251788417172, 0.13437429731158484, -0.05699876761571089, 0.10234140100171973, 0.0244768603697954, 0.23674616791736702, 0.12207850601551777, 0.05324032006434875, 0.07798960257902521, 0.1287946492470432, 0.11621126970120632, 0.13186221442641782, -0.18944837514306465, -0.05968841010045334, -0.31139966451775025, -0.150018590839008, -0.2526548753122541, 0.03924653484569032, -0.1758943272146251, -0.13695855430525608, 0.4058950244919351, 0.07415659955816832, 0.256731885420804, 0.1266034521153289, 0.30048852632430817, 0.22121313984890809, 0.07003752156179142, 0.08300267501116389, 0.18142344619580866, 0.13193376945783522, 0.08942730636347436, -0.27652895552397816, 0.07156148144403601, 0.07744401422592045]
|
1,803.03898
|
Posterior Contraction and Credible Sets for Filaments of Regression
Functions
|
A filament consists of local maximizers of a smooth function $f$ when moving
in a certain direction. A filamentary structure is an important feature of the
shape of an object and is also considered as an important lower dimensional
characterization of multivariate data. There have been some recent theoretical
studies of filaments in the nonparametric kernel density estimation context.
This paper supplements the current literature in two ways. First, we provide a
Bayesian approach to the filament estimation in regression context and study
the posterior contraction rates using a finite random series of B-splines
basis. Compared with the kernel-estimation method, this has a theoretical
advantage as the bias can be better controlled when the function is smoother,
which allows obtaining better rates. Assuming that $f: \mathbb{R}^2 \mapsto
\mathbb{R}$ belongs to an isotropic H\"{o}lder class of order $\alpha \geq 4$,
with the optimal choice of smoothing parameters, the posterior contraction
rates for the filament points on some appropriately defined integral curves and
for the Hausdorff distance of the filament are both $(n/\log
n)^{(2-\alpha)/(2(1+\alpha))}$. Secondly, we provide a way to construct a
credible set with sufficient frequentist coverage for the filaments. We
demonstrate the success of our proposed method in simulations and one
application to earthquake data.
|
math.ST stat.TH
|
a filament consists of local maximizers of a smooth function f when moving in a certain direction a filamentary structure is an important feature of the shape of an object and is also considered as an important lower dimensional characterization of multivariate data there have been some recent theoretical studies of filaments in the nonparametric kernel density estimation context this paper supplements the current literature in two ways first we provide a bayesian approach to the filament estimation in regression context and study the posterior contraction rates using a finite random series of bsplines basis compared with the kernelestimation method this has a theoretical advantage as the bias can be better controlled when the function is smoother which allows obtaining better rates assuming that f mathbbr2 mapsto mathbbr belongs to an isotropic holder class of order alpha geq 4 with the optimal choice of smoothing parameters the posterior contraction rates for the filament points on some appropriately defined integral curves and for the hausdorff distance of the filament are both nlog n2alpha21alpha secondly we provide a way to construct a credible set with sufficient frequentist coverage for the filaments we demonstrate the success of our proposed method in simulations and one application to earthquake data
|
[['a', 'filament', 'consists', 'of', 'local', 'maximizers', 'of', 'a', 'smooth', 'function', 'f', 'when', 'moving', 'in', 'a', 'certain', 'direction', 'a', 'filamentary', 'structure', 'is', 'an', 'important', 'feature', 'of', 'the', 'shape', 'of', 'an', 'object', 'and', 'is', 'also', 'considered', 'as', 'an', 'important', 'lower', 'dimensional', 'characterization', 'of', 'multivariate', 'data', 'there', 'have', 'been', 'some', 'recent', 'theoretical', 'studies', 'of', 'filaments', 'in', 'the', 'nonparametric', 'kernel', 'density', 'estimation', 'context', 'this', 'paper', 'supplements', 'the', 'current', 'literature', 'in', 'two', 'ways', 'first', 'we', 'provide', 'a', 'bayesian', 'approach', 'to', 'the', 'filament', 'estimation', 'in', 'regression', 'context', 'and', 'study', 'the', 'posterior', 'contraction', 'rates', 'using', 'a', 'finite', 'random', 'series', 'of', 'bsplines', 'basis', 'compared', 'with', 'the', 'kernelestimation', 'method', 'this', 'has', 'a', 'theoretical', 'advantage', 'as', 'the', 'bias', 'can', 'be', 'better', 'controlled', 'when', 'the', 'function', 'is', 'smoother', 'which', 'allows', 'obtaining', 'better', 'rates', 'assuming', 'that', 'f', 'mathbbr2', 'mapsto', 'mathbbr', 'belongs', 'to', 'an', 'isotropic', 'holder', 'class', 'of', 'order', 'alpha', 'geq', '4', 'with', 'the', 'optimal', 'choice', 'of', 'smoothing', 'parameters', 'the', 'posterior', 'contraction', 'rates', 'for', 'the', 'filament', 'points', 'on', 'some', 'appropriately', 'defined', 'integral', 'curves', 'and', 'for', 'the', 'hausdorff', 'distance', 'of', 'the', 'filament', 'are', 'both', 'nlog', 'n2alpha21alpha', 'secondly', 'we', 'provide', 'a', 'way', 'to', 'construct', 'a', 'credible', 'set', 'with', 'sufficient', 'frequentist', 'coverage', 'for', 'the', 'filaments', 'we', 'demonstrate', 'the', 'success', 'of', 'our', 'proposed', 'method', 'in', 'simulations', 'and', 'one', 'application', 'to', 'earthquake', 'data']]
|
[-0.0902558002538355, 0.019413000489114852, -0.09934481288182545, 0.06448513618785098, -0.07422687088740357, -0.07971353450643238, 0.028068286341384485, 0.42488012134368197, -0.2545014800402918, -0.2546922945431227, 0.10886056946643302, -0.22701441151844945, -0.13489781038863172, 0.21376476762472224, -0.06351508164842581, 0.0854428907434268, 0.03731958457989058, 0.03131652378455364, -0.08615616290472228, -0.27094146589980245, 0.29972216564923376, 0.054476343363688645, 0.2800424655554174, -0.011054574112807001, 0.10227373438621205, -0.011376818589260573, -0.025289789707287503, 0.01434117422572204, -0.19166150700497778, 0.1401660074858371, 0.23275860789543926, 0.1206066209738019, 0.3378190085592363, -0.3765496388169492, -0.2276171433069546, 0.13743202821833306, 0.16176839876378624, 0.054460618600795235, -0.044018455108356995, -0.2710553916398289, 0.07866522604645473, -0.15144131364865146, -0.13521211504651776, -0.06067328372961048, 0.030388818359864976, 0.04985974421908189, -0.3320168183071039, 0.09848650178417284, 0.07178349572284322, 0.05487312500025582, -0.05791033060190135, -0.10931499753138188, 0.0001506513865490265, 0.10856368043775363, 0.04284424383509813, 0.08612954927484501, 0.11624993208630625, -0.11122529823471376, -0.08575954316229803, 0.32646542145719226, -0.06388399495830384, -0.2185654419696812, 0.15539863611126475, -0.13880237183399416, -0.14820458098163306, 0.1259915696759823, 0.15303668469245651, 0.11831638411953678, -0.1365188741630684, 0.08815047092474262, -0.06849254225180003, 0.1350673190340987, 0.040055946623585345, -0.018417761764337716, 0.16232166786590968, 0.17490426071557064, 0.12773211268767465, 0.14575232761072482, -0.1245211705443876, -0.06491027955135578, -0.3293367670252552, -0.15482209507706277, -0.17470525145952778, 0.01627082637169403, -0.15016364490841586, -0.1900454610884373, 0.38342862879040795, 0.14200037108416544, 0.24492042232763592, 0.08933548742889202, 0.27055483778911127, 0.1114096930156619, 0.02291676544313654, 0.08289393082747391, 0.18069815205259873, 0.1327506412724446, 0.029442436853194323, -0.13938208369840982, 0.09403248187762414, 0.0737840595616147]
|
1,803.03899
|
Piecewise Convex Function Estimation: Pilot Estimators
|
Given noisy data, function estimation is considered when the unknown function
is known a priori to consist of a small number of regions where the function is
either convex or concave. When the number of regions is unknown, the model
selection problem is to determine the number of convexity change points. For
kernel estimates in Gaussian noise, the number of false change points is
evaluated as a function of the smoothing parameter. To ensure that the number
of false convexity change points tends to zero, the smoothing level must be
larger than is generically optimal for minimizing the mean integrated square
error (MISE). A two-stage estimator is proposed and shown to achieve the
optimal rate of convergence of the MISE. In the first-stage, the number and
location of the change points is estimated using strong smoothing. In the
second-stage, a constrained smoothing spline fit is performed with the
smoothing level chosen to minimize the MISE. The imposed constraint is that a
single change point occur in a region about each empirical change point from
the first-stage estimate. This constraint is equivalent to the requirement that
the third derivative of the second-stage estimate have a single sign in a small
neighborhood about each first-stage change point. The change points from the
second-stage are in a neighborhood of the first-stage change points, but need
not be at the identical locations.
|
stat.ME eess.SP math.ST stat.TH
|
given noisy data function estimation is considered when the unknown function is known a priori to consist of a small number of regions where the function is either convex or concave when the number of regions is unknown the model selection problem is to determine the number of convexity change points for kernel estimates in gaussian noise the number of false change points is evaluated as a function of the smoothing parameter to ensure that the number of false convexity change points tends to zero the smoothing level must be larger than is generically optimal for minimizing the mean integrated square error mise a twostage estimator is proposed and shown to achieve the optimal rate of convergence of the mise in the firststage the number and location of the change points is estimated using strong smoothing in the secondstage a constrained smoothing spline fit is performed with the smoothing level chosen to minimize the mise the imposed constraint is that a single change point occur in a region about each empirical change point from the firststage estimate this constraint is equivalent to the requirement that the third derivative of the secondstage estimate have a single sign in a small neighborhood about each firststage change point the change points from the secondstage are in a neighborhood of the firststage change points but need not be at the identical locations
|
[['given', 'noisy', 'data', 'function', 'estimation', 'is', 'considered', 'when', 'the', 'unknown', 'function', 'is', 'known', 'a', 'priori', 'to', 'consist', 'of', 'a', 'small', 'number', 'of', 'regions', 'where', 'the', 'function', 'is', 'either', 'convex', 'or', 'concave', 'when', 'the', 'number', 'of', 'regions', 'is', 'unknown', 'the', 'model', 'selection', 'problem', 'is', 'to', 'determine', 'the', 'number', 'of', 'convexity', 'change', 'points', 'for', 'kernel', 'estimates', 'in', 'gaussian', 'noise', 'the', 'number', 'of', 'false', 'change', 'points', 'is', 'evaluated', 'as', 'a', 'function', 'of', 'the', 'smoothing', 'parameter', 'to', 'ensure', 'that', 'the', 'number', 'of', 'false', 'convexity', 'change', 'points', 'tends', 'to', 'zero', 'the', 'smoothing', 'level', 'must', 'be', 'larger', 'than', 'is', 'generically', 'optimal', 'for', 'minimizing', 'the', 'mean', 'integrated', 'square', 'error', 'mise', 'a', 'twostage', 'estimator', 'is', 'proposed', 'and', 'shown', 'to', 'achieve', 'the', 'optimal', 'rate', 'of', 'convergence', 'of', 'the', 'mise', 'in', 'the', 'firststage', 'the', 'number', 'and', 'location', 'of', 'the', 'change', 'points', 'is', 'estimated', 'using', 'strong', 'smoothing', 'in', 'the', 'secondstage', 'a', 'constrained', 'smoothing', 'spline', 'fit', 'is', 'performed', 'with', 'the', 'smoothing', 'level', 'chosen', 'to', 'minimize', 'the', 'mise', 'the', 'imposed', 'constraint', 'is', 'that', 'a', 'single', 'change', 'point', 'occur', 'in', 'a', 'region', 'about', 'each', 'empirical', 'change', 'point', 'from', 'the', 'firststage', 'estimate', 'this', 'constraint', 'is', 'equivalent', 'to', 'the', 'requirement', 'that', 'the', 'third', 'derivative', 'of', 'the', 'secondstage', 'estimate', 'have', 'a', 'single', 'sign', 'in', 'a', 'small', 'neighborhood', 'about', 'each', 'firststage', 'change', 'point', 'the', 'change', 'points', 'from', 'the', 'secondstage', 'are', 'in', 'a', 'neighborhood', 'of', 'the', 'firststage', 'change', 'points', 'but', 'need', 'not', 'be', 'at', 'the', 'identical', 'locations']]
|
[-0.10986528390652925, 0.04557537008485381, -0.07272024304358893, 0.08053879564926192, -0.07638011687525074, -0.1324239991229485, 0.10443132312196356, 0.33699254439980314, -0.29755396450657334, -0.3120305833075882, 0.14443368025802142, -0.2773968583552918, -0.10687040542037912, 0.13793859526866295, -0.1146862730191124, 0.06063018260490999, 0.03359322987901243, 0.08736128311424532, -0.09646007773029085, -0.29057139137518806, 0.2976670808050569, 0.0654311113574199, 0.26894031806130025, -0.020596478797399374, 0.12469768931368251, 0.0064607256351512645, -0.0007755259953627134, 0.018587559173618883, -0.09241136337735506, 0.07622203350694147, 0.21081907730937624, 0.09869037051235832, 0.35699061787760766, -0.33853176604188456, -0.20556723239235253, 0.19053937225212475, 0.10711181711756804, 0.06418505957730017, 0.01330051998037992, -0.21304681651772148, 0.13056001662105127, -0.07732547652037618, -0.12372470794351804, -0.00795829343239842, -0.03307931017173503, 0.058928865575836153, -0.36885642120818884, 0.08283592856554478, 0.012449550797770681, 0.04836715733338343, -0.04570418444825663, -0.1350222655751726, -0.039361449875542076, 0.13438577756204995, 0.08065116377047002, 0.09112913150359721, 0.1606149179278873, -0.11376426133772424, -0.029451580022220713, 0.3234272567481783, -0.043267770943330425, -0.26641664305995955, 0.11140167132671513, -0.14312371950884545, -0.08808333036416259, 0.18979300204868546, 0.17267833831066495, 0.09094386487962319, -0.1355122477986713, 0.06516670641946819, -0.016985325318385373, 0.19621822289627744, 0.0563214253904829, -0.003954444117353935, 0.17703297839238585, 0.14705334223700656, 0.17365637229114214, 0.12208981624816691, -0.1412461828665089, -0.08988426375129309, -0.3689256732989299, -0.12594927907635442, -0.2509082540330526, -0.007942173708566739, -0.12779769777938654, -0.2027671380695354, 0.373193586402442, 0.13845760317870595, 0.250461492732396, 0.053924767345418796, 0.2833773118215041, 0.19809532096061097, 0.06062094044663306, 0.09098616582668272, 0.2337948254803849, 0.04844554771440463, 0.02122361445084639, -0.21249985733486124, 0.13466684535153928, 0.05533622521110565]
|
1,803.039
|
Transfer Learning with Bellwethers to find Good Configurations
|
As software systems grow in complexity, the space of possible configurations
grows exponentially. Within this increasing complexity, developers,
maintainers, and users cannot keep track of the interactions between all the
various configuration options. Finding the optimally performing configuration
of a software system for a given setting is challenging. Recent approaches
address this challenge by learning performance models based on a sample set of
configurations. However, collecting enough data on enough sample configurations
can be very expensive since each such sample requires configuring, compiling
and executing the entire system against a complex test suite. The central
insight of this paper is that choosing a suitable source (a.k.a. "bellwether")
to learn from, plus a simple transfer learning scheme will often outperform
much more complex transfer learning methods. Using this insight, this paper
proposes BEETLE, a novel bellwether based transfer learning scheme, which can
identify a suitable source and use it to find near-optimal configurations of a
software system. BEETLE significantly reduces the cost (in terms of the number
of measurements of sample configuration) to build performance models. We
evaluate our approach with 61 scenarios based on 5 software systems and
demonstrate that BEETLE is beneficial in all cases. This approach offers a new
highwater mark in configuring software systems. Specifically, BEETLE can find
configurations that are as good or better as those found by anything else while
requiring only 1/7th of the evaluations needed by the state-of-the-art.
|
cs.SE
|
as software systems grow in complexity the space of possible configurations grows exponentially within this increasing complexity developers maintainers and users cannot keep track of the interactions between all the various configuration options finding the optimally performing configuration of a software system for a given setting is challenging recent approaches address this challenge by learning performance models based on a sample set of configurations however collecting enough data on enough sample configurations can be very expensive since each such sample requires configuring compiling and executing the entire system against a complex test suite the central insight of this paper is that choosing a suitable source aka bellwether to learn from plus a simple transfer learning scheme will often outperform much more complex transfer learning methods using this insight this paper proposes beetle a novel bellwether based transfer learning scheme which can identify a suitable source and use it to find nearoptimal configurations of a software system beetle significantly reduces the cost in terms of the number of measurements of sample configuration to build performance models we evaluate our approach with 61 scenarios based on 5 software systems and demonstrate that beetle is beneficial in all cases this approach offers a new highwater mark in configuring software systems specifically beetle can find configurations that are as good or better as those found by anything else while requiring only 17th of the evaluations needed by the stateoftheart
|
[['as', 'software', 'systems', 'grow', 'in', 'complexity', 'the', 'space', 'of', 'possible', 'configurations', 'grows', 'exponentially', 'within', 'this', 'increasing', 'complexity', 'developers', 'maintainers', 'and', 'users', 'can', 'not', 'keep', 'track', 'of', 'the', 'interactions', 'between', 'all', 'the', 'various', 'configuration', 'options', 'finding', 'the', 'optimally', 'performing', 'configuration', 'of', 'a', 'software', 'system', 'for', 'a', 'given', 'setting', 'is', 'challenging', 'recent', 'approaches', 'address', 'this', 'challenge', 'by', 'learning', 'performance', 'models', 'based', 'on', 'a', 'sample', 'set', 'of', 'configurations', 'however', 'collecting', 'enough', 'data', 'on', 'enough', 'sample', 'configurations', 'can', 'be', 'very', 'expensive', 'since', 'each', 'such', 'sample', 'requires', 'configuring', 'compiling', 'and', 'executing', 'the', 'entire', 'system', 'against', 'a', 'complex', 'test', 'suite', 'the', 'central', 'insight', 'of', 'this', 'paper', 'is', 'that', 'choosing', 'a', 'suitable', 'source', 'aka', 'bellwether', 'to', 'learn', 'from', 'plus', 'a', 'simple', 'transfer', 'learning', 'scheme', 'will', 'often', 'outperform', 'much', 'more', 'complex', 'transfer', 'learning', 'methods', 'using', 'this', 'insight', 'this', 'paper', 'proposes', 'beetle', 'a', 'novel', 'bellwether', 'based', 'transfer', 'learning', 'scheme', 'which', 'can', 'identify', 'a', 'suitable', 'source', 'and', 'use', 'it', 'to', 'find', 'nearoptimal', 'configurations', 'of', 'a', 'software', 'system', 'beetle', 'significantly', 'reduces', 'the', 'cost', 'in', 'terms', 'of', 'the', 'number', 'of', 'measurements', 'of', 'sample', 'configuration', 'to', 'build', 'performance', 'models', 'we', 'evaluate', 'our', 'approach', 'with', '61', 'scenarios', 'based', 'on', '5', 'software', 'systems', 'and', 'demonstrate', 'that', 'beetle', 'is', 'beneficial', 'in', 'all', 'cases', 'this', 'approach', 'offers', 'a', 'new', 'highwater', 'mark', 'in', 'configuring', 'software', 'systems', 'specifically', 'beetle', 'can', 'find', 'configurations', 'that', 'are', 'as', 'good', 'or', 'better', 'as', 'those', 'found', 'by', 'anything', 'else', 'while', 'requiring', 'only', '17th', 'of', 'the', 'evaluations', 'needed', 'by', 'the', 'stateoftheart']]
|
[-0.09933999173739783, 0.029012236886231575, -0.07587263267807923, 0.05984057084227107, -0.08928730563749954, -0.18220028692809076, 0.0716986023698602, 0.3829811632996267, -0.2213739846690984, -0.38429236018209384, 0.10494059546242894, -0.23971491414951002, -0.15675226901460565, 0.239789015784173, -0.08938240514457979, 0.05966524992106577, 0.13023783497796473, -0.0019483510414690915, -0.06829251886307956, -0.2746738045929213, 0.29876695742612325, 0.08122687696645005, 0.3056733323324282, -0.01025853778819664, 0.0869803835792759, -0.0007658805757350588, -0.013657342964167691, 0.022565423253096108, -0.060466174805758596, 0.1438711750403962, 0.29567925319297195, 0.21154862487039003, 0.33482667046867437, -0.39801506247404483, -0.187519105554803, 0.09260562732040051, 0.16698254654243178, 0.11054958640676686, -0.0369254614360817, -0.2456707837932222, 0.0872841167729348, -0.20216706072639326, -0.07749674829133486, -0.12052403986789444, -0.013149318772652265, 0.02080191568924327, -0.2815808164117605, -0.025733038518672525, 0.030321859588878133, 0.03494656245392033, -0.01571886525814958, -0.10566911842896982, 0.021979801900269488, 0.16442473672460606, 0.008737729130297016, 0.055854777972237604, 0.14158249717729632, -0.12799684447923876, -0.11862602634246903, 0.3951666119816255, -0.00429169636444678, -0.19941591244917048, 0.23086082460891488, -0.053802457277000074, -0.13401156116939955, 0.1276905641760835, 0.21511689438760848, 0.13833635796050905, -0.18107733145894847, 0.05990398450561215, -0.004138094373047352, 0.21747293269239026, 0.025003675662446767, 0.007197161389601622, 0.19517253498325787, 0.22903507987384575, 0.07013668716042619, 0.14310740418406598, -0.05851583283145959, -0.08626744319646328, -0.21915415450101877, -0.1340187232156079, -0.1709822035084826, 0.018030903618883883, -0.057606434746264576, -0.1502970835375644, 0.35824219393651807, 0.2023268568929348, 0.18806473300910664, 0.07198629804129192, 0.33708270284805003, 0.02911022104628994, 0.0943988326471299, 0.11781103129624941, 0.1818995482359334, -0.007012111331154671, 0.11897976956452574, -0.18689857987130565, 0.10205998272936934, -0.0048027769287543026]
|
1,803.03901
|
Piecewise Convex Function Estimation: Representations, Duality and Model
Selection
|
We consider spline estimates which preserve prescribed piecewise convex
properties of the unknown function. A robust version of the penalized
likelihood is given and shown to correspond to a variable halfwidth kernel
smoother where the halfwidth adaptively decreases in regions of rapid change of
the unknown function. When the convexity change points are prescribed, we
derive representation results and smoothness properties of the estimates. A
dual formulation is given which reduces the estimate is reduced to a finite
dimensional convex optimization in the dual space.
|
stat.ME cs.SY eess.SP eess.SY math.ST physics.data-an stat.TH
|
we consider spline estimates which preserve prescribed piecewise convex properties of the unknown function a robust version of the penalized likelihood is given and shown to correspond to a variable halfwidth kernel smoother where the halfwidth adaptively decreases in regions of rapid change of the unknown function when the convexity change points are prescribed we derive representation results and smoothness properties of the estimates a dual formulation is given which reduces the estimate is reduced to a finite dimensional convex optimization in the dual space
|
[['we', 'consider', 'spline', 'estimates', 'which', 'preserve', 'prescribed', 'piecewise', 'convex', 'properties', 'of', 'the', 'unknown', 'function', 'a', 'robust', 'version', 'of', 'the', 'penalized', 'likelihood', 'is', 'given', 'and', 'shown', 'to', 'correspond', 'to', 'a', 'variable', 'halfwidth', 'kernel', 'smoother', 'where', 'the', 'halfwidth', 'adaptively', 'decreases', 'in', 'regions', 'of', 'rapid', 'change', 'of', 'the', 'unknown', 'function', 'when', 'the', 'convexity', 'change', 'points', 'are', 'prescribed', 'we', 'derive', 'representation', 'results', 'and', 'smoothness', 'properties', 'of', 'the', 'estimates', 'a', 'dual', 'formulation', 'is', 'given', 'which', 'reduces', 'the', 'estimate', 'is', 'reduced', 'to', 'a', 'finite', 'dimensional', 'convex', 'optimization', 'in', 'the', 'dual', 'space']]
|
[-0.06155802417299984, 0.05242516931475085, -0.09351709296598154, 0.07461244792485719, -0.11607809344525723, -0.1379364176708109, 0.0352086726548698, 0.37731128352529864, -0.32753272170255726, -0.23523959190420368, 0.14503223507884233, -0.2449005749405307, -0.14204073808334, 0.12886938467238318, -0.147306016712066, 0.09554313042146319, 0.02068019367973594, 0.0395574856111232, -0.20315352695829728, -0.2453248474829118, 0.2981081002117956, 0.016613240813946023, 0.2528190636596478, -0.001450541232000379, 0.16266877641353536, 0.03552120103062514, -0.03946092970231, 0.017957760167294456, -0.17610678853576675, 0.14142260103869964, 0.22207094028263408, 0.12438089661300182, 0.34406851766740576, -0.3433611833572607, -0.20871200890225522, 0.16258154457489796, 0.10102037281784064, 0.017754002537249642, 0.026340394280850887, -0.22240013705895229, 0.08895468851825332, -0.07435711578685134, -0.16609745566349696, -0.04566980175235692, -0.02338595173924285, 0.06052297692581573, -0.3734256806728594, 0.08380869677399888, 0.030735089136835408, 0.025735926146016403, -0.1397367378587232, -0.10363615800023955, -0.03906120839802658, 0.04903422523296767, 0.04743795499671251, 0.09850983931956922, 0.1366951482699198, -0.11937534089366261, -0.023808441094725446, 0.3088350633279119, -0.05000342588104746, -0.30598460738273225, 0.13895326366867214, -0.13704091137384666, -0.08958594027139685, 0.1648142692468622, 0.20302014457445372, 0.16171918040798866, -0.10741173958984505, 0.10535845496719155, -0.05752572479712612, 0.14466685384292813, 0.04971727949621923, 0.0204739270512672, 0.11000566431321204, 0.11651995220112012, 0.18281547092996975, 0.20196900730130865, -0.07972044186009204, -0.11396973221562803, -0.3446408504538019, -0.1378444400122937, -0.23948725587140549, -0.02061663316014935, -0.16700216017848374, -0.24101188485887284, 0.40315450771218714, 0.0792450633358813, 0.25624557102427764, 0.09749948743128163, 0.2558182243476896, 0.21524152659318027, 0.038250590378747264, 0.1027559550205136, 0.19620224780348294, 0.1528254761470153, -0.008320458353880573, -0.22327496626907412, 0.1353672566577135, 0.13306948152535103]
|
1,803.03902
|
Decay Rate of Electroweak Vacuum in the Standard Model and Beyond
|
We perform a precise calculation of the decay rate of the electroweak vacuum
in the standard model as well as in models beyond the standard model. We use a
recently-developed technique to calculate the decay rate of a false vacuum,
which provides a gauge invariant calculation of the decay rate at the one-loop
level. We give a prescription to take into account the zero modes in
association with translational, dilatational, and gauge symmetries. We
calculate the decay rate per unit volume, $\gamma$, by using an analytic
formula. The decay rate of the electroweak vacuum in the standard model is
estimated to be $\log_{10}\gamma\times{\rm Gyr~Gpc^3} =
-582^{+40~+184~+144~+2}_{-45~-329~-218~-1}$, where the 1st, 2nd, 3rd, and 4th
errors are due to the uncertainties of the Higgs mass, the top quark mass, the
strong coupling constant and the choice of the renormalization scale,
respectively. The analytic formula of the decay rate, as well as its fitting
formula given in this paper, is also applicable to models that exhibit a
classical scale invariance at a high energy scale. As an example, we consider
extra fermions that couple to the standard model Higgs boson, and discuss their
effects on the decay rate of the electroweak vacuum.
|
hep-ph
|
we perform a precise calculation of the decay rate of the electroweak vacuum in the standard model as well as in models beyond the standard model we use a recentlydeveloped technique to calculate the decay rate of a false vacuum which provides a gauge invariant calculation of the decay rate at the oneloop level we give a prescription to take into account the zero modes in association with translational dilatational and gauge symmetries we calculate the decay rate per unit volume gamma by using an analytic formula the decay rate of the electroweak vacuum in the standard model is estimated to be log_10gammatimesrm gyrgpc3 582401841442_453292181 where the 1st 2nd 3rd and 4th errors are due to the uncertainties of the higgs mass the top quark mass the strong coupling constant and the choice of the renormalization scale respectively the analytic formula of the decay rate as well as its fitting formula given in this paper is also applicable to models that exhibit a classical scale invariance at a high energy scale as an example we consider extra fermions that couple to the standard model higgs boson and discuss their effects on the decay rate of the electroweak vacuum
|
[['we', 'perform', 'a', 'precise', 'calculation', 'of', 'the', 'decay', 'rate', 'of', 'the', 'electroweak', 'vacuum', 'in', 'the', 'standard', 'model', 'as', 'well', 'as', 'in', 'models', 'beyond', 'the', 'standard', 'model', 'we', 'use', 'a', 'recentlydeveloped', 'technique', 'to', 'calculate', 'the', 'decay', 'rate', 'of', 'a', 'false', 'vacuum', 'which', 'provides', 'a', 'gauge', 'invariant', 'calculation', 'of', 'the', 'decay', 'rate', 'at', 'the', 'oneloop', 'level', 'we', 'give', 'a', 'prescription', 'to', 'take', 'into', 'account', 'the', 'zero', 'modes', 'in', 'association', 'with', 'translational', 'dilatational', 'and', 'gauge', 'symmetries', 'we', 'calculate', 'the', 'decay', 'rate', 'per', 'unit', 'volume', 'gamma', 'by', 'using', 'an', 'analytic', 'formula', 'the', 'decay', 'rate', 'of', 'the', 'electroweak', 'vacuum', 'in', 'the', 'standard', 'model', 'is', 'estimated', 'to', 'be', 'log_10gammatimesrm', 'gyrgpc3', '582401841442_453292181', 'where', 'the', '1st', '2nd', '3rd', 'and', '4th', 'errors', 'are', 'due', 'to', 'the', 'uncertainties', 'of', 'the', 'higgs', 'mass', 'the', 'top', 'quark', 'mass', 'the', 'strong', 'coupling', 'constant', 'and', 'the', 'choice', 'of', 'the', 'renormalization', 'scale', 'respectively', 'the', 'analytic', 'formula', 'of', 'the', 'decay', 'rate', 'as', 'well', 'as', 'its', 'fitting', 'formula', 'given', 'in', 'this', 'paper', 'is', 'also', 'applicable', 'to', 'models', 'that', 'exhibit', 'a', 'classical', 'scale', 'invariance', 'at', 'a', 'high', 'energy', 'scale', 'as', 'an', 'example', 'we', 'consider', 'extra', 'fermions', 'that', 'couple', 'to', 'the', 'standard', 'model', 'higgs', 'boson', 'and', 'discuss', 'their', 'effects', 'on', 'the', 'decay', 'rate', 'of', 'the', 'electroweak', 'vacuum']]
|
[-0.08360585172015887, 0.17385303516982673, -0.06738499386522633, 0.13463269002938597, -0.041533994370211776, -0.1225872172603909, 0.07125835160378557, 0.2970478097597758, -0.24391281305072018, -0.2805629041045904, 0.09461322291992987, -0.23625575558951076, -0.04468962780128305, 0.1639943588572817, 0.03387133980122132, 0.06865685000591792, 0.014735829174661865, 0.07424882508288973, -0.08810507323569021, -0.22684476899269682, 0.29200356703920244, 0.09595525486824605, 0.25817903659115427, 0.09583904228937358, 0.09431719077894321, -0.008874328098952389, -0.029865876267640253, -0.08223184067755937, -0.15030830543143495, 0.08814708819696442, 0.11051822621617854, 0.05888723415346482, 0.20462762500660925, -0.36646856507047626, -0.15563853135666786, 0.11725395645838804, 0.11993606047322734, 0.151783555204001, -0.04962555911117353, -0.26562497137735286, 0.09260507919348013, -0.21585212842537424, -0.1363304472492578, -0.07713949695492212, -0.0395037334997398, -0.052349951090768745, -0.31510253869331417, 0.14177828950147767, -0.012784017838585453, 0.015117019911607106, -0.04110801812941925, -0.09113606926149283, -0.035984887063312224, 0.10366112478793814, 0.15790496486125705, 0.0405041499023075, 0.143645617689412, -0.17091964155268402, -0.12982166492833924, 0.430746612072182, -0.15998313771321987, -0.20373914488949454, 0.12612244917843968, -0.16689225162785404, -0.1037306015785688, 0.14115585459587285, 0.20359171873722703, 0.10083651784091041, -0.13149184715241577, 0.15274221582385974, 0.010289343391867498, 0.16960746887116096, 0.03975163468350776, 0.04651652164518451, 0.19808815182306064, 0.14185471722903925, 0.0013772948728635525, 0.108556295655823, -0.0876835303249745, -0.10170453597719853, -0.42037475967827515, -0.17670778438974266, -0.11764551626327328, 0.051171912040370394, -0.07958367297766157, -0.16335108776887258, 0.39379068441832293, 0.12432314306109522, 0.24548266587826686, 0.08129181133236928, 0.3054029819567521, 0.1688853873602616, 0.11661271036435396, 0.01930216765986421, 0.29986966193104403, 0.14467858268210712, 0.07433494543656707, -0.25231338204839865, -0.003005037251382302, 0.11867557926795995]
|
1,803.03903
|
Piecewise Convex Function Estimation and Model Selection
|
Given noisy data, function estimation is considered when the unknown function
is known apriori to consist of a small number of regions where the function is
either convex or concave. When the regions are known apriori, the estimate is
reduced to a finite dimensional convex optimization in the dual space. When the
number of regions is unknown, the model selection problem is to determine the
number of convexity change points. We use a pilot estimator based on the
expected number of false inflection points.
|
stat.ME cs.LG eess.SP math.ST physics.data-an stat.TH
|
given noisy data function estimation is considered when the unknown function is known apriori to consist of a small number of regions where the function is either convex or concave when the regions are known apriori the estimate is reduced to a finite dimensional convex optimization in the dual space when the number of regions is unknown the model selection problem is to determine the number of convexity change points we use a pilot estimator based on the expected number of false inflection points
|
[['given', 'noisy', 'data', 'function', 'estimation', 'is', 'considered', 'when', 'the', 'unknown', 'function', 'is', 'known', 'apriori', 'to', 'consist', 'of', 'a', 'small', 'number', 'of', 'regions', 'where', 'the', 'function', 'is', 'either', 'convex', 'or', 'concave', 'when', 'the', 'regions', 'are', 'known', 'apriori', 'the', 'estimate', 'is', 'reduced', 'to', 'a', 'finite', 'dimensional', 'convex', 'optimization', 'in', 'the', 'dual', 'space', 'when', 'the', 'number', 'of', 'regions', 'is', 'unknown', 'the', 'model', 'selection', 'problem', 'is', 'to', 'determine', 'the', 'number', 'of', 'convexity', 'change', 'points', 'we', 'use', 'a', 'pilot', 'estimator', 'based', 'on', 'the', 'expected', 'number', 'of', 'false', 'inflection', 'points']]
|
[-0.12176809222659185, 0.06375341824189361, -0.04660991297679998, 0.08422859056459163, -0.11433287606009149, -0.12806216135643245, 0.08124376580096959, 0.32455270267313435, -0.29867800963776453, -0.3091372211763103, 0.16506569051887796, -0.27900492219210027, -0.15145630058569146, 0.15272003488193842, -0.13501125003122502, 0.07379397798684381, 0.009121029124972188, 0.09406983827994693, -0.07557224098681695, -0.29651367180936394, 0.33604345788868767, -0.002040098731716474, 0.23660717354366734, -0.025304413439395528, 0.09931515740823843, 0.028527206724642644, -0.014612495200708508, 0.03562288023385918, -0.10797674558956974, 0.08311621066310354, 0.25121427147227915, 0.1734404896408142, 0.33331647517514373, -0.34416132956920636, -0.1943287050262803, 0.20595469815556758, 0.13214762763596982, 0.06441001236228094, -0.014783753150065118, -0.22547136570903517, 0.10761366226333416, -0.05608190156774418, -0.12084339289105542, 0.0022567920497662966, -0.0020462554502522663, 0.047497634598541824, -0.36235443615199375, 0.05913337302349862, -0.03447724051684851, 0.04081219699721606, -0.07040880098273712, -0.13568302304373078, -0.017836412060118857, 0.09786728026111155, 0.07333232979484212, 0.08491730172231439, 0.13999914962776183, -0.12922455996964086, -0.028336034544433158, 0.3310355688667014, 0.011654358019032293, -0.30380940654625493, 0.17259782715423388, -0.14453015569597483, -0.08802278265024402, 0.18476623378782756, 0.1910322313252393, 0.16014539944894968, -0.10728493152678961, 0.10399445720083479, -0.08076494691860196, 0.1689106572108964, 0.02168341582485785, 0.014921901725409996, 0.15403872557882486, 0.15366887607489757, 0.17025112625144953, 0.18965205794111603, -0.12762071084441795, -0.07395550939864257, -0.34032884807813735, -0.10045676723876525, -0.29206169097285184, -0.009419276362418063, -0.12172615471562105, -0.22273704174551226, 0.34014152876833187, 0.07755813906953249, 0.2310301033292143, 0.06220223395419972, 0.3253580047305496, 0.15337906349893837, 0.03597874373995832, 0.09066414289797346, 0.19840435161521391, 0.08030859742125142, -0.026013955859179122, -0.198836020047089, 0.1375357542530678, 0.081127650816814]
|
1,803.03904
|
Banded Matrix Fraction Representation of Triangular Input Normal Pairs
|
An input pair $(A,B)$ is triangular input normal if and only if $A$ is
triangular and $AA^* + BB^* = I_n$, where $I_n$ is theidentity matrix. Input
normal pairs generate an orthonormal basis for the impulse response. Every
input pair may be transformed to a triangular input normal pair. A new system
representation is given: $(A,B)$ is triangular normal and $A$ is a matrix
fraction, $A=M^{-1}N$, where $M$ and $N$ are triangular matrices of low
bandwidth. For single input pairs, $M$ and $N$ are bidiagonal and an explicit
parameterization is given in terms of the eigenvalues of $A$. This band
fraction structure allows for fast updates of state space systems and fast
system identification. When A has only real eigenvalues, one state advance
requires $3n$ multiplications for the single input case.
|
stat.ME cs.SY eess.SY math.OC math.RT
|
an input pair ab is triangular input normal if and only if a is triangular and aa bb i_n where i_n is theidentity matrix input normal pairs generate an orthonormal basis for the impulse response every input pair may be transformed to a triangular input normal pair a new system representation is given ab is triangular normal and a is a matrix fraction am1n where m and n are triangular matrices of low bandwidth for single input pairs m and n are bidiagonal and an explicit parameterization is given in terms of the eigenvalues of a this band fraction structure allows for fast updates of state space systems and fast system identification when a has only real eigenvalues one state advance requires 3n multiplications for the single input case
|
[['an', 'input', 'pair', 'ab', 'is', 'triangular', 'input', 'normal', 'if', 'and', 'only', 'if', 'a', 'is', 'triangular', 'and', 'aa', 'bb', 'i_n', 'where', 'i_n', 'is', 'theidentity', 'matrix', 'input', 'normal', 'pairs', 'generate', 'an', 'orthonormal', 'basis', 'for', 'the', 'impulse', 'response', 'every', 'input', 'pair', 'may', 'be', 'transformed', 'to', 'a', 'triangular', 'input', 'normal', 'pair', 'a', 'new', 'system', 'representation', 'is', 'given', 'ab', 'is', 'triangular', 'normal', 'and', 'a', 'is', 'a', 'matrix', 'fraction', 'am1n', 'where', 'm', 'and', 'n', 'are', 'triangular', 'matrices', 'of', 'low', 'bandwidth', 'for', 'single', 'input', 'pairs', 'm', 'and', 'n', 'are', 'bidiagonal', 'and', 'an', 'explicit', 'parameterization', 'is', 'given', 'in', 'terms', 'of', 'the', 'eigenvalues', 'of', 'a', 'this', 'band', 'fraction', 'structure', 'allows', 'for', 'fast', 'updates', 'of', 'state', 'space', 'systems', 'and', 'fast', 'system', 'identification', 'when', 'a', 'has', 'only', 'real', 'eigenvalues', 'one', 'state', 'advance', 'requires', '3n', 'multiplications', 'for', 'the', 'single', 'input', 'case']]
|
[-0.17079771543288325, 0.15228930038643368, -0.010826250648228671, 0.0005732290721755094, -0.06225854951125665, -0.17446503038408132, 0.007787214093438284, 0.3998968181764986, -0.302588047709052, -0.23157881166947286, 0.07082722560726253, -0.3148392856719869, -0.11282385876548924, 0.14895233261860966, 1.9473676371762134e-05, 0.03164263815421054, 0.11856928788213514, 0.13463384084638177, -0.11007761133570723, -0.23621096558260227, 0.27361156577317736, -0.02078625717471669, 0.2255276970237156, -0.06295853294432163, 0.10439720985252322, 0.06182514480865142, 0.03732766388497484, -0.038943178244310934, -0.027508554496164395, 0.08552925426542289, 0.23099464219884844, 0.10920350373205619, 0.22056430546148847, -0.38157135232303135, -0.10356488258497218, 0.14603125658912922, 0.15565768045585926, 0.07753841709675575, -0.019510461948812008, -0.2323295802233638, 0.12220959224569516, -0.15833836641367965, -0.07582183433036635, -0.07344955073918884, 0.11699027207672713, -0.0001741111994442332, -0.4283639123854887, 0.02236383177310698, 0.06596004024998645, 0.029478149495901555, 0.014762264498102471, -0.15564775505601833, -0.03425178863108158, 0.12391218072189362, -0.0981497082796945, 0.059273323590507895, 0.0895385641854909, -0.08935754614887671, -0.03723497438339854, 0.3834341945727979, -0.014897558735463563, -0.2542029718875768, 0.11886411111647864, -0.12252253488322178, -0.07225515477095298, 0.16953523880912094, 0.1573426260458907, 0.08982627734351228, -0.11485849862735385, 0.13021726601121866, -0.12701292475318815, 0.23681445477354363, 0.04853105038316466, 0.016431959382603018, 0.1759460794438762, 0.15228222991618526, 0.09439398409197415, 0.11955560903215239, -0.07644194156283468, -0.02529162331300927, -0.31231774401477, -0.168498063698323, -0.256923321869195, 0.06134336218091212, -0.11481171991507885, -0.20544557167055805, 0.37963136435508377, -0.016992932642942046, 0.26729547319655106, 0.015950072211154746, 0.2809601463744138, 0.15815274323351447, 0.0074143320850030645, 0.09003570173522384, 0.10833833545563727, 0.15978034679579922, 0.016903234922554432, -0.14463804068601155, 0.05196549237236439, 0.11710055554872305]
|
1,803.03905
|
Graph Laplacian Spectrum and Primary Frequency Regulation
|
We present a framework based on spectral graph theory that captures the
interplay among network topology, system inertia, and generator and load
damping in determining the overall grid behavior and performance. Specifically,
we show that the impact of network topology on a power system can be quantified
through the network Laplacian eigenvalues, and such eigenvalues determine the
grid robustness against low frequency disturbances. Moreover, we can explicitly
decompose the frequency signal along scaled Laplacian eigenvectors when
damping-inertia ratios are uniform across buses. The insight revealed by this
framework partially explains why load-side participation in frequency
regulation not only makes the system respond faster, but also helps lower the
system nadir after a disturbance. Finally, by presenting a new controller
specifically tailored to suppress high frequency disturbances, we demonstrate
that our results can provide useful guidelines in the controller design for
load-side primary frequency regulation. This improved controller is simulated
on the IEEE 39-bus New England interconnection system to illustrate its
robustness against high frequency oscillations compared to both the
conventional droop control and a recent controller design.
|
cs.SY
|
we present a framework based on spectral graph theory that captures the interplay among network topology system inertia and generator and load damping in determining the overall grid behavior and performance specifically we show that the impact of network topology on a power system can be quantified through the network laplacian eigenvalues and such eigenvalues determine the grid robustness against low frequency disturbances moreover we can explicitly decompose the frequency signal along scaled laplacian eigenvectors when dampinginertia ratios are uniform across buses the insight revealed by this framework partially explains why loadside participation in frequency regulation not only makes the system respond faster but also helps lower the system nadir after a disturbance finally by presenting a new controller specifically tailored to suppress high frequency disturbances we demonstrate that our results can provide useful guidelines in the controller design for loadside primary frequency regulation this improved controller is simulated on the ieee 39bus new england interconnection system to illustrate its robustness against high frequency oscillations compared to both the conventional droop control and a recent controller design
|
[['we', 'present', 'a', 'framework', 'based', 'on', 'spectral', 'graph', 'theory', 'that', 'captures', 'the', 'interplay', 'among', 'network', 'topology', 'system', 'inertia', 'and', 'generator', 'and', 'load', 'damping', 'in', 'determining', 'the', 'overall', 'grid', 'behavior', 'and', 'performance', 'specifically', 'we', 'show', 'that', 'the', 'impact', 'of', 'network', 'topology', 'on', 'a', 'power', 'system', 'can', 'be', 'quantified', 'through', 'the', 'network', 'laplacian', 'eigenvalues', 'and', 'such', 'eigenvalues', 'determine', 'the', 'grid', 'robustness', 'against', 'low', 'frequency', 'disturbances', 'moreover', 'we', 'can', 'explicitly', 'decompose', 'the', 'frequency', 'signal', 'along', 'scaled', 'laplacian', 'eigenvectors', 'when', 'dampinginertia', 'ratios', 'are', 'uniform', 'across', 'buses', 'the', 'insight', 'revealed', 'by', 'this', 'framework', 'partially', 'explains', 'why', 'loadside', 'participation', 'in', 'frequency', 'regulation', 'not', 'only', 'makes', 'the', 'system', 'respond', 'faster', 'but', 'also', 'helps', 'lower', 'the', 'system', 'nadir', 'after', 'a', 'disturbance', 'finally', 'by', 'presenting', 'a', 'new', 'controller', 'specifically', 'tailored', 'to', 'suppress', 'high', 'frequency', 'disturbances', 'we', 'demonstrate', 'that', 'our', 'results', 'can', 'provide', 'useful', 'guidelines', 'in', 'the', 'controller', 'design', 'for', 'loadside', 'primary', 'frequency', 'regulation', 'this', 'improved', 'controller', 'is', 'simulated', 'on', 'the', 'ieee', '39bus', 'new', 'england', 'interconnection', 'system', 'to', 'illustrate', 'its', 'robustness', 'against', 'high', 'frequency', 'oscillations', 'compared', 'to', 'both', 'the', 'conventional', 'droop', 'control', 'and', 'a', 'recent', 'controller', 'design']]
|
[-0.17408412501440165, 0.06376329364585134, -0.05474900315642695, 0.045460409730201885, -0.08006838383285371, -0.16715034882178192, 0.08046746719688516, 0.3875051484633745, -0.261162557660348, -0.3156032051734986, 0.121000506289089, -0.23412173994107766, -0.22869576388356191, 0.22066175739548105, -0.13403064645800358, 0.062167741594748804, 0.07304679941524807, 0.002142737381621952, 0.005099079178762622, -0.1632639216240932, 0.2629909756678072, 0.1247692343313247, 0.34702320044346957, 0.0464697914801284, 0.08033491455717012, -0.03705466677373889, 0.003780592476356436, 0.02535757626504743, -0.059889736491434385, 0.07658319928503426, 0.23250191142803736, 0.1324675812052605, 0.2948468014576726, -0.4353734797438268, -0.20988924587039615, 0.06789193849015812, 0.1454854037729092, 0.061375057749418455, -0.02969990131929411, -0.2768585826005702, 0.12536264229989189, -0.19633407213471152, -0.10393125429056288, -0.11360528177729892, -0.027814001427032053, 0.05121837910767433, -0.3008733468920003, 0.030152303117574775, 0.052890146545078925, 0.04802718923681162, -0.08270242851060837, -0.0985015107626995, -0.036470659253113394, 0.15425900483073332, -0.009695659644256177, -0.04904145024060695, 0.1805267235560512, -0.05899166925651529, -0.11384834880597984, 0.32942237449010875, -0.03355274179094439, -0.22648983009408272, 0.1447163983023281, -0.12658326304517686, -0.09757742263371422, 0.08076370827356269, 0.24844788304339585, 0.028353034406212497, -0.1327102637949131, 0.016091490420876653, 0.030382454427043824, 0.23048314712121448, 0.03443475031897172, 0.030927229527151212, 0.1622831415086032, 0.20436539912241808, 0.12833192568855753, 0.16431687778706625, -0.07138153379558142, -0.09150942154652016, -0.2431991218472831, -0.062486799296245656, -0.16060584601258265, -0.012464764701193913, -0.11318139397214756, -0.1046649810265411, 0.47692341421497986, 0.19848408271421, 0.1700104468089359, 0.08739300357791019, 0.3591765608342195, 0.13466608781825265, 0.03139799425579523, 0.10357639527832031, 0.2452763406909071, 0.0994557014809371, 0.14023066247252494, -0.30219781668115914, 0.08516526436472883, 0.021392802845101953]
|
1,803.03906
|
Adaptive Kernel Estimation of the Spectral Density with Boundary Kernel
Analysis
|
A hybrid estimator of the log-spectral density of a stationary time series is
proposed. First, a multiple taper estimate is performed, followed by kernel
smoothing the log-multitaper estimate. This procedure reduces the expected mean
square error by $({\pi^2 \over 4})^{.8}$ over simply smoothing the log tapered
periodogram. The optimal number of tapers is $O(N^{8/15})$. A data adaptive
implementation of a variable bandwidth kernel smoother is given. When the
spectral density is discontinuous, one sided smoothing estimates are used.
|
stat.ME cs.CV eess.AS eess.SP math.ST stat.TH
|
a hybrid estimator of the logspectral density of a stationary time series is proposed first a multiple taper estimate is performed followed by kernel smoothing the logmultitaper estimate this procedure reduces the expected mean square error by pi2 over 48 over simply smoothing the log tapered periodogram the optimal number of tapers is on815 a data adaptive implementation of a variable bandwidth kernel smoother is given when the spectral density is discontinuous one sided smoothing estimates are used
|
[['a', 'hybrid', 'estimator', 'of', 'the', 'logspectral', 'density', 'of', 'a', 'stationary', 'time', 'series', 'is', 'proposed', 'first', 'a', 'multiple', 'taper', 'estimate', 'is', 'performed', 'followed', 'by', 'kernel', 'smoothing', 'the', 'logmultitaper', 'estimate', 'this', 'procedure', 'reduces', 'the', 'expected', 'mean', 'square', 'error', 'by', 'pi2', 'over', '48', 'over', 'simply', 'smoothing', 'the', 'log', 'tapered', 'periodogram', 'the', 'optimal', 'number', 'of', 'tapers', 'is', 'on815', 'a', 'data', 'adaptive', 'implementation', 'of', 'a', 'variable', 'bandwidth', 'kernel', 'smoother', 'is', 'given', 'when', 'the', 'spectral', 'density', 'is', 'discontinuous', 'one', 'sided', 'smoothing', 'estimates', 'are', 'used']]
|
[-0.11069991787601459, 0.026913229657925274, -0.14134703490785078, 0.07066013370709506, -0.05622355350734372, -0.17482763545367083, 0.05520626771766202, 0.4291771052797374, -0.26416397463579316, -0.26612978162072404, 0.16908248079524033, -0.23974393692945964, -0.10497768964207928, 0.22597688492877702, -0.08578234635857179, 0.13892151749888926, 0.047195994160383156, 0.010660193811513875, -0.1214136002144139, -0.27950453912643225, 0.23642672979162613, 0.1067611227106107, 0.2742422251183981, -0.09638211143196952, 0.1248369725240321, 0.02379514558828975, -0.1017688620624157, -0.029160391104309576, -0.11792709629394506, 0.08738716949071539, 0.20272858595279486, 0.043638503350513544, 0.41306921016228826, -0.3119369329621182, -0.21846501099092788, 0.10787292656880852, 0.1388586836340102, 0.029795275817282106, 0.016864293218149168, -0.22501981809833332, 0.08729156656926007, -0.13885536183615363, -0.11656762060010806, -0.01830225868309897, -0.04204074821532949, 0.05165132192747766, -0.3714907587701945, 0.13188402126175597, 0.01664287704778345, 0.01880105913273598, 0.008715604070426994, -0.12087173204820015, 0.012855780552950148, 0.010481528749790558, -0.012236657457450699, 0.04328748386500305, 0.13917943087749576, -0.03657205456463424, -0.04401903135524327, 0.25746920625189024, -0.12076537342938154, -0.1933128746030362, 0.04702433630039817, -0.08155246370619065, -0.006365993397163325, 0.219121276033356, 0.14732351818881734, 0.13018387807441237, -0.12393405443263443, 0.07092667192122654, -0.015056344058585205, 0.21883310702335285, 0.08707659456903409, -0.03714061658339281, 0.0998107646469419, 0.19076382851313897, 0.17611572155606395, 0.12870122266835288, -0.2128049187656296, -0.055721386348044404, -0.331818670666268, -0.14217191611073518, -0.29258921081935496, -0.010396141565012696, -0.19927089739786952, -0.20854455940915564, 0.41862448314694983, 0.07992573236467586, 0.1967610995481281, 0.11072315881641484, 0.3329243441602509, 0.2165394694495358, 0.06507499463010677, 0.10540107875988868, 0.15106223845290706, 0.13395753950738398, 0.036684078957860994, -0.21628423766110486, 0.06774685898256537, 0.10323383749193071]
|
1,803.03907
|
Pickup and Delivery Problem with Transfers
|
In this article we will be talking about Pickup and Delivery Problems with
Transfers (PDP-T), the main idea is to show first the Pickup and Delivery
Problem (PDP), which is the problem from which the PDP-T derives from, later
show a description of the problem and the mathematical formulation to get a
clear view of what we are going to solve, which leads us to present different
ways of solving this kind of problems.
|
math.OC
|
in this article we will be talking about pickup and delivery problems with transfers pdpt the main idea is to show first the pickup and delivery problem pdp which is the problem from which the pdpt derives from later show a description of the problem and the mathematical formulation to get a clear view of what we are going to solve which leads us to present different ways of solving this kind of problems
|
[['in', 'this', 'article', 'we', 'will', 'be', 'talking', 'about', 'pickup', 'and', 'delivery', 'problems', 'with', 'transfers', 'pdpt', 'the', 'main', 'idea', 'is', 'to', 'show', 'first', 'the', 'pickup', 'and', 'delivery', 'problem', 'pdp', 'which', 'is', 'the', 'problem', 'from', 'which', 'the', 'pdpt', 'derives', 'from', 'later', 'show', 'a', 'description', 'of', 'the', 'problem', 'and', 'the', 'mathematical', 'formulation', 'to', 'get', 'a', 'clear', 'view', 'of', 'what', 'we', 'are', 'going', 'to', 'solve', 'which', 'leads', 'us', 'to', 'present', 'different', 'ways', 'of', 'solving', 'this', 'kind', 'of', 'problems']]
|
[-0.059360778311619886, 0.043774234886105, -0.10871649796860544, 0.029708247455592092, -0.09686786356394657, -0.10408090408639731, 0.035617700770082, 0.32365755500221577, -0.33402984211421133, -0.3610322945499541, 0.08150578040875041, -0.2598423582715662, -0.17672354279941804, 0.16704741189558361, -0.11723407802197176, -0.005290577339159476, 0.07196337763673148, 0.021714693929597333, -0.08161210332292358, -0.23227122424145205, 0.3318290616467444, 0.02172731632064726, 0.2421805770765688, 0.10234634502715356, 0.1084517415524838, -0.01638123021788291, 0.000557660691540789, 0.014502594908195976, -0.12170243736771816, 0.1934902262134553, 0.28117771960190824, 0.18854326297956947, 0.29147125372814164, -0.43696705699973815, -0.18398563514740482, 0.06732582783553044, 0.13050111249164753, 0.16992638337054616, -0.02315919758827501, -0.24715103512327816, 0.10200359857313938, -0.12042552844394704, -0.10563701247746074, 0.006976177022364494, -0.03612491124737505, 0.0011827202664839256, -0.28635659634538396, 0.018865343384646082, 0.06080548842815128, -0.028172836563474423, -0.0821825644894931, -0.11753887837954066, 0.10210130571362537, 0.14505092926147217, 0.08085696594915479, 0.03592962605526318, 0.07115920217128822, -0.1054583707811764, -0.08238292738442889, 0.44704094972159414, 0.04702703114850698, -0.16970431807174072, 0.1638512690803288, -0.09143701535523743, -0.13151990459300578, 0.11967615049483406, 0.19718857113007657, 0.13533681793440436, -0.18830051183121632, 0.013565052141013832, -0.05598999295585059, 0.1459001069385055, 0.0923988357803004, -0.023570198162987426, 0.16922328141643792, 0.18278098629938588, 0.10089686222223414, 0.18532157677848748, -0.033302822301315295, -0.11184358132399015, -0.27013756740032824, -0.1823353784762927, -0.08693228679004351, 0.07045278363433238, 0.01615585371709548, -0.1370087941051335, 0.3805688437879891, 0.22633551822572545, 0.1829019917577908, 0.046401295831389223, 0.3188188599070182, 0.14624515136804533, 0.005450378578766626, 0.05455850815475994, 0.2064974854977147, 0.09662198147585464, 0.1727855099818191, -0.18445537758462532, 0.0676370999340056, 0.05725100331914586]
|
1,803.03908
|
Fast Adaptive Identification of Stable Innovation Filters
|
The adaptive identification of the impulse response of an innovation filter
is considered. The impulse response is a finite sum of known basis functions
with unknown coefficients. These unknown coefficients are estimated using a
pseudolinear regression. This estimate is implemented using a square root
algorithm based on a displacement rank structure. When the initial conditions
have low displacement rank, the filter update is $O(n)$. If the filter
architecture is chosen to be triangular input balanced, the estimation problem
is well-conditioned and a simple, low rank initialization is available.
|
stat.ME cs.SY eess.SP eess.SY math.ST stat.TH
|
the adaptive identification of the impulse response of an innovation filter is considered the impulse response is a finite sum of known basis functions with unknown coefficients these unknown coefficients are estimated using a pseudolinear regression this estimate is implemented using a square root algorithm based on a displacement rank structure when the initial conditions have low displacement rank the filter update is on if the filter architecture is chosen to be triangular input balanced the estimation problem is wellconditioned and a simple low rank initialization is available
|
[['the', 'adaptive', 'identification', 'of', 'the', 'impulse', 'response', 'of', 'an', 'innovation', 'filter', 'is', 'considered', 'the', 'impulse', 'response', 'is', 'a', 'finite', 'sum', 'of', 'known', 'basis', 'functions', 'with', 'unknown', 'coefficients', 'these', 'unknown', 'coefficients', 'are', 'estimated', 'using', 'a', 'pseudolinear', 'regression', 'this', 'estimate', 'is', 'implemented', 'using', 'a', 'square', 'root', 'algorithm', 'based', 'on', 'a', 'displacement', 'rank', 'structure', 'when', 'the', 'initial', 'conditions', 'have', 'low', 'displacement', 'rank', 'the', 'filter', 'update', 'is', 'on', 'if', 'the', 'filter', 'architecture', 'is', 'chosen', 'to', 'be', 'triangular', 'input', 'balanced', 'the', 'estimation', 'problem', 'is', 'wellconditioned', 'and', 'a', 'simple', 'low', 'rank', 'initialization', 'is', 'available']]
|
[-0.10583699723197655, 0.07386422694534386, -0.08665304182266648, 0.024405038091406987, -0.10828067075238902, -0.182657568001146, -0.025492394554682753, 0.4416591442105445, -0.2985242351212285, -0.2176624233199453, 0.2097182409541512, -0.2203607355159792, -0.18481643903082426, 0.1180211713548157, -0.06692646743348715, 0.08647051686950197, 0.053187813493423164, 0.11162237608699467, -0.10158066882716164, -0.2907928203798788, 0.2425764553375881, 0.09447890954007479, 0.2738188170902008, -0.04712844364588487, 0.2054631687827747, 0.05971962583399462, -0.046905203960539606, 0.004174046747555787, -0.07339510329554534, 0.08488629759284033, 0.24998464264420114, 0.10156616232548417, 0.3298043618957639, -0.3294283724707467, -0.15027985886395487, 0.09614054425963497, 0.08836693786592646, 0.08606515206735242, -0.017790532144400375, -0.2163405095343478, 0.07778402770848268, -0.16136415967908266, -0.11553941225760024, -0.041572827443649825, -0.024416930742022072, 0.052815778403204276, -0.3970109834210069, 0.07751802629156207, -0.004254546355117451, 0.06118399008515884, -0.06509574716751972, -0.20032342817549678, 0.02200520347105339, 0.10543353280048574, -0.053464720520423725, 0.028325582997323098, 0.1504224472340535, -0.09032615084486845, -0.06832907317121598, 0.33727724076545035, -0.03489418441048739, -0.31919526448473334, 0.134787817371861, -0.0801437219964679, -0.05020797762236642, 0.16841992422070523, 0.21670229000632057, 0.09115423029387867, -0.15396066053273733, 0.08225081740105948, -0.08797458222728562, 0.2105440977664495, 0.04006793681764975, -0.01091831023487347, 0.12329314050343369, 0.18696642120696857, 0.1169602514419239, 0.13612975464705165, -0.09806860523002053, -0.021913795336414212, -0.29867443649775605, -0.05704287385610356, -0.29144587253474374, 0.009313333980654452, -0.10886162564417066, -0.22580568644810806, 0.39310700010338967, 0.11009899512017993, 0.1852467940030196, 0.07522524092134765, 0.34337586452337826, 0.19991285018411212, 0.07866131923881105, 0.09475695873102681, 0.17658319416593507, 0.16073800136589192, 0.001280537838200954, -0.20327617934195918, 0.14116486996433444, 0.1337691666479011]
|
1,803.03909
|
Vortex coronagraphs for the Habitable Exoplanet Imaging Mission (HabEx)
concept: theoretical performance and telescope requirements
|
The Habitable Exoplanet Imaging Mission (HabEx) concept requires an optical
coronagraph that provides deep starlight suppression over a broad spectral
bandwidth, high throughput for point sources at small angular separation, and
insensitivity to temporally-varying, low-order aberrations. Vortex coronagraphs
are a promising solution that perform optimally on off-axis, monolithic
telescopes and may also be designed for segmented telescopes with minor losses
in performance. We describe the key advantages of vortex coronagraphs on
off-axis telescopes: 1) Unwanted diffraction due to aberrations is passively
rejected in several low-order Zernike modes relaxing the wavefront stability
requirements for imaging Earth-like planets from <10 to >100 pm rms. 2) Stars
with angular diameters >0.1 $\lambda/D$ may be sufficiently suppressed. 3) The
absolute planet throughput is >10%, even for unfavorable telescope
architectures. 4) Broadband solutions ($\Delta\lambda/\lambda>0.1$) are readily
available for both monolithic and segmented apertures. The latter make use of
grayscale apodizers in an upstream pupil plane to provide suppression of
diffracted light from amplitude discontinuities in the telescope pupil without
inducing additional stroke on the deformable mirrors. We set wavefront
stability requirements on the telescope, based on a stellar irradiance
threshold set at an angular separation of 3$\pm$0.5 $\lambda/D$ from the star,
and discuss how some requirements may be relaxed by trading robustness to
aberrations for planet throughput.
|
astro-ph.IM
|
the habitable exoplanet imaging mission habex concept requires an optical coronagraph that provides deep starlight suppression over a broad spectral bandwidth high throughput for point sources at small angular separation and insensitivity to temporallyvarying loworder aberrations vortex coronagraphs are a promising solution that perform optimally on offaxis monolithic telescopes and may also be designed for segmented telescopes with minor losses in performance we describe the key advantages of vortex coronagraphs on offaxis telescopes 1 unwanted diffraction due to aberrations is passively rejected in several loworder zernike modes relaxing the wavefront stability requirements for imaging earthlike planets from 10 to 100 pm rms 2 stars with angular diameters 01 lambdad may be sufficiently suppressed 3 the absolute planet throughput is 10 even for unfavorable telescope architectures 4 broadband solutions deltalambdalambda01 are readily available for both monolithic and segmented apertures the latter make use of grayscale apodizers in an upstream pupil plane to provide suppression of diffracted light from amplitude discontinuities in the telescope pupil without inducing additional stroke on the deformable mirrors we set wavefront stability requirements on the telescope based on a stellar irradiance threshold set at an angular separation of 3pm05 lambdad from the star and discuss how some requirements may be relaxed by trading robustness to aberrations for planet throughput
|
[['the', 'habitable', 'exoplanet', 'imaging', 'mission', 'habex', 'concept', 'requires', 'an', 'optical', 'coronagraph', 'that', 'provides', 'deep', 'starlight', 'suppression', 'over', 'a', 'broad', 'spectral', 'bandwidth', 'high', 'throughput', 'for', 'point', 'sources', 'at', 'small', 'angular', 'separation', 'and', 'insensitivity', 'to', 'temporallyvarying', 'loworder', 'aberrations', 'vortex', 'coronagraphs', 'are', 'a', 'promising', 'solution', 'that', 'perform', 'optimally', 'on', 'offaxis', 'monolithic', 'telescopes', 'and', 'may', 'also', 'be', 'designed', 'for', 'segmented', 'telescopes', 'with', 'minor', 'losses', 'in', 'performance', 'we', 'describe', 'the', 'key', 'advantages', 'of', 'vortex', 'coronagraphs', 'on', 'offaxis', 'telescopes', '1', 'unwanted', 'diffraction', 'due', 'to', 'aberrations', 'is', 'passively', 'rejected', 'in', 'several', 'loworder', 'zernike', 'modes', 'relaxing', 'the', 'wavefront', 'stability', 'requirements', 'for', 'imaging', 'earthlike', 'planets', 'from', '10', 'to', '100', 'pm', 'rms', '2', 'stars', 'with', 'angular', 'diameters', '01', 'lambdad', 'may', 'be', 'sufficiently', 'suppressed', '3', 'the', 'absolute', 'planet', 'throughput', 'is', '10', 'even', 'for', 'unfavorable', 'telescope', 'architectures', '4', 'broadband', 'solutions', 'deltalambdalambda01', 'are', 'readily', 'available', 'for', 'both', 'monolithic', 'and', 'segmented', 'apertures', 'the', 'latter', 'make', 'use', 'of', 'grayscale', 'apodizers', 'in', 'an', 'upstream', 'pupil', 'plane', 'to', 'provide', 'suppression', 'of', 'diffracted', 'light', 'from', 'amplitude', 'discontinuities', 'in', 'the', 'telescope', 'pupil', 'without', 'inducing', 'additional', 'stroke', 'on', 'the', 'deformable', 'mirrors', 'we', 'set', 'wavefront', 'stability', 'requirements', 'on', 'the', 'telescope', 'based', 'on', 'a', 'stellar', 'irradiance', 'threshold', 'set', 'at', 'an', 'angular', 'separation', 'of', '3pm05', 'lambdad', 'from', 'the', 'star', 'and', 'discuss', 'how', 'some', 'requirements', 'may', 'be', 'relaxed', 'by', 'trading', 'robustness', 'to', 'aberrations', 'for', 'planet', 'throughput']]
|
[-0.13886097692330146, 0.16556190611050364, -0.04189257348244566, 0.05356910605221942, -0.11242235433088527, -0.13465501924400172, 0.009018210523451368, 0.4504181889196237, -0.19696776633195223, -0.37006550057835524, 0.13599983687135614, -0.2684339357739581, -0.0873331276212065, 0.2417706068826928, -0.17199113628206153, 0.10201930885779716, 0.1383923281538522, -0.1126272469790863, -0.032829278924812876, -0.22355464737684955, 0.2414393335137339, 0.1244063703668958, 0.20338079482261534, -0.01512286488543309, 0.09853718513983213, -0.029405410170909904, -0.004700384382158518, -0.02663555524001519, -0.10941419940077356, 0.032699265182461766, 0.283615454156617, 0.11897773115585247, 0.21894890639398779, -0.401991157269194, -0.1864709621694471, 0.04464198877436242, 0.1490642916244854, 0.018766797588960757, -0.04163279614599776, -0.2837074994885673, 0.07063942298825299, -0.11419504236518627, -0.19147472041659058, -0.03340400607336224, -0.022772791818161272, 0.04101999868150978, -0.2926376355257595, -0.0030645709078054918, 0.005857705165232931, 0.11853226973575406, -0.06428265683131204, -0.12052140699122987, -0.019437486191080617, 0.0758611508179456, -0.06155047804294597, 0.04302426389906378, 0.12398968941526532, -0.14590035239234567, -0.02314168702245557, 0.3766277942983877, -0.02641895826395956, -0.12383514126496656, 0.1201584026441976, -0.19384269290603698, -0.04323004845202723, 0.2423005803887333, 0.2084596127076241, 0.09541518915267218, -0.12173742852173745, -0.034126735363333, 0.07591658312137173, 0.2611717300585172, 0.17603353932389013, 0.11516474368095043, 0.30133729886507526, 0.19028739025650013, 0.15237428364205352, 0.10251271718436675, -0.2998463694904266, 0.012820116383954883, -0.2474776402703442, -0.09063560140673958, -0.1516097767882803, 0.00949041746567846, -0.1325591530248944, -0.10348176199061397, 0.33195212107772626, 0.16820421932165378, 0.09678783408571257, 0.04798353441236984, 0.42382243170092504, 0.021216918637981592, 0.15172650857518116, 0.020418726324125946, 0.3501710085670874, 0.10154221005560386, 0.1319790744017588, -0.21634867317154116, 0.015621547392081646, -0.004468963370614108]
|
1,803.0391
|
A pathway-based kernel boosting method for sample classification using
genomic data
|
The analysis of cancer genomic data has long suffered "the curse of
dimensionality". Sample sizes for most cancer genomic studies are a few
hundreds at most while there are tens of thousands of genomic features studied.
Various methods have been proposed to leverage prior biological knowledge, such
as pathways, to more effectively analyze cancer genomic data. Most of the
methods focus on testing marginal significance of the associations between
pathways and clinical phenotypes. They can identify relevant pathways, but do
not involve predictive modeling. In this article, we propose a Pathway-based
Kernel Boosting (PKB) method for integrating gene pathway information for
sample classification, where we use kernel functions calculated from each
pathway as base learners and learn the weights through iterative optimization
of the classification loss function. We apply PKB and several competing methods
to three cancer studies with pathological and clinical information, including
tumor grade, stage, tumor sites, and metastasis status. Our results show that
PKB outperforms other methods, and identifies pathways relevant to the outcome
variables.
|
stat.ML cs.LG q-bio.QM
|
the analysis of cancer genomic data has long suffered the curse of dimensionality sample sizes for most cancer genomic studies are a few hundreds at most while there are tens of thousands of genomic features studied various methods have been proposed to leverage prior biological knowledge such as pathways to more effectively analyze cancer genomic data most of the methods focus on testing marginal significance of the associations between pathways and clinical phenotypes they can identify relevant pathways but do not involve predictive modeling in this article we propose a pathwaybased kernel boosting pkb method for integrating gene pathway information for sample classification where we use kernel functions calculated from each pathway as base learners and learn the weights through iterative optimization of the classification loss function we apply pkb and several competing methods to three cancer studies with pathological and clinical information including tumor grade stage tumor sites and metastasis status our results show that pkb outperforms other methods and identifies pathways relevant to the outcome variables
|
[['the', 'analysis', 'of', 'cancer', 'genomic', 'data', 'has', 'long', 'suffered', 'the', 'curse', 'of', 'dimensionality', 'sample', 'sizes', 'for', 'most', 'cancer', 'genomic', 'studies', 'are', 'a', 'few', 'hundreds', 'at', 'most', 'while', 'there', 'are', 'tens', 'of', 'thousands', 'of', 'genomic', 'features', 'studied', 'various', 'methods', 'have', 'been', 'proposed', 'to', 'leverage', 'prior', 'biological', 'knowledge', 'such', 'as', 'pathways', 'to', 'more', 'effectively', 'analyze', 'cancer', 'genomic', 'data', 'most', 'of', 'the', 'methods', 'focus', 'on', 'testing', 'marginal', 'significance', 'of', 'the', 'associations', 'between', 'pathways', 'and', 'clinical', 'phenotypes', 'they', 'can', 'identify', 'relevant', 'pathways', 'but', 'do', 'not', 'involve', 'predictive', 'modeling', 'in', 'this', 'article', 'we', 'propose', 'a', 'pathwaybased', 'kernel', 'boosting', 'pkb', 'method', 'for', 'integrating', 'gene', 'pathway', 'information', 'for', 'sample', 'classification', 'where', 'we', 'use', 'kernel', 'functions', 'calculated', 'from', 'each', 'pathway', 'as', 'base', 'learners', 'and', 'learn', 'the', 'weights', 'through', 'iterative', 'optimization', 'of', 'the', 'classification', 'loss', 'function', 'we', 'apply', 'pkb', 'and', 'several', 'competing', 'methods', 'to', 'three', 'cancer', 'studies', 'with', 'pathological', 'and', 'clinical', 'information', 'including', 'tumor', 'grade', 'stage', 'tumor', 'sites', 'and', 'metastasis', 'status', 'our', 'results', 'show', 'that', 'pkb', 'outperforms', 'other', 'methods', 'and', 'identifies', 'pathways', 'relevant', 'to', 'the', 'outcome', 'variables']]
|
[-0.00900172614586024, 0.013435741861203929, -0.010814738131427606, 0.10751919442485641, -0.09509141268929289, -0.17040834897419527, 0.0762364004843957, 0.4178708300238386, -0.2390877789085997, -0.27466696231082705, 0.08204301896096565, -0.31141528332539437, -0.22228807693630057, 0.22858266588480633, -0.07671696309088952, 0.059570223000870705, 0.14394567644367703, 0.0151053863117427, 0.012592802706335317, -0.29516374088139163, 0.29092901162359686, 0.036452587195006866, 0.3170622823610237, 0.0008515192658662619, 0.10657072730672164, -0.041664663275393345, -0.10041733395094828, -0.027882271676346482, -0.11053786951920518, 0.16119742604210582, 0.40332903116497965, 0.2881480916527965, 0.3989724846379388, -0.43851468511370295, -0.2827092908500206, 0.13893264234675803, 0.17053870090776832, 0.15428854570408085, -0.02255874717792765, -0.24434353971099926, 0.059137402942204584, -0.12655682230113252, -0.020452898807845833, -0.14636536753858395, -0.03910633480769493, 0.02812105674439365, -0.26522641524761204, 0.1326379569661748, -0.006870000384792331, 0.11735974463988982, -0.08800407284607423, -0.19819134701642074, -0.017611904421106113, 0.1792555413447276, 0.11319055986712642, 0.018124762488739742, 0.1993775981883075, -0.14901790107251145, -0.1791359676779913, 0.29646393891778733, 0.04102704973636372, -0.19009044428128705, 0.2759111715907541, -0.0963285862013609, -0.18797882744720915, 0.11718760816923653, 0.1996564117199298, 0.12463427549837866, -0.22309471114394477, -0.03685815365904654, 0.0711731028249709, 0.1585458169658003, 0.07586377168488634, 0.007809645593321572, 0.1432397913096273, 0.23974588532222524, -0.002295431215316057, 0.09321443886403272, -0.16965503300057858, -0.06817592932410273, -0.19350602440092535, -0.13748975974296973, -0.13482519236276858, -0.022061476406937192, -0.12578485770531447, -0.17892591454134768, 0.38831453091864077, 0.17516931246999384, 0.1980189776735469, 0.04244808871797951, 0.25329048057929393, -0.03354835158582622, 0.14883481481506133, 0.007821354360896208, 0.13374206950608086, 0.05434753260037507, 0.041516169918828554, -0.21491919078592522, 0.16734770728951498, 0.007305111059741605]
|
1,803.03911
|
Optimal Estimation of Dynamically Evolving Diffusivities
|
The augmented, iterated Kalman smoother is applied to system identification
for inverse problems in evolutionary differential equations. In the augmented
smoother, the unknown, time-dependent coefficients are included in the state
vector, and have a stochastic component. At each step in the iteration, the
estimate of the time evolution of the coefficients is linear. We update the
slowly varying mean temperature and conductivity by averaging the estimates of
the Kalman smoother. Applications include the estimation of anomalous diffusion
coefficients in turbulent fluids and the plasma rotation velocity in plasma
tomography.
|
stat.ME eess.SP math.OC physics.data-an
|
the augmented iterated kalman smoother is applied to system identification for inverse problems in evolutionary differential equations in the augmented smoother the unknown timedependent coefficients are included in the state vector and have a stochastic component at each step in the iteration the estimate of the time evolution of the coefficients is linear we update the slowly varying mean temperature and conductivity by averaging the estimates of the kalman smoother applications include the estimation of anomalous diffusion coefficients in turbulent fluids and the plasma rotation velocity in plasma tomography
|
[['the', 'augmented', 'iterated', 'kalman', 'smoother', 'is', 'applied', 'to', 'system', 'identification', 'for', 'inverse', 'problems', 'in', 'evolutionary', 'differential', 'equations', 'in', 'the', 'augmented', 'smoother', 'the', 'unknown', 'timedependent', 'coefficients', 'are', 'included', 'in', 'the', 'state', 'vector', 'and', 'have', 'a', 'stochastic', 'component', 'at', 'each', 'step', 'in', 'the', 'iteration', 'the', 'estimate', 'of', 'the', 'time', 'evolution', 'of', 'the', 'coefficients', 'is', 'linear', 'we', 'update', 'the', 'slowly', 'varying', 'mean', 'temperature', 'and', 'conductivity', 'by', 'averaging', 'the', 'estimates', 'of', 'the', 'kalman', 'smoother', 'applications', 'include', 'the', 'estimation', 'of', 'anomalous', 'diffusion', 'coefficients', 'in', 'turbulent', 'fluids', 'and', 'the', 'plasma', 'rotation', 'velocity', 'in', 'plasma', 'tomography']]
|
[-0.08236887260978476, 0.11578254635822488, -0.09636236082898515, 0.03911380760052524, -0.0376781335184246, -0.11775259532589005, -0.06188320492007089, 0.37053494578164614, -0.3249004992834303, -0.25995276177699644, 0.1457965865474864, -0.24544850410370345, -0.10044197910373738, 0.1672650691582246, -0.023612527187202085, 0.12348233888532674, 0.024418137664121858, 0.04320279388228076, -0.09269149280205537, -0.22146790999961033, 0.2578480299928466, 0.05523216032705615, 0.20565048693103738, -0.06506832313509343, 0.1443702471390199, 0.01724158297292888, -0.11849306082206496, 0.01813479046222199, -0.10658415257924216, 0.0536149875522497, 0.22721405860999327, 0.027987590200906055, 0.31293335802894967, -0.4093560090058305, -0.23694426609266006, 0.053270465526939106, 0.171338801360833, 0.11318396198238885, -0.012055593851451458, -0.27454244757719926, 0.0029062586470266407, -0.11820168361810737, -0.15801391457050537, -0.02250683514840817, 0.026506448206439447, 0.04820841745986195, -0.3296762373968122, 0.16007008800136574, 0.03393824160847227, 0.05983474842283163, -0.13564588856658363, -0.14816216704189736, -0.009953983384446146, 0.05519249720833777, 0.03465040242874974, -0.009188432586536314, 0.19461237656978075, -0.15794148121363996, -0.058074541044620315, 0.3243296205620752, -0.1368868583891792, -0.24928996109225776, 0.1326829046010971, -0.11715015353048953, -0.10087060484396859, 0.1954628461762593, 0.23112039589303482, 0.11429375005634816, -0.14999340748770185, 0.08590859032217728, -0.013832207538940933, 0.12104216755859637, 0.030759386922326985, -0.04744692981044312, 0.10405903134829877, 0.12230539968593067, 0.10033819036757093, 0.10785944690781363, -0.11481660824750414, -0.1344398753194327, -0.2836802647438612, -0.161867211750719, -0.15963371589863568, -0.01831662608833795, -0.14533548208762592, -0.1889664978102854, 0.4057346590574873, 0.19712961529998968, 0.17774724147251147, 0.021658456015787766, 0.3155574879943906, 0.2290317387832852, 0.023813734929799366, 0.11471958625852392, 0.2245305469730513, 0.21864714233068686, 0.18475156463682652, -0.29066771232219557, 0.11455679909859816, 0.1147066578661416]
|
1,803.03912
|
On the linear complexity for multidimensional sequences
|
In this paper, we define the linear complexity for multidimensional sequences
over finite fields, generalizing the one-dimensional case. We give some lower
and upper bounds, valid with large probability, for the linear complexity and
$k$-error linear complexity of multidimensional periodic sequences.
|
math.NT cs.IT math.IT
|
in this paper we define the linear complexity for multidimensional sequences over finite fields generalizing the onedimensional case we give some lower and upper bounds valid with large probability for the linear complexity and kerror linear complexity of multidimensional periodic sequences
|
[['in', 'this', 'paper', 'we', 'define', 'the', 'linear', 'complexity', 'for', 'multidimensional', 'sequences', 'over', 'finite', 'fields', 'generalizing', 'the', 'onedimensional', 'case', 'we', 'give', 'some', 'lower', 'and', 'upper', 'bounds', 'valid', 'with', 'large', 'probability', 'for', 'the', 'linear', 'complexity', 'and', 'kerror', 'linear', 'complexity', 'of', 'multidimensional', 'periodic', 'sequences']]
|
[-0.14260814436597796, 0.13210625251437105, -0.004157265137154155, 0.11202021177983047, -0.058884338453048614, -0.11650388199472572, 0.08335115990839989, 0.2826324527083737, -0.3005242782940225, -0.22212573170389344, 0.12680559703887145, -0.19273673334136243, -0.16270771509081852, 0.2889177149343418, -0.11335161791705503, 0.15968302505590568, 0.0026784456496853834, 0.03027607748148645, -0.10525579305320251, -0.3627127851473122, 0.31224546077229626, 0.018451633340701823, 0.23186953288571135, -0.01751115545630455, 0.09463033409471192, 0.0710535498404103, -0.047693950805540494, 0.05203083857167058, -0.22934232861167048, 0.15121798876036957, 0.31695050927923946, 0.13062744219673844, 0.261299222412451, -0.41737361615750845, -0.16240916170588718, 0.19585392356100606, 0.11556269225051127, 0.13607125020608668, -0.06375783145791147, -0.20436180414200375, 0.0937666838034624, -0.12124345810493319, -0.09977937816846662, -0.04174462789896785, 0.039627218494055476, 0.10718836653523328, -0.30372387125361255, 0.0541135543139606, 0.141715327837141, 0.11401472414954475, -0.06921302470401293, -0.12713944911956787, 0.08975343744656662, 0.09312756160819312, -0.004400168023094899, -0.02974274300220536, -0.059455451385186216, -0.05249212954261499, -0.14187790771446576, 0.31069265446830086, -0.1276840088071256, -0.27363822799993726, 0.19445844137723126, -0.18187684658914804, -0.17851027142733517, 0.1541903449177015, 0.24280990242231182, 0.12498271478930624, -0.04544242603204599, 0.21510349783944194, -0.10740722116173768, 0.16134699487919557, 0.12213878035999653, 0.12445438341322787, 0.08061023842452503, 0.1392272683996253, 0.1457813518667003, 0.2558193907436983, -0.038885758440123826, -0.12100045569241047, -0.2900042152259408, -0.15858371524003947, -0.15032234751596685, 0.026677699021359042, -0.17396066738675894, -0.23737818642985076, 0.3709205713395665, 0.08577315390064585, 0.18208108515274235, 0.28877300989427945, 0.24717413339332292, 0.20497428341882257, -0.05635435572007626, 0.10949429795827444, 0.08142794311265233, 0.18272883276364243, 0.03805816865514782, -0.192892344350495, 0.03653124296787854, 0.14817083670144401]
|
1,803.03913
|
Forbidden subgraphs for constant domination number
|
In this paper, we characterize the sets $\mathcal{H}$ of connected graphs
such that there exists a constant $c=c(\mathcal{H})$ satisfying $\gamma (G)\leq
c$ for every connected $\mathcal{H}$-free graph $G$, where $\gamma (G)$ is the
domination number of $G$.
|
math.CO
|
in this paper we characterize the sets mathcalh of connected graphs such that there exists a constant ccmathcalh satisfying gamma gleq c for every connected mathcalhfree graph g where gamma g is the domination number of g
|
[['in', 'this', 'paper', 'we', 'characterize', 'the', 'sets', 'mathcalh', 'of', 'connected', 'graphs', 'such', 'that', 'there', 'exists', 'a', 'constant', 'ccmathcalh', 'satisfying', 'gamma', 'gleq', 'c', 'for', 'every', 'connected', 'mathcalhfree', 'graph', 'g', 'where', 'gamma', 'g', 'is', 'the', 'domination', 'number', 'of', 'g']]
|
[-0.2879147487692535, 0.2019900553083668, -0.01180013372666306, -0.04299667431041598, -0.10909819643064919, -0.1619351275342827, 0.046473766344004415, 0.4016143549233675, -0.30010238501967657, -0.24012946719045025, 0.026123276235820312, -0.31911787463145125, -0.14369126342030036, 0.16703439778130916, -0.09631393835621162, -0.060338824780450925, 0.13458539535188013, 0.20869937497708532, 0.0730272533902381, -0.21317579891264257, 0.36829944467172027, -0.17314660435335505, 0.11008937219675216, 0.07747844311719139, 0.0888526048252566, -0.0017985729241950645, 0.020355409787346918, 0.12126701604574919, -0.2820771396390127, 0.03236736602977746, 0.31608585085875046, 0.18989860395797425, 0.2577123177341289, -0.29672256252686363, -0.15822065569874313, 0.3924795747993307, 0.050284406118508845, -0.15965746832080185, 0.010306633905404143, -0.1591148874981122, 0.16941888803719646, -0.12436285349152361, -0.07903367786719981, 0.047489590321977936, 0.20657653470213214, -0.024505316486789122, -0.3095127089569966, -0.04507149874957071, 0.08851135915352239, 0.0003412607539859083, 0.12248956520731251, -0.11997787858773437, -0.06638542025919175, 0.09296482741936213, -0.09526255000512013, 0.1659549627608309, -0.001985805188370351, -0.0868655107009949, -0.10163064673542976, 0.4187329695818739, -0.07292044147228201, -0.10695068436002152, 0.08115646320705612, -0.154047286319029, -0.2763201044743053, 0.08850475545558664, 0.10175016253358787, 0.18029118919124207, -0.035883660428225994, 0.28299333390572834, -0.1604037306064533, 0.08673602239125305, 0.14091187906968924, -0.045228755347327225, 0.04889877474245926, 0.15612278145919037, 0.20325729651894006, 0.14176714953242076, 0.06398123818346196, 0.21177856505124104, -0.44343738643349045, -0.10584960019008981, -0.25043442555599743, 0.13474553329352704, -0.18334933037921372, -0.2336266156958623, 0.38218822413020664, 0.05073840213137575, 0.14621248608455062, 0.10748932820408502, 0.17704668313510613, 0.0810138286712269, -0.0038649374263412836, 0.28799400174628115, 0.04752385699086719, 0.24569564268717337, -0.12095613487892681, -0.1507856855298289, 0.02895487495051283, 0.09986128865016831]
|
1,803.03914
|
Optimized Dynamic Cache Instantiation and Accurate LRU Approximations
under Time-varying Request Volume
|
Content-delivery applications can achieve scalability and reduce wide-area
network traffic using geographically distributed caches. However, each deployed
cache has an associated cost, and under time-varying request rates (e.g., a
daily cycle) there may be long periods when the request rate from the local
region is not high enough to justify this cost. Cloud computing offers a
solution to problems of this kind, by supporting dynamic allocation and release
of resources. In this paper, we analyze the potential benefits from dynamically
instantiating caches using resources from cloud service providers. We develop
novel analytic caching models that accommodate time-varying request rates,
transient behavior as a cache fills following instantiation, and selective
cache insertion policies. Within the context of a simple cost model, we then
develop bounds and compare policies with optimized parameter selections to
obtain insights into key cost/performance tradeoffs. We find that dynamic cache
instantiation can provide substantial cost reductions, that potential
reductions strongly dependent on the object popularity skew, and that selective
cache insertion can be even more beneficial in this context than with
conventional edge caches. Finally, our contributions also include accurate and
easy-to-compute approximations that are shown applicable to LRU caches under
time-varying workloads.
|
cs.NI cs.PF
|
contentdelivery applications can achieve scalability and reduce widearea network traffic using geographically distributed caches however each deployed cache has an associated cost and under timevarying request rates eg a daily cycle there may be long periods when the request rate from the local region is not high enough to justify this cost cloud computing offers a solution to problems of this kind by supporting dynamic allocation and release of resources in this paper we analyze the potential benefits from dynamically instantiating caches using resources from cloud service providers we develop novel analytic caching models that accommodate timevarying request rates transient behavior as a cache fills following instantiation and selective cache insertion policies within the context of a simple cost model we then develop bounds and compare policies with optimized parameter selections to obtain insights into key costperformance tradeoffs we find that dynamic cache instantiation can provide substantial cost reductions that potential reductions strongly dependent on the object popularity skew and that selective cache insertion can be even more beneficial in this context than with conventional edge caches finally our contributions also include accurate and easytocompute approximations that are shown applicable to lru caches under timevarying workloads
|
[['contentdelivery', 'applications', 'can', 'achieve', 'scalability', 'and', 'reduce', 'widearea', 'network', 'traffic', 'using', 'geographically', 'distributed', 'caches', 'however', 'each', 'deployed', 'cache', 'has', 'an', 'associated', 'cost', 'and', 'under', 'timevarying', 'request', 'rates', 'eg', 'a', 'daily', 'cycle', 'there', 'may', 'be', 'long', 'periods', 'when', 'the', 'request', 'rate', 'from', 'the', 'local', 'region', 'is', 'not', 'high', 'enough', 'to', 'justify', 'this', 'cost', 'cloud', 'computing', 'offers', 'a', 'solution', 'to', 'problems', 'of', 'this', 'kind', 'by', 'supporting', 'dynamic', 'allocation', 'and', 'release', 'of', 'resources', 'in', 'this', 'paper', 'we', 'analyze', 'the', 'potential', 'benefits', 'from', 'dynamically', 'instantiating', 'caches', 'using', 'resources', 'from', 'cloud', 'service', 'providers', 'we', 'develop', 'novel', 'analytic', 'caching', 'models', 'that', 'accommodate', 'timevarying', 'request', 'rates', 'transient', 'behavior', 'as', 'a', 'cache', 'fills', 'following', 'instantiation', 'and', 'selective', 'cache', 'insertion', 'policies', 'within', 'the', 'context', 'of', 'a', 'simple', 'cost', 'model', 'we', 'then', 'develop', 'bounds', 'and', 'compare', 'policies', 'with', 'optimized', 'parameter', 'selections', 'to', 'obtain', 'insights', 'into', 'key', 'costperformance', 'tradeoffs', 'we', 'find', 'that', 'dynamic', 'cache', 'instantiation', 'can', 'provide', 'substantial', 'cost', 'reductions', 'that', 'potential', 'reductions', 'strongly', 'dependent', 'on', 'the', 'object', 'popularity', 'skew', 'and', 'that', 'selective', 'cache', 'insertion', 'can', 'be', 'even', 'more', 'beneficial', 'in', 'this', 'context', 'than', 'with', 'conventional', 'edge', 'caches', 'finally', 'our', 'contributions', 'also', 'include', 'accurate', 'and', 'easytocompute', 'approximations', 'that', 'are', 'shown', 'applicable', 'to', 'lru', 'caches', 'under', 'timevarying', 'workloads']]
|
[-0.1697682879843787, 0.04204567966156233, -0.04959104156207141, 0.07131068158909032, -0.10093819186903955, -0.21995089985715338, 0.18694368020301133, 0.4311512412541375, -0.2783715287900568, -0.29781607930591253, 0.1239142951826394, -0.22317066033235966, -0.13568481222764417, 0.15337242978525215, -0.17467087095295084, 0.03892455584778241, 0.09974958990547673, -0.02958265295812304, -0.02615776908558993, -0.29537704297132333, 0.2717030079564916, 0.09701232564616569, 0.34384600308780766, 0.07198579092118033, 0.038917002664304014, -0.01775373551847261, -0.03036590525880456, 0.013711877603782341, -0.08698027140057167, 0.11262503418387199, 0.33716601090902854, 0.20041369121968367, 0.30434015306123835, -0.48959218955845857, -0.2007804024841028, 0.0902753478365746, 0.15788520482861454, 0.06310143015508977, -0.06500881568777282, -0.23944746465564762, 0.13594284588744274, -0.2719078129810775, -0.04473016628929015, -0.1220695453159017, -0.011148262090389426, 0.0751891690312305, -0.32791035945232655, -0.02860569283773063, -0.02410665450484625, -0.012599604336155236, -0.06953267261091316, -0.0866848926418651, 0.015454725171106734, 0.14682723149910867, 0.03462022627413995, 0.003498214974106118, 0.15735232917953054, -0.11975681700753238, -0.13980997867326309, 0.3839714857844674, -0.021827190285337715, -0.18949983066674891, 0.17345041395295696, -0.02109272341951918, -0.1462959709140111, 0.13164320212256694, 0.24231916827943215, 0.05844252104220594, -0.20302475811784423, 0.050555722675421653, -0.003142408951784351, 0.20349603050331377, 0.09295980488211486, 0.1140706000293662, 0.16773455272362167, 0.2025072136430583, 0.1567308354875719, 0.17392039391074368, -0.06256246327675584, -0.13773056252726487, -0.20620423587566547, -0.11127087759020042, -0.15858643361704652, 0.00378748563681646, -0.1406761781350093, -0.09706862035254372, 0.3360626291939799, 0.17429957494949827, 0.1438772983122047, 0.1542658599694788, 0.3616193282912124, 0.10186209525124226, 0.11978166691105983, 0.20017114937143896, 0.09526925519992578, -0.027287538408073693, 0.1770975702104862, -0.18522398537547535, 0.14173369721598017, 0.001089712243755253]
|
1,803.03915
|
Fair Efficiency Comparisons of Decoy-state Quantum Key Distribution
Protocols
|
Secure key rate of decoy-state quantum key distribution protocols has been
improved with biased basis choice, however, the security standards and
parameters of current protocols are different. As a result, we cannot give an
accurate key rate comparison between different kinds of protocols. Taking the
schemes based on different formula of secure key rate as examples, we give a
fair comparison between typical protocols under universal composable security
standard. Through analyzing the relationship of security parameters in
post-processing stage and final secure key, we achieve the unified
quantification between protocols based on Gottesman-Lo-Lutkenhaus-Preskill
formula and the ones under universal composable security. Based on the above
research, the impact of different sending length and secure parameters on
secure key rate is investigated, meanwhile, we give the dependent relationship
between secure key rate and sending length under different secure parameters.
Besides, we analyze the importance and conditions of fair comparison. For the
first time we give a fair comparison between the protocols based on GLLP
formula and smooth entropy, and taking Raymond protocol and Toshiba protocol as
examples, we analyze the way for improving secure key rate in the light
intensity choice and the single bit error rate estimation method.
|
quant-ph
|
secure key rate of decoystate quantum key distribution protocols has been improved with biased basis choice however the security standards and parameters of current protocols are different as a result we cannot give an accurate key rate comparison between different kinds of protocols taking the schemes based on different formula of secure key rate as examples we give a fair comparison between typical protocols under universal composable security standard through analyzing the relationship of security parameters in postprocessing stage and final secure key we achieve the unified quantification between protocols based on gottesmanlolutkenhauspreskill formula and the ones under universal composable security based on the above research the impact of different sending length and secure parameters on secure key rate is investigated meanwhile we give the dependent relationship between secure key rate and sending length under different secure parameters besides we analyze the importance and conditions of fair comparison for the first time we give a fair comparison between the protocols based on gllp formula and smooth entropy and taking raymond protocol and toshiba protocol as examples we analyze the way for improving secure key rate in the light intensity choice and the single bit error rate estimation method
|
[['secure', 'key', 'rate', 'of', 'decoystate', 'quantum', 'key', 'distribution', 'protocols', 'has', 'been', 'improved', 'with', 'biased', 'basis', 'choice', 'however', 'the', 'security', 'standards', 'and', 'parameters', 'of', 'current', 'protocols', 'are', 'different', 'as', 'a', 'result', 'we', 'can', 'not', 'give', 'an', 'accurate', 'key', 'rate', 'comparison', 'between', 'different', 'kinds', 'of', 'protocols', 'taking', 'the', 'schemes', 'based', 'on', 'different', 'formula', 'of', 'secure', 'key', 'rate', 'as', 'examples', 'we', 'give', 'a', 'fair', 'comparison', 'between', 'typical', 'protocols', 'under', 'universal', 'composable', 'security', 'standard', 'through', 'analyzing', 'the', 'relationship', 'of', 'security', 'parameters', 'in', 'postprocessing', 'stage', 'and', 'final', 'secure', 'key', 'we', 'achieve', 'the', 'unified', 'quantification', 'between', 'protocols', 'based', 'on', 'gottesmanlolutkenhauspreskill', 'formula', 'and', 'the', 'ones', 'under', 'universal', 'composable', 'security', 'based', 'on', 'the', 'above', 'research', 'the', 'impact', 'of', 'different', 'sending', 'length', 'and', 'secure', 'parameters', 'on', 'secure', 'key', 'rate', 'is', 'investigated', 'meanwhile', 'we', 'give', 'the', 'dependent', 'relationship', 'between', 'secure', 'key', 'rate', 'and', 'sending', 'length', 'under', 'different', 'secure', 'parameters', 'besides', 'we', 'analyze', 'the', 'importance', 'and', 'conditions', 'of', 'fair', 'comparison', 'for', 'the', 'first', 'time', 'we', 'give', 'a', 'fair', 'comparison', 'between', 'the', 'protocols', 'based', 'on', 'gllp', 'formula', 'and', 'smooth', 'entropy', 'and', 'taking', 'raymond', 'protocol', 'and', 'toshiba', 'protocol', 'as', 'examples', 'we', 'analyze', 'the', 'way', 'for', 'improving', 'secure', 'key', 'rate', 'in', 'the', 'light', 'intensity', 'choice', 'and', 'the', 'single', 'bit', 'error', 'rate', 'estimation', 'method']]
|
[-0.1842481759376824, 0.0171901687660147, -0.08717661081969284, 0.05965657852741365, 0.031264948522728785, -0.25138913075850927, 0.13487630931963093, 0.3797798852819174, -0.2355932404528263, -0.2795810317478809, 0.08586229294004287, -0.17623876767034458, -0.0914290342432669, 0.3067698608043835, -0.12449262059544246, 0.12966615860799546, 0.012328499874341193, -0.012248340485910624, -0.07806282712212825, -0.27635318239167483, 0.3540753578852276, 0.11556022602599114, 0.3939994443775282, 0.08445497161648496, 0.10099160348816874, 0.054628924642769895, -0.07247824231777246, -0.07276581345967532, -0.2072692519989867, 0.1222667791543831, 0.23180786525915723, 0.1868717372925659, 0.279064995733085, -0.4013539878556949, -0.156351908221179, 0.10408964147436701, 0.12388673138941832, 0.12759401243851345, -0.07261124928068219, -0.230675232082577, 0.09896407847949848, -0.2127871337880943, -0.036199813675570305, -0.07755203906749257, -0.002252866480934438, 0.07636951727185133, -0.2828406390336905, 0.07571482951138263, 0.0034827005051946275, 0.08252204861019166, -0.009999699413133454, -0.0940270921863086, 0.026255010483020605, 0.23017831224455323, 0.016992930855914044, -0.012139435697980414, 0.14096763878729818, -0.08453067962132244, -0.1448662700935215, 0.33711720124208533, -0.0536690261888644, -0.15818048423501252, 0.15122353036410463, -0.004952085064960464, -0.11876425433308264, 0.04140515360026266, 0.1818403016969675, 0.09859240395111518, -0.14747653542285039, -0.0043425790517624034, -0.021846507826635643, 0.2210513430229166, 0.05959129788520448, 0.1598711989117966, 0.143793940643111, 0.16698836494795033, 0.06172351592083268, 0.10930069844205367, -0.05134937542415021, -0.17070286731628068, -0.31813339787407724, -0.17478665795470033, -0.15457521336682634, 0.02503065203576819, -0.11920296089640384, -0.0669649601411689, 0.373842776407899, 0.190350046643732, 0.16119540729063567, 0.04887575413653542, 0.3978168932995215, 0.0768283888689351, 0.02863625994869295, 0.10536010517398378, 0.2161849425670686, 0.11359469697640519, 0.06634795815603534, -0.14964744495109744, 0.18656365354758153, 0.07075389181641947]
|
1,803.03916
|
Deep reinforcement learning for time series: playing idealized trading
games
|
Deep Q-learning is investigated as an end-to-end solution to estimate the
optimal strategies for acting on time series input. Experiments are conducted
on two idealized trading games. 1) Univariate: the only input is a wave-like
price time series, and 2) Bivariate: the input includes a random stepwise price
time series and a noisy signal time series, which is positively correlated with
future price changes. The Univariate game tests whether the agent can capture
the underlying dynamics, and the Bivariate game tests whether the agent can
utilize the hidden relation among the inputs. Stacked Gated Recurrent Unit
(GRU), Long Short-Term Memory (LSTM) units, Convolutional Neural Network (CNN),
and multi-layer perceptron (MLP) are used to model Q values. For both games,
all agents successfully find a profitable strategy. The GRU-based agents show
best overall performance in the Univariate game, while the MLP-based agents
outperform others in the Bivariate game.
|
cs.LG stat.ML
|
deep qlearning is investigated as an endtoend solution to estimate the optimal strategies for acting on time series input experiments are conducted on two idealized trading games 1 univariate the only input is a wavelike price time series and 2 bivariate the input includes a random stepwise price time series and a noisy signal time series which is positively correlated with future price changes the univariate game tests whether the agent can capture the underlying dynamics and the bivariate game tests whether the agent can utilize the hidden relation among the inputs stacked gated recurrent unit gru long shortterm memory lstm units convolutional neural network cnn and multilayer perceptron mlp are used to model q values for both games all agents successfully find a profitable strategy the grubased agents show best overall performance in the univariate game while the mlpbased agents outperform others in the bivariate game
|
[['deep', 'qlearning', 'is', 'investigated', 'as', 'an', 'endtoend', 'solution', 'to', 'estimate', 'the', 'optimal', 'strategies', 'for', 'acting', 'on', 'time', 'series', 'input', 'experiments', 'are', 'conducted', 'on', 'two', 'idealized', 'trading', 'games', '1', 'univariate', 'the', 'only', 'input', 'is', 'a', 'wavelike', 'price', 'time', 'series', 'and', '2', 'bivariate', 'the', 'input', 'includes', 'a', 'random', 'stepwise', 'price', 'time', 'series', 'and', 'a', 'noisy', 'signal', 'time', 'series', 'which', 'is', 'positively', 'correlated', 'with', 'future', 'price', 'changes', 'the', 'univariate', 'game', 'tests', 'whether', 'the', 'agent', 'can', 'capture', 'the', 'underlying', 'dynamics', 'and', 'the', 'bivariate', 'game', 'tests', 'whether', 'the', 'agent', 'can', 'utilize', 'the', 'hidden', 'relation', 'among', 'the', 'inputs', 'stacked', 'gated', 'recurrent', 'unit', 'gru', 'long', 'shortterm', 'memory', 'lstm', 'units', 'convolutional', 'neural', 'network', 'cnn', 'and', 'multilayer', 'perceptron', 'mlp', 'are', 'used', 'to', 'model', 'q', 'values', 'for', 'both', 'games', 'all', 'agents', 'successfully', 'find', 'a', 'profitable', 'strategy', 'the', 'grubased', 'agents', 'show', 'best', 'overall', 'performance', 'in', 'the', 'univariate', 'game', 'while', 'the', 'mlpbased', 'agents', 'outperform', 'others', 'in', 'the', 'bivariate', 'game']]
|
[-0.08207996481110992, 0.01641690056248367, -0.08271474772522047, 0.13700053489955194, -0.08994068054495098, -0.26767018166919276, 0.07736863499293614, 0.4943509124576637, -0.3261091621107843, -0.2654770076281251, 0.08375732646298224, -0.2653168940865626, -0.21213270739647433, 0.1107115788378893, -0.10446319889838565, 0.10470259783094611, 0.07594575110044688, 0.058354056083074174, 0.06356737607522318, -0.3641867848776587, 0.22473256920834314, 0.04449981505315183, 0.27953562390817527, -0.10464731730562188, 0.1553873082986484, -0.0009082815552462045, -0.03537284373624684, -0.02838328445716187, -0.04408611770227316, 0.057548582282410506, 0.29301814623942524, 0.1333130641444905, 0.3738815324087563, -0.48216033705242284, -0.1985772250838935, 0.12018530466115383, 0.07817424531892095, 0.024087713292181134, 0.057877812717964695, -0.279290278566593, 0.025210267728216922, -0.1777442186394681, 0.032083554863164276, -0.08577752891411265, 0.0001993559217973523, 0.06022735425607582, -0.3615467664849472, 0.012547050831577906, 0.05333380574960109, 0.0367749224302091, -0.057090033550606406, -0.1266202438712018, 0.004399357076530179, 0.17210249623207197, 0.015402623925083764, 0.020213337777794837, 0.16846941085213363, -0.15861207225929294, -0.21461900486929775, 0.30148945234983854, -0.10775552269418992, -0.2073254156283626, 0.130966668961289, -0.09843325421647871, -0.12833609794304796, 0.06621471221545992, 0.23781671184944372, 0.0898320833540024, -0.15709114260333654, 0.020244834464591965, -0.10166526620263515, 0.23802889803781696, 0.055531501822645636, -0.015945012507360582, 0.17824644601922993, 0.2462479546857513, 0.05118895469596992, 0.11891845008996252, -0.0959662415170149, -0.17314447433534652, -0.2162948224170465, -0.09749655069604721, -0.18217856440874938, -0.011186371117268931, -0.1694934801449712, -0.14610715354920353, 0.4312393549217345, 0.13512734861483108, 0.16208119082825947, 0.17837422083599225, 0.31531568623007566, 0.08872156610556126, 0.04616826795414728, 0.106985585843787, 0.13324579904302444, 0.03687181211338213, 0.158713970947309, -0.1832005627371996, 0.19567075304444626, 0.053196120471374626]
|
1,803.03917
|
Generating Bilingual Pragmatic Color References
|
Contextual influences on language often exhibit substantial cross-lingual
regularities; for example, we are more verbose in situations that require finer
distinctions. However, these regularities are sometimes obscured by semantic
and syntactic differences. Using a newly-collected dataset of color reference
games in Mandarin Chinese (which we release to the public), we confirm that a
variety of constructions display the same sensitivity to contextual difficulty
in Chinese and English. We then show that a neural speaker agent trained on
bilingual data with a simple multitask learning approach displays more
human-like patterns of context dependence and is more pragmatically informative
than its monolingual Chinese counterpart. Moreover, this is not at the expense
of language-specific semantic understanding: the resulting speaker model learns
the different basic color term systems of English and Chinese (with noteworthy
cross-lingual influences), and it can identify synonyms between the two
languages using vector analogy operations on its output layer, despite having
no exposure to parallel data.
|
cs.CL
|
contextual influences on language often exhibit substantial crosslingual regularities for example we are more verbose in situations that require finer distinctions however these regularities are sometimes obscured by semantic and syntactic differences using a newlycollected dataset of color reference games in mandarin chinese which we release to the public we confirm that a variety of constructions display the same sensitivity to contextual difficulty in chinese and english we then show that a neural speaker agent trained on bilingual data with a simple multitask learning approach displays more humanlike patterns of context dependence and is more pragmatically informative than its monolingual chinese counterpart moreover this is not at the expense of languagespecific semantic understanding the resulting speaker model learns the different basic color term systems of english and chinese with noteworthy crosslingual influences and it can identify synonyms between the two languages using vector analogy operations on its output layer despite having no exposure to parallel data
|
[['contextual', 'influences', 'on', 'language', 'often', 'exhibit', 'substantial', 'crosslingual', 'regularities', 'for', 'example', 'we', 'are', 'more', 'verbose', 'in', 'situations', 'that', 'require', 'finer', 'distinctions', 'however', 'these', 'regularities', 'are', 'sometimes', 'obscured', 'by', 'semantic', 'and', 'syntactic', 'differences', 'using', 'a', 'newlycollected', 'dataset', 'of', 'color', 'reference', 'games', 'in', 'mandarin', 'chinese', 'which', 'we', 'release', 'to', 'the', 'public', 'we', 'confirm', 'that', 'a', 'variety', 'of', 'constructions', 'display', 'the', 'same', 'sensitivity', 'to', 'contextual', 'difficulty', 'in', 'chinese', 'and', 'english', 'we', 'then', 'show', 'that', 'a', 'neural', 'speaker', 'agent', 'trained', 'on', 'bilingual', 'data', 'with', 'a', 'simple', 'multitask', 'learning', 'approach', 'displays', 'more', 'humanlike', 'patterns', 'of', 'context', 'dependence', 'and', 'is', 'more', 'pragmatically', 'informative', 'than', 'its', 'monolingual', 'chinese', 'counterpart', 'moreover', 'this', 'is', 'not', 'at', 'the', 'expense', 'of', 'languagespecific', 'semantic', 'understanding', 'the', 'resulting', 'speaker', 'model', 'learns', 'the', 'different', 'basic', 'color', 'term', 'systems', 'of', 'english', 'and', 'chinese', 'with', 'noteworthy', 'crosslingual', 'influences', 'and', 'it', 'can', 'identify', 'synonyms', 'between', 'the', 'two', 'languages', 'using', 'vector', 'analogy', 'operations', 'on', 'its', 'output', 'layer', 'despite', 'having', 'no', 'exposure', 'to', 'parallel', 'data']]
|
[-0.026076609153115455, 0.050866265509588025, -0.07898142462214217, 0.16638138507364486, -0.1862193006866922, -0.15537826514516312, 0.07411440155761412, 0.49804165672797424, -0.267406617709546, -0.3398611163899589, 0.0180426748679915, -0.30774808028199446, -0.16734526908168426, 0.20548110013642612, -0.14509114221371605, -0.020862876318950348, 0.13669771129468408, 0.07845383381041196, -0.06200269724202091, -0.2754266881145155, 0.32298715565449154, 0.004903786205268728, 0.34764439250545526, -0.02151540413391418, 0.12639422531953107, -0.04051643147622832, -0.06113016333293695, -0.036710648272090994, -0.017291415717782234, 0.1770907825154539, 0.3568792841307676, 0.20299536437214089, 0.2984001684026458, -0.40534271734456223, -0.16449826752366975, 0.08725113810326618, 0.09018491874210155, 0.11131078752861448, -0.0022041547545552766, -0.35753767672353065, 0.0805254734139173, -0.1752227608312984, 0.0737127255243906, -0.1392531943043557, 0.025782988430597842, -0.020019511618346978, -0.22118263842182784, 0.06297994734576115, 0.16420867987154708, 0.16410821441632623, -0.04666516370922088, -0.12221632232495512, -0.025600258356485613, 0.17327865385689223, 0.06401533431310852, 0.03573867586107017, 0.11715493310102595, -0.2134836200544109, -0.15591747690744412, 0.38960053055332255, -0.047397259102394736, -0.21520235974681923, 0.2431073286301958, -0.07321871808156945, -0.16101723405359408, 0.05424516236869236, 0.19376532055843526, 0.061457158105137445, -0.16449946328961793, 0.0036208591799293524, -0.08014232207400103, 0.28140823330613784, 0.11627018261545648, 0.03958822537932951, 0.18182327283489613, 0.24184334567204738, -0.009180283344064195, 0.1443999897903548, -0.08910634887433844, -0.08896231140198115, -0.20575756014724716, -0.0999501491993821, -0.1384876509411977, -0.03396476481402015, -0.12986342567688927, -0.1246175651322119, 0.3747261058157071, 0.20854572127483642, 0.14457855703986774, 0.09494240333711226, 0.2745808044102234, -0.005903807670946639, 0.13888197469238478, 0.08466815653791389, 0.13288593371637547, -0.046019889102377094, 0.155390652998064, -0.14882077585058048, 0.15181045287336487, 0.04128531633446423]
|
1,803.03918
|
Dynamical formation and interaction-induced stabilization of dark
condensates of dipolar excitons
|
The formation of a dense Bose-Einstein condensate in dark spin states of
two-dimensional dipolar excitons is shown to be driven by a dynamical
transition to the long-lived dark states. The condensate is stabilized by
strong dipole-dipole interactions up to densities high enough for a dark
quantum liquid to form. The persistence of dark condensation was observed in
recent experiments. A model describing the non-equilibrium dynamics of
externally driven coupled dark and bright condensates reproduces the step-like
dependence of the exciton density on the pump power or on temperature. This
unique condensate dynamics demonstrates the possibility of observing new
unexpected collective phenomena in coupled condensed Bose systems, where the
particle number is not conserved.
|
cond-mat.quant-gas
|
the formation of a dense boseeinstein condensate in dark spin states of twodimensional dipolar excitons is shown to be driven by a dynamical transition to the longlived dark states the condensate is stabilized by strong dipoledipole interactions up to densities high enough for a dark quantum liquid to form the persistence of dark condensation was observed in recent experiments a model describing the nonequilibrium dynamics of externally driven coupled dark and bright condensates reproduces the steplike dependence of the exciton density on the pump power or on temperature this unique condensate dynamics demonstrates the possibility of observing new unexpected collective phenomena in coupled condensed bose systems where the particle number is not conserved
|
[['the', 'formation', 'of', 'a', 'dense', 'boseeinstein', 'condensate', 'in', 'dark', 'spin', 'states', 'of', 'twodimensional', 'dipolar', 'excitons', 'is', 'shown', 'to', 'be', 'driven', 'by', 'a', 'dynamical', 'transition', 'to', 'the', 'longlived', 'dark', 'states', 'the', 'condensate', 'is', 'stabilized', 'by', 'strong', 'dipoledipole', 'interactions', 'up', 'to', 'densities', 'high', 'enough', 'for', 'a', 'dark', 'quantum', 'liquid', 'to', 'form', 'the', 'persistence', 'of', 'dark', 'condensation', 'was', 'observed', 'in', 'recent', 'experiments', 'a', 'model', 'describing', 'the', 'nonequilibrium', 'dynamics', 'of', 'externally', 'driven', 'coupled', 'dark', 'and', 'bright', 'condensates', 'reproduces', 'the', 'steplike', 'dependence', 'of', 'the', 'exciton', 'density', 'on', 'the', 'pump', 'power', 'or', 'on', 'temperature', 'this', 'unique', 'condensate', 'dynamics', 'demonstrates', 'the', 'possibility', 'of', 'observing', 'new', 'unexpected', 'collective', 'phenomena', 'in', 'coupled', 'condensed', 'bose', 'systems', 'where', 'the', 'particle', 'number', 'is', 'not', 'conserved']]
|
[-0.18806077808088137, 0.28950021643422347, -0.10421677231551683, 0.0766182189201524, -0.003285296718730072, -0.1279478181798456, -0.02741104836855908, 0.3088383696215079, -0.22377673281867683, -0.29184230283496126, -0.03745783760729534, -0.2819479383627134, -0.0615766556228849, 0.12460341736513594, 0.07613226040307663, 0.040748240465331265, -0.03215277871834032, -0.014441487523603492, 0.006228651958558939, -0.22103799614783343, 0.3116614547325298, 0.016565777265582136, 0.29046311433863853, 0.11372662549508752, 0.09397096246217204, -0.04890235532404839, 0.0911577839148849, -0.02257431595198876, -0.1639466556036367, 0.030367831208133262, 0.19303664874771725, -0.03221100488001794, 0.21680871431254245, -0.4493492404740732, -0.24694051284268828, 0.12893715302410444, 0.1893356644808092, 0.19525472252357717, -0.10930924271068544, -0.35976405082418855, -0.05500170143436542, -0.17923542515959887, -0.17606264543080852, -0.12124346799538595, 0.03682753820367883, 0.055922072940965524, -0.24575083251976598, 0.15633386733892282, 0.030288428841601742, -0.004333175868424381, -0.08281696800027141, 0.003398820797271977, -0.046709304424085184, -0.0003635594271024508, 0.00040779159037577633, 0.02364226969667768, 0.20721944685267135, -0.25456775183196023, -0.07481092567333078, 0.3975932016325867, -0.16983002356554389, -0.10139272383422451, 0.22868590852229204, -0.1672603661623017, -0.07220029343842668, 0.20839114820139598, 0.13743482057398712, 0.08251578300218798, -0.1244713193201254, 0.04333446611005368, -0.06232022745967472, 0.21241432113111414, 0.03710196787631551, 0.06593596095639585, 0.3899212627119459, 0.23896377963071638, 0.02066702627271941, 0.14675145492728273, -0.05975700474748042, -0.18819685847358367, -0.2461689847389615, -0.13607438264694888, -0.23434072170835152, 0.06187652221654719, 0.009748222228202482, -0.1449314425686535, 0.396414910626507, 0.10686957294665343, 0.1867289579992669, -0.06074878964490727, 0.26196981536686026, 0.12960299523135202, 0.039393130809365386, 0.0015812206856774546, 0.27589961075413544, 0.19641978169206234, 0.09835775958918101, -0.34472333716920917, -0.022363155914379894, -0.008191527473221046]
|
1,803.03919
|
Detecting Nonlinear Causality in Multivariate Time Series with Sparse
Additive Models
|
We propose a nonparametric method for detecting nonlinear causal relationship
within a set of multidimensional discrete time series, by using sparse additive
models (SpAMs). We show that, when the input to the SpAM is a $\beta$-mixing
time series, the model can be fitted by first approximating each unknown
function with a linear combination of a set of B-spline bases, and then solving
a group-lasso-type optimization problem with nonconvex regularization.
Theoretically, we characterize the oracle statistical properties of the
proposed sparse estimator in function estimation and model selection.
Numerically, we propose an efficient pathwise iterative shrinkage thresholding
algorithm (PISTA), which tames the nonconvexity and guarantees linear
convergence towards the desired sparse estimator with high probability.
|
stat.ML cs.LG stat.ME
|
we propose a nonparametric method for detecting nonlinear causal relationship within a set of multidimensional discrete time series by using sparse additive models spams we show that when the input to the spam is a betamixing time series the model can be fitted by first approximating each unknown function with a linear combination of a set of bspline bases and then solving a grouplassotype optimization problem with nonconvex regularization theoretically we characterize the oracle statistical properties of the proposed sparse estimator in function estimation and model selection numerically we propose an efficient pathwise iterative shrinkage thresholding algorithm pista which tames the nonconvexity and guarantees linear convergence towards the desired sparse estimator with high probability
|
[['we', 'propose', 'a', 'nonparametric', 'method', 'for', 'detecting', 'nonlinear', 'causal', 'relationship', 'within', 'a', 'set', 'of', 'multidimensional', 'discrete', 'time', 'series', 'by', 'using', 'sparse', 'additive', 'models', 'spams', 'we', 'show', 'that', 'when', 'the', 'input', 'to', 'the', 'spam', 'is', 'a', 'betamixing', 'time', 'series', 'the', 'model', 'can', 'be', 'fitted', 'by', 'first', 'approximating', 'each', 'unknown', 'function', 'with', 'a', 'linear', 'combination', 'of', 'a', 'set', 'of', 'bspline', 'bases', 'and', 'then', 'solving', 'a', 'grouplassotype', 'optimization', 'problem', 'with', 'nonconvex', 'regularization', 'theoretically', 'we', 'characterize', 'the', 'oracle', 'statistical', 'properties', 'of', 'the', 'proposed', 'sparse', 'estimator', 'in', 'function', 'estimation', 'and', 'model', 'selection', 'numerically', 'we', 'propose', 'an', 'efficient', 'pathwise', 'iterative', 'shrinkage', 'thresholding', 'algorithm', 'pista', 'which', 'tames', 'the', 'nonconvexity', 'and', 'guarantees', 'linear', 'convergence', 'towards', 'the', 'desired', 'sparse', 'estimator', 'with', 'high', 'probability']]
|
[-0.045960869339801605, -0.030634981123560553, -0.12468571307763984, 0.07698475029031061, -0.1033600452891757, -0.19108390021014265, 0.07233078970648019, 0.431115739138187, -0.3551616689140818, -0.2655249929109143, 0.1357819563886913, -0.221128587635745, -0.22495433783047394, 0.12657025875935776, -0.09553066913221164, 0.19688738151082555, 0.04714966545590257, -0.030516408573407514, -0.10583199884750741, -0.27561340250890803, 0.24363236048514336, 0.04570841176468318, 0.2613253010420409, -0.06787908564948072, 0.19902645160477048, 0.05042554590316897, -0.035040871190747856, 0.025919285133085418, -0.09238521526476205, 0.14374160293007548, 0.27840279950081, 0.1755176660959172, 0.42092846828488123, -0.3603683178090548, -0.19786412828494754, 0.14809653005537998, 0.1372422761473376, 0.0877767850766453, -0.03644506198115054, -0.2661591488703162, 0.08941150990323024, -0.14713250776053308, -0.05527023273000939, -0.14532730467123003, -0.0691495029568936, 0.039134881656979564, -0.39778761178321015, 0.11132769663282464, 0.022021087238861793, 0.011903802485131057, -0.06345922366378054, -0.1046480494139271, 0.05599435050848179, 0.0201921037192749, 0.03639317951288767, 0.0007736680944722178, 0.0714854579048017, -0.08700084115741198, -0.1317537972184343, 0.29943690971529063, -0.08494198978342841, -0.27260482142085984, 0.1156795027344364, -0.07592958137104534, -0.14924608476344595, 0.1441507401579447, 0.23647445193038577, 0.1391308753363854, -0.18903660533428954, 0.08231976286526688, -0.07163998406314481, 0.15457370814628305, 0.021079285051756068, -0.02137438340145534, 0.11509369141669466, 0.1929862469958092, 0.1317397543369273, 0.17713703031227224, -0.09520602902187347, -0.041594828446024815, -0.28637675908023275, -0.07777208487907078, -0.24862030092874063, -0.033479944516418385, -0.1876733050249214, -0.2325719102261077, 0.41127202497482035, 0.1396807517249622, 0.19853634698794478, 0.16144753334965492, 0.33016836653109144, 0.17634815804941573, -0.03535311970760865, 0.1339253057309517, 0.1542220724627079, 0.12450950911713649, 0.008471721261986984, -0.2198508845238361, 0.14339117791124545, 0.1258444358260923]
|
1,803.0392
|
On the approximation of Koopman spectra for measure preserving
transformations
|
For the class of continuous, measure-preserving automorphisms on compact
metric spaces, a procedure is proposed for constructing a sequence of
finite-dimensional approximations to the associated Koopman operator on a
Hilbert space. These finite-dimensional approximations are obtained from the
so-called "periodic approximation" of the underlying automorphism and take the
form of permutation operators. Results are established on how these
discretizations approximate the Koopman operator spectrally. Specificaly, it is
shown that both the spectral measure and the spectral projectors of these
permutation operators converge weakly to their infinite dimensional
counterparts. Based on this result, a numerical method is derived for computing
the spectra of volume-preserving maps on the unit $m$-torus. The discretized
Koopman operator can be constructed from solving a bipartite matching problem
with $\mathcal{O}(\tilde{n}^{3m/2})$ time-complexity, where $\tilde{n}$ denotes
the gridsize on each dimension. By exploiting the permutation structure of the
discretized Koopman operator, it is further shown that the projections and
density functions are computable in $\mathcal{O}(m \tilde{n}^{m} \log
\tilde{n})$ operations using the FFT algorithm. Our method is illustrated on
several classical examples of automorphisms on the torus that contain either a
discrete, continuous, or a mixed spectra. In addition, the spectral properties
of the Chirikov standard map are examined using our method.
|
math.DS
|
for the class of continuous measurepreserving automorphisms on compact metric spaces a procedure is proposed for constructing a sequence of finitedimensional approximations to the associated koopman operator on a hilbert space these finitedimensional approximations are obtained from the socalled periodic approximation of the underlying automorphism and take the form of permutation operators results are established on how these discretizations approximate the koopman operator spectrally specificaly it is shown that both the spectral measure and the spectral projectors of these permutation operators converge weakly to their infinite dimensional counterparts based on this result a numerical method is derived for computing the spectra of volumepreserving maps on the unit mtorus the discretized koopman operator can be constructed from solving a bipartite matching problem with mathcalotilden3m2 timecomplexity where tilden denotes the gridsize on each dimension by exploiting the permutation structure of the discretized koopman operator it is further shown that the projections and density functions are computable in mathcalom tildenm log tilden operations using the fft algorithm our method is illustrated on several classical examples of automorphisms on the torus that contain either a discrete continuous or a mixed spectra in addition the spectral properties of the chirikov standard map are examined using our method
|
[['for', 'the', 'class', 'of', 'continuous', 'measurepreserving', 'automorphisms', 'on', 'compact', 'metric', 'spaces', 'a', 'procedure', 'is', 'proposed', 'for', 'constructing', 'a', 'sequence', 'of', 'finitedimensional', 'approximations', 'to', 'the', 'associated', 'koopman', 'operator', 'on', 'a', 'hilbert', 'space', 'these', 'finitedimensional', 'approximations', 'are', 'obtained', 'from', 'the', 'socalled', 'periodic', 'approximation', 'of', 'the', 'underlying', 'automorphism', 'and', 'take', 'the', 'form', 'of', 'permutation', 'operators', 'results', 'are', 'established', 'on', 'how', 'these', 'discretizations', 'approximate', 'the', 'koopman', 'operator', 'spectrally', 'specificaly', 'it', 'is', 'shown', 'that', 'both', 'the', 'spectral', 'measure', 'and', 'the', 'spectral', 'projectors', 'of', 'these', 'permutation', 'operators', 'converge', 'weakly', 'to', 'their', 'infinite', 'dimensional', 'counterparts', 'based', 'on', 'this', 'result', 'a', 'numerical', 'method', 'is', 'derived', 'for', 'computing', 'the', 'spectra', 'of', 'volumepreserving', 'maps', 'on', 'the', 'unit', 'mtorus', 'the', 'discretized', 'koopman', 'operator', 'can', 'be', 'constructed', 'from', 'solving', 'a', 'bipartite', 'matching', 'problem', 'with', 'mathcalotilden3m2', 'timecomplexity', 'where', 'tilden', 'denotes', 'the', 'gridsize', 'on', 'each', 'dimension', 'by', 'exploiting', 'the', 'permutation', 'structure', 'of', 'the', 'discretized', 'koopman', 'operator', 'it', 'is', 'further', 'shown', 'that', 'the', 'projections', 'and', 'density', 'functions', 'are', 'computable', 'in', 'mathcalom', 'tildenm', 'log', 'tilden', 'operations', 'using', 'the', 'fft', 'algorithm', 'our', 'method', 'is', 'illustrated', 'on', 'several', 'classical', 'examples', 'of', 'automorphisms', 'on', 'the', 'torus', 'that', 'contain', 'either', 'a', 'discrete', 'continuous', 'or', 'a', 'mixed', 'spectra', 'in', 'addition', 'the', 'spectral', 'properties', 'of', 'the', 'chirikov', 'standard', 'map', 'are', 'examined', 'using', 'our', 'method']]
|
[-0.08314568860805593, 0.08073535253410227, -0.10922381140757352, 0.07689779681386426, -0.04822591083822772, -0.09436143789323978, 0.007566602576407604, 0.39089018718805163, -0.31866112468764185, -0.20159590743482114, 0.16423764490580653, -0.2768673195980955, -0.16149269322981127, 0.2210324472654611, -0.07494340699166059, 0.09448834911512677, 0.0848351988196373, 0.055734953582286834, -0.11912840502336622, -0.21437221797357778, 0.37964886164758355, -0.007964023263193667, 0.22972911398508586, -0.016596549828827845, 0.11710706632875371, -0.020199054686818273, -0.07097299991641194, 0.001752175106521463, -0.08536162955508189, 0.14525118739285972, 0.23378031765809282, 0.11747547883423977, 0.24496691082720645, -0.3543816969380714, -0.1892220662534237, 0.14589964361221064, 0.13059098985162565, 0.01317887102253735, -0.031031630363431758, -0.316221885276027, 0.08092786944296676, -0.13582952639495488, -0.09121774165774696, -0.13233406792947788, -0.021732972108293325, 0.014031949058407918, -0.29604967010120165, 0.027070926796877757, 0.08396505756769329, 0.057228487947722895, -0.07517832849756814, -0.1021858277102001, -0.059065098830033094, 0.09146249319950585, -0.03782888467074372, 0.014880637422320432, 0.08794902103370987, -0.025461447994930494, -0.12108107305131853, 0.3679279164574109, -0.06271147685212781, -0.29564036218449474, 0.15015909064735752, -0.13832694025477393, -0.1472489656857215, 0.11681086681084707, 0.14828262427123262, 0.17359954167390243, -0.0877915489723091, 0.17647732656361767, -0.1039921570935985, 0.12239437836688012, 0.052412880935007705, 0.02841326123685576, 0.08850715194828808, 0.10134976303204894, 0.11699540199129842, 0.12571710636664649, -0.0006190821769996546, -0.12113886238628765, -0.29835247644223273, -0.11995174577459693, -0.23443221539724618, 0.05744069682667032, -0.14115271167342144, -0.2120326276900596, 0.41981976480339656, 0.09059949460614007, 0.17929252378176896, 0.10933536630691379, 0.2645517708803527, 0.19625484465621412, 0.05614508306549396, 0.10066454261308536, 0.14231074392446316, 0.20142901893006637, 0.001232927655801177, -0.2253657404196565, -0.011365570065099745, 0.21741685227083507]
|
1,803.03921
|
A walk outside spheres for the fractional Laplacian: fields and first
eigenvalue
|
The Feynman-Kac formula for the exterior-value problem for the fractional
Laplacian leads to a walk-outside-spheres algorithm via sampling alpha-stable
Levy processes on their exit from maximally inscribed balls and sampling their
occupation distribution. Kyprianou, Osojnik, and Shardlow (2017) developed this
algorithm, providing a complexity analysis and an implementation, for
approximating the solution at a single point in the domain. This paper shows
how to efficiently sample the whole field by generating an approximation in
L_2(D), for a domain D . The method takes advantage of a hierarchy of
triangular meshes and uses the multilevel Monte Carlo method for Hilbert
space-valued quantities of interest. We derive complexity bounds in terms of
the fractional parameter alpha and demonstrate that the method gives accurate
results for two problems with exact solutions. Finally, we show how to couple
the method with the variable-accuracy Arnoldi iteration to compute the smallest
eigenvalue of the fractional Laplacian. A criteria is derived for the variable
accuracy and a comparison is given with analytical results of Dyda (2012).
|
math.NA
|
the feynmankac formula for the exteriorvalue problem for the fractional laplacian leads to a walkoutsidespheres algorithm via sampling alphastable levy processes on their exit from maximally inscribed balls and sampling their occupation distribution kyprianou osojnik and shardlow 2017 developed this algorithm providing a complexity analysis and an implementation for approximating the solution at a single point in the domain this paper shows how to efficiently sample the whole field by generating an approximation in l_2d for a domain d the method takes advantage of a hierarchy of triangular meshes and uses the multilevel monte carlo method for hilbert spacevalued quantities of interest we derive complexity bounds in terms of the fractional parameter alpha and demonstrate that the method gives accurate results for two problems with exact solutions finally we show how to couple the method with the variableaccuracy arnoldi iteration to compute the smallest eigenvalue of the fractional laplacian a criteria is derived for the variable accuracy and a comparison is given with analytical results of dyda 2012
|
[['the', 'feynmankac', 'formula', 'for', 'the', 'exteriorvalue', 'problem', 'for', 'the', 'fractional', 'laplacian', 'leads', 'to', 'a', 'walkoutsidespheres', 'algorithm', 'via', 'sampling', 'alphastable', 'levy', 'processes', 'on', 'their', 'exit', 'from', 'maximally', 'inscribed', 'balls', 'and', 'sampling', 'their', 'occupation', 'distribution', 'kyprianou', 'osojnik', 'and', 'shardlow', '2017', 'developed', 'this', 'algorithm', 'providing', 'a', 'complexity', 'analysis', 'and', 'an', 'implementation', 'for', 'approximating', 'the', 'solution', 'at', 'a', 'single', 'point', 'in', 'the', 'domain', 'this', 'paper', 'shows', 'how', 'to', 'efficiently', 'sample', 'the', 'whole', 'field', 'by', 'generating', 'an', 'approximation', 'in', 'l_2d', 'for', 'a', 'domain', 'd', 'the', 'method', 'takes', 'advantage', 'of', 'a', 'hierarchy', 'of', 'triangular', 'meshes', 'and', 'uses', 'the', 'multilevel', 'monte', 'carlo', 'method', 'for', 'hilbert', 'spacevalued', 'quantities', 'of', 'interest', 'we', 'derive', 'complexity', 'bounds', 'in', 'terms', 'of', 'the', 'fractional', 'parameter', 'alpha', 'and', 'demonstrate', 'that', 'the', 'method', 'gives', 'accurate', 'results', 'for', 'two', 'problems', 'with', 'exact', 'solutions', 'finally', 'we', 'show', 'how', 'to', 'couple', 'the', 'method', 'with', 'the', 'variableaccuracy', 'arnoldi', 'iteration', 'to', 'compute', 'the', 'smallest', 'eigenvalue', 'of', 'the', 'fractional', 'laplacian', 'a', 'criteria', 'is', 'derived', 'for', 'the', 'variable', 'accuracy', 'and', 'a', 'comparison', 'is', 'given', 'with', 'analytical', 'results', 'of', 'dyda', '2012']]
|
[-0.05394590876002345, 0.03373786426121455, -0.12302207658952959, 0.06798198269508733, -0.06471808374133761, -0.09570595362377952, 0.06669263716964223, 0.3568044951217009, -0.26246549970001853, -0.305147413198659, 0.12270614487173298, -0.2599136147568105, -0.14362322770064823, 0.22398983168507144, -0.05991907692742905, 0.09051283190106871, 0.0749214411601767, 0.0032140730245987332, -0.06547656581177165, -0.2345208335707844, 0.28836816207340066, 0.03074726957165025, 0.24916234626748993, 0.025713524598331174, 0.14579117790641594, -0.007061965730358373, -0.047007455616229515, -0.008251177564126216, -0.17992676113485936, 0.16460468950238583, 0.21160459820112568, 0.10740904143205815, 0.3125493521430741, -0.3777772972338024, -0.15921222824643314, 0.11247332660378488, 0.1450834225383273, 0.10830299603678514, -0.059328416767358734, -0.2871147845728906, 0.0684465776758977, -0.13675446858046794, -0.15205936265275158, -0.09462512675901315, 0.014582568391774742, 0.029878479768550653, -0.3593024432979113, 0.08846212542177309, 0.0661777711660527, -0.009209393415074407, -0.049877185851586923, -0.14274850648976406, 0.04327512350779004, 0.07954461705739513, -0.0011276314242177306, 0.004558917544953571, 0.060745601982243956, -0.0808812072414882, -0.15432223925892652, 0.3456533983052691, -0.05275332852998074, -0.27043544466784397, 0.11949717186454203, -0.13424791997024343, -0.11714810044276157, 0.14155630071710315, 0.17444830521547658, 0.15743931756566273, -0.12018306656369934, 0.1287214848765692, -0.0297463224640836, 0.1253897846039696, 0.039196002348526125, -0.008575784493854807, 0.09385810895148733, 0.1648376843594929, 0.12859622591626516, 0.1808752668478692, -0.09602806102798715, -0.14525517433034713, -0.29342565612661786, -0.17715262155828104, -0.23966264984273333, 0.00599976499104998, -0.1580117140688428, -0.19609511241336794, 0.39336631515926107, 0.15298600771258716, 0.18918067583117198, 0.12428135087176517, 0.2736691514578608, 0.1795153113287742, -0.023138452493615107, 0.0940261605164276, 0.13525319895478524, 0.14885584552960893, 0.09294744296445072, -0.22564360064145841, 0.03850663483051434, 0.1658073778098529]
|
1,803.03922
|
Scalable Breadth-First Search on a GPU Cluster
|
On a GPU cluster, the ratio of high computing power to communication
bandwidth makes scaling breadth-first search (BFS) on a scale-free graph
extremely challenging. By separating high and low out-degree vertices, we
present an implementation with scalable computation and a model for scalable
communication for BFS and direction-optimized BFS. Our communication model uses
global reduction for high-degree vertices, and point-to-point transmission for
low-degree vertices. Leveraging the characteristics of degree separation, we
reduce the graph size to one third of the conventional edge list
representation. With several other optimizations, we observe linear weak
scaling as we increase the number of GPUs, and achieve 259.8 GTEPS on a
scale-33 Graph500 RMAT graph with 124 GPUs on the latest CORAL early access
system.
|
cs.DC cs.DS
|
on a gpu cluster the ratio of high computing power to communication bandwidth makes scaling breadthfirst search bfs on a scalefree graph extremely challenging by separating high and low outdegree vertices we present an implementation with scalable computation and a model for scalable communication for bfs and directionoptimized bfs our communication model uses global reduction for highdegree vertices and pointtopoint transmission for lowdegree vertices leveraging the characteristics of degree separation we reduce the graph size to one third of the conventional edge list representation with several other optimizations we observe linear weak scaling as we increase the number of gpus and achieve 2598 gteps on a scale33 graph500 rmat graph with 124 gpus on the latest coral early access system
|
[['on', 'a', 'gpu', 'cluster', 'the', 'ratio', 'of', 'high', 'computing', 'power', 'to', 'communication', 'bandwidth', 'makes', 'scaling', 'breadthfirst', 'search', 'bfs', 'on', 'a', 'scalefree', 'graph', 'extremely', 'challenging', 'by', 'separating', 'high', 'and', 'low', 'outdegree', 'vertices', 'we', 'present', 'an', 'implementation', 'with', 'scalable', 'computation', 'and', 'a', 'model', 'for', 'scalable', 'communication', 'for', 'bfs', 'and', 'directionoptimized', 'bfs', 'our', 'communication', 'model', 'uses', 'global', 'reduction', 'for', 'highdegree', 'vertices', 'and', 'pointtopoint', 'transmission', 'for', 'lowdegree', 'vertices', 'leveraging', 'the', 'characteristics', 'of', 'degree', 'separation', 'we', 'reduce', 'the', 'graph', 'size', 'to', 'one', 'third', 'of', 'the', 'conventional', 'edge', 'list', 'representation', 'with', 'several', 'other', 'optimizations', 'we', 'observe', 'linear', 'weak', 'scaling', 'as', 'we', 'increase', 'the', 'number', 'of', 'gpus', 'and', 'achieve', '2598', 'gteps', 'on', 'a', 'scale33', 'graph500', 'rmat', 'graph', 'with', '124', 'gpus', 'on', 'the', 'latest', 'coral', 'early', 'access', 'system']]
|
[-0.19720077868590147, 0.05349323392697481, -0.012114775781871891, -0.0024935315840509758, -0.11956710484418862, -0.1931751464501399, 0.14092602752571723, 0.41076166348672716, -0.26079664332792163, -0.3922598968737391, 0.07965415435991868, -0.2863594715272178, -0.12331636075787403, 0.1618387759800124, -0.03606337922191866, 0.09195661549104236, 0.1153421321993365, 0.026108966492695593, -0.009190689962153801, -0.25095138976623366, 0.2024311451632686, 0.0910227837807992, 0.2880030819019224, 0.03522319291100031, 0.07671546252413082, 0.048614867794632664, -0.034113797155686285, -0.018426345289536135, -0.08177828607188553, 0.13304355213058597, 0.21777391518043557, 0.17938453569507398, 0.24202010168560914, -0.4110919890471366, -0.1487470279680565, 0.12232103955368472, 0.14719450037081203, 0.06799241234430996, -0.037470355401981716, -0.20287291365362578, 0.14195499986707538, -0.16987531808581097, -0.04152561993995572, -0.07484100122756067, 0.03140893081954422, 0.03496565700493002, -0.27148036728417424, 0.0048262740352324075, 0.0004843730604698678, 0.06604031279111798, 0.07962007506382691, -0.15596358146138897, 0.03179027148945054, 0.09845568267863337, -0.10528194977307082, 0.0533951442344349, 0.10756079339570984, -0.15165155368931435, -0.19235236958420576, 0.35920062766042576, -0.03724575334056398, -0.12749131900227056, 0.207998310372296, -0.057854336745129166, -0.20061301363107725, 0.10088002225462378, 0.25458978520346287, 0.07520262481832579, -0.09672098867438671, 0.05327657464976782, 0.019789203430111167, 0.1822714794313676, 0.09367382337002694, 0.07410344147874716, 0.12393308399617378, 0.24796578973656944, 0.1468509605052654, 0.15216251183545781, -0.10441201438143176, -0.08379111772387468, -0.19781777684913338, -0.11534444650854259, -0.24813076603605935, -0.013340385012453845, -0.20793175981749346, -0.18053054097088977, 0.40450755195269567, 0.14655604211910933, 0.1885137071973887, 0.18296135144558648, 0.35855756402641786, 0.06440796726970237, 0.1258235657411557, 0.2046752655193867, 0.13081500009328378, 0.09506078864870389, 0.10880284817858028, -0.21391411660974766, 0.04368382650075339, 0.04354889047754725]
|
1,803.03923
|
The cohomology of free loop spaces of rank 2 flag manifolds
|
A complete flag manifold is the quotient of a Lie group by its maximal torus.
The rank of a flag manifold is the dimension of the maximal torus of the Lie
group. The rank 2 complete flag manifolds are $SU(3)/T^2$, $Sp(2)/T^2$,
$Spin(4)/T^2$, $Spin(5)/T^2$ and $G_2/T^2$. In this paper we calculate the
cohomology of the free loop space of rank 2 complete flag manifolds.
|
math.AT
|
a complete flag manifold is the quotient of a lie group by its maximal torus the rank of a flag manifold is the dimension of the maximal torus of the lie group the rank 2 complete flag manifolds are su3t2 sp2t2 spin4t2 spin5t2 and g_2t2 in this paper we calculate the cohomology of the free loop space of rank 2 complete flag manifolds
|
[['a', 'complete', 'flag', 'manifold', 'is', 'the', 'quotient', 'of', 'a', 'lie', 'group', 'by', 'its', 'maximal', 'torus', 'the', 'rank', 'of', 'a', 'flag', 'manifold', 'is', 'the', 'dimension', 'of', 'the', 'maximal', 'torus', 'of', 'the', 'lie', 'group', 'the', 'rank', '2', 'complete', 'flag', 'manifolds', 'are', 'su3t2', 'sp2t2', 'spin4t2', 'spin5t2', 'and', 'g_2t2', 'in', 'this', 'paper', 'we', 'calculate', 'the', 'cohomology', 'of', 'the', 'free', 'loop', 'space', 'of', 'rank', '2', 'complete', 'flag', 'manifolds']]
|
[-0.23426483257405334, 0.03826457345700365, -0.04545477868483986, 0.04944559418146451, -0.15007729705233694, -0.08781950308357254, -0.03239766599697266, 0.318723302081985, -0.26928030427987293, -0.17019038805264539, 0.2013247128935152, -0.20454097277153346, -0.16278148352531557, 0.14849904005936646, -0.17177664919488006, -0.0789891842415288, 0.04539984166306459, 0.19738716054392064, -0.1602915195803458, -0.3205667051597167, 0.5620552320349015, -0.01722653557435941, 0.21296104105678781, 0.059534761691623826, 0.17162028146055291, -0.03702937219670768, -0.03485458172163216, 0.00792623263087234, -0.14213343375062537, 0.1713691827489884, 0.26661100363264145, 0.06564626933107058, 0.1692036344606619, -0.3049052755774583, -0.15475848369237225, 0.23438287526369095, 0.10685705171771727, 0.016739637606729894, 0.05910451318752968, -0.2683778446230848, 0.08532644603874977, -0.1758636758362843, -0.2140402008810917, -0.04433115100156579, 0.04890847656583824, -0.06784050823268244, -0.18750643212411364, -0.011557458173799313, 0.0757496068727667, 0.14780537908802094, -0.06153945692112448, -0.08403195718587456, -0.11837947945962897, 0.13109040767609506, -0.08926758556074257, 0.06367343032764176, 0.1430606774243889, -0.044234811640107785, -0.16841416520271765, 0.4125665239910832, -0.025233702970889664, -0.2653665807476993, 0.05150936083015749, -0.2160476096432214, -0.1371070900379475, 0.19266717844658485, 0.1151381678626699, 0.21211685610577954, 0.031167327996118436, 0.206473841993888, -0.13048607469299586, 0.013767619538357702, 0.02672935137525201, -0.060010900121119065, 0.06912471874916958, 0.14642456521169614, 0.14436136315955575, 0.08047433134357808, -0.019507030845951227, -0.013833927731542706, -0.3694671859680596, -0.2628279419268592, -0.12435526795432729, 0.2088150761200715, -0.19182465145718583, -0.15364601804038225, 0.45196765287921337, -0.062289717244142194, 0.19750614413770579, 0.14807795272978275, 0.2324223787034467, -0.00869194074076111, 0.04853232032066937, 0.09776416548796124, 0.12911558877361023, 0.2813271691320243, -0.09732496526913118, -0.15215767793736215, -0.11265106811740641, 0.20973984630368017]
|
1,803.03924
|
Lie-Poisson structures over differential algebras
|
In this paper we use key elements of the Olver's approach to Hamiltonian
evolution equations in partial derivatives and propose an algebraic
construction appropriate for Hamiltonian evolution systems with constraints.
|
math-ph math.MP
|
in this paper we use key elements of the olvers approach to hamiltonian evolution equations in partial derivatives and propose an algebraic construction appropriate for hamiltonian evolution systems with constraints
|
[['in', 'this', 'paper', 'we', 'use', 'key', 'elements', 'of', 'the', 'olvers', 'approach', 'to', 'hamiltonian', 'evolution', 'equations', 'in', 'partial', 'derivatives', 'and', 'propose', 'an', 'algebraic', 'construction', 'appropriate', 'for', 'hamiltonian', 'evolution', 'systems', 'with', 'constraints']]
|
[-0.16565300561487675, 0.03475016388547374, -0.08953579490383466, 0.018551009206566958, -0.10546196792274713, -0.061585656367242336, -0.0373203589542148, 0.29801882257064183, -0.306089760363102, -0.3030947070258359, 0.09135104306818297, -0.22559881396591663, -0.22549082164963086, 0.10898566173952227, -0.0839231660667186, 0.10608621953676144, 0.08205065469567975, -0.014074476497868697, -0.16726451966290673, -0.25509592921783525, 0.439699620505174, 0.011058199778199196, 0.18336585002640884, -0.0038736849402387936, 0.16967856800183653, 0.05465889135375619, 0.007758292804161708, -0.053554863296449186, -0.18214039877057076, 0.17333390265703202, 0.26756558517615, 0.11503070549418529, 0.24430006885280212, -0.47537155337631704, -0.18360027607899004, 0.03649598921959599, 0.1689178696833551, 0.16811222131364048, -0.030153786196994284, -0.24086221580704054, 0.008547118119895458, -0.2076658639125526, -0.19361198743184407, -0.12970292000100017, 0.03161032634476821, 0.014365435391664506, -0.2895794834320744, 0.01556364968419075, 0.07639103609447678, 0.07236115945658336, -0.09955971256519357, -0.05723110981828843, 0.032041252590715885, 0.06841614327083032, -0.023444060740681987, -0.024964249522114793, 0.02100999580385784, -0.04537339451878021, -0.11139731767276922, 0.4118725763633847, -0.10796838525372247, -0.27612986614306767, 0.11470983590309819, -0.0590570205822587, -0.23548677343254287, 0.06268413462676108, 0.19708880931138992, 0.16520528544982274, -0.22250082890192668, 0.12743664237787017, 0.04436848449210326, 0.12727271566788356, -0.022941995318979023, 0.0474017390049994, 0.1093412929524978, 0.13000143989920615, 0.09890274008115132, 0.08934380890180667, 0.07152501648912828, -0.1541478174428145, -0.33782092308004696, -0.1813960736239096, -0.10252900342456997, 0.07629454260071118, -0.0748578535358926, -0.17368205022066832, 0.40408317527423304, 0.2258882261502246, 0.14908067195986707, 0.058970006019808355, 0.29444498717784884, 0.20379556665817897, 0.01353501547127962, 0.060290131624788044, 0.1261337327460448, 0.18394259562095006, 0.08457973077893258, -0.24909637303402027, 0.02796975375774006, 0.16879577959577244]
|
1,803.03925
|
Fermi-Dirac Statistics Applied to Very Dense Plasmas at Medium or Low
Temperatures with Optical Parameters Calculations
|
Fermi Dirac free electron model is applied to very dense plasmas with medium
or low temperatures. While Boltzmann statistics can lead to very high densities
of ionized electrons, only at very high temperatures, Fermi Dirac statistics
can support the high densities of ionized electrons at medium or low
temperatures due to the high degeneracies obtained in this model. Since very
dense plasmas may be obtained at low temperatures the corresponding black body
radiation with the plasma luminosity will be quite small. On the other hand
gravitational effects might be quite large due to the high densities. The
optical properties for dense plasmas are calculated. The present study might
have implications to dense stars plasma.
|
physics.plasm-ph
|
fermi dirac free electron model is applied to very dense plasmas with medium or low temperatures while boltzmann statistics can lead to very high densities of ionized electrons only at very high temperatures fermi dirac statistics can support the high densities of ionized electrons at medium or low temperatures due to the high degeneracies obtained in this model since very dense plasmas may be obtained at low temperatures the corresponding black body radiation with the plasma luminosity will be quite small on the other hand gravitational effects might be quite large due to the high densities the optical properties for dense plasmas are calculated the present study might have implications to dense stars plasma
|
[['fermi', 'dirac', 'free', 'electron', 'model', 'is', 'applied', 'to', 'very', 'dense', 'plasmas', 'with', 'medium', 'or', 'low', 'temperatures', 'while', 'boltzmann', 'statistics', 'can', 'lead', 'to', 'very', 'high', 'densities', 'of', 'ionized', 'electrons', 'only', 'at', 'very', 'high', 'temperatures', 'fermi', 'dirac', 'statistics', 'can', 'support', 'the', 'high', 'densities', 'of', 'ionized', 'electrons', 'at', 'medium', 'or', 'low', 'temperatures', 'due', 'to', 'the', 'high', 'degeneracies', 'obtained', 'in', 'this', 'model', 'since', 'very', 'dense', 'plasmas', 'may', 'be', 'obtained', 'at', 'low', 'temperatures', 'the', 'corresponding', 'black', 'body', 'radiation', 'with', 'the', 'plasma', 'luminosity', 'will', 'be', 'quite', 'small', 'on', 'the', 'other', 'hand', 'gravitational', 'effects', 'might', 'be', 'quite', 'large', 'due', 'to', 'the', 'high', 'densities', 'the', 'optical', 'properties', 'for', 'dense', 'plasmas', 'are', 'calculated', 'the', 'present', 'study', 'might', 'have', 'implications', 'to', 'dense', 'stars', 'plasma']]
|
[-0.07593310002253897, 0.27331499419922595, -0.0614019246003999, 0.11041755959587662, -0.026410328920750896, -0.1462441060708411, 0.010344450752120139, 0.38936035928169366, -0.19521379322957313, -0.34193160674093587, 0.053452147276083564, -0.28540198786772397, 0.046065451663085503, 0.19298548803648405, -0.01451720510560431, -0.006640763679650007, 0.05473262880593865, -0.045814384128326516, -0.09640022497950938, -0.19736482070660905, 0.27020962673582527, 0.16752412434046468, 0.2751784947161612, 0.12697488967770418, 0.07377913287889801, -0.11872759748764924, 0.03745121601356292, 0.05880379487899246, -0.038828440646491866, 0.035090541083104256, 0.30733387789019107, -0.030306781446071046, 0.20373951859380068, -0.46841432139473527, -0.29197891076144417, 0.03885904573345263, 0.1573500977502319, 0.11761953781579475, -0.06812758917058409, -0.22258753646491913, 0.06322553819208815, -0.1777363971463944, -0.1908100522776837, -0.08444333413060297, 0.011365105545050219, 0.039164899919374045, -0.2381042992500098, 0.11856902680837696, -0.04863125160173105, -0.0174110014677832, -0.06548922154398863, -0.12512606594776898, -0.04614518419839442, 0.044333717695911205, 0.034082282779803665, 0.03237583303595321, 0.20118390957481766, -0.20623420060228295, 0.041381522522945156, 0.4604049900775416, -0.07040466284869533, -0.11029163741490297, 0.3596028922648545, -0.29243101660783094, -0.13358713872322256, 0.2514263203392099, 0.18360170898877345, 0.09581406493140221, -0.13560047968323424, 0.0424091778641971, -0.0018403444300291308, 0.09807125092361514, 0.07584078367717825, 0.09216676775790882, 0.3406425454130952, 0.10394694232136796, 0.0018949771581805851, 0.0796451058311249, -0.13603069377335997, 0.029791295818428983, -0.20345911265426447, -0.048298401349599944, -0.21765374515630437, 0.0450055539003459, -0.08211923865683116, -0.16200114296455131, 0.3009273129711418, 0.1528189171017801, 0.22505129213657296, -0.044025036308244524, 0.28032462630551636, 0.16809900077325374, 0.022920969056717137, 0.14022779409986055, 0.26864199923288096, 0.180611837879967, 0.13383885468723938, -0.2162607880554309, 0.028033335403163443, 0.0039044340026744627]
|
1,803.03926
|
Electromagnetic proximity effect in planar superconductor-ferromagnet
structures
|
The spread of the Cooper pairs into the ferromagnet in proximity coupled
superconductor - ferromagnet (SF) structures is shown to cause a strong inverse
electromagnetic phenomenon, namely, the long-range transfer of the magnetic
field from the ferromagnet to the superconductor. Contrary to the previously
investigated inverse proximity effect resulting from the spin polarization of
superconducting surface layer, the characteristic length of the above inverse
electrodynamic effect is of the order of the London penetration depth, which
usually much larger than the superconducting coherence length. The
corresponding spontaneous currents appear even in the absence of the stray
field of the ferromagnet and are generated by the vector-potential of
magnetization near the S/F interface and they should be taken into account at
the design of the nanoscale S/F devices. Similarly to the well-known
Aharonov-Bohm effect, the discussed phenomenon can be viewed as a manifestation
of the role of vector potential in quantum physics.
|
cond-mat.supr-con
|
the spread of the cooper pairs into the ferromagnet in proximity coupled superconductor ferromagnet sf structures is shown to cause a strong inverse electromagnetic phenomenon namely the longrange transfer of the magnetic field from the ferromagnet to the superconductor contrary to the previously investigated inverse proximity effect resulting from the spin polarization of superconducting surface layer the characteristic length of the above inverse electrodynamic effect is of the order of the london penetration depth which usually much larger than the superconducting coherence length the corresponding spontaneous currents appear even in the absence of the stray field of the ferromagnet and are generated by the vectorpotential of magnetization near the sf interface and they should be taken into account at the design of the nanoscale sf devices similarly to the wellknown aharonovbohm effect the discussed phenomenon can be viewed as a manifestation of the role of vector potential in quantum physics
|
[['the', 'spread', 'of', 'the', 'cooper', 'pairs', 'into', 'the', 'ferromagnet', 'in', 'proximity', 'coupled', 'superconductor', 'ferromagnet', 'sf', 'structures', 'is', 'shown', 'to', 'cause', 'a', 'strong', 'inverse', 'electromagnetic', 'phenomenon', 'namely', 'the', 'longrange', 'transfer', 'of', 'the', 'magnetic', 'field', 'from', 'the', 'ferromagnet', 'to', 'the', 'superconductor', 'contrary', 'to', 'the', 'previously', 'investigated', 'inverse', 'proximity', 'effect', 'resulting', 'from', 'the', 'spin', 'polarization', 'of', 'superconducting', 'surface', 'layer', 'the', 'characteristic', 'length', 'of', 'the', 'above', 'inverse', 'electrodynamic', 'effect', 'is', 'of', 'the', 'order', 'of', 'the', 'london', 'penetration', 'depth', 'which', 'usually', 'much', 'larger', 'than', 'the', 'superconducting', 'coherence', 'length', 'the', 'corresponding', 'spontaneous', 'currents', 'appear', 'even', 'in', 'the', 'absence', 'of', 'the', 'stray', 'field', 'of', 'the', 'ferromagnet', 'and', 'are', 'generated', 'by', 'the', 'vectorpotential', 'of', 'magnetization', 'near', 'the', 'sf', 'interface', 'and', 'they', 'should', 'be', 'taken', 'into', 'account', 'at', 'the', 'design', 'of', 'the', 'nanoscale', 'sf', 'devices', 'similarly', 'to', 'the', 'wellknown', 'aharonovbohm', 'effect', 'the', 'discussed', 'phenomenon', 'can', 'be', 'viewed', 'as', 'a', 'manifestation', 'of', 'the', 'role', 'of', 'vector', 'potential', 'in', 'quantum', 'physics']]
|
[-0.17669645854039118, 0.1984078197701213, -0.03969681527776023, 0.10112355043025066, -0.07727893905403714, -0.08658350496242444, 0.006039216148977478, 0.336622095387429, -0.2904835388188561, -0.28608951786533, 0.017520792512999227, -0.2894802177262803, -0.09807578687711309, 0.20544755883825322, 0.06494699305544296, -0.011983862683797876, -0.08147029120552664, 0.03877380605787039, -0.06262007867218927, -0.18854023822738478, 0.330546553566431, 0.021639523424673825, 0.34794127465846636, 0.08548863044008613, 0.03718119629658759, 0.010277419108897448, 0.08445142900571227, 0.08055631972538928, -0.08737188200776776, 0.04384662330771486, 0.20958824745224167, -0.06481091249889384, 0.20611334356168906, -0.4836658877755205, -0.2154588622227311, 0.07233261696106638, 0.13361630181781947, 0.14180675052339212, -0.016555844958250722, -0.32174762883301206, 0.0769851002904276, -0.11812171071302145, -0.10176365728635574, 0.02501348598394543, 0.004974497247797747, -0.016515489593148233, -0.2368171480546395, 0.06988422345370054, 0.1288072317481662, 0.08012740748003125, -0.0384118202837999, -0.10001858665297429, -0.04913626750310262, 0.07227363955850402, 0.05839119750695924, 0.07497167009394616, 0.15909117438675216, -0.17850686321190248, -0.10112708674433331, 0.3565598967267821, -0.027974971187941264, -0.10629688507004176, 0.1274218780749167, -0.18322270429072282, 0.030546897031987708, 0.15184359420090915, 0.14136535931921876, 0.057892885177085796, -0.12373815085428456, 0.058648399511196964, 0.00145212488869826, 0.153509160336107, 0.03046394243060301, 0.10873869667450586, 0.27078818696240586, 0.18469097660388797, 0.023317479388788344, 0.18923535469764222, -0.14227340809622546, -0.08792687719377379, -0.2822473717442093, -0.16919690339205165, -0.21100719415582717, 0.09919628592518469, -0.043082964601635465, -0.17966179149594003, 0.3836510089753817, 0.1870881987409666, 0.16797659424133599, -0.07341550826327875, 0.2504543561674655, 0.16107684541416045, 0.15246805733380217, 0.020474816942587494, 0.26697138047466673, 0.20075471200980247, 0.11933099729940295, -0.3343450380403859, 0.08681655846497355, 0.03548840752647569]
|
1,803.03927
|
On Hamiltonian operators in differential algebras
|
Before we proposed an algebraic technics for the Hamiltonian approach to the
evolution systems of partial differential equations, including systems with
constraints. Here we further develop this approach and present the defining
system of equations (suitable for the computer calculations), characterizing
the Hamiltonian operators of the given form. We illustrate our technics by a
simple example.
|
math-ph math.MP
|
before we proposed an algebraic technics for the hamiltonian approach to the evolution systems of partial differential equations including systems with constraints here we further develop this approach and present the defining system of equations suitable for the computer calculations characterizing the hamiltonian operators of the given form we illustrate our technics by a simple example
|
[['before', 'we', 'proposed', 'an', 'algebraic', 'technics', 'for', 'the', 'hamiltonian', 'approach', 'to', 'the', 'evolution', 'systems', 'of', 'partial', 'differential', 'equations', 'including', 'systems', 'with', 'constraints', 'here', 'we', 'further', 'develop', 'this', 'approach', 'and', 'present', 'the', 'defining', 'system', 'of', 'equations', 'suitable', 'for', 'the', 'computer', 'calculations', 'characterizing', 'the', 'hamiltonian', 'operators', 'of', 'the', 'given', 'form', 'we', 'illustrate', 'our', 'technics', 'by', 'a', 'simple', 'example']]
|
[-0.13961890692423498, 0.01563311878193677, -0.10644262054535959, 0.030626814752135294, -0.0519008742953052, -0.09638532912192334, 0.011867388970650998, 0.2792769509500691, -0.2899965790233442, -0.2938147820532322, 0.11482442244388429, -0.25018311930554255, -0.24716230204129325, 0.23879059427002045, -0.020786655709213977, 0.1198333241045475, 0.08737124154660185, 0.010975313252337011, -0.1356672207392486, -0.24589090591637483, 0.4138482500067247, 0.015691301452794244, 0.1731405192902977, 0.031854628369079104, 0.1534339991111275, 0.03235258347870383, -0.021485574526845345, 0.023802590972211744, -0.18719702243937977, 0.16446704337639467, 0.2229405888522576, 0.13577023434585758, 0.2567908214737794, -0.4720932176070554, -0.2144922989121239, 0.026300887361035814, 0.12576569734872983, 0.1784243776596018, -0.05320867139380425, -0.3070794110119875, 0.06453766615595669, -0.20218614350804792, -0.17452009274191888, -0.15989701524709485, 0.016578535216727426, 0.029685152935728962, -0.26993510679208804, 0.022009013062675616, 0.08682772180431389, 0.08152101044925075, -0.11222897673724219, -0.06716797797292072, 0.020636959986794472, 0.08528110487220276, -0.035263089870568365, -0.0588199827761855, 0.0808310806002867, -0.08835021712833882, -0.12386758731944221, 0.38698323762842585, -0.05599279748691645, -0.24574737001343497, 0.15917638845608703, -0.08162301570077293, -0.1753481878965561, 0.04715529160707125, 0.19024690604835218, 0.17646407373415837, -0.20608508857964938, 0.10424039420468034, -0.028283604636921415, 0.11231436369208884, -0.05122098336661501, -0.020067373091088875, 0.10895742770350937, 0.1845282512783472, 0.056273993769926686, 0.13292839013904864, 0.0021843956118183477, -0.13293773895462177, -0.31829902722633313, -0.1670588640346458, -0.12475645498904799, 0.035510442519028275, -0.07488967329248096, -0.1474519828999681, 0.4156062896155553, 0.19928317142850055, 0.15100266205679094, 0.06799630848191944, 0.30340047689553884, 0.24117257390545482, 0.03130854739408408, 0.04099705718856837, 0.17146598773875407, 0.17338967440134315, 0.103686065745673, -0.25081887180983486, 0.0025359787728770505, 0.11967127231348838]
|
1,803.03928
|
Density of orbits of endomorphisms of commutative linear algebraic
groups
|
We prove a conjecture of Medvedev and Scanlon for endomorphisms of connected
commutative linear algebraic groups $G$ defined over an algebraically closed
field $\mathbb{k}$ of characteristic $0$. That is, if $\Phi\colon
G\longrightarrow G$ is a dominant endomorphism, we prove that one of the
following holds: either there exists a non-constant rational function $f\in
\mathbb{k}(G)$ preserved by $\Phi$ (i.e., $f\circ \Phi = f$), or there exists a
point $x\in G(\mathbb{k})$ whose $\Phi$-orbit is Zariski dense in $G$.
|
math.NT math.AG
|
we prove a conjecture of medvedev and scanlon for endomorphisms of connected commutative linear algebraic groups g defined over an algebraically closed field mathbbk of characteristic 0 that is if phicolon glongrightarrow g is a dominant endomorphism we prove that one of the following holds either there exists a nonconstant rational function fin mathbbkg preserved by phi ie fcirc phi f or there exists a point xin gmathbbk whose phiorbit is zariski dense in g
|
[['we', 'prove', 'a', 'conjecture', 'of', 'medvedev', 'and', 'scanlon', 'for', 'endomorphisms', 'of', 'connected', 'commutative', 'linear', 'algebraic', 'groups', 'g', 'defined', 'over', 'an', 'algebraically', 'closed', 'field', 'mathbbk', 'of', 'characteristic', '0', 'that', 'is', 'if', 'phicolon', 'glongrightarrow', 'g', 'is', 'a', 'dominant', 'endomorphism', 'we', 'prove', 'that', 'one', 'of', 'the', 'following', 'holds', 'either', 'there', 'exists', 'a', 'nonconstant', 'rational', 'function', 'fin', 'mathbbkg', 'preserved', 'by', 'phi', 'ie', 'fcirc', 'phi', 'f', 'or', 'there', 'exists', 'a', 'point', 'xin', 'gmathbbk', 'whose', 'phiorbit', 'is', 'zariski', 'dense', 'in', 'g']]
|
[-0.3373198906035238, 0.12299566614819923, -0.09594238374533283, 0.015446270487233493, -0.061930091359426044, -0.23110730495977191, -0.029079736227710807, 0.3618868023433999, -0.3816045723050027, -0.06988572410144214, 0.017967172575850242, -0.2639128510695505, -0.13166883506975766, 0.20989345807921947, -0.10337980380879615, -0.061308195380292634, 0.01706818668045909, 0.18174665843174365, -0.07514474712425491, -0.2703461412441086, 0.3822277171688305, -0.1824418156080552, 0.11472427963304359, 0.06859732468178295, 0.17887690298831896, 0.0022701437874520954, 0.04795158770866692, 0.02323259977070061, -0.2003688050657778, -0.01252228338381502, 0.33870114554726594, 0.16323466512777313, 0.2891293093562126, -0.31849550533838367, -0.12796460702461568, 0.32236971093241024, 0.1435169295621784, -0.1600607445312513, -0.047474943768434426, -0.21489978020356312, 0.2017008872652376, -0.13385482313665184, -0.16501253743253247, -0.030517928975609107, 0.20719198215079518, -0.007513787270196386, -0.330944728619117, -0.021941590500441758, 0.18500070153055964, 0.17539632217203444, -0.021762185371355026, -0.10036254530564907, -0.10252832543306253, 0.032585226807969846, -0.0658977530374368, 0.22371298634145106, 0.07901862523568845, -0.08422839081833593, -0.042886211101840425, 0.3426011442521436, -0.13614317219440095, -0.20063588103732546, 0.05785194768041775, -0.18917562822005837, -0.16757925517693464, 0.14696771535720374, -0.005006808174044095, 0.16560474774372336, 0.029087735642049764, 0.3195473032970472, -0.22523382063199943, 0.11666589491958164, 0.11821568776173769, -0.04789439875103936, 0.12517748607284818, 0.01773937063832843, 0.1451935790859893, 0.10622781945543515, 0.10525133281417594, 0.06973395169385381, -0.3777937219050285, -0.14682860311901047, -0.12728716330573392, 0.2464479477698537, -0.08659406305850025, -0.2077379827859585, 0.33856894035597107, 0.017292454694020184, 0.12242614930948696, 0.11520676283367179, 0.18521838218942788, 0.08452377357595675, 0.02201466729889649, 0.16246522345357556, 0.05178831794576065, 0.23507859596252642, -0.10352295619668439, -0.11386582906659995, 0.009640327000336067, 0.16870697975360058]
|
1,803.03929
|
Parallel Translates of Represented Matroids
|
Given an $\Bbb{F}$-represented matroid $(M,\rho)$ with the ground set $[m]$,
the representation $\rho$ naturally defines a hyperplane arrangement
$\mathcal{A}_\rho$. We will study its parallel translates
$\mathcal{A}_{\rho,{g}}$ of $\mathcal{A}_\rho$ for all ${ g}\in \mathbb{F}^m$.
Its intersection semi-lattices $L(\mathcal{A}_{\rho,{ g}})$ and the
characteristic polynomials $\chi(\mathcal{A}_{\rho,{ g}},t)$ will be classified
by the intersection lattice of the derived arrangement
$\mathcal{A}_{\delta\rho}$, which is a hyperplane arrangement associated with
the derived matroid $(\delta M,\delta\rho)$ and also known as the
discriminantal arrangement in the literature. As a byproduct, we obtain a
comparison result and a decomposition formula on the characteristic polynomials
$\chi(\mathcal{A}_{\rho,{ g}},t)$.
|
math.CO
|
given an bbbfrepresented matroid mrho with the ground set m the representation rho naturally defines a hyperplane arrangement mathcala_rho we will study its parallel translates mathcala_rhog of mathcala_rho for all gin mathbbfm its intersection semilattices lmathcala_rho g and the characteristic polynomials chimathcala_rho gt will be classified by the intersection lattice of the derived arrangement mathcala_deltarho which is a hyperplane arrangement associated with the derived matroid delta mdeltarho and also known as the discriminantal arrangement in the literature as a byproduct we obtain a comparison result and a decomposition formula on the characteristic polynomials chimathcala_rho gt
|
[['given', 'an', 'bbbfrepresented', 'matroid', 'mrho', 'with', 'the', 'ground', 'set', 'm', 'the', 'representation', 'rho', 'naturally', 'defines', 'a', 'hyperplane', 'arrangement', 'mathcala_rho', 'we', 'will', 'study', 'its', 'parallel', 'translates', 'mathcala_rhog', 'of', 'mathcala_rho', 'for', 'all', 'gin', 'mathbbfm', 'its', 'intersection', 'semilattices', 'lmathcala_rho', 'g', 'and', 'the', 'characteristic', 'polynomials', 'chimathcala_rho', 'gt', 'will', 'be', 'classified', 'by', 'the', 'intersection', 'lattice', 'of', 'the', 'derived', 'arrangement', 'mathcala_deltarho', 'which', 'is', 'a', 'hyperplane', 'arrangement', 'associated', 'with', 'the', 'derived', 'matroid', 'delta', 'mdeltarho', 'and', 'also', 'known', 'as', 'the', 'discriminantal', 'arrangement', 'in', 'the', 'literature', 'as', 'a', 'byproduct', 'we', 'obtain', 'a', 'comparison', 'result', 'and', 'a', 'decomposition', 'formula', 'on', 'the', 'characteristic', 'polynomials', 'chimathcala_rho', 'gt']]
|
[-0.2186307739574722, 0.05896938828562608, -0.06733936142328001, 0.02461204158824457, -0.0815913498044274, -0.10908575560139536, 0.02471726676882353, 0.33934081303832925, -0.3319483625507632, -0.23602109510711458, 0.10346573274135915, -0.22584954761835033, -0.1429602568346444, 0.16216370723004517, -0.07457946746631763, -0.04408401868246539, 0.04483017054938733, 0.10980286212573044, -0.08660062326123087, -0.23508113794851787, 0.3371807590646799, -0.022310106738925327, 0.2211417909440866, 0.05250836397672808, 0.09299304667957733, 0.028625474374356873, 0.01691070876928956, 0.05278284982561545, -0.1952742300440319, 0.12067298042089787, 0.27347457796595126, 0.15807736309808354, 0.14675542478298031, -0.31154796611084495, -0.09133829730887745, 0.1693840937886582, 0.1387617548082977, 0.0072495271871407885, 0.017110255074438228, -0.24957988517315582, 0.08072994618411285, -0.1387984604509764, -0.1846551193400871, -0.036693492671474814, 0.05755431381010905, 0.05706185104628635, -0.28163774060302005, -0.06740937814580786, 0.10083267000655449, 0.11798745278420664, -0.06256000500789649, -0.19259633680502342, -0.03660289740438984, 0.06775929888732038, -0.055230048888492894, 0.12678325682239563, 0.08677295447993201, -0.06754684692985097, -0.10597275469322191, 0.4235892574801001, -0.03200498716039366, -0.21613217567007037, 0.1139344869744639, -0.15050044522463712, -0.13431787275341014, 0.1265033464337331, 0.08798614542844684, 0.11997497186801115, -0.0523546128154754, 0.1240492363245129, -0.18766771528739914, 0.06465385672311451, 0.09200250914017129, -0.009223249390298977, 0.1581820147761772, 0.0726076731658649, 0.09138757648314674, 0.18387401703241563, -0.013089751524899457, 0.0025810691078605, -0.3620629373851211, -0.17135374648713095, -0.21147814533418738, 0.08801927104718214, -0.14801722248629695, -0.16882946165068735, 0.3745615762593441, 0.0023089690989446503, 0.23126391161146553, 0.0913376413071853, 0.20655896542810423, 0.0946004492798238, 0.04762982330718186, 0.044027326453942806, 0.10432235202697906, 0.22531348635269285, 0.00017479940880696441, -0.16355117918317055, 0.04097205235590335, 0.1902754979511333]
|
1,803.0393
|
Thorough evaluation of GHZ generation protocols using conference key
agreement
|
The generation of GHZ states in quantum networks is a key element for the
realization of several quantum information tasks. Given the complexity of the
implementation of such generation, it is not easy to find an unambigous proof
for an optimal protocol. Motivated by recent improvements in NV center
manipulation, we present and compare an extensive list of protocols for
generating GHZ states using realistic parameters. Furthermore, in order to
establish the goodness of the various protocols, we test them on a specific
application, i.e. conference key agreement. We show that for an high number of
nodes the best protocol is one presented here for the first time.
|
quant-ph
|
the generation of ghz states in quantum networks is a key element for the realization of several quantum information tasks given the complexity of the implementation of such generation it is not easy to find an unambigous proof for an optimal protocol motivated by recent improvements in nv center manipulation we present and compare an extensive list of protocols for generating ghz states using realistic parameters furthermore in order to establish the goodness of the various protocols we test them on a specific application ie conference key agreement we show that for an high number of nodes the best protocol is one presented here for the first time
|
[['the', 'generation', 'of', 'ghz', 'states', 'in', 'quantum', 'networks', 'is', 'a', 'key', 'element', 'for', 'the', 'realization', 'of', 'several', 'quantum', 'information', 'tasks', 'given', 'the', 'complexity', 'of', 'the', 'implementation', 'of', 'such', 'generation', 'it', 'is', 'not', 'easy', 'to', 'find', 'an', 'unambigous', 'proof', 'for', 'an', 'optimal', 'protocol', 'motivated', 'by', 'recent', 'improvements', 'in', 'nv', 'center', 'manipulation', 'we', 'present', 'and', 'compare', 'an', 'extensive', 'list', 'of', 'protocols', 'for', 'generating', 'ghz', 'states', 'using', 'realistic', 'parameters', 'furthermore', 'in', 'order', 'to', 'establish', 'the', 'goodness', 'of', 'the', 'various', 'protocols', 'we', 'test', 'them', 'on', 'a', 'specific', 'application', 'ie', 'conference', 'key', 'agreement', 'we', 'show', 'that', 'for', 'an', 'high', 'number', 'of', 'nodes', 'the', 'best', 'protocol', 'is', 'one', 'presented', 'here', 'for', 'the', 'first', 'time']]
|
[-0.14041072327031376, 0.05367218046201203, -0.016751695790810994, 0.023991181686546445, -0.02224595408403763, -0.1322466138560601, 0.07171709307564285, 0.40149702397347603, -0.23260932921052532, -0.31908354997910837, 0.10377896297399679, -0.23381364664614754, -0.1250460979235531, 0.27687321954268823, -0.06761618197304886, 0.11239546758588403, 0.07041747684814725, 0.03446830065890767, -0.029220253576231363, -0.2662817907726599, 0.30300554840532307, 0.08145279773830057, 0.32352436454190564, 0.07828179103994949, 0.11160801477402586, -2.7514963962689593e-05, -0.010421694562494479, -0.03614667411117504, -0.12627834519103256, 0.14004485437073055, 0.25738137019410107, 0.1683931427800821, 0.27158735545903995, -0.4095602216440494, -0.18112316203122544, 0.08966921841622227, 0.09944450240625345, 0.1855485745774651, -0.09491520122887946, -0.26378368869147917, 0.10178526318028432, -0.18859789771441784, -0.10906170840219905, -0.10269017388647492, 0.02709949528798461, 0.010682009673608397, -0.27419017927496936, 0.007834879897051939, 0.021029410271525936, 0.06041004769159136, -0.025941183678460895, -0.07832082656764046, 0.05933319701688123, 0.1741770753395502, -0.05323683528910839, 0.010993813161298426, 0.08001637610033396, -0.1405799562365886, -0.22272154785416745, 0.373276258741195, -0.03329467620265118, -0.14068877150054537, 0.1736712216710051, -0.06322470862694361, -0.18261358080673273, 0.03848402557842848, 0.15031876698722718, 0.12275648440010156, -0.12612677259474164, 0.024813849267148826, -0.04743678697343933, 0.21542374449092205, 0.02725679455842409, 0.06620822366076701, 0.15662795356345466, 0.17972977760817027, 0.10639292623037128, 0.16618756490276643, -0.06695611039807166, -0.09988611711499591, -0.33125743821815207, -0.2187760691675875, -0.23045894593707528, 0.02056840822950579, -0.0784695260656547, -0.11654819401101796, 0.42710238478698387, 0.19680392620365536, 0.19705022362285052, 0.029336359877898184, 0.3215221324418154, 0.07773416382648672, 0.03678151574718801, 0.09539543233242714, 0.21303988572348048, 0.11581138233628331, 0.06845941601096894, -0.1962811437169202, 0.07038540628100573, 0.012474974013727021]
|
1,803.03931
|
Algebraic dynamics of skew-linear self-maps
|
Let $X$ be a variety defined over an algebraically closed field $k$ of
characteristic $0$, let $N\in\mathbb{N}$, let $g:X\dashrightarrow X$ be a
dominant rational self-map, and let $A:\mathbb{A}^N\to \mathbb{A}^N$ be a
linear transformation defined over $k(X)$, i.e., for a Zariski open dense
subset $U\subset X$, we have that for $x\in U(k)$, the specialization $A(x)$ is
an $N$-by-$N$ matrix with entries in $k$. We let
$f:X\times\mathbb{A}^N\dashrightarrow X\times \mathbb{A}^N$ be the rational
endomorphism given by $(x,y)\mapsto (g(x), A(x)y)$. We prove that if the
determinant of $A$ is nonzero and if there exists $x\in X(k)$ such that its
orbit $\mathcal{O}_g(x)$ is Zariski dense in $X$, then either there exists a
point $z\in (X\times \mathbb{A}^N)(k)$ such that its orbit $\mathcal{O}_f(z)$
is Zariski dense in $X\times \mathbb{A}^N$ or there exists a nonconstant
rational function $\psi\in k(X\times \mathbb{A}^N)$ such that $\psi\circ
f=\psi$. Our result provides additional evidence to a conjecture of Medvedev
and Scanlon.
|
math.AG math.DS
|
let x be a variety defined over an algebraically closed field k of characteristic 0 let ninmathbbn let gxdashrightarrow x be a dominant rational selfmap and let amathbbanto mathbban be a linear transformation defined over kx ie for a zariski open dense subset usubset x we have that for xin uk the specialization ax is an nbyn matrix with entries in k we let fxtimesmathbbandashrightarrow xtimes mathbban be the rational endomorphism given by xymapsto gx axy we prove that if the determinant of a is nonzero and if there exists xin xk such that its orbit mathcalo_gx is zariski dense in x then either there exists a point zin xtimes mathbbank such that its orbit mathcalo_fz is zariski dense in xtimes mathbban or there exists a nonconstant rational function psiin kxtimes mathbban such that psicirc fpsi our result provides additional evidence to a conjecture of medvedev and scanlon
|
[['let', 'x', 'be', 'a', 'variety', 'defined', 'over', 'an', 'algebraically', 'closed', 'field', 'k', 'of', 'characteristic', '0', 'let', 'ninmathbbn', 'let', 'gxdashrightarrow', 'x', 'be', 'a', 'dominant', 'rational', 'selfmap', 'and', 'let', 'amathbbanto', 'mathbban', 'be', 'a', 'linear', 'transformation', 'defined', 'over', 'kx', 'ie', 'for', 'a', 'zariski', 'open', 'dense', 'subset', 'usubset', 'x', 'we', 'have', 'that', 'for', 'xin', 'uk', 'the', 'specialization', 'ax', 'is', 'an', 'nbyn', 'matrix', 'with', 'entries', 'in', 'k', 'we', 'let', 'fxtimesmathbbandashrightarrow', 'xtimes', 'mathbban', 'be', 'the', 'rational', 'endomorphism', 'given', 'by', 'xymapsto', 'gx', 'axy', 'we', 'prove', 'that', 'if', 'the', 'determinant', 'of', 'a', 'is', 'nonzero', 'and', 'if', 'there', 'exists', 'xin', 'xk', 'such', 'that', 'its', 'orbit', 'mathcalo_gx', 'is', 'zariski', 'dense', 'in', 'x', 'then', 'either', 'there', 'exists', 'a', 'point', 'zin', 'xtimes', 'mathbbank', 'such', 'that', 'its', 'orbit', 'mathcalo_fz', 'is', 'zariski', 'dense', 'in', 'xtimes', 'mathbban', 'or', 'there', 'exists', 'a', 'nonconstant', 'rational', 'function', 'psiin', 'kxtimes', 'mathbban', 'such', 'that', 'psicirc', 'fpsi', 'our', 'result', 'provides', 'additional', 'evidence', 'to', 'a', 'conjecture', 'of', 'medvedev', 'and', 'scanlon']]
|
[-0.27924738950292827, 0.0784968571480393, -0.09602301764551183, -0.03929148045693144, -0.058197759131205756, -0.1991563597308721, 0.021404916860005806, 0.3760777659169857, -0.3835749498135607, -0.0504779598780606, 0.06953154278437043, -0.31586930670113056, -0.13015464498353205, 0.20885632817902353, -0.11046276534300849, -0.06820200761193147, 0.03078264352196539, 0.1243161759937746, -0.10497859100693128, -0.2825438868726643, 0.3426694430961785, -0.15753713385718482, 0.09540346530134934, 0.0523891665195574, 0.1895602515818302, -0.0010434659591443101, 0.08809433701369439, -0.0066927011685550845, -0.165788943646117, -0.0038444684723287193, 0.3832597941107733, 0.19666017768215913, 0.25354664447769837, -0.2975613710824663, -0.1503994821154342, 0.33779005355752584, 0.1693430355927107, -0.1867149096034782, -0.03519960199515532, -0.2413208367250545, 0.19899807514911386, -0.14044466608164596, -0.1795097734602037, -0.09322350365798396, 0.18748402311942133, 0.011612133490262737, -0.37819537197069175, -0.060389905238224226, 0.1235150118345316, 0.14014327033213012, -0.023789839240276372, -0.13634329827987707, -0.1064740117470419, 0.03147369745830205, -0.05839097493616733, 0.27614210268915435, 0.05359889154853693, -0.027689557981638, -0.04041530728392618, 0.35830848632564005, -0.130328702576406, -0.2369985808815125, 0.06381959536335838, -0.20887999836368565, -0.1419435519656219, 0.15531914457547621, 0.04918213727110079, 0.14004355638852, 0.0009790647801169207, 0.3155498314557866, -0.22789993080389226, 0.14322480212910998, 0.08365071271087082, -0.0420129564492373, 0.18933082571331883, 0.04409742983825452, 0.11200301755632891, 0.0657896623179369, 0.019429843144779895, 0.0612625398994489, -0.3687800580871777, -0.1616348292691712, -0.14857502321824156, 0.2776831687939629, -0.12034602624884377, -0.19643815981001186, 0.29283086885862103, 0.03335072692568925, 0.1941407127764968, 0.054805131583199114, 0.17982468920395853, 0.09001921893599193, -0.006888657729600517, 0.1452036168026405, -0.0100045228101523, 0.18466440460015035, -0.08633505781082777, -0.11358346215869025, 0.029139164477770388, 0.16806587700495942]
|
1,803.03932
|
Cubic Range Error Model for Stereo Vision with Illuminators
|
Use of low-cost depth sensors, such as a stereo camera setup with
illuminators, is of particular interest for numerous applications ranging from
robotics and transportation to mixed and augmented reality. The ability to
quantify noise is crucial for these applications, e.g., when the sensor is used
for map generation or to develop a sensor scheduling policy in a multi-sensor
setup. Range error models provide uncertainty estimates and help weigh the data
correctly in instances where range measurements are taken from different
vantage points or with different sensors. The weighing is important to fuse
range data into a map in a meaningful way, i.e., the high confidence data is
relied on most heavily. Such a model is derived in this work. We show that the
range error for stereo systems with integrated illuminators is cubic and
validate the proposed model experimentally with an off-the-shelf structured
light stereo system. The experiments confirm the validity of the model and
simplify the application of this type of sensor in robotics. The proposed error
model is relevant to any stereo system with low ambient light where the main
light source is located at the camera system. Among others, this is the case
for structured light stereo systems and night stereo systems with headlights.
In this work, we propose that the range error is cubic in range for stereo
systems with integrated illuminators. Experimental validation with an
off-the-shelf structured light stereo system shows that the exponent is between
2.4 and 2.6. The deviation is attributed to our model considering only shot
noise.
|
cs.CV
|
use of lowcost depth sensors such as a stereo camera setup with illuminators is of particular interest for numerous applications ranging from robotics and transportation to mixed and augmented reality the ability to quantify noise is crucial for these applications eg when the sensor is used for map generation or to develop a sensor scheduling policy in a multisensor setup range error models provide uncertainty estimates and help weigh the data correctly in instances where range measurements are taken from different vantage points or with different sensors the weighing is important to fuse range data into a map in a meaningful way ie the high confidence data is relied on most heavily such a model is derived in this work we show that the range error for stereo systems with integrated illuminators is cubic and validate the proposed model experimentally with an offtheshelf structured light stereo system the experiments confirm the validity of the model and simplify the application of this type of sensor in robotics the proposed error model is relevant to any stereo system with low ambient light where the main light source is located at the camera system among others this is the case for structured light stereo systems and night stereo systems with headlights in this work we propose that the range error is cubic in range for stereo systems with integrated illuminators experimental validation with an offtheshelf structured light stereo system shows that the exponent is between 24 and 26 the deviation is attributed to our model considering only shot noise
|
[['use', 'of', 'lowcost', 'depth', 'sensors', 'such', 'as', 'a', 'stereo', 'camera', 'setup', 'with', 'illuminators', 'is', 'of', 'particular', 'interest', 'for', 'numerous', 'applications', 'ranging', 'from', 'robotics', 'and', 'transportation', 'to', 'mixed', 'and', 'augmented', 'reality', 'the', 'ability', 'to', 'quantify', 'noise', 'is', 'crucial', 'for', 'these', 'applications', 'eg', 'when', 'the', 'sensor', 'is', 'used', 'for', 'map', 'generation', 'or', 'to', 'develop', 'a', 'sensor', 'scheduling', 'policy', 'in', 'a', 'multisensor', 'setup', 'range', 'error', 'models', 'provide', 'uncertainty', 'estimates', 'and', 'help', 'weigh', 'the', 'data', 'correctly', 'in', 'instances', 'where', 'range', 'measurements', 'are', 'taken', 'from', 'different', 'vantage', 'points', 'or', 'with', 'different', 'sensors', 'the', 'weighing', 'is', 'important', 'to', 'fuse', 'range', 'data', 'into', 'a', 'map', 'in', 'a', 'meaningful', 'way', 'ie', 'the', 'high', 'confidence', 'data', 'is', 'relied', 'on', 'most', 'heavily', 'such', 'a', 'model', 'is', 'derived', 'in', 'this', 'work', 'we', 'show', 'that', 'the', 'range', 'error', 'for', 'stereo', 'systems', 'with', 'integrated', 'illuminators', 'is', 'cubic', 'and', 'validate', 'the', 'proposed', 'model', 'experimentally', 'with', 'an', 'offtheshelf', 'structured', 'light', 'stereo', 'system', 'the', 'experiments', 'confirm', 'the', 'validity', 'of', 'the', 'model', 'and', 'simplify', 'the', 'application', 'of', 'this', 'type', 'of', 'sensor', 'in', 'robotics', 'the', 'proposed', 'error', 'model', 'is', 'relevant', 'to', 'any', 'stereo', 'system', 'with', 'low', 'ambient', 'light', 'where', 'the', 'main', 'light', 'source', 'is', 'located', 'at', 'the', 'camera', 'system', 'among', 'others', 'this', 'is', 'the', 'case', 'for', 'structured', 'light', 'stereo', 'systems', 'and', 'night', 'stereo', 'systems', 'with', 'headlights', 'in', 'this', 'work', 'we', 'propose', 'that', 'the', 'range', 'error', 'is', 'cubic', 'in', 'range', 'for', 'stereo', 'systems', 'with', 'integrated', 'illuminators', 'experimental', 'validation', 'with', 'an', 'offtheshelf', 'structured', 'light', 'stereo', 'system', 'shows', 'that', 'the', 'exponent', 'is', 'between', '24', 'and', '26', 'the', 'deviation', 'is', 'attributed', 'to', 'our', 'model', 'considering', 'only', 'shot', 'noise']]
|
[-0.07166282996786322, 0.06203443631522987, -0.05344750974836643, 0.015138005931021326, -0.057605530770388214, -0.15825209394097328, 0.0156902462385915, 0.41137663891095144, -0.25904022119584624, -0.38074602342021535, 0.13052226334775696, -0.29370509155705804, -0.14747196899043047, 0.26712963335830864, -0.14172773962695828, 0.0978992988407299, 0.1166388028880192, 0.01630831792965637, -0.03910887692927645, -0.2054034699776821, 0.27905263337925135, 0.03731978724226792, 0.290066655670671, 0.01024681250555659, 0.1315858517768902, 0.02561828715442971, 0.005786492432889645, -0.010322735310182907, -0.048184264318905434, 0.1492744409331408, 0.26563446116479383, 0.13458665756661503, 0.23425337714434136, -0.3887136434932472, -0.24933764963134308, 0.09194880624818325, 0.10444789067963711, 0.061708112225460354, -0.05820073601353215, -0.31167769023068104, 0.08749461280967807, -0.14882927072540042, -0.06776024889040855, -0.03553979991193046, 0.009372163154694135, 0.017655236481004977, -0.32331115440888425, 0.027457767821033485, -0.01654835591762094, 0.08680592979908397, -0.06883360594383703, -0.08822175734906068, 0.026299186046344403, 0.1689521972472221, 0.00763812454579238, 0.04151108073074283, 0.12595561875036765, -0.13299246493534156, -0.07890468859386601, 0.40102534471225226, -0.04416293848589703, -0.16111581506265793, 0.22018898733495007, -0.08974134711752413, -0.11129330967014539, 0.09826037817310862, 0.21945899861509588, 0.08302918392382708, -0.17680357936416158, 0.03549571067139823, -0.02334828454968374, 0.2120931801473489, 0.01030464023915556, 0.026539028103798046, 0.1907077749756354, 0.22478862223033502, 0.07981449244107353, 0.1175246940820216, -0.16885102428022947, -0.051790044526569545, -0.2713450640035262, -0.12155959728625021, -0.17557671904887684, -0.03203149404362193, -0.08717793450938416, -0.11497373317979509, 0.3557754300927627, 0.2575400782588986, 0.20563142749779217, 0.03261649535011202, 0.36259247263660654, 0.09289384934118061, 0.06255945886005065, 0.054879711744433735, 0.25980733579581283, 0.06486753895569564, 0.1394412271965848, -0.13945974752869006, 0.04052882357063936, 0.006245086972739955]
|
1,803.03933
|
Towards a Gordon form of the Kerr spacetime
|
It is not currently known how to put the Kerr spacetime metric into the
so-called Gordon form, although the closely related Kerr-Schild form of the
Kerr metric is well known. A Gordon form for the Kerr geometry, if it could be
found, would be particularly useful in developing analogue models for the Kerr
spacetime, since the Gordon form is explicitly given in terms of the 4-velocity
and "refractive index" of an effective medium. In the current article we report
progress toward this goal. First we present the Gordon form for an
approximation to Kerr spacetime in the slow-rotation limit, obtained by
suitably modifying the well-known Lense-Thirring form of the slow-rotation
metric. Second we present the Gordon form for the Kerr spacetime in the
near-null limit, (the 4-velocity of the medium being close to null). That these
two perturbative approximations to the Kerr spacetime in Gordon form exist
gives us some confidence that ultimately one might be able to write the exact
Kerr spacetime in this form.
|
gr-qc
|
it is not currently known how to put the kerr spacetime metric into the socalled gordon form although the closely related kerrschild form of the kerr metric is well known a gordon form for the kerr geometry if it could be found would be particularly useful in developing analogue models for the kerr spacetime since the gordon form is explicitly given in terms of the 4velocity and refractive index of an effective medium in the current article we report progress toward this goal first we present the gordon form for an approximation to kerr spacetime in the slowrotation limit obtained by suitably modifying the wellknown lensethirring form of the slowrotation metric second we present the gordon form for the kerr spacetime in the nearnull limit the 4velocity of the medium being close to null that these two perturbative approximations to the kerr spacetime in gordon form exist gives us some confidence that ultimately one might be able to write the exact kerr spacetime in this form
|
[['it', 'is', 'not', 'currently', 'known', 'how', 'to', 'put', 'the', 'kerr', 'spacetime', 'metric', 'into', 'the', 'socalled', 'gordon', 'form', 'although', 'the', 'closely', 'related', 'kerrschild', 'form', 'of', 'the', 'kerr', 'metric', 'is', 'well', 'known', 'a', 'gordon', 'form', 'for', 'the', 'kerr', 'geometry', 'if', 'it', 'could', 'be', 'found', 'would', 'be', 'particularly', 'useful', 'in', 'developing', 'analogue', 'models', 'for', 'the', 'kerr', 'spacetime', 'since', 'the', 'gordon', 'form', 'is', 'explicitly', 'given', 'in', 'terms', 'of', 'the', '4velocity', 'and', 'refractive', 'index', 'of', 'an', 'effective', 'medium', 'in', 'the', 'current', 'article', 'we', 'report', 'progress', 'toward', 'this', 'goal', 'first', 'we', 'present', 'the', 'gordon', 'form', 'for', 'an', 'approximation', 'to', 'kerr', 'spacetime', 'in', 'the', 'slowrotation', 'limit', 'obtained', 'by', 'suitably', 'modifying', 'the', 'wellknown', 'lensethirring', 'form', 'of', 'the', 'slowrotation', 'metric', 'second', 'we', 'present', 'the', 'gordon', 'form', 'for', 'the', 'kerr', 'spacetime', 'in', 'the', 'nearnull', 'limit', 'the', '4velocity', 'of', 'the', 'medium', 'being', 'close', 'to', 'null', 'that', 'these', 'two', 'perturbative', 'approximations', 'to', 'the', 'kerr', 'spacetime', 'in', 'gordon', 'form', 'exist', 'gives', 'us', 'some', 'confidence', 'that', 'ultimately', 'one', 'might', 'be', 'able', 'to', 'write', 'the', 'exact', 'kerr', 'spacetime', 'in', 'this', 'form']]
|
[-0.13782336309563414, 0.06214962097418534, -0.08997025421225531, 0.1019144424171389, -0.16773390164598823, -0.09919223256064831, -0.02384832416414227, 0.31108676093133975, -0.19035913611773447, -0.25363921332565775, 0.0982089320720869, -0.2646729271236179, -0.16843234413269773, 0.2149215916856136, -0.07253291983022747, 0.03465757087428482, -0.03990010564364156, 0.06343241915224591, -0.0534848279757313, -0.2261886312205524, 0.3712241885712348, 0.08562592431308186, 0.2500462169753365, 0.0036950262336352146, 0.07802131714675216, 0.0018245162048197564, 0.012649878786234409, 0.030007876153524786, -0.1344381508082383, 0.09004716019087236, 0.21394731571255915, 0.1033295275003885, 0.21236700111865459, -0.40966196428894636, -0.2005027645458299, 0.04755071673089223, 0.16431200591193693, 0.14592742267855813, -0.06626458995111556, -0.31531975392521505, 0.03692567397290504, -0.1610111805080178, -0.21411519959086486, -0.10481992600407138, 0.04773788018915129, -0.06144813538517758, -0.20264020209559744, 0.05725355394214745, 0.1102820397330117, -0.08705094212060233, -0.06938087854377296, -0.04196756141798862, 0.032267196481228326, 0.09549954877212553, 0.07110148317851014, 0.05283848798962826, 0.06619868993041027, -0.08914654110053397, -0.06968604223781646, 0.4096027504405882, -0.10759739471210328, -0.28227568680072673, 0.10452598700277417, -0.237848848574346, -0.0822339215770319, 0.07305379222001297, 0.15542722746438112, 0.15284642467768975, -0.1734474599754146, 0.11090245061092562, -0.03904881800177047, 0.1223149096561001, 0.1826537033397121, 0.03569035614694817, 0.24737869959369482, 0.06835483288790761, 0.025522501390225376, 0.1435253861933913, -0.013845845425770763, -0.07915783607602928, -0.3197422926952356, -0.16764444427870506, -0.15385798522248775, 0.1437162746779981, -0.1528597278379329, -0.17431062725597027, 0.32911733098479595, 0.1308672803104154, 0.15893876604197255, -0.01106966017459306, 0.26013443579249285, 0.15961391035977932, 0.04323929104482733, 0.12580837987935597, 0.3564646562166212, 0.13460256954716765, 0.11436737544206252, -0.18348921852656894, 0.004361625177314483, 0.10224500069596681]
|
1,803.03934
|
Empirical bounds for functions with weak interactions
|
We provide sharp empirical estimates of expectation, variance and normal
approximation for a class of statistics whose variation in any argument does
not change too much when another argument is modified. Examples of such weak
interactions are furnished by U- and V-statistics, Lipschitz L-statistics and
various error functionals of L2-regularized algorithms and Gibbs algorithms.
|
stat.ML
|
we provide sharp empirical estimates of expectation variance and normal approximation for a class of statistics whose variation in any argument does not change too much when another argument is modified examples of such weak interactions are furnished by u and vstatistics lipschitz lstatistics and various error functionals of l2regularized algorithms and gibbs algorithms
|
[['we', 'provide', 'sharp', 'empirical', 'estimates', 'of', 'expectation', 'variance', 'and', 'normal', 'approximation', 'for', 'a', 'class', 'of', 'statistics', 'whose', 'variation', 'in', 'any', 'argument', 'does', 'not', 'change', 'too', 'much', 'when', 'another', 'argument', 'is', 'modified', 'examples', 'of', 'such', 'weak', 'interactions', 'are', 'furnished', 'by', 'u', 'and', 'vstatistics', 'lipschitz', 'lstatistics', 'and', 'various', 'error', 'functionals', 'of', 'l2regularized', 'algorithms', 'and', 'gibbs', 'algorithms']]
|
[-0.0704757083526433, 0.08261366314427168, -0.11855400191227629, 0.19686779858656572, -0.07605227771973996, -0.18146329986241957, 0.0840197973712175, 0.39352402177259876, -0.2579768637596216, -0.2905059292464069, 0.11832334999107169, -0.27456030021939015, -0.13727257207156746, 0.21895015695028835, -0.1100740926598923, 0.0858864833307625, 0.06967974130788611, 0.04081201208033168, -0.12078634511541438, -0.25128375243878476, 0.283912269747816, -0.009543057013716962, 0.2490810741049548, 0.04924665095664009, 0.08791357641004854, -0.008067265385761857, -0.027550246894221614, 0.0633882092919925, -0.1591987006055812, 0.12721920943025639, 0.1873349298774782, 0.10967649538414898, 0.36520493268552756, -0.3635859166065024, -0.18029854467345607, 0.20180646807421, 0.11888542769183577, 0.0924860833350707, -0.021349379284031415, -0.2850588830360384, 0.05434128771163092, -0.11416654813068884, -0.12175821575888053, -0.1373189048565648, -0.010599858541455533, 0.13135600146941012, -0.3610190881536929, 0.14661684756477675, 0.15171735257091415, 0.07224746647773793, -0.04897794270180856, -0.1508731999632868, 0.019715470440806477, 0.04502670868586628, 0.08429539743681541, 0.016269373018682625, 0.09711909654746435, -0.09538669310320445, -0.07913308866597989, 0.2942938821183311, -0.0876902381768795, -0.25297156535089016, 0.17221912576092613, -0.1182116782034023, -0.14758240134041342, 0.11112217092024232, 0.12925107287311996, 0.12216614172104057, -0.13596434175188835, 0.1579875199822709, 0.012747404665720684, 0.11509464577668244, 0.040664084954187274, 0.04236506006714923, 0.050580823380086154, 0.03693176433875191, 0.13281667538642608, 0.06374448461940994, -0.026524496756287083, -0.09260264396046598, -0.37026751827862525, -0.09583282631097569, -0.24327715179296555, 0.05069265603028557, -0.15732714493168276, -0.26082283037680165, 0.3222261741757393, 0.10018857527110311, 0.16815745668416773, 0.1293660703253139, 0.25518384468914185, 0.15317821695848746, 0.006148881123711665, 0.08607427624951082, 0.1943795991871782, 0.14842817768954705, 0.04191925490481986, -0.12778114449853697, 0.1441061987058708, 0.14296661948578226]
|
1,803.03935
|
Duality and ground-state phase diagram for the quantum XYZ model with
arbitrary spin $s$ in one spatial dimension
|
Five duality transformations are unveiled for the quantum XYZ model with
arbitrary spin $s$ in one spatial dimension. The presence of these duality
transformations drastically reduces the entire ground-state phase diagram to
two {\it finite} regimes - the principal regimes, with all the other ten
regimes dual to them. Combining with the determination of critical points from
the conventional order parameter approach and/or the fidelity approach to
quantum phase transitions, we are able to map out the ground-state phase
diagram for the quantum XYZ model with arbitrary spin $s$. This is explicitly
demonstrated for $s=1/2,1,3/2$ and 2. As it turns out, all the critical points,
with central charge $c=1$, are self-dual under a respective duality
transformation for half-integer as well as integer spin $s$. However, in the
latter case, the presence of the so-called symmetry protected topological
phase, i.e., the Haldane phase, results in extra lines of critical points with
central charge $c=1/2$, which is not self-dual under any duality
transformation.
|
cond-mat.str-el cond-mat.stat-mech
|
five duality transformations are unveiled for the quantum xyz model with arbitrary spin s in one spatial dimension the presence of these duality transformations drastically reduces the entire groundstate phase diagram to two it finite regimes the principal regimes with all the other ten regimes dual to them combining with the determination of critical points from the conventional order parameter approach andor the fidelity approach to quantum phase transitions we are able to map out the groundstate phase diagram for the quantum xyz model with arbitrary spin s this is explicitly demonstrated for s12132 and 2 as it turns out all the critical points with central charge c1 are selfdual under a respective duality transformation for halfinteger as well as integer spin s however in the latter case the presence of the socalled symmetry protected topological phase ie the haldane phase results in extra lines of critical points with central charge c12 which is not selfdual under any duality transformation
|
[['five', 'duality', 'transformations', 'are', 'unveiled', 'for', 'the', 'quantum', 'xyz', 'model', 'with', 'arbitrary', 'spin', 's', 'in', 'one', 'spatial', 'dimension', 'the', 'presence', 'of', 'these', 'duality', 'transformations', 'drastically', 'reduces', 'the', 'entire', 'groundstate', 'phase', 'diagram', 'to', 'two', 'it', 'finite', 'regimes', 'the', 'principal', 'regimes', 'with', 'all', 'the', 'other', 'ten', 'regimes', 'dual', 'to', 'them', 'combining', 'with', 'the', 'determination', 'of', 'critical', 'points', 'from', 'the', 'conventional', 'order', 'parameter', 'approach', 'andor', 'the', 'fidelity', 'approach', 'to', 'quantum', 'phase', 'transitions', 'we', 'are', 'able', 'to', 'map', 'out', 'the', 'groundstate', 'phase', 'diagram', 'for', 'the', 'quantum', 'xyz', 'model', 'with', 'arbitrary', 'spin', 's', 'this', 'is', 'explicitly', 'demonstrated', 'for', 's12132', 'and', '2', 'as', 'it', 'turns', 'out', 'all', 'the', 'critical', 'points', 'with', 'central', 'charge', 'c1', 'are', 'selfdual', 'under', 'a', 'respective', 'duality', 'transformation', 'for', 'halfinteger', 'as', 'well', 'as', 'integer', 'spin', 's', 'however', 'in', 'the', 'latter', 'case', 'the', 'presence', 'of', 'the', 'socalled', 'symmetry', 'protected', 'topological', 'phase', 'ie', 'the', 'haldane', 'phase', 'results', 'in', 'extra', 'lines', 'of', 'critical', 'points', 'with', 'central', 'charge', 'c12', 'which', 'is', 'not', 'selfdual', 'under', 'any', 'duality', 'transformation']]
|
[-0.1724944560899862, 0.19467821817716244, -0.03621941877370876, 0.03691720935360839, -0.01646829284317557, -0.20321241695633005, 0.07846566534062273, 0.3286196154266971, -0.24883848682936258, -0.2640759890793629, 0.08667625182633341, -0.29034067489464516, -0.13234549387703715, 0.14533216123316883, 0.025235995185362327, 0.07466080726333747, -0.04711548422401736, 0.04135943329969931, -0.16408648969804715, -0.241087791887727, 0.32428349454963357, -0.03623060201391367, 0.29653670022018114, 0.02697294334069761, 0.07195859497600475, 0.03420687762144719, 0.051981623698927976, 0.01007005823746839, -0.11711954045747905, 0.029365060506857135, 0.2754181685986337, 0.012372105028743873, 0.1246925324564741, -0.3693228417644336, -0.2040333697783216, 0.13295276799830813, 0.13433638570607645, 0.1309489663419425, 0.001406819647494352, -0.28760246341936757, 0.069043049331075, -0.1410213971639392, -0.1579248826824855, -0.11467090818691272, 0.01700831807376641, -0.030098873733121128, -0.24288591684820424, 0.05025181913199804, 0.08284061924047745, 0.06677724819911539, -0.05156557046978166, -0.09444886764054591, -0.07694574369486633, 0.12371380172256943, 0.03799658742002592, 0.08090984350679524, 0.08717561729395844, -0.11555061712656053, -0.12448166012976307, 0.36386378355464843, -0.006743340289554084, -0.20856905988646005, 0.18715318593448438, -0.16097057709446963, -0.14416627874363613, 0.13610936336969054, 0.02651369544595433, 0.10205865706428417, -0.081441794809118, 0.11778912411485769, -0.0092194818674862, 0.14403151583699686, 0.03321624834840215, 0.06512998684555432, 0.25970699528595376, 0.07195054427259338, 0.07676237393990627, 0.18255997873892504, -0.10196774430538574, -0.1911323633214822, -0.34084383552929143, -0.1523918443880741, -0.16215018905939405, 0.05174439108746387, -0.13474430750355157, -0.1345176786278029, 0.3875485342113102, 0.12286719399849949, 0.1928631414559746, -0.010641649455482245, 0.22616573191195163, 0.12871216937867375, 0.07371464016577874, 0.04284170523590449, 0.21410953112052017, 0.1417048682616848, 0.05765591958338547, -0.2516152764415755, -0.008725739974505122, 0.13363608419192288]
|
1,803.03936
|
K-theory for generalized Lamplighter groups
|
We compute K-theory for the reduced group C*-algebras of generalized
Lamplighter groups.
|
math.KT math.OA
|
we compute ktheory for the reduced group calgebras of generalized lamplighter groups
|
[['we', 'compute', 'ktheory', 'for', 'the', 'reduced', 'group', 'calgebras', 'of', 'generalized', 'lamplighter', 'groups']]
|
[-0.1824678983539343, 0.12290926347486675, -0.11530895515655477, 0.16791806680460772, -0.08343378578623135, -0.11671006353572011, 0.027889525207380455, 0.42929133120924234, -0.43649434732894105, -0.14500490195738772, 0.11705363848401855, -0.23005274218060853, -0.1144752538530156, 0.2084894465903441, -0.2515107385503749, -0.10377293995892008, 0.03313345636706799, 0.17507282830774784, -0.20545487136890492, -0.2822249682309727, 0.45361759948233765, -0.03396815097463938, 0.23078447300940752, 0.004449313506484032, 0.0638093581267943, 0.060031819312522806, -0.1166886705905199, -0.017968605738133192, -0.15052779577672482, 0.13312174348781505, 0.38637460116297007, -0.06900078058242798, 0.14209305743376413, -0.3651109803467989, -0.13354838204880556, 0.32351004976468783, 0.09361450265472133, -0.03464077847699324, -0.05968488225092491, -0.3551982461164395, 0.1244538043004771, -0.40595101813475293, -0.1065142503939569, -0.14331167253355184, 0.11703965595612924, -0.06305651584019263, -0.14573011285877632, 0.021068892364079755, -0.019372447859495878, 0.15776380997461578, -0.1347173050356408, -0.06292175129055977, -0.05586541180188457, 0.22872162206719318, -0.11971715232357383, -0.1586035347621267, 0.23581973110170415, 0.014621083935101828, -0.20164935368423662, 0.4659930616617203, -0.045753391459584236, -0.12936841944853464, 0.0471276487223804, -0.204859904324015, -0.40633268747478724, 0.14220341326047978, 0.061941673047840595, 0.1808244132747253, 0.14625678661589822, 0.21264692263988158, -0.20838123792782426, -0.010925708978902549, -0.04540597585340341, -0.03498543558331827, -0.10359378671273589, -0.012697754505400857, 0.09952983873275419, 0.18756650543461242, 0.20815811151017746, 0.03626866943280523, -0.2403757863988479, -0.22379591409116983, -0.0674561435977618, 0.1671790713832403, -0.17447806044947356, -0.17485991293021166, 0.4854622234900792, 0.07504142192192376, 0.02900666619340579, 0.28729732776992023, 0.1322490001718203, 0.0631259527678291, 0.07745262157792847, 0.08726568512308101, -0.02941258515541752, 0.44677009526640177, -0.18264600463832417, -0.16800666258980831, -0.15493688123145452, 0.45480519781510037]
|
1,803.03937
|
From Tarski to G\"odel. Or, how to derive the Second Incompleteness
Theorem from the Undefinability of Truth without Self-reference
|
In this paper, we provide a fairly general self-reference-free proof of the
Second Incompleteness Theorem from Tarski's Theorem of the Undefinability of
Truth.
|
math.LO
|
in this paper we provide a fairly general selfreferencefree proof of the second incompleteness theorem from tarskis theorem of the undefinability of truth
|
[['in', 'this', 'paper', 'we', 'provide', 'a', 'fairly', 'general', 'selfreferencefree', 'proof', 'of', 'the', 'second', 'incompleteness', 'theorem', 'from', 'tarskis', 'theorem', 'of', 'the', 'undefinability', 'of', 'truth']]
|
[-0.07475552860308778, -0.05028707788071849, -0.22289867834611374, 0.14759984135691245, -0.10327362785623832, -0.0625859817108986, 0.17721604323543777, 0.18815255668860945, -0.24215140989558262, -0.29429483091966674, 0.10092830623563548, -0.18102087554606525, -0.12404952655461701, 0.20540937849066473, -0.25818957172503526, -0.02115735864605416, 0.09285066598518328, 0.037778815583971496, -0.056053454310379246, -0.23024554465982047, 0.400953390381553, -0.05560468255796216, 0.21354150060902943, 0.17065917505798014, 0.09228413031351837, 0.08001545008102601, -0.058635651133954525, -0.004640774356878616, -0.1525953574190763, 0.24104293071749536, 0.2905689774673771, 0.19657182100821624, 0.35185255347327754, -0.3604435612532226, -0.04684174577745249, 0.10385709746994755, 0.0014583035372197628, 0.22380099216984076, -0.01987771204122427, -0.31483773988756264, 0.1157886620441621, -0.1739509008316831, -0.18956662189554085, -0.03673228756947951, -0.02526735235005617, 0.01432033052498644, -0.19773250835185702, 0.14527506178075617, 0.32782235326753423, 0.13206937684762207, -0.09007724088786001, -0.06885868979258124, 0.041369894879277454, 0.07592546188441868, 0.05449439847672528, 0.05223658634349704, 0.017584796423431148, -0.06992173189593648, -0.14303558760068633, 0.3984825773672624, -0.02768714725971222, -0.1253610443831845, 0.09190042325380174, -0.1160449192181907, -0.2545008108824153, 0.050741661678661, 0.09052961099554192, 0.18653005835684863, -0.14625003866174005, 0.11619253812188451, -0.17764541066505693, 0.16610407338223673, 0.1428331212902611, 0.06391584923469716, 0.13371880756775764, 0.1444906592792408, 0.0755102070979774, 0.1984059846198017, -0.003488056319342418, -0.07447481324726885, -0.456031781705943, -0.1895948668772524, -0.2130697091872042, 0.1315947859124704, -0.08646320864896882, -0.22882635620507327, 0.3422405374321071, 0.24006433535197919, 0.11632143875414674, 0.22752403235062957, 0.3146306410093199, 0.12229757468131455, -0.018688608934594828, -0.001433697613802823, 0.22337950427423825, 0.22913633198053998, 0.12463708547875285, -0.023685399317235515, 0.04104220414195548, 0.1676871606826105]
|
1,803.03938
|
On monogenic functions defined in different commutative algebras
|
A correspondence between a monogenic function in an arbitrary
finite-dimensional commutative associative algebra and a finite set of
monogenic functions in a special commutative associative algebra is
established.
|
math.AC
|
a correspondence between a monogenic function in an arbitrary finitedimensional commutative associative algebra and a finite set of monogenic functions in a special commutative associative algebra is established
|
[['a', 'correspondence', 'between', 'a', 'monogenic', 'function', 'in', 'an', 'arbitrary', 'finitedimensional', 'commutative', 'associative', 'algebra', 'and', 'a', 'finite', 'set', 'of', 'monogenic', 'functions', 'in', 'a', 'special', 'commutative', 'associative', 'algebra', 'is', 'established']]
|
[-0.21450160679939603, 0.03622890023117569, -0.046103924446340115, 0.1296706553756459, -0.16737693228891917, -0.18031027972964303, -0.11787206220573612, 0.3610281640929835, -0.44590697437524796, -0.0586171737605972, 0.08452228557351711, -0.18428813028315613, -0.1606090608152694, 0.21869943979462342, -0.15095729640285885, -0.013324998053056853, 0.01853448072714465, 0.19500067424295203, -0.2066369671041944, -0.17846285458654165, 0.3827484843454191, -0.03484322257073862, 0.20449416898190975, -0.027059538389689157, 0.2189751592065607, 0.08508360465722424, -0.04430420764921499, -0.01750758007567908, -0.10420142782719008, 0.061755924518885355, 0.4125336980713265, 0.059763077912586074, 0.27446811606309246, -0.38020804610901643, -0.03028792532027832, 0.2784552391884582, 0.1747075656561979, -0.04851702853505101, -0.04841682278285069, -0.22497655504516192, 0.03707684065947043, -0.3415958265374814, -0.04520387633237988, -0.023351397681316093, 0.18434225017803588, -0.020594587017382895, -0.3690623860540135, -0.011728104536554642, 0.09358838746058089, 0.2847935258011733, -0.17219896208760993, -0.01680602878332138, -0.0708315915710825, 0.007051354074584586, -0.22591856438832889, 0.12688447644801013, 0.10384239602301802, -0.03729813552594611, -0.19452471725110496, 0.25076715242383735, 0.021867521406550492, -0.3686913334365402, 0.09374459350614675, -0.22780239642348274, -0.14705623180738517, 0.0524411222307078, 0.0005615960274423872, 0.13447188506168978, -0.06860988843254745, 0.3299308339379162, -0.2401323398974325, 0.03250644193030894, 0.09712122670108718, 0.02276587313307183, 0.12982997704031213, 0.08200757172224778, 0.017100596201739142, 0.21283487962292774, 0.225342685090644, -0.05333414687109845, -0.39724608031766756, -0.19314948176699026, -0.1524500349270446, 0.18699223075860313, -0.19451377931597694, -0.2851738282479346, 0.44446111576897757, 0.02183534058609179, 0.16744082589035056, 0.11309112036334616, 0.19026551555309976, 0.09544605611725794, 0.14622869362522448, 0.002009719460537391, 0.022134728729724884, 0.3583207833996442, 0.0009892560275537626, -0.026411686109245887, -0.11371698361887995, 0.2674065420537123]
|
1,803.03939
|
50 Years of Permutation, Spatial and Index Modulation: From Classic RF
to Visible Light Communications and Data Storage
|
In this treatise, we provide an interdisciplinary survey on spatial
modulation (SM), where multiple-input multiple-output microwave and visible
light, as well as single and multicarrier communications are considered.
Specifically, we first review the permutation modulation (PM) concept, which
was originally proposed by Slepian in 1965. The PM concept has been applied to
a wide range of applications, including wired and wireless communications and
data storage. By introducing a three-dimensional signal representation, which
consists of spatial, temporal and frequency axes, the hybrid PM concept is
shown to be equivalent to the recently proposed SM family. In contrast to other
survey papers, this treatise aims for celebrating the hitherto overlooked
studies, including papers and patents that date back to the 1960s, before the
invention of SM. We also provide simulation results that demonstrate the pros
and cons of PM-aided low-complexity schemes over conventional multiplexing
schemes.
|
eess.SP
|
in this treatise we provide an interdisciplinary survey on spatial modulation sm where multipleinput multipleoutput microwave and visible light as well as single and multicarrier communications are considered specifically we first review the permutation modulation pm concept which was originally proposed by slepian in 1965 the pm concept has been applied to a wide range of applications including wired and wireless communications and data storage by introducing a threedimensional signal representation which consists of spatial temporal and frequency axes the hybrid pm concept is shown to be equivalent to the recently proposed sm family in contrast to other survey papers this treatise aims for celebrating the hitherto overlooked studies including papers and patents that date back to the 1960s before the invention of sm we also provide simulation results that demonstrate the pros and cons of pmaided lowcomplexity schemes over conventional multiplexing schemes
|
[['in', 'this', 'treatise', 'we', 'provide', 'an', 'interdisciplinary', 'survey', 'on', 'spatial', 'modulation', 'sm', 'where', 'multipleinput', 'multipleoutput', 'microwave', 'and', 'visible', 'light', 'as', 'well', 'as', 'single', 'and', 'multicarrier', 'communications', 'are', 'considered', 'specifically', 'we', 'first', 'review', 'the', 'permutation', 'modulation', 'pm', 'concept', 'which', 'was', 'originally', 'proposed', 'by', 'slepian', 'in', '1965', 'the', 'pm', 'concept', 'has', 'been', 'applied', 'to', 'a', 'wide', 'range', 'of', 'applications', 'including', 'wired', 'and', 'wireless', 'communications', 'and', 'data', 'storage', 'by', 'introducing', 'a', 'threedimensional', 'signal', 'representation', 'which', 'consists', 'of', 'spatial', 'temporal', 'and', 'frequency', 'axes', 'the', 'hybrid', 'pm', 'concept', 'is', 'shown', 'to', 'be', 'equivalent', 'to', 'the', 'recently', 'proposed', 'sm', 'family', 'in', 'contrast', 'to', 'other', 'survey', 'papers', 'this', 'treatise', 'aims', 'for', 'celebrating', 'the', 'hitherto', 'overlooked', 'studies', 'including', 'papers', 'and', 'patents', 'that', 'date', 'back', 'to', 'the', '1960s', 'before', 'the', 'invention', 'of', 'sm', 'we', 'also', 'provide', 'simulation', 'results', 'that', 'demonstrate', 'the', 'pros', 'and', 'cons', 'of', 'pmaided', 'lowcomplexity', 'schemes', 'over', 'conventional', 'multiplexing', 'schemes']]
|
[-0.12329960663878346, 0.06077827022398222, -0.04293681311578503, -0.011688647373426954, -0.12072153963004305, -0.14894250498979655, 0.033019633406222285, 0.3639613368030323, -0.22948343106742267, -0.30042973616239155, 0.08506914180077114, -0.2645554971671335, -0.18548185285508736, 0.20865014691273093, -0.1280542818868769, 0.06504036945661425, -0.0070505713638980725, -0.027608845756359687, -0.042090622891842476, -0.2799011515592828, 0.24096125164265994, 0.11150055661351538, 0.36819798922048175, 0.030491947235775665, 0.09174641820849706, 0.02898422807035312, -0.0914524332980927, -0.057621103390054385, -0.13932232253147292, 0.10343792331470571, 0.3134398733619863, 0.16565403989909716, 0.29614952330241423, -0.36642158249209467, -0.25922462351384085, 0.08596774515971331, 0.18315016556839445, 0.06586112403376422, -0.07853707478526803, -0.32481482835702963, 0.10937030849532342, -0.21721791269743002, -0.06600949514827782, -0.025471061913290023, 0.006400688341490819, 0.021207048118271878, -0.24777271375912702, 0.034545511175988204, 0.02072698489228316, 0.10958177593543234, -0.00317135632356209, -0.14238517196573527, 0.052124833397921434, 0.07787434681987679, 0.03918632610969928, 0.02870004786044018, 0.03752108520506815, -0.04464584485706414, -0.15586828791313398, 0.38633634902423736, -0.04561015055514872, -0.141216516645599, 0.15852716011257553, -0.08793075349260594, -0.1204832543355198, 0.09133053933840875, 0.20801194066273598, 0.06962143551086036, -0.2013656657777766, 0.08700825201886916, -0.005524260096881591, 0.16105041780154888, 0.11411844546132734, 0.11153660417521294, 0.20051344338325705, 0.174345472604561, 0.04835761058419733, 0.10093764338476754, -0.1354566892759848, -0.13050736319011366, -0.21604619460495214, -0.1476434304618316, -0.1696366900512555, 0.0036989051838812064, 0.0008744905647636444, -0.08226201888136926, 0.4101939809600442, 0.16251365446262586, 0.10390288715946003, 0.003391743872091699, 0.347822303621387, 0.06116356944803043, 0.08999128509509627, 0.04154461789974602, 0.25492085060629416, 0.16420887329641887, 0.17323712780858508, -0.12300033365789487, 0.00440335597082133, 0.024768414762868007]
|
1,803.0394
|
Electrical transient laws in neuronal microdomains based on
electro-diffusion
|
The current-voltage (I-V) conversion characterizes the physiology of cellular
microdomains and reflects cellular communication, excitability, and electrical
transduction. Yet deriving such I-V laws remains a major challenge in most
cellular microdomains due to their small sizes and the difficulty of accessing
voltage with a high nanometer precision. We present here novel analytical
relations derived for different numbers of ionic species inside a neuronal
micro/nano-domains, such as dendritic spines. When a steady-state current is
injected, we find a large deviation from the classical Ohm's law, showing that
the spine neck resistance is insuficent to characterize electrical properties.
For a constricted spine neck, modeled by a hyperboloid, we obtain a new I-V law
that illustrates the consequences of narrow passages on electrical conduction.
Finally, during a fast current transient, the local voltage is modulated by the
distance between activated voltage-gated channels. To conclude,
electro-diffusion laws can now be used to interpret voltage distribution in
neuronal microdomains.
|
q-bio.NC math.AP physics.bio-ph
|
the currentvoltage iv conversion characterizes the physiology of cellular microdomains and reflects cellular communication excitability and electrical transduction yet deriving such iv laws remains a major challenge in most cellular microdomains due to their small sizes and the difficulty of accessing voltage with a high nanometer precision we present here novel analytical relations derived for different numbers of ionic species inside a neuronal micronanodomains such as dendritic spines when a steadystate current is injected we find a large deviation from the classical ohms law showing that the spine neck resistance is insuficent to characterize electrical properties for a constricted spine neck modeled by a hyperboloid we obtain a new iv law that illustrates the consequences of narrow passages on electrical conduction finally during a fast current transient the local voltage is modulated by the distance between activated voltagegated channels to conclude electrodiffusion laws can now be used to interpret voltage distribution in neuronal microdomains
|
[['the', 'currentvoltage', 'iv', 'conversion', 'characterizes', 'the', 'physiology', 'of', 'cellular', 'microdomains', 'and', 'reflects', 'cellular', 'communication', 'excitability', 'and', 'electrical', 'transduction', 'yet', 'deriving', 'such', 'iv', 'laws', 'remains', 'a', 'major', 'challenge', 'in', 'most', 'cellular', 'microdomains', 'due', 'to', 'their', 'small', 'sizes', 'and', 'the', 'difficulty', 'of', 'accessing', 'voltage', 'with', 'a', 'high', 'nanometer', 'precision', 'we', 'present', 'here', 'novel', 'analytical', 'relations', 'derived', 'for', 'different', 'numbers', 'of', 'ionic', 'species', 'inside', 'a', 'neuronal', 'micronanodomains', 'such', 'as', 'dendritic', 'spines', 'when', 'a', 'steadystate', 'current', 'is', 'injected', 'we', 'find', 'a', 'large', 'deviation', 'from', 'the', 'classical', 'ohms', 'law', 'showing', 'that', 'the', 'spine', 'neck', 'resistance', 'is', 'insuficent', 'to', 'characterize', 'electrical', 'properties', 'for', 'a', 'constricted', 'spine', 'neck', 'modeled', 'by', 'a', 'hyperboloid', 'we', 'obtain', 'a', 'new', 'iv', 'law', 'that', 'illustrates', 'the', 'consequences', 'of', 'narrow', 'passages', 'on', 'electrical', 'conduction', 'finally', 'during', 'a', 'fast', 'current', 'transient', 'the', 'local', 'voltage', 'is', 'modulated', 'by', 'the', 'distance', 'between', 'activated', 'voltagegated', 'channels', 'to', 'conclude', 'electrodiffusion', 'laws', 'can', 'now', 'be', 'used', 'to', 'interpret', 'voltage', 'distribution', 'in', 'neuronal', 'microdomains']]
|
[-0.15516774969556105, 0.15936718938725167, -0.0080296114197393, 0.040272113627380396, -0.046479268276782115, -0.19151011254871264, 0.09110342981569518, 0.3511952246404498, -0.32044110281506283, -0.26113957486047995, 0.03554530024427406, -0.22636276239676303, -0.19786521074925795, 0.23042627963188447, -0.09711576631985065, 0.014824260612122567, -0.002169846521849793, -0.03601652185668507, 0.01672814795931213, -0.11415220142991625, 0.21200740484116404, 0.028607617915105566, 0.3345388909832476, 0.0845172314193884, 0.11668741857590105, -0.07303638500467825, 0.00457414002219019, 0.07707051974169812, -0.12301219762957771, 0.09210227096551343, 0.2503906187086709, 0.07149997769279014, 0.2364314036125219, -0.49310710230891247, -0.2307833508300399, 0.05249987894326056, 0.1642607741676712, 0.1258909757537032, -0.05212435998423883, -0.2245632675874635, 0.09129295850097581, -0.15092768556573183, -0.12565165370898812, -0.03110533959759203, 0.06299172393291404, 0.10413975068092297, -0.22266799215331526, 0.1310879455122631, 0.03773456453468258, 0.08654610509831018, -0.06591411762239754, -0.06676891814200453, -0.04220676936797405, 0.16230868929261832, -0.0042844110721489415, -0.035074107413253695, 0.25750551247620024, -0.16415657350481333, -0.08378079536334171, 0.3260691711237948, -0.010401762848471807, -0.14877387304563613, 0.17956196401409166, -0.16934130498894343, -0.08740397730511368, 0.14254025865873127, 0.14130248579941077, 0.026372852697405552, -0.20143646605844734, 0.011312636894887729, 0.015966408720583115, 0.15753478827690215, 0.08797655305610724, -0.0008080256980304655, 0.23973133182153106, 0.2398238450474118, 0.03251721808766505, 0.14761576792883907, -0.13115033562491207, -0.050894459023287424, -0.2786055108046735, -0.15346949411009278, -0.16038137871931357, 0.1221833083790874, -0.07086315424777767, -0.1864478998498893, 0.41805753407779295, 0.07911682557651627, 0.2055701791541651, 0.06512889599635903, 0.2966037723848498, 0.11423016127254844, 0.07860793569278413, 0.044390250888873675, 0.2113776124437879, 0.17556542630374775, 0.15589758384004726, -0.2639946750852304, 0.1373914715352983, 0.009085708487729886]
|
1,803.03941
|
Calibration of Local Volatility Model with Stochastic Interest Rates by
Efficient Numerical PDE Method
|
Long maturity options or a wide class of hybrid products are evaluated using
a local volatility type modelling for the asset price S(t) with a stochastic
interest rate r(t). The calibration of the local volatility function is usually
time-consuming because of the multi-dimensional nature of the problem. In this
paper, we develop a calibration technique based on a partial differential
equation (PDE) approach which allows an efficient implementation. The essential
idea is based on solving the derived forward equation satisfied by P(t; S;
r)Z(t; S; r), where P(t; S; r) represents the risk neutral probability density
of (S(t); r(t)) and Z(t; S; r) the projection of the stochastic discounting
factor in the state variables (S(t); r(t)). The solution provides effective and
sufficient information for the calibration and pricing. The PDE solver is
constructed by using ADI (Alternative Direction Implicit) method based on an
extension of the Peaceman-Rachford scheme. Furthermore, an efficient algorithm
to compute all the corrective terms in the local volatility function due to the
stochastic interest rates is proposed by using the PDE solutions and grid
points. Different numerical experiments are examined and compared to
demonstrate the results of our theoretical analysis.
|
q-fin.MF
|
long maturity options or a wide class of hybrid products are evaluated using a local volatility type modelling for the asset price st with a stochastic interest rate rt the calibration of the local volatility function is usually timeconsuming because of the multidimensional nature of the problem in this paper we develop a calibration technique based on a partial differential equation pde approach which allows an efficient implementation the essential idea is based on solving the derived forward equation satisfied by pt s rzt s r where pt s r represents the risk neutral probability density of st rt and zt s r the projection of the stochastic discounting factor in the state variables st rt the solution provides effective and sufficient information for the calibration and pricing the pde solver is constructed by using adi alternative direction implicit method based on an extension of the peacemanrachford scheme furthermore an efficient algorithm to compute all the corrective terms in the local volatility function due to the stochastic interest rates is proposed by using the pde solutions and grid points different numerical experiments are examined and compared to demonstrate the results of our theoretical analysis
|
[['long', 'maturity', 'options', 'or', 'a', 'wide', 'class', 'of', 'hybrid', 'products', 'are', 'evaluated', 'using', 'a', 'local', 'volatility', 'type', 'modelling', 'for', 'the', 'asset', 'price', 'st', 'with', 'a', 'stochastic', 'interest', 'rate', 'rt', 'the', 'calibration', 'of', 'the', 'local', 'volatility', 'function', 'is', 'usually', 'timeconsuming', 'because', 'of', 'the', 'multidimensional', 'nature', 'of', 'the', 'problem', 'in', 'this', 'paper', 'we', 'develop', 'a', 'calibration', 'technique', 'based', 'on', 'a', 'partial', 'differential', 'equation', 'pde', 'approach', 'which', 'allows', 'an', 'efficient', 'implementation', 'the', 'essential', 'idea', 'is', 'based', 'on', 'solving', 'the', 'derived', 'forward', 'equation', 'satisfied', 'by', 'pt', 's', 'rzt', 's', 'r', 'where', 'pt', 's', 'r', 'represents', 'the', 'risk', 'neutral', 'probability', 'density', 'of', 'st', 'rt', 'and', 'zt', 's', 'r', 'the', 'projection', 'of', 'the', 'stochastic', 'discounting', 'factor', 'in', 'the', 'state', 'variables', 'st', 'rt', 'the', 'solution', 'provides', 'effective', 'and', 'sufficient', 'information', 'for', 'the', 'calibration', 'and', 'pricing', 'the', 'pde', 'solver', 'is', 'constructed', 'by', 'using', 'adi', 'alternative', 'direction', 'implicit', 'method', 'based', 'on', 'an', 'extension', 'of', 'the', 'peacemanrachford', 'scheme', 'furthermore', 'an', 'efficient', 'algorithm', 'to', 'compute', 'all', 'the', 'corrective', 'terms', 'in', 'the', 'local', 'volatility', 'function', 'due', 'to', 'the', 'stochastic', 'interest', 'rates', 'is', 'proposed', 'by', 'using', 'the', 'pde', 'solutions', 'and', 'grid', 'points', 'different', 'numerical', 'experiments', 'are', 'examined', 'and', 'compared', 'to', 'demonstrate', 'the', 'results', 'of', 'our', 'theoretical', 'analysis']]
|
[-0.1001627943382512, -0.014419776395088681, -0.08503351662999269, 0.06359183561364692, -0.07904379127892791, -0.1447337290425737, 0.055101615331764574, 0.3449398023172368, -0.29839945188483474, -0.2661913895701087, 0.14225944461356177, -0.2411804545771111, -0.12308580380475591, 0.22220422557018668, -0.05693294559053347, 0.08029514078780547, 0.03472833791039596, -0.01401872806654302, -0.05926315373316234, -0.2371883344531693, 0.27806022471973924, 0.06257868033189316, 0.2858016662990924, 0.013556241615586578, 0.16263395560108432, 0.020749868861082748, -0.08370750998122829, 0.022538597375087288, -0.14472084589777803, 0.12815910545309775, 0.2563480000412476, 0.10069780157727175, 0.31744316533524736, -0.413014678764589, -0.18970389761625953, 0.06592496283004029, 0.08209295970517974, 0.05696375284658399, -0.048366071664147345, -0.24317862400449045, 0.06260309878439095, -0.1815431125932517, -0.10398459331775756, -0.07805671306091755, 0.02629935056254383, 0.05043848458744739, -0.3510657649321635, 0.07193652641843673, 0.039288594412674994, 0.027986901704091148, -0.027484324309775682, -0.13367401587431194, -0.01727550427222951, 0.03702037729990198, 0.05021912008751971, 0.011103670026377304, 0.09663818739342608, -0.08903477370580562, -0.10417391840709354, 0.3441679253694169, -0.10307616362235383, -0.24844408102727197, 0.12392079820568414, -0.08690427611738001, -0.06988175819896776, 0.1548261702079902, 0.1503442540751607, 0.16842040383813844, -0.18700689763267592, 0.11939243607543476, -0.0076735779989904425, 0.1563510253963051, 0.012147474970390117, -0.023669568973007735, 0.125316079237892, 0.19093522325052506, 0.10723219723674737, 0.08709165965538165, -0.09291998624499195, -0.1240371440575679, -0.30552817670839655, -0.1689131588761493, -0.1735145549281481, 0.039852639690843246, -0.13526855003889518, -0.1388013599003598, 0.3923662631939843, 0.1525085643749953, 0.14934124423433384, 0.05476587171457497, 0.29685748420108454, 0.19516525372830412, -0.0050644447124495945, 0.09621787888055533, 0.14572409726679325, 0.10370340979341225, 0.13147836779940336, -0.24509267463587636, 0.1329018956940794, 0.13155100460898744]
|
1,803.03942
|
Self-organized system-size oscillation of a stochastic lattice-gas model
|
The totally asymmetric simple exclusion process (TASEP) is a paradigmatic
stochastic model for non-equilibrium physics, and has been successfully applied
to describe active transport of molecular motors along cytoskeletal filaments.
Building on this simple model, we consider a two-lane lattice-gas model that
couples directed transport (TASEP) to diffusive motion in a semi-closed
geometry, and simultaneously accounts for spontaneous growth and
particle-induced shrinkage of the system's size. This particular extension of
the TASEP is motivated by the question of how active transport and diffusion
might influence length regulation in confined systems. Surprisingly, we find
that the size of our intrinsically stochastic system exhibits robust temporal
patterns over a broad range of growth rates. More specifically, when particle
diffusion is slow relative to the shrinkage dynamics, we observe quasi-periodic
changes in length. We provide an intuitive explanation for the occurrence of
these self-organized temporal patterns, which is based on the imbalance between
the diffusion and shrinkage speed in the confined geometry. Finally, we
formulate an effective theory for the oscillatory regime, which explains the
origin of the oscillations and correctly predicts the dependence of key
quantities, as for instance the oscillation frequency, on the growth rate.
|
physics.bio-ph cond-mat.stat-mech q-bio.SC
|
the totally asymmetric simple exclusion process tasep is a paradigmatic stochastic model for nonequilibrium physics and has been successfully applied to describe active transport of molecular motors along cytoskeletal filaments building on this simple model we consider a twolane latticegas model that couples directed transport tasep to diffusive motion in a semiclosed geometry and simultaneously accounts for spontaneous growth and particleinduced shrinkage of the systems size this particular extension of the tasep is motivated by the question of how active transport and diffusion might influence length regulation in confined systems surprisingly we find that the size of our intrinsically stochastic system exhibits robust temporal patterns over a broad range of growth rates more specifically when particle diffusion is slow relative to the shrinkage dynamics we observe quasiperiodic changes in length we provide an intuitive explanation for the occurrence of these selforganized temporal patterns which is based on the imbalance between the diffusion and shrinkage speed in the confined geometry finally we formulate an effective theory for the oscillatory regime which explains the origin of the oscillations and correctly predicts the dependence of key quantities as for instance the oscillation frequency on the growth rate
|
[['the', 'totally', 'asymmetric', 'simple', 'exclusion', 'process', 'tasep', 'is', 'a', 'paradigmatic', 'stochastic', 'model', 'for', 'nonequilibrium', 'physics', 'and', 'has', 'been', 'successfully', 'applied', 'to', 'describe', 'active', 'transport', 'of', 'molecular', 'motors', 'along', 'cytoskeletal', 'filaments', 'building', 'on', 'this', 'simple', 'model', 'we', 'consider', 'a', 'twolane', 'latticegas', 'model', 'that', 'couples', 'directed', 'transport', 'tasep', 'to', 'diffusive', 'motion', 'in', 'a', 'semiclosed', 'geometry', 'and', 'simultaneously', 'accounts', 'for', 'spontaneous', 'growth', 'and', 'particleinduced', 'shrinkage', 'of', 'the', 'systems', 'size', 'this', 'particular', 'extension', 'of', 'the', 'tasep', 'is', 'motivated', 'by', 'the', 'question', 'of', 'how', 'active', 'transport', 'and', 'diffusion', 'might', 'influence', 'length', 'regulation', 'in', 'confined', 'systems', 'surprisingly', 'we', 'find', 'that', 'the', 'size', 'of', 'our', 'intrinsically', 'stochastic', 'system', 'exhibits', 'robust', 'temporal', 'patterns', 'over', 'a', 'broad', 'range', 'of', 'growth', 'rates', 'more', 'specifically', 'when', 'particle', 'diffusion', 'is', 'slow', 'relative', 'to', 'the', 'shrinkage', 'dynamics', 'we', 'observe', 'quasiperiodic', 'changes', 'in', 'length', 'we', 'provide', 'an', 'intuitive', 'explanation', 'for', 'the', 'occurrence', 'of', 'these', 'selforganized', 'temporal', 'patterns', 'which', 'is', 'based', 'on', 'the', 'imbalance', 'between', 'the', 'diffusion', 'and', 'shrinkage', 'speed', 'in', 'the', 'confined', 'geometry', 'finally', 'we', 'formulate', 'an', 'effective', 'theory', 'for', 'the', 'oscillatory', 'regime', 'which', 'explains', 'the', 'origin', 'of', 'the', 'oscillations', 'and', 'correctly', 'predicts', 'the', 'dependence', 'of', 'key', 'quantities', 'as', 'for', 'instance', 'the', 'oscillation', 'frequency', 'on', 'the', 'growth', 'rate']]
|
[-0.1297189266998177, 0.17020915739718925, -0.07708194935406298, 0.07508900903377656, -0.05115452870131307, -0.15269321091857152, 0.02459602851898304, 0.3677645830375133, -0.3039400538756061, -0.24508664822301915, 0.0631075931530561, -0.22343991025706234, -0.19464708230645425, 0.19267856355422877, -0.030987156487847726, 0.006753553197114277, 0.00015455950591617177, 0.012526485841084012, 0.02444016238549705, -0.1690668370106651, 0.25549906914208814, 0.07639133008244957, 0.32287151583460805, 0.052995663021028656, 0.13252270675129882, 0.025732481076871764, 0.0198981771953692, 0.0264938707780285, -0.16757274937582534, 0.11669880128799387, 0.1693351746641205, 0.04228712848901326, 0.2346629743493095, -0.43896358424663234, -0.2689025743490027, 0.0817369705704569, 0.18489088970638534, 0.14216804572443487, -0.063390152999719, -0.22070583291999882, 0.015271880468305623, -0.1446509519495915, -0.14062526146821275, -0.050264594141518716, 0.07250632615831978, 0.04759896853332619, -0.26645324792390085, 0.1477081372308696, 0.08610346047892553, 0.06348003657743546, -0.06003770649795584, -0.0377299788655664, 0.00873573722447432, 0.11143100672577311, 0.04629077798355078, -0.06132570759767724, 0.18578217498065194, -0.12313916181699018, -0.14302608168014258, 0.36116433841627593, -0.06411515969990696, -0.20473394371549955, 0.23113331338630738, -0.14736172198029907, -0.12033382599174823, 0.14129776310310074, 0.22025595662500902, 0.0872610388227652, -0.1705106286384968, 0.0475872416528105, -0.05648697134990668, 0.16079627397258947, 0.02799442597333649, -0.028518962222583516, 0.22603141241610894, 0.2560690222164021, 0.065603158105472, 0.14546827070736662, -0.11289801003805064, -0.1865444643922227, -0.27574337034764673, -0.12010158381254422, -0.11824748570641945, 0.046410174694718774, -0.09339655633279502, -0.182296476214068, 0.4215551346310021, 0.15544548197217362, 0.2384124188371886, 0.04440212826191726, 0.22742713783560417, 0.11589207413087878, 0.026501016288074022, 0.06608010046052046, 0.19487300543498592, 0.13968048891119814, 0.11428854040760719, -0.2925750139834282, 0.12900894480042122, 0.04827675960937601]
|
1,803.03943
|
Nonconvex weak sharp minima on Riemannian manifolds
|
We are to establish necessary conditions (of the primal and dual types) for
the set of weak sharp minima of a nonconvex optimization problem on a
Riemannian manifold. Here, we are to provide a generalization of some
characterizations of weak sharp minima for convex problems on Riemannian
manifold introduced by Li et al. (SIAM J. Optim., 21 (2011), pp. 1523--1560)
for nonconvex problems. We use the theory of the Fr\'echet and limiting
subdifferentials on Riemannian manifold to give the necessary conditions of the
dual type. We also consider a theory of contingent directional derivative and a
notion of contingent cone on Riemannian manifold to give the necessary
conditions of the primal type. Several definitions have been provided for the
contingent cone on Riemannian manifold. We show that these definitions, with
some modifications, are equivalent. We establish a lemma about the local
behavior of a distance function. Using the lemma, we express the Fr\'echet
subdifferential (contingent directional derivative) of a distance function on a
Riemannian manifold in terms of normal cones (contingent cones), to establish
the necessary conditions. As an application, we show how one can use weak sharp
minima property to model a Cheeger type constant of a graph as an optimization
problem on a Stiefel manifold.
|
math.OC
|
we are to establish necessary conditions of the primal and dual types for the set of weak sharp minima of a nonconvex optimization problem on a riemannian manifold here we are to provide a generalization of some characterizations of weak sharp minima for convex problems on riemannian manifold introduced by li et al siam j optim 21 2011 pp 15231560 for nonconvex problems we use the theory of the frechet and limiting subdifferentials on riemannian manifold to give the necessary conditions of the dual type we also consider a theory of contingent directional derivative and a notion of contingent cone on riemannian manifold to give the necessary conditions of the primal type several definitions have been provided for the contingent cone on riemannian manifold we show that these definitions with some modifications are equivalent we establish a lemma about the local behavior of a distance function using the lemma we express the frechet subdifferential contingent directional derivative of a distance function on a riemannian manifold in terms of normal cones contingent cones to establish the necessary conditions as an application we show how one can use weak sharp minima property to model a cheeger type constant of a graph as an optimization problem on a stiefel manifold
|
[['we', 'are', 'to', 'establish', 'necessary', 'conditions', 'of', 'the', 'primal', 'and', 'dual', 'types', 'for', 'the', 'set', 'of', 'weak', 'sharp', 'minima', 'of', 'a', 'nonconvex', 'optimization', 'problem', 'on', 'a', 'riemannian', 'manifold', 'here', 'we', 'are', 'to', 'provide', 'a', 'generalization', 'of', 'some', 'characterizations', 'of', 'weak', 'sharp', 'minima', 'for', 'convex', 'problems', 'on', 'riemannian', 'manifold', 'introduced', 'by', 'li', 'et', 'al', 'siam', 'j', 'optim', '21', '2011', 'pp', '15231560', 'for', 'nonconvex', 'problems', 'we', 'use', 'the', 'theory', 'of', 'the', 'frechet', 'and', 'limiting', 'subdifferentials', 'on', 'riemannian', 'manifold', 'to', 'give', 'the', 'necessary', 'conditions', 'of', 'the', 'dual', 'type', 'we', 'also', 'consider', 'a', 'theory', 'of', 'contingent', 'directional', 'derivative', 'and', 'a', 'notion', 'of', 'contingent', 'cone', 'on', 'riemannian', 'manifold', 'to', 'give', 'the', 'necessary', 'conditions', 'of', 'the', 'primal', 'type', 'several', 'definitions', 'have', 'been', 'provided', 'for', 'the', 'contingent', 'cone', 'on', 'riemannian', 'manifold', 'we', 'show', 'that', 'these', 'definitions', 'with', 'some', 'modifications', 'are', 'equivalent', 'we', 'establish', 'a', 'lemma', 'about', 'the', 'local', 'behavior', 'of', 'a', 'distance', 'function', 'using', 'the', 'lemma', 'we', 'express', 'the', 'frechet', 'subdifferential', 'contingent', 'directional', 'derivative', 'of', 'a', 'distance', 'function', 'on', 'a', 'riemannian', 'manifold', 'in', 'terms', 'of', 'normal', 'cones', 'contingent', 'cones', 'to', 'establish', 'the', 'necessary', 'conditions', 'as', 'an', 'application', 'we', 'show', 'how', 'one', 'can', 'use', 'weak', 'sharp', 'minima', 'property', 'to', 'model', 'a', 'cheeger', 'type', 'constant', 'of', 'a', 'graph', 'as', 'an', 'optimization', 'problem', 'on', 'a', 'stiefel', 'manifold']]
|
[-0.12814611362890133, -0.016284347278856023, -0.08171544906127186, 0.11844511882591884, -0.1441999720816401, -0.1252968743741874, 0.04992320417376796, 0.38753999088262436, -0.29427545753226264, -0.25389000168748344, 0.1452985487802596, -0.2324388296347907, -0.19311286210200018, 0.17223556533577916, -0.17174392853845452, 0.04821474607627007, 0.045292047480826526, 0.023433949026528934, -0.14898020349492688, -0.26533354269026993, 0.38451934362607965, -0.014442501556878746, 0.2286115902837974, 0.11841327312302966, 0.14663728235348228, 0.010598019549840139, 0.03447445347290305, 0.04963647035285107, -0.19815237615930703, 0.15376404227092139, 0.21527689670153793, 0.1325370300870877, 0.30758850765640583, -0.441608104086255, -0.17093253489222052, 0.14879073382319105, 0.026820717169225072, 0.01636365768092784, -0.02297304844703001, -0.29192804710519077, 0.07708255723737592, -0.05090370460512858, -0.16087540165855757, -0.10118531979150275, 0.005213974749000327, 0.025183763586717107, -0.30265225919451816, 0.05838139043107642, 0.09293766135069569, 0.05544384093583591, -0.09298245190841697, -0.1208210330404504, -0.016668861016441244, 0.02022279850523738, 0.01648471019009255, 0.02932150597916916, 0.08512370454560562, -0.044039670481952356, -0.14503485756729576, 0.3114112515400336, -0.06993483897135819, -0.26582242806274803, 0.1659135036080063, -0.07810044731013477, -0.1391853454061648, 0.06571990164376225, 0.1950247462621881, 0.20838271147793033, -0.1384243589636047, 0.14561667528316533, -0.07702291873509734, 0.05406936078594582, 0.09079106261691494, 0.04215461463787258, 0.10533818195560422, 0.10161783032399575, 0.2364055179387277, 0.13843377596287293, -0.020103060757940255, -0.07899134616210415, -0.3601835588246439, -0.1835817812447627, -0.17325486806989873, 0.11074030347331201, -0.12947763808986265, -0.1960910848970299, 0.3752434275483767, 0.054127006007141425, 0.21346253505681903, 0.11291030978838217, 0.1982871955497986, 0.10962372499206431, -0.029503649388873968, 0.08370660943232332, 0.22475227875125287, 0.2130088064790188, 0.0798900633331533, -0.15796700385410464, 0.022558501540701294, 0.17601304140972715]
|
1,803.03944
|
Extendible cardinals and the mantle
|
The mantle is the intersection of all ground models of $V$. We show that if
there exists an extendible cardinal then the mantle is a ground model of $V$.
|
math.LO
|
the mantle is the intersection of all ground models of v we show that if there exists an extendible cardinal then the mantle is a ground model of v
|
[['the', 'mantle', 'is', 'the', 'intersection', 'of', 'all', 'ground', 'models', 'of', 'v', 'we', 'show', 'that', 'if', 'there', 'exists', 'an', 'extendible', 'cardinal', 'then', 'the', 'mantle', 'is', 'a', 'ground', 'model', 'of', 'v']]
|
[-0.1808951431564216, 0.17124575584101218, -0.05313503934905447, 0.01941082688401742, -0.024577755336489142, -0.11687102533298833, 0.03381734722342085, 0.37050795670727205, -0.3234870361870733, -0.1450703159167335, 0.09987440356856277, -0.3299499624248209, -0.12231366323499844, 0.14463605962147744, -0.023411786922350013, -0.05013776138617561, 0.12344550431288522, 0.12914955779781628, -0.023775635600282716, -0.2159108410364595, 0.380482143465558, -0.11172821308518278, 0.1777887650733364, 0.11599563685213697, 0.1626189194362739, -0.12518261522375818, 0.1185741737998765, 0.07293710677788176, -0.17662535390364015, 0.11451730064662366, 0.22866943671836232, 0.250091139740985, 0.23915763225021033, -0.40807848526486035, -0.18144801426036605, 0.20849824041641993, 0.008207559778258718, 0.05203688822301297, 0.0382900552117619, -0.2350113756055462, 0.13555513132877392, -0.19440477964436187, -0.13062711583514666, -0.06198925142786626, 0.15602200080094666, -0.026923551802234404, -0.3054418205444155, -0.014729752751259968, 0.13393313039479585, 0.09974435874228847, -0.15396986053935413, -0.15918156013278098, -0.1645631037395576, 0.08827480052373018, 0.012561532423895752, 0.07735094815043025, 0.037397778191571605, -0.13687850094946294, -0.05184227281153716, 0.4188690956296592, -0.09956091228101788, -0.12827878072857857, 0.1960826387693142, -0.15706318571906666, -0.08358410235237458, 0.09550949422128756, 0.031511840506874285, 0.08681049872318218, -0.061023772340910186, 0.18497415901771908, -0.20328352144309159, 0.2066737432675115, 0.0053329306237142665, -0.04373982890733871, 0.21641057382883697, 0.2022882485441093, 0.15629804009122067, 0.11595352857919602, -0.09564989169353041, 0.04884660724100882, -0.3500845242163231, -0.16022645168263336, -0.20601980510601325, 0.033811644105048014, -0.07232504399043732, -0.20550594070990538, 0.3231395872245575, 0.20026499181504137, 0.1547739313080393, 0.03895819000899792, 0.2736659013818757, 0.08820125267937265, -0.010875377868270052, 0.16356051898689877, 0.2216258317810194, 0.10317863947872458, -0.03765784961910083, -0.15396612710801177, 0.11834168776163254, 0.05052699514761053]
|
1,803.03945
|
Exact uniform sampling over catalan structures
|
We present a new framework for creating elegant algorithms for exact uniform
sampling of important Catalan structures, such as triangulations of convex
polygons, Dyck words, monotonic lattice paths and mountain ranges. Along with
sampling, we obtain optimal coding, and optimal number of random bits required
for the algorithm. The framework is based on an original two-parameter
recursive relation, where Ballot and Catalan numbers appear and which may be
regarded as to demonstrate a generalized reduction argument. We then describe
(a) a unique $n\times n$ matrix to be used for any of the problems -the common
pre-processing step of our framework- and (b) a linear height tree, where
leaves correspond one by one to all distinct solutions of each problem;
sampling is essentially done by selecting a path from the root to a leaf - the
main algorithm. Our main algorithm is linear for a number of the problems
mentioned.
|
cs.DM cs.CG cs.DS
|
we present a new framework for creating elegant algorithms for exact uniform sampling of important catalan structures such as triangulations of convex polygons dyck words monotonic lattice paths and mountain ranges along with sampling we obtain optimal coding and optimal number of random bits required for the algorithm the framework is based on an original twoparameter recursive relation where ballot and catalan numbers appear and which may be regarded as to demonstrate a generalized reduction argument we then describe a a unique ntimes n matrix to be used for any of the problems the common preprocessing step of our framework and b a linear height tree where leaves correspond one by one to all distinct solutions of each problem sampling is essentially done by selecting a path from the root to a leaf the main algorithm our main algorithm is linear for a number of the problems mentioned
|
[['we', 'present', 'a', 'new', 'framework', 'for', 'creating', 'elegant', 'algorithms', 'for', 'exact', 'uniform', 'sampling', 'of', 'important', 'catalan', 'structures', 'such', 'as', 'triangulations', 'of', 'convex', 'polygons', 'dyck', 'words', 'monotonic', 'lattice', 'paths', 'and', 'mountain', 'ranges', 'along', 'with', 'sampling', 'we', 'obtain', 'optimal', 'coding', 'and', 'optimal', 'number', 'of', 'random', 'bits', 'required', 'for', 'the', 'algorithm', 'the', 'framework', 'is', 'based', 'on', 'an', 'original', 'twoparameter', 'recursive', 'relation', 'where', 'ballot', 'and', 'catalan', 'numbers', 'appear', 'and', 'which', 'may', 'be', 'regarded', 'as', 'to', 'demonstrate', 'a', 'generalized', 'reduction', 'argument', 'we', 'then', 'describe', 'a', 'a', 'unique', 'ntimes', 'n', 'matrix', 'to', 'be', 'used', 'for', 'any', 'of', 'the', 'problems', 'the', 'common', 'preprocessing', 'step', 'of', 'our', 'framework', 'and', 'b', 'a', 'linear', 'height', 'tree', 'where', 'leaves', 'correspond', 'one', 'by', 'one', 'to', 'all', 'distinct', 'solutions', 'of', 'each', 'problem', 'sampling', 'is', 'essentially', 'done', 'by', 'selecting', 'a', 'path', 'from', 'the', 'root', 'to', 'a', 'leaf', 'the', 'main', 'algorithm', 'our', 'main', 'algorithm', 'is', 'linear', 'for', 'a', 'number', 'of', 'the', 'problems', 'mentioned']]
|
[-0.11152668099699391, 0.09927321403262573, -0.09011506465754497, 0.08031839493314447, -0.09820776029703887, -0.16435878891639435, 0.10728776590061702, 0.3435249151850774, -0.3265612049254815, -0.29706840656502675, 0.10609014711627497, -0.2312989967617181, -0.18029491356070582, 0.20175165079598553, -0.09550525360375743, 0.09667387698789605, 0.061932063647357094, 0.0497459274137745, -0.028993798118569208, -0.26295539504861004, 0.29095641476015843, 0.0029338744863855173, 0.2287987643676634, -0.01978323078612841, 0.16009585616002614, 0.04421984656978197, -0.020354127819725388, 0.048321770123407444, -0.13175069991769772, 0.12822741228297377, 0.2774288807161832, 0.17494254590427452, 0.27784653118736036, -0.377219149761053, -0.14344133307049806, 0.12447871361557092, 0.1723038463261784, 0.11848043475057804, -0.032605828301244845, -0.21318585047422833, 0.10867034427104266, -0.10922250484833745, -0.10600214403412128, -0.026374593510833644, 0.003373537791540494, 0.05138143028661206, -0.3241785868193728, 0.011223273167431486, 0.07277436488358355, 0.020083004306699778, -0.011583334564961292, -0.16187882838720405, 0.036696659265765666, 0.1153137416585122, -0.005194602362698296, 0.062209968580990226, 0.05900551687699516, -0.057965131137501194, -0.18537234290458918, 0.38937723973916993, 0.01474776305887546, -0.22527383614923, 0.13144368697996126, -0.06219798967720488, -0.1633275574689882, 0.12908029871932986, 0.1604935480879519, 0.14989036777547585, -0.10693868051748723, 0.06338182109253909, -0.11233135096090091, 0.13070184527896345, 0.11770089430501685, -0.009964647057868942, 0.1598221107236699, 0.15419646643371182, 0.1400612337102585, 0.1801142040781702, -0.02821494057000539, -0.08787949031810402, -0.3045519805588835, -0.1733101446132767, -0.21064714485121816, 0.016738498534667433, -0.16452724545062566, -0.2265877883466011, 0.3750513732949322, 0.12895123038293063, 0.2261274567635327, 0.12003198538268162, 0.2635532774572336, 0.10178151262005337, 0.05659243411925697, 0.09868733468780143, 0.09113495632836192, 0.12911886873503997, 0.02112961873078618, -0.16016906327914093, 0.04946063638537355, 0.17275908750456734]
|
1,803.03946
|
Explaining the morphology of supernova remnant (SNR) 1987A with the
jittering jets explosion mechanism
|
We find that the remnant of supernova (SN) 1987A share some morphological
features with four supernova remnants (SNRs) that have signatures of shaping by
jets, and from that we strengthen the claim that jets played a crucial role in
the explosion of SN 1987A. Some of the morphological features appear also in
planetary nebulae where jets are observed. The clumpy ejecta bring us to
support the claim that the jittering jets explosion mechanism can account for
the structure of the remnant of SN 1987A, i.e., SNR 1987A. We conduct a
preliminary attempt to quantify the fluctuations in the angular momentum of the
mass that is accreted on to the newly born neutron star via an accretion disk
or belt. The accretion disk/belt launches the jets that explode core collapse
supernovae (CCSNe). The relaxation time of the accretion disk/belt is
comparable to the duration of a typical jet-launching episode in the jittering
jets explosion mechanism, and hence the disk/belt has no time to relax. We
suggest that this might explain unequal two opposite jets that later lead to
unequal sides of the elongated structures in SNR of CCSNe. We reiterate our
earlier call for a paradigm shift from neutrino-driven explosion to a
jet-driven explosion of CCSNe.
|
astro-ph.HE astro-ph.SR
|
we find that the remnant of supernova sn 1987a share some morphological features with four supernova remnants snrs that have signatures of shaping by jets and from that we strengthen the claim that jets played a crucial role in the explosion of sn 1987a some of the morphological features appear also in planetary nebulae where jets are observed the clumpy ejecta bring us to support the claim that the jittering jets explosion mechanism can account for the structure of the remnant of sn 1987a ie snr 1987a we conduct a preliminary attempt to quantify the fluctuations in the angular momentum of the mass that is accreted on to the newly born neutron star via an accretion disk or belt the accretion diskbelt launches the jets that explode core collapse supernovae ccsne the relaxation time of the accretion diskbelt is comparable to the duration of a typical jetlaunching episode in the jittering jets explosion mechanism and hence the diskbelt has no time to relax we suggest that this might explain unequal two opposite jets that later lead to unequal sides of the elongated structures in snr of ccsne we reiterate our earlier call for a paradigm shift from neutrinodriven explosion to a jetdriven explosion of ccsne
|
[['we', 'find', 'that', 'the', 'remnant', 'of', 'supernova', 'sn', '1987a', 'share', 'some', 'morphological', 'features', 'with', 'four', 'supernova', 'remnants', 'snrs', 'that', 'have', 'signatures', 'of', 'shaping', 'by', 'jets', 'and', 'from', 'that', 'we', 'strengthen', 'the', 'claim', 'that', 'jets', 'played', 'a', 'crucial', 'role', 'in', 'the', 'explosion', 'of', 'sn', '1987a', 'some', 'of', 'the', 'morphological', 'features', 'appear', 'also', 'in', 'planetary', 'nebulae', 'where', 'jets', 'are', 'observed', 'the', 'clumpy', 'ejecta', 'bring', 'us', 'to', 'support', 'the', 'claim', 'that', 'the', 'jittering', 'jets', 'explosion', 'mechanism', 'can', 'account', 'for', 'the', 'structure', 'of', 'the', 'remnant', 'of', 'sn', '1987a', 'ie', 'snr', '1987a', 'we', 'conduct', 'a', 'preliminary', 'attempt', 'to', 'quantify', 'the', 'fluctuations', 'in', 'the', 'angular', 'momentum', 'of', 'the', 'mass', 'that', 'is', 'accreted', 'on', 'to', 'the', 'newly', 'born', 'neutron', 'star', 'via', 'an', 'accretion', 'disk', 'or', 'belt', 'the', 'accretion', 'diskbelt', 'launches', 'the', 'jets', 'that', 'explode', 'core', 'collapse', 'supernovae', 'ccsne', 'the', 'relaxation', 'time', 'of', 'the', 'accretion', 'diskbelt', 'is', 'comparable', 'to', 'the', 'duration', 'of', 'a', 'typical', 'jetlaunching', 'episode', 'in', 'the', 'jittering', 'jets', 'explosion', 'mechanism', 'and', 'hence', 'the', 'diskbelt', 'has', 'no', 'time', 'to', 'relax', 'we', 'suggest', 'that', 'this', 'might', 'explain', 'unequal', 'two', 'opposite', 'jets', 'that', 'later', 'lead', 'to', 'unequal', 'sides', 'of', 'the', 'elongated', 'structures', 'in', 'snr', 'of', 'ccsne', 'we', 'reiterate', 'our', 'earlier', 'call', 'for', 'a', 'paradigm', 'shift', 'from', 'neutrinodriven', 'explosion', 'to', 'a', 'jetdriven', 'explosion', 'of', 'ccsne']]
|
[-0.08310212927711447, 0.106595264553595, -0.1146695374715619, 0.173776805723404, -0.15347433911818192, -0.06928270333332986, 0.03919578392467484, 0.41562028385517075, -0.18964671526422225, -0.2588427939338655, 0.04364722065525357, -0.2546856077251638, -0.020167569667328057, 0.16860224362803486, -0.023455918903452652, -0.09755227283415635, 0.1608000163074083, -0.09461050583276807, -0.0861439045206303, -0.25691412656352197, 0.3538022431862972, 0.11508660450259724, 0.155118100315605, -0.01605183793368136, 0.06850650201313106, -0.15464944869688735, -0.028160626015330596, -0.07022565998500441, -0.12743411954402178, 0.01566033845812809, 0.1565352760273793, 0.1937754001218553, 0.20175359271638516, -0.46925720468890375, -0.2677835684042515, 0.09634953459906505, 0.23860154539437556, 0.07267565979656378, -0.09426852043252439, -0.23319900423152054, 0.09453539292117945, -0.28750266694895377, -0.15705080334233437, 0.09445679375629236, 0.020243956107737087, 0.03281747841435235, -0.22139186340940709, 0.11242214307379228, 0.09518637127674572, -0.003215753015630492, -0.09714944820124202, -0.05300018569829351, -0.060033629299709346, 0.03061486403180979, 0.1345199942338939, 0.028907298760079757, 0.12381259782080789, -0.15229859624921185, -0.08893791304038065, 0.43608329874440666, 0.01614938450114029, 0.0038608475838129114, 0.23432746741511837, -0.22504779752798196, -0.16101473166675465, 0.19644199237000287, 0.17901568683545763, 0.06078351638819341, -0.09478364661996105, -0.09370654835081772, -0.06470383289724407, 0.11721948043829421, 0.04089422326126113, 0.05907697393707988, 0.3216167267866251, 0.1460125137438498, -0.02557137757880477, 0.11770488372890324, -0.21808067256834632, -0.045567156856016415, -0.2817155326148722, -0.11945988490109945, -0.1404977333323076, 0.132818448315261, -0.14286715664954788, -0.1099628080954639, 0.3299843943427976, 0.11665047219068539, 0.22552848151294377, -0.06490665835146679, 0.25873505560817517, 0.023246847023256124, 0.0991465993129035, 0.16939317566660664, 0.35559680196257853, 0.15325025013057378, 0.1707509575752405, -0.2673354948552825, 0.13870839616709685, 0.05824730789129872]
|
1,803.03947
|
Nonsingular Block Graphs: An Open Problem
|
A block graph is a graph in which every block is a complete graph. Let $G$ be
a block graph and let $A(G)$ be its (0,1)-adjacency matrix. Graph $G$ is called
nonsingular (singular) if $A(G)$ is nonsingular (singular). An interesting open
problem, proposed in 2013 by Bapat and Roy, is to characterize nonsingular
block graphs. In this article, we present some classes of nonsingular and
singular block graphs and related conjectures.
|
cs.DM math.CO
|
a block graph is a graph in which every block is a complete graph let g be a block graph and let ag be its 01adjacency matrix graph g is called nonsingular singular if ag is nonsingular singular an interesting open problem proposed in 2013 by bapat and roy is to characterize nonsingular block graphs in this article we present some classes of nonsingular and singular block graphs and related conjectures
|
[['a', 'block', 'graph', 'is', 'a', 'graph', 'in', 'which', 'every', 'block', 'is', 'a', 'complete', 'graph', 'let', 'g', 'be', 'a', 'block', 'graph', 'and', 'let', 'ag', 'be', 'its', '01adjacency', 'matrix', 'graph', 'g', 'is', 'called', 'nonsingular', 'singular', 'if', 'ag', 'is', 'nonsingular', 'singular', 'an', 'interesting', 'open', 'problem', 'proposed', 'in', '2013', 'by', 'bapat', 'and', 'roy', 'is', 'to', 'characterize', 'nonsingular', 'block', 'graphs', 'in', 'this', 'article', 'we', 'present', 'some', 'classes', 'of', 'nonsingular', 'and', 'singular', 'block', 'graphs', 'and', 'related', 'conjectures']]
|
[-0.17335224454619094, 0.07035055442595965, -0.088024889437062, -0.02150984257328468, -0.1522181391302811, -0.21088183783388265, -0.0577109910082072, 0.35579944868952457, -0.3118121126063273, -0.16037843266213445, 0.1974941395095248, -0.30446921955321876, -0.24277615553738785, 0.11008519116579227, -0.17581248840868052, -0.007694582993486031, 0.13637100369997426, 0.10350892099906021, -0.053845739779128154, -0.2897503785038872, 0.32321384537335435, -0.010951859955216798, 0.14488796377226607, 0.09744762155738934, 0.08781780486165637, 0.04589978363496107, -0.005734799429774284, 0.07802207879459774, -0.16136167108894547, 0.07780189217481448, 0.36373685263621974, 0.1653897821981932, 0.2370552340010837, -0.3586020809971288, -0.16413446622375977, 0.24341230773904793, 0.10422716917766055, 0.030870211151638398, 0.025730065293085407, -0.24656841002771973, 0.2033942315701238, -0.14385220083132597, -0.1034171829511687, -0.0022410683261729044, 0.1167312896692417, -0.05070846988229265, -0.31458430156164185, -0.037233459973104406, 0.11251690459083503, 0.02481613030106249, 0.11076974531497912, -0.10299647125927075, -0.004540658883855376, 0.023653961803344354, -0.09093598859109195, 0.0692102239191742, 0.05399768636807878, 0.007790022890385188, -0.1347816442205033, 0.35938227281276086, -0.030122633013402074, -0.15254109455797243, 0.06352877976294134, -0.041335135645849605, -0.16085954170516678, 0.09085016171644691, 0.14626940040731093, 0.15281209202719406, -0.10996478120468452, 0.24028852123203098, -0.1421486481788083, 0.0786095261622981, 0.10370066018224182, -0.07487560315451151, 0.1773269580755855, 0.12330424375700909, 0.14417626214226786, 0.1465745977106386, 0.0769164806927069, 0.031436605247813214, -0.279735975702044, -0.14534633542397912, -0.2728533224058403, 0.11282639936084898, -0.225066442199176, -0.2500143703073263, 0.4706090888087179, 0.05009652007843407, 0.19751286064602538, 0.06497116537902399, 0.15237812863164385, 0.062114499640506755, -0.009745332786262455, 0.2035768000527062, 0.04814795884311947, 0.2882051641600285, -0.018397001051147218, -0.13300883945103892, 0.036901279064026515, 0.18824554304264382]
|
1,803.03948
|
Light-Cone Reduction vs. TsT transformations : A Fluid Dynamics
Perspective
|
We compute constitutive relations for a charged $(2+1)$ dimensional
Schr\"odinger fluid up to first order in derivative expansion, using
holographic techniques. Starting with a locally boosted, asymptotically $AdS$,
$4+1$ dimensional charged black brane geometry, we uplift that to ten
dimensions and perform $TsT$ transformations to obtain an effective five
dimensional local black brane solution with asymptotically Schr\"odinger
isometries. By suitably implementing the holographic techniques, we compute the
constitutive relations for the effective fluid living on the boundary of this
space-time and extract first order transport coefficients from these relations.
Schr\"odinger fluid can also be obtained by reducing a charged relativistic
conformal fluid over light-cone. It turns out that both the approaches result
the same system at the end. Fluid obtained by light-cone reduction satisfies a
restricted class of thermodynamics. Here, we see that the charged fluid
obtained holographically also belongs to the same restricted class.
|
hep-th
|
we compute constitutive relations for a charged 21 dimensional schrodinger fluid up to first order in derivative expansion using holographic techniques starting with a locally boosted asymptotically ads 41 dimensional charged black brane geometry we uplift that to ten dimensions and perform tst transformations to obtain an effective five dimensional local black brane solution with asymptotically schrodinger isometries by suitably implementing the holographic techniques we compute the constitutive relations for the effective fluid living on the boundary of this spacetime and extract first order transport coefficients from these relations schrodinger fluid can also be obtained by reducing a charged relativistic conformal fluid over lightcone it turns out that both the approaches result the same system at the end fluid obtained by lightcone reduction satisfies a restricted class of thermodynamics here we see that the charged fluid obtained holographically also belongs to the same restricted class
|
[['we', 'compute', 'constitutive', 'relations', 'for', 'a', 'charged', '21', 'dimensional', 'schrodinger', 'fluid', 'up', 'to', 'first', 'order', 'in', 'derivative', 'expansion', 'using', 'holographic', 'techniques', 'starting', 'with', 'a', 'locally', 'boosted', 'asymptotically', 'ads', '41', 'dimensional', 'charged', 'black', 'brane', 'geometry', 'we', 'uplift', 'that', 'to', 'ten', 'dimensions', 'and', 'perform', 'tst', 'transformations', 'to', 'obtain', 'an', 'effective', 'five', 'dimensional', 'local', 'black', 'brane', 'solution', 'with', 'asymptotically', 'schrodinger', 'isometries', 'by', 'suitably', 'implementing', 'the', 'holographic', 'techniques', 'we', 'compute', 'the', 'constitutive', 'relations', 'for', 'the', 'effective', 'fluid', 'living', 'on', 'the', 'boundary', 'of', 'this', 'spacetime', 'and', 'extract', 'first', 'order', 'transport', 'coefficients', 'from', 'these', 'relations', 'schrodinger', 'fluid', 'can', 'also', 'be', 'obtained', 'by', 'reducing', 'a', 'charged', 'relativistic', 'conformal', 'fluid', 'over', 'lightcone', 'it', 'turns', 'out', 'that', 'both', 'the', 'approaches', 'result', 'the', 'same', 'system', 'at', 'the', 'end', 'fluid', 'obtained', 'by', 'lightcone', 'reduction', 'satisfies', 'a', 'restricted', 'class', 'of', 'thermodynamics', 'here', 'we', 'see', 'that', 'the', 'charged', 'fluid', 'obtained', 'holographically', 'also', 'belongs', 'to', 'the', 'same', 'restricted', 'class']]
|
[-0.07839035217987438, 0.13704766986725034, -0.09471770833519384, 0.05735773687845032, -0.087604846586955, -0.17935720506798605, -0.018509990664134765, 0.2876790375336362, -0.20318886667233088, -0.25037875819052086, 0.07450975451762949, -0.31368137976989663, -0.1203658219523214, 0.12817611846880153, -0.005453064254131811, 0.0894927378069481, -0.00987716918361598, 0.04908695944649135, -0.1280641657605382, -0.2597948249011975, 0.34656520571945043, 0.025947699426063175, 0.30688631456538007, -0.02004473245028278, 0.15316736992480684, 0.004852710917575991, -0.029716459064391153, 0.12324097119271755, -0.19793076084456046, 0.10722279979943715, 0.22211403761797682, 0.0313672563221691, 0.14981089625507593, -0.43121683232743163, -0.23729002067883467, 0.06044015896924097, 0.17185463285202096, 0.16843901127576827, -0.036653779484813326, -0.2703801258242336, 0.05075946342649645, -0.18880628789293355, -0.18886080361774255, -0.12214662199518804, 0.01186914540634587, -0.07611612468508297, -0.2386918249764833, 0.10136191082620544, 0.02256108936693134, -0.018389112701446844, -0.12218371069436122, -0.02286118900258865, -0.04480394788471789, 0.07583351681201622, 0.07256392509644402, 0.02585528398510711, 0.14252479044592073, -0.12431349515275636, -0.11006155638987648, 0.38925576826621744, -0.08961466935559594, -0.2878923884512664, 0.17544732664647544, -0.15318364320635988, -0.12188511019058783, 0.09866064635715358, 0.15638297812627822, 0.17755497881163168, -0.20381077910484424, 0.1516017402160977, -0.03161290846042464, 0.13574893159856055, 0.1574231613555859, -0.016103277217339854, 0.23443672757611836, 0.08051166943402897, 0.028246148182721486, 0.17261945754851632, -8.060955281915336e-05, -0.10940158383214268, -0.3704385533928871, -0.16986121101433346, -0.13920554982273486, 0.13722688523602897, -0.1918493779374142, -0.15018185512644464, 0.3186485473997891, 0.1061762563449708, 0.14582541362735732, 0.06397116237223663, 0.20858844444155694, 0.11779146538726215, 0.03688577494808826, 0.1405849964839631, 0.26026197062516265, 0.12873642708271227, 0.14663210987396424, -0.2258760933989081, -0.12403906401214672, 0.2094764128793031]
|
1,803.03949
|
An Efficient Volumetric Mesh Representation for Real-time Scene
Reconstruction using Spatial Hashing
|
Mesh plays an indispensable role in dense real-time reconstruction essential
in robotics. Efforts have been made to maintain flexible data structures for 3D
data fusion, yet an efficient incremental framework specifically designed for
online mesh storage and manipulation is missing. We propose a novel framework
to compactly generate, update, and refine mesh for scene reconstruction upon a
volumetric representation. Maintaining a spatial-hashed field of cubes, we
distribute vertices with continuous value on discrete edges that support O(1)
vertex accessing and forbid memory redundancy. By introducing Hamming distance
in mesh refinement, we further improve the mesh quality regarding the triangle
type consistency with a low cost. Lock-based and lock-free operations were
applied to avoid thread conflicts in GPU parallel computation. Experiments
demonstrate that the mesh memory consumption is significantly reduced while the
running speed is kept in the online reconstruction process.
|
cs.RO cs.GR
|
mesh plays an indispensable role in dense realtime reconstruction essential in robotics efforts have been made to maintain flexible data structures for 3d data fusion yet an efficient incremental framework specifically designed for online mesh storage and manipulation is missing we propose a novel framework to compactly generate update and refine mesh for scene reconstruction upon a volumetric representation maintaining a spatialhashed field of cubes we distribute vertices with continuous value on discrete edges that support o1 vertex accessing and forbid memory redundancy by introducing hamming distance in mesh refinement we further improve the mesh quality regarding the triangle type consistency with a low cost lockbased and lockfree operations were applied to avoid thread conflicts in gpu parallel computation experiments demonstrate that the mesh memory consumption is significantly reduced while the running speed is kept in the online reconstruction process
|
[['mesh', 'plays', 'an', 'indispensable', 'role', 'in', 'dense', 'realtime', 'reconstruction', 'essential', 'in', 'robotics', 'efforts', 'have', 'been', 'made', 'to', 'maintain', 'flexible', 'data', 'structures', 'for', '3d', 'data', 'fusion', 'yet', 'an', 'efficient', 'incremental', 'framework', 'specifically', 'designed', 'for', 'online', 'mesh', 'storage', 'and', 'manipulation', 'is', 'missing', 'we', 'propose', 'a', 'novel', 'framework', 'to', 'compactly', 'generate', 'update', 'and', 'refine', 'mesh', 'for', 'scene', 'reconstruction', 'upon', 'a', 'volumetric', 'representation', 'maintaining', 'a', 'spatialhashed', 'field', 'of', 'cubes', 'we', 'distribute', 'vertices', 'with', 'continuous', 'value', 'on', 'discrete', 'edges', 'that', 'support', 'o1', 'vertex', 'accessing', 'and', 'forbid', 'memory', 'redundancy', 'by', 'introducing', 'hamming', 'distance', 'in', 'mesh', 'refinement', 'we', 'further', 'improve', 'the', 'mesh', 'quality', 'regarding', 'the', 'triangle', 'type', 'consistency', 'with', 'a', 'low', 'cost', 'lockbased', 'and', 'lockfree', 'operations', 'were', 'applied', 'to', 'avoid', 'thread', 'conflicts', 'in', 'gpu', 'parallel', 'computation', 'experiments', 'demonstrate', 'that', 'the', 'mesh', 'memory', 'consumption', 'is', 'significantly', 'reduced', 'while', 'the', 'running', 'speed', 'is', 'kept', 'in', 'the', 'online', 'reconstruction', 'process']]
|
[-0.12511702088083027, 0.06279851612990903, -0.038425946970832056, 0.03093709088592104, -0.12218878642495105, -0.17067261112907486, 0.06363535730717637, 0.47335103708955883, -0.3036902442092089, -0.3608360466875618, 0.11550887113875917, -0.22046318445220697, -0.08637815445205933, 0.094972319652246, -0.1456286210142555, 0.13455946630171814, 0.16177541080848884, -0.003314970779356634, -0.03135400073369965, -0.26992334153422776, 0.23697293525404237, 0.1314336885664639, 0.34383808126632903, 0.03936076598416129, 0.0969076240988006, 0.04366596502741035, -0.08807164833633055, 0.019377637634442436, -0.06927814478066786, 0.14346874738614604, 0.2752645491528586, 0.1617786697658087, 0.2751874660054664, -0.5256584224378248, -0.20605455435186007, 0.06106490870642898, 0.16674914451235598, 0.0924282045080159, -0.11701232357630707, -0.22955432538237933, 0.14438554074400836, -0.1551136876600493, -0.05601745245227818, -0.14810239442074738, -0.0013050815289866902, -0.02597438327368456, -0.31809655152154054, -0.0013779579835990778, 0.02215080456171694, 0.045067881572348395, -0.020650025980593973, -0.07272535000371633, 0.02648455701875601, 0.1542059754853961, -0.06449525505191271, 0.09980355281878611, 0.11569882520950205, -0.14732341446265537, -0.13886325962744359, 0.39693133235513733, 0.015388799636966462, -0.24474742400573848, 0.1578347311675944, -0.005174540364344289, -0.15821537241111877, 0.1308844430948333, 0.22934709932896302, 0.08257333116217268, -0.11326504684984684, 0.10029966562752705, 0.0389176373916055, 0.1903958916362616, 0.10203707297064578, 0.02596802335473702, 0.13752192567377317, 0.22509171407026568, 0.12856267693682016, 0.15310749487713543, -0.08013162421809657, -0.07740426087490679, -0.23566403636615052, -0.16855518103798303, -0.1905264056709816, -0.06201358081056006, -0.1515510199393025, -0.1690230732691548, 0.3510659886792088, 0.1879051337554622, 0.18988949894421842, 0.08168646864418824, 0.3607149764011018, 0.02666134122765804, 0.14640939140461198, 0.15912358518756872, 0.1266437731213196, 0.031257859427857096, 0.14599612597945621, -0.1946657482733977, 0.09311720416144126, 0.11500300625138146]
|
1,803.0395
|
Paths between colourings of sparse graphs
|
The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph~$G$ has
as vertex set the set of all possible $k$-colourings of $G$ and two colourings
are adjacent if they differ on exactly one vertex. We give a short proof of the
following theorem of Bousquet and Perarnau (\emph{European Journal of
Combinatorics}, 2016). Let $d$ and $k$ be positive integers, $k \geq d + 1$.
For every $\epsilon > 0$ and every graph $G$ with $n$ vertices and maximum
average degree $d - \epsilon$, there exists a constant $c = c(d, \epsilon)$
such that $R_k(G)$ has diameter $O(n^c)$. Our proof can be transformed into a
simple polynomial time algorithm that finds a path between a given pair of
colourings in $R_k(G)$.
|
math.CO cs.DM
|
the reconfiguration graph r_kg of the kcolourings of a graphg has as vertex set the set of all possible kcolourings of g and two colourings are adjacent if they differ on exactly one vertex we give a short proof of the following theorem of bousquet and perarnau empheuropean journal of combinatorics 2016 let d and k be positive integers k geq d 1 for every epsilon 0 and every graph g with n vertices and maximum average degree d epsilon there exists a constant c cd epsilon such that r_kg has diameter onc our proof can be transformed into a simple polynomial time algorithm that finds a path between a given pair of colourings in r_kg
|
[['the', 'reconfiguration', 'graph', 'r_kg', 'of', 'the', 'kcolourings', 'of', 'a', 'graphg', 'has', 'as', 'vertex', 'set', 'the', 'set', 'of', 'all', 'possible', 'kcolourings', 'of', 'g', 'and', 'two', 'colourings', 'are', 'adjacent', 'if', 'they', 'differ', 'on', 'exactly', 'one', 'vertex', 'we', 'give', 'a', 'short', 'proof', 'of', 'the', 'following', 'theorem', 'of', 'bousquet', 'and', 'perarnau', 'empheuropean', 'journal', 'of', 'combinatorics', '2016', 'let', 'd', 'and', 'k', 'be', 'positive', 'integers', 'k', 'geq', 'd', '1', 'for', 'every', 'epsilon', '0', 'and', 'every', 'graph', 'g', 'with', 'n', 'vertices', 'and', 'maximum', 'average', 'degree', 'd', 'epsilon', 'there', 'exists', 'a', 'constant', 'c', 'cd', 'epsilon', 'such', 'that', 'r_kg', 'has', 'diameter', 'onc', 'our', 'proof', 'can', 'be', 'transformed', 'into', 'a', 'simple', 'polynomial', 'time', 'algorithm', 'that', 'finds', 'a', 'path', 'between', 'a', 'given', 'pair', 'of', 'colourings', 'in', 'r_kg']]
|
[-0.21789226726142932, 0.13359071105597137, -0.06273922527451878, -0.03838830361871616, -0.07482357498703768, -0.22622577696228804, 0.07601125560214986, 0.3600286828758924, -0.28535667361043715, -0.3043899897445479, 0.015154562622268239, -0.3111046206368052, -0.1186467452885826, 0.12257203202208747, -0.054361085144236036, -0.044696112511598544, 0.11619777660816907, 0.13047890041185461, 0.025427472986706088, -0.29380710665389653, 0.23471577519793874, -0.10044695649943922, 0.07877587875472787, 0.08088929691230473, 0.11282406624244606, 0.04511391975633476, 0.014235704432687034, 0.08426493485458195, -0.20973663964655515, 0.05278961017079975, 0.2674960749750228, 0.20302052362214612, 0.28903548477784446, -0.33464693117471733, -0.11159153358362939, 0.2213130877798666, 0.11366996176277652, 0.00034682615761361693, 0.04279928145343033, -0.18389742660700628, 0.17658563290682175, -0.10813566809026626, -0.09332674789120969, 0.03500571216902007, 0.2241032216940885, 0.0075129236094653605, -0.30618851604345054, -0.015816016381849412, 0.13959514535963535, 0.04865476702056501, 0.0716081406313764, -0.23172784266264543, -0.04908400661838443, 0.0948811764585907, -0.0750630016722109, 0.15822878864128143, 0.013527675599629141, -0.06340614749402132, -0.17634842965913855, 0.3565891098878954, -0.047476148095143875, -0.1317837812208935, 0.11715246481901925, -0.14906429833044177, -0.1570963318095259, 0.10978110737936653, 0.0983359519250529, 0.16915366085975067, -0.042347051421909226, 0.19748798620269592, -0.14006494952608708, 0.1336033720523119, 0.17343073482827648, 0.009692555738855963, 0.11943492825609967, 0.08762351270441128, 0.13570623622559336, 0.11862801479621102, 0.003056853566237766, 0.058510287401124676, -0.3486595275933328, -0.11370080597091305, -0.24005260185804217, 0.13710028937329416, -0.21160155435879816, -0.16268431523045443, 0.37667239640393985, 0.05607844309516899, 0.2027347823847895, 0.10672114460283648, 0.18611913859014115, 0.08784870603805124, 0.019134940238386067, 0.1859003693756202, 0.08388645373608755, 0.17815698797450116, -0.0446040116533961, -0.15309600344170696, 0.058761575182332944, 0.16562045594758312]
|
1,803.03951
|
The Secure Machine: Efficient Secure Execution On Untrusted Platforms
|
In this work we present the Secure Machine, SeM for short, a CPU architecture
extension for secure computing. SeM uses a small amount of in-chip additional
hardware that monitors key communication channels inside the CPU chip, and only
acts when required. SeM provides confidentiality and integrity for a secure
program without trusting the platform software or any off-chip hardware. SeM
supports existing binaries of single- and multi-threaded applications running
on single- or multi-core, multi-CPU. The performance reduction caused by it is
only few percent, most of which is due to the memory encryption layer that is
commonly used in many secure architectures.
We also developed SeM-Prepare, a software tool that automatically instruments
existing applications (binaries) with additional instructions so they can be
securely executed on our architecture without requiring any programming efforts
or the availability of the desired program`s source code.
To enable secure data sharing in shared memory environments, we developed
Secure Distributed Shared Memory (SDSM), an efficient (time and memory)
algorithm for allowing thousands of compute nodes to share data securely while
running on an untrusted computing environment. SDSM shows a negligible
reduction in performance, and it requires negligible and hardware resources. We
developed Distributed Memory Integrity Trees, a method for enhancing single
node integrity trees for preserving the integrity of a distributed application
running on an untrusted computing environment. We show that our method is
applicable to existing single node integrity trees such as Merkle Tree, Bonsai
Merkle Tree, and Intel`s SGX memory integrity engine. All these building blocks
may be used together to form a practical secure system, and some can be used in
conjunction with other secure systems.
|
cs.CR cs.AR cs.DC cs.OS
|
in this work we present the secure machine sem for short a cpu architecture extension for secure computing sem uses a small amount of inchip additional hardware that monitors key communication channels inside the cpu chip and only acts when required sem provides confidentiality and integrity for a secure program without trusting the platform software or any offchip hardware sem supports existing binaries of single and multithreaded applications running on single or multicore multicpu the performance reduction caused by it is only few percent most of which is due to the memory encryption layer that is commonly used in many secure architectures we also developed semprepare a software tool that automatically instruments existing applications binaries with additional instructions so they can be securely executed on our architecture without requiring any programming efforts or the availability of the desired programs source code to enable secure data sharing in shared memory environments we developed secure distributed shared memory sdsm an efficient time and memory algorithm for allowing thousands of compute nodes to share data securely while running on an untrusted computing environment sdsm shows a negligible reduction in performance and it requires negligible and hardware resources we developed distributed memory integrity trees a method for enhancing single node integrity trees for preserving the integrity of a distributed application running on an untrusted computing environment we show that our method is applicable to existing single node integrity trees such as merkle tree bonsai merkle tree and intels sgx memory integrity engine all these building blocks may be used together to form a practical secure system and some can be used in conjunction with other secure systems
|
[['in', 'this', 'work', 'we', 'present', 'the', 'secure', 'machine', 'sem', 'for', 'short', 'a', 'cpu', 'architecture', 'extension', 'for', 'secure', 'computing', 'sem', 'uses', 'a', 'small', 'amount', 'of', 'inchip', 'additional', 'hardware', 'that', 'monitors', 'key', 'communication', 'channels', 'inside', 'the', 'cpu', 'chip', 'and', 'only', 'acts', 'when', 'required', 'sem', 'provides', 'confidentiality', 'and', 'integrity', 'for', 'a', 'secure', 'program', 'without', 'trusting', 'the', 'platform', 'software', 'or', 'any', 'offchip', 'hardware', 'sem', 'supports', 'existing', 'binaries', 'of', 'single', 'and', 'multithreaded', 'applications', 'running', 'on', 'single', 'or', 'multicore', 'multicpu', 'the', 'performance', 'reduction', 'caused', 'by', 'it', 'is', 'only', 'few', 'percent', 'most', 'of', 'which', 'is', 'due', 'to', 'the', 'memory', 'encryption', 'layer', 'that', 'is', 'commonly', 'used', 'in', 'many', 'secure', 'architectures', 'we', 'also', 'developed', 'semprepare', 'a', 'software', 'tool', 'that', 'automatically', 'instruments', 'existing', 'applications', 'binaries', 'with', 'additional', 'instructions', 'so', 'they', 'can', 'be', 'securely', 'executed', 'on', 'our', 'architecture', 'without', 'requiring', 'any', 'programming', 'efforts', 'or', 'the', 'availability', 'of', 'the', 'desired', 'programs', 'source', 'code', 'to', 'enable', 'secure', 'data', 'sharing', 'in', 'shared', 'memory', 'environments', 'we', 'developed', 'secure', 'distributed', 'shared', 'memory', 'sdsm', 'an', 'efficient', 'time', 'and', 'memory', 'algorithm', 'for', 'allowing', 'thousands', 'of', 'compute', 'nodes', 'to', 'share', 'data', 'securely', 'while', 'running', 'on', 'an', 'untrusted', 'computing', 'environment', 'sdsm', 'shows', 'a', 'negligible', 'reduction', 'in', 'performance', 'and', 'it', 'requires', 'negligible', 'and', 'hardware', 'resources', 'we', 'developed', 'distributed', 'memory', 'integrity', 'trees', 'a', 'method', 'for', 'enhancing', 'single', 'node', 'integrity', 'trees', 'for', 'preserving', 'the', 'integrity', 'of', 'a', 'distributed', 'application', 'running', 'on', 'an', 'untrusted', 'computing', 'environment', 'we', 'show', 'that', 'our', 'method', 'is', 'applicable', 'to', 'existing', 'single', 'node', 'integrity', 'trees', 'such', 'as', 'merkle', 'tree', 'bonsai', 'merkle', 'tree', 'and', 'intels', 'sgx', 'memory', 'integrity', 'engine', 'all', 'these', 'building', 'blocks', 'may', 'be', 'used', 'together', 'to', 'form', 'a', 'practical', 'secure', 'system', 'and', 'some', 'can', 'be', 'used', 'in', 'conjunction', 'with', 'other', 'secure', 'systems']]
|
[-0.21901769057491466, -0.005331838466083675, -0.04714560996045988, 0.033679749366830734, -0.09985598476487212, -0.25820479646448374, 0.11080997815160491, 0.41894457290661247, -0.28875168015442526, -0.36688341033946287, 0.1410583864635555, -0.24510777402525386, -0.06271456959845689, 0.24491024397138972, -0.1211445560457993, 0.14039227551042774, 0.10249681212949593, 0.0023706045065088853, 0.014449364578895792, -0.31743755667497786, 0.22141639598660678, 0.10915559656688642, 0.2978332259979866, 0.027391002434716726, 0.07014886210826636, 0.043125818563727505, -0.029193518835681435, -0.05300078101315782, -0.0034175982009936193, 0.1362334172727595, 0.2964153597918887, 0.22242923436244702, 0.2894867019426516, -0.47812045278260484, -0.16699552221518174, 0.07657624702722601, 0.14881053230441038, 0.09538173631239368, -0.06884030885617796, -0.2484072003246504, 0.1273880632874994, -0.24355424186625682, -0.04853193213142838, -0.11694856841623892, -0.03362891097083989, -0.0015948481572302304, -0.2579127133118591, -0.031213667114570853, 0.024780934316154076, 0.05365255720115623, 0.0220829376955996, -0.06120954092073268, -0.0029239631463390064, 0.165740661071943, -0.07976935784202344, 0.040341658423558864, 0.20036784440162592, -0.07517239803864333, -0.16222188211395405, 0.3577426024541423, -0.012416035021648413, -0.17463789588381426, 0.20401225797746414, 0.0351063130878816, -0.19625746027347357, 0.09355169854996562, 0.2165986260823796, 0.06785211425877231, -0.1888069405354947, 0.06382141671972075, 0.031331794847467204, 0.2772469479429727, 0.050447549015242496, 0.10008374589276225, 0.17506557417543853, 0.20569009502907967, 0.048228124555273956, 0.14009087252056548, -0.055195935635471385, -0.07044306633521474, -0.21722724155337989, -0.20114180654533864, -0.19646665100941285, -0.006855836732189774, -0.10398591334224501, -0.1585771264613226, 0.319933919913156, 0.19021858824014679, 0.08849635994513794, 0.09306684294878163, 0.4435801594381166, -0.0029335033335990053, 0.21038028084577115, 0.2165837299948287, 0.12452167652683034, 0.014214365178143935, 0.14987166059761556, -0.15586675111390993, 0.16294189343769924, -0.03238375724450795]
|
1,803.03952
|
A hybrid of two theorems of Piatetski-Shapiro
|
Let $c > 1$ and $0 < \gamma < 1$ be real, with $c \notin \mathbb N$. We study
the solubility of the Diophantine inequality \[ \left| p_1^c + p_2^c + \dots +
p_s^c - N \right| < \varepsilon \] in Piatetski-Shapiro primes $p_1, p_2,
\dots, p_s$ of index $\gamma$---that is, primes of the form $p = \lfloor
m^{1/\gamma} \rfloor$ for some $m \in \mathbb N$.
|
math.NT
|
let c 1 and 0 gamma 1 be real with c notin mathbb n we study the solubility of the diophantine inequality left p_1c p_2c dots p_sc n right varepsilon in piatetskishapiro primes p_1 p_2 dots p_s of index gammathat is primes of the form p lfloor m1gamma rfloor for some m in mathbb n
|
[['let', 'c', '1', 'and', '0', 'gamma', '1', 'be', 'real', 'with', 'c', 'notin', 'mathbb', 'n', 'we', 'study', 'the', 'solubility', 'of', 'the', 'diophantine', 'inequality', 'left', 'p_1c', 'p_2c', 'dots', 'p_sc', 'n', 'right', 'varepsilon', 'in', 'piatetskishapiro', 'primes', 'p_1', 'p_2', 'dots', 'p_s', 'of', 'index', 'gammathat', 'is', 'primes', 'of', 'the', 'form', 'p', 'lfloor', 'm1gamma', 'rfloor', 'for', 'some', 'm', 'in', 'mathbb', 'n']]
|
[-0.2922139847475403, 0.17797148261078685, 0.0011570096929680626, -0.0399681608662677, 0.058595215462429344, -0.31734515245090117, -0.026110500677154876, 0.31099106954797257, -0.3176907367898889, -0.19385890792703853, -0.006301473294613215, -0.43910732696641164, -0.02050355303030953, 0.10963404592003603, -0.06813905598982326, 0.01586658220500949, -0.06016729559907514, 0.11659787027692457, 0.026187930568033514, -0.29176944480189737, 0.21008781037943544, -0.2296338500630743, 0.039584279868681474, 0.02101942255460429, -0.04098664452585409, -0.024240530456223014, 0.17898552346412303, -0.14631202297267626, -0.3099130915372439, 0.03916488493845429, 0.2876086261404573, 0.11597204521157832, 0.28640195133410534, -0.34945099242031574, -0.009816122557616458, 0.26882701034148065, 0.2680151528626118, -0.2508690136238792, 0.04037436067987726, -0.21676069844232979, 0.21403536235667625, -0.0501532259942631, -0.15461083172978657, 0.0036551926882480677, 0.2543412858163411, 0.044566628501205796, -0.397943876121404, 0.036337250334052544, 0.14701867071946836, 0.1154990568735092, 0.05393809141187032, -0.3224514425503758, -0.004137092041519453, 0.02142738912008562, -0.0043459018244285065, 0.14989902315011142, -0.010177074790984954, 0.004745533830433522, -0.08131799553433117, 0.3556249772883811, -0.0046857524803786904, -0.17211570563497688, -0.05219768926079543, -0.2911005961831729, -0.17673680330363084, 0.10301404010574773, 0.014994792921363184, 0.20467214732659314, 0.0999892059414876, 0.36230343848111035, -0.12350016465094292, 0.15796435821168828, 0.20339788389304336, -0.029998326103009704, 0.02047076758067563, 0.009778022906690274, 0.0273497428411161, 0.008681437674962546, -0.01459650621521023, 0.12545257715842212, -0.37065954204156715, -0.21680392221248937, -0.22450203445019587, 0.29264283997807344, -0.2103440102784486, -0.11155400618489059, 0.23354094271231793, 0.012935093112008751, 0.1943898788249155, 0.12438259959519612, 0.13770886823394388, 0.06181799531650712, -0.1044033366966035, 0.09541535475027729, -0.07308993735163964, 0.19406857404787586, -0.07542425010985923, -0.17310285084125288, -0.03864101395186669, 0.14233640496144598]
|
1,803.03953
|
Switched Wave Packets with Spectrally Truncated Chirped Pulses
|
A new technique for obtaining switched wave packets using spectrally
truncated chirped laser pulses is demonstrated experimentally and numerically
by one-dimensional alignment of both linear and asymmetric top molecules. Using
a simple long-pass transmission filter, a pulse with a slow turn on and a rapid
turn off is produced. The degree of alignment, characterized by
$\langle\cos^2\theta_\text{2D}\rangle$ rises along with the pulse intensity and
reaches a maximum at the peak of the pulse. After truncation
$\langle\cos^2\theta_\text{2D}\rangle$ drops sharply but exhibits pronounced
half and full revivals. The experimental alignment dynamics trace agrees very
well with a numerically calculated trace based on solution of the
time-dependent Schr\"odinger equation. However, the extended periods of
field-free alignment of asymmetric tops following pulse truncation reported
previously is not reproduced in our work.
|
physics.chem-ph
|
a new technique for obtaining switched wave packets using spectrally truncated chirped laser pulses is demonstrated experimentally and numerically by onedimensional alignment of both linear and asymmetric top molecules using a simple longpass transmission filter a pulse with a slow turn on and a rapid turn off is produced the degree of alignment characterized by langlecos2theta_text2drangle rises along with the pulse intensity and reaches a maximum at the peak of the pulse after truncation langlecos2theta_text2drangle drops sharply but exhibits pronounced half and full revivals the experimental alignment dynamics trace agrees very well with a numerically calculated trace based on solution of the timedependent schrodinger equation however the extended periods of fieldfree alignment of asymmetric tops following pulse truncation reported previously is not reproduced in our work
|
[['a', 'new', 'technique', 'for', 'obtaining', 'switched', 'wave', 'packets', 'using', 'spectrally', 'truncated', 'chirped', 'laser', 'pulses', 'is', 'demonstrated', 'experimentally', 'and', 'numerically', 'by', 'onedimensional', 'alignment', 'of', 'both', 'linear', 'and', 'asymmetric', 'top', 'molecules', 'using', 'a', 'simple', 'longpass', 'transmission', 'filter', 'a', 'pulse', 'with', 'a', 'slow', 'turn', 'on', 'and', 'a', 'rapid', 'turn', 'off', 'is', 'produced', 'the', 'degree', 'of', 'alignment', 'characterized', 'by', 'langlecos2theta_text2drangle', 'rises', 'along', 'with', 'the', 'pulse', 'intensity', 'and', 'reaches', 'a', 'maximum', 'at', 'the', 'peak', 'of', 'the', 'pulse', 'after', 'truncation', 'langlecos2theta_text2drangle', 'drops', 'sharply', 'but', 'exhibits', 'pronounced', 'half', 'and', 'full', 'revivals', 'the', 'experimental', 'alignment', 'dynamics', 'trace', 'agrees', 'very', 'well', 'with', 'a', 'numerically', 'calculated', 'trace', 'based', 'on', 'solution', 'of', 'the', 'timedependent', 'schrodinger', 'equation', 'however', 'the', 'extended', 'periods', 'of', 'fieldfree', 'alignment', 'of', 'asymmetric', 'tops', 'following', 'pulse', 'truncation', 'reported', 'previously', 'is', 'not', 'reproduced', 'in', 'our', 'work']]
|
[-0.13847401009819982, 0.1447105047498612, -0.09441418517305847, 0.03827619103005066, -0.017442347955018762, -0.1863352346023725, 0.045453588238864716, 0.4473651649370309, -0.23066303533531965, -0.26317081968450257, 0.07851047495721779, -0.2306467250804886, -0.09090398522769852, 0.22079925075353635, 0.01846726591728868, 0.04385116008756262, 0.07916482117012023, -0.005336079468590117, -0.07915531007400263, -0.17462724399182103, 0.2391876152851769, 0.09132559170135326, 0.28187025469096916, 0.017860838677734137, 0.13078604325381737, 0.02902506774989888, -0.014389871018788507, -0.013686732456628834, -0.08001480959055404, 0.05845120209719865, 0.1645784925166217, 0.03385812106482204, 0.21219311789008638, -0.43157442325290535, -0.20863385169650428, 0.0155631129539782, 0.1840771770868976, 0.15269140634805925, -0.08754913566911954, -0.2973248672130848, 0.02025719246106042, -0.13570590254828624, -0.1826814554120985, -0.008328754575021805, 0.037700141622354424, 0.07654952942374943, -0.25686667276444963, 0.11391725183479608, 0.04172710565457707, 0.036327210313174874, -0.03500889606150468, -0.0597362651624867, -0.054152641727048305, 0.008074190088307424, -0.0029012689539682, 0.04626999846744096, 0.12963948697001942, -0.10969664798223323, -0.07748384092326066, 0.3546252660828853, -0.1217291523644235, -0.11980993411834201, 0.12186301112242584, -0.15629342703839705, -0.012624572202067582, 0.22701435246234458, 0.10712347579523808, 0.15903382821218862, -0.10099635086578107, 0.0009681447094584244, -0.0046038273270119865, 0.22255063385607848, 0.16272023593023, -0.0014270931039185775, 0.19998505709677813, 0.1675725516960806, 0.04785665352415714, 0.1741181856111413, -0.12664298720342376, -0.1371561419735137, -0.24483130227834468, -0.048462301740543015, -0.1755862537350866, 0.04288896297305567, -0.04886870430122907, -0.14184009598853486, 0.46112074555769084, 0.05747978218771037, 0.20876968849540478, 0.05852827901816777, 0.2943568433402106, 0.2155209280026611, 0.04579976487152195, 0.04084955982961542, 0.2560369399856896, 0.1739518733849118, 0.10230032082894937, -0.2675303888034015, 0.07072164033043889, -0.010736335162824441]
|
1,803.03954
|
Fractional L-intersecting families
|
Let $L = \{\frac{a_1}{b_1}, \ldots , \frac{a_s}{b_s}\}$, where for every $i
\in [s]$, $\frac{a_i}{b_i} \in [0,1)$ is an irreducible fraction. Let
$\mathcal{F} = \{A_1, \ldots , A_m\}$ be a family of subsets of $[n]$. We say
$\mathcal{F}$ is a \emph{fractional $L$-intersecting family} if for every
distinct $i,j \in [m]$, there exists an $\frac{a}{b} \in L$ such that $|A_i
\cap A_j| \in \{ \frac{a}{b}|A_i|, \frac{a}{b} |A_j|\}$. In this paper, we
introduce and study the notion of fractional $L$-intersecting families.
|
math.CO cs.DM
|
let l fraca_1b_1 ldots fraca_sb_s where for every i in s fraca_ib_i in 01 is an irreducible fraction let mathcalf a_1 ldots a_m be a family of subsets of n we say mathcalf is a emphfractional lintersecting family if for every distinct ij in m there exists an fracab in l such that a_i cap a_j in fracaba_i fracab a_j in this paper we introduce and study the notion of fractional lintersecting families
|
[['let', 'l', 'fraca_1b_1', 'ldots', 'fraca_sb_s', 'where', 'for', 'every', 'i', 'in', 's', 'fraca_ib_i', 'in', '01', 'is', 'an', 'irreducible', 'fraction', 'let', 'mathcalf', 'a_1', 'ldots', 'a_m', 'be', 'a', 'family', 'of', 'subsets', 'of', 'n', 'we', 'say', 'mathcalf', 'is', 'a', 'emphfractional', 'lintersecting', 'family', 'if', 'for', 'every', 'distinct', 'ij', 'in', 'm', 'there', 'exists', 'an', 'fracab', 'in', 'l', 'such', 'that', 'a_i', 'cap', 'a_j', 'in', 'fracaba_i', 'fracab', 'a_j', 'in', 'this', 'paper', 'we', 'introduce', 'and', 'study', 'the', 'notion', 'of', 'fractional', 'lintersecting', 'families']]
|
[-0.2699498034797717, 0.20136636402837568, 0.0039845761586574545, -0.0880398045655043, 0.006348185423437668, -0.18296476136353138, -0.05182296832166342, 0.3394147084782953, -0.33431566306862276, -0.126863336610267, 0.010326093727506805, -0.36783679731298186, -0.08744152724756386, 0.11430508385925298, -0.13188005663265567, -0.10806708704626215, 0.014318544599834991, 0.10805565289532144, -0.02531044654534671, -0.19510968071003648, 0.3234028015015782, -0.1892220696731322, 0.09491387248525153, -0.017603392861243607, 0.10767435017919195, 0.014498057431014984, 0.0732895236502847, -0.016129744596833338, -0.307976758408388, 0.038223213745632034, 0.32839391261771106, 0.18726865903379908, 0.34893876813568064, -0.2897665243742623, -0.05252324158757709, 0.37504258387438627, 0.22825687813262144, -0.12355045724889614, 0.002052420331840066, -0.155745400601755, 0.17810800912601457, -0.17059757395822933, -0.1261029153475133, -0.0066727605391887655, 0.2336533434311117, -0.0039017372325980577, -0.4102586305875709, -0.015456269481691761, 0.1279771043986514, 0.10644655103754738, 0.04244008324230495, -0.23760877573943656, -0.06626938519985888, 0.007879853113621904, -0.07453767825053007, 0.14611536827599764, -0.04861941696583307, 0.004766934230734689, -0.09378832446384257, 0.3599578048004701, -0.07311701002038097, -0.256570040140355, -0.008321775211210268, -0.21091605436758717, -0.22052875609285588, 0.05367985343479592, 0.10003851850279202, 0.18904175825309064, -0.03613185374052736, 0.23076749305439898, -0.21278715568284193, 0.12204835721818001, 0.08484806513170833, 0.07125015561198951, 0.15433623857688214, 0.062225996063637504, 0.08500315985250947, 0.10926415888504867, 0.003561080419930859, 0.1131421639651492, -0.42689753075440723, -0.1532553958207153, -0.20100764903253404, 0.21662861740459566, -0.1107958764834515, -0.1423798927065471, 0.29758403663509997, 0.09267191721490868, 0.25574430642460566, 0.0693325290888332, 0.11971551408498561, 0.033979599733594, -0.012639920206983452, 0.15923948465185106, -0.0312549162629074, 0.11134521974979536, -0.09566210805728653, -0.14045928977429867, 0.028602850821672306, 0.146998497536001]
|
1,803.03955
|
On singularity-resolution in mimetic gravity
|
Recently, it was shown that modified mimetic gravity, with a $f(\square\phi)$
term, results in a singularity-free model of gravity, for both cosmological and
black hole spacetimes [1, 2]. In this work, we analyze this model further and
show that, since the function $f$ was tuned to vanish rapidly for small values
of the argument, the non-singular bounce relies heavily on a subtle branch
changing mechanism for the multi-valued function $f$. Furthermore, this
mechanism has interesting implications for the proposed link between this model
and loop quantum cosmology.
|
gr-qc hep-th
|
recently it was shown that modified mimetic gravity with a fsquarephi term results in a singularityfree model of gravity for both cosmological and black hole spacetimes 1 2 in this work we analyze this model further and show that since the function f was tuned to vanish rapidly for small values of the argument the nonsingular bounce relies heavily on a subtle branch changing mechanism for the multivalued function f furthermore this mechanism has interesting implications for the proposed link between this model and loop quantum cosmology
|
[['recently', 'it', 'was', 'shown', 'that', 'modified', 'mimetic', 'gravity', 'with', 'a', 'fsquarephi', 'term', 'results', 'in', 'a', 'singularityfree', 'model', 'of', 'gravity', 'for', 'both', 'cosmological', 'and', 'black', 'hole', 'spacetimes', '1', '2', 'in', 'this', 'work', 'we', 'analyze', 'this', 'model', 'further', 'and', 'show', 'that', 'since', 'the', 'function', 'f', 'was', 'tuned', 'to', 'vanish', 'rapidly', 'for', 'small', 'values', 'of', 'the', 'argument', 'the', 'nonsingular', 'bounce', 'relies', 'heavily', 'on', 'a', 'subtle', 'branch', 'changing', 'mechanism', 'for', 'the', 'multivalued', 'function', 'f', 'furthermore', 'this', 'mechanism', 'has', 'interesting', 'implications', 'for', 'the', 'proposed', 'link', 'between', 'this', 'model', 'and', 'loop', 'quantum', 'cosmology']]
|
[-0.1341854231526837, 0.0910430158770015, -0.1259749719201652, 0.11083389349216811, -0.08115700240311928, -0.20740072475204807, 0.031645780854295334, 0.30677091590193817, -0.222332783451515, -0.29155591089105193, 0.06925464133721192, -0.2203383415850789, -0.2159642441533939, 0.20128672139794934, -0.06535409977876169, 0.02948934925320087, 0.004826211662919715, 0.027502232686031695, -0.06768623350707945, -0.24602149756148803, 0.37316286266066656, 0.09916397237467992, 0.2470603711080066, 0.07963435394624464, 0.11591104310287466, -0.040279897490278056, 0.002036224974882464, 0.029577552362583404, -0.163370929415599, 0.03892331353664875, 0.16414641188241022, 0.10324631644911024, 0.26976083349544816, -0.3862626173555158, -0.2882241800665682, 0.1180992845857386, 0.129566072543195, 0.1432310248356919, -0.10041494129312246, -0.2559399738702057, 0.10313765440396098, -0.20869508674801435, -0.12397207386878341, -0.05145553474552756, 0.07486660627994773, -0.058770153389940426, -0.24872773913883192, 0.0667836404199777, 0.0790911115121183, -0.04998540814402838, -0.0704894655080902, -0.06096367539599711, -0.017089812615669744, 0.06647095903429355, 0.10638719357057409, 0.08521603894430797, 0.08970982332843853, -0.1288062123362473, -0.06632080820367434, 0.33679104856280395, -0.10081288724228046, -0.21008262042562628, 0.14542253603509, -0.16864903732527828, -0.13940394844123444, 0.03513464040723954, 0.10464619733609778, 0.16537648236898836, -0.12209700373932719, 0.16332586152211026, 0.003584562540920668, 0.16829276180739494, 0.06947944265638673, -0.0033730812165019817, 0.27785095452807496, 0.13083325710342547, 0.017277222781896938, 0.12672101811530898, -0.028709389521133933, -0.11825886540599492, -0.3239861165963893, -0.14560516305311128, -0.1431030573453321, 0.02971851155378444, -0.13337215493642318, -0.18996894288216556, 0.38158270565056523, 0.15888261195098938, 0.1770431846975847, 0.052534393608830006, 0.25863390734289277, 0.1016895160035685, 0.06556486472660719, 0.049303349421554524, 0.29671460586101855, 0.10361576072200267, 0.11787854168607398, -0.2271998037454174, 0.008614251882834144, 0.08484294612047284]
|
1,803.03956
|
On higher order Codazzi tensors on complete Riemannian manifolds
|
We prove several Liouville-type non-existence theorems for higher order
Codazzi tensors and classical Codazzi tensors on complete and compact
Riemannian manifolds, in particular. These results will be obtained by using
theorems of the connections between the geometry of a complete smooth manifold
and the global behavior of its subharmonic functions. In conclusion, we show
applications of this method for global geometry of a complete locally
conformally flat Riemannian manifold with constant scalar curvature because its
Ricci tensor is a Codazzi tensor and for global geometry of a complete
hypersurface in a standard sphere because its second fundamental form is also a
Codazzi tensor.
|
math.DG
|
we prove several liouvilletype nonexistence theorems for higher order codazzi tensors and classical codazzi tensors on complete and compact riemannian manifolds in particular these results will be obtained by using theorems of the connections between the geometry of a complete smooth manifold and the global behavior of its subharmonic functions in conclusion we show applications of this method for global geometry of a complete locally conformally flat riemannian manifold with constant scalar curvature because its ricci tensor is a codazzi tensor and for global geometry of a complete hypersurface in a standard sphere because its second fundamental form is also a codazzi tensor
|
[['we', 'prove', 'several', 'liouvilletype', 'nonexistence', 'theorems', 'for', 'higher', 'order', 'codazzi', 'tensors', 'and', 'classical', 'codazzi', 'tensors', 'on', 'complete', 'and', 'compact', 'riemannian', 'manifolds', 'in', 'particular', 'these', 'results', 'will', 'be', 'obtained', 'by', 'using', 'theorems', 'of', 'the', 'connections', 'between', 'the', 'geometry', 'of', 'a', 'complete', 'smooth', 'manifold', 'and', 'the', 'global', 'behavior', 'of', 'its', 'subharmonic', 'functions', 'in', 'conclusion', 'we', 'show', 'applications', 'of', 'this', 'method', 'for', 'global', 'geometry', 'of', 'a', 'complete', 'locally', 'conformally', 'flat', 'riemannian', 'manifold', 'with', 'constant', 'scalar', 'curvature', 'because', 'its', 'ricci', 'tensor', 'is', 'a', 'codazzi', 'tensor', 'and', 'for', 'global', 'geometry', 'of', 'a', 'complete', 'hypersurface', 'in', 'a', 'standard', 'sphere', 'because', 'its', 'second', 'fundamental', 'form', 'is', 'also', 'a', 'codazzi', 'tensor']]
|
[-0.17912930437958194, 0.03509819307319314, -0.09542533478618247, 0.09017003128797865, -0.1482074058714133, -0.11658786134613515, -0.08908556273333657, 0.3409549445908481, -0.2367502254732315, -0.18817309800476667, 0.16648122244876204, -0.2502077761675837, -0.21064046415889148, 0.17495219003481483, -0.0878691052457372, 0.023493328410340925, 0.056708837251260295, 0.10523918653539951, -0.15656538419109017, -0.2517729276718879, 0.4673062054422295, -0.01612650208826204, 0.2432319280370455, 0.13545731338891326, 0.14635598692744609, -0.02221567233915902, -0.0022793062058394974, 0.074940120697347, -0.15931051019669593, 0.1545715044044609, 0.22646224599340659, 0.10650393521205241, 0.20055569484106545, -0.4250837759413187, -0.20793799459210877, 0.15552286786542643, 0.053350509035862186, 0.05799542485456009, -0.025836673790127836, -0.29510293673109084, 0.1246227737181612, -0.06042167182234161, -0.1953362985186333, -0.14611619215422464, 0.007582555656113382, -0.02765306708565687, -0.21470200292115071, 0.10609655888514928, 0.15281140806099164, 0.056293327026792524, -0.12631226412260235, -0.08594361102226579, -0.0760834194557036, 0.08080118428011543, 0.026115546631400737, 0.04039254083831623, 0.08748196780193344, -0.09321305134279419, -0.10998778736548842, 0.32883987961861405, -0.13917087898838323, -0.3272162539143007, 0.10278299812552999, -0.12979440165014522, -0.14554111376061168, 0.08604994713265485, 0.17677179816432154, 0.21217392148106423, -0.10186130834010981, 0.1707207817082447, -0.02527148318725629, 0.09337400872875186, 0.09124462111192999, 0.004001084100274207, 0.15873423157693836, 0.08077586903146387, 0.1702820153961193, 0.12971654437703886, 0.03772187506999296, -0.0855772635149001, -0.3909022289789417, -0.22887783899939465, -0.17278618453007227, 0.16852025868731677, -0.20982124473282487, -0.20092057263098875, 0.4085246148266043, -0.05479003344176482, 0.16820447070205366, 0.12175187768495994, 0.2699339231182324, 0.03035307159981898, 0.021735475292356993, 0.1110033842020677, 0.2704421121590925, 0.2733402133046749, 0.1077091394995963, -0.08796140154652994, -0.10218533957196237, 0.14125863721286788]
|
1,803.03957
|
Soft tilt and rotational modes in the hybrid improper ferroelectric
Ca$_{3}$Mn$_{2}$O$_{7}$
|
Raman spectroscopy is employed to probe directly the soft rotation and
tilting modes, which are two primary order parameters predicted in the hybrid
improper ferroelectric material Ca$_3$Mn$_2$O$_7$. We observe a giant softening
of the 107-cm$^{-1}$ octahedron tilting mode by 26~cm$^{-1}$, on heating
through the structural transition from a ferroelectric to paraelectric
orthorhombic phase. This is contrasted by a small softening of the
150-cm$^{-1}$ rotational mode by 6~cm$^{-1}$. In the intermediate phase, the
competing soft modes with different symmetries coexist, bringing about
many-faceted anomalies in spin excitations and lattice vibrations. Our work
demonstrates that the soft rotation and tilt patterns, relying on a
phase-transition path, are a key factor in determining ferroelectric, magnetic,
and lattice properties of Ca$_3$Mn$_2$O$_7$.
|
cond-mat.str-el
|
raman spectroscopy is employed to probe directly the soft rotation and tilting modes which are two primary order parameters predicted in the hybrid improper ferroelectric material ca_3mn_2o_7 we observe a giant softening of the 107cm1 octahedron tilting mode by 26cm1 on heating through the structural transition from a ferroelectric to paraelectric orthorhombic phase this is contrasted by a small softening of the 150cm1 rotational mode by 6cm1 in the intermediate phase the competing soft modes with different symmetries coexist bringing about manyfaceted anomalies in spin excitations and lattice vibrations our work demonstrates that the soft rotation and tilt patterns relying on a phasetransition path are a key factor in determining ferroelectric magnetic and lattice properties of ca_3mn_2o_7
|
[['raman', 'spectroscopy', 'is', 'employed', 'to', 'probe', 'directly', 'the', 'soft', 'rotation', 'and', 'tilting', 'modes', 'which', 'are', 'two', 'primary', 'order', 'parameters', 'predicted', 'in', 'the', 'hybrid', 'improper', 'ferroelectric', 'material', 'ca_3mn_2o_7', 'we', 'observe', 'a', 'giant', 'softening', 'of', 'the', '107cm1', 'octahedron', 'tilting', 'mode', 'by', '26cm1', 'on', 'heating', 'through', 'the', 'structural', 'transition', 'from', 'a', 'ferroelectric', 'to', 'paraelectric', 'orthorhombic', 'phase', 'this', 'is', 'contrasted', 'by', 'a', 'small', 'softening', 'of', 'the', '150cm1', 'rotational', 'mode', 'by', '6cm1', 'in', 'the', 'intermediate', 'phase', 'the', 'competing', 'soft', 'modes', 'with', 'different', 'symmetries', 'coexist', 'bringing', 'about', 'manyfaceted', 'anomalies', 'in', 'spin', 'excitations', 'and', 'lattice', 'vibrations', 'our', 'work', 'demonstrates', 'that', 'the', 'soft', 'rotation', 'and', 'tilt', 'patterns', 'relying', 'on', 'a', 'phasetransition', 'path', 'are', 'a', 'key', 'factor', 'in', 'determining', 'ferroelectric', 'magnetic', 'and', 'lattice', 'properties', 'of', 'ca_3mn_2o_7']]
|
[-0.1841717200699897, 0.2685768675899743, -0.07382091059786293, -0.03403476449280804, -0.1263019130173741, -0.07979293400009649, 0.10654348006216496, 0.4186098042183218, -0.2985837733645025, -0.2549539769513417, 0.05512485766898742, -0.27389687141485974, -0.1592533619728236, 0.12151088906386126, 0.020697063032900337, -0.0009162644896887045, -0.0342975267983648, -0.03133469686299496, -0.06645667191751434, -0.11486317026140415, 0.2585219989852172, 0.00017106847062838817, 0.3195929646459037, 0.005483787438823982, 0.04303103741011129, -0.010479723985216259, 0.09160791264962306, 0.004613947407630956, -0.15011793763441933, 0.05776196252142565, 0.23836620560789532, -0.07464042475006123, 0.15209209488754252, -0.4185497234286988, -0.21556032320435067, -0.0032542799699915555, 0.12352904980482979, 0.14109146081846602, -0.05583572809881143, -0.25436618863151667, 0.0385376540037383, -0.10124587453489678, -0.12650296905910416, -0.13061422278560633, -0.03560554986588855, 0.0008995873818536643, -0.23735848863938033, 0.10127273565817592, 0.07698432525900085, 0.11935220387315097, -0.12164668357247009, -0.0994536512968155, -0.09743024497622607, 0.07063780645881079, 0.09895284970464037, 0.06599907591873039, 0.14592039019726546, -0.08591529169733908, -0.15255177059763037, 0.4037774550374103, -0.01770375535176424, -0.06939425121424143, 0.17261246047023915, -0.18764984964978246, -0.11021917305919712, 0.20891493909984035, 0.09841381790233875, 0.0899783197205217, -0.1094726132047651, 0.010074895114299999, 0.07159578934954726, 0.21310386632618586, 0.0776213775924613, 0.07420822287769577, 0.26056559322242456, 0.18416162936297137, -0.0265215025571859, 0.18957887433749515, -0.11340953668876164, -0.060660274159492905, -0.23145961159411654, -0.10877652568083289, -0.1768821749802209, 0.009256111482669294, -0.1209046509589761, -0.16507032013547698, 0.3883750447385277, 0.08293429205804008, 0.17995738750735743, -0.06962145472860244, 0.26582601869507666, 0.0556108967114685, 0.11365558127089675, 0.004130305977851416, 0.3313221237807642, 0.17714588995816896, 0.07690604118036881, -0.3511818652144279, 0.06824248324280226, 0.03091529021719553]
|
1,803.03958
|
Reliable and Real-Time End-to-End Delivery Protocol in Wireless Sensor
Networks
|
Many routing protocols have been proposed to handle reliability and real-time
routing energy efficiency for wireless sensor networks. In this paper we
propose a new routing protocol with QoS based capabilities for WSNs. We used
priority queues for improve real-time and non-real-time packets forwarding
according to deadline of them. The protocol finds a best-cost, time-sensitive
packet forwarding mechanism for real-time data with minimum consumption of the
energy. In order to avoid of congestion in network our protocol drops those
packets who can't reach their destination in specified time. For service
quality assurance in reliability domain we used packet reception rate as an
important parameter (PRR) in selecting of neighbor nodes. Simulation results
show that our new approach how can provide quality of service parameters.
|
cs.NI
|
many routing protocols have been proposed to handle reliability and realtime routing energy efficiency for wireless sensor networks in this paper we propose a new routing protocol with qos based capabilities for wsns we used priority queues for improve realtime and nonrealtime packets forwarding according to deadline of them the protocol finds a bestcost timesensitive packet forwarding mechanism for realtime data with minimum consumption of the energy in order to avoid of congestion in network our protocol drops those packets who cant reach their destination in specified time for service quality assurance in reliability domain we used packet reception rate as an important parameter prr in selecting of neighbor nodes simulation results show that our new approach how can provide quality of service parameters
|
[['many', 'routing', 'protocols', 'have', 'been', 'proposed', 'to', 'handle', 'reliability', 'and', 'realtime', 'routing', 'energy', 'efficiency', 'for', 'wireless', 'sensor', 'networks', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'routing', 'protocol', 'with', 'qos', 'based', 'capabilities', 'for', 'wsns', 'we', 'used', 'priority', 'queues', 'for', 'improve', 'realtime', 'and', 'nonrealtime', 'packets', 'forwarding', 'according', 'to', 'deadline', 'of', 'them', 'the', 'protocol', 'finds', 'a', 'bestcost', 'timesensitive', 'packet', 'forwarding', 'mechanism', 'for', 'realtime', 'data', 'with', 'minimum', 'consumption', 'of', 'the', 'energy', 'in', 'order', 'to', 'avoid', 'of', 'congestion', 'in', 'network', 'our', 'protocol', 'drops', 'those', 'packets', 'who', 'cant', 'reach', 'their', 'destination', 'in', 'specified', 'time', 'for', 'service', 'quality', 'assurance', 'in', 'reliability', 'domain', 'we', 'used', 'packet', 'reception', 'rate', 'as', 'an', 'important', 'parameter', 'prr', 'in', 'selecting', 'of', 'neighbor', 'nodes', 'simulation', 'results', 'show', 'that', 'our', 'new', 'approach', 'how', 'can', 'provide', 'quality', 'of', 'service', 'parameters']]
|
[-0.25363427806433625, -0.0014496968018706904, -0.026541777360215176, 0.012716441202295444, -0.08560329077507907, -0.239948857045634, 0.2060283931905434, 0.4637920802319044, -0.24135439361377461, -0.34073579643012547, 0.053013544993444794, -0.2429432499457181, -0.09787989553154969, 0.1494027956850766, -0.18601485040432553, 0.18711148859645294, 0.10112470361154254, 0.06393370258539528, 0.05916727197118013, -0.3252585041147422, 0.24463325612459, 0.1344616691188175, 0.3845823987016106, 0.10934077793868577, 0.05287352255479304, 0.052092552211559645, 0.003447302681965587, -0.05164273142228064, -0.11519293242345452, 0.07239194386979429, 0.37569898394186324, 0.2463077199853563, 0.3086391257546176, -0.4829515949860821, -0.2692858059095537, 0.09324769895879657, 0.16962245919900695, 0.07236191860544003, -0.04108058169012799, -0.29627093808286314, 0.15257760477290164, -0.28537948593133833, -0.050889261627221495, -0.05859252904367641, -0.05169425574244886, 0.10990508399691766, -0.281523441827697, -0.02094547865662451, -0.08086950910406385, -0.0479489506631181, -0.05888000159425949, -0.03030021232363533, -0.0051140005291416876, 0.19099571969647838, 0.013277111204939221, 0.014542830662188552, 0.1268375012910039, -0.10548825233955149, -0.19830959360493816, 0.4131138918966782, 0.05139541379422161, -0.16912862047840788, 0.11091549368385922, 0.04135201349703035, -0.1674378233568031, 0.1265638035805366, 0.29100504739406874, 0.04995537288434902, -0.2039258833520296, -0.06386155542080874, 0.05669916730858689, 0.1663712395082523, 0.09084408540975272, 0.1248668020692175, 0.09330507200892742, 0.24319383182858184, 0.17729582739151575, 0.10169364732682584, -0.07795779626628165, -0.09220342815222363, -0.19387984926229326, -0.14972566577749766, -0.19831178497856225, -0.009869873349562408, -0.13252017813960915, -0.07018223163156914, 0.4096764571116707, 0.24043068477157048, 0.13307955154649367, 0.13533794827668405, 0.421125325979097, 0.07702948781188457, 0.037297212229133014, 0.20188851235055827, 0.15262298484719017, -0.037687864540735395, 0.21739571733869673, -0.15831149132246514, 0.15542842324243905, 0.019958206717439784]
|
1,803.03959
|
Variations of the Hydrogen Bonding and of the Hydrogen Bonded Network in
Ethanol-Water Mixtures on Cooling
|
Extensive molecular dynamics computer simulations have been conducted for
ethanol-water liquid mixtures in the water-rich side of the composition range,
with 10, 20 and 30 mol % of the alcohol, at temperatures between room
temperature and the experimental freezing point of the given mixture. All-atom
type (OPLS) interatomic potentials have been assumed for ethanol, in
combination with two kinds of rigid water models (SPC/E and TIP4P/2005). Both
combinations have provided excellent reproductions of the experimental X-ray
total structure factors at each temperature; this provided a strong basis for
further structural analyses. Beyond partial radial distribution functions,
various descriptors of hydrogen bonded assemblies, as well as of the hydrogen
bonded network have been determined from the simulated particle configurations.
A clear tendency was observed towards that an increasing proportion of water
molecules participate in hydrogen bonding with exactly 2 donor- and 2 acceptor
sites as temperature decreases. Concerning larger assemblies held together by
hydrogen bonding, the main focus was put on the properties of cyclic entities:
it was found that, similarly to methanol-water mixtures, the number of hydrogen
bonded rings has increased with lowering temperature. However, for
ethanol-water mixtures the dominance of not the six-, but of the five-fold
rings could be observed.
|
physics.chem-ph cond-mat.soft
|
extensive molecular dynamics computer simulations have been conducted for ethanolwater liquid mixtures in the waterrich side of the composition range with 10 20 and 30 mol of the alcohol at temperatures between room temperature and the experimental freezing point of the given mixture allatom type opls interatomic potentials have been assumed for ethanol in combination with two kinds of rigid water models spce and tip4p2005 both combinations have provided excellent reproductions of the experimental xray total structure factors at each temperature this provided a strong basis for further structural analyses beyond partial radial distribution functions various descriptors of hydrogen bonded assemblies as well as of the hydrogen bonded network have been determined from the simulated particle configurations a clear tendency was observed towards that an increasing proportion of water molecules participate in hydrogen bonding with exactly 2 donor and 2 acceptor sites as temperature decreases concerning larger assemblies held together by hydrogen bonding the main focus was put on the properties of cyclic entities it was found that similarly to methanolwater mixtures the number of hydrogen bonded rings has increased with lowering temperature however for ethanolwater mixtures the dominance of not the six but of the fivefold rings could be observed
|
[['extensive', 'molecular', 'dynamics', 'computer', 'simulations', 'have', 'been', 'conducted', 'for', 'ethanolwater', 'liquid', 'mixtures', 'in', 'the', 'waterrich', 'side', 'of', 'the', 'composition', 'range', 'with', '10', '20', 'and', '30', 'mol', 'of', 'the', 'alcohol', 'at', 'temperatures', 'between', 'room', 'temperature', 'and', 'the', 'experimental', 'freezing', 'point', 'of', 'the', 'given', 'mixture', 'allatom', 'type', 'opls', 'interatomic', 'potentials', 'have', 'been', 'assumed', 'for', 'ethanol', 'in', 'combination', 'with', 'two', 'kinds', 'of', 'rigid', 'water', 'models', 'spce', 'and', 'tip4p2005', 'both', 'combinations', 'have', 'provided', 'excellent', 'reproductions', 'of', 'the', 'experimental', 'xray', 'total', 'structure', 'factors', 'at', 'each', 'temperature', 'this', 'provided', 'a', 'strong', 'basis', 'for', 'further', 'structural', 'analyses', 'beyond', 'partial', 'radial', 'distribution', 'functions', 'various', 'descriptors', 'of', 'hydrogen', 'bonded', 'assemblies', 'as', 'well', 'as', 'of', 'the', 'hydrogen', 'bonded', 'network', 'have', 'been', 'determined', 'from', 'the', 'simulated', 'particle', 'configurations', 'a', 'clear', 'tendency', 'was', 'observed', 'towards', 'that', 'an', 'increasing', 'proportion', 'of', 'water', 'molecules', 'participate', 'in', 'hydrogen', 'bonding', 'with', 'exactly', '2', 'donor', 'and', '2', 'acceptor', 'sites', 'as', 'temperature', 'decreases', 'concerning', 'larger', 'assemblies', 'held', 'together', 'by', 'hydrogen', 'bonding', 'the', 'main', 'focus', 'was', 'put', 'on', 'the', 'properties', 'of', 'cyclic', 'entities', 'it', 'was', 'found', 'that', 'similarly', 'to', 'methanolwater', 'mixtures', 'the', 'number', 'of', 'hydrogen', 'bonded', 'rings', 'has', 'increased', 'with', 'lowering', 'temperature', 'however', 'for', 'ethanolwater', 'mixtures', 'the', 'dominance', 'of', 'not', 'the', 'six', 'but', 'of', 'the', 'fivefold', 'rings', 'could', 'be', 'observed']]
|
[-0.05721977820755469, 0.15757284271572797, -0.028311618505305246, -0.004980747882781819, 0.04688578708194641, -0.14934282237084684, 0.05084450813520014, 0.4121611500911841, -0.2155178660439705, -0.32482078737713654, 0.048946850787181015, -0.32150627737424675, -0.09095815065043483, 0.12716770080434836, 0.05743149653877951, 0.03349943097161861, 0.02117087416506062, -0.01280615112219534, -0.06140859866866944, -0.24803270275857467, 0.24020365889262946, 0.09823209049518392, 0.26637561002570154, 0.11712619172645483, 0.07618672442182306, -0.03839788026876043, 0.01792115685112997, 0.01977236995146846, -0.13958695940060867, 0.07899795031452735, 0.257561956754361, 0.026386355210920396, 0.2104606168235731, -0.4756607457031658, -0.2374339244231137, 0.08678437899265308, 0.09824154166439872, 0.10646613741488155, -0.06170242073753413, -0.22351033605903906, 0.030564866829153835, -0.17500338032007662, -0.1356890854930774, -0.051079058134696674, 0.06298600082790748, 0.10888077110901767, -0.19556054630952735, 0.08600837300619601, 0.01229751087662611, 0.14294467928161408, -0.12368004984889569, -0.22656365132089057, -0.09332634194172566, 0.10144409571950375, 0.021943029666965857, 0.017088945552507482, 0.22140138822524294, -0.09769039548382126, -0.050052958669775716, 0.3976784008624616, -0.0666582705788963, -0.11342765630697206, 0.28375197222817744, -0.13662674347754217, -0.13932205366193137, 0.2070408576626831, 0.10116713535618639, 0.06336065010163025, -0.15211134104189042, 0.01818588559993019, -0.053032733884579804, 0.22219962824152814, 0.14571410151596983, -0.013837581714707895, 0.24875781474523803, 0.19093476534318365, -0.014445509805589618, 0.14349492645500442, -0.1054900858750502, -0.08126121828684685, -0.17600324343187984, -0.16055573562660547, -0.15940320950559808, 0.0006724062714689823, -0.0733150745698331, -0.1470982930530326, 0.3092536979623658, 0.061891686532702016, 0.16646712755237647, 0.0028591187142614108, 0.2182777360902951, 0.0186952509360147, 0.092965474549162, -0.013504211459568335, 0.24146632936815568, 0.1619036547270307, 0.09774033959569242, -0.2204668059648566, 0.13868932972490713, -0.0032899278108625956]
|
1,803.0396
|
EarthFinder: A Precise Radial Velocity Probe Mission Concept For the
Detection of Earth-Mass Planets Orbiting Sun-like Stars
|
EarthFinder is a Probe Mission concept selected for study by NASA for input
to the 2020 astronomy decadal survey. This study is currently active and a
final white paper report is due to NASA at the end of calendar 2018. We are
tasked with evaluating the scientific rationale for obtaining precise radial
velocity (PRV) measurements in space, which is a two-part inquiry: What can be
gained from going to space? What can't be done form the ground? These two
questions flow down to these specific tasks for our study - Identify the
velocity limit, if any, introduced from micro- and macro-telluric absorption in
the Earth's atmosphere; Evaluate the unique advantages that a space-based
platform provides to emable the identification and mitigation of stellar
acitivity for multi-planet signal recovery.
|
astro-ph.IM astro-ph.EP astro-ph.SR
|
earthfinder is a probe mission concept selected for study by nasa for input to the 2020 astronomy decadal survey this study is currently active and a final white paper report is due to nasa at the end of calendar 2018 we are tasked with evaluating the scientific rationale for obtaining precise radial velocity prv measurements in space which is a twopart inquiry what can be gained from going to space what cant be done form the ground these two questions flow down to these specific tasks for our study identify the velocity limit if any introduced from micro and macrotelluric absorption in the earths atmosphere evaluate the unique advantages that a spacebased platform provides to emable the identification and mitigation of stellar acitivity for multiplanet signal recovery
|
[['earthfinder', 'is', 'a', 'probe', 'mission', 'concept', 'selected', 'for', 'study', 'by', 'nasa', 'for', 'input', 'to', 'the', '2020', 'astronomy', 'decadal', 'survey', 'this', 'study', 'is', 'currently', 'active', 'and', 'a', 'final', 'white', 'paper', 'report', 'is', 'due', 'to', 'nasa', 'at', 'the', 'end', 'of', 'calendar', '2018', 'we', 'are', 'tasked', 'with', 'evaluating', 'the', 'scientific', 'rationale', 'for', 'obtaining', 'precise', 'radial', 'velocity', 'prv', 'measurements', 'in', 'space', 'which', 'is', 'a', 'twopart', 'inquiry', 'what', 'can', 'be', 'gained', 'from', 'going', 'to', 'space', 'what', 'cant', 'be', 'done', 'form', 'the', 'ground', 'these', 'two', 'questions', 'flow', 'down', 'to', 'these', 'specific', 'tasks', 'for', 'our', 'study', 'identify', 'the', 'velocity', 'limit', 'if', 'any', 'introduced', 'from', 'micro', 'and', 'macrotelluric', 'absorption', 'in', 'the', 'earths', 'atmosphere', 'evaluate', 'the', 'unique', 'advantages', 'that', 'a', 'spacebased', 'platform', 'provides', 'to', 'emable', 'the', 'identification', 'and', 'mitigation', 'of', 'stellar', 'acitivity', 'for', 'multiplanet', 'signal', 'recovery']]
|
[-0.06970236550380544, 0.12871871523301653, -0.08576667809677196, 0.04213207643535897, -0.1496727935348948, -0.07590688049520661, 0.040272659153632095, 0.3423921772983016, -0.23809585386766044, -0.36019419525121527, 0.14082667828732495, -0.28412863860527676, -0.11506929942898876, 0.2292609176886215, -0.08984827112058193, 0.0462948057310262, 0.10371272788171058, -0.009077432085059553, -0.02168162843227629, -0.2570535824596276, 0.28763187252651384, 0.1061825157574764, 0.2248838561382599, 0.015255817901191673, 0.07578523743640238, -0.03405689808153888, -0.07718157835637893, -0.02071367351128152, -0.1596211321386097, 0.11789871573569329, 0.3159866392329937, 0.20507404500262705, 0.3137110223524212, -0.3552373533205288, -0.21348110467528666, 0.07307022849733873, 0.1143142824947107, 0.06549087426401826, -0.04057230692871702, -0.32461089609054533, 0.07665018028223781, -0.16211038470510544, -0.1502161946155252, -0.05831697562092355, 0.05154159174838323, -0.010958960868524222, -0.2538258653376403, -0.02163040503950381, 0.026679159073931414, 0.11636021799158032, -0.10280598096201211, -0.09676517303881606, 0.00348523525498444, 0.17267180633602466, 0.03430984247659477, 0.07622085169158362, 0.11149028047343822, -0.11059459001226947, -0.07695902733329107, 0.41625883037695754, -0.053884781032944536, -0.09765456606751323, 0.1689329445059222, -0.1690057877813678, -0.13898372439273854, 0.08826364794503747, 0.2213787929556234, 0.08655517379851724, -0.20698125582430663, 0.022284621121532216, -0.0030284307828945356, 0.159016340721126, 0.06877424413474595, 0.025227602368705276, 0.30083113907253356, 0.19978120050779202, 0.09106588769113509, 0.10162851421211702, -0.1522192393156995, -0.045659068502425175, -0.2565621104947011, -0.1667242696796491, -0.16154005091137638, 0.02040082126159251, 0.019109314085505865, -0.09349373451290213, 0.3894864080106552, 0.1967143714485919, 0.14075252893229387, 0.014243250846204052, 0.34650193588861183, 0.06150700073174345, 0.03162671012304178, 0.05954075025345343, 0.29120372802140265, 0.05907536417102002, 0.13267678741698827, -0.17801446674346197, 0.06219795502994845, 0.023842934055284152]
|
1,803.03961
|
Solvent hydrodynamics enhances the collective diffusion of membrane
lipids
|
The collective motion of membrane lipids over hundred of nanometers and
nanoseconds is essential for the formation of submicron complexes of lipids and
proteins in the cell membrane. These dynamics are difficult to access
experimentally and are currently poorly understood. One of the conclusions of
the celebrated Saffman-Debr\"uck (SD) theory is that lipid disturbances smaller
than the Saffman length (microns) are not affected by the hydrodynamics of the
embedding solvent. Using molecular dynamics and coarse-grained models with
implicit hydrodynamics we show that this is not true. Hydrodynamic interactions
between the membrane and the solvent strongly enhance the short-time collective
diffusion of lipids at all scales. The momentum transferred between the
membrane and the solvent in normal direction (not considered by the SD theory)
propagates tangentially over the membrane inducing long-ranged repulsive forces
amongst lipids. As a consequence the lipid collective diffusion coefficient
increases proportionally to the disturbance wavelength. We find quantitative
agreement with the predicted anomalous diffusion in quasi-two-dimensional
dynamics, observed in colloids confined to a plane but embedded in 3D solvent.
|
physics.bio-ph
|
the collective motion of membrane lipids over hundred of nanometers and nanoseconds is essential for the formation of submicron complexes of lipids and proteins in the cell membrane these dynamics are difficult to access experimentally and are currently poorly understood one of the conclusions of the celebrated saffmandebruck sd theory is that lipid disturbances smaller than the saffman length microns are not affected by the hydrodynamics of the embedding solvent using molecular dynamics and coarsegrained models with implicit hydrodynamics we show that this is not true hydrodynamic interactions between the membrane and the solvent strongly enhance the shorttime collective diffusion of lipids at all scales the momentum transferred between the membrane and the solvent in normal direction not considered by the sd theory propagates tangentially over the membrane inducing longranged repulsive forces amongst lipids as a consequence the lipid collective diffusion coefficient increases proportionally to the disturbance wavelength we find quantitative agreement with the predicted anomalous diffusion in quasitwodimensional dynamics observed in colloids confined to a plane but embedded in 3d solvent
|
[['the', 'collective', 'motion', 'of', 'membrane', 'lipids', 'over', 'hundred', 'of', 'nanometers', 'and', 'nanoseconds', 'is', 'essential', 'for', 'the', 'formation', 'of', 'submicron', 'complexes', 'of', 'lipids', 'and', 'proteins', 'in', 'the', 'cell', 'membrane', 'these', 'dynamics', 'are', 'difficult', 'to', 'access', 'experimentally', 'and', 'are', 'currently', 'poorly', 'understood', 'one', 'of', 'the', 'conclusions', 'of', 'the', 'celebrated', 'saffmandebruck', 'sd', 'theory', 'is', 'that', 'lipid', 'disturbances', 'smaller', 'than', 'the', 'saffman', 'length', 'microns', 'are', 'not', 'affected', 'by', 'the', 'hydrodynamics', 'of', 'the', 'embedding', 'solvent', 'using', 'molecular', 'dynamics', 'and', 'coarsegrained', 'models', 'with', 'implicit', 'hydrodynamics', 'we', 'show', 'that', 'this', 'is', 'not', 'true', 'hydrodynamic', 'interactions', 'between', 'the', 'membrane', 'and', 'the', 'solvent', 'strongly', 'enhance', 'the', 'shorttime', 'collective', 'diffusion', 'of', 'lipids', 'at', 'all', 'scales', 'the', 'momentum', 'transferred', 'between', 'the', 'membrane', 'and', 'the', 'solvent', 'in', 'normal', 'direction', 'not', 'considered', 'by', 'the', 'sd', 'theory', 'propagates', 'tangentially', 'over', 'the', 'membrane', 'inducing', 'longranged', 'repulsive', 'forces', 'amongst', 'lipids', 'as', 'a', 'consequence', 'the', 'lipid', 'collective', 'diffusion', 'coefficient', 'increases', 'proportionally', 'to', 'the', 'disturbance', 'wavelength', 'we', 'find', 'quantitative', 'agreement', 'with', 'the', 'predicted', 'anomalous', 'diffusion', 'in', 'quasitwodimensional', 'dynamics', 'observed', 'in', 'colloids', 'confined', 'to', 'a', 'plane', 'but', 'embedded', 'in', '3d', 'solvent']]
|
[-0.12238000298588815, 0.2151533338617076, -0.038654485465863406, 0.04401844278882034, 0.015827362697261076, -0.1435720148844895, -0.029165228296408965, 0.38530339392675467, -0.2979191253887631, -0.2606889867708523, -0.013101981539546092, -0.28034238665424593, -0.1499376536363311, 0.12248186401209973, -0.00561335789072409, -0.01393476805012477, 0.025334382518562244, -0.018099842908961033, 0.021058897343491426, -0.17299946535879757, 0.2067424179210017, 0.05042557726064098, 0.2723970584250028, 0.11778145692480063, 0.10077377904086696, -0.02464887106039545, 0.028237631069278422, 0.04124975909767618, -0.19877360338572894, 0.09584903586329076, 0.22257125161939906, -0.05888356840270653, 0.22655447177474566, -0.48898082673113946, -0.26618091923073045, 0.05312147885778842, 0.2149442883234945, 0.1459297616775447, -0.005630090865388251, -0.24906855351591145, 0.042665293045363754, -0.13362852419721105, -0.122690357126252, -0.0351909754991161, 0.01722311034215865, 0.07080691490541566, -0.19254993942528092, 0.21345705973605314, 0.05056369390028218, 0.0838996220695955, -0.10799037944933955, -0.07114489910285375, -0.06375568355733191, 0.1399015140670695, 0.08346860380080795, 0.017544464569005092, 0.2760909380592414, -0.15191102390652741, -0.040308052053054176, 0.4084728003278026, -0.04829464645279171, -0.25078650699024313, 0.25110036379804734, -0.2001925937004921, -0.039760197465320266, 0.2088561010143954, 0.11958466847399958, 0.11539964197334229, -0.15434276355751816, 0.013448397037525503, -0.021603832753887126, 0.22520821490352266, 0.09396792537116103, 0.0049241736189755666, 0.22094882656248255, 0.20852762755082802, 0.015321742647942917, 0.12350352473927347, -0.09492263039410637, -0.1659288364353628, -0.2327096774038581, -0.14720209819749433, -0.1861255977572383, 0.02752128116436213, -0.10874720914061291, -0.1889549921265373, 0.3258619020919027, 0.10130710095815273, 0.16514143651713514, 0.04284037926168949, 0.2538724742660963, -0.018324311414858796, 0.08879755086358092, 0.016328262178804617, 0.2642893631730163, 0.146538039582934, 0.09768744620047945, -0.29052781084503393, 0.1023333350166526, 0.045000193945584244]
|
1,803.03962
|
Confluent and non-confluent phases in a model of cell tissue
|
The Voronoi-based cellular model is highly successful in describing the
motion of two-dimensional confluent cell tissues. In the homogeneous version of
this model, the energy of each cell is determined solely by its geometric shape
and size, and the interaction between adjacent cells is a byproduct of this
additive energy. We generalize this model so as to allow zero or partial
contact between cells. We identify several phases, two of which (solid
confluent and liquid confluent) were found in previous studies that imposed
confluency but others that are novel. Transitions in this model may be relevant
for understanding both normal development as well as cancer metastasis.
|
q-bio.CB cond-mat.soft physics.bio-ph
|
the voronoibased cellular model is highly successful in describing the motion of twodimensional confluent cell tissues in the homogeneous version of this model the energy of each cell is determined solely by its geometric shape and size and the interaction between adjacent cells is a byproduct of this additive energy we generalize this model so as to allow zero or partial contact between cells we identify several phases two of which solid confluent and liquid confluent were found in previous studies that imposed confluency but others that are novel transitions in this model may be relevant for understanding both normal development as well as cancer metastasis
|
[['the', 'voronoibased', 'cellular', 'model', 'is', 'highly', 'successful', 'in', 'describing', 'the', 'motion', 'of', 'twodimensional', 'confluent', 'cell', 'tissues', 'in', 'the', 'homogeneous', 'version', 'of', 'this', 'model', 'the', 'energy', 'of', 'each', 'cell', 'is', 'determined', 'solely', 'by', 'its', 'geometric', 'shape', 'and', 'size', 'and', 'the', 'interaction', 'between', 'adjacent', 'cells', 'is', 'a', 'byproduct', 'of', 'this', 'additive', 'energy', 'we', 'generalize', 'this', 'model', 'so', 'as', 'to', 'allow', 'zero', 'or', 'partial', 'contact', 'between', 'cells', 'we', 'identify', 'several', 'phases', 'two', 'of', 'which', 'solid', 'confluent', 'and', 'liquid', 'confluent', 'were', 'found', 'in', 'previous', 'studies', 'that', 'imposed', 'confluency', 'but', 'others', 'that', 'are', 'novel', 'transitions', 'in', 'this', 'model', 'may', 'be', 'relevant', 'for', 'understanding', 'both', 'normal', 'development', 'as', 'well', 'as', 'cancer', 'metastasis']]
|
[-0.08728055548985963, 0.1474969744065091, -0.010178736641669189, 0.02401137528479767, -0.042976100674285644, -0.16121247345757372, 0.04584252737673386, 0.36021893679269784, -0.27925927028661807, -0.2737849918457697, 0.0773883568131769, -0.23816857482130938, -0.2349965458951082, 0.157454861852973, -0.08313823996533481, 0.013759571882645722, 0.013991014078646054, 0.030083451198220673, -0.011200611483973433, -0.19275190756779234, 0.2650200343176828, 0.008048079784889266, 0.29109640577851953, 0.04264604576472369, 0.06048843342336422, -0.02732963866185186, -0.024133114899807382, 0.045663191471248865, -0.14124351805627877, 0.09963675356417331, 0.25045102877808156, 0.09284621923459026, 0.2388229165929106, -0.47810227387004867, -0.254491522091107, 0.09510279508782024, 0.16857661469839513, 0.09765702335247418, -0.015218146149736812, -0.22217370875680573, 0.037943512238649967, -0.17408825064359126, -0.13810826607382382, -0.06569016398862004, -0.002513498165600775, 0.07016567580093287, -0.22613969861687916, 0.11542216463251707, 0.08322576629898493, 0.029711949967126856, -0.09441874612381963, -0.12465948372516993, -0.04756371383687025, 0.17419886488230232, 0.0337645312186928, 0.007565591988408551, 0.12826333965481268, -0.1607467056041197, -0.0865781544488064, 0.379662866853529, 0.014731369989502401, -0.23692129096889403, 0.22187482604080425, -0.14660034658849122, -0.11361596063833754, 0.13050478769747434, 0.1517725758395105, 0.09239763717325229, -0.20263548140009902, 0.02625095162305647, -0.040112042514045, 0.12774020726880375, 0.09203335458307334, -0.009648572091224059, 0.19791921008518845, 0.22699175120489495, 0.00018974870689353852, 0.1274997890566669, -0.0661141649174135, -0.10826743297489747, -0.2816215136949465, -0.19329124939724593, -0.12703088643073263, 0.021427528225412627, -0.053734538118867865, -0.19943584894040986, 0.40053542569841977, 0.08826479830620985, 0.20292594915537057, 0.022507096026290453, 0.2689891164981813, 0.0722142997437227, 0.07260962048071032, -0.028721152664214936, 0.2146456735999376, 0.10603626222209127, 0.07832772384907277, -0.21643733850873584, 0.09843452257666525, 0.0876512784941368]
|
1,803.03963
|
BTS-DSN: Deeply Supervised Neural Network with Short Connections for
Retinal Vessel Segmentation
|
Background and Objective: The condition of vessel of the human eye is an
important factor for the diagnosis of ophthalmological diseases. Vessel
segmentation in fundus images is a challenging task due to complex vessel
structure, the presence of similar structures such as microaneurysms and
hemorrhages, micro-vessel with only one to several pixels wide, and
requirements for finer results. Methods:In this paper, we present a multi-scale
deeply supervised network with short connections (BTS-DSN) for vessel
segmentation. We used short connections to transfer semantic information
between side-output layers. Bottom-top short connections pass low level
semantic information to high level for refining results in high-level
side-outputs, and top-bottom short connection passes much structural
information to low level for reducing noises in low-level side-outputs. In
addition, we employ cross-training to show that our model is suitable for real
world fundus images. Results: The proposed BTS-DSN has been verified on DRIVE,
STARE and CHASE_DB1 datasets, and showed competitive performance over other
state-of-the-art methods. Specially, with patch level input, the network
achieved 0.7891/0.8212 sensitivity, 0.9804/0.9843 specificity, 0.9806/0.9859
AUC, and 0.8249/0.8421 F1-score on DRIVE and STARE, respectively. Moreover, our
model behaves better than other methods in cross-training experiments.
Conclusions: BTS-DSN achieves competitive performance in vessel segmentation
task on three public datasets. It is suitable for vessel segmentation. The
source code of our method is available at https://github.com/guomugong/BTS-DSN.
|
cs.CV
|
background and objective the condition of vessel of the human eye is an important factor for the diagnosis of ophthalmological diseases vessel segmentation in fundus images is a challenging task due to complex vessel structure the presence of similar structures such as microaneurysms and hemorrhages microvessel with only one to several pixels wide and requirements for finer results methodsin this paper we present a multiscale deeply supervised network with short connections btsdsn for vessel segmentation we used short connections to transfer semantic information between sideoutput layers bottomtop short connections pass low level semantic information to high level for refining results in highlevel sideoutputs and topbottom short connection passes much structural information to low level for reducing noises in lowlevel sideoutputs in addition we employ crosstraining to show that our model is suitable for real world fundus images results the proposed btsdsn has been verified on drive stare and chase_db1 datasets and showed competitive performance over other stateoftheart methods specially with patch level input the network achieved 0789108212 sensitivity 0980409843 specificity 0980609859 auc and 0824908421 f1score on drive and stare respectively moreover our model behaves better than other methods in crosstraining experiments conclusions btsdsn achieves competitive performance in vessel segmentation task on three public datasets it is suitable for vessel segmentation the source code of our method is available at httpsgithubcomguomugongbtsdsn
|
[['background', 'and', 'objective', 'the', 'condition', 'of', 'vessel', 'of', 'the', 'human', 'eye', 'is', 'an', 'important', 'factor', 'for', 'the', 'diagnosis', 'of', 'ophthalmological', 'diseases', 'vessel', 'segmentation', 'in', 'fundus', 'images', 'is', 'a', 'challenging', 'task', 'due', 'to', 'complex', 'vessel', 'structure', 'the', 'presence', 'of', 'similar', 'structures', 'such', 'as', 'microaneurysms', 'and', 'hemorrhages', 'microvessel', 'with', 'only', 'one', 'to', 'several', 'pixels', 'wide', 'and', 'requirements', 'for', 'finer', 'results', 'methodsin', 'this', 'paper', 'we', 'present', 'a', 'multiscale', 'deeply', 'supervised', 'network', 'with', 'short', 'connections', 'btsdsn', 'for', 'vessel', 'segmentation', 'we', 'used', 'short', 'connections', 'to', 'transfer', 'semantic', 'information', 'between', 'sideoutput', 'layers', 'bottomtop', 'short', 'connections', 'pass', 'low', 'level', 'semantic', 'information', 'to', 'high', 'level', 'for', 'refining', 'results', 'in', 'highlevel', 'sideoutputs', 'and', 'topbottom', 'short', 'connection', 'passes', 'much', 'structural', 'information', 'to', 'low', 'level', 'for', 'reducing', 'noises', 'in', 'lowlevel', 'sideoutputs', 'in', 'addition', 'we', 'employ', 'crosstraining', 'to', 'show', 'that', 'our', 'model', 'is', 'suitable', 'for', 'real', 'world', 'fundus', 'images', 'results', 'the', 'proposed', 'btsdsn', 'has', 'been', 'verified', 'on', 'drive', 'stare', 'and', 'chase_db1', 'datasets', 'and', 'showed', 'competitive', 'performance', 'over', 'other', 'stateoftheart', 'methods', 'specially', 'with', 'patch', 'level', 'input', 'the', 'network', 'achieved', '0789108212', 'sensitivity', '0980409843', 'specificity', '0980609859', 'auc', 'and', '0824908421', 'f1score', 'on', 'drive', 'and', 'stare', 'respectively', 'moreover', 'our', 'model', 'behaves', 'better', 'than', 'other', 'methods', 'in', 'crosstraining', 'experiments', 'conclusions', 'btsdsn', 'achieves', 'competitive', 'performance', 'in', 'vessel', 'segmentation', 'task', 'on', 'three', 'public', 'datasets', 'it', 'is', 'suitable', 'for', 'vessel', 'segmentation', 'the', 'source', 'code', 'of', 'our', 'method', 'is', 'available', 'at', 'httpsgithubcomguomugongbtsdsn']]
|
[-0.05058933361313767, -0.005457219027380446, -0.0425394039022275, 0.07103133806305999, -0.08222946053518801, -0.17780187415072224, 0.016011739388368283, 0.4603599291120734, -0.20424642351281364, -0.3398472629443995, 0.1012346332829672, -0.2867938023034448, -0.1589549011670523, 0.22967485835009785, -0.14501709885085784, 0.06091053310344344, 0.16880514375129976, 0.0629481596776467, -0.022630458239631328, -0.270883626967155, 0.25712534606295734, 0.08463309714396562, 0.3628160317741752, 0.07851359602837049, 0.15302865165253127, -0.05711629296213423, -0.0253714892826104, 0.0010836953134058375, -0.06799908846342162, 0.13552722753059318, 0.3185491216399981, 0.14552049783154208, 0.2573032978863377, -0.40343749431771375, -0.21487025600296628, 0.047756182089682984, 0.11054866073357168, 0.07507346234696147, -0.011974267319397497, -0.34782188856608676, 0.12048068457222152, -0.11642202798486034, 0.005504193757910925, -0.10328585647425188, -0.017312042398822156, -0.03537208292955341, -0.26544244086862734, 0.0810162787723886, 0.051222055495464214, 0.09837808296254132, -0.06335743921417221, -0.1300216461335979, 0.007155728915371175, 0.21536810042893637, 0.007509067900496247, 0.09201893398253178, 0.1492353850267349, -0.22578380593842887, -0.09380658484016714, 0.33432685042009036, -0.06432674143651868, -0.19851325723890947, 0.23842296237996388, -0.06153141649763065, -0.13501143472478072, 0.1292167400699718, 0.18762939172866536, 0.10142593926784939, -0.12497641114739998, -0.0358915505645183, -0.0019376989558478382, 0.21689094845031467, 0.10106637330059937, -0.013001247423387647, 0.15780648557256002, 0.29289660827805086, 0.032935366773255446, 0.1371160439127473, -0.16068903351241776, -0.04500240211540433, -0.20120891883738654, -0.12106501149496708, -0.11746793560614095, -0.04673565447300011, -0.10810891665011278, -0.1292468779198129, 0.38063185057106697, 0.20892774586992285, 0.1722943602090649, 0.0767092692282782, 0.34941372237653495, -0.011225456195648447, 0.10523923597011332, 0.043359151982079985, 0.17845444928497842, 0.024951460740798823, 0.10984248899888448, -0.17192015237235855, 0.07415469214385463, 0.040686550544722824]
|
1,803.03964
|
Characterizing optical variability of OJ 287 in 2016 - 2017
|
We report on a recent multi-band optical photometric and polarimetric
observational campaign of the blazar OJ 287 which was carried out during
September 2016 -- December 2017. We employed nine telescopes in Bulgaria,
China, Georgia, Japan, Serbia, Spain and the United States. We collected over
1800 photometric image frames in BVRI bands and over 100 polarimetric
measurements over ~175 nights. In 11 nights with many quasi-simultaneous
multi-band (V, R, I) observations, we did not detect any genuine intraday
variability in flux or color. On longer timescales, multiple flaring events
were seen. Large changes in color with respect to time and in a
color--magnitude diagram were seen, and while only a weak systematic
variability trend was noticed in color with respect to time, the
color--magnitude diagram shows a bluer-when-brighter trend. Large changes in
the degree of polarization, and substantial swings in the polarization angle
were detected. The fractional Stokes parameters of the polarization showed a
systematic trend with time in the beginning of these observations, followed by
chaotic changes and then an apparently systematic variation at the end. These
polarization changes coincide with the detection and duration of the source at
very high energies as seen by VERITAS. The spectral index shows a systematic
variation with time and V-band magnitude. We briefly discuss possible physical
mechanisms that could explain the observed flux, color, polarization, and
spectral variability.
|
astro-ph.HE
|
we report on a recent multiband optical photometric and polarimetric observational campaign of the blazar oj 287 which was carried out during september 2016 december 2017 we employed nine telescopes in bulgaria china georgia japan serbia spain and the united states we collected over 1800 photometric image frames in bvri bands and over 100 polarimetric measurements over 175 nights in 11 nights with many quasisimultaneous multiband v r i observations we did not detect any genuine intraday variability in flux or color on longer timescales multiple flaring events were seen large changes in color with respect to time and in a colormagnitude diagram were seen and while only a weak systematic variability trend was noticed in color with respect to time the colormagnitude diagram shows a bluerwhenbrighter trend large changes in the degree of polarization and substantial swings in the polarization angle were detected the fractional stokes parameters of the polarization showed a systematic trend with time in the beginning of these observations followed by chaotic changes and then an apparently systematic variation at the end these polarization changes coincide with the detection and duration of the source at very high energies as seen by veritas the spectral index shows a systematic variation with time and vband magnitude we briefly discuss possible physical mechanisms that could explain the observed flux color polarization and spectral variability
|
[['we', 'report', 'on', 'a', 'recent', 'multiband', 'optical', 'photometric', 'and', 'polarimetric', 'observational', 'campaign', 'of', 'the', 'blazar', 'oj', '287', 'which', 'was', 'carried', 'out', 'during', 'september', '2016', 'december', '2017', 'we', 'employed', 'nine', 'telescopes', 'in', 'bulgaria', 'china', 'georgia', 'japan', 'serbia', 'spain', 'and', 'the', 'united', 'states', 'we', 'collected', 'over', '1800', 'photometric', 'image', 'frames', 'in', 'bvri', 'bands', 'and', 'over', '100', 'polarimetric', 'measurements', 'over', '175', 'nights', 'in', '11', 'nights', 'with', 'many', 'quasisimultaneous', 'multiband', 'v', 'r', 'i', 'observations', 'we', 'did', 'not', 'detect', 'any', 'genuine', 'intraday', 'variability', 'in', 'flux', 'or', 'color', 'on', 'longer', 'timescales', 'multiple', 'flaring', 'events', 'were', 'seen', 'large', 'changes', 'in', 'color', 'with', 'respect', 'to', 'time', 'and', 'in', 'a', 'colormagnitude', 'diagram', 'were', 'seen', 'and', 'while', 'only', 'a', 'weak', 'systematic', 'variability', 'trend', 'was', 'noticed', 'in', 'color', 'with', 'respect', 'to', 'time', 'the', 'colormagnitude', 'diagram', 'shows', 'a', 'bluerwhenbrighter', 'trend', 'large', 'changes', 'in', 'the', 'degree', 'of', 'polarization', 'and', 'substantial', 'swings', 'in', 'the', 'polarization', 'angle', 'were', 'detected', 'the', 'fractional', 'stokes', 'parameters', 'of', 'the', 'polarization', 'showed', 'a', 'systematic', 'trend', 'with', 'time', 'in', 'the', 'beginning', 'of', 'these', 'observations', 'followed', 'by', 'chaotic', 'changes', 'and', 'then', 'an', 'apparently', 'systematic', 'variation', 'at', 'the', 'end', 'these', 'polarization', 'changes', 'coincide', 'with', 'the', 'detection', 'and', 'duration', 'of', 'the', 'source', 'at', 'very', 'high', 'energies', 'as', 'seen', 'by', 'veritas', 'the', 'spectral', 'index', 'shows', 'a', 'systematic', 'variation', 'with', 'time', 'and', 'vband', 'magnitude', 'we', 'briefly', 'discuss', 'possible', 'physical', 'mechanisms', 'that', 'could', 'explain', 'the', 'observed', 'flux', 'color', 'polarization', 'and', 'spectral', 'variability']]
|
[-0.09462924595986907, 0.13921208759465825, -0.10717975448403094, 0.06436155656766561, -0.0619883268357565, -0.09746202827431262, 0.06872865407520698, 0.5001521743834019, -0.1791357159221338, -0.39824324901163993, 0.10728190110944626, -0.3115461185119218, -0.07981150288121878, 0.1869631417778631, -0.11721179354108043, 0.0033819984996484387, 0.10719252659163127, -0.08636348675095683, -0.054420638164350145, -0.2645440757083189, 0.20020749615505337, 0.0644519358780235, 0.2459690555270451, -0.007601296456737651, 0.07152208839491424, -0.01833678433128322, -0.1550983915084766, 0.004625531611446705, -0.06984889360057422, 0.003466788538498804, 0.26744951105780074, 0.07880601698843141, 0.18339816394365496, -0.3530003394207193, -0.19776250229941475, 0.08604532154276967, 0.08130564806361994, 0.015020358932411505, 0.014554652577886979, -0.2826870961777038, -0.01954062761945857, -0.14368627729754532, -0.13633125084969733, 0.04829085872353365, 0.1162225581250257, 0.00951469426948784, -0.19503157475963234, 0.09986116228004296, -0.03267349868585977, 0.20224363739188347, -0.1177702399296686, -0.11540438423140181, -0.06364997525099575, 0.09257456997512943, 0.04843819001896514, 0.08626354283342759, 0.06100992167575492, -0.08184640393592417, -0.1294847426842898, 0.3264861139810334, -0.11466178732613723, 0.05133798058248228, 0.16328525295481086, -0.24321077225729823, -0.1965061215331985, 0.1582256929234912, 0.16495732300190463, 0.08916800321804152, -0.1421378716226253, -0.007065149380618499, 0.00974836898346742, 0.2590928305602736, 0.07807931278314856, 0.06932255623448226, 0.2632775815824668, 0.10927591987575094, -0.0006859667353435523, 0.11524498597822255, -0.30481402231380345, -0.026518956563797675, -0.28948088289885265, -0.06462479207043846, -0.1084981938637793, 0.06969822529606366, -0.07290078650681406, -0.08958262600366854, 0.48124957291202414, 0.10850999308543073, 0.20175162758471238, 0.005501950805903309, 0.23970415252985225, 0.0666103827756726, 0.08204030766617507, 0.09144226330022018, 0.3290536157062484, 0.06979873175732791, 0.2088153467922368, -0.2064791784932216, 0.0767659626306138, -0.04658809400163591]
|
1,803.03965
|
BEBP: An Poisoning Method Against Machine Learning Based IDSs
|
In big data era, machine learning is one of fundamental techniques in
intrusion detection systems (IDSs). However, practical IDSs generally update
their decision module by feeding new data then retraining learning models in a
periodical way. Hence, some attacks that comprise the data for training or
testing classifiers significantly challenge the detecting capability of machine
learning-based IDSs. Poisoning attack, which is one of the most recognized
security threats towards machine learning-based IDSs, injects some adversarial
samples into the training phase, inducing data drifting of training data and a
significant performance decrease of target IDSs over testing data. In this
paper, we adopt the Edge Pattern Detection (EPD) algorithm to design a novel
poisoning method that attack against several machine learning algorithms used
in IDSs. Specifically, we propose a boundary pattern detection algorithm to
efficiently generate the points that are near to abnormal data but considered
to be normal ones by current classifiers. Then, we introduce a Batch-EPD
Boundary Pattern (BEBP) detection algorithm to overcome the limitation of the
number of edge pattern points generated by EPD and to obtain more useful
adversarial samples. Based on BEBP, we further present a moderate but effective
poisoning method called chronic poisoning attack. Extensive experiments on
synthetic and three real network data sets demonstrate the performance of the
proposed poisoning method against several well-known machine learning
algorithms and a practical intrusion detection method named FMIFS-LSSVM-IDS.
|
cs.LG cs.CR stat.ML
|
in big data era machine learning is one of fundamental techniques in intrusion detection systems idss however practical idss generally update their decision module by feeding new data then retraining learning models in a periodical way hence some attacks that comprise the data for training or testing classifiers significantly challenge the detecting capability of machine learningbased idss poisoning attack which is one of the most recognized security threats towards machine learningbased idss injects some adversarial samples into the training phase inducing data drifting of training data and a significant performance decrease of target idss over testing data in this paper we adopt the edge pattern detection epd algorithm to design a novel poisoning method that attack against several machine learning algorithms used in idss specifically we propose a boundary pattern detection algorithm to efficiently generate the points that are near to abnormal data but considered to be normal ones by current classifiers then we introduce a batchepd boundary pattern bebp detection algorithm to overcome the limitation of the number of edge pattern points generated by epd and to obtain more useful adversarial samples based on bebp we further present a moderate but effective poisoning method called chronic poisoning attack extensive experiments on synthetic and three real network data sets demonstrate the performance of the proposed poisoning method against several wellknown machine learning algorithms and a practical intrusion detection method named fmifslssvmids
|
[['in', 'big', 'data', 'era', 'machine', 'learning', 'is', 'one', 'of', 'fundamental', 'techniques', 'in', 'intrusion', 'detection', 'systems', 'idss', 'however', 'practical', 'idss', 'generally', 'update', 'their', 'decision', 'module', 'by', 'feeding', 'new', 'data', 'then', 'retraining', 'learning', 'models', 'in', 'a', 'periodical', 'way', 'hence', 'some', 'attacks', 'that', 'comprise', 'the', 'data', 'for', 'training', 'or', 'testing', 'classifiers', 'significantly', 'challenge', 'the', 'detecting', 'capability', 'of', 'machine', 'learningbased', 'idss', 'poisoning', 'attack', 'which', 'is', 'one', 'of', 'the', 'most', 'recognized', 'security', 'threats', 'towards', 'machine', 'learningbased', 'idss', 'injects', 'some', 'adversarial', 'samples', 'into', 'the', 'training', 'phase', 'inducing', 'data', 'drifting', 'of', 'training', 'data', 'and', 'a', 'significant', 'performance', 'decrease', 'of', 'target', 'idss', 'over', 'testing', 'data', 'in', 'this', 'paper', 'we', 'adopt', 'the', 'edge', 'pattern', 'detection', 'epd', 'algorithm', 'to', 'design', 'a', 'novel', 'poisoning', 'method', 'that', 'attack', 'against', 'several', 'machine', 'learning', 'algorithms', 'used', 'in', 'idss', 'specifically', 'we', 'propose', 'a', 'boundary', 'pattern', 'detection', 'algorithm', 'to', 'efficiently', 'generate', 'the', 'points', 'that', 'are', 'near', 'to', 'abnormal', 'data', 'but', 'considered', 'to', 'be', 'normal', 'ones', 'by', 'current', 'classifiers', 'then', 'we', 'introduce', 'a', 'batchepd', 'boundary', 'pattern', 'bebp', 'detection', 'algorithm', 'to', 'overcome', 'the', 'limitation', 'of', 'the', 'number', 'of', 'edge', 'pattern', 'points', 'generated', 'by', 'epd', 'and', 'to', 'obtain', 'more', 'useful', 'adversarial', 'samples', 'based', 'on', 'bebp', 'we', 'further', 'present', 'a', 'moderate', 'but', 'effective', 'poisoning', 'method', 'called', 'chronic', 'poisoning', 'attack', 'extensive', 'experiments', 'on', 'synthetic', 'and', 'three', 'real', 'network', 'data', 'sets', 'demonstrate', 'the', 'performance', 'of', 'the', 'proposed', 'poisoning', 'method', 'against', 'several', 'wellknown', 'machine', 'learning', 'algorithms', 'and', 'a', 'practical', 'intrusion', 'detection', 'method', 'named', 'fmifslssvmids']]
|
[-0.10128924583899275, 0.02452922079687536, -0.0723344855439246, 0.06658225087807945, -0.09975546174415999, -0.25448262917353787, 0.10742181518355114, 0.39209450598568185, -0.27240697645617135, -0.3189713927252538, 0.12941227319685225, -0.28810645876451557, -0.20042873721360538, 0.21861987833819857, -0.1545744949460737, 0.14304901255624952, 0.12521649734405566, 0.02938505360243292, -0.014201078880865472, -0.3000376058305462, 0.3404518832423876, 0.035723163020111914, 0.3840115733674444, 0.019628844997539936, 0.07491195122690847, -0.029213112725626003, -0.020238779990888706, -0.014432220289479564, -0.03271839405983222, 0.1353775383576357, 0.3505048647751686, 0.2664578316511693, 0.3532878302349524, -0.40533245605158125, -0.22016330585622185, 0.14059352379144552, 0.1477920354101889, 0.14905375618198352, -0.12311989140911192, -0.3629525164716635, 0.12979435230839162, -0.18937788471181585, -0.03997293486062946, -0.15755551698154027, -0.03752968426961, -0.035075805515885794, -0.2621347504475109, -0.010566188838555465, 0.07207620949745958, 0.07563734728646042, -0.058502464737263116, -0.08185182764330297, 0.05177483187233496, 0.0892370078940404, 0.05200473631174193, 0.004773106897815996, 0.18497472585295327, -0.16143147748180087, -0.18709196786279278, 0.3309973563654307, -0.03598379469702291, -0.1656093798641378, 0.2044502837503419, 0.0293171658213476, -0.16920255486841113, 0.1409148798336476, 0.28409287250972054, 0.11318315514712081, -0.15634272194319787, -0.04041636089634331, 0.01956641187559042, 0.14495177910814988, 0.0287081997899035, -0.03818750462498893, 0.1493810002737174, 0.26332665142902717, 0.08832318785021878, 0.13553823982539795, -0.18874199984857756, -0.02736563652770241, -0.1984931229529615, -0.10203099775534238, -0.19307340533649014, -0.04688615913785961, -0.054246221416443176, -0.18133560832054457, 0.3870398805431595, 0.2654984440359119, 0.182635736761467, 0.06983636253531858, 0.4252197439310506, 0.008723492085900864, 0.12111562365329608, 0.11834729354754747, 0.18029509429355248, -0.0024228407950078997, 0.09065507851380267, -0.1861193231414667, 0.13366905932975234, 0.009788013427489589]
|
1,803.03966
|
Low-cost Autonomous Navigation System Based on Optical Flow
Classification
|
This work presents a low-cost robot, controlled by a Raspberry Pi, whose
navigation system is based on vision. The strategy used consisted of
identifying obstacles via optical flow pattern recognition. Its estimation was
done using the Lucas-Kanade algorithm, which can be executed by the Raspberry
Pi without harming its performance. Finally, an SVM-based classifier was used
to identify patterns of this signal associated with obstacles movement. The
developed system was evaluated considering its execution over an optical flow
pattern dataset extracted from a real navigation environment. In the end, it
was verified that the acquisition cost of the system was inferior to that
presented by most of the cited works, while its performance was similar to
theirs.
|
cs.RO
|
this work presents a lowcost robot controlled by a raspberry pi whose navigation system is based on vision the strategy used consisted of identifying obstacles via optical flow pattern recognition its estimation was done using the lucaskanade algorithm which can be executed by the raspberry pi without harming its performance finally an svmbased classifier was used to identify patterns of this signal associated with obstacles movement the developed system was evaluated considering its execution over an optical flow pattern dataset extracted from a real navigation environment in the end it was verified that the acquisition cost of the system was inferior to that presented by most of the cited works while its performance was similar to theirs
|
[['this', 'work', 'presents', 'a', 'lowcost', 'robot', 'controlled', 'by', 'a', 'raspberry', 'pi', 'whose', 'navigation', 'system', 'is', 'based', 'on', 'vision', 'the', 'strategy', 'used', 'consisted', 'of', 'identifying', 'obstacles', 'via', 'optical', 'flow', 'pattern', 'recognition', 'its', 'estimation', 'was', 'done', 'using', 'the', 'lucaskanade', 'algorithm', 'which', 'can', 'be', 'executed', 'by', 'the', 'raspberry', 'pi', 'without', 'harming', 'its', 'performance', 'finally', 'an', 'svmbased', 'classifier', 'was', 'used', 'to', 'identify', 'patterns', 'of', 'this', 'signal', 'associated', 'with', 'obstacles', 'movement', 'the', 'developed', 'system', 'was', 'evaluated', 'considering', 'its', 'execution', 'over', 'an', 'optical', 'flow', 'pattern', 'dataset', 'extracted', 'from', 'a', 'real', 'navigation', 'environment', 'in', 'the', 'end', 'it', 'was', 'verified', 'that', 'the', 'acquisition', 'cost', 'of', 'the', 'system', 'was', 'inferior', 'to', 'that', 'presented', 'by', 'most', 'of', 'the', 'cited', 'works', 'while', 'its', 'performance', 'was', 'similar', 'to', 'theirs']]
|
[-0.12821677944057772, 0.034152938668172345, -0.13389467825301182, -0.025574105551951908, -0.06724027666844364, -0.15709704177008352, 0.022785493878162123, 0.422593614898431, -0.24554572908036634, -0.3411671419938405, 0.12493950959084094, -0.24612649102321166, -0.18147295910833228, 0.2451875387449922, -0.14092105404378322, 0.12405622852010986, 0.10411560740799476, 0.08845828445110884, -0.006370679485814598, -0.2689275707766955, 0.22278021219182506, 0.09023020282371813, 0.290388842463557, -0.012595306063054973, 0.11032100633964834, 0.019487724088243823, -0.023782761194385015, -0.005982612004965289, -0.026693108221580688, 0.14134368339641035, 0.25763435534233403, 0.17125653723054804, 0.2507641693123449, -0.40176996173193824, -0.17737679941277218, 0.0674415281535978, 0.14958988300437093, 0.0555022577685503, -0.04228523421861454, -0.39295886495174503, 0.1358697162125196, -0.17935072697508028, -0.08262728307889695, -0.03209411749082944, 0.005759909398790099, -0.009450257875713814, -0.22637455781491903, -0.015491058508682454, 0.016300096368600223, 0.11512088821802893, -0.034131441050424025, -0.0671694540950016, 0.015393928568969425, 0.19436727966874456, 0.018340929449161786, 0.07822514954620065, 0.1990928703513092, -0.11131628090515733, -0.15726263450387007, 0.41245548266312504, -0.02584901865761783, -0.20637212857966208, 0.19361121662191919, -0.03840014109244713, -0.051679490050539754, 0.15920829273855838, 0.18811346601662982, 0.0971021650191874, -0.2082191243624458, 0.01806135694934135, -0.018142459579767324, 0.20812257276211157, 0.07116255313396835, -0.11072819696691556, 0.13850478541790548, 0.2590170321014956, 0.037278759153957806, 0.18130935126274791, -0.1128951113528779, -0.03190147022629141, -0.1972659355075234, -0.11786315036523673, -0.22031729475746298, -0.03341341230811344, -0.03716446876398519, -0.09246154434573, 0.4069006637327819, 0.17256599972342962, 0.18138203307444978, 0.03424292446699184, 0.36838912907948035, 0.07838360120793088, 0.10335242282997212, 0.08196944075947006, 0.20895268794638702, 0.026569572350997318, 0.16593009713563558, -0.2343388413741755, 0.13834420269211897, 0.040132577322089136]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.