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.08367
|
Gradient Descent Quantizes ReLU Network Features
|
Deep neural networks are often trained in the over-parametrized regime (i.e.
with far more parameters than training examples), and understanding why the
training converges to solutions that generalize remains an open problem.
Several studies have highlighted the fact that the training procedure, i.e.
mini-batch Stochastic Gradient Descent (SGD) leads to solutions that have
specific properties in the loss landscape. However, even with plain Gradient
Descent (GD) the solutions found in the over-parametrized regime are pretty
good and this phenomenon is poorly understood.
We propose an analysis of this behavior for feedforward networks with a ReLU
activation function under the assumption of small initialization and learning
rate and uncover a quantization effect: The weight vectors tend to concentrate
at a small number of directions determined by the input data. As a consequence,
we show that for given input data there are only finitely many, "simple"
functions that can be obtained, independent of the network size. This puts
these functions in analogy to linear interpolations (for given input data there
are finitely many triangulations, which each determine a function by linear
interpolation). We ask whether this analogy extends to the generalization
properties - while the usual distribution-independent generalization property
does not hold, it could be that for e.g. smooth functions with bounded second
derivative an approximation property holds which could "explain" generalization
of networks (of unbounded size) to unseen inputs.
|
stat.ML cs.LG
|
deep neural networks are often trained in the overparametrized regime ie with far more parameters than training examples and understanding why the training converges to solutions that generalize remains an open problem several studies have highlighted the fact that the training procedure ie minibatch stochastic gradient descent sgd leads to solutions that have specific properties in the loss landscape however even with plain gradient descent gd the solutions found in the overparametrized regime are pretty good and this phenomenon is poorly understood we propose an analysis of this behavior for feedforward networks with a relu activation function under the assumption of small initialization and learning rate and uncover a quantization effect the weight vectors tend to concentrate at a small number of directions determined by the input data as a consequence we show that for given input data there are only finitely many simple functions that can be obtained independent of the network size this puts these functions in analogy to linear interpolations for given input data there are finitely many triangulations which each determine a function by linear interpolation we ask whether this analogy extends to the generalization properties while the usual distributionindependent generalization property does not hold it could be that for eg smooth functions with bounded second derivative an approximation property holds which could explain generalization of networks of unbounded size to unseen inputs
|
[['deep', 'neural', 'networks', 'are', 'often', 'trained', 'in', 'the', 'overparametrized', 'regime', 'ie', 'with', 'far', 'more', 'parameters', 'than', 'training', 'examples', 'and', 'understanding', 'why', 'the', 'training', 'converges', 'to', 'solutions', 'that', 'generalize', 'remains', 'an', 'open', 'problem', 'several', 'studies', 'have', 'highlighted', 'the', 'fact', 'that', 'the', 'training', 'procedure', 'ie', 'minibatch', 'stochastic', 'gradient', 'descent', 'sgd', 'leads', 'to', 'solutions', 'that', 'have', 'specific', 'properties', 'in', 'the', 'loss', 'landscape', 'however', 'even', 'with', 'plain', 'gradient', 'descent', 'gd', 'the', 'solutions', 'found', 'in', 'the', 'overparametrized', 'regime', 'are', 'pretty', 'good', 'and', 'this', 'phenomenon', 'is', 'poorly', 'understood', 'we', 'propose', 'an', 'analysis', 'of', 'this', 'behavior', 'for', 'feedforward', 'networks', 'with', 'a', 'relu', 'activation', 'function', 'under', 'the', 'assumption', 'of', 'small', 'initialization', 'and', 'learning', 'rate', 'and', 'uncover', 'a', 'quantization', 'effect', 'the', 'weight', 'vectors', 'tend', 'to', 'concentrate', 'at', 'a', 'small', 'number', 'of', 'directions', 'determined', 'by', 'the', 'input', 'data', 'as', 'a', 'consequence', 'we', 'show', 'that', 'for', 'given', 'input', 'data', 'there', 'are', 'only', 'finitely', 'many', 'simple', 'functions', 'that', 'can', 'be', 'obtained', 'independent', 'of', 'the', 'network', 'size', 'this', 'puts', 'these', 'functions', 'in', 'analogy', 'to', 'linear', 'interpolations', 'for', 'given', 'input', 'data', 'there', 'are', 'finitely', 'many', 'triangulations', 'which', 'each', 'determine', 'a', 'function', 'by', 'linear', 'interpolation', 'we', 'ask', 'whether', 'this', 'analogy', 'extends', 'to', 'the', 'generalization', 'properties', 'while', 'the', 'usual', 'distributionindependent', 'generalization', 'property', 'does', 'not', 'hold', 'it', 'could', 'be', 'that', 'for', 'eg', 'smooth', 'functions', 'with', 'bounded', 'second', 'derivative', 'an', 'approximation', 'property', 'holds', 'which', 'could', 'explain', 'generalization', 'of', 'networks', 'of', 'unbounded', 'size', 'to', 'unseen', 'inputs']]
|
[-0.08621198437966422, 0.08408151860296315, -0.06409020797761839, 0.11199022799121043, -0.09622242432169714, -0.18789498432921983, 0.02335349142003706, 0.4076599712454866, -0.3295125394591873, -0.27930685686612183, 0.09437179451783717, -0.25931129291743893, -0.1929340345112172, 0.20031831297015212, -0.11945834637841103, 0.05940650769105255, 0.10491241510682596, 0.04171613802197943, -0.07508170472930846, -0.28702285243731634, 0.30134972506961766, 0.030401044964712392, 0.2837815065969485, 0.009817159416447374, 0.11274136976587139, -0.038102131293848616, 0.030800769526084744, 0.023092585037583446, -0.08615727113175979, 0.09591190415841737, 0.2784784570631739, 0.14694793291293398, 0.32712432615215875, -0.42246485909340403, -0.23097885645811123, 0.16947791889096542, 0.1600082994507044, 0.10717053182314393, -0.0513107208138263, -0.20854955147090265, 0.11432369794524254, -0.11211730607904265, -0.09878351362955465, -0.12851570897821812, -0.00979877142933744, 0.04507144459724295, -0.2848316802774527, 0.04047228990221142, 0.11673143661620981, 0.037666297826384164, -0.0448505137226491, -0.11205255187276571, 0.001365298387852994, 0.10337355893488875, 0.06181581710498074, 0.06830692108892857, 0.09758641752352865, -0.16223594615038994, -0.0914101226599928, 0.3280145634490882, -0.04397040139813241, -0.25938451684667013, 0.18185980009281236, -0.11019177772597069, -0.14501727079061816, 0.08697192183437101, 0.16311252842111604, 0.12485515770864199, -0.1408771215979059, 0.0712506649431071, -0.07646343762327872, 0.15574537096022, 0.07027218435451979, 0.03458443835853611, 0.13135763235433265, 0.16194410233590179, 0.08482773770887962, 0.14447786791213185, -0.03829898897944108, -0.10358355989441735, -0.28178814792029133, -0.0727787083363579, -0.20128256439063125, 0.0558381570121176, -0.11019892346432908, -0.19669551384175762, 0.34944411388512225, 0.15009108863752757, 0.27264441457466276, 0.13578975949506172, 0.27172578429179634, 0.12084524627182107, 0.11724280032415418, 0.10946382948357432, 0.22658239589749715, 0.09716677251333444, 0.08653926265647528, -0.14801472423576117, 0.12630476922143993, 0.06518394188022822]
|
1,803.08368
|
A Short Comparison of Classical Complex Dynamics and Holomorphic
Semigroup Dynamics
|
This is an expository plus research paper which mainly exposes preliminary
connection and contrast between classical complex dynamics and semigroup
dynamics of holomorphic functions. Classically, we expose some existing results
of rational and transcendental dynamics and we see how far these results
generalized to holomorphic semigroup dynamics as well as we also see what new
phenomena occur.
|
math.DS
|
this is an expository plus research paper which mainly exposes preliminary connection and contrast between classical complex dynamics and semigroup dynamics of holomorphic functions classically we expose some existing results of rational and transcendental dynamics and we see how far these results generalized to holomorphic semigroup dynamics as well as we also see what new phenomena occur
|
[['this', 'is', 'an', 'expository', 'plus', 'research', 'paper', 'which', 'mainly', 'exposes', 'preliminary', 'connection', 'and', 'contrast', 'between', 'classical', 'complex', 'dynamics', 'and', 'semigroup', 'dynamics', 'of', 'holomorphic', 'functions', 'classically', 'we', 'expose', 'some', 'existing', 'results', 'of', 'rational', 'and', 'transcendental', 'dynamics', 'and', 'we', 'see', 'how', 'far', 'these', 'results', 'generalized', 'to', 'holomorphic', 'semigroup', 'dynamics', 'as', 'well', 'as', 'we', 'also', 'see', 'what', 'new', 'phenomena', 'occur']]
|
[-0.09971671342326884, 0.08258238440739979, -0.10311897435601343, 0.1519885885676271, -0.15053148008883, -0.11726532887928841, 0.003063624898347546, 0.3403121505194066, -0.3611359264080723, -0.2471824572993475, 0.10074348881914232, -0.28590546510786863, -0.31679407549662547, 0.2140607053512021, -0.08396290379919503, 0.01667533339442391, 0.021566060486069898, 8.107336205348634e-05, -0.07789776187488123, -0.23151018875732757, 0.3940278981534535, 0.03729392031591647, 0.1735310197007238, 0.13275435529322477, 0.07046869908982333, -0.024394779531448557, -0.052507456453321014, -0.0340910610710189, -0.19643230736255646, 0.08212059260787148, 0.2932570428963293, 0.13183454081840945, 0.24992697792160407, -0.4711037771286149, -0.1671678933331318, 0.13993522773186365, 0.17583541724863544, 0.03737645538058132, -0.036753430456053796, -0.2555502833586121, 0.0031510348729952647, -0.14852632141851804, -0.18213212633864923, -0.1646511102454704, 0.005945948990094557, 0.05236432286338848, -0.16054989658949667, 0.04038085855835673, 0.15763976452913003, 0.1350788918340154, -0.007197182674549128, -0.08494832771911956, 0.007781907781272342, 0.12272304426388521, 0.07140419051753716, 0.06952968622116666, 0.14784272727474831, -0.08684510755221964, -0.14233224984389126, 0.3342574379782666, -0.045520127538526266, -0.23153908949410706, 0.22828874835058263, -0.14996320097462126, -0.1941369367730722, 0.07627622010349705, 0.14689901271802291, 0.1390705472348552, -0.11504132284072081, 0.08948128003414654, -0.10996668777640975, 0.1040962997848462, 0.03321242809557078, 0.05491317380546478, 0.128846443111175, 0.11165488911629246, 0.008852817559320676, 0.13945450309435264, 0.03143411080696081, -0.19362268631199472, -0.35857624563862356, -0.13613335121619075, -0.08884720826570533, 0.12290820374823454, 0.0065397322841658535, -0.1685193918580026, 0.4134857499024324, 0.17275198205402775, 0.1889949987332026, 0.06741966270400505, 0.24806175822098003, 0.08668929148514412, -0.023610725541386688, 0.050680857535713074, 0.1878987906215786, 0.13406715725074736, 0.10369971378199887, -0.14763581436617593, -0.014654465607906642, 0.08360264235453908]
|
1,803.08369
|
Endemicity and prevalence of multipartite viruses under heterogeneous
between-host transmission
|
Multipartite viruses replicate through a puzzling evolutionary strategy.
Their genome is segmented into two or more parts, and encapsidated in separate
particles that appear to propagate independently. Completing the replication
cycle, however, requires the full genome, so that a systemic infection of a
host requires the concurrent presence of several particles. This represents an
apparent evolutionary drawback of multipartitism, while its advantages remain
unclear. A transition from monopartite to multipartite viral forms has been
described in vitro under conditions of high multiplicity of infection,
suggesting that cooperation between defective mutants is a plausible
evolutionary pathway towards multipartitism. However, it is unknown how the
putative advantages that multipartitism might enjoy at the microscopic level
affect its epidemiology, or if an explicit advantange is needed to explain its
ecological persistence. To disentangle which mechanisms might contribute to the
rise and fixation of multipartitism, we investigate the interaction between
viral spreading dynamics and host population structure. We set up a
compartmental model of the spread of a virus in its different forms and explore
its epidemiology using both analytical and numerical techniques. We uncover
that the impact of host contact structure on spreading dynamics entails a rich
phenomenology of ecological relationships that includes cooperation,
competition, and commensality. We find that multipartitism might rise to
fixation even in the absence of explicit microscopic advantages. Multipartitism
allows the virus to colonize environments that could not be invaded by the
monopartite form, facilitated by homogeneous contacts among hosts. We
conjecture that these features might have led to an increase in the diversity
and prevalence of multipartite viral forms concomitantly with the expansion of
agricultural practices.
|
physics.soc-ph q-bio.PE
|
multipartite viruses replicate through a puzzling evolutionary strategy their genome is segmented into two or more parts and encapsidated in separate particles that appear to propagate independently completing the replication cycle however requires the full genome so that a systemic infection of a host requires the concurrent presence of several particles this represents an apparent evolutionary drawback of multipartitism while its advantages remain unclear a transition from monopartite to multipartite viral forms has been described in vitro under conditions of high multiplicity of infection suggesting that cooperation between defective mutants is a plausible evolutionary pathway towards multipartitism however it is unknown how the putative advantages that multipartitism might enjoy at the microscopic level affect its epidemiology or if an explicit advantange is needed to explain its ecological persistence to disentangle which mechanisms might contribute to the rise and fixation of multipartitism we investigate the interaction between viral spreading dynamics and host population structure we set up a compartmental model of the spread of a virus in its different forms and explore its epidemiology using both analytical and numerical techniques we uncover that the impact of host contact structure on spreading dynamics entails a rich phenomenology of ecological relationships that includes cooperation competition and commensality we find that multipartitism might rise to fixation even in the absence of explicit microscopic advantages multipartitism allows the virus to colonize environments that could not be invaded by the monopartite form facilitated by homogeneous contacts among hosts we conjecture that these features might have led to an increase in the diversity and prevalence of multipartite viral forms concomitantly with the expansion of agricultural practices
|
[['multipartite', 'viruses', 'replicate', 'through', 'a', 'puzzling', 'evolutionary', 'strategy', 'their', 'genome', 'is', 'segmented', 'into', 'two', 'or', 'more', 'parts', 'and', 'encapsidated', 'in', 'separate', 'particles', 'that', 'appear', 'to', 'propagate', 'independently', 'completing', 'the', 'replication', 'cycle', 'however', 'requires', 'the', 'full', 'genome', 'so', 'that', 'a', 'systemic', 'infection', 'of', 'a', 'host', 'requires', 'the', 'concurrent', 'presence', 'of', 'several', 'particles', 'this', 'represents', 'an', 'apparent', 'evolutionary', 'drawback', 'of', 'multipartitism', 'while', 'its', 'advantages', 'remain', 'unclear', 'a', 'transition', 'from', 'monopartite', 'to', 'multipartite', 'viral', 'forms', 'has', 'been', 'described', 'in', 'vitro', 'under', 'conditions', 'of', 'high', 'multiplicity', 'of', 'infection', 'suggesting', 'that', 'cooperation', 'between', 'defective', 'mutants', 'is', 'a', 'plausible', 'evolutionary', 'pathway', 'towards', 'multipartitism', 'however', 'it', 'is', 'unknown', 'how', 'the', 'putative', 'advantages', 'that', 'multipartitism', 'might', 'enjoy', 'at', 'the', 'microscopic', 'level', 'affect', 'its', 'epidemiology', 'or', 'if', 'an', 'explicit', 'advantange', 'is', 'needed', 'to', 'explain', 'its', 'ecological', 'persistence', 'to', 'disentangle', 'which', 'mechanisms', 'might', 'contribute', 'to', 'the', 'rise', 'and', 'fixation', 'of', 'multipartitism', 'we', 'investigate', 'the', 'interaction', 'between', 'viral', 'spreading', 'dynamics', 'and', 'host', 'population', 'structure', 'we', 'set', 'up', 'a', 'compartmental', 'model', 'of', 'the', 'spread', 'of', 'a', 'virus', 'in', 'its', 'different', 'forms', 'and', 'explore', 'its', 'epidemiology', 'using', 'both', 'analytical', 'and', 'numerical', 'techniques', 'we', 'uncover', 'that', 'the', 'impact', 'of', 'host', 'contact', 'structure', 'on', 'spreading', 'dynamics', 'entails', 'a', 'rich', 'phenomenology', 'of', 'ecological', 'relationships', 'that', 'includes', 'cooperation', 'competition', 'and', 'commensality', 'we', 'find', 'that', 'multipartitism', 'might', 'rise', 'to', 'fixation', 'even', 'in', 'the', 'absence', 'of', 'explicit', 'microscopic', 'advantages', 'multipartitism', 'allows', 'the', 'virus', 'to', 'colonize', 'environments', 'that', 'could', 'not', 'be', 'invaded', 'by', 'the', 'monopartite', 'form', 'facilitated', 'by', 'homogeneous', 'contacts', 'among', 'hosts', 'we', 'conjecture', 'that', 'these', 'features', 'might', 'have', 'led', 'to', 'an', 'increase', 'in', 'the', 'diversity', 'and', 'prevalence', 'of', 'multipartite', 'viral', 'forms', 'concomitantly', 'with', 'the', 'expansion', 'of', 'agricultural', 'practices']]
|
[-0.11613467848753738, 0.1226617648305242, -0.09989282054698038, 0.09008528722470553, -0.07884450744900073, -0.1560984524575048, 0.08147640627593414, 0.3771726871951859, -0.24828514056071752, -0.27743191578088383, 0.057658147552040226, -0.26018180511549766, -0.22568190551828593, 0.1146456743251713, -0.06604188657515737, -0.05902489300564439, 0.055236575067181604, 0.0012270417194743988, 0.030312050113961823, -0.25397440998766346, 0.2755943280001824, 0.0502013057833468, 0.24761370413088754, 0.06537248760547816, 0.10236353839142943, -0.03486558939191276, -0.014555277433176873, 0.0016106134732323352, -0.13834494924722365, 0.1079217769855411, 0.27912261315691805, 0.2014999682398221, 0.3054091876997857, -0.4505057741415256, -0.23728769050040996, 0.1330902003943781, 0.2007034886941147, 0.15422657324190586, -0.04057503029307283, -0.2500956287266992, 0.05788418981759225, -0.17303228337289905, -0.16158721338325083, -0.04967138428004709, 0.03380350715397343, 0.0038963144012195156, -0.21237147361806372, 0.09555992316419898, 0.03305070327400272, 0.07498102026657938, -0.04353311750407977, -0.08196851669518805, -0.07651925058544565, 0.201168578948631, 0.06760782031507453, -0.03803104654320693, 0.16048125002303842, -0.15272350495754144, -0.11516541469261857, 0.36222031233665436, 0.001628436467874406, -0.149679975403445, 0.25761955831835825, -0.13007366997815334, -0.14886984354712124, 0.16743393522798458, 0.16816946845536412, 0.03858181139899056, -0.16618113887041056, 0.009246210260352567, 0.01302450229483309, 0.15644509717344252, 0.05979189070622756, 0.02954884190933341, 0.23233604654947768, 0.20477751495817037, 0.04777637200947823, 0.09989034680435921, -0.06624482825216872, -0.14880763925611973, -0.19556449271509174, -0.15016266509522197, -0.10892815040724192, 0.0825277590115208, -0.08885390311875946, -0.16597988453577273, 0.39334789005980425, 0.16179748670086821, 0.1698805662123973, 0.05738719999868381, 0.2176354093070545, -0.0009135260787395476, 0.07909200082267218, 0.015756659002960728, 0.19908475193434827, 0.0988111056860036, 0.0650400617490036, -0.25668448844008884, 0.20773519382880715, -0.02767328109176058]
|
1,803.0837
|
Depletion zones and crystallography on pinched spheres
|
Understanding the interplay between ordered structures and substrate
curvature is an interesting problem with versatile applications, including
functionalization of charged supramolecular surfaces and modern microfluidic
technologies. In this work, we investigate the two-dimensional packing
structures of charged particles confined on a pinched sphere. By continuously
pinching the sphere, we observe cleavage of elongated scars into pleats,
proliferation of disclinations, and subsequently, emergence of a depletion zone
at the negatively curved waist that is completely void of particles. We
systematically study the geometrics and energetics of the depletion zone, and
reveal its physical origin as a finite size effect, due to the interplay
between Coulomb repulsion and concave geometry of pinched sphere. These results
further our understanding of crystallography on curved surfaces, and have
implications in design and manipulation of charged, deformable interfaces in
various applications.
|
cond-mat.soft cond-mat.mtrl-sci
|
understanding the interplay between ordered structures and substrate curvature is an interesting problem with versatile applications including functionalization of charged supramolecular surfaces and modern microfluidic technologies in this work we investigate the twodimensional packing structures of charged particles confined on a pinched sphere by continuously pinching the sphere we observe cleavage of elongated scars into pleats proliferation of disclinations and subsequently emergence of a depletion zone at the negatively curved waist that is completely void of particles we systematically study the geometrics and energetics of the depletion zone and reveal its physical origin as a finite size effect due to the interplay between coulomb repulsion and concave geometry of pinched sphere these results further our understanding of crystallography on curved surfaces and have implications in design and manipulation of charged deformable interfaces in various applications
|
[['understanding', 'the', 'interplay', 'between', 'ordered', 'structures', 'and', 'substrate', 'curvature', 'is', 'an', 'interesting', 'problem', 'with', 'versatile', 'applications', 'including', 'functionalization', 'of', 'charged', 'supramolecular', 'surfaces', 'and', 'modern', 'microfluidic', 'technologies', 'in', 'this', 'work', 'we', 'investigate', 'the', 'twodimensional', 'packing', 'structures', 'of', 'charged', 'particles', 'confined', 'on', 'a', 'pinched', 'sphere', 'by', 'continuously', 'pinching', 'the', 'sphere', 'we', 'observe', 'cleavage', 'of', 'elongated', 'scars', 'into', 'pleats', 'proliferation', 'of', 'disclinations', 'and', 'subsequently', 'emergence', 'of', 'a', 'depletion', 'zone', 'at', 'the', 'negatively', 'curved', 'waist', 'that', 'is', 'completely', 'void', 'of', 'particles', 'we', 'systematically', 'study', 'the', 'geometrics', 'and', 'energetics', 'of', 'the', 'depletion', 'zone', 'and', 'reveal', 'its', 'physical', 'origin', 'as', 'a', 'finite', 'size', 'effect', 'due', 'to', 'the', 'interplay', 'between', 'coulomb', 'repulsion', 'and', 'concave', 'geometry', 'of', 'pinched', 'sphere', 'these', 'results', 'further', 'our', 'understanding', 'of', 'crystallography', 'on', 'curved', 'surfaces', 'and', 'have', 'implications', 'in', 'design', 'and', 'manipulation', 'of', 'charged', 'deformable', 'interfaces', 'in', 'various', 'applications']]
|
[-0.12923659050526717, 0.20258028382463467, -0.06414011407953997, 0.02857944481505978, -0.034644774789059606, -0.12341201671364682, 0.0030351553819383736, 0.40522143650386067, -0.262792840215412, -0.2957434719497407, 0.046880816841601496, -0.2752954691993418, -0.20620127651426529, 0.1556761454100962, -0.040331214769846864, -0.002840548285058941, 0.02382440689813208, -0.08431763671924947, -0.04191318159336569, -0.17718919696543944, 0.3290556008461863, 0.04893144420175641, 0.29476881038949443, 0.18645319927276838, 0.04736837450031157, 0.021302917873900797, 0.028624799176705656, 0.0697329538460407, -0.21185173916622901, 0.16409059715957416, 0.170887557182599, -0.0335695359028048, 0.21544868196835051, -0.4927314077262525, -0.23070408256931438, 0.057631624048506774, 0.15645080694618324, 0.07821574896849968, -0.13914256434266767, -0.2852253887819609, 0.0306152171800258, -0.08183460393230672, -0.18577120148542303, -0.03424833452122079, 0.04052798862189606, 0.03273150117515966, -0.1347411831840873, 0.06535162280693098, 0.0838671772449743, 0.05907929633847541, -0.11162815970213463, -0.054869144209833055, -0.06483945240594309, 0.11244885620005705, 0.03733794354937143, -0.020804548328224984, 0.24885245649557974, -0.1456850665116993, -0.11146111669087852, 0.3977291842146466, 0.026284985230476766, -0.20539201972661195, 0.2368936635795291, -0.17140782320251066, -0.07205068415410265, 0.1770370955613476, 0.23506152568109057, 0.1257369599175743, -0.089190570247808, 0.09677499958779663, 0.0011423197076914624, 0.11660792410580648, 0.13141520206850987, 0.021549056723920837, 0.29221868239067217, 0.21215675183468394, 0.06934744830381263, 0.18935064611508062, -0.09670131614052312, -0.11389988221538563, -0.2550340826148857, -0.233106012435423, -0.14466100870459167, 0.0642499812050826, -0.09600139543741804, -0.21750132987206733, 0.3352969952369609, 0.05740633417024381, 0.20423127022157941, -0.037791732029506454, 0.2523623847299152, -0.04018146508131866, 0.06290836785747497, 0.012252043468739699, 0.2198229411340974, 0.17165203434070228, 0.08651732903801733, -0.23775189991316034, 0.01735081522449575, 0.04903788971197274]
|
1,803.08371
|
Angular Momentum Sum Rule Violation in QCD Due to Confinement and The
Proton Spin Crisis
|
The proton spin crisis remains an unsolved problem in physics. In this paper
we find that due to the confinement of partons inside the hadron the angular
momentum sum rule in QCD is violated. Hence we find that the non-vanishing
angular momentum flux contribution of the partons in QCD should be added to the
spin and angular momentum of the partons to solve the proton spin crisis.
|
hep-ph hep-lat nucl-th
|
the proton spin crisis remains an unsolved problem in physics in this paper we find that due to the confinement of partons inside the hadron the angular momentum sum rule in qcd is violated hence we find that the nonvanishing angular momentum flux contribution of the partons in qcd should be added to the spin and angular momentum of the partons to solve the proton spin crisis
|
[['the', 'proton', 'spin', 'crisis', 'remains', 'an', 'unsolved', 'problem', 'in', 'physics', 'in', 'this', 'paper', 'we', 'find', 'that', 'due', 'to', 'the', 'confinement', 'of', 'partons', 'inside', 'the', 'hadron', 'the', 'angular', 'momentum', 'sum', 'rule', 'in', 'qcd', 'is', 'violated', 'hence', 'we', 'find', 'that', 'the', 'nonvanishing', 'angular', 'momentum', 'flux', 'contribution', 'of', 'the', 'partons', 'in', 'qcd', 'should', 'be', 'added', 'to', 'the', 'spin', 'and', 'angular', 'momentum', 'of', 'the', 'partons', 'to', 'solve', 'the', 'proton', 'spin', 'crisis']]
|
[-0.10795316628333348, 0.292788672436649, -0.13330878265924864, 0.13388152825020588, -0.07450665609994486, -0.0026364432171737747, -0.0049364919715157865, 0.33682288109922587, -0.2506478914240403, -0.25664313125020977, -0.010587979101145001, -0.29561346919456527, 0.023656413515112294, 0.07393173028284045, -0.011343086902886185, 0.03593384357753085, 0.07471614461670172, -0.02913121899951305, -0.07333993623311173, -0.196381302960495, 0.352538165733663, 0.08259531909794506, 0.21942330963576018, 0.2286931373276261, 0.16613669503730402, 0.052322600697125514, -0.04268948525301556, -0.023419840066735424, -0.09135410447588448, 0.02309321889952659, 0.26155264658241795, 0.014489914554713377, 0.1635508343243777, -0.4251155992413857, -0.11926977829521161, 0.13109456448913065, 0.1883641859627704, 0.14180639282619553, 0.014097921452971536, -0.15137046422642558, 0.0029336594100763547, -0.2510030359140973, -0.21427839883227848, -0.11805493148988974, 0.009622807652731217, -0.08154765820936925, -0.2490334942964698, 0.13024680693147342, 0.06690996432148699, -0.06326007413497167, -0.037467046950095846, -0.16007718151963468, -0.06446994045999513, 0.023252132946430748, 0.19416848106879686, 0.13335326855390597, 0.13214058725079939, -0.24369370166921236, -0.15254148068045503, 0.3970437844964995, 0.059842780913546015, -0.2122707032223246, 0.06357224187605194, -0.24920563278858787, -0.12327306278383554, 0.1398702951342757, 0.18626226128926918, 0.08115896683380898, -0.18330401333688356, 0.05130016376914234, -0.04995415744774822, 0.15798826418372233, 0.09601463150900247, 0.07591485183463613, 0.31156683907802424, 0.14705311869090396, 0.04596370775183079, 0.1112569419844354, -0.13338316181577298, -0.14510680429303824, -0.306923457240658, -0.1203010347185295, -0.22560881114384132, 0.11794931308276006, -0.05524197314607862, -0.0970275657279278, 0.3698974211714161, 0.16724315372559784, 0.21478073635319275, -0.032713971003445225, 0.33670938988007715, 0.11589871512277664, 0.07173330189899972, 0.13773459167595006, 0.3126461480904037, 0.16999171168279292, 0.20979620883269096, -0.3578510854685151, -0.014775805071051886, 0.05197572079834653]
|
1,803.08372
|
Nonlocal hydrodynamic phonon transport in two-dimensional materials
|
We study hydrodynamic phonon heat transport in two-dimensional (2D)
materials. Starting from the Peierls-Boltzmann equation within the Callaway
model, we derive a 2D Guyer-Krumhansl-like equation describing non-local
hydrodynamic phonon transport, taking into account the quadratic dispersion of
flexural phonons. In additional to Poiseuille flow, second sound propagation,
the equation predicts heat current vortices and negative nonlocal thermal
conductance in 2D materials, common in classical fluid but scarcely considered
in phonon transport. Our results also illustrate the universal transport
behavior of hydrodynamics, independent on the type of quasi-particles and their
microscopic interactions.
|
cond-mat.mes-hall cond-mat.stat-mech
|
we study hydrodynamic phonon heat transport in twodimensional 2d materials starting from the peierlsboltzmann equation within the callaway model we derive a 2d guyerkrumhansllike equation describing nonlocal hydrodynamic phonon transport taking into account the quadratic dispersion of flexural phonons in additional to poiseuille flow second sound propagation the equation predicts heat current vortices and negative nonlocal thermal conductance in 2d materials common in classical fluid but scarcely considered in phonon transport our results also illustrate the universal transport behavior of hydrodynamics independent on the type of quasiparticles and their microscopic interactions
|
[['we', 'study', 'hydrodynamic', 'phonon', 'heat', 'transport', 'in', 'twodimensional', '2d', 'materials', 'starting', 'from', 'the', 'peierlsboltzmann', 'equation', 'within', 'the', 'callaway', 'model', 'we', 'derive', 'a', '2d', 'guyerkrumhansllike', 'equation', 'describing', 'nonlocal', 'hydrodynamic', 'phonon', 'transport', 'taking', 'into', 'account', 'the', 'quadratic', 'dispersion', 'of', 'flexural', 'phonons', 'in', 'additional', 'to', 'poiseuille', 'flow', 'second', 'sound', 'propagation', 'the', 'equation', 'predicts', 'heat', 'current', 'vortices', 'and', 'negative', 'nonlocal', 'thermal', 'conductance', 'in', '2d', 'materials', 'common', 'in', 'classical', 'fluid', 'but', 'scarcely', 'considered', 'in', 'phonon', 'transport', 'our', 'results', 'also', 'illustrate', 'the', 'universal', 'transport', 'behavior', 'of', 'hydrodynamics', 'independent', 'on', 'the', 'type', 'of', 'quasiparticles', 'and', 'their', 'microscopic', 'interactions']]
|
[-0.15157564651065816, 0.1605835223518726, -0.09777621533010258, 0.026064440752896996, -0.0910810579235355, -0.1573013748611427, 0.0015083974641230372, 0.29531728545617725, -0.33434740619268266, -0.20830044478384985, -0.038805206880594294, -0.34856717828661204, -0.13550080323798788, 0.2001998813615905, 0.051866947546497816, 0.0912983048086365, 0.017152950474620513, -0.057574618043791916, -0.021688095174936785, -0.14929601364872522, 0.2663111386225662, 0.0036386750017603237, 0.33689414492497843, 0.07746030475116439, 0.09107154586559368, 0.018027515781836378, 0.00824284561806255, 0.05936668125084705, -0.23672365768353404, 0.04074138440450446, 0.2079525389760319, -0.1678332138568092, 0.19243187941610812, -0.530656276933021, -0.3480666623554296, -0.032875167180059686, 0.1704320369598766, 0.20905390351803765, -0.04222290393922271, -0.2305607673091193, -0.03982992607763865, -0.1285625730951627, -0.1112658190411619, -0.07261923122116261, -0.015295788578482138, 0.02701708923559636, -0.17364729756696357, 0.22674146284989546, 0.08128904199952053, 0.041492495756635134, -0.14138708263894337, -0.11485691224742267, -0.08945721202374747, 0.06515431185770366, 0.03498825582339325, -0.08402397705811179, 0.15274746225267236, -0.19070711862037165, -0.05800064206123352, 0.44019035014013447, -0.09342288683272071, -0.21599083097858562, 0.17704113961921797, -0.15544273408433784, -0.015608406993043092, 0.14015281745491343, 0.20223285927075066, 0.06290936661987669, -0.2279250187592374, 0.0331489909789525, -0.05438002094419466, 0.08832308244115362, 0.018475366727862923, 0.030464341222412056, 0.21777467732317746, 0.19910538029766434, -0.04258688597732948, 0.1278933634528787, -0.05451040648493088, -0.1188504327295555, -0.3147150946354183, -0.18976809068570016, -0.19675959268481366, 0.11032209881038095, -0.10226825772131432, -0.21174550087501606, 0.41401488408446313, 0.18418755673725778, 0.09750488169439551, 0.0002733339245120684, 0.25245942547917366, 0.17875864415351922, 0.02090785349977927, 0.11888273414741787, 0.2672955201007426, 0.20495692852677572, 0.16019318625848328, -0.3542397176979446, -0.01350892547569755, 0.10458155255764723]
|
1,803.08373
|
Differential calculus on Jordan algebra and Jordan modules
|
Having in mind applications to particle physics we develop the differential
calculus over Jordan algebras and the theory of connections on Jordan modules.
In particular we focus on differential calculus over the exceptional Jordan
algebra and provide a complete characterization of the theory of connections
for free Jordan modules.
|
math.QA hep-th math-ph math.MP math.RA
|
having in mind applications to particle physics we develop the differential calculus over jordan algebras and the theory of connections on jordan modules in particular we focus on differential calculus over the exceptional jordan algebra and provide a complete characterization of the theory of connections for free jordan modules
|
[['having', 'in', 'mind', 'applications', 'to', 'particle', 'physics', 'we', 'develop', 'the', 'differential', 'calculus', 'over', 'jordan', 'algebras', 'and', 'the', 'theory', 'of', 'connections', 'on', 'jordan', 'modules', 'in', 'particular', 'we', 'focus', 'on', 'differential', 'calculus', 'over', 'the', 'exceptional', 'jordan', 'algebra', 'and', 'provide', 'a', 'complete', 'characterization', 'of', 'the', 'theory', 'of', 'connections', 'for', 'free', 'jordan', 'modules']]
|
[-0.1419850930533543, -0.019484823531642253, -0.09114326978558485, 0.03761999426903773, -0.12809302895424926, -0.16502201366143263, -0.030514055031484792, 0.3205660179409446, -0.3247631588304529, -0.21487608751548187, 0.09944537597024167, -0.23678732275658723, -0.2049295224287376, 0.21270419420835998, -0.17195813123098747, -0.03683316560310065, 0.0651657163564648, 0.1696058956066346, -0.1421173207689913, -0.25405778614233954, 0.3934952744605894, 0.0011224154601519813, 0.19864787328608183, 0.032049527182421954, 0.1475160828962618, 0.09930377117149075, -0.08980588785524728, -0.010802174253123147, -0.2086696632168427, 0.18343757210793543, 0.3239448675695731, 0.10964872823001778, 0.23896879839653873, -0.47333247275376805, -0.11143197845287468, 0.1327200063067127, 0.12371726117419954, 0.019583591507101546, -0.05864532229642631, -0.22689601634534037, 0.04556329146369684, -0.19707336892582933, -0.09642675625188846, -0.05021721676790288, 0.08431322802314345, -0.014653443339831975, -0.1656790574898525, 0.003544331414206904, 0.08091185861552248, 0.1789752328198175, -0.13499764425261895, -0.03682960942387581, -0.008226380588448778, 0.05647959810092437, -0.11709845510824603, -0.0700967521501743, 0.11394378293913845, -0.07648527705851867, -0.20591052652013545, 0.3148086378921051, -0.028652359874044755, -0.2542545843717395, 0.159550472067631, -0.17706578291420424, -0.17024290179643703, 0.03269127205166281, 0.13996903438653266, 0.10456721311701196, -0.09552125446498394, 0.27707311679960744, -0.04929275936161985, -0.009561015331015294, 0.14351720243160213, 0.04201662127517772, 0.17856490908532727, 0.15595080752438883, 0.0073050116663988755, 0.06327877543410476, 0.06984260320492393, -0.14243911588754582, -0.40851609773781833, -0.23472725625663082, -0.02850436240586699, 0.0671145221484559, -0.1136865471293722, -0.21986526205223433, 0.4949509662633039, 0.10054337115464163, 0.13469865541829137, 0.11944695797805883, 0.176681484152772, 0.06278709196770678, 0.13994583491312, -0.023794717896653682, 0.18980620672204057, 0.3435024997476032, 0.10116928176745316, -0.08607911202600416, -0.09316353787839109, 0.15528279945862536]
|
1,803.08374
|
Learning through deterministic assignment of hidden parameters
|
Supervised learning frequently boils down to determining hidden and bright
parameters in a parameterized hypothesis space based on finite input-output
samples. The hidden parameters determine the attributions of hidden predictors
or the nonlinear mechanism of an estimator, while the bright parameters
characterize how hidden predictors are linearly combined or the linear
mechanism. In traditional learning paradigm, hidden and bright parameters are
not distinguished and trained simultaneously in one learning process. Such an
one-stage learning (OSL) brings a benefit of theoretical analysis but suffers
from the high computational burden. To overcome this difficulty, a two-stage
learning (TSL) scheme, featured by learning through deterministic assignment of
hidden parameters (LtDaHP) was proposed, which suggests to deterministically
generate the hidden parameters by using minimal Riesz energy points on a sphere
and equally spaced points in an interval. We theoretically show that with such
deterministic assignment of hidden parameters, LtDaHP with a neural network
realization almost shares the same generalization performance with that of OSL.
We also present a series of simulations and application examples to support the
outperformance of LtDaHP
|
cs.LG stat.ML
|
supervised learning frequently boils down to determining hidden and bright parameters in a parameterized hypothesis space based on finite inputoutput samples the hidden parameters determine the attributions of hidden predictors or the nonlinear mechanism of an estimator while the bright parameters characterize how hidden predictors are linearly combined or the linear mechanism in traditional learning paradigm hidden and bright parameters are not distinguished and trained simultaneously in one learning process such an onestage learning osl brings a benefit of theoretical analysis but suffers from the high computational burden to overcome this difficulty a twostage learning tsl scheme featured by learning through deterministic assignment of hidden parameters ltdahp was proposed which suggests to deterministically generate the hidden parameters by using minimal riesz energy points on a sphere and equally spaced points in an interval we theoretically show that with such deterministic assignment of hidden parameters ltdahp with a neural network realization almost shares the same generalization performance with that of osl we also present a series of simulations and application examples to support the outperformance of ltdahp
|
[['supervised', 'learning', 'frequently', 'boils', 'down', 'to', 'determining', 'hidden', 'and', 'bright', 'parameters', 'in', 'a', 'parameterized', 'hypothesis', 'space', 'based', 'on', 'finite', 'inputoutput', 'samples', 'the', 'hidden', 'parameters', 'determine', 'the', 'attributions', 'of', 'hidden', 'predictors', 'or', 'the', 'nonlinear', 'mechanism', 'of', 'an', 'estimator', 'while', 'the', 'bright', 'parameters', 'characterize', 'how', 'hidden', 'predictors', 'are', 'linearly', 'combined', 'or', 'the', 'linear', 'mechanism', 'in', 'traditional', 'learning', 'paradigm', 'hidden', 'and', 'bright', 'parameters', 'are', 'not', 'distinguished', 'and', 'trained', 'simultaneously', 'in', 'one', 'learning', 'process', 'such', 'an', 'onestage', 'learning', 'osl', 'brings', 'a', 'benefit', 'of', 'theoretical', 'analysis', 'but', 'suffers', 'from', 'the', 'high', 'computational', 'burden', 'to', 'overcome', 'this', 'difficulty', 'a', 'twostage', 'learning', 'tsl', 'scheme', 'featured', 'by', 'learning', 'through', 'deterministic', 'assignment', 'of', 'hidden', 'parameters', 'ltdahp', 'was', 'proposed', 'which', 'suggests', 'to', 'deterministically', 'generate', 'the', 'hidden', 'parameters', 'by', 'using', 'minimal', 'riesz', 'energy', 'points', 'on', 'a', 'sphere', 'and', 'equally', 'spaced', 'points', 'in', 'an', 'interval', 'we', 'theoretically', 'show', 'that', 'with', 'such', 'deterministic', 'assignment', 'of', 'hidden', 'parameters', 'ltdahp', 'with', 'a', 'neural', 'network', 'realization', 'almost', 'shares', 'the', 'same', 'generalization', 'performance', 'with', 'that', 'of', 'osl', 'we', 'also', 'present', 'a', 'series', 'of', 'simulations', 'and', 'application', 'examples', 'to', 'support', 'the', 'outperformance', 'of', 'ltdahp']]
|
[-0.04235420680726582, 0.08244410823507761, -0.064993386519332, 0.06694512831453184, -0.12867409804444338, -0.19316439492269472, 0.10533719592521348, 0.39101455132318236, -0.3131783703574911, -0.3283996905903967, 0.08505384879787346, -0.26184505274762737, -0.15495464880355445, 0.17504752314363775, -0.093514892852082, 0.08794991114832969, 0.05236628966153231, 0.030263425012394277, -0.049670008397449485, -0.2669107785702429, 0.2807361560209591, 0.0461403607041575, 0.3075129102957858, -0.055421927507268265, 0.1587834274925461, -0.0005639608201487466, -0.018079385203732687, -0.028707012085181883, -0.06178816745564704, 0.12134501511437437, 0.28591798480192665, 0.1430123508458068, 0.32904881053466606, -0.39997756144359964, -0.2419253887249149, 0.12365431321615522, 0.1311928259991956, 0.07471602010760266, -0.042643940934794955, -0.26643223184907006, 0.07823601420915854, -0.11410556647487366, -0.08082584199754902, -0.1137067633416419, -0.05931266056756034, 0.001650086590168278, -0.3058137235903731, 0.02909982964427565, 0.07028776111705652, 0.051156434410834416, -0.03881027707062789, -0.09504736886380917, -0.023980336464856835, 0.08977359437333442, 0.05847331491515268, -0.0005204069668913937, 0.122736796384164, -0.1459044657302994, -0.1661655867620456, 0.31291992106178607, -0.06729438942288239, -0.19759860022565012, 0.18509994274328082, -0.021041478166642428, -0.1540933149583659, 0.12953499165252486, 0.19188911270678297, 0.09900602344020047, -0.14754060616393294, 0.0457235824337245, -0.058430565309456804, 0.22033047992127566, 0.018986345660364765, 0.02008722071662884, 0.1786952587803667, 0.21018761967736116, 0.020745251288066025, 0.14937315953879574, -0.09403944758973508, -0.11016695379459468, -0.261531974543521, -0.08860666661712457, -0.21079369295991704, 0.0009483271934103951, -0.09727685008982173, -0.17059818449805872, 0.39286883625364183, 0.15238044050056487, 0.24609529002125122, 0.07126978346720782, 0.2954610532549189, 0.09257376069118353, 0.08343049406539649, 0.10936661777933213, 0.2132447516804942, 0.08284391101121648, 0.042027948729810305, -0.20175946925552457, 0.09286647819350367, 0.02193983855249826]
|
1,803.08375
|
Deep Learning using Rectified Linear Units (ReLU)
|
We introduce the use of rectified linear units (ReLU) as the classification
function in a deep neural network (DNN). Conventionally, ReLU is used as an
activation function in DNNs, with Softmax function as their classification
function. However, there have been several studies on using a classification
function other than Softmax, and this study is an addition to those. We
accomplish this by taking the activation of the penultimate layer $h_{n - 1}$
in a neural network, then multiply it by weight parameters $\theta$ to get the
raw scores $o_{i}$. Afterwards, we threshold the raw scores $o_{i}$ by $0$,
i.e. $f(o) = \max(0, o_{i})$, where $f(o)$ is the ReLU function. We provide
class predictions $\hat{y}$ through argmax function, i.e. argmax $f(x)$.
|
cs.NE cs.CV cs.LG stat.ML
|
we introduce the use of rectified linear units relu as the classification function in a deep neural network dnn conventionally relu is used as an activation function in dnns with softmax function as their classification function however there have been several studies on using a classification function other than softmax and this study is an addition to those we accomplish this by taking the activation of the penultimate layer h_n 1 in a neural network then multiply it by weight parameters theta to get the raw scores o_i afterwards we threshold the raw scores o_i by 0 ie fo max0 o_i where fo is the relu function we provide class predictions haty through argmax function ie argmax fx
|
[['we', 'introduce', 'the', 'use', 'of', 'rectified', 'linear', 'units', 'relu', 'as', 'the', 'classification', 'function', 'in', 'a', 'deep', 'neural', 'network', 'dnn', 'conventionally', 'relu', 'is', 'used', 'as', 'an', 'activation', 'function', 'in', 'dnns', 'with', 'softmax', 'function', 'as', 'their', 'classification', 'function', 'however', 'there', 'have', 'been', 'several', 'studies', 'on', 'using', 'a', 'classification', 'function', 'other', 'than', 'softmax', 'and', 'this', 'study', 'is', 'an', 'addition', 'to', 'those', 'we', 'accomplish', 'this', 'by', 'taking', 'the', 'activation', 'of', 'the', 'penultimate', 'layer', 'h_n', '1', 'in', 'a', 'neural', 'network', 'then', 'multiply', 'it', 'by', 'weight', 'parameters', 'theta', 'to', 'get', 'the', 'raw', 'scores', 'o_i', 'afterwards', 'we', 'threshold', 'the', 'raw', 'scores', 'o_i', 'by', '0', 'ie', 'fo', 'max0', 'o_i', 'where', 'fo', 'is', 'the', 'relu', 'function', 'we', 'provide', 'class', 'predictions', 'haty', 'through', 'argmax', 'function', 'ie', 'argmax', 'fx']]
|
[-0.040023749741583556, 0.015840807829251496, -0.026244109346515547, 0.05667378393226793, -0.06788524403236806, -0.18590553631311504, 0.040417279582470655, 0.4594934701098729, -0.3464497360953335, -0.24679696443885313, 0.05653187181007401, -0.29575701517258157, -0.2396950776159953, 0.15535884149869808, -0.0757565400780226, 0.139067062176764, 0.038871429422554574, 0.07925068827615302, -0.08989677322097123, -0.2814767803203599, 0.314513975975372, 0.019878325944172485, 0.23872775503165894, -0.03220383823312566, 0.11769887341691529, 0.0004040091219594923, 0.05221911266414543, -0.05294942017841958, -0.10553455612843193, 0.1049558267103887, 0.2705359910595057, 0.15917856969783808, 0.37065242391900494, -0.3949658075600105, -0.21102457199940236, 0.14801429311539663, 0.12413330191462221, 0.008087338293681584, 0.05105490332875811, -0.23337961187570402, 0.11184738935523872, -0.17785613695001704, 0.04746466659806606, -0.0961720453875171, 0.0014721707626387981, 0.05897003085593203, -0.3172670639972439, 0.04912534502524314, 0.07931478881529706, 0.05604461676606877, -0.03611991105017142, -0.1879326079309113, -0.030956564044927137, 0.12334647765619901, -0.00033714959172973945, 0.16888494528159184, 0.13507696384390405, -0.21711685903512445, -0.08180065009095785, 0.25750448734704723, -0.0987991632947203, -0.2677253337371779, 0.09381602598764634, -0.0657257951630311, -0.12238022075547694, 0.049749282425490475, 0.19022509054343958, 0.11110943755513783, -0.13725389543747119, 0.012663783974673251, -0.0600316024432748, 0.1744055468608799, 0.07780719664484514, -0.020267866279582603, 0.13042674753499234, 0.2119930510417069, 0.02462819015204717, 0.2010647262909284, -0.12133591519313533, -0.0055160437665200965, -0.25788992943273764, -0.12321940878153605, -0.20790023758210305, 0.045582167792648974, -0.09454816074287657, -0.16139631373492086, 0.4115890258197057, 0.10432910113753277, 0.30411707252358733, 0.19040922822935855, 0.2896841329411935, 0.18337676738402647, 0.18017384756782676, 0.05204693485698584, 0.20513284127662054, 0.07104374377167452, 0.08191650547580477, -0.09157867944736223, 0.11450062121458991, 0.10487640867309676]
|
1,803.08376
|
The Propagation of Cosmic Rays from the Galactic Wind Termination Shock:
Back to the Galaxy?
|
Although several theories for the origin of cosmic rays in the region between
the spectral `knee' and `ankle' exist, this problem is still unsolved. A
variety of observations suggest that the transition from Galactic to
extragalactic sources occurs in this energy range. In this work we examine
whether a Galactic wind which eventually forms a termination shock far outside
the Galactic plane can contribute as a possible source to the observed flux in
the region of interest. Previous work by Bustard et al. (2017) estimated that
particles can be accelerated up to energies above the `knee' up to
$R_\mathrm{max} = 10^{16}$ eV for parameters drawn from a model of a Milky Way
wind (Everett et al. 2017). A remaining question is whether the accelerated
cosmic rays can propagate back into the Galaxy. To answer this crucial
question, we simulate the propagation of the cosmic rays using the low energy
extension of the CRPropa framework, based on the solution of the transport
equation via stochastic differential equations. The setup includes all relevant
processes, including three-dimensional anisotropic spatial diffusion,
advection, and corresponding adiabatic cooling. We find that, assuming
realistic parameters for the shock evolution, a possible Galactic termination
shock can contribute significantly to the energy budget in the `knee' region
and above. We estimate the resulting produced neutrino fluxes and find them to
be below measurements from IceCube and limits by KM3NeT.
|
astro-ph.HE
|
although several theories for the origin of cosmic rays in the region between the spectral knee and ankle exist this problem is still unsolved a variety of observations suggest that the transition from galactic to extragalactic sources occurs in this energy range in this work we examine whether a galactic wind which eventually forms a termination shock far outside the galactic plane can contribute as a possible source to the observed flux in the region of interest previous work by bustard et al 2017 estimated that particles can be accelerated up to energies above the knee up to r_mathrmmax 1016 ev for parameters drawn from a model of a milky way wind everett et al 2017 a remaining question is whether the accelerated cosmic rays can propagate back into the galaxy to answer this crucial question we simulate the propagation of the cosmic rays using the low energy extension of the crpropa framework based on the solution of the transport equation via stochastic differential equations the setup includes all relevant processes including threedimensional anisotropic spatial diffusion advection and corresponding adiabatic cooling we find that assuming realistic parameters for the shock evolution a possible galactic termination shock can contribute significantly to the energy budget in the knee region and above we estimate the resulting produced neutrino fluxes and find them to be below measurements from icecube and limits by km3net
|
[['although', 'several', 'theories', 'for', 'the', 'origin', 'of', 'cosmic', 'rays', 'in', 'the', 'region', 'between', 'the', 'spectral', 'knee', 'and', 'ankle', 'exist', 'this', 'problem', 'is', 'still', 'unsolved', 'a', 'variety', 'of', 'observations', 'suggest', 'that', 'the', 'transition', 'from', 'galactic', 'to', 'extragalactic', 'sources', 'occurs', 'in', 'this', 'energy', 'range', 'in', 'this', 'work', 'we', 'examine', 'whether', 'a', 'galactic', 'wind', 'which', 'eventually', 'forms', 'a', 'termination', 'shock', 'far', 'outside', 'the', 'galactic', 'plane', 'can', 'contribute', 'as', 'a', 'possible', 'source', 'to', 'the', 'observed', 'flux', 'in', 'the', 'region', 'of', 'interest', 'previous', 'work', 'by', 'bustard', 'et', 'al', '2017', 'estimated', 'that', 'particles', 'can', 'be', 'accelerated', 'up', 'to', 'energies', 'above', 'the', 'knee', 'up', 'to', 'r_mathrmmax', '1016', 'ev', 'for', 'parameters', 'drawn', 'from', 'a', 'model', 'of', 'a', 'milky', 'way', 'wind', 'everett', 'et', 'al', '2017', 'a', 'remaining', 'question', 'is', 'whether', 'the', 'accelerated', 'cosmic', 'rays', 'can', 'propagate', 'back', 'into', 'the', 'galaxy', 'to', 'answer', 'this', 'crucial', 'question', 'we', 'simulate', 'the', 'propagation', 'of', 'the', 'cosmic', 'rays', 'using', 'the', 'low', 'energy', 'extension', 'of', 'the', 'crpropa', 'framework', 'based', 'on', 'the', 'solution', 'of', 'the', 'transport', 'equation', 'via', 'stochastic', 'differential', 'equations', 'the', 'setup', 'includes', 'all', 'relevant', 'processes', 'including', 'threedimensional', 'anisotropic', 'spatial', 'diffusion', 'advection', 'and', 'corresponding', 'adiabatic', 'cooling', 'we', 'find', 'that', 'assuming', 'realistic', 'parameters', 'for', 'the', 'shock', 'evolution', 'a', 'possible', 'galactic', 'termination', 'shock', 'can', 'contribute', 'significantly', 'to', 'the', 'energy', 'budget', 'in', 'the', 'knee', 'region', 'and', 'above', 'we', 'estimate', 'the', 'resulting', 'produced', 'neutrino', 'fluxes', 'and', 'find', 'them', 'to', 'be', 'below', 'measurements', 'from', 'icecube', 'and', 'limits', 'by', 'km3net']]
|
[-0.053059781911750245, 0.1534764083187104, -0.03395064010819943, 0.11496964573100406, -0.08922473143626887, -0.029534494706527574, 0.053475914286090095, 0.3601827203671922, -0.28475491957240656, -0.3766900801652299, 0.01798127282343462, -0.2760672247355902, -0.04811278232572429, 0.22782844215684586, -0.008651066545306157, -0.012699712656812105, 0.03844411667791734, -0.042191044264064545, -0.01685061525980321, -0.2100661693783191, 0.2830838423667541, 0.1665853124740942, 0.21674021239506833, 0.059634037283167504, 0.1123503202474431, -0.09196208938323125, -0.010272107922406704, -0.01778667459566669, -0.14204543288191449, 0.06686886562429688, 0.23405045795605697, 0.13975623469103307, 0.20237770462572052, -0.4163419716346094, -0.29929301341211323, 0.11212567584446158, 0.18611652715212826, 0.07459521051478396, -0.06637061981324989, -0.254794703682133, 0.05207798585858351, -0.15006708099890761, -0.17139584973062338, 0.048857617486072216, -0.021802710040103927, 0.02125777549321228, -0.21956784182903152, 0.11243336917035968, 0.06253579251693864, -0.007606362115199629, -0.10348731665586106, -0.0719459985154109, -0.008049662504753653, 0.08547867542508532, 0.07386410494377103, 0.06629561264018871, 0.15735005592547455, -0.1228943608012949, -0.08146303339877672, 0.4043403996947107, -0.052017037653601154, -0.08614591799529367, 0.17307799549368946, -0.16768255656758188, -0.1407275130878317, 0.16953294709929378, 0.1876949471372523, 0.10186199496679924, -0.1855491993074681, 0.09915614254931458, -0.021161618228928234, 0.13590197273138951, 0.07392996150220074, -0.04383196918646909, 0.25957797802045224, 0.1297828701565761, 0.0719048233392338, 0.07975911677778258, -0.1474674660795452, -0.05558640842852918, -0.3103798063586286, -0.10782576730605542, -0.11924024082806059, 0.08330155310901127, -0.06392621136393772, -0.11993328197180138, 0.39351202958271625, 0.19179515198655345, 0.2177773186132279, -0.01628737214170478, 0.2804071210251239, 0.08953440145859004, 0.0028081888714886942, 0.15191936201268905, 0.32857577509109925, 0.11386953934050868, 0.11066950916663923, -0.2045673190066162, 0.06590393242189302, 0.04408801412373258]
|
1,803.08377
|
On LDPC Code Based Massive Random-Access Scheme for the Gaussian
Multiple Access Channel
|
This paper deals with the problem of massive random access for Gaussian
multiple access channel (MAC). We continue to investigate the coding scheme for
Gaussian MAC proposed by A. Vem et al in 2017. The proposed scheme consists of
four parts: (i) the data transmission is partitioned into time slots; (ii) the
data, transmitted in each slot, is split into two parts, the first one set an
interleaver of the low-density parity-check (LDPC) type code and is encoded by
spreading sequence or codewords that are designed to be decoded by compressed
sensing type decoding; (iii) the another part of transmitted data is encoded by
LDPC type code and decoded using a joint message passing decoding algorithm
designed for the T-user binary input Gaussian MAC; (iv) users repeat their
codeword in multiple slots. In this paper we are concentrated on the third part
of considered scheme. We generalized the PEXIT charts to optimize the
protograph of LDPC code for Gaussian MAC. The simulation results, obtained at
the end of the paper, were analyzed and compared with obtained theoretical
bounds and thresholds. Obtained simulation results shows that proposed LDPC
code constructions have better performance under joint decoding algorithm over
Gaussian MAC than LDPC codes considered by A. Vem et al in 2017, that leads to
the better performance of overall transmission system.
|
cs.IT math.IT
|
this paper deals with the problem of massive random access for gaussian multiple access channel mac we continue to investigate the coding scheme for gaussian mac proposed by a vem et al in 2017 the proposed scheme consists of four parts i the data transmission is partitioned into time slots ii the data transmitted in each slot is split into two parts the first one set an interleaver of the lowdensity paritycheck ldpc type code and is encoded by spreading sequence or codewords that are designed to be decoded by compressed sensing type decoding iii the another part of transmitted data is encoded by ldpc type code and decoded using a joint message passing decoding algorithm designed for the tuser binary input gaussian mac iv users repeat their codeword in multiple slots in this paper we are concentrated on the third part of considered scheme we generalized the pexit charts to optimize the protograph of ldpc code for gaussian mac the simulation results obtained at the end of the paper were analyzed and compared with obtained theoretical bounds and thresholds obtained simulation results shows that proposed ldpc code constructions have better performance under joint decoding algorithm over gaussian mac than ldpc codes considered by a vem et al in 2017 that leads to the better performance of overall transmission system
|
[['this', 'paper', 'deals', 'with', 'the', 'problem', 'of', 'massive', 'random', 'access', 'for', 'gaussian', 'multiple', 'access', 'channel', 'mac', 'we', 'continue', 'to', 'investigate', 'the', 'coding', 'scheme', 'for', 'gaussian', 'mac', 'proposed', 'by', 'a', 'vem', 'et', 'al', 'in', '2017', 'the', 'proposed', 'scheme', 'consists', 'of', 'four', 'parts', 'i', 'the', 'data', 'transmission', 'is', 'partitioned', 'into', 'time', 'slots', 'ii', 'the', 'data', 'transmitted', 'in', 'each', 'slot', 'is', 'split', 'into', 'two', 'parts', 'the', 'first', 'one', 'set', 'an', 'interleaver', 'of', 'the', 'lowdensity', 'paritycheck', 'ldpc', 'type', 'code', 'and', 'is', 'encoded', 'by', 'spreading', 'sequence', 'or', 'codewords', 'that', 'are', 'designed', 'to', 'be', 'decoded', 'by', 'compressed', 'sensing', 'type', 'decoding', 'iii', 'the', 'another', 'part', 'of', 'transmitted', 'data', 'is', 'encoded', 'by', 'ldpc', 'type', 'code', 'and', 'decoded', 'using', 'a', 'joint', 'message', 'passing', 'decoding', 'algorithm', 'designed', 'for', 'the', 'tuser', 'binary', 'input', 'gaussian', 'mac', 'iv', 'users', 'repeat', 'their', 'codeword', 'in', 'multiple', 'slots', 'in', 'this', 'paper', 'we', 'are', 'concentrated', 'on', 'the', 'third', 'part', 'of', 'considered', 'scheme', 'we', 'generalized', 'the', 'pexit', 'charts', 'to', 'optimize', 'the', 'protograph', 'of', 'ldpc', 'code', 'for', 'gaussian', 'mac', 'the', 'simulation', 'results', 'obtained', 'at', 'the', 'end', 'of', 'the', 'paper', 'were', 'analyzed', 'and', 'compared', 'with', 'obtained', 'theoretical', 'bounds', 'and', 'thresholds', 'obtained', 'simulation', 'results', 'shows', 'that', 'proposed', 'ldpc', 'code', 'constructions', 'have', 'better', 'performance', 'under', 'joint', 'decoding', 'algorithm', 'over', 'gaussian', 'mac', 'than', 'ldpc', 'codes', 'considered', 'by', 'a', 'vem', 'et', 'al', 'in', '2017', 'that', 'leads', 'to', 'the', 'better', 'performance', 'of', 'overall', 'transmission', 'system']]
|
[-0.18449232286505707, 0.017729347049257056, -0.06744513336088526, 0.012472002168470935, -0.001527420221721609, -0.2669408244642187, 0.07718119131067351, 0.4051060932752204, -0.2713190340798467, -0.26253454150742594, 0.08258873980585911, -0.22290642446408807, -0.148662812048867, 0.16181554051741243, -0.12810093313710738, 0.10693982815780341, 0.07809223067738354, 0.022105495465630197, -0.07107249063813897, -0.3722470395833671, 0.30381479731986305, 0.16683757097458204, 0.3083231089356011, -0.0619219619874868, 0.06350370318220597, 0.03886221150642252, -0.09220857458342224, -0.07449271367463074, -0.10958946822686243, 0.0739592730432332, 0.2878403499473703, 0.20697947508829845, 0.24375772154698633, -0.4014621096616398, -0.2623092875216309, 0.024395015534039024, 0.18621788160305588, 0.11766352135378157, -0.04420958343546701, -0.281797649844371, 0.16322840276688813, -0.20255498162557936, 0.006700245650765831, 0.06131290037984445, -0.09363569324563968, 0.031886708754440135, -0.3307757260890244, -0.016132117453197092, 0.03924851083583687, 0.013315756081765067, -0.04380700216717916, -0.1453564181837751, 0.06008188081926509, 0.12244283141393945, -0.050524863804643765, 0.011747629606573242, 0.05800136628445901, -0.008194388328949372, -0.13801898643136296, 0.3348539665375398, -0.029749825218658932, -0.20338180681614026, 0.1124443500347916, -0.027795799716575642, -0.09015127615025055, 0.19402742916590546, 0.2526281294434174, 0.07054965863148915, -0.1374146159861628, 0.03611520793383035, -0.04216460243173658, 0.19721619894257086, 0.12409147911930465, 0.07121417315710829, 0.1329767832566546, 0.1239951527868844, 0.018448128094407625, 0.1811308054828625, -0.11877179761485251, -0.10012141622966537, -0.2538531719155176, -0.10702122606060119, -0.23034469527192414, -0.06592582612719437, -0.09226344258723287, -0.11991702997365958, 0.40636136360134845, 0.1197266146693736, 0.13606147599921106, 0.12304809840489604, 0.35596690485551613, 0.052204944847800694, 0.059549088161396174, 0.20513671013360765, 0.13943433298486962, 0.14346435345011896, 0.08215586869971035, -0.1894915843080542, 0.08099508950843999, 0.07800849658300459]
|
1,803.08378
|
A trust-based recommendation method using network diffusion processes
|
A variety of rating-based recommendation methods have been extensively
studied including the well-known collaborative filtering approaches and some
network diffusion-based methods, however, social trust relations are not
sufficiently considered when making recommendations. In this paper, we
contribute to the literature by proposing a trust-based recommendation method,
named CosRA+T, after integrating the information of trust relations into the
resource-redistribution process. Specifically, a tunable parameter is used to
scale the resources received by trusted users before the redistribution back to
the objects. Interestingly, we find an optimal scaling parameter for the
proposed CosRA+T method to achieve its best recommendation accuracy, and the
optimal value seems to be universal under several evaluation metrics across
different datasets. Moreover, results of extensive experiments on the two
real-world rating datasets with trust relations, Epinions and FriendFeed,
suggest that CosRA+T has a remarkable improvement in overall accuracy,
diversity, and novelty. Our work takes a step towards designing better
recommendation algorithms by employing multiple resources of social network
information.
|
cs.IR physics.soc-ph
|
a variety of ratingbased recommendation methods have been extensively studied including the wellknown collaborative filtering approaches and some network diffusionbased methods however social trust relations are not sufficiently considered when making recommendations in this paper we contribute to the literature by proposing a trustbased recommendation method named cosrat after integrating the information of trust relations into the resourceredistribution process specifically a tunable parameter is used to scale the resources received by trusted users before the redistribution back to the objects interestingly we find an optimal scaling parameter for the proposed cosrat method to achieve its best recommendation accuracy and the optimal value seems to be universal under several evaluation metrics across different datasets moreover results of extensive experiments on the two realworld rating datasets with trust relations epinions and friendfeed suggest that cosrat has a remarkable improvement in overall accuracy diversity and novelty our work takes a step towards designing better recommendation algorithms by employing multiple resources of social network information
|
[['a', 'variety', 'of', 'ratingbased', 'recommendation', 'methods', 'have', 'been', 'extensively', 'studied', 'including', 'the', 'wellknown', 'collaborative', 'filtering', 'approaches', 'and', 'some', 'network', 'diffusionbased', 'methods', 'however', 'social', 'trust', 'relations', 'are', 'not', 'sufficiently', 'considered', 'when', 'making', 'recommendations', 'in', 'this', 'paper', 'we', 'contribute', 'to', 'the', 'literature', 'by', 'proposing', 'a', 'trustbased', 'recommendation', 'method', 'named', 'cosrat', 'after', 'integrating', 'the', 'information', 'of', 'trust', 'relations', 'into', 'the', 'resourceredistribution', 'process', 'specifically', 'a', 'tunable', 'parameter', 'is', 'used', 'to', 'scale', 'the', 'resources', 'received', 'by', 'trusted', 'users', 'before', 'the', 'redistribution', 'back', 'to', 'the', 'objects', 'interestingly', 'we', 'find', 'an', 'optimal', 'scaling', 'parameter', 'for', 'the', 'proposed', 'cosrat', 'method', 'to', 'achieve', 'its', 'best', 'recommendation', 'accuracy', 'and', 'the', 'optimal', 'value', 'seems', 'to', 'be', 'universal', 'under', 'several', 'evaluation', 'metrics', 'across', 'different', 'datasets', 'moreover', 'results', 'of', 'extensive', 'experiments', 'on', 'the', 'two', 'realworld', 'rating', 'datasets', 'with', 'trust', 'relations', 'epinions', 'and', 'friendfeed', 'suggest', 'that', 'cosrat', 'has', 'a', 'remarkable', 'improvement', 'in', 'overall', 'accuracy', 'diversity', 'and', 'novelty', 'our', 'work', 'takes', 'a', 'step', 'towards', 'designing', 'better', 'recommendation', 'algorithms', 'by', 'employing', 'multiple', 'resources', 'of', 'social', 'network', 'information']]
|
[-0.08619902702630497, -0.023222551291019043, -0.06695778043940663, 0.05810465656874157, -0.13096271505928597, -0.17466996207513147, 0.10201825219628517, 0.4446136531652883, -0.22585088539344725, -0.3400273156003095, 0.0742374578359886, -0.28981651788635643, -0.2002359861173318, 0.2047748258919455, -0.0858720191342968, 0.08560775349251344, 0.0934518188056245, 0.03831941332682618, -0.062469867886102294, -0.3253620628682256, 0.3276368184975581, 0.08219697619206272, 0.36523415561096045, 0.08804895633438718, 0.10731466767392703, -0.04022296454641037, -0.0702378405345371, 0.04102461570728337, -0.11372346433731764, 0.14392588067712495, 0.34529723344530794, 0.19531893871462672, 0.37942849850369387, -0.35575998231070116, -0.22746533698518762, 0.07791070687235332, 0.1709470963833155, 0.07992827983562165, -0.04690641662054986, -0.33040532661252653, 0.07555246713127417, -0.21735155734349973, -0.019465899962233378, -0.11581915137867327, -0.016306885509402493, 0.015972095263714438, -0.29289663879681027, 0.01804600031900918, 0.038305442433920686, 0.04226377856102772, -0.01638126183243003, -0.1319718608923722, 0.037954205536516385, 0.2025457421574174, 0.05708114234275854, -0.017945830784447024, 0.15246887700050138, -0.14212488493030834, -0.17934422631005872, 0.37964916984783487, -0.023194458517900786, -0.19322429328167345, 0.163592294981936, -0.011829215520992874, -0.17087715964589734, 0.08686319100961555, 0.2030970324689406, 0.06861010330612771, -0.1907915453823989, 0.005570762854586064, -0.041678818118816706, 0.17799178451823536, 0.03834219279960962, 0.012740433614817448, 0.13443545146437827, 0.2251365317075397, 0.054622952335921585, 0.08495094371974118, -0.03770154449957772, -0.1245582144591026, -0.14347271175320203, -0.12383891007339116, -0.1759269334957935, -0.02243646706765503, -0.1491779660424072, -0.08507732029538602, 0.3734962668444496, 0.23341959078679791, 0.1801934272487415, 0.06503211470680981, 0.34091014264849945, 0.042632509387476605, 0.11004940122365951, 0.10086528800748056, 0.20949034802124517, -0.007477048486180138, 0.15956719863170293, -0.1765487195181777, 0.13206535638164496, 0.03111372370913159]
|
1,803.08379
|
Goursat rigid local systems of rank four
|
We study the general properties of certain rank four rigid local systems
considered by Goursat. We analyze when they are irreducible, give an explicit
integral description as well as the invariant Hermitian form when it exists. By
a computer search we find what we expect are all irreducible such systems all
whose solutions are algebraic functions and give several explicit examples
defined over the rationals. We also exhibit one example with infinite monodromy
as arising from a family of genus two curves.
|
math.NT math.AG
|
we study the general properties of certain rank four rigid local systems considered by goursat we analyze when they are irreducible give an explicit integral description as well as the invariant hermitian form when it exists by a computer search we find what we expect are all irreducible such systems all whose solutions are algebraic functions and give several explicit examples defined over the rationals we also exhibit one example with infinite monodromy as arising from a family of genus two curves
|
[['we', 'study', 'the', 'general', 'properties', 'of', 'certain', 'rank', 'four', 'rigid', 'local', 'systems', 'considered', 'by', 'goursat', 'we', 'analyze', 'when', 'they', 'are', 'irreducible', 'give', 'an', 'explicit', 'integral', 'description', 'as', 'well', 'as', 'the', 'invariant', 'hermitian', 'form', 'when', 'it', 'exists', 'by', 'a', 'computer', 'search', 'we', 'find', 'what', 'we', 'expect', 'are', 'all', 'irreducible', 'such', 'systems', 'all', 'whose', 'solutions', 'are', 'algebraic', 'functions', 'and', 'give', 'several', 'explicit', 'examples', 'defined', 'over', 'the', 'rationals', 'we', 'also', 'exhibit', 'one', 'example', 'with', 'infinite', 'monodromy', 'as', 'arising', 'from', 'a', 'family', 'of', 'genus', 'two', 'curves']]
|
[-0.17914675901893798, 0.10268680055830884, -0.07683121115423558, 0.12757754610942268, -0.07225108367572652, -0.15983953686976216, -0.05604326319965965, 0.3687911617864923, -0.2948440829485019, -0.27235142073435026, 0.16167961871365039, -0.273066631416086, -0.2387663831071156, 0.2558861313949952, -0.03551207307339987, 0.03097669804105308, 0.029408057336695492, 0.10871039810817598, -0.12182751502245437, -0.2914309645207917, 0.3891207281068513, -0.10343697340023227, 0.16975985730930074, 0.007261480136615474, 0.11151746404641194, 0.014300010655438754, -0.013698201251738682, 0.0079426402850758, -0.1675383268696506, 0.09878538127579703, 0.3264348632542462, 0.11022912270798371, 0.17855518351909888, -0.3866168117695829, -0.15677532267461464, 0.2168700066111164, 0.13782416286923718, 0.10654845488649543, -0.047557178742774736, -0.22481424550003395, 0.07294960327094376, -0.19771682624932288, -0.1806460188860755, -0.15456246631219983, 0.028025387009753416, 0.08181441050284065, -0.17710159751359464, -0.004621771451372585, 0.08597837855454489, 0.14051143047059092, -0.07279242684769376, -0.1386680239044902, -0.016037564585553256, 0.1077395281278835, 0.029364540468810534, -0.023739789802830938, 0.06184290980965626, -0.10244465757320385, -0.11201097389183394, 0.3859955070834187, -0.051721990381072204, -0.24815989285423534, 0.18618063506011556, -0.0936185337444086, -0.13594661118667117, 0.1179333248277899, 0.12953984948079578, 0.14758046362698135, -0.10417387923743951, 0.1403541700430385, -0.1422609072405754, 0.0647379437052622, 0.08071743347682059, 0.050991940048733364, 0.17306549552964365, 0.042758429746665966, 0.06410673805285336, 0.18687165687684107, 0.040376362867835094, -0.09679176755499368, -0.3686597109658689, -0.1525338095521963, -0.09517257106802766, 0.15029128124119667, -0.09100156165244165, -0.21643997251805736, 0.39598612837981795, 0.05618494111056462, 0.2345029386612246, 0.12096228576038123, 0.22949396404750055, 0.12983176857942896, 0.04949046748338222, 0.08456962560189933, 0.1505104174337736, 0.1080918131884551, -0.04294211010408883, -0.10952518239231189, -0.0014209963676587837, 0.15000856352015968]
|
1,803.0838
|
Absolute ion detection efficiencies of microchannel plates and funnel
microchannel plates for multi-coincidence detection
|
Modern momentum imaging techniques allow for the investigation of complex
molecules in the gas phase by detection of several fragment ions in
coincidence. For these studies, it is of great importance that the
single-particle detection efficiency e is as high as possible, as the overall
efficiency scales with e over n, i.e. the power of the number of detected
particles. Here we present measured absolute detection efficiencies for protons
of several micro-channel plates (MCPs), including efficiency enhanced "funnel
MCPs". Furthermore, the relative detection efficiency for two-, three-, four-,
and five-body fragmentation of CHBrClF has been examined. The "funnel" MCPs
exhibit an efficiency of approx. 90 percent, gaining a factor of 24 (as
compared to "normal" MCPs) in case of a five-fold ion coincidence detection.
|
physics.ins-det
|
modern momentum imaging techniques allow for the investigation of complex molecules in the gas phase by detection of several fragment ions in coincidence for these studies it is of great importance that the singleparticle detection efficiency e is as high as possible as the overall efficiency scales with e over n ie the power of the number of detected particles here we present measured absolute detection efficiencies for protons of several microchannel plates mcps including efficiency enhanced funnel mcps furthermore the relative detection efficiency for two three four and fivebody fragmentation of chbrclf has been examined the funnel mcps exhibit an efficiency of approx 90 percent gaining a factor of 24 as compared to normal mcps in case of a fivefold ion coincidence detection
|
[['modern', 'momentum', 'imaging', 'techniques', 'allow', 'for', 'the', 'investigation', 'of', 'complex', 'molecules', 'in', 'the', 'gas', 'phase', 'by', 'detection', 'of', 'several', 'fragment', 'ions', 'in', 'coincidence', 'for', 'these', 'studies', 'it', 'is', 'of', 'great', 'importance', 'that', 'the', 'singleparticle', 'detection', 'efficiency', 'e', 'is', 'as', 'high', 'as', 'possible', 'as', 'the', 'overall', 'efficiency', 'scales', 'with', 'e', 'over', 'n', 'ie', 'the', 'power', 'of', 'the', 'number', 'of', 'detected', 'particles', 'here', 'we', 'present', 'measured', 'absolute', 'detection', 'efficiencies', 'for', 'protons', 'of', 'several', 'microchannel', 'plates', 'mcps', 'including', 'efficiency', 'enhanced', 'funnel', 'mcps', 'furthermore', 'the', 'relative', 'detection', 'efficiency', 'for', 'two', 'three', 'four', 'and', 'fivebody', 'fragmentation', 'of', 'chbrclf', 'has', 'been', 'examined', 'the', 'funnel', 'mcps', 'exhibit', 'an', 'efficiency', 'of', 'approx', '90', 'percent', 'gaining', 'a', 'factor', 'of', '24', 'as', 'compared', 'to', 'normal', 'mcps', 'in', 'case', 'of', 'a', 'fivefold', 'ion', 'coincidence', 'detection']]
|
[-0.10174063760153117, 0.11471564631743027, 0.00962053427124411, 0.02317205919672137, 0.0482819356645147, -0.09812215737604756, 0.04267951147820104, 0.37376096868902686, -0.1797313111554074, -0.39041292856682125, 0.05898399298208031, -0.3028168596206157, -0.002472036012743668, 0.232434205680601, -2.075398266996916e-05, 0.06134000344095918, 0.06027781513587731, 0.010444627944152893, -0.042134184888620835, -0.21028622649553255, 0.219914135284631, 0.12457084011407644, 0.29254571518414024, 0.1168847742402449, 0.10842641660204437, -0.021275979281228975, -0.03498776619345313, 0.026789426303854804, -0.08917305270443922, 0.1047724009552077, 0.2452692236387875, 0.11781139164686022, 0.22388407051926706, -0.383578719677237, -0.1981322636782396, 0.1214714942810436, 0.1993144833732669, 0.005833314390989338, -0.10010688243872994, -0.2121100061804026, 0.06845417217828514, -0.21325174872044142, -0.12933815202516755, -0.05867358440215268, 0.0514502108581667, 0.06253148344292389, -0.20774765489850103, 0.11244694316547697, 0.045544845834140174, 0.0627808172967497, -0.04066248845339306, -0.15096389913431754, -0.008074152025931734, 0.0630042135480761, 0.042872714776000596, 0.010916068271650531, 0.17897739208268373, -0.18626940234117512, -0.12762798944382164, 0.3933255133953521, -0.06649149458560093, -0.142666620830816, 0.21408136422193147, -0.1607789680611615, -0.10129981360027218, 0.22881734850475702, 0.17648178424565045, 0.14762596625880134, -0.11523175426016796, -0.00698555338932807, 0.002309844811632472, 0.17195431352749763, 0.1384462041522914, 0.06167664909281018, 0.20568172115931, 0.22437919791867367, 0.02855494668389239, 0.13209417294741635, -0.2214512124797708, -0.07165560536739621, -0.23782721042966212, -0.21326896604301968, -0.11630803024078287, 0.02789055475798564, -0.07677644165220947, -0.08804346583698444, 0.3611504509287879, 0.11743341965176832, 0.19229895062176738, -0.01690018395098244, 0.3233494951912179, 0.09251888700556464, 0.08366489202935036, -0.018131898314790514, 0.3165014661911012, 0.12193153126589287, 0.08354468484327758, -0.23506851184533956, 0.024384675403617745, -0.02684955279214111]
|
1,803.08381
|
Model Consistency for Learning with Mirror-Stratifiable Regularizers
|
Low-complexity non-smooth convex regularizers are routinely used to impose
some structure (such as sparsity or low-rank) on the coefficients for linear
predictors in supervised learning. Model consistency consists then in selecting
the correct structure (for instance support or rank) by regularized empirical
risk minimization.
It is known that model consistency holds under appropriate non-degeneracy
conditions. However such conditions typically fail for highly correlated
designs and it is observed that regularization methods tend to select larger
models.
In this work, we provide the theoretical underpinning of this behavior using
the notion of mirror-stratifiable regularizers. This class of regularizers
encompasses the most well-known in the literature, including the $\ell_1$ or
trace norms. It brings into play a pair of primal-dual models, which in turn
allows one to locate the structure of the solution using a specific dual
certificate.
We also show how this analysis is applicable to optimal solutions of the
learning problem, and also to the iterates computed by a certain class of
stochastic proximal-gradient algorithms.
|
math.OC
|
lowcomplexity nonsmooth convex regularizers are routinely used to impose some structure such as sparsity or lowrank on the coefficients for linear predictors in supervised learning model consistency consists then in selecting the correct structure for instance support or rank by regularized empirical risk minimization it is known that model consistency holds under appropriate nondegeneracy conditions however such conditions typically fail for highly correlated designs and it is observed that regularization methods tend to select larger models in this work we provide the theoretical underpinning of this behavior using the notion of mirrorstratifiable regularizers this class of regularizers encompasses the most wellknown in the literature including the ell_1 or trace norms it brings into play a pair of primaldual models which in turn allows one to locate the structure of the solution using a specific dual certificate we also show how this analysis is applicable to optimal solutions of the learning problem and also to the iterates computed by a certain class of stochastic proximalgradient algorithms
|
[['lowcomplexity', 'nonsmooth', 'convex', 'regularizers', 'are', 'routinely', 'used', 'to', 'impose', 'some', 'structure', 'such', 'as', 'sparsity', 'or', 'lowrank', 'on', 'the', 'coefficients', 'for', 'linear', 'predictors', 'in', 'supervised', 'learning', 'model', 'consistency', 'consists', 'then', 'in', 'selecting', 'the', 'correct', 'structure', 'for', 'instance', 'support', 'or', 'rank', 'by', 'regularized', 'empirical', 'risk', 'minimization', 'it', 'is', 'known', 'that', 'model', 'consistency', 'holds', 'under', 'appropriate', 'nondegeneracy', 'conditions', 'however', 'such', 'conditions', 'typically', 'fail', 'for', 'highly', 'correlated', 'designs', 'and', 'it', 'is', 'observed', 'that', 'regularization', 'methods', 'tend', 'to', 'select', 'larger', 'models', 'in', 'this', 'work', 'we', 'provide', 'the', 'theoretical', 'underpinning', 'of', 'this', 'behavior', 'using', 'the', 'notion', 'of', 'mirrorstratifiable', 'regularizers', 'this', 'class', 'of', 'regularizers', 'encompasses', 'the', 'most', 'wellknown', 'in', 'the', 'literature', 'including', 'the', 'ell_1', 'or', 'trace', 'norms', 'it', 'brings', 'into', 'play', 'a', 'pair', 'of', 'primaldual', 'models', 'which', 'in', 'turn', 'allows', 'one', 'to', 'locate', 'the', 'structure', 'of', 'the', 'solution', 'using', 'a', 'specific', 'dual', 'certificate', 'we', 'also', 'show', 'how', 'this', 'analysis', 'is', 'applicable', 'to', 'optimal', 'solutions', 'of', 'the', 'learning', 'problem', 'and', 'also', 'to', 'the', 'iterates', 'computed', 'by', 'a', 'certain', 'class', 'of', 'stochastic', 'proximalgradient', 'algorithms']]
|
[-0.045057421342723745, -0.004874336894488696, -0.0893529455177486, 0.13053080740060205, -0.10795883708915702, -0.18188628277205157, 0.01408473607576029, 0.4012527680758274, -0.32099964034560163, -0.2619399929644935, 0.13602764361721437, -0.2338845456753695, -0.20043060601985252, 0.17627974994565276, -0.10609499956622268, 0.10859742098643134, 0.05770560846184239, 0.029424574566391214, -0.10559452505373029, -0.2642723730313733, 0.3299048843821793, 0.02649374946565579, 0.2845582482546116, 0.009936980418790358, 0.0977114471917351, -0.0009094418612111247, 0.006232799411835996, 0.04283694138496437, -0.09554112371468253, 0.1498054808750043, 0.309951985760629, 0.20445529856069972, 0.35977910598316654, -0.4027541869630416, -0.20786120066221692, 0.1504441436979863, 0.11025213145097068, 0.06619629206657975, -0.04915486921725625, -0.22508673910333804, 0.09325763119074205, -0.11837786951271648, -0.08099641770011548, -0.150897837603627, -0.07655767145157424, 0.016238963390192526, -0.3623444019305294, 0.06286370058395815, 0.0890246935273436, 0.0009170184194138556, -0.09583126070446628, -0.13453306618118377, 0.029712302027495974, 0.07502891172824258, 0.0949109510941939, 0.009606154536771955, 0.09544005820697005, -0.12569366198202425, -0.09487601321359927, 0.36814088494601577, -0.03333569611281608, -0.2469460137639985, 0.2062744482900157, -0.048813779403765994, -0.18513469419752557, 0.1034666797710639, 0.2052183299156075, 0.15024062024842186, -0.16491645017575304, 0.0794606192227961, -0.07425870093672225, 0.12305850260044364, 0.03694829210695444, 0.039724182971104076, 0.11803191835907373, 0.15696996290688262, 0.13970111781999356, 0.1453798472119326, -0.042327097635433984, -0.10103242387712905, -0.28863282868793855, -0.10004416778965881, -0.16599743021087665, -0.006606006607321571, -0.11328437860021509, -0.1904278480984045, 0.37463168057076857, 0.17132057844190224, 0.20505802473335555, 0.09131611464756795, 0.27211744424491896, 0.09563387799937503, 0.10351678594579977, 0.09403980228640703, 0.2227858271613844, 0.1077918184483706, 0.05113143977192301, -0.18780732064818342, 0.11506964529046056, 0.11435860359307491]
|
1,803.08382
|
Observations contradict galaxy size and surface brightness predictions
that are based on the expanding universe hypothesis
|
In a non-expanding universe surface brightness is independent of distance or
redshift, while in an expanding universe it decreases rapidly with both.
Similarly, for objects of the same luminosity, the angular radius of an object
in a non-expanding universe declines with redshift, while in an expanding
universe this radius increases for redshifts z>1.25. The author and colleagues
have previously shown that data for the surface brightness of disk galaxies are
compatible with a static universe with redshift linearly proportional to
distance at all z (SEU hypothesis). In this paper we examine the more
conventional hypothesis that the universe is expanding, but that the actual
radii of galaxies of a given luminosity increase with time (decrease with z),
as others have proposed. We show that the radii data for both disk and
elliptical galaxies are incompatible with any of the published size-evolution
predictions based on an expanding universe. We find that all the physical
mechanisms proposed for size evolution, such as galaxy mergers, lead to
predictions that are in quantitative contradiction with either the radius data
or other data sets, such as the observed rate of galaxy mergers. In addition,
we find that when the effect of telescope resolution is taken into account, the
r-z relationships for disk and elliptical galaxies are identical. Both are
excellently fit by SEU predictions. An overall comparison of cosmological
models requires examining all available data-sets, but for this data-set there
is a clear contradiction of predictions based on an expanding universe
hypothesis.
|
astro-ph.GA
|
in a nonexpanding universe surface brightness is independent of distance or redshift while in an expanding universe it decreases rapidly with both similarly for objects of the same luminosity the angular radius of an object in a nonexpanding universe declines with redshift while in an expanding universe this radius increases for redshifts z125 the author and colleagues have previously shown that data for the surface brightness of disk galaxies are compatible with a static universe with redshift linearly proportional to distance at all z seu hypothesis in this paper we examine the more conventional hypothesis that the universe is expanding but that the actual radii of galaxies of a given luminosity increase with time decrease with z as others have proposed we show that the radii data for both disk and elliptical galaxies are incompatible with any of the published sizeevolution predictions based on an expanding universe we find that all the physical mechanisms proposed for size evolution such as galaxy mergers lead to predictions that are in quantitative contradiction with either the radius data or other data sets such as the observed rate of galaxy mergers in addition we find that when the effect of telescope resolution is taken into account the rz relationships for disk and elliptical galaxies are identical both are excellently fit by seu predictions an overall comparison of cosmological models requires examining all available datasets but for this dataset there is a clear contradiction of predictions based on an expanding universe hypothesis
|
[['in', 'a', 'nonexpanding', 'universe', 'surface', 'brightness', 'is', 'independent', 'of', 'distance', 'or', 'redshift', 'while', 'in', 'an', 'expanding', 'universe', 'it', 'decreases', 'rapidly', 'with', 'both', 'similarly', 'for', 'objects', 'of', 'the', 'same', 'luminosity', 'the', 'angular', 'radius', 'of', 'an', 'object', 'in', 'a', 'nonexpanding', 'universe', 'declines', 'with', 'redshift', 'while', 'in', 'an', 'expanding', 'universe', 'this', 'radius', 'increases', 'for', 'redshifts', 'z125', 'the', 'author', 'and', 'colleagues', 'have', 'previously', 'shown', 'that', 'data', 'for', 'the', 'surface', 'brightness', 'of', 'disk', 'galaxies', 'are', 'compatible', 'with', 'a', 'static', 'universe', 'with', 'redshift', 'linearly', 'proportional', 'to', 'distance', 'at', 'all', 'z', 'seu', 'hypothesis', 'in', 'this', 'paper', 'we', 'examine', 'the', 'more', 'conventional', 'hypothesis', 'that', 'the', 'universe', 'is', 'expanding', 'but', 'that', 'the', 'actual', 'radii', 'of', 'galaxies', 'of', 'a', 'given', 'luminosity', 'increase', 'with', 'time', 'decrease', 'with', 'z', 'as', 'others', 'have', 'proposed', 'we', 'show', 'that', 'the', 'radii', 'data', 'for', 'both', 'disk', 'and', 'elliptical', 'galaxies', 'are', 'incompatible', 'with', 'any', 'of', 'the', 'published', 'sizeevolution', 'predictions', 'based', 'on', 'an', 'expanding', 'universe', 'we', 'find', 'that', 'all', 'the', 'physical', 'mechanisms', 'proposed', 'for', 'size', 'evolution', 'such', 'as', 'galaxy', 'mergers', 'lead', 'to', 'predictions', 'that', 'are', 'in', 'quantitative', 'contradiction', 'with', 'either', 'the', 'radius', 'data', 'or', 'other', 'data', 'sets', 'such', 'as', 'the', 'observed', 'rate', 'of', 'galaxy', 'mergers', 'in', 'addition', 'we', 'find', 'that', 'when', 'the', 'effect', 'of', 'telescope', 'resolution', 'is', 'taken', 'into', 'account', 'the', 'rz', 'relationships', 'for', 'disk', 'and', 'elliptical', 'galaxies', 'are', 'identical', 'both', 'are', 'excellently', 'fit', 'by', 'seu', 'predictions', 'an', 'overall', 'comparison', 'of', 'cosmological', 'models', 'requires', 'examining', 'all', 'available', 'datasets', 'but', 'for', 'this', 'dataset', 'there', 'is', 'a', 'clear', 'contradiction', 'of', 'predictions', 'based', 'on', 'an', 'expanding', 'universe', 'hypothesis']]
|
[-0.07120053665731328, 0.09226860753710661, -0.09583022727853494, 0.09189094219880879, -0.07371307747921178, -0.0791345352159911, -0.024102988035930886, 0.42925671750476, -0.1364734159311919, -0.31460217332188417, 0.07030028493383048, -0.31099487451255803, -0.02650541185141213, 0.2139243964777, -0.03646025298774122, -0.01259765795880725, 0.06296892354344037, -0.01940716757073335, -0.049893411147223905, -0.30401907652439286, 0.3404848507505574, 0.11165177169810181, 0.21454038590132465, -0.03308976752502535, 0.07707553986942599, -0.07417157017240567, -0.0816310185162343, 0.0510471045277138, -0.1449605535239729, 0.019150087277137257, 0.22089475220765248, 0.17214496485883185, 0.2257592086529412, -0.3879238192580248, -0.2122178019933131, 0.10444352950010946, 0.17769255968793918, 0.08309271489234683, -0.08262077696049475, -0.2545707559011319, 0.06836792029985246, -0.1767795653598994, -0.15551019197250698, 0.023957805243332075, 0.07369346599196375, 0.013181225607371493, -0.22923454217356348, 0.15648164421339758, 0.03678616117648328, 0.054465496127384334, -0.10526846684817119, -0.08398041655102119, -0.047516744395789616, 0.08490142377382352, 0.08390318994270826, 0.09653807636576625, 0.1363410357723337, -0.1303121951561391, -0.062415129667230944, 0.39171380038384485, -0.07260656069308097, -0.08050010958874998, 0.20222786201450688, -0.1991024835823247, -0.12510165984156496, 0.0934947920427752, 0.14201092533814355, 0.06908463900682596, -0.1337509405781418, 0.052737844007151945, -0.024381200268747745, 0.2082996790350117, 0.054719448483620696, 0.03567558197648196, 0.29587631117220714, 0.13004821472610856, 0.04058777445904639, 0.0563211264298486, -0.11263954380587467, -0.04300939318109379, -0.29405958580252856, -0.12798562143488149, -0.16850274155125672, 0.04215357442450547, -0.16051071489717375, -0.1481692153503996, 0.30714912571178876, 0.11953159992918674, 0.26345957468192166, 0.12275978926967958, 0.2818924242117808, 0.05978943957892522, 0.1056786582726035, 0.12212977739360169, 0.2883610816970317, 0.085366515839578, 0.06647202465871749, -0.20140712211089518, 0.08044986119484415, -0.028534196739496007]
|
1,803.08383
|
Head-up Displays (HUD) in driving
|
Head Up Displays (HUDs) were designed originally to present at the usual
viewpoints of the pilot the main sensor data during aircraft missions, because
of placing instrument information in the forward field of view enhances pilots
ability to utilize both instrument and environmental information
simultaneously. The first civilian motor vehicle had a monochrome HUD that was
released in 1988 by General Motors as a technological improvement of HeadDown
Display (HDD) interface, which is commonly used in automobile industry. The HUD
reduces the number and duration of the drivers sight deviations from the road,
by projecting the required information directly into the drivers line of
vision. There are many studies about ways of presenting the information:
standard oneearpiece presentation, threedimensional audio presentation, visual
only or audiovisual presentation. Results have shown that using a 3D auditory
display the time of acquiring targets is approximately 2.2 seconds faster than
using a oneearpiece way. Nevertheless, a disadvantage is when the drivers
attention unconsciously shifts away from the road and goes focused on
processing the information presented by the HUD. By this reason, the time, the
way and the channel are important to represent the information on a HUD. A
solution is a context aware multimodal proactive recommended system that
features personalized content combined with the use of car sensors to determine
when the information has to be presented.
|
cs.HC
|
head up displays huds were designed originally to present at the usual viewpoints of the pilot the main sensor data during aircraft missions because of placing instrument information in the forward field of view enhances pilots ability to utilize both instrument and environmental information simultaneously the first civilian motor vehicle had a monochrome hud that was released in 1988 by general motors as a technological improvement of headdown display hdd interface which is commonly used in automobile industry the hud reduces the number and duration of the drivers sight deviations from the road by projecting the required information directly into the drivers line of vision there are many studies about ways of presenting the information standard oneearpiece presentation threedimensional audio presentation visual only or audiovisual presentation results have shown that using a 3d auditory display the time of acquiring targets is approximately 22 seconds faster than using a oneearpiece way nevertheless a disadvantage is when the drivers attention unconsciously shifts away from the road and goes focused on processing the information presented by the hud by this reason the time the way and the channel are important to represent the information on a hud a solution is a context aware multimodal proactive recommended system that features personalized content combined with the use of car sensors to determine when the information has to be presented
|
[['head', 'up', 'displays', 'huds', 'were', 'designed', 'originally', 'to', 'present', 'at', 'the', 'usual', 'viewpoints', 'of', 'the', 'pilot', 'the', 'main', 'sensor', 'data', 'during', 'aircraft', 'missions', 'because', 'of', 'placing', 'instrument', 'information', 'in', 'the', 'forward', 'field', 'of', 'view', 'enhances', 'pilots', 'ability', 'to', 'utilize', 'both', 'instrument', 'and', 'environmental', 'information', 'simultaneously', 'the', 'first', 'civilian', 'motor', 'vehicle', 'had', 'a', 'monochrome', 'hud', 'that', 'was', 'released', 'in', '1988', 'by', 'general', 'motors', 'as', 'a', 'technological', 'improvement', 'of', 'headdown', 'display', 'hdd', 'interface', 'which', 'is', 'commonly', 'used', 'in', 'automobile', 'industry', 'the', 'hud', 'reduces', 'the', 'number', 'and', 'duration', 'of', 'the', 'drivers', 'sight', 'deviations', 'from', 'the', 'road', 'by', 'projecting', 'the', 'required', 'information', 'directly', 'into', 'the', 'drivers', 'line', 'of', 'vision', 'there', 'are', 'many', 'studies', 'about', 'ways', 'of', 'presenting', 'the', 'information', 'standard', 'oneearpiece', 'presentation', 'threedimensional', 'audio', 'presentation', 'visual', 'only', 'or', 'audiovisual', 'presentation', 'results', 'have', 'shown', 'that', 'using', 'a', '3d', 'auditory', 'display', 'the', 'time', 'of', 'acquiring', 'targets', 'is', 'approximately', '22', 'seconds', 'faster', 'than', 'using', 'a', 'oneearpiece', 'way', 'nevertheless', 'a', 'disadvantage', 'is', 'when', 'the', 'drivers', 'attention', 'unconsciously', 'shifts', 'away', 'from', 'the', 'road', 'and', 'goes', 'focused', 'on', 'processing', 'the', 'information', 'presented', 'by', 'the', 'hud', 'by', 'this', 'reason', 'the', 'time', 'the', 'way', 'and', 'the', 'channel', 'are', 'important', 'to', 'represent', 'the', 'information', 'on', 'a', 'hud', 'a', 'solution', 'is', 'a', 'context', 'aware', 'multimodal', 'proactive', 'recommended', 'system', 'that', 'features', 'personalized', 'content', 'combined', 'with', 'the', 'use', 'of', 'car', 'sensors', 'to', 'determine', 'when', 'the', 'information', 'has', 'to', 'be', 'presented']]
|
[-0.07509198151470892, 0.06928004309476028, -0.08225969258565202, 0.030207858976646754, -0.1130179183455437, -0.15609148472581244, 0.04487885259528016, 0.3896152628122142, -0.2329153606243541, -0.35342950470391576, 0.12595906001473545, -0.3055911413077855, -0.13661717146116717, 0.21320361422682477, -0.1352910506566702, 0.03694166154579609, 0.08703339233998698, 0.06577827703582789, -0.010764587024222571, -0.2186400345273788, 0.25841477571678984, 0.07489928465370274, 0.30912113615324327, -0.0012428417825034706, 0.11725499236806637, 0.016158520897778753, -0.085720448792655, -0.014844602549119908, -0.07195267770530912, 0.12872177248239114, 0.29737971058300783, 0.1704342072762178, 0.29731282681159305, -0.4363830995649032, -0.23009916550661036, 0.05094206060506235, 0.12326126483509241, 0.08970455223077074, -0.0546467304141503, -0.33289400976977196, 0.06430660072933422, -0.1505863386800521, -0.07710956331612163, -0.016334698394328627, 0.026058001373683807, 0.026140889377813635, -0.22451578139335895, -0.0034982377604783695, 0.043312321300091584, 0.094105405837289, -0.027365720693371787, -0.08692143569338005, -0.019210471803263438, 0.2122713689720237, 0.053118187524336155, 0.05116947527344832, 0.1784887096715029, -0.15356028441664218, -0.09551984332375464, 0.4123566132333821, -0.009213447700714486, -0.1469734643071856, 0.16737535280281915, -0.09733073665166266, -0.10118126691365403, 0.16050739670425182, 0.17757415363925394, 0.06710919074169508, -0.18402002253150884, 0.006123771096634514, -0.002927026901040142, 0.1937406829956548, 0.07379130606868249, 0.015617969750618452, 0.19928689408895656, 0.1892840114540138, 0.06217841462367025, 0.12737135857510132, -0.1304369182368041, -0.08106668952256452, -0.22041261641569942, -0.14860314015105233, -0.1553131058407585, -0.0046296452153136965, -0.043297130205485194, -0.05829036634600941, 0.381868381402982, 0.19941155110776626, 0.1626604209573438, 0.022787356028034104, 0.3645115895744632, 0.06212426959989988, 0.11891347476243298, 0.061969653694844085, 0.21276960233090778, 0.04431559384181017, 0.18748214836253435, -0.1544261490483663, 0.11509969134128134, 0.019421082554170147]
|
1,803.08384
|
The correlation between the total magnetic flux and the total jet power
|
Magnetic field threading a black hole ergosphere is believed to play the key
role in both driving the powerful relativistic jets observed in active galactic
nuclei and extracting the rotational energy from a black hole via
Blandford-Znajek process. The magnitude of magnetic field and the magnetic flux
in the vicinity of a central black hole is predicted by theoretical models. On
the other hand, the magnetic field in a jet can be estimated through
measurements of either the core shift effect or the brightness temperature. In
both cases the obtained magnetic field is in the radiating domain, so its
direct application to the calculation of the magnetic flux needs some
theoretical assumptions. In this paper we address the issue of estimating the
magnetic flux contained in a jet using the measurements of a core shift effect
and of a brightness temperature for the jets, directed almost at the observer.
The accurate account for the jet transversal structure allow us to express the
magnetic flux through the observed values and an unknown rotation rate of
magnetic surfaces. If we assume the sources are in a magnetically arrested disk
state, the lower limit for the rotation rate can be obtained. On the other
hand, the flux estimate may be tested against the total jet power predicted by
the electromagnetic energy extraction model. The resultant expression for power
depends logarithmically weakly on an unknown rotation rate. We show that the
total jet power estimated through the magnetic flux is in good agreement with
the observed power. We also obtain the extremely slow rotation rates, which may
be an indication that the majority of the sources considered are not in the
magnetically arrested disk state.
|
astro-ph.HE
|
magnetic field threading a black hole ergosphere is believed to play the key role in both driving the powerful relativistic jets observed in active galactic nuclei and extracting the rotational energy from a black hole via blandfordznajek process the magnitude of magnetic field and the magnetic flux in the vicinity of a central black hole is predicted by theoretical models on the other hand the magnetic field in a jet can be estimated through measurements of either the core shift effect or the brightness temperature in both cases the obtained magnetic field is in the radiating domain so its direct application to the calculation of the magnetic flux needs some theoretical assumptions in this paper we address the issue of estimating the magnetic flux contained in a jet using the measurements of a core shift effect and of a brightness temperature for the jets directed almost at the observer the accurate account for the jet transversal structure allow us to express the magnetic flux through the observed values and an unknown rotation rate of magnetic surfaces if we assume the sources are in a magnetically arrested disk state the lower limit for the rotation rate can be obtained on the other hand the flux estimate may be tested against the total jet power predicted by the electromagnetic energy extraction model the resultant expression for power depends logarithmically weakly on an unknown rotation rate we show that the total jet power estimated through the magnetic flux is in good agreement with the observed power we also obtain the extremely slow rotation rates which may be an indication that the majority of the sources considered are not in the magnetically arrested disk state
|
[['magnetic', 'field', 'threading', 'a', 'black', 'hole', 'ergosphere', 'is', 'believed', 'to', 'play', 'the', 'key', 'role', 'in', 'both', 'driving', 'the', 'powerful', 'relativistic', 'jets', 'observed', 'in', 'active', 'galactic', 'nuclei', 'and', 'extracting', 'the', 'rotational', 'energy', 'from', 'a', 'black', 'hole', 'via', 'blandfordznajek', 'process', 'the', 'magnitude', 'of', 'magnetic', 'field', 'and', 'the', 'magnetic', 'flux', 'in', 'the', 'vicinity', 'of', 'a', 'central', 'black', 'hole', 'is', 'predicted', 'by', 'theoretical', 'models', 'on', 'the', 'other', 'hand', 'the', 'magnetic', 'field', 'in', 'a', 'jet', 'can', 'be', 'estimated', 'through', 'measurements', 'of', 'either', 'the', 'core', 'shift', 'effect', 'or', 'the', 'brightness', 'temperature', 'in', 'both', 'cases', 'the', 'obtained', 'magnetic', 'field', 'is', 'in', 'the', 'radiating', 'domain', 'so', 'its', 'direct', 'application', 'to', 'the', 'calculation', 'of', 'the', 'magnetic', 'flux', 'needs', 'some', 'theoretical', 'assumptions', 'in', 'this', 'paper', 'we', 'address', 'the', 'issue', 'of', 'estimating', 'the', 'magnetic', 'flux', 'contained', 'in', 'a', 'jet', 'using', 'the', 'measurements', 'of', 'a', 'core', 'shift', 'effect', 'and', 'of', 'a', 'brightness', 'temperature', 'for', 'the', 'jets', 'directed', 'almost', 'at', 'the', 'observer', 'the', 'accurate', 'account', 'for', 'the', 'jet', 'transversal', 'structure', 'allow', 'us', 'to', 'express', 'the', 'magnetic', 'flux', 'through', 'the', 'observed', 'values', 'and', 'an', 'unknown', 'rotation', 'rate', 'of', 'magnetic', 'surfaces', 'if', 'we', 'assume', 'the', 'sources', 'are', 'in', 'a', 'magnetically', 'arrested', 'disk', 'state', 'the', 'lower', 'limit', 'for', 'the', 'rotation', 'rate', 'can', 'be', 'obtained', 'on', 'the', 'other', 'hand', 'the', 'flux', 'estimate', 'may', 'be', 'tested', 'against', 'the', 'total', 'jet', 'power', 'predicted', 'by', 'the', 'electromagnetic', 'energy', 'extraction', 'model', 'the', 'resultant', 'expression', 'for', 'power', 'depends', 'logarithmically', 'weakly', 'on', 'an', 'unknown', 'rotation', 'rate', 'we', 'show', 'that', 'the', 'total', 'jet', 'power', 'estimated', 'through', 'the', 'magnetic', 'flux', 'is', 'in', 'good', 'agreement', 'with', 'the', 'observed', 'power', 'we', 'also', 'obtain', 'the', 'extremely', 'slow', 'rotation', 'rates', 'which', 'may', 'be', 'an', 'indication', 'that', 'the', 'majority', 'of', 'the', 'sources', 'considered', 'are', 'not', 'in', 'the', 'magnetically', 'arrested', 'disk', 'state']]
|
[-0.13601917382064557, 0.1470294333221221, -0.0477338160812404, 0.10265095134536588, -0.06442421837129839, -0.06676084346227427, 0.03207445476457702, 0.37728733796745645, -0.23187154565450613, -0.33301314445099794, 0.09077137501229238, -0.24801587849338388, -0.02569095450026742, 0.24105349804848114, -0.0041102015883976665, -0.005271214874719396, 0.006839384308277076, 0.058678932381077964, -0.04999818591387724, -0.1507327619992243, 0.31674361090404496, 0.10941935560642825, 0.2656424438217953, 0.05033258568608199, 0.06919831946638025, -0.03844919382160351, 0.0004129718667645259, 0.05746122212626024, -0.10903952608625131, 0.048320444995119796, 0.17861980687987875, 0.056639800578176816, 0.19467392187096175, -0.44863284279897253, -0.21968517554725034, 0.08814066331924744, 0.1582181419931962, 0.10037726253806364, -0.08477393050099727, -0.22691442449892013, 0.052269614018247965, -0.16221924289875395, -0.13672304679589922, -0.033184448767493206, 0.018714805446843553, 0.012826954597918801, -0.26783530475522865, 0.10645782770794067, 0.07117734742732022, 0.03102350071921043, -0.12141440166334466, -0.06287290156881899, -0.07509240128673295, 0.10878636852384038, 0.11629002711276219, 0.10399786450691335, 0.2151039096193713, -0.15989205352564298, -0.09403757076856292, 0.3446834042396569, -0.05357377267329957, -0.14311642188817475, 0.14222942741531414, -0.22622849573911535, -0.11145926687992393, 0.17511932989495418, 0.17600334679717827, 0.1299687066874417, -0.1219365320475424, 0.02745255472526299, -0.017510912282097408, 0.1806485576304902, 0.013604729741254947, 0.025025887122920264, 0.3109615164953102, 0.12358088593837205, 0.023488923250631268, 0.13632806828220664, -0.1839321544004465, -0.06017965823287655, -0.27724079279770936, -0.12019128223637317, -0.16655038958299387, 0.06749358856353496, -0.10933013710578003, -0.13741203134562952, 0.3759827384347381, 0.12718035345416503, 0.2167387721866197, -0.03154342418770203, 0.322375018156243, 0.140230745585052, 0.05481821430757562, 0.14542407384871428, 0.3486180868870007, 0.17424787802860353, 0.11691470884177768, -0.26710280574016354, 0.09044454817318778, 0.03356379433410753]
|
1,803.08385
|
Ground-state and thermodynamic properties of an $S=1$ Kitaev model
|
We study ground-state and thermodynamic properties of an $S=1$ Kitaev model.
We first clarify the existence of global parity symmetry in addition to the
local symmetry on each plaquette, which enables us to perform the large scale
calculations up to 24 sites. It is found that the ground state should be
singlet and its energy is estimated as $E/N\sim -0.65J$, where $J$ is the
Kitaev exchange coupling. We find that a lowest excited state belongs to the
same subspace as the ground state and the gap monotonically decreases with
increasing system size, which suggests that the ground state of the $S=1$
Kitaev model is gapless. By means of the thermal pure quantum states, we
clarify finite temperature properties characteristic of the Kitaev models with
$S\le 2$.
|
cond-mat.str-el
|
we study groundstate and thermodynamic properties of an s1 kitaev model we first clarify the existence of global parity symmetry in addition to the local symmetry on each plaquette which enables us to perform the large scale calculations up to 24 sites it is found that the ground state should be singlet and its energy is estimated as ensim 065j where j is the kitaev exchange coupling we find that a lowest excited state belongs to the same subspace as the ground state and the gap monotonically decreases with increasing system size which suggests that the ground state of the s1 kitaev model is gapless by means of the thermal pure quantum states we clarify finite temperature properties characteristic of the kitaev models with sle 2
|
[['we', 'study', 'groundstate', 'and', 'thermodynamic', 'properties', 'of', 'an', 's1', 'kitaev', 'model', 'we', 'first', 'clarify', 'the', 'existence', 'of', 'global', 'parity', 'symmetry', 'in', 'addition', 'to', 'the', 'local', 'symmetry', 'on', 'each', 'plaquette', 'which', 'enables', 'us', 'to', 'perform', 'the', 'large', 'scale', 'calculations', 'up', 'to', '24', 'sites', 'it', 'is', 'found', 'that', 'the', 'ground', 'state', 'should', 'be', 'singlet', 'and', 'its', 'energy', 'is', 'estimated', 'as', 'ensim', '065j', 'where', 'j', 'is', 'the', 'kitaev', 'exchange', 'coupling', 'we', 'find', 'that', 'a', 'lowest', 'excited', 'state', 'belongs', 'to', 'the', 'same', 'subspace', 'as', 'the', 'ground', 'state', 'and', 'the', 'gap', 'monotonically', 'decreases', 'with', 'increasing', 'system', 'size', 'which', 'suggests', 'that', 'the', 'ground', 'state', 'of', 'the', 's1', 'kitaev', 'model', 'is', 'gapless', 'by', 'means', 'of', 'the', 'thermal', 'pure', 'quantum', 'states', 'we', 'clarify', 'finite', 'temperature', 'properties', 'characteristic', 'of', 'the', 'kitaev', 'models', 'with', 'sle', '2']]
|
[-0.14628243705022126, 0.2110975995518299, -0.04323992431501768, 0.05149146063148134, -0.030229024525221075, -0.13697233245775645, 0.061499873467255384, 0.3502825594567243, -0.2532889899429715, -0.2921933712618005, 0.0628322594631989, -0.30656007204144714, -0.049849945518578735, 0.08845134342141871, 0.07109787074272565, 0.023180428078875034, -0.008172448619358962, 0.0597834556059341, -0.11289801969636051, -0.22712012157294778, 0.294939566889943, 0.043666917382882184, 0.28965501971810403, 0.07465255586805963, 0.048122628792865024, -0.008099795191458637, 0.12549660888109956, -0.02507759701280344, -0.16680962425151288, 0.06386092832655131, 0.19802793130906315, 0.02746741815785607, 0.19362797570835438, -0.3948659012394567, -0.18294975617449852, 0.09736075178314481, 0.11144669592801121, 0.1654786608057968, 0.04665040423917104, -0.29911311148973785, 0.06673426484508861, -0.2085298464573439, -0.17953114613755455, -0.11190183114470734, 0.005645405775266549, -0.04132378075249313, -0.23085587014699535, 0.08906938320761847, 0.05119443468509182, 0.040402253655444045, -0.10500559831252171, -0.11407224760642426, -0.1208914318497503, 0.13632730156889244, 0.061066748752754425, 0.07951922514363222, 0.0859530667657964, -0.1348988124424772, -0.13072603707006503, 0.36374325601143703, -0.08666594812999509, -0.13295745959452865, 0.2014182612352494, -0.11963804297274985, -0.12036214797427097, 0.12225544227910559, 0.0655319627502092, 0.07348204690647582, -0.08683477741696181, 0.11135655665449092, -0.06227464417386199, 0.23076432841011293, -0.05242642021978334, 0.05435773137498707, 0.20926952148006567, 0.1339914779434161, 0.10818850631344944, 0.18758512644994735, -0.11556298476634472, -0.14728283026676264, -0.28608980554065877, -0.18976844647418586, -0.24584009776064644, 0.07841334138074965, -0.042779764594841604, -0.14123655052765482, 0.4267190275338268, 0.1694615103638611, 0.20635004627383163, -0.011492844522675318, 0.1805697824175079, 0.1267499338080656, 0.04262903383031728, 0.09540669372278987, 0.234824925954003, 0.1568220391655491, 0.04447782596041854, -0.3106969714581576, 0.031412203251684624, 0.06041471785377531]
|
1,803.08386
|
Observability and State Estimation for a Class of Nonlinear Systems
|
We derive sufficient conditions for the solvability of the state estimation
problem for a class of nonlinear control time-varying systems which includes
those, whose dynamics have triangular structure. The state estimation is
exhibited by means of a sequence of functionals approximating the unknown state
of the system on a given bounded time interval. More assumptions guarantee
solvability of the state estimation problem by means of a hybrid observer.
|
math.OC
|
we derive sufficient conditions for the solvability of the state estimation problem for a class of nonlinear control timevarying systems which includes those whose dynamics have triangular structure the state estimation is exhibited by means of a sequence of functionals approximating the unknown state of the system on a given bounded time interval more assumptions guarantee solvability of the state estimation problem by means of a hybrid observer
|
[['we', 'derive', 'sufficient', 'conditions', 'for', 'the', 'solvability', 'of', 'the', 'state', 'estimation', 'problem', 'for', 'a', 'class', 'of', 'nonlinear', 'control', 'timevarying', 'systems', 'which', 'includes', 'those', 'whose', 'dynamics', 'have', 'triangular', 'structure', 'the', 'state', 'estimation', 'is', 'exhibited', 'by', 'means', 'of', 'a', 'sequence', 'of', 'functionals', 'approximating', 'the', 'unknown', 'state', 'of', 'the', 'system', 'on', 'a', 'given', 'bounded', 'time', 'interval', 'more', 'assumptions', 'guarantee', 'solvability', 'of', 'the', 'state', 'estimation', 'problem', 'by', 'means', 'of', 'a', 'hybrid', 'observer']]
|
[-0.18228249936895308, 0.05492641046807608, -0.07982574515592526, 0.02847728066647987, -0.04554785427514135, -0.13377130601335974, 0.028668415338924044, 0.33525572065263987, -0.300131761629874, -0.31008347710046696, 0.1896430132123094, -0.20342005105168723, -0.10888502850909443, 0.19474798352252143, -0.04375835891593905, 0.14695731154129402, 0.09323597143349402, 0.08329466752612087, -0.09990171012674075, -0.20550535668221795, 0.3599936854135355, -0.010222266154254185, 0.23565574457375882, -0.04288200386252035, 0.17432635777410777, 0.03781854173319195, 0.03522021559354685, 0.021502782295368995, -0.14066384330747977, 0.12099822165156879, 0.22019813953460576, 0.12275815709932324, 0.33678539253785, -0.38311003458083553, -0.24788992813624003, 0.13922633581301747, 0.08510469157687005, 0.09669930121334105, -0.043379610965262945, -0.328674403950572, 0.08027033757089692, -0.13176550461931208, -0.13672376274788642, -0.04419669226798065, -0.01925180947599823, 0.040903247208060586, -0.3405078726603225, 0.09852834520450629, 0.08867273609811331, 0.057446461492765916, -0.15049029440235565, -0.0827883230162757, 0.012550515465109664, 0.12034572243882234, -0.04648002592148259, -0.030451434897258878, 0.07721692723263164, -0.14803150381125948, -0.0943332527325872, 0.34372226658331995, -0.02465194134000579, -0.2818968028158826, 0.11709261066896622, -0.08757098443696604, -0.10477108272778637, 0.14787284692968516, 0.16937800495447042, 0.17222045304472833, -0.18153164150991122, 0.11025629778776098, -0.06483978243298172, 0.175248749252847, -0.000978267943377004, 0.0734161552391015, 0.1331131656873314, 0.18790162140366568, 0.18538728293702555, 0.16749926844803506, -0.028499257836408692, -0.13787612461430185, -0.30467163711128864, -0.09196080034598708, -0.19855424498810487, 0.03530205546549576, -0.06915418473962585, -0.2152839374509366, 0.4331974134068279, 0.1006119934403721, 0.1498796947656528, 0.08537067752160296, 0.21898805665071397, 0.1958615331977318, -0.06828027048750836, 0.0815669936059481, 0.192494168812546, 0.16919683400705895, 0.06498444691875621, -0.23886927157667848, 0.17871893266462446, 0.09988354033895816]
|
1,803.08387
|
Numerically exact approach to few-body problems far from a perturbative
regime
|
Recent developments of experimental techniques in the field of ultra-cold
gases open a path to study the crossover from 'few' to 'many' on the quantum
level. In this case, accurate description of inter-particle correlations is
very important since it is believed that they can be utilized by quantum
engineers in quantum metrology, quantum thermometry, quantum heat engines, {\it
etc}. Unfortunately, a theoretical description of these correlations is very
challenging since they are far beyond any variational approaches. By contrast,
the exact many-body description rapidly hits numerical limitations due to an
exponential increase of the many-body Hilbert space. In this work, we brush up
a very effective method of constructing a many-body basis which originates in
the physical argumentation. We show that, in contrast to the commonly used
approach of a straightforward cut-off, it enables one to perform exact
calculations with very limited numerical resources. As examples, we study
quantum correlations in systems of spinless bosons and two-component mixtures
of fermions confined in a one-dimensional harmonic trap being far from the
perturbative regime.
|
cond-mat.quant-gas
|
recent developments of experimental techniques in the field of ultracold gases open a path to study the crossover from few to many on the quantum level in this case accurate description of interparticle correlations is very important since it is believed that they can be utilized by quantum engineers in quantum metrology quantum thermometry quantum heat engines it etc unfortunately a theoretical description of these correlations is very challenging since they are far beyond any variational approaches by contrast the exact manybody description rapidly hits numerical limitations due to an exponential increase of the manybody hilbert space in this work we brush up a very effective method of constructing a manybody basis which originates in the physical argumentation we show that in contrast to the commonly used approach of a straightforward cutoff it enables one to perform exact calculations with very limited numerical resources as examples we study quantum correlations in systems of spinless bosons and twocomponent mixtures of fermions confined in a onedimensional harmonic trap being far from the perturbative regime
|
[['recent', 'developments', 'of', 'experimental', 'techniques', 'in', 'the', 'field', 'of', 'ultracold', 'gases', 'open', 'a', 'path', 'to', 'study', 'the', 'crossover', 'from', 'few', 'to', 'many', 'on', 'the', 'quantum', 'level', 'in', 'this', 'case', 'accurate', 'description', 'of', 'interparticle', 'correlations', 'is', 'very', 'important', 'since', 'it', 'is', 'believed', 'that', 'they', 'can', 'be', 'utilized', 'by', 'quantum', 'engineers', 'in', 'quantum', 'metrology', 'quantum', 'thermometry', 'quantum', 'heat', 'engines', 'it', 'etc', 'unfortunately', 'a', 'theoretical', 'description', 'of', 'these', 'correlations', 'is', 'very', 'challenging', 'since', 'they', 'are', 'far', 'beyond', 'any', 'variational', 'approaches', 'by', 'contrast', 'the', 'exact', 'manybody', 'description', 'rapidly', 'hits', 'numerical', 'limitations', 'due', 'to', 'an', 'exponential', 'increase', 'of', 'the', 'manybody', 'hilbert', 'space', 'in', 'this', 'work', 'we', 'brush', 'up', 'a', 'very', 'effective', 'method', 'of', 'constructing', 'a', 'manybody', 'basis', 'which', 'originates', 'in', 'the', 'physical', 'argumentation', 'we', 'show', 'that', 'in', 'contrast', 'to', 'the', 'commonly', 'used', 'approach', 'of', 'a', 'straightforward', 'cutoff', 'it', 'enables', 'one', 'to', 'perform', 'exact', 'calculations', 'with', 'very', 'limited', 'numerical', 'resources', 'as', 'examples', 'we', 'study', 'quantum', 'correlations', 'in', 'systems', 'of', 'spinless', 'bosons', 'and', 'twocomponent', 'mixtures', 'of', 'fermions', 'confined', 'in', 'a', 'onedimensional', 'harmonic', 'trap', 'being', 'far', 'from', 'the', 'perturbative', 'regime']]
|
[-0.0883679436600962, 0.16591731922473923, -0.10280533235650076, 0.10282231925047262, -0.02138183331441914, -0.17527787783183157, 0.049993035845122796, 0.3616277214009748, -0.2390664604080971, -0.27399787640329015, 0.04615928971501024, -0.2933033528185428, -0.14299202996555196, 0.23860425301042365, -0.03455294660011003, 0.11916806601356109, 0.09072827790636397, 0.00953849961677956, -0.07646964673023281, -0.2253159167039273, 0.2615378617679939, 0.07208229896076414, 0.2652310234830217, 0.09039013922961732, 0.04543338277442164, -0.01090737719895578, 0.02797987449577154, 0.011144438452394625, -0.12751381877895382, 0.14061072261917384, 0.32151696689123677, 0.028535664571600772, 0.2862037734215169, -0.4539123068043832, -0.2378256939362388, 0.07385793218845509, 0.18458005549050435, 0.20086518568081543, -0.04435917901871509, -0.27710861754522464, -0.009182557810184568, -0.19728248788119662, -0.1360625850448255, -0.1513410386152912, 0.012207349521706292, -0.014925746932127622, -0.20779536100548454, 0.06778646791052631, 0.07083194775217169, 0.07270999151909945, 0.0019111628562948385, -0.039646003801418944, 0.09085908386149703, 0.09616966036129418, 0.006428470124076337, 0.04043002859882193, 0.1395582375333233, -0.17690960816710072, -0.11442342392699577, 0.4207075438570491, -0.047199980187606135, -0.1953492236098946, 0.2673037558804851, -0.12861809763938276, -0.12993696452454165, 0.12002023357727434, 0.1342910291531616, 0.10984306470328552, -0.1641342846113582, 0.11924020019813365, -0.033897291927132756, 0.15567208119166534, 0.028270606633795554, 0.07632504590126404, 0.22162930436587525, 0.16210734377463543, 0.033628366297032405, 0.13719115974340956, -0.04065330422261383, -0.1822481385410525, -0.27117414457444644, -0.14125363010468792, -0.25623907757175785, 0.07662282785174263, -0.0178015194534626, -0.1863054993730255, 0.3618135748696405, 0.1953395905384664, 0.17288195567887796, -0.01838691684290182, 0.3032828734166985, 0.12135694951541874, 0.06521363733444623, 0.04295681102612011, 0.251769387515852, 0.15203785225153402, 0.09754021462258818, -0.21117557460634406, 0.004013833560748026, 0.04696694412404065]
|
1,803.08388
|
Black-hole stability in non-local gravity
|
We prove that Ricci-flat vacuum exact solutions are stable under linear
perturbations in a new class of weakly non-local gravitational theories finite
at the quantum level.
|
gr-qc hep-th
|
we prove that ricciflat vacuum exact solutions are stable under linear perturbations in a new class of weakly nonlocal gravitational theories finite at the quantum level
|
[['we', 'prove', 'that', 'ricciflat', 'vacuum', 'exact', 'solutions', 'are', 'stable', 'under', 'linear', 'perturbations', 'in', 'a', 'new', 'class', 'of', 'weakly', 'nonlocal', 'gravitational', 'theories', 'finite', 'at', 'the', 'quantum', 'level']]
|
[-0.211510275490582, 0.21320782275870442, -0.06055911582034941, 0.10956441360310866, -0.06030412627240786, -0.1765425332571165, -0.06818694453865576, 0.2803344458628159, -0.23637779594327396, -0.1436768450702612, 0.07414764010508616, -0.25885957264556336, -0.15672818012535572, 0.15946870007050726, -0.027717360474455815, 0.12611184767089212, 0.05910645317859375, 0.06641859238824019, -0.12473125577581903, -0.289529671605963, 0.412222538716518, -0.014575261645054875, 0.2760390481696679, 0.020355722676658142, 0.17033530606959874, -0.0908188360134283, 0.08278213763752809, 0.09169171872333838, -0.16037481927560293, 0.059007745379438765, 0.27159724356058107, 0.049356836780834086, 0.2739257216453552, -0.435863782866643, -0.21964229749909675, 0.12134942383720325, 0.029805854410649493, 0.24932217279162544, -0.06394035313188887, -0.33462694695649237, 0.2155125682385495, -0.1473829120111007, -0.2081919069079539, -0.12256860446471435, -0.003001250899755038, -0.018730674153910234, -0.24999469676269934, 0.09662222907914278, 0.055798462305504545, -0.0029691124263291177, -0.09889719925390986, 0.0004520239666677438, 0.004019944337554849, -0.004199090360019069, 0.0259260474346005, -0.0662898633286554, 0.0804805069660338, -0.1680045692035212, -0.10345569890565597, 0.3508981179374342, -0.20430355776961034, -0.28462708827394706, 0.18467067063857728, -0.15234411848135865, -0.19634481584832358, 0.13770543900318444, 0.134544287288848, 0.2611882741777943, -0.1090797269448208, 0.24490949411231738, -0.031896237283945084, 0.1284160163396826, 0.12328529624769893, 0.11169436385926719, 0.2569576687573527, 0.03464731758532043, 0.19154477617345178, 0.1427973351942805, 0.054459214210510254, -0.14579886566990843, -0.4391368653338689, -0.09756979261650346, -0.0851026507667624, 0.14744861367552614, -0.1346447173720942, -0.26200434078390783, 0.3705946844644271, 0.05456103266288455, 0.051857196188603454, 0.15516934060276702, 0.1536946968676952, 0.13037478648430595, -0.03127404975776489, 0.10711153138142365, 0.3046259658518605, 0.12648662487761334, 0.025584101497840423, -0.21630390274983186, -0.06323562763505973, 0.1497179485606746]
|
1,803.08389
|
Holographic Charged Fluid with Chiral Electric Separation Effect
|
Hydrodynamics with both vector and axial currents is under study within a
holographic model, consisting of canonical $U(1)_V\times U(1)_A$ gauge fields
in an asymptotically AdS$_5$ black brane. When gravitational back-reaction is
taken into account, the chiral electric separation effect (CESE), namely the
generation of an axial current as the response to an external electric field,
is realized naturally. Via fluid/gravity correspondence, all the first order
transport coefficients in the hydrodynamic constitutive relations are evaluated
analytically: they are functions of vector chemical potential $\mu$, axial
chemical potential $\mu_5$ and the fluid's temperature $T$. Apart from the
proportionality factor $\mu\mu_5$, the CESE conductivity is found to be
dependent on the dimensionless quantities $\mu/T$ and $\mu_5/T$ nontrivially.
As a complementary study, frequency-dependent transport phenomena are revealed
through linear response analysis, demonstrating perfect agreement with the
results obtained from fluid/gravity correspondence.
|
hep-th cond-mat.str-el gr-qc nucl-th
|
hydrodynamics with both vector and axial currents is under study within a holographic model consisting of canonical u1_vtimes u1_a gauge fields in an asymptotically ads_5 black brane when gravitational backreaction is taken into account the chiral electric separation effect cese namely the generation of an axial current as the response to an external electric field is realized naturally via fluidgravity correspondence all the first order transport coefficients in the hydrodynamic constitutive relations are evaluated analytically they are functions of vector chemical potential mu axial chemical potential mu_5 and the fluids temperature t apart from the proportionality factor mumu_5 the cese conductivity is found to be dependent on the dimensionless quantities mut and mu_5t nontrivially as a complementary study frequencydependent transport phenomena are revealed through linear response analysis demonstrating perfect agreement with the results obtained from fluidgravity correspondence
|
[['hydrodynamics', 'with', 'both', 'vector', 'and', 'axial', 'currents', 'is', 'under', 'study', 'within', 'a', 'holographic', 'model', 'consisting', 'of', 'canonical', 'u1_vtimes', 'u1_a', 'gauge', 'fields', 'in', 'an', 'asymptotically', 'ads_5', 'black', 'brane', 'when', 'gravitational', 'backreaction', 'is', 'taken', 'into', 'account', 'the', 'chiral', 'electric', 'separation', 'effect', 'cese', 'namely', 'the', 'generation', 'of', 'an', 'axial', 'current', 'as', 'the', 'response', 'to', 'an', 'external', 'electric', 'field', 'is', 'realized', 'naturally', 'via', 'fluidgravity', 'correspondence', 'all', 'the', 'first', 'order', 'transport', 'coefficients', 'in', 'the', 'hydrodynamic', 'constitutive', 'relations', 'are', 'evaluated', 'analytically', 'they', 'are', 'functions', 'of', 'vector', 'chemical', 'potential', 'mu', 'axial', 'chemical', 'potential', 'mu_5', 'and', 'the', 'fluids', 'temperature', 't', 'apart', 'from', 'the', 'proportionality', 'factor', 'mumu_5', 'the', 'cese', 'conductivity', 'is', 'found', 'to', 'be', 'dependent', 'on', 'the', 'dimensionless', 'quantities', 'mut', 'and', 'mu_5t', 'nontrivially', 'as', 'a', 'complementary', 'study', 'frequencydependent', 'transport', 'phenomena', 'are', 'revealed', 'through', 'linear', 'response', 'analysis', 'demonstrating', 'perfect', 'agreement', 'with', 'the', 'results', 'obtained', 'from', 'fluidgravity', 'correspondence']]
|
[-0.1769025173955871, 0.19382486330387644, -0.06952296196729602, 0.02976389927447171, -0.07323922319954042, -0.11555282000849462, -0.03728305538071949, 0.3403844031974372, -0.2370478742865517, -0.2399318745935007, 0.023740618886008365, -0.28381954792541153, -0.1348912827876013, 0.14704988853533424, 0.04238222069997231, 0.024739573466564146, -0.05996235568240723, 0.03581488838501494, -0.07458702288996018, -0.1937045440872145, 0.29228219031424757, 0.031757162131458135, 0.3276302938705639, 0.09215396912965362, 0.09652448358931853, 0.006022837143117452, 0.002404357690144988, 0.09872507460086662, -0.13110745118191355, 0.004482856972197837, 0.19950227740713777, -0.019560453930513606, 0.12562656782992074, -0.4362445649047218, -0.2426818224039915, 0.05401736263678793, 0.11523279154960833, 0.12809760738780504, -0.04959163139317431, -0.25425599529134, 0.02894527792598049, -0.159192289076814, -0.13267288248564857, -0.12046631341389216, 0.02241296176404884, -0.008401262447210577, -0.3185183935326195, 0.12559301171602463, -0.010312844248426914, 0.05600970915368046, -0.11529734976904686, -0.11761543831979747, -0.07532270311939475, 0.09174735684813212, 0.1358336460869877, 0.08128187126096557, 0.19144158982046922, -0.1821321177001878, -0.08613693249507752, 0.3935383889509146, -0.10884713127555135, -0.22995537351679934, 0.13225673819696943, -0.1589353548376547, -0.05296475287040641, 0.09047826154239695, 0.12427530766666785, 0.11315834278973531, -0.20654867370221303, 0.12780402138057123, -0.010925071515992065, 0.12961998203964492, 0.08141130484085914, 0.009998920864478244, 0.3075371733524234, 0.1216471361617818, -0.020103134975001654, 0.13877901180753457, -0.021623809827039677, -0.10071335892494329, -0.3577254166388336, -0.11366193906938218, -0.14987809213840486, 0.09441829622151357, -0.15436919698089802, -0.13799321748699775, 0.3399028668885448, 0.1290776840657653, 0.18445356429198428, 0.009205192512394312, 0.2731507693704985, 0.13090051366752425, 0.07095289699431948, 0.05783919683958897, 0.2840728353202233, 0.21365887135513784, 0.12915131996166618, -0.3034033628543565, -0.04095418078770094, 0.10645249655798954]
|
1,803.0839
|
Large large-trader activity weakens the long memory of limit order
markets
|
Using more than 6.7 billions of trades, we explore how the tick-by-tick
dynamics of limit order books depends on the aggregate actions of large
investment funds on a much larger (quarterly) timescale. In particular, we find
that the well-established long memory of market order signs is markedly weaker
when large investment funds trade either in a directional way and even weaker
when their aggregate participation ratio is large. Conversely, we investigate
to what respect a weaker memory of market order signs predicts that an asset is
being actively traded by large funds. Theoretical arguments suggest two simple
mechanisms that contribute to the observed effect: a larger number of active
meta-orders and a modification of the distribution of size of meta-orders.
Empirical evidence suggests that the number of active meta-orders is the most
important contributor to the loss of market order sign memory.
|
q-fin.ST
|
using more than 67 billions of trades we explore how the tickbytick dynamics of limit order books depends on the aggregate actions of large investment funds on a much larger quarterly timescale in particular we find that the wellestablished long memory of market order signs is markedly weaker when large investment funds trade either in a directional way and even weaker when their aggregate participation ratio is large conversely we investigate to what respect a weaker memory of market order signs predicts that an asset is being actively traded by large funds theoretical arguments suggest two simple mechanisms that contribute to the observed effect a larger number of active metaorders and a modification of the distribution of size of metaorders empirical evidence suggests that the number of active metaorders is the most important contributor to the loss of market order sign memory
|
[['using', 'more', 'than', '67', 'billions', 'of', 'trades', 'we', 'explore', 'how', 'the', 'tickbytick', 'dynamics', 'of', 'limit', 'order', 'books', 'depends', 'on', 'the', 'aggregate', 'actions', 'of', 'large', 'investment', 'funds', 'on', 'a', 'much', 'larger', 'quarterly', 'timescale', 'in', 'particular', 'we', 'find', 'that', 'the', 'wellestablished', 'long', 'memory', 'of', 'market', 'order', 'signs', 'is', 'markedly', 'weaker', 'when', 'large', 'investment', 'funds', 'trade', 'either', 'in', 'a', 'directional', 'way', 'and', 'even', 'weaker', 'when', 'their', 'aggregate', 'participation', 'ratio', 'is', 'large', 'conversely', 'we', 'investigate', 'to', 'what', 'respect', 'a', 'weaker', 'memory', 'of', 'market', 'order', 'signs', 'predicts', 'that', 'an', 'asset', 'is', 'being', 'actively', 'traded', 'by', 'large', 'funds', 'theoretical', 'arguments', 'suggest', 'two', 'simple', 'mechanisms', 'that', 'contribute', 'to', 'the', 'observed', 'effect', 'a', 'larger', 'number', 'of', 'active', 'metaorders', 'and', 'a', 'modification', 'of', 'the', 'distribution', 'of', 'size', 'of', 'metaorders', 'empirical', 'evidence', 'suggests', 'that', 'the', 'number', 'of', 'active', 'metaorders', 'is', 'the', 'most', 'important', 'contributor', 'to', 'the', 'loss', 'of', 'market', 'order', 'sign', 'memory']]
|
[-0.1422547015851744, 0.1437454453841037, -0.07341698192479745, 0.15242662904193807, -0.10523173254652238, -0.10668095233063148, 0.10346662729091509, 0.38888707148357177, -0.22844283921216962, -0.3218104650555867, 0.1230574889767679, -0.3093379189220952, -0.12946624261766515, 0.1745496809574395, -0.08143042878274032, -0.041451823742712626, 0.027914967137047837, 0.019160895978926982, 0.041405929431227416, -0.30125044461365946, 0.27947958561585245, 0.09438643329711237, 0.2885582514736854, 0.04607584964464301, 0.07167633015557494, -0.021396938645818705, -0.06747644687027173, 0.03259620982432135, -0.09934352862121518, 0.15391967057834158, 0.19435555094846485, 0.08911430778663973, 0.38329631875229764, -0.46650870509025916, -0.11975695040654129, 0.159504692316134, 0.08312961035104743, 0.0385378891090587, 0.011935348194039224, -0.1811905859815429, 0.0648359459391172, -0.24446227475607268, -0.10376015959084559, -0.06660054030854412, 0.10032498835533543, 0.004557735440780369, -0.2587741849784949, 0.06656347803400935, 0.06499579562608834, 0.058054575453919004, -0.03544636457645282, -0.11901075026991081, -0.03370327627758535, 0.1420090497642736, 0.15806412650928112, -0.03343699845931375, 0.16276034139241027, -0.15659567065582886, -0.12565707678014648, 0.37932082680119594, -0.08279758252576075, -0.11803989227575559, 0.15711566609081248, -0.19237922455928563, -0.08234924274745961, 0.13226998508596322, 0.21839189555325453, 0.06012454455387188, -0.13298323991627295, -0.014819157651697718, -0.07031022179970177, 0.2791534202004468, 0.05242610592919756, 0.04789240605568408, 0.19090814377561632, 0.18345538008151394, 0.12785904488893568, 0.12666408820602465, -0.07200165853415891, -0.14867143552999576, -0.22148108479081535, -0.12448701627788619, -0.16452707307541115, 0.08095384737178289, -0.16159851692307864, -0.13981315477843015, 0.3433062364150521, 0.17056111396867518, 0.1612476527258019, 0.08842508736702705, 0.2576154757186141, 0.10318649361815146, 0.12053774426278041, 0.087960901929223, 0.22847389164839832, -0.00537464532404351, 0.1147808048769202, -0.20853650932934817, 0.21062790928736433, -0.0260860217312141]
|
1,803.08391
|
Compactifications of the moduli spaces of Newton maps
|
We study various compactifications of moduli space of Newton maps. Mainly, we
focus on GIT compactifiaction and Deligne-Mumford compactification. Then we
explore the relations among these compactifications.
|
math.DS
|
we study various compactifications of moduli space of newton maps mainly we focus on git compactifiaction and delignemumford compactification then we explore the relations among these compactifications
|
[['we', 'study', 'various', 'compactifications', 'of', 'moduli', 'space', 'of', 'newton', 'maps', 'mainly', 'we', 'focus', 'on', 'git', 'compactifiaction', 'and', 'delignemumford', 'compactification', 'then', 'we', 'explore', 'the', 'relations', 'among', 'these', 'compactifications']]
|
[-0.19524374704521436, 0.05837182682723953, -0.10790424675752337, 0.22840054286643863, -0.1388255013152957, -0.048940439672710806, 0.05058734006105134, 0.3601842498263487, -0.33114079013466835, -0.1943222225840705, 0.19865607464900956, -0.23082011039010608, -0.21149082546337292, 0.21597688258267367, -0.24647261630385542, -0.03242937337535505, -0.030333115468518093, -0.12337772999531947, -0.13332956234136453, -0.3858417489145023, 0.6061587053566024, -0.07483362739619154, 0.3157975146403679, -0.003831386064680723, 0.07999809731084567, -0.062424583602338456, -0.13578984735963437, -0.04159716529382142, -0.28683918399306446, 0.25069260081419575, 0.27087957612597025, 0.12193735192816418, 0.03852732250323662, -0.44226021663500714, -0.16595557127864316, 0.2553087230055378, 0.11118687525427398, 0.046309589909819454, 0.09273754831743784, -0.2444238934952479, 0.044181794429627747, -0.10152766676261447, -0.06500982593458432, -0.18907341833871144, 0.004018892498257069, 0.07734673702193853, -0.05794783426860634, -0.19805005224994743, -0.043659175817783065, 0.17295788661935008, -0.14501824122495377, -0.07339077715117198, -0.11262090271786572, 0.0047853287094487594, 0.1396613807345812, 0.0026563856338795563, 0.13067352562211454, -0.16652322804125455, -0.041694543593061656, 0.3622365671281631, -0.08404513448476791, -0.16827184278876162, 0.16010371466668752, -0.14599536968251833, -0.24563791545537803, 0.02002598440202956, 0.17652165538703019, 0.23590531121366298, 0.010192660722308435, 0.26998407794655155, -0.065479547645037, 0.08912310858543676, 0.12762207888926452, 0.024540608359250024, 0.18787301883388025, 0.1641051203299027, 0.0502056646017501, 0.15334654266301256, -0.09045552524129072, -0.08747368922027257, -0.44519979571207213, -0.1480967729853896, 0.01006453219228066, 0.15126554768245953, -0.18163690033599358, -0.14054620212230545, 0.4064439092225467, 0.09111194164394804, 0.24461003865760106, 0.0724673092436905, 0.1719691910279485, -0.06146891920182567, -0.010639528457361918, 0.004970400961330877, 0.18530226140641248, 0.14944450804390585, -0.01956112394467569, -0.1700880266009615, -0.19199382051682243, 0.3115160595625639]
|
1,803.08392
|
On the Invariance of G\"odel's Second Theorem with regard to Numberings
|
The prevalent interpretation of G\"odel's Second Theorem states that a
sufficiently adequate and consistent theory does not prove its consistency. It
is however not entirely clear how to justify this informal reading, as the
formulation of the underlying mathematical theorem depends on several arbitrary
formalisation choices. In this paper I examine the theorem's dependency
regarding G\"odel numberings. I introduce deviant numberings, yielding
provability predicates satisfying L\"ob's conditions, which result in provable
consistency sentences. According to the main result of this paper however,
these "counterexamples" do not refute the theorem's prevalent interpretation,
since once a natural class of admissible numberings is singled out, invariance
is maintained.
|
math.LO
|
the prevalent interpretation of godels second theorem states that a sufficiently adequate and consistent theory does not prove its consistency it is however not entirely clear how to justify this informal reading as the formulation of the underlying mathematical theorem depends on several arbitrary formalisation choices in this paper i examine the theorems dependency regarding godel numberings i introduce deviant numberings yielding provability predicates satisfying lobs conditions which result in provable consistency sentences according to the main result of this paper however these counterexamples do not refute the theorems prevalent interpretation since once a natural class of admissible numberings is singled out invariance is maintained
|
[['the', 'prevalent', 'interpretation', 'of', 'godels', 'second', 'theorem', 'states', 'that', 'a', 'sufficiently', 'adequate', 'and', 'consistent', 'theory', 'does', 'not', 'prove', 'its', 'consistency', 'it', 'is', 'however', 'not', 'entirely', 'clear', 'how', 'to', 'justify', 'this', 'informal', 'reading', 'as', 'the', 'formulation', 'of', 'the', 'underlying', 'mathematical', 'theorem', 'depends', 'on', 'several', 'arbitrary', 'formalisation', 'choices', 'in', 'this', 'paper', 'i', 'examine', 'the', 'theorems', 'dependency', 'regarding', 'godel', 'numberings', 'i', 'introduce', 'deviant', 'numberings', 'yielding', 'provability', 'predicates', 'satisfying', 'lobs', 'conditions', 'which', 'result', 'in', 'provable', 'consistency', 'sentences', 'according', 'to', 'the', 'main', 'result', 'of', 'this', 'paper', 'however', 'these', 'counterexamples', 'do', 'not', 'refute', 'the', 'theorems', 'prevalent', 'interpretation', 'since', 'once', 'a', 'natural', 'class', 'of', 'admissible', 'numberings', 'is', 'singled', 'out', 'invariance', 'is', 'maintained']]
|
[-0.10713343791929739, 0.06364636795506591, -0.13920994919414323, 0.1755373671118702, -0.17571309821547143, -0.16747867804286734, 0.09157231548202358, 0.291583322485288, -0.2528385899913874, -0.26950393110691084, 0.11110894411713594, -0.19920943169632838, -0.13730444789731078, 0.13567360731041325, -0.20721286214178516, -0.0037422671387459905, 0.06382710624131419, 0.029091121238611992, -0.04551967712607057, -0.26253829694441744, 0.3412825032869088, -0.004406627240435531, 0.30056096935600396, 0.10008136356870333, 0.10800177302832405, 0.01568970371126419, -0.07217094674706459, 0.03867008578457726, -0.14271936251905226, 0.09722349778250126, 0.3174577110136549, 0.2259343401595418, 0.31363864778762773, -0.4109783810696432, -0.1176403020552936, 0.11591858691757634, 0.11254252127948261, 0.09152451791867082, 0.026858233342257638, -0.26553134256530375, 0.11304469965841799, -0.1266074798114243, -0.14969433238175475, -0.1154447912992466, 0.038395754992961884, -0.024895735149316135, -0.19189326891653416, 0.05473389881441281, 0.29664073889808995, 0.10760012235315074, -0.0524002550901579, -0.06423376978685459, -0.005481711850457248, 0.04750750691940387, 0.0811330277250991, 0.019679789983534385, 0.0696746077255479, -0.07872524101154081, -0.14191802989336708, 0.36494829589057537, 0.01235888042609163, -0.20067877803175221, 0.19803012013657106, -0.07969067060344276, -0.23755770915498337, 0.041261886676684734, 0.025721762347079458, 0.12077740062737749, -0.14492078824412255, 0.11501731020121259, -0.11861250829838571, 0.19877119209794772, 0.15342232212424278, 0.09307912506961397, 0.1971406799519346, 0.0812870805683945, 0.017521941870273578, 0.09334642988230502, 0.08640220071455197, -0.12363039442598597, -0.4027092737278768, -0.13682357755966396, -0.14137616511434317, 0.06209559534230114, -0.07865069471729276, -0.22426695876887867, 0.3304877825081348, 0.23911619016989355, 0.12464110811762068, 0.1392738820375165, 0.2508466129324266, 0.10442842466734527, 0.032925557897293144, 0.049116186753270175, 0.21461767577344462, 0.16070494247334344, 0.10154899310409313, -0.10375944052495817, 0.15331124164430157, 0.1075381985843359]
|
1,803.08393
|
Calibrating Model-Based Inferences and Decisions
|
As the frontiers of applied statistics progress through increasingly complex
experiments we must exploit increasingly sophisticated inferential models to
analyze the observations we make. In order to avoid misleading or outright
erroneous inferences we then have to be increasingly diligent in scrutinizing
the consequences of those modeling assumptions. Fortunately model-based methods
of statistical inference naturally define procedures for quantifying the scope
of inferential outcomes and calibrating corresponding decision making
processes. In this paper I review the construction and implementation of the
particular procedures that arise within frequentist and Bayesian methodologies.
|
stat.ME
|
as the frontiers of applied statistics progress through increasingly complex experiments we must exploit increasingly sophisticated inferential models to analyze the observations we make in order to avoid misleading or outright erroneous inferences we then have to be increasingly diligent in scrutinizing the consequences of those modeling assumptions fortunately modelbased methods of statistical inference naturally define procedures for quantifying the scope of inferential outcomes and calibrating corresponding decision making processes in this paper i review the construction and implementation of the particular procedures that arise within frequentist and bayesian methodologies
|
[['as', 'the', 'frontiers', 'of', 'applied', 'statistics', 'progress', 'through', 'increasingly', 'complex', 'experiments', 'we', 'must', 'exploit', 'increasingly', 'sophisticated', 'inferential', 'models', 'to', 'analyze', 'the', 'observations', 'we', 'make', 'in', 'order', 'to', 'avoid', 'misleading', 'or', 'outright', 'erroneous', 'inferences', 'we', 'then', 'have', 'to', 'be', 'increasingly', 'diligent', 'in', 'scrutinizing', 'the', 'consequences', 'of', 'those', 'modeling', 'assumptions', 'fortunately', 'modelbased', 'methods', 'of', 'statistical', 'inference', 'naturally', 'define', 'procedures', 'for', 'quantifying', 'the', 'scope', 'of', 'inferential', 'outcomes', 'and', 'calibrating', 'corresponding', 'decision', 'making', 'processes', 'in', 'this', 'paper', 'i', 'review', 'the', 'construction', 'and', 'implementation', 'of', 'the', 'particular', 'procedures', 'that', 'arise', 'within', 'frequentist', 'and', 'bayesian', 'methodologies']]
|
[0.003290348463795251, 0.03536960667180311, -0.11929883609215418, 0.15583176619450873, -0.15276198517531156, -0.13747640122762986, 0.07898080337715024, 0.39832435559947044, -0.2398314012945371, -0.32511315959402254, 0.16937967117798206, -0.22475885027605627, -0.1640863470448595, 0.1900061113268344, -0.12950229758345005, 0.09352631682219605, 0.10018020000619193, -0.0539740113231043, -0.08329610039945692, -0.24009992712073855, 0.29868636969476936, 0.09172013203303019, 0.2939683652896848, -0.0043297278953509195, 0.051340537557067974, 0.03184904694143269, -0.13094215128415573, 0.03641992629208188, -0.16669824760602853, 0.16793138588157794, 0.3656169283325451, 0.24633038934423693, 0.3712832699840268, -0.46572197259714204, -0.20538744773010775, 0.13960541119385098, 0.1639862296378447, 0.12969108411214417, 0.02450416287303799, -0.2806502204595341, 0.03974155693108009, -0.19083350566733215, -0.09255831214573441, -0.16291799671792737, -0.022147442914623148, -0.0002870243146187729, -0.2667307046552499, 0.03246467486800005, 0.05678085160648657, 0.09724009909874035, 0.02245401463781794, -0.13229370933646958, 0.056206647404259354, 0.10140888032037765, 0.11703865273545186, -0.051335594704788594, 0.1328546189961748, -0.16353362563790547, -0.1673223838261846, 0.3569549013032681, 0.02617967312819221, -0.20155370207244738, 0.19209299560429322, -0.07750086324910323, -0.23315973807669554, 0.03635820255925258, 0.2168557011625833, 0.07554582513920549, -0.17584615513785845, 0.06134438809046212, 0.08216561261150572, 0.10807961404789239, 0.02955453051512854, 0.006680897918219368, 0.2084902967998965, 0.17335246728681442, 0.003867160935058362, 0.0635900493646558, -0.07282499529214369, -0.12656926681261715, -0.2777816859177417, -0.12395052518986631, -0.08805946002248674, 0.017571892340977988, -0.0716412300239123, -0.18594293847887053, 0.32378872581757606, 0.3324980378771822, 0.17643170670813157, 0.04845833122316334, 0.32673507201123153, 0.08525687331889963, 0.017107928497716786, 0.022411049250513314, 0.22147260407606761, 0.12318816287960443, 0.05690378200055824, -0.11176263712760474, 0.1521527559755163, -0.0318171265328096]
|
1,803.08394
|
Found a good match: should I keep searching? - Accuracy and Performance
in Iris Matching Using 1-to-First Search
|
Iris recognition is used in many applications around the world, with
enrollment sizes as large as over one billion persons in India's Aadhaar
program. Large enrollment sizes can require special optimizations in order to
achieve fast database searches. One such optimization that has been used in
some operational scenarios is 1:First search. In this approach, instead of
scanning the entire database, the search is terminated when the first
sufficiently good match is found. This saves time, but ignores potentially
better matches that may exist in the unexamined portion of the enrollments. At
least one prominent and successful border-crossing program used this approach
for nearly a decade, in order to allow users a fast "token-free" search. Our
work investigates the search accuracy of 1:First and compares it to the
traditional 1:N search. Several different scenarios are considered trying to
emulate real environments as best as possible: a range of enrollment sizes,
closed- and open-set configurations, two iris matchers, and different
permutations of the galleries. Results confirm the expected accuracy
degradation using 1:First search, and also allow us to identify acceptable
working parameters where significant search time reduction is achieved, while
maintaining accuracy similar to 1:N search.
|
cs.CV
|
iris recognition is used in many applications around the world with enrollment sizes as large as over one billion persons in indias aadhaar program large enrollment sizes can require special optimizations in order to achieve fast database searches one such optimization that has been used in some operational scenarios is 1first search in this approach instead of scanning the entire database the search is terminated when the first sufficiently good match is found this saves time but ignores potentially better matches that may exist in the unexamined portion of the enrollments at least one prominent and successful bordercrossing program used this approach for nearly a decade in order to allow users a fast tokenfree search our work investigates the search accuracy of 1first and compares it to the traditional 1n search several different scenarios are considered trying to emulate real environments as best as possible a range of enrollment sizes closed and openset configurations two iris matchers and different permutations of the galleries results confirm the expected accuracy degradation using 1first search and also allow us to identify acceptable working parameters where significant search time reduction is achieved while maintaining accuracy similar to 1n search
|
[['iris', 'recognition', 'is', 'used', 'in', 'many', 'applications', 'around', 'the', 'world', 'with', 'enrollment', 'sizes', 'as', 'large', 'as', 'over', 'one', 'billion', 'persons', 'in', 'indias', 'aadhaar', 'program', 'large', 'enrollment', 'sizes', 'can', 'require', 'special', 'optimizations', 'in', 'order', 'to', 'achieve', 'fast', 'database', 'searches', 'one', 'such', 'optimization', 'that', 'has', 'been', 'used', 'in', 'some', 'operational', 'scenarios', 'is', '1first', 'search', 'in', 'this', 'approach', 'instead', 'of', 'scanning', 'the', 'entire', 'database', 'the', 'search', 'is', 'terminated', 'when', 'the', 'first', 'sufficiently', 'good', 'match', 'is', 'found', 'this', 'saves', 'time', 'but', 'ignores', 'potentially', 'better', 'matches', 'that', 'may', 'exist', 'in', 'the', 'unexamined', 'portion', 'of', 'the', 'enrollments', 'at', 'least', 'one', 'prominent', 'and', 'successful', 'bordercrossing', 'program', 'used', 'this', 'approach', 'for', 'nearly', 'a', 'decade', 'in', 'order', 'to', 'allow', 'users', 'a', 'fast', 'tokenfree', 'search', 'our', 'work', 'investigates', 'the', 'search', 'accuracy', 'of', '1first', 'and', 'compares', 'it', 'to', 'the', 'traditional', '1n', 'search', 'several', 'different', 'scenarios', 'are', 'considered', 'trying', 'to', 'emulate', 'real', 'environments', 'as', 'best', 'as', 'possible', 'a', 'range', 'of', 'enrollment', 'sizes', 'closed', 'and', 'openset', 'configurations', 'two', 'iris', 'matchers', 'and', 'different', 'permutations', 'of', 'the', 'galleries', 'results', 'confirm', 'the', 'expected', 'accuracy', 'degradation', 'using', '1first', 'search', 'and', 'also', 'allow', 'us', 'to', 'identify', 'acceptable', 'working', 'parameters', 'where', 'significant', 'search', 'time', 'reduction', 'is', 'achieved', 'while', 'maintaining', 'accuracy', 'similar', 'to', '1n', 'search']]
|
[-0.0936432234479652, 0.031102695607354614, -0.05250577335533945, 0.09048704779106817, -0.08138037792445381, -0.1705392041968508, 0.05173553657938832, 0.3836372185488875, -0.21085260492106228, -0.4137823656393388, 0.12277446414965694, -0.26535822377664986, -0.09203282967731885, 0.2214254288689339, -0.084219223735662, 0.08079501434911004, 0.07977584158382427, 0.053239981054578014, -0.04506831834141943, -0.3065686953762911, 0.20275780972400584, 0.0972818543308789, 0.2709327534935677, 0.001180526879664088, 0.046678331997437573, -0.030868523919801275, -0.03998702400188159, 0.004181093339491444, -0.07143742602941708, 0.08163296033090614, 0.3376455751869386, 0.17712705876779042, 0.2950047827709812, -0.3846745981364367, -0.16406322432413084, 0.13571454403134658, 0.16924269460429697, 0.0974232426523645, -0.04951353209482064, -0.2558347368228835, 0.0970016908015787, -0.16224568304077713, -0.08346866297333971, -0.10149832516430082, 0.005392886863417741, -0.010620774006046182, -0.264894336212388, -0.006130656843300496, 0.0023860828646836136, 0.03672642434692759, -0.020809997524826106, -0.12983276294295307, 0.04042484112367149, 0.1991395834569649, 0.061326952644842246, 0.05139991096412936, 0.1033321801457823, -0.12312335346839823, -0.14934989906302606, 0.416464986068379, -0.057270397739988974, -0.13220101859079694, 0.2405548481163857, -0.11677069575693842, -0.1437080704640674, 0.15630380714914674, 0.2020117970754767, 0.14265073175522855, -0.14615364728854627, 0.03748617007621545, -0.02705803620220959, 0.20094736599958665, 0.10496913339071379, 0.02328031189912527, 0.180492871334133, 0.2199638704325255, 0.06721623732735998, 0.13283358608281298, -0.10278828262793112, -0.1023447529378339, -0.25177588858209626, -0.1375680700779806, -0.14614303883395552, -0.024975599010580593, -0.08145223360245546, -0.12532216540751404, 0.39496743786580785, 0.2188989584945975, 0.1805964262721599, 0.041119757127142796, 0.3066457430880094, 0.029367857915709353, 0.1475266201143182, 0.07471615096947812, 0.21085749378145227, -0.02638952718260362, 0.12028687804056447, -0.17075855418956914, 0.10365705908103318, -0.003579368663606109]
|
1,803.08395
|
Exploring the Referral and Usage of Science Fiction in HCI Literature
|
Research on science fiction (sci-fi) in scientific publications has indicated
the usage of sci-fi stories, movies or shows to inspire novel Human-Computer
Interaction (HCI) research. Yet no studies have analysed sci-fi in a top-ranked
computer science conference at present. For that reason, we examine the CHI
main track for the presence and nature of sci-fi referrals in relationship to
HCI research. We search for six sci-fi terms in a dataset of 5812 CHI main
proceedings and code the context of 175 sci-fi referrals in 83 papers indexed
in the CHI main track. In our results, we categorize these papers into five
contemporary HCI research themes wherein sci-fi and HCI interconnect: 1)
Theoretical Design Research; 2) New Interactions; 3) Human-Body Modification or
Extension; 4) Human-Robot Interaction and Artificial Intelligence; and 5)
Visions of Computing and HCI. In conclusion, we discuss results and
implications located in the promising arena of sci-fi and HCI research.
|
cs.HC
|
research on science fiction scifi in scientific publications has indicated the usage of scifi stories movies or shows to inspire novel humancomputer interaction hci research yet no studies have analysed scifi in a topranked computer science conference at present for that reason we examine the chi main track for the presence and nature of scifi referrals in relationship to hci research we search for six scifi terms in a dataset of 5812 chi main proceedings and code the context of 175 scifi referrals in 83 papers indexed in the chi main track in our results we categorize these papers into five contemporary hci research themes wherein scifi and hci interconnect 1 theoretical design research 2 new interactions 3 humanbody modification or extension 4 humanrobot interaction and artificial intelligence and 5 visions of computing and hci in conclusion we discuss results and implications located in the promising arena of scifi and hci research
|
[['research', 'on', 'science', 'fiction', 'scifi', 'in', 'scientific', 'publications', 'has', 'indicated', 'the', 'usage', 'of', 'scifi', 'stories', 'movies', 'or', 'shows', 'to', 'inspire', 'novel', 'humancomputer', 'interaction', 'hci', 'research', 'yet', 'no', 'studies', 'have', 'analysed', 'scifi', 'in', 'a', 'topranked', 'computer', 'science', 'conference', 'at', 'present', 'for', 'that', 'reason', 'we', 'examine', 'the', 'chi', 'main', 'track', 'for', 'the', 'presence', 'and', 'nature', 'of', 'scifi', 'referrals', 'in', 'relationship', 'to', 'hci', 'research', 'we', 'search', 'for', 'six', 'scifi', 'terms', 'in', 'a', 'dataset', 'of', '5812', 'chi', 'main', 'proceedings', 'and', 'code', 'the', 'context', 'of', '175', 'scifi', 'referrals', 'in', '83', 'papers', 'indexed', 'in', 'the', 'chi', 'main', 'track', 'in', 'our', 'results', 'we', 'categorize', 'these', 'papers', 'into', 'five', 'contemporary', 'hci', 'research', 'themes', 'wherein', 'scifi', 'and', 'hci', 'interconnect', '1', 'theoretical', 'design', 'research', '2', 'new', 'interactions', '3', 'humanbody', 'modification', 'or', 'extension', '4', 'humanrobot', 'interaction', 'and', 'artificial', 'intelligence', 'and', '5', 'visions', 'of', 'computing', 'and', 'hci', 'in', 'conclusion', 'we', 'discuss', 'results', 'and', 'implications', 'located', 'in', 'the', 'promising', 'arena', 'of', 'scifi', 'and', 'hci', 'research']]
|
[-0.07628001575473095, 0.05791075915361656, -0.025272493393506585, 0.039273834592390096, -0.13037774730841384, -0.13811049620639287, 0.0072367242920384, 0.37416792975885693, -0.15106834487156257, -0.41530366219874276, 0.0420317051658027, -0.3393320993115929, -0.1952550805259594, 0.22683578694398565, -0.07041336696343742, -0.045751255155712565, 0.061758156336222066, 0.03248823176966796, 0.011074156737059207, -0.2972014096709532, 0.24142739994816734, 0.034914257064596506, 0.2946029803891801, 0.14059930576752921, 6.7884041192500216e-06, 0.02080010879313034, -0.13458092624205165, -0.04650254109506741, -0.13351209617188656, 0.19163687356692544, 0.3569093029463578, 0.21767122149283655, 0.38800964217731043, -0.40522558383619117, -0.1443849545903504, 0.027578947685756965, 0.1494262368413681, 0.04321575051826106, -0.10612008941595712, -0.33014505967117946, 0.03895096486360815, -0.2117600057972595, -0.08275078422402178, -0.03612641575072255, 0.10410445399802963, -0.010441018468746302, -0.1662363163930805, -0.02790092765414891, 0.047502970659958295, 0.18762750688352084, -0.06458868898181735, -0.1861126487400677, 0.09946641875706662, 0.16038451369202353, 0.08979356331416823, 0.07564565600937624, 0.12939958689783357, -0.1882094527888847, -0.19560142092431257, 0.4090904866002108, -0.01495915553593812, -0.08037864908079714, 0.22681604735905575, -0.10394955980959103, -0.21700822565655567, 0.018238208985789435, 0.2553066192991345, 0.05522836694140815, -0.14210371725800397, 0.06214108489956217, 0.021118444441909606, 0.15223219620805284, 0.060607920714813336, -0.01942521325499432, 0.23774877137896655, 0.20074236937063306, -0.04076831422877915, 0.09392483933678657, -0.032623568664635776, -0.10969794789133103, -0.24088855693116784, -0.17380221568256324, -0.11781271171486496, -0.007403245492911849, 0.003469785572011269, -0.07203738012436875, 0.4137903287145922, 0.2505435892442045, 0.058192933490653034, -0.06430041017378435, 0.25359638154163566, -0.07596938191425961, 0.0734963753707952, 0.06235029214172085, 0.22543753256200275, 0.040349595938000436, 0.20126999219524136, -0.09887169372584474, 0.03457248325484168, -0.011061314367811735]
|
1,803.08396
|
Densely Connected Pyramid Dehazing Network
|
We propose a new end-to-end single image dehazing method, called Densely
Connected Pyramid Dehazing Network (DCPDN), which can jointly learn the
transmission map, atmospheric light and dehazing all together. The end-to-end
learning is achieved by directly embedding the atmospheric scattering model
into the network, thereby ensuring that the proposed method strictly follows
the physics-driven scattering model for dehazing. Inspired by the dense network
that can maximize the information flow along features from different levels, we
propose a new edge-preserving densely connected encoder-decoder structure with
multi-level pyramid pooling module for estimating the transmission map. This
network is optimized using a newly introduced edge-preserving loss function. To
further incorporate the mutual structural information between the estimated
transmission map and the dehazed result, we propose a joint-discriminator based
on generative adversarial network framework to decide whether the corresponding
dehazed image and the estimated transmission map are real or fake. An ablation
study is conducted to demonstrate the effectiveness of each module evaluated at
both estimated transmission map and dehazed result. Extensive experiments
demonstrate that the proposed method achieves significant improvements over the
state-of-the-art methods. Code will be made available at:
https://github.com/hezhangsprinter
|
cs.CV eess.IV
|
we propose a new endtoend single image dehazing method called densely connected pyramid dehazing network dcpdn which can jointly learn the transmission map atmospheric light and dehazing all together the endtoend learning is achieved by directly embedding the atmospheric scattering model into the network thereby ensuring that the proposed method strictly follows the physicsdriven scattering model for dehazing inspired by the dense network that can maximize the information flow along features from different levels we propose a new edgepreserving densely connected encoderdecoder structure with multilevel pyramid pooling module for estimating the transmission map this network is optimized using a newly introduced edgepreserving loss function to further incorporate the mutual structural information between the estimated transmission map and the dehazed result we propose a jointdiscriminator based on generative adversarial network framework to decide whether the corresponding dehazed image and the estimated transmission map are real or fake an ablation study is conducted to demonstrate the effectiveness of each module evaluated at both estimated transmission map and dehazed result extensive experiments demonstrate that the proposed method achieves significant improvements over the stateoftheart methods code will be made available at httpsgithubcomhezhangsprinter
|
[['we', 'propose', 'a', 'new', 'endtoend', 'single', 'image', 'dehazing', 'method', 'called', 'densely', 'connected', 'pyramid', 'dehazing', 'network', 'dcpdn', 'which', 'can', 'jointly', 'learn', 'the', 'transmission', 'map', 'atmospheric', 'light', 'and', 'dehazing', 'all', 'together', 'the', 'endtoend', 'learning', 'is', 'achieved', 'by', 'directly', 'embedding', 'the', 'atmospheric', 'scattering', 'model', 'into', 'the', 'network', 'thereby', 'ensuring', 'that', 'the', 'proposed', 'method', 'strictly', 'follows', 'the', 'physicsdriven', 'scattering', 'model', 'for', 'dehazing', 'inspired', 'by', 'the', 'dense', 'network', 'that', 'can', 'maximize', 'the', 'information', 'flow', 'along', 'features', 'from', 'different', 'levels', 'we', 'propose', 'a', 'new', 'edgepreserving', 'densely', 'connected', 'encoderdecoder', 'structure', 'with', 'multilevel', 'pyramid', 'pooling', 'module', 'for', 'estimating', 'the', 'transmission', 'map', 'this', 'network', 'is', 'optimized', 'using', 'a', 'newly', 'introduced', 'edgepreserving', 'loss', 'function', 'to', 'further', 'incorporate', 'the', 'mutual', 'structural', 'information', 'between', 'the', 'estimated', 'transmission', 'map', 'and', 'the', 'dehazed', 'result', 'we', 'propose', 'a', 'jointdiscriminator', 'based', 'on', 'generative', 'adversarial', 'network', 'framework', 'to', 'decide', 'whether', 'the', 'corresponding', 'dehazed', 'image', 'and', 'the', 'estimated', 'transmission', 'map', 'are', 'real', 'or', 'fake', 'an', 'ablation', 'study', 'is', 'conducted', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'each', 'module', 'evaluated', 'at', 'both', 'estimated', 'transmission', 'map', 'and', 'dehazed', 'result', 'extensive', 'experiments', 'demonstrate', 'that', 'the', 'proposed', 'method', 'achieves', 'significant', 'improvements', 'over', 'the', 'stateoftheart', 'methods', 'code', 'will', 'be', 'made', 'available', 'at', 'httpsgithubcomhezhangsprinter']]
|
[-0.051096730371559596, -0.024302534175001562, -0.06365546180891829, 0.0490309498637814, -0.06244357758881273, -0.18546930786624954, 0.014774061997446257, 0.48472772721905966, -0.32230048594442573, -0.300049919564579, 0.07567424701677786, -0.27023587285264117, -0.2321702423190849, 0.1517121054106266, -0.11446027863468673, 0.10227607234658019, 0.13280006259730137, 0.02787012656886332, -0.0635055460123899, -0.26207908058312496, 0.33014260143217805, 0.07590484252652606, 0.3694740058300463, 0.055842651873575275, 0.19286034199585383, 0.017218354064971207, -0.05765041518906081, -0.019760887690417065, -0.08649698403420877, 0.1876350404971556, 0.2426611639446, 0.1999961399020174, 0.25735610949404136, -0.4048137828393059, -0.29219882839636224, 0.07897052685352596, 0.14807319364485305, 0.05435101262457367, -0.038358721177949494, -0.34166365332297377, 0.10710794936261467, -0.16403194417975642, 0.042964832827046114, -0.11132904613088514, -0.11313930683442064, -0.03293548595298686, -0.3440083490322797, -0.011856980391501171, 0.01841473180965467, 0.027819475697705875, -0.062465092478118635, -0.0773100367168317, -0.03724266851471888, 0.1674562728976378, -0.05450738872200049, 0.07491764318248308, 0.13868892533402588, -0.11884514675727366, -0.09740290277562029, 0.31869124553694916, -0.0920724157470505, -0.19330865041025588, 0.11884247052130868, -0.03754449539591332, -0.07873091397404268, 0.14578704078354546, 0.2115494029546106, 0.0995209366334854, -0.18696512417597191, -0.02815097397369509, -0.07189923669085713, 0.18006015144338883, 0.05553988488328115, -0.013799118670962146, 0.18739924170831973, 0.2335925283162175, 0.07500020580718646, 0.16880157375141877, -0.1850053914281464, -0.03438468223179665, -0.2119065568832731, -0.09839611628495559, -0.19838844076510065, -0.04940501921306792, -0.0994608098965113, -0.1026576425852663, 0.42851824812792444, 0.20637557438599902, 0.23425783732956326, 0.11096737509832491, 0.3942870147683582, 0.0601724084617721, 0.12111777574629397, 0.09241639280540717, 0.17988533633383544, 0.04572090790072154, 0.07087359469151125, -0.2005543061922229, 0.08293220004243021, 0.08482341194978436]
|
1,803.08397
|
Positive solutions of semilinear elliptic problems with a Hardy
potential
|
Let $\Omega \subset \mathbb{R}^N$ be a bounded domain and $\delta(x)$ be the
distance of a point $x\in \Omega$ to the boundary. We study the positive
solutions of the problem $\Delta u +\frac{\mu}{\delta(x)^2}u=u^p$ in $\Omega$,
where $p>0, \,p\ne 1$ and $\mu \in \mathbb{R},\,\mu\ne 0$ is smaller then the
Hardy constant. The interplay between the singular potential and the
nonlinearity leads to interesting structures of the solution sets. In this
paper we first give the complete picture of the radial solutions in balls. In
particular we establish for $p>1$ the existence of a unique large solution
behaving like $\delta^{- \frac2{p-1}}$ at the boundary. In general domains we
extend results of arXiv:arch-ive/1407.0288 and show that there exists a unique
singular solutions $u$ such that $u/\delta^{\beta_-}\to c$ on the boundary for
an arbitrary positive function $c \in C^{2+\gamma}(\partial\Omega) \, (\gamma
\in (0,1)), c \ge 0$. Here $\beta_-$ is the smaller root of
$\beta(\beta-1)+\mu=0$.
|
math.AP
|
let omega subset mathbbrn be a bounded domain and deltax be the distance of a point xin omega to the boundary we study the positive solutions of the problem delta u fracmudeltax2uup in omega where p0 pne 1 and mu in mathbbrmune 0 is smaller then the hardy constant the interplay between the singular potential and the nonlinearity leads to interesting structures of the solution sets in this paper we first give the complete picture of the radial solutions in balls in particular we establish for p1 the existence of a unique large solution behaving like delta frac2p1 at the boundary in general domains we extend results of arxivarchive14070288 and show that there exists a unique singular solutions u such that udeltabeta_to c on the boundary for an arbitrary positive function c in c2gammapartialomega gamma in 01 c ge 0 here beta_ is the smaller root of betabeta1mu0
|
[['let', 'omega', 'subset', 'mathbbrn', 'be', 'a', 'bounded', 'domain', 'and', 'deltax', 'be', 'the', 'distance', 'of', 'a', 'point', 'xin', 'omega', 'to', 'the', 'boundary', 'we', 'study', 'the', 'positive', 'solutions', 'of', 'the', 'problem', 'delta', 'u', 'fracmudeltax2uup', 'in', 'omega', 'where', 'p0', 'pne', '1', 'and', 'mu', 'in', 'mathbbrmune', '0', 'is', 'smaller', 'then', 'the', 'hardy', 'constant', 'the', 'interplay', 'between', 'the', 'singular', 'potential', 'and', 'the', 'nonlinearity', 'leads', 'to', 'interesting', 'structures', 'of', 'the', 'solution', 'sets', 'in', 'this', 'paper', 'we', 'first', 'give', 'the', 'complete', 'picture', 'of', 'the', 'radial', 'solutions', 'in', 'balls', 'in', 'particular', 'we', 'establish', 'for', 'p1', 'the', 'existence', 'of', 'a', 'unique', 'large', 'solution', 'behaving', 'like', 'delta', 'frac2p1', 'at', 'the', 'boundary', 'in', 'general', 'domains', 'we', 'extend', 'results', 'of', 'arxivarchive14070288', 'and', 'show', 'that', 'there', 'exists', 'a', 'unique', 'singular', 'solutions', 'u', 'such', 'that', 'udeltabeta_to', 'c', 'on', 'the', 'boundary', 'for', 'an', 'arbitrary', 'positive', 'function', 'c', 'in', 'c2gammapartialomega', 'gamma', 'in', '01', 'c', 'ge', '0', 'here', 'beta_', 'is', 'the', 'smaller', 'root', 'of', 'betabeta1mu0']]
|
[-0.18499234925404612, 0.07437140600598814, -0.041003980060619574, 0.01608746726160974, -0.050584154272399526, -0.14725835588563915, 0.039373534215076396, 0.31689591381803783, -0.3230357530303824, -0.17363146023864162, 0.08949992158302618, -0.33886691876752695, -0.10592563564128334, 0.15397208930783524, -0.04228894371854167, 0.014648479183243824, 0.028912499651942456, 0.07494935757336273, -0.0740185687744754, -0.16955318695432703, 0.3781650992057903, -0.11795232839174044, 0.1543444826851376, 0.09980357534327532, 0.06662527780363363, -0.0617011146501861, 0.05577934373245561, 0.03069921915130821, -0.2589900534044382, 0.07508130798126164, 0.22120997480208604, 0.11084336503474436, 0.3097712137100195, -0.36009603788630223, -0.15654580522751646, 0.18890457399661692, 0.1516009648494475, 0.0062188577680835425, -0.030702059194904714, -0.2591833255457049, 0.15744666322331194, -0.0629976752581416, -0.210889433494205, -0.013801686268981914, 0.12988414040858476, 0.04263590170811652, -0.32962558457864005, 0.08153550993178932, 0.08608731312814995, 0.022733802431669663, -0.1334262793313082, -0.14819683333855568, 0.0035495386019506504, 0.09298483046873564, 0.014129252809191674, 0.14224713631826913, -0.0014075576008008924, -0.11538095981322072, -0.03347012208787803, 0.367416466825681, -0.11041112696017388, -0.25849579149958823, 0.15236520217928354, -0.23411633098222526, -0.09905654849143515, 0.08238088674056278, 0.14319010063883697, 0.17522177213809492, -0.06531037276768138, 0.22035769097880842, -0.0665554355962766, 0.145777109470325, 0.11033313064245691, 0.008311624781795921, 0.11569570459451683, 0.11570111854152727, 0.15901540437529624, 0.11518777930505679, -0.050230884593218714, -0.01515817437583292, -0.3929291060259959, -0.16715174199173777, -0.17139528209710836, 0.1279830825843022, -0.14960775778155025, -0.18611440461614287, 0.3353320002411558, 0.08720616388141217, 0.23405399891419965, 0.03603318453812316, 0.19110110578779788, 0.12122433412898805, -0.00423401381581051, 0.08846838218094387, 0.15802072779550938, 0.10013484595586139, 0.08494496360276892, -0.2105248917425445, 0.008123077402993197, 0.05179415719981656]
|
1,803.08398
|
Field induced magnon excitation and in gap absorption of Kitaev
candidate RuCl3
|
We use time-domain terahertz spectroscopy to measure the low energy
conductivity and magnons in RuCl$_3$ under external magnetic field. At zero
field, an oscillation with a frequency of 0.62 THz is clearly observed in
time-domain spectrum below T$_N$, which is identified as a magnon excitation in
the magnetic order state. The magnon excitation is not affected by the external
magnetic field $\textbf{H}_{DC}$ when it is applied along the c-axis, but is
clearly suppressed when $\textbf{H}_{DC}$ is applied within ab plane. More
interestingly, when the magnetic component of THz wave $\textbf{h}(t)$ is
perpendicular to the applied in-plane magnetic field, we observe another
coherent oscillation at slightly higher energy scale at the field above 2 T,
which is eventually suppressed for $H_{DC}>$5 T. The measurement seems to
indicate that the in-plane magnetic field can lift the degeneracy of two
branches of low energy magnons at $\Gamma$ point. The low energy optical
conductivity calculated from the measured transmission spectrum is dominated by
a broad continuum contribution, which is not affected by changing either
temperature or external magnetic field. The continuum is likely to be related
to the fractional spin excitation due to dominated Kitaev interaction in the
material.
|
cond-mat.str-el
|
we use timedomain terahertz spectroscopy to measure the low energy conductivity and magnons in rucl_3 under external magnetic field at zero field an oscillation with a frequency of 062 thz is clearly observed in timedomain spectrum below t_n which is identified as a magnon excitation in the magnetic order state the magnon excitation is not affected by the external magnetic field textbfh_dc when it is applied along the caxis but is clearly suppressed when textbfh_dc is applied within ab plane more interestingly when the magnetic component of thz wave textbfht is perpendicular to the applied inplane magnetic field we observe another coherent oscillation at slightly higher energy scale at the field above 2 t which is eventually suppressed for h_dc5 t the measurement seems to indicate that the inplane magnetic field can lift the degeneracy of two branches of low energy magnons at gamma point the low energy optical conductivity calculated from the measured transmission spectrum is dominated by a broad continuum contribution which is not affected by changing either temperature or external magnetic field the continuum is likely to be related to the fractional spin excitation due to dominated kitaev interaction in the material
|
[['we', 'use', 'timedomain', 'terahertz', 'spectroscopy', 'to', 'measure', 'the', 'low', 'energy', 'conductivity', 'and', 'magnons', 'in', 'rucl_3', 'under', 'external', 'magnetic', 'field', 'at', 'zero', 'field', 'an', 'oscillation', 'with', 'a', 'frequency', 'of', '062', 'thz', 'is', 'clearly', 'observed', 'in', 'timedomain', 'spectrum', 'below', 't_n', 'which', 'is', 'identified', 'as', 'a', 'magnon', 'excitation', 'in', 'the', 'magnetic', 'order', 'state', 'the', 'magnon', 'excitation', 'is', 'not', 'affected', 'by', 'the', 'external', 'magnetic', 'field', 'textbfh_dc', 'when', 'it', 'is', 'applied', 'along', 'the', 'caxis', 'but', 'is', 'clearly', 'suppressed', 'when', 'textbfh_dc', 'is', 'applied', 'within', 'ab', 'plane', 'more', 'interestingly', 'when', 'the', 'magnetic', 'component', 'of', 'thz', 'wave', 'textbfht', 'is', 'perpendicular', 'to', 'the', 'applied', 'inplane', 'magnetic', 'field', 'we', 'observe', 'another', 'coherent', 'oscillation', 'at', 'slightly', 'higher', 'energy', 'scale', 'at', 'the', 'field', 'above', '2', 't', 'which', 'is', 'eventually', 'suppressed', 'for', 'h_dc5', 't', 'the', 'measurement', 'seems', 'to', 'indicate', 'that', 'the', 'inplane', 'magnetic', 'field', 'can', 'lift', 'the', 'degeneracy', 'of', 'two', 'branches', 'of', 'low', 'energy', 'magnons', 'at', 'gamma', 'point', 'the', 'low', 'energy', 'optical', 'conductivity', 'calculated', 'from', 'the', 'measured', 'transmission', 'spectrum', 'is', 'dominated', 'by', 'a', 'broad', 'continuum', 'contribution', 'which', 'is', 'not', 'affected', 'by', 'changing', 'either', 'temperature', 'or', 'external', 'magnetic', 'field', 'the', 'continuum', 'is', 'likely', 'to', 'be', 'related', 'to', 'the', 'fractional', 'spin', 'excitation', 'due', 'to', 'dominated', 'kitaev', 'interaction', 'in', 'the', 'material']]
|
[-0.17925288347851642, 0.25871592978966673, -0.027970899832654373, 0.0356828157615687, -0.07706012186126208, -0.1110711543911005, 0.032006707102187094, 0.40986570275110723, -0.30080159624833713, -0.2984829669024707, 0.04203913383995285, -0.27177967329104846, -0.044199579991449, 0.22038569133996924, 0.05498193065557844, -0.06842218462563075, -0.04825597384296046, 0.04668397703134889, -0.011925178286205021, -0.14757555939442435, 0.29291901645782104, 0.06554823617953125, 0.313215848175487, 0.0833042748915446, 0.031086238187674375, -0.012787707635147878, 0.06815661655992504, 0.04456843477210606, -0.09599144803257251, -1.503497908252696e-05, 0.2535936097710159, -0.08432574386352489, 0.1875611535646509, -0.3772196398648136, -0.20582801316674623, 0.05754083319425739, 0.16834754484028466, 0.13754215979941325, -0.006161760040622873, -0.24588474631797114, 0.07706757155929678, -0.08575449813479138, -0.1576847574498056, -0.05735775915154924, 0.00030252333737773265, -0.019436310472074135, -0.27188461982396417, 0.12395082465348599, 0.04552643050449408, 0.10049783796162212, -0.11305803969790135, -0.10225116767242785, -0.09143668121697274, 0.025553398260801632, 0.08951908661203742, 0.1533258696944887, 0.1796527781367731, -0.1506937767984833, -0.05959368084376941, 0.33999718080581953, -0.11443520573891836, -0.086908300215237, 0.15080338954457437, -0.23208595418093325, -0.05019765213090458, 0.2480339071718264, 0.09224680260418676, 0.07963423877320598, -0.11520091405908482, 0.07815565345141456, 0.05783261795638248, 0.19557981749375458, 0.06738750027439006, 0.04359644314509461, 0.27939844173312195, 0.12471051389017479, 0.06482645820982325, 0.15186060704315246, -0.14824728936893153, -0.008746687264342582, -0.23419623620349778, -0.08081723182067196, -0.24701301253788388, 0.09331967124597508, -0.03338340229556849, -0.15132811991497874, 0.3992648436844834, 0.16276945454843772, 0.1503588007616747, -0.06873117757934336, 0.3125173230777392, 0.2094995732805009, 0.09984424534066048, 0.07595186005468378, 0.2979050534606682, 0.20447052680614225, 0.14379978330357301, -0.30270644385704076, -0.0024789472961437484, -0.04639041844111775]
|
1,803.08399
|
Kinetics of surface growth with coupled diffusion and the emergence of a
universal growth path
|
Surface growth, by association or dissociation of material on the boundaries
of a body, is ubiquitous in both natural and engineering systems. It is the
fundamental mechanism by which biological materials grow, starting from the
level of a single cell, and is increasingly applied in engineering processes
for fabrication and self-assembly. A significant complexity in describing the
kinetics of such processes arises due to their inherent coupled interaction
with the diffusing constituents that are needed to sustain the growth, and the
influence of local stresses on the growth rates. Moreover, changes in
concentration of solvent within the bulk of the body, generated by diffusion,
can affect volumetric changes, thus leading to an additional interacting growth
mechanism. In this paper we present a general theoretical framework that
captures these complexities to describe the kinetics of surface growth while
accounting for coupled diffusion. Then, by combination of analytical and
numerical tools, applied to a simple growth geometry, we show that the
evolution of such growth processes rapidly tends towards a universal path that
is independent of initial conditions. This path, on which surface growth
mechanisms and diffusion act harmoniously, can be extended to analytically
portray the evolution of a body from inception up to a treadmilling state, in
which addition and removal of material are balanced.
|
cond-mat.soft
|
surface growth by association or dissociation of material on the boundaries of a body is ubiquitous in both natural and engineering systems it is the fundamental mechanism by which biological materials grow starting from the level of a single cell and is increasingly applied in engineering processes for fabrication and selfassembly a significant complexity in describing the kinetics of such processes arises due to their inherent coupled interaction with the diffusing constituents that are needed to sustain the growth and the influence of local stresses on the growth rates moreover changes in concentration of solvent within the bulk of the body generated by diffusion can affect volumetric changes thus leading to an additional interacting growth mechanism in this paper we present a general theoretical framework that captures these complexities to describe the kinetics of surface growth while accounting for coupled diffusion then by combination of analytical and numerical tools applied to a simple growth geometry we show that the evolution of such growth processes rapidly tends towards a universal path that is independent of initial conditions this path on which surface growth mechanisms and diffusion act harmoniously can be extended to analytically portray the evolution of a body from inception up to a treadmilling state in which addition and removal of material are balanced
|
[['surface', 'growth', 'by', 'association', 'or', 'dissociation', 'of', 'material', 'on', 'the', 'boundaries', 'of', 'a', 'body', 'is', 'ubiquitous', 'in', 'both', 'natural', 'and', 'engineering', 'systems', 'it', 'is', 'the', 'fundamental', 'mechanism', 'by', 'which', 'biological', 'materials', 'grow', 'starting', 'from', 'the', 'level', 'of', 'a', 'single', 'cell', 'and', 'is', 'increasingly', 'applied', 'in', 'engineering', 'processes', 'for', 'fabrication', 'and', 'selfassembly', 'a', 'significant', 'complexity', 'in', 'describing', 'the', 'kinetics', 'of', 'such', 'processes', 'arises', 'due', 'to', 'their', 'inherent', 'coupled', 'interaction', 'with', 'the', 'diffusing', 'constituents', 'that', 'are', 'needed', 'to', 'sustain', 'the', 'growth', 'and', 'the', 'influence', 'of', 'local', 'stresses', 'on', 'the', 'growth', 'rates', 'moreover', 'changes', 'in', 'concentration', 'of', 'solvent', 'within', 'the', 'bulk', 'of', 'the', 'body', 'generated', 'by', 'diffusion', 'can', 'affect', 'volumetric', 'changes', 'thus', 'leading', 'to', 'an', 'additional', 'interacting', 'growth', 'mechanism', 'in', 'this', 'paper', 'we', 'present', 'a', 'general', 'theoretical', 'framework', 'that', 'captures', 'these', 'complexities', 'to', 'describe', 'the', 'kinetics', 'of', 'surface', 'growth', 'while', 'accounting', 'for', 'coupled', 'diffusion', 'then', 'by', 'combination', 'of', 'analytical', 'and', 'numerical', 'tools', 'applied', 'to', 'a', 'simple', 'growth', 'geometry', 'we', 'show', 'that', 'the', 'evolution', 'of', 'such', 'growth', 'processes', 'rapidly', 'tends', 'towards', 'a', 'universal', 'path', 'that', 'is', 'independent', 'of', 'initial', 'conditions', 'this', 'path', 'on', 'which', 'surface', 'growth', 'mechanisms', 'and', 'diffusion', 'act', 'harmoniously', 'can', 'be', 'extended', 'to', 'analytically', 'portray', 'the', 'evolution', 'of', 'a', 'body', 'from', 'inception', 'up', 'to', 'a', 'treadmilling', 'state', 'in', 'which', 'addition', 'and', 'removal', 'of', 'material', 'are', 'balanced']]
|
[-0.07937058648034695, 0.1679498233129167, -0.07405630817689071, 0.010435091444752484, -0.03606561443737978, -0.08320853098461004, 0.02484441572249754, 0.34312315232982143, -0.3245785313214515, -0.2806535669315223, 0.10547962493837645, -0.24552732037225844, -0.1895249169167549, 0.1880698096775232, -0.03742598212907961, 0.029741671203992494, 0.02716997554569253, -0.013093617546728978, -0.0005332840349259743, -0.20653432676629555, 0.31491544946732225, 0.06367586181438137, 0.29796920886489553, 0.0749956007772691, 0.0871248946429413, -0.017527395987743947, 0.005305934303535897, 0.03721792580751337, -0.14951777607314048, 0.15956780103408724, 0.2000290395533688, 0.0839853049182128, 0.2518838806225805, -0.48708769343097075, -0.27045917070892894, 0.046214291114342686, 0.1569032630954965, 0.14390810081576405, -0.10230590803733652, -0.19942176490086436, 0.065394156244714, -0.14330038813347537, -0.13399799665975792, -0.05048082808737652, 0.038878426054235825, 0.041519429309187006, -0.26363221980592183, 0.09985443484038115, 0.07369509437415209, 0.030030466577393944, -0.0944032608270297, -0.04215717473813707, -0.06077983521009909, 0.16871730506063273, 0.04159270615428651, 0.009075421430458855, 0.19207747852011958, -0.1671146813183849, -0.0947774667532192, 0.3990146120374796, -0.04725870653926003, -0.20138426338949145, 0.2815993722597851, -0.14282138041812473, -0.08883413741208404, 0.1706716663456548, 0.22836086182598303, 0.08223155827047172, -0.16389634360169783, 0.06391954140995507, 0.056414112487860095, 0.1462907170981308, 0.05975877208130382, 5.013458936684112e-05, 0.20348495331563754, 0.21123822746258752, 0.04879227897726765, 0.13814604444626205, -0.03158500720638016, -0.12323223343053745, -0.2721122978002194, -0.19051980348271275, -0.15367357072172355, 0.07079443906947414, -0.08184704595419771, -0.18759775953040955, 0.37787826128834945, 0.1216902329127313, 0.19973824387111605, 0.015864645522066054, 0.24237818755622884, 0.09848464949782199, 0.0916907498275722, 0.03428135230205953, 0.2172143315562786, 0.1147382026679692, 0.067098873831706, -0.2508836425732055, 0.14770503266100884, 0.0063545896462817615]
|
1,803.084
|
On the performance of interatomic potential models of iron: comparison
of the phase diagrams
|
In order to study the performance of interatomic potentials and their
reliability at higher pressures, the phase diagram of four different
embedded-atom type potential models of iron is compared. The calculations were
done by the nested sampling technique in the pressure range 0.1 GPa-100 GPa.
The low pressure stable structure is found to be the body- centred cubic in all
cases, but the higher pressure phases show a great variation, being
face-centred cubic, hexagonal close-packed and - at very low temperatures -
different body-centred tetragonal phases are observed as well. The melting line
is overestimated considerably for three of the models, but for the one where
liquid properties had been taken into account during the potential fitting
process, the agreement with experimental results is good, even at very high
pressures.
|
cond-mat.mtrl-sci physics.chem-ph
|
in order to study the performance of interatomic potentials and their reliability at higher pressures the phase diagram of four different embeddedatom type potential models of iron is compared the calculations were done by the nested sampling technique in the pressure range 01 gpa100 gpa the low pressure stable structure is found to be the body centred cubic in all cases but the higher pressure phases show a great variation being facecentred cubic hexagonal closepacked and at very low temperatures different bodycentred tetragonal phases are observed as well the melting line is overestimated considerably for three of the models but for the one where liquid properties had been taken into account during the potential fitting process the agreement with experimental results is good even at very high pressures
|
[['in', 'order', 'to', 'study', 'the', 'performance', 'of', 'interatomic', 'potentials', 'and', 'their', 'reliability', 'at', 'higher', 'pressures', 'the', 'phase', 'diagram', 'of', 'four', 'different', 'embeddedatom', 'type', 'potential', 'models', 'of', 'iron', 'is', 'compared', 'the', 'calculations', 'were', 'done', 'by', 'the', 'nested', 'sampling', 'technique', 'in', 'the', 'pressure', 'range', '01', 'gpa100', 'gpa', 'the', 'low', 'pressure', 'stable', 'structure', 'is', 'found', 'to', 'be', 'the', 'body', 'centred', 'cubic', 'in', 'all', 'cases', 'but', 'the', 'higher', 'pressure', 'phases', 'show', 'a', 'great', 'variation', 'being', 'facecentred', 'cubic', 'hexagonal', 'closepacked', 'and', 'at', 'very', 'low', 'temperatures', 'different', 'bodycentred', 'tetragonal', 'phases', 'are', 'observed', 'as', 'well', 'the', 'melting', 'line', 'is', 'overestimated', 'considerably', 'for', 'three', 'of', 'the', 'models', 'but', 'for', 'the', 'one', 'where', 'liquid', 'properties', 'had', 'been', 'taken', 'into', 'account', 'during', 'the', 'potential', 'fitting', 'process', 'the', 'agreement', 'with', 'experimental', 'results', 'is', 'good', 'even', 'at', 'very', 'high', 'pressures']]
|
[-0.08700169560565489, 0.15677061841610496, -0.05651573731571319, 0.03282621875274975, -0.0005763382577579322, -0.1396357842838377, 0.05520490342824478, 0.43819042943476694, -0.2200595663207781, -0.33008926836260427, 0.09892125392156675, -0.29347673755168446, -0.0752505288261363, 0.16206463158504641, 0.035690246635725294, 0.03140249288838914, 0.007023556740939852, 0.007144688952651872, -0.12684182759821708, -0.28915411521181994, 0.25063272518303803, 0.0658187881060766, 0.30634687368677355, 0.06822763359188799, 0.03757217644867817, -0.07805212912714388, 0.07368932606782544, 0.06117546972810366, -0.14748646143281202, 0.024072236958964485, 0.23593495171921608, -0.040924463459605896, 0.20484026025900046, -0.4061998488220174, -0.26604020046290217, 0.05791035653128633, 0.07977950080723216, 0.11442776883889987, -0.06679421279022074, -0.2146819877936908, 0.08397658424466614, -0.14617975181936632, -0.14531026261777977, -0.0921049929025957, -0.015249606324579772, 0.026324846757728036, -0.23201779036197856, 0.09909096293474041, 0.003636325072445797, 0.10464653211198224, -0.13298841110452658, -0.22120541364951865, -0.07509633728420347, 0.08608135045322729, 0.03285464694275242, 0.05715101899938497, 0.11013139795519294, -0.11159013631922288, -0.030022275040116835, 0.4748266591419151, -0.031605217771743986, -0.07176517442191445, 0.23719199219953238, -0.19802594786408123, -0.12724574082934365, 0.24646036659448048, 0.1297128843553786, 0.08215234666608098, -0.12766256875461188, 0.05239403576866951, 0.06068050218232739, 0.16101739605921725, 0.09420679673537846, -0.03337868538509374, 0.2178227409122761, 0.17757763527517068, -0.020769951473664873, 0.13310929556930892, -0.09401267834785064, -0.09589539493679795, -0.20177753729467082, -0.11625832871086603, -0.1537230586473588, -0.05681879920188308, -0.13799642852125285, -0.15318007265239603, 0.3552973436129345, 0.09830009161978667, 0.19556629089418592, 0.0021092671310661113, 0.2558386474554464, 0.09586937737185508, 0.09889254671902814, 0.006368475452828126, 0.2715820757026865, 0.13187730208261114, 0.10653768637488911, -0.20515508811158223, 0.09872403641150693, 0.0070387555504452404]
|
1,803.08401
|
Convergence of finite volume schemes for the Euler equations via
dissipative measure--valued solutions
|
The Cauchy problem for the complete Euler system is in general ill posed in
the class of admissible (entropy producing) weak solutions. This suggests there
might be sequences of approximate solutions that develop fine scale
oscillations. Accordingly, the concept of measure--valued solution that capture
possible oscillations is more suitable for analysis. We study the convergence
of a class of entropy stable finite volume schemes for the barotropic and
complete compressible Euler equations in the multidimensional case. We
establish suitable stability and consistency estimates and show that the Young
measure generated by numerical solutions represents a dissipative
measure--valued solution of the Euler system. Here dissipative means that a
suitable form of the Second law of thermodynamics is incorporated in the
definition of the measure--valued solutions. In particular, using the recently
established weak-strong uniqueness principle, we show that the numerical
solutions converge pointwise to the regular solution of the limit systems at
least on the lifespan of the latter.
|
math.NA
|
the cauchy problem for the complete euler system is in general ill posed in the class of admissible entropy producing weak solutions this suggests there might be sequences of approximate solutions that develop fine scale oscillations accordingly the concept of measurevalued solution that capture possible oscillations is more suitable for analysis we study the convergence of a class of entropy stable finite volume schemes for the barotropic and complete compressible euler equations in the multidimensional case we establish suitable stability and consistency estimates and show that the young measure generated by numerical solutions represents a dissipative measurevalued solution of the euler system here dissipative means that a suitable form of the second law of thermodynamics is incorporated in the definition of the measurevalued solutions in particular using the recently established weakstrong uniqueness principle we show that the numerical solutions converge pointwise to the regular solution of the limit systems at least on the lifespan of the latter
|
[['the', 'cauchy', 'problem', 'for', 'the', 'complete', 'euler', 'system', 'is', 'in', 'general', 'ill', 'posed', 'in', 'the', 'class', 'of', 'admissible', 'entropy', 'producing', 'weak', 'solutions', 'this', 'suggests', 'there', 'might', 'be', 'sequences', 'of', 'approximate', 'solutions', 'that', 'develop', 'fine', 'scale', 'oscillations', 'accordingly', 'the', 'concept', 'of', 'measurevalued', 'solution', 'that', 'capture', 'possible', 'oscillations', 'is', 'more', 'suitable', 'for', 'analysis', 'we', 'study', 'the', 'convergence', 'of', 'a', 'class', 'of', 'entropy', 'stable', 'finite', 'volume', 'schemes', 'for', 'the', 'barotropic', 'and', 'complete', 'compressible', 'euler', 'equations', 'in', 'the', 'multidimensional', 'case', 'we', 'establish', 'suitable', 'stability', 'and', 'consistency', 'estimates', 'and', 'show', 'that', 'the', 'young', 'measure', 'generated', 'by', 'numerical', 'solutions', 'represents', 'a', 'dissipative', 'measurevalued', 'solution', 'of', 'the', 'euler', 'system', 'here', 'dissipative', 'means', 'that', 'a', 'suitable', 'form', 'of', 'the', 'second', 'law', 'of', 'thermodynamics', 'is', 'incorporated', 'in', 'the', 'definition', 'of', 'the', 'measurevalued', 'solutions', 'in', 'particular', 'using', 'the', 'recently', 'established', 'weakstrong', 'uniqueness', 'principle', 'we', 'show', 'that', 'the', 'numerical', 'solutions', 'converge', 'pointwise', 'to', 'the', 'regular', 'solution', 'of', 'the', 'limit', 'systems', 'at', 'least', 'on', 'the', 'lifespan', 'of', 'the', 'latter']]
|
[-0.15645303681161354, 0.052289663851083176, -0.09333027831306918, 0.10323853667226329, -0.045365390237302156, -0.10971674914056566, 0.011792379191180893, 0.24599924602302586, -0.2940934614996147, -0.21332213630793012, 0.15234390609070161, -0.256028956746991, -0.11285662433506245, 0.19568990448572834, -0.056852019955493084, 0.1076464651561799, 0.10757042758484152, 0.014686105182619801, -0.05209229173395296, -0.20983139640847398, 0.3848298886423088, 0.003768073905045819, 0.27740845045929025, 0.021120956968397473, 0.15357994268630532, -0.06542270240569666, -0.013413776519002428, 0.07683772756866399, -0.19214973541757627, 0.08914435526673463, 0.22932231407404943, 0.11166004689149321, 0.3103736228410416, -0.39687809743176977, -0.20114332888939768, 0.12890370609238744, 0.1297046585649157, 0.10507974969401102, -0.06809470711090931, -0.2738958625641954, 0.1269676829095052, -0.14824293135549682, -0.2210679617532452, -0.11613938544067157, 0.031625386280049184, 0.08725255337591241, -0.2791083056811884, 0.11982471007663922, 0.10541917426677741, -0.001083583161709415, -0.15099490263979812, -0.0117028917306085, -0.009538109257081701, 0.08211645089196647, 0.06016564568516555, -0.03920320543359704, 0.030709256598975058, -0.11894366245829519, -0.06610375606294745, 0.3610816089151676, -0.10156506238576428, -0.2683926957783995, 0.18626019379100317, -0.14656849310786765, -0.13899838771362594, 0.13638671444859474, 0.13708283621773337, 0.18688067875211728, -0.14600065892123304, 0.1085708340512037, -0.08705832369649297, 0.14058595484012892, 0.08040782817858894, 0.008771915702448837, 0.13872697793991323, 0.18757872346189514, 0.13448542477503703, 0.1414315623151892, -0.0055285457204315505, -0.1433584582787986, -0.35112315908691305, -0.2026901555731062, -0.1637445366452003, 0.09351337411675223, -0.10670415908411504, -0.211911458106842, 0.36066139263255154, 0.14323790852502463, 0.11450311624308586, 0.11008000374285232, 0.22779098490051403, 0.17639073962642318, -0.01757769046016156, 0.08571659697658697, 0.23966287428833496, 0.1417684936035828, 0.14281378149434593, -0.23175710545734882, 0.06473018092571929, 0.17144302645057535]
|
1,803.08402
|
Quantum power boost in a nonstationary cavity-QED quantum heat engine
|
We show a quantum boost in the output power of a heat engine formed by a
two-level system coupled to a single-mode cavity. The key ingredient here is
the nonstationary regime achieved when some system parameter (atomic transition
frequency, in our case) is subjected to a time-dependent perturbative
modulation that is precisely tuned at certain frequencies. We discuss how the
extracted power can lead to amplification of the external driving field.
Quantum power boost is found both in the nonstationary Jaynes-Cummings and Rabi
models, indicating that our predictions can be experimentally tested in circuit
quantum electrodynamics setups.
|
quant-ph
|
we show a quantum boost in the output power of a heat engine formed by a twolevel system coupled to a singlemode cavity the key ingredient here is the nonstationary regime achieved when some system parameter atomic transition frequency in our case is subjected to a timedependent perturbative modulation that is precisely tuned at certain frequencies we discuss how the extracted power can lead to amplification of the external driving field quantum power boost is found both in the nonstationary jaynescummings and rabi models indicating that our predictions can be experimentally tested in circuit quantum electrodynamics setups
|
[['we', 'show', 'a', 'quantum', 'boost', 'in', 'the', 'output', 'power', 'of', 'a', 'heat', 'engine', 'formed', 'by', 'a', 'twolevel', 'system', 'coupled', 'to', 'a', 'singlemode', 'cavity', 'the', 'key', 'ingredient', 'here', 'is', 'the', 'nonstationary', 'regime', 'achieved', 'when', 'some', 'system', 'parameter', 'atomic', 'transition', 'frequency', 'in', 'our', 'case', 'is', 'subjected', 'to', 'a', 'timedependent', 'perturbative', 'modulation', 'that', 'is', 'precisely', 'tuned', 'at', 'certain', 'frequencies', 'we', 'discuss', 'how', 'the', 'extracted', 'power', 'can', 'lead', 'to', 'amplification', 'of', 'the', 'external', 'driving', 'field', 'quantum', 'power', 'boost', 'is', 'found', 'both', 'in', 'the', 'nonstationary', 'jaynescummings', 'and', 'rabi', 'models', 'indicating', 'that', 'our', 'predictions', 'can', 'be', 'experimentally', 'tested', 'in', 'circuit', 'quantum', 'electrodynamics', 'setups']]
|
[-0.16832791393641958, 0.17860164236008508, -0.046047911364777185, 0.025525103059126853, -0.012458419350465549, -0.20781850288190024, 0.03569361840053126, 0.36891440591131597, -0.25334300568384915, -0.25599968817430674, 0.01824156213287725, -0.21531955167151912, -0.1364668350253907, 0.30107437379504604, -0.02363970748523308, 0.079147935063655, 0.03266033269080919, 0.02769048361722188, -0.006300096308870106, -0.18470863184229153, 0.28879572573530765, 0.0821879008669675, 0.3273014659878135, 0.0031491860305679215, 0.08155503224331848, -0.0872847134945464, 0.08813290880301718, 0.021341232890167188, -0.05956784925335351, 0.0371706729188331, 0.26513646508630195, 0.034984411748567805, 0.2686561378122298, -0.44364580642624, -0.25230374368694947, 0.07712994008709091, 0.14271432353116417, 0.17034728138841995, -0.0505887658536895, -0.27709518733780025, 0.028695206253875775, -0.191407600887295, -0.12560602557394154, -0.11106157598395343, -0.03381734492002804, 0.005654643217735377, -0.3226996532151687, 0.05339952002365872, 0.0710831771211065, 0.007919814831279601, -0.005038367670759098, 0.02152279553906128, 0.046430447642912265, 0.08680384137971356, -0.0458527246931779, 0.01776504183677745, 0.21121641061239943, -0.1484816474443993, -0.1310787514889056, 0.3828118055598023, -0.1303270529168322, -0.19620528888946265, 0.13036003011787675, -0.16500369286567895, -0.06084255513509486, 0.08851000346776251, 0.14725889359629646, 0.048567542436619086, -0.13208590808145093, 0.06880482540588308, 0.002179984838615373, 0.24616628932315357, 0.056516239717218676, 0.05254537263673913, 0.21847971716953307, 0.14700513903157228, -0.017160905616300313, 0.22040428387207583, -0.06756608213325627, -0.1340649728423234, -0.2921027419596584, -0.09206185885104975, -0.18394615232330008, 0.10178894188600718, -0.08202658610921905, -0.10484376627250969, 0.432076810777533, 0.19990146315666205, 0.157951945537394, -0.015885977592972136, 0.306711470160979, 0.22959168148995138, 0.043142287510677634, 0.06117395587150276, 0.31687396961251113, 0.14285135009210825, 0.10076833019013871, -0.3039369188133896, 5.2587652444532235e-05, -0.01599450619680058]
|
1,803.08403
|
Comments on Proton Emission after Muon Capture
|
The emission of particles after atomic muon capture was studied extensively
during the early 70's. In particular, proton and neutron spectra were measured
in order to determine whether nuclear emission was due to a direct or a
thermalized process. It was found that protons emitted after atomic muon
capture decreased from a probability of 15% in light nuclei (C, N, O) to
essentially 0% for heavy systems such as Sn, and that only 10% of this emission
could be ascribed to statistical processes. On the other hand a significant
thermal spectrum of neutrons in addition to a direct component was found.
Unfortunately these studies were not always self consistent so that information
of relevance to the MECO experiment is ambiguous.
|
nucl-ex
|
the emission of particles after atomic muon capture was studied extensively during the early 70s in particular proton and neutron spectra were measured in order to determine whether nuclear emission was due to a direct or a thermalized process it was found that protons emitted after atomic muon capture decreased from a probability of 15 in light nuclei c n o to essentially 0 for heavy systems such as sn and that only 10 of this emission could be ascribed to statistical processes on the other hand a significant thermal spectrum of neutrons in addition to a direct component was found unfortunately these studies were not always self consistent so that information of relevance to the meco experiment is ambiguous
|
[['the', 'emission', 'of', 'particles', 'after', 'atomic', 'muon', 'capture', 'was', 'studied', 'extensively', 'during', 'the', 'early', '70s', 'in', 'particular', 'proton', 'and', 'neutron', 'spectra', 'were', 'measured', 'in', 'order', 'to', 'determine', 'whether', 'nuclear', 'emission', 'was', 'due', 'to', 'a', 'direct', 'or', 'a', 'thermalized', 'process', 'it', 'was', 'found', 'that', 'protons', 'emitted', 'after', 'atomic', 'muon', 'capture', 'decreased', 'from', 'a', 'probability', 'of', '15', 'in', 'light', 'nuclei', 'c', 'n', 'o', 'to', 'essentially', '0', 'for', 'heavy', 'systems', 'such', 'as', 'sn', 'and', 'that', 'only', '10', 'of', 'this', 'emission', 'could', 'be', 'ascribed', 'to', 'statistical', 'processes', 'on', 'the', 'other', 'hand', 'a', 'significant', 'thermal', 'spectrum', 'of', 'neutrons', 'in', 'addition', 'to', 'a', 'direct', 'component', 'was', 'found', 'unfortunately', 'these', 'studies', 'were', 'not', 'always', 'self', 'consistent', 'so', 'that', 'information', 'of', 'relevance', 'to', 'the', 'meco', 'experiment', 'is', 'ambiguous']]
|
[-0.007436177318838114, 0.2088124199945014, -0.07445126405994719, 0.1193903162506255, -0.028001483886813124, -0.12443508220749208, 0.03784355407115072, 0.39459806121885777, -0.224247758788988, -0.3251531143905595, 0.05251707212300971, -0.32473698682151736, -0.010210129824311782, 0.17500322677078656, -0.005413174749507258, 0.016850855372225245, 0.0630922888648153, 0.05606637202048053, -0.03423781301244162, -0.21037681610420503, 0.2654324056590364, 0.12625530435858914, 0.23147561630855004, 0.10107485450959454, 0.06461745767058649, -0.031127250908563536, -0.04940942096679161, 0.002919472544454038, -0.05029627461911635, 0.03877720714081079, 0.24988662636994075, 0.10447076994072026, 0.16659055883452917, -0.44382800213061274, -0.2305097125315418, 0.14158214446700487, 0.16981250036818285, 0.08010758447150389, -0.05131468601175584, -0.23919587486889213, 0.09178367893521984, -0.1777174012774291, -0.11589542846971503, -0.007479145253698031, 0.07655678515632948, 0.009495850217839082, -0.2418067546930009, 0.06105396361866345, 0.05516590490102923, 0.03592956492599721, -0.06209713338175789, -0.11141422781996274, -0.021283002578032513, 0.07916807610502777, 0.08688674571239971, 0.059407522087955536, 0.17555891835751633, -0.09339984865897956, -0.10057561752619222, 0.3992872353022297, -0.05509891116428965, -0.056621366646140814, 0.2098850548636013, -0.20631869004573672, -0.13197558066264417, 0.22828505157182613, 0.13916379020859798, 0.12133924504742026, -0.19272391829484453, 0.025261814901023173, -0.0005385824711993337, 0.22141562172328122, 0.08536626832404484, 0.01665053815813735, 0.22190181468225395, 0.13075441416682831, -0.029165330443841717, 0.0832063129816864, -0.14311023910025444, -0.042309559716765456, -0.22103652145500138, -0.15761200498479108, -0.15275710164569317, 0.08230621642833284, 0.026729594464753367, -0.09696556187700481, 0.3354316224150049, 0.07841526020007829, 0.2073492156302867, -0.07527064347135214, 0.2841721541713923, 0.07533722945081536, 0.07643650995354014, 0.026866148831322788, 0.324147479525224, 0.15877602191564316, 0.1160880022662847, -0.229992843537669, 0.12469789129293835, -0.004674212133977562]
|
1,803.08404
|
Sequence pairs with asymptotically optimal aperiodic correlation
|
The Pursley-Sarwate criterion of a pair of finite complex-valued sequences
measures the collective smallness of the aperiodic autocorrelations and the
aperiodic crosscorrelations of the two sequences. It is known that this
quantity is always at least 1 with equality if and only if the sequence pair is
a Golay pair. We exhibit pairs of complex-valued sequences whose entries have
unit magnitude for which the Pursley-Sarwate criterion tends to 1 as the
sequence length tends to infinity. Our constructions use different carefully
chosen Chu sequences.
|
cs.IT math.IT
|
the pursleysarwate criterion of a pair of finite complexvalued sequences measures the collective smallness of the aperiodic autocorrelations and the aperiodic crosscorrelations of the two sequences it is known that this quantity is always at least 1 with equality if and only if the sequence pair is a golay pair we exhibit pairs of complexvalued sequences whose entries have unit magnitude for which the pursleysarwate criterion tends to 1 as the sequence length tends to infinity our constructions use different carefully chosen chu sequences
|
[['the', 'pursleysarwate', 'criterion', 'of', 'a', 'pair', 'of', 'finite', 'complexvalued', 'sequences', 'measures', 'the', 'collective', 'smallness', 'of', 'the', 'aperiodic', 'autocorrelations', 'and', 'the', 'aperiodic', 'crosscorrelations', 'of', 'the', 'two', 'sequences', 'it', 'is', 'known', 'that', 'this', 'quantity', 'is', 'always', 'at', 'least', '1', 'with', 'equality', 'if', 'and', 'only', 'if', 'the', 'sequence', 'pair', 'is', 'a', 'golay', 'pair', 'we', 'exhibit', 'pairs', 'of', 'complexvalued', 'sequences', 'whose', 'entries', 'have', 'unit', 'magnitude', 'for', 'which', 'the', 'pursleysarwate', 'criterion', 'tends', 'to', '1', 'as', 'the', 'sequence', 'length', 'tends', 'to', 'infinity', 'our', 'constructions', 'use', 'different', 'carefully', 'chosen', 'chu', 'sequences']]
|
[-0.15589963658372077, 0.18397116498658206, -0.07986669488273924, 0.1066884284117827, -0.007816563561990312, -0.1495066156565416, 0.011405265187310828, 0.3960352729687967, -0.33340645572397765, -0.23408990898510304, 0.09742388603981675, -0.32481621973579977, -0.13860455360945043, 0.16283247734579007, -0.042082420663862696, 0.037825314978296616, 0.06256370312852286, 0.09940292395469619, -0.030485936629303045, -0.3163430125838736, 0.34051626559528636, -0.02211888370717444, 0.25104016810655594, -0.0465611123945564, 0.12918828470151866, 0.01134581270445956, -0.02476179757064617, -0.03412681231956657, -0.12948113479184784, 0.04420947042725435, 0.18656428488789173, 0.11763517020224798, 0.2822505750398083, -0.2866249778875854, -0.1339424015590694, 0.21889676529738097, 0.15586447447152219, 0.0726658675958766, 0.022425054148032624, -0.21154545400882277, 0.19629793404885454, -0.09671623755825638, -0.09721749530332845, -0.02466908572014512, 0.08738884913860025, 0.09434293386265181, -0.3162535383116181, 0.028218439564381432, 0.14963295083583855, 0.0357439042205309, -0.013696377784604342, -0.10635892710103313, -0.02217671884189746, 0.1502318542518812, 0.07605197684123839, 0.05768473057939512, 0.05218484800127221, -0.02296116384507225, -0.11034000111834669, 0.3219869823036034, -0.06436191273217158, -0.27132696081407187, 0.20055983097451488, -0.15873882186417354, -0.08833771093717277, 0.14093180969016764, 0.07270136001951448, 0.13127324834647702, -0.11149926699425389, 0.03282508384521551, -0.05800403692055403, 0.20619580072418944, 0.12157589375473014, 0.09551478211097873, 0.19870749044391076, 0.08154931977936407, 0.07725580125513327, 0.13952491947495174, -0.0705901631040544, -0.0231887090542331, -0.33353478429702726, -0.10473522065752526, -0.2413528350340884, 0.07021515429156219, -0.1182099104707737, -0.223598881681427, 0.3827300060358716, 0.08363828169772537, 0.2221683289787573, 0.1176631839551236, 0.2491534313686737, 0.12741069975536226, 0.07389275932389243, -0.011570694481545105, 0.13316250735575832, 0.13458467390325785, 0.014435330019673197, -0.1733676506796988, 0.033531832412203276, 0.12383493088276648]
|
1,803.08405
|
Scaling properties of extreme price fluctuations in Bitcoin markets
|
Detection of power-law behavior and studies of scaling exponents uncover the
characteristics of complexity in many real world phenomena. The complexity of
financial markets has always presented challenging issues and provided
interesting findings, such as the inverse cubic law in the tails of stock price
fluctuation distributions. Motivated by the rise of novel digital assets based
on blockchain technology, we study the distributions of cryptocurrency price
fluctuations. We consider Bitcoin returns over various time intervals and from
multiple digital exchanges, in order to investigate the existence of universal
scaling behavior in the tails, and ascertain whether the scaling exponent
supports the presence of a finite second moment. We provide empirical evidence
on slowly decaying tails in the distributions of returns over multiple time
intervals and different exchanges, corresponding to a power-law. We estimate
the scaling exponent and find an asymptotic power-law behavior with 2 <
{\alpha} < 2.5 suggesting that Bitcoin returns, in addition to being more
volatile, also exhibit heavier tails than stocks, which are known to be around
3. Our results also imply the existence of a finite second moment, thus
providing a fundamental basis for the usage of standard financial theories and
covariance-based techniques in risk management and portfolio optimization
scenarios.
|
q-fin.ST
|
detection of powerlaw behavior and studies of scaling exponents uncover the characteristics of complexity in many real world phenomena the complexity of financial markets has always presented challenging issues and provided interesting findings such as the inverse cubic law in the tails of stock price fluctuation distributions motivated by the rise of novel digital assets based on blockchain technology we study the distributions of cryptocurrency price fluctuations we consider bitcoin returns over various time intervals and from multiple digital exchanges in order to investigate the existence of universal scaling behavior in the tails and ascertain whether the scaling exponent supports the presence of a finite second moment we provide empirical evidence on slowly decaying tails in the distributions of returns over multiple time intervals and different exchanges corresponding to a powerlaw we estimate the scaling exponent and find an asymptotic powerlaw behavior with 2 alpha 25 suggesting that bitcoin returns in addition to being more volatile also exhibit heavier tails than stocks which are known to be around 3 our results also imply the existence of a finite second moment thus providing a fundamental basis for the usage of standard financial theories and covariancebased techniques in risk management and portfolio optimization scenarios
|
[['detection', 'of', 'powerlaw', 'behavior', 'and', 'studies', 'of', 'scaling', 'exponents', 'uncover', 'the', 'characteristics', 'of', 'complexity', 'in', 'many', 'real', 'world', 'phenomena', 'the', 'complexity', 'of', 'financial', 'markets', 'has', 'always', 'presented', 'challenging', 'issues', 'and', 'provided', 'interesting', 'findings', 'such', 'as', 'the', 'inverse', 'cubic', 'law', 'in', 'the', 'tails', 'of', 'stock', 'price', 'fluctuation', 'distributions', 'motivated', 'by', 'the', 'rise', 'of', 'novel', 'digital', 'assets', 'based', 'on', 'blockchain', 'technology', 'we', 'study', 'the', 'distributions', 'of', 'cryptocurrency', 'price', 'fluctuations', 'we', 'consider', 'bitcoin', 'returns', 'over', 'various', 'time', 'intervals', 'and', 'from', 'multiple', 'digital', 'exchanges', 'in', 'order', 'to', 'investigate', 'the', 'existence', 'of', 'universal', 'scaling', 'behavior', 'in', 'the', 'tails', 'and', 'ascertain', 'whether', 'the', 'scaling', 'exponent', 'supports', 'the', 'presence', 'of', 'a', 'finite', 'second', 'moment', 'we', 'provide', 'empirical', 'evidence', 'on', 'slowly', 'decaying', 'tails', 'in', 'the', 'distributions', 'of', 'returns', 'over', 'multiple', 'time', 'intervals', 'and', 'different', 'exchanges', 'corresponding', 'to', 'a', 'powerlaw', 'we', 'estimate', 'the', 'scaling', 'exponent', 'and', 'find', 'an', 'asymptotic', 'powerlaw', 'behavior', 'with', '2', 'alpha', '25', 'suggesting', 'that', 'bitcoin', 'returns', 'in', 'addition', 'to', 'being', 'more', 'volatile', 'also', 'exhibit', 'heavier', 'tails', 'than', 'stocks', 'which', 'are', 'known', 'to', 'be', 'around', '3', 'our', 'results', 'also', 'imply', 'the', 'existence', 'of', 'a', 'finite', 'second', 'moment', 'thus', 'providing', 'a', 'fundamental', 'basis', 'for', 'the', 'usage', 'of', 'standard', 'financial', 'theories', 'and', 'covariancebased', 'techniques', 'in', 'risk', 'management', 'and', 'portfolio', 'optimization', 'scenarios']]
|
[-0.1191713406760845, 0.09639946872601574, -0.14116412213551674, 0.13835502974919534, -0.05531012785037758, -0.13722187142339673, 0.08174439162617586, 0.34864306751705504, -0.26369144259675376, -0.28000283695723965, 0.12918854393998602, -0.3274553861044864, -0.1400231320844931, 0.21540997662618389, -0.04698985294060837, 0.04654813157671159, -0.04059883768181547, -0.0003843052036965745, -0.010115314010498437, -0.2610360796685506, 0.270022815038072, 0.04041914033731169, 0.3029130899836079, 0.04425766242502054, 0.05130443914037308, -0.01974407195039831, -0.056638415215599196, -0.0009026073546397804, -0.1304238884109905, 0.11357182521824863, 0.2284878800106742, 0.09562841797763906, 0.30734007319177287, -0.4012239176484913, -0.17989566671030394, 0.1389382258777986, 0.13601752287030477, 0.005784030874043076, -0.03805673195230417, -0.255156427963019, 0.07229373948118363, -0.22450691952005877, -0.1694702612406731, -0.08681476943305519, 0.06472674053909239, 0.0519976847886343, -0.27056577207409954, 0.11605150555807978, 0.052924511327159286, 0.07766358729793073, -0.04706463567499938, -0.10179616049932556, 0.016440197353431087, 0.12992713115141163, 0.16389554694910433, -0.09107513811397781, 0.11844191321236368, -0.13710986607071787, -0.18543820783823248, 0.3399090464918478, -0.05287880671078323, -0.11454838313309863, 0.1609619912924245, -0.18157477840080416, -0.13865107769091237, 0.11180041446511883, 0.20328827562631283, 0.03903180948939978, -0.14198998364592247, 0.06709004198846472, -0.013936718309178284, 0.21217081403085444, 0.0578723217148592, 0.0524033165546114, 0.18652111101240879, 0.16585662054119282, 0.07514712000974583, 0.13939191523932457, -0.06068147036781774, -0.18478807753371534, -0.2814645719562316, -0.1322518879058425, -0.159830314695079, 0.06544555384910085, -0.17391326674202567, -0.19993917513546525, 0.398066069123953, 0.1502010684027014, 0.1989925378751434, 0.10695006203028548, 0.23910254124312266, 0.1169640565000585, 0.028843219862273423, 0.11149164614046343, 0.15905999382185557, 0.034129861900167965, 0.14148998320319386, -0.17291648785029262, 0.14930721710200912, 0.006334696758058991]
|
1,803.08406
|
Key polynomials over valued fields
|
Let K be a field. For a given valuation on K[x], we determine the structure
of its graded algebra and describe its set of key polynomials, in terms of any
given key polynomial of minimal degree. We also characterize valuations not
admitting key polynomials.
|
math.AG
|
let k be a field for a given valuation on kx we determine the structure of its graded algebra and describe its set of key polynomials in terms of any given key polynomial of minimal degree we also characterize valuations not admitting key polynomials
|
[['let', 'k', 'be', 'a', 'field', 'for', 'a', 'given', 'valuation', 'on', 'kx', 'we', 'determine', 'the', 'structure', 'of', 'its', 'graded', 'algebra', 'and', 'describe', 'its', 'set', 'of', 'key', 'polynomials', 'in', 'terms', 'of', 'any', 'given', 'key', 'polynomial', 'of', 'minimal', 'degree', 'we', 'also', 'characterize', 'valuations', 'not', 'admitting', 'key', 'polynomials']]
|
[-0.2149846498346464, 0.0033070411829447203, -0.06551527134566144, -0.025574953104792672, -0.10248724417760968, -0.14771053588695146, -0.02054867561144585, 0.3007579213960774, -0.388827343005687, -0.17508688813541085, 0.07132444752708332, -0.17625370316884734, -0.12579082274301487, 0.20990159520773555, -0.12676580872556026, -0.04775696002550169, -0.041586404348808254, 0.1613889718322422, -0.06040627693503418, -0.3354746642977592, 0.4037902163002979, 0.017987776378338986, 0.1259845160688697, 0.07735138568519191, 0.1886650456792929, 0.01986382066653195, -0.03238496345213868, 0.002918074113867161, -0.21624684198336167, 0.12726765930313955, 0.30108089495280926, 0.16969033602667463, 0.24301746792943132, -0.3614578532393683, -0.08574957665140656, 0.3033649522853507, 0.14564250365153633, -0.047885924297257916, 0.005678342705571346, -0.18742571523497728, 0.15249140561685304, -0.15403565104861627, -0.1939144036626782, -0.1547327656722204, 0.043396949442632664, 0.06920392798598517, -0.291132303263029, -0.06841019283390117, 0.059465052454139695, 0.20168236120265315, -0.05857491450363093, -0.1420297612097453, -0.04768218869999559, 0.07403818598355759, -0.10159752636470577, 0.06793520780576562, 0.05279300905848769, -0.11406382216161794, -0.18298996591263197, 0.42010351350869646, -0.05648670751940121, -0.2572547876889902, 0.061669790143655104, -0.23787807812914252, -0.13349095482209866, 0.10218904810872945, 0.15330460208298807, 0.15194302921141076, -0.061144714075701566, 0.19991759540888862, -0.18034034696492282, 0.11636279387907549, 0.06871963903540745, 0.06986050265417858, 0.17479040016504852, 0.03800841746851802, 0.046331193425099955, 0.14715469181696375, 0.054395192170473325, -0.01365283720025962, -0.391544929896058, -0.2077024052850902, -0.17382463429186662, 0.1200042419847953, -0.19736399026342868, -0.183488206429915, 0.4918430471284823, 0.10053983404809101, 0.1683341474695639, 0.08698738578029654, 0.19829666438851168, 0.122038332002293, 0.06132040227848021, 0.09542140835599805, 0.03542582177430053, 0.2223885965702886, -0.04158545938447456, -0.1491111655804244, 0.13638532845388082, 0.1283196056981317]
|
1,803.08407
|
PlaneMatch: Patch Coplanarity Prediction for Robust RGB-D Reconstruction
|
We introduce a novel RGB-D patch descriptor designed for detecting coplanar
surfaces in SLAM reconstruction. The core of our method is a deep convolutional
neural net that takes in RGB, depth, and normal information of a planar patch
in an image and outputs a descriptor that can be used to find coplanar patches
from other images.We train the network on 10 million triplets of coplanar and
non-coplanar patches, and evaluate on a new coplanarity benchmark created from
commodity RGB-D scans. Experiments show that our learned descriptor outperforms
alternatives extended for this new task by a significant margin. In addition,
we demonstrate the benefits of coplanarity matching in a robust RGBD
reconstruction formulation.We find that coplanarity constraints detected with
our method are sufficient to get reconstruction results comparable to
state-of-the-art frameworks on most scenes, but outperform other methods on
standard benchmarks when combined with a simple keypoint method.
|
cs.CV
|
we introduce a novel rgbd patch descriptor designed for detecting coplanar surfaces in slam reconstruction the core of our method is a deep convolutional neural net that takes in rgb depth and normal information of a planar patch in an image and outputs a descriptor that can be used to find coplanar patches from other imageswe train the network on 10 million triplets of coplanar and noncoplanar patches and evaluate on a new coplanarity benchmark created from commodity rgbd scans experiments show that our learned descriptor outperforms alternatives extended for this new task by a significant margin in addition we demonstrate the benefits of coplanarity matching in a robust rgbd reconstruction formulationwe find that coplanarity constraints detected with our method are sufficient to get reconstruction results comparable to stateoftheart frameworks on most scenes but outperform other methods on standard benchmarks when combined with a simple keypoint method
|
[['we', 'introduce', 'a', 'novel', 'rgbd', 'patch', 'descriptor', 'designed', 'for', 'detecting', 'coplanar', 'surfaces', 'in', 'slam', 'reconstruction', 'the', 'core', 'of', 'our', 'method', 'is', 'a', 'deep', 'convolutional', 'neural', 'net', 'that', 'takes', 'in', 'rgb', 'depth', 'and', 'normal', 'information', 'of', 'a', 'planar', 'patch', 'in', 'an', 'image', 'and', 'outputs', 'a', 'descriptor', 'that', 'can', 'be', 'used', 'to', 'find', 'coplanar', 'patches', 'from', 'other', 'imageswe', 'train', 'the', 'network', 'on', '10', 'million', 'triplets', 'of', 'coplanar', 'and', 'noncoplanar', 'patches', 'and', 'evaluate', 'on', 'a', 'new', 'coplanarity', 'benchmark', 'created', 'from', 'commodity', 'rgbd', 'scans', 'experiments', 'show', 'that', 'our', 'learned', 'descriptor', 'outperforms', 'alternatives', 'extended', 'for', 'this', 'new', 'task', 'by', 'a', 'significant', 'margin', 'in', 'addition', 'we', 'demonstrate', 'the', 'benefits', 'of', 'coplanarity', 'matching', 'in', 'a', 'robust', 'rgbd', 'reconstruction', 'formulationwe', 'find', 'that', 'coplanarity', 'constraints', 'detected', 'with', 'our', 'method', 'are', 'sufficient', 'to', 'get', 'reconstruction', 'results', 'comparable', 'to', 'stateoftheart', 'frameworks', 'on', 'most', 'scenes', 'but', 'outperform', 'other', 'methods', 'on', 'standard', 'benchmarks', 'when', 'combined', 'with', 'a', 'simple', 'keypoint', 'method']]
|
[-0.04110478050049956, -0.03808041265757024, -0.07435580157859838, 0.027429219118434274, -0.06923504989619737, -0.17521076187434007, -0.009073305098877738, 0.46371956345663495, -0.21261535306247462, -0.34378838072186463, 0.05322091250396525, -0.29969834023448705, -0.18085822047129885, 0.22165149671092552, -0.1464866531138908, 0.06174176105789279, 0.21694785288267143, 0.02825878749040198, -0.11295962722713689, -0.26928720588011235, 0.26210461311801403, -0.024738145263567376, 0.32368666071712665, 0.0026765524757362594, 0.1560294008845693, -0.04560894112195182, -0.011232299911183598, 0.04371688116823438, -0.045133201698238375, 0.1632726856998538, 0.24881359491471763, 0.1716477283570048, 0.21697402896665752, -0.43332523532364875, -0.21499189120806653, 0.052260253686866126, 0.12496215433252286, 0.11464315963979198, -0.08166008866519654, -0.37599549166322366, 0.1229514904935806, -0.15207054896586358, 0.006891504738620189, -0.13700244401355133, -0.0168387379548321, -0.0392875277169355, -0.33394988753182225, 0.04811397856516023, 0.06713776073932061, 0.05830292621857091, -0.05868054554185333, -0.10358596846384749, -0.01985051097788478, 0.12118476119362079, -0.0516308582290586, 0.09143515076561615, 0.14775069643984937, -0.17403632015852402, -0.1560543924219243, 0.3600567373134553, -0.11204841723250965, -0.20770494489490424, 0.22068051730397426, -0.04827201543439639, -0.13765182766157572, 0.12418255578624467, 0.25096498772323333, 0.1601724161492176, -0.1483004548614215, -0.021855766660125595, -0.09971591654195361, 0.19223104250834208, 0.06687681389213476, -0.034989653902338845, 0.23059441059929867, 0.253087594574126, 0.0826617982720937, 0.15690559316793304, -0.24410985109569408, -0.050073119038269435, -0.20168696095758717, -0.058094907098303054, -0.19761589144923475, -0.097146856439083, -0.12756590487727296, -0.16625790035173502, 0.415486460105095, 0.2822257833370352, 0.22172139286803566, 0.08258713090358531, 0.40989574369311027, -0.030177232859997488, 0.16767576846536503, 0.09939354981179349, 0.24012537110494833, -0.018161865115510174, 0.05393893287631951, -0.14903596025646013, 0.054641820180982556, 0.06582550698738188]
|
1,803.08408
|
Structure connectivity and substructure connectivity of twisted
hypercubes
|
Let $G$ be a graph and $T$ a certain connected subgraph of $G$. The
$T$-structure connectivity $\kappa(G; T)$ (or resp., $T$-substructure
connectivity $\kappa^{s}(G; T)$) of $G$ is the minimum number of a set of
subgraphs $\mathcal{F}=\{T_{1}, T_{2}, \ldots, T_{m}\}$ (or resp.,
$\mathcal{F}=\{T^{'}_{1}, T^{'}_{2}, \ldots, T^{'}_{m}\}$) such that $T_{i}$ is
isomorphic to $T$ (or resp., $T^{'}_{i}$ is a connected subgraph of $T$) for
every $1\leq i \leq m$, and $\mathcal{F}$'s removal will disconnect $G$. The
twisted hypercube $H_{n}$ is a new variant of hypercubes with asymptotically
optimal diameter introduced by X.D. Zhu. In this paper, we will determine both
$\kappa(H_{n}; T)$ and $\kappa^{s}(H_{n}; T)$ for $T\in\{K_{1,r}, P_{k}\}$,
respectively, where $3\leq r\leq 4$ and $1 \leq k \leq n$.
|
math.CO
|
let g be a graph and t a certain connected subgraph of g the tstructure connectivity kappag t or resp tsubstructure connectivity kappasg t of g is the minimum number of a set of subgraphs mathcalft_1 t_2 ldots t_m or resp mathcalft_1 t_2 ldots t_m such that t_i is isomorphic to t or resp t_i is a connected subgraph of t for every 1leq i leq m and mathcalfs removal will disconnect g the twisted hypercube h_n is a new variant of hypercubes with asymptotically optimal diameter introduced by xd zhu in this paper we will determine both kappah_n t and kappash_n t for tink_1r p_k respectively where 3leq rleq 4 and 1 leq k leq n
|
[['let', 'g', 'be', 'a', 'graph', 'and', 't', 'a', 'certain', 'connected', 'subgraph', 'of', 'g', 'the', 'tstructure', 'connectivity', 'kappag', 't', 'or', 'resp', 'tsubstructure', 'connectivity', 'kappasg', 't', 'of', 'g', 'is', 'the', 'minimum', 'number', 'of', 'a', 'set', 'of', 'subgraphs', 'mathcalft_1', 't_2', 'ldots', 't_m', 'or', 'resp', 'mathcalft_1', 't_2', 'ldots', 't_m', 'such', 'that', 't_i', 'is', 'isomorphic', 'to', 't', 'or', 'resp', 't_i', 'is', 'a', 'connected', 'subgraph', 'of', 't', 'for', 'every', '1leq', 'i', 'leq', 'm', 'and', 'mathcalfs', 'removal', 'will', 'disconnect', 'g', 'the', 'twisted', 'hypercube', 'h_n', 'is', 'a', 'new', 'variant', 'of', 'hypercubes', 'with', 'asymptotically', 'optimal', 'diameter', 'introduced', 'by', 'xd', 'zhu', 'in', 'this', 'paper', 'we', 'will', 'determine', 'both', 'kappah_n', 't', 'and', 'kappash_n', 't', 'for', 'tink_1r', 'p_k', 'respectively', 'where', '3leq', 'rleq', '4', 'and', '1', 'leq', 'k', 'leq', 'n']]
|
[-0.277243443016362, 0.26940315938554704, 0.02557719499288526, -0.05060264608982834, -0.05067995586016748, -0.20322043910605966, 0.04136616533027596, 0.40964706013203667, -0.31542513566923197, -0.24599085778131016, 0.06757001409070133, -0.3711545392538288, -0.06157341491780244, 0.07224917819465711, -0.09650183256599121, -0.07608297537080944, 0.044700819732887406, 0.18951066579237313, -0.003842424586764537, -0.26734376447322056, 0.22859658964443952, -0.10439521941589192, 0.1001793322118049, 0.05586633893212171, 0.09194710929711748, 0.015032964147394523, 0.0683788790941305, 0.06490994954739497, -0.27716454294185106, 0.011735434365359001, 0.28536420080178815, 0.150171532245752, 0.254967381896027, -0.298050253313964, -0.10084063664752259, 0.3015190382554595, 0.1612521403003484, -0.13906850839391285, 0.0905962271291563, -0.18823428414179944, 0.20919127655880793, -0.09029199071457177, -0.06868888728578375, -0.01493076398868912, 0.205371316963075, -0.005370178733885821, -0.3770680952501217, 0.009678928863390215, 0.16756891793504888, 0.05665485689782405, 0.09909313041966275, -0.2345588609834002, -0.1149543496035871, 0.06658368080804523, -0.12426567221492794, 0.18694821220040986, 0.04223793505090206, -0.04375503641079247, -0.09670399151842243, 0.3098719662271573, -0.05225507732081626, -0.07972918518186946, 0.04402765052509494, -0.19304009905733568, -0.17863434557304053, 0.07970185083935835, 0.043329208981179236, 0.25960500435238437, -0.04647239975539768, 0.21796087644803006, -0.0851682130347139, 0.08450775063829497, 0.16218520987812163, -0.011007117768583288, 0.08135863934876397, 0.1188026846752369, 0.21073157736931794, 0.12825421420088137, -0.0009978510840612995, 0.16779760384399975, -0.3752871360712951, -0.12203238859988882, -0.2353199276819526, 0.2102395347943197, -0.17796840273357312, -0.07685797046204763, 0.29725540921624216, 0.06671889772613733, 0.23031718119247152, 0.16006338404674483, 0.14330040266837127, -0.006226129606277807, 0.013248298051101821, 0.21658930688032083, -0.06536866401022833, 0.2529212834633654, -0.052356755294437916, -0.18877189875846462, -0.013585027500604545, 0.1761677887199247]
|
1,803.08409
|
Quality expectations of machine translation
|
Machine Translation (MT) is being deployed for a range of use-cases by
millions of people on a daily basis. There should, therefore, be no doubt as to
the utility of MT. However, not everyone is convinced that MT can be useful,
especially as a productivity enhancer for human translators. In this chapter, I
address this issue, describing how MT is currently deployed, how its output is
evaluated and how this could be enhanced, especially as MT quality itself
improves. Central to these issues is the acceptance that there is no longer a
single 'gold standard' measure of quality, such that the situation in which MT
is deployed needs to be borne in mind, especially with respect to the expected
'shelf-life' of the translation itself.
|
cs.CL
|
machine translation mt is being deployed for a range of usecases by millions of people on a daily basis there should therefore be no doubt as to the utility of mt however not everyone is convinced that mt can be useful especially as a productivity enhancer for human translators in this chapter i address this issue describing how mt is currently deployed how its output is evaluated and how this could be enhanced especially as mt quality itself improves central to these issues is the acceptance that there is no longer a single gold standard measure of quality such that the situation in which mt is deployed needs to be borne in mind especially with respect to the expected shelflife of the translation itself
|
[['machine', 'translation', 'mt', 'is', 'being', 'deployed', 'for', 'a', 'range', 'of', 'usecases', 'by', 'millions', 'of', 'people', 'on', 'a', 'daily', 'basis', 'there', 'should', 'therefore', 'be', 'no', 'doubt', 'as', 'to', 'the', 'utility', 'of', 'mt', 'however', 'not', 'everyone', 'is', 'convinced', 'that', 'mt', 'can', 'be', 'useful', 'especially', 'as', 'a', 'productivity', 'enhancer', 'for', 'human', 'translators', 'in', 'this', 'chapter', 'i', 'address', 'this', 'issue', 'describing', 'how', 'mt', 'is', 'currently', 'deployed', 'how', 'its', 'output', 'is', 'evaluated', 'and', 'how', 'this', 'could', 'be', 'enhanced', 'especially', 'as', 'mt', 'quality', 'itself', 'improves', 'central', 'to', 'these', 'issues', 'is', 'the', 'acceptance', 'that', 'there', 'is', 'no', 'longer', 'a', 'single', 'gold', 'standard', 'measure', 'of', 'quality', 'such', 'that', 'the', 'situation', 'in', 'which', 'mt', 'is', 'deployed', 'needs', 'to', 'be', 'borne', 'in', 'mind', 'especially', 'with', 'respect', 'to', 'the', 'expected', 'shelflife', 'of', 'the', 'translation', 'itself']]
|
[-0.0988509227266355, 0.14329289044854382, -0.062029552315512014, 0.10474590660868993, -0.10470738889641999, -0.15270041016816732, 0.0569019912772121, 0.40897912317286095, -0.24775133531300292, -0.3178010462739152, 0.14961982398357754, -0.2625727803341203, -0.13530905196638476, 0.2550416717816505, -0.16358579729398293, 0.022755300205092005, 0.09635570517557132, 0.10992764908775327, -0.009664501987337586, -0.2729038257084246, 0.26056661116590185, 0.11811053913251887, 0.31197493904337825, 0.07371052300497409, 0.05462256244537721, -0.03243692471991263, 0.02369752657672976, 0.04477066761859122, -0.016198112021048736, 0.15242416450693722, 0.34643179034784194, 0.20165008690673858, 0.3190326365753032, -0.3808967675563068, -0.18267664740673237, 0.10467615441208886, 0.14566013256027813, 0.034815381937322296, -0.029202611550816424, -0.23829466471966776, 0.13145480088273725, -0.16789718679783325, -0.11442714316405228, -0.0716940745365836, 0.0074419696973035895, -0.006419393689289028, -0.23317837031349736, -0.012942406052212802, 0.06315289455373967, 0.10353223676675923, 0.03063121174308171, -0.07483803673512152, -0.0024616340224090363, 0.22005469797764934, 0.10615859804261897, 0.13227943022690353, 0.16649250742874197, -0.15218533517139393, -0.09833444656443692, 0.42271875869482756, -0.06672983161444145, -0.22381966025568545, 0.18532684823918727, -0.11069765086698856, -0.14465049408646602, 0.053555278285432814, 0.1807033880914171, 0.05367587633138042, -0.2171085040280295, 0.061789875068502774, -0.04246036425953911, 0.23402538322261535, 0.07288040783286336, -0.017858246970365966, 0.21787448496287387, 0.22868436074725562, 0.022830402118063742, 0.08723851989282505, -0.05031019435691339, -0.07503165187776059, -0.2347682378695613, -0.17138511555517214, -0.1697442725323321, 0.05708031168016474, -0.01057776983443839, -0.11930293411264316, 0.335057576190945, 0.20823233850645803, 0.15675691563275554, 0.031867137187228146, 0.2839713752290399, 0.08360746678344215, 0.14748478093984416, 0.04329050942549422, 0.24649680171146868, -0.02430419125519092, 0.1649036216512022, -0.14630658449905534, 0.12472641790537314, -0.036010818125965495]
|
1,803.0841
|
A Smoke Removal Method for Laparoscopic Images
|
In laparoscopic surgery, image quality can be severely degraded by surgical
smoke, which not only introduces error for the image processing (used in image
guided surgery), but also reduces the visibility of the surgeons. In this
paper, we propose to enhance the laparoscopic images by decomposing them into
unwanted smoke part and enhanced part using a variational approach. The
proposed method relies on the observation that smoke has low contrast and low
inter-channel differences. A cost function is defined based on this prior
knowledge and is solved using an augmented Lagrangian method. The obtained
unwanted smoke component is then subtracted from the original degraded image,
resulting in the enhanced image. The obtained quantitative scores in terms of
FADE, JNBM and RE metrics show that our proposed method performs rather well.
Furthermore, the qualitative visual inspection of the results show that it
removes smoke effectively from the laparoscopic images.
|
cs.CV
|
in laparoscopic surgery image quality can be severely degraded by surgical smoke which not only introduces error for the image processing used in image guided surgery but also reduces the visibility of the surgeons in this paper we propose to enhance the laparoscopic images by decomposing them into unwanted smoke part and enhanced part using a variational approach the proposed method relies on the observation that smoke has low contrast and low interchannel differences a cost function is defined based on this prior knowledge and is solved using an augmented lagrangian method the obtained unwanted smoke component is then subtracted from the original degraded image resulting in the enhanced image the obtained quantitative scores in terms of fade jnbm and re metrics show that our proposed method performs rather well furthermore the qualitative visual inspection of the results show that it removes smoke effectively from the laparoscopic images
|
[['in', 'laparoscopic', 'surgery', 'image', 'quality', 'can', 'be', 'severely', 'degraded', 'by', 'surgical', 'smoke', 'which', 'not', 'only', 'introduces', 'error', 'for', 'the', 'image', 'processing', 'used', 'in', 'image', 'guided', 'surgery', 'but', 'also', 'reduces', 'the', 'visibility', 'of', 'the', 'surgeons', 'in', 'this', 'paper', 'we', 'propose', 'to', 'enhance', 'the', 'laparoscopic', 'images', 'by', 'decomposing', 'them', 'into', 'unwanted', 'smoke', 'part', 'and', 'enhanced', 'part', 'using', 'a', 'variational', 'approach', 'the', 'proposed', 'method', 'relies', 'on', 'the', 'observation', 'that', 'smoke', 'has', 'low', 'contrast', 'and', 'low', 'interchannel', 'differences', 'a', 'cost', 'function', 'is', 'defined', 'based', 'on', 'this', 'prior', 'knowledge', 'and', 'is', 'solved', 'using', 'an', 'augmented', 'lagrangian', 'method', 'the', 'obtained', 'unwanted', 'smoke', 'component', 'is', 'then', 'subtracted', 'from', 'the', 'original', 'degraded', 'image', 'resulting', 'in', 'the', 'enhanced', 'image', 'the', 'obtained', 'quantitative', 'scores', 'in', 'terms', 'of', 'fade', 'jnbm', 'and', 're', 'metrics', 'show', 'that', 'our', 'proposed', 'method', 'performs', 'rather', 'well', 'furthermore', 'the', 'qualitative', 'visual', 'inspection', 'of', 'the', 'results', 'show', 'that', 'it', 'removes', 'smoke', 'effectively', 'from', 'the', 'laparoscopic', 'images']]
|
[-0.036989195707894, 0.019878761417673564, -0.10067918099665722, 0.0541965191234315, -0.07188281788471707, -0.11620365287855167, 0.023578473798404796, 0.3947083273788496, -0.25662487191559913, -0.3424196631337206, 0.11632845328794475, -0.2594256272197378, -0.22612358391170903, 0.2124131803248762, -0.20006038255508052, 0.04796447502100701, 0.13663661990593484, 0.030907784610809313, -0.04977549477298206, -0.26639826314485804, 0.2817955553297232, 0.04164077977643532, 0.3171338864608484, 0.06834137570714818, 0.14016068492284312, 0.03655275721799861, -0.08864747160146026, 0.04224024645249252, -0.03980077299693097, 0.12850777541610356, 0.2525475150240319, 0.18635497716030575, 0.24492105089609517, -0.41835285075084894, -0.23890598039031916, 0.05158109307054709, 0.16938765118410176, 0.09003008792389083, -0.06804510404533615, -0.3814523344238599, 0.10167784656264953, -0.12028637166740055, -0.00837310019375275, -0.09586594829836316, -0.09541216508333324, -0.04350946554724051, -0.26741219112700243, 0.08345229572915079, 0.07248804605246022, 0.06965781477134243, -0.06624024644094918, -0.08385923738293603, -0.028351761320713577, 0.17755897052358, 0.03798743601742701, 0.08153916215270657, 0.1723218261435324, -0.1771179909701459, -0.05370665312947414, 0.3855512526937995, -0.07471030735771875, -0.23979364159409286, 0.1614578637202606, -0.05932755802669341, -0.0935572236332865, 0.1931389640117077, 0.1567169316841581, 0.10492140161456401, -0.132455963844142, 0.005458123315534346, 0.004125633796512269, 0.19544462623948955, 0.0831201425119981, -0.026463503337965735, 0.12374286146416348, 0.15630228712332758, 0.03681368472016588, 0.18672614055606504, -0.15183284234585792, -0.002286257611929762, -0.23903481147828556, -0.16087740808163078, -0.2191429937014445, -0.039971473178454855, -0.06604132219653285, -0.12972508747523434, 0.38930638509542764, 0.21635896218845582, 0.200711687662493, 0.042395437019877136, 0.40872418224101975, 0.09670725674289248, 0.11154091426727306, 0.029471453678395067, 0.21161445977837862, -0.005222140451842526, 0.10871147359943106, -0.20392745977970866, 0.06241590227792356, 0.0822414942434197]
|
1,803.08411
|
Charge transfer excitations with range separated functionals using
improved virtual orbitals
|
We present an implementation of range separated functionals utilizing the
Slater-function on grids in real space in the projector augmented waves method.
The screened Poisson equation is solved to evaluate the necessary screened
exchange integrals on Cartesian grids. The implementation is verified against
existing literature and applied to the description of charge transfer
excitations. We find very slow convergence for calculations within linear
response time-dependent density functional theory and unoccupied orbitals of
the canonical Fock operator. Convergence can be severely improved by using
Huzinaga's virtual orbitals instead. This combination furthermore enables an
accurate determination of long-range charge transfer excitations by means of
ground-state calculations.
|
physics.comp-ph physics.chem-ph
|
we present an implementation of range separated functionals utilizing the slaterfunction on grids in real space in the projector augmented waves method the screened poisson equation is solved to evaluate the necessary screened exchange integrals on cartesian grids the implementation is verified against existing literature and applied to the description of charge transfer excitations we find very slow convergence for calculations within linear response timedependent density functional theory and unoccupied orbitals of the canonical fock operator convergence can be severely improved by using huzinagas virtual orbitals instead this combination furthermore enables an accurate determination of longrange charge transfer excitations by means of groundstate calculations
|
[['we', 'present', 'an', 'implementation', 'of', 'range', 'separated', 'functionals', 'utilizing', 'the', 'slaterfunction', 'on', 'grids', 'in', 'real', 'space', 'in', 'the', 'projector', 'augmented', 'waves', 'method', 'the', 'screened', 'poisson', 'equation', 'is', 'solved', 'to', 'evaluate', 'the', 'necessary', 'screened', 'exchange', 'integrals', 'on', 'cartesian', 'grids', 'the', 'implementation', 'is', 'verified', 'against', 'existing', 'literature', 'and', 'applied', 'to', 'the', 'description', 'of', 'charge', 'transfer', 'excitations', 'we', 'find', 'very', 'slow', 'convergence', 'for', 'calculations', 'within', 'linear', 'response', 'timedependent', 'density', 'functional', 'theory', 'and', 'unoccupied', 'orbitals', 'of', 'the', 'canonical', 'fock', 'operator', 'convergence', 'can', 'be', 'severely', 'improved', 'by', 'using', 'huzinagas', 'virtual', 'orbitals', 'instead', 'this', 'combination', 'furthermore', 'enables', 'an', 'accurate', 'determination', 'of', 'longrange', 'charge', 'transfer', 'excitations', 'by', 'means', 'of', 'groundstate', 'calculations']]
|
[-0.12403244403271944, 0.08945367477780582, -0.049171295153963214, 0.09952101584035429, -0.012504875002538456, -0.0814195272110987, 0.04648278695508363, 0.3819903319190238, -0.267043429294455, -0.2746162776123075, -0.0002178374025057636, -0.27703445379202274, -0.11035442396121867, 0.15370516781695187, 0.016458123970283744, 0.03900097064358894, 0.09022344113327563, -0.06545521561786824, -0.1441893639481243, -0.19708588071550956, 0.3017160926132883, 0.07267643729973511, 0.2733725596986273, 0.06305489257690222, 0.0781576002619284, 0.08436443569485609, 0.0007280429560398939, 0.010223762547385003, -0.1110243076394659, 0.14546325200582014, 0.25433731899258916, 0.03917186020636091, 0.2402887688264908, -0.5023679421009386, -0.18682847533137628, 0.001711812646438678, 0.18078811805439637, 0.1341510986562307, -0.03696175993593665, -0.2891260710380533, 0.03122484856773072, -0.21950807487226875, -0.1457830166362007, -0.2349055241793394, -0.029146831838742775, 0.03764253867534446, -0.2946339307544643, 0.0935896067313996, -0.04847874235494208, 0.047282734843440054, -0.11620487592310882, -0.11630980661321505, -0.043254985884927655, 0.0674617632529607, -0.013465641965797427, 0.036490636083352214, 0.13951472480160496, -0.06842456222447628, -0.08864817429133051, 0.37341637434620484, -0.07266532764404866, -0.26940772130939306, 0.1429029503453742, -0.10660445822548925, -0.07837362962491884, 0.1529147668796427, 0.12455390097103174, 0.15824831078997723, -0.14298046900726416, 0.15088404558813565, 0.03476356991050838, 0.16368119538916895, 0.03265119149742246, 0.015641162646751777, 0.13569333039078058, 0.1409433648211644, 0.07060375645318452, 0.08991909872480285, -0.06456071261317109, -0.16487431994128024, -0.26873678378030363, -0.11445587544057714, -0.27068421887872995, 0.0196138890094909, -0.06594901391637155, -0.19655692281530185, 0.39158022682657284, 0.14778899523320005, 0.09459800566044435, 0.0021710668521586294, 0.31840235428592445, 0.18584849536030865, 0.06527560167288517, 0.0629235356863515, 0.20062174831115293, 0.18409924381229953, 0.0642430122608465, -0.25712742574065556, 0.026777525071748624, 0.13048889532037006]
|
1,803.08412
|
Group Sparsity Residual with Non-Local Samples for Image Denoising
|
Inspired by group-based sparse coding, recently proposed group sparsity
residual (GSR) scheme has demonstrated superior performance in image
processing. However, one challenge in GSR is to estimate the residual by using
a proper reference of the group-based sparse coding (GSC), which is desired to
be as close to the truth as possible. Previous researches utilized the
estimations from other algorithms (i.e., GMM or BM3D), which are either not
accurate or too slow. In this paper, we propose to use the Non-Local Samples
(NLS) as reference in the GSR regime for image denoising, thus termed GSR-NLS.
More specifically, we first obtain a good estimation of the group sparse
coefficients by the image nonlocal self-similarity, and then solve the GSR
model by an effective iterative shrinkage algorithm. Experimental results
demonstrate that the proposed GSR-NLS not only outperforms many
state-of-the-art methods, but also delivers the competitive advantage of speed.
|
cs.CV
|
inspired by groupbased sparse coding recently proposed group sparsity residual gsr scheme has demonstrated superior performance in image processing however one challenge in gsr is to estimate the residual by using a proper reference of the groupbased sparse coding gsc which is desired to be as close to the truth as possible previous researches utilized the estimations from other algorithms ie gmm or bm3d which are either not accurate or too slow in this paper we propose to use the nonlocal samples nls as reference in the gsr regime for image denoising thus termed gsrnls more specifically we first obtain a good estimation of the group sparse coefficients by the image nonlocal selfsimilarity and then solve the gsr model by an effective iterative shrinkage algorithm experimental results demonstrate that the proposed gsrnls not only outperforms many stateoftheart methods but also delivers the competitive advantage of speed
|
[['inspired', 'by', 'groupbased', 'sparse', 'coding', 'recently', 'proposed', 'group', 'sparsity', 'residual', 'gsr', 'scheme', 'has', 'demonstrated', 'superior', 'performance', 'in', 'image', 'processing', 'however', 'one', 'challenge', 'in', 'gsr', 'is', 'to', 'estimate', 'the', 'residual', 'by', 'using', 'a', 'proper', 'reference', 'of', 'the', 'groupbased', 'sparse', 'coding', 'gsc', 'which', 'is', 'desired', 'to', 'be', 'as', 'close', 'to', 'the', 'truth', 'as', 'possible', 'previous', 'researches', 'utilized', 'the', 'estimations', 'from', 'other', 'algorithms', 'ie', 'gmm', 'or', 'bm3d', 'which', 'are', 'either', 'not', 'accurate', 'or', 'too', 'slow', 'in', 'this', 'paper', 'we', 'propose', 'to', 'use', 'the', 'nonlocal', 'samples', 'nls', 'as', 'reference', 'in', 'the', 'gsr', 'regime', 'for', 'image', 'denoising', 'thus', 'termed', 'gsrnls', 'more', 'specifically', 'we', 'first', 'obtain', 'a', 'good', 'estimation', 'of', 'the', 'group', 'sparse', 'coefficients', 'by', 'the', 'image', 'nonlocal', 'selfsimilarity', 'and', 'then', 'solve', 'the', 'gsr', 'model', 'by', 'an', 'effective', 'iterative', 'shrinkage', 'algorithm', 'experimental', 'results', 'demonstrate', 'that', 'the', 'proposed', 'gsrnls', 'not', 'only', 'outperforms', 'many', 'stateoftheart', 'methods', 'but', 'also', 'delivers', 'the', 'competitive', 'advantage', 'of', 'speed']]
|
[-0.01620230439988922, -0.020523809820487158, -0.10730294578631099, 0.0553241089413253, -0.11680702073135762, -0.1999939128743588, 0.02151971844674942, 0.4266914089675993, -0.2723950681134334, -0.2804213620955933, 0.1417808266188432, -0.21318654169509602, -0.2214012056053131, 0.20491488161658505, -0.16430749734394745, 0.1245644052428866, 0.09197498158512947, 0.06651734030391607, -0.09730628535625227, -0.281223241550227, 0.23889211687977271, 0.08201582393505508, 0.34668794529150343, -0.048102480301167816, 0.1354446684385443, 0.002636234901223765, -0.04968991555748895, 0.023843891323647566, -0.03961279408339477, 0.12866817116446327, 0.2814016353594424, 0.14998344744607392, 0.30933679453058477, -0.3980501690465543, -0.2638893797734959, 0.10615852759737107, 0.16314025448648156, 0.11309996430160633, -0.06685678570213188, -0.3244377726676046, 0.12183498298650698, -0.15859661161246347, -0.00417223649047729, -0.15018503385039772, -0.025222411148004338, 0.005514920187124517, -0.3464093552837666, 0.11600595013240106, 0.058066736551053405, 0.005411171910559965, -0.0450196709643933, -0.14143198835679666, 0.0537172715477128, 0.11707662331819949, 0.03844136167754186, 0.054581692409960345, 0.0990985167833666, -0.1474323343686087, -0.11555302153849173, 0.38683474527594325, -0.09180363699690336, -0.22646986164100882, 0.1723108839371687, -0.04550248866467478, -0.13740302326591014, 0.14834196695462903, 0.1692830209406869, 0.1021476379246451, -0.16014847402564353, 0.023566467903745232, -0.04911565070506185, 0.1846855680923909, 0.06497437971261712, 0.008445747180909772, 0.10276120366082371, 0.17982908949327087, 0.09105797940598374, 0.10744790357219042, -0.13027166923145866, -0.03360068635932597, -0.19513396033370453, -0.08365875744321885, -0.23748921438366072, -0.05921916616090231, -0.09525651984980261, -0.143232412516631, 0.3820834927732146, 0.22783419700054866, 0.18221981021795525, 0.06942532517617413, 0.3796095826999388, 0.0744907711414271, 0.07696316005644298, 0.09111925742601873, 0.24226198807688584, 0.09270054385221253, 0.05961216287687421, -0.19416301976080932, 0.09111963493160147, 0.08681031779108]
|
1,803.08413
|
Transient dynamics of strongly coupled spin vortex pairs: effects of
anharmonicity and resonant excitation on inertial switching
|
Spin vortices in magnetic nanopillars are used as GHz oscillators, with
frequency however essentially fixed in fabrication. We demonstrate a model
system of a two-vortex nanopillar, in which the resonance frequency can be
changed by an order of magnitude, without using high dc magnetic fields. The
effect is due to switching between the two stable states of the vortex pair,
which we show can be done with low-amplitude fields of sub-ns duration. We
detail the relevant vortex-core dynamics and explain how field anharmonicity
and phase control can be used to enhance the performance.
|
cond-mat.mes-hall
|
spin vortices in magnetic nanopillars are used as ghz oscillators with frequency however essentially fixed in fabrication we demonstrate a model system of a twovortex nanopillar in which the resonance frequency can be changed by an order of magnitude without using high dc magnetic fields the effect is due to switching between the two stable states of the vortex pair which we show can be done with lowamplitude fields of subns duration we detail the relevant vortexcore dynamics and explain how field anharmonicity and phase control can be used to enhance the performance
|
[['spin', 'vortices', 'in', 'magnetic', 'nanopillars', 'are', 'used', 'as', 'ghz', 'oscillators', 'with', 'frequency', 'however', 'essentially', 'fixed', 'in', 'fabrication', 'we', 'demonstrate', 'a', 'model', 'system', 'of', 'a', 'twovortex', 'nanopillar', 'in', 'which', 'the', 'resonance', 'frequency', 'can', 'be', 'changed', 'by', 'an', 'order', 'of', 'magnitude', 'without', 'using', 'high', 'dc', 'magnetic', 'fields', 'the', 'effect', 'is', 'due', 'to', 'switching', 'between', 'the', 'two', 'stable', 'states', 'of', 'the', 'vortex', 'pair', 'which', 'we', 'show', 'can', 'be', 'done', 'with', 'lowamplitude', 'fields', 'of', 'subns', 'duration', 'we', 'detail', 'the', 'relevant', 'vortexcore', 'dynamics', 'and', 'explain', 'how', 'field', 'anharmonicity', 'and', 'phase', 'control', 'can', 'be', 'used', 'to', 'enhance', 'the', 'performance']]
|
[-0.17888609167709146, 0.21205578325206778, -0.042396027704961196, 0.006323856748490324, -0.05603425303393955, -0.10994086830165758, 0.024421996026430078, 0.4351207878320448, -0.2673040266719557, -0.32927648646015956, 0.07575507998411414, -0.18168439819747884, -0.12851322838856327, 0.2357557425050125, -0.022613044948347153, 0.024782403890464093, 0.01612834495201867, 0.010954866353522545, -0.016157257115288128, -0.2022374499469034, 0.2663683836268241, 0.020258104493741387, 0.3057785915230872, 0.043750147590593945, 0.07521479906293974, -0.04312631123453899, 0.10012236363705128, 0.05559228220078293, -0.08459909817564391, 0.04097101475570291, 0.23984504110300012, -0.022210697583373514, 0.20661828856194212, -0.4808851344090316, -0.19819010446669275, 0.10398573575601462, 0.17079054497142312, 0.16246744883196648, -0.015608747389608173, -0.2872315912797887, 0.0792769829452198, -0.14907309799505178, -0.130088632751096, -0.11511186730637345, -0.026020130456765732, 0.0669875845691109, -0.2790823109467985, 0.07129181288583304, 0.05248632974251704, 0.08281726591409214, -0.05936536400063184, -0.03743491316356907, -0.05728320959675055, 0.10211308384113894, 0.026978812196732607, 0.042254116140826734, 0.17894511474096167, -0.11414083611140008, -0.1740369039377378, 0.34672603780724187, -0.11298809698607612, -0.1695301320744298, 0.15633184463787142, -0.17746342051153383, -0.027305444557299857, 0.14115941495464374, 0.17186390474358554, 0.09388737729500218, -0.12063703717794069, 0.01992453389265324, 0.06528227810337338, 0.22729950093774384, 0.09164846203319969, 0.05354659663893843, 0.26353176270851925, 0.19404711762583385, 0.04429155040372123, 0.1875238311389381, -0.14188310360756293, -0.05546470307644897, -0.2275217555823826, -0.1159883156538971, -0.18555751492980346, 0.04418183845137396, -0.04970229593304647, -0.11515620464999829, 0.4439635066195361, 0.1827507915766409, 0.1887523044944085, -0.07615408180932444, 0.27573869517073035, 0.16219979252601144, 0.09214298310939983, 0.02956765036909811, 0.2933480332014702, 0.17582622047523738, 0.1135381627752776, -0.2893156193807641, 0.02382405725638232, -0.03360370891068571]
|
1,803.08414
|
Buried object detection from B-scan ground penetrating radar data using
Faster-RCNN
|
In this paper, we adapt the Faster-RCNN framework for the detection of
underground buried objects (i.e. hyperbola reflections) in B-scan ground
penetrating radar (GPR) images. Due to the lack of real data for training, we
propose to incorporate more simulated radargrams generated from different
configurations using the gprMax toolbox. Our designed CNN is first pre-trained
on the grayscale Cifar-10 database. Then, the Faster-RCNN framework based on
the pre-trained CNN is trained and fine-tuned on both real and simulated GPR
data. Preliminary detection results show that the proposed technique can
provide significant improvements compared to classical computer vision methods
and hence becomes quite promising to deal with this kind of specific GPR data
even with few training samples.
|
cs.CV
|
in this paper we adapt the fasterrcnn framework for the detection of underground buried objects ie hyperbola reflections in bscan ground penetrating radar gpr images due to the lack of real data for training we propose to incorporate more simulated radargrams generated from different configurations using the gprmax toolbox our designed cnn is first pretrained on the grayscale cifar10 database then the fasterrcnn framework based on the pretrained cnn is trained and finetuned on both real and simulated gpr data preliminary detection results show that the proposed technique can provide significant improvements compared to classical computer vision methods and hence becomes quite promising to deal with this kind of specific gpr data even with few training samples
|
[['in', 'this', 'paper', 'we', 'adapt', 'the', 'fasterrcnn', 'framework', 'for', 'the', 'detection', 'of', 'underground', 'buried', 'objects', 'ie', 'hyperbola', 'reflections', 'in', 'bscan', 'ground', 'penetrating', 'radar', 'gpr', 'images', 'due', 'to', 'the', 'lack', 'of', 'real', 'data', 'for', 'training', 'we', 'propose', 'to', 'incorporate', 'more', 'simulated', 'radargrams', 'generated', 'from', 'different', 'configurations', 'using', 'the', 'gprmax', 'toolbox', 'our', 'designed', 'cnn', 'is', 'first', 'pretrained', 'on', 'the', 'grayscale', 'cifar10', 'database', 'then', 'the', 'fasterrcnn', 'framework', 'based', 'on', 'the', 'pretrained', 'cnn', 'is', 'trained', 'and', 'finetuned', 'on', 'both', 'real', 'and', 'simulated', 'gpr', 'data', 'preliminary', 'detection', 'results', 'show', 'that', 'the', 'proposed', 'technique', 'can', 'provide', 'significant', 'improvements', 'compared', 'to', 'classical', 'computer', 'vision', 'methods', 'and', 'hence', 'becomes', 'quite', 'promising', 'to', 'deal', 'with', 'this', 'kind', 'of', 'specific', 'gpr', 'data', 'even', 'with', 'few', 'training', 'samples']]
|
[0.01448322497566955, -0.011110735058179524, -0.044103146106816635, 0.06312142456752351, -0.11627042028479852, -0.18204643332168588, -0.014009414207882797, 0.42593821230479795, -0.23548258115879744, -0.3500416203378103, 0.10493167825580503, -0.2836424860402814, -0.1800416314528666, 0.2676312072027443, -0.13178351826261347, 0.09585350846999094, 0.19142608103366235, 0.02542081180562934, -0.06624179733837517, -0.2940623421086651, 0.2816034051366787, 0.041791120906256966, 0.3740377933041662, 0.01783273307383697, 0.12838804500842166, -0.02716620184449304, -0.03296974720035353, -0.0497073227714779, -0.0391119370522683, 0.1427113531818056, 0.3143102559678925, 0.18722200605413344, 0.2340472158140097, -0.46208047691700804, -0.2124278908655143, 0.10416848726797467, 0.11038104641354746, 0.12024006756563854, -0.08221479351037783, -0.4243487132490318, 0.11875836028514478, -0.13365556375704643, 0.012060565384439169, -0.1402053119789841, -0.0498824467530283, -0.04305258501543958, -0.29459906064578867, 0.02189100921774904, 0.026082418305783443, 0.08166188076456897, -0.0829963196729684, -0.1263847273464004, 0.0074196107641785825, 0.13831199262625513, 0.021878866243980125, 0.04454089110542057, 0.1311489530464905, -0.16108760847829473, -0.09370790111173628, 0.36671541436997235, -0.06376071562831345, -0.18442907840268224, 0.20858411682156736, -0.052573523404570215, -0.12122280682779403, 0.12127206315342177, 0.2665035327355194, 0.11626414498553062, -0.13520169136329338, -0.00261700306332503, -0.04879784373104827, 0.1773903584983359, 0.053643633412997216, -0.07822648835424174, 0.14195740512178207, 0.2571600724616621, 0.005463669307900067, 0.18326435329862192, -0.25180384504974973, -0.03889513512452444, -0.22524961997937953, -0.08155187585741346, -0.23660787585008347, -0.033250466586114504, -0.06628226328396904, -0.13094595502106807, 0.36925818841968083, 0.27350739710011546, 0.19219885868394476, 0.11058390366598073, 0.393566565349316, -0.011116101576660115, 0.1332176971830364, 0.06607677196212208, 0.1806734552881561, 0.010537283753769265, 0.13336634368866554, -0.12626238441309676, 0.041662860977907196, -0.016185549199262746]
|
1,803.08415
|
Signaling Game-based Misbehavior Inspection in V2I-enabled Highway
Operations
|
Vehicle-to-Infrastructure (V2I) communications are increasingly supporting
highway operations such as electronic toll collection, carpooling, and vehicle
platooning. In this paper we study the incentives of strategic misbehavior by
individual vehicles who can exploit the security vulnerabilities in V2I
communications and negatively impact the highway operations. We consider a
V2I-enabled highway segment facing two classes of vehicles (agent populations),
each with an authorized access to one server (subset of lanes). Vehicles are
strategic in that they can misreport their class (type) to the system operator
and get an unauthorized access to the server dedicated to the other class. This
misbehavior causes additional congestion externality on the compliant vehicles,
and thus, needs to be deterred. We focus on an environment where the operator
is able to inspect the vehicles for misbehavior. The inspection is costly and
successful detection incurs a fine on the misbehaving vehicle. We formulate a
signaling game to study the strategic interaction between the vehicle classes
and the operator. Our equilibrium analysis provides conditions on the cost
parameters that govern the vehicles' incentive to misbehave or not. We also
determine the operator's equilibrium inspection strategy.
|
cs.GT
|
vehicletoinfrastructure v2i communications are increasingly supporting highway operations such as electronic toll collection carpooling and vehicle platooning in this paper we study the incentives of strategic misbehavior by individual vehicles who can exploit the security vulnerabilities in v2i communications and negatively impact the highway operations we consider a v2ienabled highway segment facing two classes of vehicles agent populations each with an authorized access to one server subset of lanes vehicles are strategic in that they can misreport their class type to the system operator and get an unauthorized access to the server dedicated to the other class this misbehavior causes additional congestion externality on the compliant vehicles and thus needs to be deterred we focus on an environment where the operator is able to inspect the vehicles for misbehavior the inspection is costly and successful detection incurs a fine on the misbehaving vehicle we formulate a signaling game to study the strategic interaction between the vehicle classes and the operator our equilibrium analysis provides conditions on the cost parameters that govern the vehicles incentive to misbehave or not we also determine the operators equilibrium inspection strategy
|
[['vehicletoinfrastructure', 'v2i', 'communications', 'are', 'increasingly', 'supporting', 'highway', 'operations', 'such', 'as', 'electronic', 'toll', 'collection', 'carpooling', 'and', 'vehicle', 'platooning', 'in', 'this', 'paper', 'we', 'study', 'the', 'incentives', 'of', 'strategic', 'misbehavior', 'by', 'individual', 'vehicles', 'who', 'can', 'exploit', 'the', 'security', 'vulnerabilities', 'in', 'v2i', 'communications', 'and', 'negatively', 'impact', 'the', 'highway', 'operations', 'we', 'consider', 'a', 'v2ienabled', 'highway', 'segment', 'facing', 'two', 'classes', 'of', 'vehicles', 'agent', 'populations', 'each', 'with', 'an', 'authorized', 'access', 'to', 'one', 'server', 'subset', 'of', 'lanes', 'vehicles', 'are', 'strategic', 'in', 'that', 'they', 'can', 'misreport', 'their', 'class', 'type', 'to', 'the', 'system', 'operator', 'and', 'get', 'an', 'unauthorized', 'access', 'to', 'the', 'server', 'dedicated', 'to', 'the', 'other', 'class', 'this', 'misbehavior', 'causes', 'additional', 'congestion', 'externality', 'on', 'the', 'compliant', 'vehicles', 'and', 'thus', 'needs', 'to', 'be', 'deterred', 'we', 'focus', 'on', 'an', 'environment', 'where', 'the', 'operator', 'is', 'able', 'to', 'inspect', 'the', 'vehicles', 'for', 'misbehavior', 'the', 'inspection', 'is', 'costly', 'and', 'successful', 'detection', 'incurs', 'a', 'fine', 'on', 'the', 'misbehaving', 'vehicle', 'we', 'formulate', 'a', 'signaling', 'game', 'to', 'study', 'the', 'strategic', 'interaction', 'between', 'the', 'vehicle', 'classes', 'and', 'the', 'operator', 'our', 'equilibrium', 'analysis', 'provides', 'conditions', 'on', 'the', 'cost', 'parameters', 'that', 'govern', 'the', 'vehicles', 'incentive', 'to', 'misbehave', 'or', 'not', 'we', 'also', 'determine', 'the', 'operators', 'equilibrium', 'inspection', 'strategy']]
|
[-0.23111271790757373, 0.03766086533613742, -0.034671908435789316, 0.05954495120000698, -0.12711341131629572, -0.22895409414746068, 0.16065117226020006, 0.42122484620761225, -0.26584061058741565, -0.30975796626629054, 0.12888665976871208, -0.31085712728594, -0.13416164971611186, 0.11420610343559166, -0.20382252814046836, 0.030744745233725456, 0.07038724958217023, 0.043594347947824595, 0.09388735892811186, -0.24961639242120892, 0.32084970461909434, 0.023188031175350014, 0.2864132568340849, 0.09362220950298816, 0.05602156788463125, 0.033496120749544854, 0.005244253303956341, -0.015106741961082318, -0.08055763739653599, 0.12019377093434938, 0.3246110766877521, 0.17445840694110942, 0.3374838675095423, -0.49619104477602083, -0.1730443755466793, 0.16139011674535436, 0.10933353597348607, 0.04448719833524445, 0.010805099225300993, -0.3597018161171896, 0.09346019931993371, -0.25207353860165016, -0.09832075426820666, -0.03412880869330587, -0.014548701232588673, 0.06078752195210876, -0.2903947993685064, -0.10501430365524406, -0.019689167892195384, 0.06097769985176824, -0.05398102651878789, -0.02155913343288105, -0.01972363530532331, 0.253246687486063, 0.046412220757731514, -0.04363558733634449, 0.20600689512904027, -0.15484169963243846, -0.14268418010827658, 0.39471521356923356, 0.04486721700334267, -0.18821451489788454, 0.18942863331553902, -0.016066558232430268, -0.13553780195353604, 0.06518071209728668, 0.253063098453237, 0.07572502906912484, -0.19648315988581727, -0.015543810295167606, -0.019318800306300055, 0.14353902230693683, 0.03546019631526055, 0.05088268399641321, 0.1554551826185874, 0.17824626497112567, 0.22648270532891557, 0.07848129128200329, -0.0644716044963413, -0.11443013467045651, -0.22468438821316167, -0.16622700020167472, -0.12928808437207262, 0.03486049779560228, -0.058132909482024056, -0.10977059287094587, 0.3640088476240635, 0.1845428038426247, 0.11633213587432496, 0.05891854472559046, 0.3809728482989846, 0.05194665117132654, 0.0756918641348445, 0.16410289253737476, 0.1786305202630575, -0.03421793896000914, 0.17057560485460468, -0.2179951332503225, 0.1581250620729013, 0.030655609146767373]
|
1,803.08416
|
Demystifying Deep Learning: A Geometric Approach to Iterative
Projections
|
Parametric approaches to Learning, such as deep learning (DL), are highly
popular in nonlinear regression, in spite of their extremely difficult training
with their increasing complexity (e.g. number of layers in DL). In this paper,
we present an alternative semi-parametric framework which foregoes the
ordinarily required feedback, by introducing the novel idea of geometric
regularization. We show that certain deep learning techniques such as residual
network (ResNet) architecture are closely related to our approach. Hence, our
technique can be used to analyze these types of deep learning. Moreover, we
present preliminary results which confirm that our approach can be easily
trained to obtain complex structures.
|
cs.LG stat.ML
|
parametric approaches to learning such as deep learning dl are highly popular in nonlinear regression in spite of their extremely difficult training with their increasing complexity eg number of layers in dl in this paper we present an alternative semiparametric framework which foregoes the ordinarily required feedback by introducing the novel idea of geometric regularization we show that certain deep learning techniques such as residual network resnet architecture are closely related to our approach hence our technique can be used to analyze these types of deep learning moreover we present preliminary results which confirm that our approach can be easily trained to obtain complex structures
|
[['parametric', 'approaches', 'to', 'learning', 'such', 'as', 'deep', 'learning', 'dl', 'are', 'highly', 'popular', 'in', 'nonlinear', 'regression', 'in', 'spite', 'of', 'their', 'extremely', 'difficult', 'training', 'with', 'their', 'increasing', 'complexity', 'eg', 'number', 'of', 'layers', 'in', 'dl', 'in', 'this', 'paper', 'we', 'present', 'an', 'alternative', 'semiparametric', 'framework', 'which', 'foregoes', 'the', 'ordinarily', 'required', 'feedback', 'by', 'introducing', 'the', 'novel', 'idea', 'of', 'geometric', 'regularization', 'we', 'show', 'that', 'certain', 'deep', 'learning', 'techniques', 'such', 'as', 'residual', 'network', 'resnet', 'architecture', 'are', 'closely', 'related', 'to', 'our', 'approach', 'hence', 'our', 'technique', 'can', 'be', 'used', 'to', 'analyze', 'these', 'types', 'of', 'deep', 'learning', 'moreover', 'we', 'present', 'preliminary', 'results', 'which', 'confirm', 'that', 'our', 'approach', 'can', 'be', 'easily', 'trained', 'to', 'obtain', 'complex', 'structures']]
|
[-0.012078331566105287, 0.024929728546495816, -0.08048049653312081, 0.07381325764692433, -0.13517070081794547, -0.18008869218506984, 0.013990296801507828, 0.4582521001852694, -0.31889131280283134, -0.3402360176401479, 0.08428640943353198, -0.18199647841531605, -0.2868865507743543, 0.2048027270872678, -0.15364037455902213, 0.10535114614204281, 0.07742241228309771, -0.0034989822944182726, -0.05597533535079232, -0.3078211471571454, 0.33430483478919737, 0.02791499343085369, 0.325356045791081, 0.01167204232465121, 0.08785654807995473, -0.03399256683353867, -0.01223371388124568, 0.03196061049543676, -0.06735297124569548, 0.21622964902115718, 0.3457906838417763, 0.20025788070634007, 0.3275289752742364, -0.4408164210794937, -0.2440957198629067, 0.09116248096605496, 0.18944474756981003, 0.12823897201700935, -0.02636111592430444, -0.29030504723389944, 0.10661144824476824, -0.19313526273305928, -0.028541005433847508, -0.21177228677663065, -0.09530993020161986, 0.01813896528323572, -0.2826957702636719, 0.028434804443358667, 0.09045861391794113, 0.022897502955137972, -0.019521809901509965, -0.12352128993897211, 0.05713824445958294, 0.09090081751790074, 0.04741360523871013, 0.035489398462786564, 0.0990802985083844, -0.1638248988183304, -0.11226699141829852, 0.30583454179743835, -0.059369070331255595, -0.19917524559866814, 0.24601573524331408, 0.003612512061815886, -0.16501079882894243, 0.06904781705566815, 0.2552523641425761, 0.1405278164959912, -0.16521155272300045, -0.00566060656371216, -0.02651047026516781, 0.1425082614911454, 0.000541388580486888, 0.030351713248750283, 0.1523401592869223, 0.25038603300317414, 0.02548506185412407, 0.14867868933915382, -0.11589709291057218, -0.05892058861486259, -0.23955481321151767, -0.10093487490500723, -0.16618963244504162, 0.004305208458875617, -0.10576863906656703, -0.16858113376822856, 0.34951331881761905, 0.22810502511759598, 0.2344650144112252, 0.10797284700065142, 0.32436100650312644, 0.09942885505235088, 0.13856895082142381, 0.0879839280221079, 0.23672939431299234, 0.06061289699171626, 0.10610057819368583, -0.18283834884808, 0.06591448263886074, 0.024182988689946276]
|
1,803.08417
|
Two inquiries about finite groups and well-behaved quotients
|
This thesis addresses questions in representation and invariant theory of
finite groups. The first concerns singularities of quotient spaces under
actions of finite groups. We introduce a class of finite groups such that the
quotients have at worst abelian quotient singularities. We prove that
supersolvable groups belong to this class and show that nonabelian finite
simple groups do not belong to it. The second question concerns the
Cohen-Macaulayness of the invariant ring $\mathbb{Z}[x_1,\dots,x_n]^G$, where
$G$ is a permutation group. We prove that this ring is Cohen-Macaulay if $G$ is
generated by transpositions, double transpositions, and 3-cycles, and
conjecture that the converse is true as well.
|
math.AC math.RT
|
this thesis addresses questions in representation and invariant theory of finite groups the first concerns singularities of quotient spaces under actions of finite groups we introduce a class of finite groups such that the quotients have at worst abelian quotient singularities we prove that supersolvable groups belong to this class and show that nonabelian finite simple groups do not belong to it the second question concerns the cohenmacaulayness of the invariant ring mathbbzx_1dotsx_ng where g is a permutation group we prove that this ring is cohenmacaulay if g is generated by transpositions double transpositions and 3cycles and conjecture that the converse is true as well
|
[['this', 'thesis', 'addresses', 'questions', 'in', 'representation', 'and', 'invariant', 'theory', 'of', 'finite', 'groups', 'the', 'first', 'concerns', 'singularities', 'of', 'quotient', 'spaces', 'under', 'actions', 'of', 'finite', 'groups', 'we', 'introduce', 'a', 'class', 'of', 'finite', 'groups', 'such', 'that', 'the', 'quotients', 'have', 'at', 'worst', 'abelian', 'quotient', 'singularities', 'we', 'prove', 'that', 'supersolvable', 'groups', 'belong', 'to', 'this', 'class', 'and', 'show', 'that', 'nonabelian', 'finite', 'simple', 'groups', 'do', 'not', 'belong', 'to', 'it', 'the', 'second', 'question', 'concerns', 'the', 'cohenmacaulayness', 'of', 'the', 'invariant', 'ring', 'mathbbzx_1dotsx_ng', 'where', 'g', 'is', 'a', 'permutation', 'group', 'we', 'prove', 'that', 'this', 'ring', 'is', 'cohenmacaulay', 'if', 'g', 'is', 'generated', 'by', 'transpositions', 'double', 'transpositions', 'and', '3cycles', 'and', 'conjecture', 'that', 'the', 'converse', 'is', 'true', 'as', 'well']]
|
[-0.190694516520195, 0.12565044273371592, -0.09459352465077805, 0.09552499138450142, -0.10559418348398489, -0.15028865355102775, 0.0050072479990866175, 0.3741146471942417, -0.3537728169019549, -0.18955004994327632, 0.11207391155879193, -0.23806603557134692, -0.1624239536400777, 0.1365342862700345, -0.18953314792060366, -0.057362204525046624, 0.046024790176978476, 0.11223017650011641, -0.06985924231300417, -0.36289631497213404, 0.4285292528489103, -0.0778704650583677, 0.2557773913364284, 0.06773390665889914, 0.09672076435079081, -0.004000441529429876, -0.0188274117715012, 0.022203364400551297, -0.13104265217638245, 0.06303019143748455, 0.33124465704895556, 0.0751042425713072, 0.2518953431236486, -0.3328679074318363, -0.14573555544708283, 0.24127188025830457, 0.13757592988594508, 0.03020129642726925, -0.036766581680589855, -0.2517113600893376, 0.20112857690457112, -0.19954577369096044, -0.1481893216998567, -0.036966134050789363, 0.0793130649970128, -0.0017853056600030798, -0.21072780488667867, 0.018053737648118, 0.14002387137980593, 0.12169715950193886, -0.003119155455631419, -0.037086720417182036, -0.025796681129857182, 0.12509237410715565, 0.010014942084895805, -0.021907737536821514, 0.08541286871947634, -0.06414290902858528, -0.15393205794792336, 0.41156938249388564, -0.03288644841478135, -0.2114056816073851, 0.12221169566216233, -0.21695243884683946, -0.240035585480375, 0.09610872550939138, 0.06442417913617995, 0.20936604248932922, -0.006578573876490386, 0.19332530749558757, -0.2015580774213259, 0.06725884918481685, 0.09606767523823342, 0.0012945092077223728, 0.12431956901071736, 0.06740910030426815, 0.12363408094489177, 0.16030678609744287, 0.06925692541811329, 0.029872338858974848, -0.37983686707985514, -0.17330928911598256, -0.13676557348718724, 0.12269658394073374, -0.030956860311002508, -0.19463324340176769, 0.39333636653967774, 0.09137680189898954, 0.121229168609716, 0.13477702780913275, 0.19124555262701157, 0.02458918323771706, 0.08408910851889792, 0.09252466117210972, 0.06886842139423467, 0.2206868751158114, -0.11013421452998255, -0.15309691285214144, 0.0007179133491053318, 0.22110260606635934]
|
1,803.08418
|
Reweighting Lefschetz Thimbles
|
One of the main challenges in simulations on Lefschetz thimbles is the
computation of the relative weights of contributing thimbles. In this paper we
propose a solution to that problem by means of computing those weights using a
reweighting procedure. Besides we present recipes for finding parametrizations
of thimbles and anti-thimbles for a given theory. Moreover, we study some
approaches to combine the Lefschetz thimble method with the Complex Langevin
evolution. Our numerical investigations are carried out by using toy models
among which we consider a one-site z^4 model as well as a U(1) one-link model.
|
hep-lat hep-ph hep-th
|
one of the main challenges in simulations on lefschetz thimbles is the computation of the relative weights of contributing thimbles in this paper we propose a solution to that problem by means of computing those weights using a reweighting procedure besides we present recipes for finding parametrizations of thimbles and antithimbles for a given theory moreover we study some approaches to combine the lefschetz thimble method with the complex langevin evolution our numerical investigations are carried out by using toy models among which we consider a onesite z4 model as well as a u1 onelink model
|
[['one', 'of', 'the', 'main', 'challenges', 'in', 'simulations', 'on', 'lefschetz', 'thimbles', 'is', 'the', 'computation', 'of', 'the', 'relative', 'weights', 'of', 'contributing', 'thimbles', 'in', 'this', 'paper', 'we', 'propose', 'a', 'solution', 'to', 'that', 'problem', 'by', 'means', 'of', 'computing', 'those', 'weights', 'using', 'a', 'reweighting', 'procedure', 'besides', 'we', 'present', 'recipes', 'for', 'finding', 'parametrizations', 'of', 'thimbles', 'and', 'antithimbles', 'for', 'a', 'given', 'theory', 'moreover', 'we', 'study', 'some', 'approaches', 'to', 'combine', 'the', 'lefschetz', 'thimble', 'method', 'with', 'the', 'complex', 'langevin', 'evolution', 'our', 'numerical', 'investigations', 'are', 'carried', 'out', 'by', 'using', 'toy', 'models', 'among', 'which', 'we', 'consider', 'a', 'onesite', 'z4', 'model', 'as', 'well', 'as', 'a', 'u1', 'onelink', 'model']]
|
[-0.09671427023652206, 0.027240907821167063, -0.12094628553053266, 0.07443854958799324, -0.03838188824684997, -0.1320298074597591, 0.081569819463613, 0.38561454730990685, -0.23317584413054743, -0.29158067142492844, 0.08028529074386154, -0.2532392939258563, -0.20515989257071757, 0.17830312547617053, -0.04189194165825795, 0.06090381348407582, 0.08230847839027104, -0.0389991953380798, -0.10306486459694018, -0.2685354959832406, 0.36251722131610703, 0.024558409332836928, 0.19427123258968718, 0.0562724736176039, 0.13809398288140073, -0.010416758432984351, -0.05689844294010024, 0.03581439692429022, -0.13624329385631043, 0.1349241421046731, 0.2197159783196663, 0.08962147350570089, 0.27771195247769354, -0.41787263262820873, -0.22274556100172432, 0.1204868808339693, 0.14718993714471396, 0.12995025744343078, -0.04294841170041381, -0.20941314132590044, 0.09763208197086658, -0.18698184141202978, -0.15307276196973887, -0.1486469019694548, -0.0771091242345344, 0.021370653271381008, -0.24893643991335443, 0.043060239791674046, -0.009269749403450222, 0.03003127411694119, -0.04964340690915522, -0.09935003476903627, 0.02929458029960331, 0.08796185364481061, 0.08709794948441221, 0.006262652617634127, 0.09037401909988961, -0.17289561981972504, -0.16729988618998937, 0.40908332506292744, -0.03584855265523258, -0.2452599944461039, 0.1565778296563382, -0.05817913957932768, -0.20886682731246478, 0.085629198450203, 0.1240822458443673, 0.15748527724491923, -0.14838902229737294, 0.0983711928319137, -0.0627338788521133, 0.09782277134884344, 0.009145432896912099, -0.05949999504281502, 0.18794389788649585, 0.1734894985382102, 0.015231477278039644, 0.17534317828126644, -0.06016010801111789, -0.13921127628633065, -0.3280221344216874, -0.13977404508347574, -0.15914957812546116, 0.08447258787376707, -0.09037828814884721, -0.1547643426168514, 0.40767895620512334, 0.19773025092129645, 0.24152846441261078, 0.10267016102535356, 0.32605471926692287, 0.11069220119572588, 0.05347496323581589, 0.03108129176360212, 0.15706915190400506, 0.14885078556100398, 0.051303786429037386, -0.21195393464969178, -0.023872864626249983, 0.16606638325672402]
|
1,803.08419
|
The Rapidly Changing Landscape of Conversational Agents
|
Conversational agents have become ubiquitous, ranging from goal-oriented
systems for helping with reservations to chit-chat models found in modern
virtual assistants. In this survey paper, we explore this fascinating field. We
look at some of the pioneering work that defined the field and gradually move
to the current state-of-the-art models. We look at statistical, neural,
generative adversarial network based and reinforcement learning based
approaches and how they evolved. Along the way we discuss various challenges
that the field faces, lack of context in utterances, not having a good
quantitative metric to compare models, lack of trust in agents because they do
not have a consistent persona etc. We structure this paper in a way that
answers these pertinent questions and discusses competing approaches to solve
them.
|
cs.AI cs.CL
|
conversational agents have become ubiquitous ranging from goaloriented systems for helping with reservations to chitchat models found in modern virtual assistants in this survey paper we explore this fascinating field we look at some of the pioneering work that defined the field and gradually move to the current stateoftheart models we look at statistical neural generative adversarial network based and reinforcement learning based approaches and how they evolved along the way we discuss various challenges that the field faces lack of context in utterances not having a good quantitative metric to compare models lack of trust in agents because they do not have a consistent persona etc we structure this paper in a way that answers these pertinent questions and discusses competing approaches to solve them
|
[['conversational', 'agents', 'have', 'become', 'ubiquitous', 'ranging', 'from', 'goaloriented', 'systems', 'for', 'helping', 'with', 'reservations', 'to', 'chitchat', 'models', 'found', 'in', 'modern', 'virtual', 'assistants', 'in', 'this', 'survey', 'paper', 'we', 'explore', 'this', 'fascinating', 'field', 'we', 'look', 'at', 'some', 'of', 'the', 'pioneering', 'work', 'that', 'defined', 'the', 'field', 'and', 'gradually', 'move', 'to', 'the', 'current', 'stateoftheart', 'models', 'we', 'look', 'at', 'statistical', 'neural', 'generative', 'adversarial', 'network', 'based', 'and', 'reinforcement', 'learning', 'based', 'approaches', 'and', 'how', 'they', 'evolved', 'along', 'the', 'way', 'we', 'discuss', 'various', 'challenges', 'that', 'the', 'field', 'faces', 'lack', 'of', 'context', 'in', 'utterances', 'not', 'having', 'a', 'good', 'quantitative', 'metric', 'to', 'compare', 'models', 'lack', 'of', 'trust', 'in', 'agents', 'because', 'they', 'do', 'not', 'have', 'a', 'consistent', 'persona', 'etc', 'we', 'structure', 'this', 'paper', 'in', 'a', 'way', 'that', 'answers', 'these', 'pertinent', 'questions', 'and', 'discusses', 'competing', 'approaches', 'to', 'solve', 'them']]
|
[-0.07264992813505823, 0.04396821900514797, -0.07655140671819921, 0.10734428483937379, -0.14576625164745421, -0.16479369970999422, 0.040848837302450744, 0.4439957166157131, -0.27165581069753636, -0.33044845094194725, 0.0582344721501974, -0.28821329110937693, -0.20442494670934383, 0.17132531233697332, -0.15165598315393758, 0.03489895272789346, 0.06389668101208314, 0.020489924884815183, -0.03357920336762502, -0.2749448140347672, 0.35826462321907343, 0.020696382921573424, 0.2927774897894807, 0.03605590191566282, 0.08946141919434358, -0.05011557318761738, -0.03328707891642042, 0.03563083586604556, -0.12608735054810596, 0.18197880256486806, 0.3366890013486039, 0.1903435344667366, 0.36208111345065785, -0.47983941440248773, -0.20085641087609388, 0.11716489159753399, 0.1745840835579974, 0.13108904976102095, -0.06151192736930199, -0.3017600636175346, 0.08358535955896572, -0.18502574401449354, -0.07014393566235427, -0.11926576698435441, -0.022254239199572198, 0.013944662634342436, -0.17165448615144538, -0.02087769377976656, 0.07843448282662957, 0.10502746555998567, -0.06060232181519654, -0.1244703585001093, 0.0645974299848257, 0.17962301255662053, 0.09116290204433931, 0.06487338542420831, 0.1093225815399949, -0.22326729527031558, -0.15717467912177127, 0.3832051419017334, -0.027136933923299824, -0.15825114414531974, 0.2651179050324514, -0.0773144725503193, -0.19198892113202, 0.011226690482414727, 0.24537922642729615, 0.10476144768356804, -0.1754454007295574, 0.03710064776648309, -0.014170373348327029, 0.15058962630832362, 0.020845824203119957, 0.018098247094294206, 0.24010070794010682, 0.181169174389825, 0.014332133332370885, 0.06568397944497448, -0.011039058068288594, -0.1308874540060522, -0.2023976356888722, -0.12481815034952311, -0.09536482207477093, 0.010373440883649025, -0.0013356497358819027, -0.1440187033398875, 0.3732960846437703, 0.2909674584155991, 0.21202324356122446, 0.07875816398189359, 0.3092015486003624, 0.02994556546891256, 0.0785510187052996, 0.09520100955370932, 0.22815341272854267, 0.041406540037502375, 0.16939680754310554, -0.11900738753297085, 0.08253374294422212, -0.008001049581382955]
|
1,803.0842
|
Incremental Color Quantization for Color-Vision-Deficient Observers
Using Mobile Gaming Data
|
The sizes of compressed images depend on their spatial resolution (number of
pixels) and on their color resolution (number of color quantization levels). We
introduce DaltonQuant, a new color quantization technique for image compression
that cloud services can apply to images destined for a specific user with known
color vision deficiencies. DaltonQuant improves compression in a user-specific
but reversible manner thereby improving a user's network bandwidth and data
storage efficiency. DaltonQuant quantizes image data to account for
user-specific color perception anomalies, using a new method for incremental
color quantization based on a large corpus of color vision acuity data obtained
from a popular mobile game. Servers that host images can revert DaltonQuant's
image requantization and compression when those images must be transmitted to a
different user, making the technique practical to deploy on a large scale. We
evaluate DaltonQuant's compression performance on the Kodak PC reference image
set and show that it improves compression by an additional 22%-29% over the
state-of-the-art compressors TinyPNG and pngquant.
|
cs.HC cs.CV cs.CY
|
the sizes of compressed images depend on their spatial resolution number of pixels and on their color resolution number of color quantization levels we introduce daltonquant a new color quantization technique for image compression that cloud services can apply to images destined for a specific user with known color vision deficiencies daltonquant improves compression in a userspecific but reversible manner thereby improving a users network bandwidth and data storage efficiency daltonquant quantizes image data to account for userspecific color perception anomalies using a new method for incremental color quantization based on a large corpus of color vision acuity data obtained from a popular mobile game servers that host images can revert daltonquants image requantization and compression when those images must be transmitted to a different user making the technique practical to deploy on a large scale we evaluate daltonquants compression performance on the kodak pc reference image set and show that it improves compression by an additional 2229 over the stateoftheart compressors tinypng and pngquant
|
[['the', 'sizes', 'of', 'compressed', 'images', 'depend', 'on', 'their', 'spatial', 'resolution', 'number', 'of', 'pixels', 'and', 'on', 'their', 'color', 'resolution', 'number', 'of', 'color', 'quantization', 'levels', 'we', 'introduce', 'daltonquant', 'a', 'new', 'color', 'quantization', 'technique', 'for', 'image', 'compression', 'that', 'cloud', 'services', 'can', 'apply', 'to', 'images', 'destined', 'for', 'a', 'specific', 'user', 'with', 'known', 'color', 'vision', 'deficiencies', 'daltonquant', 'improves', 'compression', 'in', 'a', 'userspecific', 'but', 'reversible', 'manner', 'thereby', 'improving', 'a', 'users', 'network', 'bandwidth', 'and', 'data', 'storage', 'efficiency', 'daltonquant', 'quantizes', 'image', 'data', 'to', 'account', 'for', 'userspecific', 'color', 'perception', 'anomalies', 'using', 'a', 'new', 'method', 'for', 'incremental', 'color', 'quantization', 'based', 'on', 'a', 'large', 'corpus', 'of', 'color', 'vision', 'acuity', 'data', 'obtained', 'from', 'a', 'popular', 'mobile', 'game', 'servers', 'that', 'host', 'images', 'can', 'revert', 'daltonquants', 'image', 'requantization', 'and', 'compression', 'when', 'those', 'images', 'must', 'be', 'transmitted', 'to', 'a', 'different', 'user', 'making', 'the', 'technique', 'practical', 'to', 'deploy', 'on', 'a', 'large', 'scale', 'we', 'evaluate', 'daltonquants', 'compression', 'performance', 'on', 'the', 'kodak', 'pc', 'reference', 'image', 'set', 'and', 'show', 'that', 'it', 'improves', 'compression', 'by', 'an', 'additional', '2229', 'over', 'the', 'stateoftheart', 'compressors', 'tinypng', 'and', 'pngquant']]
|
[-0.06819422134510618, 0.030640919444889485, -0.07477570913431252, 0.043739705673355306, -0.10984314904368905, -0.1757700042032654, 0.07151284531591842, 0.4755859702756131, -0.26063191967651894, -0.3547234195111007, 0.08222021705034241, -0.25683426595530157, -0.08605932128494201, 0.16317171804094976, -0.20271507975708994, 0.053737181833199, 0.10941507255877057, 0.05916231160192398, -0.054524472542974795, -0.2982715071447957, 0.26043457696243244, 0.05719925188430533, 0.39531060781399285, 0.02165771923635317, 0.11850710019616768, 0.025225631531142854, -0.05881044757498214, 0.01594980286003339, -0.04084922386811842, 0.14189594067193523, 0.2714199013241584, 0.2203180068490668, 0.23332029664368362, -0.41187589532285, -0.22588935868687327, 0.0359261202291869, 0.1406918783492831, 0.10155662246661619, -0.09872149983608967, -0.3013061448260679, 0.1515378142036035, -0.14616612478026322, 0.0377487482384472, -0.0867533626668271, -0.005749546966127912, 0.0008947455920047642, -0.31215071043589654, 0.012905799159028146, 0.014140321919405313, 0.07515306377737141, -0.053201319625230954, -0.11358116487307209, 0.02520514967683587, 0.1714408000797736, -0.027268827769916897, 0.05723054208705977, 0.1746193913016931, -0.20343553797324349, -0.08461067304940698, 0.394590345909819, -0.026623740271659372, -0.16887748356538346, 0.17249241175841518, -0.03118366939059071, -0.1189557044197059, 0.13151630918894494, 0.22794862512227218, 0.072006534423494, -0.1372390891659769, -0.004919319096533293, -0.019233574797919956, 0.22618879049275972, 0.12541124791554784, 0.06749386794761009, 0.1838775524444392, 0.1725312759969615, 0.06838092214344012, 0.15328285919996962, -0.17319600323001097, -0.014100711840430494, -0.19446565787545086, -0.10655444048298812, -0.2160881224836032, -0.006439587610386173, -0.15513959315542916, -0.12433194617237549, 0.3761477087283079, 0.2199400779893311, 0.22153642270945428, 0.08068694213335836, 0.3988072121781962, 0.023195621423854968, 0.17758011887925937, 0.06474132829501947, 0.10717848373681121, 0.023292743903150934, 0.1391360534417229, -0.1703574757846593, 0.014684659087602397, 0.045535029837664984]
|
1,803.08421
|
BRST-BV approach to continuous-spin field
|
Using BRST-BV approach, massless and massive continuous-spin fields
propagating in the flat space are studied. For such fields, BRST-BV gauge
invariant Lagrangian is obtained. The Lagrangian and gauge transformations are
constructed out of traceless gauge fields and traceless gauge transformation
parameters. Interrelation between the BRST-BV Lagrangian and the Lagrangian for
the continuous-spin fields in metric-like approach is demonstrated. Considering
the BRST-BV Lagrangian in the Siegel gauge, we get gauge-fixed Lagrangian which
is invariant under global BRST and antiBRST transformations.
|
hep-th
|
using brstbv approach massless and massive continuousspin fields propagating in the flat space are studied for such fields brstbv gauge invariant lagrangian is obtained the lagrangian and gauge transformations are constructed out of traceless gauge fields and traceless gauge transformation parameters interrelation between the brstbv lagrangian and the lagrangian for the continuousspin fields in metriclike approach is demonstrated considering the brstbv lagrangian in the siegel gauge we get gaugefixed lagrangian which is invariant under global brst and antibrst transformations
|
[['using', 'brstbv', 'approach', 'massless', 'and', 'massive', 'continuousspin', 'fields', 'propagating', 'in', 'the', 'flat', 'space', 'are', 'studied', 'for', 'such', 'fields', 'brstbv', 'gauge', 'invariant', 'lagrangian', 'is', 'obtained', 'the', 'lagrangian', 'and', 'gauge', 'transformations', 'are', 'constructed', 'out', 'of', 'traceless', 'gauge', 'fields', 'and', 'traceless', 'gauge', 'transformation', 'parameters', 'interrelation', 'between', 'the', 'brstbv', 'lagrangian', 'and', 'the', 'lagrangian', 'for', 'the', 'continuousspin', 'fields', 'in', 'metriclike', 'approach', 'is', 'demonstrated', 'considering', 'the', 'brstbv', 'lagrangian', 'in', 'the', 'siegel', 'gauge', 'we', 'get', 'gaugefixed', 'lagrangian', 'which', 'is', 'invariant', 'under', 'global', 'brst', 'and', 'antibrst', 'transformations']]
|
[-0.23259370888382952, 0.25558485260492636, -0.11088191127239526, 0.1290657466404211, -0.12143334821809697, -0.09874737382972543, -0.13288213867882762, 0.36490962338409844, -0.17482466599609278, -0.27906876013030685, 0.007816313572899922, -0.1662823296729711, -0.19071940788881311, 0.05450989525246469, -0.03620681830953005, 0.05862086949150868, -0.05915742115223709, 0.053849126483443414, -0.16263001677403344, -0.280990756539734, 0.3729490143117271, -0.03612144070064437, 0.26897413453346564, -0.01621753925566644, 0.23415538913841488, 0.086769189974411, -0.05942023236045166, -0.019853140516692912, -0.05801650288196493, 0.03513751053722882, 0.20451528044665068, 0.04190027360993001, 0.06137805262321158, -0.40548919346419315, -0.20712263049864316, 0.06238770626391037, 0.12130337583690975, 0.10570207441408376, -0.03577614219599887, -0.3916821739153017, 0.022482272903611766, -0.11434170041421923, -0.16710703388664022, -0.22837872548571117, -0.05470154785751542, -0.12028261215154883, -0.2808844099835127, 0.09073079006960638, -0.022019749359946838, 0.15734069495862704, -0.07857529013830272, -0.05970269129198941, -0.15208291835328447, 0.012097533249968215, 0.17991220734459407, 0.11362294466057911, 0.18332953774664976, -0.18503869031968562, -0.057227520555069175, 0.4562189548358887, -0.10263179461884347, -0.3612955507786968, 0.12343475926679241, -0.03959923014752095, -0.2142900415118548, 0.0874904741907398, 0.09628839555632653, 0.19827562521058548, -0.2204413130025444, 0.30765379806965754, -0.058470799033589003, 0.0008158676703519459, 0.1305735462781372, 0.033953923284064366, 0.18880686195732294, -0.024355895746546456, 0.052265712012878704, 0.0927779410930374, 0.053947497630061556, -0.1952964400915323, -0.4451238055583797, -0.1657463154325238, -0.09334352375538665, 0.05393417151291159, -0.12155782365401517, -0.08698041430568393, 0.4020440242182511, 0.096556734765255, 0.03874649019628952, 0.07882522637926372, 0.20151928678461456, 0.13439898979358295, 0.15282248038374172, 0.06824709455588762, 0.26225072857511195, 0.27900087114282046, 0.02284634926745409, -0.2048521498756047, -0.26647308332656944, 0.24682067814459907]
|
1,803.08422
|
An Enhancement Algorithm of Cyclic Adaptive Fourier Decomposition
|
The paper investigates the complex gradient descent method (CGD) for the best
rational approximation of a given order to a function in the Hardy space on the
unit disk. It is equivalent to finding the best Blaschke form with free poles.
The adaptive Fourier decomposition (AFD) and the cyclic AFD methods in
literature are based on the grid search technique. The precision of these
methods is limited by the grid spacing. The proposed method employs a fast
search algorithm to find the initial for CGD, then finds the target poles by
gradient descent optimization. Hence, it can reach higher precision with less
computation cost. Its validity and effectiveness are confirmed by several
examples.
|
math.CV
|
the paper investigates the complex gradient descent method cgd for the best rational approximation of a given order to a function in the hardy space on the unit disk it is equivalent to finding the best blaschke form with free poles the adaptive fourier decomposition afd and the cyclic afd methods in literature are based on the grid search technique the precision of these methods is limited by the grid spacing the proposed method employs a fast search algorithm to find the initial for cgd then finds the target poles by gradient descent optimization hence it can reach higher precision with less computation cost its validity and effectiveness are confirmed by several examples
|
[['the', 'paper', 'investigates', 'the', 'complex', 'gradient', 'descent', 'method', 'cgd', 'for', 'the', 'best', 'rational', 'approximation', 'of', 'a', 'given', 'order', 'to', 'a', 'function', 'in', 'the', 'hardy', 'space', 'on', 'the', 'unit', 'disk', 'it', 'is', 'equivalent', 'to', 'finding', 'the', 'best', 'blaschke', 'form', 'with', 'free', 'poles', 'the', 'adaptive', 'fourier', 'decomposition', 'afd', 'and', 'the', 'cyclic', 'afd', 'methods', 'in', 'literature', 'are', 'based', 'on', 'the', 'grid', 'search', 'technique', 'the', 'precision', 'of', 'these', 'methods', 'is', 'limited', 'by', 'the', 'grid', 'spacing', 'the', 'proposed', 'method', 'employs', 'a', 'fast', 'search', 'algorithm', 'to', 'find', 'the', 'initial', 'for', 'cgd', 'then', 'finds', 'the', 'target', 'poles', 'by', 'gradient', 'descent', 'optimization', 'hence', 'it', 'can', 'reach', 'higher', 'precision', 'with', 'less', 'computation', 'cost', 'its', 'validity', 'and', 'effectiveness', 'are', 'confirmed', 'by', 'several', 'examples']]
|
[-0.09055023646678578, 0.010947750625818703, -0.08387628750282183, 0.04745693190591987, -0.09581751355785975, -0.10875634552779055, 0.06896857927095937, 0.4242670796399491, -0.28622642983641244, -0.298415495639057, 0.15060809124773678, -0.21199347030173624, -0.16286567417261874, 0.22612566269822912, -0.06517095540715093, 0.08592615489573918, 0.05956557350010669, 0.04680681675342859, -0.10529922022107181, -0.29472726365897506, 0.27307710978635213, 0.08765686707224994, 0.2656322063453726, -0.016628228000208602, 0.09722419735044241, -0.015266056728870731, -0.05909396199493018, -0.015041868841384776, -0.09817805065386064, 0.1591633848796508, 0.20323479163204938, 0.14643091541525405, 0.32522581194618105, -0.3633344022112083, -0.1715786487958188, 0.11671860384614727, 0.16743484411421602, 0.05725142916878768, -0.04024850164820333, -0.22015571667590236, 0.09869083573431832, -0.11332951535561443, -0.10313288687390432, -0.1280448184064301, -0.04408833314046527, 0.05794247160500855, -0.30186553357943763, 0.03814203039932568, 0.02016227799921041, 0.046487928656613935, -0.052349904619066655, -0.16356241311548295, 0.022323272302252267, 0.08007669755447228, 0.022089036210415375, 0.0798974545194512, 0.11881813383867255, -0.06494662886798645, -0.11430209517619053, 0.3783156367562777, -0.05525695282937052, -0.23944893403934825, 0.15020620475308888, -0.12463318157232309, -0.0795214483122943, 0.17016615166403024, 0.13948772574385496, 0.18178896416407242, -0.11283962966758856, 0.09506077222851625, -0.0058556781603699235, 0.1316998382696503, 0.063919428793664, -0.04379312017215498, 0.11749898247313645, 0.1597451990041717, 0.14965055988837792, 0.1298905227341549, -0.08764078427686674, -0.12825398114139, -0.27056736912809115, -0.14254735322438378, -0.20317082599926312, -0.04985578919439453, -0.13115343805871268, -0.16247171935402846, 0.3889075379295324, 0.13436645762253124, 0.17503968651501248, 0.08473106425881913, 0.3574014202458784, 0.11555474619504756, 0.08711069882064398, 0.10118459305618849, 0.2101052346087135, 0.1327094188067172, 0.07933170003898904, -0.2621027903293416, 0.06505844355210563, 0.16970096377705315]
|
1,803.08423
|
Edge Kempe equivalence of regular graph covers
|
Let $G$ be a finite $d$-regular graph with a proper edge coloring. An edge
Kempe switch is a new proper edge coloring of $G$ obtained by switching the two
colors along some bi-chromatic cycle. We prove that any other edge coloring can
be obtained by performing finitely many edge Kempe switches, provided that $G$
is replaced with a suitable finite covering graph. The required covering degree
is bounded above by a constant depending only on $d$.
|
math.CO
|
let g be a finite dregular graph with a proper edge coloring an edge kempe switch is a new proper edge coloring of g obtained by switching the two colors along some bichromatic cycle we prove that any other edge coloring can be obtained by performing finitely many edge kempe switches provided that g is replaced with a suitable finite covering graph the required covering degree is bounded above by a constant depending only on d
|
[['let', 'g', 'be', 'a', 'finite', 'dregular', 'graph', 'with', 'a', 'proper', 'edge', 'coloring', 'an', 'edge', 'kempe', 'switch', 'is', 'a', 'new', 'proper', 'edge', 'coloring', 'of', 'g', 'obtained', 'by', 'switching', 'the', 'two', 'colors', 'along', 'some', 'bichromatic', 'cycle', 'we', 'prove', 'that', 'any', 'other', 'edge', 'coloring', 'can', 'be', 'obtained', 'by', 'performing', 'finitely', 'many', 'edge', 'kempe', 'switches', 'provided', 'that', 'g', 'is', 'replaced', 'with', 'a', 'suitable', 'finite', 'covering', 'graph', 'the', 'required', 'covering', 'degree', 'is', 'bounded', 'above', 'by', 'a', 'constant', 'depending', 'only', 'on', 'd']]
|
[-0.2626668822853581, 0.2178677095570923, -0.08064599215714752, -0.08292178402955055, -0.1492038895253484, -0.24716562877629736, 0.09941953779382043, 0.45878156598069164, -0.30221832001973925, -0.30373031530823363, 0.09487333299291908, -0.25147264352754545, -0.08381388125034343, 0.1245363867890678, -0.12906709526922847, 0.007831748256361798, 0.1605498073254957, 0.07185707885870024, 0.06988082339337684, -0.2385815715234984, 0.24525033616411843, -0.11258001993777916, 0.15529699534128763, 0.08063404562294875, 0.06140714268641252, 0.057453565593612824, -0.01904236144190164, 0.157343538923765, -0.1621532752096276, 0.050847101331639444, 0.2404071809907787, 0.09785888232842185, 0.27251910837979887, -0.392919298359438, -0.22124971380751385, 0.20240063051153956, 0.09187634500037682, -0.0012440986465662718, -0.021689715848831264, -0.24083276280496074, 0.18211731573223675, -0.11663689222175315, -0.10009870996184059, 0.04396842507106301, 0.1297277196089884, 0.01688144034951141, -0.28714190232322406, -0.10800730878805839, 0.0883694114163518, 0.07215995453053008, 0.0889603276369407, -0.1515920973431907, -0.10635431530566788, 0.0724586276766403, -0.13624225764866232, 0.1548329441054528, 0.06074963996836327, -0.10471720176160727, -0.22361559170837464, 0.37139783405061616, -0.08185393479652703, -0.14665046804829648, 0.1154231141370378, -0.09983201517944078, -0.14680201625819073, 0.13818606619392276, 0.021153938343846483, 0.1355817569124874, -0.08241163873064675, 0.14218882369919142, -0.14183368439492033, 0.10847438175819422, 0.1468660414194394, -0.013723468818505736, 0.1397793646901846, 0.10469006440344904, 0.24415802629587952, 0.1796778059835656, 0.03444201066955238, 0.048323639153846, -0.31785288649170024, -0.05850578535816902, -0.3027877230105284, 0.0966253153318049, -0.20639549095281645, -0.1813509653591992, 0.4307874228658253, 0.040828460870359684, 0.20155799270019328, 0.06788588677361411, 0.2513783778014936, 0.15112472258165086, 0.023471516984404604, 0.20608626051781406, 0.09691063588137408, 0.16970896290455895, -0.1107701684139963, -0.19072677554121534, 0.06216206288234772, 0.14261021880539423]
|
1,803.08424
|
Autoplotly - Automatic Generation of Interactive Visualizations for
Popular Statistical Results
|
The autoplotly package provides functionalities to automatically generate
interactive visualizations for many popular statistical results supported by
ggfortify package with plotly and ggplot2 style. The generated visualizations
can also be easily extended using ggplot2 and plotly syntax while staying
interactive.
|
stat.CO stat.AP
|
the autoplotly package provides functionalities to automatically generate interactive visualizations for many popular statistical results supported by ggfortify package with plotly and ggplot2 style the generated visualizations can also be easily extended using ggplot2 and plotly syntax while staying interactive
|
[['the', 'autoplotly', 'package', 'provides', 'functionalities', 'to', 'automatically', 'generate', 'interactive', 'visualizations', 'for', 'many', 'popular', 'statistical', 'results', 'supported', 'by', 'ggfortify', 'package', 'with', 'plotly', 'and', 'ggplot2', 'style', 'the', 'generated', 'visualizations', 'can', 'also', 'be', 'easily', 'extended', 'using', 'ggplot2', 'and', 'plotly', 'syntax', 'while', 'staying', 'interactive']]
|
[0.04418725716440301, 0.04572757315135708, -0.1406396897999864, 0.10757998171213426, -0.18367201673161043, -0.23857304789616088, -0.05952011695817897, 0.43676044360587474, -0.26066822558641434, -0.38091686544449704, 0.068356384327145, -0.2427367634188972, -0.1329121299970307, 0.3032675971718211, -0.07158424629290637, 0.04434390410192703, 0.10529851910082232, -0.05316648818552494, 0.01617450227250198, -0.2123301958077048, 0.2101949876125314, 0.07330548395647814, 0.21990440756474672, 0.0508480879698733, 0.035763469549190054, 0.05156406136474719, -0.09332250411573209, 0.05985859114872782, -0.10690777173486392, 0.21283080722940595, 0.34328060535297383, 0.2881474974320123, 0.2568986009512293, -0.4021518595124546, -0.13622739112102672, -0.068727637647259, 0.17008181575587705, 0.07328016437761682, -0.12131001942447926, -0.4204166098497808, 0.13246094244287202, -0.2137204749558709, -0.06320871796311908, -0.22626617180771733, -0.0776050747617295, 0.02607158944929803, -0.27919799564896447, -0.043577779115845545, 0.046928682266489455, 0.15177645621894809, 0.04176137554704359, -0.043568933848291636, -0.07490208683731525, 0.1416076297142641, -0.050225318213434594, 0.04718703574402944, 0.15512444211268112, -0.07184185183723457, -0.12255250466497321, 0.3453215825322427, -0.05328880767583063, -0.23736489230864927, 0.22332689352333546, 0.02340512603864466, -0.11078515406207819, 0.11972856369653814, 0.15443974922068024, 0.04405459759168719, -0.17988790537377722, 0.11218946054271471, 0.04592030041998154, 0.2097484277267205, 0.06518497401358266, -0.04709137182094549, 0.22500503818063358, 0.1149972326759445, -0.0944873463671875, 0.18421574878371566, 0.02623238187822464, -0.08580378624365519, -0.2078397825458332, -0.16456950560984152, -0.1033133679241138, -0.11919375837437417, -0.09360986000683624, -0.15771325832036764, 0.4133316409823142, 0.21360726346948036, 0.08040424073605161, 0.08582411431952526, 0.36485537314346356, 0.011051679250637167, 0.11447765974720057, 0.1763210851809402, 0.03477043904805262, -0.04107589661266262, 0.1557646530104409, -0.04738196423032174, 0.09236464616352398, 0.050859175671480204]
|
1,803.08425
|
"First in, last out" solution to the Fermi Paradox
|
No present observations suggest a technologically advanced extraterrestrial
intelligence (ETI) has spread through the galaxy. However, under commonplace
assumptions about galactic civilization formation and expansion, this absence
of observation is highly unlikely. This improbability constitutes the Fermi
Paradox. In this paper, I argue that the Paradox has a trivial solution,
requiring no controversial assumptions, which is rarely suggested or discussed.
However, that solution would be hard to accept, as it predicts a future for our
own civilization that is even worse than extinction.
|
physics.pop-ph
|
no present observations suggest a technologically advanced extraterrestrial intelligence eti has spread through the galaxy however under commonplace assumptions about galactic civilization formation and expansion this absence of observation is highly unlikely this improbability constitutes the fermi paradox in this paper i argue that the paradox has a trivial solution requiring no controversial assumptions which is rarely suggested or discussed however that solution would be hard to accept as it predicts a future for our own civilization that is even worse than extinction
|
[['no', 'present', 'observations', 'suggest', 'a', 'technologically', 'advanced', 'extraterrestrial', 'intelligence', 'eti', 'has', 'spread', 'through', 'the', 'galaxy', 'however', 'under', 'commonplace', 'assumptions', 'about', 'galactic', 'civilization', 'formation', 'and', 'expansion', 'this', 'absence', 'of', 'observation', 'is', 'highly', 'unlikely', 'this', 'improbability', 'constitutes', 'the', 'fermi', 'paradox', 'in', 'this', 'paper', 'i', 'argue', 'that', 'the', 'paradox', 'has', 'a', 'trivial', 'solution', 'requiring', 'no', 'controversial', 'assumptions', 'which', 'is', 'rarely', 'suggested', 'or', 'discussed', 'however', 'that', 'solution', 'would', 'be', 'hard', 'to', 'accept', 'as', 'it', 'predicts', 'a', 'future', 'for', 'our', 'own', 'civilization', 'that', 'is', 'even', 'worse', 'than', 'extinction']]
|
[-0.10449896041438522, 0.08218115606311574, -0.1303634966487985, 0.14438236917716912, -0.18062920408345848, -0.185567139855485, 0.07194323944915311, 0.38951712819826173, -0.19075524023767695, -0.29902256493939156, 0.14319036029004323, -0.27315129982644176, -0.17226402953839356, 0.18386457106154636, -0.10035280771104686, -0.06432944686567209, 0.11126237131756203, 0.019868511571941607, -0.005517380530889853, -0.24342961942619948, 0.2880880741208949, 0.12960395035726657, 0.23976733617439686, 0.0560470648714431, 0.07859986120027053, -0.03716566026524966, 0.014523829400808696, -0.013214115075856805, -0.07133067755899265, 0.059280391221484506, 0.2922968210383172, 0.18632391395737383, 0.32964921336486397, -0.4441968024180955, -0.27903008665777296, 0.1412432804501739, 0.18444563884916435, 0.11260645523953465, -0.12600268585697175, -0.23881789778235807, 0.07419554096315595, -0.1547987339316856, -0.21230810173753514, -0.030863780489034324, 0.06918545193543815, -0.10129382660197296, -0.17911367511085, 0.070307658097415, 0.07228839137108929, 0.06298957768468613, -0.06315094061162188, -0.08922649163567652, 0.021941821958206268, 0.036210046142777313, 0.10728259546491485, 0.050765289997973716, 0.13824142116200494, -0.1414169877099928, -0.10925580695810089, 0.43928652435137205, -0.010016242550799612, -0.10398059750693929, 0.22259980520929198, -0.15725678377448166, -0.18669257572212491, 0.11268180979034269, 0.038036992570037495, 0.0798400997363749, -0.1619716021484774, 0.037083848019786946, -0.05516669354177114, 0.2329111526557525, 0.07793440536248038, 0.03869758861673104, 0.30427963701806154, 0.18971797097923168, 0.11084248455443296, 0.03364147067333695, -0.07380941286907498, -0.08202385770841446, -0.24523170631805277, -0.14442711341803535, -0.19390661976333842, 0.16064262682998395, -0.011531156086445652, -0.1498874998819756, 0.2551920868411481, 0.23895166419356703, 0.12201415631830333, -0.011044192968037384, 0.29052649455212326, 0.0803392316181078, 0.07134945084150117, 0.1146729840470635, 0.3444690385003047, -0.006061765236263892, 0.10120651644306729, -0.1452474432425147, 0.22973620104435158, -0.09013205995861755]
|
1,803.08426
|
Pando: Personal Volunteer Computing in Browsers
|
The large penetration and continued growth in ownership of personal
electronic devices represents a freely available and largely untapped source of
computing power. To leverage those, we present Pando, a new volunteer computing
tool based on a declarative concurrent programming model and implemented using
JavaScript, WebRTC, and WebSockets. This tool enables a dynamically varying
number of failure-prone personal devices contributed by volunteers to
parallelize the application of a function on a stream of values, by using the
devices' browsers. We show that Pando can provide throughput improvements
compared to a single personal device, on a variety of compute-bound
applications including animation rendering and image processing. We also show
the flexibility of our approach by deploying Pando on personal devices
connected over a local network, on Grid5000, a French-wide computing grid in a
virtual private network, and seven PlanetLab nodes distributed in a wide area
network over Europe.
|
cs.DC
|
the large penetration and continued growth in ownership of personal electronic devices represents a freely available and largely untapped source of computing power to leverage those we present pando a new volunteer computing tool based on a declarative concurrent programming model and implemented using javascript webrtc and websockets this tool enables a dynamically varying number of failureprone personal devices contributed by volunteers to parallelize the application of a function on a stream of values by using the devices browsers we show that pando can provide throughput improvements compared to a single personal device on a variety of computebound applications including animation rendering and image processing we also show the flexibility of our approach by deploying pando on personal devices connected over a local network on grid5000 a frenchwide computing grid in a virtual private network and seven planetlab nodes distributed in a wide area network over europe
|
[['the', 'large', 'penetration', 'and', 'continued', 'growth', 'in', 'ownership', 'of', 'personal', 'electronic', 'devices', 'represents', 'a', 'freely', 'available', 'and', 'largely', 'untapped', 'source', 'of', 'computing', 'power', 'to', 'leverage', 'those', 'we', 'present', 'pando', 'a', 'new', 'volunteer', 'computing', 'tool', 'based', 'on', 'a', 'declarative', 'concurrent', 'programming', 'model', 'and', 'implemented', 'using', 'javascript', 'webrtc', 'and', 'websockets', 'this', 'tool', 'enables', 'a', 'dynamically', 'varying', 'number', 'of', 'failureprone', 'personal', 'devices', 'contributed', 'by', 'volunteers', 'to', 'parallelize', 'the', 'application', 'of', 'a', 'function', 'on', 'a', 'stream', 'of', 'values', 'by', 'using', 'the', 'devices', 'browsers', 'we', 'show', 'that', 'pando', 'can', 'provide', 'throughput', 'improvements', 'compared', 'to', 'a', 'single', 'personal', 'device', 'on', 'a', 'variety', 'of', 'computebound', 'applications', 'including', 'animation', 'rendering', 'and', 'image', 'processing', 'we', 'also', 'show', 'the', 'flexibility', 'of', 'our', 'approach', 'by', 'deploying', 'pando', 'on', 'personal', 'devices', 'connected', 'over', 'a', 'local', 'network', 'on', 'grid5000', 'a', 'frenchwide', 'computing', 'grid', 'in', 'a', 'virtual', 'private', 'network', 'and', 'seven', 'planetlab', 'nodes', 'distributed', 'in', 'a', 'wide', 'area', 'network', 'over', 'europe']]
|
[-0.16863435448931963, -0.009857092843684431, -0.06870632468681298, -0.007860061160786308, -0.1101450535966313, -0.16451412751275588, 0.11109628794995481, 0.3899338115229948, -0.25862227302114, -0.34094334294228523, 0.09642911112742907, -0.26519402812477455, -0.1514666108797266, 0.2909824138842938, -0.12152667117324237, 0.05609752424549685, 0.08071655180936756, -0.013230402835713355, 0.013490355228136089, -0.2677150659736769, 0.2491522545404796, 0.030991219966480993, 0.3151378707740175, 0.07943748769490686, 0.09335162377061501, 0.02803975374641994, -0.05472941119989304, 0.02357514876607576, -0.04991098269143449, 0.221929100619578, 0.28630438123587265, 0.19455555241000008, 0.3341486893549612, -0.45523322478242934, -0.16382537692249433, 0.025643821926915073, 0.14507185926737443, 0.07434224880185641, -0.09420866755950456, -0.2978548599049857, 0.12349061710657934, -0.2894386894209948, -0.04123818552502661, -0.09561185658692498, 0.009922291142610859, 0.050081036722188665, -0.2321265130877903, -0.06126073486835868, -0.0686981899006777, 0.12225638971702285, -0.00995935033249337, -0.08395416627331853, 0.01593401415707314, 0.1725453712964711, -0.05001082671455376, 0.008159956967375204, 0.2063992904747951, -0.1455024169799425, -0.15434677884850193, 0.36444362772513844, -0.016421974209226566, -0.1474319977338158, 0.17211167109103184, -0.03008505567403555, -0.13224667292534795, 0.0705134652169064, 0.2676395958589313, 0.08628601509733252, -0.17325533056402043, 0.08551929433820514, -0.006382245329616923, 0.20092076264730055, 0.04045022667819404, 0.03900100797899578, 0.22338110570036743, 0.22420628945190102, 0.059979662573449825, 0.1478021721358009, -0.05888743086698886, -0.07352119897275347, -0.1972892787554684, -0.1812528317159501, -0.21332425004738856, 0.046058844538144, -0.1034443889226691, -0.16450574332593035, 0.4114010694328287, 0.1676758725693679, 0.13830599068083532, 0.08373101045226451, 0.3791543820630504, -0.007019579625044222, 0.16590402097033005, 0.15108891917800862, 0.09400793415979061, 0.009098999363319208, 0.21446210194749069, -0.13053478682110697, 0.09539986067879722, -0.041032201519805286]
|
1,803.08427
|
A fresh look into the interacting dark matter scenario
|
The elastic scattering between dark matter particles and radiation represents
an attractive possibility to solve a number of discrepancies between
observations and standard cold dark matter predictions, as the induced
collisional damping would imply a suppression of small-scale structures. We
consider this scenario and confront it with measurements of the ionization
history of the Universe at several redshifts and with recent estimates of the
counts of Milky Way satellite galaxies. We derive a conservative upper bound on
the dark matter-photon elastic scattering cross section of $\sigma_{\gamma
\rm{DM}} < 8 \times 10^{-10} \, \sigma_T \, \left(m_{\rm DM}/{\rm GeV}\right)$
at $95\%$~CL, about one order of magnitude tighter than previous {constraints
from satellite number counts}. Due to the strong degeneracies with
astrophysical parameters, the bound on the dark matter-photon scattering cross
section derived here is driven by the estimate of the number of Milky Way
satellite galaxies. Finally, we also argue that future 21~cm probes could help
in disentangling among possible non-cold dark matter candidates, such as
interacting and warm dark matter scenarios. Let us emphasize that bounds of
similar magnitude to the ones obtained here could be also derived for models
with dark matter-neutrino interactions and would be as constraining as the
tightest limits on such scenarios.
|
astro-ph.CO
|
the elastic scattering between dark matter particles and radiation represents an attractive possibility to solve a number of discrepancies between observations and standard cold dark matter predictions as the induced collisional damping would imply a suppression of smallscale structures we consider this scenario and confront it with measurements of the ionization history of the universe at several redshifts and with recent estimates of the counts of milky way satellite galaxies we derive a conservative upper bound on the dark matterphoton elastic scattering cross section of sigma_gamma rmdm 8 times 1010 sigma_t leftm_rm dmrm gevright at 95cl about one order of magnitude tighter than previous constraints from satellite number counts due to the strong degeneracies with astrophysical parameters the bound on the dark matterphoton scattering cross section derived here is driven by the estimate of the number of milky way satellite galaxies finally we also argue that future 21cm probes could help in disentangling among possible noncold dark matter candidates such as interacting and warm dark matter scenarios let us emphasize that bounds of similar magnitude to the ones obtained here could be also derived for models with dark matterneutrino interactions and would be as constraining as the tightest limits on such scenarios
|
[['the', 'elastic', 'scattering', 'between', 'dark', 'matter', 'particles', 'and', 'radiation', 'represents', 'an', 'attractive', 'possibility', 'to', 'solve', 'a', 'number', 'of', 'discrepancies', 'between', 'observations', 'and', 'standard', 'cold', 'dark', 'matter', 'predictions', 'as', 'the', 'induced', 'collisional', 'damping', 'would', 'imply', 'a', 'suppression', 'of', 'smallscale', 'structures', 'we', 'consider', 'this', 'scenario', 'and', 'confront', 'it', 'with', 'measurements', 'of', 'the', 'ionization', 'history', 'of', 'the', 'universe', 'at', 'several', 'redshifts', 'and', 'with', 'recent', 'estimates', 'of', 'the', 'counts', 'of', 'milky', 'way', 'satellite', 'galaxies', 'we', 'derive', 'a', 'conservative', 'upper', 'bound', 'on', 'the', 'dark', 'matterphoton', 'elastic', 'scattering', 'cross', 'section', 'of', 'sigma_gamma', 'rmdm', '8', 'times', '1010', 'sigma_t', 'leftm_rm', 'dmrm', 'gevright', 'at', '95cl', 'about', 'one', 'order', 'of', 'magnitude', 'tighter', 'than', 'previous', 'constraints', 'from', 'satellite', 'number', 'counts', 'due', 'to', 'the', 'strong', 'degeneracies', 'with', 'astrophysical', 'parameters', 'the', 'bound', 'on', 'the', 'dark', 'matterphoton', 'scattering', 'cross', 'section', 'derived', 'here', 'is', 'driven', 'by', 'the', 'estimate', 'of', 'the', 'number', 'of', 'milky', 'way', 'satellite', 'galaxies', 'finally', 'we', 'also', 'argue', 'that', 'future', '21cm', 'probes', 'could', 'help', 'in', 'disentangling', 'among', 'possible', 'noncold', 'dark', 'matter', 'candidates', 'such', 'as', 'interacting', 'and', 'warm', 'dark', 'matter', 'scenarios', 'let', 'us', 'emphasize', 'that', 'bounds', 'of', 'similar', 'magnitude', 'to', 'the', 'ones', 'obtained', 'here', 'could', 'be', 'also', 'derived', 'for', 'models', 'with', 'dark', 'matterneutrino', 'interactions', 'and', 'would', 'be', 'as', 'constraining', 'as', 'the', 'tightest', 'limits', 'on', 'such', 'scenarios']]
|
[-0.10725672829859144, 0.14255336090867043, -0.09627503795990609, 0.14657704559947127, -0.09721492932395852, -0.07397534053040604, 0.0074541946289254655, 0.2948908517948023, -0.19438561657096134, -0.42091949494666797, 0.010541718037027532, -0.317970394476581, -0.02600568751439647, 0.23878265515233932, 0.04665793509880516, 0.002525055836608161, 0.006949059823898608, -0.02211386980593149, -0.02240993582269418, -0.26751647125095573, 0.30138261420235263, 0.0954549554318412, 0.16178266663771512, 0.060872445849062345, 0.06395878314286174, -0.025124015508970216, -0.07114903685122506, -0.05093086303665826, -0.21205385289621476, 0.07206665728686017, 0.22245306753176186, 0.0838516817592659, 0.1448898801976231, -0.43780467442997884, -0.21124925787806215, 0.18970727308454058, 0.1779844226195148, 0.10091152224013239, -0.05877281371816826, -0.30231884845639045, 0.02841177330941972, -0.1935519760831338, -0.13914298916244833, -0.01097158325571956, 0.01558841808944644, -0.0009922707182313524, -0.24609440652449704, 0.13433530235654947, -0.024720068821748393, -0.05861022753310297, -0.08374795306344958, -0.13193239285888622, -0.021000502350744767, -0.003032602133479581, 0.07897223004392483, 0.001397065491651866, 0.20031989739503508, -0.19679050945296922, -0.07148610654087802, 0.42260140960860015, -0.13559859019794804, -0.08124497776795457, 0.20060073848887908, -0.1458170041279747, -0.16055187373074578, 0.09924106558423433, 0.16624790255236033, 0.04344900623797925, -0.13006808142182394, 0.0747434394416719, -0.04901689270729041, 0.18582098961654883, 0.07426992526297592, 0.09482220222070739, 0.3161095735380676, 0.15684862969332, 0.09112723061666633, 0.02723081437876652, -0.14275105819233522, -0.03405074915235899, -0.30503755289857365, -0.09385547361311164, -0.11029816000949387, 0.06215896456507011, -0.1152362756343357, -0.06434456819079964, 0.2876175835228233, 0.14998710142050067, 0.24916252020783536, 0.051808692050393464, 0.35695316567460994, 0.0942079682541381, 0.03551939898431162, 0.04228882796237644, 0.3246196593940999, 0.17800417004167032, 0.021475797904822142, -0.20237368614116302, 0.053306510179090445, -0.028755682339863992]
|
1,803.08428
|
A non-existence theorem for N>16 supersymmetric AdS3 backgrounds
|
We show that there are no smooth warped AdS$_3$ solutions in 10- and
11-dimensional supergravities which preserve strictly more than 16
supersymmetries and have internal space a compact without boundary manifold.
|
hep-th math-ph math.DG math.MP
|
we show that there are no smooth warped ads_3 solutions in 10 and 11dimensional supergravities which preserve strictly more than 16 supersymmetries and have internal space a compact without boundary manifold
|
[['we', 'show', 'that', 'there', 'are', 'no', 'smooth', 'warped', 'ads_3', 'solutions', 'in', '10', 'and', '11dimensional', 'supergravities', 'which', 'preserve', 'strictly', 'more', 'than', '16', 'supersymmetries', 'and', 'have', 'internal', 'space', 'a', 'compact', 'without', 'boundary', 'manifold']]
|
[-0.15206953155763087, 0.13341327053644964, 0.011165397722394235, 0.10723182156441673, -0.12291873438704398, -0.21745508889697732, -0.09860415768719488, 0.43299509032118705, -0.03535572487500406, -0.24881638580512616, 0.22080470507048192, -0.31446000933647156, -0.15101779829109868, 0.13010632246732712, -0.12462132174762026, -0.006816460901210385, 0.03966592050968639, 0.05704655269941976, -0.21520368039097276, -0.2851780142950555, 0.41051742381926987, -0.12623036033173482, 0.21111322308499966, -0.04059852722791895, 0.13861890623886738, -0.13004912191536278, 0.04244771167155235, 0.03480734650492518, -0.11389691721494948, 0.10888649473687814, 0.24519280163991836, 0.10285035118220313, 0.11805366250055452, -0.511896631410045, -0.28092785257725944, 0.1517880604031586, 0.21083079319026682, 0.07156938688093496, -0.029312866509445163, -0.28207340869571895, 0.14368333020097307, -0.1401003408095529, -0.1365221635318331, -0.11682847610885097, 0.0710729388219695, -0.186261628596713, -0.19745492487544974, 0.0666556422328276, 0.08713931608344277, 0.07381989503459584, -0.15103227691724896, -0.024023387032831387, -0.21724821215555554, -0.016330779214660005, 0.08172945735315161, 0.12707151347891457, 0.09956156868006914, -0.10244484729464015, -0.11683806841592154, 0.2996543092923539, -0.03796864871260515, -0.37746661126373277, 0.1963952887923487, -0.19091475477081635, -0.1543066777258871, 0.21181777576285024, 0.07397757090568062, 0.2123265327705491, -0.08605899454485025, 0.1731205420350776, -0.045932720456602835, 0.19302507952576684, 0.18390918179084698, 0.09561017353553325, 0.16794579037495197, 0.08328775463685874, 0.21179177946290903, 0.10740883445607559, -0.0009072394065198398, -0.10641952264573305, -0.3818975506770995, -0.17992967233482388, -0.041601670665606376, 0.1998817858796927, -0.22076377651049575, -0.13758055180791887, 0.2947702331077908, 0.020831003334493406, 0.1759738688387217, 0.1182938049014117, 0.12330806567784279, 0.014777585721364426, 0.11424304941488851, 0.23828584917130008, 0.23388962345498224, 0.07669493078344292, 0.029124475234458522, -0.13189487986176485, -0.18718117854047206, 0.06829501342989745]
|
1,803.08429
|
On the age of the Nele asteroid family
|
The Nele group, formerly known as the Iannini family, is one of the youngest
asteroid families in the main belt. Previously, it has been noted that the
pericenter longitudes $\varpi$ and nodal longitudes $\Omega$ of its largest
member asteroids are clustered at the present time, therefore suggesting that
the collisional breakup of parent body must have happened recently. Here we
verify this conclusion by detailed orbit-propagation of a synthetic Nele family
and show that the current level of clustering of secular angles of the largest
Nele family members requires an approximate age limit of $4.5$ Myr.
Additionally, we make use of an updated and largely extended Nele membership to
obtain, for the first time, an age estimate of this family using the Backward
Integration Method (BIM). Convergence of the secular angles in a purely
gravitational model and in a model including the non-gravitational forces
caused by the Yarkovsky effect are both compatible with an age younger than $7$
Myr. More accurate determination of the Nele family age would require
additional data about the spin state of its members.
|
astro-ph.EP
|
the nele group formerly known as the iannini family is one of the youngest asteroid families in the main belt previously it has been noted that the pericenter longitudes varpi and nodal longitudes omega of its largest member asteroids are clustered at the present time therefore suggesting that the collisional breakup of parent body must have happened recently here we verify this conclusion by detailed orbitpropagation of a synthetic nele family and show that the current level of clustering of secular angles of the largest nele family members requires an approximate age limit of 45 myr additionally we make use of an updated and largely extended nele membership to obtain for the first time an age estimate of this family using the backward integration method bim convergence of the secular angles in a purely gravitational model and in a model including the nongravitational forces caused by the yarkovsky effect are both compatible with an age younger than 7 myr more accurate determination of the nele family age would require additional data about the spin state of its members
|
[['the', 'nele', 'group', 'formerly', 'known', 'as', 'the', 'iannini', 'family', 'is', 'one', 'of', 'the', 'youngest', 'asteroid', 'families', 'in', 'the', 'main', 'belt', 'previously', 'it', 'has', 'been', 'noted', 'that', 'the', 'pericenter', 'longitudes', 'varpi', 'and', 'nodal', 'longitudes', 'omega', 'of', 'its', 'largest', 'member', 'asteroids', 'are', 'clustered', 'at', 'the', 'present', 'time', 'therefore', 'suggesting', 'that', 'the', 'collisional', 'breakup', 'of', 'parent', 'body', 'must', 'have', 'happened', 'recently', 'here', 'we', 'verify', 'this', 'conclusion', 'by', 'detailed', 'orbitpropagation', 'of', 'a', 'synthetic', 'nele', 'family', 'and', 'show', 'that', 'the', 'current', 'level', 'of', 'clustering', 'of', 'secular', 'angles', 'of', 'the', 'largest', 'nele', 'family', 'members', 'requires', 'an', 'approximate', 'age', 'limit', 'of', '45', 'myr', 'additionally', 'we', 'make', 'use', 'of', 'an', 'updated', 'and', 'largely', 'extended', 'nele', 'membership', 'to', 'obtain', 'for', 'the', 'first', 'time', 'an', 'age', 'estimate', 'of', 'this', 'family', 'using', 'the', 'backward', 'integration', 'method', 'bim', 'convergence', 'of', 'the', 'secular', 'angles', 'in', 'a', 'purely', 'gravitational', 'model', 'and', 'in', 'a', 'model', 'including', 'the', 'nongravitational', 'forces', 'caused', 'by', 'the', 'yarkovsky', 'effect', 'are', 'both', 'compatible', 'with', 'an', 'age', 'younger', 'than', '7', 'myr', 'more', 'accurate', 'determination', 'of', 'the', 'nele', 'family', 'age', 'would', 'require', 'additional', 'data', 'about', 'the', 'spin', 'state', 'of', 'its', 'members']]
|
[-0.11590393797900939, 0.11639452050341356, -0.10877548233674324, 0.07384542295233068, -0.0920497950397979, -0.042751084452779115, 0.0428219284733368, 0.3637082018148901, -0.2312550918214907, -0.3355184779765537, 0.08462837942820674, -0.2583124320112211, -0.08247637883845538, 0.2026976149523957, -0.07047811651202497, -0.0015056002633527742, 0.08245442352404997, 0.043681261929457135, -0.021578921432643706, -0.23063563746018703, 0.3142520409908756, 0.05810033696135348, 0.11492031958680284, -0.03689333150889409, 0.07937125477605726, -0.042364530496846485, -0.04126786499607803, -0.04790579619170245, -0.16001952930657282, 0.093772572880916, 0.18985934600123536, 0.11409989620643105, 0.2683501688100524, -0.335508666495861, -0.1799518343253261, 0.08580946426714986, 0.174064498524955, 0.096507034177029, -0.0531046342563922, -0.29596362016716243, 0.06716080873383809, -0.23203036574236416, -0.21893242751853279, 0.0058844996416299354, 0.09711967105319523, -0.0033491061978031603, -0.20712048557750082, 0.12462527680310742, 0.06834019013906771, 0.12432216088113895, -0.10856267901816231, -0.1948466542003266, -0.05444905235258452, 0.11755837858154697, 0.07250883090073022, 0.02722887862766409, 0.1017658265970521, -0.05871604018881496, -0.11010643454678988, 0.3689292600890753, -0.03779418308244779, -0.09201504170136937, 0.19170283318081566, -0.17740728486971247, -0.14489849134332547, 0.14630374534444957, 0.1575672538940516, 0.14286865841065885, -0.17995312015952195, 0.03636149208832237, -0.037821862423703036, 0.18810714092000394, 0.0576149274537203, 0.008060036903236714, 0.2246933164348626, 0.13709495477062666, 0.0776840808240981, 0.07777054350356845, -0.16565504082936353, -0.10460003376885786, -0.2428580083500194, -0.12356887989745562, -0.12609209723791664, 0.03572325866753604, -0.10589181575864964, -0.14291059814582943, 0.35255323125096827, 0.14925513395481865, 0.17928868775008677, 0.06337738883455342, 0.2506020099955932, 0.06008482427010049, 0.1138121120047645, 0.11280023947615955, 0.3008417584367707, 0.11895703430955777, 0.016352793095090117, -0.21670337609018037, 0.15813547954787724, 0.022786811215140052]
|
1,803.0843
|
Topologically conjugate classifications of the translation actions on
low-dimensional compact connected Lie groups
|
In this article, we focus on the left translation actions on noncommutative
compact connected Lie groups with topological dimension 3 or 4, consisting of
${\rm SU}(2),\,{\rm U}(2),\,{\rm SO}(3),\,{\rm SO}(3) \times S^1$ and ${{\rm
Spin}}^{\mathbb{C}}(3)$. We define the rotation vectors (numbers) of the left
actions induced by the elements in the maximal tori of these groups, and
utilize rotation vectors (numbers) to give the topologically conjugate
classification of the left actions. Algebraic conjugacy and smooth conjugacy
are also considered. As a by-product, we show that for any homeomorphism
$f:L(p, -1)\times S^1\rightarrow L(p, -1)\times S^1$, the induced isomorphism
$(\pi\circ f\circ i)_*$ maps each element in the fundamental group of $L(p,
-1)$ to itself or its inverse, where $i:L(p,-1)\rightarrow L(p, -1)\times S^1$
is the natural inclusion and $\pi:L(p, -1)\times S^1\rightarrow L(p, -1)$ is
the projection.
|
math.DS math.AT
|
in this article we focus on the left translation actions on noncommutative compact connected lie groups with topological dimension 3 or 4 consisting of rm su2rm u2rm so3rm so3 times s1 and rm spinmathbbc3 we define the rotation vectors numbers of the left actions induced by the elements in the maximal tori of these groups and utilize rotation vectors numbers to give the topologically conjugate classification of the left actions algebraic conjugacy and smooth conjugacy are also considered as a byproduct we show that for any homeomorphism flp 1times s1rightarrow lp 1times s1 the induced isomorphism picirc fcirc i_ maps each element in the fundamental group of lp 1 to itself or its inverse where ilp1rightarrow lp 1times s1 is the natural inclusion and pilp 1times s1rightarrow lp 1 is the projection
|
[['in', 'this', 'article', 'we', 'focus', 'on', 'the', 'left', 'translation', 'actions', 'on', 'noncommutative', 'compact', 'connected', 'lie', 'groups', 'with', 'topological', 'dimension', '3', 'or', '4', 'consisting', 'of', 'rm', 'su2rm', 'u2rm', 'so3rm', 'so3', 'times', 's1', 'and', 'rm', 'spinmathbbc3', 'we', 'define', 'the', 'rotation', 'vectors', 'numbers', 'of', 'the', 'left', 'actions', 'induced', 'by', 'the', 'elements', 'in', 'the', 'maximal', 'tori', 'of', 'these', 'groups', 'and', 'utilize', 'rotation', 'vectors', 'numbers', 'to', 'give', 'the', 'topologically', 'conjugate', 'classification', 'of', 'the', 'left', 'actions', 'algebraic', 'conjugacy', 'and', 'smooth', 'conjugacy', 'are', 'also', 'considered', 'as', 'a', 'byproduct', 'we', 'show', 'that', 'for', 'any', 'homeomorphism', 'flp', '1times', 's1rightarrow', 'lp', '1times', 's1', 'the', 'induced', 'isomorphism', 'picirc', 'fcirc', 'i_', 'maps', 'each', 'element', 'in', 'the', 'fundamental', 'group', 'of', 'lp', '1', 'to', 'itself', 'or', 'its', 'inverse', 'where', 'ilp1rightarrow', 'lp', '1times', 's1', 'is', 'the', 'natural', 'inclusion', 'and', 'pilp', '1times', 's1rightarrow', 'lp', '1', 'is', 'the', 'projection']]
|
[-0.1826899857296953, 0.15586663388801136, 0.01542662287783611, 0.062026935934793116, -0.06114322245560997, -0.10034547507942573, -0.003085298280370986, 0.39062960985607986, -0.34224651710636267, -0.2092857199196711, 0.1770503276062572, -0.28143515713571565, -0.09294964637475338, 0.17604216105028744, -0.09683695224326426, -0.023926950294953425, -0.02670213377000544, 0.11733998719778821, -0.1648126179095739, -0.2242026548515492, 0.33581590332736183, -0.10495381331525919, 0.18015200808721293, 0.0005021475193156736, 0.13452657463953016, -0.023240402040225785, 0.014871577086939118, -0.06318903607536312, -0.1628109418815593, 0.14053909245907792, 0.24503861118738693, 0.09037085485967301, 0.18803224421846937, -0.3634855659333916, -0.10738402763271601, 0.16667009199287477, 0.11173231825305838, -0.06253166846549651, -0.022119454344675885, -0.3131021951860565, 0.13501743718937742, -0.1464737573359895, -0.08419833457332075, -0.03272212210191986, 0.104947306685091, -0.016753817039475902, -0.24110968665432508, 0.04711487452021991, 0.15587803486030638, 0.09553464535095794, -0.07196133227113223, -0.10965014277594384, -0.055047791366883383, 0.10813593943548337, 0.02107443929261227, 0.11842457283156242, 0.11442215270527792, -0.046024130065155426, -0.1127960716271553, 0.40065359986409194, -0.048448544230282775, -0.22544775078051144, 0.1721384878651657, -0.18137008302632396, -0.1587341235415262, 0.11450397314533121, 0.10801732769661297, 0.15031697337082991, -0.009347228137189596, 0.18207424871557518, -0.10763621697656986, 0.16420684629816593, 0.07652543228867603, 0.0063660398572976664, 0.11464561001346336, 0.09133774886919757, 0.14875219875257314, 0.07943828473248937, -0.04143293821949541, 0.04804794788067266, -0.3100976584787209, -0.16269826365810797, -0.0880235270193712, 0.1491005077617111, -0.11827204062779412, -0.12029420875203539, 0.3686295991220812, 0.08081386618198842, 0.21546922128933563, 0.08550860246966087, 0.21027305688320358, 0.08730583212349388, 0.06696864855879052, 0.09714669652840519, 0.11213276677904284, 0.19751222374277028, -0.0812394680367328, -0.1845253967115377, -0.07588605294150748, 0.2042637821616913]
|
1,803.08431
|
Approximating the frequency dependence of the effective interaction in
the functional renormalization group for many-fermion systems
|
The functional renormalization group has become a widely used tool for the
analysis of the leading low-temperature correlations in weakly to moderately
coupled many-fermion lattice systems. A bottleneck for quantitatively more
precise results is that the treatment of the frequency dependence of the
flowing interactions is numerically quite demanding. Yet the frequency
dependence is needed to compute relevant selfenergies and hence for controlled
results on the energy scales for ordering or for the quasiparticle properties.
Here we explore an approximate parametrization of the frequency dependence of
the interaction vertex that is inspired by established simplifications in the
theory of superconductivity and that keeps the numerical effort bounded. We
demonstrate the validity of the approximation for Cooper pairing problems and
apply it to the two-dimensional Hubbard model.
|
cond-mat.str-el cond-mat.supr-con
|
the functional renormalization group has become a widely used tool for the analysis of the leading lowtemperature correlations in weakly to moderately coupled manyfermion lattice systems a bottleneck for quantitatively more precise results is that the treatment of the frequency dependence of the flowing interactions is numerically quite demanding yet the frequency dependence is needed to compute relevant selfenergies and hence for controlled results on the energy scales for ordering or for the quasiparticle properties here we explore an approximate parametrization of the frequency dependence of the interaction vertex that is inspired by established simplifications in the theory of superconductivity and that keeps the numerical effort bounded we demonstrate the validity of the approximation for cooper pairing problems and apply it to the twodimensional hubbard model
|
[['the', 'functional', 'renormalization', 'group', 'has', 'become', 'a', 'widely', 'used', 'tool', 'for', 'the', 'analysis', 'of', 'the', 'leading', 'lowtemperature', 'correlations', 'in', 'weakly', 'to', 'moderately', 'coupled', 'manyfermion', 'lattice', 'systems', 'a', 'bottleneck', 'for', 'quantitatively', 'more', 'precise', 'results', 'is', 'that', 'the', 'treatment', 'of', 'the', 'frequency', 'dependence', 'of', 'the', 'flowing', 'interactions', 'is', 'numerically', 'quite', 'demanding', 'yet', 'the', 'frequency', 'dependence', 'is', 'needed', 'to', 'compute', 'relevant', 'selfenergies', 'and', 'hence', 'for', 'controlled', 'results', 'on', 'the', 'energy', 'scales', 'for', 'ordering', 'or', 'for', 'the', 'quasiparticle', 'properties', 'here', 'we', 'explore', 'an', 'approximate', 'parametrization', 'of', 'the', 'frequency', 'dependence', 'of', 'the', 'interaction', 'vertex', 'that', 'is', 'inspired', 'by', 'established', 'simplifications', 'in', 'the', 'theory', 'of', 'superconductivity', 'and', 'that', 'keeps', 'the', 'numerical', 'effort', 'bounded', 'we', 'demonstrate', 'the', 'validity', 'of', 'the', 'approximation', 'for', 'cooper', 'pairing', 'problems', 'and', 'apply', 'it', 'to', 'the', 'twodimensional', 'hubbard', 'model']]
|
[-0.12503760638425038, 0.1352690809919353, -0.11720268191660695, 0.09992512799651614, -0.06797263772034692, -0.1085910822656597, 0.05709720040313042, 0.34687106417758123, -0.2509584588420001, -0.2574604222004021, 0.051998078640151234, -0.2796896606173721, -0.13666315345160132, 0.2087519928177316, 0.051366961180483776, 0.057362506095881734, 0.013328149550712652, 0.018183684346103478, -0.09090728151042843, -0.2183675738827636, 0.3167906936649824, 0.055999860289462265, 0.299763847826167, 0.13112433614312774, 0.05815613647508952, 0.040204520490656176, 0.01788744166316021, 0.028055181379415213, -0.14066863678563674, 0.10015790098686776, 0.2545714083495864, 0.014046051979271902, 0.2600004297222883, -0.43203351232740617, -0.22403080182682192, 0.04376689569344596, 0.15570342449271785, 0.13988516516687852, -0.05297490761909608, -0.23033327846566126, 0.0629207931259381, -0.1887897765263915, -0.15920059768471956, -0.13854167199811884, 0.026973097976888457, -0.016331074726102606, -0.2907985672576442, 0.10663264514952307, 0.03374847193573794, 0.037807620810492645, -0.04916147667995935, -0.07038673035438275, -0.0005015030037611723, 0.11853165570313909, 0.0496369583360363, 0.010466036083738483, 0.10070588912016579, -0.16249059539081323, -0.0741356529798063, 0.39858520635965444, -0.04154293915803825, -0.20065191836791144, 0.20602832470710078, -0.12031738363605525, -0.11072344995946401, 0.10240669881496282, 0.11899422383349803, 0.1137700588687227, -0.1635013238789277, 0.11995168316911625, -0.017798861751096354, 0.18127412569989998, 0.00458156019597063, 0.04914149583690607, 0.15118795750100936, 0.2016103671464537, 0.06579450018230885, 0.11659730552873086, -0.06625455408911443, -0.1257329753319186, -0.270213697268258, -0.09274018322309804, -0.21448574963557934, -0.0026727341501677914, -0.054189679321545614, -0.1819084081244433, 0.426088533556414, 0.1965564424504659, 0.1712199351085084, 0.0342878685757843, 0.258660250979047, 0.15130188020818408, 0.06410838816950601, 0.052500524811284054, 0.24368291108504989, 0.17996409651638556, 0.05548481280649347, -0.30429649637598133, 0.06149405820132603, 0.06872537220301132]
|
1,803.08432
|
Parallel tree algorithms for AMR and non-standard data access
|
We introduce several parallel algorithms operating on a distributed forest of
adaptive quadtrees/octrees. They are targeted at large-scale applications
relying on data layouts that are more complex than required for standard finite
elements, such as hp-adaptive Galerkin methods, particle tracking and
semi-Lagrangian schemes, and in-situ post-processing and visualization.
Specifically, we design algorithms to derive an adapted worker forest based on
sparse data, to identify owner processes in a top-down search of remote
objects, and to allow for variable process counts and per-element data sizes in
partitioning and parallel file I/O. We demonstrate the algorithms' usability
and performance in the context of a particle tracking example that we scale to
21e9 particles and 64Ki MPI processes on the Juqueen supercomputer, and we
describe the construction of a parallel assembly of variably sized spheres in
space creating up to 768e9 elements on the Juwels supercomputer.
|
cs.DC
|
we introduce several parallel algorithms operating on a distributed forest of adaptive quadtreesoctrees they are targeted at largescale applications relying on data layouts that are more complex than required for standard finite elements such as hpadaptive galerkin methods particle tracking and semilagrangian schemes and insitu postprocessing and visualization specifically we design algorithms to derive an adapted worker forest based on sparse data to identify owner processes in a topdown search of remote objects and to allow for variable process counts and perelement data sizes in partitioning and parallel file io we demonstrate the algorithms usability and performance in the context of a particle tracking example that we scale to 21e9 particles and 64ki mpi processes on the juqueen supercomputer and we describe the construction of a parallel assembly of variably sized spheres in space creating up to 768e9 elements on the juwels supercomputer
|
[['we', 'introduce', 'several', 'parallel', 'algorithms', 'operating', 'on', 'a', 'distributed', 'forest', 'of', 'adaptive', 'quadtreesoctrees', 'they', 'are', 'targeted', 'at', 'largescale', 'applications', 'relying', 'on', 'data', 'layouts', 'that', 'are', 'more', 'complex', 'than', 'required', 'for', 'standard', 'finite', 'elements', 'such', 'as', 'hpadaptive', 'galerkin', 'methods', 'particle', 'tracking', 'and', 'semilagrangian', 'schemes', 'and', 'insitu', 'postprocessing', 'and', 'visualization', 'specifically', 'we', 'design', 'algorithms', 'to', 'derive', 'an', 'adapted', 'worker', 'forest', 'based', 'on', 'sparse', 'data', 'to', 'identify', 'owner', 'processes', 'in', 'a', 'topdown', 'search', 'of', 'remote', 'objects', 'and', 'to', 'allow', 'for', 'variable', 'process', 'counts', 'and', 'perelement', 'data', 'sizes', 'in', 'partitioning', 'and', 'parallel', 'file', 'io', 'we', 'demonstrate', 'the', 'algorithms', 'usability', 'and', 'performance', 'in', 'the', 'context', 'of', 'a', 'particle', 'tracking', 'example', 'that', 'we', 'scale', 'to', '21e9', 'particles', 'and', '64ki', 'mpi', 'processes', 'on', 'the', 'juqueen', 'supercomputer', 'and', 'we', 'describe', 'the', 'construction', 'of', 'a', 'parallel', 'assembly', 'of', 'variably', 'sized', 'spheres', 'in', 'space', 'creating', 'up', 'to', '768e9', 'elements', 'on', 'the', 'juwels', 'supercomputer']]
|
[-0.08247087678814685, 0.060115701840465816, -0.0732567841625786, 0.037882052627339916, -0.0761219847144262, -0.14680212729549763, 0.06308337051313424, 0.4544211308053438, -0.2459590315963884, -0.3437381677221561, 0.13056443705125645, -0.24153034730630496, -0.08427578198008132, 0.23168615413917418, -0.06838064993380745, 0.09172929738364789, 0.10587667671126733, -0.036093323771585376, -0.03079835066244519, -0.2591247660010054, 0.2782951143200752, 0.09017950268057377, 0.2868409689711542, -0.01544479679559236, 0.12529881559295472, 0.016135583122166387, -0.09019428150444898, 0.017043701794624423, -0.09154218003085049, 0.13504029152091537, 0.2742235866861175, 0.18085503179674456, 0.252109008571268, -0.4544769196410029, -0.14126976962438345, 0.09216852725038062, 0.15649638008798702, 0.09339684323387464, -0.08434527892034342, -0.2609302203248565, 0.10404112240960957, -0.13068169735007637, -0.04934996344061379, -0.09467159782239384, -0.02978212980931436, 0.04931307556208871, -0.3034685719555811, -0.019879310675289318, 0.007312668608273784, 0.07710686200163394, -0.01052351666536803, -0.10171339511736363, 0.053689569980580956, 0.11598319043000431, -0.06936804779326085, -0.044240966402129205, 0.1803256959107745, -0.10555231381221201, -0.17755203439088107, 0.40809376520253177, -0.034955988385553464, -0.21578964364606942, 0.2591194140782202, -0.05071565664526871, -0.17728671298591772, 0.09566406891816229, 0.3075007736966338, 0.13935799394950163, -0.12300812450332055, 0.0623096800438783, 0.02005016948670095, 0.16663742127517858, 0.05661017011405657, -0.01001602402496813, 0.13041314435279186, 0.22895453982325137, 0.0895265131999833, 0.11970677171442387, -0.11297700174011129, -0.10681560219508475, -0.2249180599380676, -0.19321258511732542, -0.16652807689346102, -0.05766975709939025, -0.12328301215165993, -0.20510455491898608, 0.3559954433222774, 0.20770681422014814, 0.16207681850705674, 0.06728769959949389, 0.36318019323347916, 0.021745883494419842, 0.12008114596423895, 0.14278765828888593, 0.11936891682452752, 0.053464659180093986, 0.14264013987385493, -0.16875277210593873, 0.02481205829932098, 0.05966212232327224]
|
1,803.08433
|
Dyloc: Dynamic and Collaborative User-controlled AOA based Localizing
System with your laptops
|
Currently, accurate localization system based on commodity WiFi devices is
not broadly available yet. In the literature, the solutions are based on either
network infrastructure like WiFi router, which have at least three antennas, or
sacrifice accuracy with coarse grained information like RSSI. In this work, we
design a new localizing system which is accurate based on AOA estimation and
instantly deployable on users' devices.
Dyloc is designed to be dynamically constructed with user's devices as
network nodes without any network infrastructure. On the platform of laptops,
our system achieve comparable localization accuracy with state-of-the-art work
despite of the limitation of less number and large separation of antennas. We
design multi-stage signal processing to resolve the ambiguity issue arisen in
this scenario. To enable dynamic and collaborative construction, our system can
accurately conduct self-localization and also eliminate the need of
infrastructure anchors, which is due to the dedicated two-layer algorithm
design.
|
cs.NI
|
currently accurate localization system based on commodity wifi devices is not broadly available yet in the literature the solutions are based on either network infrastructure like wifi router which have at least three antennas or sacrifice accuracy with coarse grained information like rssi in this work we design a new localizing system which is accurate based on aoa estimation and instantly deployable on users devices dyloc is designed to be dynamically constructed with users devices as network nodes without any network infrastructure on the platform of laptops our system achieve comparable localization accuracy with stateoftheart work despite of the limitation of less number and large separation of antennas we design multistage signal processing to resolve the ambiguity issue arisen in this scenario to enable dynamic and collaborative construction our system can accurately conduct selflocalization and also eliminate the need of infrastructure anchors which is due to the dedicated twolayer algorithm design
|
[['currently', 'accurate', 'localization', 'system', 'based', 'on', 'commodity', 'wifi', 'devices', 'is', 'not', 'broadly', 'available', 'yet', 'in', 'the', 'literature', 'the', 'solutions', 'are', 'based', 'on', 'either', 'network', 'infrastructure', 'like', 'wifi', 'router', 'which', 'have', 'at', 'least', 'three', 'antennas', 'or', 'sacrifice', 'accuracy', 'with', 'coarse', 'grained', 'information', 'like', 'rssi', 'in', 'this', 'work', 'we', 'design', 'a', 'new', 'localizing', 'system', 'which', 'is', 'accurate', 'based', 'on', 'aoa', 'estimation', 'and', 'instantly', 'deployable', 'on', 'users', 'devices', 'dyloc', 'is', 'designed', 'to', 'be', 'dynamically', 'constructed', 'with', 'users', 'devices', 'as', 'network', 'nodes', 'without', 'any', 'network', 'infrastructure', 'on', 'the', 'platform', 'of', 'laptops', 'our', 'system', 'achieve', 'comparable', 'localization', 'accuracy', 'with', 'stateoftheart', 'work', 'despite', 'of', 'the', 'limitation', 'of', 'less', 'number', 'and', 'large', 'separation', 'of', 'antennas', 'we', 'design', 'multistage', 'signal', 'processing', 'to', 'resolve', 'the', 'ambiguity', 'issue', 'arisen', 'in', 'this', 'scenario', 'to', 'enable', 'dynamic', 'and', 'collaborative', 'construction', 'our', 'system', 'can', 'accurately', 'conduct', 'selflocalization', 'and', 'also', 'eliminate', 'the', 'need', 'of', 'infrastructure', 'anchors', 'which', 'is', 'due', 'to', 'the', 'dedicated', 'twolayer', 'algorithm', 'design']]
|
[-0.16579813150533784, 0.002919189316841463, -0.03907815147812168, -0.014449147509876638, -0.1334858410122494, -0.23935425635272017, 0.07315936649839083, 0.42190170330305893, -0.22746817717018228, -0.3645658789326747, 0.1328887723145696, -0.26463923130805295, -0.1755020434735343, 0.19017541483199846, -0.1242687830577294, 0.08150344973410635, 0.09835160062648356, 0.03952898249650995, -0.024226775337010623, -0.24585418861204136, 0.2838169420681273, 0.10946953693404794, 0.3638053959483902, 0.05885539196548052, 0.09333405444708963, -0.012736745852356155, -0.01990185666208466, -0.016920789141052713, -0.031271351847487194, 0.1577131997824957, 0.29617573745548725, 0.1418851155259957, 0.3009608731046319, -0.4734080367287, -0.23592645060717282, 0.08704974284706016, 0.1632829079994311, 0.0920668186348242, -0.018224208420918632, -0.32559518575668334, 0.13709758653926352, -0.2295377480487029, -0.05699675161517613, -0.0729810104945985, -0.06976887772480647, 0.02468166985238592, -0.2579236342882117, -0.021051206509776724, -0.03499080127725999, 0.0625613842268164, -0.00011928053330242012, -0.07763863873668014, 0.04513521827990189, 0.18370194376601526, -0.027203946175674596, 0.012541697983785223, 0.1644850605695198, -0.10421089690489073, -0.11570792468885581, 0.3808583621059855, 0.012772550888669987, -0.22616509202557306, 0.21333240922773256, -0.037675315248779956, -0.12201982400380075, 0.12345085320994258, 0.2606264270842075, 0.09423406801496943, -0.18045145761221648, -0.005077287328119079, 0.014906669370830058, 0.2396271145467957, 0.03849709296754251, 0.10183266052044929, 0.19550850484364976, 0.2772958878955493, 0.15095880939023723, 0.07167004113318398, -0.10118360415877153, -0.06264357729504506, -0.19530670204510292, -0.10780554344683575, -0.2361848402232863, -0.00202150590630481, -0.06254274456412531, -0.13936249571697165, 0.3488394828420132, 0.24333988167345524, 0.13770940077491103, 0.07837804651246794, 0.420363705943649, 0.013752400008185455, 0.14375208720564842, 0.11677215391149123, 0.194789518751204, -0.016868251809549595, 0.15743110586549544, -0.17072723866789602, 0.09776825572383435, 0.012765825513439874]
|
1,803.08434
|
Confinement and XSB in QCD: Mysteries and beauty of soliton dynamics in
nonAbelian gauge theories
|
Deep insights into the possible infrared dynamics of strongly-coupled
nonAbelian gauge theories such as QCD come from the analyses of ${\cal N}=1$ or
${\cal N}=2$ supersymmetric gauge theories. Central in the whole discussion
will be the topological soliton monopoles and vortices and their quantum
dynamics. We review the arguments that nonAbelian monopoles, free from the
classic "difficulties", can be defined semi-classically via the topology and
stability connection to the better understood nonAbelian vortices. Recent
results on $CP^{N-1}$ models on $2D$ worldsheet of finite width, establish the
quantum mechanical nature of such nonAbelian monopoles. An interesting class of
RG flows and emergence of confining vacua "nearby" strongly-coupled
infrared-fixed point (IRFP) conformal theories are discussed in the context of
most singular vacua in ${\cal N}=2$ supersymmetric QCD. Certain analogy with
the real-world QCD is drawn. In many systems, color-flavor locking emerges as a
crucial mechanism for the gauge system to avoid dynamical Abelianization.
|
hep-th hep-lat hep-ph
|
deep insights into the possible infrared dynamics of stronglycoupled nonabelian gauge theories such as qcd come from the analyses of cal n1 or cal n2 supersymmetric gauge theories central in the whole discussion will be the topological soliton monopoles and vortices and their quantum dynamics we review the arguments that nonabelian monopoles free from the classic difficulties can be defined semiclassically via the topology and stability connection to the better understood nonabelian vortices recent results on cpn1 models on 2d worldsheet of finite width establish the quantum mechanical nature of such nonabelian monopoles an interesting class of rg flows and emergence of confining vacua nearby stronglycoupled infraredfixed point irfp conformal theories are discussed in the context of most singular vacua in cal n2 supersymmetric qcd certain analogy with the realworld qcd is drawn in many systems colorflavor locking emerges as a crucial mechanism for the gauge system to avoid dynamical abelianization
|
[['deep', 'insights', 'into', 'the', 'possible', 'infrared', 'dynamics', 'of', 'stronglycoupled', 'nonabelian', 'gauge', 'theories', 'such', 'as', 'qcd', 'come', 'from', 'the', 'analyses', 'of', 'cal', 'n1', 'or', 'cal', 'n2', 'supersymmetric', 'gauge', 'theories', 'central', 'in', 'the', 'whole', 'discussion', 'will', 'be', 'the', 'topological', 'soliton', 'monopoles', 'and', 'vortices', 'and', 'their', 'quantum', 'dynamics', 'we', 'review', 'the', 'arguments', 'that', 'nonabelian', 'monopoles', 'free', 'from', 'the', 'classic', 'difficulties', 'can', 'be', 'defined', 'semiclassically', 'via', 'the', 'topology', 'and', 'stability', 'connection', 'to', 'the', 'better', 'understood', 'nonabelian', 'vortices', 'recent', 'results', 'on', 'cpn1', 'models', 'on', '2d', 'worldsheet', 'of', 'finite', 'width', 'establish', 'the', 'quantum', 'mechanical', 'nature', 'of', 'such', 'nonabelian', 'monopoles', 'an', 'interesting', 'class', 'of', 'rg', 'flows', 'and', 'emergence', 'of', 'confining', 'vacua', 'nearby', 'stronglycoupled', 'infraredfixed', 'point', 'irfp', 'conformal', 'theories', 'are', 'discussed', 'in', 'the', 'context', 'of', 'most', 'singular', 'vacua', 'in', 'cal', 'n2', 'supersymmetric', 'qcd', 'certain', 'analogy', 'with', 'the', 'realworld', 'qcd', 'is', 'drawn', 'in', 'many', 'systems', 'colorflavor', 'locking', 'emerges', 'as', 'a', 'crucial', 'mechanism', 'for', 'the', 'gauge', 'system', 'to', 'avoid', 'dynamical', 'abelianization']]
|
[-0.16347517124687633, 0.2504151135008821, -0.09271570157570143, 0.12048083861436074, -0.08995721422834321, -0.1479490320268087, 0.012035497380420566, 0.3168776961416006, -0.18947123630981272, -0.22332514436449855, 0.08948974086437374, -0.2654125694309672, -0.17434378415190926, 0.09547479919429558, -0.059966982066010435, 0.07809022734950608, -0.014874543497959773, 0.03302473528776318, -0.07651817142536553, -0.2480847509081165, 0.30317049658546846, -0.030573915972878847, 0.2834536020985494, 0.0749766700854525, 0.029457155900696915, -0.03228374420509984, 0.0030506406848629314, 0.005780751233299573, -0.1464672336372799, 0.0693176073115319, 0.24362645394200325, 0.03768165084378173, 0.12912158587869876, -0.47502953408906856, -0.26346150700002907, 0.1142404362373054, 0.20413735104957595, 0.12836468198957543, -0.02805935876754423, -0.3323205641160409, 0.0726205847474436, -0.15640204924158752, -0.17627105512113, -0.10905978144146503, -0.018506679532899094, -0.07845403916590536, -0.1949720750535683, 0.04252953879768029, 0.019876985629671252, 0.06692287582283218, -0.00741490265315709, -0.060389696299874535, -0.10014648901764303, 0.07713189903491487, 0.1249005130189471, 0.06260006760557492, 0.1535292816379418, -0.26506351244015, -0.20842087819861868, 0.4342509690998122, -0.018828624667755017, -0.1705127694333593, 0.21023657293369372, -0.09975345511610309, -0.1860677235542486, 0.1069586497397783, 0.10908524773083628, 0.15095843566892048, -0.07221322007477284, 0.20469849010774244, -0.06511661668152859, 0.09719350765323422, 0.040761326529706515, 0.10434552291718623, 0.3180573937048515, 0.13837661233109733, 0.020142128150522087, 0.118102392287304, 0.021788853472098708, -0.2053059326519724, -0.421913220534722, -0.12273336289140085, -0.13748937850507598, 0.14250374778949967, -0.1266943414474372, -0.17186834183211128, 0.3550217169802636, 0.13414544145993812, 0.17208149114623666, -0.013214714646649858, 0.17977615038553874, 0.0926602754854442, 0.04999331911249707, 0.009532339574458698, 0.23143472866232817, 0.18848318120338567, 0.08055143955396488, -0.2692305308347568, -0.18637814546818846, 0.2012032104128351]
|
1,803.08435
|
Guided Image Inpainting: Replacing an Image Region by Pulling Content
from Another Image
|
Deep generative models have shown success in automatically synthesizing
missing image regions using surrounding context. However, users cannot directly
decide what content to synthesize with such approaches. We propose an
end-to-end network for image inpainting that uses a different image to guide
the synthesis of new content to fill the hole. A key challenge addressed by our
approach is synthesizing new content in regions where the guidance image and
the context of the original image are inconsistent. We conduct four studies
that demonstrate our results yield more realistic image inpainting results over
seven baselines.
|
cs.CV
|
deep generative models have shown success in automatically synthesizing missing image regions using surrounding context however users cannot directly decide what content to synthesize with such approaches we propose an endtoend network for image inpainting that uses a different image to guide the synthesis of new content to fill the hole a key challenge addressed by our approach is synthesizing new content in regions where the guidance image and the context of the original image are inconsistent we conduct four studies that demonstrate our results yield more realistic image inpainting results over seven baselines
|
[['deep', 'generative', 'models', 'have', 'shown', 'success', 'in', 'automatically', 'synthesizing', 'missing', 'image', 'regions', 'using', 'surrounding', 'context', 'however', 'users', 'can', 'not', 'directly', 'decide', 'what', 'content', 'to', 'synthesize', 'with', 'such', 'approaches', 'we', 'propose', 'an', 'endtoend', 'network', 'for', 'image', 'inpainting', 'that', 'uses', 'a', 'different', 'image', 'to', 'guide', 'the', 'synthesis', 'of', 'new', 'content', 'to', 'fill', 'the', 'hole', 'a', 'key', 'challenge', 'addressed', 'by', 'our', 'approach', 'is', 'synthesizing', 'new', 'content', 'in', 'regions', 'where', 'the', 'guidance', 'image', 'and', 'the', 'context', 'of', 'the', 'original', 'image', 'are', 'inconsistent', 'we', 'conduct', 'four', 'studies', 'that', 'demonstrate', 'our', 'results', 'yield', 'more', 'realistic', 'image', 'inpainting', 'results', 'over', 'seven', 'baselines']]
|
[0.004665800142347029, -0.0480540254678712, -0.0646110902099233, 0.08177330164655455, -0.10826453444498935, -0.1563469265342543, 0.0031932571032819777, 0.4887284808645123, -0.24777378465882258, -0.37881009310091796, 0.07678704836013678, -0.2631655829125329, -0.18297853728658275, 0.17683432371796745, -0.1643843983496098, 0.07841351171710381, 0.09785493623073163, -0.008240883402820481, -0.07260151217740617, -0.2904474031768347, 0.32542260610743573, 0.03158765894722341, 0.350877063613581, 0.004392289647244309, 0.07692817331438787, -0.04847659096611958, -0.07219516743268621, -0.001578529866559333, -0.07277088113401796, 0.17896568685475933, 0.33762539082477144, 0.23867868967354297, 0.27998404055343645, -0.45942677862354014, -0.27451938666207226, 0.03941475837246368, 0.17187942152254676, 0.11957010829723196, -0.17110749073648263, -0.32598649181033434, 0.12041114113955317, -0.1385435115595005, 0.01999421584370889, -0.13236790595478135, -0.040572373353336987, -0.04415741581714859, -0.30169758399164204, -0.001862891028194051, 0.05094061841403968, 0.021131813857018164, -0.09135071229385702, -0.10633718072142648, 0.036753181534770286, 0.20908639281988145, 0.014202027638001661, 0.0828486700787356, 0.14630138168209478, -0.22197446476079916, -0.10717683820495087, 0.37950568042303384, -0.05423503757062319, -0.22387561446643975, 0.1891974257280756, -0.061109280593595224, -0.15871833069249988, 0.12240923039223019, 0.197935972617645, 0.1507779725386124, -0.1845990877598524, -0.026884978358315204, -0.08657681412602726, 0.2182137072282402, 0.033669585882882144, -0.007774037387418119, 0.2481979787153633, 0.24738378513200013, 0.025103447226023205, 0.1555120909047362, -0.158056669574427, -0.04837055925868059, -0.20596686771237535, -0.10914596330962684, -0.16276524329901135, -0.03807395266990888, -0.04668097649930707, -0.0890635664853586, 0.4081530143555842, 0.280024212074319, 0.25007426232883806, 0.0519118085993748, 0.3537567077694755, 0.0013364541613937993, 0.11830755761567209, 0.03002271708591204, 0.19310277619056013, -0.014052266193749873, 0.12232947963608527, -0.12344549561507608, 0.0792927591105629, 0.041102867649169636]
|
1,803.08436
|
Liouville theorems for stable at infinity solutions of m-triharmonic
equation in $\mathbb{R}^N$
|
In this paper we prove the Liouville type theorem for stable at infinity
solutions of the following equation $$\Delta_{m}^{3}u =|u|^{\theta-1}u\;\;\;
\mbox{in}\,\, \mathbb{R}^N,$$
for $1<m-1<\theta<\theta_{s, m}:=\frac{N(m-1)+3m }{N-3m}.$ Here $\theta_{s,
m}$ is a the classic critical exponent for $m-$ bi-harmonic equation.
|
math.AP
|
in this paper we prove the liouville type theorem for stable at infinity solutions of the following equation delta_m3u utheta1u mboxin mathbbrn for 1m1thetatheta_s mfracnm13m n3m here theta_s m is a the classic critical exponent for m biharmonic equation
|
[['in', 'this', 'paper', 'we', 'prove', 'the', 'liouville', 'type', 'theorem', 'for', 'stable', 'at', 'infinity', 'solutions', 'of', 'the', 'following', 'equation', 'delta_m3u', 'utheta1u', 'mboxin', 'mathbbrn', 'for', '1m1thetatheta_s', 'mfracnm13m', 'n3m', 'here', 'theta_s', 'm', 'is', 'a', 'the', 'classic', 'critical', 'exponent', 'for', 'm', 'biharmonic', 'equation']]
|
[-0.18463694996067456, 0.08604044235710587, -0.05149251085573009, 0.03166986490998949, -0.06265435608137133, -0.21778156378173402, 0.007826633142706539, 0.2147046615502664, -0.2875827214281474, -0.1396574452785509, 0.11657541761108275, -0.3693142342780318, -0.14240179636648723, 0.18980292067863047, -0.10396815914926784, 0.10785520566361291, 0.01899302394262382, 0.05914732574352196, -0.06343483045371354, -0.180541731896145, 0.42075170395629746, -0.1651479038809027, 0.1886316394034241, 0.073616962613804, 0.1366150954422275, -0.039161393352385075, 0.08195398155865925, -0.041492044167327026, -0.347935671652002, 0.02947848647433732, 0.21858043127826282, 0.016322690448058504, 0.32146899721452166, -0.3294077879084008, -0.20805511245770114, 0.16912815549543925, 0.1923698411190084, -0.000453451754791396, -0.003981179990140455, -0.27607086401964936, 0.16625926119408438, -0.03676913593496595, -0.3082048710967813, 0.024770989535110338, 0.13752099334129264, 0.0409293506427535, -0.33009661617023606, 0.1633180507059608, 0.14155559486576488, -0.0027690399970327103, -0.14337928353675775, -0.11918879662241255, 0.035737203899770975, 0.013054224835442645, 0.010292804527229497, 0.1110914597154728, -0.015560834096478564, -0.06519185788264233, -0.0030703133238213403, 0.3340304979256221, -0.09878494195872918, -0.27436108376298635, 0.04995089620019176, -0.15244725876088652, -0.1879257452408118, 0.045594640954264576, 0.12350395897270314, 0.21874181127973966, -0.11849141488117831, 0.2505768252270562, -0.07938429742519344, 0.10454511120915413, 0.17190159412899186, -0.06431564358728273, 0.04505395204094904, 0.14556805458185929, 0.1754782796172159, 0.0991037596382999, -0.015184746589511633, -0.052490933911342706, -0.3707739212683269, -0.2240033407296453, -0.15224618619041783, 0.2407737436039107, -0.14456638447674258, -0.15304037497511933, 0.30467614606022836, 0.08285701693966985, 0.10804697136793817, 0.14711247509611505, 0.20147180355020933, 0.1832916178873607, -0.10250680164567062, 0.12094922351783939, 0.16138435791113548, 0.16212865633091755, 0.19176761598459313, -0.21419419549139482, -0.08025391257501074, 0.2189768142199942]
|
1,803.08437
|
The \'etale cohomology ring of the ring of integers of a number field
|
We compute the \'etale cohomology ring $H^*(\text{Spec }
\mathcal{O}_K,\mathbb{Z}/n\mathbb{Z})$ where $\mathcal{O}_K$ is the ring of
integers of a number field $K.$ As an application, we give a non-vanishing
formula for an invariant defined by Minhyong Kim.
|
math.NT math.AG
|
we compute the etale cohomology ring htextspec mathcalo_kmathbbznmathbbz where mathcalo_k is the ring of integers of a number field k as an application we give a nonvanishing formula for an invariant defined by minhyong kim
|
[['we', 'compute', 'the', 'etale', 'cohomology', 'ring', 'htextspec', 'mathcalo_kmathbbznmathbbz', 'where', 'mathcalo_k', 'is', 'the', 'ring', 'of', 'integers', 'of', 'a', 'number', 'field', 'k', 'as', 'an', 'application', 'we', 'give', 'a', 'nonvanishing', 'formula', 'for', 'an', 'invariant', 'defined', 'by', 'minhyong', 'kim']]
|
[-0.328543118793856, 0.05568939022046062, -0.10507628344225162, 0.018826320164159617, -0.08587712714109909, -0.1364374544302171, -0.05656534388209834, 0.2590283875664075, -0.32000368514369865, -0.24097447698427873, 0.04915222477619395, -0.18490554922909447, -0.1216855597202525, 0.20437436731475772, -0.12480978712891087, -0.08284059669258016, -0.08416052750368236, 0.14581139811850857, -0.04097968576983972, -0.31361666485441453, 0.37247716590310587, 0.005318955094976859, 0.14011382114029292, 0.08257144525872939, 0.0958414279545347, 0.03652978414726077, 0.008465488356622782, -0.00812675826477282, -0.2283960912150867, 0.06803726943943536, 0.3310322036656241, 0.04627859389240092, 0.1954749213023619, -0.37013230613912596, -0.058890151269169466, 0.20839201018327114, 0.12217536564408378, 0.018266019947601086, -0.06684771182975083, -0.22871075869735444, 0.16585879758790587, -0.2568002248352224, -0.1871757859110155, -0.09256987488179495, 0.17975403864120104, 0.020792041538339672, -0.3127702567161936, -0.06713295428816116, 0.05965476660904559, 0.2312058677163088, -0.03868840928330566, -0.10453305602299445, 0.016576234025485588, 0.053206702708407785, -0.04256555870542246, 0.08822371610299204, 0.12837155019356447, -0.09285072638004115, -0.15031519554781192, 0.31338456227923883, -0.1828694889378367, -0.1561018552800471, 0.027442177066184355, -0.09912374552169984, -0.10792445938921336, 0.13259200097033472, 0.010697207893386032, 0.2282596785913814, 0.012352228813776464, 0.23534661057320508, -0.20101966570611252, 0.06432769453209458, 0.09572152736963647, -0.015079514490384045, 0.1622067337192482, 0.0035719962959939785, 0.1026408809508818, 0.19414900406969315, -0.01988622376864607, -0.011579319947596752, -0.38455111826911115, -0.24785247456395265, -0.2167102317043552, 0.17853347543683468, -0.07641123276147427, -0.178835659541867, 0.40774444874488946, 0.06459401384221786, 0.2601009513618368, 0.1153963314877315, 0.2530749827397592, 0.12326438744397213, 0.05372166819870472, 0.053909433342403536, 0.03680198481588653, 0.2670643699962194, -0.0367400072740786, -0.1382069428253806, -0.06205685800788077, 0.2222516043393901]
|
1,803.08438
|
Liminal reciprocity and factorization statistics
|
Let $M_{d,n}(q)$ denote the number of monic irreducible polynomials in
$\mathbb{F}_q[x_1, x_2, \ldots , x_n]$ of degree $d$. We show that for a fixed
degree $d$, the sequence $M_{d,n}(q)$ converges $q$-adically to an explicitly
determined rational function $M_{d,\infty}(q)$. Furthermore we show that the
limit $M_{d,\infty}(q)$ is related to the classic necklace polynomial
$M_{d,1}(q)$ by an involutive functional equation, leading to a phenomenon we
call liminal reciprocity. The limiting first moments of factorization
statistics for squarefree polynomials are expressed in terms of a family of
symmetric group representations as a consequence of liminal reciprocity.
|
math.NT math.CO
|
let m_dnq denote the number of monic irreducible polynomials in mathbbf_qx_1 x_2 ldots x_n of degree d we show that for a fixed degree d the sequence m_dnq converges qadically to an explicitly determined rational function m_dinftyq furthermore we show that the limit m_dinftyq is related to the classic necklace polynomial m_d1q by an involutive functional equation leading to a phenomenon we call liminal reciprocity the limiting first moments of factorization statistics for squarefree polynomials are expressed in terms of a family of symmetric group representations as a consequence of liminal reciprocity
|
[['let', 'm_dnq', 'denote', 'the', 'number', 'of', 'monic', 'irreducible', 'polynomials', 'in', 'mathbbf_qx_1', 'x_2', 'ldots', 'x_n', 'of', 'degree', 'd', 'we', 'show', 'that', 'for', 'a', 'fixed', 'degree', 'd', 'the', 'sequence', 'm_dnq', 'converges', 'qadically', 'to', 'an', 'explicitly', 'determined', 'rational', 'function', 'm_dinftyq', 'furthermore', 'we', 'show', 'that', 'the', 'limit', 'm_dinftyq', 'is', 'related', 'to', 'the', 'classic', 'necklace', 'polynomial', 'm_d1q', 'by', 'an', 'involutive', 'functional', 'equation', 'leading', 'to', 'a', 'phenomenon', 'we', 'call', 'liminal', 'reciprocity', 'the', 'limiting', 'first', 'moments', 'of', 'factorization', 'statistics', 'for', 'squarefree', 'polynomials', 'are', 'expressed', 'in', 'terms', 'of', 'a', 'family', 'of', 'symmetric', 'group', 'representations', 'as', 'a', 'consequence', 'of', 'liminal', 'reciprocity']]
|
[-0.2314616161672508, 0.10412201323471142, -0.10811877594712903, 0.0255405080408844, -0.0684111804016592, -0.1064000124221339, -0.0276015093207688, 0.2939452979056274, -0.39826345779001715, -0.16814238552812158, 0.010369759099557996, -0.26225510270279995, -0.19063053711810532, 0.14203111799981663, -0.08516998012166689, -0.025728134869816986, 0.0006380306995090316, 0.12336237092557199, -0.0913303748540142, -0.2767672051511267, 0.344591588494094, -0.046802725222112394, 0.18940333366832313, 0.014806471584255205, 0.15877008072155363, 0.028401492455262033, 0.029155647513620993, -0.04105322270462399, -0.1623731387732893, 0.07939767544842599, 0.2723574576406356, 0.10623455778969561, 0.2601278542157482, -0.34405862657243713, -0.07185005871031214, 0.25195940456846183, 0.23900243148536365, -0.0188080468269832, 0.025546112525112488, -0.22449405720347868, 0.13754107406472457, -0.18877472729757702, -0.22204058174701297, -0.09826185370192808, 0.06668685654945233, 0.08201107273206991, -0.3573562311556409, 0.05209474049727706, 0.10581224026048884, 0.134058016746798, 0.02232883530942833, -0.18952933624386786, -0.031232610687284786, 0.06705339609590523, -0.011132941584048026, 0.044631739722236115, 0.0021674727747107254, -0.11570964720004293, -0.1323729911716381, 0.35424899771357615, -0.07583554246846368, -0.25252256630252196, 0.044684087849386475, -0.18656950870747951, -0.18072214352843516, 0.10265675743713099, 0.12200344849706572, 0.16689484953154426, -0.05040876181686626, 0.1335356427137466, -0.1695420924683704, 0.1210089740672094, 0.12428313841605011, 0.0252006651395384, 0.13971044205348282, 0.024820518975748735, 0.056954711872865174, 0.1793708027285688, 0.029852130466743426, -0.04671975822352311, -0.3491581205936039, -0.149755929684376, -0.23297155801590314, 0.15781986180912047, -0.16471641835866166, -0.15005640475188983, 0.36656218327801016, 0.06824791875174817, 0.18909609195064095, 0.1740498940569951, 0.166010055932052, 0.16398910298149155, 0.00749835768057143, 0.04547758911845877, 0.04716836951453896, 0.22233402537839378, -0.044768768705098945, -0.17576084411429133, 0.07218744646319572, 0.20198811300318031]
|
1,803.08439
|
Anomalous diffusion of dissipative solitons in the cubic-quintic complex
Ginzburg-Landau equation in two spatial dimensions
|
We demonstrate the occurrence of anomalous diffusion of dissipative solitons
in a `simple' and deterministic prototype model: the cubic-quintic complex
Ginzburg-Landau equation in two spatial dimensions. The main features of their
dynamics, induced by symmetric-asymmetric explosions, can be modeled by a
subdiffusive continuous-time random walk, while in the case dominated by only
asymmetric explosions it becomes characterized by normal diffusion.
|
nlin.PS
|
we demonstrate the occurrence of anomalous diffusion of dissipative solitons in a simple and deterministic prototype model the cubicquintic complex ginzburglandau equation in two spatial dimensions the main features of their dynamics induced by symmetricasymmetric explosions can be modeled by a subdiffusive continuoustime random walk while in the case dominated by only asymmetric explosions it becomes characterized by normal diffusion
|
[['we', 'demonstrate', 'the', 'occurrence', 'of', 'anomalous', 'diffusion', 'of', 'dissipative', 'solitons', 'in', 'a', 'simple', 'and', 'deterministic', 'prototype', 'model', 'the', 'cubicquintic', 'complex', 'ginzburglandau', 'equation', 'in', 'two', 'spatial', 'dimensions', 'the', 'main', 'features', 'of', 'their', 'dynamics', 'induced', 'by', 'symmetricasymmetric', 'explosions', 'can', 'be', 'modeled', 'by', 'a', 'subdiffusive', 'continuoustime', 'random', 'walk', 'while', 'in', 'the', 'case', 'dominated', 'by', 'only', 'asymmetric', 'explosions', 'it', 'becomes', 'characterized', 'by', 'normal', 'diffusion']]
|
[-0.1500242934251825, 0.21259933438462517, -0.03027205066755414, 0.0998564673277239, -0.038101219321833926, -0.19304295196197926, -0.0055780314723961055, 0.3687914449721575, -0.2913651991946002, -0.23012741940716902, 0.07484362472508413, -0.24901350255434712, -0.22112127657358846, 0.18082309987706444, 0.011863859137520194, 0.005421270838511797, 0.004807117690021793, -0.01927953215005497, 0.022841008589603008, -0.2071589572665592, 0.31292796484194696, -0.019841646767842273, 0.23072208534770955, -0.03465278756339103, 0.11637748680077493, -0.04204253420078506, -0.00990432764713963, 0.03838647462350006, -0.10872617882365981, 0.024642482042933504, 0.16361658248739938, -0.027409284354265158, 0.23984910090609143, -0.44510000304629405, -0.33876268768993517, 0.09846157265516618, 0.2042152265862872, 0.10926974080114936, -0.03129953113384545, -0.37234890209122873, 0.00691128756540517, -0.1368411612076064, -0.18507447879722652, -0.0372324092934529, 0.021060459145034353, 0.08644727148639504, -0.24085255649406462, 0.18178867682969818, 0.1301358288154006, 0.02334622822624321, -0.03879502833199998, -0.008632408982763688, -0.05725595283632477, 0.022660582590227327, -0.007352482141383613, -0.07544897181602815, 0.10096010230627143, -0.15995552347352107, -0.13089186723033588, 0.39495705893884103, -0.1200704972880582, -0.21052860929630696, 0.1785596727199542, -0.17320409601864714, -0.05474264656174152, 0.19597036738414317, 0.1697719049329559, 0.12702955695179602, -0.1975385574779163, 0.0695099747730031, 0.010577330163990458, 0.08707559552664558, 0.03921712632291019, -0.033863536765178046, 0.16047593681917835, 0.260042915524294, 0.01073923345344762, 0.13539047993835993, -0.04848766444871823, -0.19430904450515907, -0.26114346742009126, -0.09642498839724188, -0.22877946795585255, 0.12041544498254855, -0.1486041364800864, -0.1430656725851198, 0.3865915815656384, 0.09878173541122427, 0.19220138379993537, -0.004255805257707834, 0.2597996172339966, 0.1694728365788857, -0.002940749132540077, 0.09578790195907155, 0.18438655127150316, 0.1425541504131009, 0.12435710591962561, -0.25961293388778967, 0.11190970664999138, 0.09218949149362743]
|
1,803.0844
|
Complex dynamics and development of behavioural individuality
|
Behavioural differences may arise in the absence of genetic or environmental
variation. Chaotic dynamics may influence behavioural development, and so this
among-individual variation. We discuss methods and experimental designs to test
this idea. Ultimately, nonlinear and chaotic behavioural development may
explain much of natural variation.
|
q-bio.PE
|
behavioural differences may arise in the absence of genetic or environmental variation chaotic dynamics may influence behavioural development and so this amongindividual variation we discuss methods and experimental designs to test this idea ultimately nonlinear and chaotic behavioural development may explain much of natural variation
|
[['behavioural', 'differences', 'may', 'arise', 'in', 'the', 'absence', 'of', 'genetic', 'or', 'environmental', 'variation', 'chaotic', 'dynamics', 'may', 'influence', 'behavioural', 'development', 'and', 'so', 'this', 'amongindividual', 'variation', 'we', 'discuss', 'methods', 'and', 'experimental', 'designs', 'to', 'test', 'this', 'idea', 'ultimately', 'nonlinear', 'and', 'chaotic', 'behavioural', 'development', 'may', 'explain', 'much', 'of', 'natural', 'variation']]
|
[-0.13282516464294697, 0.15827826090919023, -0.09357844847677783, 0.1858269408429888, -0.1431249546056444, -0.10278002664629392, 0.00678268795705993, 0.3698988545008681, -0.34041367064822803, -0.3335052704946561, 0.10887344439503398, -0.18313305369916966, -0.3001171206335791, 0.18235537396553395, -0.1845899340696633, 0.03510343575511466, 0.05895458713216199, -0.05945965850895101, -0.019640915402719242, -0.19882536736655643, 0.24732529113746501, 0.04462806427512656, 0.29687554738484323, 0.021672984997911208, 0.0186843225621322, -0.06154900242108852, -0.07387849415483122, 0.03391635684635152, -0.08802523866126483, 0.1473339470103383, 0.2737133845750412, 0.21176254827613858, 0.35646802779625764, -0.48258715063672175, -0.25146505841985345, 0.15741822377524592, 0.12396253300407394, 0.13934913771861995, -0.032412597496824506, -0.27959801828150044, -0.00047954533841799605, -0.13670501904826696, -0.14425934186543932, -0.120816112929209, 0.027805761497637086, 0.023026318247006697, -0.23563211224973202, 0.03461162060160528, 0.08606261701788753, 0.1523004935800352, -0.04178122752769427, -0.07415579327128151, -0.007041650009341538, 0.12340352841420099, 0.12564016730439934, -0.0630401087268679, 0.24049251168881627, -0.07948371284344996, -0.16197405573488635, 0.3455777288499204, -0.03936369230293415, -0.1812335793775591, 0.30629135053922335, -0.1555355758914216, -0.17451799419623884, 0.045998027378862556, 0.21373655658680946, -0.011302853781010279, -0.14390197223772042, -0.011363610470487567, 0.0695061009821736, 0.20328706621446394, 0.06726793030446226, 0.07753102733245627, 0.21221625953066078, 0.18371886810795826, 0.04082575018136678, 0.11182635551614856, -0.05108086108653383, -0.18352523486299271, -0.2600930259478363, -0.10165311315689575, -0.019153278236362068, 0.06407584321409972, -0.0583816620680657, -0.18591824935918505, 0.4109968289055608, 0.21636613788326609, 0.1647589835867455, 0.0064339178762483325, 0.238612922469408, 0.059325537623160264, 0.06473637270656499, -0.05651975652753291, 0.2271864125928418, 0.05232728137211366, 0.12683924603995614, -0.31809978872876277, 0.20741736387241294, -0.021818453424864194]
|
1,803.08441
|
Active colloidal chains with cilia- and flagella-like motion
|
It has been shown that self-assembled chains of active colloidal particles
can present sustained oscillations. These oscillations are possible because of
the effective diffusiophoretic forces that mediate the interactions of colloids
do not respect the action--reaction principle and hence, a Hopf bifurcation is
possible even for overdamped dynamics. Anchoring the particles in one extreme
breaks the head-tail symmetry and the oscillation is transformed into a
traveling wave pattern and thus the chain behaves like a beating cilium. The
net force on the anchor, estimated using the resistive force theory, vanishes
before the bifurcation and thereafter grows linearly with the bifurcation
parameter. If the mobilities of the particles on one extreme are reduced to
mimic an elongated cargo, the traveling wave generates a net velocity on the
chain that now behaves like a moving flagellum. The average velocity again
grows linearly with the bifurcation parameter. Our results demonstrate that
simplified systems, consisting only of a few particles with non-reciprocal
interaction and head-tail asymmetry show beating motion and self-propulsion.
Both properties are present in many non-equilibrium models thus making our
results a general feature of active matter.
|
cond-mat.soft nlin.AO
|
it has been shown that selfassembled chains of active colloidal particles can present sustained oscillations these oscillations are possible because of the effective diffusiophoretic forces that mediate the interactions of colloids do not respect the actionreaction principle and hence a hopf bifurcation is possible even for overdamped dynamics anchoring the particles in one extreme breaks the headtail symmetry and the oscillation is transformed into a traveling wave pattern and thus the chain behaves like a beating cilium the net force on the anchor estimated using the resistive force theory vanishes before the bifurcation and thereafter grows linearly with the bifurcation parameter if the mobilities of the particles on one extreme are reduced to mimic an elongated cargo the traveling wave generates a net velocity on the chain that now behaves like a moving flagellum the average velocity again grows linearly with the bifurcation parameter our results demonstrate that simplified systems consisting only of a few particles with nonreciprocal interaction and headtail asymmetry show beating motion and selfpropulsion both properties are present in many nonequilibrium models thus making our results a general feature of active matter
|
[['it', 'has', 'been', 'shown', 'that', 'selfassembled', 'chains', 'of', 'active', 'colloidal', 'particles', 'can', 'present', 'sustained', 'oscillations', 'these', 'oscillations', 'are', 'possible', 'because', 'of', 'the', 'effective', 'diffusiophoretic', 'forces', 'that', 'mediate', 'the', 'interactions', 'of', 'colloids', 'do', 'not', 'respect', 'the', 'actionreaction', 'principle', 'and', 'hence', 'a', 'hopf', 'bifurcation', 'is', 'possible', 'even', 'for', 'overdamped', 'dynamics', 'anchoring', 'the', 'particles', 'in', 'one', 'extreme', 'breaks', 'the', 'headtail', 'symmetry', 'and', 'the', 'oscillation', 'is', 'transformed', 'into', 'a', 'traveling', 'wave', 'pattern', 'and', 'thus', 'the', 'chain', 'behaves', 'like', 'a', 'beating', 'cilium', 'the', 'net', 'force', 'on', 'the', 'anchor', 'estimated', 'using', 'the', 'resistive', 'force', 'theory', 'vanishes', 'before', 'the', 'bifurcation', 'and', 'thereafter', 'grows', 'linearly', 'with', 'the', 'bifurcation', 'parameter', 'if', 'the', 'mobilities', 'of', 'the', 'particles', 'on', 'one', 'extreme', 'are', 'reduced', 'to', 'mimic', 'an', 'elongated', 'cargo', 'the', 'traveling', 'wave', 'generates', 'a', 'net', 'velocity', 'on', 'the', 'chain', 'that', 'now', 'behaves', 'like', 'a', 'moving', 'flagellum', 'the', 'average', 'velocity', 'again', 'grows', 'linearly', 'with', 'the', 'bifurcation', 'parameter', 'our', 'results', 'demonstrate', 'that', 'simplified', 'systems', 'consisting', 'only', 'of', 'a', 'few', 'particles', 'with', 'nonreciprocal', 'interaction', 'and', 'headtail', 'asymmetry', 'show', 'beating', 'motion', 'and', 'selfpropulsion', 'both', 'properties', 'are', 'present', 'in', 'many', 'nonequilibrium', 'models', 'thus', 'making', 'our', 'results', 'a', 'general', 'feature', 'of', 'active', 'matter']]
|
[-0.18887924289368596, 0.25134069129417186, -0.10196243160234361, 0.04821741632689294, -0.07843431471469435, -0.1588198736385518, 0.0066950918677124525, 0.3489625329101408, -0.2900908210390323, -0.26236656993734525, 0.06427293640838282, -0.29731066049756233, -0.16495264583091077, 0.17286292142423523, 0.023106049823046135, 0.012161619158310665, 0.044340411956245836, 0.06068408318568726, 0.01518365360947477, -0.14986093029933603, 0.23468783370697419, 0.03236927293568245, 0.3006999289918993, 0.008985846524907125, 0.1437095145260714, -0.004771609440747951, 0.055522812459919905, 0.05512400104890804, -0.12215603288684694, 0.03305002270216072, 0.15492049281706016, 0.009787338706538886, 0.2316099582542036, -0.45864070233058285, -0.22535807415339593, 0.09204592324189238, 0.2229341962437674, 0.1551056324227436, -0.0721722036530893, -0.27868783685403903, 0.0076444432491789, -0.15131110999358793, -0.17539482064595496, -0.07232921045474909, 0.04195052263503139, 0.08997729810055446, -0.2327812384864366, 0.11528184309246245, 0.07927337964442936, 0.029879171671849246, -0.05944499075790313, -0.040716143958648116, -0.07637649600872316, 0.08976030999643578, 0.08983258015753047, 0.00981183445326531, 0.2265542674010519, -0.14007710622925612, -0.08398868264756292, 0.4004498450739964, -0.042969706876052394, -0.20661397319085695, 0.2341722122878088, -0.13932090354642857, -0.07678179742164305, 0.16880098432931748, 0.14647586415458874, 0.08682923308649176, -0.1011476876566539, 0.021457256340874812, -0.052205249948924205, 0.17346741669635113, 0.08813221854459796, -0.030119690435900782, 0.23856876284337125, 0.1852506897714291, 0.09289202677633462, 0.13020807092606618, -0.10869469807382573, -0.13469509606916658, -0.2662552459769555, -0.11808838080111388, -0.15411409207972118, 0.017089179107161064, -0.09026446309195504, -0.17703849716863998, 0.3783677996161419, 0.11566277672380336, 0.19604796901395594, 0.04678143900063996, 0.28539461630421714, 0.07511578462640377, 0.08046425283206879, 0.048375112462688136, 0.3170246220042778, 0.11467950580503188, 0.09771263411369276, -0.2558470097269762, 0.05953529054752073, 0.02562544747913332]
|
1,803.08442
|
Geometrical scaling description for the exclusive production of vector
mesons and deeply virtual Compton scattering
|
In this work, we investigate the exclusive production of particles in
scattering processes in the so-called saturation region. Within this scheme the
phenomenon of geometric scaling takes place: cross sections are functions only
of a dimensionless combination of the relevant kinematic variables, which
happens both in inclusive and diffractive cases, as in the production of vector
mesons. In particular, the scaling variable is given in general by $\tau =
Q^2/Q_s^2$, where $Q^2$ is the photon virtuality and $Q_s$ represents the
saturation scale, which drives the energy dependence and the corresponding
nuclear effects. Based on the scaling property, we are able to derive a
universal expression for the cross sections for the exclusive vector meson
production and deeply virtual Compton scattering (DVCS) in both photon-proton
and photon-nucleus interactions. This phenomenological result describes all
available data from DESY-HERA for $\rho$, $\phi$ and $J/\psi$ production and
DVCS measurements. A discussion is also carried out on the size of nuclear
shadowing corrections on photon-nucleus interaction.
|
hep-ph
|
in this work we investigate the exclusive production of particles in scattering processes in the socalled saturation region within this scheme the phenomenon of geometric scaling takes place cross sections are functions only of a dimensionless combination of the relevant kinematic variables which happens both in inclusive and diffractive cases as in the production of vector mesons in particular the scaling variable is given in general by tau q2q_s2 where q2 is the photon virtuality and q_s represents the saturation scale which drives the energy dependence and the corresponding nuclear effects based on the scaling property we are able to derive a universal expression for the cross sections for the exclusive vector meson production and deeply virtual compton scattering dvcs in both photonproton and photonnucleus interactions this phenomenological result describes all available data from desyhera for rho phi and jpsi production and dvcs measurements a discussion is also carried out on the size of nuclear shadowing corrections on photonnucleus interaction
|
[['in', 'this', 'work', 'we', 'investigate', 'the', 'exclusive', 'production', 'of', 'particles', 'in', 'scattering', 'processes', 'in', 'the', 'socalled', 'saturation', 'region', 'within', 'this', 'scheme', 'the', 'phenomenon', 'of', 'geometric', 'scaling', 'takes', 'place', 'cross', 'sections', 'are', 'functions', 'only', 'of', 'a', 'dimensionless', 'combination', 'of', 'the', 'relevant', 'kinematic', 'variables', 'which', 'happens', 'both', 'in', 'inclusive', 'and', 'diffractive', 'cases', 'as', 'in', 'the', 'production', 'of', 'vector', 'mesons', 'in', 'particular', 'the', 'scaling', 'variable', 'is', 'given', 'in', 'general', 'by', 'tau', 'q2q_s2', 'where', 'q2', 'is', 'the', 'photon', 'virtuality', 'and', 'q_s', 'represents', 'the', 'saturation', 'scale', 'which', 'drives', 'the', 'energy', 'dependence', 'and', 'the', 'corresponding', 'nuclear', 'effects', 'based', 'on', 'the', 'scaling', 'property', 'we', 'are', 'able', 'to', 'derive', 'a', 'universal', 'expression', 'for', 'the', 'cross', 'sections', 'for', 'the', 'exclusive', 'vector', 'meson', 'production', 'and', 'deeply', 'virtual', 'compton', 'scattering', 'dvcs', 'in', 'both', 'photonproton', 'and', 'photonnucleus', 'interactions', 'this', 'phenomenological', 'result', 'describes', 'all', 'available', 'data', 'from', 'desyhera', 'for', 'rho', 'phi', 'and', 'jpsi', 'production', 'and', 'dvcs', 'measurements', 'a', 'discussion', 'is', 'also', 'carried', 'out', 'on', 'the', 'size', 'of', 'nuclear', 'shadowing', 'corrections', 'on', 'photonnucleus', 'interaction']]
|
[-0.08586894938723717, 0.19872732927551223, -0.13092958583802558, 0.13880694208303526, -0.028539083707702795, -0.07182001376835008, 0.04478142549995474, 0.31384713743936343, -0.22548213808902734, -0.1965430586162439, -0.02049274731767159, -0.32214939947175625, -0.03762013686721289, 0.17437828610557476, 0.06477698739365463, 0.087225602927278, 0.019250440000521264, 0.04746838550686649, -0.0010265967099921509, -0.17021566838518065, 0.3836096532938639, 0.0420630270457437, 0.24877895641802522, 0.17919496909946603, 0.09159737826052632, 0.12501369355357714, -0.05946919427007296, -0.03375386150103583, -0.13120068626115158, 0.06478841271714172, 0.24830234380923621, 0.0718548505203857, 0.1325377267141059, -0.3704460465697771, -0.11638774485664102, 0.09121841670500126, 0.15555969631568817, 0.058603558541457136, -0.017512454170259244, -0.22870890987574258, 0.02927489719008031, -0.19774473383554123, -0.09500983906485164, -0.07839791572787477, 0.0650968645617319, -0.0014490943355192929, -0.32933046209549754, 0.08291541427537161, -0.018545275407626568, 0.019826715144346346, -0.06513743632057178, -0.15531500524024144, -0.0005523039016333765, 0.06475358336882771, 0.08192982158108186, 0.07175619657731282, 0.1945050047979977, -0.19698395603629262, -0.11783661228917984, 0.38615480808646613, -0.015320887931171546, -0.20436089081752315, 0.11840528134643188, -0.23990585453480295, -0.15294359952691686, 0.14195480580154643, 0.2539475771419868, 0.10014454057694958, -0.18315019667933477, 0.13399327765314095, -0.01558316888217375, 0.16079905657566287, 0.06076891907877376, 0.07433674998366151, 0.11212278198767102, 0.21940124451487367, -0.06909983745906444, 0.0888467287738462, -0.13007561418040414, -0.12652245138437962, -0.41849680656696076, -0.1222482206440478, -0.0801180923165777, 0.06678247811717901, -0.08275825135439485, -0.08274729412236491, 0.30758815462127276, 0.07104677873681542, 0.293000499827717, 0.02198724735252934, 0.33733859016273005, 0.14087642398780012, 0.09010867932635658, 0.07017306044240887, 0.3004146683961153, 0.1721351298704193, 0.13187510807963335, -0.23033314174679606, 0.0780639889995632, 0.02956992501697544]
|
1,803.08443
|
Preparations and Weak Quantum Control can Witness non-Markovianity
|
The dynamics of a system that is initially correlated with an environment is
almost always non-Markovian. Hence it is important to characterise such initial
correlations experimentally and witness them in physically realistic settings.
One such setting is weak-field phase control, where chemical reactions are
sought to be controlled by the phase of shaped weak laser pulses. In this
manuscript, we show how weak quantum controllability can be combined with
quantum preparations to witness initial correlations between the system and the
environment. Furthermore we show how weak field phase control can be applied to
witness when the quantum regression formula does not apply.
|
quant-ph
|
the dynamics of a system that is initially correlated with an environment is almost always nonmarkovian hence it is important to characterise such initial correlations experimentally and witness them in physically realistic settings one such setting is weakfield phase control where chemical reactions are sought to be controlled by the phase of shaped weak laser pulses in this manuscript we show how weak quantum controllability can be combined with quantum preparations to witness initial correlations between the system and the environment furthermore we show how weak field phase control can be applied to witness when the quantum regression formula does not apply
|
[['the', 'dynamics', 'of', 'a', 'system', 'that', 'is', 'initially', 'correlated', 'with', 'an', 'environment', 'is', 'almost', 'always', 'nonmarkovian', 'hence', 'it', 'is', 'important', 'to', 'characterise', 'such', 'initial', 'correlations', 'experimentally', 'and', 'witness', 'them', 'in', 'physically', 'realistic', 'settings', 'one', 'such', 'setting', 'is', 'weakfield', 'phase', 'control', 'where', 'chemical', 'reactions', 'are', 'sought', 'to', 'be', 'controlled', 'by', 'the', 'phase', 'of', 'shaped', 'weak', 'laser', 'pulses', 'in', 'this', 'manuscript', 'we', 'show', 'how', 'weak', 'quantum', 'controllability', 'can', 'be', 'combined', 'with', 'quantum', 'preparations', 'to', 'witness', 'initial', 'correlations', 'between', 'the', 'system', 'and', 'the', 'environment', 'furthermore', 'we', 'show', 'how', 'weak', 'field', 'phase', 'control', 'can', 'be', 'applied', 'to', 'witness', 'when', 'the', 'quantum', 'regression', 'formula', 'does', 'not', 'apply']]
|
[-0.1289643749010329, 0.18809322576057372, -0.1208795024191632, 0.09326891998838012, -0.00803242533869457, -0.19675301761804698, -0.002158179121347619, 0.4270450261366718, -0.30719807045534253, -0.2731678182870953, 0.07721349180392995, -0.22147964476151208, -0.1531607038706687, 0.21230978505941583, -0.059999378000879115, 0.05969666244516916, 0.0616694758166833, 0.00952018890187473, -0.036012703468383964, -0.24806039870771415, 0.3225167316895928, 0.035396367887847634, 0.2469141735494429, 0.03842394451117691, 0.06349461634789466, -0.0014278015861397281, 0.08501307093812262, 0.05728521379048699, -0.08604629682275688, 0.012761623598635197, 0.2741577208005622, 0.11322260998627719, 0.2607289009599709, -0.4345998534266198, -0.2002095163927651, 0.13715926036421283, 0.12143784106307316, 0.19346798464254128, -0.033515721535556674, -0.3226538536814498, 0.04375778213052042, -0.15011578323502167, -0.13063824241615685, -0.13132525628030883, 0.023185862170066684, 0.02302721779172619, -0.2948874888402939, 0.060156704205106576, 0.05801742802392326, 0.013281391769209328, -0.034775535434521006, 0.03318251443195942, 0.00632112063056625, 0.1486067166634694, -0.05096221175592612, 0.03847476284421396, 0.1607398092895107, -0.11336926906597893, -0.09191950871243927, 0.34630692620332554, -0.055683687931912786, -0.21470216544819812, 0.22055021098668814, -0.18255085739599286, -0.0865859448605596, 0.079813296860997, 0.1498713651124169, 0.09632803171453085, -0.18798119820698334, 0.051186199901470296, -0.014297661554141371, 0.22403912836977957, 0.009603016842447687, 0.06652529938055166, 0.1842361866386936, 0.11975305949967793, 0.10822025751329813, 0.1812835991823151, -0.024158801319929042, -0.13461105962850006, -0.2977798761498621, -0.14468147430349798, -0.18394220554653337, 0.08395947619382972, -0.03598017373787668, -0.13803294327055268, 0.3542111499015899, 0.20679728864856503, 0.16138825499836137, -0.038471820325974154, 0.2822742708319542, 0.14528533363002627, 0.015983097300883018, 0.03106812426053426, 0.27350449661596443, 0.13782348625553661, 0.07940998863355786, -0.24527703494509207, 0.12409335161175798, -0.013904656931830971]
|
1,803.08444
|
A Quantile-Based Approach to Modelling Recovery Time in Structural
Health Monitoring
|
Statistical techniques play a large role in the structural health monitoring
of instrumented infrastructure, such as a railway bridge constructed with an
integrated network of fibre optic sensors. One possible way to reason about the
structural health of such a railway bridge, is to model the time it takes to
recover to a no-load (baseline) state after a train passes over. Inherently,
this recovery time is random and should be modelled statistically. This paper
uses a non-parametric model, based on empirical quantile approximations, to
construct a space-memory efficient baseline distribution for the streaming data
from these sensors. A fast statistical test is implemented to detect deviations
away from, and recovery back to, this distribution when trains pass over the
bridge, yielding a recovery time. Our method assumes that there are no temporal
variations in the data. A median-based detrending scheme is used to remove the
temporal variations likely due to temperature changes. This allows for the
continuous recording of sensor data with a space-memory constraint.
|
stat.AP
|
statistical techniques play a large role in the structural health monitoring of instrumented infrastructure such as a railway bridge constructed with an integrated network of fibre optic sensors one possible way to reason about the structural health of such a railway bridge is to model the time it takes to recover to a noload baseline state after a train passes over inherently this recovery time is random and should be modelled statistically this paper uses a nonparametric model based on empirical quantile approximations to construct a spacememory efficient baseline distribution for the streaming data from these sensors a fast statistical test is implemented to detect deviations away from and recovery back to this distribution when trains pass over the bridge yielding a recovery time our method assumes that there are no temporal variations in the data a medianbased detrending scheme is used to remove the temporal variations likely due to temperature changes this allows for the continuous recording of sensor data with a spacememory constraint
|
[['statistical', 'techniques', 'play', 'a', 'large', 'role', 'in', 'the', 'structural', 'health', 'monitoring', 'of', 'instrumented', 'infrastructure', 'such', 'as', 'a', 'railway', 'bridge', 'constructed', 'with', 'an', 'integrated', 'network', 'of', 'fibre', 'optic', 'sensors', 'one', 'possible', 'way', 'to', 'reason', 'about', 'the', 'structural', 'health', 'of', 'such', 'a', 'railway', 'bridge', 'is', 'to', 'model', 'the', 'time', 'it', 'takes', 'to', 'recover', 'to', 'a', 'noload', 'baseline', 'state', 'after', 'a', 'train', 'passes', 'over', 'inherently', 'this', 'recovery', 'time', 'is', 'random', 'and', 'should', 'be', 'modelled', 'statistically', 'this', 'paper', 'uses', 'a', 'nonparametric', 'model', 'based', 'on', 'empirical', 'quantile', 'approximations', 'to', 'construct', 'a', 'spacememory', 'efficient', 'baseline', 'distribution', 'for', 'the', 'streaming', 'data', 'from', 'these', 'sensors', 'a', 'fast', 'statistical', 'test', 'is', 'implemented', 'to', 'detect', 'deviations', 'away', 'from', 'and', 'recovery', 'back', 'to', 'this', 'distribution', 'when', 'trains', 'pass', 'over', 'the', 'bridge', 'yielding', 'a', 'recovery', 'time', 'our', 'method', 'assumes', 'that', 'there', 'are', 'no', 'temporal', 'variations', 'in', 'the', 'data', 'a', 'medianbased', 'detrending', 'scheme', 'is', 'used', 'to', 'remove', 'the', 'temporal', 'variations', 'likely', 'due', 'to', 'temperature', 'changes', 'this', 'allows', 'for', 'the', 'continuous', 'recording', 'of', 'sensor', 'data', 'with', 'a', 'spacememory', 'constraint']]
|
[-0.08063814481314639, 0.04789332669364133, -0.14441230625027057, 0.06128417527176101, -0.08234297457348669, -0.14624737931246107, 0.06753203628909295, 0.4163744227678487, -0.30260502746836704, -0.30886121565532504, 0.1365272627508437, -0.26539912499411555, -0.11562534494635959, 0.19603924306222434, -0.11433498819894863, 0.0718323495351907, 0.083801984246538, 0.03249146474356001, -0.04642034714713439, -0.19852782960303805, 0.2104960929489497, 0.07184009983373636, 0.30362659963976707, -0.021897812551734123, 0.1376014810274214, 0.020144997020675376, -0.065878615162166, -0.004857591300440783, -0.04940728989705817, 0.11199780349363044, 0.3050312745797617, 0.14979627305980434, 0.3152448491616683, -0.4389870609975222, -0.24678090311248194, 0.12221648707795381, 0.0858389371438093, 0.09449030811136419, -0.02302794311491942, -0.2781863712451675, 0.07951819142044493, -0.14526822131804445, -0.11701881374147806, -0.07287871075624769, 0.014970192739344907, 0.0010390764328114914, -0.3136625400271662, 0.04784184381168223, 0.032918279165063395, 0.054132848423482344, -0.021523437697341607, -0.03896067682653666, 0.01770679571270717, 0.1547679907157241, 0.04990251747129316, 0.05466877958864312, 0.14278538749750816, -0.08446815636725108, -0.07918666820182944, 0.3647765052857611, -0.06485276901530046, -0.16385260911616073, 0.17626080964409718, -0.054447644093835894, -0.12479114611774231, 0.1339755726978183, 0.23620329394259237, 0.058558731258028386, -0.18159084041139012, -0.009787674807717629, -0.007020151767541062, 0.2272873295725069, 0.0534842988532601, -0.006226005438701108, 0.18382864990130518, 0.21987051019360396, 0.09970253866843203, 0.123970167165989, -0.16710916695636557, -0.08550613089640992, -0.27116372951616846, -0.11661180417815392, -0.17921657272699204, 0.038805082189377796, -0.08427988287382476, -0.1894536236977067, 0.40122728507168093, 0.20239174599392395, 0.20662566181272268, 0.0792651569661261, 0.3420886958624716, 0.06976141175925449, 0.11035892946194067, 0.08292432091142418, 0.18977356887859942, 0.08238838955259063, 0.1371940606457153, -0.15558685084882504, 0.12290059219707142, -0.013269484551115469]
|
1,803.08445
|
Finite correlation length scaling with infinite projected entangled-pair
states
|
We show how to accurately study 2D quantum critical phenomena using infinite
projected entangled-pair states (iPEPS). We identify the presence of a finite
correlation length in the optimal iPEPS approximation to Lorentz-invariant
critical states which we use to perform a finite correlation-length scaling
(FCLS) analysis to determine critical exponents. This is analogous to the
one-dimensional (1D) finite entanglement scaling with infinite matrix product
states. We provide arguments why this approach is also valid in 2D by
identifying a class of states that despite obeying the area law of entanglement
seems hard to describe with iPEPS. We apply these ideas to interacting spinless
fermions on a honeycomb lattice and obtain critical exponents which are in
agreement with Quantum Monte Carlo results. Furthermore, we introduce a new
scheme to locate the critical point without the need of computing higher order
moments of the order parameter. Finally, we also show how to obtain an improved
estimate of the order parameter in gapless systems, with the 2D Heisenberg
model as an example.
|
cond-mat.str-el cond-mat.stat-mech
|
we show how to accurately study 2d quantum critical phenomena using infinite projected entangledpair states ipeps we identify the presence of a finite correlation length in the optimal ipeps approximation to lorentzinvariant critical states which we use to perform a finite correlationlength scaling fcls analysis to determine critical exponents this is analogous to the onedimensional 1d finite entanglement scaling with infinite matrix product states we provide arguments why this approach is also valid in 2d by identifying a class of states that despite obeying the area law of entanglement seems hard to describe with ipeps we apply these ideas to interacting spinless fermions on a honeycomb lattice and obtain critical exponents which are in agreement with quantum monte carlo results furthermore we introduce a new scheme to locate the critical point without the need of computing higher order moments of the order parameter finally we also show how to obtain an improved estimate of the order parameter in gapless systems with the 2d heisenberg model as an example
|
[['we', 'show', 'how', 'to', 'accurately', 'study', '2d', 'quantum', 'critical', 'phenomena', 'using', 'infinite', 'projected', 'entangledpair', 'states', 'ipeps', 'we', 'identify', 'the', 'presence', 'of', 'a', 'finite', 'correlation', 'length', 'in', 'the', 'optimal', 'ipeps', 'approximation', 'to', 'lorentzinvariant', 'critical', 'states', 'which', 'we', 'use', 'to', 'perform', 'a', 'finite', 'correlationlength', 'scaling', 'fcls', 'analysis', 'to', 'determine', 'critical', 'exponents', 'this', 'is', 'analogous', 'to', 'the', 'onedimensional', '1d', 'finite', 'entanglement', 'scaling', 'with', 'infinite', 'matrix', 'product', 'states', 'we', 'provide', 'arguments', 'why', 'this', 'approach', 'is', 'also', 'valid', 'in', '2d', 'by', 'identifying', 'a', 'class', 'of', 'states', 'that', 'despite', 'obeying', 'the', 'area', 'law', 'of', 'entanglement', 'seems', 'hard', 'to', 'describe', 'with', 'ipeps', 'we', 'apply', 'these', 'ideas', 'to', 'interacting', 'spinless', 'fermions', 'on', 'a', 'honeycomb', 'lattice', 'and', 'obtain', 'critical', 'exponents', 'which', 'are', 'in', 'agreement', 'with', 'quantum', 'monte', 'carlo', 'results', 'furthermore', 'we', 'introduce', 'a', 'new', 'scheme', 'to', 'locate', 'the', 'critical', 'point', 'without', 'the', 'need', 'of', 'computing', 'higher', 'order', 'moments', 'of', 'the', 'order', 'parameter', 'finally', 'we', 'also', 'show', 'how', 'to', 'obtain', 'an', 'improved', 'estimate', 'of', 'the', 'order', 'parameter', 'in', 'gapless', 'systems', 'with', 'the', '2d', 'heisenberg', 'model', 'as', 'an', 'example']]
|
[-0.10922990685018401, 0.1705685356090336, -0.10762487345519253, 0.08557617901325491, -0.026789047572362636, -0.1638339686989119, 0.08155728627545093, 0.34597242123120286, -0.22471021609713457, -0.25506560068987755, 0.07385809927724213, -0.2965597481677486, -0.1599052052309465, 0.16269210338526005, 0.021366623234436184, 0.11008635091240562, 0.005935945938940027, 0.033320071900691674, -0.13590760814397418, -0.24009049449315562, 0.32174510930642664, 0.020866618473692575, 0.2896113258376274, 0.06835578589483962, 0.0594837143407425, 0.020305165560871717, 0.06230894300443608, 0.03349690015671686, -0.2084226129797701, 0.11394428037220634, 0.26243309743447407, 0.00930045156218555, 0.21791604406289047, -0.3887620875833645, -0.1993902837026066, 0.10905743925832212, 0.18149996403926275, 0.16305803142382674, -0.014626278667405825, -0.275681015015358, 0.08595104573483002, -0.20428548798441798, -0.21638227605754287, -0.16099480969326882, -0.02030712345350323, -0.02036157694029888, -0.2581361268613754, 0.09906606929386423, 0.033389547380336025, 0.043153566834960314, -0.036949088473712824, -0.05496621204656549, 0.024382388513047425, 0.13468700916772441, -0.00820015216318314, 0.020171291393039394, 0.07294096273281389, -0.10095992999413284, -0.16748333015233843, 0.37003829744866207, -0.047631839080644396, -0.2278145182367769, 0.19426635419603416, -0.14068864537971204, -0.1452609150077305, 0.07662081099572658, 0.15750411820564686, 0.07919615233917977, -0.10385007537080951, 0.0730027902834644, -0.059389735389101715, 0.19002970076828551, -0.031990484158519565, 0.02750509875576903, 0.17660453064239673, 0.11543453473132104, 0.09027134058054626, 0.2136206949029916, -0.08528020530190718, -0.1715245596798403, -0.2995744900267926, -0.18330692140616953, -0.227221275520389, 0.07234824262282234, -0.1110156298187316, -0.21253331924699956, 0.3717288458602698, 0.22615499367072647, 0.2052908096395965, 0.07635561063458833, 0.22151666177697257, 0.15816386973615626, 0.033560873028667025, 0.08395252488636677, 0.19420485436179055, 0.13263260844715183, 0.03974511354629483, -0.24305175295254836, -0.021435837871173306, 0.13753343091507086]
|
1,803.08446
|
Opening PANDORA's box: APEX observations of CO in PNe
|
Context. Observations of molecular gas have played a key role in developing
the current understanding of the late stages of stellar evolution. Aims. The
survey Planetary nebulae AND their cO Reservoir with APEX (PANDORA) was
designed to study the circumstellar shells of evolved stars with the aim to
estimate their physical parameters. Methods. Millimetre carbon monoxide (CO)
emission is the most useful probe of the warm molecular component ejected by
low- to intermediate-mass stars. CO is the second-most abundant molecule in the
Universe, and the millimeter transitions are easily excited, thus making it
particularly useful to study the mass, structure, and kinematics of the
molecular gas. We present a large survey of the CO (J = 3 - 2) line using the
Atacama Pathfinder EXperiment (APEX) telescope in a sample of 93
proto-planetary nebulae and planetary nebulae. Results. CO (J = 3 - 2) was
detected in 21 of the 93 objects. Conclusions. CO (J = 3 - 2) was detected in
all 4 observed pPNe (100%), 15 of the 75 PNe (20%), one of the 4 wide binaries
(25%), and in 1 of the 10 close binaries (10%). Using the CO (J = 3 - 2) line,
we estimated the column density and mass of each source.
|
astro-ph.SR astro-ph.GA
|
context observations of molecular gas have played a key role in developing the current understanding of the late stages of stellar evolution aims the survey planetary nebulae and their co reservoir with apex pandora was designed to study the circumstellar shells of evolved stars with the aim to estimate their physical parameters methods millimetre carbon monoxide co emission is the most useful probe of the warm molecular component ejected by low to intermediatemass stars co is the secondmost abundant molecule in the universe and the millimeter transitions are easily excited thus making it particularly useful to study the mass structure and kinematics of the molecular gas we present a large survey of the co j 3 2 line using the atacama pathfinder experiment apex telescope in a sample of 93 protoplanetary nebulae and planetary nebulae results co j 3 2 was detected in 21 of the 93 objects conclusions co j 3 2 was detected in all 4 observed ppne 100 15 of the 75 pne 20 one of the 4 wide binaries 25 and in 1 of the 10 close binaries 10 using the co j 3 2 line we estimated the column density and mass of each source
|
[['context', 'observations', 'of', 'molecular', 'gas', 'have', 'played', 'a', 'key', 'role', 'in', 'developing', 'the', 'current', 'understanding', 'of', 'the', 'late', 'stages', 'of', 'stellar', 'evolution', 'aims', 'the', 'survey', 'planetary', 'nebulae', 'and', 'their', 'co', 'reservoir', 'with', 'apex', 'pandora', 'was', 'designed', 'to', 'study', 'the', 'circumstellar', 'shells', 'of', 'evolved', 'stars', 'with', 'the', 'aim', 'to', 'estimate', 'their', 'physical', 'parameters', 'methods', 'millimetre', 'carbon', 'monoxide', 'co', 'emission', 'is', 'the', 'most', 'useful', 'probe', 'of', 'the', 'warm', 'molecular', 'component', 'ejected', 'by', 'low', 'to', 'intermediatemass', 'stars', 'co', 'is', 'the', 'secondmost', 'abundant', 'molecule', 'in', 'the', 'universe', 'and', 'the', 'millimeter', 'transitions', 'are', 'easily', 'excited', 'thus', 'making', 'it', 'particularly', 'useful', 'to', 'study', 'the', 'mass', 'structure', 'and', 'kinematics', 'of', 'the', 'molecular', 'gas', 'we', 'present', 'a', 'large', 'survey', 'of', 'the', 'co', 'j', '3', '2', 'line', 'using', 'the', 'atacama', 'pathfinder', 'experiment', 'apex', 'telescope', 'in', 'a', 'sample', 'of', '93', 'protoplanetary', 'nebulae', 'and', 'planetary', 'nebulae', 'results', 'co', 'j', '3', '2', 'was', 'detected', 'in', '21', 'of', 'the', '93', 'objects', 'conclusions', 'co', 'j', '3', '2', 'was', 'detected', 'in', 'all', '4', 'observed', 'ppne', '100', '15', 'of', 'the', '75', 'pne', '20', 'one', 'of', 'the', '4', 'wide', 'binaries', '25', 'and', 'in', '1', 'of', 'the', '10', 'close', 'binaries', '10', 'using', 'the', 'co', 'j', '3', '2', 'line', 'we', 'estimated', 'the', 'column', 'density', 'and', 'mass', 'of', 'each', 'source']]
|
[-0.07049604580330197, 0.09374804403749294, 0.032545552467927334, 0.05114675263292156, -0.04447300573228859, -0.06567530773812905, 0.03790717209107242, 0.3873075047787279, -0.13482423721172382, -0.3956197903677821, 0.08633830914273859, -0.28372877068817615, -0.027856317026598843, 0.1267349785589613, 0.05121013526921161, -0.01994120120361913, 0.06593840938061475, -0.14387844703043812, -0.01672004214953631, -0.2589142348978203, 0.2929181472869823, 0.11061858286848292, 0.108939941918361, 0.02086657080304576, 0.039047181929927316, -0.1488538385508582, -0.09114134514820763, -0.06910605871642474, -0.15704327130224555, 0.08867728094803169, 0.2777669468075328, 0.14896642656414769, 0.21404769926448353, -0.38127008483261304, -0.17206094622612, 0.03349183286220068, 0.16786818702938036, 0.05142104249447584, -0.0035541776054742514, -0.2595522564370185, 0.06303043791791424, -0.1855292230087798, -0.23128474989673123, 0.09103971994685707, 0.0917946313531138, 0.03338800523953978, -0.20073185543209549, 0.0480531583155971, 0.04078387054963969, 0.13289139538188466, -0.11999474771437235, -0.18712861807551234, -0.08017429685511161, 0.09425235351896845, -0.05570354601426516, 0.09339520126290153, 0.2187067141663283, -0.12236025499412789, -0.016633063321351074, 0.41955607826821506, -0.11365652574808337, -0.01113817309960723, 0.26958524676039813, -0.24865679952781647, -0.20051045695552602, 0.20438853036612273, 0.11315688414964825, 0.15134520765393972, -0.16512757596588926, 0.005605763305939035, -0.0031899681437062097, 0.21188638473162427, 0.0707388145197183, 0.03294383608270437, 0.3275824425276369, 0.13657590116141363, -0.015154111085867044, 0.10185128617216833, -0.3025514594907872, -0.040341073769377546, -0.17296498924260958, -0.17517344033927656, -0.16447147185972427, 0.09920857880613766, -0.11765513584439759, -0.04509340612916276, 0.30761033831484386, 0.10249216169351712, 0.21068884419510142, -0.04056913138949312, 0.27625437909737227, 0.02297022741753608, 0.07405280423990916, 0.10932541979942471, 0.310045311388094, 0.19568216327344998, 0.1523534806095995, -0.21646297557163052, 0.0707378091593273, -0.02729148442274891]
|
1,803.08447
|
Current Constraints on Anisotropic and Isotropic Dark Energy Models
|
We use Gaussian processes in combination with MCMC method to place
constraints on cosmological parameters of three dark energy models including
flat and curved FRW and Bianchi type I spacetimes. To do so, we use recently
compiled 36 measurements of the Hubble parameter $H(z)$ in the redshifts
intermediate $0.07\leqslant z \leqslant 2.36$. Moreover, we use these models to
estimate the redshift of the deceleration-acceleration transition. We consider
two Gaussian priors for current value of the Hubble constant i.e
$H_{0}=73\pm1.74 (68\pm 2.8)$ km/s/Mpc to investigate the effect of the assumed
$H_{0}$ on our parameters estimations. For statistical analysis we use NUTS
sampler which is an extension of Hamiltonian Monte Carlo algorithm to generate
MCMC chains for parameters of dark energy models. To compare the considered
cosmologies, we perform Akaike information criterion (AIC) and Bayes factor
($\Psi$). In general, when we compared our results with 9 years WMAP as well as
Planck 2015 Collaboration, we found that Bianchi type I model is slightly fits
better to the observational Hubble data with respect to the non-flat FRW model.
|
astro-ph.CO
|
we use gaussian processes in combination with mcmc method to place constraints on cosmological parameters of three dark energy models including flat and curved frw and bianchi type i spacetimes to do so we use recently compiled 36 measurements of the hubble parameter hz in the redshifts intermediate 007leqslant z leqslant 236 moreover we use these models to estimate the redshift of the decelerationacceleration transition we consider two gaussian priors for current value of the hubble constant ie h_073pm174 68pm 28 kmsmpc to investigate the effect of the assumed h_0 on our parameters estimations for statistical analysis we use nuts sampler which is an extension of hamiltonian monte carlo algorithm to generate mcmc chains for parameters of dark energy models to compare the considered cosmologies we perform akaike information criterion aic and bayes factor psi in general when we compared our results with 9 years wmap as well as planck 2015 collaboration we found that bianchi type i model is slightly fits better to the observational hubble data with respect to the nonflat frw model
|
[['we', 'use', 'gaussian', 'processes', 'in', 'combination', 'with', 'mcmc', 'method', 'to', 'place', 'constraints', 'on', 'cosmological', 'parameters', 'of', 'three', 'dark', 'energy', 'models', 'including', 'flat', 'and', 'curved', 'frw', 'and', 'bianchi', 'type', 'i', 'spacetimes', 'to', 'do', 'so', 'we', 'use', 'recently', 'compiled', '36', 'measurements', 'of', 'the', 'hubble', 'parameter', 'hz', 'in', 'the', 'redshifts', 'intermediate', '007leqslant', 'z', 'leqslant', '236', 'moreover', 'we', 'use', 'these', 'models', 'to', 'estimate', 'the', 'redshift', 'of', 'the', 'decelerationacceleration', 'transition', 'we', 'consider', 'two', 'gaussian', 'priors', 'for', 'current', 'value', 'of', 'the', 'hubble', 'constant', 'ie', 'h_073pm174', '68pm', '28', 'kmsmpc', 'to', 'investigate', 'the', 'effect', 'of', 'the', 'assumed', 'h_0', 'on', 'our', 'parameters', 'estimations', 'for', 'statistical', 'analysis', 'we', 'use', 'nuts', 'sampler', 'which', 'is', 'an', 'extension', 'of', 'hamiltonian', 'monte', 'carlo', 'algorithm', 'to', 'generate', 'mcmc', 'chains', 'for', 'parameters', 'of', 'dark', 'energy', 'models', 'to', 'compare', 'the', 'considered', 'cosmologies', 'we', 'perform', 'akaike', 'information', 'criterion', 'aic', 'and', 'bayes', 'factor', 'psi', 'in', 'general', 'when', 'we', 'compared', 'our', 'results', 'with', '9', 'years', 'wmap', 'as', 'well', 'as', 'planck', '2015', 'collaboration', 'we', 'found', 'that', 'bianchi', 'type', 'i', 'model', 'is', 'slightly', 'fits', 'better', 'to', 'the', 'observational', 'hubble', 'data', 'with', 'respect', 'to', 'the', 'nonflat', 'frw', 'model']]
|
[-0.04160594336743698, 0.07243574832337626, -0.07867574967939213, 0.12015349585213025, -0.14481287757224118, -0.169587109768171, 0.029457978769663096, 0.406192253241477, -0.20278652093098687, -0.34744756118726855, 0.07433971240672396, -0.2791889667015717, -0.02547118535993427, 0.1919854433131754, -0.0017101578125084153, 0.03584828101249272, 0.042565014030289096, -0.031759818063004513, -0.08722138852532078, -0.30561613365994345, 0.3062967604855237, 0.12688049929744075, 0.2578092172793705, -0.08816891954172937, 0.09574077687103597, -0.04952005937970055, -0.07945739428345867, -0.008924252983462604, -0.2983148521328607, 0.04369254141906007, 0.1898065183873043, 0.14638120602500743, 0.2121580450989392, -0.33516258301315666, -0.23582810176956343, 0.15916653484445217, 0.15018632950670371, 0.13294535605008095, 0.010562843884034567, -0.3008871650850842, 0.026389551539757326, -0.1948533774437006, -0.08955414571686288, -0.06263855591515952, -0.03206914500198785, -0.016637987164831638, -0.2871242574351501, 0.17092707954653985, -0.02031741799137991, 0.01540212638977635, -0.11845009731441047, -0.15003704886030234, -0.013049308831044446, 0.01039467489490194, 0.05531584134734521, 0.029757614100804134, 0.10142086719491147, -0.10805661784925073, -0.09692036698443136, 0.3501792440158611, -0.13440344977391766, -0.1592908070524993, 0.1402927157849294, -0.11367547372086889, -0.1847191775332722, 0.031784718840065375, 0.15857461282735788, 0.06378772809584705, -0.14994988023517775, 0.12951432359223172, 0.0502025896005031, 0.19429498115242216, 0.020356672463199728, -0.02808758020340438, 0.17991914313099472, 0.11613378864497678, 0.03229824416716233, 0.07898324849541606, -0.155872168342416, -0.09635679424986664, -0.33836107348318, -0.12518550132029835, -0.15467858154358977, 0.07731712914968308, -0.17299729786421955, -0.15239323848438574, 0.3489477008748046, 0.19821708152512077, 0.21102885731813537, 0.09170154181263286, 0.26846624719991075, 0.044196785593841416, 0.022820578288696398, 0.09385976470021715, 0.2868793503182127, 0.12490597581410123, 0.07748734583873625, -0.14665649073720624, -0.012492402846994944, 0.01957869627566825]
|
1,803.08448
|
To Edge or Not to Edge?
|
Edge computing caters to a wide range of use cases from latency sensitive to
bandwidth constrained applications. However, the exact specifications of the
edge that give the most benefit for each type of application are still unclear.
We investigate the concrete conditions when the edge is feasible, i.e., when
users observe performance gains from the edge while costs remain low for the
providers, for an application that requires both low latency and high
bandwidth: video analytics.
|
cs.NI
|
edge computing caters to a wide range of use cases from latency sensitive to bandwidth constrained applications however the exact specifications of the edge that give the most benefit for each type of application are still unclear we investigate the concrete conditions when the edge is feasible ie when users observe performance gains from the edge while costs remain low for the providers for an application that requires both low latency and high bandwidth video analytics
|
[['edge', 'computing', 'caters', 'to', 'a', 'wide', 'range', 'of', 'use', 'cases', 'from', 'latency', 'sensitive', 'to', 'bandwidth', 'constrained', 'applications', 'however', 'the', 'exact', 'specifications', 'of', 'the', 'edge', 'that', 'give', 'the', 'most', 'benefit', 'for', 'each', 'type', 'of', 'application', 'are', 'still', 'unclear', 'we', 'investigate', 'the', 'concrete', 'conditions', 'when', 'the', 'edge', 'is', 'feasible', 'ie', 'when', 'users', 'observe', 'performance', 'gains', 'from', 'the', 'edge', 'while', 'costs', 'remain', 'low', 'for', 'the', 'providers', 'for', 'an', 'application', 'that', 'requires', 'both', 'low', 'latency', 'and', 'high', 'bandwidth', 'video', 'analytics']]
|
[-0.14270359251991308, 0.047941960328707386, 0.028141555474384836, 0.05143126434383081, -0.10481024151484139, -0.18405384404315173, 0.11142808860658031, 0.41316567126073334, -0.28682171026594006, -0.32926050050024824, 0.17996982305531242, -0.24670123628732799, -0.11895288669161107, 0.2126445180436253, -0.13972783314009002, 0.057022057701894814, 0.11901065430643748, 0.0382602227680189, -0.051268986781666935, -0.25372677940973326, 0.26738883661853735, 0.06817496650680703, 0.34163496030592605, 0.12963306465137162, 0.05054389600225381, 0.018118357010136702, 0.02533730613312831, -0.0026462358393329944, -0.09976583440565216, 0.11183681807826935, 0.3530155336484313, 0.1586823391017357, 0.31583936066415746, -0.4526991915987118, -0.1817730765875527, 0.07138583797495812, 0.11019135929497056, 0.0553452894183513, -0.06964910759492532, -0.2108480589170205, 0.1810950826069242, -0.2054967495955919, -0.08724985070722668, -0.08074180912655338, 0.032334147008920185, 0.03122763269914829, -0.3052157163619995, 0.015234824625383081, -0.026334633977201424, 0.020284755290240833, -0.014348565971503328, -0.10882228706032038, 0.0008950564975078267, 0.2038828165333191, 0.02712513416650166, -0.02964949140502875, 0.13282539699790313, -0.243552687928681, -0.10384342912737721, 0.4106618306526032, 0.011031967600023276, -0.13319423084000223, 0.23958346649305895, -0.06616314423368558, -0.1424761834297035, 0.14945448552699467, 0.1875210422287254, 0.056959190908329266, -0.13652759623341568, 0.09278940767858569, 0.034490365718834494, 0.1582257266180884, 0.08003604981901222, 0.15053507594979906, 0.20029675417371387, 0.17646378585701122, 0.17885238594393932, 0.1479369364433775, -0.07265444071718345, -0.05696907262685463, -0.2323719781553863, -0.12550557456683906, -0.2150644398735542, -0.01647771204251943, -0.10231969957710949, -0.1452262218747484, 0.3848878975810581, 0.20246231100080828, 0.18737040213263276, 0.11540152172950145, 0.3690984391448039, 0.11942017919040825, 0.05227504366714703, 0.15954726338876704, 0.18016210764548496, -0.011177560510604005, 0.13287782490461772, -0.18278767721801015, 0.07961331367627472, -0.08699082967972285]
|
1,803.08449
|
An asymptotically optimal indirect approach to continuous-time system
identification
|
The indirect approach to continuous-time system identification consists in
estimating continuous-time models by first determining an appropriate
discrete-time model. For a zero-order hold sampling mechanism, this approach
usually leads to a transfer function estimate with relative degree 1,
independent of the relative degree of the strictly proper real system. In this
paper, a refinement of these methods is developed. Inspired by indirect PEM, we
propose a method that enforces a fixed relative degree in the continuous-time
transfer function estimate, and show that the resulting estimator is consistent
and asymptotically efficient. Extensive numerical simulations are put forward
to show the performance of this estimator when contrasted with other indirect
and direct methods for continuous-time system identification.
|
cs.SY
|
the indirect approach to continuoustime system identification consists in estimating continuoustime models by first determining an appropriate discretetime model for a zeroorder hold sampling mechanism this approach usually leads to a transfer function estimate with relative degree 1 independent of the relative degree of the strictly proper real system in this paper a refinement of these methods is developed inspired by indirect pem we propose a method that enforces a fixed relative degree in the continuoustime transfer function estimate and show that the resulting estimator is consistent and asymptotically efficient extensive numerical simulations are put forward to show the performance of this estimator when contrasted with other indirect and direct methods for continuoustime system identification
|
[['the', 'indirect', 'approach', 'to', 'continuoustime', 'system', 'identification', 'consists', 'in', 'estimating', 'continuoustime', 'models', 'by', 'first', 'determining', 'an', 'appropriate', 'discretetime', 'model', 'for', 'a', 'zeroorder', 'hold', 'sampling', 'mechanism', 'this', 'approach', 'usually', 'leads', 'to', 'a', 'transfer', 'function', 'estimate', 'with', 'relative', 'degree', '1', 'independent', 'of', 'the', 'relative', 'degree', 'of', 'the', 'strictly', 'proper', 'real', 'system', 'in', 'this', 'paper', 'a', 'refinement', 'of', 'these', 'methods', 'is', 'developed', 'inspired', 'by', 'indirect', 'pem', 'we', 'propose', 'a', 'method', 'that', 'enforces', 'a', 'fixed', 'relative', 'degree', 'in', 'the', 'continuoustime', 'transfer', 'function', 'estimate', 'and', 'show', 'that', 'the', 'resulting', 'estimator', 'is', 'consistent', 'and', 'asymptotically', 'efficient', 'extensive', 'numerical', 'simulations', 'are', 'put', 'forward', 'to', 'show', 'the', 'performance', 'of', 'this', 'estimator', 'when', 'contrasted', 'with', 'other', 'indirect', 'and', 'direct', 'methods', 'for', 'continuoustime', 'system', 'identification']]
|
[-0.08880604102640696, 0.0349536019550768, -0.08482656491029522, 0.05651523985456468, -0.03339978588906967, -0.1772964927934758, 0.054581334796207755, 0.38904535738022433, -0.2907257343277983, -0.2956052464837937, 0.10292281784299437, -0.21554813502437395, -0.17814924367602267, 0.19913124004581376, -0.07515868176908597, 0.0797209963981953, 0.09737454929573174, 0.003768953254810818, -0.06903625814163167, -0.212861430516426, 0.28894632629564276, 0.07732570197271264, 0.28863370127004123, -0.00818456652695718, 0.1597729368135333, 0.06087432106673393, -0.07127101810082145, 0.02341803730182026, -0.13558537545879676, 0.15755601397756, 0.2093064994848923, 0.09708003325472617, 0.3275999299614974, -0.3503997594502795, -0.22836302895422864, 0.13752087942608024, 0.1264071445385723, 0.11608447877123304, -0.05124053165934089, -0.2650784515573279, 0.10800019428133964, -0.19756533983910113, -0.09262322455887562, -0.06599816153554813, -0.02947458867793498, 0.026417512381854264, -0.35773210045071724, 0.09303750638728557, 0.06730832298907563, 0.04353323067821886, -0.057311193920348, -0.1210845854629398, 0.012646684629599685, 0.08507544335974988, 0.026191420572728892, 0.01989780874801395, 0.10128782517884088, -0.0791053376727454, -0.1558083792095599, 0.30785141652045045, -0.07105750912678954, -0.24647762534896964, 0.20455433892987102, -0.08496367959710567, -0.12070680973727418, 0.1254181392652833, 0.1758350882274301, 0.14560645968126862, -0.16145946644107387, 0.06643032302685163, -0.031189298439447, 0.1699084230091261, -0.043700242961716394, -0.009060452959459762, 0.16458003782748204, 0.20171007597414048, 0.12183231144495632, 0.14954642658779885, -0.05610157667618731, -0.1231268995805927, -0.2875149253593839, -0.1613155998694508, -0.19266878689193856, 0.009259931236991415, -0.10851294121580989, -0.15514746804762145, 0.3496309876927863, 0.21356758178697657, 0.1813596260207503, 0.10051150475628674, 0.35437796533755633, 0.17600619473454096, -0.023663334750934788, 0.047425784194922965, 0.2278203996060335, 0.10925371968389853, 0.035386679378216684, -0.22968565862544854, 0.12053501963939356, 0.08926151724856185]
|
1,803.0845
|
A Comprehensive Analysis of Deep Regression
|
Deep learning revolutionized data science, and recently its popularity has
grown exponentially, as did the amount of papers employing deep networks.
Vision tasks, such as human pose estimation, did not escape from this trend.
There is a large number of deep models, where small changes in the network
architecture, or in the data pre-processing, together with the stochastic
nature of the optimization procedures, produce notably different results,
making extremely difficult to sift methods that significantly outperform
others. This situation motivates the current study, in which we perform a
systematic evaluation and statistical analysis of vanilla deep regression, i.e.
convolutional neural networks with a linear regression top layer. This is the
first comprehensive analysis of deep regression techniques. We perform
experiments on four vision problems, and report confidence intervals for the
median performance as well as the statistical significance of the results, if
any. Surprisingly, the variability due to different data pre-processing
procedures generally eclipses the variability due to modifications in the
network architecture. Our results reinforce the hypothesis according to which,
in general, a general-purpose network (e.g. VGG-16 or ResNet-50) adequately
tuned can yield results close to the state-of-the-art without having to resort
to more complex and ad-hoc regression models.
|
cs.CV
|
deep learning revolutionized data science and recently its popularity has grown exponentially as did the amount of papers employing deep networks vision tasks such as human pose estimation did not escape from this trend there is a large number of deep models where small changes in the network architecture or in the data preprocessing together with the stochastic nature of the optimization procedures produce notably different results making extremely difficult to sift methods that significantly outperform others this situation motivates the current study in which we perform a systematic evaluation and statistical analysis of vanilla deep regression ie convolutional neural networks with a linear regression top layer this is the first comprehensive analysis of deep regression techniques we perform experiments on four vision problems and report confidence intervals for the median performance as well as the statistical significance of the results if any surprisingly the variability due to different data preprocessing procedures generally eclipses the variability due to modifications in the network architecture our results reinforce the hypothesis according to which in general a generalpurpose network eg vgg16 or resnet50 adequately tuned can yield results close to the stateoftheart without having to resort to more complex and adhoc regression models
|
[['deep', 'learning', 'revolutionized', 'data', 'science', 'and', 'recently', 'its', 'popularity', 'has', 'grown', 'exponentially', 'as', 'did', 'the', 'amount', 'of', 'papers', 'employing', 'deep', 'networks', 'vision', 'tasks', 'such', 'as', 'human', 'pose', 'estimation', 'did', 'not', 'escape', 'from', 'this', 'trend', 'there', 'is', 'a', 'large', 'number', 'of', 'deep', 'models', 'where', 'small', 'changes', 'in', 'the', 'network', 'architecture', 'or', 'in', 'the', 'data', 'preprocessing', 'together', 'with', 'the', 'stochastic', 'nature', 'of', 'the', 'optimization', 'procedures', 'produce', 'notably', 'different', 'results', 'making', 'extremely', 'difficult', 'to', 'sift', 'methods', 'that', 'significantly', 'outperform', 'others', 'this', 'situation', 'motivates', 'the', 'current', 'study', 'in', 'which', 'we', 'perform', 'a', 'systematic', 'evaluation', 'and', 'statistical', 'analysis', 'of', 'vanilla', 'deep', 'regression', 'ie', 'convolutional', 'neural', 'networks', 'with', 'a', 'linear', 'regression', 'top', 'layer', 'this', 'is', 'the', 'first', 'comprehensive', 'analysis', 'of', 'deep', 'regression', 'techniques', 'we', 'perform', 'experiments', 'on', 'four', 'vision', 'problems', 'and', 'report', 'confidence', 'intervals', 'for', 'the', 'median', 'performance', 'as', 'well', 'as', 'the', 'statistical', 'significance', 'of', 'the', 'results', 'if', 'any', 'surprisingly', 'the', 'variability', 'due', 'to', 'different', 'data', 'preprocessing', 'procedures', 'generally', 'eclipses', 'the', 'variability', 'due', 'to', 'modifications', 'in', 'the', 'network', 'architecture', 'our', 'results', 'reinforce', 'the', 'hypothesis', 'according', 'to', 'which', 'in', 'general', 'a', 'generalpurpose', 'network', 'eg', 'vgg16', 'or', 'resnet50', 'adequately', 'tuned', 'can', 'yield', 'results', 'close', 'to', 'the', 'stateoftheart', 'without', 'having', 'to', 'resort', 'to', 'more', 'complex', 'and', 'adhoc', 'regression', 'models']]
|
[-0.031218715754221193, -0.01817878695204854, -0.0861734498781152, 0.08120728558278642, -0.11327243056846782, -0.18636356367496773, 0.059123029214097185, 0.4321717408671975, -0.25646544381510467, -0.37414413173682987, 0.112560044163547, -0.2662532554054633, -0.19739850608864798, 0.20411097016884014, -0.12233709779276979, 0.11797206636954798, 0.15398926337249577, 0.004803112396039069, -0.08899153590435162, -0.29981020284467375, 0.27744634173694066, 0.07927622728500865, 0.33298418791615403, 0.005057148003252223, 0.06571886629448272, -0.015936888568103314, -0.047205080151325095, 0.006143088673961756, -0.054920282972343554, 0.14882756381037324, 0.3073461949148987, 0.1686148493667133, 0.33349728578235954, -0.44297215996310113, -0.26200359844136983, 0.12214405608014203, 0.14224168246211774, 0.09339816009975038, 0.0020606481373397403, -0.2862475751235615, 0.06185068856793805, -0.15962539461441339, -0.01089551446493715, -0.12868953185155987, -0.02121932471403852, -0.0008732439589221031, -0.2622283878759481, 0.06171914580161683, 0.07250849782780279, 0.07955186287872493, -0.023643910885439254, -0.1301086271990789, 0.023827239137135622, 0.12654692461946979, 0.06533753805386368, 0.06296730769216083, 0.14290341628133318, -0.19417617924133082, -0.15362435030168853, 0.3535854253033176, -0.08551023071981036, -0.1785418772418052, 0.23481105527840554, -0.05263208453776315, -0.20560744427726604, 0.10490461518755183, 0.2532482898136368, 0.08968429427477531, -0.1363038273062557, 0.0174506032851059, -0.015413767430000008, 0.19426860666368156, 0.014620326490839943, -0.017789587578445207, 0.18232043945463375, 0.25929950692458076, 0.02088905153563246, 0.08847940276726149, -0.1574941931187641, -0.07248423510463908, -0.19337208767887204, -0.07343217103974893, -0.15945669714710675, -0.003346828443391132, -0.09702164782414911, -0.1775296174082905, 0.392584159077378, 0.21201819263398647, 0.22654280909104274, 0.10897163741261466, 0.34863903883844616, 0.04434936452598777, 0.15875661151774692, 0.0908340580901131, 0.23588398525549564, 0.05531222372315824, 0.1488666650443338, -0.13542173466237728, 0.11407972800079733, -0.014698590352199972]
|
1,803.08451
|
Kinetic Theory of Transport Driven Current in Centrally fuelled Plasmas
|
When a steady-state cylindrical plasma discharge is centrally fuelled, the
collisionless radial electron flux is canonically coupled to an axial current.
The identification and analysis of this transport driven current, previously
reported in collisionless simulations [W. J. Nunan and J. M. Dawson, Phys. Rev.
Lett. $\mathbf{73}$, 1628 (1994)], is addressed analytically and extended to
the collisional regime by means of first-principles kinetic models.
Collisionless radial transport is described with the standard quasilinear model
and collisional velocity anisotropy relaxation with the Landau kinetic
equation. When trapped particles corrections are taken into account, the
solution of this kinetic model provides the analytical expression for the
transport driven current in a centrally fuelled steady-state tokamak as a
function of the thermonuclear power and discharge parameters. For ITER type
discharges, with central fuelling, a current of about one mega-ampere is
predicted by this first-principles analytical kinetic model.
|
physics.plasm-ph
|
when a steadystate cylindrical plasma discharge is centrally fuelled the collisionless radial electron flux is canonically coupled to an axial current the identification and analysis of this transport driven current previously reported in collisionless simulations w j nunan and j m dawson phys rev lett mathbf73 1628 1994 is addressed analytically and extended to the collisional regime by means of firstprinciples kinetic models collisionless radial transport is described with the standard quasilinear model and collisional velocity anisotropy relaxation with the landau kinetic equation when trapped particles corrections are taken into account the solution of this kinetic model provides the analytical expression for the transport driven current in a centrally fuelled steadystate tokamak as a function of the thermonuclear power and discharge parameters for iter type discharges with central fuelling a current of about one megaampere is predicted by this firstprinciples analytical kinetic model
|
[['when', 'a', 'steadystate', 'cylindrical', 'plasma', 'discharge', 'is', 'centrally', 'fuelled', 'the', 'collisionless', 'radial', 'electron', 'flux', 'is', 'canonically', 'coupled', 'to', 'an', 'axial', 'current', 'the', 'identification', 'and', 'analysis', 'of', 'this', 'transport', 'driven', 'current', 'previously', 'reported', 'in', 'collisionless', 'simulations', 'w', 'j', 'nunan', 'and', 'j', 'm', 'dawson', 'phys', 'rev', 'lett', 'mathbf73', '1628', '1994', 'is', 'addressed', 'analytically', 'and', 'extended', 'to', 'the', 'collisional', 'regime', 'by', 'means', 'of', 'firstprinciples', 'kinetic', 'models', 'collisionless', 'radial', 'transport', 'is', 'described', 'with', 'the', 'standard', 'quasilinear', 'model', 'and', 'collisional', 'velocity', 'anisotropy', 'relaxation', 'with', 'the', 'landau', 'kinetic', 'equation', 'when', 'trapped', 'particles', 'corrections', 'are', 'taken', 'into', 'account', 'the', 'solution', 'of', 'this', 'kinetic', 'model', 'provides', 'the', 'analytical', 'expression', 'for', 'the', 'transport', 'driven', 'current', 'in', 'a', 'centrally', 'fuelled', 'steadystate', 'tokamak', 'as', 'a', 'function', 'of', 'the', 'thermonuclear', 'power', 'and', 'discharge', 'parameters', 'for', 'iter', 'type', 'discharges', 'with', 'central', 'fuelling', 'a', 'current', 'of', 'about', 'one', 'megaampere', 'is', 'predicted', 'by', 'this', 'firstprinciples', 'analytical', 'kinetic', 'model']]
|
[-0.11284330901165546, 0.150403209160357, -0.024752370696118537, 0.0037946329792261334, -0.03160553798740003, -0.12181484371635086, -0.028694835154617085, 0.2995247539951869, -0.20973905887956737, -0.28766434912483957, -0.006726953876369917, -0.2408527277355538, -0.03215854966365699, 0.20905735489667943, 0.00938215663455136, 0.05652988116184236, 0.03546906988869639, -0.08322722656348495, -0.004615827356233982, -0.16942433619224434, 0.21958875502228525, 0.15199310779043124, 0.26767632395486474, 0.037375994971193746, 0.07496633740176664, -0.04529392960025592, -0.019258916457282737, 0.04561032719434576, -0.22173018847517453, 0.03030443229672915, 0.18770331681115368, 0.003338943484919608, 0.251132809230067, -0.48484949935359734, -0.2745026089284067, 0.0124822615493908, 0.16807439466542068, 0.11866604573595343, -0.06250613969123216, -0.24066967118518257, 0.0016942340963196458, -0.25322772536083316, -0.15492798510529365, -0.036869559179436656, 0.08516216681153903, 0.07160741519251036, -0.31557416667540866, 0.2047081409709145, 0.059492941691493946, 0.03191714297240296, -0.10677718314183678, -0.10468158483214623, -0.07451422078244335, -0.032280823876767534, 0.037425386448672944, 0.06041967993311531, 0.20829639078699158, -0.12639097751329606, -0.06853355889056698, 0.36942769954284876, -0.05065024997510597, -0.19772589267462704, 0.1947512474333775, -0.18207735310685128, -0.0669329648091068, 0.17712372064537613, 0.09224724472361676, 0.07772102928885542, -0.21796696983605576, 0.09246602695537871, -0.06522786579505996, 0.10176060071664182, 0.05576128613018821, -0.08810189610069737, 0.262894719304081, 0.1916466790832685, -0.04914257654272918, 0.08681219917761678, -0.09259697288961698, -0.10790315417057657, -0.28817126432975343, -0.11641606255781223, -0.15428437206048704, 0.10871937837375738, 0.0149738132200866, -0.1444599520586801, 0.3878878519295695, 0.12170347668468318, 0.123320116820012, -0.0310574440780535, 0.31131125223684186, 0.21944033196575755, -0.01576558895184533, 0.17439627065158164, 0.2646516357475879, 0.22652823157965185, 0.14084098886711693, -0.3079918882254749, -0.002112881688348262, 0.06735205589562443]
|
1,803.08452
|
An algebraic approach to the ellipticity of linear differential
operators
|
We demonstrate a method of associating the principal symbol at a $K$-point
with a linear differential operator acting between modules over a commutative
algebra, and we use it to define the ellipticity of a linear differential
operator in a purely algebraic way. We prove that the ellipticity is preserved
by a surjective homomorphism of algebras. As an example, we show that for every
real affine variety there is an elliptic linear differential operator acting on
the algebra of regular functions on this variety.
|
math.AC math.AG
|
we demonstrate a method of associating the principal symbol at a kpoint with a linear differential operator acting between modules over a commutative algebra and we use it to define the ellipticity of a linear differential operator in a purely algebraic way we prove that the ellipticity is preserved by a surjective homomorphism of algebras as an example we show that for every real affine variety there is an elliptic linear differential operator acting on the algebra of regular functions on this variety
|
[['we', 'demonstrate', 'a', 'method', 'of', 'associating', 'the', 'principal', 'symbol', 'at', 'a', 'kpoint', 'with', 'a', 'linear', 'differential', 'operator', 'acting', 'between', 'modules', 'over', 'a', 'commutative', 'algebra', 'and', 'we', 'use', 'it', 'to', 'define', 'the', 'ellipticity', 'of', 'a', 'linear', 'differential', 'operator', 'in', 'a', 'purely', 'algebraic', 'way', 'we', 'prove', 'that', 'the', 'ellipticity', 'is', 'preserved', 'by', 'a', 'surjective', 'homomorphism', 'of', 'algebras', 'as', 'an', 'example', 'we', 'show', 'that', 'for', 'every', 'real', 'affine', 'variety', 'there', 'is', 'an', 'elliptic', 'linear', 'differential', 'operator', 'acting', 'on', 'the', 'algebra', 'of', 'regular', 'functions', 'on', 'this', 'variety']]
|
[-0.17167044516248875, 0.014690637759968123, -0.10658592160185237, 0.04191945554514651, -0.12060297628393374, -0.10449378706896341, -0.0635195618091398, 0.37522861119135315, -0.41291694504668913, -0.17138427570013395, 0.10964080060029918, -0.27179616151085817, -0.21279459897181893, 0.24585638177323055, -0.11217492448547518, 0.006381955850555236, 0.052427366504961825, 0.11123593902237804, -0.14772153675488858, -0.2023452461573733, 0.4411394301218441, -0.044586622518072105, 0.181111805466374, 0.013207151470369244, 0.20642454318522688, 0.06464639826711402, -0.03027485836723662, 0.013237846959157881, -0.10277496542622397, 0.09821749990244946, 0.31274630607341425, 0.06637304185059326, 0.25677247870578823, -0.36872332458242674, -0.096334312181269, 0.18060464832752224, 0.08604345977283924, 0.044676105042986844, -0.08104895087273185, -0.2407344171036798, 0.09566813577787042, -0.2124466474830027, -0.11369335837101183, -0.07707565454822259, 0.0702542290484241, 0.0038241736186915135, -0.31832842594741967, 0.005199926254530269, 0.11031427117715399, 0.16361072145581965, -0.06971539968781802, -0.0340838559092505, -0.08259718582393175, 0.04648868017549436, -0.10226407671818533, 0.038935584790376294, 0.12311030387898055, -0.04298946747264589, -0.1339148536144969, 0.3297444079856736, -0.09838798180985522, -0.2896901663864054, 0.11204251696366861, -0.18338016830721354, -0.13617059714385274, 0.05408533918390791, 0.12591057450297366, 0.15047331072434963, -0.05263166130711156, 0.19108129207939695, -0.14833269197583557, 0.13384843465075436, 0.044987061610782, -0.012217365143573787, 0.11684494693370828, 0.10133152715412967, 0.1589400423915092, 0.13900790405628013, 0.037376329016658556, -0.025402430231761502, -0.37505528499114227, -0.179747821140406, -0.11955483623567116, 0.1246595305435539, -0.10237769564843024, -0.20685362411909794, 0.4127395572701851, 0.07502347569216986, 0.23372533798487072, 0.10271472097318395, 0.2508804940938366, 0.19116753483252846, 0.11100390906367137, 0.03361748420375298, 0.11863793199320874, 0.22043497482572783, 0.01818724670475461, -0.18483496139790997, -0.02628287739198969, 0.15440042708517918]
|
1,803.08453
|
Three characterisations of the sequential product
|
It has already been established that the properties required of an abstract
sequential product as introduced by Gudder and Greechie are not enough to
characterise the standard sequential product $a\circ b = \sqrt{a}b\sqrt{a}$ on
an operator algebra. We give three additional properties, each of which
characterises the standard sequential product on either a von Neumann algebra
or a Euclidean Jordan algebra. These properties are (1) invariance under
application of unital order isomorphisms, (2) symmetry of the sequential
product with respect to a certain inner product, and (3) preservation of
invertibility of the effects. To give these characterisations we first have to
study convex $\sigma$-sequential effect algebras. We show that these objects
correspond to unit intervals of spectral order unit spaces with a homogeneous
positive cone.
|
math.OA math-ph math.MP quant-ph
|
it has already been established that the properties required of an abstract sequential product as introduced by gudder and greechie are not enough to characterise the standard sequential product acirc b sqrtabsqrta on an operator algebra we give three additional properties each of which characterises the standard sequential product on either a von neumann algebra or a euclidean jordan algebra these properties are 1 invariance under application of unital order isomorphisms 2 symmetry of the sequential product with respect to a certain inner product and 3 preservation of invertibility of the effects to give these characterisations we first have to study convex sigmasequential effect algebras we show that these objects correspond to unit intervals of spectral order unit spaces with a homogeneous positive cone
|
[['it', 'has', 'already', 'been', 'established', 'that', 'the', 'properties', 'required', 'of', 'an', 'abstract', 'sequential', 'product', 'as', 'introduced', 'by', 'gudder', 'and', 'greechie', 'are', 'not', 'enough', 'to', 'characterise', 'the', 'standard', 'sequential', 'product', 'acirc', 'b', 'sqrtabsqrta', 'on', 'an', 'operator', 'algebra', 'we', 'give', 'three', 'additional', 'properties', 'each', 'of', 'which', 'characterises', 'the', 'standard', 'sequential', 'product', 'on', 'either', 'a', 'von', 'neumann', 'algebra', 'or', 'a', 'euclidean', 'jordan', 'algebra', 'these', 'properties', 'are', '1', 'invariance', 'under', 'application', 'of', 'unital', 'order', 'isomorphisms', '2', 'symmetry', 'of', 'the', 'sequential', 'product', 'with', 'respect', 'to', 'a', 'certain', 'inner', 'product', 'and', '3', 'preservation', 'of', 'invertibility', 'of', 'the', 'effects', 'to', 'give', 'these', 'characterisations', 'we', 'first', 'have', 'to', 'study', 'convex', 'sigmasequential', 'effect', 'algebras', 'we', 'show', 'that', 'these', 'objects', 'correspond', 'to', 'unit', 'intervals', 'of', 'spectral', 'order', 'unit', 'spaces', 'with', 'a', 'homogeneous', 'positive', 'cone']]
|
[-0.11315813588100623, 0.07913976788475964, -0.06061241029357141, 0.06159561505296924, -0.09008728789135081, -0.11908058845819752, -0.021662321063827296, 0.40563828954434966, -0.3412439273212288, -0.22575828661907418, 0.18586875723777949, -0.24002425612301612, -0.10312980620503487, 0.14878509808208873, -0.10237207795020009, 0.037325027658314004, 0.053625759359479684, 0.10526502463340637, -0.1494984609536735, -0.2737476785178678, 0.39865116548980206, -0.006542234851398551, 0.2088175425840328, 0.01754848252300585, 0.08387081375437193, 0.024926063703892172, -0.016876296254760417, 0.030781824642708372, -0.16067378020324824, 0.12365954449843065, 0.2099946078455045, 0.12806002698812707, 0.2554139421687874, -0.41642297649389654, -0.1065100820918308, 0.16765675951772538, 0.09771177594046124, -0.025067948947133892, -0.016744600324586155, -0.27013529903163797, 0.10587952260813507, -0.21843184084921588, -0.06374565079487617, -0.10348369453205407, 0.03166176761179918, -0.01590953451451525, -0.2819316668558072, 0.02784715647824475, 0.13619232498735312, 0.08804338417000702, -0.09404537319511053, -0.09484219528566741, -0.04298372892281193, 0.10861007423621037, -0.019251135509980262, -0.0007418429003799426, 0.10423188689489253, -0.01737448731131974, -0.18543822665653023, 0.3522262648893062, -0.020665828667229928, -0.23955189087046463, 0.20501569147578624, -0.1882944571457376, -0.15113279460089618, 0.07057716929521717, 0.09525015875678051, 0.10950277954126235, -0.09865004225771447, 0.145077888551359, -0.08859933287546527, 0.09565203455963829, 0.08724411154837637, 0.05740728690937833, 0.12324058682253188, 0.07438826438833455, 0.09239526960395704, 0.17085713852906875, 0.024619843539797136, -0.0637437890729386, -0.3470482574165112, -0.19731789494513488, -0.10355148971325061, 0.11230206080594532, -0.0916560611028709, -0.21029129862541057, 0.3666010715189527, 0.07999698673451289, 0.2009425467704652, 0.07029665244426425, 0.21804714445062898, 0.09971404087741202, 0.13039078650715547, 0.0431432612698342, 0.1629822527928675, 0.2246468238795909, 0.01688817370163857, -0.1454905788643194, 0.028073340566584566, 0.15164577724320477]
|
1,803.08454
|
Origin of the monolayer Raman signature in hexagonal boron nitride: a
first-principles analysis
|
Monolayers of hexagonal boron nitride (h-BN) can in principle be identified
by a Raman signature, consisting of an upshift in the frequency of the E2g
vibrational mode with respect to the bulk value, but the origin of this shift
(intrinsic or support-induced) is still debated. Herein we use density
functional theory calculations to investigate whether there is an intrinsic
Raman shift in the h-BN monolayer in comparison with the bulk. There is
universal agreement among all tested functionals in predicting the magnitude of
the frequency shift upon a variation in the in-plane cell parameter. It is
clear that a small in-plane contraction can explain the Raman peak upshift from
bulk to monolayer. However, we show that the larger in-plane parameter in the
bulk (compared to the monolayer) results from non-local correlation effects,
which cannot be accounted for by local functionals or those with empirical
dispersion corrections. Using a non-local-correlation functional, we then
investigate the effect of finite temperatures on the Raman signature. We
demonstrate that bulk h-BN thermally expands in the direction perpendicular to
the layers, while the intralayer distances slightly contract, in agreement with
observed experimental behavior. Interestingly, the difference in in-plane cell
parameter between bulk and monolayer decreases with temperature, and becomes
very small at room temperature. We conclude that the different thermal
expansion of bulk and monolayer partially "erases" the intrinsic Raman
signature, accounting for its small magnitude in recent experiments on
suspended samples.
|
cond-mat.mtrl-sci
|
monolayers of hexagonal boron nitride hbn can in principle be identified by a raman signature consisting of an upshift in the frequency of the e2g vibrational mode with respect to the bulk value but the origin of this shift intrinsic or supportinduced is still debated herein we use density functional theory calculations to investigate whether there is an intrinsic raman shift in the hbn monolayer in comparison with the bulk there is universal agreement among all tested functionals in predicting the magnitude of the frequency shift upon a variation in the inplane cell parameter it is clear that a small inplane contraction can explain the raman peak upshift from bulk to monolayer however we show that the larger inplane parameter in the bulk compared to the monolayer results from nonlocal correlation effects which cannot be accounted for by local functionals or those with empirical dispersion corrections using a nonlocalcorrelation functional we then investigate the effect of finite temperatures on the raman signature we demonstrate that bulk hbn thermally expands in the direction perpendicular to the layers while the intralayer distances slightly contract in agreement with observed experimental behavior interestingly the difference in inplane cell parameter between bulk and monolayer decreases with temperature and becomes very small at room temperature we conclude that the different thermal expansion of bulk and monolayer partially erases the intrinsic raman signature accounting for its small magnitude in recent experiments on suspended samples
|
[['monolayers', 'of', 'hexagonal', 'boron', 'nitride', 'hbn', 'can', 'in', 'principle', 'be', 'identified', 'by', 'a', 'raman', 'signature', 'consisting', 'of', 'an', 'upshift', 'in', 'the', 'frequency', 'of', 'the', 'e2g', 'vibrational', 'mode', 'with', 'respect', 'to', 'the', 'bulk', 'value', 'but', 'the', 'origin', 'of', 'this', 'shift', 'intrinsic', 'or', 'supportinduced', 'is', 'still', 'debated', 'herein', 'we', 'use', 'density', 'functional', 'theory', 'calculations', 'to', 'investigate', 'whether', 'there', 'is', 'an', 'intrinsic', 'raman', 'shift', 'in', 'the', 'hbn', 'monolayer', 'in', 'comparison', 'with', 'the', 'bulk', 'there', 'is', 'universal', 'agreement', 'among', 'all', 'tested', 'functionals', 'in', 'predicting', 'the', 'magnitude', 'of', 'the', 'frequency', 'shift', 'upon', 'a', 'variation', 'in', 'the', 'inplane', 'cell', 'parameter', 'it', 'is', 'clear', 'that', 'a', 'small', 'inplane', 'contraction', 'can', 'explain', 'the', 'raman', 'peak', 'upshift', 'from', 'bulk', 'to', 'monolayer', 'however', 'we', 'show', 'that', 'the', 'larger', 'inplane', 'parameter', 'in', 'the', 'bulk', 'compared', 'to', 'the', 'monolayer', 'results', 'from', 'nonlocal', 'correlation', 'effects', 'which', 'can', 'not', 'be', 'accounted', 'for', 'by', 'local', 'functionals', 'or', 'those', 'with', 'empirical', 'dispersion', 'corrections', 'using', 'a', 'nonlocalcorrelation', 'functional', 'we', 'then', 'investigate', 'the', 'effect', 'of', 'finite', 'temperatures', 'on', 'the', 'raman', 'signature', 'we', 'demonstrate', 'that', 'bulk', 'hbn', 'thermally', 'expands', 'in', 'the', 'direction', 'perpendicular', 'to', 'the', 'layers', 'while', 'the', 'intralayer', 'distances', 'slightly', 'contract', 'in', 'agreement', 'with', 'observed', 'experimental', 'behavior', 'interestingly', 'the', 'difference', 'in', 'inplane', 'cell', 'parameter', 'between', 'bulk', 'and', 'monolayer', 'decreases', 'with', 'temperature', 'and', 'becomes', 'very', 'small', 'at', 'room', 'temperature', 'we', 'conclude', 'that', 'the', 'different', 'thermal', 'expansion', 'of', 'bulk', 'and', 'monolayer', 'partially', 'erases', 'the', 'intrinsic', 'raman', 'signature', 'accounting', 'for', 'its', 'small', 'magnitude', 'in', 'recent', 'experiments', 'on', 'suspended', 'samples']]
|
[-0.12215848385743766, 0.18170660910548295, -0.04987439039718954, -0.013078002098697323, -0.025201399974963245, -0.10213537307401352, 0.0948775614736046, 0.4470484159620745, -0.283888451141543, -0.2753281303548876, -0.004775353112089753, -0.3228858867894952, -0.13554916627403787, 0.1891317829164919, 0.01436239663714997, -0.0059282976599359305, -0.003649639562476708, -0.030760870173528493, -0.07896566279662945, -0.17522847836351946, 0.2648708152999522, 0.06068716768347541, 0.3542809186223503, 0.08823315379162859, 0.028231437129218977, -0.03793765637635238, 0.05160519115415504, 0.06849752226159633, -0.160739775610713, 0.0629159554062869, 0.2406315824678246, -0.10822196179382629, 0.22774043393873086, -0.4358001247737087, -0.2159472829119318, 0.04750531548516778, 0.12625623566877223, 0.14818174504536055, -0.05365713547911307, -0.21939928925150082, 0.08122068082379616, -0.11301093883988518, -0.09996480182470645, -0.07327971061566423, 0.013785382500896622, -0.03712125823753808, -0.2128605292268692, 0.153636947237278, 0.016445769494039423, 0.06355504261130078, -0.11971448764484767, -0.120537140758849, -0.10935523277422522, 0.05615565772442257, 0.08587631368187859, 0.03167925893325171, 0.17678398886370716, -0.08759587436440956, -0.07957677923579712, 0.3939547863859339, -0.11706059338953424, -0.10571603551252644, 0.16288930155970782, -0.1988525656717164, -0.06825707598830018, 0.14160289865049744, 0.09293122343379542, 0.08540053745074307, -0.11081021912410628, 0.06055923965060105, -0.006565263540339226, 0.21793927818031966, 0.10206618166661688, 0.08343809404738879, 0.22115811542583386, 0.17499795973011362, 0.04115852911197463, 0.1276020099264139, -0.10860870519316435, -0.014918541679053153, -0.22672521146434993, -0.14749034092479832, -0.20313006313603288, 0.057482311912059506, -0.12039558890946024, -0.19032335346721174, 0.37781948226449247, 0.13657878086307407, 0.20670012880445404, -0.014131902846675991, 0.2787481488507366, 0.13066472692665557, 0.11288824380363706, 0.019274949084403886, 0.3173916773682758, 0.14390976952208878, 0.06999454780642193, -0.27601463716387153, 0.0979692206880422, -0.010963258829492168]
|
1,803.08455
|
AdS-phobia, the WGC, the Standard Model and Supersymmetry
|
It has been recently argued that an embedding of the SM into a consistent
theory of quantum gravity may imply important constraints on the mass of the
lightest neutrino and the cosmological constant $\Lambda_{4}$. The constraints
come from imposing the absence of any non-SUSY AdS stable vacua obtained from
any consistent compactification of the SM to 3 or 2 dimensions. This condition
comes as a corollary of a recent extension of the Weak Gravity Conjecture (WGC)
by Ooguri and Vafa. In this paper we study $T^2/Z_N$ compactifications of the
SM to two dimensions in which SM Wilson lines are projected out, leading to a
considerable simplification. We analyze in detail a $T^ 2/Z_4$ compactification
of the SM in which both complex structure and Wilson line scalars are fixed and
the potential is only a function of the area of the torus $a^2$. We find that
the SM is not robust against the appearance of AdS vacua in 2D and hence would
be by itself inconsistent with quantum gravity. On the contrary, if the SM is
embedded at some scale $M_{SS}$ into a SUSY version like the MSSM, the AdS
vacua present in the non-SUSY case disappear or become unstable. This means
that WGC arguments favor a SUSY version of the SM, independently of the usual
hierarchy problem arguments. In a $T^2/Z_4$ compactification in which the
orbifold action is embedded into the $B-L$ symmetry the bounds on neutrino
masses and the cosmological constant are recovered. This suggests that the MSSM
should be extended with a $U(1)_{B-L}$ gauge group. In other families of vacua
the spectrum of SUSY particles is further constrained in order to avoid the
appearance of new AdS vacua or instabilities. We discuss a possible
understanding of the little hierarchy problem in this context.
|
hep-th hep-ph
|
it has been recently argued that an embedding of the sm into a consistent theory of quantum gravity may imply important constraints on the mass of the lightest neutrino and the cosmological constant lambda_4 the constraints come from imposing the absence of any nonsusy ads stable vacua obtained from any consistent compactification of the sm to 3 or 2 dimensions this condition comes as a corollary of a recent extension of the weak gravity conjecture wgc by ooguri and vafa in this paper we study t2z_n compactifications of the sm to two dimensions in which sm wilson lines are projected out leading to a considerable simplification we analyze in detail a t 2z_4 compactification of the sm in which both complex structure and wilson line scalars are fixed and the potential is only a function of the area of the torus a2 we find that the sm is not robust against the appearance of ads vacua in 2d and hence would be by itself inconsistent with quantum gravity on the contrary if the sm is embedded at some scale m_ss into a susy version like the mssm the ads vacua present in the nonsusy case disappear or become unstable this means that wgc arguments favor a susy version of the sm independently of the usual hierarchy problem arguments in a t2z_4 compactification in which the orbifold action is embedded into the bl symmetry the bounds on neutrino masses and the cosmological constant are recovered this suggests that the mssm should be extended with a u1_bl gauge group in other families of vacua the spectrum of susy particles is further constrained in order to avoid the appearance of new ads vacua or instabilities we discuss a possible understanding of the little hierarchy problem in this context
|
[['it', 'has', 'been', 'recently', 'argued', 'that', 'an', 'embedding', 'of', 'the', 'sm', 'into', 'a', 'consistent', 'theory', 'of', 'quantum', 'gravity', 'may', 'imply', 'important', 'constraints', 'on', 'the', 'mass', 'of', 'the', 'lightest', 'neutrino', 'and', 'the', 'cosmological', 'constant', 'lambda_4', 'the', 'constraints', 'come', 'from', 'imposing', 'the', 'absence', 'of', 'any', 'nonsusy', 'ads', 'stable', 'vacua', 'obtained', 'from', 'any', 'consistent', 'compactification', 'of', 'the', 'sm', 'to', '3', 'or', '2', 'dimensions', 'this', 'condition', 'comes', 'as', 'a', 'corollary', 'of', 'a', 'recent', 'extension', 'of', 'the', 'weak', 'gravity', 'conjecture', 'wgc', 'by', 'ooguri', 'and', 'vafa', 'in', 'this', 'paper', 'we', 'study', 't2z_n', 'compactifications', 'of', 'the', 'sm', 'to', 'two', 'dimensions', 'in', 'which', 'sm', 'wilson', 'lines', 'are', 'projected', 'out', 'leading', 'to', 'a', 'considerable', 'simplification', 'we', 'analyze', 'in', 'detail', 'a', 't', '2z_4', 'compactification', 'of', 'the', 'sm', 'in', 'which', 'both', 'complex', 'structure', 'and', 'wilson', 'line', 'scalars', 'are', 'fixed', 'and', 'the', 'potential', 'is', 'only', 'a', 'function', 'of', 'the', 'area', 'of', 'the', 'torus', 'a2', 'we', 'find', 'that', 'the', 'sm', 'is', 'not', 'robust', 'against', 'the', 'appearance', 'of', 'ads', 'vacua', 'in', '2d', 'and', 'hence', 'would', 'be', 'by', 'itself', 'inconsistent', 'with', 'quantum', 'gravity', 'on', 'the', 'contrary', 'if', 'the', 'sm', 'is', 'embedded', 'at', 'some', 'scale', 'm_ss', 'into', 'a', 'susy', 'version', 'like', 'the', 'mssm', 'the', 'ads', 'vacua', 'present', 'in', 'the', 'nonsusy', 'case', 'disappear', 'or', 'become', 'unstable', 'this', 'means', 'that', 'wgc', 'arguments', 'favor', 'a', 'susy', 'version', 'of', 'the', 'sm', 'independently', 'of', 'the', 'usual', 'hierarchy', 'problem', 'arguments', 'in', 'a', 't2z_4', 'compactification', 'in', 'which', 'the', 'orbifold', 'action', 'is', 'embedded', 'into', 'the', 'bl', 'symmetry', 'the', 'bounds', 'on', 'neutrino', 'masses', 'and', 'the', 'cosmological', 'constant', 'are', 'recovered', 'this', 'suggests', 'that', 'the', 'mssm', 'should', 'be', 'extended', 'with', 'a', 'u1_bl', 'gauge', 'group', 'in', 'other', 'families', 'of', 'vacua', 'the', 'spectrum', 'of', 'susy', 'particles', 'is', 'further', 'constrained', 'in', 'order', 'to', 'avoid', 'the', 'appearance', 'of', 'new', 'ads', 'vacua', 'or', 'instabilities', 'we', 'discuss', 'a', 'possible', 'understanding', 'of', 'the', 'little', 'hierarchy', 'problem', 'in', 'this', 'context']]
|
[-0.1312791650476715, 0.17460177751495795, -0.07018576415561763, 0.14915518292232233, -0.08692596988676458, -0.1701649149117966, 0.02697921935136297, 0.2839912369342039, -0.19257410084131826, -0.27552545057106004, 0.11877757170258191, -0.2524313421652266, -0.10295160102331694, 0.11903241736779534, -0.07368970576113051, -0.002034519506035512, 0.0006010866182267057, 0.032066806556885034, -0.08266143231525175, -0.2721281820982631, 0.33885447416600273, 0.03811648260678488, 0.22560041251459292, 0.05640727132685533, 0.05758789928668007, -0.04211946001488614, -0.006930965592856614, 0.015364306340576941, -0.1187570506369665, 0.1161217054543814, 0.168669068327389, 0.09698046571394939, 0.1601108631561035, -0.39043139041952635, -0.2310526759417563, 0.14830888593236782, 0.17196170104110017, 0.13252897851357592, -0.048966900662611695, -0.30144570318769764, 0.09137607883459249, -0.16307159653329448, -0.14158627743790003, -0.03550991199342027, -0.03382010820169686, -0.13091186865559165, -0.2660483412999346, 0.04818895492753407, 0.029086647159261566, 0.015890393998524568, -0.04070795788611824, -0.0958039414242138, -0.07567025854752786, 0.02786436804243978, 0.1786222422082091, 0.03216664191275252, 0.10565623141497335, -0.16992668362534732, -0.12766352168254264, 0.42570566759147005, -0.07830197846581906, -0.1925773048690452, 0.1617386962111317, -0.1525135141940705, -0.18596569669938195, 0.10942050435937281, 0.10620970650873825, 0.11317819111119658, -0.09149726746991106, 0.23849719600097852, -0.07518891988759291, 0.16319807016030968, 0.08053072603881917, 0.034707008491168874, 0.2862358839982854, 0.12953565708047957, 0.07869240392290917, 0.08083307885027928, -0.021918293482269206, -0.1095266251598697, -0.3947646049054048, -0.15176132759419872, -0.09869501041565217, 0.09410257373630983, -0.11117575190702793, -0.14907741784569523, 0.3685455385367481, 0.12969467855655734, 0.21964564359727867, 0.040079797749850286, 0.2307609350588426, 0.06533516363239195, 0.09821414333280354, 0.028856215692049235, 0.2836225260098403, 0.09380683421012177, 0.08591775919332922, -0.2163882866613868, -0.057734927361899176, 0.13175092989635862]
|
1,803.08456
|
Deep Reinforcement Learning with Model Learning and Monte Carlo Tree
Search in Minecraft
|
Deep reinforcement learning has been successfully applied to several
visual-input tasks using model-free methods. In this paper, we propose a
model-based approach that combines learning a DNN-based transition model with
Monte Carlo tree search to solve a block-placing task in Minecraft. Our learned
transition model predicts the next frame and the rewards one step ahead given
the last four frames of the agent's first-person-view image and the current
action. Then a Monte Carlo tree search algorithm uses this model to plan the
best sequence of actions for the agent to perform. On the proposed task in
Minecraft, our model-based approach reaches the performance comparable to the
Deep Q-Network's, but learns faster and, thus, is more training sample
efficient.
|
cs.AI cs.LG stat.ML
|
deep reinforcement learning has been successfully applied to several visualinput tasks using modelfree methods in this paper we propose a modelbased approach that combines learning a dnnbased transition model with monte carlo tree search to solve a blockplacing task in minecraft our learned transition model predicts the next frame and the rewards one step ahead given the last four frames of the agents firstpersonview image and the current action then a monte carlo tree search algorithm uses this model to plan the best sequence of actions for the agent to perform on the proposed task in minecraft our modelbased approach reaches the performance comparable to the deep qnetworks but learns faster and thus is more training sample efficient
|
[['deep', 'reinforcement', 'learning', 'has', 'been', 'successfully', 'applied', 'to', 'several', 'visualinput', 'tasks', 'using', 'modelfree', 'methods', 'in', 'this', 'paper', 'we', 'propose', 'a', 'modelbased', 'approach', 'that', 'combines', 'learning', 'a', 'dnnbased', 'transition', 'model', 'with', 'monte', 'carlo', 'tree', 'search', 'to', 'solve', 'a', 'blockplacing', 'task', 'in', 'minecraft', 'our', 'learned', 'transition', 'model', 'predicts', 'the', 'next', 'frame', 'and', 'the', 'rewards', 'one', 'step', 'ahead', 'given', 'the', 'last', 'four', 'frames', 'of', 'the', 'agents', 'firstpersonview', 'image', 'and', 'the', 'current', 'action', 'then', 'a', 'monte', 'carlo', 'tree', 'search', 'algorithm', 'uses', 'this', 'model', 'to', 'plan', 'the', 'best', 'sequence', 'of', 'actions', 'for', 'the', 'agent', 'to', 'perform', 'on', 'the', 'proposed', 'task', 'in', 'minecraft', 'our', 'modelbased', 'approach', 'reaches', 'the', 'performance', 'comparable', 'to', 'the', 'deep', 'qnetworks', 'but', 'learns', 'faster', 'and', 'thus', 'is', 'more', 'training', 'sample', 'efficient']]
|
[0.020658730973651552, 7.047453976195791e-05, -0.12318145628036607, 0.06517884829992672, -0.13076666631614384, -0.17222398287900118, 0.08243092717400388, 0.4991912303087504, -0.2738472810420005, -0.3486268636244147, 0.05379490064072382, -0.24813807065720145, -0.1817678009301586, 0.16828133403728512, -0.095134810342089, 0.11000263701577712, 0.14064878386688298, 0.060903567039286316, -0.06147388852525341, -0.2979381177898334, 0.24556872143774577, 0.07246973427447854, 0.31314309891313313, -0.0703424862059562, 0.1980651543111257, -0.0012860553136662296, 0.0026669104340607706, -0.03561995666798042, -0.07211424517071978, 0.15534018102385427, 0.32067063092659026, 0.21031145511964416, 0.3721335009995686, -0.3985093162999281, -0.2017542501344629, 0.12322073451283833, 0.1553576891755928, 0.14348936032341875, -0.03687896138909982, -0.32563309654917405, 0.06172828035651828, -0.19941942998835735, 0.025189367155341997, -0.1280821198273612, -0.06264655939708261, -0.07067526126199443, -0.3118457693444646, -0.014788772870341072, 0.056685966439545155, -0.001640252736599549, -0.04887470742485121, -0.11342882947267398, 0.06574601144327417, 0.1492966016633031, 0.034962497668786216, 0.13669772999685095, 0.1567364631180206, -0.15261548721514967, -0.22472917703587725, 0.35583220185792963, -0.06848796301764315, -0.15740205093853823, 0.2005640192605231, -0.03292608511350725, -0.16954521302781675, 0.1217535389141868, 0.2456752254617522, 0.19596887482735126, -0.17969149330468928, 0.023217115347253403, -0.020219519920647144, 0.15389653446719698, -0.039601986490837904, -0.11541644438858266, 0.1448645446550749, 0.33389263276577646, 0.06614807192641108, 0.14192202177870533, -0.1258666662722016, -0.1477863784555508, -0.1979291047334023, -0.12515486840806578, -0.18284513748291395, -0.07516988223904501, -0.09890433049358367, -0.12490657298299282, 0.403068814718205, 0.3115851554128787, 0.19052031762169108, 0.16837169439734323, 0.369409696749695, 0.048954974084525656, 0.09272084879010672, 0.11197364459360909, 0.20341266491855292, 0.010673434068651302, 0.12127050527411959, -0.19893458519616852, 0.10357952693720227, 0.11291303683031836]
|
1,803.08457
|
Clustering-driven Deep Embedding with Pairwise Constraints
|
Recently, there has been increasing interest to leverage the competence of
neural networks to analyze data. In particular, new clustering methods that
employ deep embeddings have been presented. In this paper, we depart from
centroid-based models and suggest a new framework, called Clustering-driven
deep embedding with PAirwise Constraints (CPAC), for non-parametric clustering
using a neural network. We present a clustering-driven embedding based on a
Siamese network that encourages pairs of data points to output similar
representations in the latent space. Our pair-based model allows augmenting the
information with labeled pairs to constitute a semi-supervised framework. Our
approach is based on analyzing the losses associated with each pair to refine
the set of constraints. We show that clustering performance increases when
using this scheme, even with a limited amount of user queries. We demonstrate
how our architecture is adapted for various types of data and present the first
deep framework to cluster 3D shapes.
|
cs.CV
|
recently there has been increasing interest to leverage the competence of neural networks to analyze data in particular new clustering methods that employ deep embeddings have been presented in this paper we depart from centroidbased models and suggest a new framework called clusteringdriven deep embedding with pairwise constraints cpac for nonparametric clustering using a neural network we present a clusteringdriven embedding based on a siamese network that encourages pairs of data points to output similar representations in the latent space our pairbased model allows augmenting the information with labeled pairs to constitute a semisupervised framework our approach is based on analyzing the losses associated with each pair to refine the set of constraints we show that clustering performance increases when using this scheme even with a limited amount of user queries we demonstrate how our architecture is adapted for various types of data and present the first deep framework to cluster 3d shapes
|
[['recently', 'there', 'has', 'been', 'increasing', 'interest', 'to', 'leverage', 'the', 'competence', 'of', 'neural', 'networks', 'to', 'analyze', 'data', 'in', 'particular', 'new', 'clustering', 'methods', 'that', 'employ', 'deep', 'embeddings', 'have', 'been', 'presented', 'in', 'this', 'paper', 'we', 'depart', 'from', 'centroidbased', 'models', 'and', 'suggest', 'a', 'new', 'framework', 'called', 'clusteringdriven', 'deep', 'embedding', 'with', 'pairwise', 'constraints', 'cpac', 'for', 'nonparametric', 'clustering', 'using', 'a', 'neural', 'network', 'we', 'present', 'a', 'clusteringdriven', 'embedding', 'based', 'on', 'a', 'siamese', 'network', 'that', 'encourages', 'pairs', 'of', 'data', 'points', 'to', 'output', 'similar', 'representations', 'in', 'the', 'latent', 'space', 'our', 'pairbased', 'model', 'allows', 'augmenting', 'the', 'information', 'with', 'labeled', 'pairs', 'to', 'constitute', 'a', 'semisupervised', 'framework', 'our', 'approach', 'is', 'based', 'on', 'analyzing', 'the', 'losses', 'associated', 'with', 'each', 'pair', 'to', 'refine', 'the', 'set', 'of', 'constraints', 'we', 'show', 'that', 'clustering', 'performance', 'increases', 'when', 'using', 'this', 'scheme', 'even', 'with', 'a', 'limited', 'amount', 'of', 'user', 'queries', 'we', 'demonstrate', 'how', 'our', 'architecture', 'is', 'adapted', 'for', 'various', 'types', 'of', 'data', 'and', 'present', 'the', 'first', 'deep', 'framework', 'to', 'cluster', '3d', 'shapes']]
|
[-0.03548803908129533, -0.01891355460509658, -0.09811289174947888, 0.06039789189584553, -0.12796785117282222, -0.13422307609270015, 0.056966276868091276, 0.4432755111157894, -0.2708803873322904, -0.3201365755063792, 0.03197917224606499, -0.2858691928986809, -0.21289454444001119, 0.17262418946096053, -0.10252057747294506, 0.06369409307527045, 0.12942825721479798, 0.04200074755121022, -0.06583137402621408, -0.27230865878984334, 0.3721831106596316, 0.026501489574438892, 0.34744891406347356, 0.00023407734309633573, 0.1375908679383186, 0.0031197514509161313, -0.04185405190723638, 0.041103704062406904, -0.08297588683892779, 0.23875782294664533, 0.26259478932045266, 0.22529719879850746, 0.3187423187882329, -0.4168254053949689, -0.2703303645510459, 0.13203486907606324, 0.14510604409035296, 0.13430682908588398, -0.06389228507410735, -0.3128172665430854, 0.1197711942201325, -0.19230270065367222, 0.0147886191525807, -0.14707446709275246, -0.029577834225104502, 0.025896228731920323, -0.3041464336651067, 0.002430651041989525, 0.045610532513819635, 0.02356369676689307, -0.05217381410649977, -0.09306936978517721, 0.021580107170933237, 0.12782910805447803, 0.006720335330658903, 0.05962580108627056, 0.0696541579409192, -0.12890581025741996, -0.14989024982477228, 0.33292522594332696, -0.06964399792409191, -0.2184339974510173, 0.19623261062117914, -0.04141936472229039, -0.2144041173387086, 0.0778673757147044, 0.2605639737312837, 0.10911922527166705, -0.16592482075376513, 0.03112797441969936, -0.07273938500788063, 0.17476147917021687, -0.009846991263329982, 0.00421330937029173, 0.18032015500745427, 0.2848765033452461, 0.02917132244911045, 0.1771768066807029, -0.1396255162965584, -0.05566637990646996, -0.22670196766654652, -0.09243473569552103, -0.19244492191045234, -0.05699234869874393, -0.09693764529171554, -0.13421641007065774, 0.3979114600667526, 0.22858511440455914, 0.284322353148212, 0.12186692152793209, 0.30700315470496814, 0.04730107264447724, 0.12427977467266221, 0.11019521374876301, 0.19093080607553323, 0.04933758318424225, 0.08806403481091062, -0.13642897123936565, 0.06500898594036698, 0.0553965670382604]
|
1,803.08458
|
Evaluation of Beam Halo from Beam-Gas Scattering at the KEK-ATF
|
In circular colliders, as well as in damping rings and synchrotron radiation
light sources, beam halo is one of the critical issues limiting the performance
as well as potentially causing component damage and activation. It is
imperative to clearly understand the mechanisms that lead to halo formation and
to test the available theoretical models. Elastic beam-gas scattering can drive
particles to large oscillation amplitudes and be a potential source of beam
halo. In this paper, numerical estimation and Monte Carlo simulations of this
process at the ATF of KEK are presented. Experimental measurements of beam halo
in the ATF2 beam line using a diamond sensor detector are also described, which
clearly demonstrates the influence of the beam-gas scattering process on the
transverse halo distribution.
|
physics.acc-ph
|
in circular colliders as well as in damping rings and synchrotron radiation light sources beam halo is one of the critical issues limiting the performance as well as potentially causing component damage and activation it is imperative to clearly understand the mechanisms that lead to halo formation and to test the available theoretical models elastic beamgas scattering can drive particles to large oscillation amplitudes and be a potential source of beam halo in this paper numerical estimation and monte carlo simulations of this process at the atf of kek are presented experimental measurements of beam halo in the atf2 beam line using a diamond sensor detector are also described which clearly demonstrates the influence of the beamgas scattering process on the transverse halo distribution
|
[['in', 'circular', 'colliders', 'as', 'well', 'as', 'in', 'damping', 'rings', 'and', 'synchrotron', 'radiation', 'light', 'sources', 'beam', 'halo', 'is', 'one', 'of', 'the', 'critical', 'issues', 'limiting', 'the', 'performance', 'as', 'well', 'as', 'potentially', 'causing', 'component', 'damage', 'and', 'activation', 'it', 'is', 'imperative', 'to', 'clearly', 'understand', 'the', 'mechanisms', 'that', 'lead', 'to', 'halo', 'formation', 'and', 'to', 'test', 'the', 'available', 'theoretical', 'models', 'elastic', 'beamgas', 'scattering', 'can', 'drive', 'particles', 'to', 'large', 'oscillation', 'amplitudes', 'and', 'be', 'a', 'potential', 'source', 'of', 'beam', 'halo', 'in', 'this', 'paper', 'numerical', 'estimation', 'and', 'monte', 'carlo', 'simulations', 'of', 'this', 'process', 'at', 'the', 'atf', 'of', 'kek', 'are', 'presented', 'experimental', 'measurements', 'of', 'beam', 'halo', 'in', 'the', 'atf2', 'beam', 'line', 'using', 'a', 'diamond', 'sensor', 'detector', 'are', 'also', 'described', 'which', 'clearly', 'demonstrates', 'the', 'influence', 'of', 'the', 'beamgas', 'scattering', 'process', 'on', 'the', 'transverse', 'halo', 'distribution']]
|
[-0.05920335641431232, 0.14293079660461855, -0.11513926794437031, 0.09468145518307973, -0.051493207976642634, -0.10359767195768654, -0.004957514652614331, 0.42347589849434314, -0.23539153467713586, -0.32690972143093183, 0.06336661612459143, -0.3252878706421583, -0.030769988286098646, 0.2302207013192181, 0.03318728049165539, 0.10215968387990049, 0.06989388209166786, -0.06387721060685092, 0.012988245525893064, -0.18574018002442655, 0.2794865623544601, 0.1925029545729499, 0.27993667158748836, 0.09432083202691208, 0.08822542150324632, 0.013940868148159596, -0.014586945447409827, -0.031298606555097766, -0.08712878744072147, 0.02039907751755128, 0.26348246784164076, 0.0903422593161644, 0.16240234283970728, -0.410700915636675, -0.2194398433465751, 0.07893732361375325, 0.19664005932187842, 0.10601242891448971, -0.07933644302219393, -0.2427607454930342, 0.02805624643881475, -0.1928101943039726, -0.17150488932947477, -0.008026470197364688, -0.040552728092147695, 0.06949476483503296, -0.27178305689050186, 0.07950317697959103, 0.014066478757623343, 0.03953513130545616, -0.01766942880461894, -0.12131581752891502, -0.015239854095383518, 0.0423550792273149, 0.06685245840954819, 0.03977870636604606, 0.23584236340191697, -0.1270120345439101, -0.11077509424273646, 0.3960441087894592, -0.015147216358943092, -0.13224853567718978, 0.1710448303356609, -0.1974622993711232, -0.07604792074961288, 0.13446085576358582, 0.21931590978807258, 0.08086913540178249, -0.17608479688374978, 0.0006593959439464191, 0.029073663975014503, 0.1442764199999792, 0.079656123108561, 0.0061359482239030545, 0.23529652985481306, 0.21160639630210015, 0.03545666986235207, 0.1318236803443494, -0.17641755620734917, -0.04643766195776181, -0.32083235893608825, -0.09076291993410597, -0.14880528479003377, 0.014448247035034001, -0.032835390649134134, -0.14806937145758345, 0.3807012630145877, 0.16661182588206663, 0.18648911382432184, -0.01174509910502351, 0.3612075193875259, 0.07933552283324272, 0.08080777659591648, 0.015291194010886454, 0.27697072166108316, 0.15550523538014763, 0.0968419638680174, -0.27832366098769973, 0.0739739700070312, -0.07072605203363984]
|
1,803.08459
|
Frieze varieties : A characterization of the finite-tame-wild trichotomy
for acyclic quivers
|
We introduce a new class of algebraic varieties which we call frieze
varieties. Each frieze variety is determined by an acyclic quiver. The frieze
variety is defined in an elementary recursive way by constructing a set of
points in affine space. From a more conceptual viewpoint, the coordinates of
these points are specializations of cluster variables in the cluster algebra
associated to the quiver.
We give a new characterization of the finite--tame--wild trichotomy for
acyclic quivers in terms of their frieze varieties. We show that an acyclic
quiver is representation finite, tame, or wild, respectively, if and only if
the dimension of its frieze variety is $0,1$, or $\ge2$, respectively.
|
math.RT math.AG math.CO
|
we introduce a new class of algebraic varieties which we call frieze varieties each frieze variety is determined by an acyclic quiver the frieze variety is defined in an elementary recursive way by constructing a set of points in affine space from a more conceptual viewpoint the coordinates of these points are specializations of cluster variables in the cluster algebra associated to the quiver we give a new characterization of the finitetamewild trichotomy for acyclic quivers in terms of their frieze varieties we show that an acyclic quiver is representation finite tame or wild respectively if and only if the dimension of its frieze variety is 01 or ge2 respectively
|
[['we', 'introduce', 'a', 'new', 'class', 'of', 'algebraic', 'varieties', 'which', 'we', 'call', 'frieze', 'varieties', 'each', 'frieze', 'variety', 'is', 'determined', 'by', 'an', 'acyclic', 'quiver', 'the', 'frieze', 'variety', 'is', 'defined', 'in', 'an', 'elementary', 'recursive', 'way', 'by', 'constructing', 'a', 'set', 'of', 'points', 'in', 'affine', 'space', 'from', 'a', 'more', 'conceptual', 'viewpoint', 'the', 'coordinates', 'of', 'these', 'points', 'are', 'specializations', 'of', 'cluster', 'variables', 'in', 'the', 'cluster', 'algebra', 'associated', 'to', 'the', 'quiver', 'we', 'give', 'a', 'new', 'characterization', 'of', 'the', 'finitetamewild', 'trichotomy', 'for', 'acyclic', 'quivers', 'in', 'terms', 'of', 'their', 'frieze', 'varieties', 'we', 'show', 'that', 'an', 'acyclic', 'quiver', 'is', 'representation', 'finite', 'tame', 'or', 'wild', 'respectively', 'if', 'and', 'only', 'if', 'the', 'dimension', 'of', 'its', 'frieze', 'variety', 'is', '01', 'or', 'ge2', 'respectively']]
|
[-0.17175507713258778, 0.10487121723764768, -0.08424379884205553, 0.055718466558348424, -0.14697644180712213, -0.1428005734005721, 0.015584119176919308, 0.35988466571503824, -0.3983939881650133, -0.21518115627519582, 0.07174238314160035, -0.1831724214871679, -0.21476379305673252, 0.16513110076530127, -0.23811973157176458, -0.08820508041797172, 0.056483700566010875, 0.09461114565850398, -0.05851070450644496, -0.36640942659562264, 0.4275689384464277, -0.07195417654760387, 0.21648491995298055, 0.003752982372059188, 0.12778802498867478, 0.07924953158175864, -0.02902511207796975, 0.02994303418501759, -0.12907768810124387, 0.14057566259705692, 0.31879094255011564, 0.15238141856976536, 0.17218173293443823, -0.3372579255747959, -0.0964953552471226, 0.2055641411111579, 0.17061697113020088, 0.10888107900332591, -0.024481947135010416, -0.2784932748064262, 0.10826441376478574, -0.18453932699209097, -0.16650038208906462, -0.06335042441827715, 0.11589339022618642, 0.049330129587185495, -0.24142685845289208, -0.04094552440107416, 0.0741058205288553, 0.17641952182721654, -0.05727915712439993, -0.1359598167537532, -0.07086985155837525, 0.05782863244290438, -0.09924498842516487, 0.06125145829325422, 0.056365442782674635, -0.1553761705461411, -0.1963467742700916, 0.33842954383479484, 0.03398922782117894, -0.21557393358724508, 0.1564154286330583, -0.1285915153118175, -0.1852145316079259, 0.1407249504273091, 0.09463628135069375, 0.12148678834216857, -0.07045662279215155, 0.1500406045666383, -0.1857761893092458, 0.031456487431669386, 0.12853455072303022, -0.014238817665358543, 0.15930584317432084, 0.12825538076614157, 0.057059538416103076, 0.14277138639617404, -0.0042436816435896816, -0.03150811056615016, -0.3158736314385309, -0.15228371770300586, -0.11014094605076409, 0.09920341213908765, -0.18713369985191694, -0.20338242245974755, 0.3934702797827029, 0.08664700817829425, 0.2116499334625011, 0.13332141501030143, 0.13747652975517674, 0.07818956113403873, 0.030573026471506427, 0.05711477736455448, 0.06621048974573886, 0.22424234612631277, -0.05622460632456826, -0.11656301195408568, 0.027707709663829537, 0.21772624240812222]
|
1,803.0846
|
Towards Universal Representation for Unseen Action Recognition
|
Unseen Action Recognition (UAR) aims to recognise novel action categories
without training examples. While previous methods focus on inner-dataset
seen/unseen splits, this paper proposes a pipeline using a large-scale training
source to achieve a Universal Representation (UR) that can generalise to a more
realistic Cross-Dataset UAR (CD-UAR) scenario. We first address UAR as a
Generalised Multiple-Instance Learning (GMIL) problem and discover
'building-blocks' from the large-scale ActivityNet dataset using distribution
kernels. Essential visual and semantic components are preserved in a shared
space to achieve the UR that can efficiently generalise to new datasets.
Predicted UR exemplars can be improved by a simple semantic adaptation, and
then an unseen action can be directly recognised using UR during the test.
Without further training, extensive experiments manifest significant
improvements over the UCF101 and HMDB51 benchmarks.
|
cs.CV cs.AI cs.LG cs.MM
|
unseen action recognition uar aims to recognise novel action categories without training examples while previous methods focus on innerdataset seenunseen splits this paper proposes a pipeline using a largescale training source to achieve a universal representation ur that can generalise to a more realistic crossdataset uar cduar scenario we first address uar as a generalised multipleinstance learning gmil problem and discover buildingblocks from the largescale activitynet dataset using distribution kernels essential visual and semantic components are preserved in a shared space to achieve the ur that can efficiently generalise to new datasets predicted ur exemplars can be improved by a simple semantic adaptation and then an unseen action can be directly recognised using ur during the test without further training extensive experiments manifest significant improvements over the ucf101 and hmdb51 benchmarks
|
[['unseen', 'action', 'recognition', 'uar', 'aims', 'to', 'recognise', 'novel', 'action', 'categories', 'without', 'training', 'examples', 'while', 'previous', 'methods', 'focus', 'on', 'innerdataset', 'seenunseen', 'splits', 'this', 'paper', 'proposes', 'a', 'pipeline', 'using', 'a', 'largescale', 'training', 'source', 'to', 'achieve', 'a', 'universal', 'representation', 'ur', 'that', 'can', 'generalise', 'to', 'a', 'more', 'realistic', 'crossdataset', 'uar', 'cduar', 'scenario', 'we', 'first', 'address', 'uar', 'as', 'a', 'generalised', 'multipleinstance', 'learning', 'gmil', 'problem', 'and', 'discover', 'buildingblocks', 'from', 'the', 'largescale', 'activitynet', 'dataset', 'using', 'distribution', 'kernels', 'essential', 'visual', 'and', 'semantic', 'components', 'are', 'preserved', 'in', 'a', 'shared', 'space', 'to', 'achieve', 'the', 'ur', 'that', 'can', 'efficiently', 'generalise', 'to', 'new', 'datasets', 'predicted', 'ur', 'exemplars', 'can', 'be', 'improved', 'by', 'a', 'simple', 'semantic', 'adaptation', 'and', 'then', 'an', 'unseen', 'action', 'can', 'be', 'directly', 'recognised', 'using', 'ur', 'during', 'the', 'test', 'without', 'further', 'training', 'extensive', 'experiments', 'manifest', 'significant', 'improvements', 'over', 'the', 'ucf101', 'and', 'hmdb51', 'benchmarks']]
|
[-0.03433634415432607, 0.023868211800731842, -0.09567066110685118, 0.08866358395880525, -0.13998610866474337, -0.1683476463331317, 0.026120732091840182, 0.4317699064849876, -0.25072069989255397, -0.36536570895987097, 0.06298757880631456, -0.22914054393459082, -0.18344129285833333, 0.21335532229568344, -0.20367674341105158, 0.04091025338493637, 0.1687898192249122, 0.04658995648878772, -0.10269437906390522, -0.295542153329734, 0.3044027578434907, 0.0269558799227525, 0.31773491493368056, 0.018202191937234602, 0.12919790187152103, -0.07802740182887646, -0.034476713111871504, -0.0002717111785841553, -0.01735866440378686, 0.14513673562396434, 0.29370617980930547, 0.2008949834453233, 0.28881964214815525, -0.3660055587606621, -0.21798247842434648, 0.12519811340462184, 0.17790770158535452, 0.09727496989501105, -0.021399965982368485, -0.4118096955426154, 0.10153484269540058, -0.20030673590372317, 0.02002247150085168, -0.17105265107238665, -0.02337561419699341, -0.048967356023695174, -0.3233061136324977, 0.03357010912623082, 0.07165978220655234, 0.0741059111096547, -0.07167184211175481, -0.08075075190208736, 0.01870802716439357, 0.19535933802035288, -0.01648516268323874, 0.08667155191142228, 0.12191304388034041, -0.17952924077508214, -0.16816414967252058, 0.3897435160615714, -0.11311977915102034, -0.19653968854618142, 0.22769954319664976, -0.006773177935428976, -0.1415599949468742, 0.06183145439354121, 0.25698068780729955, 0.1426720003837545, -0.18390391719367472, 0.032887533766370325, -0.07695058501121821, 0.18934137422365893, 0.07502089032095682, -0.04619325845851563, 0.185333901172271, 0.21468375691529218, -0.0012642251481906897, 0.16850732409329794, -0.11447495702122978, -0.007510341518354835, -0.22285500335055985, -0.09293420194808277, -0.1471396669257956, -0.014181078515548506, -0.09386118001157229, -0.08504897014427115, 0.3624769520065456, 0.24587878950478625, 0.2065018303337638, 0.11434771130006993, 0.3222865669413295, -0.005703587646166852, 0.1452500967279775, 0.09277203404417378, 0.14179324979977537, -0.03897067642174079, 0.07111421115496341, -0.17351776160103327, 0.04579952389576647, 0.068375391583686]
|
1,803.08461
|
Weak lensing peak statistics in the era of large scale cosmological
surveys
|
Weak lensing peak counts are a powerful statistical tool for constraining
cosmological parameters. So far, this method has been applied only to surveys
with relatively small areas, up to several hundred square degrees. As future
surveys will provide weak lensing datasets with size of thousands of square
degrees, the demand on the theoretical prediction of the peak statistics will
become heightened. In particular, large simulations of increased cosmological
volume are required. In this work, we investigate the possibility of using
simulations generated with the fast Comoving-Lagrangian acceleration (COLA)
method, coupled to the convergence map generator Ufalcon, for predicting the
peak counts. We examine the systematics introduced by the COLA method by
comparing it with a full TreePM code. We find that for a 2000 deg$^2$ survey,
the systematic error is much smaller than the statistical error. This suggests
that the COLA method is able to generate promising theoretical predictions for
weak lensing peaks. We also examine the constraining power of various
configurations of data vectors, exploring the influence of splitting the sample
into tomographic bins and combining different smoothing scales. We find the
combination of smoothing scales to have the most constraining power, improving
the constraints on the $S_8$ amplitude parameter by at least 40% compared to a
single smoothing scale, with tomography brining only limited increase in
measurement precision.
|
astro-ph.CO
|
weak lensing peak counts are a powerful statistical tool for constraining cosmological parameters so far this method has been applied only to surveys with relatively small areas up to several hundred square degrees as future surveys will provide weak lensing datasets with size of thousands of square degrees the demand on the theoretical prediction of the peak statistics will become heightened in particular large simulations of increased cosmological volume are required in this work we investigate the possibility of using simulations generated with the fast comovinglagrangian acceleration cola method coupled to the convergence map generator ufalcon for predicting the peak counts we examine the systematics introduced by the cola method by comparing it with a full treepm code we find that for a 2000 deg2 survey the systematic error is much smaller than the statistical error this suggests that the cola method is able to generate promising theoretical predictions for weak lensing peaks we also examine the constraining power of various configurations of data vectors exploring the influence of splitting the sample into tomographic bins and combining different smoothing scales we find the combination of smoothing scales to have the most constraining power improving the constraints on the s_8 amplitude parameter by at least 40 compared to a single smoothing scale with tomography brining only limited increase in measurement precision
|
[['weak', 'lensing', 'peak', 'counts', 'are', 'a', 'powerful', 'statistical', 'tool', 'for', 'constraining', 'cosmological', 'parameters', 'so', 'far', 'this', 'method', 'has', 'been', 'applied', 'only', 'to', 'surveys', 'with', 'relatively', 'small', 'areas', 'up', 'to', 'several', 'hundred', 'square', 'degrees', 'as', 'future', 'surveys', 'will', 'provide', 'weak', 'lensing', 'datasets', 'with', 'size', 'of', 'thousands', 'of', 'square', 'degrees', 'the', 'demand', 'on', 'the', 'theoretical', 'prediction', 'of', 'the', 'peak', 'statistics', 'will', 'become', 'heightened', 'in', 'particular', 'large', 'simulations', 'of', 'increased', 'cosmological', 'volume', 'are', 'required', 'in', 'this', 'work', 'we', 'investigate', 'the', 'possibility', 'of', 'using', 'simulations', 'generated', 'with', 'the', 'fast', 'comovinglagrangian', 'acceleration', 'cola', 'method', 'coupled', 'to', 'the', 'convergence', 'map', 'generator', 'ufalcon', 'for', 'predicting', 'the', 'peak', 'counts', 'we', 'examine', 'the', 'systematics', 'introduced', 'by', 'the', 'cola', 'method', 'by', 'comparing', 'it', 'with', 'a', 'full', 'treepm', 'code', 'we', 'find', 'that', 'for', 'a', '2000', 'deg2', 'survey', 'the', 'systematic', 'error', 'is', 'much', 'smaller', 'than', 'the', 'statistical', 'error', 'this', 'suggests', 'that', 'the', 'cola', 'method', 'is', 'able', 'to', 'generate', 'promising', 'theoretical', 'predictions', 'for', 'weak', 'lensing', 'peaks', 'we', 'also', 'examine', 'the', 'constraining', 'power', 'of', 'various', 'configurations', 'of', 'data', 'vectors', 'exploring', 'the', 'influence', 'of', 'splitting', 'the', 'sample', 'into', 'tomographic', 'bins', 'and', 'combining', 'different', 'smoothing', 'scales', 'we', 'find', 'the', 'combination', 'of', 'smoothing', 'scales', 'to', 'have', 'the', 'most', 'constraining', 'power', 'improving', 'the', 'constraints', 'on', 'the', 's_8', 'amplitude', 'parameter', 'by', 'at', 'least', '40', 'compared', 'to', 'a', 'single', 'smoothing', 'scale', 'with', 'tomography', 'brining', 'only', 'limited', 'increase', 'in', 'measurement', 'precision']]
|
[-0.07725894398435516, 0.06567242788390117, -0.059757088265300955, 0.1101229509870845, -0.07322725159281941, -0.09903909587466103, 0.014190772281732138, 0.3644558072353811, -0.2518950639591344, -0.3653821504087991, 0.09978015819504925, -0.2970629365430065, -0.04360306676855676, 0.2486719041339815, 0.00032934735499356435, 0.061914445301326476, 0.09076091515529713, -0.03363910136352608, -0.08724826441537674, -0.2807583204373828, 0.25880820452784226, 0.1580062040731685, 0.2810312791995398, -0.0003330481481062223, 0.10862782884008552, -0.038137460352861446, -0.10475655153636144, 0.06595160030136862, -0.1686544154414383, 0.10635306564538174, 0.19741410237830556, 0.1256965422379831, 0.2984972129911865, -0.36115163098791475, -0.22744886430307848, 0.12088538767168187, 0.15637422091280828, 0.14462810423238187, -0.04728890670257191, -0.25959569924791687, 0.11236139012316718, -0.15259006695149968, -0.10584466428746848, -0.09203133444178459, -0.0073694415719005955, 0.046421966902203605, -0.2634573171731748, 0.11532324377208689, -0.027711741713441262, 0.07281777855502145, 0.00542040187950548, -0.13138630594122627, 0.016326575622400568, 0.1019647213572968, 0.04621508863880023, 0.053132771658945026, 0.1261531586533404, -0.13981666389962266, -0.05618768244169516, 0.3739527253684966, -0.07758260558532885, -0.15396186426631706, 0.14796085333022116, -0.1756791670011467, -0.17389708650447258, 0.12447444227636796, 0.19191606857544916, 0.09165655244056765, -0.12034523375353619, 0.03181926064808815, 0.018734792149604454, 0.22004555579334428, 0.04430403384235454, 0.03313417752596579, 0.21488425635719952, 0.18625851342833036, 0.0836060939954177, 0.10573488825875799, -0.19347581818708343, -0.04056410158486807, -0.2674754107940823, -0.062248127786952955, -0.1683409786389792, 0.037200161738567834, -0.1272521065228452, -0.11639763781209221, 0.4050540996409238, 0.20414247320429102, 0.1903401852625775, 0.09050647034331068, 0.3280483446451814, 0.09531315023368692, 0.11350627144326596, 0.03615651869312881, 0.286267474821033, 0.11272977003466218, 0.05247032754155106, -0.19584146090974547, 0.023847181216035396, -0.01202596244763702]
|
1,803.08462
|
Hypergraph cuts above the average
|
An r-cut of a k-uniform hypergraph H is a partition of the vertex set of H
into r parts and the size of the cut is the number of edges which have a vertex
in each part. A classical result of Edwards says that every m-edge graph has a
2-cut of size $m/2 + \Omega(\sqrt{m})$, and this is best possible. That is,
there exist cuts which exceed the expected size of a random cut by some
multiple of the standard deviation. We study analogues of this and related
results in hypergraphs. First, we observe that similarly to graphs, every
m-edge k-uniform hypergraph has an r-cut whose size is $\Omega(\sqrt m)$ larger
than the expected size of a random r-cut. Moreover, in the case where k=3 and
r=2 this bound is best possible and is attained by Steiner triple systems.
Surprisingly, for all other cases (that is, if $k \geq 4$ or $r \geq 3$), we
show that every m-edge k-uniform hypergraph has an r-cut whose size is
$\Omega(m^{5/9})$ larger than the expected size of a random r-cut. This is a
significant difference in behaviour, since the amount by which the size of the
largest cut exceeds the expected size of a random cut is now considerably
larger than the standard deviation.
|
math.CO
|
an rcut of a kuniform hypergraph h is a partition of the vertex set of h into r parts and the size of the cut is the number of edges which have a vertex in each part a classical result of edwards says that every medge graph has a 2cut of size m2 omegasqrtm and this is best possible that is there exist cuts which exceed the expected size of a random cut by some multiple of the standard deviation we study analogues of this and related results in hypergraphs first we observe that similarly to graphs every medge kuniform hypergraph has an rcut whose size is omegasqrt m larger than the expected size of a random rcut moreover in the case where k3 and r2 this bound is best possible and is attained by steiner triple systems surprisingly for all other cases that is if k geq 4 or r geq 3 we show that every medge kuniform hypergraph has an rcut whose size is omegam59 larger than the expected size of a random rcut this is a significant difference in behaviour since the amount by which the size of the largest cut exceeds the expected size of a random cut is now considerably larger than the standard deviation
|
[['an', 'rcut', 'of', 'a', 'kuniform', 'hypergraph', 'h', 'is', 'a', 'partition', 'of', 'the', 'vertex', 'set', 'of', 'h', 'into', 'r', 'parts', 'and', 'the', 'size', 'of', 'the', 'cut', 'is', 'the', 'number', 'of', 'edges', 'which', 'have', 'a', 'vertex', 'in', 'each', 'part', 'a', 'classical', 'result', 'of', 'edwards', 'says', 'that', 'every', 'medge', 'graph', 'has', 'a', '2cut', 'of', 'size', 'm2', 'omegasqrtm', 'and', 'this', 'is', 'best', 'possible', 'that', 'is', 'there', 'exist', 'cuts', 'which', 'exceed', 'the', 'expected', 'size', 'of', 'a', 'random', 'cut', 'by', 'some', 'multiple', 'of', 'the', 'standard', 'deviation', 'we', 'study', 'analogues', 'of', 'this', 'and', 'related', 'results', 'in', 'hypergraphs', 'first', 'we', 'observe', 'that', 'similarly', 'to', 'graphs', 'every', 'medge', 'kuniform', 'hypergraph', 'has', 'an', 'rcut', 'whose', 'size', 'is', 'omegasqrt', 'm', 'larger', 'than', 'the', 'expected', 'size', 'of', 'a', 'random', 'rcut', 'moreover', 'in', 'the', 'case', 'where', 'k3', 'and', 'r2', 'this', 'bound', 'is', 'best', 'possible', 'and', 'is', 'attained', 'by', 'steiner', 'triple', 'systems', 'surprisingly', 'for', 'all', 'other', 'cases', 'that', 'is', 'if', 'k', 'geq', '4', 'or', 'r', 'geq', '3', 'we', 'show', 'that', 'every', 'medge', 'kuniform', 'hypergraph', 'has', 'an', 'rcut', 'whose', 'size', 'is', 'omegam59', 'larger', 'than', 'the', 'expected', 'size', 'of', 'a', 'random', 'rcut', 'this', 'is', 'a', 'significant', 'difference', 'in', 'behaviour', 'since', 'the', 'amount', 'by', 'which', 'the', 'size', 'of', 'the', 'largest', 'cut', 'exceeds', 'the', 'expected', 'size', 'of', 'a', 'random', 'cut', 'is', 'now', 'considerably', 'larger', 'than', 'the', 'standard', 'deviation']]
|
[-0.13731894579149623, 0.15346154705205733, -0.06085674012026105, 0.016283846985830817, -0.035694037340223216, -0.13672640486262166, 0.03850715484496994, 0.3292414984602007, -0.23616276341915812, -0.30636730555516595, 0.09795394800704134, -0.3292302710111611, -0.10705831146697165, 0.15359673890746378, -0.0764906268528788, -0.006851653745518258, 0.07312602798741025, 0.11474089095225701, -0.0011353490962602126, -0.28454095818387243, 0.2773689570850155, 0.005962183470658671, 0.19108458138418008, 0.06114274480205495, 0.03443596731141532, 0.0288077826195289, 0.03460456838813396, 0.11623064243596778, -0.16708260750521312, 0.0902607459518969, 0.1955290629333691, 0.13748426919203036, 0.2821899563960659, -0.335386405533427, -0.15489930612070915, 0.21847473660958572, 0.12895261588989973, 0.054415441714249585, 0.012071165939022858, -0.14791170587033356, 0.1622176295853793, -0.0998758145075184, -0.10870059721100216, 0.06762168610293884, 0.13035600246131743, -0.00915021079149133, -0.2995456051027689, -0.013638421203582905, 0.14547830120248434, 0.0118092988537123, 0.06938769422973004, -0.21149751896490881, -0.05781919650773769, 0.07379153573352736, -0.04428245373800074, 0.08385203958963618, 0.05726325485878848, -0.12592930356857743, -0.12758691072947562, 0.3826483770793017, -0.058209410060324165, -0.1461010007702638, 0.11945058638845624, -0.17248541280927243, -0.13559069057765344, 0.16030368834841424, 0.10559811892128962, 0.15767295450384083, -0.09457991513101241, 0.13784748221867352, -0.15494596292578186, 0.20417729406080282, 0.12112993587596485, 0.02634802886258023, 0.1224413656611712, 0.1870474064221176, 0.169906697082087, 0.17870001966058716, -0.05272742044605995, -0.005018275399589374, -0.29809429976320156, -0.13582861846981148, -0.2614502934263258, 0.10215997931216127, -0.19148714863212474, -0.18838526579649903, 0.3732840010511259, 0.10589535041939459, 0.22697690855084846, 0.10450177445454756, 0.23580575827061415, 0.10755713509409431, 0.10404842423919874, 0.15970186880664328, 0.1844485037107426, 0.13207127981205793, -0.029030828253151134, -0.1539663414349399, 0.08947500438751796, 0.06101721047777504]
|
1,803.08463
|
A Feature-Based Model for Nested Named-Entity Recognition at VLSP-2018
NER Evaluation Campaign
|
In this report, we describe our participant named-entity recognition system
at VLSP 2018 evaluation campaign. We formalized the task as a sequence labeling
problem using BIO encoding scheme. We applied a feature-based model which
combines word, word-shape features, Brown-cluster-based features, and
word-embedding-based features. We compare several methods to deal with nested
entities in the dataset. We showed that combining tags of entities at all
levels for training a sequence labeling model (joint-tag model) improved the
accuracy of nested named-entity recognition.
|
cs.CL
|
in this report we describe our participant namedentity recognition system at vlsp 2018 evaluation campaign we formalized the task as a sequence labeling problem using bio encoding scheme we applied a featurebased model which combines word wordshape features brownclusterbased features and wordembeddingbased features we compare several methods to deal with nested entities in the dataset we showed that combining tags of entities at all levels for training a sequence labeling model jointtag model improved the accuracy of nested namedentity recognition
|
[['in', 'this', 'report', 'we', 'describe', 'our', 'participant', 'namedentity', 'recognition', 'system', 'at', 'vlsp', '2018', 'evaluation', 'campaign', 'we', 'formalized', 'the', 'task', 'as', 'a', 'sequence', 'labeling', 'problem', 'using', 'bio', 'encoding', 'scheme', 'we', 'applied', 'a', 'featurebased', 'model', 'which', 'combines', 'word', 'wordshape', 'features', 'brownclusterbased', 'features', 'and', 'wordembeddingbased', 'features', 'we', 'compare', 'several', 'methods', 'to', 'deal', 'with', 'nested', 'entities', 'in', 'the', 'dataset', 'we', 'showed', 'that', 'combining', 'tags', 'of', 'entities', 'at', 'all', 'levels', 'for', 'training', 'a', 'sequence', 'labeling', 'model', 'jointtag', 'model', 'improved', 'the', 'accuracy', 'of', 'nested', 'namedentity', 'recognition']]
|
[-0.06852282398658527, -0.04509398877596507, -0.07953818333516648, 0.07168713597695694, -0.07379879448683811, -0.15248802036361456, 0.0724447906265253, 0.47577766759635565, -0.2580711261865187, -0.3654436468957113, 0.012076663267617296, -0.32129463964662, -0.16337640411160015, 0.1650758644311943, -0.14344206325371156, 0.07051446938633242, 0.19396160149269484, 0.06276985844173892, -0.0268555591880743, -0.2627491142370968, 0.27831911449864893, 0.026252508828682557, 0.3225374688430653, -0.005174620778529675, 0.16966553226222175, -0.028083363188092004, -0.04892489473129828, -0.014918476004492153, -0.04345726294720065, 0.1612868143363505, 0.3285611053753354, 0.20394509075233688, 0.30646130643397956, -0.34505145625489486, -0.21550415387352953, 0.035135347910177014, 0.13880094986215427, 0.13893688828593675, -0.024474301653635965, -0.3598249483152063, 0.10054358350741979, -0.2333826796520598, 0.048364645281395356, -0.13960599605381102, -0.01930837075576767, -0.020768238842342194, -0.2773574201099865, 0.024482663382183422, 0.09662082285753318, 0.13979107200760732, -0.08274081011617242, -0.13592538972197754, 0.08040419535699313, 0.18442668043101182, -0.015643996339255048, 0.05646767668038994, 0.07405289901154381, -0.16497576104585904, -0.20009364278430675, 0.3609296811877617, -0.06611684632076362, -0.20085998189139675, 0.19564635757743926, -0.005274078530537618, -0.2412411616026581, 0.05908624578702759, 0.22710505901237152, 0.1372780711148176, -0.14284012566453644, -0.024841098052104812, -0.05778655331497165, 0.24863519035763554, 0.0898912022730892, -0.02921108844351362, 0.1510853937875431, 0.290074495985717, -0.04875748566436497, 0.16227104910346982, -0.1306922494542676, -0.01886949536705075, -0.21065033667920424, -0.09321456695241588, -0.16216680052381782, -0.08733591519586452, -0.053254732305551396, -0.12273738475201966, 0.41798349185528305, 0.25088322282369646, 0.21529837529622503, 0.11893995343435362, 0.2897544538650613, 0.007621948649598794, 0.09506138969007154, 0.08544222570202833, 0.09820941423199006, -0.04115518807681495, 0.093400764031118, -0.18176038999884547, 0.06224560523526622, 0.14532564327652966]
|
1,803.08464
|
Fouling mitigation in tubular membranes by 3D-printed turbulence
promoters
|
Despite intensive research, fouling remains a severe problem in membrane
filtration. It is often controlled by applying turbulent flow which requires a
higher energy consumption. So-called turbulence promoters or static mixers can
be inserted into the flow channel of tubular membranes. They deflect the fluid,
induce vortices, enhance particle back-transport and increase the shear rate at
the membrane surface, thus mitigating fouling. However, little is known how the
geometry of such turbulence promotors affects the reduction of fouling. We
investigate how different 3D-printed mixer geometries affect fouling and
improve the flux during filtration with humic acid. Most mixer geometries used
in the present study are based on a twisted tape; a Kenics static mixer is
investigated as well. Static mixers with changing diameter prove to be less
effective than twisted tape mixers with constant diameter which lead to an
increase in permeate flux of around 130%. The highest flux improvement of 140%
can be reached by applying a Kenics mixer. Regardless of their geometry, all
investigated static mixer cause higher permeate fluxes at same specific energy
consumption. Again, the Kenics mixer proves to be the most efficient static
mixer. The presented mixer geometries can be fabricated with undercut injection
molding techniques and represent a simple and viable option to make tubular
membrane based filtration processes more efficient.
|
physics.flu-dyn
|
despite intensive research fouling remains a severe problem in membrane filtration it is often controlled by applying turbulent flow which requires a higher energy consumption socalled turbulence promoters or static mixers can be inserted into the flow channel of tubular membranes they deflect the fluid induce vortices enhance particle backtransport and increase the shear rate at the membrane surface thus mitigating fouling however little is known how the geometry of such turbulence promotors affects the reduction of fouling we investigate how different 3dprinted mixer geometries affect fouling and improve the flux during filtration with humic acid most mixer geometries used in the present study are based on a twisted tape a kenics static mixer is investigated as well static mixers with changing diameter prove to be less effective than twisted tape mixers with constant diameter which lead to an increase in permeate flux of around 130 the highest flux improvement of 140 can be reached by applying a kenics mixer regardless of their geometry all investigated static mixer cause higher permeate fluxes at same specific energy consumption again the kenics mixer proves to be the most efficient static mixer the presented mixer geometries can be fabricated with undercut injection molding techniques and represent a simple and viable option to make tubular membrane based filtration processes more efficient
|
[['despite', 'intensive', 'research', 'fouling', 'remains', 'a', 'severe', 'problem', 'in', 'membrane', 'filtration', 'it', 'is', 'often', 'controlled', 'by', 'applying', 'turbulent', 'flow', 'which', 'requires', 'a', 'higher', 'energy', 'consumption', 'socalled', 'turbulence', 'promoters', 'or', 'static', 'mixers', 'can', 'be', 'inserted', 'into', 'the', 'flow', 'channel', 'of', 'tubular', 'membranes', 'they', 'deflect', 'the', 'fluid', 'induce', 'vortices', 'enhance', 'particle', 'backtransport', 'and', 'increase', 'the', 'shear', 'rate', 'at', 'the', 'membrane', 'surface', 'thus', 'mitigating', 'fouling', 'however', 'little', 'is', 'known', 'how', 'the', 'geometry', 'of', 'such', 'turbulence', 'promotors', 'affects', 'the', 'reduction', 'of', 'fouling', 'we', 'investigate', 'how', 'different', '3dprinted', 'mixer', 'geometries', 'affect', 'fouling', 'and', 'improve', 'the', 'flux', 'during', 'filtration', 'with', 'humic', 'acid', 'most', 'mixer', 'geometries', 'used', 'in', 'the', 'present', 'study', 'are', 'based', 'on', 'a', 'twisted', 'tape', 'a', 'kenics', 'static', 'mixer', 'is', 'investigated', 'as', 'well', 'static', 'mixers', 'with', 'changing', 'diameter', 'prove', 'to', 'be', 'less', 'effective', 'than', 'twisted', 'tape', 'mixers', 'with', 'constant', 'diameter', 'which', 'lead', 'to', 'an', 'increase', 'in', 'permeate', 'flux', 'of', 'around', '130', 'the', 'highest', 'flux', 'improvement', 'of', '140', 'can', 'be', 'reached', 'by', 'applying', 'a', 'kenics', 'mixer', 'regardless', 'of', 'their', 'geometry', 'all', 'investigated', 'static', 'mixer', 'cause', 'higher', 'permeate', 'fluxes', 'at', 'same', 'specific', 'energy', 'consumption', 'again', 'the', 'kenics', 'mixer', 'proves', 'to', 'be', 'the', 'most', 'efficient', 'static', 'mixer', 'the', 'presented', 'mixer', 'geometries', 'can', 'be', 'fabricated', 'with', 'undercut', 'injection', 'molding', 'techniques', 'and', 'represent', 'a', 'simple', 'and', 'viable', 'option', 'to', 'make', 'tubular', 'membrane', 'based', 'filtration', 'processes', 'more', 'efficient']]
|
[-0.11694689142287071, 0.15961964473973678, -0.02964994319309308, 0.023641527269824616, -0.07324258603707508, -0.19668828563212795, -0.0058928479438354435, 0.40356675378495344, -0.25788859890760957, -0.3104002303810342, 0.13205936590168643, -0.2124299634144538, -0.10670697965111618, 0.21578264699254995, -0.10487289584664351, 0.007125632939817108, 0.02805596462908229, -0.03425613068113172, -0.010939378183778629, -0.1656414625338382, 0.2342812912387739, 0.1304864880102859, 0.3699143973558589, 0.07880511742647893, 0.09707396408150627, -0.06711972939201924, -0.006031506470646019, 0.03386666912949834, -0.15154557322966866, 0.06186769529045301, 0.24287808241745182, 0.015638236025417293, 0.1829182450698378, -0.5144749606217913, -0.24549641538545042, 0.08263137848472171, 0.14904976374021284, 0.10824962604588277, -0.016436063872417975, -0.19259757670860617, 0.11090405182039831, -0.16609218132496742, -0.09945376000272248, -0.03251299864388312, -0.02797245702283733, 0.029635749826815702, -0.19757389543250342, 0.06857415901416701, 0.03026144834991471, 0.05907435528718418, -0.04188315255278549, -0.11488928214573578, -0.07418908054522169, 0.11869018300354515, 0.015148870894875101, 0.022266709988428005, 0.2796335283136513, -0.13795942186239968, -0.05873116431542224, 0.3461091480718029, -0.06073251222638915, -0.22531354606703477, 0.14521983991559223, -0.08143763922864175, -0.04225908421600858, 0.19363992202582908, 0.16314255671696393, 0.10781067132915335, -0.1375815365894663, -0.01977026583605308, 0.060541667975485325, 0.1707956805268488, 0.1707908383751702, -0.0060586796071557154, 0.2428064787850922, 0.22411184523392608, 0.08002871400094591, 0.19798745265978612, -0.06890020445226347, -0.05524732160308674, -0.2164776850226594, -0.15200242965942448, -0.11265384172427864, 0.0817206836077444, -0.08758475024903116, -0.17946215929610101, 0.3545461916127587, 0.10830099125834952, 0.15724402019501818, -0.014522342706590684, 0.302788099291286, 0.0713828236540495, 0.09710733751611163, 0.07282606063893547, 0.2576121430595069, 0.129447363582181, 0.1504264742252417, -0.21255144310378926, 0.051274316730322664, 0.011878167300623048]
|
1,803.08465
|
A connection between Living Liquid Crystals and electrokinetic phenomena
in nematic fluids
|
We develop a formal analogy between configurational stresses in two distinct
physical systems, and study the flows that they induce when the configurations
of interest include topological de- fects. The two systems in question are
electrokinetic flows in a nematic fluid under an applied electrostatic field,
and the motion of self propelling or active particles in a nematic matrix (a
living liquid crystal). The mapping allows the extension, within certain
limits, of existing results on trans- port in electrokinetic systems to self
propelled transport. We study motion induced by a pair of point defects in a
dipole configuration, and steady rotating flows due to a swirling vortex
nematic director pattern. The connection presented allows the design of
electrokinetic experiments that correspond to particular active matter
configurations that may, however, be easier to conduct and control in the
laboratory.
|
cond-mat.soft
|
we develop a formal analogy between configurational stresses in two distinct physical systems and study the flows that they induce when the configurations of interest include topological de fects the two systems in question are electrokinetic flows in a nematic fluid under an applied electrostatic field and the motion of self propelling or active particles in a nematic matrix a living liquid crystal the mapping allows the extension within certain limits of existing results on trans port in electrokinetic systems to self propelled transport we study motion induced by a pair of point defects in a dipole configuration and steady rotating flows due to a swirling vortex nematic director pattern the connection presented allows the design of electrokinetic experiments that correspond to particular active matter configurations that may however be easier to conduct and control in the laboratory
|
[['we', 'develop', 'a', 'formal', 'analogy', 'between', 'configurational', 'stresses', 'in', 'two', 'distinct', 'physical', 'systems', 'and', 'study', 'the', 'flows', 'that', 'they', 'induce', 'when', 'the', 'configurations', 'of', 'interest', 'include', 'topological', 'de', 'fects', 'the', 'two', 'systems', 'in', 'question', 'are', 'electrokinetic', 'flows', 'in', 'a', 'nematic', 'fluid', 'under', 'an', 'applied', 'electrostatic', 'field', 'and', 'the', 'motion', 'of', 'self', 'propelling', 'or', 'active', 'particles', 'in', 'a', 'nematic', 'matrix', 'a', 'living', 'liquid', 'crystal', 'the', 'mapping', 'allows', 'the', 'extension', 'within', 'certain', 'limits', 'of', 'existing', 'results', 'on', 'trans', 'port', 'in', 'electrokinetic', 'systems', 'to', 'self', 'propelled', 'transport', 'we', 'study', 'motion', 'induced', 'by', 'a', 'pair', 'of', 'point', 'defects', 'in', 'a', 'dipole', 'configuration', 'and', 'steady', 'rotating', 'flows', 'due', 'to', 'a', 'swirling', 'vortex', 'nematic', 'director', 'pattern', 'the', 'connection', 'presented', 'allows', 'the', 'design', 'of', 'electrokinetic', 'experiments', 'that', 'correspond', 'to', 'particular', 'active', 'matter', 'configurations', 'that', 'may', 'however', 'be', 'easier', 'to', 'conduct', 'and', 'control', 'in', 'the', 'laboratory']]
|
[-0.19309292925585844, 0.19945859486683004, -0.09960621472218655, 0.006550121256082818, -0.054394617556945246, -0.11474774054764514, -0.00584630966456472, 0.35021663586730545, -0.2534828141628616, -0.28136735888656933, 0.05025362059477366, -0.2453929930556299, -0.1764580398693384, 0.17018299281050492, -0.03367441902409537, 0.04642691934461017, -0.017178213301425178, -0.014299256792899383, -0.016728058061309403, -0.1406312242708763, 0.2841851973595719, 0.020779381253068215, 0.3221855234503206, 0.03463629982898187, 0.09683803726068657, 0.002485998273503197, 0.02696196021228705, 0.08703198292009208, -0.17570050368063359, 0.11247358543197691, 0.2566673914173051, 0.0013168761068010244, 0.2160530231177699, -0.5119323313330718, -0.2264374537727512, 0.08961584372108505, 0.13625102413926218, 0.13789298476995496, -0.07399495539299307, -0.25716697746563866, 0.03868811975395226, -0.1755473638675513, -0.13255268148740457, -0.07974655961489602, 0.007202116938719553, 0.059917794637326355, -0.22641991469604167, 0.04888384479968606, 0.09616788616066502, 0.07211830800372189, -0.10271423234540186, -0.015615614247508347, -0.03026389519336458, 0.10122378357703818, 0.061510022792904434, 0.014721846211350698, 0.23137701215708387, -0.16841847772129637, -0.14041298556991894, 0.41689395252615213, -0.035212173008535436, -0.25658855917931034, 0.23400186546875731, -0.11715278124345628, -0.09050112113059647, 0.1745073380778827, 0.2061503640459547, 0.09247562562276194, -0.13432859513873616, 0.04511653919926966, -0.043711110740306154, 0.13829046199153064, 0.06410563222395824, -0.049992231520540685, 0.2948564599079174, 0.15617598011495842, 0.07753781485708727, 0.14380027240132104, -0.0822446194285041, -0.14418691186828242, -0.26295640967462375, -0.17364022597009182, -0.11786544415424915, -0.0016080405635032062, -0.043176074295922226, -0.1693718587115839, 0.3548921029947266, 0.13492622528565992, 0.16307473629928174, -0.056887617913425725, 0.2222417514177336, 0.01227662600306929, 0.026765711656164214, 0.0512649670675181, 0.2742298435473788, 0.1630220568985206, 0.1424055427407333, -0.25805744178512174, -0.0031446776811735353, 0.07801575608470518]
|
1,803.08466
|
Dynamical sampling and frame representations with bounded operators
|
The purpose of this paper is to study frames for a Hilbert space ${\cal H},$
having the form $\{T^n \varphi\}_{n=0}^\infty$ for some $\varphi \in {\cal H}$
and an operator $T: {\cal H} \to {\cal H}.$ We characterize the frames that
have such a representation for a bounded operator $T,$ and discuss the
properties of this operator. In particular, we prove that the image chain of
$T$ has finite length $N$ in the overcomplete case; furthermore $\{T^n
\varphi\}_{n=0}^\infty$ has the very particular property that $\{T^n
\varphi\}_{n=0}^{N-1} \cup \{T^n \varphi\}_{n=N+\ell}^\infty$ is a frame for
${\cal H} $ for all $\ell\in {\mathbf N}_0$. We also prove that frames of the
form $\{T^n \varphi\}_{n=0}^\infty$ are sensitive to the ordering of the
elements and to norm-perturbations of the generator $\varphi$ and the operator
$T.$ On the other hand positive stability results are obtained by considering
perturbations of the generator $\varphi$ belonging to an invariant subspace on
which $T$ is a contraction.
|
math.FA
|
the purpose of this paper is to study frames for a hilbert space cal h having the form tn varphi_n0infty for some varphi in cal h and an operator t cal h to cal h we characterize the frames that have such a representation for a bounded operator t and discuss the properties of this operator in particular we prove that the image chain of t has finite length n in the overcomplete case furthermore tn varphi_n0infty has the very particular property that tn varphi_n0n1 cup tn varphi_nnellinfty is a frame for cal h for all ellin mathbf n_0 we also prove that frames of the form tn varphi_n0infty are sensitive to the ordering of the elements and to normperturbations of the generator varphi and the operator t on the other hand positive stability results are obtained by considering perturbations of the generator varphi belonging to an invariant subspace on which t is a contraction
|
[['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'study', 'frames', 'for', 'a', 'hilbert', 'space', 'cal', 'h', 'having', 'the', 'form', 'tn', 'varphi_n0infty', 'for', 'some', 'varphi', 'in', 'cal', 'h', 'and', 'an', 'operator', 't', 'cal', 'h', 'to', 'cal', 'h', 'we', 'characterize', 'the', 'frames', 'that', 'have', 'such', 'a', 'representation', 'for', 'a', 'bounded', 'operator', 't', 'and', 'discuss', 'the', 'properties', 'of', 'this', 'operator', 'in', 'particular', 'we', 'prove', 'that', 'the', 'image', 'chain', 'of', 't', 'has', 'finite', 'length', 'n', 'in', 'the', 'overcomplete', 'case', 'furthermore', 'tn', 'varphi_n0infty', 'has', 'the', 'very', 'particular', 'property', 'that', 'tn', 'varphi_n0n1', 'cup', 'tn', 'varphi_nnellinfty', 'is', 'a', 'frame', 'for', 'cal', 'h', 'for', 'all', 'ellin', 'mathbf', 'n_0', 'we', 'also', 'prove', 'that', 'frames', 'of', 'the', 'form', 'tn', 'varphi_n0infty', 'are', 'sensitive', 'to', 'the', 'ordering', 'of', 'the', 'elements', 'and', 'to', 'normperturbations', 'of', 'the', 'generator', 'varphi', 'and', 'the', 'operator', 't', 'on', 'the', 'other', 'hand', 'positive', 'stability', 'results', 'are', 'obtained', 'by', 'considering', 'perturbations', 'of', 'the', 'generator', 'varphi', 'belonging', 'to', 'an', 'invariant', 'subspace', 'on', 'which', 't', 'is', 'a', 'contraction']]
|
[-0.15069549013615438, 0.15934479847342836, -0.02436512035408094, 0.001363792154159838, -0.0353679626806345, -0.10659228123442613, -0.019355773736606352, 0.3862583770808813, -0.27727351268434797, -0.17914850260498688, 0.10404559555785167, -0.3225690560219319, -0.10707556147980013, 0.12751641065053837, -0.04447025749648578, 0.02777632395124161, 0.038796356961890856, 0.1808319150862333, -0.11411898201760395, -0.21513307837181186, 0.31630132888982954, 0.0017944870357352652, 0.1811859603223734, 0.021861660380014462, 0.11338343299422904, -0.02443678143562896, 0.04360300536408383, 0.01032570656982563, -0.1715710293756274, 0.09122581086366584, 0.23487522912326217, 0.1323302365919134, 0.2165331544912126, -0.3370452879707476, -0.15755556757855965, 0.165300075730652, 0.10023330738400354, -0.003344886786898745, -0.009755112010967232, -0.2558429877282929, 0.160501160986697, -0.1199374355890445, -0.07579911886990119, -0.10060783711837996, 0.12979494710452855, -0.029358630204928647, -0.35825011118829836, 0.020395724182315843, 0.16554846151388788, 0.05424483357561066, -0.027673659812487466, -0.09448696005060092, -0.04947963852809105, 0.08585608973302633, 0.021609090601008286, 0.11220707756078091, 0.0683733900322726, -0.08246717027750013, -0.06430163385582426, 0.3771553752870348, -0.11609494134647416, -0.1929033290239443, 0.12041755156334195, -0.1898488599848095, -0.16152976667140856, 0.05691403303123815, 0.12485875233419631, 0.17936755524409054, -0.08533329742127344, 0.23864281307875276, -0.08920511242161554, 0.1272243876684163, 0.07331230855963536, 0.05809154314307594, 0.06574346222087595, 0.08219268586253747, 0.1158061271554815, 0.1405897356905227, -0.03184566755264409, -0.013792692662192215, -0.3826472447131221, -0.1991886839693363, -0.18567294107311968, 0.06974982512551114, -0.10295867441355337, -0.15888144953274413, 0.36526895177207497, 0.0948818348994229, 0.2812376779957527, 0.05984147353247911, 0.17867402149682962, 0.13734954867610022, 0.05495513270082148, 0.09874122096899603, 0.13230644150941148, 0.1548828189008514, 0.05471319919697156, -0.2244057564591793, 0.01033514738848776, 0.1314913937058966]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.