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.08067
|
A Review of Situation Awareness Assessment Approaches in Aviation
Environments
|
Situation awareness (SA) is an important constituent in human information
processing and essential in pilots' decision-making processes. Acquiring and
maintaining appropriate levels of SA is critical in aviation environments as it
affects all decisions and actions taking place in flights and air traffic
control. This paper provides an overview of recent measurement models and
approaches to establishing and enhancing SA in aviation environments. Many
aspects of SA are examined including the classification of SA techniques into
six categories, and different theoretical SA models from individual, to shared
or team, and to distributed or system levels. Quantitative and qualitative
perspectives pertaining to SA methods and issues of SA for unmanned vehicles
are also addressed. Furthermore, future research directions regarding SA
assessment approaches are raised to deal with shortcomings of the existing
state-of-the-art methods in the literature.
|
cs.HC
|
situation awareness sa is an important constituent in human information processing and essential in pilots decisionmaking processes acquiring and maintaining appropriate levels of sa is critical in aviation environments as it affects all decisions and actions taking place in flights and air traffic control this paper provides an overview of recent measurement models and approaches to establishing and enhancing sa in aviation environments many aspects of sa are examined including the classification of sa techniques into six categories and different theoretical sa models from individual to shared or team and to distributed or system levels quantitative and qualitative perspectives pertaining to sa methods and issues of sa for unmanned vehicles are also addressed furthermore future research directions regarding sa assessment approaches are raised to deal with shortcomings of the existing stateoftheart methods in the literature
|
[['situation', 'awareness', 'sa', 'is', 'an', 'important', 'constituent', 'in', 'human', 'information', 'processing', 'and', 'essential', 'in', 'pilots', 'decisionmaking', 'processes', 'acquiring', 'and', 'maintaining', 'appropriate', 'levels', 'of', 'sa', 'is', 'critical', 'in', 'aviation', 'environments', 'as', 'it', 'affects', 'all', 'decisions', 'and', 'actions', 'taking', 'place', 'in', 'flights', 'and', 'air', 'traffic', 'control', 'this', 'paper', 'provides', 'an', 'overview', 'of', 'recent', 'measurement', 'models', 'and', 'approaches', 'to', 'establishing', 'and', 'enhancing', 'sa', 'in', 'aviation', 'environments', 'many', 'aspects', 'of', 'sa', 'are', 'examined', 'including', 'the', 'classification', 'of', 'sa', 'techniques', 'into', 'six', 'categories', 'and', 'different', 'theoretical', 'sa', 'models', 'from', 'individual', 'to', 'shared', 'or', 'team', 'and', 'to', 'distributed', 'or', 'system', 'levels', 'quantitative', 'and', 'qualitative', 'perspectives', 'pertaining', 'to', 'sa', 'methods', 'and', 'issues', 'of', 'sa', 'for', 'unmanned', 'vehicles', 'are', 'also', 'addressed', 'furthermore', 'future', 'research', 'directions', 'regarding', 'sa', 'assessment', 'approaches', 'are', 'raised', 'to', 'deal', 'with', 'shortcomings', 'of', 'the', 'existing', 'stateoftheart', 'methods', 'in', 'the', 'literature']]
|
[-0.10970920018713784, 0.0177657147543936, -0.044662057870516074, 0.06500498469384318, -0.03352956669405103, -0.14877205043341274, 0.0395611191590972, 0.4053511716701366, -0.23274625886093686, -0.3488177217508632, 0.13985647046076202, -0.31851742930227406, -0.12993395431657082, 0.21079876297670935, -0.15388867078280008, 0.0605369103986218, 0.06306971282594734, -0.007932229196928717, -0.017166295187133883, -0.27727461005647286, 0.27923755647045456, 0.07723520203597016, 0.3538578438262145, 0.03952141424804857, 0.06589248930276544, 0.012424395714576045, -0.09677371109525362, 0.016597159962273306, -0.09507139336158245, 0.13020172833499533, 0.3531503113079924, 0.22075515172823712, 0.3300291271811282, -0.46473752218816017, -0.23653851205362353, 0.07262303987862888, 0.16598503737736287, 0.08340061711561349, -0.024192829002384786, -0.3291520173419957, 0.07882172639473099, -0.16156654130770928, -0.05546773721429485, -0.07953076157373963, 0.0070430177194928684, 0.029789779342159078, -0.2593428380994333, 0.0026191133641448147, 0.0844651089998445, 0.14084371127947062, -0.10677479746992942, -0.17924158393008705, 0.05096503210564454, 0.22927383114411323, 0.10195316225980167, -0.013170787644641543, 0.17364564655624606, -0.16758558715141758, -0.1671489379023788, 0.395440488970942, 0.022315851647268844, -0.165098369176741, 0.2743544660508633, -0.034808687651012506, -0.1590455881630381, 0.04310352165872852, 0.20173263961656226, 0.050736351707881246, -0.16874790809082765, 0.04194658874206383, 0.08322577298170439, 0.11797792952921655, 0.027390267389516037, 0.03817051054081983, 0.18502009576186537, 0.22933470649575746, 0.08633134561133812, 0.04900841025152692, -0.01510987530152003, -0.13945852700206968, -0.1773140844785505, -0.126732787710649, -0.057586877645614244, -0.01521988555237099, -0.01707122609497876, -0.08524994288174505, 0.3781344610542335, 0.20617572118838629, 0.139729428844078, -0.013463017861876222, 0.37342871860773474, 0.05147007729564966, 0.009904441399568762, 0.044045930072941164, 0.15906445497077787, 0.04347404503367013, 0.1395949394752582, -0.1654255077768876, 0.06594552181885337, 0.0018964493793814823]
|
1,803.08068
|
Computing Periods of Hypersurfaces
|
We give an algorithm to compute the periods of smooth projective
hypersurfaces of any dimension. This is an improvement over existing algorithms
which could only compute the periods of plane curves. Our algorithm reduces the
evaluation of period integrals to an initial value problem for ordinary
differential equations of Picard-Fuchs type. In this way, the periods can be
computed to extreme-precision in order to study their arithmetic properties.
The initial conditions are obtained by an exact determination of the cohomology
pairing on Fermat hypersurfaces with respect to a natural basis.
|
math.AG cs.SC
|
we give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension this is an improvement over existing algorithms which could only compute the periods of plane curves our algorithm reduces the evaluation of period integrals to an initial value problem for ordinary differential equations of picardfuchs type in this way the periods can be computed to extremeprecision in order to study their arithmetic properties the initial conditions are obtained by an exact determination of the cohomology pairing on fermat hypersurfaces with respect to a natural basis
|
[['we', 'give', 'an', 'algorithm', 'to', 'compute', 'the', 'periods', 'of', 'smooth', 'projective', 'hypersurfaces', 'of', 'any', 'dimension', 'this', 'is', 'an', 'improvement', 'over', 'existing', 'algorithms', 'which', 'could', 'only', 'compute', 'the', 'periods', 'of', 'plane', 'curves', 'our', 'algorithm', 'reduces', 'the', 'evaluation', 'of', 'period', 'integrals', 'to', 'an', 'initial', 'value', 'problem', 'for', 'ordinary', 'differential', 'equations', 'of', 'picardfuchs', 'type', 'in', 'this', 'way', 'the', 'periods', 'can', 'be', 'computed', 'to', 'extremeprecision', 'in', 'order', 'to', 'study', 'their', 'arithmetic', 'properties', 'the', 'initial', 'conditions', 'are', 'obtained', 'by', 'an', 'exact', 'determination', 'of', 'the', 'cohomology', 'pairing', 'on', 'fermat', 'hypersurfaces', 'with', 'respect', 'to', 'a', 'natural', 'basis']]
|
[-0.20127391445795806, 0.026682055330955624, -0.13336209366830548, 0.05974144328861717, -0.09102970165242388, -0.060843981378659436, -0.007086548483354992, 0.337994121684787, -0.3029595810627, -0.2971625603883255, 0.11046697083975743, -0.22290862474578768, -0.10762266380440318, 0.27525578480046453, -0.1399483396305462, 0.03867527433367592, 0.08191352101236456, 0.07068272571215468, -0.1441455456961909, -0.3670361658108285, 0.35193213678143, -0.005373741238472167, 0.19587658740203368, -0.004076854158402159, 0.08905700256713153, 0.00323098306962697, 0.006339222123111295, -0.029236296034847082, -0.16671896398098868, 0.16204339589300995, 0.28545411638496965, 0.09852152028686126, 0.18302069131933738, -0.40017777114185726, -0.15491470298991444, 0.1847590690143825, 0.1371468926748533, 0.12311020792132306, 0.051536453222029245, -0.2482233776166784, 0.10040831244472163, -0.12290113051212655, -0.23190964051532778, -0.10603335296756096, 0.06910813548549842, 0.03858939235705589, -0.2661209081435639, 0.020618292194362103, 0.01958216300882985, 0.11282110031108174, -0.10039183505800332, -0.09621911964724573, -0.004284642696945688, 0.08043947887444722, 0.04709628776364615, 0.05553373159432595, 0.049671523388098465, -0.10087072865231737, -0.15476183528917725, 0.3632644983793326, -0.06088576425295951, -0.21114814398663767, 0.1060520802321059, -0.09373836321337672, -0.08143334532826302, 0.16622941149398685, 0.17359792495020823, 0.18566109475501802, -0.10413617765258872, 0.08774241981923245, -0.03386746875920825, 0.15368801627695308, 0.08605545674963447, -0.020981057829568894, 0.13065730594621783, 0.06980187637375647, 0.11180098216949302, 0.1037553112556258, -0.03571157510852797, -0.10395433597810817, -0.3228149356090286, -0.19764033718992108, -0.11752117554568214, 0.0879572838979114, -0.12861584043758137, -0.19609819195662323, 0.4082447943183478, 0.09598282213437925, 0.21696719083558308, 0.0984879779234382, 0.2759634264106496, 0.16668085140317385, 0.04021150359489531, 0.049408607681941115, 0.17802938742803806, 0.14960323946205167, 0.04537372796382923, -0.2126318649571975, 0.05948267308890485, 0.14553095029897234]
|
1,803.08069
|
3D Soil Compaction Mapping through Kriging-based Exploration with a
Mobile Robot
|
This paper presents an automated method for creating spatial maps of soil
condition with an outdoor mobile robot. Effective soil mapping on farms can
enhance yields, reduce inputs and help protect the environment. Traditionally,
data are collected manually at an arbitrary set of locations, then soil maps
are constructed offline using Kriging, a form of Gaussian process regression.
This process is laborious and costly, limiting the quality and resolution of
the resulting information. Instead, we propose to use an outdoor mobile robot
for automatic collection of soil condition data, building soil maps online and
also adapting the robot's exploration strategy on-the-fly based on the current
quality of the map. We show how using Kriging variance as a reward function for
robotic exploration allows for both more efficient data collection and better
soil models. This work presents the theoretical foundations for our proposal
and an experimental comparison of exploration strategies using soil compaction
data from a field generated with a mobile robot.
|
cs.RO
|
this paper presents an automated method for creating spatial maps of soil condition with an outdoor mobile robot effective soil mapping on farms can enhance yields reduce inputs and help protect the environment traditionally data are collected manually at an arbitrary set of locations then soil maps are constructed offline using kriging a form of gaussian process regression this process is laborious and costly limiting the quality and resolution of the resulting information instead we propose to use an outdoor mobile robot for automatic collection of soil condition data building soil maps online and also adapting the robots exploration strategy onthefly based on the current quality of the map we show how using kriging variance as a reward function for robotic exploration allows for both more efficient data collection and better soil models this work presents the theoretical foundations for our proposal and an experimental comparison of exploration strategies using soil compaction data from a field generated with a mobile robot
|
[['this', 'paper', 'presents', 'an', 'automated', 'method', 'for', 'creating', 'spatial', 'maps', 'of', 'soil', 'condition', 'with', 'an', 'outdoor', 'mobile', 'robot', 'effective', 'soil', 'mapping', 'on', 'farms', 'can', 'enhance', 'yields', 'reduce', 'inputs', 'and', 'help', 'protect', 'the', 'environment', 'traditionally', 'data', 'are', 'collected', 'manually', 'at', 'an', 'arbitrary', 'set', 'of', 'locations', 'then', 'soil', 'maps', 'are', 'constructed', 'offline', 'using', 'kriging', 'a', 'form', 'of', 'gaussian', 'process', 'regression', 'this', 'process', 'is', 'laborious', 'and', 'costly', 'limiting', 'the', 'quality', 'and', 'resolution', 'of', 'the', 'resulting', 'information', 'instead', 'we', 'propose', 'to', 'use', 'an', 'outdoor', 'mobile', 'robot', 'for', 'automatic', 'collection', 'of', 'soil', 'condition', 'data', 'building', 'soil', 'maps', 'online', 'and', 'also', 'adapting', 'the', 'robots', 'exploration', 'strategy', 'onthefly', 'based', 'on', 'the', 'current', 'quality', 'of', 'the', 'map', 'we', 'show', 'how', 'using', 'kriging', 'variance', 'as', 'a', 'reward', 'function', 'for', 'robotic', 'exploration', 'allows', 'for', 'both', 'more', 'efficient', 'data', 'collection', 'and', 'better', 'soil', 'models', 'this', 'work', 'presents', 'the', 'theoretical', 'foundations', 'for', 'our', 'proposal', 'and', 'an', 'experimental', 'comparison', 'of', 'exploration', 'strategies', 'using', 'soil', 'compaction', 'data', 'from', 'a', 'field', 'generated', 'with', 'a', 'mobile', 'robot']]
|
[-0.03643044712880962, 0.05135860165875038, -0.07129975906949236, 0.014578108729398557, -0.11918185624693121, -0.12067204677956815, 0.07188596342320074, 0.42783967953938873, -0.218936682016421, -0.349377229213946, 0.12925629763754073, -0.2587515514862604, -0.17513642285123282, 0.21514743718648363, -0.13834820037580425, 0.11371300453847992, 0.11350089153824432, -0.026449251439862, 0.00825683651566115, -0.23710317312384036, 0.2976275582050164, 0.09086888062808177, 0.3444835596935902, -0.000800100938989694, 0.1523885881045695, 0.04110188340740741, -0.07713003426512575, -0.029176351374235028, -0.0965823866636637, 0.18991908079637967, 0.30872173489589605, 0.2046997137476187, 0.2818117504997283, -0.4623118685327054, -0.2169638485618815, 0.11142192872946863, 0.10982682563433921, 0.0948122395679748, -0.04846641598010844, -0.34095452795302644, 0.04301785047799465, -0.15837085923260968, -0.07505950933576834, -0.1275386291770091, -0.037461730708680495, -0.0006733215363372279, -0.3529385487658915, -0.018858071680539375, -0.009799657522567682, 0.1695527469447195, -0.07567972762789288, -0.08321137398897861, -0.013055481752004728, 0.20950468827721588, -0.0008536539151136596, 0.033147215987092915, 0.2029617609895812, -0.1416065536818311, -0.07360100810653213, 0.3578478072463355, -0.019113752022761596, -0.21913749629035822, 0.19478062591920403, -0.019756517818440563, -0.1020050132329003, 0.12041171269508669, 0.25424227875842487, 0.08256161934262292, -0.22508577061296434, 0.018365610488516898, -0.01876982325768989, 0.16975422797331252, 0.039017026938110454, -0.06769664331645885, 0.1732875114850561, 0.2803857661277542, 0.11592378645198223, 0.15606985380005392, -0.10192889452663174, -0.029357871827409135, -0.24160368834558574, -0.15639762074530403, -0.17804778265761015, -0.03237153633110086, -0.12234266182955106, -0.15363404455288135, 0.3544009479604407, 0.2237143387847366, 0.18627226281251688, 0.11101404568238288, 0.3755595445956873, 0.0416575770396544, 0.05476696689769348, 0.0724633038593514, 0.12490349322534311, -0.011886248181383154, 0.15157923942593776, -0.1682216519542669, 0.11196391115555111, 0.03905732261005396]
|
1,803.0807
|
The isomorphism relation of theories with S-DOP in generalized Baire
spaces
|
We study the Borel-reducibility of isomorphism relations in the generalized
Baire space $\kappa^\kappa$. In the main result we show for inaccessible
$\kappa$, that if $T$ is a classifiable theory and $T'$ is superstable with the
strong dimensional order property (S-DOP), then the isomorphism of models of
$T$ is Borel reducible to the isomorphism of models of $T'$. In fact we show
the consistency of the following: If $\kappa$ is inaccessible and $T$ is a
superstable theory with S-DOP, then the isomorphism of models of $T$ is
$\Sigma_1^1$-complete.
|
math.LO
|
we study the borelreducibility of isomorphism relations in the generalized baire space kappakappa in the main result we show for inaccessible kappa that if t is a classifiable theory and t is superstable with the strong dimensional order property sdop then the isomorphism of models of t is borel reducible to the isomorphism of models of t in fact we show the consistency of the following if kappa is inaccessible and t is a superstable theory with sdop then the isomorphism of models of t is sigma_11complete
|
[['we', 'study', 'the', 'borelreducibility', 'of', 'isomorphism', 'relations', 'in', 'the', 'generalized', 'baire', 'space', 'kappakappa', 'in', 'the', 'main', 'result', 'we', 'show', 'for', 'inaccessible', 'kappa', 'that', 'if', 't', 'is', 'a', 'classifiable', 'theory', 'and', 't', 'is', 'superstable', 'with', 'the', 'strong', 'dimensional', 'order', 'property', 'sdop', 'then', 'the', 'isomorphism', 'of', 'models', 'of', 't', 'is', 'borel', 'reducible', 'to', 'the', 'isomorphism', 'of', 'models', 'of', 't', 'in', 'fact', 'we', 'show', 'the', 'consistency', 'of', 'the', 'following', 'if', 'kappa', 'is', 'inaccessible', 'and', 't', 'is', 'a', 'superstable', 'theory', 'with', 'sdop', 'then', 'the', 'isomorphism', 'of', 'models', 'of', 't', 'is', 'sigma_11complete']]
|
[-0.1684685723417822, 0.19361042703556663, -0.10168873308336034, 0.08362352854353101, -0.0667241608066594, -0.12998467724332038, 0.026576706347987054, 0.3441272603621816, -0.35631642392014756, -0.2138707918498446, 0.06151837781756459, -0.279854531717651, -0.1209433807676439, 0.1428369379218887, -0.056890373129178495, 0.009182951139176594, 0.026208370661034302, 0.13504562766345984, -0.06906152299386176, -0.2657868515124873, 0.3793929039665005, -0.07422745061956126, 0.1975252384429469, 0.06979839423507014, 0.116546508741072, -0.040331972784855785, 0.010364299689364784, 0.07901510847287307, -0.1985653078105636, 0.06776085254900596, 0.25439096952763707, 0.13243210203945638, 0.22610098133822354, -0.2691566919579225, -0.14245077408850193, 0.1755332785165485, 0.07533354718676384, -0.011740117432440028, 0.03670796022257384, -0.2300430803614504, 0.16991723723271313, -0.14388436784639078, -0.10485238188822918, -0.09534064140170813, 0.11483189865453716, 0.006377451173851596, -0.3010155285105986, 0.0485988961861414, 0.20233373326413773, 0.05164925703669296, -0.07158707161160076, -0.019281522551661028, -0.06452714401461622, 0.07556030165184946, 0.03221448596621699, 0.07475712771856172, -0.0026307428858297712, -0.1322289088204236, -0.1200377332224675, 0.3784566237645991, -0.11460990463794374, -0.13060853891074659, 0.21443778209059555, -0.20875961984343389, -0.20806122441940447, 0.05422628016813713, 0.019646668102701798, 0.18368379127453355, -0.0572627019849332, 0.2872464502873995, -0.11411633665728219, 0.1527225880938418, 0.05064005594262305, -0.015647735046770642, 0.10920666198191398, 0.17434518836329088, 0.08173840301220908, 0.17157518166829558, 0.03827959775705548, -0.01613762873937102, -0.36238361801952124, -0.16501352894941673, -0.1426118677153307, 0.10994406923213426, -0.09242651333779042, -0.15059539546423098, 0.3246622048208819, 0.17701507017002716, 0.18598575440838055, 0.11793584760059328, 0.23065568558762178, 0.1037338159759255, 0.05557482009068789, 0.06316098452490919, 0.17244768355260878, 0.2029627029071836, -0.049930319956996864, -0.16549759337897688, 0.006916006112142521, 0.15711007209166009]
|
1,803.08071
|
Eigendecomposition-free Training of Deep Networks with Zero
Eigenvalue-based Losses
|
Many classical Computer Vision problems, such as essential matrix computation
and pose estimation from 3D to 2D correspondences, can be solved by finding the
eigenvector corresponding to the smallest, or zero, eigenvalue of a matrix
representing a linear system. Incorporating this in deep learning frameworks
would allow us to explicitly encode known notions of geometry, instead of
having the network implicitly learn them from data. However, performing
eigendecomposition within a network requires the ability to differentiate this
operation. Unfortunately, while theoretically doable, this introduces numerical
instability in the optimization process in practice.
In this paper, we introduce an eigendecomposition-free approach to training a
deep network whose loss depends on the eigenvector corresponding to a zero
eigenvalue of a matrix predicted by the network. We demonstrate on several
tasks, including keypoint matching and 3D pose estimation, that our approach is
much more robust than explicit differentiation of the eigendecomposition, It
has better convergence properties and yields state-of-the-art results on both
tasks.
|
cs.CV
|
many classical computer vision problems such as essential matrix computation and pose estimation from 3d to 2d correspondences can be solved by finding the eigenvector corresponding to the smallest or zero eigenvalue of a matrix representing a linear system incorporating this in deep learning frameworks would allow us to explicitly encode known notions of geometry instead of having the network implicitly learn them from data however performing eigendecomposition within a network requires the ability to differentiate this operation unfortunately while theoretically doable this introduces numerical instability in the optimization process in practice in this paper we introduce an eigendecompositionfree approach to training a deep network whose loss depends on the eigenvector corresponding to a zero eigenvalue of a matrix predicted by the network we demonstrate on several tasks including keypoint matching and 3d pose estimation that our approach is much more robust than explicit differentiation of the eigendecomposition it has better convergence properties and yields stateoftheart results on both tasks
|
[['many', 'classical', 'computer', 'vision', 'problems', 'such', 'as', 'essential', 'matrix', 'computation', 'and', 'pose', 'estimation', 'from', '3d', 'to', '2d', 'correspondences', 'can', 'be', 'solved', 'by', 'finding', 'the', 'eigenvector', 'corresponding', 'to', 'the', 'smallest', 'or', 'zero', 'eigenvalue', 'of', 'a', 'matrix', 'representing', 'a', 'linear', 'system', 'incorporating', 'this', 'in', 'deep', 'learning', 'frameworks', 'would', 'allow', 'us', 'to', 'explicitly', 'encode', 'known', 'notions', 'of', 'geometry', 'instead', 'of', 'having', 'the', 'network', 'implicitly', 'learn', 'them', 'from', 'data', 'however', 'performing', 'eigendecomposition', 'within', 'a', 'network', 'requires', 'the', 'ability', 'to', 'differentiate', 'this', 'operation', 'unfortunately', 'while', 'theoretically', 'doable', 'this', 'introduces', 'numerical', 'instability', 'in', 'the', 'optimization', 'process', 'in', 'practice', 'in', 'this', 'paper', 'we', 'introduce', 'an', 'eigendecompositionfree', 'approach', 'to', 'training', 'a', 'deep', 'network', 'whose', 'loss', 'depends', 'on', 'the', 'eigenvector', 'corresponding', 'to', 'a', 'zero', 'eigenvalue', 'of', 'a', 'matrix', 'predicted', 'by', 'the', 'network', 'we', 'demonstrate', 'on', 'several', 'tasks', 'including', 'keypoint', 'matching', 'and', '3d', 'pose', 'estimation', 'that', 'our', 'approach', 'is', 'much', 'more', 'robust', 'than', 'explicit', 'differentiation', 'of', 'the', 'eigendecomposition', 'it', 'has', 'better', 'convergence', 'properties', 'and', 'yields', 'stateoftheart', 'results', 'on', 'both', 'tasks']]
|
[-0.04939729629986687, -0.02331139292282387, -0.08004627016780433, 0.06158911467178996, -0.10194601211114787, -0.15983428552135592, 0.008585934939037542, 0.4037479158723727, -0.29410755892749874, -0.3470482065313263, 0.11636115408546174, -0.24486298673728016, -0.2221992228005547, 0.17211604455806082, -0.11587287956044748, 0.12254228298552335, 0.11725728344754316, 0.04567475581134204, -0.13392624135158257, -0.22194462991246838, 0.3033957293620915, 0.03173606886666676, 0.2906215003516991, 0.015752405764942523, 0.128435158936918, 0.009201756408583606, -0.019604293240990955, 0.000980299839284271, -0.06978595021814726, 0.20192006008364843, 0.29720926568552386, 0.18763559362851084, 0.31376155085163193, -0.43897731710458177, -0.2202348342638288, 0.12283667306910502, 0.1691581043356564, 0.12402246945421211, 0.0016245871668616018, -0.28633734939212446, 0.09640400856442284, -0.14521065247827208, -0.04272920687944861, -0.13654714529839113, -0.028156580970971845, -0.06500706191764039, -0.30650866516516545, 0.0583391305495752, 0.07121269919443876, 0.02330534516950138, -0.005423239129595458, -0.11184576314626611, 0.03303706493898062, 0.15366702830797294, 0.021025982872924943, 0.021548609470482916, 0.13280163379095028, -0.1701801731280284, -0.12413912510419323, 0.37484154549310916, -0.011030850089900924, -0.25188748124055566, 0.18632763934147079, -0.056356790233257924, -0.11780102878183243, 0.11204923083132598, 0.20694394660531543, 0.11967948631499895, -0.12891577694681472, 0.05533507414402265, -0.05177650147525128, 0.1620554850072949, 0.03849485674436437, -0.013672934765054379, 0.16459506062819856, 0.20081603631260805, 0.10212394966183638, 0.12156064207738382, -0.08119290832273691, -0.10432514612330124, -0.20962371221176, -0.1076030191470636, -0.23626864052203017, 0.024445719509094486, -0.11452773000028174, -0.1835494356037998, 0.4232365404517623, 0.20923890750673307, 0.2318675460330269, 0.09438778981857468, 0.343707759778772, 0.08863955409906339, 0.10709355276776478, 0.0982326107652625, 0.20244721204799135, 0.10760593173617963, 0.09141930431796937, -0.19664769957889802, 0.09414302785589826, 0.08774902617296902]
|
1,803.08072
|
A Brief Survey of Higgs Bundles
|
Considering a compact Riemann surface of genus greater than two, a
Higgs~bundle is a pair composed of a holomorphic bundle over the Riemann
surface, joint with an auxiliar vector field, so-called Higgs field. This
theory started around thirty years ago, with Hitchin's work, when he reduced
the self-duality equations from dimension four to dimension two, and so,
studied those equations over Riemann surfaces. Hitchin baptized those fields as
"Higgs fields" beacuse in the context of physics and gauge theory, they
describe similar particles to those described by the Higgs bosson. Later,
Simpson used the name "Higgs bundle" for a holomorphic bundle together with a
Higgs field. Today, Higgs bundles are the subject of research in several areas
such as non-abelian Hodge theory, Langlands, mirror symmetry, integrable
systems, quantum field theory (QFT), among others. The main purposes here are
to introduce these objects, and to present a brief construction of the moduli
space of Higgs bundles.
|
math.AG
|
considering a compact riemann surface of genus greater than two a higgsbundle is a pair composed of a holomorphic bundle over the riemann surface joint with an auxiliar vector field socalled higgs field this theory started around thirty years ago with hitchins work when he reduced the selfduality equations from dimension four to dimension two and so studied those equations over riemann surfaces hitchin baptized those fields as higgs fields beacuse in the context of physics and gauge theory they describe similar particles to those described by the higgs bosson later simpson used the name higgs bundle for a holomorphic bundle together with a higgs field today higgs bundles are the subject of research in several areas such as nonabelian hodge theory langlands mirror symmetry integrable systems quantum field theory qft among others the main purposes here are to introduce these objects and to present a brief construction of the moduli space of higgs bundles
|
[['considering', 'a', 'compact', 'riemann', 'surface', 'of', 'genus', 'greater', 'than', 'two', 'a', 'higgsbundle', 'is', 'a', 'pair', 'composed', 'of', 'a', 'holomorphic', 'bundle', 'over', 'the', 'riemann', 'surface', 'joint', 'with', 'an', 'auxiliar', 'vector', 'field', 'socalled', 'higgs', 'field', 'this', 'theory', 'started', 'around', 'thirty', 'years', 'ago', 'with', 'hitchins', 'work', 'when', 'he', 'reduced', 'the', 'selfduality', 'equations', 'from', 'dimension', 'four', 'to', 'dimension', 'two', 'and', 'so', 'studied', 'those', 'equations', 'over', 'riemann', 'surfaces', 'hitchin', 'baptized', 'those', 'fields', 'as', 'higgs', 'fields', 'beacuse', 'in', 'the', 'context', 'of', 'physics', 'and', 'gauge', 'theory', 'they', 'describe', 'similar', 'particles', 'to', 'those', 'described', 'by', 'the', 'higgs', 'bosson', 'later', 'simpson', 'used', 'the', 'name', 'higgs', 'bundle', 'for', 'a', 'holomorphic', 'bundle', 'together', 'with', 'a', 'higgs', 'field', 'today', 'higgs', 'bundles', 'are', 'the', 'subject', 'of', 'research', 'in', 'several', 'areas', 'such', 'as', 'nonabelian', 'hodge', 'theory', 'langlands', 'mirror', 'symmetry', 'integrable', 'systems', 'quantum', 'field', 'theory', 'qft', 'among', 'others', 'the', 'main', 'purposes', 'here', 'are', 'to', 'introduce', 'these', 'objects', 'and', 'to', 'present', 'a', 'brief', 'construction', 'of', 'the', 'moduli', 'space', 'of', 'higgs', 'bundles']]
|
[-0.15420651204246832, 0.16134963090247, -0.08811184303761509, 0.12348000665798808, -0.13301460719269112, -0.18302871557381495, -0.06723628009020008, 0.3102377326913962, -0.2330971747134371, -0.2564438626378481, 0.06945694696026437, -0.21470099582802504, -0.16208804086598225, 0.19301724275819174, -0.10140430741624809, 0.03742337550379728, 0.027731849720064355, 0.0584390732263656, -0.08834734690256148, -0.36013008887024817, 0.4112044034348066, -0.01991319669085849, 0.22035122728036521, 0.009242608682191195, 0.10277050985544185, 0.025085107164494202, -0.009083637800741647, -0.03436373621183233, -0.11083147364460226, 0.16978968260197067, 0.26904038219455334, 0.0438252411856267, 0.2030760169788999, -0.4129548491297388, -0.2263224196149646, 0.13842473916194745, 0.11100029936795563, 0.04905775252815434, 0.01027318860532863, -0.3123547208164574, 0.04353507836946703, -0.14909886909146353, -0.1670423686086188, -0.05234660706283696, 0.015922461605728848, -0.055648351857120075, -0.1544663304628461, -0.030849677945585234, -0.0014249164883758088, 0.14307076763668047, -0.0581253583261155, -0.12671887152215563, -0.09651943329280536, -0.002480627780306876, 0.13408493635544896, 0.09158442306981765, 0.14060028415903952, -0.18602768550140594, -0.1525136442076856, 0.36607845482955637, -0.10334053372286546, -0.1956370735409253, 0.1546680707489079, -0.11844133590286794, -0.15847888879024571, 0.14035797748396076, 0.139580229131848, 0.1484165413942384, -0.079746928784899, 0.1809016778030893, -0.08223511660502195, 0.07994346170457184, 0.09423628965190514, -0.010440111987439818, 0.26329200179928813, 0.10714568251492701, 0.03567213146628714, 0.06156695574999934, -0.026604993539972623, -0.13995787475141697, -0.3965125092194955, -0.24851266684881443, -0.06535389006909866, 0.12960279971287636, -0.04439274420914635, -0.15253206290684543, 0.4155087956307015, 0.059124682196661046, 0.19299089385343618, 0.059017547059690846, 0.22181029441938, 0.05154426909039581, 0.0980814984343995, 0.01909786389105169, 0.23741553606477714, 0.26674603078495956, 0.08094462265389187, -0.09470775901603415, -0.12510081138278015, 0.19253908282476723]
|
1,803.08073
|
Olive Oil is Made of Olives, Baby Oil is Made for Babies: Interpreting
Noun Compounds using Paraphrases in a Neural Model
|
Automatic interpretation of the relation between the constituents of a noun
compound, e.g. olive oil (source) and baby oil (purpose) is an important task
for many NLP applications. Recent approaches are typically based on either
noun-compound representations or paraphrases. While the former has initially
shown promising results, recent work suggests that the success stems from
memorizing single prototypical words for each relation. We explore a neural
paraphrasing approach that demonstrates superior performance when such
memorization is not possible.
|
cs.CL
|
automatic interpretation of the relation between the constituents of a noun compound eg olive oil source and baby oil purpose is an important task for many nlp applications recent approaches are typically based on either nouncompound representations or paraphrases while the former has initially shown promising results recent work suggests that the success stems from memorizing single prototypical words for each relation we explore a neural paraphrasing approach that demonstrates superior performance when such memorization is not possible
|
[['automatic', 'interpretation', 'of', 'the', 'relation', 'between', 'the', 'constituents', 'of', 'a', 'noun', 'compound', 'eg', 'olive', 'oil', 'source', 'and', 'baby', 'oil', 'purpose', 'is', 'an', 'important', 'task', 'for', 'many', 'nlp', 'applications', 'recent', 'approaches', 'are', 'typically', 'based', 'on', 'either', 'nouncompound', 'representations', 'or', 'paraphrases', 'while', 'the', 'former', 'has', 'initially', 'shown', 'promising', 'results', 'recent', 'work', 'suggests', 'that', 'the', 'success', 'stems', 'from', 'memorizing', 'single', 'prototypical', 'words', 'for', 'each', 'relation', 'we', 'explore', 'a', 'neural', 'paraphrasing', 'approach', 'that', 'demonstrates', 'superior', 'performance', 'when', 'such', 'memorization', 'is', 'not', 'possible']]
|
[-0.02218261946034498, 0.04436665558937537, -0.07137172842302765, 0.07610330429713194, -0.13516538822426435, -0.16049057162868288, 0.03324808796139386, 0.41345185256348205, -0.24287850037814143, -0.2952297527547508, 0.07036671952869838, -0.32238676172131914, -0.2204512046285881, 0.2530577620946599, -0.12580972773213991, 0.06947154801291151, 0.10900130010663699, 0.08764605247415602, -0.033682852620049976, -0.2429911170560771, 0.28437616122074616, 0.04407961705090621, 0.39041114862387377, 0.06344602059405775, 0.11175418332128081, -0.015790973422833934, -0.028539576418459032, -0.0412090448065637, -0.04340515398656956, 0.14231605942432696, 0.2967173345386982, 0.14635330891141143, 0.30980970633801264, -0.39453299530447483, -0.23313710130512333, 0.08801035083328876, 0.15113276253713337, 0.11046833137515932, -0.08810257033641952, -0.28230524035648275, 0.07199161249595001, -0.20793573363707998, -0.008556750543320026, -0.09534842900645274, 0.05081477470528812, -0.002162468244279854, -0.21308058370442057, 0.06057114569613567, 0.14713969085520753, 0.056892556902498774, -0.05675623037864287, -0.17225875505485022, 0.02257849832919116, 0.1586788780229817, 0.0827187330309803, 0.06719924804444115, 0.12329561372574133, -0.20979600018845537, -0.15345526203954926, 0.3965511754817831, -0.03608923714058713, -0.1762485161769944, 0.2511334304536621, -0.029762276496069554, -0.181228321726219, 0.050421484459478125, 0.11577107435546051, 0.1007229010365569, -0.1475476494205605, 0.018340867957494292, -0.06163336195720312, 0.2115139396225389, 0.08157779309206092, -0.005910562361793545, 0.26699524060882723, 0.26157071713346225, -0.041841808713238254, 0.15112658352770197, -0.041402606708475224, -0.07039603980284972, -0.17962687044070128, -0.16203581561179212, -0.1664627934417998, -0.008606890559559151, -0.04931496524304981, -0.1398171214905466, 0.33682344858654034, 0.181290308953836, 0.17746665202176723, 0.02932709863839241, 0.32196829343835515, 0.016286064005003143, 0.1010349744405502, 0.049475408874852106, 0.17308002152145865, 0.019343042462610472, 0.07977455420097193, -0.13457552074657705, 0.15013001612626398, 0.07619040184773695]
|
1,803.08074
|
Fractal-like plasmonic self-similar material with a tailorable plasma
frequency in the near-infrared
|
In this work, we show that modulating the fractal dimension of nanoporous
gold allows its effective dielectric response to be tailored over a wide
spectral range of infrared wavelengths. In particular, the plasma edge and
effective plasma frequency depend linearly on the fractal dimension, which can
be controlled by varying the pore and ligament sizes. Importantly, the fractal
porous metal exhibits superior plasmonic properties compared to its bulk
counterpart. These properties, combined with a longer skin depth on the order
of 100-200 nm, enables the penetration of optical energy deep into the
nanopores where molecules can be loaded, thus achieving more effective
light-matter coupling. These findings may open new pathways to engineering the
optical response of fractal-like or self-similar metamaterials without the need
for sophisticated lithographic patterning.
|
cond-mat.mes-hall physics.app-ph
|
in this work we show that modulating the fractal dimension of nanoporous gold allows its effective dielectric response to be tailored over a wide spectral range of infrared wavelengths in particular the plasma edge and effective plasma frequency depend linearly on the fractal dimension which can be controlled by varying the pore and ligament sizes importantly the fractal porous metal exhibits superior plasmonic properties compared to its bulk counterpart these properties combined with a longer skin depth on the order of 100200 nm enables the penetration of optical energy deep into the nanopores where molecules can be loaded thus achieving more effective lightmatter coupling these findings may open new pathways to engineering the optical response of fractallike or selfsimilar metamaterials without the need for sophisticated lithographic patterning
|
[['in', 'this', 'work', 'we', 'show', 'that', 'modulating', 'the', 'fractal', 'dimension', 'of', 'nanoporous', 'gold', 'allows', 'its', 'effective', 'dielectric', 'response', 'to', 'be', 'tailored', 'over', 'a', 'wide', 'spectral', 'range', 'of', 'infrared', 'wavelengths', 'in', 'particular', 'the', 'plasma', 'edge', 'and', 'effective', 'plasma', 'frequency', 'depend', 'linearly', 'on', 'the', 'fractal', 'dimension', 'which', 'can', 'be', 'controlled', 'by', 'varying', 'the', 'pore', 'and', 'ligament', 'sizes', 'importantly', 'the', 'fractal', 'porous', 'metal', 'exhibits', 'superior', 'plasmonic', 'properties', 'compared', 'to', 'its', 'bulk', 'counterpart', 'these', 'properties', 'combined', 'with', 'a', 'longer', 'skin', 'depth', 'on', 'the', 'order', 'of', '100200', 'nm', 'enables', 'the', 'penetration', 'of', 'optical', 'energy', 'deep', 'into', 'the', 'nanopores', 'where', 'molecules', 'can', 'be', 'loaded', 'thus', 'achieving', 'more', 'effective', 'lightmatter', 'coupling', 'these', 'findings', 'may', 'open', 'new', 'pathways', 'to', 'engineering', 'the', 'optical', 'response', 'of', 'fractallike', 'or', 'selfsimilar', 'metamaterials', 'without', 'the', 'need', 'for', 'sophisticated', 'lithographic', 'patterning']]
|
[-0.06507696221512925, 0.2055746535025812, -0.0683102050959316, -0.02204594902756558, -0.08135888599387305, -0.1609895031781882, 0.017823560625373377, 0.4684212592643077, -0.2573636659484276, -0.2873404184599246, 0.05300359402079223, -0.24949078924972728, -0.13964134211996643, 0.21768480655828887, -0.009834164256728657, 0.07570429800323937, -0.007875697635935517, -0.07389385968182735, -0.017877297287102877, -0.1741958893303884, 0.26138319433932594, 0.05824399762695259, 0.3352064947143021, 0.1291610824098209, 0.03467354003164008, -0.025467085804218265, 0.030306486948209956, 0.0611938403618676, -0.1417407621057199, 0.17404994168355475, 0.23935784106179486, -0.03199275872692114, 0.2440653898208732, -0.4828976385710636, -0.2886706591239126, 0.038079666047115025, 0.19724960699787467, 0.09581156815933871, -0.01068633823808169, -0.25374220973834044, 0.04738563145043358, -0.09504506404247634, -0.1598029339513705, -0.0644440023873852, 0.010516988456351902, 0.03313888725687156, -0.2507385078897355, 0.023693232221655387, 0.030212331552234455, 0.06396385243411844, -0.0818818279832609, -0.08513569790781952, -0.03457850053554445, 0.10168465587317826, -0.031169425307472392, -0.00913307705333119, 0.2343924550003167, -0.13763810121674297, -0.0522292147053215, 0.3765634018817814, -0.0716438024409306, -0.14562039857539605, 0.23259269905287597, -0.14015827282133886, 0.0028818646944531305, 0.2095582872907829, 0.19281213295345348, 0.08976096988061634, -0.13216412382284692, 0.04420597832118286, -0.0036422990970166884, 0.2354624558627004, 0.14477189461055293, 0.114906228041115, 0.2304899975452132, 0.24715898891243585, 0.029429685824466357, 0.15541028247973845, -0.09750967116762452, -0.0144792938711283, -0.20121644436213093, -0.1400575668763692, -0.18229124836227673, 0.07250287577392549, -0.18204685843592752, -0.2012431151918814, 0.4233981728201776, 0.15411701952895576, 0.14863080066430756, 0.008170241138927168, 0.266056201424391, 0.08449431877641932, 0.14498071081745695, 0.026299040322742006, 0.25970541171025574, 0.09865302777497142, 0.118779161863403, -0.2480594102251087, 0.06019976993062071, -0.014445795945265866]
|
1,803.08075
|
Neutron stars with spin polarized self-interacting dark matter
|
Dark matter, one of the important portion of the universe, could affect the
visible matter in neutron stars. An important physical feature of dark matter
is due to the spin of dark matter particles. Here, applying the piecewise
polytropic equation of state for the neutron star matter and the equation of
state of spin polarized self-interacting dark matter, we investigate the
structure of neutron stars which are influenced by the spin polarized
self-interacting dark matter. The behavior of the neutron star matter and dark
matter portions for the stars with different values of the interaction between
dark matter particles and spin polarization of dark matter is considered. In
addition, we present the value of the gravitational redshift of these stars in
different cases of spin polarized and self-interacting dark matter.
|
hep-ph astro-ph.HE astro-ph.SR
|
dark matter one of the important portion of the universe could affect the visible matter in neutron stars an important physical feature of dark matter is due to the spin of dark matter particles here applying the piecewise polytropic equation of state for the neutron star matter and the equation of state of spin polarized selfinteracting dark matter we investigate the structure of neutron stars which are influenced by the spin polarized selfinteracting dark matter the behavior of the neutron star matter and dark matter portions for the stars with different values of the interaction between dark matter particles and spin polarization of dark matter is considered in addition we present the value of the gravitational redshift of these stars in different cases of spin polarized and selfinteracting dark matter
|
[['dark', 'matter', 'one', 'of', 'the', 'important', 'portion', 'of', 'the', 'universe', 'could', 'affect', 'the', 'visible', 'matter', 'in', 'neutron', 'stars', 'an', 'important', 'physical', 'feature', 'of', 'dark', 'matter', 'is', 'due', 'to', 'the', 'spin', 'of', 'dark', 'matter', 'particles', 'here', 'applying', 'the', 'piecewise', 'polytropic', 'equation', 'of', 'state', 'for', 'the', 'neutron', 'star', 'matter', 'and', 'the', 'equation', 'of', 'state', 'of', 'spin', 'polarized', 'selfinteracting', 'dark', 'matter', 'we', 'investigate', 'the', 'structure', 'of', 'neutron', 'stars', 'which', 'are', 'influenced', 'by', 'the', 'spin', 'polarized', 'selfinteracting', 'dark', 'matter', 'the', 'behavior', 'of', 'the', 'neutron', 'star', 'matter', 'and', 'dark', 'matter', 'portions', 'for', 'the', 'stars', 'with', 'different', 'values', 'of', 'the', 'interaction', 'between', 'dark', 'matter', 'particles', 'and', 'spin', 'polarization', 'of', 'dark', 'matter', 'is', 'considered', 'in', 'addition', 'we', 'present', 'the', 'value', 'of', 'the', 'gravitational', 'redshift', 'of', 'these', 'stars', 'in', 'different', 'cases', 'of', 'spin', 'polarized', 'and', 'selfinteracting', 'dark', 'matter']]
|
[-0.1287570890182486, 0.254514462125707, -0.15940400730245388, 0.1325033391915405, -0.1354316945402668, -0.038992041951188675, -0.053948939400008666, 0.296308176821241, -0.20243886378593742, -0.3894654155064088, -0.051398549251294195, -0.2747296438050958, 0.02969633125914977, 0.1458676241660634, 0.09188709188646708, 0.006464148075610865, -0.04674374577320682, 0.05144029690955694, -0.023152962454948394, -0.27428512520407544, 0.41809681601679094, -0.007757179474887939, 0.1411302969038773, 0.02077103744332607, 0.11576248666701408, -0.021434263043248882, -0.05670343759254767, -0.09563601395427843, -0.160684275179385, 0.018665201739909557, 0.2056223295991703, 0.0630106616156319, 0.1184999783953222, -0.45101772850522626, -0.25956109553002393, 0.20060265643808703, 0.15441999964487668, 0.11815601769530286, -0.1237769297718142, -0.3399193894977753, 0.01685919281668388, -0.2430616441487263, -0.1485606023038809, -0.019179570073118577, 0.0016758072261626904, 0.027844432721702526, -0.17880572622794155, 0.16475903547655504, 0.0007451583165675402, -0.13012420147514114, -0.13669847261447174, -0.12821338871637217, -0.04724395133626576, -0.03297504066274716, 0.10861585527443542, -0.0027586564887315036, 0.24320454584219708, -0.32793410607936, -0.02984996836883231, 0.45069431881778516, -0.14420483419671654, -0.10405854203809912, 0.14937205519168995, -0.191920810396998, -0.1434744136587072, 0.11739339850520572, 0.13984273659208646, 0.14429634638005295, -0.1172131036735104, 0.09453102912073238, -0.036680296615052684, 0.195077763340221, 0.06632462759645512, 0.07527779593633918, 0.4820612044288562, 0.22326437476306008, 0.027765556097997784, 0.04640148583521995, -0.14962995881572938, -0.07978394880819206, -0.2920384246426133, -0.1714576913831899, -0.16506975191430404, 0.009937211774432889, -0.11851465145725971, -0.10498167041402597, 0.36527843011113315, 0.06349551790178969, 0.0940979218397003, -0.06525378920621454, 0.30650777795280404, 0.045779090089042886, -0.037968719399605805, 0.05270526026948713, 0.35803590381088163, 0.253753085507868, 0.10791552107637892, -0.3106854315900889, -0.00047457142231556085, -0.08152494457765268]
|
1,803.08076
|
Asynchronous Distributed Optimization with Heterogeneous Regularizations
and Normalizations
|
As multi-agent networks grow in size and scale, they become increasingly
difficult to synchronize, though agents must work together even when generating
and sharing different information at different times. Targeting such cases,
this paper presents an asynchronous optimization framework in which the time
between successive communications and computations is unknown and unspecified
for each agent. Agents' updates are carried out in blocks, with each agent
updating only a small subset of all decision variables. To provide robustness
to asynchrony, each agent uses an independently chosen Tikhonov regularization.
Convergence is measured with respect to a weighted block-maximum norm in which
convergence of agents' blocks can be measured in different p-norms and weighted
differently to heterogeneously normalize problems. Asymptotic convergence is
shown and convergence rates are derived explicitly in terms of a problem's
parameters, with only mild restrictions imposed upon them. Simulation results
are provided to verify the theoretical developments made.
|
math.OC
|
as multiagent networks grow in size and scale they become increasingly difficult to synchronize though agents must work together even when generating and sharing different information at different times targeting such cases this paper presents an asynchronous optimization framework in which the time between successive communications and computations is unknown and unspecified for each agent agents updates are carried out in blocks with each agent updating only a small subset of all decision variables to provide robustness to asynchrony each agent uses an independently chosen tikhonov regularization convergence is measured with respect to a weighted blockmaximum norm in which convergence of agents blocks can be measured in different pnorms and weighted differently to heterogeneously normalize problems asymptotic convergence is shown and convergence rates are derived explicitly in terms of a problems parameters with only mild restrictions imposed upon them simulation results are provided to verify the theoretical developments made
|
[['as', 'multiagent', 'networks', 'grow', 'in', 'size', 'and', 'scale', 'they', 'become', 'increasingly', 'difficult', 'to', 'synchronize', 'though', 'agents', 'must', 'work', 'together', 'even', 'when', 'generating', 'and', 'sharing', 'different', 'information', 'at', 'different', 'times', 'targeting', 'such', 'cases', 'this', 'paper', 'presents', 'an', 'asynchronous', 'optimization', 'framework', 'in', 'which', 'the', 'time', 'between', 'successive', 'communications', 'and', 'computations', 'is', 'unknown', 'and', 'unspecified', 'for', 'each', 'agent', 'agents', 'updates', 'are', 'carried', 'out', 'in', 'blocks', 'with', 'each', 'agent', 'updating', 'only', 'a', 'small', 'subset', 'of', 'all', 'decision', 'variables', 'to', 'provide', 'robustness', 'to', 'asynchrony', 'each', 'agent', 'uses', 'an', 'independently', 'chosen', 'tikhonov', 'regularization', 'convergence', 'is', 'measured', 'with', 'respect', 'to', 'a', 'weighted', 'blockmaximum', 'norm', 'in', 'which', 'convergence', 'of', 'agents', 'blocks', 'can', 'be', 'measured', 'in', 'different', 'pnorms', 'and', 'weighted', 'differently', 'to', 'heterogeneously', 'normalize', 'problems', 'asymptotic', 'convergence', 'is', 'shown', 'and', 'convergence', 'rates', 'are', 'derived', 'explicitly', 'in', 'terms', 'of', 'a', 'problems', 'parameters', 'with', 'only', 'mild', 'restrictions', 'imposed', 'upon', 'them', 'simulation', 'results', 'are', 'provided', 'to', 'verify', 'the', 'theoretical', 'developments', 'made']]
|
[-0.12385201368188309, 0.08246745470289071, -0.058142602945736144, 0.049361594862971654, -0.07872823729318239, -0.20372397754486096, 0.05043036517501507, 0.44723320391180144, -0.30629765582145063, -0.301208011452439, 0.1444984429619728, -0.2530850498823801, -0.11342222312767361, 0.14082109444535565, -0.12457640672643744, 0.07704806708136096, 0.07989391165382757, 0.05077865565171295, -0.03829752666029349, -0.33976061981347566, 0.24989442193622677, 0.05425281321938225, 0.25555415231281436, -0.029316637153749832, 0.11869936178098558, 0.0071621153329033405, -0.033353061704720195, 0.03647229265165938, -0.09400479929723046, 0.10154319569905843, 0.31993100063944535, 0.14007766369409305, 0.35295033118863767, -0.46221388350366743, -0.16197425923058512, 0.13405407368633393, 0.18212728486931254, 0.07932473576432597, 0.009848750783193454, -0.27146718528662883, 0.1111276246689109, -0.1288002424439214, -0.07451436101660333, -0.10909610830964772, -0.018606466049252934, 0.08468952329162308, -0.3494117288674052, -0.008676975753120575, 0.010688880807720125, 0.03764371326031176, -0.06411092448822298, -0.12368283345288522, 0.007306304093248941, 0.16804834335631016, 0.10621781725859437, 0.01618628656236782, 0.14949537871556506, -0.087576783845843, -0.10836486848790161, 0.3329443130390467, 0.013092431277540085, -0.2464498733697346, 0.21235611928450698, -0.07338926639105822, -0.17269289149978273, 0.0850175059891331, 0.19684934717126354, 0.1116237369007305, -0.17666600237341323, 0.040073677260315396, -0.0031195265347943517, 0.1692369496615012, 0.07294809672591351, 0.051156970511845035, 0.13155380708347955, 0.14281905312531604, 0.1267510312947608, 0.10002385723527295, 0.01162176741254862, -0.1588652424885564, -0.27760198000642294, -0.08486439799732604, -0.18592889648248642, -0.012162627877252226, -0.12161279265470708, -0.11636802824147241, 0.3339554197233598, 0.1456217305590021, 0.2207911740894102, 0.11212969051101371, 0.31603195109228427, 0.10033712024852394, 0.06098731656281932, 0.12708054645603672, 0.19166452150061927, 0.09599654589200744, 0.07581584004534257, -0.17570021080570547, 0.14260142204836262, 0.03765872766490321]
|
1,803.08077
|
Evidence for a topological "exciton Fermi sea" in bilayer graphene
|
The quantum Hall physics of bilayer graphene is extremely rich due to the
interplay between a layer degree of freedom and delicate fractional states.
Recent experiments show that when an electric field perpendicular to the
bilayer causes Landau levels of opposing layers to cross in energy, a
even-denominator Hall plateau can coexist with a finite density of inter-layer
excitons. We present theoretical and numerical evidence that this observation
is due to a new phase of matter -- a Fermi sea of topological excitons.
|
cond-mat.str-el cond-mat.mes-hall
|
the quantum hall physics of bilayer graphene is extremely rich due to the interplay between a layer degree of freedom and delicate fractional states recent experiments show that when an electric field perpendicular to the bilayer causes landau levels of opposing layers to cross in energy a evendenominator hall plateau can coexist with a finite density of interlayer excitons we present theoretical and numerical evidence that this observation is due to a new phase of matter a fermi sea of topological excitons
|
[['the', 'quantum', 'hall', 'physics', 'of', 'bilayer', 'graphene', 'is', 'extremely', 'rich', 'due', 'to', 'the', 'interplay', 'between', 'a', 'layer', 'degree', 'of', 'freedom', 'and', 'delicate', 'fractional', 'states', 'recent', 'experiments', 'show', 'that', 'when', 'an', 'electric', 'field', 'perpendicular', 'to', 'the', 'bilayer', 'causes', 'landau', 'levels', 'of', 'opposing', 'layers', 'to', 'cross', 'in', 'energy', 'a', 'evendenominator', 'hall', 'plateau', 'can', 'coexist', 'with', 'a', 'finite', 'density', 'of', 'interlayer', 'excitons', 'we', 'present', 'theoretical', 'and', 'numerical', 'evidence', 'that', 'this', 'observation', 'is', 'due', 'to', 'a', 'new', 'phase', 'of', 'matter', 'a', 'fermi', 'sea', 'of', 'topological', 'excitons']]
|
[-0.21645485801713132, 0.2534993385469112, -0.08470023356991388, 0.02776358860811764, -0.04393526473332469, -0.1343955942940694, 0.08962712209478657, 0.3235402840712085, -0.2727003888363337, -0.3236603841821595, -0.05493458242456588, -0.2883249306596997, -0.1642902768444179, 0.14484521009527693, -0.006045268990508303, -0.00636357829974192, 0.011400110088288784, -0.09925902068115226, -0.06646972863435201, -0.20720435811842725, 0.31266202385645225, 0.029002923948588076, 0.31645975226718115, 0.1700556425196005, 0.08054507719125689, -0.04514738321361109, 0.1100454383995384, 0.03854668775300791, -0.13702658845041452, 0.07937860117143407, 0.26514499657219504, -0.16601174883686415, 0.24670283161330878, -0.48395380623093465, -0.17621535010544992, 0.003943649396050449, 0.11778549818185771, 0.182258898801193, -0.08733335176125033, -0.3023792423376041, 0.03211323238863814, -0.16424038314999495, -0.10093898471535706, -0.08667931056626868, 0.023301142473739187, -0.050870487648175984, -0.23367337598578958, 0.13692892222131445, 0.03582931885200485, 0.06519182917673322, -0.06901037447699686, -0.1235684775349843, -0.0903078039040471, 0.044249586152301804, 0.06725190593804256, 0.04772770921018247, 0.12879673057099486, -0.22562321090059945, -0.16193924037875926, 0.3556825643087306, -0.052402029353443805, -0.12678235546663041, 0.2174653320107609, -0.19923694641897227, -0.045606631140023036, 0.15824246454257063, 0.14710230497279908, 0.05320885036390547, -0.05740390484957394, 0.08534718606842501, -0.06330951573128425, 0.19981972613689922, 0.025216200681425993, 0.09581043844383846, 0.3039119024761021, 0.17158094817125125, 0.09867442988722426, 0.15138866043104449, -0.14922335862874894, -0.09197820865878517, -0.25455787796072843, -0.20756247945530226, -0.207079346385421, 0.09748882455637724, -0.01531931727225949, -0.2045326970585781, 0.43844424715129343, 0.12535815445632423, 0.19423692628014377, -0.06975196443907009, 0.2749203223246718, 0.14055672081232798, 0.04142113397374931, 0.012372543830878852, 0.24069497140306162, 0.20173210960744722, 0.0976215669907993, -0.2762602114731946, 0.02052743927286029, -0.01008621676932884]
|
1,803.08078
|
Dissipation by normal-metal traps in transmon qubits
|
Quasiparticles are an intrinsic source of relaxation and decoherence for
superconducting qubits. Recent works have shown that normal-metal traps may be
used to evacuate quasiparticles, and potentially improve the qubit life time.
Here, we investigate how far the normal metals themselves may introduce qubit
relaxation. We identify the ohmic losses inside the normal metal and the
tunnelling current through the normal metal-superconductor interface as the
relevant relaxation mechanisms. We show that the ohmic loss contribution
depends strongly on the device and trap geometry, as a result of the
inhomogeneous electric fields in the qubit. The correction of the quality
factor due to the tunnelling current on the other hand is highly sensitive to
the nonequilibrium distribution function of the quasiparticles. Overall, we
show that even when choosing less than optimal parameters, the presence of
normal-metal traps does not affect the quality factor of state-of-the-art
qubits.
|
cond-mat.mes-hall quant-ph
|
quasiparticles are an intrinsic source of relaxation and decoherence for superconducting qubits recent works have shown that normalmetal traps may be used to evacuate quasiparticles and potentially improve the qubit life time here we investigate how far the normal metals themselves may introduce qubit relaxation we identify the ohmic losses inside the normal metal and the tunnelling current through the normal metalsuperconductor interface as the relevant relaxation mechanisms we show that the ohmic loss contribution depends strongly on the device and trap geometry as a result of the inhomogeneous electric fields in the qubit the correction of the quality factor due to the tunnelling current on the other hand is highly sensitive to the nonequilibrium distribution function of the quasiparticles overall we show that even when choosing less than optimal parameters the presence of normalmetal traps does not affect the quality factor of stateoftheart qubits
|
[['quasiparticles', 'are', 'an', 'intrinsic', 'source', 'of', 'relaxation', 'and', 'decoherence', 'for', 'superconducting', 'qubits', 'recent', 'works', 'have', 'shown', 'that', 'normalmetal', 'traps', 'may', 'be', 'used', 'to', 'evacuate', 'quasiparticles', 'and', 'potentially', 'improve', 'the', 'qubit', 'life', 'time', 'here', 'we', 'investigate', 'how', 'far', 'the', 'normal', 'metals', 'themselves', 'may', 'introduce', 'qubit', 'relaxation', 'we', 'identify', 'the', 'ohmic', 'losses', 'inside', 'the', 'normal', 'metal', 'and', 'the', 'tunnelling', 'current', 'through', 'the', 'normal', 'metalsuperconductor', 'interface', 'as', 'the', 'relevant', 'relaxation', 'mechanisms', 'we', 'show', 'that', 'the', 'ohmic', 'loss', 'contribution', 'depends', 'strongly', 'on', 'the', 'device', 'and', 'trap', 'geometry', 'as', 'a', 'result', 'of', 'the', 'inhomogeneous', 'electric', 'fields', 'in', 'the', 'qubit', 'the', 'correction', 'of', 'the', 'quality', 'factor', 'due', 'to', 'the', 'tunnelling', 'current', 'on', 'the', 'other', 'hand', 'is', 'highly', 'sensitive', 'to', 'the', 'nonequilibrium', 'distribution', 'function', 'of', 'the', 'quasiparticles', 'overall', 'we', 'show', 'that', 'even', 'when', 'choosing', 'less', 'than', 'optimal', 'parameters', 'the', 'presence', 'of', 'normalmetal', 'traps', 'does', 'not', 'affect', 'the', 'quality', 'factor', 'of', 'stateoftheart', 'qubits']]
|
[-0.14172296411566565, 0.19399798570034207, -0.02848317267308975, 0.05474563186811604, -0.044872784396183904, -0.16775649825496405, 0.07619970070422981, 0.3832665547407393, -0.23723061264588916, -0.2916750681169074, 0.020332163041618105, -0.29311363488949577, -0.11128095799478992, 0.22720511638527285, -0.05264320898608401, 0.0054971791129430824, 0.03006412266143437, -0.014021724231284241, -0.08365790348435784, -0.25584826283317447, 0.3160037898153452, 0.06259608317551942, 0.35197961141258993, 0.0971167704315278, 0.04380638169060493, -0.014880237853604143, 0.06209028425208967, 0.005428469669202279, -0.11108725541025392, 0.05165702251010928, 0.2315302648164075, 0.01244216394321672, 0.22580559436745684, -0.5199961967123994, -0.20909644777019476, 0.059260985349176516, 0.16417430211982592, 0.15695466910617362, -0.016538007854451905, -0.24232292431246105, 0.0064578557595739074, -0.14696386758366536, -0.0965808136308373, -0.0751043369576078, -0.005104994076175679, 0.014673330382732996, -0.23204239228868792, 0.08875475173719741, 0.1045811066379899, -0.028363964966787347, -0.028224456400193016, -0.08200712436167844, 0.0004972402183017854, 0.11232916046283208, 0.023691712668294024, 0.01769109664741775, 0.26145735075877946, -0.15760009219741514, -0.09093468647835584, 0.31262739084917923, -0.07661883034151257, -0.1808434946912116, 0.20685764718158492, -0.17493753636833922, -0.010648057839415711, 0.09342922189369283, 0.14572512096372145, 0.11020443398698136, -0.16175758106973231, 0.03344332980401493, 0.02242131707226408, 0.16990273994522104, 0.030874901380518387, 0.11070499525822956, 0.20989720161105024, 0.16828811452121892, 0.08373895547160044, 0.1418155042675388, -0.10572858811877989, -0.05496552956394916, -0.2656515280041715, -0.16826394330067881, -0.20912985995026498, 0.11150544281930518, -0.04656003734763262, -0.18718357553187726, 0.40814290881028464, 0.17786358994078533, 0.17697189522200618, -0.05008565382710819, 0.31338200345635414, 0.15737168826283246, 0.10068483022844484, 0.07596638088981653, 0.2661416692273884, 0.11867963904514908, 0.057865513710240866, -0.34066474606957414, 0.1182821151455222, -0.03272607148432269]
|
1,803.08079
|
Spectrahedral Lifts of Convex Sets
|
Efficient representations of convex sets are of crucial importance for many
algorithms that work with them. It is well-known that sometimes, a complicated
convex set can be expressed as the projection of a much simpler set in higher
dimensions called a lift of the original set. This is a brief survey of recent
developments in the topic of lifts of convex sets. Our focus will be on lifts
that arise from affine slices of real positive semidefinite cones known as psd
or spectrahedral lifts. The main result is that projection representations of a
convex set are controlled by factorizations, through closed convex cones, of an
operator that comes from the convex set. This leads to several research
directions and results that lie at the intersection of convex geometry,
combinatorics, real algebraic geometry, optimization, computer science and
more.
|
math.OC math.CO
|
efficient representations of convex sets are of crucial importance for many algorithms that work with them it is wellknown that sometimes a complicated convex set can be expressed as the projection of a much simpler set in higher dimensions called a lift of the original set this is a brief survey of recent developments in the topic of lifts of convex sets our focus will be on lifts that arise from affine slices of real positive semidefinite cones known as psd or spectrahedral lifts the main result is that projection representations of a convex set are controlled by factorizations through closed convex cones of an operator that comes from the convex set this leads to several research directions and results that lie at the intersection of convex geometry combinatorics real algebraic geometry optimization computer science and more
|
[['efficient', 'representations', 'of', 'convex', 'sets', 'are', 'of', 'crucial', 'importance', 'for', 'many', 'algorithms', 'that', 'work', 'with', 'them', 'it', 'is', 'wellknown', 'that', 'sometimes', 'a', 'complicated', 'convex', 'set', 'can', 'be', 'expressed', 'as', 'the', 'projection', 'of', 'a', 'much', 'simpler', 'set', 'in', 'higher', 'dimensions', 'called', 'a', 'lift', 'of', 'the', 'original', 'set', 'this', 'is', 'a', 'brief', 'survey', 'of', 'recent', 'developments', 'in', 'the', 'topic', 'of', 'lifts', 'of', 'convex', 'sets', 'our', 'focus', 'will', 'be', 'on', 'lifts', 'that', 'arise', 'from', 'affine', 'slices', 'of', 'real', 'positive', 'semidefinite', 'cones', 'known', 'as', 'psd', 'or', 'spectrahedral', 'lifts', 'the', 'main', 'result', 'is', 'that', 'projection', 'representations', 'of', 'a', 'convex', 'set', 'are', 'controlled', 'by', 'factorizations', 'through', 'closed', 'convex', 'cones', 'of', 'an', 'operator', 'that', 'comes', 'from', 'the', 'convex', 'set', 'this', 'leads', 'to', 'several', 'research', 'directions', 'and', 'results', 'that', 'lie', 'at', 'the', 'intersection', 'of', 'convex', 'geometry', 'combinatorics', 'real', 'algebraic', 'geometry', 'optimization', 'computer', 'science', 'and', 'more']]
|
[-0.10438401771481591, 0.0527703171251996, -0.07817440043223926, 0.05777148584695873, -0.1272943136588174, -0.10462747845649176, -0.009350411467301747, 0.3476544215214731, -0.3482465624000306, -0.22404883670736186, 0.138457470955871, -0.27132554541267184, -0.21043126541699697, 0.2545904408661091, -0.14485071065502553, 0.017122362189701874, 0.08649843668796285, -0.00978927643983251, -0.12569285142677325, -0.2878210518957816, 0.374056827039016, -0.030620551470966234, 0.22829967596479794, 0.05934001936366523, 0.097165137848878, 0.002679850624017689, -0.011568892808345548, 0.08082522090565222, -0.06275426127162276, 0.20185584428781359, 0.3291636020842477, 0.22701162257211377, 0.29214607332459225, -0.429572103191575, -0.14465802166284653, 0.12041649577313232, 0.12807613074861085, 0.04326724455297591, -0.05000562467206572, -0.24603935770935167, 0.06555484466757762, -0.10081298617870431, -0.10443723349267767, -0.11126273870977987, 0.013780629524050186, -0.008518716177637995, -0.2320450524613431, -0.01615479377771381, 0.10861046690439438, 0.08016774257522648, -0.04375320603819496, -0.16209296322934139, -0.01934045752388065, 0.07317693757375933, 0.03817119317666294, 0.10723386794909917, 0.11867799709489854, -0.07601416313232187, -0.14941649828412074, 0.3818479966453827, 0.03135350005986699, -0.25401603796240624, 0.19754387449598906, -0.14419925330125177, -0.12810286233731866, 0.15553926578705898, 0.19679459699014895, 0.16064922806779672, -0.10575160649639086, 0.15113906749187678, -0.14975471969313212, 0.061234802181023534, 0.07249680807963557, -0.00491418420921554, 0.19569395991538507, 0.11377268189854961, 0.16483933608392662, 0.15311270277185815, 0.00716267189288845, -0.09450896128495462, -0.3277632354437476, -0.11809415610534323, -0.2101015222265664, 0.08205059616670121, -0.09352040978426447, -0.18528222808118122, 0.40777499187928046, 0.06899627948342993, 0.20628224132942838, 0.09460756699486643, 0.2980934077207624, 0.08247611878227772, 0.06502393221977187, 0.03285583420350713, 0.16428400723120865, 0.13750303039211698, -0.005919597444743136, -0.1402795963043714, 0.028832745650803574, 0.10516975444646376]
|
1,803.0808
|
A flavoured dark sector
|
We explore the phenomenology of a QCD-like dark sector which confines around
the GeV scale. The dark sector inherits a flavour structure from a coupling
between dark quarks and SM quarks via a heavy mediator, which leads to exciting
new phenomena. While stable baryonic bound states are the dark matter
candidates, the phenomenology is dominated by the lightest composite mesons,
the dark pions, which can have decay lengths ranging from millimetres to
hundreds of meters. For masses below 1.5 GeV, their exclusive decays to SM
mesons are calculated for the first time by matching both dark and visible
sectors to a chiral Lagrangian. Constraints from big bang nucleosynthesis, dark
matter direct detection and flavour single out a small region of allowed
parameter space for dark pion masses below 5 GeV. It is best probed by the
fixed target experiments NA62 and SHiP, where dark pions can be produced
copiously in rare decays like B to K piD. Heavier dark pions are best searched
for at the LHC, where they decay after hadronisation to produce jets which
emerge into SM states within the detector. Here the flavour structure ensures
different flavours emerge on different length scales, leading to a striking new
feature in the emerging jets signature.
|
hep-ph hep-ex
|
we explore the phenomenology of a qcdlike dark sector which confines around the gev scale the dark sector inherits a flavour structure from a coupling between dark quarks and sm quarks via a heavy mediator which leads to exciting new phenomena while stable baryonic bound states are the dark matter candidates the phenomenology is dominated by the lightest composite mesons the dark pions which can have decay lengths ranging from millimetres to hundreds of meters for masses below 15 gev their exclusive decays to sm mesons are calculated for the first time by matching both dark and visible sectors to a chiral lagrangian constraints from big bang nucleosynthesis dark matter direct detection and flavour single out a small region of allowed parameter space for dark pion masses below 5 gev it is best probed by the fixed target experiments na62 and ship where dark pions can be produced copiously in rare decays like b to k pid heavier dark pions are best searched for at the lhc where they decay after hadronisation to produce jets which emerge into sm states within the detector here the flavour structure ensures different flavours emerge on different length scales leading to a striking new feature in the emerging jets signature
|
[['we', 'explore', 'the', 'phenomenology', 'of', 'a', 'qcdlike', 'dark', 'sector', 'which', 'confines', 'around', 'the', 'gev', 'scale', 'the', 'dark', 'sector', 'inherits', 'a', 'flavour', 'structure', 'from', 'a', 'coupling', 'between', 'dark', 'quarks', 'and', 'sm', 'quarks', 'via', 'a', 'heavy', 'mediator', 'which', 'leads', 'to', 'exciting', 'new', 'phenomena', 'while', 'stable', 'baryonic', 'bound', 'states', 'are', 'the', 'dark', 'matter', 'candidates', 'the', 'phenomenology', 'is', 'dominated', 'by', 'the', 'lightest', 'composite', 'mesons', 'the', 'dark', 'pions', 'which', 'can', 'have', 'decay', 'lengths', 'ranging', 'from', 'millimetres', 'to', 'hundreds', 'of', 'meters', 'for', 'masses', 'below', '15', 'gev', 'their', 'exclusive', 'decays', 'to', 'sm', 'mesons', 'are', 'calculated', 'for', 'the', 'first', 'time', 'by', 'matching', 'both', 'dark', 'and', 'visible', 'sectors', 'to', 'a', 'chiral', 'lagrangian', 'constraints', 'from', 'big', 'bang', 'nucleosynthesis', 'dark', 'matter', 'direct', 'detection', 'and', 'flavour', 'single', 'out', 'a', 'small', 'region', 'of', 'allowed', 'parameter', 'space', 'for', 'dark', 'pion', 'masses', 'below', '5', 'gev', 'it', 'is', 'best', 'probed', 'by', 'the', 'fixed', 'target', 'experiments', 'na62', 'and', 'ship', 'where', 'dark', 'pions', 'can', 'be', 'produced', 'copiously', 'in', 'rare', 'decays', 'like', 'b', 'to', 'k', 'pid', 'heavier', 'dark', 'pions', 'are', 'best', 'searched', 'for', 'at', 'the', 'lhc', 'where', 'they', 'decay', 'after', 'hadronisation', 'to', 'produce', 'jets', 'which', 'emerge', 'into', 'sm', 'states', 'within', 'the', 'detector', 'here', 'the', 'flavour', 'structure', 'ensures', 'different', 'flavours', 'emerge', 'on', 'different', 'length', 'scales', 'leading', 'to', 'a', 'striking', 'new', 'feature', 'in', 'the', 'emerging', 'jets', 'signature']]
|
[-0.07621542976500051, 0.3433439918992661, -0.11122473070931449, 0.18799929357545214, -0.08884317456468831, -0.18402078900332516, 0.018197206617559043, 0.28888348999401575, -0.2322292296753889, -0.3388114242353341, -0.037951252862892464, -0.32009099002077596, 0.07956149451461739, 0.10830760856263014, 0.10516590836841627, 0.04247738581910295, 0.03674841261224695, 0.01379942425155958, -0.032881516229713935, -0.2063492101513175, 0.27725422032882724, 0.02442883701827739, 0.1699911928775232, 0.1030393937643328, 0.05088130650291382, -0.05308348359540105, -0.003350895995644907, -0.096998282005356, -0.12486497963014628, 0.02677271154978159, 0.20659789698451614, 0.08876067280963751, 0.12994557316457397, -0.37521916668685784, -0.1739075108548825, 0.18768680540311322, 0.19602040172830332, 0.07821036789349271, -0.0984706425597412, -0.37938787955881176, 0.11800091951922739, -0.18390244518370522, -0.10795518552242479, -0.06531973577667372, -0.04539406038730324, -0.09926770322586555, -0.29099162757618224, 0.08313139813197144, -0.10220990991259436, -0.03117611505163526, -0.002860194944677133, -0.19866160375689998, -0.046438657486521935, -0.0010745883941903566, 0.17331699196258288, 0.0184660052283875, 0.23038793156529297, -0.21622548773161415, -0.13320966722506994, 0.45020181399959963, -0.10036270323523673, -0.09394917326744248, 0.1797790142189874, -0.161733493534396, -0.13463833320862445, 0.191128537944943, 0.21300824597484694, 0.07188169350389852, -0.16576486869626994, 0.1205054094146901, -0.056520464831230785, 0.2059570066478257, 0.10539260631183035, 0.09841845933521998, 0.3458145600743592, 0.22991746807362415, 0.03811039316391084, 0.005425323211719074, -0.07920921168140886, -0.0955551540483585, -0.38678934076547766, -0.10014132851790139, -0.07565182088467393, 0.02852128845474511, -0.05831820557012055, -0.05089481627722316, 0.3900991051516595, 0.05984038026388554, 0.2520124011964637, -0.018411392427402213, 0.3035835270607139, -0.004322645819556077, 0.09392060636620725, 0.08010440605502685, 0.3488199172939346, 0.1333139046198164, 0.1349740435981906, -0.20414269754314995, -0.0455213530368886, 0.02906558019995183]
|
1,803.08081
|
Renewal Population Dynamics and their Eternal Family Trees
|
Based on a simple object, an i.i.d. sequence of positive integer-valued
random variables, $\{a_n\}_{n\in \mathbb{Z}}$, we introduce and study two
random structures and their connections. First, a population dynamics, in which
each individual is born at time $n$ and dies at time $n+a_n$. This dynamics is
that of a D/GI/$\infty$ queue, with arrivals at integer times and service times
given by $\{a_n\}_{n\in \mathbb{Z}}$. Second, the directed random graph $T^f$
on $\mathbb{Z}$ generated by the random map $f(n)=n+a_n$. Only assuming
$\mathbb{E}[a_0]<\infty$ and $\mathbb{P}[a_0=1]>0$, we show that, in steady
state, the population dynamics is regenerative, with one individual alive at
each regenerative epochs. We identify a unimodular structure in this dynamics.
More precisely, $T^f$ is a unimodular directed tree, in which $f(n)$ is the
parent of $n$. This tree has a unique bi-infinite path. Moreover, $T^f$ splits
the integers into two categories: ephemeral integers, with a finite number of
descendants of all degrees, and successful integers, with an infinite number.
Each regenerative epoch is a successful individual such that all integers less
than it are its descendants of some order. Ephemeral, successful, and
regenerative integers form stationary and mixing point processes on
$\mathbb{Z}$.
|
math.PR
|
based on a simple object an iid sequence of positive integervalued random variables a_n_nin mathbbz we introduce and study two random structures and their connections first a population dynamics in which each individual is born at time n and dies at time na_n this dynamics is that of a dgiinfty queue with arrivals at integer times and service times given by a_n_nin mathbbz second the directed random graph tf on mathbbz generated by the random map fnna_n only assuming mathbbea_0infty and mathbbpa_010 we show that in steady state the population dynamics is regenerative with one individual alive at each regenerative epochs we identify a unimodular structure in this dynamics more precisely tf is a unimodular directed tree in which fn is the parent of n this tree has a unique biinfinite path moreover tf splits the integers into two categories ephemeral integers with a finite number of descendants of all degrees and successful integers with an infinite number each regenerative epoch is a successful individual such that all integers less than it are its descendants of some order ephemeral successful and regenerative integers form stationary and mixing point processes on mathbbz
|
[['based', 'on', 'a', 'simple', 'object', 'an', 'iid', 'sequence', 'of', 'positive', 'integervalued', 'random', 'variables', 'a_n_nin', 'mathbbz', 'we', 'introduce', 'and', 'study', 'two', 'random', 'structures', 'and', 'their', 'connections', 'first', 'a', 'population', 'dynamics', 'in', 'which', 'each', 'individual', 'is', 'born', 'at', 'time', 'n', 'and', 'dies', 'at', 'time', 'na_n', 'this', 'dynamics', 'is', 'that', 'of', 'a', 'dgiinfty', 'queue', 'with', 'arrivals', 'at', 'integer', 'times', 'and', 'service', 'times', 'given', 'by', 'a_n_nin', 'mathbbz', 'second', 'the', 'directed', 'random', 'graph', 'tf', 'on', 'mathbbz', 'generated', 'by', 'the', 'random', 'map', 'fnna_n', 'only', 'assuming', 'mathbbea_0infty', 'and', 'mathbbpa_010', 'we', 'show', 'that', 'in', 'steady', 'state', 'the', 'population', 'dynamics', 'is', 'regenerative', 'with', 'one', 'individual', 'alive', 'at', 'each', 'regenerative', 'epochs', 'we', 'identify', 'a', 'unimodular', 'structure', 'in', 'this', 'dynamics', 'more', 'precisely', 'tf', 'is', 'a', 'unimodular', 'directed', 'tree', 'in', 'which', 'fn', 'is', 'the', 'parent', 'of', 'n', 'this', 'tree', 'has', 'a', 'unique', 'biinfinite', 'path', 'moreover', 'tf', 'splits', 'the', 'integers', 'into', 'two', 'categories', 'ephemeral', 'integers', 'with', 'a', 'finite', 'number', 'of', 'descendants', 'of', 'all', 'degrees', 'and', 'successful', 'integers', 'with', 'an', 'infinite', 'number', 'each', 'regenerative', 'epoch', 'is', 'a', 'successful', 'individual', 'such', 'that', 'all', 'integers', 'less', 'than', 'it', 'are', 'its', 'descendants', 'of', 'some', 'order', 'ephemeral', 'successful', 'and', 'regenerative', 'integers', 'form', 'stationary', 'and', 'mixing', 'point', 'processes', 'on', 'mathbbz']]
|
[-0.1860037840433409, 0.22327756898351298, -0.06263375230180847, 0.02269272281125905, -0.03789860606791182, -0.16061195330495104, 0.0716876760405304, 0.386515406956448, -0.29810997898526054, -0.20117518561767703, 0.08590367499005577, -0.2896303791094591, -0.12369593277755368, 0.10897908672032987, -0.013272778517043686, -0.019017109146558325, 0.052513675932289366, 0.1422773943043608, 0.019263356980085772, -0.2917781892890312, 0.29061933659156536, -0.009339442788212396, 0.20533842543752634, -0.07155590277806548, 0.1338668505432094, 0.014452963108744691, 0.004952783624761125, -0.009505880941801211, -0.11647128210542941, 0.04281226891954554, 0.2292272055454373, 0.11748078020468833, 0.3197019836743347, -0.42115132902614416, -0.17698804678066687, 0.18519661112882715, 0.15093978397040206, 0.06322112596325481, -0.036901224310958713, -0.2351108515027532, 0.14808127048355652, -0.13731858841663994, -0.08559618159016734, 0.006265752142006382, 0.10883093997836113, 0.061417240751558605, -0.2914248579396508, 0.010099324829786777, 0.07282388642838693, 0.06481542621420468, -0.010652751712262988, -0.1468853561337141, -0.0395342674962977, 0.15026443660638064, -0.014019718309017744, 0.039728754813245, 0.1035935316947015, -0.06706567360013524, -0.14136249333480622, 0.3480169448931826, -0.0715842648919947, -0.17620927248807514, 0.1657120941224244, -0.17066483097997578, -0.21421545130365036, 0.15847352131912334, 0.12074631086754847, 0.14461326656892975, -0.1317362953329155, 0.07520219509584461, -0.07993083579694843, 0.14769578491101654, 0.08448537705555798, 0.019304748637014053, 0.20724025668121437, 0.1472736245648746, 0.08731382491843984, 0.1203867151043353, -0.039134120139079215, -0.09595550270253085, -0.2688717875968326, -0.13215982883092872, -0.20082313721416828, 0.13635751471187382, -0.1455406799039649, -0.16871057728674005, 0.4071206741127121, 0.10372916647895454, 0.21004471285916107, 0.14494244857531857, 0.26108887978894185, 0.10824286778840948, 0.017703993424006245, 0.1137925189058172, 0.023101677508796888, 0.10892522308905733, 0.01541874823807913, -0.14642426298503555, 0.08587069525433216, 0.09670450345906902]
|
1,803.08082
|
The Derivation of the $\mathbb{T}^{3}$ Energy-critical NLS from Quantum
Many-body Dynamics
|
We derive the 3D energy critical quintic NLS from quantum many-body dynamics
with 3-body interaction in the T^3 (periodic) setting. Due to the known
complexity of the energy critical setting, previous progress was limited in
comparison to the 2-body interaction case yielding energy subcritical cubic
NLS. Previously, the only result for the 3D energy critical case was HTX, which
proved the uniqueness part of the argument in the case of small solutions. In
the main part of this paper, we develop methods to prove the convergence of the
BBGKY hierarchy to the infinite Gross-Pitaevskii (GP) hierarchy, and
separately, the uniqueness of large GP solutions. Since the trace estimate used
in the previous proofs of convergence is the false sharp trace estimate in our
setting, we instead introduce a new frequency interaction analysis and apply
the finite dimensional quantum de Finetti theorem. For the large solution
uniqueness argument, we discover the new HUFL (hierarchical uniform frequency
localization) property for the GP hierarchy and use it to prove a new type of
uniqueness theorem. The HUFL property reduces to a new statement even for NLS.
With the help of CKSTT,IP which proved the global well-posedness for the
quintic NLS, this new uniqueness theorem establishes global uniqueness.
|
math.AP math-ph math.MP
|
we derive the 3d energy critical quintic nls from quantum manybody dynamics with 3body interaction in the t3 periodic setting due to the known complexity of the energy critical setting previous progress was limited in comparison to the 2body interaction case yielding energy subcritical cubic nls previously the only result for the 3d energy critical case was htx which proved the uniqueness part of the argument in the case of small solutions in the main part of this paper we develop methods to prove the convergence of the bbgky hierarchy to the infinite grosspitaevskii gp hierarchy and separately the uniqueness of large gp solutions since the trace estimate used in the previous proofs of convergence is the false sharp trace estimate in our setting we instead introduce a new frequency interaction analysis and apply the finite dimensional quantum de finetti theorem for the large solution uniqueness argument we discover the new hufl hierarchical uniform frequency localization property for the gp hierarchy and use it to prove a new type of uniqueness theorem the hufl property reduces to a new statement even for nls with the help of cksttip which proved the global wellposedness for the quintic nls this new uniqueness theorem establishes global uniqueness
|
[['we', 'derive', 'the', '3d', 'energy', 'critical', 'quintic', 'nls', 'from', 'quantum', 'manybody', 'dynamics', 'with', '3body', 'interaction', 'in', 'the', 't3', 'periodic', 'setting', 'due', 'to', 'the', 'known', 'complexity', 'of', 'the', 'energy', 'critical', 'setting', 'previous', 'progress', 'was', 'limited', 'in', 'comparison', 'to', 'the', '2body', 'interaction', 'case', 'yielding', 'energy', 'subcritical', 'cubic', 'nls', 'previously', 'the', 'only', 'result', 'for', 'the', '3d', 'energy', 'critical', 'case', 'was', 'htx', 'which', 'proved', 'the', 'uniqueness', 'part', 'of', 'the', 'argument', 'in', 'the', 'case', 'of', 'small', 'solutions', 'in', 'the', 'main', 'part', 'of', 'this', 'paper', 'we', 'develop', 'methods', 'to', 'prove', 'the', 'convergence', 'of', 'the', 'bbgky', 'hierarchy', 'to', 'the', 'infinite', 'grosspitaevskii', 'gp', 'hierarchy', 'and', 'separately', 'the', 'uniqueness', 'of', 'large', 'gp', 'solutions', 'since', 'the', 'trace', 'estimate', 'used', 'in', 'the', 'previous', 'proofs', 'of', 'convergence', 'is', 'the', 'false', 'sharp', 'trace', 'estimate', 'in', 'our', 'setting', 'we', 'instead', 'introduce', 'a', 'new', 'frequency', 'interaction', 'analysis', 'and', 'apply', 'the', 'finite', 'dimensional', 'quantum', 'de', 'finetti', 'theorem', 'for', 'the', 'large', 'solution', 'uniqueness', 'argument', 'we', 'discover', 'the', 'new', 'hufl', 'hierarchical', 'uniform', 'frequency', 'localization', 'property', 'for', 'the', 'gp', 'hierarchy', 'and', 'use', 'it', 'to', 'prove', 'a', 'new', 'type', 'of', 'uniqueness', 'theorem', 'the', 'hufl', 'property', 'reduces', 'to', 'a', 'new', 'statement', 'even', 'for', 'nls', 'with', 'the', 'help', 'of', 'cksttip', 'which', 'proved', 'the', 'global', 'wellposedness', 'for', 'the', 'quintic', 'nls', 'this', 'new', 'uniqueness', 'theorem', 'establishes', 'global', 'uniqueness']]
|
[-0.11914251070551861, 0.009071156994175555, -0.0802207645283669, 0.13508678191232573, -0.07161433808621372, -0.141059764542742, 0.035222148216348045, 0.23711689769763, -0.28670788986205276, -0.25722996692580924, 0.13123273862113444, -0.23465112943795338, -0.13655055420234596, 0.17083584608635238, -0.048752030190914425, 0.08839109718141641, 0.06753608813759551, 0.016908739369121652, -0.05647527564557927, -0.2587458044811805, 0.3613371823912032, -0.021231245630610716, 0.2682531198222579, 0.07724257663995102, 0.07731565217422645, 0.04129954307155906, 0.002738505221940392, -0.053036007276662064, -0.1848033612214066, 0.10973963559957323, 0.23715390420295251, 0.06454791268797137, 0.30014792388647943, -0.3875794863300537, -0.19827841693507647, 0.14862367721443615, 0.14253433020345274, 0.16482466300347107, -0.04709821978852672, -0.31836986640556275, 0.08470750081443242, -0.12742678352413855, -0.24228241857701904, -0.08831756819150786, -0.008697018970211792, 0.04584780159123724, -0.2651574245158268, 0.1397173529463607, 0.14905219365939942, 0.012605224650316126, -0.12898184212656758, -0.05530359377199552, -0.001169428093803685, 0.07442631965169488, 0.055029173528738505, 0.014582596628333614, 0.002503033379899032, -0.12184460246426532, -0.08529075885780008, 0.32993298316772895, -0.0733973965487809, -0.20836298687693974, 0.20342463296166255, -0.13081982903256642, -0.16287785536604957, 0.1304140814408586, 0.15077838023854606, 0.1201175495782932, -0.11115781123407037, 0.1667970409886147, -0.058137183323206, 0.16260204731083627, 0.09292174029205717, 8.310432272467447e-05, 0.08908440430755195, 0.16774044092512916, 0.14603801225821733, 0.14855084514977476, -0.0520574049659268, -0.13801412823243966, -0.3095278876847518, -0.16195316265443738, -0.18218391153507343, 0.09735163615898354, -0.11515875120361425, -0.177207509069634, 0.38241133676721384, 0.14740468857813377, 0.14576717119534216, 0.12366988031837663, 0.24787190121213964, 0.16436099568532492, 0.015528541806603397, 0.050501228479288555, 0.2585051112231423, 0.17259468843196682, 0.15417710801503107, -0.2013988281259619, 0.00816489576097967, 0.18864903912476416]
|
1,803.08083
|
Isoenergetic cycle for the quantum Rabi model
|
The isoenergetic cycle is a purely mechanical cycle comprised of adabatic and
isoenergetic processes. In the latter the system interacts with an energy bath
keeping constant the expectation value of the Hamiltonian. This cycle has been
mostly studied in systems consisting of particles confined in a power-law trap.
In this work we study the performance of the isoenergetic cycle for a system
described by the quantum Rabi model for the case of controlling the coupling
strength parameter, the resonator frequency and the two-level system frequency.
For the cases of controlling either the coupling strength parameter or the
resonator frequency, we find that it is possible to reach maximal unit
efficiency when the parameter is sufficiently increased in the first adiabatic
stage. In addition, for the first two cases the maximal work extracted is
obtained at parameter values corresponding to high efficiency which constitutes
an improvement over current proposals of this cycle.
|
quant-ph
|
the isoenergetic cycle is a purely mechanical cycle comprised of adabatic and isoenergetic processes in the latter the system interacts with an energy bath keeping constant the expectation value of the hamiltonian this cycle has been mostly studied in systems consisting of particles confined in a powerlaw trap in this work we study the performance of the isoenergetic cycle for a system described by the quantum rabi model for the case of controlling the coupling strength parameter the resonator frequency and the twolevel system frequency for the cases of controlling either the coupling strength parameter or the resonator frequency we find that it is possible to reach maximal unit efficiency when the parameter is sufficiently increased in the first adiabatic stage in addition for the first two cases the maximal work extracted is obtained at parameter values corresponding to high efficiency which constitutes an improvement over current proposals of this cycle
|
[['the', 'isoenergetic', 'cycle', 'is', 'a', 'purely', 'mechanical', 'cycle', 'comprised', 'of', 'adabatic', 'and', 'isoenergetic', 'processes', 'in', 'the', 'latter', 'the', 'system', 'interacts', 'with', 'an', 'energy', 'bath', 'keeping', 'constant', 'the', 'expectation', 'value', 'of', 'the', 'hamiltonian', 'this', 'cycle', 'has', 'been', 'mostly', 'studied', 'in', 'systems', 'consisting', 'of', 'particles', 'confined', 'in', 'a', 'powerlaw', 'trap', 'in', 'this', 'work', 'we', 'study', 'the', 'performance', 'of', 'the', 'isoenergetic', 'cycle', 'for', 'a', 'system', 'described', 'by', 'the', 'quantum', 'rabi', 'model', 'for', 'the', 'case', 'of', 'controlling', 'the', 'coupling', 'strength', 'parameter', 'the', 'resonator', 'frequency', 'and', 'the', 'twolevel', 'system', 'frequency', 'for', 'the', 'cases', 'of', 'controlling', 'either', 'the', 'coupling', 'strength', 'parameter', 'or', 'the', 'resonator', 'frequency', 'we', 'find', 'that', 'it', 'is', 'possible', 'to', 'reach', 'maximal', 'unit', 'efficiency', 'when', 'the', 'parameter', 'is', 'sufficiently', 'increased', 'in', 'the', 'first', 'adiabatic', 'stage', 'in', 'addition', 'for', 'the', 'first', 'two', 'cases', 'the', 'maximal', 'work', 'extracted', 'is', 'obtained', 'at', 'parameter', 'values', 'corresponding', 'to', 'high', 'efficiency', 'which', 'constitutes', 'an', 'improvement', 'over', 'current', 'proposals', 'of', 'this', 'cycle']]
|
[-0.18451952685291567, 0.17451114197358644, 0.007381095473344128, -0.0362392210176525, 0.024657346797175704, -0.1344949329737574, 0.07522551804625739, 0.3458033616344134, -0.23575084804324434, -0.29227194787313543, 0.06129065878223628, -0.24235522085179886, -0.07560178157718231, 0.2263983265310526, -0.011247820067219437, 0.02576036870489285, 0.06889997693089148, 0.07676608522888273, -0.0009043738358498861, -0.19408238414364556, 0.27970016764011235, 0.09803280392584081, 0.270132032216837, 0.01265687940021356, 0.10767239641398191, -0.01599780666641891, 0.06414132015779614, -0.006702102985994619, -0.12767767527941032, 0.07369129382694761, 0.20641352012443046, 0.0419889953158175, 0.2730865493354698, -0.38063674194117386, -0.21033076831139624, 0.14492287199633816, 0.1395731518433119, 0.10347963946172968, 0.012650299702460567, -0.20925043545818578, 0.020771012530506897, -0.1750088908476755, -0.15504026249361536, -0.025076662761469682, 0.04936720068876942, -0.01438815612035493, -0.2640946494337792, 0.07524422348787387, 0.08048299896220366, 0.05500583303471406, -0.06518724873972435, -0.06778471214153493, -0.0026881930511444808, 0.1284736457352604, 0.028346992429190625, 0.01961590347927995, 0.1583957082250466, -0.14854149550238313, -0.09778320961942276, 0.3635673323273659, -0.09917111861519516, -0.17339841881766915, 0.16142922090366482, -0.14456031151426335, -0.09199006747143965, 0.117380622352163, 0.12255029676792523, 0.10466107116080821, -0.13287835122212224, 0.10131238399000722, 0.022642144191389282, 0.1922319528584679, 0.06304390272746484, 0.02507977454457432, 0.18480512611412753, 0.19698893405341852, 0.07119309806420157, 0.19032121902952592, -0.07629639289341866, -0.1477046845050063, -0.29359330171098313, -0.14948867906893915, -0.2136105601194625, 0.03502704631537199, -0.097899241844619, -0.1440723786627253, 0.46185144419160984, 0.12752365787823994, 0.19680316912631193, 0.0030096417688764633, 0.3053416136830735, 0.1926324554781119, 0.05457097332846994, 0.04316445612969498, 0.33153818861270945, 0.12359281205416968, 0.08633065993199125, -0.27794059198970594, 0.021397950957374026, 0.03574782811726133]
|
1,803.08084
|
Inflation with Planck: a survey of some "exotic" inflationary models
|
We examine some inflationary models based on modifications of gravity in the
light of Planck 2015 data, such as the generalised Chaplygin inspired
inflation, models based in $N=1$ supergravity and braneworld scenarios. We also
show that, conversely, potentials with a very flat plateau yield a primordial
spectrum similar to that of the Starobinsky model with no need to modify
general relativity.
|
hep-th gr-qc hep-ph
|
we examine some inflationary models based on modifications of gravity in the light of planck 2015 data such as the generalised chaplygin inspired inflation models based in n1 supergravity and braneworld scenarios we also show that conversely potentials with a very flat plateau yield a primordial spectrum similar to that of the starobinsky model with no need to modify general relativity
|
[['we', 'examine', 'some', 'inflationary', 'models', 'based', 'on', 'modifications', 'of', 'gravity', 'in', 'the', 'light', 'of', 'planck', '2015', 'data', 'such', 'as', 'the', 'generalised', 'chaplygin', 'inspired', 'inflation', 'models', 'based', 'in', 'n1', 'supergravity', 'and', 'braneworld', 'scenarios', 'we', 'also', 'show', 'that', 'conversely', 'potentials', 'with', 'a', 'very', 'flat', 'plateau', 'yield', 'a', 'primordial', 'spectrum', 'similar', 'to', 'that', 'of', 'the', 'starobinsky', 'model', 'with', 'no', 'need', 'to', 'modify', 'general', 'relativity']]
|
[-0.07705856652808238, 0.1044977707024969, -0.153591793045768, 0.1444008744886664, -0.11227150191171248, -0.24197183196722974, -0.06836439999675409, 0.2971406775511435, -0.15442494437342785, -0.30362931859381803, 0.05976410279981792, -0.23165396536837835, -0.187653764471656, 0.16676548805820648, -0.10991243687534674, 0.03669703754855961, 0.018821581358425928, -0.01002913219548884, -0.05932326419431655, -0.2915651787255631, 0.35953357358478377, 0.13494920978307356, 0.20761201936812673, -0.03056501566630895, 0.05912965624860381, -0.09659045767497088, 0.01045618098626127, 0.023035406150290223, -0.17331199403818826, 0.09333703201836677, 0.15242554094476843, 0.16161503101561647, 0.14753549922349268, -0.45362059492999535, -0.3269708423310372, 0.17745796905555686, 0.08476566520260005, 0.17673392028960047, -0.07750541526541786, -0.25852378228389217, 0.023748211993465627, -0.20572303594319058, -0.12182773351974663, -0.05784915512824645, 0.005489392694635469, -0.050501671176953394, -0.2554020324462383, 0.1025808815358657, 0.012113727323833059, -0.03120901635618972, -0.10268503519110993, -0.06871504828975093, -0.06408301991273145, -0.051109000353417436, 0.11903593422593091, 0.016679650065718126, 0.0937371416643384, -0.16551778679160156, -0.12854253146492067, 0.42883746877129447, -0.22167481786998935, -0.16894291735208425, 0.1471471177150694, -0.15123734553726237, -0.22377371276560865, 0.0018676508553936834, 0.11653769031533452, 0.0879479318124349, -0.1055835306522299, 0.1877097016587838, 0.027927632916901934, 0.1660189742420907, 0.11897245026575248, 0.01525799625030276, 0.30306630446499244, 0.11221245744983192, -0.003924104744820382, 0.11048136431662763, -0.0366380213889614, -0.10010798828157245, -0.38697071358195095, -0.06796390190720558, -0.1157685338870668, 0.05432064636595181, -0.16076148920439634, -0.19585183277329216, 0.38980083030144697, 0.17663104068793234, 0.22653997567344886, 0.08599690938765397, 0.22998671429079087, 0.03068768529824485, 0.034456319755828774, 0.08407616745069867, 0.32540869942845274, 0.09399502208364792, 0.1331024484166906, -0.19036404809868726, -0.08803245633626815, 0.011626885287830086]
|
1,803.08085
|
Probabilistic Video Generation using Holistic Attribute Control
|
Videos express highly structured spatio-temporal patterns of visual data. A
video can be thought of as being governed by two factors: (i) temporally
invariant (e.g., person identity), or slowly varying (e.g., activity),
attribute-induced appearance, encoding the persistent content of each frame,
and (ii) an inter-frame motion or scene dynamics (e.g., encoding evolution of
the person ex-ecuting the action). Based on this intuition, we propose a
generative framework for video generation and future prediction. The proposed
framework generates a video (short clip) by decoding samples sequentially drawn
from a latent space distribution into full video frames. Variational
Autoencoders (VAEs) are used as a means of encoding/decoding frames into/from
the latent space and RNN as a wayto model the dynamics in the latent space. We
improve the video generation consistency through temporally-conditional
sampling and quality by structuring the latent space with attribute controls;
ensuring that attributes can be both inferred and conditioned on during
learning/generation. As a result, given attributes and/orthe first frame, our
model is able to generate diverse but highly consistent sets ofvideo sequences,
accounting for the inherent uncertainty in the prediction task. Experimental
results on Chair CAD, Weizmann Human Action, and MIT-Flickr datasets, along
with detailed comparison to the state-of-the-art, verify effectiveness of the
framework.
|
cs.CV
|
videos express highly structured spatiotemporal patterns of visual data a video can be thought of as being governed by two factors i temporally invariant eg person identity or slowly varying eg activity attributeinduced appearance encoding the persistent content of each frame and ii an interframe motion or scene dynamics eg encoding evolution of the person executing the action based on this intuition we propose a generative framework for video generation and future prediction the proposed framework generates a video short clip by decoding samples sequentially drawn from a latent space distribution into full video frames variational autoencoders vaes are used as a means of encodingdecoding frames intofrom the latent space and rnn as a wayto model the dynamics in the latent space we improve the video generation consistency through temporallyconditional sampling and quality by structuring the latent space with attribute controls ensuring that attributes can be both inferred and conditioned on during learninggeneration as a result given attributes andorthe first frame our model is able to generate diverse but highly consistent sets ofvideo sequences accounting for the inherent uncertainty in the prediction task experimental results on chair cad weizmann human action and mitflickr datasets along with detailed comparison to the stateoftheart verify effectiveness of the framework
|
[['videos', 'express', 'highly', 'structured', 'spatiotemporal', 'patterns', 'of', 'visual', 'data', 'a', 'video', 'can', 'be', 'thought', 'of', 'as', 'being', 'governed', 'by', 'two', 'factors', 'i', 'temporally', 'invariant', 'eg', 'person', 'identity', 'or', 'slowly', 'varying', 'eg', 'activity', 'attributeinduced', 'appearance', 'encoding', 'the', 'persistent', 'content', 'of', 'each', 'frame', 'and', 'ii', 'an', 'interframe', 'motion', 'or', 'scene', 'dynamics', 'eg', 'encoding', 'evolution', 'of', 'the', 'person', 'executing', 'the', 'action', 'based', 'on', 'this', 'intuition', 'we', 'propose', 'a', 'generative', 'framework', 'for', 'video', 'generation', 'and', 'future', 'prediction', 'the', 'proposed', 'framework', 'generates', 'a', 'video', 'short', 'clip', 'by', 'decoding', 'samples', 'sequentially', 'drawn', 'from', 'a', 'latent', 'space', 'distribution', 'into', 'full', 'video', 'frames', 'variational', 'autoencoders', 'vaes', 'are', 'used', 'as', 'a', 'means', 'of', 'encodingdecoding', 'frames', 'intofrom', 'the', 'latent', 'space', 'and', 'rnn', 'as', 'a', 'wayto', 'model', 'the', 'dynamics', 'in', 'the', 'latent', 'space', 'we', 'improve', 'the', 'video', 'generation', 'consistency', 'through', 'temporallyconditional', 'sampling', 'and', 'quality', 'by', 'structuring', 'the', 'latent', 'space', 'with', 'attribute', 'controls', 'ensuring', 'that', 'attributes', 'can', 'be', 'both', 'inferred', 'and', 'conditioned', 'on', 'during', 'learninggeneration', 'as', 'a', 'result', 'given', 'attributes', 'andorthe', 'first', 'frame', 'our', 'model', 'is', 'able', 'to', 'generate', 'diverse', 'but', 'highly', 'consistent', 'sets', 'ofvideo', 'sequences', 'accounting', 'for', 'the', 'inherent', 'uncertainty', 'in', 'the', 'prediction', 'task', 'experimental', 'results', 'on', 'chair', 'cad', 'weizmann', 'human', 'action', 'and', 'mitflickr', 'datasets', 'along', 'with', 'detailed', 'comparison', 'to', 'the', 'stateoftheart', 'verify', 'effectiveness', 'of', 'the', 'framework']]
|
[-0.05692727106811137, 0.07754301935284874, -0.07477884581557369, 0.07467480814880013, -0.11648641849590709, -0.14594260496485173, 0.031002984939133702, 0.4539768593058215, -0.28790063185420767, -0.34047888298916756, 0.08247722863996561, -0.252836904156223, -0.16353325616924008, 0.15334356314006575, -0.1568583978758891, 0.06502885108663883, 0.1408212803457466, 0.0781877065433105, -0.03995333576280081, -0.24140049118885593, 0.29750696296719414, 0.050196591191386905, 0.34721553432825375, -0.058923905457945625, 0.16505227939356773, 0.0153948573805696, -0.08813022303274463, 0.0010488400084841716, -0.031555991754412295, 0.17838032787487884, 0.2790470639473043, 0.21391260077021185, 0.2982025200117323, -0.42252674055795875, -0.2701598198279439, 0.024266167174765593, 0.12099985368077434, 0.09160143927966148, -0.04532554330498485, -0.4048808458256512, 0.0643627515139325, -0.15242438450287185, 0.03863420548390167, -0.13813886953864116, -0.008110766189911283, -0.01569519551200605, -0.31493297921044366, 0.04369963751901081, 0.06463654447421806, 0.05794820596871139, -0.10598603471231427, -0.04125978439185188, -0.019029202175457685, 0.2184011720509348, 0.05421850635862006, 0.07732811227122594, 0.14551316874146217, -0.17588070021613486, -0.1395520021619472, 0.4236583241996304, -0.08578258522098238, -0.23521667784370948, 0.1690754502474672, -0.05538996311615984, -0.12107225377861429, 0.12234385545721194, 0.21360068486526085, 0.1253266661818696, -0.16351088711403394, -0.030569523324296067, -0.05392147687699028, 0.18956891426684372, 0.06677617164721815, 0.02944706055808382, 0.22248387982104742, 0.22549642650667934, -0.006052408358035375, 0.12459449155312312, -0.1180071101591796, -0.08151822304587118, -0.25043311172244537, -0.09942566531583966, -0.17676056314601407, -0.03114836998564664, -0.1325221006986954, -0.12604089889057618, 0.4209957672528754, 0.1874478115956416, 0.23493468231198625, 0.0921831652475287, 0.307073426222307, 0.021986677433626173, 0.0640286604134394, 0.07584030939302355, 0.07743901803144183, 0.0068273918303057325, 0.10663426681257897, -0.1648972996062454, 0.13565116291561505, 0.09020847016968882]
|
1,803.08086
|
Influence of augmented humans in online interactions during voting
events
|
The advent of the digital era provided a fertile ground for the development
of virtual societies, complex systems influencing real-world dynamics.
Understanding online human behavior and its relevance beyond the digital
boundaries is still an open challenge. Here we show that online social
interactions during a massive voting event can be used to build an accurate map
of real-world political parties and electoral ranks. We provide evidence that
information flow and collective attention are often driven by a special class
of highly influential users, that we name "augmented humans", who exploit
thousands of automated agents, also known as bots, for enhancing their online
influence. We show that augmented humans generate deep information cascades, to
the same extent of news media and other broadcasters, while they uniformly
infiltrate across the full range of identified groups. Digital augmentation
represents the cyber-physical counterpart of the human desire to acquire power
within social systems.
|
physics.soc-ph cs.CY cs.SI
|
the advent of the digital era provided a fertile ground for the development of virtual societies complex systems influencing realworld dynamics understanding online human behavior and its relevance beyond the digital boundaries is still an open challenge here we show that online social interactions during a massive voting event can be used to build an accurate map of realworld political parties and electoral ranks we provide evidence that information flow and collective attention are often driven by a special class of highly influential users that we name augmented humans who exploit thousands of automated agents also known as bots for enhancing their online influence we show that augmented humans generate deep information cascades to the same extent of news media and other broadcasters while they uniformly infiltrate across the full range of identified groups digital augmentation represents the cyberphysical counterpart of the human desire to acquire power within social systems
|
[['the', 'advent', 'of', 'the', 'digital', 'era', 'provided', 'a', 'fertile', 'ground', 'for', 'the', 'development', 'of', 'virtual', 'societies', 'complex', 'systems', 'influencing', 'realworld', 'dynamics', 'understanding', 'online', 'human', 'behavior', 'and', 'its', 'relevance', 'beyond', 'the', 'digital', 'boundaries', 'is', 'still', 'an', 'open', 'challenge', 'here', 'we', 'show', 'that', 'online', 'social', 'interactions', 'during', 'a', 'massive', 'voting', 'event', 'can', 'be', 'used', 'to', 'build', 'an', 'accurate', 'map', 'of', 'realworld', 'political', 'parties', 'and', 'electoral', 'ranks', 'we', 'provide', 'evidence', 'that', 'information', 'flow', 'and', 'collective', 'attention', 'are', 'often', 'driven', 'by', 'a', 'special', 'class', 'of', 'highly', 'influential', 'users', 'that', 'we', 'name', 'augmented', 'humans', 'who', 'exploit', 'thousands', 'of', 'automated', 'agents', 'also', 'known', 'as', 'bots', 'for', 'enhancing', 'their', 'online', 'influence', 'we', 'show', 'that', 'augmented', 'humans', 'generate', 'deep', 'information', 'cascades', 'to', 'the', 'same', 'extent', 'of', 'news', 'media', 'and', 'other', 'broadcasters', 'while', 'they', 'uniformly', 'infiltrate', 'across', 'the', 'full', 'range', 'of', 'identified', 'groups', 'digital', 'augmentation', 'represents', 'the', 'cyberphysical', 'counterpart', 'of', 'the', 'human', 'desire', 'to', 'acquire', 'power', 'within', 'social', 'systems']]
|
[-0.11583919696509838, 0.08508334639035942, -0.04386698475301576, 0.12215870983355369, -0.17348490864038468, -0.13261116235206524, 0.0678664991344946, 0.41043668701002994, -0.269758389921238, -0.32727866056685645, 0.09352284713182599, -0.3268580358646189, -0.2404397778150936, 0.19562551328291497, -0.08343371017059932, 0.016197350685251875, 0.08269410762935876, 0.050371568412714014, 0.05407600161231434, -0.2934572584182024, 0.2877836507248382, 0.03360375598247629, 0.3203181056600685, 0.03193626886854569, 0.0970412043047448, 0.022463630603936812, -0.07509006828380128, 0.011613677861168981, -0.06120598311739741, 0.17060758707307588, 0.3578228408501794, 0.2214563080792626, 0.3823580324153105, -0.42677883617579937, -0.2059172093247374, 0.13184886822554592, 0.1700733769343545, 0.10357681522514516, -0.07472340703010559, -0.3827431800464789, 0.06813781168467055, -0.23340152867914488, -0.11825880115541319, -0.11925927343778313, 0.008780893748626112, 0.03021246623635913, -0.21987414833623917, 0.01581326784546642, 0.018435883149504662, 0.12546849160474569, -0.03815839395004635, -0.03669120240956545, -0.01437123805594941, 0.2680255383478167, 0.03559538010624237, -0.03072603791486472, 0.1965100073752304, -0.21845548468447912, -0.15589832190268985, 0.40247005310220024, 0.023797446781148514, -0.12650464536622166, 0.21152177597085633, -0.06703651865789045, -0.14766877494441966, 0.10937112648893768, 0.26691202537467085, 0.0624134087562561, -0.1830267973120014, -0.011269563166424633, -0.04442950387795766, 0.20428891770464058, 0.02942571000040819, 0.03814332108323773, 0.2166883758843566, 0.19189856257600088, 0.0573403122194577, 0.08049011732412813, 0.006104207516958316, -0.13640781407865385, -0.1671539201028645, -0.12998646460696667, -0.14702458328567444, 0.04530688578262925, -0.0682281468680594, -0.1485600415011868, 0.3553767919912934, 0.18701253083224098, 0.12270400021380434, 0.036601663720599996, 0.2964950742200017, -0.02850616856245324, 0.08525440760422498, 0.09658409278296555, 0.20393895492733766, -0.015112257632426917, 0.19462168578989802, -0.1437641366602232, 0.13826579947024584, -0.020381813331817586]
|
1,803.08087
|
The homotopy groups of the simplicial mapping space between algebras
|
Let $\ell$ be a commutative ring with unit. To every pair of $\ell$-algebras
$A$ and $B$ one can associate a simplicial set $\hom(A,B^\Delta)$ so that
$\pi_0\hom(A,B^\Delta)$ equals the set of polynomial homotopy classes of
morphisms from $A$ to $B$. We prove that $\pi_n\hom(A,B^\Delta)$ is the set of
homotopy classes of morphisms from $A$ to $B^{S_n}$, where $B^{S_n}$ is the
ind-algebra of polynomials on the $n$-dimensional cube with coefficients in $B$
vanishing at the boundary of the cube. This is a generalization to arbitrary
dimensions of a theorem of Corti\~nas-Thom, which addresses the cases $n\leq
1$. As an application we give a simplified proof of a theorem of Garkusha that
computes the homotopy groups of his matrix-unstable algebraic KK-theory space
in terms of polynomial homotopy classes of morphisms.
|
math.AT math.KT
|
let ell be a commutative ring with unit to every pair of ellalgebras a and b one can associate a simplicial set homabdelta so that pi_0homabdelta equals the set of polynomial homotopy classes of morphisms from a to b we prove that pi_nhomabdelta is the set of homotopy classes of morphisms from a to bs_n where bs_n is the indalgebra of polynomials on the ndimensional cube with coefficients in b vanishing at the boundary of the cube this is a generalization to arbitrary dimensions of a theorem of cortinasthom which addresses the cases nleq 1 as an application we give a simplified proof of a theorem of garkusha that computes the homotopy groups of his matrixunstable algebraic kktheory space in terms of polynomial homotopy classes of morphisms
|
[['let', 'ell', 'be', 'a', 'commutative', 'ring', 'with', 'unit', 'to', 'every', 'pair', 'of', 'ellalgebras', 'a', 'and', 'b', 'one', 'can', 'associate', 'a', 'simplicial', 'set', 'homabdelta', 'so', 'that', 'pi_0homabdelta', 'equals', 'the', 'set', 'of', 'polynomial', 'homotopy', 'classes', 'of', 'morphisms', 'from', 'a', 'to', 'b', 'we', 'prove', 'that', 'pi_nhomabdelta', 'is', 'the', 'set', 'of', 'homotopy', 'classes', 'of', 'morphisms', 'from', 'a', 'to', 'bs_n', 'where', 'bs_n', 'is', 'the', 'indalgebra', 'of', 'polynomials', 'on', 'the', 'ndimensional', 'cube', 'with', 'coefficients', 'in', 'b', 'vanishing', 'at', 'the', 'boundary', 'of', 'the', 'cube', 'this', 'is', 'a', 'generalization', 'to', 'arbitrary', 'dimensions', 'of', 'a', 'theorem', 'of', 'cortinasthom', 'which', 'addresses', 'the', 'cases', 'nleq', '1', 'as', 'an', 'application', 'we', 'give', 'a', 'simplified', 'proof', 'of', 'a', 'theorem', 'of', 'garkusha', 'that', 'computes', 'the', 'homotopy', 'groups', 'of', 'his', 'matrixunstable', 'algebraic', 'kktheory', 'space', 'in', 'terms', 'of', 'polynomial', 'homotopy', 'classes', 'of', 'morphisms']]
|
[-0.16829649310093373, 0.0542791848101236, -0.08443974323648339, 0.01635474233480636, -0.06670588357180046, -0.13730029544094577, 0.014652168884640559, 0.277956870252577, -0.35877310814103114, -0.20887181759365678, 0.07263998063087153, -0.2515164741858219, -0.10705732203787192, 0.18831750988416995, -0.15495888637378813, -0.06198529202180604, 0.05056701990154882, 0.1243106126668863, -0.07240044526794615, -0.2683409786860769, 0.3981237434937308, -0.06863232317846268, 0.14126580910682, 0.057110870420001444, 0.14201231702851752, -0.012756270717363804, -0.0010648985859006642, 0.024454258484047385, -0.13220183229126026, 0.15313594728164995, 0.29706594980477047, 0.10582089593517593, 0.2394302484501774, -0.3192613109584878, -0.09988587107509375, 0.22110185010824351, 0.1264590282846863, 0.02428458602419899, 0.03745723319298122, -0.25938874688387537, 0.15846787098950396, -0.1498866227377827, -0.13327661433334773, -0.050946351249391834, 0.08872973790081838, 0.03708236984287699, -0.3126303456025198, -0.05162683477004369, 0.1146660590020474, 0.12175962391253657, -0.0516148706083186, -0.06274192841471328, -0.04338644679131297, 0.09241112361584479, -0.03569569791628358, 0.07731098234653473, 0.07982189452692788, -0.06911033593545048, -0.15954022436441542, 0.41032256778950493, -0.041107974317856136, -0.2451383043235789, 0.14231093036748158, -0.15416277228699377, -0.16597484824499892, 0.12712424974888564, 0.0848100208522131, 0.16081465799361466, -0.0279166306136176, 0.20240145835123258, -0.17038680111581925, 0.11364027408029263, 0.123665105458349, 0.004628239511900271, 0.13903433692757972, 0.08288159680087119, 0.09654927427497266, 0.19116111749608536, 0.003937456426986803, -0.019417242153091745, -0.375146890229856, -0.20826914882054554, -0.16363502972526475, 0.15565795792111506, -0.13371506557244478, -0.205112616122157, 0.40350703487250333, 0.06564150300109758, 0.1996901830047136, 0.16410087984695565, 0.23547257211369774, 0.04950226485998428, 0.06009402746130945, 0.033358106405163804, 0.09810947123138855, 0.21385612577820817, 0.005574888724368066, -0.0909243463393068, -0.024130896766049167, 0.24225362613797188]
|
1,803.08088
|
An a-theorem for Horndeski Gravity at the Critical Point
|
We study holographic conformal anomalies and the corresponding $a$-theorem
for Einstein gravity extended with Horndeski terms that involve up to and
including linear curvature tensors. We focus on our discussion in $D=5$ bulk
dimensions. For the generic Horndeski coupling, the $a$-charge is the same as
that in Einstein gravity, but the inclusion of the Horndeski term violates the
$a$-theorem. However, there exists a critical point of the Horndeski coupling,
for which the theory admits nearly AdS spacetimes with non-vanishing Horndeski
scalar. The full AdS isometry is broken down by the logarithmic scalar hair to
the Poincar\'e group plus the scale invariance. We find that in this case the
$a$-charge depends on the AdS radius $\ell$ and the integration constant
$\chi_s$ of the Horndeski scalar. In addition, we find that two new central
charges emerge, that are absent in gravities with minimally-coupled matter. We
call them $b$-charges. These $b$-charges also depend on $\ell$ and $\chi_s$. We
construct an $a$-function for fixed $\ell$ but with the running Horndeski
scalar $\chi$ replacing the constant $\chi_s$, and establish the holographic
$a$-theorem using the null energy condition in the bulk. Furthermore, we find
that there exist analogous monotonous $b$-functions as well. We also obtain the
$a$-charge and the $a$-theorem in general odd bulk dimensions.
|
hep-th gr-qc
|
we study holographic conformal anomalies and the corresponding atheorem for einstein gravity extended with horndeski terms that involve up to and including linear curvature tensors we focus on our discussion in d5 bulk dimensions for the generic horndeski coupling the acharge is the same as that in einstein gravity but the inclusion of the horndeski term violates the atheorem however there exists a critical point of the horndeski coupling for which the theory admits nearly ads spacetimes with nonvanishing horndeski scalar the full ads isometry is broken down by the logarithmic scalar hair to the poincare group plus the scale invariance we find that in this case the acharge depends on the ads radius ell and the integration constant chi_s of the horndeski scalar in addition we find that two new central charges emerge that are absent in gravities with minimallycoupled matter we call them bcharges these bcharges also depend on ell and chi_s we construct an afunction for fixed ell but with the running horndeski scalar chi replacing the constant chi_s and establish the holographic atheorem using the null energy condition in the bulk furthermore we find that there exist analogous monotonous bfunctions as well we also obtain the acharge and the atheorem in general odd bulk dimensions
|
[['we', 'study', 'holographic', 'conformal', 'anomalies', 'and', 'the', 'corresponding', 'atheorem', 'for', 'einstein', 'gravity', 'extended', 'with', 'horndeski', 'terms', 'that', 'involve', 'up', 'to', 'and', 'including', 'linear', 'curvature', 'tensors', 'we', 'focus', 'on', 'our', 'discussion', 'in', 'd5', 'bulk', 'dimensions', 'for', 'the', 'generic', 'horndeski', 'coupling', 'the', 'acharge', 'is', 'the', 'same', 'as', 'that', 'in', 'einstein', 'gravity', 'but', 'the', 'inclusion', 'of', 'the', 'horndeski', 'term', 'violates', 'the', 'atheorem', 'however', 'there', 'exists', 'a', 'critical', 'point', 'of', 'the', 'horndeski', 'coupling', 'for', 'which', 'the', 'theory', 'admits', 'nearly', 'ads', 'spacetimes', 'with', 'nonvanishing', 'horndeski', 'scalar', 'the', 'full', 'ads', 'isometry', 'is', 'broken', 'down', 'by', 'the', 'logarithmic', 'scalar', 'hair', 'to', 'the', 'poincare', 'group', 'plus', 'the', 'scale', 'invariance', 'we', 'find', 'that', 'in', 'this', 'case', 'the', 'acharge', 'depends', 'on', 'the', 'ads', 'radius', 'ell', 'and', 'the', 'integration', 'constant', 'chi_s', 'of', 'the', 'horndeski', 'scalar', 'in', 'addition', 'we', 'find', 'that', 'two', 'new', 'central', 'charges', 'emerge', 'that', 'are', 'absent', 'in', 'gravities', 'with', 'minimallycoupled', 'matter', 'we', 'call', 'them', 'bcharges', 'these', 'bcharges', 'also', 'depend', 'on', 'ell', 'and', 'chi_s', 'we', 'construct', 'an', 'afunction', 'for', 'fixed', 'ell', 'but', 'with', 'the', 'running', 'horndeski', 'scalar', 'chi', 'replacing', 'the', 'constant', 'chi_s', 'and', 'establish', 'the', 'holographic', 'atheorem', 'using', 'the', 'null', 'energy', 'condition', 'in', 'the', 'bulk', 'furthermore', 'we', 'find', 'that', 'there', 'exist', 'analogous', 'monotonous', 'bfunctions', 'as', 'well', 'we', 'also', 'obtain', 'the', 'acharge', 'and', 'the', 'atheorem', 'in', 'general', 'odd', 'bulk', 'dimensions']]
|
[-0.18958927063454104, 0.16663391153785148, -0.05034076910840267, 0.107646227355837, -0.12398804612702836, -0.19774421600237238, -0.022650420595418313, 0.26445132213684786, -0.15780818419593373, -0.25186219453169967, 0.06275411987839864, -0.29421004442649595, -0.16051305694790763, 0.10377742422290111, -0.013272868333446779, 0.010252356264098553, -0.05765882423804832, 0.11420585688941055, -0.11288466528681905, -0.2536601931671055, 0.3900470726177237, 0.016829764557351762, 0.2401532673735938, 0.08081803541256195, 0.09268038557969373, 0.008986727999630227, 0.015558701097680051, 0.052758701264849335, -0.1970830036195092, 0.05958830225214576, 0.20605489640256042, 0.062180450117621015, 0.1677241516722874, -0.3837217392141454, -0.22407572773735276, 0.11335243593732064, 0.13125436580138344, 0.12986321012438254, -0.04160506832112589, -0.23833696866011397, 0.07772925931906871, -0.15943800585353346, -0.1542260989493303, -0.11574550966050422, 0.012428736773154666, -0.0885733740140225, -0.24204717328745212, 0.14092141477603903, 0.05228895467926601, 0.00934170769153243, -0.07604370896067274, -0.07354049686661088, -0.04685202024600794, 0.060239556637641634, 0.1618652331005586, 0.05133150016853327, 0.10585458512177344, -0.15547443368264952, -0.07919816398863908, 0.3792942828302713, -0.16620383331269187, -0.22559825983344084, 0.13738018644385433, -0.17658182217864293, -0.17258897054000227, 0.06024390018130675, 0.09859719635410742, 0.17296775432223338, -0.07491748084862267, 0.23102305776776041, -0.04563799336648426, 0.13731410680853975, 0.14618086665824198, 0.061415691478189045, 0.24061151405319608, 0.034676753039110865, 0.0734460901855558, 0.12156964191480686, 0.0003243371437395072, -0.09631671974088431, -0.43099857513841827, -0.1716833750769701, -0.11463186955836971, 0.0822898703560447, -0.20397043709365237, -0.17139869052292914, 0.3453326154860632, 0.11951011537152853, 0.1216284727229866, 0.11988643610751942, 0.18296747018291246, 0.08697604632804963, 0.12676497815459806, 0.13529175685681893, 0.3407704211174372, 0.11352202521679415, 0.09019057739595103, -0.24568874143319133, -0.12069220439771537, 0.10844445607678421]
|
1,803.08089
|
Incremental Learning-to-Learn with Statistical Guarantees
|
In learning-to-learn the goal is to infer a learning algorithm that works
well on a class of tasks sampled from an unknown meta distribution. In contrast
to previous work on batch learning-to-learn, we consider a scenario where tasks
are presented sequentially and the algorithm needs to adapt incrementally to
improve its performance on future tasks. Key to this setting is for the
algorithm to rapidly incorporate new observations into the model as they
arrive, without keeping them in memory. We focus on the case where the
underlying algorithm is ridge regression parameterized by a positive
semidefinite matrix. We propose to learn this matrix by applying a stochastic
strategy to minimize the empirical error incurred by ridge regression on future
tasks sampled from the meta distribution. We study the statistical properties
of the proposed algorithm and prove non-asymptotic bounds on its excess
transfer risk, that is, the generalization performance on new tasks from the
same meta distribution. We compare our online learning-to-learn approach with a
state of the art batch method, both theoretically and empirically.
|
stat.ML cs.LG
|
in learningtolearn the goal is to infer a learning algorithm that works well on a class of tasks sampled from an unknown meta distribution in contrast to previous work on batch learningtolearn we consider a scenario where tasks are presented sequentially and the algorithm needs to adapt incrementally to improve its performance on future tasks key to this setting is for the algorithm to rapidly incorporate new observations into the model as they arrive without keeping them in memory we focus on the case where the underlying algorithm is ridge regression parameterized by a positive semidefinite matrix we propose to learn this matrix by applying a stochastic strategy to minimize the empirical error incurred by ridge regression on future tasks sampled from the meta distribution we study the statistical properties of the proposed algorithm and prove nonasymptotic bounds on its excess transfer risk that is the generalization performance on new tasks from the same meta distribution we compare our online learningtolearn approach with a state of the art batch method both theoretically and empirically
|
[['in', 'learningtolearn', 'the', 'goal', 'is', 'to', 'infer', 'a', 'learning', 'algorithm', 'that', 'works', 'well', 'on', 'a', 'class', 'of', 'tasks', 'sampled', 'from', 'an', 'unknown', 'meta', 'distribution', 'in', 'contrast', 'to', 'previous', 'work', 'on', 'batch', 'learningtolearn', 'we', 'consider', 'a', 'scenario', 'where', 'tasks', 'are', 'presented', 'sequentially', 'and', 'the', 'algorithm', 'needs', 'to', 'adapt', 'incrementally', 'to', 'improve', 'its', 'performance', 'on', 'future', 'tasks', 'key', 'to', 'this', 'setting', 'is', 'for', 'the', 'algorithm', 'to', 'rapidly', 'incorporate', 'new', 'observations', 'into', 'the', 'model', 'as', 'they', 'arrive', 'without', 'keeping', 'them', 'in', 'memory', 'we', 'focus', 'on', 'the', 'case', 'where', 'the', 'underlying', 'algorithm', 'is', 'ridge', 'regression', 'parameterized', 'by', 'a', 'positive', 'semidefinite', 'matrix', 'we', 'propose', 'to', 'learn', 'this', 'matrix', 'by', 'applying', 'a', 'stochastic', 'strategy', 'to', 'minimize', 'the', 'empirical', 'error', 'incurred', 'by', 'ridge', 'regression', 'on', 'future', 'tasks', 'sampled', 'from', 'the', 'meta', 'distribution', 'we', 'study', 'the', 'statistical', 'properties', 'of', 'the', 'proposed', 'algorithm', 'and', 'prove', 'nonasymptotic', 'bounds', 'on', 'its', 'excess', 'transfer', 'risk', 'that', 'is', 'the', 'generalization', 'performance', 'on', 'new', 'tasks', 'from', 'the', 'same', 'meta', 'distribution', 'we', 'compare', 'our', 'online', 'learningtolearn', 'approach', 'with', 'a', 'state', 'of', 'the', 'art', 'batch', 'method', 'both', 'theoretically', 'and', 'empirically']]
|
[-0.016414932779507476, -0.0020767567021439076, -0.11049727076696682, 0.07450577839218808, -0.10397850479877115, -0.1512561495263322, 0.08939115848691984, 0.4480539008268508, -0.29592934043424995, -0.317358137188672, 0.09792147310191081, -0.2563200073327398, -0.173879686068615, 0.19481567052412435, -0.14102421723167016, 0.11502680243942993, 0.07993375941115463, 0.053618327746617386, -0.058627572293987434, -0.30372133792040806, 0.3164781663117224, 0.0739174574150586, 0.28891338653402165, -0.009647620229007697, 0.11316757851505074, 0.020356325625345624, -0.026119174732794535, -0.01832914815402065, -0.09367207168534883, 0.15084067217727332, 0.2650501920852339, 0.2066103153361607, 0.34188031436522204, -0.38856486683904096, -0.2068106926624374, 0.10613664003736714, 0.11419976244184815, 0.09580519689038268, -0.02892850370256059, -0.2917729840779827, 0.09608885337365791, -0.14335380209577753, -0.02070400867900201, -0.10142023515373726, -0.0747968142787958, -0.002937080165981476, -0.31264867123494716, 0.029983356338122796, 0.062277928323233395, 0.0017157072053677616, -0.052372728495847905, -0.16262829790009592, 0.0692834802541946, 0.12329347406904716, 0.05365417596225723, 0.04313846008956496, 0.14236312103842455, -0.11101451550674593, -0.1546519224735341, 0.33369302357300773, -0.08324394602831667, -0.22828793829446123, 0.1611015920034856, -0.05443317747417966, -0.16814229595635471, 0.07017839453069376, 0.28863822294120817, 0.13655601369602413, -0.1449956545210176, 0.06158232854059683, -0.051787638304830026, 0.14324373030371365, -0.009206841707807677, -0.031151659390621488, 0.13495239877441748, 0.22990532831995394, 0.09605841086535104, 0.17065086674972854, -0.09163801658690517, -0.11161507984580493, -0.24232528499466763, -0.11986142903668057, -0.2370014369980186, -0.019552995165108823, -0.08918000376040996, -0.11939940420315592, 0.39560961610391393, 0.2127382585446982, 0.26250588116182505, 0.14824334768064576, 0.3514249405780829, 0.06753978325086164, 0.04835245763112245, 0.1341996008554345, 0.17321280908674516, 0.06739530356831035, 0.1023773296827172, -0.20934811882051135, 0.14266978469195551, 0.04461087281738767]
|
1,803.0809
|
A Carillon of Black Holes
|
Scientists collaborating internationally have developed a new way to learn
about our universe through gravitational waves, which are ripples in space-time
caused by the motion and vibration of celestial bodies. By analogy,
gravitational waves are akin to the vibrations carried through the air as
sound. Quite remarkably, black holes, which are the densest objects in the
universe formed from dead stars can vibrate and emit gravitational waves at
frequencies that are within the range of human hearing once the gravitational
waves are detected and amplified by instruments such as the LIGO and Virgo
gravitational wave detectors. In this work, we explore how to make musical
instruments based on gravitational waves by mapping a different gravitational
wave pattern to each of the 88 keys of a piano, much like a carillon, which has
its bells mapped to the batons of a carillon-keyboard. We rely on theoretical
calculations for black hole vibrations to construct our digital black hole
instruments. Our software and music samples are freely available to those who
want to explore the music of gravitational waves.
|
gr-qc physics.ed-ph
|
scientists collaborating internationally have developed a new way to learn about our universe through gravitational waves which are ripples in spacetime caused by the motion and vibration of celestial bodies by analogy gravitational waves are akin to the vibrations carried through the air as sound quite remarkably black holes which are the densest objects in the universe formed from dead stars can vibrate and emit gravitational waves at frequencies that are within the range of human hearing once the gravitational waves are detected and amplified by instruments such as the ligo and virgo gravitational wave detectors in this work we explore how to make musical instruments based on gravitational waves by mapping a different gravitational wave pattern to each of the 88 keys of a piano much like a carillon which has its bells mapped to the batons of a carillonkeyboard we rely on theoretical calculations for black hole vibrations to construct our digital black hole instruments our software and music samples are freely available to those who want to explore the music of gravitational waves
|
[['scientists', 'collaborating', 'internationally', 'have', 'developed', 'a', 'new', 'way', 'to', 'learn', 'about', 'our', 'universe', 'through', 'gravitational', 'waves', 'which', 'are', 'ripples', 'in', 'spacetime', 'caused', 'by', 'the', 'motion', 'and', 'vibration', 'of', 'celestial', 'bodies', 'by', 'analogy', 'gravitational', 'waves', 'are', 'akin', 'to', 'the', 'vibrations', 'carried', 'through', 'the', 'air', 'as', 'sound', 'quite', 'remarkably', 'black', 'holes', 'which', 'are', 'the', 'densest', 'objects', 'in', 'the', 'universe', 'formed', 'from', 'dead', 'stars', 'can', 'vibrate', 'and', 'emit', 'gravitational', 'waves', 'at', 'frequencies', 'that', 'are', 'within', 'the', 'range', 'of', 'human', 'hearing', 'once', 'the', 'gravitational', 'waves', 'are', 'detected', 'and', 'amplified', 'by', 'instruments', 'such', 'as', 'the', 'ligo', 'and', 'virgo', 'gravitational', 'wave', 'detectors', 'in', 'this', 'work', 'we', 'explore', 'how', 'to', 'make', 'musical', 'instruments', 'based', 'on', 'gravitational', 'waves', 'by', 'mapping', 'a', 'different', 'gravitational', 'wave', 'pattern', 'to', 'each', 'of', 'the', '88', 'keys', 'of', 'a', 'piano', 'much', 'like', 'a', 'carillon', 'which', 'has', 'its', 'bells', 'mapped', 'to', 'the', 'batons', 'of', 'a', 'carillonkeyboard', 'we', 'rely', 'on', 'theoretical', 'calculations', 'for', 'black', 'hole', 'vibrations', 'to', 'construct', 'our', 'digital', 'black', 'hole', 'instruments', 'our', 'software', 'and', 'music', 'samples', 'are', 'freely', 'available', 'to', 'those', 'who', 'want', 'to', 'explore', 'the', 'music', 'of', 'gravitational', 'waves']]
|
[-0.1233978987526084, 0.1667861289080943, -0.08949935733679833, 0.09988720050401921, -0.15666212286864747, -0.06637268439688951, -0.0005346469451926347, 0.35833345144728707, -0.19598347868775745, -0.31857749281418807, 0.09657565261320765, -0.3392808836416444, -0.13733358423204048, 0.24153647049750077, -0.012522694548441238, 0.02917558054683321, 0.05075781589718482, -0.002958727455455702, -0.004888391040125593, -0.1903025529850705, 0.3057662176164782, 0.11721188682696723, 0.21000493179624524, -0.06338162177559957, 0.09769569108844062, -0.03244354615902805, -0.04196910754739808, -0.0018132812844190984, -0.11088280483523977, 0.08089369387538145, 0.30582968844100833, 0.1636231884278217, 0.26222576211728804, -0.48932068730365336, -0.2463544371554351, 0.035301976164296874, 0.12792947964818147, 0.16415086696314696, -0.050750818962871896, -0.3864136871294996, 0.053413804047175745, -0.18217486274600933, -0.10981343859386754, -0.0073223018566566395, 0.04416495754862624, 0.057257152466316075, -0.14412091912384106, 0.05094506032832204, 0.016741946650496713, -0.015654162521653397, -0.05982036225704982, -0.03805797507265055, -0.04502176522880233, 0.131844501969313, 0.10391981615496508, 0.07029785265112458, 0.20599853179842836, -0.10567678777350253, -0.10543529516775053, 0.4329462640816507, -0.07526703484657872, -0.16392420918137007, 0.2174821023563814, -0.1954847133659214, -0.07867267787338078, 0.13420531840327415, 0.19415043664267126, 0.10741003890349557, -0.16466119993650327, -0.01150661530316339, 0.026101479481944728, 0.19135583142381205, 0.1929614935029901, 0.0535997794904057, 0.3848972954932665, 0.10755896747564477, 0.00040501847222576597, 0.11717667357560053, -0.09255278785578433, 0.006594397980513554, -0.2404240069458681, -0.09603174802217353, -0.18103747054493066, 0.017271836539104614, -0.058130622203068166, -0.15865620316916032, 0.36708597210101307, 0.17101958255967223, 0.08099047780962866, 0.022990990663620217, 0.2867251869646748, 0.02023885241706958, 0.08245700993171404, 0.07851374910396088, 0.3654599908464777, 0.09147295609084254, 0.13630481307176776, -0.16060282181641572, 0.008129310029736488, 0.015116373795714509]
|
1,803.08091
|
On the number of subsemigroups of direct products involving the free
monogenic semigroup
|
The direct product $\mathbb{N}\times\mathbb{N}$ of two free monogenic
semigroups contains uncountably many pairwise non-isomorphic subdirect
products. Furthermore, the following hold for $\mathbb{N}\times S$, where $S$
is a finite semigroup. It contains only countably many pairwise non-isomorphic
subsemigroups if and only if $S$ is a union of groups. And it contains only
countably many pairwise non-isomorphic subdirect products if and only if every
element of $S$ has a relative left- or right identity element.
|
math.GR
|
the direct product mathbbntimesmathbbn of two free monogenic semigroups contains uncountably many pairwise nonisomorphic subdirect products furthermore the following hold for mathbbntimes s where s is a finite semigroup it contains only countably many pairwise nonisomorphic subsemigroups if and only if s is a union of groups and it contains only countably many pairwise nonisomorphic subdirect products if and only if every element of s has a relative left or right identity element
|
[['the', 'direct', 'product', 'mathbbntimesmathbbn', 'of', 'two', 'free', 'monogenic', 'semigroups', 'contains', 'uncountably', 'many', 'pairwise', 'nonisomorphic', 'subdirect', 'products', 'furthermore', 'the', 'following', 'hold', 'for', 'mathbbntimes', 's', 'where', 's', 'is', 'a', 'finite', 'semigroup', 'it', 'contains', 'only', 'countably', 'many', 'pairwise', 'nonisomorphic', 'subsemigroups', 'if', 'and', 'only', 'if', 's', 'is', 'a', 'union', 'of', 'groups', 'and', 'it', 'contains', 'only', 'countably', 'many', 'pairwise', 'nonisomorphic', 'subdirect', 'products', 'if', 'and', 'only', 'if', 'every', 'element', 'of', 's', 'has', 'a', 'relative', 'left', 'or', 'right', 'identity', 'element']]
|
[-0.15472439916370667, 0.1888709316637737, -0.0059694099903412874, 0.027530489033343247, -0.050373589619994164, -0.20258603394924574, -0.019881692413585134, 0.41584124186471716, -0.3544386570176033, -0.11314933090024207, 0.13598384090686497, -0.4270591410642413, -0.023356575152058513, 0.23907003192269333, -0.0730573532286368, -0.08302037936754122, 0.13649106247682277, 0.22521624723066613, -0.016866829954342893, -0.30165228596091115, 0.3295145820162884, -0.19107493747995324, 0.1423111072652144, 0.053800331919824015, 0.18381611371974219, 0.03084187873651924, -0.04546637832480546, 0.014188727287396993, -0.1208886263943086, 0.07788123839777218, 0.30572948903355696, 0.17784112161152985, 0.27059844267643884, -0.3418393905688403, -0.13449179316067125, 0.36966714833237946, 0.10898250032037701, -0.08127739271531774, -0.01668773555158548, -0.19517997355034497, 0.11295897841504583, -0.252997787184503, -0.021275752357985466, -0.07572108801862557, 0.2284391171311679, 0.009985010764778477, -0.26966591939738355, 0.005363103971905904, 0.148585510246112, 0.09139148961140277, 0.054536370394674884, -0.10982205336339364, -0.1085472213780533, 0.11654204133681137, -0.01010149049457826, -0.031232519408573127, 0.04250778085536209, 0.01707988905788986, -0.09192999797452191, 0.38989009555072, 0.011439234184177772, -0.21688485961432938, 0.21086926650246351, -0.19180931259354908, -0.1902218992911177, 0.18432704398842298, -0.04239551285728302, 0.14144050532773342, -0.07732986807440446, 0.28078058323494404, -0.20308457809972436, 0.1445656385629961, 0.16047234686525308, 0.011157474901578198, 0.11237863289855726, 0.04836863239793337, 0.1484871279322287, 0.06699221361785719, 0.13033066108210445, 0.08012928599364137, -0.3735800522239241, -0.16081465460513145, -0.16177617588673707, 0.10862601718451502, -0.12088848002097882, -0.2751375542832411, 0.3717261780665754, 0.015830444095477667, 0.1111650210103556, 0.029457298860158007, 0.22896136377925333, -0.034374718796716976, 0.0695946595618782, 0.12780503964383308, 0.01631684029117635, 0.2353990807274535, -0.20383795654426698, -0.036430577135147295, 0.031373576197313936, 0.23557961850797068]
|
1,803.08092
|
A New Solution Concept and Family of Relaxations for Hybrid Dynamical
Systems
|
We introduce a holistic framework for the analysis, approximation and control
of the trajectories of hybrid dynamical systems which display event-triggered
discrete jumps in the continuous state. We begin by demonstrating how to
explicitly represent the dynamics of this class of systems using a single
piecewise-smooth vector field defined on a manifold, and then employ Filippov's
solution concept to describe the trajectories of the system. The resulting
\emph{hybrid Filippov solutions} greatly simplify the mathematical description
of hybrid executions, providing a unifying solution concept with which to work.
Extending previous efforts to regularize piecewise-smooth vector fields, we
then introduce a parameterized family of smooth control systems whose
trajectories are used to approximate the hybrid Filippov solution numerically.
The two solution concepts are shown to agree in the limit, under mild
regularity conditions.
|
math.DS
|
we introduce a holistic framework for the analysis approximation and control of the trajectories of hybrid dynamical systems which display eventtriggered discrete jumps in the continuous state we begin by demonstrating how to explicitly represent the dynamics of this class of systems using a single piecewisesmooth vector field defined on a manifold and then employ filippovs solution concept to describe the trajectories of the system the resulting emphhybrid filippov solutions greatly simplify the mathematical description of hybrid executions providing a unifying solution concept with which to work extending previous efforts to regularize piecewisesmooth vector fields we then introduce a parameterized family of smooth control systems whose trajectories are used to approximate the hybrid filippov solution numerically the two solution concepts are shown to agree in the limit under mild regularity conditions
|
[['we', 'introduce', 'a', 'holistic', 'framework', 'for', 'the', 'analysis', 'approximation', 'and', 'control', 'of', 'the', 'trajectories', 'of', 'hybrid', 'dynamical', 'systems', 'which', 'display', 'eventtriggered', 'discrete', 'jumps', 'in', 'the', 'continuous', 'state', 'we', 'begin', 'by', 'demonstrating', 'how', 'to', 'explicitly', 'represent', 'the', 'dynamics', 'of', 'this', 'class', 'of', 'systems', 'using', 'a', 'single', 'piecewisesmooth', 'vector', 'field', 'defined', 'on', 'a', 'manifold', 'and', 'then', 'employ', 'filippovs', 'solution', 'concept', 'to', 'describe', 'the', 'trajectories', 'of', 'the', 'system', 'the', 'resulting', 'emphhybrid', 'filippov', 'solutions', 'greatly', 'simplify', 'the', 'mathematical', 'description', 'of', 'hybrid', 'executions', 'providing', 'a', 'unifying', 'solution', 'concept', 'with', 'which', 'to', 'work', 'extending', 'previous', 'efforts', 'to', 'regularize', 'piecewisesmooth', 'vector', 'fields', 'we', 'then', 'introduce', 'a', 'parameterized', 'family', 'of', 'smooth', 'control', 'systems', 'whose', 'trajectories', 'are', 'used', 'to', 'approximate', 'the', 'hybrid', 'filippov', 'solution', 'numerically', 'the', 'two', 'solution', 'concepts', 'are', 'shown', 'to', 'agree', 'in', 'the', 'limit', 'under', 'mild', 'regularity', 'conditions']]
|
[-0.1475717289300408, 0.04215273989065913, -0.12742034979662253, 0.036132426311054004, -0.0841859831520932, -0.13787387211305865, 0.030905825634245255, 0.33135906499917156, -0.3121921116533291, -0.257232203994316, 0.10642407465422213, -0.20756030233242756, -0.20847587099739615, 0.16802041151450647, -0.08699290296660456, 0.12188937253219197, 0.05475016384748102, 0.022394481973495077, -0.08687246749035389, -0.19577817820396473, 0.3511110661330967, -0.03329134796468811, 0.2653995176620838, -0.03308701025586902, 0.14868339156831495, 0.0010004264350539742, 0.017651376424655887, 0.053256972298338895, -0.15635032322300413, 0.13776085876863278, 0.2538692346962439, 0.14014624331843192, 0.29672365035250325, -0.438603650863844, -0.23846824971233843, 0.0864433937187072, 0.12373156950787734, 0.11671385042660848, -0.03551362555577128, -0.3052333138229055, 0.09672470326457201, -0.15556656996513368, -0.18337582184698517, -0.14594720426470553, -0.031571919111826434, 0.060230839696272014, -0.27350633447627243, 0.00898249743093971, 0.08553562383322963, 0.035036755658202724, -0.11493116688296084, -0.02253352368218497, -0.006363381077144437, 0.09700277976279381, 0.0009269144471365077, 0.01972085662641143, 0.11101767550514058, -0.09307148631391976, -0.14655023796229716, 0.3431045243188646, -0.06680714020608633, -0.2936915906925085, 0.20505299074362024, -0.07525796143565583, -0.13447313807648784, 0.12936289138196191, 0.20373664955601437, 0.16204789669416447, -0.19934239470975773, 0.09610333418711764, -0.00709002569516879, 0.12541330712740772, 0.026305677644723587, 0.03062342127557588, 0.17057699626240566, 0.1819436107282278, 0.09370244458275101, 0.14710245896059707, -0.007623417614888087, -0.20074231159084172, -0.2987258689662882, -0.12119589291178827, -0.1124824722357919, 0.040668300990164566, -0.029197704935409057, -0.20348007595304307, 0.42740473452642674, 0.15936559274924195, 0.19320410374864821, 0.11143530320859592, 0.26234514864858327, 0.1421675657825047, 0.005629437278870863, 0.06949246044889207, 0.21366779379660392, 0.1241946827161716, 0.11160838634898985, -0.19972547933722326, 0.009653765071922813, 0.1252199917576695]
|
1,803.08093
|
Grassman semialgebras and the Cayley-Hamilton theorem
|
We develop a theory of semialgebra Grassmann triples via Hasse-Schmidt
derivations, which formally generalizes results such as the Cayley-Hamilton
theorem in linear algebra, thereby providing a unified approach to classical
linear algebra and tropical algebra.
|
math.RA math.RT
|
we develop a theory of semialgebra grassmann triples via hasseschmidt derivations which formally generalizes results such as the cayleyhamilton theorem in linear algebra thereby providing a unified approach to classical linear algebra and tropical algebra
|
[['we', 'develop', 'a', 'theory', 'of', 'semialgebra', 'grassmann', 'triples', 'via', 'hasseschmidt', 'derivations', 'which', 'formally', 'generalizes', 'results', 'such', 'as', 'the', 'cayleyhamilton', 'theorem', 'in', 'linear', 'algebra', 'thereby', 'providing', 'a', 'unified', 'approach', 'to', 'classical', 'linear', 'algebra', 'and', 'tropical', 'algebra']]
|
[-0.10747885005548596, -0.01197615900476064, -0.13253468120736736, 0.07883614800604326, -0.19295438794153077, -0.13847955840506723, 0.005745863099582494, 0.23071129689259187, -0.39314213933955344, -0.23817822337150574, 0.09644016600879175, -0.1993588605097362, -0.2300590293215854, 0.2064311310382826, -0.16391046567420875, 0.008221373866711344, 0.03003204736326422, 0.07096586871360029, -0.14983805112008539, -0.21065270799611296, 0.35798338586464523, 0.040839163373623574, 0.19554427697190216, 0.012283072620630265, 0.16056124341807196, 0.13376043501443097, -0.039665038444633996, -0.0090753329119512, -0.1180038083344698, 0.16345369460593376, 0.40036344400474005, 0.16098680226132273, 0.22392195399318424, -0.41637177701507294, -0.11294026600995234, 0.08053898357653193, 0.15532074102333615, 0.05774473316102688, 0.006103021598287991, -0.23201766865594045, 0.06351618782750197, -0.26843769940148504, -0.14984101436899178, -0.14440882615745068, -0.0031345524825155736, -0.06655519152326243, -0.2897956612386874, 0.060757529629128317, 0.19255279084401472, 0.16361901544566665, -0.07852495227541242, -0.08596487677256975, -0.040820890558617456, -0.003964811802974769, -0.11144306547939778, 0.032571284220154796, 0.10667192659207753, 0.01084886049585683, -0.22717190946319274, 0.30126620374087776, -0.03192849055464778, -0.2605695387614625, 0.11516374158007758, -0.09418581362281526, -0.18652131359225937, 0.01631749426679952, 0.06488651987165213, 0.14633437054497855, -0.08999357915017754, 0.21287371941808877, -0.18584209707166469, -0.0037561501775469097, 0.05617033432104758, 0.04032631700060197, 0.15015360319188664, 0.08025076796433755, 0.021759753275130477, 0.142777303852407, 0.13152171788471087, -0.13185596551213946, -0.35230897005115236, -0.1648718156585736, -0.05964615717530251, 0.12942773478571326, -0.15640242744993885, -0.19890311477439745, 0.37373436375388075, 0.11889533231400752, 0.14485336217497077, 0.1677799801774589, 0.2629271226269858, 0.16575911223023598, 0.12483043699924434, 0.04078015089035034, 0.10258069879242353, 0.35953454737152374, 0.0304533025515931, -0.09299790335020848, -0.1288566634990275, 0.3037939447643501]
|
1,803.08094
|
T-RECS: Training for Rate-Invariant Embeddings by Controlling Speed for
Action Recognition
|
An action should remain identifiable when modifying its speed: consider the
contrast between an expert chef and a novice chef each chopping an onion. Here,
we expect the novice chef to have a relatively measured and slow approach to
chopping when compared to the expert. In general, the speed at which actions
are performed, whether slower or faster than average, should not dictate how
they are recognized. We explore the erratic behavior caused by this phenomena
on state-of-the-art deep network-based methods for action recognition in terms
of maximum performance and stability in recognition accuracy across a range of
input video speeds. By observing the trends in these metrics and summarizing
them based on expected temporal behaviour w.r.t. variations in input video
speeds, we find two distinct types of network architectures. In this paper, we
propose a preprocessing method named T-RECS, as a way to extend
deep-network-based methods for action recognition to explicitly account for
speed variability in the data. We do so by adaptively resampling the inputs to
a given model. T-RECS is agnostic to the specific deep-network model; we apply
it to four state-of-the-art action recognition architectures, C3D, I3D, TSN,
and ConvNet+LSTM. On HMDB51 and UCF101, T-RECS-based I3D models show a peak
improvement of at least 2.9% in performance over the baseline while
T-RECS-based C3D models achieve a maximum improvement in stability by 59% over
the baseline, on the HMDB51 dataset.
|
cs.CV
|
an action should remain identifiable when modifying its speed consider the contrast between an expert chef and a novice chef each chopping an onion here we expect the novice chef to have a relatively measured and slow approach to chopping when compared to the expert in general the speed at which actions are performed whether slower or faster than average should not dictate how they are recognized we explore the erratic behavior caused by this phenomena on stateoftheart deep networkbased methods for action recognition in terms of maximum performance and stability in recognition accuracy across a range of input video speeds by observing the trends in these metrics and summarizing them based on expected temporal behaviour wrt variations in input video speeds we find two distinct types of network architectures in this paper we propose a preprocessing method named trecs as a way to extend deepnetworkbased methods for action recognition to explicitly account for speed variability in the data we do so by adaptively resampling the inputs to a given model trecs is agnostic to the specific deepnetwork model we apply it to four stateoftheart action recognition architectures c3d i3d tsn and convnetlstm on hmdb51 and ucf101 trecsbased i3d models show a peak improvement of at least 29 in performance over the baseline while trecsbased c3d models achieve a maximum improvement in stability by 59 over the baseline on the hmdb51 dataset
|
[['an', 'action', 'should', 'remain', 'identifiable', 'when', 'modifying', 'its', 'speed', 'consider', 'the', 'contrast', 'between', 'an', 'expert', 'chef', 'and', 'a', 'novice', 'chef', 'each', 'chopping', 'an', 'onion', 'here', 'we', 'expect', 'the', 'novice', 'chef', 'to', 'have', 'a', 'relatively', 'measured', 'and', 'slow', 'approach', 'to', 'chopping', 'when', 'compared', 'to', 'the', 'expert', 'in', 'general', 'the', 'speed', 'at', 'which', 'actions', 'are', 'performed', 'whether', 'slower', 'or', 'faster', 'than', 'average', 'should', 'not', 'dictate', 'how', 'they', 'are', 'recognized', 'we', 'explore', 'the', 'erratic', 'behavior', 'caused', 'by', 'this', 'phenomena', 'on', 'stateoftheart', 'deep', 'networkbased', 'methods', 'for', 'action', 'recognition', 'in', 'terms', 'of', 'maximum', 'performance', 'and', 'stability', 'in', 'recognition', 'accuracy', 'across', 'a', 'range', 'of', 'input', 'video', 'speeds', 'by', 'observing', 'the', 'trends', 'in', 'these', 'metrics', 'and', 'summarizing', 'them', 'based', 'on', 'expected', 'temporal', 'behaviour', 'wrt', 'variations', 'in', 'input', 'video', 'speeds', 'we', 'find', 'two', 'distinct', 'types', 'of', 'network', 'architectures', 'in', 'this', 'paper', 'we', 'propose', 'a', 'preprocessing', 'method', 'named', 'trecs', 'as', 'a', 'way', 'to', 'extend', 'deepnetworkbased', 'methods', 'for', 'action', 'recognition', 'to', 'explicitly', 'account', 'for', 'speed', 'variability', 'in', 'the', 'data', 'we', 'do', 'so', 'by', 'adaptively', 'resampling', 'the', 'inputs', 'to', 'a', 'given', 'model', 'trecs', 'is', 'agnostic', 'to', 'the', 'specific', 'deepnetwork', 'model', 'we', 'apply', 'it', 'to', 'four', 'stateoftheart', 'action', 'recognition', 'architectures', 'c3d', 'i3d', 'tsn', 'and', 'convnetlstm', 'on', 'hmdb51', 'and', 'ucf101', 'trecsbased', 'i3d', 'models', 'show', 'a', 'peak', 'improvement', 'of', 'at', 'least', '29', 'in', 'performance', 'over', 'the', 'baseline', 'while', 'trecsbased', 'c3d', 'models', 'achieve', 'a', 'maximum', 'improvement', 'in', 'stability', 'by', '59', 'over', 'the', 'baseline', 'on', 'the', 'hmdb51', 'dataset']]
|
[-0.06809536008386995, 0.04736226529418238, -0.07111580028988258, 0.05195396662456915, -0.0670153454432021, -0.16078258844942828, 0.04153033383038786, 0.4693687638591813, -0.2189413382327589, -0.34746426966081817, 0.09504382122743307, -0.2644188794104949, -0.1466230721121816, 0.22634565442263999, -0.14974194185848794, 0.039672018044739556, 0.10930109680427805, 0.07804823423047429, -0.08491796422800373, -0.2942973487311974, 0.23696376768487465, 0.04798067342780996, 0.3195902213260643, 0.023283403113980413, 0.11645673659640243, -0.05870632537509031, -0.018042008202199054, 0.010045251988745093, -0.0690720703230118, 0.10584791681131996, 0.25649162828659705, 0.15888679379030415, 0.2839772678385286, -0.3857268551364541, -0.2068129722276986, 0.06069466443124997, 0.15088297325368646, 0.08302638844647647, 0.007662053615026905, -0.3111524138761603, 0.10713420259239881, -0.18072851310160173, -0.02650734395618834, -0.10979217711998068, 0.021105732072306715, -0.010308033024699872, -0.26497343446877175, 0.038586017243442655, 0.05937969029131953, 0.10076035466450065, -0.06495414983491292, -0.10587210310572434, 0.038599354578890716, 0.16327732427516425, 0.04400831013462385, 0.05263979744176259, 0.11732101597640987, -0.1898337844027834, -0.1463893053610303, 0.3807569663246598, -0.12242672159469373, -0.1973324469067966, 0.21429659031412523, -0.07360010432970265, -0.13872962234055866, 0.10228555854814855, 0.2364511678683693, 0.13274657321769906, -0.13558070592078603, -0.01764004524220186, 0.005452424437617478, 0.20561899330426495, 0.07892631223354407, -0.0036723600409459324, 0.1749153012794483, 0.22007535287209423, 0.03543978294600611, 0.10573786736577344, -0.12573829755179441, -0.06645916668374253, -0.20649190450836297, -0.07833862498493703, -0.1038381721034808, 0.005769863406780844, -0.09504642749936623, -0.1061157309004794, 0.4157122986310202, 0.23538699481217443, 0.20670471586408498, 0.12498378327012609, 0.3333289476415223, 0.043538151984609176, 0.10761588780594099, 0.11962880769380085, 0.2140619712861498, -0.022804989738632802, 0.10180929513729137, -0.21467818805704947, 0.0857352841200064, 0.05079680150982154]
|
1,803.08095
|
Partition number identities which are true for all set of parts
|
Let $B$ be an infinite subset of $\mathbf{N}$. When we consider partitions of
natural numbers into elements of $B$, a partition number without a restriction
of the number of equal parts can be expressed by partition numbers with a
restriction $\alpha$ of the number of equal parts. Although there are many way
of the expression, we prove that there exists a expression form such that this
expression form is true for all possible set $B$. This identities comes from
the partition numbers of natural numbers into
$\{1,\alpha,\alpha^2,\alpha^3,\cdots\}$. Furthermore, we prove that there exist
inverse forms of the expression forms. And we prove other similar identities.
The proofs in this paper are constructive.
|
math.CO
|
let b be an infinite subset of mathbfn when we consider partitions of natural numbers into elements of b a partition number without a restriction of the number of equal parts can be expressed by partition numbers with a restriction alpha of the number of equal parts although there are many way of the expression we prove that there exists a expression form such that this expression form is true for all possible set b this identities comes from the partition numbers of natural numbers into 1alphaalpha2alpha3cdots furthermore we prove that there exist inverse forms of the expression forms and we prove other similar identities the proofs in this paper are constructive
|
[['let', 'b', 'be', 'an', 'infinite', 'subset', 'of', 'mathbfn', 'when', 'we', 'consider', 'partitions', 'of', 'natural', 'numbers', 'into', 'elements', 'of', 'b', 'a', 'partition', 'number', 'without', 'a', 'restriction', 'of', 'the', 'number', 'of', 'equal', 'parts', 'can', 'be', 'expressed', 'by', 'partition', 'numbers', 'with', 'a', 'restriction', 'alpha', 'of', 'the', 'number', 'of', 'equal', 'parts', 'although', 'there', 'are', 'many', 'way', 'of', 'the', 'expression', 'we', 'prove', 'that', 'there', 'exists', 'a', 'expression', 'form', 'such', 'that', 'this', 'expression', 'form', 'is', 'true', 'for', 'all', 'possible', 'set', 'b', 'this', 'identities', 'comes', 'from', 'the', 'partition', 'numbers', 'of', 'natural', 'numbers', 'into', '1alphaalpha2alpha3cdots', 'furthermore', 'we', 'prove', 'that', 'there', 'exist', 'inverse', 'forms', 'of', 'the', 'expression', 'forms', 'and', 'we', 'prove', 'other', 'similar', 'identities', 'the', 'proofs', 'in', 'this', 'paper', 'are', 'constructive']]
|
[-0.20056732481939146, 0.1321357910696738, -0.06336693370060341, 0.053021116733869854, -0.058655244604524995, -0.11974255637441938, 0.05414506095054618, 0.2850512934529835, -0.28130727509657544, -0.27492812266657213, 0.05300112588746423, -0.27293162766911155, -0.19538087297130274, 0.20143733491600901, -0.04155318463758171, -0.043893293989402754, 0.051738939780809054, 0.12037059588374587, -0.016856795326315774, -0.2165319222562552, 0.349069304369927, -0.1370464488612236, 0.20055356495887847, 0.032062174316059365, 0.08874532583731788, -0.006049019594987233, -0.001621856828228579, 0.061261001141607624, -0.13055182119032005, 0.12461808846785209, 0.2555836219642613, 0.21168356787555995, 0.28327973442034676, -0.4242079623865786, -0.09434222767280566, 0.22272649084360482, 0.1799014317173813, 0.04798249606680763, -0.04248054561138086, -0.18095590992251764, 0.13847346000818048, -0.16538880621125032, -0.12549180218211567, -0.0744477068829174, 0.09321361665009849, 0.01616901285140901, -0.31266813225171586, 0.02713308912106194, 0.09652745015583597, 0.07252852437044452, -0.05834516532182157, -0.18074370609378224, 0.004726947044013991, 0.1487731569824711, 0.05336705247162598, 0.0200993136863585, 0.025008363972275374, -0.12765752591259844, -0.07642302219126676, 0.3832012949393945, -0.0032181064682165247, -0.2830701413656677, 0.13929013985939123, -0.16916600616254449, -0.15803254354925542, 0.10538113877378605, 0.0972617236417005, 0.09912758582766663, -0.09451144960405293, 0.149617422761727, -0.15566330307440177, 0.14814973834834927, 0.1600814847923765, 0.041020025125797, 0.18637619227976412, 0.033662941508196494, 0.06958665280038626, 0.2079490325272058, 0.0030989212588079878, -0.029544533260254743, -0.36357828009840065, -0.19683652349353373, -0.1787487198105753, 0.13379064257265078, -0.09893266068808713, -0.18982471027914938, 0.3212227879704589, 0.11151892817495307, 0.23116375282742418, 0.11717898982602197, 0.25396890547608975, 0.1643799577352249, 0.08257657831046009, 0.05321762121391592, 0.08118997351056687, 0.1254783258416799, -0.041422965361627644, -0.1089962293443203, 0.06343398206691081, 0.12879528938415083]
|
1,803.08096
|
Partial regularity for the steady hyperdissipative fractional
Navier-Stokes equations
|
We extend the Caffarelli-Kohn-Nirenberg type partial regularity theory for
the steady $5$-dimensional fractional Navier-Stokes equations with external
force to the hyperdissipative setting. In our argument we use the methods of
Colombo-De Lellis-Massaccesi to apply a blowup procedure adapted from work of
Ladyzhenskaya-Seregin.
|
math.AP
|
we extend the caffarellikohnnirenberg type partial regularity theory for the steady 5dimensional fractional navierstokes equations with external force to the hyperdissipative setting in our argument we use the methods of colombode lellismassaccesi to apply a blowup procedure adapted from work of ladyzhenskayaseregin
|
[['we', 'extend', 'the', 'caffarellikohnnirenberg', 'type', 'partial', 'regularity', 'theory', 'for', 'the', 'steady', '5dimensional', 'fractional', 'navierstokes', 'equations', 'with', 'external', 'force', 'to', 'the', 'hyperdissipative', 'setting', 'in', 'our', 'argument', 'we', 'use', 'the', 'methods', 'of', 'colombode', 'lellismassaccesi', 'to', 'apply', 'a', 'blowup', 'procedure', 'adapted', 'from', 'work', 'of', 'ladyzhenskayaseregin']]
|
[-0.07110084687622312, -0.028507035846511524, -0.12163443677127361, 0.0729021439089989, -0.12979792488309053, -0.13700405487981746, 0.04219288952374019, 0.2621026234462475, -0.27412087803419966, -0.227682042413224, 0.12391430280135515, -0.2341185032796019, -0.15350493444846228, 0.20660645280701992, -0.1218413084697647, 0.10511758216680625, 0.029876581823023465, -0.01600971727823027, -0.1023052372635366, -0.2616446044427367, 0.4319846475473008, -0.06196271613813364, 0.23776152185522592, -0.0053504755577215785, 0.10126765383980595, -0.006029572958747546, -0.03452099148088541, 0.03797988878945128, -0.264326068930901, 0.13906799469931194, 0.20669267140328884, 0.03564584424766975, 0.29657635384072095, -0.4574594522515933, -0.2509766589754667, 0.08886545254156375, 0.11283820294416867, 0.20683661752786392, 0.006616948315730462, -0.31072820455600053, 0.06331898981275466, -0.1656463689242418, -0.2614990670759326, -0.10096261996584825, -0.04930857170182161, 0.05845377345879873, -0.3062532211725528, 0.15365094447938296, 0.1209285194054246, 0.030080767617059443, -0.19287268945183128, -0.021729334460523646, 0.019831298474365704, 0.04209580314226258, 0.07850444048810272, 0.028684495637814205, 0.07441417595896965, -0.086772112080302, -0.1468114237754773, 0.3188588608724949, -0.11782399433641097, -0.30677866238432056, 0.18375337694604427, -0.09871493208293732, -0.14903935289774567, 0.07880285513611177, 0.19163399648207885, 0.2051301376822476, -0.10307786426244256, 0.13896075387795767, -0.046283299963061623, 0.1192681427495793, 0.1038740985095501, -0.05114982502821546, 0.014491932108425178, 0.13843192241321772, 0.133322141204889, 0.15931422580988744, -0.030785786131253608, -0.10626627898846681, -0.38207721633788866, -0.1421659133898524, -0.1158961407677569, 0.13529791167447677, -0.09712602012829545, -0.15865775909370336, 0.3160066852847544, 0.21588736158819535, 0.11594476469326764, 0.09751775144384457, 0.2535564763805805, 0.1356951927390093, -0.011129540833047567, 0.06922463970020032, 0.20263603047276726, 0.2029939534393354, 0.2180834216519426, -0.21543751453431562, -0.0561074968188619, 0.23892262833527264]
|
1,803.08097
|
How Do Practitioners Perceive Assurance Cases in Safety-Critical
Software Systems?
|
Safety-critical software systems are those whose failure or malfunction could
result in casualty and/or serious financial loss. In such systems, safety
assurance cases (SACs) are an emerging approach that adopts a proactive
strategy to produce structuralized safety justifications and arguments. While
SACs are recommended in many software-intensive safety-critical domains, the
lack of knowledge regarding the practitioners' perspectives on using SACs
hinders effective adoption of this approach. To gain such knowledge, we
interviewed nine practitioners and safety experts who focused on
safety-critical software systems. In general, our participants found the SAC
approach beneficial for communication of safety arguments and management of
safety issues in a multidisciplinary setting. The challenges they faced when
using SACs were primarily associated with (1) a lack of tool support, (2)
insufficient process integration, and (3) scarcity of experienced personnel. To
overcome those challenges, our participants suggested tactics that focused on
creating direct safety arguments. Process and organizational adjustments are
also needed to streamline SAC analysis and creation. Finally, our participants
emphasized the importance of knowledge sharing about SACs across
software-intensive safety-critical domains.
|
cs.SE
|
safetycritical software systems are those whose failure or malfunction could result in casualty andor serious financial loss in such systems safety assurance cases sacs are an emerging approach that adopts a proactive strategy to produce structuralized safety justifications and arguments while sacs are recommended in many softwareintensive safetycritical domains the lack of knowledge regarding the practitioners perspectives on using sacs hinders effective adoption of this approach to gain such knowledge we interviewed nine practitioners and safety experts who focused on safetycritical software systems in general our participants found the sac approach beneficial for communication of safety arguments and management of safety issues in a multidisciplinary setting the challenges they faced when using sacs were primarily associated with 1 a lack of tool support 2 insufficient process integration and 3 scarcity of experienced personnel to overcome those challenges our participants suggested tactics that focused on creating direct safety arguments process and organizational adjustments are also needed to streamline sac analysis and creation finally our participants emphasized the importance of knowledge sharing about sacs across softwareintensive safetycritical domains
|
[['safetycritical', 'software', 'systems', 'are', 'those', 'whose', 'failure', 'or', 'malfunction', 'could', 'result', 'in', 'casualty', 'andor', 'serious', 'financial', 'loss', 'in', 'such', 'systems', 'safety', 'assurance', 'cases', 'sacs', 'are', 'an', 'emerging', 'approach', 'that', 'adopts', 'a', 'proactive', 'strategy', 'to', 'produce', 'structuralized', 'safety', 'justifications', 'and', 'arguments', 'while', 'sacs', 'are', 'recommended', 'in', 'many', 'softwareintensive', 'safetycritical', 'domains', 'the', 'lack', 'of', 'knowledge', 'regarding', 'the', 'practitioners', 'perspectives', 'on', 'using', 'sacs', 'hinders', 'effective', 'adoption', 'of', 'this', 'approach', 'to', 'gain', 'such', 'knowledge', 'we', 'interviewed', 'nine', 'practitioners', 'and', 'safety', 'experts', 'who', 'focused', 'on', 'safetycritical', 'software', 'systems', 'in', 'general', 'our', 'participants', 'found', 'the', 'sac', 'approach', 'beneficial', 'for', 'communication', 'of', 'safety', 'arguments', 'and', 'management', 'of', 'safety', 'issues', 'in', 'a', 'multidisciplinary', 'setting', 'the', 'challenges', 'they', 'faced', 'when', 'using', 'sacs', 'were', 'primarily', 'associated', 'with', '1', 'a', 'lack', 'of', 'tool', 'support', '2', 'insufficient', 'process', 'integration', 'and', '3', 'scarcity', 'of', 'experienced', 'personnel', 'to', 'overcome', 'those', 'challenges', 'our', 'participants', 'suggested', 'tactics', 'that', 'focused', 'on', 'creating', 'direct', 'safety', 'arguments', 'process', 'and', 'organizational', 'adjustments', 'are', 'also', 'needed', 'to', 'streamline', 'sac', 'analysis', 'and', 'creation', 'finally', 'our', 'participants', 'emphasized', 'the', 'importance', 'of', 'knowledge', 'sharing', 'about', 'sacs', 'across', 'softwareintensive', 'safetycritical', 'domains']]
|
[-0.11371554825987135, 0.0186894522322109, -0.03733209001698664, 0.08881511584466872, -0.127458493241242, -0.16245395244498337, 0.09421462859459487, 0.4017925470215934, -0.18662911738402077, -0.3708687781436103, 0.1732386344877471, -0.2784622668341867, -0.16169094340742698, 0.22073747474034983, -0.18370765129769487, 0.11322816754159118, 0.09017670789400914, -0.030151982568204404, 0.0389144246885553, -0.2699306815836046, 0.3022517431327807, 0.025283877559538398, 0.3503696079498955, 0.10454119029587933, 0.004164910023765904, -0.0023948732763528825, -0.065708609963102, -0.03617370253754156, -0.061113345199680355, 0.18508424083835312, 0.38936443690476674, 0.24078246659200106, 0.4261584234982729, -0.46045860045722553, -0.2246053066423961, 0.05748756451266152, 0.13773992609764849, 0.022284519907885363, -0.036855877746295715, -0.32515234590375, 0.08370450801881296, -0.23375385463237763, -0.1474772853723594, -0.1113093092265938, -0.03184376814003501, 0.03285501717157396, -0.2383498575325523, -0.018053033742721058, 0.07556690542293447, 0.18212430204131774, -0.05349755760714678, -0.10542188389559409, 0.0010832191937203918, 0.20479902791208587, 0.10093982233566098, -0.03434705493439521, 0.1822296142099159, -0.18640364290215075, -0.16871269134837868, 0.3798957042821816, 0.09831323930694323, -0.15149373112246395, 0.24877146544067988, -0.019333255430683493, -0.19253035282982248, 0.08985774987177657, 0.21089295158428806, 0.06251747285281974, -0.19322630116957173, -0.00036639099075858083, 0.10930368580589336, 0.17415299626067282, 0.067112888778959, -0.004840503618054624, 0.19220333690954639, 0.21447531068564527, 0.025489358354825527, 0.04120347903775317, 0.0430838925507851, -0.12784874687112668, -0.23519073811226657, -0.11344800894015601, -0.07537275400278824, 0.00855756893022252, -0.038814126438062105, -0.1256023329130507, 0.30531090306650316, 0.2014821650407144, 0.06481192071522986, 0.012544731862144545, 0.35262427969702653, 0.018365985694607453, 0.09301511841693094, 0.07887757904827594, 0.1920699196772018, -0.0012511369599295513, 0.18254713553003968, -0.15660971383431127, 0.18516535625926087, -0.05135847779789141]
|
1,803.08098
|
Sunstardb: a database for the study of stellar magnetism and the
solar-stellar connection
|
The "solar-stellar connection" began as a relatively small field of research
focused on understanding the processes that generate magnetic field in stars
and which sometimes lead to a cyclic pattern of long-term variability in
activity, as demonstrated by our Sun. This area of study has recently become
more broadly pertinent to questions of exoplanet habitability and exo-space
weather, as well as stellar evolution. In contrast to other areas of stellar
research, individual stars in the solar-stellar connection often have a
distinct identity and character in the literature, due primarily to the rarity
of the decades-long time series that are necessary for studying stellar
activity cycles. Furthermore, the underlying stellar dynamo is not well
understood theoretically, and is thought to be sensitive to several stellar
properties, e.g. luminosity, differential rotation, and depth of the convection
zone, which in turn are often parameterized by other more readily available
properties. Relevant observations are scattered throughout the literature and
existing stellar databases, and consolidating information for new studies is a
tedious and laborious exercise. To accelerate research in this area I developed
sunstardb, a relational database of stellar properties and magnetic activity
proxy time series keyed by individual named stars. The organization of the data
eliminates the need for problematic catalog cross matching operations inherent
when building an analysis dataset from heterogeneous sources. In this article I
describe the principles behind sunstardb, the data structures and programming
interfaces, as well as use cases from solar-stellar connection research.
|
astro-ph.SR astro-ph.IM
|
the solarstellar connection began as a relatively small field of research focused on understanding the processes that generate magnetic field in stars and which sometimes lead to a cyclic pattern of longterm variability in activity as demonstrated by our sun this area of study has recently become more broadly pertinent to questions of exoplanet habitability and exospace weather as well as stellar evolution in contrast to other areas of stellar research individual stars in the solarstellar connection often have a distinct identity and character in the literature due primarily to the rarity of the decadeslong time series that are necessary for studying stellar activity cycles furthermore the underlying stellar dynamo is not well understood theoretically and is thought to be sensitive to several stellar properties eg luminosity differential rotation and depth of the convection zone which in turn are often parameterized by other more readily available properties relevant observations are scattered throughout the literature and existing stellar databases and consolidating information for new studies is a tedious and laborious exercise to accelerate research in this area i developed sunstardb a relational database of stellar properties and magnetic activity proxy time series keyed by individual named stars the organization of the data eliminates the need for problematic catalog cross matching operations inherent when building an analysis dataset from heterogeneous sources in this article i describe the principles behind sunstardb the data structures and programming interfaces as well as use cases from solarstellar connection research
|
[['the', 'solarstellar', 'connection', 'began', 'as', 'a', 'relatively', 'small', 'field', 'of', 'research', 'focused', 'on', 'understanding', 'the', 'processes', 'that', 'generate', 'magnetic', 'field', 'in', 'stars', 'and', 'which', 'sometimes', 'lead', 'to', 'a', 'cyclic', 'pattern', 'of', 'longterm', 'variability', 'in', 'activity', 'as', 'demonstrated', 'by', 'our', 'sun', 'this', 'area', 'of', 'study', 'has', 'recently', 'become', 'more', 'broadly', 'pertinent', 'to', 'questions', 'of', 'exoplanet', 'habitability', 'and', 'exospace', 'weather', 'as', 'well', 'as', 'stellar', 'evolution', 'in', 'contrast', 'to', 'other', 'areas', 'of', 'stellar', 'research', 'individual', 'stars', 'in', 'the', 'solarstellar', 'connection', 'often', 'have', 'a', 'distinct', 'identity', 'and', 'character', 'in', 'the', 'literature', 'due', 'primarily', 'to', 'the', 'rarity', 'of', 'the', 'decadeslong', 'time', 'series', 'that', 'are', 'necessary', 'for', 'studying', 'stellar', 'activity', 'cycles', 'furthermore', 'the', 'underlying', 'stellar', 'dynamo', 'is', 'not', 'well', 'understood', 'theoretically', 'and', 'is', 'thought', 'to', 'be', 'sensitive', 'to', 'several', 'stellar', 'properties', 'eg', 'luminosity', 'differential', 'rotation', 'and', 'depth', 'of', 'the', 'convection', 'zone', 'which', 'in', 'turn', 'are', 'often', 'parameterized', 'by', 'other', 'more', 'readily', 'available', 'properties', 'relevant', 'observations', 'are', 'scattered', 'throughout', 'the', 'literature', 'and', 'existing', 'stellar', 'databases', 'and', 'consolidating', 'information', 'for', 'new', 'studies', 'is', 'a', 'tedious', 'and', 'laborious', 'exercise', 'to', 'accelerate', 'research', 'in', 'this', 'area', 'i', 'developed', 'sunstardb', 'a', 'relational', 'database', 'of', 'stellar', 'properties', 'and', 'magnetic', 'activity', 'proxy', 'time', 'series', 'keyed', 'by', 'individual', 'named', 'stars', 'the', 'organization', 'of', 'the', 'data', 'eliminates', 'the', 'need', 'for', 'problematic', 'catalog', 'cross', 'matching', 'operations', 'inherent', 'when', 'building', 'an', 'analysis', 'dataset', 'from', 'heterogeneous', 'sources', 'in', 'this', 'article', 'i', 'describe', 'the', 'principles', 'behind', 'sunstardb', 'the', 'data', 'structures', 'and', 'programming', 'interfaces', 'as', 'well', 'as', 'use', 'cases', 'from', 'solarstellar', 'connection', 'research']]
|
[-0.06987262856219104, 0.10749877945099005, -0.05273672321182627, 0.12371403391809199, -0.13399284357698713, -0.06336632278686026, 0.04235724155782409, 0.3915546193904402, -0.2525583475584713, -0.38585304114117414, 0.13391741400360443, -0.24689133965344598, -0.14982430492257273, 0.24387557469129648, -0.09851755123175836, 0.03090030462826463, 0.07436876349862186, -0.005303121307146005, 0.0016408477759151043, -0.23485707384592147, 0.3039359664911582, 0.09064235416128923, 0.23787499969067724, 0.009269519030605347, 0.018239847004715027, -0.05594625912367123, -0.10848288671248806, 0.007614389598650432, -0.0975710300695952, 0.11041491766096985, 0.31100756553276077, 0.1730303225760576, 0.2631705730604742, -0.441258769490103, -0.2444883055513516, 0.0295223446537043, 0.15625428091327678, 0.06425549711692012, -0.07245145671765699, -0.2503183746934555, 0.03548393548655621, -0.15259173093363643, -0.10870859685114341, -0.06295987030808115, 0.06923442255006138, 0.024341495266212952, -0.21238343671342952, 0.04834073716417125, 0.0622195549109029, 0.15947159774421765, -0.064130291604549, -0.08923458320383829, -0.03138465494500991, 0.16613573823967095, 0.08872135333365208, 0.04954396710002648, 0.13735928459100705, -0.1504914317363622, -0.08525168056106118, 0.4008009802024518, -0.02979323640369126, -0.1080867176280353, 0.21738994848591767, -0.14525047602823693, -0.17354757826740533, 0.08786868675190693, 0.19240256804679193, 0.1277111122211735, -0.20263640052684595, 0.025680841773475956, -0.014481748376984566, 0.15055830916727958, 0.03783420352501934, 0.04808464825647995, 0.27637671400634456, 0.1596945524524851, 0.031172575856099113, 0.07948763310692865, -0.11570452250582765, -0.0974557932710934, -0.21940030535891714, -0.11828368188063633, -0.12845635794961044, 0.02635735912202361, -0.042723499859091, -0.16900588123922922, 0.3853016859712659, 0.16138681544075986, 0.18254215508811486, -0.0063274114236189245, 0.31103633285820853, 0.054766598010254075, 0.1189104301731307, 0.07541950732755524, 0.23669151916976292, 0.1537686750375863, 0.12989470378120904, -0.20049227726949123, 0.11749950798877604, 0.0039588652833276025]
|
1,803.08099
|
Pseudoscalar pole light-by-light contributions to the muon $(g-2)$ in
Resonance Chiral Theory
|
We have studied the $P\to\gamma^\star\gamma^\star$ transition form-factors
($P=\pi^0,\eta,\eta'$) within a chiral invariant framework that allows us to
relate the three form-factors and evaluate the corresponding contributions to
the muon anomalous magnetic moment $a_\mu$, through pseudoscalar pole
contributions. We use a chiral invariant Lagrangian to describe the
interactions between the pseudo-Goldstones from the spontaneous chiral symmetry
breaking and the massive meson resonances. We will consider just the lightest
vector and pseudoscalar resonance multiplets. Photon interactions and flavor
breaking effects are accounted for in this covariant framework. This article
studies the most general corrections of order $m_P^2$ within this setting.
Requiring short-distance constraints fixes most of the parameters entering the
form-factors, consistent with previous determinations. The remaining ones are
obtained from a fit of these form-factors to experimental measurements in the
space-like ($q^2\le0$) region of photon momenta. The combination of data,
chiral symmetry relations between form-factors and high-energy constraints
allows us to determine with improved precision the on-shell $P$-pole
contribution to the Hadronic Light-by-Light scattering of the muon anomalous
magnetic moment: we obtain $a_{\mu}^{P,HLbL}=(8.47\pm 0.16)\cdot10^{-10}$ for
our best fit. This result was obtained excluding BaBar $\pi^0$ data, which our
analysis finds in conflict with the remaining experimental inputs. This study
also allows us to determine the parameters describing the $\eta-\eta'$ system
in the two-mixing angle scheme and their correlations. Finally, a preliminary
rough estimate of the impact of loop corrections ($1/N_C$) and higher vector
multiplets (asym) enlarges the uncertainty up to $a_\mu^{P,HLbL} = (8.47\pm
0.16_{\rm sta}\pm0.09_{1/N_C}{}^{+0.5}_{-0.0}{}_{\rm asym})\cdot 10^{-10}$.
|
hep-ph
|
we have studied the ptogammastargammastar transition formfactors ppi0etaeta within a chiral invariant framework that allows us to relate the three formfactors and evaluate the corresponding contributions to the muon anomalous magnetic moment a_mu through pseudoscalar pole contributions we use a chiral invariant lagrangian to describe the interactions between the pseudogoldstones from the spontaneous chiral symmetry breaking and the massive meson resonances we will consider just the lightest vector and pseudoscalar resonance multiplets photon interactions and flavor breaking effects are accounted for in this covariant framework this article studies the most general corrections of order m_p2 within this setting requiring shortdistance constraints fixes most of the parameters entering the formfactors consistent with previous determinations the remaining ones are obtained from a fit of these formfactors to experimental measurements in the spacelike q2le0 region of photon momenta the combination of data chiral symmetry relations between formfactors and highenergy constraints allows us to determine with improved precision the onshell ppole contribution to the hadronic lightbylight scattering of the muon anomalous magnetic moment we obtain a_muphlbl847pm 016cdot1010 for our best fit this result was obtained excluding babar pi0 data which our analysis finds in conflict with the remaining experimental inputs this study also allows us to determine the parameters describing the etaeta system in the twomixing angle scheme and their correlations finally a preliminary rough estimate of the impact of loop corrections 1n_c and higher vector multiplets asym enlarges the uncertainty up to a_muphlbl 847pm 016_rm stapm009_1n_c05_00_rm asymcdot 1010
|
[['we', 'have', 'studied', 'the', 'ptogammastargammastar', 'transition', 'formfactors', 'ppi0etaeta', 'within', 'a', 'chiral', 'invariant', 'framework', 'that', 'allows', 'us', 'to', 'relate', 'the', 'three', 'formfactors', 'and', 'evaluate', 'the', 'corresponding', 'contributions', 'to', 'the', 'muon', 'anomalous', 'magnetic', 'moment', 'a_mu', 'through', 'pseudoscalar', 'pole', 'contributions', 'we', 'use', 'a', 'chiral', 'invariant', 'lagrangian', 'to', 'describe', 'the', 'interactions', 'between', 'the', 'pseudogoldstones', 'from', 'the', 'spontaneous', 'chiral', 'symmetry', 'breaking', 'and', 'the', 'massive', 'meson', 'resonances', 'we', 'will', 'consider', 'just', 'the', 'lightest', 'vector', 'and', 'pseudoscalar', 'resonance', 'multiplets', 'photon', 'interactions', 'and', 'flavor', 'breaking', 'effects', 'are', 'accounted', 'for', 'in', 'this', 'covariant', 'framework', 'this', 'article', 'studies', 'the', 'most', 'general', 'corrections', 'of', 'order', 'm_p2', 'within', 'this', 'setting', 'requiring', 'shortdistance', 'constraints', 'fixes', 'most', 'of', 'the', 'parameters', 'entering', 'the', 'formfactors', 'consistent', 'with', 'previous', 'determinations', 'the', 'remaining', 'ones', 'are', 'obtained', 'from', 'a', 'fit', 'of', 'these', 'formfactors', 'to', 'experimental', 'measurements', 'in', 'the', 'spacelike', 'q2le0', 'region', 'of', 'photon', 'momenta', 'the', 'combination', 'of', 'data', 'chiral', 'symmetry', 'relations', 'between', 'formfactors', 'and', 'highenergy', 'constraints', 'allows', 'us', 'to', 'determine', 'with', 'improved', 'precision', 'the', 'onshell', 'ppole', 'contribution', 'to', 'the', 'hadronic', 'lightbylight', 'scattering', 'of', 'the', 'muon', 'anomalous', 'magnetic', 'moment', 'we', 'obtain', 'a_muphlbl847pm', '016cdot1010', 'for', 'our', 'best', 'fit', 'this', 'result', 'was', 'obtained', 'excluding', 'babar', 'pi0', 'data', 'which', 'our', 'analysis', 'finds', 'in', 'conflict', 'with', 'the', 'remaining', 'experimental', 'inputs', 'this', 'study', 'also', 'allows', 'us', 'to', 'determine', 'the', 'parameters', 'describing', 'the', 'etaeta', 'system', 'in', 'the', 'twomixing', 'angle', 'scheme', 'and', 'their', 'correlations', 'finally', 'a', 'preliminary', 'rough', 'estimate', 'of', 'the', 'impact', 'of', 'loop', 'corrections', '1n_c', 'and', 'higher', 'vector', 'multiplets', 'asym', 'enlarges', 'the', 'uncertainty', 'up', 'to', 'a_muphlbl', '847pm', '016_rm', 'stapm009_1n_c05_00_rm', 'asymcdot', '1010']]
|
[-0.11799964879748367, 0.19248429361616898, -0.062430413335445835, 0.11490872553439786, -0.12511369365950958, -0.08614594741152848, 0.070448275346233, 0.3118775447824562, -0.1792210442875412, -0.29767160492153766, -0.010412657577464509, -0.33591223453278224, -0.06174410072923738, 0.10617082416931319, 0.05875252741036733, 0.08352756567595152, 0.03120152213582729, 0.038048011615528635, -0.11027441402475545, -0.1791210232648295, 0.31665777422032065, 0.015133570440017615, 0.2296244005167751, 0.1253366091892187, 0.056419730477250886, 0.026158180510497335, -0.051593512420586504, -0.06762946990434512, -0.14494018825566093, 0.12380200557164896, 0.20269249729980024, 0.0469573083271966, 0.0841348726700096, -0.388262168428353, -0.1356687337268032, 0.09548069587548946, 0.1371836684596257, 0.12975666449303327, 0.012430320598800615, -0.3256885312545581, 0.0514413104062828, -0.18275539561018922, -0.16063392961341807, -0.14727772565112876, -0.04158450847955285, -0.0898420531952218, -0.3398517372382429, 0.09084567837224766, -0.01706977557818617, 0.018032702262480365, -0.06796061301423045, -0.17298286288972672, -0.0008637415317123029, 0.12237263903173702, 0.15280496983742942, 0.07069675949633984, 0.140699602242823, -0.14414549470739113, -0.13924188955882844, 0.40198829333605685, -0.0598455092571416, -0.17855820769609987, 0.09877252951264381, -0.20507293652199496, -0.17973998632000224, 0.14461666177618498, 0.1846094629507464, 0.07544707819292834, -0.20330603761536514, 0.09538727208333442, -0.013245295498384234, 0.14224608223225776, 0.05602091211973502, 0.04716736383690167, 0.1954694129034473, 0.12719027960049428, -0.008355037516078915, 0.09994843799636856, -0.08884193413679052, -0.08893122409106644, -0.3907329652322528, -0.10085654340468571, -0.08012228920284355, 0.025206452902594316, -0.08965394748710825, -0.0857825512141429, 0.3923151037609273, 0.17456471840870993, 0.23986626984031928, 0.028064107236076673, 0.3133718524519914, 0.10420079171620589, 0.12654788022892863, 0.038117425462287, 0.319704062789039, 0.19934422513589967, 0.08795489796463304, -0.28714442162978354, -0.01206176651665709, 0.05696217289650133]
|
1,803.081
|
Planning with a Receding Horizon for Manipulation in Clutter using a
Learned Value Function
|
Manipulation in clutter requires solving complex sequential decision making
problems in an environment rich with physical interactions. The transfer of
motion planning solutions from simulation to the real world, in open-loop,
suffers from the inherent uncertainty in modelling real world physics. We
propose interleaving planning and execution in real-time, in a closed-loop
setting, using a Receding Horizon Planner (RHP) for pushing manipulation in
clutter. In this context, we address the problem of finding a suitable value
function based heuristic for efficient planning, and for estimating the
cost-to-go from the horizon to the goal. We estimate such a value function
first by using plans generated by an existing sampling-based planner. Then, we
further optimize the value function through reinforcement learning. We evaluate
our approach and compare it to state-of-the-art planning techniques for
manipulation in clutter. We conduct experiments in simulation with artificially
injected uncertainty on the physics parameters, as well as in real world tasks
of manipulation in clutter. We show that this approach enables the robot to
react to the uncertain dynamics of the real world effectively.
|
cs.RO
|
manipulation in clutter requires solving complex sequential decision making problems in an environment rich with physical interactions the transfer of motion planning solutions from simulation to the real world in openloop suffers from the inherent uncertainty in modelling real world physics we propose interleaving planning and execution in realtime in a closedloop setting using a receding horizon planner rhp for pushing manipulation in clutter in this context we address the problem of finding a suitable value function based heuristic for efficient planning and for estimating the costtogo from the horizon to the goal we estimate such a value function first by using plans generated by an existing samplingbased planner then we further optimize the value function through reinforcement learning we evaluate our approach and compare it to stateoftheart planning techniques for manipulation in clutter we conduct experiments in simulation with artificially injected uncertainty on the physics parameters as well as in real world tasks of manipulation in clutter we show that this approach enables the robot to react to the uncertain dynamics of the real world effectively
|
[['manipulation', 'in', 'clutter', 'requires', 'solving', 'complex', 'sequential', 'decision', 'making', 'problems', 'in', 'an', 'environment', 'rich', 'with', 'physical', 'interactions', 'the', 'transfer', 'of', 'motion', 'planning', 'solutions', 'from', 'simulation', 'to', 'the', 'real', 'world', 'in', 'openloop', 'suffers', 'from', 'the', 'inherent', 'uncertainty', 'in', 'modelling', 'real', 'world', 'physics', 'we', 'propose', 'interleaving', 'planning', 'and', 'execution', 'in', 'realtime', 'in', 'a', 'closedloop', 'setting', 'using', 'a', 'receding', 'horizon', 'planner', 'rhp', 'for', 'pushing', 'manipulation', 'in', 'clutter', 'in', 'this', 'context', 'we', 'address', 'the', 'problem', 'of', 'finding', 'a', 'suitable', 'value', 'function', 'based', 'heuristic', 'for', 'efficient', 'planning', 'and', 'for', 'estimating', 'the', 'costtogo', 'from', 'the', 'horizon', 'to', 'the', 'goal', 'we', 'estimate', 'such', 'a', 'value', 'function', 'first', 'by', 'using', 'plans', 'generated', 'by', 'an', 'existing', 'samplingbased', 'planner', 'then', 'we', 'further', 'optimize', 'the', 'value', 'function', 'through', 'reinforcement', 'learning', 'we', 'evaluate', 'our', 'approach', 'and', 'compare', 'it', 'to', 'stateoftheart', 'planning', 'techniques', 'for', 'manipulation', 'in', 'clutter', 'we', 'conduct', 'experiments', 'in', 'simulation', 'with', 'artificially', 'injected', 'uncertainty', 'on', 'the', 'physics', 'parameters', 'as', 'well', 'as', 'in', 'real', 'world', 'tasks', 'of', 'manipulation', 'in', 'clutter', 'we', 'show', 'that', 'this', 'approach', 'enables', 'the', 'robot', 'to', 'react', 'to', 'the', 'uncertain', 'dynamics', 'of', 'the', 'real', 'world', 'effectively']]
|
[-0.05792976744173063, 0.017842147937524633, -0.07165129456865091, 0.03819371461355269, -0.12004283034784646, -0.09106974428951067, 0.05332885940669704, 0.4470544699421626, -0.30420044274200914, -0.3675294638490357, 0.11564423869190327, -0.24020579424397337, -0.18016539517123156, 0.2238981266042986, -0.1438754043662868, 0.11685500185315807, 0.10212405704719535, 0.006593035018376711, -0.041935689780219214, -0.19977035523934217, 0.2897868905529527, 0.03378954461360045, 0.26233219901510213, 0.020568569272356688, 0.15582052036583172, 0.08727484456352931, -0.005516610602916634, 0.03064796716858775, -0.06877945298033847, 0.13658150241218275, 0.32481281436969245, 0.22524725266148227, 0.3156672330089124, -0.42741255460459593, -0.19914831204529285, 0.1038924667982274, 0.1197781851613831, 0.10916771565032544, -0.0536104284080882, -0.346621311117111, 0.04880310497167757, -0.16073091713695833, -0.08954061417824637, -0.10317495872008767, 0.008597385306647942, -0.03126048881265908, -0.3029697242082428, 0.01385060403006688, -0.006036190395006689, 0.048061833497581447, -0.09686965029160519, -0.051275971645520904, 0.07170127269596198, 0.1628063084257735, 0.014803931453807206, 0.014235451816197085, 0.17531984322046662, -0.19560941992327407, -0.2093003209769768, 0.3999728049377853, -0.024820621896240503, -0.24736131361480487, 0.17670247674982806, -0.09051737484474809, -0.1158354553278262, 0.10930465556954765, 0.26139570056792283, 0.1794109187157309, -0.1570208959816166, 0.07043251753449283, 0.001870718512336834, 0.13231089778144522, 0.008533876966737674, -0.061650076431174906, 0.18291849002115806, 0.27426362545939825, 0.11877485279435829, 0.1668897977435572, -0.06019437132471657, -0.1543662096899908, -0.2538209465558583, -0.12673009812337277, -0.16522410626675788, 0.005167769107672959, -0.10101028296566703, -0.1214545469594288, 0.34152676688117833, 0.29225665271429524, 0.18780362216682084, 0.07167795660253087, 0.38977956698186655, 0.08319362399949676, 0.019823217709248855, 0.0983681867456874, 0.2018509770113459, -0.007749497020974923, 0.12632482075053503, -0.24867649172961523, 0.092900847687286, 0.0051818650931456664]
|
1,803.08101
|
Clustering to Reduce Spatial Data Set Size
|
Traditionally it had been a problem that researchers did not have access to
enough spatial data to answer pressing research questions or build compelling
visualizations. Today, however, the problem is often that we have too much
data. Spatially redundant or approximately redundant points may refer to a
single feature (plus noise) rather than many distinct spatial features. We use
a machine learning approach with density-based clustering to compress such
spatial data into a set of representative features.
|
cs.LG stat.ML
|
traditionally it had been a problem that researchers did not have access to enough spatial data to answer pressing research questions or build compelling visualizations today however the problem is often that we have too much data spatially redundant or approximately redundant points may refer to a single feature plus noise rather than many distinct spatial features we use a machine learning approach with densitybased clustering to compress such spatial data into a set of representative features
|
[['traditionally', 'it', 'had', 'been', 'a', 'problem', 'that', 'researchers', 'did', 'not', 'have', 'access', 'to', 'enough', 'spatial', 'data', 'to', 'answer', 'pressing', 'research', 'questions', 'or', 'build', 'compelling', 'visualizations', 'today', 'however', 'the', 'problem', 'is', 'often', 'that', 'we', 'have', 'too', 'much', 'data', 'spatially', 'redundant', 'or', 'approximately', 'redundant', 'points', 'may', 'refer', 'to', 'a', 'single', 'feature', 'plus', 'noise', 'rather', 'than', 'many', 'distinct', 'spatial', 'features', 'we', 'use', 'a', 'machine', 'learning', 'approach', 'with', 'densitybased', 'clustering', 'to', 'compress', 'such', 'spatial', 'data', 'into', 'a', 'set', 'of', 'representative', 'features']]
|
[-0.034839261478182025, 0.04332485972819003, -0.136164281734979, 0.11005700897431461, -0.203543822946293, -0.22073429860416557, 0.033919517652361425, 0.4445173006698296, -0.2892846934158694, -0.36839742823080585, 0.12008884547326665, -0.32383826786240977, -0.12312704191978585, 0.1480810531511806, -0.10256438948480147, 0.06542983209614509, 0.07721847513472879, 0.04815408558729891, -0.030378385719105408, -0.27320450147638076, 0.3052378832226522, 0.050253745107972, 0.31186273015503374, -0.016222112515771932, 0.0901589641823205, -0.07153481696188063, -0.08474481257597928, 0.05831817780204069, -0.04007449976638014, 0.11963690917443048, 0.3394540141385, 0.2168379685366768, 0.3960334083863667, -0.45632335439614663, -0.2883895160267492, 0.1553001335924854, 0.22169887677270483, 0.1445047405318587, -0.0360121323315838, -0.23668216159809138, 0.09196107474446007, -0.114503632541504, -0.05000024522932899, -0.15569474425940932, 0.02122462973264711, -0.0505949505075643, -0.2527763700995643, 0.020047914895966842, 0.06739218043792364, 0.07197143899446184, -0.009035721412170437, -0.09154511494078225, 0.035953035913156454, 0.12039161169320925, 0.04375440938831351, 0.06407703725959767, 0.10579644103667565, -0.1343559470003495, -0.1042232144285332, 0.38563918370705147, 0.02017140812025097, -0.23553110741369135, 0.25689341888654155, -0.07181828981265426, -0.19584500413484773, 0.1483613121166051, 0.20310350226891505, 0.07229973384263841, -0.18420170425352725, -0.010103243209615156, -0.054205679431460894, 0.24467305991459976, 0.08293555511234256, 0.0536384925899374, 0.23820641168768142, 0.15701419735545075, 0.0533547867021475, 0.07617236494975672, -0.10042007777888279, -0.054818573589255286, -0.15225098081320138, -0.06726532401335607, -0.19290726195549132, 0.03452213107046593, -0.031593398039846066, -0.1902899622626893, 0.35231248308698854, 0.20848223172255198, 0.2384959336902414, -0.014426038015404015, 0.3430986011328248, 0.01829153730994387, 0.17879104196372164, 0.11131737639450213, 0.13536032991387048, 0.016077094542031937, 0.13999161228247278, -0.05732674120816511, 0.07096928567323205, -0.029573270496186594]
|
1,803.08102
|
Optimized mixing by cutting-and-shuffling
|
Mixing by cutting-and-shuffling can be understood and predicted using
dynamical systems based tools and techniques. In existing studies, mixing is
generated by maps that repeat the same cut-and-shuffle process at every
iteration, in a "fixed" manner. However, mixing can be greatly improved by
varying the cut-and-shuffle parameters at each step, using a "variable"
approach. To demonstrate this approach, we show how to optimize mixing by
cutting-and-shuffling on the one-dimensional line interval, known as an
interval exchange transformation (IET). Mixing can be significantly improved by
optimizing variable protocols, especially for initial conditions more complex
than just a simple two-color line interval. While we show that optimal variable
IETs can be found analytically for arbitrary numbers of iterations, for more
complex cutting-and-shuffling systems, computationally expensive numerical
optimization methods would be required. Furthermore, the number of control
parameters grows linearly with the number of iterations in variable systems.
Therefore, optimizing over large numbers of iterations is generally
computationally prohibitive. We demonstrate an ad hoc approach to
cutting-and-shuffling that is computationally inexpensive and guarantees the
mixing metric is within a constant factor of the optimum. This ad hoc approach
yields significantly better mixing than fixed IETs which are known to produce
weak-mixing, because cut pieces never reconnect. The heuristic principles of
this method can be applied to more general cutting-and-shuffling systems.
|
math.DS math.OC
|
mixing by cuttingandshuffling can be understood and predicted using dynamical systems based tools and techniques in existing studies mixing is generated by maps that repeat the same cutandshuffle process at every iteration in a fixed manner however mixing can be greatly improved by varying the cutandshuffle parameters at each step using a variable approach to demonstrate this approach we show how to optimize mixing by cuttingandshuffling on the onedimensional line interval known as an interval exchange transformation iet mixing can be significantly improved by optimizing variable protocols especially for initial conditions more complex than just a simple twocolor line interval while we show that optimal variable iets can be found analytically for arbitrary numbers of iterations for more complex cuttingandshuffling systems computationally expensive numerical optimization methods would be required furthermore the number of control parameters grows linearly with the number of iterations in variable systems therefore optimizing over large numbers of iterations is generally computationally prohibitive we demonstrate an ad hoc approach to cuttingandshuffling that is computationally inexpensive and guarantees the mixing metric is within a constant factor of the optimum this ad hoc approach yields significantly better mixing than fixed iets which are known to produce weakmixing because cut pieces never reconnect the heuristic principles of this method can be applied to more general cuttingandshuffling systems
|
[['mixing', 'by', 'cuttingandshuffling', 'can', 'be', 'understood', 'and', 'predicted', 'using', 'dynamical', 'systems', 'based', 'tools', 'and', 'techniques', 'in', 'existing', 'studies', 'mixing', 'is', 'generated', 'by', 'maps', 'that', 'repeat', 'the', 'same', 'cutandshuffle', 'process', 'at', 'every', 'iteration', 'in', 'a', 'fixed', 'manner', 'however', 'mixing', 'can', 'be', 'greatly', 'improved', 'by', 'varying', 'the', 'cutandshuffle', 'parameters', 'at', 'each', 'step', 'using', 'a', 'variable', 'approach', 'to', 'demonstrate', 'this', 'approach', 'we', 'show', 'how', 'to', 'optimize', 'mixing', 'by', 'cuttingandshuffling', 'on', 'the', 'onedimensional', 'line', 'interval', 'known', 'as', 'an', 'interval', 'exchange', 'transformation', 'iet', 'mixing', 'can', 'be', 'significantly', 'improved', 'by', 'optimizing', 'variable', 'protocols', 'especially', 'for', 'initial', 'conditions', 'more', 'complex', 'than', 'just', 'a', 'simple', 'twocolor', 'line', 'interval', 'while', 'we', 'show', 'that', 'optimal', 'variable', 'iets', 'can', 'be', 'found', 'analytically', 'for', 'arbitrary', 'numbers', 'of', 'iterations', 'for', 'more', 'complex', 'cuttingandshuffling', 'systems', 'computationally', 'expensive', 'numerical', 'optimization', 'methods', 'would', 'be', 'required', 'furthermore', 'the', 'number', 'of', 'control', 'parameters', 'grows', 'linearly', 'with', 'the', 'number', 'of', 'iterations', 'in', 'variable', 'systems', 'therefore', 'optimizing', 'over', 'large', 'numbers', 'of', 'iterations', 'is', 'generally', 'computationally', 'prohibitive', 'we', 'demonstrate', 'an', 'ad', 'hoc', 'approach', 'to', 'cuttingandshuffling', 'that', 'is', 'computationally', 'inexpensive', 'and', 'guarantees', 'the', 'mixing', 'metric', 'is', 'within', 'a', 'constant', 'factor', 'of', 'the', 'optimum', 'this', 'ad', 'hoc', 'approach', 'yields', 'significantly', 'better', 'mixing', 'than', 'fixed', 'iets', 'which', 'are', 'known', 'to', 'produce', 'weakmixing', 'because', 'cut', 'pieces', 'never', 'reconnect', 'the', 'heuristic', 'principles', 'of', 'this', 'method', 'can', 'be', 'applied', 'to', 'more', 'general', 'cuttingandshuffling', 'systems']]
|
[-0.11524275005957502, 0.15134653572093285, -0.07104243854450625, 0.07715808673695625, -0.062321629886363826, -0.19189306141992726, 0.09371612765826284, 0.4341558173147225, -0.28051795273326163, -0.32213787793203497, 0.11445822573678438, -0.1863871643790802, -0.15336394924832897, 0.23779799270113325, -0.06703470504062986, 0.07117596004634749, 0.10681985588094522, -0.008571784947673942, -0.08659808084552804, -0.2658479866057331, 0.26563369494992806, 0.05910271417327918, 0.24698671507107656, -0.0013222542082414377, 0.062428353278529504, -0.0036747544061739084, -0.011963457383112549, 0.05651454097309778, -0.08547909441996274, 0.10562288408752445, 0.24255069308849267, 0.13421947071761933, 0.27358474039884156, -0.4105247058032546, -0.24619391786670963, 0.11406958334819349, 0.219351296038042, 0.10698586519385234, -0.002723317925187456, -0.22400227377494408, 0.11340390879790797, -0.15161854894398602, -0.10100114721125317, -0.13356818224108497, -0.0013498200948328474, 0.012173534881832555, -0.3442675981670618, 0.035104506643713035, -0.0005108546077133005, 0.046718030012494256, 0.02802655744734545, -0.10235974653028385, -0.005972908289973126, 0.09426919844564657, 0.035832078036291085, 0.032136445111313534, 0.14038241297456025, -0.06920777911775161, -0.10408180820170877, 0.3783133754073534, -0.060622046879346504, -0.2406064732303453, 0.17633571244538004, -0.07812914777503804, -0.1339399318319074, 0.17531610175339116, 0.15569089719968804, 0.18137775228553732, -0.15286447193560213, 0.042471217156420354, -0.01832353645491652, 0.19716848481844482, 0.06454762793795833, -0.0016628814966764389, 0.12614597163466346, 0.15728236088237513, 0.1321779962542445, 0.09480311012783543, -0.006159075066923749, -0.09425825600967158, -0.23306333504963753, -0.11042275970441635, -0.18722316336189937, 0.04475857567713531, -0.10217087997406515, -0.12151274910998032, 0.3391126881288581, 0.16502882149070502, 0.20494640951889545, 0.07328815868525052, 0.3193241778284658, 0.15701749784341298, 0.09205207376047796, 0.08733882131704758, 0.21119090411216454, 0.06700229726103676, 0.06846356341387903, -0.18361381039099206, 0.10593612414113311, 0.05787716104843935]
|
1,803.08103
|
A Unified Framework for Multi-View Multi-Class Object Pose Estimation
|
One core challenge in object pose estimation is to ensure accurate and robust
performance for large numbers of diverse foreground objects amidst complex
background clutter. In this work, we present a scalable framework for
accurately inferring six Degree-of-Freedom (6-DoF) pose for a large number of
object classes from single or multiple views. To learn discriminative pose
features, we integrate three new capabilities into a deep Convolutional Neural
Network (CNN): an inference scheme that combines both classification and pose
regression based on a uniform tessellation of the Special Euclidean group in
three dimensions (SE(3)), the fusion of class priors into the training process
via a tiled class map, and an additional regularization using deep supervision
with an object mask. Further, an efficient multi-view framework is formulated
to address single-view ambiguity. We show that this framework consistently
improves the performance of the single-view network. We evaluate our method on
three large-scale benchmarks: YCB-Video, JHUScene-50 and ObjectNet-3D. Our
approach achieves competitive or superior performance over the current
state-of-the-art methods.
|
cs.CV
|
one core challenge in object pose estimation is to ensure accurate and robust performance for large numbers of diverse foreground objects amidst complex background clutter in this work we present a scalable framework for accurately inferring six degreeoffreedom 6dof pose for a large number of object classes from single or multiple views to learn discriminative pose features we integrate three new capabilities into a deep convolutional neural network cnn an inference scheme that combines both classification and pose regression based on a uniform tessellation of the special euclidean group in three dimensions se3 the fusion of class priors into the training process via a tiled class map and an additional regularization using deep supervision with an object mask further an efficient multiview framework is formulated to address singleview ambiguity we show that this framework consistently improves the performance of the singleview network we evaluate our method on three largescale benchmarks ycbvideo jhuscene50 and objectnet3d our approach achieves competitive or superior performance over the current stateoftheart methods
|
[['one', 'core', 'challenge', 'in', 'object', 'pose', 'estimation', 'is', 'to', 'ensure', 'accurate', 'and', 'robust', 'performance', 'for', 'large', 'numbers', 'of', 'diverse', 'foreground', 'objects', 'amidst', 'complex', 'background', 'clutter', 'in', 'this', 'work', 'we', 'present', 'a', 'scalable', 'framework', 'for', 'accurately', 'inferring', 'six', 'degreeoffreedom', '6dof', 'pose', 'for', 'a', 'large', 'number', 'of', 'object', 'classes', 'from', 'single', 'or', 'multiple', 'views', 'to', 'learn', 'discriminative', 'pose', 'features', 'we', 'integrate', 'three', 'new', 'capabilities', 'into', 'a', 'deep', 'convolutional', 'neural', 'network', 'cnn', 'an', 'inference', 'scheme', 'that', 'combines', 'both', 'classification', 'and', 'pose', 'regression', 'based', 'on', 'a', 'uniform', 'tessellation', 'of', 'the', 'special', 'euclidean', 'group', 'in', 'three', 'dimensions', 'se3', 'the', 'fusion', 'of', 'class', 'priors', 'into', 'the', 'training', 'process', 'via', 'a', 'tiled', 'class', 'map', 'and', 'an', 'additional', 'regularization', 'using', 'deep', 'supervision', 'with', 'an', 'object', 'mask', 'further', 'an', 'efficient', 'multiview', 'framework', 'is', 'formulated', 'to', 'address', 'singleview', 'ambiguity', 'we', 'show', 'that', 'this', 'framework', 'consistently', 'improves', 'the', 'performance', 'of', 'the', 'singleview', 'network', 'we', 'evaluate', 'our', 'method', 'on', 'three', 'largescale', 'benchmarks', 'ycbvideo', 'jhuscene50', 'and', 'objectnet3d', 'our', 'approach', 'achieves', 'competitive', 'or', 'superior', 'performance', 'over', 'the', 'current', 'stateoftheart', 'methods']]
|
[-0.04621439125025418, -0.08049820012962389, -0.0454884474730068, 0.03256318469788667, -0.11302988636364206, -0.18503383880271007, -0.01178449510863596, 0.4741810824631191, -0.2666896522221178, -0.34482102967243605, 0.05687605334437316, -0.22671958587448987, -0.20207176146220995, 0.1912932766164176, -0.1886563912777957, 0.1057948147843978, 0.1658595261623992, 0.014801115896439225, -0.0781444342119801, -0.28256805343184305, 0.3231108061239555, 0.007380572993453115, 0.3434341049684984, -0.008665832257886395, 0.20234535066354112, -0.0037833914918847748, -0.044466145271321804, 0.03731733194847659, -0.02409115707455274, 0.21927174589193493, 0.2660296042719515, 0.20162870929712748, 0.2923728373901146, -0.3987202468021523, -0.2534551049423654, 0.06845573476152267, 0.1344618380705758, 0.10984203320496329, -0.035084208801513674, -0.3735238740833976, 0.08143064893126238, -0.19145182622937348, -0.0021249597857382558, -0.1590866549352252, -0.05044260676155185, -0.07294080103179668, -0.3321060866128835, 0.02564350092959613, 0.06884933040348143, 0.040492446174583877, -0.06876627284545088, -0.12451489958855347, 0.0687500257996229, 0.18645799484546866, -0.01891297382808705, 0.06673749653543005, 0.13389903158815464, -0.22707707402625557, -0.14096832844831914, 0.3522646548964719, -0.04853731310051843, -0.262061248486134, 0.20319325174914854, -0.020649580118848328, -0.19603984912846056, 0.15117518453100673, 0.2726894392505595, 0.16547104669734836, -0.15376607967517908, 0.01753581900336984, -0.07047293854809207, 0.1779116084146109, 0.013779139197317929, -0.01964722351716241, 0.20482869513713323, 0.2877573317155333, 0.07722043706013298, 0.14435181531646266, -0.21672226985200968, -0.045624207913955085, -0.21202203082013024, -0.1028464710666967, -0.17026158482142975, -0.04952101410996941, -0.15618510578053424, -0.16409068537079913, 0.40782917860728846, 0.24074426489291575, 0.2352049712875358, 0.129288073986905, 0.3851563861570889, -0.019685961974773375, 0.09273968262756925, 0.10015669249554687, 0.17589436230113412, 0.00569407509003834, 0.039444182797479896, -0.15700701066213318, 0.02219206169701931, 0.08718859391690163]
|
1,803.08104
|
On Maximizing Sampling Time of RF-Harvesting Sensor Nodes Over Random
Channel Gains
|
In the future, sensor nodes or Internet of Things (IoTs) will be tasked with
sampling the environment. These nodes/devices are likely to be powered by a
Hybrid Access Point (HAP) wirelessly, and may be programmed by the HAP with a
{\em sampling time} to collect sensory data, carry out computation, and
transmit sensed data to the HAP. A key challenge, however, is random channel
gains, which cause sensor nodes to receive varying amounts of Radio Frequency
(RF) energy. To this end, we formulate a stochastic program to determine the
charging time of the HAP and sampling time of sensor nodes. Our objective is to
minimize the {\em expected} penalty incurred when sensor nodes experience an
energy shortfall. We consider two cases: {\em single} and {\em multi} time
slots. In the former, we determine a suitable HAP charging time and nodes
sampling time on a slot-by-slot basis whilst the latter considers the best
charging and sampling time for use in the next $T$ slots. We conduct
experiments over channel gains drawn from the Gaussian, Rayleigh or Rician
distribution. Numerical results confirm our stochastic program can be used to
compute good charging and sampling times that incur the minimum penalty over
the said distributions.
|
cs.NI
|
in the future sensor nodes or internet of things iots will be tasked with sampling the environment these nodesdevices are likely to be powered by a hybrid access point hap wirelessly and may be programmed by the hap with a em sampling time to collect sensory data carry out computation and transmit sensed data to the hap a key challenge however is random channel gains which cause sensor nodes to receive varying amounts of radio frequency rf energy to this end we formulate a stochastic program to determine the charging time of the hap and sampling time of sensor nodes our objective is to minimize the em expected penalty incurred when sensor nodes experience an energy shortfall we consider two cases em single and em multi time slots in the former we determine a suitable hap charging time and nodes sampling time on a slotbyslot basis whilst the latter considers the best charging and sampling time for use in the next t slots we conduct experiments over channel gains drawn from the gaussian rayleigh or rician distribution numerical results confirm our stochastic program can be used to compute good charging and sampling times that incur the minimum penalty over the said distributions
|
[['in', 'the', 'future', 'sensor', 'nodes', 'or', 'internet', 'of', 'things', 'iots', 'will', 'be', 'tasked', 'with', 'sampling', 'the', 'environment', 'these', 'nodesdevices', 'are', 'likely', 'to', 'be', 'powered', 'by', 'a', 'hybrid', 'access', 'point', 'hap', 'wirelessly', 'and', 'may', 'be', 'programmed', 'by', 'the', 'hap', 'with', 'a', 'em', 'sampling', 'time', 'to', 'collect', 'sensory', 'data', 'carry', 'out', 'computation', 'and', 'transmit', 'sensed', 'data', 'to', 'the', 'hap', 'a', 'key', 'challenge', 'however', 'is', 'random', 'channel', 'gains', 'which', 'cause', 'sensor', 'nodes', 'to', 'receive', 'varying', 'amounts', 'of', 'radio', 'frequency', 'rf', 'energy', 'to', 'this', 'end', 'we', 'formulate', 'a', 'stochastic', 'program', 'to', 'determine', 'the', 'charging', 'time', 'of', 'the', 'hap', 'and', 'sampling', 'time', 'of', 'sensor', 'nodes', 'our', 'objective', 'is', 'to', 'minimize', 'the', 'em', 'expected', 'penalty', 'incurred', 'when', 'sensor', 'nodes', 'experience', 'an', 'energy', 'shortfall', 'we', 'consider', 'two', 'cases', 'em', 'single', 'and', 'em', 'multi', 'time', 'slots', 'in', 'the', 'former', 'we', 'determine', 'a', 'suitable', 'hap', 'charging', 'time', 'and', 'nodes', 'sampling', 'time', 'on', 'a', 'slotbyslot', 'basis', 'whilst', 'the', 'latter', 'considers', 'the', 'best', 'charging', 'and', 'sampling', 'time', 'for', 'use', 'in', 'the', 'next', 't', 'slots', 'we', 'conduct', 'experiments', 'over', 'channel', 'gains', 'drawn', 'from', 'the', 'gaussian', 'rayleigh', 'or', 'rician', 'distribution', 'numerical', 'results', 'confirm', 'our', 'stochastic', 'program', 'can', 'be', 'used', 'to', 'compute', 'good', 'charging', 'and', 'sampling', 'times', 'that', 'incur', 'the', 'minimum', 'penalty', 'over', 'the', 'said', 'distributions']]
|
[-0.18004737045150251, 0.08649546883483708, -0.05575447555631399, 0.01394257016669144, -0.0964358924748376, -0.18913061960600316, 0.15304187935078517, 0.4267714443465229, -0.3185540255496744, -0.31331168508389967, 0.10188931853102985, -0.282811211431399, -0.0934262767364271, 0.13906017157016323, -0.11046526747508324, 0.04339131729793735, 0.09170827009002096, 0.04918946182355285, 0.0041153802612097935, -0.2661266636638902, 0.23662573588313535, 0.1505728295072913, 0.30397398601751774, -0.02132948944810778, 0.08861129021563102, 0.03193213583726902, -0.0593927071406506, -0.014871389000263661, -0.08565897764059628, 0.06466370474314317, 0.3298999651358463, 0.1376702358503826, 0.32510157889453695, -0.4751516622677445, -0.23439494146499784, 0.16772044277051465, 0.10950519304460613, 0.04061363954970147, -0.03848242991662119, -0.25264088405820073, 0.1272070620811428, -0.18489013728220016, -0.03819480828940868, -0.0006656075199134647, -0.05839092067059028, 0.08332756584219168, -0.3557368914806284, -0.010820274819852784, -0.06263719129376114, -0.016320367506414187, -0.056218463965924455, -0.09790524184238165, 0.013295989343896508, 0.16257099649010343, 0.031332421237020756, 0.010034145422978327, 0.15146931745577605, -0.045371522683417424, -0.12704990646793704, 0.36417518491391093, 0.007502025999128819, -0.18105136530357413, 0.13683301338169257, -0.08548712101532147, -0.07886566121131182, 0.16473319604527206, 0.24298303828807546, 0.10495452181668952, -0.1887394925123226, 0.008377274587110151, 0.032937020831741395, 0.15207942495660973, 0.053941441269998905, 0.06535855546826497, 0.1739389357669279, 0.1642438251938438, 0.15025143919221592, 0.11433897788519971, -0.14400212915497831, -0.0981372652715072, -0.25012542081531136, -0.1388569114601705, -0.27410273399902507, 0.038701310479082165, -0.08642753494852513, -0.09968874671496451, 0.3619198190152747, 0.17514392226526979, 0.17713572065811603, 0.09194798125594389, 0.3569360226765275, 0.11404673967394047, 0.08746390637941659, 0.14000975341536104, 0.1642006132006645, 0.037223790476564315, 0.15100027147796935, -0.19477629732922652, 0.08180701530072838, -0.03104594661621377]
|
1,803.08105
|
Chandra X-rays from the redshift 7.54 quasar ULAS J1342+0928
|
We present a 45 ks Chandra observation of the quasar ULAS J1342+0928 at
z=7.54. We detect 14.0^{+4.8}_{-3.7} counts from the quasar in the
observed-frame energy range 0.5-7.0 keV (6-sigma detection), representing the
most distant non-transient astronomical source identified in X-rays to date.
The present data are sufficient only to infer rough constraints on the spectral
parameters. We find an X-ray hardness ratio of HR = -0.51^{+0.26}_{-0.28}
between the 0.5-2.0 keV and 2.0-7.0 keV ranges and derive a power-law photon
index of Gamma = 1.95^{+0.55}_{-0.53}. Assuming a typical value for
high-redshift quasars of Gamma = 1.9, ULAS J1342+0928 has a 2-10 keV rest-frame
X-ray luminosity of L_{2-10} = 11.6^{+4.3}_{-3.5} x 10^{44} erg/s. Its
X-ray-to-optical power-law slope is alpha_{OX}=-1.67^{+0.16}_{-0.10},
consistent with the general trend indicating that the X-ray emission in the
most bolometrically powerful quasars is weaker relative to their optical
emission.
|
astro-ph.GA
|
we present a 45 ks chandra observation of the quasar ulas j13420928 at z754 we detect 14048_37 counts from the quasar in the observedframe energy range 0570 kev 6sigma detection representing the most distant nontransient astronomical source identified in xrays to date the present data are sufficient only to infer rough constraints on the spectral parameters we find an xray hardness ratio of hr 051026_028 between the 0520 kev and 2070 kev ranges and derive a powerlaw photon index of gamma 195055_053 assuming a typical value for highredshift quasars of gamma 19 ulas j13420928 has a 210 kev restframe xray luminosity of l_210 11643_35 x 1044 ergs its xraytooptical powerlaw slope is alpha_ox167016_010 consistent with the general trend indicating that the xray emission in the most bolometrically powerful quasars is weaker relative to their optical emission
|
[['we', 'present', 'a', '45', 'ks', 'chandra', 'observation', 'of', 'the', 'quasar', 'ulas', 'j13420928', 'at', 'z754', 'we', 'detect', '14048_37', 'counts', 'from', 'the', 'quasar', 'in', 'the', 'observedframe', 'energy', 'range', '0570', 'kev', '6sigma', 'detection', 'representing', 'the', 'most', 'distant', 'nontransient', 'astronomical', 'source', 'identified', 'in', 'xrays', 'to', 'date', 'the', 'present', 'data', 'are', 'sufficient', 'only', 'to', 'infer', 'rough', 'constraints', 'on', 'the', 'spectral', 'parameters', 'we', 'find', 'an', 'xray', 'hardness', 'ratio', 'of', 'hr', '051026_028', 'between', 'the', '0520', 'kev', 'and', '2070', 'kev', 'ranges', 'and', 'derive', 'a', 'powerlaw', 'photon', 'index', 'of', 'gamma', '195055_053', 'assuming', 'a', 'typical', 'value', 'for', 'highredshift', 'quasars', 'of', 'gamma', '19', 'ulas', 'j13420928', 'has', 'a', '210', 'kev', 'restframe', 'xray', 'luminosity', 'of', 'l_210', '11643_35', 'x', '1044', 'ergs', 'its', 'xraytooptical', 'powerlaw', 'slope', 'is', 'alpha_ox167016_010', 'consistent', 'with', 'the', 'general', 'trend', 'indicating', 'that', 'the', 'xray', 'emission', 'in', 'the', 'most', 'bolometrically', 'powerful', 'quasars', 'is', 'weaker', 'relative', 'to', 'their', 'optical', 'emission']]
|
[-0.023639389106031607, 0.09256565324592898, -0.048770746121979285, 0.15163472407312623, -0.12526608364059383, -0.12406146279998294, 0.07319178839590941, 0.5137623375608721, -0.10095906830997071, -0.39265757383963534, 0.03160586124303829, -0.3971547490725194, 0.08860142266676399, 0.21900827415866905, -0.009390178982538121, -0.0229628206553286, -0.02225324675753599, -0.11353996664086599, -0.03415913242697431, -0.21013035201858588, 0.20750299011417558, 0.10074853720427811, 0.18214384470142084, 0.018712287827595743, 0.09350257247192288, -0.056021329529142676, -0.09833474952962164, -0.06494696115193363, -0.1456116612706594, 0.05079924431096279, 0.27089816329730604, 0.11296839572094694, 0.1875928559390302, -0.2078010088529523, -0.19724166465439755, 0.12387281462713678, 0.15579109917970674, -0.10585684332825983, 0.014878120183596345, -0.24202197954193724, 0.06267708633450493, -0.18496818023819106, -0.13766346348783726, 0.13801787742937893, 0.07194004509285207, 0.007039762999620715, -0.161013834916041, 0.19602154359178803, -0.0513724950317161, 0.07367255825208116, -0.1608425013388628, -0.06971481590236729, -0.03497823991435971, -0.03151739226789249, 0.025322846273841862, 0.0781699945085561, 0.1626271832101616, -0.13924104885290597, -0.047018202977923265, 0.3732807880182189, -0.05864849842317004, 0.13475123366326777, 0.18580494448542595, -0.18510709756999524, -0.23207053512455683, 0.24594005340895125, 0.10278063888825079, 0.10834744262672563, -0.1485546450506103, 0.02481495035467456, -0.04024696210710303, 0.3804190433175367, 0.04316492878853251, 0.1110208989818623, 0.3041862127946988, 0.06824087764523952, 0.024124730399717357, 0.1249805218860052, -0.3109352053303044, 0.10922193041298794, -0.26950616756710044, -0.03557278399528111, -0.11554027613312831, 0.19818272772209564, -0.1786540141931241, -0.13378598338405367, 0.35291059062467844, 0.09034946270798909, 0.2406518451304296, 0.10593039568385663, 0.2726894445104266, 0.1614049411434787, 0.031708685025387935, 0.11936591255819809, 0.3822578398496595, 0.16248486037294999, 0.10866083797664587, -0.17371424687990764, 0.019372719421783705, -0.03600700947150361]
|
1,803.08106
|
On essential self-adjointness for first order differential operators on
domains in $\mathbb{R}^d$
|
We consider general symmetric systems of first order linear partial
differential operators on domains $\Omega \subset \mathbb{R}^d$, and we seek
sufficient conditions on the coefficients which ensure essential
self-adjointness. The coefficients of the first order terms are only required
to belong to $C^1(\Omega)$ and there is no ellipticity condition. Our criterion
writes as the completeness of an associated Riemannian structure which encodes
the propagation velocities of the system. As an application we obtain
sufficient conditions for confinement of energy for some wave propagation
problems of classical physics.
|
math-ph math.AP math.FA math.MP
|
we consider general symmetric systems of first order linear partial differential operators on domains omega subset mathbbrd and we seek sufficient conditions on the coefficients which ensure essential selfadjointness the coefficients of the first order terms are only required to belong to c1omega and there is no ellipticity condition our criterion writes as the completeness of an associated riemannian structure which encodes the propagation velocities of the system as an application we obtain sufficient conditions for confinement of energy for some wave propagation problems of classical physics
|
[['we', 'consider', 'general', 'symmetric', 'systems', 'of', 'first', 'order', 'linear', 'partial', 'differential', 'operators', 'on', 'domains', 'omega', 'subset', 'mathbbrd', 'and', 'we', 'seek', 'sufficient', 'conditions', 'on', 'the', 'coefficients', 'which', 'ensure', 'essential', 'selfadjointness', 'the', 'coefficients', 'of', 'the', 'first', 'order', 'terms', 'are', 'only', 'required', 'to', 'belong', 'to', 'c1omega', 'and', 'there', 'is', 'no', 'ellipticity', 'condition', 'our', 'criterion', 'writes', 'as', 'the', 'completeness', 'of', 'an', 'associated', 'riemannian', 'structure', 'which', 'encodes', 'the', 'propagation', 'velocities', 'of', 'the', 'system', 'as', 'an', 'application', 'we', 'obtain', 'sufficient', 'conditions', 'for', 'confinement', 'of', 'energy', 'for', 'some', 'wave', 'propagation', 'problems', 'of', 'classical', 'physics']]
|
[-0.17171674211049218, 0.04454696176596382, -0.02804316424539891, 0.07555044917309464, -0.12311988105280218, -0.07834303972107926, -0.024327151177600884, 0.34470098326517934, -0.2749368307533963, -0.24513829572276138, 0.1514545882966412, -0.23453914631029654, -0.13290652998819433, 0.1695488732155605, -0.057655984300306475, 0.10574953338323996, 0.045054923628935935, 0.10424867017333792, -0.07922074378296819, -0.2393617527452351, 0.3781379013985995, -0.01121689595185734, 0.22370402937776399, 0.07028010055080228, 0.13339574395766918, 0.0063237333509685665, 0.012405549384782026, -0.019945105516362464, -0.1933658275132378, 0.08476375395581982, 0.21014229203949028, 0.1075504675625299, 0.26350813575527876, -0.44033439862060136, -0.17736829058454512, 0.13844038351256957, 0.09875896782346669, 0.07334988053363545, -0.015120473842875197, -0.27470673346656493, 0.09862485338783898, -0.08377857232766076, -0.17176463745063406, -0.09677111196342385, 0.01653461295297776, 0.04489584526196978, -0.34899784106260767, 0.09464545862149747, 0.13237438274911423, 0.035347176718407834, -0.10317191392739956, -0.08612677298925132, -0.022407415298873495, 0.12364226118822036, -0.010138979394406337, -0.005405824342421417, 0.037504829279007924, -0.10347331038023207, -0.08390952287049129, 0.42593805346338226, -0.03068693914974574, -0.26621013944005145, 0.18140172626523451, -0.13727622057763517, -0.10875687395201075, 0.09344385607681911, 0.20936763967954736, 0.1470535161808647, -0.15362313898325758, 0.10529336579352745, -0.037652500733651555, 0.16306892569824497, 0.10243935316223009, 0.10217559600085684, 0.12337485979439626, 0.07536878733328362, 0.16891698907504135, 0.1076219658121124, -0.029760402844731706, -0.058381681667705035, -0.4194219486638047, -0.16041244187488637, -0.12902470564619564, 0.0443302137867866, -0.08563212912674223, -0.17659389114157223, 0.36792210187634516, 0.13543129739306076, 0.17080239363512473, 0.04431734551226014, 0.23254137811647063, 0.17335238330729905, 0.020052994828906722, 0.06858974685571317, 0.1658144147130634, 0.20478997075523453, 0.09152730066200783, -0.1964984235043327, 0.06827652588186936, 0.09166855555584376]
|
1,803.08107
|
Height estimates for $H$-surfaces in the warped product
$\mathbb{M}\times_f\mathbb{R}$
|
In this article, we consider compact surfaces $\Sigma$ having constant mean
curvature $H$ ($H$-surfaces) whose boundary $\Gamma=\partial\Sigma\subset
\mathbb{M}_0= \mathbb{M} \times_f\{0\}$ is transversal to the slice
$\mathbb{M}_0$ of the warped product $ \mathbb{M}\times_f\mathbb{R} $, here $
\mathbb{M} $ denotes a Hadamard surface. We obtain height estimate for a such
surface $\Sigma$ having positive constant mean curvature involving the area of
a part of $\Sigma$ above of $ \mathbb{M} _0$ and the volume it bounds. Also we
give general conditions for the existence of rotationally-invariant topological
spheres having positive constant mean curvature $H$ in the warped product
$\mathbb{H}\times_f\mathbb{R}$, where $\mathbb{H}$ denotes the hyperbolic disc.
Finally we present a non-trivial example of such spheres.
|
math.DG
|
in this article we consider compact surfaces sigma having constant mean curvature h hsurfaces whose boundary gammapartialsigmasubset mathbbm_0 mathbbm times_f0 is transversal to the slice mathbbm_0 of the warped product mathbbmtimes_fmathbbr here mathbbm denotes a hadamard surface we obtain height estimate for a such surface sigma having positive constant mean curvature involving the area of a part of sigma above of mathbbm _0 and the volume it bounds also we give general conditions for the existence of rotationallyinvariant topological spheres having positive constant mean curvature h in the warped product mathbbhtimes_fmathbbr where mathbbh denotes the hyperbolic disc finally we present a nontrivial example of such spheres
|
[['in', 'this', 'article', 'we', 'consider', 'compact', 'surfaces', 'sigma', 'having', 'constant', 'mean', 'curvature', 'h', 'hsurfaces', 'whose', 'boundary', 'gammapartialsigmasubset', 'mathbbm_0', 'mathbbm', 'times_f0', 'is', 'transversal', 'to', 'the', 'slice', 'mathbbm_0', 'of', 'the', 'warped', 'product', 'mathbbmtimes_fmathbbr', 'here', 'mathbbm', 'denotes', 'a', 'hadamard', 'surface', 'we', 'obtain', 'height', 'estimate', 'for', 'a', 'such', 'surface', 'sigma', 'having', 'positive', 'constant', 'mean', 'curvature', 'involving', 'the', 'area', 'of', 'a', 'part', 'of', 'sigma', 'above', 'of', 'mathbbm', '_0', 'and', 'the', 'volume', 'it', 'bounds', 'also', 'we', 'give', 'general', 'conditions', 'for', 'the', 'existence', 'of', 'rotationallyinvariant', 'topological', 'spheres', 'having', 'positive', 'constant', 'mean', 'curvature', 'h', 'in', 'the', 'warped', 'product', 'mathbbhtimes_fmathbbr', 'where', 'mathbbh', 'denotes', 'the', 'hyperbolic', 'disc', 'finally', 'we', 'present', 'a', 'nontrivial', 'example', 'of', 'such', 'spheres']]
|
[-0.2133148150956806, 0.14403293731476308, -0.021234539348869493, 0.05833102015814945, -0.08143654842084895, -0.14715622394692665, -0.01335883317811999, 0.35874651246430245, -0.2530305480000143, -0.21006108914940236, 0.14634518997113713, -0.2673030265004319, -0.13941418311807474, 0.1418196246867963, -0.0719199339909406, 0.0001032154084931986, -0.010099486009601285, 0.1272201602730681, -0.11600390743172052, -0.23232509827871314, 0.3962585163832295, -0.06863818217215001, 0.12998652692847684, 0.10453643190660789, 0.12090333101942259, -0.04428394595800223, 0.0007353662787114873, 0.038819429884646456, -0.31861245504343044, 0.12449148756123203, 0.15771158010808423, 0.04336485429210406, 0.208579971840806, -0.3423169975114219, -0.19069189943062761, 0.18201994650321557, 0.09336228349574786, -0.02089468783278968, -0.022256011937690133, -0.25171978270415873, 0.08606812704181042, -0.0961026962956085, -0.1944409872715672, -0.007677204687805737, 0.08152714570728588, -0.07291135024370662, -0.23705655041689455, 0.09806602774387654, 0.09652414376500483, 0.06893793184894557, -0.0759157225781796, -0.1454465790964462, -0.058137930870311806, 0.10031686672100834, 0.03201064376238113, 0.06037048041117469, 0.11677400432709678, -0.06349550128467016, -0.02959237328511389, 0.3404962248899335, -0.1690478243017067, -0.30469955279327493, 0.08432510492903199, -0.19851620982894125, -0.09023925043441647, 0.1298055396159636, 0.17776485689568752, 0.16183160961258644, -0.008527273997007048, 0.22078970815545843, -0.10957362881733798, 0.10384700790632005, 0.12221647827319947, -0.012216155574195926, 0.1549915589629581, 0.08793930023652959, 0.17974584010502725, 0.1755584404323314, -0.08775453810242242, -0.03602337565811753, -0.42138962559036763, -0.266581454738865, -0.17470707549877904, 0.18289569078707227, -0.1529109718906636, -0.28073314306047725, 0.3379871102743873, -0.04307668304125614, 0.21751393571806452, 0.11930445877506453, 0.23065707600657262, 0.09309155109632924, 0.018217188947578417, 0.1062352419328675, 0.15668061277920417, 0.20575268833907137, -0.009373272951765387, -0.1428239633484433, -0.04140604018032843, 0.11061482756928194]
|
1,803.08108
|
On the structure of modules indexed by small categories
|
Given a small category C, a C-module M is a functor from C to the category of
finite-dimensional vector spaces over a field k. Associated to M is its local
structure, given as a functor from C to the category of bi-closed multi-flags
over k. When the local structure of M is stable (a condition satisfied whenever
both the category C and the field k are finite), it determines a quasi-tame
cover QTC(M) (a finite direct sum of quasi-blocks), indexed by the same
category, for which the associated graded local structure is canonically
isomorphic to that of M. QTC(M) represents the closest approximation to M by a
quasi-tame module, and recovers M precisely when M itself is quasi-tame. In the
case M has stable local structure and is equipped with an inner product
compatible with that structure, there exists a C-module surjection QTC(M) -> M
inducing the above-mentioned isomorphism on associated graded local structures.
This map is an isomorphism iff the excess of M vanishes (where the excess
numerically measures the failure of the local structure of M to be in general
position).
|
math.AT
|
given a small category c a cmodule m is a functor from c to the category of finitedimensional vector spaces over a field k associated to m is its local structure given as a functor from c to the category of biclosed multiflags over k when the local structure of m is stable a condition satisfied whenever both the category c and the field k are finite it determines a quasitame cover qtcm a finite direct sum of quasiblocks indexed by the same category for which the associated graded local structure is canonically isomorphic to that of m qtcm represents the closest approximation to m by a quasitame module and recovers m precisely when m itself is quasitame in the case m has stable local structure and is equipped with an inner product compatible with that structure there exists a cmodule surjection qtcm m inducing the abovementioned isomorphism on associated graded local structures this map is an isomorphism iff the excess of m vanishes where the excess numerically measures the failure of the local structure of m to be in general position
|
[['given', 'a', 'small', 'category', 'c', 'a', 'cmodule', 'm', 'is', 'a', 'functor', 'from', 'c', 'to', 'the', 'category', 'of', 'finitedimensional', 'vector', 'spaces', 'over', 'a', 'field', 'k', 'associated', 'to', 'm', 'is', 'its', 'local', 'structure', 'given', 'as', 'a', 'functor', 'from', 'c', 'to', 'the', 'category', 'of', 'biclosed', 'multiflags', 'over', 'k', 'when', 'the', 'local', 'structure', 'of', 'm', 'is', 'stable', 'a', 'condition', 'satisfied', 'whenever', 'both', 'the', 'category', 'c', 'and', 'the', 'field', 'k', 'are', 'finite', 'it', 'determines', 'a', 'quasitame', 'cover', 'qtcm', 'a', 'finite', 'direct', 'sum', 'of', 'quasiblocks', 'indexed', 'by', 'the', 'same', 'category', 'for', 'which', 'the', 'associated', 'graded', 'local', 'structure', 'is', 'canonically', 'isomorphic', 'to', 'that', 'of', 'm', 'qtcm', 'represents', 'the', 'closest', 'approximation', 'to', 'm', 'by', 'a', 'quasitame', 'module', 'and', 'recovers', 'm', 'precisely', 'when', 'm', 'itself', 'is', 'quasitame', 'in', 'the', 'case', 'm', 'has', 'stable', 'local', 'structure', 'and', 'is', 'equipped', 'with', 'an', 'inner', 'product', 'compatible', 'with', 'that', 'structure', 'there', 'exists', 'a', 'cmodule', 'surjection', 'qtcm', 'm', 'inducing', 'the', 'abovementioned', 'isomorphism', 'on', 'associated', 'graded', 'local', 'structures', 'this', 'map', 'is', 'an', 'isomorphism', 'iff', 'the', 'excess', 'of', 'm', 'vanishes', 'where', 'the', 'excess', 'numerically', 'measures', 'the', 'failure', 'of', 'the', 'local', 'structure', 'of', 'm', 'to', 'be', 'in', 'general', 'position']]
|
[-0.19925080490869712, 0.08956775668052087, -0.06371158105063957, 0.01740093477287726, -0.089430156202462, -0.14302708879782103, 0.0027513577582221993, 0.36625798696971074, -0.3877885283346581, -0.2216230316128767, 0.07074072739258615, -0.22093248341132202, -0.10288666998092806, 0.1398488346574756, -0.09336970448082323, -0.07483366154969119, 0.042817389397002054, 0.16039004171130797, -0.09073979165842397, -0.235322088710655, 0.39311424075775053, 0.0203947427975868, 0.21093182419735465, -0.027829518127486685, 0.13649918039931366, -0.001896564172097168, 0.01307724853617381, 0.05280044137690607, -0.13127171227848994, 0.11612871893069279, 0.2617728457469699, 0.09076163294925792, 0.2223738665082775, -0.2963488430700661, -0.10569223072328374, 0.16830483431933005, 0.07711383007152922, -0.03980123170057198, 0.01040230979512636, -0.258680829725573, 0.18175808870032922, -0.16022270389971482, -0.09247036073974318, -0.022838954096634292, 0.1358964845900892, -0.025511371916226235, -0.29451719119833547, -0.030954883040253133, 0.08739545800368101, 0.06580391056637552, -0.082890980433189, -0.06552361333884237, -0.11822321961340572, 0.09369566043979072, -0.05987047296382734, 0.11389159356650397, 0.12046902670617632, -0.0889460847967752, -0.05792742235925646, 0.3856658394865239, -0.11616009007110287, -0.19460790365605066, 0.14136908989842178, -0.16334645181523832, -0.08516438522257776, 0.18213254953888938, 0.016240409246095308, 0.14199320873688104, -0.0345105474677454, 0.24178518525624484, -0.1497237255940862, 0.10650528261942264, 0.06879105997009419, -0.006632514010782955, 0.16972863068032332, 0.12852233228883422, 0.12544040988554447, 0.09841428837257833, -0.022222328578309768, -0.031650106817193185, -0.35603244814671864, -0.18874860730392662, -0.15726051147183331, 0.1348718108020167, -0.0722379057946485, -0.16583615242508729, 0.33590614109799183, 0.04077737887379667, 0.25777539199228444, 0.07301180947183512, 0.23320995213770054, 0.052523590338117966, 0.0893276765407449, 0.08460618201283049, 0.11464746995798174, 0.24021743037557816, -0.00903747364549347, -0.1471542276863976, 0.034470832641673846, 0.13044078527044156]
|
1,803.08109
|
A mechanistic model of connector hubs, modularity, and cognition
|
The human brain network is modular--comprised of communities of tightly
interconnected nodes. This network contains local hubs, which have many
connections within their own communities, and connector hubs, which have
connections diversely distributed across communities. A mechanistic
understanding of these hubs and how they support cognition has not been
demonstrated. Here, we leveraged individual differences in hub connectivity and
cognition. We show that a model of hub connectivity accurately predicts the
cognitive performance of 476 individuals in four distinct tasks. Moreover,
there is a general optimal network structure for cognitive
performance--individuals with diversely connected hubs and consequent modular
brain networks exhibit increased cognitive performance, regardless of the task.
Critically, we find evidence consistent with a mechanistic model in which
connector hubs tune the connectivity of their neighbors to be more modular
while allowing for task appropriate information integration across communities,
which increases global modularity and cognitive performance.
|
q-bio.NC q-bio.QM
|
the human brain network is modularcomprised of communities of tightly interconnected nodes this network contains local hubs which have many connections within their own communities and connector hubs which have connections diversely distributed across communities a mechanistic understanding of these hubs and how they support cognition has not been demonstrated here we leveraged individual differences in hub connectivity and cognition we show that a model of hub connectivity accurately predicts the cognitive performance of 476 individuals in four distinct tasks moreover there is a general optimal network structure for cognitive performanceindividuals with diversely connected hubs and consequent modular brain networks exhibit increased cognitive performance regardless of the task critically we find evidence consistent with a mechanistic model in which connector hubs tune the connectivity of their neighbors to be more modular while allowing for task appropriate information integration across communities which increases global modularity and cognitive performance
|
[['the', 'human', 'brain', 'network', 'is', 'modularcomprised', 'of', 'communities', 'of', 'tightly', 'interconnected', 'nodes', 'this', 'network', 'contains', 'local', 'hubs', 'which', 'have', 'many', 'connections', 'within', 'their', 'own', 'communities', 'and', 'connector', 'hubs', 'which', 'have', 'connections', 'diversely', 'distributed', 'across', 'communities', 'a', 'mechanistic', 'understanding', 'of', 'these', 'hubs', 'and', 'how', 'they', 'support', 'cognition', 'has', 'not', 'been', 'demonstrated', 'here', 'we', 'leveraged', 'individual', 'differences', 'in', 'hub', 'connectivity', 'and', 'cognition', 'we', 'show', 'that', 'a', 'model', 'of', 'hub', 'connectivity', 'accurately', 'predicts', 'the', 'cognitive', 'performance', 'of', '476', 'individuals', 'in', 'four', 'distinct', 'tasks', 'moreover', 'there', 'is', 'a', 'general', 'optimal', 'network', 'structure', 'for', 'cognitive', 'performanceindividuals', 'with', 'diversely', 'connected', 'hubs', 'and', 'consequent', 'modular', 'brain', 'networks', 'exhibit', 'increased', 'cognitive', 'performance', 'regardless', 'of', 'the', 'task', 'critically', 'we', 'find', 'evidence', 'consistent', 'with', 'a', 'mechanistic', 'model', 'in', 'which', 'connector', 'hubs', 'tune', 'the', 'connectivity', 'of', 'their', 'neighbors', 'to', 'be', 'more', 'modular', 'while', 'allowing', 'for', 'task', 'appropriate', 'information', 'integration', 'across', 'communities', 'which', 'increases', 'global', 'modularity', 'and', 'cognitive', 'performance']]
|
[-0.17133289010601183, 0.062214966002321834, -0.04084660356286271, 0.09753401514287267, -0.11099933799163535, -0.18409012541744924, 0.09103448857585418, 0.45128769758960297, -0.2539108199035299, -0.3229829222991549, 0.018371524389608408, -0.25789184082652733, -0.3159909420421925, 0.0950042724384573, -0.0892377178457662, -0.01143506315761599, 0.08752151654334739, 0.12070301570447868, 0.07683779575203642, -0.22922926966325732, 0.29207859926712537, 0.06303608606023521, 0.3448375574056188, 0.06690805302119958, 0.07869715881935353, -0.05682376979304285, -0.028520579196127323, 0.033776716712123615, -0.053843447076536086, 0.20126036517964355, 0.39766166126034386, 0.2125523517020689, 0.366072096458861, -0.494511886660395, -0.24771605867828275, 0.12410721301165377, 0.1721168853792137, 0.020430068223705064, 0.04260139096927717, -0.3294249674176862, 0.10063743724423493, -0.1936996924313556, -0.03652571578397704, -0.08130976107485335, 0.0008445266826913275, 0.04278448785711401, -0.20225538763193543, 0.060796783222206705, 0.02315121322773911, 0.0944084169632145, -0.03347164422337865, -0.06158328043409334, -0.06535210006324382, 0.2569101751300282, 0.008887302973468241, -0.0014856871538634958, 0.21838468164526698, -0.18968757969339314, -0.14698085440643902, 0.2931501079575512, 0.09324757579617717, -0.18084115693827385, 0.24654944902928225, -0.056774075505933885, -0.21431219708756544, 0.07933479371512758, 0.19820972226142627, -0.012629335431446289, -0.17787649780552, -0.012239989980750172, -0.020032950391157947, 0.18187719656090284, 0.05033378840809495, 0.05800142933911612, 0.20247354137646997, 0.2595470332508457, 0.08767567420466642, 0.07510471066443956, -0.03581819588936672, -0.10975208171675431, -0.14194125314082565, -0.11706253060557205, -0.15056306418866433, -0.0267859443370855, -0.16551571485439942, -0.14629553823635497, 0.48568855508005826, 0.12701238414497468, 0.1781076639633754, 0.13530792994384558, 0.24423072910385912, -0.018008378700449548, 0.13561209604336782, 0.1512981171808045, 0.1854471813566212, 0.08454971224198053, 0.11233249442362837, -0.16804940252853878, 0.15922993953693015, -0.069783450626158]
|
1,803.0811
|
Driven transport on a flexible polymer with particle recycling: a model
inspired by transcription and translation
|
Many theoretical works have attempted to coarse grain gene expression at the
level of transcription and translation via frameworks based on exclusion
processes. Usually in these models the three-dimensional conformation of the
substrates (DNA and mRNA) is neglected, and particles move on a static
unidimensional lattice in contact to an infinite reservoir. In this work we
generalise the paradigmatic exclusion process and study the transport of
particles along a unidimensional polymer-like flexible lattice immersed in a
three-dimensional particle reservoir. We study the recycling of particles in
the reservoir, how the transport is influenced by the global conformation of
the lattice and, in turn, how particle density dictates the structure of the
polymer.
|
cond-mat.stat-mech cond-mat.soft q-bio.SC
|
many theoretical works have attempted to coarse grain gene expression at the level of transcription and translation via frameworks based on exclusion processes usually in these models the threedimensional conformation of the substrates dna and mrna is neglected and particles move on a static unidimensional lattice in contact to an infinite reservoir in this work we generalise the paradigmatic exclusion process and study the transport of particles along a unidimensional polymerlike flexible lattice immersed in a threedimensional particle reservoir we study the recycling of particles in the reservoir how the transport is influenced by the global conformation of the lattice and in turn how particle density dictates the structure of the polymer
|
[['many', 'theoretical', 'works', 'have', 'attempted', 'to', 'coarse', 'grain', 'gene', 'expression', 'at', 'the', 'level', 'of', 'transcription', 'and', 'translation', 'via', 'frameworks', 'based', 'on', 'exclusion', 'processes', 'usually', 'in', 'these', 'models', 'the', 'threedimensional', 'conformation', 'of', 'the', 'substrates', 'dna', 'and', 'mrna', 'is', 'neglected', 'and', 'particles', 'move', 'on', 'a', 'static', 'unidimensional', 'lattice', 'in', 'contact', 'to', 'an', 'infinite', 'reservoir', 'in', 'this', 'work', 'we', 'generalise', 'the', 'paradigmatic', 'exclusion', 'process', 'and', 'study', 'the', 'transport', 'of', 'particles', 'along', 'a', 'unidimensional', 'polymerlike', 'flexible', 'lattice', 'immersed', 'in', 'a', 'threedimensional', 'particle', 'reservoir', 'we', 'study', 'the', 'recycling', 'of', 'particles', 'in', 'the', 'reservoir', 'how', 'the', 'transport', 'is', 'influenced', 'by', 'the', 'global', 'conformation', 'of', 'the', 'lattice', 'and', 'in', 'turn', 'how', 'particle', 'density', 'dictates', 'the', 'structure', 'of', 'the', 'polymer']]
|
[-0.09963872187238719, 0.205917180263376, -0.06921039438956152, 0.03496939629837925, -0.001800429857602077, -0.12052824461716227, 0.05863769517080592, 0.38729193462391515, -0.26544218649671947, -0.23561309000277625, 0.04062387090691898, -0.2523875834491004, -0.1362534555581598, 0.13734112904681492, -0.013796328101307154, 0.03993089761518474, 0.06625971655323935, 0.0034311822341156323, 0.018145005929649675, -0.2025573902376761, 0.2877773674429461, 0.09958143815414847, 0.2891659359780273, 0.08451465063886385, 0.11478109309350007, 0.014749036095703818, -0.0007818926865833678, 0.01396522221122203, -0.2014681029249914, 0.16121939947229944, 0.17280106583182583, 0.016972074389091825, 0.2000689470171762, -0.5156075926164964, -0.241812183910432, 0.06301484578891957, 0.18614528741870476, 0.17327845041706627, -0.04418040725743465, -0.24153546534528555, -0.0038441259364065316, -0.15077653943028832, -0.09835861390872326, -0.03361726113143959, -0.0030654963463478324, 0.045852010283851996, -0.18367133222896623, 0.09341174746181682, 0.10289464863178312, 0.07943735117857743, -0.06444162798496629, -0.07929882097440506, -0.04642722622624466, 0.14449136614400362, 0.05497757781553706, -0.0037242796250731252, 0.25395144588297364, -0.13602339630805155, -0.11360915026411281, 0.4151098109765111, -0.06638519660918973, -0.290855647231053, 0.2363418087417293, -0.12473969987227715, -0.1576700237845736, 0.13183486730849836, 0.19320843037400795, 0.09093354075698049, -0.20371754659208818, 0.09870760095561439, -0.0394614567433434, 0.15022128558069067, 0.0684262318204024, -0.05618338109343313, 0.23145196519076958, 0.22364835815304623, 0.04074922844457823, 0.1725252622257228, -0.07283148153770266, -0.18693863142730802, -0.23343739578766481, -0.1952387286499808, -0.19445037606263732, 0.03917299701424781, -0.07272633431979816, -0.1899221449410626, 0.3755301947603584, 0.11696300695101465, 0.19711631909012794, 0.020197279562125914, 0.23450448732806503, 0.040164705291057805, 0.04996448825529244, 0.018797364842612296, 0.18309558884772872, 0.12120378830877598, 0.09217001614576605, -0.25718935110905605, 0.07969595249492809, 0.0571037702632436]
|
1,803.08111
|
Distributed Mechanism Design for Multicast Transmission
|
In the standard Mechanism Design framework (Hurwicz-Reiter), there is a
central authority that gathers agents' messages and subsequently determines the
allocation and tax for each agent.
We consider a scenario where, due to communication overhead and other
constraints, such broadcasting of messages to a central authority cannot take
place. Instead, only local message exchange is allowed between agents. As a
result, each agent should be able to determine her own allocation and tax based
on the messages in the local neighborhood, as defined by a given message graph
describing the communication constraints.
This scenario gives rise to a novel research direction that we call
"Distributed Mechanism Design".
In this paper, we propose such a distributed mechanism for the problem of
rate allocation in a multicast transmission network.
The proposed mechanism fully implements the optimal allocation in Nash
equilibria and its message space dimension is linear with respect to the number
of agents in the network.
|
cs.GT math.OC
|
in the standard mechanism design framework hurwiczreiter there is a central authority that gathers agents messages and subsequently determines the allocation and tax for each agent we consider a scenario where due to communication overhead and other constraints such broadcasting of messages to a central authority cannot take place instead only local message exchange is allowed between agents as a result each agent should be able to determine her own allocation and tax based on the messages in the local neighborhood as defined by a given message graph describing the communication constraints this scenario gives rise to a novel research direction that we call distributed mechanism design in this paper we propose such a distributed mechanism for the problem of rate allocation in a multicast transmission network the proposed mechanism fully implements the optimal allocation in nash equilibria and its message space dimension is linear with respect to the number of agents in the network
|
[['in', 'the', 'standard', 'mechanism', 'design', 'framework', 'hurwiczreiter', 'there', 'is', 'a', 'central', 'authority', 'that', 'gathers', 'agents', 'messages', 'and', 'subsequently', 'determines', 'the', 'allocation', 'and', 'tax', 'for', 'each', 'agent', 'we', 'consider', 'a', 'scenario', 'where', 'due', 'to', 'communication', 'overhead', 'and', 'other', 'constraints', 'such', 'broadcasting', 'of', 'messages', 'to', 'a', 'central', 'authority', 'can', 'not', 'take', 'place', 'instead', 'only', 'local', 'message', 'exchange', 'is', 'allowed', 'between', 'agents', 'as', 'a', 'result', 'each', 'agent', 'should', 'be', 'able', 'to', 'determine', 'her', 'own', 'allocation', 'and', 'tax', 'based', 'on', 'the', 'messages', 'in', 'the', 'local', 'neighborhood', 'as', 'defined', 'by', 'a', 'given', 'message', 'graph', 'describing', 'the', 'communication', 'constraints', 'this', 'scenario', 'gives', 'rise', 'to', 'a', 'novel', 'research', 'direction', 'that', 'we', 'call', 'distributed', 'mechanism', 'design', 'in', 'this', 'paper', 'we', 'propose', 'such', 'a', 'distributed', 'mechanism', 'for', 'the', 'problem', 'of', 'rate', 'allocation', 'in', 'a', 'multicast', 'transmission', 'network', 'the', 'proposed', 'mechanism', 'fully', 'implements', 'the', 'optimal', 'allocation', 'in', 'nash', 'equilibria', 'and', 'its', 'message', 'space', 'dimension', 'is', 'linear', 'with', 'respect', 'to', 'the', 'number', 'of', 'agents', 'in', 'the', 'network']]
|
[-0.20463097522095328, 0.015045370353806403, -0.0694139426213599, 0.0157891089554816, -0.1360043878096246, -0.2411639043370322, 0.1734891234514033, 0.3793661668295822, -0.332191537897433, -0.2722012234059343, 0.07762739135012511, -0.23510694194795384, -0.1394086146306607, 0.08040023828826605, -0.14537426577280124, -0.0011620974592534044, 0.005780988768674433, 0.09493051250014574, 0.07335108501476145, -0.2720905803348644, 0.29898674085045296, 0.08226020980866686, 0.30424220666679885, 0.026620663957850586, 0.11934141757777862, 0.05121918560396279, -0.008928257428229816, -0.018297541185259638, -0.098434218826362, 0.10880436098067871, 0.3162665718159969, 0.22021621412657683, 0.34634940810501574, -0.44596456237618, -0.18579868095656557, 0.14216321464627982, 0.1428549754583547, 0.09572654688700794, -0.038019754738366655, -0.23792114464506026, 0.10228343723912633, -0.2370163616754355, -0.027488501204718505, -0.0025648132819051464, -0.019134506789006054, 0.020127624778016922, -0.3498084857789499, -0.024966648233032997, 0.02234771613992991, -0.006465681072422153, -0.07034096884646363, -0.03365630476525234, -0.008243936865079788, 0.16763411946519607, 0.03352644341141586, 0.02140212541506175, 0.15149179789568148, -0.11014627317687677, -0.17090369384855994, 0.4119191172457631, -0.012143902109575368, -0.2048989570098779, 0.13149816091472824, -0.03369431682531872, -0.14228435400648104, 0.07813763138387472, 0.24726266722164808, 0.09226207458864777, -0.18364372258224795, 0.04067747525142265, -0.07045395523647688, 0.18912352920179407, 0.03740084344190696, 0.061505825309863975, 0.17977241114262613, 0.16893112284221476, 0.18006067803249726, 0.12281638768073472, -0.035385361327339084, -0.16494034434698762, -0.2617658465559925, -0.15398468299798906, -0.18454164266586304, 0.002794117803568952, -0.08518138885330935, -0.08051868033625426, 0.38266428246673556, 0.14482531163751358, 0.18166883447838406, 0.08831848396408942, 0.33405945633928624, 0.08118521237535582, 0.06038927892823854, 0.18898728288890373, 0.17804383255781667, 0.034885761155296235, 0.11888264443184579, -0.1874825029033086, 0.16271872262830936, 0.04039933650243667]
|
1,803.08112
|
Constraints for the Progenitor Masses of Historic Core-Collapse
Supernovae
|
We age-date the stellar populations associated with 12 historic nearby
core-collapse supernovae (CCSNe) and 2 supernova impostors, and from these
ages, we infer their initial masses and associated uncertainties. To do this,
we have obtained new HST imaging covering these CCSNe. Using these images, we
measure resolved stellar photometry for the stars surrounding the locations of
the SNe. We then fit the color-magnitude distributions of this photometry with
stellar evolution models to determine the ages of any young existing
populations present. From these age distributions, we infer the most likely
progenitor mass for all of the SNe in our sample. We find ages between 4 and 50
Myr, corresponding to masses from 7.5 to 59 solar masses. There were no SNe
that lacked a young population within 50~pc. Our sample contains 4 type Ib/c
SNe; their masses have a wide range of values, suggesting that the progenitors
of stripped-envelope SNe are binary systems. Both impostors have masses
constrained to be $\lesssim$7.5 solar masses. In cases with precursor imaging
measurements, we find that age-dating and precursor imaging give consistent
progenitor masses. This consistency implies that, although the uncertainties
for each technique are significantly different, the results of both are
reliable to the measured uncertainties. We combine these new measurements with
those from our previous work and find that the distribution of 25 core-collapse
SNe progenitor masses is consistent with a standard Salpeter power-law mass
function, no upper mass cutoff, and an assumed minimum mass for core-collapse
of 7.5~M$_{\odot}$.
|
astro-ph.GA astro-ph.SR
|
we agedate the stellar populations associated with 12 historic nearby corecollapse supernovae ccsne and 2 supernova impostors and from these ages we infer their initial masses and associated uncertainties to do this we have obtained new hst imaging covering these ccsne using these images we measure resolved stellar photometry for the stars surrounding the locations of the sne we then fit the colormagnitude distributions of this photometry with stellar evolution models to determine the ages of any young existing populations present from these age distributions we infer the most likely progenitor mass for all of the sne in our sample we find ages between 4 and 50 myr corresponding to masses from 75 to 59 solar masses there were no sne that lacked a young population within 50pc our sample contains 4 type ibc sne their masses have a wide range of values suggesting that the progenitors of strippedenvelope sne are binary systems both impostors have masses constrained to be lesssim75 solar masses in cases with precursor imaging measurements we find that agedating and precursor imaging give consistent progenitor masses this consistency implies that although the uncertainties for each technique are significantly different the results of both are reliable to the measured uncertainties we combine these new measurements with those from our previous work and find that the distribution of 25 corecollapse sne progenitor masses is consistent with a standard salpeter powerlaw mass function no upper mass cutoff and an assumed minimum mass for corecollapse of 75m_odot
|
[['we', 'agedate', 'the', 'stellar', 'populations', 'associated', 'with', '12', 'historic', 'nearby', 'corecollapse', 'supernovae', 'ccsne', 'and', '2', 'supernova', 'impostors', 'and', 'from', 'these', 'ages', 'we', 'infer', 'their', 'initial', 'masses', 'and', 'associated', 'uncertainties', 'to', 'do', 'this', 'we', 'have', 'obtained', 'new', 'hst', 'imaging', 'covering', 'these', 'ccsne', 'using', 'these', 'images', 'we', 'measure', 'resolved', 'stellar', 'photometry', 'for', 'the', 'stars', 'surrounding', 'the', 'locations', 'of', 'the', 'sne', 'we', 'then', 'fit', 'the', 'colormagnitude', 'distributions', 'of', 'this', 'photometry', 'with', 'stellar', 'evolution', 'models', 'to', 'determine', 'the', 'ages', 'of', 'any', 'young', 'existing', 'populations', 'present', 'from', 'these', 'age', 'distributions', 'we', 'infer', 'the', 'most', 'likely', 'progenitor', 'mass', 'for', 'all', 'of', 'the', 'sne', 'in', 'our', 'sample', 'we', 'find', 'ages', 'between', '4', 'and', '50', 'myr', 'corresponding', 'to', 'masses', 'from', '75', 'to', '59', 'solar', 'masses', 'there', 'were', 'no', 'sne', 'that', 'lacked', 'a', 'young', 'population', 'within', '50pc', 'our', 'sample', 'contains', '4', 'type', 'ibc', 'sne', 'their', 'masses', 'have', 'a', 'wide', 'range', 'of', 'values', 'suggesting', 'that', 'the', 'progenitors', 'of', 'strippedenvelope', 'sne', 'are', 'binary', 'systems', 'both', 'impostors', 'have', 'masses', 'constrained', 'to', 'be', 'lesssim75', 'solar', 'masses', 'in', 'cases', 'with', 'precursor', 'imaging', 'measurements', 'we', 'find', 'that', 'agedating', 'and', 'precursor', 'imaging', 'give', 'consistent', 'progenitor', 'masses', 'this', 'consistency', 'implies', 'that', 'although', 'the', 'uncertainties', 'for', 'each', 'technique', 'are', 'significantly', 'different', 'the', 'results', 'of', 'both', 'are', 'reliable', 'to', 'the', 'measured', 'uncertainties', 'we', 'combine', 'these', 'new', 'measurements', 'with', 'those', 'from', 'our', 'previous', 'work', 'and', 'find', 'that', 'the', 'distribution', 'of', '25', 'corecollapse', 'sne', 'progenitor', 'masses', 'is', 'consistent', 'with', 'a', 'standard', 'salpeter', 'powerlaw', 'mass', 'function', 'no', 'upper', 'mass', 'cutoff', 'and', 'an', 'assumed', 'minimum', 'mass', 'for', 'corecollapse', 'of', '75m_odot']]
|
[-0.0011158345609797332, 0.1301172051086716, -0.03958011376747211, 0.1595380604446949, -0.09898557641251936, -0.06782732663365702, 0.08029032425814861, 0.4477989640062281, -0.13503467807985417, -0.387848702391867, 0.04722291803672698, -0.30935758890250953, 0.008286391720895058, 0.2262564712425039, -0.062437123718428494, -0.04037922592184126, 0.15339415124144284, -0.07932637291165387, -0.12158196377744226, -0.2867402084648791, 0.3276911708753465, 0.006772003628737558, 0.13108987719240803, -0.06999591374921242, 0.03885348681246907, -0.13944369977116736, -0.0784963366132593, -0.061044321868164816, -0.20176422835436647, 0.041984616179677955, 0.20015475160881038, 0.20488028357570187, 0.18239285721967935, -0.3349325185623545, -0.24198970863996908, 0.13430125657204023, 0.21016919916510823, 0.07350181101923581, -0.10034637361513148, -0.2525909150864482, 0.08771142295402724, -0.20311047923107578, -0.16027990265605532, 0.0792094000796901, 0.02142280213983457, 0.06701932251983421, -0.25839824868154115, 0.17713640361874766, -0.05246076128650003, 0.07993720722234736, -0.1541248843938915, -0.17163426818220112, -0.07011409147313183, 0.09780771365839745, 0.03854733119658157, 0.02209357207648577, 0.09156589412387854, -0.11303826577465023, -0.017488541500358955, 0.3901585292722273, -0.02031137105607526, -0.008257123743888081, 0.255715948654475, -0.1953765810845889, -0.16254994725785787, 0.11992570754647922, 0.1599342662583643, 0.11241558092983242, -0.2294402545946461, -0.05786222864649395, -0.022477068278628092, 0.1919887846437987, 0.010570760072413378, 0.07613406180465292, 0.29825801831268806, 0.13156037390226408, -0.02152271464711237, -0.006939655821013257, -0.2300112527701436, -0.021375211245357628, -0.24668419853844717, -0.08576989442046648, -0.1033632555239213, 0.1307948512929999, -0.1782550964541984, -0.12863085228132037, 0.33469433431718043, 0.18409694938132978, 0.21376150547540027, 0.11216657598809589, 0.23607927752749586, 0.04875508822430667, 0.1499637767835331, 0.12752133867385365, 0.33901984125708906, 0.18906188501249543, 0.06954489721787896, -0.21372101546480032, 0.0710387412965964, -0.015671979974788742]
|
1,803.08113
|
Dispersion Forces Between Fields Confined to Half Spaces
|
We consider the Casimir effect for a scalar field interacting with another
scalar field that is confined to two half spaces. This model is aimed to mimic
the interaction of the photon field with matter in two slabs. We use Dirichlet
boundary conditions on the interfaces for the fields in the half spaces and
calculate their one-loop contribution to the wave equation for the other field.
We perform the ultraviolet renormalization and develop a convenient formalism
for the calculation of the vacuum energy in this configuration.
|
quant-ph hep-th
|
we consider the casimir effect for a scalar field interacting with another scalar field that is confined to two half spaces this model is aimed to mimic the interaction of the photon field with matter in two slabs we use dirichlet boundary conditions on the interfaces for the fields in the half spaces and calculate their oneloop contribution to the wave equation for the other field we perform the ultraviolet renormalization and develop a convenient formalism for the calculation of the vacuum energy in this configuration
|
[['we', 'consider', 'the', 'casimir', 'effect', 'for', 'a', 'scalar', 'field', 'interacting', 'with', 'another', 'scalar', 'field', 'that', 'is', 'confined', 'to', 'two', 'half', 'spaces', 'this', 'model', 'is', 'aimed', 'to', 'mimic', 'the', 'interaction', 'of', 'the', 'photon', 'field', 'with', 'matter', 'in', 'two', 'slabs', 'we', 'use', 'dirichlet', 'boundary', 'conditions', 'on', 'the', 'interfaces', 'for', 'the', 'fields', 'in', 'the', 'half', 'spaces', 'and', 'calculate', 'their', 'oneloop', 'contribution', 'to', 'the', 'wave', 'equation', 'for', 'the', 'other', 'field', 'we', 'perform', 'the', 'ultraviolet', 'renormalization', 'and', 'develop', 'a', 'convenient', 'formalism', 'for', 'the', 'calculation', 'of', 'the', 'vacuum', 'energy', 'in', 'this', 'configuration']]
|
[-0.1595461184895316, 0.1631932655392691, -0.09521870672984352, 0.11005090098546515, -0.06989214562561882, -0.09208089482515704, -0.025539685200445007, 0.3744845583948285, -0.19382399415359075, -0.2780501046759445, 0.05783185784753715, -0.26853687316179276, -0.10376642953582801, 0.15416255993714426, 0.05358739697569331, 0.022098558012742634, -0.008828942512356958, 0.07455399168958497, -0.06252666316699064, -0.20274537026226996, 0.42976690840712467, 0.01057261755408416, 0.24236231258268967, 0.06625993043011011, 0.06639023853985723, 0.0478144628401889, 0.007325586998228764, -0.00588437466513972, -0.1537284492221451, 0.1038940741987168, 0.18609342077099936, 0.0008339408276126136, 0.2543117096864207, -0.44457729338386726, -0.21319535067088383, 0.09172130723722106, 0.0883311575906741, 0.13150995376866398, -0.06690668381431118, -0.25004110305548405, 0.015704557540566596, -0.14457450816840972, -0.17208522127204856, -0.04206618192324112, -0.03073697066107808, -0.0597355239144743, -0.2811954793260368, 0.046405858934185536, -0.04404595978747577, 0.017851631102953538, -0.11241238840942293, -0.06739568440676776, 0.011969540292548752, 0.09967333666958608, 0.06436610774970938, 0.046216100465159775, 0.12302141402154988, -0.18822753219120747, -0.07450706656578235, 0.39701667462670526, -0.12432233575558246, -0.24656239851529516, 0.16943703500857188, -0.16244210673192905, -0.07723111173051388, 0.11511530177017977, 0.16310021733637725, 0.12973819729373898, -0.15567265424964039, 0.1429144449215274, 0.007586009617858339, 0.11317091921431034, 0.03663138280687637, 0.002161097014322877, 0.21551985289295053, 0.12329625448775153, 0.035773759307123204, 0.17952971719273061, -0.07182952965241532, -0.11242415909086852, -0.35439520279422054, -0.21513116095986842, -0.15279829364573194, 0.025546456963807983, -0.07246801658326403, -0.22916381641529326, 0.42348137450252854, 0.19367980759937403, 0.15571611785319048, 0.036983229996918075, 0.2983997025808623, 0.1421170514828233, 0.06501494460403485, 0.0487143034711047, 0.3025095421755903, 0.1811392323633786, 0.12001779364140401, -0.23759935598084053, -0.09191140501088528, 0.07661446779262447]
|
1,803.08114
|
Randomized Projection Methods for Linear Systems with Arbitrarily Large
Sparse Corruptions
|
In applications like medical imaging, error correction, and sensor networks,
one needs to solve large-scale linear systems that may be corrupted by a small
number of arbitrarily large corruptions. We consider solving such large-scale
systems of linear equations $A\mathbf{x}=\mathbf{b}$ that are inconsistent due
to corruptions in the measurement vector $\mathbf{b}$. With this as our
motivating example, we develop an approach for this setting that allows
detection of the corrupted entries and thus convergence to the "true" solution
of the original system. We provide analytical justification for our approaches
as well as experimental evidence on real and synthetic systems.
|
math.NA cs.NA
|
in applications like medical imaging error correction and sensor networks one needs to solve largescale linear systems that may be corrupted by a small number of arbitrarily large corruptions we consider solving such largescale systems of linear equations amathbfxmathbfb that are inconsistent due to corruptions in the measurement vector mathbfb with this as our motivating example we develop an approach for this setting that allows detection of the corrupted entries and thus convergence to the true solution of the original system we provide analytical justification for our approaches as well as experimental evidence on real and synthetic systems
|
[['in', 'applications', 'like', 'medical', 'imaging', 'error', 'correction', 'and', 'sensor', 'networks', 'one', 'needs', 'to', 'solve', 'largescale', 'linear', 'systems', 'that', 'may', 'be', 'corrupted', 'by', 'a', 'small', 'number', 'of', 'arbitrarily', 'large', 'corruptions', 'we', 'consider', 'solving', 'such', 'largescale', 'systems', 'of', 'linear', 'equations', 'amathbfxmathbfb', 'that', 'are', 'inconsistent', 'due', 'to', 'corruptions', 'in', 'the', 'measurement', 'vector', 'mathbfb', 'with', 'this', 'as', 'our', 'motivating', 'example', 'we', 'develop', 'an', 'approach', 'for', 'this', 'setting', 'that', 'allows', 'detection', 'of', 'the', 'corrupted', 'entries', 'and', 'thus', 'convergence', 'to', 'the', 'true', 'solution', 'of', 'the', 'original', 'system', 'we', 'provide', 'analytical', 'justification', 'for', 'our', 'approaches', 'as', 'well', 'as', 'experimental', 'evidence', 'on', 'real', 'and', 'synthetic', 'systems']]
|
[-0.10784067854419657, 0.009538611292883456, -0.002771841381321248, 0.05533785188388195, -0.06665474848495316, -0.16442749652646713, 0.021537597531203143, 0.35014753211673694, -0.28652431577271253, -0.31617846361063806, 0.18329371012430445, -0.28072312310684266, -0.21207468674431756, 0.23322504848846687, -0.1140857089710537, 0.12055245497907252, 0.11587270543209671, 0.012178878861865913, -0.034225300619301874, -0.2534809832763618, 0.30922131334460273, 0.037208554507761275, 0.24032002862197221, 0.0021053430787527686, 0.10398041421893178, 0.013576291115071202, -0.012885115258203647, 0.06833423787401509, -0.029272612375036224, 0.11721207952779747, 0.3063774293182975, 0.15900795114557884, 0.30786594907877984, -0.44130471824025064, -0.21251924808338746, 0.12221378905064974, 0.1714586411511583, 0.17361036120654688, -0.08298791608576346, -0.31627827937253894, 0.1219066058107911, -0.14808437729148752, -0.09900502767893918, -0.17373638858385, 0.0053944766387036165, 0.01514394813668482, -0.3415852214891425, 0.09527127745743726, 0.04953561009978395, 0.045925185977260474, -0.10255304492167533, -0.12119444878651886, 0.09396685836068594, 0.1332297942591543, 0.055376096495388785, 0.018693374613895246, 0.08881275927091074, -0.13980695853350664, -0.12234652757443026, 0.3975797516207412, -0.0671446016994449, -0.24291721508194952, 0.196348590698314, -0.08299759044023902, -0.13394617777889037, 0.09104244926039456, 0.24699710791008836, 0.10554851805455215, -0.1148527810810921, 0.05603292317324097, -0.06334393204564286, 0.17165207028504192, -0.011631722445599735, 0.025454281037193292, 0.14665333870030248, 0.15171041214039319, 0.10013264812260252, 0.13587558521413887, -0.09488166101305678, -0.058920880618802816, -0.2945130816516803, -0.12963997492009832, -0.2144574081361985, 0.05326651093386805, -0.09253233441193084, -0.18108477484742083, 0.31192510271656143, 0.244834930205132, 0.2329128916140108, 0.06131438159422239, 0.3776900168393076, 0.10979048017599649, 0.055807410643349604, 0.048999885702025646, 0.1882733235990187, 0.1260368997595974, 0.10344075837374195, -0.17134081043264607, 0.07647643876550048, -0.012856817645856092]
|
1,803.08115
|
Current-induced magnetization hysteresis defines atom trapping in a
superconducting atomchip
|
The physics of superconducting films, and especially the role of remnant
magnetization has a defining influence on the magnetic fields used to hold and
manipulate atoms on superconducting atomchips. We magnetically trap ultracold
^{87}Rb atoms on a 200{\mu}m wide and 500nm thick cryogenically cooled niobium
Z wire structure. By measuring the distance of the atomcloud to the trapping
wire for different transport currents and bias fields, we probe the trapping
characteristics of the niobium superconducting structure. At distances closer
than the trapping wire width, we observe a different behaviour than that of
normal conducting wire traps. Furthermore, we measure a stable magnetic trap at
zero transport current. These observations point to the presence of a remnant
magnetization in our niobium film which is induced by a transport current. This
current-induced magnetization defines the trap close to the chip surface. Our
measurements agree very well with an analytic prediction based on the critical
state model (CSM). Our results provide a new tool to control atom trapping on
superconducting atomchips by designing the current distribution through its
current history.
|
physics.atom-ph
|
the physics of superconducting films and especially the role of remnant magnetization has a defining influence on the magnetic fields used to hold and manipulate atoms on superconducting atomchips we magnetically trap ultracold 87rb atoms on a 200mum wide and 500nm thick cryogenically cooled niobium z wire structure by measuring the distance of the atomcloud to the trapping wire for different transport currents and bias fields we probe the trapping characteristics of the niobium superconducting structure at distances closer than the trapping wire width we observe a different behaviour than that of normal conducting wire traps furthermore we measure a stable magnetic trap at zero transport current these observations point to the presence of a remnant magnetization in our niobium film which is induced by a transport current this currentinduced magnetization defines the trap close to the chip surface our measurements agree very well with an analytic prediction based on the critical state model csm our results provide a new tool to control atom trapping on superconducting atomchips by designing the current distribution through its current history
|
[['the', 'physics', 'of', 'superconducting', 'films', 'and', 'especially', 'the', 'role', 'of', 'remnant', 'magnetization', 'has', 'a', 'defining', 'influence', 'on', 'the', 'magnetic', 'fields', 'used', 'to', 'hold', 'and', 'manipulate', 'atoms', 'on', 'superconducting', 'atomchips', 'we', 'magnetically', 'trap', 'ultracold', '87rb', 'atoms', 'on', 'a', '200mum', 'wide', 'and', '500nm', 'thick', 'cryogenically', 'cooled', 'niobium', 'z', 'wire', 'structure', 'by', 'measuring', 'the', 'distance', 'of', 'the', 'atomcloud', 'to', 'the', 'trapping', 'wire', 'for', 'different', 'transport', 'currents', 'and', 'bias', 'fields', 'we', 'probe', 'the', 'trapping', 'characteristics', 'of', 'the', 'niobium', 'superconducting', 'structure', 'at', 'distances', 'closer', 'than', 'the', 'trapping', 'wire', 'width', 'we', 'observe', 'a', 'different', 'behaviour', 'than', 'that', 'of', 'normal', 'conducting', 'wire', 'traps', 'furthermore', 'we', 'measure', 'a', 'stable', 'magnetic', 'trap', 'at', 'zero', 'transport', 'current', 'these', 'observations', 'point', 'to', 'the', 'presence', 'of', 'a', 'remnant', 'magnetization', 'in', 'our', 'niobium', 'film', 'which', 'is', 'induced', 'by', 'a', 'transport', 'current', 'this', 'currentinduced', 'magnetization', 'defines', 'the', 'trap', 'close', 'to', 'the', 'chip', 'surface', 'our', 'measurements', 'agree', 'very', 'well', 'with', 'an', 'analytic', 'prediction', 'based', 'on', 'the', 'critical', 'state', 'model', 'csm', 'our', 'results', 'provide', 'a', 'new', 'tool', 'to', 'control', 'atom', 'trapping', 'on', 'superconducting', 'atomchips', 'by', 'designing', 'the', 'current', 'distribution', 'through', 'its', 'current', 'history']]
|
[-0.13514047394115056, 0.19608557568831617, -0.024704740499146283, -0.011241540662012994, -0.026701855395169168, -0.1628155628780157, 0.09337981561177665, 0.4167010002684864, -0.21700688850350244, -0.28363273362099956, 0.011475031832312445, -0.2846036424796859, 0.004444683552719653, 0.24800055001370228, 0.0439333591573152, 0.018406720431481848, 0.0017271845188753848, -0.03914486524097976, -0.07870163755168588, -0.20129444381084546, 0.29876705544037657, 0.06493371750085233, 0.3496406646617371, 0.08133490840819749, 0.07295921500851611, -0.03459244514868425, 0.13091369578631368, 0.019339820457389578, -0.17498180651343567, 0.09427865057527511, 0.19032383079717297, -0.061664164864024235, 0.1898131766700482, -0.50033986100673, -0.20749227179873164, 0.04777806324736131, 0.14033448461453768, 0.15473927434901602, -0.08323780641248132, -0.29936106666520407, 0.013941618418109349, -0.11550052658871705, -0.16150214278852879, -0.06828375374739566, -0.005662673108004542, 0.017625844762237233, -0.22404028666906842, 0.01372737282178026, 0.04766665718489094, 0.10223321222689595, -0.07526820253604621, -0.09039589407620952, -0.0030420491450720215, 0.05520040835703681, -0.028183783118120944, 0.08094218070023503, 0.26335938679717813, -0.12407243970334424, -0.0681953966030216, 0.3017010513682511, -0.0845741646753595, -0.10524749269825406, 0.1785716301373296, -0.20442104414475828, 0.0010096572963944213, 0.11284158675037113, 0.1475578210507096, 0.0824401107383892, -0.1381979339831477, 0.02986596955104853, -0.015124860486883501, 0.14735439002453693, 0.07932867771226236, 0.04848911796580069, 0.30121869590683753, 0.2477351739441722, 0.049378996998050505, 0.15054212031563194, -0.1792168373464268, -0.04803545066864568, -0.25755395091255195, -0.16618101903374985, -0.20207696993814103, 0.08021269631386861, -0.06806083601622959, -0.1993786439786411, 0.40324708220908756, 0.17150193809489298, 0.18059935101138597, -0.06596142094283343, 0.30354239979880565, 0.07592785473124505, 0.09136502684255406, 0.04824183937109245, 0.2626105344130668, 0.2103039600426035, 0.12891447215224616, -0.32113400677917525, 0.06779966643609275, -0.024163812351286073]
|
1,803.08116
|
The Linear BESS Model at the LHC
|
In this work we consider the Linear BESS model at the LHC. This model can be
seen as an adequate benchmark for exploring the phenomenological consequences
of a composite Higgs sector since its particle content is the one we would
expect in a realistic low energy description of modern (Technicolor inspired)
dynamical electroweak symmetry breaking scenarios. Additionally, the model
exhibits the property of decoupling, producing a good ultraviolet behavior. We
focus on the limits on the masses of the new heavy vector particles imposed by
direct resonance searches, recent measurements of the decay of the Higgs boson
into two photons and the electroweak precision tests. We found that the model
is capable to accommodate the existing experimental constrains provided that
the spin-1 resonances are heavier than 3.4 TeV.
|
hep-ph hep-ex
|
in this work we consider the linear bess model at the lhc this model can be seen as an adequate benchmark for exploring the phenomenological consequences of a composite higgs sector since its particle content is the one we would expect in a realistic low energy description of modern technicolor inspired dynamical electroweak symmetry breaking scenarios additionally the model exhibits the property of decoupling producing a good ultraviolet behavior we focus on the limits on the masses of the new heavy vector particles imposed by direct resonance searches recent measurements of the decay of the higgs boson into two photons and the electroweak precision tests we found that the model is capable to accommodate the existing experimental constrains provided that the spin1 resonances are heavier than 34 tev
|
[['in', 'this', 'work', 'we', 'consider', 'the', 'linear', 'bess', 'model', 'at', 'the', 'lhc', 'this', 'model', 'can', 'be', 'seen', 'as', 'an', 'adequate', 'benchmark', 'for', 'exploring', 'the', 'phenomenological', 'consequences', 'of', 'a', 'composite', 'higgs', 'sector', 'since', 'its', 'particle', 'content', 'is', 'the', 'one', 'we', 'would', 'expect', 'in', 'a', 'realistic', 'low', 'energy', 'description', 'of', 'modern', 'technicolor', 'inspired', 'dynamical', 'electroweak', 'symmetry', 'breaking', 'scenarios', 'additionally', 'the', 'model', 'exhibits', 'the', 'property', 'of', 'decoupling', 'producing', 'a', 'good', 'ultraviolet', 'behavior', 'we', 'focus', 'on', 'the', 'limits', 'on', 'the', 'masses', 'of', 'the', 'new', 'heavy', 'vector', 'particles', 'imposed', 'by', 'direct', 'resonance', 'searches', 'recent', 'measurements', 'of', 'the', 'decay', 'of', 'the', 'higgs', 'boson', 'into', 'two', 'photons', 'and', 'the', 'electroweak', 'precision', 'tests', 'we', 'found', 'that', 'the', 'model', 'is', 'capable', 'to', 'accommodate', 'the', 'existing', 'experimental', 'constrains', 'provided', 'that', 'the', 'spin1', 'resonances', 'are', 'heavier', 'than', '34', 'tev']]
|
[-0.09774047321843682, 0.22224876814755135, -0.07828980893282278, 0.13789686407835688, -0.078348848330279, -0.1646837079360921, 0.014718142527271993, 0.3100965385820018, -0.21187321942124981, -0.3106556515558623, 0.05595587586503825, -0.2832614237413509, -0.04380302320350893, 0.17254039048293635, 0.028724904677801533, 0.08625706502743924, 0.06785372618833208, 0.029105770410751575, -0.05528325382283583, -0.22497300098802953, 0.275097303045186, 0.07590136477301712, 0.23205371028416266, 0.09392964139624382, 0.07494736921830736, 0.015123281607884564, -0.0028367947543301852, -0.06335397001021192, -0.13282922198652614, 0.11280264269339568, 0.1467547872052819, 0.09870089556716266, 0.16640975763220922, -0.3953193437118898, -0.21094686166543397, 0.15437656923313625, 0.1470799342096143, 0.12343834905186668, -0.113058224438646, -0.3090918032685295, 0.08227020141021057, -0.19406837007136346, -0.14832108932750998, -0.06320187450728554, -0.07664618591661565, -0.09363512408344832, -0.3210947125880921, 0.06160516806630767, 0.008604781348140023, 0.05055283690307988, -0.03996033573366731, -0.13129435941118572, -0.04237779470577152, 0.012353120491752634, 0.12281218352813994, -0.02026018125616247, 0.15851018992270838, -0.20591229212732287, -0.15244859629910934, 0.4293367819482228, -0.09184839174497483, -0.13731972917958046, 0.21384235265213647, -0.13458728242585494, -0.1758506100904924, 0.10955282005306799, 0.19473329053016641, 0.07480746385408565, -0.15916966985969339, 0.14747289455567625, -0.06542903372610454, 0.1907074079854283, -0.004459314719497343, 0.08038237780783675, 0.26049299830629025, 0.24545501273678383, 0.004780308285262436, 0.08512939273987286, -0.0735854315553297, -0.1037027690326795, -0.37089486146396666, -0.11520248049782822, -0.10629041620268254, 0.008559334975871025, -0.06501074439586318, -0.06950319404859329, 0.41413735962851206, 0.1690674278543156, 0.25135797847360664, 0.016539807584194932, 0.30312195271471865, 0.10401230934894556, 0.0913118895405205, 0.0036603192565962672, 0.3536899629543768, 0.08703644991510373, 0.1068780279965722, -0.20943420963158133, 0.006851038136119314, 0.04243608989781933]
|
1,803.08117
|
Influence of outer-layer finite-size effects on the rupture kinetics of
a thin polymer film embedded in an immiscible matrix
|
In capillary-driven fluid dynamics, simple departures from equilibrium offer
the chance to quantitatively model the resulting relaxations. These dynamics in
turn provide insight on both practical and fundamental aspects of thin-film
hydrodynamics. In this work, we describe a model trilayer dewetting experiment
elucidating the effect of solid, no-slip confining boundaries on the bursting
of a liquid film in a viscous environment. This experiment was inspired by an
industrial polymer processing technique, multilayer coextrusion, in which
thousands of alternating layers are stacked atop one another. When pushed to
the nanoscale limit, the individual layers are found to break up on time scales
shorter than the processing time. To gain insight on this dynamic problem, we
here directly observe the growth rate of holes in the middle layer of the
trilayer films described above, wherein the distance between the inner film and
solid boundary can be orders of magnitude larger than its thickness. In
otherwise identical experimental conditions, thinner films break up faster than
thicker ones. This observation is found to agree with a scaling model that
balances capillary driving power and viscous dissipation with, crucially, a
no-slip boundary condition at the solid substrate/viscous environment boundary.
In particular, even for the thinnest middle-layers, no finite-size effect is
needed to explain the data. The dynamics of hole growth is captured by a single
master curve over four orders of magnitude in the dimensionless hole radius and
time, and is found to agree well with predictions including analytic
expressions for the dissipation.
|
cond-mat.soft
|
in capillarydriven fluid dynamics simple departures from equilibrium offer the chance to quantitatively model the resulting relaxations these dynamics in turn provide insight on both practical and fundamental aspects of thinfilm hydrodynamics in this work we describe a model trilayer dewetting experiment elucidating the effect of solid noslip confining boundaries on the bursting of a liquid film in a viscous environment this experiment was inspired by an industrial polymer processing technique multilayer coextrusion in which thousands of alternating layers are stacked atop one another when pushed to the nanoscale limit the individual layers are found to break up on time scales shorter than the processing time to gain insight on this dynamic problem we here directly observe the growth rate of holes in the middle layer of the trilayer films described above wherein the distance between the inner film and solid boundary can be orders of magnitude larger than its thickness in otherwise identical experimental conditions thinner films break up faster than thicker ones this observation is found to agree with a scaling model that balances capillary driving power and viscous dissipation with crucially a noslip boundary condition at the solid substrateviscous environment boundary in particular even for the thinnest middlelayers no finitesize effect is needed to explain the data the dynamics of hole growth is captured by a single master curve over four orders of magnitude in the dimensionless hole radius and time and is found to agree well with predictions including analytic expressions for the dissipation
|
[['in', 'capillarydriven', 'fluid', 'dynamics', 'simple', 'departures', 'from', 'equilibrium', 'offer', 'the', 'chance', 'to', 'quantitatively', 'model', 'the', 'resulting', 'relaxations', 'these', 'dynamics', 'in', 'turn', 'provide', 'insight', 'on', 'both', 'practical', 'and', 'fundamental', 'aspects', 'of', 'thinfilm', 'hydrodynamics', 'in', 'this', 'work', 'we', 'describe', 'a', 'model', 'trilayer', 'dewetting', 'experiment', 'elucidating', 'the', 'effect', 'of', 'solid', 'noslip', 'confining', 'boundaries', 'on', 'the', 'bursting', 'of', 'a', 'liquid', 'film', 'in', 'a', 'viscous', 'environment', 'this', 'experiment', 'was', 'inspired', 'by', 'an', 'industrial', 'polymer', 'processing', 'technique', 'multilayer', 'coextrusion', 'in', 'which', 'thousands', 'of', 'alternating', 'layers', 'are', 'stacked', 'atop', 'one', 'another', 'when', 'pushed', 'to', 'the', 'nanoscale', 'limit', 'the', 'individual', 'layers', 'are', 'found', 'to', 'break', 'up', 'on', 'time', 'scales', 'shorter', 'than', 'the', 'processing', 'time', 'to', 'gain', 'insight', 'on', 'this', 'dynamic', 'problem', 'we', 'here', 'directly', 'observe', 'the', 'growth', 'rate', 'of', 'holes', 'in', 'the', 'middle', 'layer', 'of', 'the', 'trilayer', 'films', 'described', 'above', 'wherein', 'the', 'distance', 'between', 'the', 'inner', 'film', 'and', 'solid', 'boundary', 'can', 'be', 'orders', 'of', 'magnitude', 'larger', 'than', 'its', 'thickness', 'in', 'otherwise', 'identical', 'experimental', 'conditions', 'thinner', 'films', 'break', 'up', 'faster', 'than', 'thicker', 'ones', 'this', 'observation', 'is', 'found', 'to', 'agree', 'with', 'a', 'scaling', 'model', 'that', 'balances', 'capillary', 'driving', 'power', 'and', 'viscous', 'dissipation', 'with', 'crucially', 'a', 'noslip', 'boundary', 'condition', 'at', 'the', 'solid', 'substrateviscous', 'environment', 'boundary', 'in', 'particular', 'even', 'for', 'the', 'thinnest', 'middlelayers', 'no', 'finitesize', 'effect', 'is', 'needed', 'to', 'explain', 'the', 'data', 'the', 'dynamics', 'of', 'hole', 'growth', 'is', 'captured', 'by', 'a', 'single', 'master', 'curve', 'over', 'four', 'orders', 'of', 'magnitude', 'in', 'the', 'dimensionless', 'hole', 'radius', 'and', 'time', 'and', 'is', 'found', 'to', 'agree', 'well', 'with', 'predictions', 'including', 'analytic', 'expressions', 'for', 'the', 'dissipation']]
|
[-0.12141048430079003, 0.14901356124921325, -0.08293292298345123, 0.025029124081611814, -0.043875681583739334, -0.14910136907914184, 0.02535489443864681, 0.35962052991220017, -0.27363076698739175, -0.33664771962184004, 0.07274372205829127, -0.2700884332586973, -0.09319026533294682, 0.2226931284923803, -0.017451512668948104, 0.038516931341557835, 0.01821465202764801, -0.028534224802865722, -0.06677272178921698, -0.20808657923878013, 0.2556999471105779, 0.05463395836906, 0.3035772694303177, 0.051560787189698865, 0.0468938399595587, -0.06288702598095273, 0.04883820477804941, 0.0347058538449701, -0.18868217683730035, 0.06489025384927835, 0.2036153579935738, -0.04296581354607427, 0.22691919041297784, -0.5268248350556365, -0.23317264792380657, 0.016327242857505184, 0.1421122248663105, 0.1068385844175681, -0.018092668528206707, -0.22112216664538756, 0.06533518876233024, -0.1327866465515813, -0.12977041379828763, -0.019378353089162307, 0.023480958106541414, -0.021769399926131704, -0.23608326694239082, 0.11179800664937896, 0.0776547094370708, 0.04631965157076171, -0.07775225021499702, -0.08317280955029636, -0.04869373213609574, 0.10069771095643262, 0.059845952710730205, 0.026898569800338248, 0.1910973363044876, -0.14688141453997952, -0.06673885139114247, 0.36313918262447525, -0.04036474632040353, -0.16714380202792223, 0.21957271590420022, -0.18698306712586948, -0.03975108111981393, 0.15294059636866356, 0.15891553668117878, 0.11005385732467521, -0.14973823107785889, 0.02191896155376363, -0.020139953924146126, 0.21821274558494883, 0.1047526704036485, 0.0006591380016340655, 0.23344814237131456, 0.25246684295901406, 0.048176957334451403, 0.16214583265903687, -0.07177743785912871, -0.12880228539432845, -0.25450294054344264, -0.14759190576515402, -0.15449149411254964, 0.05344083103090071, -0.12374441126356521, -0.15909188523523252, 0.35824737623163566, 0.1480578372635447, 0.18492088965575657, 0.04488130171292999, 0.2969976669108114, 0.08648159466608148, 0.07852699786492782, 0.05510901654994766, 0.28127698537068274, 0.10416157518483214, 0.11853208506576399, -0.23401659395265567, 0.08886214008089155, 0.03742242260926926]
|
1,803.08118
|
Seglearn: A Python Package for Learning Sequences and Time Series
|
Seglearn is an open-source python package for machine learning time series or
sequences using a sliding window segmentation approach. The implementation
provides a flexible pipeline for tackling classification, regression, and
forecasting problems with multivariate sequence and contextual data. This
package is compatible with scikit-learn and is listed under scikit-learn
Related Projects. The package depends on numpy, scipy, and scikit-learn.
Seglearn is distributed under the BSD 3-Clause License. Documentation includes
a detailed API description, user guide, and examples. Unit tests provide a high
degree of code coverage.
|
stat.ML cs.LG
|
seglearn is an opensource python package for machine learning time series or sequences using a sliding window segmentation approach the implementation provides a flexible pipeline for tackling classification regression and forecasting problems with multivariate sequence and contextual data this package is compatible with scikitlearn and is listed under scikitlearn related projects the package depends on numpy scipy and scikitlearn seglearn is distributed under the bsd 3clause license documentation includes a detailed api description user guide and examples unit tests provide a high degree of code coverage
|
[['seglearn', 'is', 'an', 'opensource', 'python', 'package', 'for', 'machine', 'learning', 'time', 'series', 'or', 'sequences', 'using', 'a', 'sliding', 'window', 'segmentation', 'approach', 'the', 'implementation', 'provides', 'a', 'flexible', 'pipeline', 'for', 'tackling', 'classification', 'regression', 'and', 'forecasting', 'problems', 'with', 'multivariate', 'sequence', 'and', 'contextual', 'data', 'this', 'package', 'is', 'compatible', 'with', 'scikitlearn', 'and', 'is', 'listed', 'under', 'scikitlearn', 'related', 'projects', 'the', 'package', 'depends', 'on', 'numpy', 'scipy', 'and', 'scikitlearn', 'seglearn', 'is', 'distributed', 'under', 'the', 'bsd', '3clause', 'license', 'documentation', 'includes', 'a', 'detailed', 'api', 'description', 'user', 'guide', 'and', 'examples', 'unit', 'tests', 'provide', 'a', 'high', 'degree', 'of', 'code', 'coverage']]
|
[-0.08359328111899751, -0.07366168889659873, -0.08200384186403382, 0.05203385492980791, -0.16086039131706847, -0.28065959845913485, -0.022293886711676827, 0.47352909203618765, -0.2629675867667954, -0.3121755047967391, 0.16621050061214537, -0.2603721130594966, -0.07861870648394827, 0.3067001862911552, -0.0879621184236991, 0.0989883393922355, 0.2051439967971029, -0.008138887592178349, -0.016088160603041097, -0.2749450467305169, 0.20768888370228178, 0.1512274489671524, 0.3181340418689485, 0.03882693035189905, 0.10313954925125775, 0.0551806311982329, -0.12471667118370533, -0.08755797651108532, -0.1348717285020809, 0.1391632486705757, 0.31697019378909663, 0.2939481066174007, 0.32517243998258244, -0.32313350379644407, -0.13155270003092787, -0.06099336878174827, 0.07005386185483076, 0.03799020786980344, -0.06042490776079441, -0.30322565768091453, 0.059797929580478616, -0.2141812039690627, -0.03876303588151045, -0.15402875789662912, -0.0252540461009457, 0.0429325751001237, -0.3427351649928217, -0.013694947480135375, 0.005439165070475567, 0.21597515946320658, -0.04163971032193374, -0.12164677524595477, 0.04184219449581135, 0.10868466188964833, 0.001897433988883027, 0.08977792809240609, 0.15336906634980724, -0.09086830050052543, -0.11171548895626551, 0.3925640360407886, -0.033380835946965295, -0.20241277041800676, 0.17284969199681655, 0.049711795712244655, -0.21557439767223383, 0.06857747140540076, 0.254818850518426, 0.09338162031573509, -0.2219301530359579, 0.1540994215943751, 0.006755977159454709, 0.22833530321007683, 0.028993470732876586, -0.0988880263757892, 0.1784179738301429, 0.2537546041421592, -0.008908135770027348, 0.18233736058963196, -0.06787518379721968, -0.053620198857970536, -0.3067364998693977, -0.18078877691489956, -0.12034491408571955, -0.09364411099037777, -0.08476176734794058, -0.26285903421895845, 0.4209548897952551, 0.15303989643940613, 0.022476974691796516, 0.12333672200994832, 0.3645331963808054, -0.001867667350563265, 0.11274260157924368, 0.19782096623176976, -0.019454087485514936, 0.009350468875795957, 0.13361324027868077, -0.08747809591503548, 0.07695099249637376, 0.02399625893338539]
|
1,803.08119
|
Implications of Higgs Discovery for the Strong CP Problem and
Unification
|
A $Z_2$ symmetry that extends the weak interaction, $SU(2)_L \rightarrow
SU(2)_L \times SU(2)'$, and the Higgs sector, $H(2) \rightarrow H(2,1) +
H'(1,2)$, yields a Standard Model quartic coupling that vanishes at scale $v' =
<H'>~\gg~<H>$. Near $v'$, theories either have a "prime" sector, or possess
"Left-Right" (LR) symmetry with $SU(2)' = SU(2)_R$. If the $Z_2$ symmetry
incorporates spacetime parity, these theories can solve the strong CP problem.
The LR theories have all quark and lepton masses arising from operators of
dimension 5 or more, requiring Froggatt-Nielsen structures. Two-loop
contributions to $\bar{\theta}$ are estimated and typically lead to a neutron
electric dipole moment of order $10^{-27}$e cm that can be observed in future
experiments. Minimal models, with gauge group $SU(3) \times SU(2)_L \times
SU(2)_L \times U(1)_{B-L}$, have precise gauge coupling unification for $v' =
10^{10\pm1}$ GeV, successfully correlating gauge unification with the observed
Higgs mass of $125$ GeV. With $SU(3) \times U(1)_{B-L}$ embedded in $SU(4)$,
the central value of the unification scale is reduced from $10^{16-17}$ GeV to
below $10^{16}$ GeV, improving the likelihood of proton decay discovery.
Unified theories based on $SO(10) \times CP$ are constructed that have $H+H'$
in a ${\bf 16}$ or ${\bf 144}$ and generate higher-dimensional flavor
operators, while maintaining perturbative gauge couplings.
|
hep-ph
|
a z_2 symmetry that extends the weak interaction su2_l rightarrow su2_l times su2 and the higgs sector h2 rightarrow h21 h12 yields a standard model quartic coupling that vanishes at scale v hggh near v theories either have a prime sector or possess leftright lr symmetry with su2 su2_r if the z_2 symmetry incorporates spacetime parity these theories can solve the strong cp problem the lr theories have all quark and lepton masses arising from operators of dimension 5 or more requiring froggattnielsen structures twoloop contributions to bartheta are estimated and typically lead to a neutron electric dipole moment of order 1027e cm that can be observed in future experiments minimal models with gauge group su3 times su2_l times su2_l times u1_bl have precise gauge coupling unification for v 1010pm1 gev successfully correlating gauge unification with the observed higgs mass of 125 gev with su3 times u1_bl embedded in su4 the central value of the unification scale is reduced from 101617 gev to below 1016 gev improving the likelihood of proton decay discovery unified theories based on so10 times cp are constructed that have hh in a bf 16 or bf 144 and generate higherdimensional flavor operators while maintaining perturbative gauge couplings
|
[['a', 'z_2', 'symmetry', 'that', 'extends', 'the', 'weak', 'interaction', 'su2_l', 'rightarrow', 'su2_l', 'times', 'su2', 'and', 'the', 'higgs', 'sector', 'h2', 'rightarrow', 'h21', 'h12', 'yields', 'a', 'standard', 'model', 'quartic', 'coupling', 'that', 'vanishes', 'at', 'scale', 'v', 'hggh', 'near', 'v', 'theories', 'either', 'have', 'a', 'prime', 'sector', 'or', 'possess', 'leftright', 'lr', 'symmetry', 'with', 'su2', 'su2_r', 'if', 'the', 'z_2', 'symmetry', 'incorporates', 'spacetime', 'parity', 'these', 'theories', 'can', 'solve', 'the', 'strong', 'cp', 'problem', 'the', 'lr', 'theories', 'have', 'all', 'quark', 'and', 'lepton', 'masses', 'arising', 'from', 'operators', 'of', 'dimension', '5', 'or', 'more', 'requiring', 'froggattnielsen', 'structures', 'twoloop', 'contributions', 'to', 'bartheta', 'are', 'estimated', 'and', 'typically', 'lead', 'to', 'a', 'neutron', 'electric', 'dipole', 'moment', 'of', 'order', '1027e', 'cm', 'that', 'can', 'be', 'observed', 'in', 'future', 'experiments', 'minimal', 'models', 'with', 'gauge', 'group', 'su3', 'times', 'su2_l', 'times', 'su2_l', 'times', 'u1_bl', 'have', 'precise', 'gauge', 'coupling', 'unification', 'for', 'v', '1010pm1', 'gev', 'successfully', 'correlating', 'gauge', 'unification', 'with', 'the', 'observed', 'higgs', 'mass', 'of', '125', 'gev', 'with', 'su3', 'times', 'u1_bl', 'embedded', 'in', 'su4', 'the', 'central', 'value', 'of', 'the', 'unification', 'scale', 'is', 'reduced', 'from', '101617', 'gev', 'to', 'below', '1016', 'gev', 'improving', 'the', 'likelihood', 'of', 'proton', 'decay', 'discovery', 'unified', 'theories', 'based', 'on', 'so10', 'times', 'cp', 'are', 'constructed', 'that', 'have', 'hh', 'in', 'a', 'bf', '16', 'or', 'bf', '144', 'and', 'generate', 'higherdimensional', 'flavor', 'operators', 'while', 'maintaining', 'perturbative', 'gauge', 'couplings']]
|
[-0.1440774417972548, 0.27501376727291726, 0.01318632153649089, 0.13527676832438656, -0.09483205038941835, -0.22716561889354298, -0.020931400867335817, 0.3624237212071654, -0.14708093553079507, -0.2995630195621757, 0.053666467272358284, -0.26001631343578124, 0.022641891231011582, 0.034767678051943605, 0.055036769001674486, -0.006230098519464908, -0.04960171691254343, 0.03321259023490638, -0.1339985425560618, -0.2609341919144859, 0.22387032481331623, -0.048615706485494896, 0.21507872903869305, 0.05499689653983817, 0.10113719818018489, -0.034611042456738836, 0.05685749258518444, -0.14738815170408567, -0.058346625136670154, 0.0694192183120925, 0.16974407131149302, 0.03108693068102938, 0.05843298552791388, -0.39264204093353383, -0.15870960037008713, 0.19866148247874937, 0.14752888474285827, 0.0661612833246364, -0.03927664802944692, -0.3870078663449341, 0.14165873669559398, -0.22120016113616264, -0.11430553664645209, -0.08699945833103441, -0.019553356977114127, -0.16200234201191527, -0.3702503641571232, 0.1316781949542051, -0.054053788389261795, 0.06980380044089415, 0.02505972375625267, -0.17076795106290385, -0.1048053777612858, -0.05239608944873396, 0.2281021085788903, 0.11087730960995333, 0.1720617167907884, -0.19162935573676712, -0.18199863359472485, 0.4634061228207795, -0.08705283335150318, -0.15342346549703362, 0.13408990249145383, -0.15066869246852982, -0.2098497150433086, 0.16090668516172724, 0.15553695588500177, 0.0805761975789941, -0.13205155602951146, 0.282386237094366, -0.06845179744457928, 0.19374488020343847, 0.07425872358521587, 0.05000758306567917, 0.24938238298885487, 0.1262218982177838, 0.07878334172556747, -0.033363569397409094, -0.03427546071801241, -0.09413784352042268, -0.42058033802916284, -0.06374921428446831, -0.05662272130221072, 0.17013793664249643, -0.13660882422484075, -0.028799029713000485, 0.38714337886905476, 0.11003788976682041, 0.22155647579201465, 0.0596770832207447, 0.19256692498409886, 0.09663243929682365, 0.15705572933703896, 0.012115501520228595, 0.2565518890158858, 0.1739075733629528, 0.049159454624344075, -0.22771580028727922, -0.1143300081603229, 0.1469474498840077]
|
1,803.0812
|
Stochastic PDE Limit of the Six Vertex Model
|
We study the stochastic six vertex model and prove that under weak asymmetry
scaling (i.e., when the parameter $\Delta\to 1^+$ so as to zoom into the
ferroelectric/disordered phase critical point) its height function fluctuations
converge to the solution to the KPZ equation. We also prove that the
one-dimensional family of stochastic Gibbs states for the symmetric six vertex
model converge under the same scaling to the stationary solution to the
stochastic Burgers equation.
Our proofs rely upon the Markov (self) duality of our model. The starting
point is an exact microscopic Hopf-Cole transform for the stochastic six vertex
model which follows from the model's known one-particle Markov self-duality.
Given this transform, the crucial step is to establish self-averaging for
specific quadratic function of the transformed height function. We use the
model's two-particle self-duality to produce explicit expressions (as Bethe
ansatz contour integrals) for conditional expectations from which we extract
time-decorrelation and hence self-averaging in time. The crux of our Markov
duality method is that the entire convergence result reduces to precise
estimates on the one-particle and two-particle transition probabilities.
Previous to our work, Markov dualities had only been used to prove convergence
of particle systems to linear Gaussian SPDEs (e.g. the stochastic heat equation
with additive noise).
|
math.PR cond-mat.stat-mech math-ph math.MP
|
we study the stochastic six vertex model and prove that under weak asymmetry scaling ie when the parameter deltato 1 so as to zoom into the ferroelectricdisordered phase critical point its height function fluctuations converge to the solution to the kpz equation we also prove that the onedimensional family of stochastic gibbs states for the symmetric six vertex model converge under the same scaling to the stationary solution to the stochastic burgers equation our proofs rely upon the markov self duality of our model the starting point is an exact microscopic hopfcole transform for the stochastic six vertex model which follows from the models known oneparticle markov selfduality given this transform the crucial step is to establish selfaveraging for specific quadratic function of the transformed height function we use the models twoparticle selfduality to produce explicit expressions as bethe ansatz contour integrals for conditional expectations from which we extract timedecorrelation and hence selfaveraging in time the crux of our markov duality method is that the entire convergence result reduces to precise estimates on the oneparticle and twoparticle transition probabilities previous to our work markov dualities had only been used to prove convergence of particle systems to linear gaussian spdes eg the stochastic heat equation with additive noise
|
[['we', 'study', 'the', 'stochastic', 'six', 'vertex', 'model', 'and', 'prove', 'that', 'under', 'weak', 'asymmetry', 'scaling', 'ie', 'when', 'the', 'parameter', 'deltato', '1', 'so', 'as', 'to', 'zoom', 'into', 'the', 'ferroelectricdisordered', 'phase', 'critical', 'point', 'its', 'height', 'function', 'fluctuations', 'converge', 'to', 'the', 'solution', 'to', 'the', 'kpz', 'equation', 'we', 'also', 'prove', 'that', 'the', 'onedimensional', 'family', 'of', 'stochastic', 'gibbs', 'states', 'for', 'the', 'symmetric', 'six', 'vertex', 'model', 'converge', 'under', 'the', 'same', 'scaling', 'to', 'the', 'stationary', 'solution', 'to', 'the', 'stochastic', 'burgers', 'equation', 'our', 'proofs', 'rely', 'upon', 'the', 'markov', 'self', 'duality', 'of', 'our', 'model', 'the', 'starting', 'point', 'is', 'an', 'exact', 'microscopic', 'hopfcole', 'transform', 'for', 'the', 'stochastic', 'six', 'vertex', 'model', 'which', 'follows', 'from', 'the', 'models', 'known', 'oneparticle', 'markov', 'selfduality', 'given', 'this', 'transform', 'the', 'crucial', 'step', 'is', 'to', 'establish', 'selfaveraging', 'for', 'specific', 'quadratic', 'function', 'of', 'the', 'transformed', 'height', 'function', 'we', 'use', 'the', 'models', 'twoparticle', 'selfduality', 'to', 'produce', 'explicit', 'expressions', 'as', 'bethe', 'ansatz', 'contour', 'integrals', 'for', 'conditional', 'expectations', 'from', 'which', 'we', 'extract', 'timedecorrelation', 'and', 'hence', 'selfaveraging', 'in', 'time', 'the', 'crux', 'of', 'our', 'markov', 'duality', 'method', 'is', 'that', 'the', 'entire', 'convergence', 'result', 'reduces', 'to', 'precise', 'estimates', 'on', 'the', 'oneparticle', 'and', 'twoparticle', 'transition', 'probabilities', 'previous', 'to', 'our', 'work', 'markov', 'dualities', 'had', 'only', 'been', 'used', 'to', 'prove', 'convergence', 'of', 'particle', 'systems', 'to', 'linear', 'gaussian', 'spdes', 'eg', 'the', 'stochastic', 'heat', 'equation', 'with', 'additive', 'noise']]
|
[-0.059546433137900125, 0.07667974523991267, -0.11634957670325005, 0.11461582348409403, -0.08505094454328462, -0.15205666286552824, 0.04472679295463533, 0.32479864071782044, -0.31449535587439087, -0.22232279600802718, 0.07390010742095822, -0.2818751754807081, -0.14599127209200183, 0.1481634886861529, -0.006486866536277641, 0.12107476505888172, 0.034252944600018785, 0.03631359977397795, -0.08570504579977019, -0.23096305339983322, 0.31958197003639327, 0.03368266917787856, 0.2942771894641493, 0.002820127086554904, 0.1601323100306639, 0.023844619395165908, 0.0010165236373545557, -0.033684064995315746, -0.16789772288200144, 0.049490245505202014, 0.2208424346831346, 0.08120044933166355, 0.23877362407198766, -0.41661171916781403, -0.21459960349176715, 0.1326675367740369, 0.15858558615983362, 0.1427954023852646, 0.014866983600346962, -0.30102400361083265, 0.05849948857354409, -0.13896986105729167, -0.1820868974869571, -0.08462811700500003, -0.01013065661053832, 0.06216017601943416, -0.29662029487677144, 0.09429301641662832, 0.10948446877641467, -0.006602787067432229, -0.06219666769852998, -0.10991399907620578, -0.041121493752409775, 0.09888217418480141, 0.06473075456167685, 0.04096150277693551, 0.11049615810284527, -0.11259078792205489, -0.10345805771989612, 0.29939975696360327, -0.07203695573787228, -0.2550592462441362, 0.16242945976441772, -0.14114489213041054, -0.17125167647581094, 0.13760438270230846, 0.12160882752547722, 0.11863091218841784, -0.19329146461982974, 0.12956095416377095, -0.053500006320636444, 0.1335537975763323, 0.039539764517145914, -0.0003044099887696708, 0.11902490484914402, 0.1028675325544233, 0.12133463377859897, 0.17323949542123734, -0.03696013710279836, -0.2079137613866251, -0.34034550207235464, -0.13411082355248766, -0.20256670801332446, 0.10061825048803102, -0.14982861466343775, -0.23000060083208287, 0.370184929996002, 0.19233498232468973, 0.17619793952170124, 0.15393798591160193, 0.22306244793779603, 0.22758264514027027, 0.009535624802385161, 0.06776216353357929, 0.16077717473594152, 0.1596222777794138, 0.08807259418592765, -0.22077392331528956, 0.06612142979780712, 0.1814575164493673]
|
1,803.08121
|
A Markov Chain Monte Carlo Approach to Cost Matrix Generation for
Scheduling Performance Evaluation
|
In high performance computing, scheduling of tasks and allocation to machines
is very critical especially when we are dealing with heterogeneous execution
costs. Simulations can be performed with a large variety of environments and
application models. However, this technique is sensitive to bias when it relies
on random instances with an uncontrolled distribution. We use methods from the
literature to provide formal guarantee on the distribution of the instance. In
particular, it is desirable to ensure a uniform distribution among the
instances with a given task and machine heterogeneity. In this article, we
propose a method that generates instances (cost matrices) with a known
distribution where tasks are scheduled on machines with heterogeneous execution
costs.
|
cs.PF
|
in high performance computing scheduling of tasks and allocation to machines is very critical especially when we are dealing with heterogeneous execution costs simulations can be performed with a large variety of environments and application models however this technique is sensitive to bias when it relies on random instances with an uncontrolled distribution we use methods from the literature to provide formal guarantee on the distribution of the instance in particular it is desirable to ensure a uniform distribution among the instances with a given task and machine heterogeneity in this article we propose a method that generates instances cost matrices with a known distribution where tasks are scheduled on machines with heterogeneous execution costs
|
[['in', 'high', 'performance', 'computing', 'scheduling', 'of', 'tasks', 'and', 'allocation', 'to', 'machines', 'is', 'very', 'critical', 'especially', 'when', 'we', 'are', 'dealing', 'with', 'heterogeneous', 'execution', 'costs', 'simulations', 'can', 'be', 'performed', 'with', 'a', 'large', 'variety', 'of', 'environments', 'and', 'application', 'models', 'however', 'this', 'technique', 'is', 'sensitive', 'to', 'bias', 'when', 'it', 'relies', 'on', 'random', 'instances', 'with', 'an', 'uncontrolled', 'distribution', 'we', 'use', 'methods', 'from', 'the', 'literature', 'to', 'provide', 'formal', 'guarantee', 'on', 'the', 'distribution', 'of', 'the', 'instance', 'in', 'particular', 'it', 'is', 'desirable', 'to', 'ensure', 'a', 'uniform', 'distribution', 'among', 'the', 'instances', 'with', 'a', 'given', 'task', 'and', 'machine', 'heterogeneity', 'in', 'this', 'article', 'we', 'propose', 'a', 'method', 'that', 'generates', 'instances', 'cost', 'matrices', 'with', 'a', 'known', 'distribution', 'where', 'tasks', 'are', 'scheduled', 'on', 'machines', 'with', 'heterogeneous', 'execution', 'costs']]
|
[-0.11689648239711381, 0.04636739258079931, -0.0811304243463699, 0.033097877196522185, -0.104149294561585, -0.15785902324335083, 0.07710343739220306, 0.4468839002368243, -0.2608729540410897, -0.3522234365728724, 0.12371739041080455, -0.23489493894917163, -0.12938220698143477, 0.22092580027149422, -0.14098560304542923, 0.10978454630012098, 0.1307779181667644, 0.030390161942214826, -0.026374666482392374, -0.30560842270598465, 0.31729612287599596, 0.0562333995891411, 0.33367040414039206, 0.02984300878546808, 0.09453440855216722, -0.009497401268099961, 0.011513663382957812, 0.04122275084044541, -0.037910605783121276, 0.13385801048868376, 0.31105062917989057, 0.1704324509098154, 0.3322036262439645, -0.4101079961042041, -0.1702362360837667, 0.14507410515443947, 0.08767290817492682, 0.09842763928210606, -0.027663596590940396, -0.23355368125535872, 0.1261991121016605, -0.16491723595106084, -0.04524575380390793, -0.11385066273784183, -0.0010828077388198478, 0.06584397165975331, -0.3359683253761867, 0.020253346001972324, -0.002691994552783992, 0.05186773352324962, -0.026547096833667676, -0.10725938392722088, 0.07154082764932157, 0.1408660366356818, 0.05722081706778187, 0.010251993179807196, 0.13075612075019466, -0.15935026975348593, -0.14071640907989247, 0.44499708350909795, -0.006465770611944406, -0.2416726557780867, 0.23551787505857646, -0.07130909994973436, -0.19451609555550892, 0.09159636583341205, 0.23392626140266656, 0.11167962431259777, -0.14325638807950664, 0.05140387290612916, -0.016682472339142922, 0.16419167914630278, 0.0018996456233055694, 0.018947509753153374, 0.15401974491289128, 0.23575772110413273, 0.09608598386301942, 0.1751376229085271, -0.059170737004150514, -0.10294424827089128, -0.22881992819678523, -0.11249351612413706, -0.22037076606698658, 0.015822274731877056, -0.08371589466000644, -0.17872198867895034, 0.3343059489260549, 0.1946167546607878, 0.20268376621154502, 0.1293928583436038, 0.34938457536146694, 0.11036744123203275, 0.08225215861533323, 0.15939184827780675, 0.09637414064744244, 0.03502911793715928, 0.1332123006289096, -0.16197725332180118, 0.14239391402705856, -0.030667937725134518]
|
1,803.08122
|
Statistical diagonalization of a random biased Hamiltonian: the case of
the eigenvectors
|
We present a non perturbative calculation technique providing the mixed
moments of the overlaps between the eigenvectors of two large quantum
Hamiltonians: $\hat{H}_0$ and $\hat{H}_0+\hat{W}$, where $\hat{H}_0$ is
deterministic and $\hat{W}$ is random. We apply this method to recover the
second order moments or Local Density Of States in the case of an arbitrary
fixed $\hat{H}_0$ and a Gaussian $\hat{W}$. Then we calculate the fourth order
moments of the overlaps in the same setting. Such quantities are crucial for
understanding the local dynamics of a large composite quantum system. In this
case, $\hat{H}_0$ is the sum of the Hamiltonians of the system subparts and
$\hat{W}$ is an interaction term. We test our predictions with numerical
simulations.
|
quant-ph cond-mat.mes-hall cond-mat.stat-mech
|
we present a non perturbative calculation technique providing the mixed moments of the overlaps between the eigenvectors of two large quantum hamiltonians hath_0 and hath_0hatw where hath_0 is deterministic and hatw is random we apply this method to recover the second order moments or local density of states in the case of an arbitrary fixed hath_0 and a gaussian hatw then we calculate the fourth order moments of the overlaps in the same setting such quantities are crucial for understanding the local dynamics of a large composite quantum system in this case hath_0 is the sum of the hamiltonians of the system subparts and hatw is an interaction term we test our predictions with numerical simulations
|
[['we', 'present', 'a', 'non', 'perturbative', 'calculation', 'technique', 'providing', 'the', 'mixed', 'moments', 'of', 'the', 'overlaps', 'between', 'the', 'eigenvectors', 'of', 'two', 'large', 'quantum', 'hamiltonians', 'hath_0', 'and', 'hath_0hatw', 'where', 'hath_0', 'is', 'deterministic', 'and', 'hatw', 'is', 'random', 'we', 'apply', 'this', 'method', 'to', 'recover', 'the', 'second', 'order', 'moments', 'or', 'local', 'density', 'of', 'states', 'in', 'the', 'case', 'of', 'an', 'arbitrary', 'fixed', 'hath_0', 'and', 'a', 'gaussian', 'hatw', 'then', 'we', 'calculate', 'the', 'fourth', 'order', 'moments', 'of', 'the', 'overlaps', 'in', 'the', 'same', 'setting', 'such', 'quantities', 'are', 'crucial', 'for', 'understanding', 'the', 'local', 'dynamics', 'of', 'a', 'large', 'composite', 'quantum', 'system', 'in', 'this', 'case', 'hath_0', 'is', 'the', 'sum', 'of', 'the', 'hamiltonians', 'of', 'the', 'system', 'subparts', 'and', 'hatw', 'is', 'an', 'interaction', 'term', 'we', 'test', 'our', 'predictions', 'with', 'numerical', 'simulations']]
|
[-0.15585185270756483, 0.11661840354158219, -0.07257725325129602, 0.06474178555502516, 0.009854499422742621, -0.0749822378684969, 0.0030622594281221214, 0.3090543445604651, -0.2549207782453817, -0.26557650988435616, 0.07279163904427348, -0.29383399793068354, -0.12931552784841346, 0.12811449254134102, 0.016930052561118552, 0.06351082274366332, 0.023097539122175912, 0.056971406997383935, -0.09461899203774722, -0.23125312490307767, 0.3315675220978649, 0.025609810970743874, 0.23070220424105292, 0.027049554143424914, 0.08428294175587918, 0.036569869706569155, -0.0029624405397993066, 0.00026377684679692204, -0.10696649843340983, 0.12221350281286741, 0.19717982844702656, 0.05626742093135481, 0.25264793683005415, -0.40002918952023203, -0.14081761067652185, 0.12344611769785052, 0.10320302521728951, 0.17111845904070397, -0.005925596926523291, -0.26928900517118365, 0.07478572918588053, -0.17984135814173066, -0.16200673977297772, -0.12228231969410959, -0.013508665480691453, 0.033361058293477346, -0.3379263257572387, 0.0940437444647693, 0.07139899651317493, 0.03324422939154117, -0.05658489496690099, -0.08982529813226353, 0.017040435605398987, 0.15597656354530837, 0.0028751405239429164, -0.005572070926427841, 0.059610203544244816, -0.11767114372873355, -0.11389655862408488, 0.3865808233294798, -0.0751609144874079, -0.2262311413054071, 0.1650453035071816, -0.14940776256439478, -0.12341457122288968, 0.07563351113956583, 0.15758131061194708, 0.1646891690628684, -0.1276235045581732, 0.11283196173810764, -0.0388108387073178, 0.15980144982104716, -0.006583874514731376, 0.01034037224624468, 0.1651113560828178, 0.11241900775095691, 0.07744138279686803, 0.16176594892192794, -0.0761865164882139, -0.15060279786829714, -0.35103829305457035, -0.1749559294351417, -0.24421050256604085, 0.043787434284129866, -0.10891755623692323, -0.17790362143322178, 0.412037912302691, 0.13824436057804396, 0.19384530935760425, 0.07386020796130532, 0.28072986192191424, 0.17590695705528006, 0.023392746625873057, 0.06478215331090209, 0.20165343129319016, 0.1604988584699838, 0.03051418461027029, -0.2242239711950432, 0.03833329315985674, 0.08981736071569764]
|
1,803.08123
|
An Early Modeling Approach to Digital Electronics
|
An Early modeling approach of transistors characterized by simplicity and
accuracy in representing intrinsic non-linearities is applied to the
characterization of propagation delay and level transition switching properties
of NPN and PNP small signal transistors. Eight types of devices were
considered, each represented by 5 samples taken from the same lot, totaling 20
NPN and 20 PNP transistors. Four switching time measurements were
experimentally obtained, and the transistors also had their Early parameters
$V_a$ (the Early voltage) and $s$ (a proportionality constant such that $R_o =
1/tan(s I_B)$ accurately estimated by using an experimental-numeric procedure
that involves Hough transform accumulation in order to identify the crossing of
the base current ($I_B$) indexed characteristic isolines, yielding the
respective $V_a$. The timing measurements exhibited strong positive Pearson
correlations when taken pairwise. When these measurements were compared
individually to the respective Early parameters, no significant Pearson
correlation was obtained. However, a strong relationship was observed between
the product of the two Early parameters and the ratio between the fall and rise
time. A Pearson correlation coefficient of 0.78 was observed between these
variables in the case of NPN devices. This suggests that transistors with
larger average current gain tend to have more similar rise and fall times. The
different relationship observed for PNP devices (Pearson 0.41) suggests some
intrinsic difference in the way the Early parameters influence the rise and
fall times of small signal transistors.
|
physics.app-ph
|
an early modeling approach of transistors characterized by simplicity and accuracy in representing intrinsic nonlinearities is applied to the characterization of propagation delay and level transition switching properties of npn and pnp small signal transistors eight types of devices were considered each represented by 5 samples taken from the same lot totaling 20 npn and 20 pnp transistors four switching time measurements were experimentally obtained and the transistors also had their early parameters v_a the early voltage and s a proportionality constant such that r_o 1tans i_b accurately estimated by using an experimentalnumeric procedure that involves hough transform accumulation in order to identify the crossing of the base current i_b indexed characteristic isolines yielding the respective v_a the timing measurements exhibited strong positive pearson correlations when taken pairwise when these measurements were compared individually to the respective early parameters no significant pearson correlation was obtained however a strong relationship was observed between the product of the two early parameters and the ratio between the fall and rise time a pearson correlation coefficient of 078 was observed between these variables in the case of npn devices this suggests that transistors with larger average current gain tend to have more similar rise and fall times the different relationship observed for pnp devices pearson 041 suggests some intrinsic difference in the way the early parameters influence the rise and fall times of small signal transistors
|
[['an', 'early', 'modeling', 'approach', 'of', 'transistors', 'characterized', 'by', 'simplicity', 'and', 'accuracy', 'in', 'representing', 'intrinsic', 'nonlinearities', 'is', 'applied', 'to', 'the', 'characterization', 'of', 'propagation', 'delay', 'and', 'level', 'transition', 'switching', 'properties', 'of', 'npn', 'and', 'pnp', 'small', 'signal', 'transistors', 'eight', 'types', 'of', 'devices', 'were', 'considered', 'each', 'represented', 'by', '5', 'samples', 'taken', 'from', 'the', 'same', 'lot', 'totaling', '20', 'npn', 'and', '20', 'pnp', 'transistors', 'four', 'switching', 'time', 'measurements', 'were', 'experimentally', 'obtained', 'and', 'the', 'transistors', 'also', 'had', 'their', 'early', 'parameters', 'v_a', 'the', 'early', 'voltage', 'and', 's', 'a', 'proportionality', 'constant', 'such', 'that', 'r_o', '1tans', 'i_b', 'accurately', 'estimated', 'by', 'using', 'an', 'experimentalnumeric', 'procedure', 'that', 'involves', 'hough', 'transform', 'accumulation', 'in', 'order', 'to', 'identify', 'the', 'crossing', 'of', 'the', 'base', 'current', 'i_b', 'indexed', 'characteristic', 'isolines', 'yielding', 'the', 'respective', 'v_a', 'the', 'timing', 'measurements', 'exhibited', 'strong', 'positive', 'pearson', 'correlations', 'when', 'taken', 'pairwise', 'when', 'these', 'measurements', 'were', 'compared', 'individually', 'to', 'the', 'respective', 'early', 'parameters', 'no', 'significant', 'pearson', 'correlation', 'was', 'obtained', 'however', 'a', 'strong', 'relationship', 'was', 'observed', 'between', 'the', 'product', 'of', 'the', 'two', 'early', 'parameters', 'and', 'the', 'ratio', 'between', 'the', 'fall', 'and', 'rise', 'time', 'a', 'pearson', 'correlation', 'coefficient', 'of', '078', 'was', 'observed', 'between', 'these', 'variables', 'in', 'the', 'case', 'of', 'npn', 'devices', 'this', 'suggests', 'that', 'transistors', 'with', 'larger', 'average', 'current', 'gain', 'tend', 'to', 'have', 'more', 'similar', 'rise', 'and', 'fall', 'times', 'the', 'different', 'relationship', 'observed', 'for', 'pnp', 'devices', 'pearson', '041', 'suggests', 'some', 'intrinsic', 'difference', 'in', 'the', 'way', 'the', 'early', 'parameters', 'influence', 'the', 'rise', 'and', 'fall', 'times', 'of', 'small', 'signal', 'transistors']]
|
[-0.14638083542282085, 0.11067634829454144, -0.046845381948894455, 0.04842457827383086, -0.007857838556494402, -0.19286606801552292, 0.04404240900792344, 0.3935170662143956, -0.22915240757410293, -0.3783496622886995, 0.05594270771126384, -0.29498053589916745, -0.12185111679946599, 0.22524334916480535, -0.018817150503214773, 0.014614859288153441, 0.009187283014635677, -0.0028581786799528027, -0.09534858258785275, -0.2500463676355455, 0.19880852286460932, 0.04499485772204302, 0.32234736781202905, -0.002242128254400323, 0.10088398108137367, -0.029722710310117056, -0.03371833619742614, 0.06988579923813434, -0.10219369800252025, 0.05360168761411763, 0.22490422440206875, 0.04739594867493471, 0.2420649742140718, -0.44380128852537143, -0.16326828739383137, 0.06992705377000992, 0.1110324990550947, 0.036338789819780254, -0.01572775338787798, -0.26868361567410276, 0.08120119025647317, -0.14057972686284262, -0.03754011145065306, 0.021586986641278085, 0.09920752787476649, 0.03913137286688889, -0.23216518702633354, 0.10557483921685439, 0.033228850509444983, 0.06160706135889758, -0.0680829299152601, -0.16981997522221798, -0.012024639285695941, 0.1534372768824181, 0.048448314528871814, 0.014001698814378039, 0.14952267767335087, -0.09635121308307609, -0.08690771010512, 0.31386402063881574, -0.06976649877665889, -0.1264513893386997, 0.16765194188185928, -0.17318778996312809, -0.05271252921944403, 0.15353420442881305, 0.13594501804884362, 0.06741915359364256, -0.14491554446703167, 0.02016602407320929, 0.038923913795177054, 0.18196898658314478, 0.11872671194698499, 0.04919766927411294, 0.199320729708542, 0.13577598999254406, 0.006307554019250624, 0.09312220584479687, -0.12968088016723808, -0.03509962171640085, -0.23955701025121887, -0.1352026601888887, -0.14030011419723135, 0.10567957657166635, -0.15155245414061938, -0.13193356216146165, 0.41833016296200776, 0.13698546032461784, 0.22838488353983216, 0.0379432884864914, 0.2528731543499895, 0.15718046801681024, 0.10936161752071474, 0.016641390260875872, 0.26593475006584016, 0.14322099242480876, 0.09529576771285223, -0.21691453872278899, 0.14748365057723434, -0.03173340613670323]
|
1,803.08124
|
Photonic waveguide mode to free-space Gaussian beam extreme mode
converter
|
Integration of photonic chips with atomic, micromechanical, chemical and
biological systems can advance science and open many possibilities in
chip-scale devices and technology. Compact photonic structures for direct
coupling of light between high-index single-mode waveguides and arbitrary
free-space modes spanning hundreds of waves in cross-section would eliminate
bulky optical components and enable integration of photonics into many new
applications requiring wide beams, structured light and centimeter-scale
propagation distances with low diffraction-limited losses. Conventional
fiber-coupling approaches do not scale well for accurate, low-loss coupling
across the extremely large mode scale mismatch ($\approx10^6$ times in modal
area). Here we present an extreme mode converter that can transform the
photonic waveguide mode to the diffraction-limited, free-space Gaussian beam,
with a beam waist of about $160~\mu$m. Using two identical converters, we
demonstrate a grating-to-grating coupling that couples the radiating beam back
to the chip through a mirror reflection in free-space. Operating at 780~nm for
integration with chip-scale atomic vapor cell cavities, our design can be
adapted for visible, telecommunication or other wavelengths. Furthermore, other
types of beams can be implemented by using the 2-stage expansion approach
presented in this paper.
|
physics.app-ph physics.optics
|
integration of photonic chips with atomic micromechanical chemical and biological systems can advance science and open many possibilities in chipscale devices and technology compact photonic structures for direct coupling of light between highindex singlemode waveguides and arbitrary freespace modes spanning hundreds of waves in crosssection would eliminate bulky optical components and enable integration of photonics into many new applications requiring wide beams structured light and centimeterscale propagation distances with low diffractionlimited losses conventional fibercoupling approaches do not scale well for accurate lowloss coupling across the extremely large mode scale mismatch approx106 times in modal area here we present an extreme mode converter that can transform the photonic waveguide mode to the diffractionlimited freespace gaussian beam with a beam waist of about 160mum using two identical converters we demonstrate a gratingtograting coupling that couples the radiating beam back to the chip through a mirror reflection in freespace operating at 780nm for integration with chipscale atomic vapor cell cavities our design can be adapted for visible telecommunication or other wavelengths furthermore other types of beams can be implemented by using the 2stage expansion approach presented in this paper
|
[['integration', 'of', 'photonic', 'chips', 'with', 'atomic', 'micromechanical', 'chemical', 'and', 'biological', 'systems', 'can', 'advance', 'science', 'and', 'open', 'many', 'possibilities', 'in', 'chipscale', 'devices', 'and', 'technology', 'compact', 'photonic', 'structures', 'for', 'direct', 'coupling', 'of', 'light', 'between', 'highindex', 'singlemode', 'waveguides', 'and', 'arbitrary', 'freespace', 'modes', 'spanning', 'hundreds', 'of', 'waves', 'in', 'crosssection', 'would', 'eliminate', 'bulky', 'optical', 'components', 'and', 'enable', 'integration', 'of', 'photonics', 'into', 'many', 'new', 'applications', 'requiring', 'wide', 'beams', 'structured', 'light', 'and', 'centimeterscale', 'propagation', 'distances', 'with', 'low', 'diffractionlimited', 'losses', 'conventional', 'fibercoupling', 'approaches', 'do', 'not', 'scale', 'well', 'for', 'accurate', 'lowloss', 'coupling', 'across', 'the', 'extremely', 'large', 'mode', 'scale', 'mismatch', 'approx106', 'times', 'in', 'modal', 'area', 'here', 'we', 'present', 'an', 'extreme', 'mode', 'converter', 'that', 'can', 'transform', 'the', 'photonic', 'waveguide', 'mode', 'to', 'the', 'diffractionlimited', 'freespace', 'gaussian', 'beam', 'with', 'a', 'beam', 'waist', 'of', 'about', '160mum', 'using', 'two', 'identical', 'converters', 'we', 'demonstrate', 'a', 'gratingtograting', 'coupling', 'that', 'couples', 'the', 'radiating', 'beam', 'back', 'to', 'the', 'chip', 'through', 'a', 'mirror', 'reflection', 'in', 'freespace', 'operating', 'at', '780nm', 'for', 'integration', 'with', 'chipscale', 'atomic', 'vapor', 'cell', 'cavities', 'our', 'design', 'can', 'be', 'adapted', 'for', 'visible', 'telecommunication', 'or', 'other', 'wavelengths', 'furthermore', 'other', 'types', 'of', 'beams', 'can', 'be', 'implemented', 'by', 'using', 'the', '2stage', 'expansion', 'approach', 'presented', 'in', 'this', 'paper']]
|
[-0.14199484131835483, 0.19182340774639908, -0.0314408336669895, -0.055002387598506175, -0.0744820023967844, -0.21195761890798484, 0.016088460983946392, 0.5179043515868809, -0.2531869797296721, -0.3024627474723789, 0.08186564303152567, -0.24707308085635304, -0.08161942135690048, 0.29972630438493547, -0.01955212269398465, 0.11938409046674876, 0.059575393497336496, -0.118579950308903, -0.003218636731142634, -0.12192936825490704, 0.23064133708628462, 0.04725023630485141, 0.34747302054893225, 0.046981133381410946, 0.13365113147807753, 0.009380061083230312, 0.03400400467976199, -0.0768200262948243, -0.05746463687026572, 0.15878768957538894, 0.2986687742674764, 0.03246525786412151, 0.24920654610690215, -0.4915238309084721, -0.2467171368189156, 0.055800263138498056, 0.19346676810907767, 0.1222713322368572, -0.06190955616488202, -0.26031959598944726, 0.006101870089364441, -0.1345701852350549, -0.165205356193521, -0.044865227883944855, -0.047826199142550846, 0.03704572049647813, -0.226270897144391, -0.03012722373545251, -0.015492557510657682, 0.058521797822322696, 0.0042247109980488185, -0.0648126499360407, 0.026265743687121278, 0.05556532621014175, -0.10523252707966806, -0.03536420742507882, 0.1720664964203657, -0.09340136969188714, -0.1209035587235121, 0.39735485923112085, -0.06698221279530907, -0.14773862067174734, 0.19340031592899165, -0.13129582068596274, 0.000198677291969627, 0.1643944581560588, 0.23433480200195766, 0.060217488041456345, -0.1265144659580825, 0.011646883771786435, 0.060172527643811445, 0.232621785494342, 0.19450129101270527, 0.16234987946486595, 0.2497467861849936, 0.21105504175648093, 0.02930601612305232, 0.1309689604114164, -0.11968114874933077, -0.0227794017789521, -0.26313762847617594, -0.1597738476910941, -0.16124395315384152, 0.03361697863408114, -0.09000661240197191, -0.14345938805364195, 0.3505479235242566, 0.12199434826059428, 0.09720895627169343, -0.0158648091096636, 0.3826053904916119, 0.07055804716187793, 0.16154700431291966, 0.017768139981300286, 0.30472532207773917, 0.14402502570326603, 0.13402797072953748, -0.18560142358562545, -0.07765758596740299, -0.07661973308827526]
|
1,803.08125
|
Dimensionally regularized Tsallis' Statistical Mechanics and two-body
Newton's gravitation
|
Typical Tsallis' statistical mechanics' quantifiers like the partition
function and the mean energy exhibit poles. We are speaking of the partition
function ${\cal Z}$ and the mean energy $<{\cal U}>$. The poles appear for
distinctive values of Tsallis' characteristic real parameter $q$, at a
numerable set of rational numbers of the $q-$line. These poles are dealt with
dimensional regularization resources. The physical effects of these poles on
the specific heats are studied here for the two-body classical gravitation
potential.
|
cond-mat.stat-mech
|
typical tsallis statistical mechanics quantifiers like the partition function and the mean energy exhibit poles we are speaking of the partition function cal z and the mean energy cal u the poles appear for distinctive values of tsallis characteristic real parameter q at a numerable set of rational numbers of the qline these poles are dealt with dimensional regularization resources the physical effects of these poles on the specific heats are studied here for the twobody classical gravitation potential
|
[['typical', 'tsallis', 'statistical', 'mechanics', 'quantifiers', 'like', 'the', 'partition', 'function', 'and', 'the', 'mean', 'energy', 'exhibit', 'poles', 'we', 'are', 'speaking', 'of', 'the', 'partition', 'function', 'cal', 'z', 'and', 'the', 'mean', 'energy', 'cal', 'u', 'the', 'poles', 'appear', 'for', 'distinctive', 'values', 'of', 'tsallis', 'characteristic', 'real', 'parameter', 'q', 'at', 'a', 'numerable', 'set', 'of', 'rational', 'numbers', 'of', 'the', 'qline', 'these', 'poles', 'are', 'dealt', 'with', 'dimensional', 'regularization', 'resources', 'the', 'physical', 'effects', 'of', 'these', 'poles', 'on', 'the', 'specific', 'heats', 'are', 'studied', 'here', 'for', 'the', 'twobody', 'classical', 'gravitation', 'potential']]
|
[-0.1539642419666052, 0.15266019374108578, -0.09551927592911863, 0.1338661507573686, -0.051856834535734565, -0.13332608483047992, 0.01222418055315561, 0.2958326571255545, -0.26035427905713454, -0.26600230980334405, -0.006859410984833619, -0.32131339960931976, -0.10963855178060034, 0.14717520266488382, -0.019745849833316818, 0.09575755258044376, -0.02022733554078997, 0.12134843156967737, -0.08199138990072888, -0.21984207283564006, 0.3499974830052521, -0.01885081133274715, 0.1683618230568363, 0.05369143751214105, 0.07434076715637988, -0.01589852205442288, 0.007887621486818866, 0.011779398504125922, -0.16926491824037668, 0.06599945796630051, 0.213126636239924, 0.09543962243802939, 0.2605304944835886, -0.3690722507153508, -0.19512895649133982, 0.15130211369877186, 0.12754881581810268, -0.024034165152454677, 0.04537438459051891, -0.2112353692609298, 0.01247029714993661, -0.14655863767772725, -0.17037561410872998, -0.09078253070010414, 0.06146440543588015, 0.06742079734000601, -0.27352088191723334, 0.13346533412762174, -0.0008640682333608783, 0.099694395178481, -0.0473845586286787, -0.23415368247211357, -0.052585062455928214, 0.06097570550333284, 0.05156021862279011, 0.04019652493887498, 0.17398587199918267, -0.16519423460566124, -0.08032133493313118, 0.3529919853221767, 0.023925506427318236, -0.2366735650745185, 0.15801403472565492, -0.20971377807539665, -0.1245752306348538, 0.1294193538377368, 0.13498682731945255, 0.11592914971900231, -0.08814811156591094, 0.16102651954492955, -0.027271642667960515, 0.09476656813021231, 0.10536522111749347, 0.08032656631939396, 0.22027356743435317, 0.030343756480496142, -0.05006557668830398, 0.1074816961654851, -0.045194000757264, -0.1589977457836459, -0.3801982184412264, -0.12100079927970714, -0.19208233177520428, 0.06608238757316824, -0.1437486858822588, -0.19550601811490104, 0.3859377251112763, 0.08269055479643071, 0.20211146955814543, 0.09519224209545911, 0.24065118664993515, 0.19166799377568236, 0.080033735106876, 0.05073662935034077, 0.2021171275431974, 0.12034612121296269, 0.051840886290927854, -0.2223776571417251, -0.022746010642952605, 0.09739697705129091]
|
1,803.08126
|
Non-extensive statistical mechanics of a self-gravitating gas
|
The statistical mechanics of a cloud of particles interacting via their
gravitational potentials is an old problem which encounters some issues when
the traditional Boltzmann-Gibbs statistics is applied. In this article, we
consider the generalized statistics of Tsallis and analyze the statistical and
thermodynamical implications for a self-gravitating gas, obtaining analytical
and convergent expressions for the equation of state and specific heat in the
canonical as well as microcanonical ensembles. Although our results are
comparable in both ensembles, it turns out that only in the canonical case the
thermodynamic quantities depend explicitly on the non-extensivity parameter,
indicating that the question of ensemble equivalence for Tsallis statistics
must be further reviewed.
|
cond-mat.stat-mech astro-ph.GA cond-mat.quant-gas
|
the statistical mechanics of a cloud of particles interacting via their gravitational potentials is an old problem which encounters some issues when the traditional boltzmanngibbs statistics is applied in this article we consider the generalized statistics of tsallis and analyze the statistical and thermodynamical implications for a selfgravitating gas obtaining analytical and convergent expressions for the equation of state and specific heat in the canonical as well as microcanonical ensembles although our results are comparable in both ensembles it turns out that only in the canonical case the thermodynamic quantities depend explicitly on the nonextensivity parameter indicating that the question of ensemble equivalence for tsallis statistics must be further reviewed
|
[['the', 'statistical', 'mechanics', 'of', 'a', 'cloud', 'of', 'particles', 'interacting', 'via', 'their', 'gravitational', 'potentials', 'is', 'an', 'old', 'problem', 'which', 'encounters', 'some', 'issues', 'when', 'the', 'traditional', 'boltzmanngibbs', 'statistics', 'is', 'applied', 'in', 'this', 'article', 'we', 'consider', 'the', 'generalized', 'statistics', 'of', 'tsallis', 'and', 'analyze', 'the', 'statistical', 'and', 'thermodynamical', 'implications', 'for', 'a', 'selfgravitating', 'gas', 'obtaining', 'analytical', 'and', 'convergent', 'expressions', 'for', 'the', 'equation', 'of', 'state', 'and', 'specific', 'heat', 'in', 'the', 'canonical', 'as', 'well', 'as', 'microcanonical', 'ensembles', 'although', 'our', 'results', 'are', 'comparable', 'in', 'both', 'ensembles', 'it', 'turns', 'out', 'that', 'only', 'in', 'the', 'canonical', 'case', 'the', 'thermodynamic', 'quantities', 'depend', 'explicitly', 'on', 'the', 'nonextensivity', 'parameter', 'indicating', 'that', 'the', 'question', 'of', 'ensemble', 'equivalence', 'for', 'tsallis', 'statistics', 'must', 'be', 'further', 'reviewed']]
|
[-0.05984000279621052, 0.14858426049640086, -0.1362190830796449, 0.13777486592721702, -0.0016616117039864715, -0.11634709806266157, 0.03655489113589283, 0.2855060161684047, -0.24687363844132051, -0.26238852187313816, 0.054187874009155416, -0.30130698725009675, -0.10924610797612166, 0.20540818668563257, -0.034030306322330776, 0.09311372626742179, 0.06047488720240918, 0.0736507968638431, -0.09810131530446763, -0.22913088537964293, 0.3533492902082137, 0.10738090606385164, 0.27957770353691147, 0.04479817006927492, 0.09032134925523265, -0.020565214711876417, 0.001352800941094756, 0.05290765572677959, -0.14637253610695056, 0.05305818457960744, 0.22267820389772003, 0.1294269733596593, 0.2533685376020995, -0.3869445070963014, -0.2523028764365749, 0.13723508606834167, 0.17062803349796343, 0.09534904954171824, -0.005831049819773232, -0.24437609863340515, 0.008766308877437207, -0.19888472316617314, -0.1317600939380513, -0.12722366899939846, 0.02658393524417823, 0.07552411214194514, -0.23508813934062014, 0.14857649927620184, 0.08584960832324048, 0.05931176859885454, -0.06800979154861786, -0.12220459730279716, 0.0234206484884701, 0.08727274053142703, 0.05320890746608546, -0.03585242615928027, 0.1738666709851135, -0.1504668291298334, -0.06558468305474062, 0.4164374870332805, 0.001117542261173102, -0.2550926381002434, 0.16630775170951065, -0.12192915832962502, -0.18729718079028482, 0.04333008451556618, 0.10385604466904294, 0.12351009470188398, -0.18444474524757506, 0.08462457939749583, -0.03682086585428227, 0.12579852692274884, 0.04198924963023852, 0.018599434637210584, 0.24763467618772253, 0.0889640487222509, -0.01752026660092683, 0.17583983690499075, -0.03130759564863349, -0.22364012986760248, -0.3093660084530711, -0.17378516236150807, -0.2150430739687925, 0.06766805031167512, -0.1184820074794433, -0.16344587040895767, 0.34458116130395366, 0.18751950284945038, 0.18314698662778192, 0.05259235158710825, 0.25783704846081407, 0.1451202102026648, -0.028129780066030268, 0.07141855984756892, 0.2574754857810066, 0.16938087926669554, 0.09704607949084179, -0.22411432855508545, 0.01728862036940303, 0.054106827706775884]
|
1,803.08127
|
Spectral Statistics of Non-Hermitian Random Matrix Ensembles
|
Recently Burkhardt et. al. introduced the $k$-checkerboard random matrix
ensembles, which have a split limiting behavior of the eigenvalues (in the
limit all but $k$ of the eigenvalues are on the order of $\sqrt{N}$ and
converge to semi-circular behavior, with the remaining $k$ of size $N$ and
converging to hollow Gaussian ensembles). We generalize their work to consider
non-Hermitian ensembles with complex eigenvalues; instead of a blip new
behavior is seen, ranging from multiple satellites to annular rings. These
results are based on moment method techniques adapted to the complex plane as
well as analysis of singular values, and we further isolate the singular value
joint density formula for the Complex Symmetric Gaussian Ensemble.
|
math-ph math.MP
|
recently burkhardt et al introduced the kcheckerboard random matrix ensembles which have a split limiting behavior of the eigenvalues in the limit all but k of the eigenvalues are on the order of sqrtn and converge to semicircular behavior with the remaining k of size n and converging to hollow gaussian ensembles we generalize their work to consider nonhermitian ensembles with complex eigenvalues instead of a blip new behavior is seen ranging from multiple satellites to annular rings these results are based on moment method techniques adapted to the complex plane as well as analysis of singular values and we further isolate the singular value joint density formula for the complex symmetric gaussian ensemble
|
[['recently', 'burkhardt', 'et', 'al', 'introduced', 'the', 'kcheckerboard', 'random', 'matrix', 'ensembles', 'which', 'have', 'a', 'split', 'limiting', 'behavior', 'of', 'the', 'eigenvalues', 'in', 'the', 'limit', 'all', 'but', 'k', 'of', 'the', 'eigenvalues', 'are', 'on', 'the', 'order', 'of', 'sqrtn', 'and', 'converge', 'to', 'semicircular', 'behavior', 'with', 'the', 'remaining', 'k', 'of', 'size', 'n', 'and', 'converging', 'to', 'hollow', 'gaussian', 'ensembles', 'we', 'generalize', 'their', 'work', 'to', 'consider', 'nonhermitian', 'ensembles', 'with', 'complex', 'eigenvalues', 'instead', 'of', 'a', 'blip', 'new', 'behavior', 'is', 'seen', 'ranging', 'from', 'multiple', 'satellites', 'to', 'annular', 'rings', 'these', 'results', 'are', 'based', 'on', 'moment', 'method', 'techniques', 'adapted', 'to', 'the', 'complex', 'plane', 'as', 'well', 'as', 'analysis', 'of', 'singular', 'values', 'and', 'we', 'further', 'isolate', 'the', 'singular', 'value', 'joint', 'density', 'formula', 'for', 'the', 'complex', 'symmetric', 'gaussian', 'ensemble']]
|
[-0.08720632796423032, 0.11888719390072258, -0.08161754142163338, 0.012135429461321802, -0.04065032538636464, -0.11693781840128709, 0.01978897592887299, 0.36074674909571763, -0.2184033363694902, -0.2819669968984296, 0.08844899979061488, -0.29384999567296655, -0.17110441083220385, 0.15868969738846067, -0.02917868447741411, 0.11006872970273458, 0.02247495344732847, 0.04471819634952137, -0.08846354946510586, -0.23924359056348624, 0.32768435262563944, 0.03860716164097668, 0.25149594521998897, -0.02481535491863249, 0.04061925290070013, 0.023599735819693424, 0.00015859770283630463, 0.010793258857385841, -0.11635699260782088, 0.12890814855464, 0.23320291436944915, 0.06434077481055155, 0.23067981927795747, -0.3839637276972026, -0.19543382916929183, 0.1517774073357603, 0.15292886407238193, 0.06964076410430953, 0.03647629686515877, -0.2837180479870598, 0.10368572243703611, -0.1285545668560616, -0.2126505889608401, -0.09129415365323358, 0.012568326090025691, 0.06731586475378579, -0.2958734154338594, 0.07218208804776051, 0.10245122163931518, 0.035204058463594555, 0.0017141750828255859, -0.1801967169858713, 0.03606342142695083, 0.12110770286876807, 0.021698365524716146, -0.04604162234994295, 0.12744796338318065, -0.041849920215019216, -0.09167423539661568, 0.34123563211394753, -0.052281091051522344, -0.17580615001755345, 0.17359922464681476, -0.142686751926631, -0.12062536702961126, 0.1289462708760943, 0.18457323602046324, 0.14013312975422734, -0.08849591600288333, 0.10990669216962728, -0.08192336666954071, 0.10186791924586668, 0.12470627620618428, 0.011280091817334163, 0.1645236644992786, 0.06568421461347458, 0.0789841629288662, 0.12625850343755324, -0.08696780016077106, -0.16574918480221165, -0.23457862917525463, -0.11195554187422437, -0.24039779065910363, 0.09818567609027094, -0.10236043424463513, -0.2244017311841645, 0.3746105877402346, 0.11200344388731714, 0.30454380921524976, 0.08557911041765515, 0.24854683448494602, 0.13856653052596457, 0.03765433673763367, 0.06713597926896363, 0.1543566897579477, 0.20952265441780332, 0.0715387258266585, -0.17960562918487671, -0.010065245301981943, 0.0733899156402269]
|
1,803.08128
|
Modeling cure fraction with frailty term in latent risk: a Bayesian
approach
|
In this paper, we propose a flexible cure rate model with frailty term in
latent risk, which is obtained by incorporating a frailty term in risk function
of latent competing causes. The number of competing causes of the event of
interest follows negative binomial distribution and the frailty variable
follows power variance function distribution, in which includes other frailty
models such as gamma, positive stable and inverse Gaussian frailty models as
special cases. The proposed model takes into account the presence of covariates
and right-censored survival data suitable for populations with a cure rate.
Besides, it allows quantifying the degree of unobserved heterogeneity induced
by unobservable risk factors, in which is important to explain the survival
time. Once the posterior distribution has not close form, Markov chain Monte
Carlo simulations are considered for estimation procedure. We performed several
simulation studies and the practical relevance of the proposed model is
demonstrated in a real data set.
|
stat.AP
|
in this paper we propose a flexible cure rate model with frailty term in latent risk which is obtained by incorporating a frailty term in risk function of latent competing causes the number of competing causes of the event of interest follows negative binomial distribution and the frailty variable follows power variance function distribution in which includes other frailty models such as gamma positive stable and inverse gaussian frailty models as special cases the proposed model takes into account the presence of covariates and rightcensored survival data suitable for populations with a cure rate besides it allows quantifying the degree of unobserved heterogeneity induced by unobservable risk factors in which is important to explain the survival time once the posterior distribution has not close form markov chain monte carlo simulations are considered for estimation procedure we performed several simulation studies and the practical relevance of the proposed model is demonstrated in a real data set
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'flexible', 'cure', 'rate', 'model', 'with', 'frailty', 'term', 'in', 'latent', 'risk', 'which', 'is', 'obtained', 'by', 'incorporating', 'a', 'frailty', 'term', 'in', 'risk', 'function', 'of', 'latent', 'competing', 'causes', 'the', 'number', 'of', 'competing', 'causes', 'of', 'the', 'event', 'of', 'interest', 'follows', 'negative', 'binomial', 'distribution', 'and', 'the', 'frailty', 'variable', 'follows', 'power', 'variance', 'function', 'distribution', 'in', 'which', 'includes', 'other', 'frailty', 'models', 'such', 'as', 'gamma', 'positive', 'stable', 'and', 'inverse', 'gaussian', 'frailty', 'models', 'as', 'special', 'cases', 'the', 'proposed', 'model', 'takes', 'into', 'account', 'the', 'presence', 'of', 'covariates', 'and', 'rightcensored', 'survival', 'data', 'suitable', 'for', 'populations', 'with', 'a', 'cure', 'rate', 'besides', 'it', 'allows', 'quantifying', 'the', 'degree', 'of', 'unobserved', 'heterogeneity', 'induced', 'by', 'unobservable', 'risk', 'factors', 'in', 'which', 'is', 'important', 'to', 'explain', 'the', 'survival', 'time', 'once', 'the', 'posterior', 'distribution', 'has', 'not', 'close', 'form', 'markov', 'chain', 'monte', 'carlo', 'simulations', 'are', 'considered', 'for', 'estimation', 'procedure', 'we', 'performed', 'several', 'simulation', 'studies', 'and', 'the', 'practical', 'relevance', 'of', 'the', 'proposed', 'model', 'is', 'demonstrated', 'in', 'a', 'real', 'data', 'set']]
|
[-0.05743258504737769, 0.08815233145029314, -0.06977729227754377, 0.14361502485605138, -0.0709509786548874, -0.16874518009323267, 0.054829620605995576, 0.3811563783114956, -0.25380743295254726, -0.27542118907215135, 0.09273054578281459, -0.26261788305325146, -0.1503495013761905, 0.16108333785237083, -0.07164068278826533, 0.08498092081638113, 0.040549189529772246, 0.020156222431650085, 0.02287107524762471, -0.24764499063453366, 0.299885423579103, 0.10837297085522403, 0.29800974083763937, -0.008161992793001475, 0.12751916617064948, 0.0532264866986342, -0.08147546332629939, 0.009799931921717813, -0.11474813181820566, 0.06214844110617114, 0.2561638166187725, 0.1633695959053453, 0.3541314842479844, -0.3760446998215611, -0.30786842804762626, 0.17801496110736362, 0.11348969745750148, 0.06268459153192628, -0.01991273720989064, -0.2481078060644288, -0.003978275168206423, -0.23103169153468878, -0.11784844612101875, -0.09159109657329897, -0.007549729775036535, 0.022289422073311384, -0.36134612162206925, 0.16128344023600222, 0.04153918861862152, 0.033047328402678815, -0.05638701335955111, -0.1791136379263574, -0.014828105527727354, 0.10694000948475854, 0.16306730715948486, -0.010735338865478913, 0.10968487231631673, -0.1253237763494854, -0.11166197044714804, 0.32713903897111457, -0.06732363718967405, -0.2309923997899938, 0.1351584814128376, -0.1306732121374338, -0.14555115751441447, 0.12398775090508524, 0.20881077048759306, 0.06821351971236929, -0.19287845963206623, 0.057331731030717495, -0.0029841135894399014, 0.12433086383126436, -0.016479797162596257, -0.037853333654422915, 0.16015819983196355, 0.19571494192125335, 0.006340446986348158, 0.16436308198495797, -0.13976096598761936, -0.1588078438544706, -0.2932106681829018, -0.12092669432562204, -0.1817654986355093, 0.0064636578919523725, -0.14555495381618158, -0.1975905751088454, 0.39461292522178304, 0.1733533863043997, 0.21034008068363033, 0.08165200387292933, 0.27601826593820605, 0.1412285076582902, 0.051501863586506054, 0.03996770641646318, 0.11273961838094458, 0.09367905167201834, -0.008379631886078466, -0.18985938792297197, 0.24386532994497928, -0.0057150986150748305]
|
1,803.08129
|
Analysis of Student Satisfaction Toward Quality of Service Facility
|
The development of higher education is very rapid rise to the tight
competition both public universities and private colleges. XYZ University
realized to win the competition, required continuous quality improvement,
including the quality of existing service facilities. Amenities quality
services is believed to support the success of the learning activities and
improve user satisfaction. This study aims to determine the extent to which the
quality of the services effect on user satisfaction. The research method used
is survey-based questionnaire that measure perception and expectation. The
results showed a gap between perception and expectations of the respondents
have a negative value for each item. This means XYZ service facility at the
university is not currently meet the expectations of society members. Three
service facility that has the lowest index is based on the perception of
respondents is a laboratory (2.56), computer and multimedia (2.63) as well as
wifi network (2.99). The magnitude of the correlation between satisfaction with
the quality of service facilities is 0.725 which means a strong and positive
relationship. The influence of the quality of service facilities to the
satisfaction of the students is 0.525 meaning that the variable quality of the
services facility can explain 52.5% of the variable satisfaction. The study
provided recommendations for improvements to enhance the quality of services
facility at the XYZ university facilities.
|
physics.ed-ph
|
the development of higher education is very rapid rise to the tight competition both public universities and private colleges xyz university realized to win the competition required continuous quality improvement including the quality of existing service facilities amenities quality services is believed to support the success of the learning activities and improve user satisfaction this study aims to determine the extent to which the quality of the services effect on user satisfaction the research method used is surveybased questionnaire that measure perception and expectation the results showed a gap between perception and expectations of the respondents have a negative value for each item this means xyz service facility at the university is not currently meet the expectations of society members three service facility that has the lowest index is based on the perception of respondents is a laboratory 256 computer and multimedia 263 as well as wifi network 299 the magnitude of the correlation between satisfaction with the quality of service facilities is 0725 which means a strong and positive relationship the influence of the quality of service facilities to the satisfaction of the students is 0525 meaning that the variable quality of the services facility can explain 525 of the variable satisfaction the study provided recommendations for improvements to enhance the quality of services facility at the xyz university facilities
|
[['the', 'development', 'of', 'higher', 'education', 'is', 'very', 'rapid', 'rise', 'to', 'the', 'tight', 'competition', 'both', 'public', 'universities', 'and', 'private', 'colleges', 'xyz', 'university', 'realized', 'to', 'win', 'the', 'competition', 'required', 'continuous', 'quality', 'improvement', 'including', 'the', 'quality', 'of', 'existing', 'service', 'facilities', 'amenities', 'quality', 'services', 'is', 'believed', 'to', 'support', 'the', 'success', 'of', 'the', 'learning', 'activities', 'and', 'improve', 'user', 'satisfaction', 'this', 'study', 'aims', 'to', 'determine', 'the', 'extent', 'to', 'which', 'the', 'quality', 'of', 'the', 'services', 'effect', 'on', 'user', 'satisfaction', 'the', 'research', 'method', 'used', 'is', 'surveybased', 'questionnaire', 'that', 'measure', 'perception', 'and', 'expectation', 'the', 'results', 'showed', 'a', 'gap', 'between', 'perception', 'and', 'expectations', 'of', 'the', 'respondents', 'have', 'a', 'negative', 'value', 'for', 'each', 'item', 'this', 'means', 'xyz', 'service', 'facility', 'at', 'the', 'university', 'is', 'not', 'currently', 'meet', 'the', 'expectations', 'of', 'society', 'members', 'three', 'service', 'facility', 'that', 'has', 'the', 'lowest', 'index', 'is', 'based', 'on', 'the', 'perception', 'of', 'respondents', 'is', 'a', 'laboratory', '256', 'computer', 'and', 'multimedia', '263', 'as', 'well', 'as', 'wifi', 'network', '299', 'the', 'magnitude', 'of', 'the', 'correlation', 'between', 'satisfaction', 'with', 'the', 'quality', 'of', 'service', 'facilities', 'is', '0725', 'which', 'means', 'a', 'strong', 'and', 'positive', 'relationship', 'the', 'influence', 'of', 'the', 'quality', 'of', 'service', 'facilities', 'to', 'the', 'satisfaction', 'of', 'the', 'students', 'is', '0525', 'meaning', 'that', 'the', 'variable', 'quality', 'of', 'the', 'services', 'facility', 'can', 'explain', '525', 'of', 'the', 'variable', 'satisfaction', 'the', 'study', 'provided', 'recommendations', 'for', 'improvements', 'to', 'enhance', 'the', 'quality', 'of', 'services', 'facility', 'at', 'the', 'xyz', 'university', 'facilities']]
|
[-0.11044755817429959, 0.044214243934767916, -0.05640317244472075, 0.07299402924949867, -0.13411754588027616, -0.12972825729789642, 0.12182759366849463, 0.40680900944304144, -0.2037257119571807, -0.3794492398718176, 0.08821779572965202, -0.33053008756891095, -0.05424836209060717, 0.17374781649812585, -0.10168411605043244, 0.05732136536642437, 0.0518823385647418, 0.07221294099694682, -0.011550667838981519, -0.337879679155772, 0.27368054912442435, 0.10670541769222301, 0.3973370909825709, 0.11338601426571203, 0.06199014307857318, -0.011828518222924743, -0.025573444710749443, -0.027734401450403946, -0.08917147351641022, 0.15594052445413165, 0.33168999972538304, 0.23897546831501554, 0.37649667800753905, -0.33463957167664604, -0.11731569685581313, 0.05248227184511957, 0.05722360038809579, -0.027664574244527392, -0.030371093638957694, -0.31976900662493585, 0.05484800014330909, -0.21615215346145517, -0.09985013685623242, -0.007467047572641621, -0.012456456671270849, 0.05565225606156319, -0.29340484535439587, -0.03736643916695501, -0.04140871667726665, 0.1169144040146396, -0.05644819602302836, -0.12922705079079078, 0.0053204310211412, 0.22889688089953492, 0.06560011781337018, 0.06606374413319716, 0.13349500127669794, -0.19572922015115957, -0.16342266452603033, 0.439382527647245, -0.025353592098795924, -0.10182404549522704, 0.18825224267710758, -0.14160778449228817, -0.14703706625166318, 0.09436932395368275, 0.2227599097192456, 0.01929936109203424, -0.18429870358605055, 0.014809953224238396, -0.02402185659425763, 0.1958811659054047, 0.06230696424003269, 0.03495608867942545, 0.2103225781363161, 0.18714316920019114, 0.10039343797323627, 0.09430366701539185, -0.015079100670533179, -0.04791993692062155, -0.21485479809796834, -0.16366031068183348, -0.16308381195376076, 0.004300314647620185, -0.0639021807457942, -0.11049342243742552, 0.394032339959477, 0.16263769401818917, 0.09852839192392397, 0.033938079814287536, 0.29593839775560193, 0.06685140497068036, 0.07926480697175041, 0.06043856808909413, 0.2010354447195399, 0.012952512223905635, 0.2025427103455587, -0.2019796207193201, 0.15363160861715067, 0.00684628596005759]
|
1,803.0813
|
Non-Markovian quantum-classical ratchet for ultrafast long-range
electron-hole separation in condensed phases
|
In organic photovoltaic systems, a photogenerated molecular exciton in the
donor domain dissociates into a hole and an electron at the donor/acceptor
heterojunction, and subsequently separate into free charge carriers that can be
extracted as photocurrents. The recombination of the once-separated electron
and hole is a major loss mechanism in photovoltaic systems, which controls
their performance. Hence, efficient photovoltaic systems need built-in ratchet
mechanisms, namely, ultrafast charge separation and retarded charge
recombination. In order to obtain insight into the internal working of the
experimentally observed ultrafast long-range charge separation and protection
against charge recombination, we theoretically investigate a potential ratchet
mechanism arising from the combination of quantum delocalization and its
destruction by performing numerically accurate quantum-dynamics calculations on
a model system. It is demonstrated that the non-Markovian effect originating
from the slow polaron formation strongly suppresses the electron transfer
reaction back to the interfacial charge-transfer state stabilized at the
donor/accepter interface and that it plays a critical role in maintaining the
long-range electron--hole separation.
|
cond-mat.mes-hall physics.app-ph quant-ph
|
in organic photovoltaic systems a photogenerated molecular exciton in the donor domain dissociates into a hole and an electron at the donoracceptor heterojunction and subsequently separate into free charge carriers that can be extracted as photocurrents the recombination of the onceseparated electron and hole is a major loss mechanism in photovoltaic systems which controls their performance hence efficient photovoltaic systems need builtin ratchet mechanisms namely ultrafast charge separation and retarded charge recombination in order to obtain insight into the internal working of the experimentally observed ultrafast longrange charge separation and protection against charge recombination we theoretically investigate a potential ratchet mechanism arising from the combination of quantum delocalization and its destruction by performing numerically accurate quantumdynamics calculations on a model system it is demonstrated that the nonmarkovian effect originating from the slow polaron formation strongly suppresses the electron transfer reaction back to the interfacial chargetransfer state stabilized at the donoraccepter interface and that it plays a critical role in maintaining the longrange electronhole separation
|
[['in', 'organic', 'photovoltaic', 'systems', 'a', 'photogenerated', 'molecular', 'exciton', 'in', 'the', 'donor', 'domain', 'dissociates', 'into', 'a', 'hole', 'and', 'an', 'electron', 'at', 'the', 'donoracceptor', 'heterojunction', 'and', 'subsequently', 'separate', 'into', 'free', 'charge', 'carriers', 'that', 'can', 'be', 'extracted', 'as', 'photocurrents', 'the', 'recombination', 'of', 'the', 'onceseparated', 'electron', 'and', 'hole', 'is', 'a', 'major', 'loss', 'mechanism', 'in', 'photovoltaic', 'systems', 'which', 'controls', 'their', 'performance', 'hence', 'efficient', 'photovoltaic', 'systems', 'need', 'builtin', 'ratchet', 'mechanisms', 'namely', 'ultrafast', 'charge', 'separation', 'and', 'retarded', 'charge', 'recombination', 'in', 'order', 'to', 'obtain', 'insight', 'into', 'the', 'internal', 'working', 'of', 'the', 'experimentally', 'observed', 'ultrafast', 'longrange', 'charge', 'separation', 'and', 'protection', 'against', 'charge', 'recombination', 'we', 'theoretically', 'investigate', 'a', 'potential', 'ratchet', 'mechanism', 'arising', 'from', 'the', 'combination', 'of', 'quantum', 'delocalization', 'and', 'its', 'destruction', 'by', 'performing', 'numerically', 'accurate', 'quantumdynamics', 'calculations', 'on', 'a', 'model', 'system', 'it', 'is', 'demonstrated', 'that', 'the', 'nonmarkovian', 'effect', 'originating', 'from', 'the', 'slow', 'polaron', 'formation', 'strongly', 'suppresses', 'the', 'electron', 'transfer', 'reaction', 'back', 'to', 'the', 'interfacial', 'chargetransfer', 'state', 'stabilized', 'at', 'the', 'donoraccepter', 'interface', 'and', 'that', 'it', 'plays', 'a', 'critical', 'role', 'in', 'maintaining', 'the', 'longrange', 'electronhole', 'separation']]
|
[-0.14077305477464652, 0.1792056062295609, -0.03822823027332089, 0.08151627374801462, 0.039261526002744095, -0.1790158265373773, 0.07295345806338491, 0.3742093915970605, -0.29430831337554586, -0.27523603523724977, -0.02718032115601854, -0.28224957283488533, -0.11247877475955052, 0.18154224523998522, 0.03393798986058912, -0.014148804771262624, 0.003979305100029357, -0.0946264432090691, -0.027517262331704484, -0.13304300312409867, 0.2589523689203355, 0.07992216060548894, 0.322009671348676, 0.1806831057327167, 0.10587593495564099, 0.018082575682108002, 0.07343481896002489, -0.03600481872297363, -0.10046088933166983, 0.08617925933953145, 0.23742065491315759, -0.037450136263268416, 0.249829172578083, -0.48250884661611954, -0.24890921385038967, 0.00946794781419966, 0.1765371535690559, 0.19536505602975662, -0.1446242153868769, -0.25873326459025714, 0.04147386537105949, -0.19488858603469936, -0.06628630211128404, -0.058125386778915586, 0.04046349138320412, -0.0008545532092498041, -0.2570078498166468, 0.12240725443525999, 0.06987919805257582, -0.014890712674789456, -0.1186577557265632, -0.06050358367649074, -0.12422295101561848, 0.1141168790191044, 0.011877960740318407, 0.030952979401824707, 0.26143693699311743, -0.12498158085167863, -0.1187106877318181, 0.36855942534461017, -0.027128569937719286, -0.14320114638834594, 0.189073652804421, -0.15103696226745983, 0.006681673277606383, 0.1994967568654245, 0.14575653445021605, 0.11272615922706915, -0.18452687106773624, 0.04455695138779975, 0.07700338856465137, 0.1743135427866407, 0.047085656175090945, 0.13230227922911492, 0.2917280681330688, 0.20433057862172985, 0.032556088652783706, 0.13049254748599465, -0.11569441489628832, -0.12462645203714477, -0.20669566062106579, -0.17913724329560796, -0.1983128474065229, 0.1021789376233003, -0.03213928263272622, -0.1439915669185144, 0.4150296454317868, 0.14270364829226984, 0.14520615643683682, -0.09626329514714688, 0.2961702536716827, 0.1319076552200936, 0.08522520190892442, 0.0032175268638695094, 0.22716211312720666, 0.11810937398372011, 0.13532930227387466, -0.38818979508209006, 0.10764010524647426, 0.04038390900255583]
|
1,803.08131
|
Markovian robots: minimal navigation strategies for active particles
|
We explore minimal navigation strategies for active particles in complex,
dynamical, external fields, introducing a class of autonomous, self-propelled
particles which we call Markovian robots (MR). These machines are equipped with
a navigation control system (NCS) that triggers random changes in the direction
of self-propulsion of the robots. The internal state of the NCS is described by
a Boolean variable that adopts two values. The temporal dynamics of this
Boolean variable is dictated by a closed Markov chain -- ensuring the absence
of fixed points in the dynamics -- with transition rates that may depend
exclusively on the instantaneous, local value of the external field.
Importantly, the NCS does not store past measurements of this value in
continuous, internal variables. We show that, despite the strong constraints,
it is possible to conceive closed Markov chain motifs that lead to nontrivial
motility behaviors of the MR in one, two and three dimensions. By analytically
reducing the complexity of the NCS dynamics, we obtain an effective description
of the long-time motility behavior of the MR that allows us to identify the
minimum requirements in the design of NCS motifs and transition rates to
perform complex navigation tasks such as adaptive gradient following, detection
of minima or maxima, or selection of a desired value in a dynamical, external
field. We put these ideas in practice by assembling a robot that operates by
the proposed minimalistic NCS to evaluate the robustness of MR, providing a
proof-of-concept that is possible to navigate through complex information
landscapes with such a simple NCS whose internal state can be stored in one
bit. These ideas may prove useful for the engineering of miniaturized robots.
|
cond-mat.stat-mech
|
we explore minimal navigation strategies for active particles in complex dynamical external fields introducing a class of autonomous selfpropelled particles which we call markovian robots mr these machines are equipped with a navigation control system ncs that triggers random changes in the direction of selfpropulsion of the robots the internal state of the ncs is described by a boolean variable that adopts two values the temporal dynamics of this boolean variable is dictated by a closed markov chain ensuring the absence of fixed points in the dynamics with transition rates that may depend exclusively on the instantaneous local value of the external field importantly the ncs does not store past measurements of this value in continuous internal variables we show that despite the strong constraints it is possible to conceive closed markov chain motifs that lead to nontrivial motility behaviors of the mr in one two and three dimensions by analytically reducing the complexity of the ncs dynamics we obtain an effective description of the longtime motility behavior of the mr that allows us to identify the minimum requirements in the design of ncs motifs and transition rates to perform complex navigation tasks such as adaptive gradient following detection of minima or maxima or selection of a desired value in a dynamical external field we put these ideas in practice by assembling a robot that operates by the proposed minimalistic ncs to evaluate the robustness of mr providing a proofofconcept that is possible to navigate through complex information landscapes with such a simple ncs whose internal state can be stored in one bit these ideas may prove useful for the engineering of miniaturized robots
|
[['we', 'explore', 'minimal', 'navigation', 'strategies', 'for', 'active', 'particles', 'in', 'complex', 'dynamical', 'external', 'fields', 'introducing', 'a', 'class', 'of', 'autonomous', 'selfpropelled', 'particles', 'which', 'we', 'call', 'markovian', 'robots', 'mr', 'these', 'machines', 'are', 'equipped', 'with', 'a', 'navigation', 'control', 'system', 'ncs', 'that', 'triggers', 'random', 'changes', 'in', 'the', 'direction', 'of', 'selfpropulsion', 'of', 'the', 'robots', 'the', 'internal', 'state', 'of', 'the', 'ncs', 'is', 'described', 'by', 'a', 'boolean', 'variable', 'that', 'adopts', 'two', 'values', 'the', 'temporal', 'dynamics', 'of', 'this', 'boolean', 'variable', 'is', 'dictated', 'by', 'a', 'closed', 'markov', 'chain', 'ensuring', 'the', 'absence', 'of', 'fixed', 'points', 'in', 'the', 'dynamics', 'with', 'transition', 'rates', 'that', 'may', 'depend', 'exclusively', 'on', 'the', 'instantaneous', 'local', 'value', 'of', 'the', 'external', 'field', 'importantly', 'the', 'ncs', 'does', 'not', 'store', 'past', 'measurements', 'of', 'this', 'value', 'in', 'continuous', 'internal', 'variables', 'we', 'show', 'that', 'despite', 'the', 'strong', 'constraints', 'it', 'is', 'possible', 'to', 'conceive', 'closed', 'markov', 'chain', 'motifs', 'that', 'lead', 'to', 'nontrivial', 'motility', 'behaviors', 'of', 'the', 'mr', 'in', 'one', 'two', 'and', 'three', 'dimensions', 'by', 'analytically', 'reducing', 'the', 'complexity', 'of', 'the', 'ncs', 'dynamics', 'we', 'obtain', 'an', 'effective', 'description', 'of', 'the', 'longtime', 'motility', 'behavior', 'of', 'the', 'mr', 'that', 'allows', 'us', 'to', 'identify', 'the', 'minimum', 'requirements', 'in', 'the', 'design', 'of', 'ncs', 'motifs', 'and', 'transition', 'rates', 'to', 'perform', 'complex', 'navigation', 'tasks', 'such', 'as', 'adaptive', 'gradient', 'following', 'detection', 'of', 'minima', 'or', 'maxima', 'or', 'selection', 'of', 'a', 'desired', 'value', 'in', 'a', 'dynamical', 'external', 'field', 'we', 'put', 'these', 'ideas', 'in', 'practice', 'by', 'assembling', 'a', 'robot', 'that', 'operates', 'by', 'the', 'proposed', 'minimalistic', 'ncs', 'to', 'evaluate', 'the', 'robustness', 'of', 'mr', 'providing', 'a', 'proofofconcept', 'that', 'is', 'possible', 'to', 'navigate', 'through', 'complex', 'information', 'landscapes', 'with', 'such', 'a', 'simple', 'ncs', 'whose', 'internal', 'state', 'can', 'be', 'stored', 'in', 'one', 'bit', 'these', 'ideas', 'may', 'prove', 'useful', 'for', 'the', 'engineering', 'of', 'miniaturized', 'robots']]
|
[-0.1744970103366733, 0.15695130758640316, -0.06615577694232555, 0.029147199695814318, -0.08887625234218545, -0.15479474239489813, 0.0676420622043835, 0.38157547195696945, -0.27483647642487213, -0.3137957807562321, 0.08347490329905514, -0.2152409020316448, -0.1734110330669957, 0.162602314239463, -0.07250966882013654, 0.04039893290976506, 0.02271150194200259, 0.050058363837421106, -0.03014467896113553, -0.2191783726771097, 0.2883123278292406, 0.029269090342083876, 0.26582268013680066, -0.018491882876744564, 0.14444765555213485, 0.03497980896358669, 0.04865820595253612, 0.04895545307370107, -0.10834629551858478, 0.11291451744519511, 0.2677379267147477, 0.11993704836247965, 0.2835224340108978, -0.45967217406468724, -0.2204441429646074, 0.11790806152789861, 0.13963285280072069, 0.11533110381323287, -0.06044862720899515, -0.28206516920765656, 0.07992306009128718, -0.12926216182448938, -0.13435171961097767, -0.09017188421511738, 0.0140325103616206, 0.05531705732382562, -0.27823694235981733, 0.01543212403578558, 0.0721081940127523, 0.06711363840430132, -0.0799450549625462, -0.04693131023944852, -0.022415789452646554, 0.15271505194012566, 0.023984814938418562, 0.00212242563185452, 0.21061435380243582, -0.15191807222518502, -0.15014285820278842, 0.34782276411683566, -0.01084333361954136, -0.21515442367327012, 0.21119809210942855, -0.10697358229578248, -0.12767365725751775, 0.13372134485615106, 0.19112953327742344, 0.10448461258783937, -0.166895204060541, 0.0560147899817635, -0.007083536876895785, 0.17782836321343662, 0.02712124387519502, 0.031478656050970055, 0.1975344400317578, 0.18769828019235418, 0.09131585703491417, 0.13764215942198602, -0.05234762739108019, -0.14781295001229788, -0.2463838628605416, -0.15466981074398037, -0.16335160577207478, 0.05014410135842882, -0.10466118122229648, -0.15999313093123646, 0.3937955934173652, 0.15425738499455485, 0.20191008878113825, 0.05100602217836061, 0.2758848170535707, 0.08910143877512157, 0.07845493379545256, 0.05395703431368418, 0.22894492462263816, 0.07818609232382073, 0.09821861187322405, -0.24908677181466923, 0.10506281470981882, 0.019278566972488524]
|
1,803.08132
|
Acoustic wave polarization and energy flow in periodic beam lattice
materials
|
The free propagation of acoustic plane waves through cellular periodic
materials is generally accompanied by a flow of mechanical energy across the
adjacent cells. The paper focuses on the energy transport related to dispersive
waves propagating through nondissipative microstructured materials. The generic
microstructure of the periodic cell is described by a beam lattice model,
suitably reduced to the minimal space of dynamic degrees-of-freedom. The linear
eigenproblem governing the wave propagation is stated and the complete
eigensolution is considered to study both the real-valued dispersion functions
and the complex-valued waveforms of the propagating elastic waves. First, a
complete family of nondimensional quantities (polarization factors) is proposed
to quantify the linear polarization or quasi-polarization, according to a
proper energetic criterion. Second, a vector variable related to the periodic
cell is introduced to assess the directional flux of mechanical energy, in
analogy to the Umov-Poynting vector related to the material point in solid
mechanics. The physical-mathematical relation between the energy flux and the
velocity of the energy transport is recognized. The formal equivalence between
the energy and the group velocity is pointed out, according to the mechanical
assumptions. Finally, all the theoretical developments are successfully applied
to the prototypical beam lattice material characterized by a periodic
tetrachiral microstructure.
|
physics.class-ph cond-mat.mtrl-sci
|
the free propagation of acoustic plane waves through cellular periodic materials is generally accompanied by a flow of mechanical energy across the adjacent cells the paper focuses on the energy transport related to dispersive waves propagating through nondissipative microstructured materials the generic microstructure of the periodic cell is described by a beam lattice model suitably reduced to the minimal space of dynamic degreesoffreedom the linear eigenproblem governing the wave propagation is stated and the complete eigensolution is considered to study both the realvalued dispersion functions and the complexvalued waveforms of the propagating elastic waves first a complete family of nondimensional quantities polarization factors is proposed to quantify the linear polarization or quasipolarization according to a proper energetic criterion second a vector variable related to the periodic cell is introduced to assess the directional flux of mechanical energy in analogy to the umovpoynting vector related to the material point in solid mechanics the physicalmathematical relation between the energy flux and the velocity of the energy transport is recognized the formal equivalence between the energy and the group velocity is pointed out according to the mechanical assumptions finally all the theoretical developments are successfully applied to the prototypical beam lattice material characterized by a periodic tetrachiral microstructure
|
[['the', 'free', 'propagation', 'of', 'acoustic', 'plane', 'waves', 'through', 'cellular', 'periodic', 'materials', 'is', 'generally', 'accompanied', 'by', 'a', 'flow', 'of', 'mechanical', 'energy', 'across', 'the', 'adjacent', 'cells', 'the', 'paper', 'focuses', 'on', 'the', 'energy', 'transport', 'related', 'to', 'dispersive', 'waves', 'propagating', 'through', 'nondissipative', 'microstructured', 'materials', 'the', 'generic', 'microstructure', 'of', 'the', 'periodic', 'cell', 'is', 'described', 'by', 'a', 'beam', 'lattice', 'model', 'suitably', 'reduced', 'to', 'the', 'minimal', 'space', 'of', 'dynamic', 'degreesoffreedom', 'the', 'linear', 'eigenproblem', 'governing', 'the', 'wave', 'propagation', 'is', 'stated', 'and', 'the', 'complete', 'eigensolution', 'is', 'considered', 'to', 'study', 'both', 'the', 'realvalued', 'dispersion', 'functions', 'and', 'the', 'complexvalued', 'waveforms', 'of', 'the', 'propagating', 'elastic', 'waves', 'first', 'a', 'complete', 'family', 'of', 'nondimensional', 'quantities', 'polarization', 'factors', 'is', 'proposed', 'to', 'quantify', 'the', 'linear', 'polarization', 'or', 'quasipolarization', 'according', 'to', 'a', 'proper', 'energetic', 'criterion', 'second', 'a', 'vector', 'variable', 'related', 'to', 'the', 'periodic', 'cell', 'is', 'introduced', 'to', 'assess', 'the', 'directional', 'flux', 'of', 'mechanical', 'energy', 'in', 'analogy', 'to', 'the', 'umovpoynting', 'vector', 'related', 'to', 'the', 'material', 'point', 'in', 'solid', 'mechanics', 'the', 'physicalmathematical', 'relation', 'between', 'the', 'energy', 'flux', 'and', 'the', 'velocity', 'of', 'the', 'energy', 'transport', 'is', 'recognized', 'the', 'formal', 'equivalence', 'between', 'the', 'energy', 'and', 'the', 'group', 'velocity', 'is', 'pointed', 'out', 'according', 'to', 'the', 'mechanical', 'assumptions', 'finally', 'all', 'the', 'theoretical', 'developments', 'are', 'successfully', 'applied', 'to', 'the', 'prototypical', 'beam', 'lattice', 'material', 'characterized', 'by', 'a', 'periodic', 'tetrachiral', 'microstructure']]
|
[-0.17428546390448021, 0.16802613475254458, -0.04452663997137745, 0.030964968056220725, -0.10119154948163135, -0.07783209894476413, 0.030044183184924935, 0.3586299001753073, -0.32564036605026336, -0.23581367650349153, 0.05771277970955547, -0.26314131645348127, -0.14377246438777946, 0.19075567170913363, -0.012565877048867604, 0.10581076420439875, 0.009141143510035546, 0.014487503123988072, -0.0436674109660089, -0.15674978076925344, 0.31304690077799957, 0.07431476343115746, 0.3275646431385333, 0.02713182143032037, 0.1313127503326272, 0.01713228254840512, -0.03235136534734239, 0.03205425642280819, -0.15040296714826318, 0.10920648358239256, 0.21465077223439744, 0.021035321724367114, 0.22588387686355507, -0.442610818586482, -0.2769348151073447, 0.06784749241187948, 0.08376585503264784, 0.08356492174875331, 0.01038669852087999, -0.2519864124828592, 0.047271354857997355, -0.11237726976012288, -0.17430479070079957, -0.03257770690690781, 0.009728458010949414, 0.0694498696577795, -0.22457350278502614, 0.08687578647149717, 0.05064588763608868, 0.03160807269331747, -0.09222878665397209, -0.051737476969504814, -0.09192278701295901, 0.07649204751082095, 0.059656214044977604, 0.02650911535200631, 0.13249751930056242, -0.09434093545383677, -0.07564715625892572, 0.43719387150873096, -0.026635273145523216, -0.244321119260465, 0.16313910038953675, -0.13167066436594702, -0.017503534338157167, 0.18255208152360075, 0.18518171982215764, 0.05363514403963984, -0.178505543312012, 0.030926758002553175, -0.015820912485113574, 0.15464194017027166, 0.08568313176252793, 0.011384246517615071, 0.21542247374922843, 0.16014449234611441, 0.029201608931122742, 0.15351032230801184, -0.06540415707971038, -0.0837552207189479, -0.30925544900498514, -0.15804399254851118, -0.18608395534962086, 0.036811669618840415, -0.06991377551744582, -0.18583667923333902, 0.44570232051186115, 0.07947429208534545, 0.1277806400481997, -0.01491681467457858, 0.2618955157644441, 0.14402115608914182, 0.03332714268965234, 0.04715212967058671, 0.281653911896105, 0.20282622176139922, 0.10555115917220419, -0.2540690351985544, 0.021933264681711574, 0.07219275048121883]
|
1,803.08133
|
Comments on frequency dependent ac conductivity in polymeric materials
at low frequency regime
|
The AC conductivity response in a broad frequency range of disordered
materials is of great interest not only for technological applications, but
also from a theoretical point of view. The Jonscher power exponent value, and
its temperature dependence, is a very important parameter in dielectric data
analysis as well as the physical interpretation of conduction mechanisms in
disordered materials. In some cases the power exponent of AC conductivity has
been reported to be greater than 1 at the low frequency regime. This fact seems
to contradict the universal dynamic response. The present work focuses on the
analysis of dielectric spectroscopy measurements in polymeric materials, below
100 MHz. The apparent power exponent n gets values in the range (0,1) and is
directly related to the characteristics of mobile charges at shorter time
scales, in the case of the occurrence of DC conduction and the slowest
polarization mechanism that is due to the charge motions within sort length
scales, in log(epsilon'')-log(frequenvy) plot. The emergence of apparent n
values in the range [1,2], for a relatively narrow frequency range, may be
attributed to an additional molecular dipolar relaxation contribution at higher
frequencies, in log(epsilon'')-log(frequency) plot. The appearance of apparent
n values in the range (1,2], can be assigned to the existence of a well defined
minimum between DC conductivity contribution and a molecular dipolar dispersion
or between two well separated dielectric loss mechanisms, in
log(epsilon'')-log(frequency) plots, above the crossover frequency. In these
latter cases, the apparent power exponent n is merely related to the
Havriliak-Negami equation shape parameters of the higher frequencies molecular
dipolar relaxations.
|
cond-mat.mtrl-sci
|
the ac conductivity response in a broad frequency range of disordered materials is of great interest not only for technological applications but also from a theoretical point of view the jonscher power exponent value and its temperature dependence is a very important parameter in dielectric data analysis as well as the physical interpretation of conduction mechanisms in disordered materials in some cases the power exponent of ac conductivity has been reported to be greater than 1 at the low frequency regime this fact seems to contradict the universal dynamic response the present work focuses on the analysis of dielectric spectroscopy measurements in polymeric materials below 100 mhz the apparent power exponent n gets values in the range 01 and is directly related to the characteristics of mobile charges at shorter time scales in the case of the occurrence of dc conduction and the slowest polarization mechanism that is due to the charge motions within sort length scales in logepsilonlogfrequenvy plot the emergence of apparent n values in the range 12 for a relatively narrow frequency range may be attributed to an additional molecular dipolar relaxation contribution at higher frequencies in logepsilonlogfrequency plot the appearance of apparent n values in the range 12 can be assigned to the existence of a well defined minimum between dc conductivity contribution and a molecular dipolar dispersion or between two well separated dielectric loss mechanisms in logepsilonlogfrequency plots above the crossover frequency in these latter cases the apparent power exponent n is merely related to the havriliaknegami equation shape parameters of the higher frequencies molecular dipolar relaxations
|
[['the', 'ac', 'conductivity', 'response', 'in', 'a', 'broad', 'frequency', 'range', 'of', 'disordered', 'materials', 'is', 'of', 'great', 'interest', 'not', 'only', 'for', 'technological', 'applications', 'but', 'also', 'from', 'a', 'theoretical', 'point', 'of', 'view', 'the', 'jonscher', 'power', 'exponent', 'value', 'and', 'its', 'temperature', 'dependence', 'is', 'a', 'very', 'important', 'parameter', 'in', 'dielectric', 'data', 'analysis', 'as', 'well', 'as', 'the', 'physical', 'interpretation', 'of', 'conduction', 'mechanisms', 'in', 'disordered', 'materials', 'in', 'some', 'cases', 'the', 'power', 'exponent', 'of', 'ac', 'conductivity', 'has', 'been', 'reported', 'to', 'be', 'greater', 'than', '1', 'at', 'the', 'low', 'frequency', 'regime', 'this', 'fact', 'seems', 'to', 'contradict', 'the', 'universal', 'dynamic', 'response', 'the', 'present', 'work', 'focuses', 'on', 'the', 'analysis', 'of', 'dielectric', 'spectroscopy', 'measurements', 'in', 'polymeric', 'materials', 'below', '100', 'mhz', 'the', 'apparent', 'power', 'exponent', 'n', 'gets', 'values', 'in', 'the', 'range', '01', 'and', 'is', 'directly', 'related', 'to', 'the', 'characteristics', 'of', 'mobile', 'charges', 'at', 'shorter', 'time', 'scales', 'in', 'the', 'case', 'of', 'the', 'occurrence', 'of', 'dc', 'conduction', 'and', 'the', 'slowest', 'polarization', 'mechanism', 'that', 'is', 'due', 'to', 'the', 'charge', 'motions', 'within', 'sort', 'length', 'scales', 'in', 'logepsilonlogfrequenvy', 'plot', 'the', 'emergence', 'of', 'apparent', 'n', 'values', 'in', 'the', 'range', '12', 'for', 'a', 'relatively', 'narrow', 'frequency', 'range', 'may', 'be', 'attributed', 'to', 'an', 'additional', 'molecular', 'dipolar', 'relaxation', 'contribution', 'at', 'higher', 'frequencies', 'in', 'logepsilonlogfrequency', 'plot', 'the', 'appearance', 'of', 'apparent', 'n', 'values', 'in', 'the', 'range', '12', 'can', 'be', 'assigned', 'to', 'the', 'existence', 'of', 'a', 'well', 'defined', 'minimum', 'between', 'dc', 'conductivity', 'contribution', 'and', 'a', 'molecular', 'dipolar', 'dispersion', 'or', 'between', 'two', 'well', 'separated', 'dielectric', 'loss', 'mechanisms', 'in', 'logepsilonlogfrequency', 'plots', 'above', 'the', 'crossover', 'frequency', 'in', 'these', 'latter', 'cases', 'the', 'apparent', 'power', 'exponent', 'n', 'is', 'merely', 'related', 'to', 'the', 'havriliaknegami', 'equation', 'shape', 'parameters', 'of', 'the', 'higher', 'frequencies', 'molecular', 'dipolar', 'relaxations']]
|
[-0.14689000046625014, 0.17114215627053986, -0.04160818919164817, 0.020323121254997596, -0.06263916474734667, -0.13643253339512065, 0.07255500971167042, 0.3649032112583158, -0.2749652459329303, -0.31525419354007284, 0.05661516063702814, -0.28682619122550984, -0.10101669836828923, 0.23460583544774952, 0.006472999042144556, 0.02111705101375391, -0.05707122650695066, 0.0019196746673104156, -0.05833642180149649, -0.14493612181862753, 0.23020082579846549, 0.06883410955185941, 0.3013653845075, 0.10478313727228827, 0.02377126650196144, -0.043838160337240195, 0.03789953718727821, 0.03187533275865171, -0.12364639288458265, 0.04113380669914617, 0.27075889444474893, -0.014321169169998592, 0.2541282745707478, -0.3612287939134194, -0.22730058530106437, 0.08503517919870877, 0.14483235387714097, 0.07874187522183054, 0.0017942234250792378, -0.18854454736599274, 0.058984163740651956, -0.12192354605687804, -0.15758617496626762, -0.027282395201436743, 0.08423820461603206, 0.017497230110362777, -0.2376136561355852, 0.1594240513123872, 0.05142335984837911, 0.09061302208704838, -0.10908152120645562, -0.14846407705522413, 0.0081876855483818, 0.09017093753096968, 0.07108347610306195, 0.014523142813902679, 0.17336349594173053, -0.1415111034621709, -0.07693790931445205, 0.3764107984807126, -0.04601654846565735, -0.14177882674952041, 0.1812755474398222, -0.21816096822353634, -0.07606673613819923, 0.18230881567677648, 0.15200195829939137, 0.09213429205227484, -0.126643243750996, 0.057808561319899726, 0.014091458110476783, 0.2139224669916068, 0.07852744580872184, 0.08787039913593082, 0.23875593436471973, 0.16198613586688135, 0.02779293612533871, 0.13460182795043976, -0.09972360579056025, -0.0751803948339003, -0.2656299654236171, -0.10227207972175481, -0.2213304151095896, 0.07040500285965345, -0.11669219749450187, -0.13916707131202588, 0.4007860943567166, 0.13624901128222655, 0.22666605136224202, 0.025888515111332236, 0.27899129081042806, 0.14190530878919605, 0.0925777569866261, 0.03918789436008681, 0.260250248392153, 0.14051964023990132, 0.16298713485807412, -0.24903573037096405, 0.0810502421661032, -0.005628498476070557]
|
1,803.08134
|
Task dependent Deep LDA pruning of neural networks
|
With deep learning's success, a limited number of popular deep nets have been
widely adopted for various vision tasks. However, this usually results in
unnecessarily high complexities and possibly many features of low task utility.
In this paper, we address this problem by introducing a task-dependent deep
pruning framework based on Fisher's Linear Discriminant Analysis (LDA). The
approach can be applied to convolutional, fully-connected, and module-based
deep network structures, in all cases leveraging the high decorrelation of
neuron motifs found in the pre-decision space and cross-layer deconv
dependency. Moreover, we examine our approach's potential in network
architecture search for specific tasks and analyze the influence of our pruning
on model robustness to noises and adversarial attacks. Experimental results on
datasets of generic objects (ImageNet, CIFAR100) as well as domain specific
tasks (Adience, and LFWA) illustrate our framework's superior performance over
state-of-the-art pruning approaches and fixed compact nets (e.g. SqueezeNet,
MobileNet). The proposed method successfully maintains comparable accuracies
even after discarding most parameters (98%-99% for VGG16, up to 82% for the
already compact InceptionNet) and with significant FLOP reductions (83% for
VGG16, up to 64% for InceptionNet). Through pruning, we can also derive
smaller, but more accurate and more robust models suitable for the task.
|
cs.CV
|
with deep learnings success a limited number of popular deep nets have been widely adopted for various vision tasks however this usually results in unnecessarily high complexities and possibly many features of low task utility in this paper we address this problem by introducing a taskdependent deep pruning framework based on fishers linear discriminant analysis lda the approach can be applied to convolutional fullyconnected and modulebased deep network structures in all cases leveraging the high decorrelation of neuron motifs found in the predecision space and crosslayer deconv dependency moreover we examine our approachs potential in network architecture search for specific tasks and analyze the influence of our pruning on model robustness to noises and adversarial attacks experimental results on datasets of generic objects imagenet cifar100 as well as domain specific tasks adience and lfwa illustrate our frameworks superior performance over stateoftheart pruning approaches and fixed compact nets eg squeezenet mobilenet the proposed method successfully maintains comparable accuracies even after discarding most parameters 9899 for vgg16 up to 82 for the already compact inceptionnet and with significant flop reductions 83 for vgg16 up to 64 for inceptionnet through pruning we can also derive smaller but more accurate and more robust models suitable for the task
|
[['with', 'deep', 'learnings', 'success', 'a', 'limited', 'number', 'of', 'popular', 'deep', 'nets', 'have', 'been', 'widely', 'adopted', 'for', 'various', 'vision', 'tasks', 'however', 'this', 'usually', 'results', 'in', 'unnecessarily', 'high', 'complexities', 'and', 'possibly', 'many', 'features', 'of', 'low', 'task', 'utility', 'in', 'this', 'paper', 'we', 'address', 'this', 'problem', 'by', 'introducing', 'a', 'taskdependent', 'deep', 'pruning', 'framework', 'based', 'on', 'fishers', 'linear', 'discriminant', 'analysis', 'lda', 'the', 'approach', 'can', 'be', 'applied', 'to', 'convolutional', 'fullyconnected', 'and', 'modulebased', 'deep', 'network', 'structures', 'in', 'all', 'cases', 'leveraging', 'the', 'high', 'decorrelation', 'of', 'neuron', 'motifs', 'found', 'in', 'the', 'predecision', 'space', 'and', 'crosslayer', 'deconv', 'dependency', 'moreover', 'we', 'examine', 'our', 'approachs', 'potential', 'in', 'network', 'architecture', 'search', 'for', 'specific', 'tasks', 'and', 'analyze', 'the', 'influence', 'of', 'our', 'pruning', 'on', 'model', 'robustness', 'to', 'noises', 'and', 'adversarial', 'attacks', 'experimental', 'results', 'on', 'datasets', 'of', 'generic', 'objects', 'imagenet', 'cifar100', 'as', 'well', 'as', 'domain', 'specific', 'tasks', 'adience', 'and', 'lfwa', 'illustrate', 'our', 'frameworks', 'superior', 'performance', 'over', 'stateoftheart', 'pruning', 'approaches', 'and', 'fixed', 'compact', 'nets', 'eg', 'squeezenet', 'mobilenet', 'the', 'proposed', 'method', 'successfully', 'maintains', 'comparable', 'accuracies', 'even', 'after', 'discarding', 'most', 'parameters', '9899', 'for', 'vgg16', 'up', 'to', '82', 'for', 'the', 'already', 'compact', 'inceptionnet', 'and', 'with', 'significant', 'flop', 'reductions', '83', 'for', 'vgg16', 'up', 'to', '64', 'for', 'inceptionnet', 'through', 'pruning', 'we', 'can', 'also', 'derive', 'smaller', 'but', 'more', 'accurate', 'and', 'more', 'robust', 'models', 'suitable', 'for', 'the', 'task']]
|
[-0.02817279518936936, -0.031601731785305655, -0.031075111724030557, 0.07889527490300283, -0.08690052393058517, -0.19562874863956972, 0.07665010896513681, 0.4535829491145669, -0.2273061232460377, -0.35912506980273995, 0.09680154849602242, -0.24674151505177638, -0.2145148838206314, 0.22460892201876176, -0.13280852887281538, 0.12157021817695902, 0.1336689055315219, 0.010014797785632903, -0.08637845288561012, -0.3437328212064608, 0.27330086009097426, 0.06756051850567416, 0.35045847470991975, 0.04257150994622988, 0.12655389739320347, -0.03920716566775953, -0.0045613956321860745, -0.00500592953097895, -0.03449924257560864, 0.1362035272494281, 0.30006252852174364, 0.1594040321010337, 0.307381953675263, -0.4124848724223009, -0.25668628319825904, 0.09916289581336302, 0.14684260746319766, 0.11240056469308335, -0.008012831174926417, -0.3337067253795443, 0.14568433677316597, -0.18944372992851946, 0.03950158631807138, -0.19956391742499086, 6.61225115769718e-05, 0.0008220795016403836, -0.25821851872629253, 0.04045682862769273, 0.07995798132246323, 0.07527594750120055, -0.04340159327326582, -0.17522049334812517, 0.023717583585323047, 0.10278513821909241, 0.0064319379709541135, 0.05824848333843938, 0.1320261724620578, -0.20343570921703769, -0.1628310170294348, 0.3388694466857037, -0.07009043660600402, -0.19978670936797072, 0.22442764798317585, 0.0005518981188738553, -0.20388917535852347, 0.09219669344452311, 0.238720059083339, 0.13455282045124298, -0.1268589342437168, 0.014092888510042553, -0.0004916209819735867, 0.1714974299342934, 0.06678923625685736, 0.014451991063588769, 0.12832663699985702, 0.2902667594446552, 0.032579254074596185, 0.13862730793846254, -0.14479813560276375, -0.0704857010142846, -0.18034398300794535, -0.06046446191547796, -0.15391833414980624, -0.04133312059693168, -0.15733416848243986, -0.10551220149903714, 0.4055179266863051, 0.23033274311614385, 0.21709005094345402, 0.13423413582005547, 0.3283336841694937, 0.014896328597387765, 0.14751843383448143, 0.12236934623710977, 0.19801822594035012, 0.03735029802653053, 0.10439292761199821, -0.15522430921987732, 0.06695020197784657, 0.01687771011037881]
|
1,803.08135
|
Information Geometry of the Gaussian Space
|
We discuss the Pistone-Sempi exponential manifold on the finite-dimensional
Gaussian space. We consider the role of the entropy, the continuity of
translations, Poincar\'e-type inequalities, the generalized differentiability
of probability densities of the Gaussian space.
|
math.PR
|
we discuss the pistonesempi exponential manifold on the finitedimensional gaussian space we consider the role of the entropy the continuity of translations poincaretype inequalities the generalized differentiability of probability densities of the gaussian space
|
[['we', 'discuss', 'the', 'pistonesempi', 'exponential', 'manifold', 'on', 'the', 'finitedimensional', 'gaussian', 'space', 'we', 'consider', 'the', 'role', 'of', 'the', 'entropy', 'the', 'continuity', 'of', 'translations', 'poincaretype', 'inequalities', 'the', 'generalized', 'differentiability', 'of', 'probability', 'densities', 'of', 'the', 'gaussian', 'space']]
|
[-0.13639184321756614, 0.08319191809630755, -0.08807601192683885, 0.16238371937563925, -0.05072708235997142, -0.030325291508978062, 0.03395031787680857, 0.32462469036832, -0.30438798801465466, -0.14009278281732943, 0.09890475124120712, -0.2338281445995425, -0.11609362291567253, 0.13416200402108105, -0.11777379047690016, 0.1305473501032049, -0.015691356860439886, 0.09458434062473701, -0.20238067644337812, -0.2829291869702777, 0.4766154827719385, -0.00957831838097649, 0.2798717870151229, 0.0025015871858958044, 0.18477425363027689, 0.04926096279682084, -0.02816948401882793, -0.06689443332178405, -0.23129160250678207, 0.1933139358562502, 0.15000391449553496, 0.13822890291780685, 0.3332070512414882, -0.38214512688644003, -0.24026016834558864, 0.21753683590301962, 0.06081367377191782, -0.021959723185070536, 0.02237881141164425, -0.3561944401625431, -0.028839605359473462, -0.1028256191674507, -0.20739145396333752, -0.12161175816348105, -0.03813233452312874, 0.0731012358358412, -0.2466922226418374, 0.134142480000402, 0.15478988646557837, 0.021338187599074885, -0.12583202386105602, -0.09084839458492669, -0.03314634356083292, 0.04252243260711883, 0.01268261570525779, 0.011633063962852413, 0.14545331853018564, -0.07059827339694355, -0.10260137368106481, 0.2880805397801327, -0.08820812658152798, -0.33363190361044626, 0.10094149213171366, -0.19887015900828622, -0.1739179011660092, 0.05133257130386703, 0.1830289882015098, 0.09668409700194995, -0.08002845858308402, 0.22528515651709202, -0.06461585985468418, 0.0522762655957856, 0.1004548782031193, 0.10927556525690085, 0.0667764779293176, 0.07205290262672034, 0.15356386256771107, 0.2113576683808457, -0.11100162040075344, -0.16547043948914064, -0.42069257095907675, -0.26329792324792256, -0.20920000744588446, 0.10260856727307494, -0.2177741691244371, -0.192856070275108, 0.35860986998798605, 0.05654502681202509, 0.1858656680719419, 0.15601619468493896, 0.2108071313211412, 0.16612373526687874, -0.05432098765264858, 0.0857055524307229, 0.16798976746698221, 0.21424709774102224, 0.05690034425281214, -0.17218076161137133, 0.061263166847779896, 0.17393303560939702]
|
1,803.08136
|
On The Correct Thermo-dynamic Potential for Electro-static Dielectric
Energy
|
Various types of equilibrium processes involve electric fields. In some
cases, the electrical energy appears to be negative (e.g. if the voltage is
fixed by an external source). This paper explains how to derive the correct
thermo-dynamic potential for electro-static phenomena, whether the voltage is
fixed, or the charge is fixed, or some combination is fixed. In particular, we
explain, in complete detail, why fixing the voltage introduces "a minus sign"
in the electrical energy.
Two explanations are given. The first explanation is based on a
lumped-parameter argument (i.e. a lumped-capacitor model). The second
explanation uses a distributed parameter model (i.e. a partial differential
equation (PDE) model) of a dielectric medium, in this case, we allow for
non-linearity and external polarization effects. Connections with Legendre
(duality) transforms are also discussed.
|
physics.class-ph
|
various types of equilibrium processes involve electric fields in some cases the electrical energy appears to be negative eg if the voltage is fixed by an external source this paper explains how to derive the correct thermodynamic potential for electrostatic phenomena whether the voltage is fixed or the charge is fixed or some combination is fixed in particular we explain in complete detail why fixing the voltage introduces a minus sign in the electrical energy two explanations are given the first explanation is based on a lumpedparameter argument ie a lumpedcapacitor model the second explanation uses a distributed parameter model ie a partial differential equation pde model of a dielectric medium in this case we allow for nonlinearity and external polarization effects connections with legendre duality transforms are also discussed
|
[['various', 'types', 'of', 'equilibrium', 'processes', 'involve', 'electric', 'fields', 'in', 'some', 'cases', 'the', 'electrical', 'energy', 'appears', 'to', 'be', 'negative', 'eg', 'if', 'the', 'voltage', 'is', 'fixed', 'by', 'an', 'external', 'source', 'this', 'paper', 'explains', 'how', 'to', 'derive', 'the', 'correct', 'thermodynamic', 'potential', 'for', 'electrostatic', 'phenomena', 'whether', 'the', 'voltage', 'is', 'fixed', 'or', 'the', 'charge', 'is', 'fixed', 'or', 'some', 'combination', 'is', 'fixed', 'in', 'particular', 'we', 'explain', 'in', 'complete', 'detail', 'why', 'fixing', 'the', 'voltage', 'introduces', 'a', 'minus', 'sign', 'in', 'the', 'electrical', 'energy', 'two', 'explanations', 'are', 'given', 'the', 'first', 'explanation', 'is', 'based', 'on', 'a', 'lumpedparameter', 'argument', 'ie', 'a', 'lumpedcapacitor', 'model', 'the', 'second', 'explanation', 'uses', 'a', 'distributed', 'parameter', 'model', 'ie', 'a', 'partial', 'differential', 'equation', 'pde', 'model', 'of', 'a', 'dielectric', 'medium', 'in', 'this', 'case', 'we', 'allow', 'for', 'nonlinearity', 'and', 'external', 'polarization', 'effects', 'connections', 'with', 'legendre', 'duality', 'transforms', 'are', 'also', 'discussed']]
|
[-0.16542650566142153, 0.1093546690523323, -0.0733120372778801, 0.077877178895576, -0.11217603011619906, -0.1761543618139717, 0.060557199469695316, 0.36258273283669423, -0.2714589134367659, -0.2966514635224675, 0.07264932649762391, -0.27972973720712024, -0.16620437907372682, 0.1622737096333804, -0.05795799998400458, 0.004932255610505971, -0.03660779257211112, 0.03849962173397978, -0.044220371572517375, -0.17998322751373053, 0.3224062286615155, 0.023726229429562654, 0.250363157809416, 0.09345177522053456, 0.10740701720667209, -0.006599290671852208, -0.01586342421035434, 0.04578246978615975, -0.08736386343357587, 0.02528926853881066, 0.20964191308923702, 0.04082185387531974, 0.25798363516164957, -0.44353258085632047, -0.21996261258862276, 0.12772926893229633, 0.08292488169677234, 0.13198442689626833, -0.07447908766831221, -0.18418517239417073, 0.05632941847912563, -0.1326251608507289, -0.1553991641555985, -0.06931474901947406, 0.02083186000989851, 0.06510155415162444, -0.29077002946143005, 0.09267684883531002, 0.07690518749462687, 0.05989322712998693, -0.10110685957393559, -0.08802827046245568, 0.003931526422262365, 0.06694062992045115, 0.04253859325156858, 0.021198851045567627, 0.1320027725179066, -0.1274722792413952, -0.1027707630757589, 0.36662782766213714, -0.03773030939569711, -0.2568371822378894, 0.14415194415451252, -0.13129031025378626, -0.10344883292018212, 0.08839047197324708, 0.12836766376542721, 0.09371083556465054, -0.18470764270976417, 0.10533313783086014, -0.00397910113453634, 0.16530395796623573, 0.08181752851449473, -0.006152191260728494, 0.22505635595988743, 0.14462250241713756, 0.05750008511750475, 0.15655980008210293, -0.0388814519220862, -0.08019427617636415, -0.3650929787910955, -0.13992144198467335, -0.12217460089731355, 0.06539046916345409, -0.07967039122521, -0.16885669715341556, 0.4104383267469473, 0.15161432797276927, 0.20410550359362203, -0.01852540744742913, 0.3208266154956795, 0.19233378728259673, 0.01268530897651763, 0.035915450696551866, 0.2179599415854724, 0.14214938993443005, 0.13005729998252535, -0.21306158263482652, 0.08360177238630637, 0.06260670831042536]
|
1,803.08137
|
Robust Blind Deconvolution via Mirror Descent
|
We revisit the Blind Deconvolution problem with a focus on understanding its
robustness and convergence properties. Provable robustness to noise and other
perturbations is receiving recent interest in vision, from obtaining immunity
to adversarial attacks to assessing and describing failure modes of algorithms
in mission critical applications. Further, many blind deconvolution methods
based on deep architectures internally make use of or optimize the basic
formulation, so a clearer understanding of how this sub-module behaves, when it
can be solved, and what noise injection it can tolerate is a first order
requirement. We derive new insights into the theoretical underpinnings of blind
deconvolution. The algorithm that emerges has nice convergence guarantees and
is provably robust in a sense we formalize in the paper. Interestingly, these
technical results play out very well in practice, where on standard datasets
our algorithm yields results competitive with or superior to the state of the
art. Keywords: blind deconvolution, robust continuous optimization
|
cs.CV cs.AI cs.NA stat.ML
|
we revisit the blind deconvolution problem with a focus on understanding its robustness and convergence properties provable robustness to noise and other perturbations is receiving recent interest in vision from obtaining immunity to adversarial attacks to assessing and describing failure modes of algorithms in mission critical applications further many blind deconvolution methods based on deep architectures internally make use of or optimize the basic formulation so a clearer understanding of how this submodule behaves when it can be solved and what noise injection it can tolerate is a first order requirement we derive new insights into the theoretical underpinnings of blind deconvolution the algorithm that emerges has nice convergence guarantees and is provably robust in a sense we formalize in the paper interestingly these technical results play out very well in practice where on standard datasets our algorithm yields results competitive with or superior to the state of the art keywords blind deconvolution robust continuous optimization
|
[['we', 'revisit', 'the', 'blind', 'deconvolution', 'problem', 'with', 'a', 'focus', 'on', 'understanding', 'its', 'robustness', 'and', 'convergence', 'properties', 'provable', 'robustness', 'to', 'noise', 'and', 'other', 'perturbations', 'is', 'receiving', 'recent', 'interest', 'in', 'vision', 'from', 'obtaining', 'immunity', 'to', 'adversarial', 'attacks', 'to', 'assessing', 'and', 'describing', 'failure', 'modes', 'of', 'algorithms', 'in', 'mission', 'critical', 'applications', 'further', 'many', 'blind', 'deconvolution', 'methods', 'based', 'on', 'deep', 'architectures', 'internally', 'make', 'use', 'of', 'or', 'optimize', 'the', 'basic', 'formulation', 'so', 'a', 'clearer', 'understanding', 'of', 'how', 'this', 'submodule', 'behaves', 'when', 'it', 'can', 'be', 'solved', 'and', 'what', 'noise', 'injection', 'it', 'can', 'tolerate', 'is', 'a', 'first', 'order', 'requirement', 'we', 'derive', 'new', 'insights', 'into', 'the', 'theoretical', 'underpinnings', 'of', 'blind', 'deconvolution', 'the', 'algorithm', 'that', 'emerges', 'has', 'nice', 'convergence', 'guarantees', 'and', 'is', 'provably', 'robust', 'in', 'a', 'sense', 'we', 'formalize', 'in', 'the', 'paper', 'interestingly', 'these', 'technical', 'results', 'play', 'out', 'very', 'well', 'in', 'practice', 'where', 'on', 'standard', 'datasets', 'our', 'algorithm', 'yields', 'results', 'competitive', 'with', 'or', 'superior', 'to', 'the', 'state', 'of', 'the', 'art', 'keywords', 'blind', 'deconvolution', 'robust', 'continuous', 'optimization']]
|
[-0.06340257364969987, -0.007814955800616493, -0.12021067050787118, 0.09294350464822343, -0.10038144053079379, -0.2004793890996669, 0.033199014411552645, 0.39383501893518347, -0.275144136545117, -0.3120443010393035, 0.14979518681857137, -0.23570397693830997, -0.22386474483303176, 0.19906246433936012, -0.1750663507473058, 0.09022732710619517, 0.09752332142148262, 0.003680782650824254, -0.08460900138985987, -0.2782028701054888, 0.2598305813645801, 0.07796354835852234, 0.32141643031410727, 0.02407573352460391, 0.07602867825129905, -0.013876801831289552, -0.027160590257829964, 0.023258016297731023, -0.10092716521546372, 0.09906676874528877, 0.28304269531089143, 0.20653573915254897, 0.3341296794003425, -0.42238400443695867, -0.19777741127435525, 0.11513300614658362, 0.1494758901043007, 0.1213723705074629, -0.07860000601533848, -0.30436488477966916, 0.0919530355611828, -0.10802409826264454, -0.06761453761002766, -0.16536560971349573, -0.051375083123835236, -0.0036022656907637915, -0.2969246636598538, 0.037145573498072244, 0.10165090974978505, 0.019173106141888406, -0.023970194596749466, -0.13771233088575685, 0.07152931625023484, 0.13354612324175646, 0.059648566715156615, 0.040121701871379256, 0.12489189386654359, -0.16945326279771203, -0.12674241660622498, 0.3739795547056322, -0.05338384431133118, -0.2004295267904989, 0.19549174714708129, -0.061867852606482275, -0.1892004027001512, 0.11618953889522415, 0.19712462219505164, 0.10691440049021576, -0.1176308960455525, 0.05558872744791771, -0.016702895631822638, 0.17226118249938083, 0.01899533262789751, 0.08414869547600691, 0.16311678171713048, 0.2483005684353441, 0.11804851148096929, 0.15425622286961582, -0.0874203141578712, -0.09403431554659246, -0.2305205507347217, -0.11345243970833671, -0.17464070421052524, 0.013592346431277035, -0.04757110185005914, -0.15179053949526486, 0.4062145386929982, 0.2461236720152486, 0.16202079113692236, 0.07547432092281106, 0.3981799630639263, 0.06498471787274003, 0.01633179143298035, 0.0932545255875597, 0.25719376468810085, 0.12860894590043104, 0.08527950967888898, -0.16099344240650773, 0.10950835831821538, 0.030994385238535378]
|
1,803.08138
|
Extended depth-of-field in holographic image reconstruction using deep
learning based auto-focusing and phase-recovery
|
Holography encodes the three dimensional (3D) information of a sample in the
form of an intensity-only recording. However, to decode the original sample
image from its hologram(s), auto-focusing and phase-recovery are needed, which
are in general cumbersome and time-consuming to digitally perform. Here we
demonstrate a convolutional neural network (CNN) based approach that
simultaneously performs auto-focusing and phase-recovery to significantly
extend the depth-of-field (DOF) in holographic image reconstruction. For this,
a CNN is trained by using pairs of randomly de-focused back-propagated
holograms and their corresponding in-focus phase-recovered images. After this
training phase, the CNN takes a single back-propagated hologram of a 3D sample
as input to rapidly achieve phase-recovery and reconstruct an in focus image of
the sample over a significantly extended DOF. This deep learning based DOF
extension method is non-iterative, and significantly improves the algorithm
time-complexity of holographic image reconstruction from O(nm) to O(1), where n
refers to the number of individual object points or particles within the sample
volume, and m represents the focusing search space within which each object
point or particle needs to be individually focused. These results highlight
some of the unique opportunities created by data-enabled statistical image
reconstruction methods powered by machine learning, and we believe that the
presented approach can be broadly applicable to computationally extend the DOF
of other imaging modalities.
|
cs.CV cs.LG physics.optics
|
holography encodes the three dimensional 3d information of a sample in the form of an intensityonly recording however to decode the original sample image from its holograms autofocusing and phaserecovery are needed which are in general cumbersome and timeconsuming to digitally perform here we demonstrate a convolutional neural network cnn based approach that simultaneously performs autofocusing and phaserecovery to significantly extend the depthoffield dof in holographic image reconstruction for this a cnn is trained by using pairs of randomly defocused backpropagated holograms and their corresponding infocus phaserecovered images after this training phase the cnn takes a single backpropagated hologram of a 3d sample as input to rapidly achieve phaserecovery and reconstruct an in focus image of the sample over a significantly extended dof this deep learning based dof extension method is noniterative and significantly improves the algorithm timecomplexity of holographic image reconstruction from onm to o1 where n refers to the number of individual object points or particles within the sample volume and m represents the focusing search space within which each object point or particle needs to be individually focused these results highlight some of the unique opportunities created by dataenabled statistical image reconstruction methods powered by machine learning and we believe that the presented approach can be broadly applicable to computationally extend the dof of other imaging modalities
|
[['holography', 'encodes', 'the', 'three', 'dimensional', '3d', 'information', 'of', 'a', 'sample', 'in', 'the', 'form', 'of', 'an', 'intensityonly', 'recording', 'however', 'to', 'decode', 'the', 'original', 'sample', 'image', 'from', 'its', 'holograms', 'autofocusing', 'and', 'phaserecovery', 'are', 'needed', 'which', 'are', 'in', 'general', 'cumbersome', 'and', 'timeconsuming', 'to', 'digitally', 'perform', 'here', 'we', 'demonstrate', 'a', 'convolutional', 'neural', 'network', 'cnn', 'based', 'approach', 'that', 'simultaneously', 'performs', 'autofocusing', 'and', 'phaserecovery', 'to', 'significantly', 'extend', 'the', 'depthoffield', 'dof', 'in', 'holographic', 'image', 'reconstruction', 'for', 'this', 'a', 'cnn', 'is', 'trained', 'by', 'using', 'pairs', 'of', 'randomly', 'defocused', 'backpropagated', 'holograms', 'and', 'their', 'corresponding', 'infocus', 'phaserecovered', 'images', 'after', 'this', 'training', 'phase', 'the', 'cnn', 'takes', 'a', 'single', 'backpropagated', 'hologram', 'of', 'a', '3d', 'sample', 'as', 'input', 'to', 'rapidly', 'achieve', 'phaserecovery', 'and', 'reconstruct', 'an', 'in', 'focus', 'image', 'of', 'the', 'sample', 'over', 'a', 'significantly', 'extended', 'dof', 'this', 'deep', 'learning', 'based', 'dof', 'extension', 'method', 'is', 'noniterative', 'and', 'significantly', 'improves', 'the', 'algorithm', 'timecomplexity', 'of', 'holographic', 'image', 'reconstruction', 'from', 'onm', 'to', 'o1', 'where', 'n', 'refers', 'to', 'the', 'number', 'of', 'individual', 'object', 'points', 'or', 'particles', 'within', 'the', 'sample', 'volume', 'and', 'm', 'represents', 'the', 'focusing', 'search', 'space', 'within', 'which', 'each', 'object', 'point', 'or', 'particle', 'needs', 'to', 'be', 'individually', 'focused', 'these', 'results', 'highlight', 'some', 'of', 'the', 'unique', 'opportunities', 'created', 'by', 'dataenabled', 'statistical', 'image', 'reconstruction', 'methods', 'powered', 'by', 'machine', 'learning', 'and', 'we', 'believe', 'that', 'the', 'presented', 'approach', 'can', 'be', 'broadly', 'applicable', 'to', 'computationally', 'extend', 'the', 'dof', 'of', 'other', 'imaging', 'modalities']]
|
[-0.034022356211271594, 0.03909572998774621, -0.08233342692362289, 0.01885918843863983, -0.08591061527309217, -0.19108035676734156, 0.031407409749465855, 0.4271694954960994, -0.2640004165419569, -0.34109405024598044, 0.07415866595347408, -0.2505982815071124, -0.16239459418317465, 0.1783270451243431, -0.127576075159396, 0.087708018506589, 0.1040327492306651, 0.03975325894274124, -0.07444458893504521, -0.27421381902459957, 0.26844574594827686, 0.03584910573139596, 0.3035304281450213, -0.0544806136218108, 0.1307641301457196, 0.03000578542716257, -0.046235829178715916, 0.001192468889754002, -0.050751861310619796, 0.14776067563107229, 0.2870744945562219, 0.19954238191765805, 0.236557632410414, -0.4305498132550412, -0.21828780039617596, 0.07536204395389538, 0.20483737596689158, 0.11419548838373834, -0.053801370586893736, -0.3216606314797975, 0.08345597166329895, -0.10805556051790306, -0.018297838750954497, -0.08828530426256223, -0.058585558025502346, -0.023939927075096495, -0.3019553895994009, 0.039916636867737866, 0.04743767775633462, 0.039134542561682646, -0.032246373512475966, -0.08584311550863717, 0.007100680812164188, 0.13776142255309545, -0.023635895666560013, 0.10066294489342285, 0.14406957426778208, -0.18056958565238218, -0.094964280991377, 0.36275770004464475, 0.0058456599333889135, -0.2217788900861083, 0.14672569307970673, -0.10892912303735439, -0.08483106455846465, 0.19479298602856618, 0.21910876606178542, 0.1638203064430522, -0.1564664998220399, 0.02408395544732134, -0.03567474708386344, 0.20051985558563074, 0.06176823449903699, 0.02986366295741582, 0.16989776450709002, 0.22217437945339258, 0.03173167168824045, 0.1833360300938382, -0.18827801701996105, -0.02961423340972224, -0.22004550404434164, -0.13584142509097294, -0.25188792248141684, -0.013512381871303195, -0.10299860935532765, -0.10113056659268972, 0.39791511243512107, 0.205055914121546, 0.22046176596974196, 0.07662290833107957, 0.36365702499308067, 0.011317944215274666, 0.13272567034659685, 0.08454376091057919, 0.21720716113410146, 0.053439911332653335, 0.11065635398204639, -0.1578348304780804, 0.007099738402492005, 0.07319651023255125]
|
1,803.08139
|
Calculation of the Mean Strain of Smooth Non-uniform Strain Fields Using
Conventional FBG Sensors
|
In the past few decades, fibre Bragg grating (FBG) sensors have gained a lot
of attention in the field of distributed point strain measurement. One of the
most interesting properties of these sensors is the presumed linear
relationship between the strain and the peak wavelength shift of the FBG
reflected spectra. However, subjecting sensors to a non-uniform stress field
will in general result in a strain estimation error when using this linear
relationship. In this paper we propose a new strain estimation algorithm that
accurately estimates the mean strain value in the case of smooth non-uniform
strain distributions. To do so, we first introduce an approximation of the
classical transfer matrix model, which we will refer to as the approximated
transfer matrix model (ATMM). This model facilitates the analysis of FBG
reflected spectra under arbitrary strain distributions, particularly by
providing a closed-form approximation of the side-lobes of the reflected
spectra. Based on this new formulation, we derive a maximum likelihood
estimator of the mean strain value. The algorithm is validated using both
computer simulations and experimental FBG measurements. Compared to
state-of-the-art methods, which typically introduce errors of tens of
microstrains, the proposed method is able to compensate for this error. In the
typical examples that were analysed in this study, mean strain errors of around
60 microstrains were compensated.
|
physics.app-ph physics.optics
|
in the past few decades fibre bragg grating fbg sensors have gained a lot of attention in the field of distributed point strain measurement one of the most interesting properties of these sensors is the presumed linear relationship between the strain and the peak wavelength shift of the fbg reflected spectra however subjecting sensors to a nonuniform stress field will in general result in a strain estimation error when using this linear relationship in this paper we propose a new strain estimation algorithm that accurately estimates the mean strain value in the case of smooth nonuniform strain distributions to do so we first introduce an approximation of the classical transfer matrix model which we will refer to as the approximated transfer matrix model atmm this model facilitates the analysis of fbg reflected spectra under arbitrary strain distributions particularly by providing a closedform approximation of the sidelobes of the reflected spectra based on this new formulation we derive a maximum likelihood estimator of the mean strain value the algorithm is validated using both computer simulations and experimental fbg measurements compared to stateoftheart methods which typically introduce errors of tens of microstrains the proposed method is able to compensate for this error in the typical examples that were analysed in this study mean strain errors of around 60 microstrains were compensated
|
[['in', 'the', 'past', 'few', 'decades', 'fibre', 'bragg', 'grating', 'fbg', 'sensors', 'have', 'gained', 'a', 'lot', 'of', 'attention', 'in', 'the', 'field', 'of', 'distributed', 'point', 'strain', 'measurement', 'one', 'of', 'the', 'most', 'interesting', 'properties', 'of', 'these', 'sensors', 'is', 'the', 'presumed', 'linear', 'relationship', 'between', 'the', 'strain', 'and', 'the', 'peak', 'wavelength', 'shift', 'of', 'the', 'fbg', 'reflected', 'spectra', 'however', 'subjecting', 'sensors', 'to', 'a', 'nonuniform', 'stress', 'field', 'will', 'in', 'general', 'result', 'in', 'a', 'strain', 'estimation', 'error', 'when', 'using', 'this', 'linear', 'relationship', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'strain', 'estimation', 'algorithm', 'that', 'accurately', 'estimates', 'the', 'mean', 'strain', 'value', 'in', 'the', 'case', 'of', 'smooth', 'nonuniform', 'strain', 'distributions', 'to', 'do', 'so', 'we', 'first', 'introduce', 'an', 'approximation', 'of', 'the', 'classical', 'transfer', 'matrix', 'model', 'which', 'we', 'will', 'refer', 'to', 'as', 'the', 'approximated', 'transfer', 'matrix', 'model', 'atmm', 'this', 'model', 'facilitates', 'the', 'analysis', 'of', 'fbg', 'reflected', 'spectra', 'under', 'arbitrary', 'strain', 'distributions', 'particularly', 'by', 'providing', 'a', 'closedform', 'approximation', 'of', 'the', 'sidelobes', 'of', 'the', 'reflected', 'spectra', 'based', 'on', 'this', 'new', 'formulation', 'we', 'derive', 'a', 'maximum', 'likelihood', 'estimator', 'of', 'the', 'mean', 'strain', 'value', 'the', 'algorithm', 'is', 'validated', 'using', 'both', 'computer', 'simulations', 'and', 'experimental', 'fbg', 'measurements', 'compared', 'to', 'stateoftheart', 'methods', 'which', 'typically', 'introduce', 'errors', 'of', 'tens', 'of', 'microstrains', 'the', 'proposed', 'method', 'is', 'able', 'to', 'compensate', 'for', 'this', 'error', 'in', 'the', 'typical', 'examples', 'that', 'were', 'analysed', 'in', 'this', 'study', 'mean', 'strain', 'errors', 'of', 'around', '60', 'microstrains', 'were', 'compensated']]
|
[-0.10587081745471977, 0.07835789054020473, -0.09744175418291813, 0.01483164566522037, -0.04000700015463619, -0.12281317577415377, 0.035032772062316433, 0.42808926481445997, -0.2862407840428438, -0.30888674918288755, 0.09835556934645331, -0.2386976945504478, -0.17106508506128754, 0.20029548420026094, -0.10058485324827766, 0.07370605329831276, 0.053114343772603864, 0.00314610270321916, -0.10835678174337714, -0.22175689189643558, 0.24820852920534772, 0.08321274138790546, 0.3198038539208403, 0.016554180088660192, 0.09663166835959659, 0.02885932616094862, -0.014589911729713887, 0.03815919289006552, -0.1466146323730696, 0.14090373784243856, 0.23678178663382632, 0.05446741171181202, 0.29963491269848697, -0.3988992844392127, -0.22730047030239836, 0.09794063813377753, 0.12114775403981619, 0.13421098545830218, -0.054306880748775196, -0.25210805113294904, 0.07246240500762306, -0.15296379796340379, -0.08985383215001486, -0.043460511655862864, -0.022874614368021965, 0.03050721734559266, -0.2789355483474295, 0.09683012979429796, 0.017573453503054216, 0.08326011954447887, -0.08421255479013513, -0.11927413882489034, 0.009171761760334357, 0.09382714492008795, 0.05693609773452658, 0.007289043358535668, 0.14697303546490062, -0.09124849945810888, -0.07037829753831712, 0.35167491119867617, -0.07904538530386437, -0.1760323898142648, 0.09964121956487161, -0.1458111300556109, -0.07352927917136101, 0.17114890862145213, 0.2244515453503732, 0.12345108286682688, -0.15826500509151337, 0.023213418781086632, -0.0016755493269131065, 0.17340746819997022, 0.05927084457799963, 0.010375413107269213, 0.1606712406928386, 0.1696739107393873, 0.07177155235688279, 0.14216571048098625, -0.1542843651537006, -0.045883686138624584, -0.28586161234031576, -0.11632753027829452, -0.2104453427520572, 0.028867193877402216, -0.09949152190395771, -0.177685144173682, 0.39929602825117017, 0.19281788625078353, 0.17757496786936092, 0.06299338184848188, 0.31693258703848637, 0.14371847308672314, 0.07129619751604052, 0.03689091081128652, 0.29901456735481363, 0.17512470663529436, 0.1045260023509383, -0.19240181695204228, 0.07032306318666888, 0.0026161705609411]
|
1,803.0814
|
On locally repeated values of arithmetic functions over $\mathbb F_q[T]$
|
The frequency of occurrence of "locally repeated" values of arithmetic
functions is a common theme in analytic number theory, for instance in the
Erd\H{o}s-Mirsky problem on coincidences of the divisor function at consecutive
integers, the analogous problem for the Euler totient function, and the
quantitative conjectures of Erd\H{o}s, Pomerance and Sark\H{o}zy and of Graham,
Holt and Pomerance on the frequency of occurrences. In this paper we introduce
the corresponding problems in the setting of polynomials over a finite field,
and completely solve them in the large finite field limit.
|
math.NT math.PR
|
the frequency of occurrence of locally repeated values of arithmetic functions is a common theme in analytic number theory for instance in the erdhosmirsky problem on coincidences of the divisor function at consecutive integers the analogous problem for the euler totient function and the quantitative conjectures of erdhos pomerance and sarkhozy and of graham holt and pomerance on the frequency of occurrences in this paper we introduce the corresponding problems in the setting of polynomials over a finite field and completely solve them in the large finite field limit
|
[['the', 'frequency', 'of', 'occurrence', 'of', 'locally', 'repeated', 'values', 'of', 'arithmetic', 'functions', 'is', 'a', 'common', 'theme', 'in', 'analytic', 'number', 'theory', 'for', 'instance', 'in', 'the', 'erdhosmirsky', 'problem', 'on', 'coincidences', 'of', 'the', 'divisor', 'function', 'at', 'consecutive', 'integers', 'the', 'analogous', 'problem', 'for', 'the', 'euler', 'totient', 'function', 'and', 'the', 'quantitative', 'conjectures', 'of', 'erdhos', 'pomerance', 'and', 'sarkhozy', 'and', 'of', 'graham', 'holt', 'and', 'pomerance', 'on', 'the', 'frequency', 'of', 'occurrences', 'in', 'this', 'paper', 'we', 'introduce', 'the', 'corresponding', 'problems', 'in', 'the', 'setting', 'of', 'polynomials', 'over', 'a', 'finite', 'field', 'and', 'completely', 'solve', 'them', 'in', 'the', 'large', 'finite', 'field', 'limit']]
|
[-0.16591722837554038, 0.08389145093943542, -0.0854776029062288, 0.08305060801583088, -0.0306921112827364, -0.07222926650534976, 0.0658524224947376, 0.26989429925610736, -0.30098271678963845, -0.2749935020269318, 0.0887206521623408, -0.2665753514871044, -0.15139859686182303, 0.2123716387855397, -0.11988821620947089, 0.07933383125336232, 0.017337512304286727, 0.06317322110672566, -0.03487759162883528, -0.3024749394627923, 0.3555342881485227, -0.028516575297213752, 0.20821487945927816, 0.0920636426043612, 0.08828370085922704, 0.05139130730160766, -0.02570024790475145, -0.005217751408715479, -0.13550533012973823, 0.10251849230156619, 0.2940202687274326, 0.13300320102875543, 0.3338213037403131, -0.39551748714240437, -0.12610555934423412, 0.1568025728391314, 0.10479042077366268, 0.04530251741314053, 0.004831172163407741, -0.22236396700397812, 0.09517499262636359, -0.11212415908547965, -0.14426268233166245, 0.024903099454770036, 0.07994497788339769, 0.0590916301430711, -0.27598996401171794, 0.0700220897349275, 0.06560596187112176, 0.14291982326275585, -0.04368117148987949, -0.13908441282017686, 0.09995013391810724, 0.09147160329369151, 0.05624371145544997, 0.049192626695995306, -0.009847447037993168, -0.13649220479684035, -0.12675019996558232, 0.33132567776324734, -0.0470427373551171, -0.19519642998718403, 0.11171864977487447, -0.17132848497170594, -0.15110863821411674, 0.08400823399212888, 0.12631374597549438, 0.19160390626215798, -0.03152451706806791, 0.1469417181658421, -0.13462096664377235, 0.09917178708763624, 0.18865164570425721, -0.006611668525940992, 0.16233761476707348, 0.0566805558998815, 0.04518142652655528, 0.1563051174347162, -0.023766408000069947, -0.08228340465575457, -0.2989934624320912, -0.16517597510987383, -0.19682475618372502, 0.0690632714805278, -0.11494100879562294, -0.20883126421408219, 0.434631512013518, 0.12221448557366701, 0.17525056866526773, 0.12089618143032897, 0.24490692975549874, 0.1302844183731147, 0.01665740401751298, 0.03596174646703399, 0.12381064883348616, 0.2076122668963349, 0.05357997998230117, -0.20301803017553705, 0.027975057209418577, 0.1786895125300031]
|
1,803.08141
|
Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of
Elementary Trapping Sets with Small Size
|
One of the phenomena that influences significantly the performance of
low-density parity-check codes is known as trapping sets. An $(a,b)$ elementary
trapping set, or simply an ETS where $a$ is the size and $b$ is the number of
degree-one check nodes and $\frac{b}{a}<1$, causes high decoding failure rate
and exert a strong influence on the error floor. In this paper, we provide
sufficient conditions for exponent matrices to have fully connected
$(3,n)$-regular QC-LDPC codes with girths 6 and 8 whose Tanner graphs are free
of small ETSs. Applying sufficient conditions on the exponent matrix to remove
some 8-cycles results in removing all 4-cycles, 6-cycles as well as some small
elementary trapping sets. For each girth we obtain a lower bound on the lifting
degree and present exponent matrices with column weight three whose
corresponding Tanner graph is free of certain ETSs.
|
cs.IT math.IT
|
one of the phenomena that influences significantly the performance of lowdensity paritycheck codes is known as trapping sets an ab elementary trapping set or simply an ets where a is the size and b is the number of degreeone check nodes and fracba1 causes high decoding failure rate and exert a strong influence on the error floor in this paper we provide sufficient conditions for exponent matrices to have fully connected 3nregular qcldpc codes with girths 6 and 8 whose tanner graphs are free of small etss applying sufficient conditions on the exponent matrix to remove some 8cycles results in removing all 4cycles 6cycles as well as some small elementary trapping sets for each girth we obtain a lower bound on the lifting degree and present exponent matrices with column weight three whose corresponding tanner graph is free of certain etss
|
[['one', 'of', 'the', 'phenomena', 'that', 'influences', 'significantly', 'the', 'performance', 'of', 'lowdensity', 'paritycheck', 'codes', 'is', 'known', 'as', 'trapping', 'sets', 'an', 'ab', 'elementary', 'trapping', 'set', 'or', 'simply', 'an', 'ets', 'where', 'a', 'is', 'the', 'size', 'and', 'b', 'is', 'the', 'number', 'of', 'degreeone', 'check', 'nodes', 'and', 'fracba1', 'causes', 'high', 'decoding', 'failure', 'rate', 'and', 'exert', 'a', 'strong', 'influence', 'on', 'the', 'error', 'floor', 'in', 'this', 'paper', 'we', 'provide', 'sufficient', 'conditions', 'for', 'exponent', 'matrices', 'to', 'have', 'fully', 'connected', '3nregular', 'qcldpc', 'codes', 'with', 'girths', '6', 'and', '8', 'whose', 'tanner', 'graphs', 'are', 'free', 'of', 'small', 'etss', 'applying', 'sufficient', 'conditions', 'on', 'the', 'exponent', 'matrix', 'to', 'remove', 'some', '8cycles', 'results', 'in', 'removing', 'all', '4cycles', '6cycles', 'as', 'well', 'as', 'some', 'small', 'elementary', 'trapping', 'sets', 'for', 'each', 'girth', 'we', 'obtain', 'a', 'lower', 'bound', 'on', 'the', 'lifting', 'degree', 'and', 'present', 'exponent', 'matrices', 'with', 'column', 'weight', 'three', 'whose', 'corresponding', 'tanner', 'graph', 'is', 'free', 'of', 'certain', 'etss']]
|
[-0.1845718017718989, 0.16266158579956747, -0.0037867670155150427, 0.05385874561955415, -0.03256639813386212, -0.18920375600711797, 0.06497495629566742, 0.35991983433260766, -0.2574199293807095, -0.3018289528411927, 0.14189039548128682, -0.26986303003571877, -0.14402949466561002, 0.16810931159994102, -0.09548957402677201, 0.05657486349558659, 0.06912198108989451, 0.09098301841161321, -0.06160698026224381, -0.32525839893379344, 0.3019675889283606, 0.09948368296831203, 0.21629648714949437, 0.08557844300680667, 0.06009188917609561, -0.013487487277619059, 0.0059722975941656304, 0.012333586741667643, -0.16903361288702706, 0.06443187677328267, 0.20726770371627465, 0.13248333031740442, 0.21337021420301078, -0.3980369594001727, -0.18731055070190497, 0.15267312293118468, 0.11595651290962379, 0.12480856129973322, -0.031758300320198427, -0.20313557664354553, 0.16388129481121147, -0.16079572370041767, -0.1005698400817597, -0.010408889041650745, 0.03944561188611731, 0.05590854177130855, -0.29138279546440826, 0.02253409725004177, 0.08803453889136076, 0.0941888776091899, -0.019062981414843163, -0.1761537332576867, 0.02124675230639015, 0.11724470904525772, -0.052836417912324664, 0.008172723096158865, 0.08708381440688139, -0.08577264211033371, -0.09192947698246165, 0.3371745473370224, 0.015188437621879707, -0.20748767585044714, 0.1929319498293343, -0.10673044394808921, -0.12086091243842845, 0.16507760789111364, 0.17683709521690827, 0.10376054154515933, -0.09420490972429728, 0.08454045339901228, -0.06247228642979221, 0.1664424606485011, 0.14332431700522844, 0.08389430445210218, 0.11953812461219085, 0.08977390485380193, 0.14112097545352717, 0.165570612970016, -0.05894517442781023, -0.010273787330353647, -0.2971097136204459, -0.08037060364392391, -0.2084175766313368, 0.0653339320552542, -0.17029575314387435, -0.22066237037773612, 0.3861067892963455, 0.0864813295628527, 0.20449650661957872, 0.11657652934249356, 0.22979029828222744, 0.0637034903701919, 0.08335147699778364, 0.15401086313046997, 0.13733915252512213, 0.18593641298173144, -0.06237254019746249, -0.1812413038230307, 0.07986151198324708, 0.11601884413523961]
|
1,803.08142
|
Giant negative electrostriction and dielectric tunability in a van der
Waals layered ferroelectric
|
The interest in ferroelectric van der Waals crystals arises from the
potential to realize ultrathin ferroic systems owing to the reduced surface
energy of these materials and the layered structure that allows for
exfoliation. Here, we quantitatively unravel giant negative electrostriction of
van der Waals layered copper indium thiophosphate (CIPS), which exhibits an
electrostrictive coefficient Q33 as high as -3.2 m4/C2 and a resulting bulk
piezoelectric coefficient d33 up to -85 pm/V. As a result, the
electromechanical response of CIPS is comparable in magnitude to established
perovskite ferroelectrics despite possessing a much smaller spontaneous
polarization of only a few uC/cm2. In the paraelectric state, readily
accessible owing to low transition temperatures, CIPS exhibits large dielectric
tunability, similar to widely-used barium strontium titanate, and as a result
both giant and continuously tunable electromechanical response. The persistence
of electrostrictive and tunable responses in the paraelectric state indicates
that even few layer films or nanoparticles will sustain significant
electromechanical functionality, offsetting the inevitable suppression of
ferroelectric properties in the nanoscale limit. These findings can likely be
extended to other ferroelectric transition metal thiophosphates and (quasi-)
two-dimensional materials and might facilitate the quest towards novel
ultrathin functional devices incorporating electromechanical response.
|
cond-mat.mtrl-sci
|
the interest in ferroelectric van der waals crystals arises from the potential to realize ultrathin ferroic systems owing to the reduced surface energy of these materials and the layered structure that allows for exfoliation here we quantitatively unravel giant negative electrostriction of van der waals layered copper indium thiophosphate cips which exhibits an electrostrictive coefficient q33 as high as 32 m4c2 and a resulting bulk piezoelectric coefficient d33 up to 85 pmv as a result the electromechanical response of cips is comparable in magnitude to established perovskite ferroelectrics despite possessing a much smaller spontaneous polarization of only a few uccm2 in the paraelectric state readily accessible owing to low transition temperatures cips exhibits large dielectric tunability similar to widelyused barium strontium titanate and as a result both giant and continuously tunable electromechanical response the persistence of electrostrictive and tunable responses in the paraelectric state indicates that even few layer films or nanoparticles will sustain significant electromechanical functionality offsetting the inevitable suppression of ferroelectric properties in the nanoscale limit these findings can likely be extended to other ferroelectric transition metal thiophosphates and quasi twodimensional materials and might facilitate the quest towards novel ultrathin functional devices incorporating electromechanical response
|
[['the', 'interest', 'in', 'ferroelectric', 'van', 'der', 'waals', 'crystals', 'arises', 'from', 'the', 'potential', 'to', 'realize', 'ultrathin', 'ferroic', 'systems', 'owing', 'to', 'the', 'reduced', 'surface', 'energy', 'of', 'these', 'materials', 'and', 'the', 'layered', 'structure', 'that', 'allows', 'for', 'exfoliation', 'here', 'we', 'quantitatively', 'unravel', 'giant', 'negative', 'electrostriction', 'of', 'van', 'der', 'waals', 'layered', 'copper', 'indium', 'thiophosphate', 'cips', 'which', 'exhibits', 'an', 'electrostrictive', 'coefficient', 'q33', 'as', 'high', 'as', '32', 'm4c2', 'and', 'a', 'resulting', 'bulk', 'piezoelectric', 'coefficient', 'd33', 'up', 'to', '85', 'pmv', 'as', 'a', 'result', 'the', 'electromechanical', 'response', 'of', 'cips', 'is', 'comparable', 'in', 'magnitude', 'to', 'established', 'perovskite', 'ferroelectrics', 'despite', 'possessing', 'a', 'much', 'smaller', 'spontaneous', 'polarization', 'of', 'only', 'a', 'few', 'uccm2', 'in', 'the', 'paraelectric', 'state', 'readily', 'accessible', 'owing', 'to', 'low', 'transition', 'temperatures', 'cips', 'exhibits', 'large', 'dielectric', 'tunability', 'similar', 'to', 'widelyused', 'barium', 'strontium', 'titanate', 'and', 'as', 'a', 'result', 'both', 'giant', 'and', 'continuously', 'tunable', 'electromechanical', 'response', 'the', 'persistence', 'of', 'electrostrictive', 'and', 'tunable', 'responses', 'in', 'the', 'paraelectric', 'state', 'indicates', 'that', 'even', 'few', 'layer', 'films', 'or', 'nanoparticles', 'will', 'sustain', 'significant', 'electromechanical', 'functionality', 'offsetting', 'the', 'inevitable', 'suppression', 'of', 'ferroelectric', 'properties', 'in', 'the', 'nanoscale', 'limit', 'these', 'findings', 'can', 'likely', 'be', 'extended', 'to', 'other', 'ferroelectric', 'transition', 'metal', 'thiophosphates', 'and', 'quasi', 'twodimensional', 'materials', 'and', 'might', 'facilitate', 'the', 'quest', 'towards', 'novel', 'ultrathin', 'functional', 'devices', 'incorporating', 'electromechanical', 'response']]
|
[-0.14174971286535573, 0.20323051053644917, -0.010734977615620806, -0.04210709422779115, -0.087373084230638, -0.17117559517506953, 0.07167755298935048, 0.41390123163287196, -0.2690059190104508, -0.2943190568418681, -0.012895871778356558, -0.317647237418816, -0.19325774404403653, 0.22171945221012776, 0.010945896432616122, 0.0461776216002905, -0.06389217493257007, -0.1303208599538407, -0.07329644696030602, -0.1547560909427606, 0.18823965847820354, 0.04539157515192655, 0.3360731688936101, 0.09705877179096555, 0.06303247364739757, -0.07027353421263782, 0.17132126376360965, 0.03768626938168674, -0.1590534912317797, 0.0984561626794579, 0.3116872880747783, -0.17866135707699302, 0.24943673031747227, -0.46883250886834965, -0.2166643683560955, -0.0008195071849339265, 0.10674294580613779, 0.16985498235164057, -0.09329178795421139, -0.25357302183459074, 0.06845796058814577, -0.1695785181997392, -0.13353020180892283, -0.14720124132940884, -0.014042644544354992, 0.016370867697794684, -0.21944608696963497, 0.08090959084968184, 0.07821977471177577, 0.05821748633307726, -0.1151742369354699, -0.1628081571392792, -0.06154002135600219, 0.03527527834636213, 0.014105345232296406, 0.03796171709784147, 0.2393749844852275, -0.12626436190351534, -0.07011844158423533, 0.39644432741029123, -0.07970001022186651, -0.030517634671480623, 0.19578827717799907, -0.1795035503283529, -0.018461419556560138, 0.1846937740998526, 0.14910969905642107, 0.06090249639086503, -0.15524044483109894, 0.03735027186632267, 0.0947445953660524, 0.23412906021902752, 0.11405949514972075, 0.13702600803998313, 0.2568155796595227, 0.217041547445175, 0.00604762525389386, 0.17175233251610625, -0.05927396848329724, 0.003146454944321162, -0.15808363087050656, -0.19757051362657263, -0.2212662168047415, 0.08851880012888345, -0.13471133525580123, -0.2685414241865721, 0.36692415524293415, 0.11765558927300641, 0.11400862695851938, -0.07741200329357073, 0.220338797597866, 0.05290020534520187, 0.12150071885851767, -0.052295568385861156, 0.34730208060979223, 0.1799589100950084, 0.1548441540729737, -0.25840308302603276, 0.13643186272923, -0.035263520887440045]
|
1,803.08143
|
Theory of pore-driven and end-pulled polymer translocation dynamics
through a nanopore: An overview
|
We review recent progress on the theory of dynamics of polymer translocation
through a nanopore based on the iso-flux tension propagation (IFTP) theory. We
investigate both pore-driven translocation of flexible and a semi-flexible
polymers, and the end-pulled case of flexible chains by means of the IFTP
theory and extensive molecular dynamics (MD) simulations. The validity of the
IFTP theory can be quantified by the waiting time distributions of the monomers
which reveal the details of the dynamics of the translocation process. The IFTP
theory allows a parameter-free description of the translocation process and can
be used to derive exact analytic scaling forms in the appropriate limits,
including the influence due to the pore friction that appears as a finite-size
correction to asymptotic scaling. We show that in the case of pore-driven
semi-flexible and end-pulled polymer chains the IFTP theory must be augmented
with an explicit {\it trans} side friction term for a quantitative description
of the translocation process.
|
cond-mat.soft
|
we review recent progress on the theory of dynamics of polymer translocation through a nanopore based on the isoflux tension propagation iftp theory we investigate both poredriven translocation of flexible and a semiflexible polymers and the endpulled case of flexible chains by means of the iftp theory and extensive molecular dynamics md simulations the validity of the iftp theory can be quantified by the waiting time distributions of the monomers which reveal the details of the dynamics of the translocation process the iftp theory allows a parameterfree description of the translocation process and can be used to derive exact analytic scaling forms in the appropriate limits including the influence due to the pore friction that appears as a finitesize correction to asymptotic scaling we show that in the case of poredriven semiflexible and endpulled polymer chains the iftp theory must be augmented with an explicit it trans side friction term for a quantitative description of the translocation process
|
[['we', 'review', 'recent', 'progress', 'on', 'the', 'theory', 'of', 'dynamics', 'of', 'polymer', 'translocation', 'through', 'a', 'nanopore', 'based', 'on', 'the', 'isoflux', 'tension', 'propagation', 'iftp', 'theory', 'we', 'investigate', 'both', 'poredriven', 'translocation', 'of', 'flexible', 'and', 'a', 'semiflexible', 'polymers', 'and', 'the', 'endpulled', 'case', 'of', 'flexible', 'chains', 'by', 'means', 'of', 'the', 'iftp', 'theory', 'and', 'extensive', 'molecular', 'dynamics', 'md', 'simulations', 'the', 'validity', 'of', 'the', 'iftp', 'theory', 'can', 'be', 'quantified', 'by', 'the', 'waiting', 'time', 'distributions', 'of', 'the', 'monomers', 'which', 'reveal', 'the', 'details', 'of', 'the', 'dynamics', 'of', 'the', 'translocation', 'process', 'the', 'iftp', 'theory', 'allows', 'a', 'parameterfree', 'description', 'of', 'the', 'translocation', 'process', 'and', 'can', 'be', 'used', 'to', 'derive', 'exact', 'analytic', 'scaling', 'forms', 'in', 'the', 'appropriate', 'limits', 'including', 'the', 'influence', 'due', 'to', 'the', 'pore', 'friction', 'that', 'appears', 'as', 'a', 'finitesize', 'correction', 'to', 'asymptotic', 'scaling', 'we', 'show', 'that', 'in', 'the', 'case', 'of', 'poredriven', 'semiflexible', 'and', 'endpulled', 'polymer', 'chains', 'the', 'iftp', 'theory', 'must', 'be', 'augmented', 'with', 'an', 'explicit', 'it', 'trans', 'side', 'friction', 'term', 'for', 'a', 'quantitative', 'description', 'of', 'the', 'translocation', 'process']]
|
[-0.13191724075799216, 0.1247695975031932, -0.14478258066213665, 0.038358115886426396, -0.008332453524837127, -0.1224376918753245, 0.033488468026730396, 0.3720287281052711, -0.2715967820691637, -0.2344150148027648, 0.060774758856636114, -0.22305209623533676, -0.19101952005607578, 0.1520952540822924, 0.020647997615667872, 0.06756153654975769, 0.06622827527835631, -0.007247143566089038, -0.0126910655407044, -0.15095990080734714, 0.19668120271168077, 0.10406622406429587, 0.2770918973375303, 0.1206925169725974, 0.08193845501712833, 0.04173827242667381, -0.0013698832690118789, 0.05799151861589426, -0.26200657644510966, 0.13595316807428995, 0.16358319531905297, 0.02273773674805386, 0.2344235902837215, -0.5186971722361751, -0.25245924243697515, 0.02833682109709256, 0.18550889440088306, 0.15243293472061245, 0.0054695858688762365, -0.2693426846325075, 0.035019736898203306, -0.1770165629314784, -0.11712582533259709, -0.06555324980441722, 0.04487414280764568, 0.09323345442454084, -0.24216625409406753, 0.10861861189672102, 0.033291887112845406, 0.052572751889387384, -0.01902636940305969, -0.04534208987099238, 0.011054768438976353, 0.13099014951522128, 0.10114089945179727, -0.0007174859772651241, 0.23538324899541643, -0.13763594453055888, -0.08313247193701756, 0.3636463809436044, -0.053249200977659665, -0.23280237389591116, 0.19112235837383196, -0.10652594078531435, -0.13507235632875028, 0.13700844645679283, 0.12062761526202592, 0.10383040606468104, -0.17011893963894975, 0.1036542849812973, 0.0014972847301321917, 0.1750589830409855, 0.05181681861480077, -0.030336511100475222, 0.17317142668598068, 0.20945065558696976, -0.014031718688037915, 0.16609309491095467, -0.06617983009439343, -0.19428182090334117, -0.2925640773863938, -0.18707718575024046, -0.16832109636221176, 0.08136649224578808, -0.12348391025993923, -0.17853276890393596, 0.3429444070893507, 0.12042952158924145, 0.16554599538899195, 0.12224885732165347, 0.22230394435330078, 0.0848246016621721, 0.009832451275239388, -0.0021781498679700187, 0.18653598787764517, 0.1768757721486812, 0.06934569507407454, -0.2838602452956809, 0.08525109829646774, 0.07364607726832709]
|
1,803.08144
|
Constraints on mass, spin and magnetic field of microquasar H~1743-322
from observations of QPOs
|
The study of quasi-periodic oscillations (QPOs) of X-ray flux observed in
many microquasars can provide a powerful tool for testing of the phenomena
occurring in strong gravity regime. QPOs phenomena can be well related to the
oscillations of charged particles in accretion disks orbiting Kerr black holes
immersed in external large-scale magnetic fields. In the present paper we study
the model of magnetic relativistic precession and provide estimations of the
mass and spin of the central object of the microquasar H~1743-322 which is a
candidate for a black hole. Moreover, we discuss the possible values of
external magnetic field and study its influence on the motion of charged
particles around rotating black hole.
|
astro-ph.HE
|
the study of quasiperiodic oscillations qpos of xray flux observed in many microquasars can provide a powerful tool for testing of the phenomena occurring in strong gravity regime qpos phenomena can be well related to the oscillations of charged particles in accretion disks orbiting kerr black holes immersed in external largescale magnetic fields in the present paper we study the model of magnetic relativistic precession and provide estimations of the mass and spin of the central object of the microquasar h1743322 which is a candidate for a black hole moreover we discuss the possible values of external magnetic field and study its influence on the motion of charged particles around rotating black hole
|
[['the', 'study', 'of', 'quasiperiodic', 'oscillations', 'qpos', 'of', 'xray', 'flux', 'observed', 'in', 'many', 'microquasars', 'can', 'provide', 'a', 'powerful', 'tool', 'for', 'testing', 'of', 'the', 'phenomena', 'occurring', 'in', 'strong', 'gravity', 'regime', 'qpos', 'phenomena', 'can', 'be', 'well', 'related', 'to', 'the', 'oscillations', 'of', 'charged', 'particles', 'in', 'accretion', 'disks', 'orbiting', 'kerr', 'black', 'holes', 'immersed', 'in', 'external', 'largescale', 'magnetic', 'fields', 'in', 'the', 'present', 'paper', 'we', 'study', 'the', 'model', 'of', 'magnetic', 'relativistic', 'precession', 'and', 'provide', 'estimations', 'of', 'the', 'mass', 'and', 'spin', 'of', 'the', 'central', 'object', 'of', 'the', 'microquasar', 'h1743322', 'which', 'is', 'a', 'candidate', 'for', 'a', 'black', 'hole', 'moreover', 'we', 'discuss', 'the', 'possible', 'values', 'of', 'external', 'magnetic', 'field', 'and', 'study', 'its', 'influence', 'on', 'the', 'motion', 'of', 'charged', 'particles', 'around', 'rotating', 'black', 'hole']]
|
[-0.18832548336430857, 0.15478695249926727, -0.024838366211944185, 0.1625359784172996, -0.08164606328623007, -0.10317923593441997, 0.005641811068862084, 0.3259812458129847, -0.15741452810445192, -0.34793106240822536, 0.06572899903043017, -0.2773700432034943, -0.060359969817563495, 0.26754381167867214, -0.01964054737998321, 0.01724358491738125, 0.022223025927138804, 0.021362633844610898, -0.04660510071563592, -0.13657478043455137, 0.32217436456080295, 0.07841730126863823, 0.16034361498586966, -0.011186753778792588, 0.06629106510364641, -0.020473365795559587, 0.047687105677890036, 0.05006050162709656, -0.143932358379552, 0.036931118285036195, 0.19759364421603032, 0.05474270485028361, 0.19218869386158421, -0.42550056608212466, -0.24566681756415462, 0.0594849381513432, 0.16142195168536452, 0.12296913348167178, -0.14571916125405712, -0.26916841837058286, 0.04390261813625281, -0.20767060335956317, -0.18965033961839117, -0.04767926331543553, 0.06680909233616945, 0.0314422395199834, -0.23604183812188892, 0.1451733857063593, 0.1216237880392577, -0.0013712817840113314, -0.17266368348897326, 0.017722876099622354, -0.0015016026667162643, 0.08475131801519115, 0.1790999392412224, 0.054279120274267234, 0.22323929997721473, -0.135618263080848, -0.17121506661209648, 0.3811735129303225, -0.07107413445179046, -0.11114987792793364, 0.22163992876648508, -0.30350772389499225, -0.14543221095593367, 0.10530802342150591, 0.2358529038265743, 0.19572587914979167, -0.1517092642679283, 0.058883529332099664, -0.04540010695180864, 0.15469036071635453, 0.06958659368632072, 0.08526252984868742, 0.4532793328100074, 0.1629267361486924, -0.042296495910350694, 0.19330204402166626, -0.18820164952451873, -0.0211987272487022, -0.2419144509409645, -0.1296272800444106, -0.12514788501038818, 0.08720030292582212, -0.11241858909939378, -0.20145918193182585, 0.39801019248016906, 0.1357009788208633, 0.17960644357598723, -0.08877539075189889, 0.257044619602102, 0.08103839874234611, 0.007905501167627825, 0.11578577053032618, 0.36598778232124396, 0.1934565393402513, 0.13466971537584554, -0.28509384799600307, -0.020512789706246252, 0.049638222251911605]
|
1,803.08145
|
Circular repetition thresholds on some small alphabets: Last cases of
Gorbunova's conjecture
|
A word is called $\beta$-free if it has no factors of exponent greater than
or equal to $\beta$. The repetition threshold $\mathrm{RT}(k)$ is the infimum
of the set of all $\beta$ such that there are arbitrarily long $k$-ary
$\beta$-free words (or equivalently, there are $k$-ary $\beta$-free words of
every sufficiently large length, or even every length). These three equivalent
definitions of the repetition threshold give rise to three natural definitions
of a repetition threshold for circular words. The infimum of the set of all
$\beta$ such that
- there are arbitrarily long $k$-ary $\beta$-free circular words is called
the weak circular repetition threshold, denoted $\mathrm{CRT}_{\mathrm{W}}(k)$;
- there are $k$-ary $\beta$-free circular words of every sufficiently large
length is called the intermediate circular repetition threshold, denoted
$\mathrm{CRT}_{\mathrm{I}}(k)$;
- there are $k$-ary $\beta$-free circular words of every length is called the
strong circular repetition threshold, denoted $\mathrm{CRT}_{\mathrm{S}}(k)$.
We prove that $\mathrm{CRT}_{\mathrm{S}}(4)=\tfrac{3}{2}$ and
$\mathrm{CRT}_{\mathrm{S}}(5)=\tfrac{4}{3}$, confirming a conjecture of
Gorbunova and providing the last unknown values of the strong circular
repetition threshold. We also prove that
$\mathrm{CRT}_{\mathrm{I}}(3)=\mathrm{CRT}_{\mathrm{W}}(3)=\mathrm{RT}(3)=\tfrac{7}{4}$.
|
math.CO cs.FL
|
a word is called betafree if it has no factors of exponent greater than or equal to beta the repetition threshold mathrmrtk is the infimum of the set of all beta such that there are arbitrarily long kary betafree words or equivalently there are kary betafree words of every sufficiently large length or even every length these three equivalent definitions of the repetition threshold give rise to three natural definitions of a repetition threshold for circular words the infimum of the set of all beta such that there are arbitrarily long kary betafree circular words is called the weak circular repetition threshold denoted mathrmcrt_mathrmwk there are kary betafree circular words of every sufficiently large length is called the intermediate circular repetition threshold denoted mathrmcrt_mathrmik there are kary betafree circular words of every length is called the strong circular repetition threshold denoted mathrmcrt_mathrmsk we prove that mathrmcrt_mathrms4tfrac32 and mathrmcrt_mathrms5tfrac43 confirming a conjecture of gorbunova and providing the last unknown values of the strong circular repetition threshold we also prove that mathrmcrt_mathrmi3mathrmcrt_mathrmw3mathrmrt3tfrac74
|
[['a', 'word', 'is', 'called', 'betafree', 'if', 'it', 'has', 'no', 'factors', 'of', 'exponent', 'greater', 'than', 'or', 'equal', 'to', 'beta', 'the', 'repetition', 'threshold', 'mathrmrtk', 'is', 'the', 'infimum', 'of', 'the', 'set', 'of', 'all', 'beta', 'such', 'that', 'there', 'are', 'arbitrarily', 'long', 'kary', 'betafree', 'words', 'or', 'equivalently', 'there', 'are', 'kary', 'betafree', 'words', 'of', 'every', 'sufficiently', 'large', 'length', 'or', 'even', 'every', 'length', 'these', 'three', 'equivalent', 'definitions', 'of', 'the', 'repetition', 'threshold', 'give', 'rise', 'to', 'three', 'natural', 'definitions', 'of', 'a', 'repetition', 'threshold', 'for', 'circular', 'words', 'the', 'infimum', 'of', 'the', 'set', 'of', 'all', 'beta', 'such', 'that', 'there', 'are', 'arbitrarily', 'long', 'kary', 'betafree', 'circular', 'words', 'is', 'called', 'the', 'weak', 'circular', 'repetition', 'threshold', 'denoted', 'mathrmcrt_mathrmwk', 'there', 'are', 'kary', 'betafree', 'circular', 'words', 'of', 'every', 'sufficiently', 'large', 'length', 'is', 'called', 'the', 'intermediate', 'circular', 'repetition', 'threshold', 'denoted', 'mathrmcrt_mathrmik', 'there', 'are', 'kary', 'betafree', 'circular', 'words', 'of', 'every', 'length', 'is', 'called', 'the', 'strong', 'circular', 'repetition', 'threshold', 'denoted', 'mathrmcrt_mathrmsk', 'we', 'prove', 'that', 'mathrmcrt_mathrms4tfrac32', 'and', 'mathrmcrt_mathrms5tfrac43', 'confirming', 'a', 'conjecture', 'of', 'gorbunova', 'and', 'providing', 'the', 'last', 'unknown', 'values', 'of', 'the', 'strong', 'circular', 'repetition', 'threshold', 'we', 'also', 'prove', 'that', 'mathrmcrt_mathrmi3mathrmcrt_mathrmw3mathrmrt3tfrac74']]
|
[-0.22252725606301316, 0.2564078464322252, 0.020204617271061848, 0.10999123879239814, -0.055323604786449494, -0.20923410678845772, 0.036311177240776614, 0.3994753854924146, -0.3092637060750506, -0.22527885713246593, 0.09870984068393339, -0.3038686243572882, -0.09122265252014507, 0.21449039901540626, -0.03282881884643072, 0.06245955562064163, 0.06168428343364302, 0.16169006768384098, -0.003939467638926466, -0.23633793791767532, 0.2888450291220467, 0.0022083411042084114, 0.21241088315016693, 0.059608801497278714, 0.14910484173760555, 0.02420163912307701, 0.013105327303716798, 0.061926583437548005, -0.17625303683823326, 0.06962078494123286, 0.23759293264169015, 0.17206570536852528, 0.29090445511686946, -0.29013208770926147, -0.11383121764074643, 0.18944979696477085, 0.10954381881804884, 0.08669950956777658, -0.023165747155377895, -0.16842015486003625, 0.21919540318381617, -0.17089479146985176, -0.08457711793735255, 0.03938428328636988, 0.17255074557931635, 0.07064722315120844, -0.2768562335871666, 0.0032679026363989522, 0.1616458637225959, 0.07443785488053604, 0.04830574162913785, -0.12680600031658454, 0.006193038231382768, 0.10618587820302051, 0.03122289396138333, 0.06730924887916097, 0.05493892097908912, -0.08547031440065, -0.1567219462659624, 0.34769902745100817, -0.07119361155878043, -0.16535129444098767, 0.13523542023131646, -0.17837044766552193, -0.11683653682803759, 0.16382897588320905, 0.06963084578905025, 0.12942025588572392, -0.03642693626188478, 0.0891467728767038, -0.14988021455406222, 0.23332728246617832, 0.2926333173333357, 0.06935239178746548, 0.20535567018812823, 0.12729518673739132, 0.13178426858589606, 0.1290728934109211, -0.05683063991068874, -0.012195131988667044, -0.28880216565879957, -0.07878973516980531, -0.14733367716105955, 0.04165222295804271, -0.10519271953024953, -0.23261190901717377, 0.3243832062803393, 0.071322199987696, 0.1934216051523424, 0.16717372077551704, 0.20002914128112204, 0.14843311465656484, 0.09503437841115635, 0.1492697868099505, 0.13480476531441565, 0.11497511141818523, -0.06768361155955512, -0.14573014995232683, 0.09716210867864666, 0.09059093068756255]
|
1,803.08146
|
Mapping The Neutrino Floor For Dark Matter-Electron Direct Detection
Experiments
|
We study the discovery reach of future Dark Matter (DM) Direct Detection
experiments using DM-electron scattering in the presence of the solar neutrino
background. At these low energies traditional methods for nuclear and
electronic recoil discrimination fail, implying that the neutrino-{\it nucleus}
scattering background can be sizable. We calculate discovery limits based on
ionization values of signal and background, and quantify the dependence on the
ionization model. Moreover, we explore how the dependence of the DM cross
section discovery limits vary with exposure, electronic/nuclear recoil
discrimination, DM form factors, and DM astrophysical uncertainties.
|
hep-ph
|
we study the discovery reach of future dark matter dm direct detection experiments using dmelectron scattering in the presence of the solar neutrino background at these low energies traditional methods for nuclear and electronic recoil discrimination fail implying that the neutrinoit nucleus scattering background can be sizable we calculate discovery limits based on ionization values of signal and background and quantify the dependence on the ionization model moreover we explore how the dependence of the dm cross section discovery limits vary with exposure electronicnuclear recoil discrimination dm form factors and dm astrophysical uncertainties
|
[['we', 'study', 'the', 'discovery', 'reach', 'of', 'future', 'dark', 'matter', 'dm', 'direct', 'detection', 'experiments', 'using', 'dmelectron', 'scattering', 'in', 'the', 'presence', 'of', 'the', 'solar', 'neutrino', 'background', 'at', 'these', 'low', 'energies', 'traditional', 'methods', 'for', 'nuclear', 'and', 'electronic', 'recoil', 'discrimination', 'fail', 'implying', 'that', 'the', 'neutrinoit', 'nucleus', 'scattering', 'background', 'can', 'be', 'sizable', 'we', 'calculate', 'discovery', 'limits', 'based', 'on', 'ionization', 'values', 'of', 'signal', 'and', 'background', 'and', 'quantify', 'the', 'dependence', 'on', 'the', 'ionization', 'model', 'moreover', 'we', 'explore', 'how', 'the', 'dependence', 'of', 'the', 'dm', 'cross', 'section', 'discovery', 'limits', 'vary', 'with', 'exposure', 'electronicnuclear', 'recoil', 'discrimination', 'dm', 'form', 'factors', 'and', 'dm', 'astrophysical', 'uncertainties']]
|
[-0.05377128915152634, 0.15683493055605693, -0.07270565311647141, 0.15310032418600042, -0.07132969179909433, -0.06950125503151314, 0.04419831862754148, 0.3409296359218981, -0.2062444360420594, -0.3845314197495337, 0.007409571516884329, -0.32747468846323696, -0.007532213191987704, 0.18470752676290905, 0.09595065638321736, -0.009124908035553981, 0.04276453900282555, 0.009318196558919937, -0.10439921072026229, -0.2194265667754023, 0.2853653903382466, 0.13334594174976583, 0.24601556088410967, 0.155266623139339, 0.09242971220215701, 0.04752391619283868, -0.08291062381644936, -0.07333758190962607, -0.1574965537723904, 0.07904122421092799, 0.23339254562692394, 0.09975412660582073, 0.07913597556003167, -0.4069868124130627, -0.2006424082564595, 0.19140659942818078, 0.14778430749024468, 0.09970247800178501, -0.10420370366393952, -0.3266217927043529, 0.013135921075287193, -0.2360929751606739, -0.07392556171449226, -0.0733699555655577, -0.011530338786542416, -0.000570138311519733, -0.2320603325801051, 0.11215064679424319, -0.050105872731048454, -0.05765342160694949, -0.10644183879444229, -0.16217915206621197, 0.04990210624300349, 0.03233714996958557, 0.09899751891498454, -0.05274909040030173, 0.3101332280455846, -0.20820820418125746, -0.11593765239028828, 0.37918868425059254, -0.13443066715515908, -0.12085634846564221, 0.16305421422610222, -0.20718685173146104, -0.153164365452856, 0.20408796398576512, 0.22445705896952067, 0.04614793085847455, -0.12785037578609976, 0.09733255579086962, 0.02716890556494827, 0.1932832218868577, 0.09220365377436594, 0.07075607610496935, 0.2891693262423834, 0.22009134234901032, 0.045777794821491545, -0.033124333107084764, -0.24757831148378065, 0.00532243006012362, -0.3241409622841393, -0.09355389951404346, -0.07485823205712697, 0.04810069569477649, -0.06586202711870377, -0.09437237564555329, 0.3378550916196495, 0.16859669809776318, 0.20720363275967943, -0.029541588332706495, 0.3256516822337922, 0.12172763268767006, -0.012767913746242613, 0.011178273120490105, 0.3809801123216343, 0.17087027785854172, 0.036475803358885256, -0.27309089362540323, 0.0973876854569307, -0.0547359389576899]
|
1,803.08147
|
The Pontrjagin Dual of 4-Dimensional Spin Bordism
|
The goal of this paper is to study the Pontrjagin dual of (reduced)
4-dimensional Spin bordism. That is to say, we consider the functor from the
category of topological spaces to the category of compact abelian groups that
associates to each space X the compact group of homomorphisms from the reduced
4-dimensional Spin bordism of X to the circle. In a previous paper, we studied
the analogous problem for 3-dimensional Spin bordism. Our work was motivated by
some questions from physics. The physicists are primarily interested in the
case when X is the classifying space of a finite group, but our arguments are
valid for general X. We describe the dual group, G(X), as equivalence classes
of triples of cochains (w,p,a) on X, triples satisfying certain relations with
a product. We also describe the pairing between such triples and a closed
4-dimensional Spin manifold mapping to X, the pairing that produces the
identification of G(X) with the Pontrjagin dual of the reduced 4-dimensional
Spin bordism of X.
|
math.GT
|
the goal of this paper is to study the pontrjagin dual of reduced 4dimensional spin bordism that is to say we consider the functor from the category of topological spaces to the category of compact abelian groups that associates to each space x the compact group of homomorphisms from the reduced 4dimensional spin bordism of x to the circle in a previous paper we studied the analogous problem for 3dimensional spin bordism our work was motivated by some questions from physics the physicists are primarily interested in the case when x is the classifying space of a finite group but our arguments are valid for general x we describe the dual group gx as equivalence classes of triples of cochains wpa on x triples satisfying certain relations with a product we also describe the pairing between such triples and a closed 4dimensional spin manifold mapping to x the pairing that produces the identification of gx with the pontrjagin dual of the reduced 4dimensional spin bordism of x
|
[['the', 'goal', 'of', 'this', 'paper', 'is', 'to', 'study', 'the', 'pontrjagin', 'dual', 'of', 'reduced', '4dimensional', 'spin', 'bordism', 'that', 'is', 'to', 'say', 'we', 'consider', 'the', 'functor', 'from', 'the', 'category', 'of', 'topological', 'spaces', 'to', 'the', 'category', 'of', 'compact', 'abelian', 'groups', 'that', 'associates', 'to', 'each', 'space', 'x', 'the', 'compact', 'group', 'of', 'homomorphisms', 'from', 'the', 'reduced', '4dimensional', 'spin', 'bordism', 'of', 'x', 'to', 'the', 'circle', 'in', 'a', 'previous', 'paper', 'we', 'studied', 'the', 'analogous', 'problem', 'for', '3dimensional', 'spin', 'bordism', 'our', 'work', 'was', 'motivated', 'by', 'some', 'questions', 'from', 'physics', 'the', 'physicists', 'are', 'primarily', 'interested', 'in', 'the', 'case', 'when', 'x', 'is', 'the', 'classifying', 'space', 'of', 'a', 'finite', 'group', 'but', 'our', 'arguments', 'are', 'valid', 'for', 'general', 'x', 'we', 'describe', 'the', 'dual', 'group', 'gx', 'as', 'equivalence', 'classes', 'of', 'triples', 'of', 'cochains', 'wpa', 'on', 'x', 'triples', 'satisfying', 'certain', 'relations', 'with', 'a', 'product', 'we', 'also', 'describe', 'the', 'pairing', 'between', 'such', 'triples', 'and', 'a', 'closed', '4dimensional', 'spin', 'manifold', 'mapping', 'to', 'x', 'the', 'pairing', 'that', 'produces', 'the', 'identification', 'of', 'gx', 'with', 'the', 'pontrjagin', 'dual', 'of', 'the', 'reduced', '4dimensional', 'spin', 'bordism', 'of', 'x']]
|
[-0.1740484587209645, 0.10603522115615671, -0.06521880578718142, 0.07399348429582656, -0.10218283786120529, -0.09626655611293224, 0.00762891542120463, 0.3590949088959637, -0.31280369352560466, -0.22264656094986873, 0.06385098113176485, -0.26086300292817743, -0.13496178908909331, 0.19578377913103667, -0.14058196306797469, -0.04217491633799708, 0.008177213654518796, 0.11752987002206598, -0.17515695676999446, -0.26015959269489847, 0.46477913149370403, -0.05288267614665681, 0.22996579002990516, 0.0028282901673705994, 0.12546471219431765, 0.044781028279131226, -0.0034705876082761914, 0.006119364459544398, -0.1349738878580936, 0.16854148622376364, 0.3194697356174984, 0.06300613790482817, 0.14532527169017512, -0.3450080795425498, -0.166885871752472, 0.15527307580108057, 0.07767951879915251, 0.011240993648722858, -0.014275294313803984, -0.297582617117382, 0.11006096508326065, -0.18921551741603873, -0.11770461058846401, -0.054514273870067145, 0.06467848471059146, -0.0019221744196166, -0.21086430752616442, -0.021008964506860454, 0.10134398592580221, 0.050777008740264855, -0.08182789469493308, -0.05966747305871818, -0.07697285674052302, 0.12038365298617927, 0.03638592098412957, 0.1051373940817231, 0.10355632837226023, -0.08381415184721083, -0.14247731501403862, 0.3906645021752683, -0.03548342386305243, -0.2157789879049102, 0.13416655628501387, -0.1874947053670303, -0.19967251420188362, 0.12148311164600964, 0.08883780956513689, 0.19797628343629534, -0.055917007289983715, 0.19640866679823984, -0.14120165029440276, 0.10437449130012158, 0.01902575998617236, 0.019049611189723304, 0.18453640502202742, 0.13331919301072592, 0.0639365638625769, 0.1533221358065298, -0.014571536521979435, -0.036718116439865, -0.3360465301903422, -0.217693855157847, -0.14279592962946722, 0.17581441110239815, -0.06475212336592809, -0.14413032755060512, 0.3989051329864267, 0.09150682257008767, 0.18822272147001798, 0.09062467700617756, 0.19901284985913487, 0.0356365664531672, 0.01865721958784197, 0.03506731963855867, 0.12513411604373403, 0.21979501242693625, -0.01920682614847661, -0.17075760930101805, -0.06365914960129711, 0.19241804983132257]
|
1,803.08148
|
Large anomalous Nernst coefficient in an oxide Skyrmion crystal Chern
insulator
|
A sizable transverse thermoelectric coefficient N , large to the extent that
it potentially serves applications, is predicted to arise, by means of
first-principles calculations, in a Skyrmion crystal assumed on EuO monolayer
where carrier electrons are introduced upon a quantum anomalous Hall insulating
phase of Chern number C = 2. This encourages future experiments to pursue such
an effect.
|
cond-mat.str-el cond-mat.mtrl-sci
|
a sizable transverse thermoelectric coefficient n large to the extent that it potentially serves applications is predicted to arise by means of firstprinciples calculations in a skyrmion crystal assumed on euo monolayer where carrier electrons are introduced upon a quantum anomalous hall insulating phase of chern number c 2 this encourages future experiments to pursue such an effect
|
[['a', 'sizable', 'transverse', 'thermoelectric', 'coefficient', 'n', 'large', 'to', 'the', 'extent', 'that', 'it', 'potentially', 'serves', 'applications', 'is', 'predicted', 'to', 'arise', 'by', 'means', 'of', 'firstprinciples', 'calculations', 'in', 'a', 'skyrmion', 'crystal', 'assumed', 'on', 'euo', 'monolayer', 'where', 'carrier', 'electrons', 'are', 'introduced', 'upon', 'a', 'quantum', 'anomalous', 'hall', 'insulating', 'phase', 'of', 'chern', 'number', 'c', '2', 'this', 'encourages', 'future', 'experiments', 'to', 'pursue', 'such', 'an', 'effect']]
|
[-0.18851513985458135, 0.24831737641567275, -0.025628708592005844, -0.00024505096873075796, -0.10456082904871938, -0.16108355832543095, 0.10255335111989929, 0.3661665386070722, -0.2729290705816499, -0.2965325616251934, -0.0488076472658953, -0.31983322618079596, -0.17885503602005412, 0.20241221042895882, 0.006519606842755757, 0.07163143469269612, -0.05722055259283134, -0.06861941230579696, -0.06805153126459054, -0.24365403700684166, 0.2208317352201918, 0.05534994153201516, 0.29614162549440715, 0.13043999765871156, 0.03614444744066689, -0.019252859489542657, 0.07397619269563463, 0.05857662050503081, -0.1726947624181399, 0.038892433159695615, 0.3042048853902339, -0.13196811299160893, 0.2303315059699375, -0.4556839383560522, -0.20159673372460207, 0.016142135983782595, 0.11186265835442163, 0.15949506742943978, -0.08948561893816202, -0.26018418230373286, 0.08536724012710378, -0.20829738784131818, -0.11810304936631744, -0.12571788977044795, 0.005165348198778671, -0.07680256221571873, -0.2702814850410254, 0.04879796257290732, 0.018287177446523105, 0.052128596282398514, -0.013205758057101148, -0.16232961006382288, -0.060367295518517494, 0.02129745665648631, 0.07751151968741082, 0.06822881133070793, 0.1982607371013226, -0.12567758611162547, -0.15434874172707827, 0.4125049865065977, -0.04698722594385517, -0.15875552443723226, 0.129660361518698, -0.18075743140171058, -0.0688865268362108, 0.14880284133913188, 0.13954142513102852, 0.08859949692650217, -0.056110024436152185, 0.09751231807830005, -0.052558494898879995, 0.17788272325334878, -0.008056721051930097, 0.07825082733199515, 0.269014200131441, 0.18283500975190564, 0.046363852428400826, 0.12377530419075027, -0.10071403908559345, -0.0010908165472912892, -0.2229898084147737, -0.2107796316548925, -0.28558871047250156, 0.14250363831022947, -0.06429505486900372, -0.1728114273603845, 0.38653810990267784, 0.15292841614352476, 0.19188532352062135, -0.08732424836991162, 0.21767675648202542, 0.09365980110356006, 0.08617546532407468, 0.007504764695427027, 0.2161226449373724, 0.15369666503051874, 0.12217698121796651, -0.2594205871272575, 0.08862123865602088, 0.02809712357803023]
|
1,803.08149
|
Spinning boson stars and hairy black holes with non-minimal coupling
|
We obtain spinning boson star solutions and hairy black holes with
synchronised hair in the Einstein-Klein-Gordon model, wherein the scalar field
is massive, complex and with a non-minimal coupling to the Ricci scalar. The
existence of these hairy black holes in this model provides yet another
manifestation of the universality of the synchronisation mechanism to endow
spinning black holes with hair. We study the variation of the physical
properties of the boson stars and hairy black holes with the coupling parameter
between the scalar field and the curvature, showing that they are,
qualitatively, identical to those in the minimally coupled case. By discussing
the conformal transformation to the Einstein frame, we argue that the solutions
herein provide new rotating boson star and hairy black hole solutions in the
minimally coupled theory, with a particular potential, and that no spherically
symmetric hairy black hole solutions exist in the non-minimally coupled theory,
under a condition of conformal regularity.
|
gr-qc
|
we obtain spinning boson star solutions and hairy black holes with synchronised hair in the einsteinkleingordon model wherein the scalar field is massive complex and with a nonminimal coupling to the ricci scalar the existence of these hairy black holes in this model provides yet another manifestation of the universality of the synchronisation mechanism to endow spinning black holes with hair we study the variation of the physical properties of the boson stars and hairy black holes with the coupling parameter between the scalar field and the curvature showing that they are qualitatively identical to those in the minimally coupled case by discussing the conformal transformation to the einstein frame we argue that the solutions herein provide new rotating boson star and hairy black hole solutions in the minimally coupled theory with a particular potential and that no spherically symmetric hairy black hole solutions exist in the nonminimally coupled theory under a condition of conformal regularity
|
[['we', 'obtain', 'spinning', 'boson', 'star', 'solutions', 'and', 'hairy', 'black', 'holes', 'with', 'synchronised', 'hair', 'in', 'the', 'einsteinkleingordon', 'model', 'wherein', 'the', 'scalar', 'field', 'is', 'massive', 'complex', 'and', 'with', 'a', 'nonminimal', 'coupling', 'to', 'the', 'ricci', 'scalar', 'the', 'existence', 'of', 'these', 'hairy', 'black', 'holes', 'in', 'this', 'model', 'provides', 'yet', 'another', 'manifestation', 'of', 'the', 'universality', 'of', 'the', 'synchronisation', 'mechanism', 'to', 'endow', 'spinning', 'black', 'holes', 'with', 'hair', 'we', 'study', 'the', 'variation', 'of', 'the', 'physical', 'properties', 'of', 'the', 'boson', 'stars', 'and', 'hairy', 'black', 'holes', 'with', 'the', 'coupling', 'parameter', 'between', 'the', 'scalar', 'field', 'and', 'the', 'curvature', 'showing', 'that', 'they', 'are', 'qualitatively', 'identical', 'to', 'those', 'in', 'the', 'minimally', 'coupled', 'case', 'by', 'discussing', 'the', 'conformal', 'transformation', 'to', 'the', 'einstein', 'frame', 'we', 'argue', 'that', 'the', 'solutions', 'herein', 'provide', 'new', 'rotating', 'boson', 'star', 'and', 'hairy', 'black', 'hole', 'solutions', 'in', 'the', 'minimally', 'coupled', 'theory', 'with', 'a', 'particular', 'potential', 'and', 'that', 'no', 'spherically', 'symmetric', 'hairy', 'black', 'hole', 'solutions', 'exist', 'in', 'the', 'nonminimally', 'coupled', 'theory', 'under', 'a', 'condition', 'of', 'conformal', 'regularity']]
|
[-0.18614412946566844, 0.14966456158361277, -0.0434917027047889, 0.11553964345381619, -0.12232566200411664, -0.20567672319698316, -0.03735279499177033, 0.28349787700706375, -0.12524239678914922, -0.2829187285059538, 0.05924649829065833, -0.32123600427682203, -0.1498828464641403, 0.11375977511768444, -0.03234467490050846, 0.02250496334193322, 0.01558110033436559, 0.08890363584046448, -0.06991365287551442, -0.21960901743911493, 0.41564566642344475, 0.021102219230483454, 0.1987022607563398, -0.01905385462323932, 0.07601888706453909, -0.039064070084490456, 0.07723982564997502, 0.05691317890961774, -0.18986788857051953, 0.07453565923974682, 0.16696348742772946, 0.11337395286103949, 0.18552513861169034, -0.39752366913195986, -0.2266477706710784, 0.11182471539061038, 0.151971885537466, 0.17777914375451823, -0.17567111923693654, -0.28578891466485146, 0.1138194127766511, -0.21691020048307016, -0.18394584590472127, -0.06134455850891148, 0.01981709517675858, -0.03569343286261965, -0.2408142853237223, 0.11923375139796032, 0.07334169397990291, -0.09439337198347904, -0.17026685684238776, 0.04383033334325331, -0.0973174764135948, 0.04927665031909083, 0.18626751831004348, 0.030724389721842434, 0.1456390357000204, -0.16890727236825162, -0.11444152245605484, 0.3451782675364461, -0.1191428650307875, -0.2544963523112715, 0.2016823425805435, -0.23115663999208033, -0.12498492477998997, 0.08316726729763338, 0.14416022870976192, 0.23630919746266535, -0.16432602216567224, 0.15268820381009926, 0.0020993970221099565, 0.17616027563986464, 0.11526837810360564, 0.07439145553507842, 0.430446641609216, 0.10011224029436469, -0.00904556991866766, 0.1784391085862015, 0.020097386262093026, -0.15575440741705301, -0.3382314062701204, -0.15102573200308073, -0.0793336542421737, 0.10809904799008599, -0.20008987312235732, -0.2219977842237896, 0.36034527219808066, 0.09325119735018607, 0.14776511296319464, 0.037103748528095774, 0.1993434889984014, 0.07095252660264333, 0.044379818271129176, 0.11196789066963948, 0.3925802559376909, 0.2201048048132529, 0.1577428192159949, -0.24327923966988096, -0.1349555199356893, 0.11608740497225274]
|
1,803.0815
|
Generic Zero-Cost Reuse for Dependent Types
|
Dependently typed languages are well known for having a problem with code
reuse. Traditional non-indexed algebraic datatypes (e.g. lists) appear
alongside a plethora of indexed variations (e.g. vectors). Functions are often
rewritten for both non-indexed and indexed versions of essentially the same
datatype, which is a source of code duplication.
We work in a Curry-style dependent type theory, where the same untyped term
may be classified as both the non-indexed and indexed versions of a datatype.
Many solutions have been proposed for the problem of dependently typed reuse,
but we exploit Curry-style type theory in our solution to not only reuse data
and programs, but do so at zero-cost (without a runtime penalty). Our work is
an exercise in dependently typed generic programming, and internalizes the
process of zero-cost reuse as the identity function in a Curry-style theory.
|
cs.PL
|
dependently typed languages are well known for having a problem with code reuse traditional nonindexed algebraic datatypes eg lists appear alongside a plethora of indexed variations eg vectors functions are often rewritten for both nonindexed and indexed versions of essentially the same datatype which is a source of code duplication we work in a currystyle dependent type theory where the same untyped term may be classified as both the nonindexed and indexed versions of a datatype many solutions have been proposed for the problem of dependently typed reuse but we exploit currystyle type theory in our solution to not only reuse data and programs but do so at zerocost without a runtime penalty our work is an exercise in dependently typed generic programming and internalizes the process of zerocost reuse as the identity function in a currystyle theory
|
[['dependently', 'typed', 'languages', 'are', 'well', 'known', 'for', 'having', 'a', 'problem', 'with', 'code', 'reuse', 'traditional', 'nonindexed', 'algebraic', 'datatypes', 'eg', 'lists', 'appear', 'alongside', 'a', 'plethora', 'of', 'indexed', 'variations', 'eg', 'vectors', 'functions', 'are', 'often', 'rewritten', 'for', 'both', 'nonindexed', 'and', 'indexed', 'versions', 'of', 'essentially', 'the', 'same', 'datatype', 'which', 'is', 'a', 'source', 'of', 'code', 'duplication', 'we', 'work', 'in', 'a', 'currystyle', 'dependent', 'type', 'theory', 'where', 'the', 'same', 'untyped', 'term', 'may', 'be', 'classified', 'as', 'both', 'the', 'nonindexed', 'and', 'indexed', 'versions', 'of', 'a', 'datatype', 'many', 'solutions', 'have', 'been', 'proposed', 'for', 'the', 'problem', 'of', 'dependently', 'typed', 'reuse', 'but', 'we', 'exploit', 'currystyle', 'type', 'theory', 'in', 'our', 'solution', 'to', 'not', 'only', 'reuse', 'data', 'and', 'programs', 'but', 'do', 'so', 'at', 'zerocost', 'without', 'a', 'runtime', 'penalty', 'our', 'work', 'is', 'an', 'exercise', 'in', 'dependently', 'typed', 'generic', 'programming', 'and', 'internalizes', 'the', 'process', 'of', 'zerocost', 'reuse', 'as', 'the', 'identity', 'function', 'in', 'a', 'currystyle', 'theory']]
|
[-0.10967143023710536, 0.02032851878027651, -0.06944985439042574, 0.11635011780306714, -0.16725352053881448, -0.19068505589393023, 0.05864140717228335, 0.3520512014721939, -0.3392307233348813, -0.3169226847400052, 0.14424642674166008, -0.2549824877389018, -0.10556004447457583, 0.17450411310773747, -0.11120342125819213, 0.016289181150226057, 0.027383715157275616, 0.029832654251325606, -0.05604940255685453, -0.23473718441327682, 0.32134440231838846, -0.00468785316258183, 0.23044931508796423, -0.00037664014751604503, 0.06265968011196135, 0.015592010546664613, -0.07549981424159816, 0.04480313862533902, -0.04586813650783607, 0.09502395458580197, 0.33833274198021146, 0.24025638265690455, 0.2878258998870202, -0.39159729616190103, -0.1677807953775577, 0.044794700679578484, 0.17725881067609947, 0.12612129943158504, 0.007281502148649399, -0.26295554467166465, 0.09465991402301344, -0.23449997417628765, -0.029566641481917188, -0.07587683052701903, -0.01096578864245743, 0.05069982860088888, -0.26122286691721797, -0.021393828839738515, 0.10564544399191315, 0.10074382757201143, -0.0633639269069755, -0.12092083901676444, -0.02191799802897984, 0.10243170595334748, 0.017787804006914393, 0.038051362237150686, 0.07784266684198435, -0.08617975391056118, -0.16850524184469512, 0.3609372336565908, -0.0521302526762736, -0.2670200969045307, 0.18474080563570117, -0.009812884545628574, -0.19053960262217384, 0.07435211735318645, 0.13659772445596213, 0.1414949408347678, -0.1570465927741126, 0.14934757256549716, -0.017941811884604933, 0.21786552720342128, 0.1364018612311802, 0.07645581056620332, 0.1608143454734776, 0.12900526110298824, -0.01903172908055569, 0.1262742185254878, 0.059603170032842434, -0.08131381480590157, -0.31186039099955687, -0.1585786152779516, -0.13158793737681623, -0.019830010649035314, -0.0768497583040448, -0.24377233369032975, 0.3525221841747238, 0.09493620192254151, 0.11318280813756629, 0.1585537821039274, 0.25465810165295133, 0.10525484828521377, 0.17674964415314404, 0.09718426448239041, 0.074565152897486, 0.02798858382137015, 0.14065611164888664, -0.12196897291004712, 0.13089929705618988, 0.06388170894343352]
|
1,803.08151
|
A Theorem for Secrecy in Tagged Protocols Using the Theory of
Witness-Functions
|
In this paper, we enunciate the theorem of secrecy in tagged protocols using
the theory of witness-functions and we run a formal analysis on a new tagged
version of the Needham-Schroeder public-key protocol using this theorem. We
discuss the significance of tagging in securing cryptographic protocols as
well.
|
cs.CR
|
in this paper we enunciate the theorem of secrecy in tagged protocols using the theory of witnessfunctions and we run a formal analysis on a new tagged version of the needhamschroeder publickey protocol using this theorem we discuss the significance of tagging in securing cryptographic protocols as well
|
[['in', 'this', 'paper', 'we', 'enunciate', 'the', 'theorem', 'of', 'secrecy', 'in', 'tagged', 'protocols', 'using', 'the', 'theory', 'of', 'witnessfunctions', 'and', 'we', 'run', 'a', 'formal', 'analysis', 'on', 'a', 'new', 'tagged', 'version', 'of', 'the', 'needhamschroeder', 'publickey', 'protocol', 'using', 'this', 'theorem', 'we', 'discuss', 'the', 'significance', 'of', 'tagging', 'in', 'securing', 'cryptographic', 'protocols', 'as', 'well']]
|
[-0.17896781309779422, -0.03105533032794483, -0.1547583961704125, 0.07615723893104587, 0.023792586677397292, -0.20507701220534122, 0.1367671801999677, 0.30786690954118967, -0.2579198131182541, -0.26114531881952036, 0.07218402091772684, -0.24428472526293868, -0.11090451824323584, 0.21622594042370716, -0.1405448253499344, 0.10854134662076831, 0.03361535844548295, 0.010246433560193205, -0.03599463519640267, -0.21630686690332368, 0.3342478211755709, 0.04450823815811115, 0.2888667048343147, 0.10903685896967848, 0.08028136385352506, 0.1076060574365935, -0.07588864804711193, -0.029677625047042966, -0.14100607723230496, 0.12955899949884042, 0.25843814507243223, 0.23359131940136044, 0.270287942160697, -0.3653664772088329, -0.10467142359508823, 0.09896529958738635, 0.13837242037213096, 0.14758403288821378, -0.09148209477280034, -0.3206200000519554, 0.13791901411605068, -0.2867606035821761, -0.11119914602022618, -0.0552430918905884, -0.08798487800959265, 0.04537684680447759, -0.19601895885231593, 0.05797620791903076, 0.06982959050462038, 0.1324163265332269, 0.010241649967307845, -0.024016683804802597, 0.07823798880417598, 0.11654917809937615, 0.016109718979957204, -0.00403840283252066, 0.13037270058218078, -0.12058161110811245, -0.23500846162399588, 0.357705336684982, -0.0629826319636777, -0.18616345862392336, 0.11983527704918136, -0.03584952362507465, -0.279918898595497, -0.03779243766621221, 0.2221541046941032, 0.1609783177070009, -0.15715742846562838, 0.06418183618491942, -0.1058627119443069, 0.20610916133349141, 0.09036241223414739, 0.0975060827137592, 0.0728131325255769, 0.21010977485760426, 0.017080595486428745, 0.17304871716381362, -0.05922115300685012, -0.11444329328757401, -0.3378234742364536, -0.24093467982796332, -0.16723467729267819, 0.07173260530544212, -0.04616958247273336, -0.10402078401724187, 0.3987400976087277, 0.20676440444852537, 0.09539287799270824, 0.06649451400153339, 0.3943147896400963, 0.06643180974788265, 0.027883511735126376, 0.10590332895905401, 0.19691354858999452, 0.12156734642727922, 0.15412743650570823, -0.08915528014767915, 0.0770389602985233, 0.11335536039162737]
|
1,803.08152
|
Connectivity-Preserving Coordination Control of Multi-Agent Systems with
Time-Varying Delays
|
This paper presents a distributed position synchronization strategy that also
preserves the initial communication links for single-integrator multi-agent
systems with time-varying delays. The strategy employs a coordinating
proportional control derived from a specific type of potential energy,
augmented with damping injected through a dynamic filter. The injected damping
maintains all agents within the communication distances of their neighbours,
and asymptotically stabilizes the multi-agent system, in the presence of time
delays. Regarding the closed-loop single-integrator multi-agent system as a
double-integrator system suggests an extension of the proposed strategy to
connectivity-preserving coordination of Euler-Lagrange networks with
time-varying delays. Lyapunov stability analysis and simulation results
validate the two designs.
|
math.OC cs.MA math.DS
|
this paper presents a distributed position synchronization strategy that also preserves the initial communication links for singleintegrator multiagent systems with timevarying delays the strategy employs a coordinating proportional control derived from a specific type of potential energy augmented with damping injected through a dynamic filter the injected damping maintains all agents within the communication distances of their neighbours and asymptotically stabilizes the multiagent system in the presence of time delays regarding the closedloop singleintegrator multiagent system as a doubleintegrator system suggests an extension of the proposed strategy to connectivitypreserving coordination of eulerlagrange networks with timevarying delays lyapunov stability analysis and simulation results validate the two designs
|
[['this', 'paper', 'presents', 'a', 'distributed', 'position', 'synchronization', 'strategy', 'that', 'also', 'preserves', 'the', 'initial', 'communication', 'links', 'for', 'singleintegrator', 'multiagent', 'systems', 'with', 'timevarying', 'delays', 'the', 'strategy', 'employs', 'a', 'coordinating', 'proportional', 'control', 'derived', 'from', 'a', 'specific', 'type', 'of', 'potential', 'energy', 'augmented', 'with', 'damping', 'injected', 'through', 'a', 'dynamic', 'filter', 'the', 'injected', 'damping', 'maintains', 'all', 'agents', 'within', 'the', 'communication', 'distances', 'of', 'their', 'neighbours', 'and', 'asymptotically', 'stabilizes', 'the', 'multiagent', 'system', 'in', 'the', 'presence', 'of', 'time', 'delays', 'regarding', 'the', 'closedloop', 'singleintegrator', 'multiagent', 'system', 'as', 'a', 'doubleintegrator', 'system', 'suggests', 'an', 'extension', 'of', 'the', 'proposed', 'strategy', 'to', 'connectivitypreserving', 'coordination', 'of', 'eulerlagrange', 'networks', 'with', 'timevarying', 'delays', 'lyapunov', 'stability', 'analysis', 'and', 'simulation', 'results', 'validate', 'the', 'two', 'designs']]
|
[-0.28178816820266395, 0.04104099539012477, -0.05151154060039739, -0.028178724659088435, -0.037029765875799196, -0.2079501961278817, 0.05842434278280773, 0.36786279658663945, -0.3077643971257615, -0.297160796768401, 0.08585877433630093, -0.21496212256211295, -0.19008481535919994, 0.12748399100986854, -0.08557601020021259, 0.06982692675049997, 0.07150199342703552, 0.031175547782419565, 0.022724703175042105, -0.2136380527836253, 0.285752883160109, 0.08382102572095562, 0.27558215267358804, -0.053772365437152816, 0.16778126177114416, 0.06716248845540972, 0.014705978079154244, 0.029556409086821216, -0.08533273687629295, 0.07930305502860684, 0.23314337000110238, 0.11610731510621197, 0.3578380887871081, -0.4080979670046495, -0.21826527698980294, 0.10616773311246433, 0.14618356749942563, 0.09737095227113592, -0.04410578285888681, -0.33305288598222554, 0.05700791329980107, -0.20588076090053567, -0.14442468778107245, -0.006609230862111117, -0.023782530285523466, 0.13052437843245296, -0.3209363964808015, 0.034979985864066414, 0.037141667714096466, 0.04747065473435763, -0.15376617844690973, -0.04084647811821855, -0.035764085572599524, 0.1569245567606797, -0.01037072989088044, -0.04709291735110488, 0.15858839514647732, -0.06127543449357925, -0.15337618111790913, 0.3737138606748491, -0.0083950301401651, -0.22552357210650303, 0.1834175518674354, -0.010858186894043718, -0.1069863711545279, 0.14460453210960864, 0.24658329177753263, 0.07147409420961268, -0.1920841226160948, 0.038609074014634384, 0.0028138269960247685, 0.21649269600846927, 0.0035567803875068728, 0.055206872070348766, 0.12604218315473706, 0.23783726359383678, 0.18833046119203264, 0.13123570759407296, -0.03443209590161887, -0.2206124760296178, -0.277445972984973, -0.073339118705711, -0.14352175410735896, -0.02616726539761074, -0.1081752467476038, -0.10743268981646255, 0.3768535030408288, 0.14234218899095277, 0.11787705316278592, 0.15562866839694456, 0.3483602978499993, 0.08420294352679707, 0.02667042568440215, 0.13526711744730766, 0.23230253211178659, 0.120611094834529, 0.166981546142367, -0.31409343843181387, 0.11829751855386246, 0.01312233124560905]
|
1,803.08153
|
Learning the Localization Function: Machine Learning Approach to
Fingerprinting Localization
|
Considered as a data-driven approach, Fingerprinting Localization Solutions
(FPSs) enjoy huge popularity due to their good performance and minimal
environment information requirement. This papers addresses applications of
artificial intelligence to solve two problems in Received Signal Strength
Indicator (RSSI) based FPS, first the cumbersome training database construction
and second the extrapolation of fingerprinting algorithm for similar buildings
with slight environmental changes. After a concise overview of deep learning
design techniques, two main techniques widely used in deep learning are
exploited for the above mentioned issues namely data augmentation and transfer
learning. We train a multi-layer neural network that learns the mapping from
the observations to the locations. A data augmentation method is proposed to
increase the training database size based on the structure of RSSI measurements
and hence reducing effectively the amount of training data. Then it is shown
experimentally how a model trained for a particular building can be transferred
to a similar one by fine tuning with significantly smaller training numbers.
The paper implicitly discusses the new guidelines to consider about deep
learning designs when they are employed in a new application context.
|
cs.NI cs.LG stat.ML
|
considered as a datadriven approach fingerprinting localization solutions fpss enjoy huge popularity due to their good performance and minimal environment information requirement this papers addresses applications of artificial intelligence to solve two problems in received signal strength indicator rssi based fps first the cumbersome training database construction and second the extrapolation of fingerprinting algorithm for similar buildings with slight environmental changes after a concise overview of deep learning design techniques two main techniques widely used in deep learning are exploited for the above mentioned issues namely data augmentation and transfer learning we train a multilayer neural network that learns the mapping from the observations to the locations a data augmentation method is proposed to increase the training database size based on the structure of rssi measurements and hence reducing effectively the amount of training data then it is shown experimentally how a model trained for a particular building can be transferred to a similar one by fine tuning with significantly smaller training numbers the paper implicitly discusses the new guidelines to consider about deep learning designs when they are employed in a new application context
|
[['considered', 'as', 'a', 'datadriven', 'approach', 'fingerprinting', 'localization', 'solutions', 'fpss', 'enjoy', 'huge', 'popularity', 'due', 'to', 'their', 'good', 'performance', 'and', 'minimal', 'environment', 'information', 'requirement', 'this', 'papers', 'addresses', 'applications', 'of', 'artificial', 'intelligence', 'to', 'solve', 'two', 'problems', 'in', 'received', 'signal', 'strength', 'indicator', 'rssi', 'based', 'fps', 'first', 'the', 'cumbersome', 'training', 'database', 'construction', 'and', 'second', 'the', 'extrapolation', 'of', 'fingerprinting', 'algorithm', 'for', 'similar', 'buildings', 'with', 'slight', 'environmental', 'changes', 'after', 'a', 'concise', 'overview', 'of', 'deep', 'learning', 'design', 'techniques', 'two', 'main', 'techniques', 'widely', 'used', 'in', 'deep', 'learning', 'are', 'exploited', 'for', 'the', 'above', 'mentioned', 'issues', 'namely', 'data', 'augmentation', 'and', 'transfer', 'learning', 'we', 'train', 'a', 'multilayer', 'neural', 'network', 'that', 'learns', 'the', 'mapping', 'from', 'the', 'observations', 'to', 'the', 'locations', 'a', 'data', 'augmentation', 'method', 'is', 'proposed', 'to', 'increase', 'the', 'training', 'database', 'size', 'based', 'on', 'the', 'structure', 'of', 'rssi', 'measurements', 'and', 'hence', 'reducing', 'effectively', 'the', 'amount', 'of', 'training', 'data', 'then', 'it', 'is', 'shown', 'experimentally', 'how', 'a', 'model', 'trained', 'for', 'a', 'particular', 'building', 'can', 'be', 'transferred', 'to', 'a', 'similar', 'one', 'by', 'fine', 'tuning', 'with', 'significantly', 'smaller', 'training', 'numbers', 'the', 'paper', 'implicitly', 'discusses', 'the', 'new', 'guidelines', 'to', 'consider', 'about', 'deep', 'learning', 'designs', 'when', 'they', 'are', 'employed', 'in', 'a', 'new', 'application', 'context']]
|
[-0.04856324080063369, 0.026427210389595966, -0.051223920630392335, 0.09863771558103389, -0.13869518461591646, -0.1880701050850684, 0.056718823825813953, 0.40328401782418316, -0.2792436313693938, -0.3607657793959927, 0.10525652546746879, -0.23808258468457294, -0.20449949636974413, 0.21322458363441832, -0.147296858933734, 0.09572308485993468, 0.11751984290616668, 0.03745394866564311, -0.07685925246938574, -0.2881488134735264, 0.3065446693761497, 0.0739502850193948, 0.3860037970235166, 0.013781058042735347, 0.10793176143425112, -0.010354651271447201, -0.03283467842961925, -0.0034721708614834706, -0.07864920502996266, 0.19259997236808293, 0.3196197702377306, 0.20055097685215753, 0.34032594006756606, -0.4200671205054159, -0.22087759937399506, 0.1085152463688839, 0.13968242439517306, 0.13643611158983296, -0.0629026113367771, -0.30391168191588647, 0.08503785774329393, -0.16773253652196296, -0.03481534168215306, -0.116575108613767, -0.030195837405145816, 0.013967700496520949, -0.2869708813425108, -0.02913908800110221, 0.04666372754044183, 0.07855197138902124, -0.04490349695602756, -0.11631324562831255, 0.03889882089013396, 0.15421253231903867, 0.03973857166863087, 0.046295473470388024, 0.15138677101956843, -0.1578168557594915, -0.10980453876001538, 0.34947510983329266, -0.04333723732396839, -0.18572910771826687, 0.18207635526525098, 0.004827803339297964, -0.14655688619139887, 0.11054713237820618, 0.2517626377900698, 0.08067759075809432, -0.18413392604404932, 0.013033465091290924, 0.0012693333682482657, 0.20188382705774807, 0.04248144423700464, -0.0019848893457294807, 0.14394021190199294, 0.24121123580920065, 0.05207084283693288, 0.13635911225055283, -0.11251926569789446, -0.055844586403311594, -0.22648620964331634, -0.09601113811004325, -0.22068589213481377, -0.009209224173505589, -0.07960676735693477, -0.12573838170346394, 0.39006860484811984, 0.24616326070795563, 0.21660297749938606, 0.056129919382763786, 0.36475953123653715, 0.040993785842463534, 0.14682080123463453, 0.08934390211715768, 0.19637838294147514, 0.06471778420635256, 0.16152903306267588, -0.15905967219647288, 0.09378575869714437, 0.04101909865858033]
|
1,803.08154
|
Network and Panel Quantile Effects Via Distribution Regression
|
This paper provides a method to construct simultaneous confidence bands for
quantile functions and quantile effects in nonlinear network and panel models
with unobserved two-way effects, strictly exogenous covariates, and possibly
discrete outcome variables. The method is based upon projection of simultaneous
confidence bands for distribution functions constructed from fixed effects
distribution regression estimators. These fixed effects estimators are debiased
to deal with the incidental parameter problem. Under asymptotic sequences where
both dimensions of the data set grow at the same rate, the confidence bands for
the quantile functions and effects have correct joint coverage in large
samples. An empirical application to gravity models of trade illustrates the
applicability of the methods to network data.
|
econ.EM stat.ME
|
this paper provides a method to construct simultaneous confidence bands for quantile functions and quantile effects in nonlinear network and panel models with unobserved twoway effects strictly exogenous covariates and possibly discrete outcome variables the method is based upon projection of simultaneous confidence bands for distribution functions constructed from fixed effects distribution regression estimators these fixed effects estimators are debiased to deal with the incidental parameter problem under asymptotic sequences where both dimensions of the data set grow at the same rate the confidence bands for the quantile functions and effects have correct joint coverage in large samples an empirical application to gravity models of trade illustrates the applicability of the methods to network data
|
[['this', 'paper', 'provides', 'a', 'method', 'to', 'construct', 'simultaneous', 'confidence', 'bands', 'for', 'quantile', 'functions', 'and', 'quantile', 'effects', 'in', 'nonlinear', 'network', 'and', 'panel', 'models', 'with', 'unobserved', 'twoway', 'effects', 'strictly', 'exogenous', 'covariates', 'and', 'possibly', 'discrete', 'outcome', 'variables', 'the', 'method', 'is', 'based', 'upon', 'projection', 'of', 'simultaneous', 'confidence', 'bands', 'for', 'distribution', 'functions', 'constructed', 'from', 'fixed', 'effects', 'distribution', 'regression', 'estimators', 'these', 'fixed', 'effects', 'estimators', 'are', 'debiased', 'to', 'deal', 'with', 'the', 'incidental', 'parameter', 'problem', 'under', 'asymptotic', 'sequences', 'where', 'both', 'dimensions', 'of', 'the', 'data', 'set', 'grow', 'at', 'the', 'same', 'rate', 'the', 'confidence', 'bands', 'for', 'the', 'quantile', 'functions', 'and', 'effects', 'have', 'correct', 'joint', 'coverage', 'in', 'large', 'samples', 'an', 'empirical', 'application', 'to', 'gravity', 'models', 'of', 'trade', 'illustrates', 'the', 'applicability', 'of', 'the', 'methods', 'to', 'network', 'data']]
|
[-0.04618256796637307, 0.025949781076380296, -0.09587966457171285, 0.12654271047440885, -0.059170157853109036, -0.15633055702175783, 0.11993706649189571, 0.3922617035553507, -0.2514765812327033, -0.283921062970615, 0.10946864708245772, -0.3034670065926469, -0.10892577922862509, 0.15135529372922105, -0.10673595179358254, 0.11759738226360439, 0.049946624510314154, -0.07665077709876325, -0.057889810315859706, -0.28377187058694014, 0.31807654578967587, 0.08553558947396991, 0.32065753616068676, -0.026442792479697937, 0.12481530495595348, 0.059813113089488903, -0.057299849443623554, -0.0024607845986990826, -0.1088435589922997, 0.09344461920529441, 0.2859191361073855, 0.12057800020860589, 0.35577100913809695, -0.3715582208464975, -0.2562098153502397, 0.11902159672716389, 0.08918779005256036, 0.07336243978175132, 0.037109221258889075, -0.2778309191212706, 0.004140964925856046, -0.16929755602031946, -0.08630957032918282, -0.07847285648382714, -0.011939502543891254, 0.029939252458026876, -0.39820798577173894, 0.1289926807841529, 0.006951379880774766, 0.08443530675469209, -0.07465280694887041, -0.17410470026180797, -0.02827922698393788, 0.1054107701162929, 0.11974542247657867, -0.03716579459040709, 0.08983879215691401, -0.09358894147064901, -0.11722505487420637, 0.29070892624718986, -0.06684969970551521, -0.2821884361136219, 0.16240507267294046, -0.17321568140355142, -0.1636476861555939, 0.12183824448603327, 0.28009979558055814, 0.08848273839963519, -0.16357276384394778, 0.07039550112600884, 0.005578412990207258, 0.14873998064709745, 0.006368926244423441, 0.030580218776088693, 0.18618949613655392, 0.14732005349157945, 0.07825142453100695, 0.11243778091005009, -0.14477720004810102, -0.05248434969588466, -0.29152595878619214, -0.04532336410458969, -0.17149477672317753, -0.08154945797894313, -0.17373965504407154, -0.21893081000965575, 0.40201645697588506, 0.17671235266506025, 0.18923446150577586, 0.1591429307439324, 0.2773836434373389, 0.13864344809439702, 0.03459886408552689, 0.0690779325025885, 0.16774674010382074, 0.09417574057031584, -0.002458048905448421, -0.15248007895273116, 0.12948914107704615, 0.015492314748142076]
|
1,803.08155
|
Fast Bayesian inference in large Gaussian graphical models
|
Despite major methodological developments, Bayesian inference for Gaussian
graphical models remains challenging in high dimension due to the tremendous
size of the model space. This article proposes a method to infer the marginal
and conditional independence structures between variables by multiple testing
of hypotheses. Specifically, we introduce closed-form Bayes factors under the
Gaussian conjugate model to evaluate the null hypotheses of marginal and
conditional independence between variables. Their computation for all pairs of
variables is shown to be extremely efficient, thereby allowing us to address
large problems with thousands of nodes. Moreover, we derive exact tail
probabilities from the null distributions of the Bayes factors. These allow the
use of any multiplicity correction procedure to control error rates for
incorrect edge inclusion. We demonstrate the proposed approach to graphical
model selection on various simulated examples as well as on a large gene
expression data set from The Cancer Genome Atlas.
|
stat.ME
|
despite major methodological developments bayesian inference for gaussian graphical models remains challenging in high dimension due to the tremendous size of the model space this article proposes a method to infer the marginal and conditional independence structures between variables by multiple testing of hypotheses specifically we introduce closedform bayes factors under the gaussian conjugate model to evaluate the null hypotheses of marginal and conditional independence between variables their computation for all pairs of variables is shown to be extremely efficient thereby allowing us to address large problems with thousands of nodes moreover we derive exact tail probabilities from the null distributions of the bayes factors these allow the use of any multiplicity correction procedure to control error rates for incorrect edge inclusion we demonstrate the proposed approach to graphical model selection on various simulated examples as well as on a large gene expression data set from the cancer genome atlas
|
[['despite', 'major', 'methodological', 'developments', 'bayesian', 'inference', 'for', 'gaussian', 'graphical', 'models', 'remains', 'challenging', 'in', 'high', 'dimension', 'due', 'to', 'the', 'tremendous', 'size', 'of', 'the', 'model', 'space', 'this', 'article', 'proposes', 'a', 'method', 'to', 'infer', 'the', 'marginal', 'and', 'conditional', 'independence', 'structures', 'between', 'variables', 'by', 'multiple', 'testing', 'of', 'hypotheses', 'specifically', 'we', 'introduce', 'closedform', 'bayes', 'factors', 'under', 'the', 'gaussian', 'conjugate', 'model', 'to', 'evaluate', 'the', 'null', 'hypotheses', 'of', 'marginal', 'and', 'conditional', 'independence', 'between', 'variables', 'their', 'computation', 'for', 'all', 'pairs', 'of', 'variables', 'is', 'shown', 'to', 'be', 'extremely', 'efficient', 'thereby', 'allowing', 'us', 'to', 'address', 'large', 'problems', 'with', 'thousands', 'of', 'nodes', 'moreover', 'we', 'derive', 'exact', 'tail', 'probabilities', 'from', 'the', 'null', 'distributions', 'of', 'the', 'bayes', 'factors', 'these', 'allow', 'the', 'use', 'of', 'any', 'multiplicity', 'correction', 'procedure', 'to', 'control', 'error', 'rates', 'for', 'incorrect', 'edge', 'inclusion', 'we', 'demonstrate', 'the', 'proposed', 'approach', 'to', 'graphical', 'model', 'selection', 'on', 'various', 'simulated', 'examples', 'as', 'well', 'as', 'on', 'a', 'large', 'gene', 'expression', 'data', 'set', 'from', 'the', 'cancer', 'genome', 'atlas']]
|
[-0.055402738370466977, 0.021512499057377378, -0.057025568697912, 0.13235066536193094, -0.09393434522052606, -0.1544797030587991, 0.1126687953256381, 0.37973730749450624, -0.2547242086799815, -0.34226133878032367, 0.0721859083782571, -0.21626730130674937, -0.15467605769634246, 0.17346437417591612, -0.09973406967532356, 0.1182244306554397, 0.0960100421976919, 0.012028695616560678, -0.048378220157076914, -0.2627710437045122, 0.30653153445106, 0.08464565958827734, 0.33717644184051704, -0.010986937010117496, 0.14807419589643056, 0.04767193022804956, -0.06998571719042956, 0.004881555959388303, -0.12814375680560866, 0.17273520438311002, 0.26207044391381107, 0.21464383046608418, 0.3282374683612337, -0.4063885414165755, -0.19230656964393952, 0.14507388449274003, 0.12455002387519926, 0.1325602843472734, 0.027660232364820937, -0.27859091538004577, 0.07555513808503747, -0.1806714059942169, -0.09869943037784348, -0.14756844783201814, -0.007170617921898762, 0.011483241841197013, -0.3376502810480694, 0.09181293441758802, 0.03073737308771039, 0.06223687371239066, -0.03026010560725505, -0.15257732451582948, 0.014666780760356535, 0.12862033960642294, 0.11551947116774196, -0.02289399763569236, 0.11023967800506701, -0.13186124280361886, -0.13878513933547462, 0.2897026785494139, -0.007670313096605241, -0.24422993160163362, 0.20699287774041294, -0.10994948310156663, -0.17293722578634818, 0.11209839960249762, 0.2316398723144084, 0.07938848882913589, -0.20933277572815617, 0.07844430185155943, -0.006175322871034344, 0.12537830043584108, 0.05260640464257449, 0.0006362729830046495, 0.1917528448595355, 0.1278117740402619, 0.046938830072370666, 0.15844887925544754, -0.13779209778644144, -0.10139971857269604, -0.309364955239386, -0.1432566956585894, -0.16140117747165883, 0.004629184441485753, -0.14724327019396394, -0.21839784281076088, 0.35699984897859394, 0.19930252137516316, 0.23242455448567245, 0.11165816312034925, 0.29135853038479886, 0.08830487042442352, 0.0581630530130739, 0.077400371801729, 0.14037925153349837, 0.15131377263460308, -0.005586963999085128, -0.16759225487631435, 0.14482238428822408, 0.013261099852000673]
|
1,803.08156
|
Quantum glass of interacting bosons with off-diagonal disorder
|
We study disordered interacting bosons described by the Bose-Hubbard model
with Gaussian-distributed random tunneling amplitudes. It is shown that the
off-diagonal disorder induces a spin-glass-like ground state, characterized by
randomly frozen quantum-mechanical U(1) phases of bosons. To access
criticality, we employ the "$n$-replica trick", as in the spin-glass theory,
and the Trotter-Suzuki method for decomposition of the statistical density
operator, along with numerical calculations. The interplay between disorder,
quantum and thermal fluctuations leads to phase diagrams exhibiting a glassy
state of bosons, which are studied as a function of model parameters. The
considered system may be relevant for quantum simulators of optical-lattice
bosons, where the randomness can be introduced in a controlled way. The latter
is supported by a proposition of experimental realization of the system in
question.
|
cond-mat.quant-gas
|
we study disordered interacting bosons described by the bosehubbard model with gaussiandistributed random tunneling amplitudes it is shown that the offdiagonal disorder induces a spinglasslike ground state characterized by randomly frozen quantummechanical u1 phases of bosons to access criticality we employ the nreplica trick as in the spinglass theory and the trottersuzuki method for decomposition of the statistical density operator along with numerical calculations the interplay between disorder quantum and thermal fluctuations leads to phase diagrams exhibiting a glassy state of bosons which are studied as a function of model parameters the considered system may be relevant for quantum simulators of opticallattice bosons where the randomness can be introduced in a controlled way the latter is supported by a proposition of experimental realization of the system in question
|
[['we', 'study', 'disordered', 'interacting', 'bosons', 'described', 'by', 'the', 'bosehubbard', 'model', 'with', 'gaussiandistributed', 'random', 'tunneling', 'amplitudes', 'it', 'is', 'shown', 'that', 'the', 'offdiagonal', 'disorder', 'induces', 'a', 'spinglasslike', 'ground', 'state', 'characterized', 'by', 'randomly', 'frozen', 'quantummechanical', 'u1', 'phases', 'of', 'bosons', 'to', 'access', 'criticality', 'we', 'employ', 'the', 'nreplica', 'trick', 'as', 'in', 'the', 'spinglass', 'theory', 'and', 'the', 'trottersuzuki', 'method', 'for', 'decomposition', 'of', 'the', 'statistical', 'density', 'operator', 'along', 'with', 'numerical', 'calculations', 'the', 'interplay', 'between', 'disorder', 'quantum', 'and', 'thermal', 'fluctuations', 'leads', 'to', 'phase', 'diagrams', 'exhibiting', 'a', 'glassy', 'state', 'of', 'bosons', 'which', 'are', 'studied', 'as', 'a', 'function', 'of', 'model', 'parameters', 'the', 'considered', 'system', 'may', 'be', 'relevant', 'for', 'quantum', 'simulators', 'of', 'opticallattice', 'bosons', 'where', 'the', 'randomness', 'can', 'be', 'introduced', 'in', 'a', 'controlled', 'way', 'the', 'latter', 'is', 'supported', 'by', 'a', 'proposition', 'of', 'experimental', 'realization', 'of', 'the', 'system', 'in', 'question']]
|
[-0.1586767497653963, 0.27746315008601335, -0.0912925582122439, 0.05133583828051552, 0.03636288069789921, -0.19705118124893917, 0.06178125564016285, 0.335111228866488, -0.243469582144611, -0.23768116021895502, 0.035348654388244756, -0.2815390345383817, -0.16281364057726394, 0.12254558493544561, 0.03898558026458335, 0.06597587953167637, 0.011663441441762517, -0.006103961424183423, -0.06478890527395428, -0.22124232599643742, 0.2914494301676457, 0.011624473731920828, 0.2678162664629695, 0.03657676833205101, 0.0650364403268249, 0.03446965015999327, 0.06367895251055666, 0.025393703270439556, -0.11059156236062093, 0.04578765619575508, 0.21416394069321512, 0.00383519685247869, 0.20196201319238638, -0.4102091452796159, -0.23678749352400227, 0.09290430193957616, 0.1632821321172097, 0.16046050286532826, -0.02546954404665377, -0.3648335060882052, 0.024074241229310983, -0.19478521920102612, -0.1693527474889429, -0.13862478852594698, -0.030959892666011346, -0.009651728401576557, -0.2897677184119234, 0.11261145530752545, 0.04664591795170871, 0.07040537982819534, -0.05411501855985445, -0.04913057332059119, -0.03744004922002319, 0.06542936670795582, 0.026800385912821637, 0.04095273436501798, 0.13553347659671283, -0.1567340718314609, -0.15587054102179249, 0.38703392303592754, -0.05674120027747914, -0.19452893164184853, 0.1729589888246686, -0.09956838272745248, -0.0970602678978361, 0.12245747674344562, 0.11269290014775103, 0.040469104935613086, -0.15454936314623538, 0.12427357923314865, -0.025164890389955476, 0.16573225509368, -0.024739297953852282, 0.066908285650608, 0.2251757077036763, 0.17472526014555156, 0.014244079798841335, 0.20859619162382748, -0.03718000429560518, -0.19400823574997192, -0.2847085841914788, -0.13913262841533722, -0.26264284564343493, 0.07727460009889223, -0.07746454833903145, -0.19775166223994384, 0.3965189890994683, 0.17262124635763174, 0.20107025235014103, -0.023920170028737975, 0.2346394110680008, 0.1456880523936867, 0.020794102053091987, 0.012555948019533704, 0.21505730056504566, 0.1899659974742534, 0.07119298870785265, -0.23617713332476872, 0.04260795031523874, 0.10182766455196314]
|
1,803.08157
|
On the Parameterized Computation of Minimum Volume Outer Ellipsoid of
Minkowski Sum of Ellipsoids
|
We consider the problem of computing certain parameterized minimum volume
outer ellipsoidal (MVOE) approximation of the Minkowski sum of a finite number
of ellipsoids. We clarify connections among several parameterizations available
in the literature, obtain novel analysis results regarding the conditions of
optimality, and based on the same, propose two new algorithms for computing the
parameterized MVOE. Numerical results reveal faster runtime for the proposed
algorithms than the state-of-the-art semidefinite programming approach of
computing the same.
|
math.OC cs.SY
|
we consider the problem of computing certain parameterized minimum volume outer ellipsoidal mvoe approximation of the minkowski sum of a finite number of ellipsoids we clarify connections among several parameterizations available in the literature obtain novel analysis results regarding the conditions of optimality and based on the same propose two new algorithms for computing the parameterized mvoe numerical results reveal faster runtime for the proposed algorithms than the stateoftheart semidefinite programming approach of computing the same
|
[['we', 'consider', 'the', 'problem', 'of', 'computing', 'certain', 'parameterized', 'minimum', 'volume', 'outer', 'ellipsoidal', 'mvoe', 'approximation', 'of', 'the', 'minkowski', 'sum', 'of', 'a', 'finite', 'number', 'of', 'ellipsoids', 'we', 'clarify', 'connections', 'among', 'several', 'parameterizations', 'available', 'in', 'the', 'literature', 'obtain', 'novel', 'analysis', 'results', 'regarding', 'the', 'conditions', 'of', 'optimality', 'and', 'based', 'on', 'the', 'same', 'propose', 'two', 'new', 'algorithms', 'for', 'computing', 'the', 'parameterized', 'mvoe', 'numerical', 'results', 'reveal', 'faster', 'runtime', 'for', 'the', 'proposed', 'algorithms', 'than', 'the', 'stateoftheart', 'semidefinite', 'programming', 'approach', 'of', 'computing', 'the', 'same']]
|
[-0.15083706411658912, -0.014524192863924278, -0.0751430973083385, 0.07692930958787533, -0.08258471078856068, -0.12212072912528105, 0.0560123906407908, 0.32371591115559173, -0.2504319241773841, -0.3367070872210772, 0.10401865730936816, -0.22066303161350456, -0.1677089124741788, 0.23388774044862068, -0.056227898615336905, 0.11918345420948558, 0.0627990574072543, 0.007118271346002616, -0.1825739171330792, -0.30673140006616156, 0.28658030162930387, -0.008598251947881403, 0.2745120126653362, 0.07681205164555797, 0.09492608674525006, 0.005674268748309161, -0.06837319396436214, 0.0602386037290499, -0.19536675806975345, 0.18831766011489154, 0.24248502428668575, 0.21795477439347352, 0.3007385578144946, -0.4482496672662327, -0.166380500106292, 0.0989473147657574, 0.12969539520909656, 0.0809344838127947, -0.03208997672757234, -0.22259503574035056, 0.097989896548333, -0.13458326005855123, -0.09121321942704427, -0.08369794153180476, -0.04633355782543485, 0.02959062671288848, -0.24800351763622383, 0.03584220128234576, 0.04825777574316473, 0.04332681871145158, -0.10347688122891595, -0.22220229226592425, 0.08440323803271796, 0.08049423660378198, 0.03761110141892238, -0.031909587094560266, 0.07990551873336772, -0.09943554759327625, -0.17564924500530232, 0.37386552496133624, -0.0291067832757206, -0.20474924436594183, 0.16640055994817837, -0.07947383822269134, -0.15194401007170813, 0.11350788597042698, 0.22334603867116007, 0.17063540290739085, -0.12405437718533338, 0.08631372622865555, -0.08741014029176251, 0.09756429614247503, 0.08689325582236052, 0.030101254815235734, 0.10808890423661954, 0.17710375754364036, 0.12539542447523894, 0.19076600203186753, -0.035220632697707296, -0.15211792723149867, -0.28776492923498154, -0.13946566762201287, -0.20923562449831012, -0.0634516099313702, -0.1857286791906714, -0.19228381932889288, 0.3896295283291791, 0.14676885936107184, 0.1738340696760428, 0.15651667208687678, 0.3524770917421257, 0.09560960811890058, 0.035367534256766774, 0.1660074540665625, 0.21789087739936705, 0.11769394309738197, 0.04668192303034704, -0.2596622405926118, 0.06311329630379742, 0.10585365239908365]
|
1,803.08158
|
Comparative study of structural and electronic properties of GaSe and
InSe polytypes
|
Equilibrium crystal structures, electron band dispersions and band gap values
of layered GaSe and InSe semiconductors, each being represented by four
polytypes, are studied via first-principles calculations within the density
functional theory (DFT). A number of practical algorithms to take into account
dispersion interactions are tested, from empirical Grimme corrections to
many-body dispersion schemes. Due to the utmost technical accuracy achieved in
the calculations, nearly degenerate energy-volume curves of different polytypes
are resolved, and the conclusions concerning the relative stability of
competing polytypes drawn. The predictions are done as for how the equilibrium
between different polytypes will be shifted under the effect of hydrostatic
pressure. The band structures are inspected under the angle of identifying
features specific for different polytypes, and with respect to modifications of
the band dispersions brought about by the use of modified Becke-Johnson (mBJ)
scheme for the exchange-correlation (XC) potential. As another way to improve
the predictions of band gaps values, hybrid functional calculations according
to the HSE06 scheme are performed for the band structures, and the relation
with the mBJ results discussed. Both methods nicely agree with experimental
results and with state-of-the-art GW calculations. Some discrepancies are
identified in cases of close competition between the direct and indirect gap
(e.g., in GaSe); moreover, the accurate placement of bands revealing relatively
localized states is slightly different according to mBJ and HSE06 schemes.
|
cond-mat.mtrl-sci
|
equilibrium crystal structures electron band dispersions and band gap values of layered gase and inse semiconductors each being represented by four polytypes are studied via firstprinciples calculations within the density functional theory dft a number of practical algorithms to take into account dispersion interactions are tested from empirical grimme corrections to manybody dispersion schemes due to the utmost technical accuracy achieved in the calculations nearly degenerate energyvolume curves of different polytypes are resolved and the conclusions concerning the relative stability of competing polytypes drawn the predictions are done as for how the equilibrium between different polytypes will be shifted under the effect of hydrostatic pressure the band structures are inspected under the angle of identifying features specific for different polytypes and with respect to modifications of the band dispersions brought about by the use of modified beckejohnson mbj scheme for the exchangecorrelation xc potential as another way to improve the predictions of band gaps values hybrid functional calculations according to the hse06 scheme are performed for the band structures and the relation with the mbj results discussed both methods nicely agree with experimental results and with stateoftheart gw calculations some discrepancies are identified in cases of close competition between the direct and indirect gap eg in gase moreover the accurate placement of bands revealing relatively localized states is slightly different according to mbj and hse06 schemes
|
[['equilibrium', 'crystal', 'structures', 'electron', 'band', 'dispersions', 'and', 'band', 'gap', 'values', 'of', 'layered', 'gase', 'and', 'inse', 'semiconductors', 'each', 'being', 'represented', 'by', 'four', 'polytypes', 'are', 'studied', 'via', 'firstprinciples', 'calculations', 'within', 'the', 'density', 'functional', 'theory', 'dft', 'a', 'number', 'of', 'practical', 'algorithms', 'to', 'take', 'into', 'account', 'dispersion', 'interactions', 'are', 'tested', 'from', 'empirical', 'grimme', 'corrections', 'to', 'manybody', 'dispersion', 'schemes', 'due', 'to', 'the', 'utmost', 'technical', 'accuracy', 'achieved', 'in', 'the', 'calculations', 'nearly', 'degenerate', 'energyvolume', 'curves', 'of', 'different', 'polytypes', 'are', 'resolved', 'and', 'the', 'conclusions', 'concerning', 'the', 'relative', 'stability', 'of', 'competing', 'polytypes', 'drawn', 'the', 'predictions', 'are', 'done', 'as', 'for', 'how', 'the', 'equilibrium', 'between', 'different', 'polytypes', 'will', 'be', 'shifted', 'under', 'the', 'effect', 'of', 'hydrostatic', 'pressure', 'the', 'band', 'structures', 'are', 'inspected', 'under', 'the', 'angle', 'of', 'identifying', 'features', 'specific', 'for', 'different', 'polytypes', 'and', 'with', 'respect', 'to', 'modifications', 'of', 'the', 'band', 'dispersions', 'brought', 'about', 'by', 'the', 'use', 'of', 'modified', 'beckejohnson', 'mbj', 'scheme', 'for', 'the', 'exchangecorrelation', 'xc', 'potential', 'as', 'another', 'way', 'to', 'improve', 'the', 'predictions', 'of', 'band', 'gaps', 'values', 'hybrid', 'functional', 'calculations', 'according', 'to', 'the', 'hse06', 'scheme', 'are', 'performed', 'for', 'the', 'band', 'structures', 'and', 'the', 'relation', 'with', 'the', 'mbj', 'results', 'discussed', 'both', 'methods', 'nicely', 'agree', 'with', 'experimental', 'results', 'and', 'with', 'stateoftheart', 'gw', 'calculations', 'some', 'discrepancies', 'are', 'identified', 'in', 'cases', 'of', 'close', 'competition', 'between', 'the', 'direct', 'and', 'indirect', 'gap', 'eg', 'in', 'gase', 'moreover', 'the', 'accurate', 'placement', 'of', 'bands', 'revealing', 'relatively', 'localized', 'states', 'is', 'slightly', 'different', 'according', 'to', 'mbj', 'and', 'hse06', 'schemes']]
|
[-0.10501211721746795, 0.06486488227573825, -0.08297306555658125, 0.08666975163265886, -0.010413734188748408, -0.1550923692107827, 0.11093639659095737, 0.44736060157904517, -0.25369778340806015, -0.33598746548832265, -0.003254721089023108, -0.3207314249356813, -0.11097883745364483, 0.19127548562977834, 0.03741542031201411, 0.06419585655204874, 0.053538319860807565, -0.08266567046119444, -0.160348150945079, -0.2152861758069325, 0.31023404129525334, 0.06757033515342437, 0.29688997216835883, 0.06881153398652899, -0.03168711151754632, -0.026123232104654826, 0.03133854239048906, 0.054335324736551234, -0.17704889273880858, 0.12621398504892473, 0.2792357096275463, -0.0627209667932341, 0.23723670837584784, -0.4442191399650368, -0.22563355473339952, -0.02457265603454965, 0.07366216021910077, 0.11007168394538154, -0.03490130187411982, -0.2893724204319224, 0.10472233117468176, -0.15239969807557466, -0.1086527762596652, -0.12092896057674002, -0.04006371816135832, 0.06372854104358291, -0.21880152540618042, 0.10923761274228778, -0.04518870032784314, 0.024100369517150565, -0.12937420852733694, -0.22171978379982993, -0.10079035322404409, 0.10173240048291607, 0.07265146838529941, -0.005000231006652513, 0.13690498591075131, -0.06977925931651607, -0.10927650844369216, 0.45239156381581475, -0.04207520193082437, -0.13876743124183927, 0.17668630845795294, -0.11019382183697586, -0.09957193994000389, 0.13626390191586277, 0.09500989142318042, 0.060058851248329194, -0.10875311011857501, 0.07513910329867715, 0.046879179285456984, 0.16621955022869006, 0.07807122346887414, 0.0826701366268428, 0.19849410640468318, 0.12375531265660461, -0.0003550844035210269, 0.047789941580999085, -0.09224723681572627, -0.09490323591662109, -0.2216720493562907, -0.1109259377034207, -0.18335450094489925, -0.029513472162673367, -0.09137574057555778, -0.16586969342016805, 0.40083772679532653, 0.10468706193765619, 0.14934088417691532, 0.004888274258752642, 0.2462216704513103, 0.1028618966445607, 0.07798359519080877, 0.03325678748274387, 0.28280421749333773, 0.181120316688573, 0.03196444843104521, -0.22688284721246105, 0.05800639899059681, -0.0062245627003927936]
|
1,803.08159
|
Globally Stable Output Feedback Synchronization of Teleoperation with
Time-Varying Delays
|
This paper presents a globally stable teleoperation control strategy for
systems with time-varying delays that eliminates the need for velocity
measurements through novel augmented Immersion and Invariance velocity
observers. The new observers simplify a recent constructive Immersion and
Invariance velocity observer to achieve globally convergent velocity estimation
with only $n+2$ states, where $n$ is the number of degrees of freedom of the
master and slave robots. They introduce dynamic scaling factors to accelerate
the speed of convergence of the velocity estimates and, thus, to limit the
energy generated by the velocity estimation errors and to guarantee sufficient
estimate-based damping injection to dissipate the energy generated by the
time-varying delays. The paper shows that Proportional plus damping control
with the simplified and augmented Immersion and Invariance-based velocity
observers can synchronize the free master and slave motions in the presence of
time-varying delays without using velocity measurements. Numerical results
illustrate the estimation performance of the new observers and the stability of
a simulated two degrees-of-freedom nonlinear teleoperation system with
time-varying delays under the proposed output feedback Proportional plus
damping control.
|
cs.SY math.DS
|
this paper presents a globally stable teleoperation control strategy for systems with timevarying delays that eliminates the need for velocity measurements through novel augmented immersion and invariance velocity observers the new observers simplify a recent constructive immersion and invariance velocity observer to achieve globally convergent velocity estimation with only n2 states where n is the number of degrees of freedom of the master and slave robots they introduce dynamic scaling factors to accelerate the speed of convergence of the velocity estimates and thus to limit the energy generated by the velocity estimation errors and to guarantee sufficient estimatebased damping injection to dissipate the energy generated by the timevarying delays the paper shows that proportional plus damping control with the simplified and augmented immersion and invariancebased velocity observers can synchronize the free master and slave motions in the presence of timevarying delays without using velocity measurements numerical results illustrate the estimation performance of the new observers and the stability of a simulated two degreesoffreedom nonlinear teleoperation system with timevarying delays under the proposed output feedback proportional plus damping control
|
[['this', 'paper', 'presents', 'a', 'globally', 'stable', 'teleoperation', 'control', 'strategy', 'for', 'systems', 'with', 'timevarying', 'delays', 'that', 'eliminates', 'the', 'need', 'for', 'velocity', 'measurements', 'through', 'novel', 'augmented', 'immersion', 'and', 'invariance', 'velocity', 'observers', 'the', 'new', 'observers', 'simplify', 'a', 'recent', 'constructive', 'immersion', 'and', 'invariance', 'velocity', 'observer', 'to', 'achieve', 'globally', 'convergent', 'velocity', 'estimation', 'with', 'only', 'n2', 'states', 'where', 'n', 'is', 'the', 'number', 'of', 'degrees', 'of', 'freedom', 'of', 'the', 'master', 'and', 'slave', 'robots', 'they', 'introduce', 'dynamic', 'scaling', 'factors', 'to', 'accelerate', 'the', 'speed', 'of', 'convergence', 'of', 'the', 'velocity', 'estimates', 'and', 'thus', 'to', 'limit', 'the', 'energy', 'generated', 'by', 'the', 'velocity', 'estimation', 'errors', 'and', 'to', 'guarantee', 'sufficient', 'estimatebased', 'damping', 'injection', 'to', 'dissipate', 'the', 'energy', 'generated', 'by', 'the', 'timevarying', 'delays', 'the', 'paper', 'shows', 'that', 'proportional', 'plus', 'damping', 'control', 'with', 'the', 'simplified', 'and', 'augmented', 'immersion', 'and', 'invariancebased', 'velocity', 'observers', 'can', 'synchronize', 'the', 'free', 'master', 'and', 'slave', 'motions', 'in', 'the', 'presence', 'of', 'timevarying', 'delays', 'without', 'using', 'velocity', 'measurements', 'numerical', 'results', 'illustrate', 'the', 'estimation', 'performance', 'of', 'the', 'new', 'observers', 'and', 'the', 'stability', 'of', 'a', 'simulated', 'two', 'degreesoffreedom', 'nonlinear', 'teleoperation', 'system', 'with', 'timevarying', 'delays', 'under', 'the', 'proposed', 'output', 'feedback', 'proportional', 'plus', 'damping', 'control']]
|
[-0.18962814249839124, 0.14420794882012575, -0.07084883656617338, -0.030963848952854856, -0.08302448662421243, -0.16556558233886873, 0.032863257417623325, 0.35045763091395865, -0.2806979851289229, -0.3216530378611589, 0.08711837326204246, -0.21245809957988307, -0.10800727642543445, 0.17569603604285725, -0.104276540533068, 0.07833072101559745, 0.08072756122088652, 0.032728521203601056, -0.04272410078622422, -0.22307704168964515, 0.2711788928162688, 0.06240897536785765, 0.2684540195835077, -0.024630883826665177, 0.18253017404243688, 0.03777037591498811, -0.01929150395153556, 0.039241176874136065, -0.1165201339235864, 0.08916887815013813, 0.19049345886940666, 0.09391931200992655, 0.3043140293712812, -0.39750612674767827, -0.22481783633437855, 0.07723501954354685, 0.15947498199503488, 0.09681620707984125, -0.054545619857063604, -0.3343130479915999, 0.036381597207351166, -0.14748285775501493, -0.17207134744305883, -0.08521084748843516, -0.005855101330036467, 0.0722440117624191, -0.3129121247845681, 0.10031672287070913, 0.017136641868009148, 0.0597550661517413, -0.10223636232231828, -0.011512756783552257, -0.0350896247069944, 0.14550633070493033, 0.03476692016358191, -1.4149962225928903e-05, 0.14705542505808725, -0.1228891324228078, -0.09230545684510037, 0.3599924406100234, -0.08461814030174124, -0.26496898405325325, 0.18909778873057803, -0.09538715628018095, -0.06193114385612055, 0.1760820009883239, 0.22714105316712943, 0.06587427639698779, -0.15416834423244422, 0.027346594303790796, 0.038581198364475065, 0.19757514185700778, 0.06522655811435966, 0.039874018035003574, 0.1267060508266282, 0.09597587837329642, 0.13393156938731077, 0.08796407223847134, -0.08846023829639969, -0.1116840338833175, -0.3308051769960333, -0.12396741491499018, -0.12411940335534216, 0.00038490885741670024, -0.09561722995162696, -0.10698050621431321, 0.3766353043280436, 0.16753503851611062, 0.14807900831378487, 0.11489885033965534, 0.3788442931836471, 0.15052362502286665, 0.031053181801160627, 0.145752306670395, 0.26862380154885945, 0.14632261999279514, 0.10993528219511393, -0.30054616451326926, 0.061423462661134014, 0.034225743043035356]
|
1,803.0816
|
An Economic Bubble Model and Its First Passage Time
|
We introduce a new diffusion process Xt to describe asset prices within an
economic bubble cycle. The main feature of the process, which differs from
existing models, is the drift term where a mean-reversion is taken based on an
exponential decay of the scaled price. Our study shows the scaling factor on Xt
is crucial for modelling economic bubbles as it mitigates the dependence
structure between the price and parameters in the model. We prove both the
process and its first passage time are well-defined. An efficient calibration
scheme, together with the probability density function for the process are
given. Moreover, by employing the perturbation technique, we deduce the
closed-form density for the downward first passage time, which therefore can be
used in estimating the burst time of an economic bubble. The object of this
study is to understand the asset price dynamics when a financial bubble is
believed to form, and correspondingly provide estimates to the bubble crash
time. Calibration examples on the US dot-com bubble and the 2007 Chinese stock
market crash verify the effectiveness of the model itself. The example on
BitCoin prediction confirms that we can provide meaningful estimate on the
downward probability for asset prices.
|
q-fin.MF
|
we introduce a new diffusion process xt to describe asset prices within an economic bubble cycle the main feature of the process which differs from existing models is the drift term where a meanreversion is taken based on an exponential decay of the scaled price our study shows the scaling factor on xt is crucial for modelling economic bubbles as it mitigates the dependence structure between the price and parameters in the model we prove both the process and its first passage time are welldefined an efficient calibration scheme together with the probability density function for the process are given moreover by employing the perturbation technique we deduce the closedform density for the downward first passage time which therefore can be used in estimating the burst time of an economic bubble the object of this study is to understand the asset price dynamics when a financial bubble is believed to form and correspondingly provide estimates to the bubble crash time calibration examples on the us dotcom bubble and the 2007 chinese stock market crash verify the effectiveness of the model itself the example on bitcoin prediction confirms that we can provide meaningful estimate on the downward probability for asset prices
|
[['we', 'introduce', 'a', 'new', 'diffusion', 'process', 'xt', 'to', 'describe', 'asset', 'prices', 'within', 'an', 'economic', 'bubble', 'cycle', 'the', 'main', 'feature', 'of', 'the', 'process', 'which', 'differs', 'from', 'existing', 'models', 'is', 'the', 'drift', 'term', 'where', 'a', 'meanreversion', 'is', 'taken', 'based', 'on', 'an', 'exponential', 'decay', 'of', 'the', 'scaled', 'price', 'our', 'study', 'shows', 'the', 'scaling', 'factor', 'on', 'xt', 'is', 'crucial', 'for', 'modelling', 'economic', 'bubbles', 'as', 'it', 'mitigates', 'the', 'dependence', 'structure', 'between', 'the', 'price', 'and', 'parameters', 'in', 'the', 'model', 'we', 'prove', 'both', 'the', 'process', 'and', 'its', 'first', 'passage', 'time', 'are', 'welldefined', 'an', 'efficient', 'calibration', 'scheme', 'together', 'with', 'the', 'probability', 'density', 'function', 'for', 'the', 'process', 'are', 'given', 'moreover', 'by', 'employing', 'the', 'perturbation', 'technique', 'we', 'deduce', 'the', 'closedform', 'density', 'for', 'the', 'downward', 'first', 'passage', 'time', 'which', 'therefore', 'can', 'be', 'used', 'in', 'estimating', 'the', 'burst', 'time', 'of', 'an', 'economic', 'bubble', 'the', 'object', 'of', 'this', 'study', 'is', 'to', 'understand', 'the', 'asset', 'price', 'dynamics', 'when', 'a', 'financial', 'bubble', 'is', 'believed', 'to', 'form', 'and', 'correspondingly', 'provide', 'estimates', 'to', 'the', 'bubble', 'crash', 'time', 'calibration', 'examples', 'on', 'the', 'us', 'dotcom', 'bubble', 'and', 'the', '2007', 'chinese', 'stock', 'market', 'crash', 'verify', 'the', 'effectiveness', 'of', 'the', 'model', 'itself', 'the', 'example', 'on', 'bitcoin', 'prediction', 'confirms', 'that', 'we', 'can', 'provide', 'meaningful', 'estimate', 'on', 'the', 'downward', 'probability', 'for', 'asset', 'prices']]
|
[-0.06943397619295866, 0.06642719899100484, -0.1335402459569741, 0.11404226078495412, -0.06504111871821806, -0.08069610146754712, 0.09130675230873748, 0.3833511925023049, -0.2880138035770506, -0.25292960058897734, 0.15840926378034056, -0.2658952608378604, -0.12432076449884334, 0.2071268566767685, -0.08671026117750444, 0.01780044895800529, 0.032718286722665656, 0.01789082702511223, 0.03960817202925682, -0.23396342169726267, 0.2778523362800479, 0.09739748679567128, 0.28192576561705207, 0.05059804051183164, 0.12310986622353084, -0.023131597952451555, -0.07038075000979006, -0.03142494606319815, -0.160958651996516, 0.09364272862963845, 0.19803937945305733, 0.11511673938832245, 0.3071566102898214, -0.45705974831595086, -0.18796065313916188, 0.091318653174676, 0.0761763826617971, 0.0644105537631549, -0.004712524187198142, -0.2712717761984095, 0.019502944357227534, -0.21211865809978916, -0.12844016524089966, -0.059958837706944906, 0.041727654840797185, 0.021411148302722723, -0.3057254414743511, 0.08749963689886499, 0.045195193099789324, -0.005151271755166818, -0.052254409362212755, -0.05913068039342761, -0.021759274444775656, 0.15058977720822442, 0.1149673178786179, -0.00765018705977127, 0.15130088726058602, -0.11114896555431188, -0.13547841930761934, 0.3669601211883128, -0.09477336593205109, -0.13748311860952525, 0.11906814397196286, -0.1617924875812605, -0.10888380099320784, 0.1339452226413414, 0.1916374892089516, 0.04699479768052697, -0.1628853373433958, 0.0526674355333671, -0.030657355721341446, 0.18852724198251963, 0.039076333343982694, -0.05211429348215461, 0.1635471781977685, 0.2076421728968853, 0.10108133375411853, 0.1352206431509694, -0.11433661923394539, -0.16119388669962065, -0.30999259375967086, -0.17107474312419071, -0.17564536136575043, 0.04496903908089735, -0.16295318170334214, -0.17517326542176306, 0.4039698230551403, 0.16639561962801963, 0.17556439770618454, 0.08016333270788892, 0.2693261333450209, 0.1894349567545578, -0.00830908171075862, 0.1118607192609852, 0.18621917334385216, 0.02588213609997183, 0.11793102632509544, -0.20321593444503377, 0.19718183761928232, 0.08080931103067997]
|
1,803.08161
|
Entropy-based closure for probabilistic learning on manifolds
|
In a recent paper, the authors proposed a general methodology for
probabilistic learning on manifolds. The method was used to generate numerical
samples that are statistically consistent with an existing dataset construed as
a realization from a non-Gaussian random vector. The manifold structure is
learned using diffusion manifolds and the statistical sample generation is
accomplished using a projected Ito stochastic differential equation. This
probabilistic learning approach has been extended to polynomial chaos
representation of databases on manifolds and to probabilistic nonconvex
constrained optimization with a fixed budget of function evaluations. The
methodology introduces an isotropic-diffusion kernel with hyperparameter
{\epsilon}. Currently, {\epsilon} is more or less arbitrarily chosen. In this
paper, we propose a selection criterion for identifying an optimal value of
{\epsilon}, based on a maximum entropy argument. The result is a comprehensive,
closed, probabilistic model for characterizing data sets with hidden
constraints. This entropy argument ensures that out of all possible models,
this is the one that is the most uncertain beyond any specified constraints,
which is selected. Applications are presented for several databases.
|
math.PR stat.ML
|
in a recent paper the authors proposed a general methodology for probabilistic learning on manifolds the method was used to generate numerical samples that are statistically consistent with an existing dataset construed as a realization from a nongaussian random vector the manifold structure is learned using diffusion manifolds and the statistical sample generation is accomplished using a projected ito stochastic differential equation this probabilistic learning approach has been extended to polynomial chaos representation of databases on manifolds and to probabilistic nonconvex constrained optimization with a fixed budget of function evaluations the methodology introduces an isotropicdiffusion kernel with hyperparameter epsilon currently epsilon is more or less arbitrarily chosen in this paper we propose a selection criterion for identifying an optimal value of epsilon based on a maximum entropy argument the result is a comprehensive closed probabilistic model for characterizing data sets with hidden constraints this entropy argument ensures that out of all possible models this is the one that is the most uncertain beyond any specified constraints which is selected applications are presented for several databases
|
[['in', 'a', 'recent', 'paper', 'the', 'authors', 'proposed', 'a', 'general', 'methodology', 'for', 'probabilistic', 'learning', 'on', 'manifolds', 'the', 'method', 'was', 'used', 'to', 'generate', 'numerical', 'samples', 'that', 'are', 'statistically', 'consistent', 'with', 'an', 'existing', 'dataset', 'construed', 'as', 'a', 'realization', 'from', 'a', 'nongaussian', 'random', 'vector', 'the', 'manifold', 'structure', 'is', 'learned', 'using', 'diffusion', 'manifolds', 'and', 'the', 'statistical', 'sample', 'generation', 'is', 'accomplished', 'using', 'a', 'projected', 'ito', 'stochastic', 'differential', 'equation', 'this', 'probabilistic', 'learning', 'approach', 'has', 'been', 'extended', 'to', 'polynomial', 'chaos', 'representation', 'of', 'databases', 'on', 'manifolds', 'and', 'to', 'probabilistic', 'nonconvex', 'constrained', 'optimization', 'with', 'a', 'fixed', 'budget', 'of', 'function', 'evaluations', 'the', 'methodology', 'introduces', 'an', 'isotropicdiffusion', 'kernel', 'with', 'hyperparameter', 'epsilon', 'currently', 'epsilon', 'is', 'more', 'or', 'less', 'arbitrarily', 'chosen', 'in', 'this', 'paper', 'we', 'propose', 'a', 'selection', 'criterion', 'for', 'identifying', 'an', 'optimal', 'value', 'of', 'epsilon', 'based', 'on', 'a', 'maximum', 'entropy', 'argument', 'the', 'result', 'is', 'a', 'comprehensive', 'closed', 'probabilistic', 'model', 'for', 'characterizing', 'data', 'sets', 'with', 'hidden', 'constraints', 'this', 'entropy', 'argument', 'ensures', 'that', 'out', 'of', 'all', 'possible', 'models', 'this', 'is', 'the', 'one', 'that', 'is', 'the', 'most', 'uncertain', 'beyond', 'any', 'specified', 'constraints', 'which', 'is', 'selected', 'applications', 'are', 'presented', 'for', 'several', 'databases']]
|
[-0.09984769938104175, 0.021916179329905548, -0.10333922117595272, 0.07524492919522648, -0.12172619755320979, -0.16312262175929862, 0.053350494243204594, 0.37085621442174777, -0.26565601786226567, -0.3009676971237293, 0.11418092470942601, -0.2635764578228881, -0.14972607287358836, 0.2115159593388738, -0.10497789220093622, 0.11049261450534686, 0.06860183824212344, 0.03822801943772055, -0.06398584101858934, -0.25970319519220886, 0.3286156892171226, 0.053639927734460295, 0.2536917204296901, -0.01189084974353084, 0.14473099966901296, -0.02320321282403993, -0.03671242668421875, 0.03943834224093275, -0.12351368380981952, 0.16990048106861483, 0.2698387795581588, 0.17679108413412695, 0.3333817393179105, -0.34979327412665223, -0.2357152027891542, 0.1289939360730564, 0.10980430393578115, 0.1153908966814339, -0.04495870098098644, -0.2713231248352891, 0.09768866798465793, -0.15048613410390213, -0.08704371994425511, -0.11318131283075474, 0.00685498075581145, -0.023620590725819977, -0.3375788526760077, 0.03777537590706314, 0.07539209728289781, 0.06631360619981912, -0.04362490565359496, -0.1253394652572835, 0.022268150553064442, 0.056759437724102246, 0.022182687402812592, 0.06866355005574103, 0.11636551135539441, -0.08782920880736944, -0.1470444940770548, 0.34197543828544774, -0.06263350148888669, -0.2665363437464011, 0.15855820897910422, -0.04895202822022504, -0.18499043565404055, 0.1166690716696582, 0.18072279995500012, 0.17955225057118498, -0.20558693750805607, 0.08853069824720572, -0.06835940199229738, 0.17990780486350602, 0.008620345451194665, -0.017350506528224476, 0.14926316508964432, 0.21418311841914367, 0.10339094096816134, 0.13251491583048783, -0.06847208572535551, -0.11564462974262103, -0.31482587471047696, -0.11075869508638936, -0.22656551103613437, 0.028603993151497482, -0.1227411902695292, -0.17497009122423057, 0.3533775529492347, 0.15317760825681703, 0.19787986387081188, 0.10652749101837412, 0.3042753429631114, 0.1342360620144701, 0.039320119078560124, 0.08805823563357237, 0.18402615508690862, 0.10693245425140592, 0.07868638754308481, -0.1300427093392709, 0.11499007880264872, 0.06553053305131094]
|
1,803.08162
|
Large Thermal Hall Effect in $\alpha$-RuCl$_3$: Evidence for Heat
Transport by Kitaev-Heisenberg Paramagnons
|
The honeycomb Kitaev model in a magnetic field is a source of a topological
quantum spin liquid with Majorana fermions and gauge flux excitations as
fractional quasiparticles. We present experimental results for the thermal Hall
effect of the material $\alpha$-RuCl$_{3}$ which recently emerged as a prime
candidate for realizing such physics. At temperatures above long-range magnetic
ordering $T\gtrsim T_N\approx8$ K, we observe with an applied magnetic field
$B$ perpendicular to the honeycomb layers a sizeable positive transversal heat
conductivity $\kappa_{xy}$ which increases linearly with $B$. Upon raising the
temperature, $\kappa_{xy}(T)$ increases strongly, exhibits a broad maximum at
around 30 K, and eventually becomes negligible at $T\gtrsim 125$ K. Remarkably,
the longitudinal heat conductivity $\kappa_{xx}(T)$ exhibits a sizeable
positive thermal magnetoresistance effect. Thus, our findings provide clear-cut
evidence for longitudinal and transverse magnetic heat transport and underpin
the unconventional nature of the quasiparticles in the paramagnetic phase of
$\alpha$-RuCl$_{3}$.
|
cond-mat.str-el
|
the honeycomb kitaev model in a magnetic field is a source of a topological quantum spin liquid with majorana fermions and gauge flux excitations as fractional quasiparticles we present experimental results for the thermal hall effect of the material alpharucl_3 which recently emerged as a prime candidate for realizing such physics at temperatures above longrange magnetic ordering tgtrsim t_napprox8 k we observe with an applied magnetic field b perpendicular to the honeycomb layers a sizeable positive transversal heat conductivity kappa_xy which increases linearly with b upon raising the temperature kappa_xyt increases strongly exhibits a broad maximum at around 30 k and eventually becomes negligible at tgtrsim 125 k remarkably the longitudinal heat conductivity kappa_xxt exhibits a sizeable positive thermal magnetoresistance effect thus our findings provide clearcut evidence for longitudinal and transverse magnetic heat transport and underpin the unconventional nature of the quasiparticles in the paramagnetic phase of alpharucl_3
|
[['the', 'honeycomb', 'kitaev', 'model', 'in', 'a', 'magnetic', 'field', 'is', 'a', 'source', 'of', 'a', 'topological', 'quantum', 'spin', 'liquid', 'with', 'majorana', 'fermions', 'and', 'gauge', 'flux', 'excitations', 'as', 'fractional', 'quasiparticles', 'we', 'present', 'experimental', 'results', 'for', 'the', 'thermal', 'hall', 'effect', 'of', 'the', 'material', 'alpharucl_3', 'which', 'recently', 'emerged', 'as', 'a', 'prime', 'candidate', 'for', 'realizing', 'such', 'physics', 'at', 'temperatures', 'above', 'longrange', 'magnetic', 'ordering', 'tgtrsim', 't_napprox8', 'k', 'we', 'observe', 'with', 'an', 'applied', 'magnetic', 'field', 'b', 'perpendicular', 'to', 'the', 'honeycomb', 'layers', 'a', 'sizeable', 'positive', 'transversal', 'heat', 'conductivity', 'kappa_xy', 'which', 'increases', 'linearly', 'with', 'b', 'upon', 'raising', 'the', 'temperature', 'kappa_xyt', 'increases', 'strongly', 'exhibits', 'a', 'broad', 'maximum', 'at', 'around', '30', 'k', 'and', 'eventually', 'becomes', 'negligible', 'at', 'tgtrsim', '125', 'k', 'remarkably', 'the', 'longitudinal', 'heat', 'conductivity', 'kappa_xxt', 'exhibits', 'a', 'sizeable', 'positive', 'thermal', 'magnetoresistance', 'effect', 'thus', 'our', 'findings', 'provide', 'clearcut', 'evidence', 'for', 'longitudinal', 'and', 'transverse', 'magnetic', 'heat', 'transport', 'and', 'underpin', 'the', 'unconventional', 'nature', 'of', 'the', 'quasiparticles', 'in', 'the', 'paramagnetic', 'phase', 'of', 'alpharucl_3']]
|
[-0.20714645930374526, 0.3139714576083288, -0.017609168335234057, 0.00788645131261509, -0.09622406307926835, -0.1877846721055828, 0.09610570857639437, 0.3431958086176278, -0.2440517074237131, -0.30832584640920185, -0.017010876330011207, -0.34288974157662117, -0.07817630229712375, 0.19917729057926584, 0.10454352200190753, 0.0014706423373778083, -0.05862590288807166, 0.018695417470092388, -0.08006956028968912, -0.20379698423234976, 0.22251872907150283, 0.0407231933116747, 0.30794125007567547, 0.1584743238803739, 0.056206193822754984, -0.017037737977448595, 0.12442503243123423, 0.058129076539755686, -0.1472306934835976, -0.029993613266500914, 0.22797309850304298, -0.156440892856415, 0.17679373736250892, -0.3850061179534213, -0.2181471957097927, 0.027275918405630612, 0.12244462291710079, 0.13750513348160695, -0.0932517894966311, -0.24498974629486464, 0.037296629839334385, -0.14183669065744042, -0.13641634749723852, -0.11771671231261978, 0.02407919150403994, -0.09426996293649148, -0.2693951189683827, 0.1422518527554667, 0.09427191869496074, 0.12900959834542558, -0.07972479382950863, -0.1957028146629056, -0.07233181949035099, 0.011103175462491503, 0.0691708061805837, 0.09570031311229024, 0.15816714517670136, -0.16583665669018607, -0.14906069426159438, 0.32504363388280794, -0.11197919272243569, -0.04368524599743828, 0.16667755970042453, -0.2048355915188177, -0.08014193774489622, 0.19918810253427044, 0.11103825388063217, 0.05479135302418511, -0.0914931758753445, 0.0694862864114191, -0.05037957037821387, 0.14823197807210867, -0.015578694067487162, 0.09620374832174754, 0.36102820219063797, 0.1879771449196484, 0.06310608650060141, 0.17912043979445677, -0.13942487975066187, -0.027205240349795618, -0.24892255526166793, -0.19843026076775197, -0.2081589043899503, 0.1183594060963664, -0.08601310410917966, -0.22162294301064048, 0.39471881518982455, 0.16560653442876136, 0.1928432722550447, -0.05081629940174673, 0.2147424779034998, 0.11429103498573555, 0.07602149124451824, 0.10150735680433907, 0.22187588703563463, 0.24345920822417286, 0.1883973495345818, -0.3321843026556738, 0.010933057189765961, -0.027520419052987015]
|
1,803.08163
|
Detection of the closest Jovian exoplanet in the Epsilon Indi triple
system
|
We confirm the trend in the radial velocity data for Epsilon Indi A
suggesting a long-period planetary companion and find significant curvature is
present, sufficient to quantify Epsilon Indi Ab as a cold Jupiter with a
minimum mass of $2.71_{-0.44}^{+2.19}~M_{\rm Jup}$ on a nearly circular orbit
with a semi-major axis of $12.82_{-0.71}^{+4.18}$ au and an orbital period of
$52.62_{-4.12}^{+27.70}$ yr. We also identify other significant signals in the
radial velocity data. We investigate a variety of spectral diagnostics and
interpret these signals as arising from activity-induced radial velocity
variations. In particular, the 2500 and 278 d signals are caused by magnetic
cycles. While a planetary signal might be present in the 17.8 d signal, the
origin of 17.8 and 11 d signals are most easily interpreted as arising in the
rotation of the star with a period of about 35 d. We find that traditional
activity indicators have a variety of sensitivities. In particular, the sodium
lines and CaHK index are sensitive to all activity-induced signals. The line
bisector measurement is sensitive to stellar rotation signal while H$\alpha$ is
sensitive to the secondary magnetic cycle. In general, because of their
different sensitivities these activity indicators introduce extra noise if
included in the noise model whereas differential RVs provide a robust proxy to
remove wavelength-dependent noise efficiently. Based on these analyses, we
propose an activity diagnostics procedure for the detection of low amplitude
signals in high precision radial velocity data. Thus the Epsilon Indi system
comprises of at least Epsilon Indi A, Ab as well as a long period brown dwarf
binary Ba and Bb; so it provides a benchmark case for our understanding of the
formation of gas giants and brown dwarfs.
|
astro-ph.EP
|
we confirm the trend in the radial velocity data for epsilon indi a suggesting a longperiod planetary companion and find significant curvature is present sufficient to quantify epsilon indi ab as a cold jupiter with a minimum mass of 271_044219m_rm jup on a nearly circular orbit with a semimajor axis of 1282_071418 au and an orbital period of 5262_4122770 yr we also identify other significant signals in the radial velocity data we investigate a variety of spectral diagnostics and interpret these signals as arising from activityinduced radial velocity variations in particular the 2500 and 278 d signals are caused by magnetic cycles while a planetary signal might be present in the 178 d signal the origin of 178 and 11 d signals are most easily interpreted as arising in the rotation of the star with a period of about 35 d we find that traditional activity indicators have a variety of sensitivities in particular the sodium lines and cahk index are sensitive to all activityinduced signals the line bisector measurement is sensitive to stellar rotation signal while halpha is sensitive to the secondary magnetic cycle in general because of their different sensitivities these activity indicators introduce extra noise if included in the noise model whereas differential rvs provide a robust proxy to remove wavelengthdependent noise efficiently based on these analyses we propose an activity diagnostics procedure for the detection of low amplitude signals in high precision radial velocity data thus the epsilon indi system comprises of at least epsilon indi a ab as well as a long period brown dwarf binary ba and bb so it provides a benchmark case for our understanding of the formation of gas giants and brown dwarfs
|
[['we', 'confirm', 'the', 'trend', 'in', 'the', 'radial', 'velocity', 'data', 'for', 'epsilon', 'indi', 'a', 'suggesting', 'a', 'longperiod', 'planetary', 'companion', 'and', 'find', 'significant', 'curvature', 'is', 'present', 'sufficient', 'to', 'quantify', 'epsilon', 'indi', 'ab', 'as', 'a', 'cold', 'jupiter', 'with', 'a', 'minimum', 'mass', 'of', '271_044219m_rm', 'jup', 'on', 'a', 'nearly', 'circular', 'orbit', 'with', 'a', 'semimajor', 'axis', 'of', '1282_071418', 'au', 'and', 'an', 'orbital', 'period', 'of', '5262_4122770', 'yr', 'we', 'also', 'identify', 'other', 'significant', 'signals', 'in', 'the', 'radial', 'velocity', 'data', 'we', 'investigate', 'a', 'variety', 'of', 'spectral', 'diagnostics', 'and', 'interpret', 'these', 'signals', 'as', 'arising', 'from', 'activityinduced', 'radial', 'velocity', 'variations', 'in', 'particular', 'the', '2500', 'and', '278', 'd', 'signals', 'are', 'caused', 'by', 'magnetic', 'cycles', 'while', 'a', 'planetary', 'signal', 'might', 'be', 'present', 'in', 'the', '178', 'd', 'signal', 'the', 'origin', 'of', '178', 'and', '11', 'd', 'signals', 'are', 'most', 'easily', 'interpreted', 'as', 'arising', 'in', 'the', 'rotation', 'of', 'the', 'star', 'with', 'a', 'period', 'of', 'about', '35', 'd', 'we', 'find', 'that', 'traditional', 'activity', 'indicators', 'have', 'a', 'variety', 'of', 'sensitivities', 'in', 'particular', 'the', 'sodium', 'lines', 'and', 'cahk', 'index', 'are', 'sensitive', 'to', 'all', 'activityinduced', 'signals', 'the', 'line', 'bisector', 'measurement', 'is', 'sensitive', 'to', 'stellar', 'rotation', 'signal', 'while', 'halpha', 'is', 'sensitive', 'to', 'the', 'secondary', 'magnetic', 'cycle', 'in', 'general', 'because', 'of', 'their', 'different', 'sensitivities', 'these', 'activity', 'indicators', 'introduce', 'extra', 'noise', 'if', 'included', 'in', 'the', 'noise', 'model', 'whereas', 'differential', 'rvs', 'provide', 'a', 'robust', 'proxy', 'to', 'remove', 'wavelengthdependent', 'noise', 'efficiently', 'based', 'on', 'these', 'analyses', 'we', 'propose', 'an', 'activity', 'diagnostics', 'procedure', 'for', 'the', 'detection', 'of', 'low', 'amplitude', 'signals', 'in', 'high', 'precision', 'radial', 'velocity', 'data', 'thus', 'the', 'epsilon', 'indi', 'system', 'comprises', 'of', 'at', 'least', 'epsilon', 'indi', 'a', 'ab', 'as', 'well', 'as', 'a', 'long', 'period', 'brown', 'dwarf', 'binary', 'ba', 'and', 'bb', 'so', 'it', 'provides', 'a', 'benchmark', 'case', 'for', 'our', 'understanding', 'of', 'the', 'formation', 'of', 'gas', 'giants', 'and', 'brown', 'dwarfs']]
|
[-0.14088226298698955, 0.11576254987401978, -0.05402661307694434, 0.061651443459651026, -0.06323213810785457, -0.11922138430408492, 0.06468829753688507, 0.382945069104373, -0.21378202027746387, -0.35259778833010075, 0.10158321911954792, -0.2715704838751972, -0.09845143221118437, 0.20352505703997467, -0.06904332469781614, 0.00511495935093064, 0.09037442648855094, 0.014477702371853715, -0.04320895563565715, -0.19611675231709183, 0.2432096876975109, 0.04480737755759402, 0.12403044373624855, -0.008293397441726698, 0.03192812470363714, -0.05492056974966753, -0.08116928075753589, -0.020049045047652658, -0.13715080978315158, 0.036722741473639735, 0.22732108718578747, 0.1307408220466814, 0.21331803739517569, -0.33140777190980303, -0.19456387224597155, 0.08123777843477692, 0.14572500565847027, 0.06165195261979456, -0.03859436803824505, -0.24896030982340417, 0.0977840865494877, -0.15666081321152014, -0.15129107825865296, -0.02805973161813072, 0.1177666253780806, 0.03137550918146714, -0.30558393302450365, 0.1319644121977035, 0.05388850860563057, 0.1613816632338429, -0.09401459345597386, -0.15174715394925287, -0.055876022898241555, 0.0783558770902388, 0.03311486886714094, 0.07360716180635556, 0.14384963693210728, -0.07041519211177918, -0.06060158778365875, 0.39994964176475145, -0.15535300057114346, -0.09041901610668175, 0.21912378734011057, -0.1934990924691254, -0.13095480801477546, 0.14872503916542695, 0.2012718985442199, 0.11243639138734175, -0.1469558755363134, -0.006867050705540184, 0.010788444890290178, 0.22116912052863175, 0.058955067557559804, 0.06823543124389084, 0.3027581702049915, 0.11174408571546778, 0.07257209325336107, 0.053081834744695425, -0.2627818159722326, -0.012291586826122317, -0.2166999386974834, -0.11388348716807278, -0.1203531031075391, 0.031912020508593826, -0.1263083800699355, -0.14256856651262356, 0.37038224619760274, 0.12078161961666065, 0.2420279485378815, 0.007230196535790934, 0.3034286114744388, 0.10084346770855522, 0.07473427697753919, 0.07794672163290149, 0.2926430550627544, 0.17952509551546053, 0.10104715214803561, -0.24180205264228888, 0.08347280318414839, -0.026709956549254902]
|
1,803.08164
|
Boltzmann approach to spin-orbit-induced transport in effective quantum
theories
|
In model studies of the spin/anomalous Hall effect, effective Hamiltonians
often serve as the starting point. However, a complete effective quantum theory
contains not only the effective Hamiltonian but also the relation linking the
physical observables to the canonical ones. We construct the semiclassical
Boltzmann (SB) transport framework in the weak disorder-potential regime
directly in the level of the effective quantum theory, and confirm this
construction by formulating a generalized Kohn-Luttinger density matrix
transport theory also in this level. The link and difference between the
present SB theory and previous phenomenological Boltzmann, quantum kinetic and
usual Kubo-Streda theories are clarified. We also present the slightly
generalized Kubo-Streda formula in the level of the effective quantum theory.
In this level, it is the generalized Kubo-Streda formula rather than the usual
one that leads to the same physical interpretations as the present SB theory.
In the application to a Rashba 2D effective model, a nonzero spin Hall effect
important in the case of strong Rashba coupling but neglected in previous
theories is found.
|
cond-mat.mes-hall
|
in model studies of the spinanomalous hall effect effective hamiltonians often serve as the starting point however a complete effective quantum theory contains not only the effective hamiltonian but also the relation linking the physical observables to the canonical ones we construct the semiclassical boltzmann sb transport framework in the weak disorderpotential regime directly in the level of the effective quantum theory and confirm this construction by formulating a generalized kohnluttinger density matrix transport theory also in this level the link and difference between the present sb theory and previous phenomenological boltzmann quantum kinetic and usual kubostreda theories are clarified we also present the slightly generalized kubostreda formula in the level of the effective quantum theory in this level it is the generalized kubostreda formula rather than the usual one that leads to the same physical interpretations as the present sb theory in the application to a rashba 2d effective model a nonzero spin hall effect important in the case of strong rashba coupling but neglected in previous theories is found
|
[['in', 'model', 'studies', 'of', 'the', 'spinanomalous', 'hall', 'effect', 'effective', 'hamiltonians', 'often', 'serve', 'as', 'the', 'starting', 'point', 'however', 'a', 'complete', 'effective', 'quantum', 'theory', 'contains', 'not', 'only', 'the', 'effective', 'hamiltonian', 'but', 'also', 'the', 'relation', 'linking', 'the', 'physical', 'observables', 'to', 'the', 'canonical', 'ones', 'we', 'construct', 'the', 'semiclassical', 'boltzmann', 'sb', 'transport', 'framework', 'in', 'the', 'weak', 'disorderpotential', 'regime', 'directly', 'in', 'the', 'level', 'of', 'the', 'effective', 'quantum', 'theory', 'and', 'confirm', 'this', 'construction', 'by', 'formulating', 'a', 'generalized', 'kohnluttinger', 'density', 'matrix', 'transport', 'theory', 'also', 'in', 'this', 'level', 'the', 'link', 'and', 'difference', 'between', 'the', 'present', 'sb', 'theory', 'and', 'previous', 'phenomenological', 'boltzmann', 'quantum', 'kinetic', 'and', 'usual', 'kubostreda', 'theories', 'are', 'clarified', 'we', 'also', 'present', 'the', 'slightly', 'generalized', 'kubostreda', 'formula', 'in', 'the', 'level', 'of', 'the', 'effective', 'quantum', 'theory', 'in', 'this', 'level', 'it', 'is', 'the', 'generalized', 'kubostreda', 'formula', 'rather', 'than', 'the', 'usual', 'one', 'that', 'leads', 'to', 'the', 'same', 'physical', 'interpretations', 'as', 'the', 'present', 'sb', 'theory', 'in', 'the', 'application', 'to', 'a', 'rashba', '2d', 'effective', 'model', 'a', 'nonzero', 'spin', 'hall', 'effect', 'important', 'in', 'the', 'case', 'of', 'strong', 'rashba', 'coupling', 'but', 'neglected', 'in', 'previous', 'theories', 'is', 'found']]
|
[-0.12497455809408656, 0.14318311621246244, -0.1055315204251271, 0.13085779155254607, -0.04384183033904027, -0.1620669167147145, 0.04750061849719079, 0.27010650602141784, -0.2604118264914, -0.2835098927862634, -0.003023912973795637, -0.24895807185359078, -0.20296114554749967, 0.15330080036625002, -0.007973553794684143, 0.02986716982473195, -0.01269924800468267, 0.04161300655067265, -0.11792816418862334, -0.2164610075425445, 0.30146175332452835, 0.07512914934870649, 0.3062286387285846, 0.0861289599654127, 0.06115867102177009, 0.0373109199779009, 0.02178027058647861, 0.05098509464754596, -0.13725033974208348, 0.11467073937828416, 0.2334087923962689, -0.008482363628851767, 0.21211881477650277, -0.43631753434575876, -0.25039765952804577, 0.016971790817285167, 0.11314210717252196, 0.18599956792079397, -0.01815886991153631, -0.22750179029687048, 0.03812913028046298, -0.2169948653317988, -0.14993432580531965, -0.06690641593039257, 0.001669159823113821, -0.07022300212280329, -0.21945489845211072, 0.12324668796434751, 0.07508970950261729, 0.06421288397692188, -0.053693827142465046, -0.12459288216223555, -0.011834413270581757, 0.07860580212629494, 0.02390742914602381, 0.03716235048311195, 0.10591757277677046, -0.15045147856470809, -0.1130795611768476, 0.3969017852141836, -0.0865187430868825, -0.23038801465448014, 0.17307634199501054, -0.1396653266629127, -0.13329612972633637, 0.05618788277559512, 0.07686199987797651, 0.12004342164634865, -0.14655591768471624, 0.15572783711487592, -0.05405203794534236, 0.11041273041190883, -0.016670943268150443, 0.06692532929950036, 0.21635647248456077, 0.113189541326957, 0.019369909639012885, 0.10719685255379013, -0.03824246504768376, -0.15397489530216218, -0.3275643421072491, -0.14880936068345615, -0.176877280454752, 0.09862085952178627, -0.07462141918502031, -0.17753257380988582, 0.37465079880688756, 0.18989874622591676, 0.16862929716827513, 0.024353838222619346, 0.2887799945334799, 0.19579624426936917, 0.06863799610191725, 0.022488855230539333, 0.28196058814212704, 0.17930677700264258, 0.08135374622507649, -0.25141270514081654, 0.01627976877736093, 0.11857297088394284]
|
1,803.08165
|
Comparing Fixed and Adaptive Computation Time for Recurrent Neural
Networks
|
Adaptive Computation Time for Recurrent Neural Networks (ACT) is one of the
most promising architectures for variable computation. ACT adapts to the input
sequence by being able to look at each sample more than once, and learn how
many times it should do it. In this paper, we compare ACT to Repeat-RNN, a
novel architecture based on repeating each sample a fixed number of times. We
found surprising results, where Repeat-RNN performs as good as ACT in the
selected tasks. Source code in TensorFlow and PyTorch is publicly available at
https://imatge-upc.github.io/danifojo-2018-repeatrnn/
|
cs.NE cs.LG
|
adaptive computation time for recurrent neural networks act is one of the most promising architectures for variable computation act adapts to the input sequence by being able to look at each sample more than once and learn how many times it should do it in this paper we compare act to repeatrnn a novel architecture based on repeating each sample a fixed number of times we found surprising results where repeatrnn performs as good as act in the selected tasks source code in tensorflow and pytorch is publicly available at httpsimatgeupcgithubiodanifojo2018repeatrnn
|
[['adaptive', 'computation', 'time', 'for', 'recurrent', 'neural', 'networks', 'act', 'is', 'one', 'of', 'the', 'most', 'promising', 'architectures', 'for', 'variable', 'computation', 'act', 'adapts', 'to', 'the', 'input', 'sequence', 'by', 'being', 'able', 'to', 'look', 'at', 'each', 'sample', 'more', 'than', 'once', 'and', 'learn', 'how', 'many', 'times', 'it', 'should', 'do', 'it', 'in', 'this', 'paper', 'we', 'compare', 'act', 'to', 'repeatrnn', 'a', 'novel', 'architecture', 'based', 'on', 'repeating', 'each', 'sample', 'a', 'fixed', 'number', 'of', 'times', 'we', 'found', 'surprising', 'results', 'where', 'repeatrnn', 'performs', 'as', 'good', 'as', 'act', 'in', 'the', 'selected', 'tasks', 'source', 'code', 'in', 'tensorflow', 'and', 'pytorch', 'is', 'publicly', 'available', 'at', 'httpsimatgeupcgithubiodanifojo2018repeatrnn']]
|
[-0.05859780575503299, 0.05492878979897465, -0.05874155026818202, 0.05784284352888459, -0.10894092102270489, -0.23952129408082162, 0.031104071982223435, 0.47502164966003463, -0.24256157902180514, -0.3237405160748908, 0.11500404273630754, -0.2583343917503953, -0.1668436439199881, 0.2603398830886528, -0.06943983743324432, 0.04571035073869015, 0.08710470403391148, 0.07587987068109214, -0.02942986367799511, -0.31471123080700636, 0.2507939766034145, 0.1122572705869309, 0.28315473620949144, -0.05442266427615488, 0.10677561706821011, -0.012502820176120043, -0.042143272929851344, -0.026984592619225044, -0.04601648537738418, 0.08682346753564409, 0.3005939760160717, 0.1699431112343022, 0.31683238954494963, -0.4362613651178849, -0.17367908870503676, 0.09229294624475931, 0.15749997849872505, 0.12479882125361738, -0.01865155642421583, -0.2338747630128637, 0.1262188442210159, -0.14755688214394136, -0.04914576938608661, -0.0943144511600787, 0.006856396312783049, 0.014959394397341053, -0.25953790516624314, 0.0002631542632694949, 0.02141772851940583, -0.011886038902130995, -0.00860372254233384, -0.14176884347001428, -0.029598483604125002, 0.21853422750824725, 0.00357717695243826, 0.1162667089308591, 0.16388881258370186, -0.092734518077288, -0.11261577671393752, 0.3688368755816059, -0.07462014742966196, -0.17934581319886175, 0.23211793122358026, -0.04661538353486156, -0.21769212343497202, 0.06725064726461741, 0.23343106086196547, 0.1295422805811871, -0.15188564945393326, -0.024103728015854194, -0.03702285617261871, 0.20240066455153283, 0.03800020366377959, 0.04361568017206578, 0.18357595284892755, 0.2472489486363801, 0.06070766546326922, 0.1595988921207291, -0.10051250701971268, -0.05849423061590642, -0.2630042648366229, -0.11921872999730775, -0.2236321123359217, 0.010375005023723299, -0.062010177458432736, -0.12121826679322112, 0.35477952006145974, 0.22898297376973045, 0.24369183739393271, 0.10385712766517165, 0.3171053302939981, 0.029779006332815203, 0.1807017575272105, 0.17386725829617883, 0.12460418407466602, 0.008994506523859773, 0.1061148290596479, -0.12216155340006067, 0.0745348683187992, 0.02476929458366199]
|
1,803.08166
|
Optimal price management in retail energy markets: an impulse control
problem with asymptotic estimates
|
We consider a retailer who buys energy in the wholesale market and resells it
to final consumers. The retailer has to decide when to intervene to change the
price he asks to his customers, in order to maximize his income. We model the
problem as an infinite-horizon stochastic impulse control problem. We
characterize an optimal price strategy and provide analytical existence results
for the equations involved. We then investigate the dependence on the
intervention cost. In particular, we prove that the measure of the continuation
region is asymptotic to the fourth root of the cost. Finally, we provide some
numerical results and consider a suitable extension of the model.
|
math.OC math.PR q-fin.EC
|
we consider a retailer who buys energy in the wholesale market and resells it to final consumers the retailer has to decide when to intervene to change the price he asks to his customers in order to maximize his income we model the problem as an infinitehorizon stochastic impulse control problem we characterize an optimal price strategy and provide analytical existence results for the equations involved we then investigate the dependence on the intervention cost in particular we prove that the measure of the continuation region is asymptotic to the fourth root of the cost finally we provide some numerical results and consider a suitable extension of the model
|
[['we', 'consider', 'a', 'retailer', 'who', 'buys', 'energy', 'in', 'the', 'wholesale', 'market', 'and', 'resells', 'it', 'to', 'final', 'consumers', 'the', 'retailer', 'has', 'to', 'decide', 'when', 'to', 'intervene', 'to', 'change', 'the', 'price', 'he', 'asks', 'to', 'his', 'customers', 'in', 'order', 'to', 'maximize', 'his', 'income', 'we', 'model', 'the', 'problem', 'as', 'an', 'infinitehorizon', 'stochastic', 'impulse', 'control', 'problem', 'we', 'characterize', 'an', 'optimal', 'price', 'strategy', 'and', 'provide', 'analytical', 'existence', 'results', 'for', 'the', 'equations', 'involved', 'we', 'then', 'investigate', 'the', 'dependence', 'on', 'the', 'intervention', 'cost', 'in', 'particular', 'we', 'prove', 'that', 'the', 'measure', 'of', 'the', 'continuation', 'region', 'is', 'asymptotic', 'to', 'the', 'fourth', 'root', 'of', 'the', 'cost', 'finally', 'we', 'provide', 'some', 'numerical', 'results', 'and', 'consider', 'a', 'suitable', 'extension', 'of', 'the', 'model']]
|
[-0.09955905667609638, -0.0038193994968659588, -0.09648120407170306, 0.120753713045916, -0.12358605944448048, -0.135763212253719, 0.1469334575338979, 0.3770818841919579, -0.2971285267698544, -0.2678369396900827, 0.1363664278512631, -0.31993590459589744, -0.14105556167972585, 0.12556883186550327, -0.15294720570764858, 0.023585188642351165, 0.018867664328017446, 0.08822237971482402, 0.03161583433070013, -0.31881883735682265, 0.30513115828054854, 0.07942034137064453, 0.24739932787984056, 0.08222782150928483, 0.13207349027679474, 0.03451212808808864, -0.0014826821904905417, -0.018226795941936196, -0.2112589845527745, 0.10733985619973047, 0.27622193863822353, 0.1515283881777173, 0.38937433279567846, -0.4384245333968903, -0.12329983657777861, 0.17431276180367503, 0.047468333983420895, 0.07149437833059993, 0.00483212161796271, -0.21339699309491725, 0.07430074123786418, -0.22626827724484933, -0.15500972250851597, -0.04560699098295084, -0.020842306412372703, 0.030358341272437462, -0.33107259276288525, -0.004703660366228885, 0.011767956264386023, 0.00693744847861429, -0.11315321358334687, -0.0798280319280888, -0.01001170801895636, 0.18629740187989902, 0.1181575751688797, -0.03771018920061006, 0.10236840913313683, -0.13093088325587343, -0.14512155809939872, 0.37676751847309925, -0.04513987774165192, -0.2094243244069663, 0.10311364678286568, -0.14368518704496738, -0.10767894241898493, 0.07468949020322826, 0.2366704669246381, 0.07849335659691994, -0.1703492185793207, 0.0690778662338508, -0.07134931422425089, 0.14173297661882653, 0.05768702791451856, -0.023542162459947308, 0.11191159584214566, 0.16453287759537083, 0.17610035071804844, 0.17023859783161985, -0.011940658797458228, -0.13529840095779272, -0.2894038650362442, -0.18852431854854027, -0.13548415069709774, 0.052426866941257484, -0.07270855704040581, -0.13161902077909973, 0.3866569949313998, 0.1901183318588193, 0.13661180578034232, 0.10604755173833971, 0.28377494605741016, 0.1824469111021177, -0.05974395523878263, 0.10845835902081388, 0.1954930834356303, 0.029925832864979317, 0.1400921144220909, -0.24702712833769275, 0.10935829844136068, 0.07279295984793592]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.