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,802.0556 | Extension of the unit normal vector field from a hypersurface | It is important in many applications to be able to extend the (outer) unit
normal vector field from a hypersurface to its neighborhood in such a way that
the result is a unit gradient field. The aim of the paper is to provide an
elementary proof of the existence and uniqueness of such an extension.
| math.DG | it is important in many applications to be able to extend the outer unit normal vector field from a hypersurface to its neighborhood in such a way that the result is a unit gradient field the aim of the paper is to provide an elementary proof of the existence and uniqueness of such an extension | [['it', 'is', 'important', 'in', 'many', 'applications', 'to', 'be', 'able', 'to', 'extend', 'the', 'outer', 'unit', 'normal', 'vector', 'field', 'from', 'a', 'hypersurface', 'to', 'its', 'neighborhood', 'in', 'such', 'a', 'way', 'that', 'the', 'result', 'is', 'a', 'unit', 'gradient', 'field', 'the', 'aim', 'of', 'the', 'paper', 'is', 'to', 'provide', 'an', 'elementary', 'proof', 'of', 'the', 'existence', 'and', 'uniqueness', 'of', 'such', 'an', 'extension']] | [-0.11499523322351954, 0.030279492227551105, -0.11531835560771551, 0.042019349757835944, -0.11167836446653713, -0.04081916409459981, -0.006288369912230833, 0.34565663608637726, -0.3272897308184342, -0.25014878369190474, 0.14882407409816303, -0.2401484755629843, -0.1750153578997759, 0.20721824995496058, -0.11009489002806896, -0.0012641018436459655, 0.005332018593749539, 0.1164450202269522, -0.008516845763237638, -0.23737812726335092, 0.3273790849880739, 0.03017576052383943, 0.20651172069748017, 0.07538735662502322, 0.08880161726423963, 0.009861525232818994, 0.044215778430754485, 0.019887130030176857, -0.10567344389498678, 0.16752021514217963, 0.2383687543936751, 0.1479405803605914, 0.3045827852223407, -0.4067213376306675, -0.18289224808527665, 0.1465206680904058, 0.14465386522087184, 0.09290559659288689, -0.09136530132117597, -0.2092494153671644, 0.1357652588662776, -0.1302131247452714, -0.2133731678551571, -0.05654882194622504, 0.016579868022183124, 0.006059539783746004, -0.2734706915407018, 0.0007418201897631992, 0.14681718261404472, 0.05325618081472137, -0.09239042442164977, -0.04337848127734932, 0.014379724115133285, 0.1386754498647695, 0.06666728424501013, 0.13954176339744168, 0.10012844205908054, -0.11650786614468829, -0.08213779171082107, 0.37344748669049954, -0.09157827425409447, -0.23107472041791136, 0.21456065272743052, -0.11265764003619552, -0.0971027501266111, 0.10062535919926384, 0.17482947666536677, 0.13734970077533615, -0.15735106019472533, 0.1250393017184582, -0.0957107804546302, 0.13132529411126267, 0.017006652074104005, 0.008559121123769067, 0.1957885318859057, 0.15981388477269898, 0.16845057567645033, 0.14402433201797646, -0.055240267091854055, -0.07037854852493514, -0.3690912596204064, -0.2687019892925905, -0.1675107787109234, 0.06591830285774036, -0.05742381957587151, -0.1913930787958882, 0.4110218045386401, 0.16159659373489293, 0.25820353689857506, 0.023847197233275934, 0.2965484172444452, 0.10258317189291119, 0.08055040089582854, 0.07638176793909886, 0.20479412153363227, 0.21482813187282193, 0.07228375497189435, -0.14010303925130177, 0.023554693230173805, 0.0681135092946616] |
1,802.05561 | The generation of warm dense matter using a magnetic anvil cell | Warm dense matter is present at the heart of gas giants and large
exo-planets. Yet, its most basic properties are unknown and limit our
understanding of planetary formation and evolution. In this state, where
pressure climbs above 1 Mbar, matter is strongly coupled and quantum
degenerate. This combination invalidates most theories capable of predicting
the equation of state, the viscosity or heat conductivity of the material. When
such properties are missing, understanding planetary evolution becomes an
arduous endeavor. Henceforth, research in this field is actively growing, using
high power laser or heavy ion beams to produce samples dense enough to overcome
the 1 Mbar limit. These samples are not actively confined and tend to expand
rapidly, precluding the existence of any thermodynamically stable equilibrium.
However, a mega-ampere-class pulsed-power generator can produce confined matter
in the Mbar range, providing two conditions are being met. First, the sample
needs to be compressed cylindrically, to maximize magnetic pressure (compared
to slab compression). Second, a damper must be used to preclude the formation
of a corona around the sample. This corona robs the main sample from valuable
current and limits the homogeneity of the compression. According to numerical
simulations, the setup proposed here, and called a magnetic anvil cell, can
reach pressure on the order of 1 Mbar using a mega-ampere pulsed power driver.
These samples span several millimeters in length. Unlike diamond anvil cell,
which pressure is limited below 1 Mbar due to materials strength, the magnetic
anvil cell has virtually no pressure limit. Further, the current heats the
sample to several eV, a temperature well beyond diamond anvil cell
capabilities.
| physics.plasm-ph | warm dense matter is present at the heart of gas giants and large exoplanets yet its most basic properties are unknown and limit our understanding of planetary formation and evolution in this state where pressure climbs above 1 mbar matter is strongly coupled and quantum degenerate this combination invalidates most theories capable of predicting the equation of state the viscosity or heat conductivity of the material when such properties are missing understanding planetary evolution becomes an arduous endeavor henceforth research in this field is actively growing using high power laser or heavy ion beams to produce samples dense enough to overcome the 1 mbar limit these samples are not actively confined and tend to expand rapidly precluding the existence of any thermodynamically stable equilibrium however a megaampereclass pulsedpower generator can produce confined matter in the mbar range providing two conditions are being met first the sample needs to be compressed cylindrically to maximize magnetic pressure compared to slab compression second a damper must be used to preclude the formation of a corona around the sample this corona robs the main sample from valuable current and limits the homogeneity of the compression according to numerical simulations the setup proposed here and called a magnetic anvil cell can reach pressure on the order of 1 mbar using a megaampere pulsed power driver these samples span several millimeters in length unlike diamond anvil cell which pressure is limited below 1 mbar due to materials strength the magnetic anvil cell has virtually no pressure limit further the current heats the sample to several ev a temperature well beyond diamond anvil cell capabilities | [['warm', 'dense', 'matter', 'is', 'present', 'at', 'the', 'heart', 'of', 'gas', 'giants', 'and', 'large', 'exoplanets', 'yet', 'its', 'most', 'basic', 'properties', 'are', 'unknown', 'and', 'limit', 'our', 'understanding', 'of', 'planetary', 'formation', 'and', 'evolution', 'in', 'this', 'state', 'where', 'pressure', 'climbs', 'above', '1', 'mbar', 'matter', 'is', 'strongly', 'coupled', 'and', 'quantum', 'degenerate', 'this', 'combination', 'invalidates', 'most', 'theories', 'capable', 'of', 'predicting', 'the', 'equation', 'of', 'state', 'the', 'viscosity', 'or', 'heat', 'conductivity', 'of', 'the', 'material', 'when', 'such', 'properties', 'are', 'missing', 'understanding', 'planetary', 'evolution', 'becomes', 'an', 'arduous', 'endeavor', 'henceforth', 'research', 'in', 'this', 'field', 'is', 'actively', 'growing', 'using', 'high', 'power', 'laser', 'or', 'heavy', 'ion', 'beams', 'to', 'produce', 'samples', 'dense', 'enough', 'to', 'overcome', 'the', '1', 'mbar', 'limit', 'these', 'samples', 'are', 'not', 'actively', 'confined', 'and', 'tend', 'to', 'expand', 'rapidly', 'precluding', 'the', 'existence', 'of', 'any', 'thermodynamically', 'stable', 'equilibrium', 'however', 'a', 'megaampereclass', 'pulsedpower', 'generator', 'can', 'produce', 'confined', 'matter', 'in', 'the', 'mbar', 'range', 'providing', 'two', 'conditions', 'are', 'being', 'met', 'first', 'the', 'sample', 'needs', 'to', 'be', 'compressed', 'cylindrically', 'to', 'maximize', 'magnetic', 'pressure', 'compared', 'to', 'slab', 'compression', 'second', 'a', 'damper', 'must', 'be', 'used', 'to', 'preclude', 'the', 'formation', 'of', 'a', 'corona', 'around', 'the', 'sample', 'this', 'corona', 'robs', 'the', 'main', 'sample', 'from', 'valuable', 'current', 'and', 'limits', 'the', 'homogeneity', 'of', 'the', 'compression', 'according', 'to', 'numerical', 'simulations', 'the', 'setup', 'proposed', 'here', 'and', 'called', 'a', 'magnetic', 'anvil', 'cell', 'can', 'reach', 'pressure', 'on', 'the', 'order', 'of', '1', 'mbar', 'using', 'a', 'megaampere', 'pulsed', 'power', 'driver', 'these', 'samples', 'span', 'several', 'millimeters', 'in', 'length', 'unlike', 'diamond', 'anvil', 'cell', 'which', 'pressure', 'is', 'limited', 'below', '1', 'mbar', 'due', 'to', 'materials', 'strength', 'the', 'magnetic', 'anvil', 'cell', 'has', 'virtually', 'no', 'pressure', 'limit', 'further', 'the', 'current', 'heats', 'the', 'sample', 'to', 'several', 'ev', 'a', 'temperature', 'well', 'beyond', 'diamond', 'anvil', 'cell', 'capabilities']] | [-0.0697580128511386, 0.21334345666531426, -0.020198887561130502, 0.0010463216591431073, -0.061350079643111045, -0.09895412420351686, 0.05840448874976723, 0.37815715353454166, -0.26627552939477733, -0.3171800994436337, 0.11297368861330248, -0.2683995952462378, -0.027650161083850464, 0.181881476598286, -0.04280992476827699, 0.04941989806082191, 0.012634867722036017, 0.004486418175702908, -0.018808129097052505, -0.2211141032376065, 0.2506490488077099, 0.09363071157985929, 0.2696734598169822, 0.03870638859308279, 0.07055746842078055, -0.10716877103005344, 0.05663342990329112, 0.022840218608674624, -0.14581603977187407, 0.05374082791434134, 0.25129228604308673, 0.06284062390142445, 0.2760757501568464, -0.4572667289757011, -0.26754250528800133, 0.08430916973483864, 0.13948847139637904, 0.08487335862727026, -0.09036838101817832, -0.19077720540777993, 0.11717241498936413, -0.14901384692429825, -0.1542866143401475, -0.07430096721618475, -0.027074096865659016, 0.014191228053567422, -0.26253095220108186, 0.08251348615463558, 0.046533304595820994, 0.05763823940368083, -0.10417505696438574, -0.11091947632454587, -0.018210636587004256, 0.07631866452696189, 0.013825947591251858, 0.05780609535767997, 0.24104733102386364, -0.15056584921991628, -0.027035791760664573, 0.410773683151, -0.01729141784812697, -0.1035042783866326, 0.25607012882514785, -0.21317474529485494, -0.07360000780361534, 0.19137074068962154, 0.1549582369780353, 0.10878286875735564, -0.15849737102308176, 0.035218496621832296, 0.0009779994790651573, 0.20571995218930436, 0.11205809248248569, 0.0019175526036354208, 0.27071967059990554, 0.20705907554749386, 0.04870750173954258, 0.12116500562453017, -0.11210466727129557, -0.046099799872665534, -0.25249624309524166, -0.1518832343815362, -0.16464319004073794, 0.059906421961008406, -0.07120182674884148, -0.1582339388568631, 0.3348929523927472, 0.168609389907084, 0.15718153285469566, -0.030716839596569845, 0.32211307902891917, 0.06932239425638935, 0.06821604989196979, 0.08775521154918321, 0.2681048662189834, 0.19226570161297563, 0.12507684334366118, -0.2190992555569915, 0.06127544564555996, -0.011762769591963191] |
1,802.05562 | On the initial conditions of scalar and tensor fluctuations in
$f(R,\phi)$ gravity | We have considered the perturbation equations governing the growth of
fluctuations in generalized scalar tensor theory during inflation. we have
found that the scalar metric perturbations at very early times are negligible
compared with the scalar field perturbation, just like general relativity. At
sufficiently early times, when $q/a\gg H$, we have obtained the metric and
scalar field perturbation in the form of WKB solutions up to an undetermined
coefficient. Then we have quantized the scalar fluctuations and expanded the
metric and the scalar field perturbations with the help of annihilation and
creation operators of the scalar field perturbation. The standard commutation
relations of annihilation and creation operators fix the unknown coefficient.
Going over to the gauge invariant quantities which are conserved beyond the
horizon, we have obtained the initial condition of the generalized
Mukhanov-Sasaki equation. And a similar procedure is performed for the case of
tensor metric perturbation.
| gr-qc | we have considered the perturbation equations governing the growth of fluctuations in generalized scalar tensor theory during inflation we have found that the scalar metric perturbations at very early times are negligible compared with the scalar field perturbation just like general relativity at sufficiently early times when qagg h we have obtained the metric and scalar field perturbation in the form of wkb solutions up to an undetermined coefficient then we have quantized the scalar fluctuations and expanded the metric and the scalar field perturbations with the help of annihilation and creation operators of the scalar field perturbation the standard commutation relations of annihilation and creation operators fix the unknown coefficient going over to the gauge invariant quantities which are conserved beyond the horizon we have obtained the initial condition of the generalized mukhanovsasaki equation and a similar procedure is performed for the case of tensor metric perturbation | [['we', 'have', 'considered', 'the', 'perturbation', 'equations', 'governing', 'the', 'growth', 'of', 'fluctuations', 'in', 'generalized', 'scalar', 'tensor', 'theory', 'during', 'inflation', 'we', 'have', 'found', 'that', 'the', 'scalar', 'metric', 'perturbations', 'at', 'very', 'early', 'times', 'are', 'negligible', 'compared', 'with', 'the', 'scalar', 'field', 'perturbation', 'just', 'like', 'general', 'relativity', 'at', 'sufficiently', 'early', 'times', 'when', 'qagg', 'h', 'we', 'have', 'obtained', 'the', 'metric', 'and', 'scalar', 'field', 'perturbation', 'in', 'the', 'form', 'of', 'wkb', 'solutions', 'up', 'to', 'an', 'undetermined', 'coefficient', 'then', 'we', 'have', 'quantized', 'the', 'scalar', 'fluctuations', 'and', 'expanded', 'the', 'metric', 'and', 'the', 'scalar', 'field', 'perturbations', 'with', 'the', 'help', 'of', 'annihilation', 'and', 'creation', 'operators', 'of', 'the', 'scalar', 'field', 'perturbation', 'the', 'standard', 'commutation', 'relations', 'of', 'annihilation', 'and', 'creation', 'operators', 'fix', 'the', 'unknown', 'coefficient', 'going', 'over', 'to', 'the', 'gauge', 'invariant', 'quantities', 'which', 'are', 'conserved', 'beyond', 'the', 'horizon', 'we', 'have', 'obtained', 'the', 'initial', 'condition', 'of', 'the', 'generalized', 'mukhanovsasaki', 'equation', 'and', 'a', 'similar', 'procedure', 'is', 'performed', 'for', 'the', 'case', 'of', 'tensor', 'metric', 'perturbation']] | [-0.16053716972039467, 0.17742133962054227, -0.10831034791079305, 0.09924680619028581, -0.06501446429602041, -0.12145164220508341, -0.07564993357669157, 0.27983106830518467, -0.22076098349730985, -0.26434971741875823, 0.09774994644412428, -0.2940840834916449, -0.13656019221288057, 0.11344883435716231, 0.043672568424522475, 0.06059882697034754, 0.02380083301294671, 0.13273499558876162, -0.08368225206563971, -0.26890068715374893, 0.397070160777099, 0.06196952433021245, 0.22320579708281424, 0.003898621840896655, 0.09491346364676141, -0.012464381735391763, -0.041002792730724734, 0.032587267429929, -0.139374763126175, 0.05740821458158546, 0.16931211484693542, 0.08407371454447711, 0.21466597481345645, -0.4384933264203826, -0.21048835795182658, 0.12193443311923215, 0.13558822649778152, 0.13340079795084514, -0.026639739228855996, -0.300568422687487, 0.09135859750756094, -0.17706039786136069, -0.14547509632665714, -0.10766031422025087, 0.02442005479733656, -0.052652940649434696, -0.2960818476347747, 0.11940888614951298, -0.001258402600326911, -0.000748083692322783, -0.10681664278147882, -0.08011430819189416, -0.022715308272666265, 0.062020956094536714, 0.13680099846666907, 0.040451659985697594, 0.15670544061759095, -0.1538202768622511, -0.05300142258947373, 0.367958075423934, -0.17861225200677608, -0.23790779770637044, 0.09209735079535417, -0.16637651268772932, -0.10738449067282839, 0.08571416482037934, 0.15582076817763602, 0.15956426481399558, -0.12751766955561153, 0.1799606018118421, 0.04909994856764873, 0.09027939001541763, 0.13129138034850765, 0.03293735556008269, 0.1916433170019668, 0.029102456643480528, 0.0310038999301147, 0.09072726067206284, 0.0023234735186002694, -0.14314353502779997, -0.37992070244663223, -0.12251169952329527, -0.13493555307793778, 0.07768433042453463, -0.16486029808673228, -0.1910877449542512, 0.39946009959791134, 0.130481487830632, 0.15216933585327994, 0.055532399134957514, 0.22447446923778983, 0.18821740102301648, 0.10072123056727456, 0.07937866049836712, 0.31041090951941047, 0.2078826814687171, 0.14069757405525948, -0.20499295104440732, -0.04012585254259357, 0.07693359092334096] |
1,802.05563 | Semi-Supervised Learning on Graphs Based on Local Label Distributions | Most approaches that tackle the problem of node classification consider nodes
to be similar, if they have shared neighbors or are close to each other in the
graph. Recent methods for attributed graphs additionally take attributes of
neighboring nodes into account. We argue that the class labels of the neighbors
bear important information and considering them helps to improve classification
quality. Two nodes which are similar based on class labels in their
neighborhood do not need to be close-by in the graph and may even belong to
different connected components. In this work, we propose a novel approach for
the semi-supervised node classification. Precisely, we propose a new node
embedding which is based on the class labels in the local neighborhood of a
node. We show that this is a different setting from attribute-based embeddings
and thus, we propose a new method to learn label-based node embeddings which
can mirror a variety of relations between the class labels of neighboring
nodes. Our experimental evaluation demonstrates that our new methods can
significantly improve the prediction quality on real world data sets.
| cs.LG | most approaches that tackle the problem of node classification consider nodes to be similar if they have shared neighbors or are close to each other in the graph recent methods for attributed graphs additionally take attributes of neighboring nodes into account we argue that the class labels of the neighbors bear important information and considering them helps to improve classification quality two nodes which are similar based on class labels in their neighborhood do not need to be closeby in the graph and may even belong to different connected components in this work we propose a novel approach for the semisupervised node classification precisely we propose a new node embedding which is based on the class labels in the local neighborhood of a node we show that this is a different setting from attributebased embeddings and thus we propose a new method to learn labelbased node embeddings which can mirror a variety of relations between the class labels of neighboring nodes our experimental evaluation demonstrates that our new methods can significantly improve the prediction quality on real world data sets | [['most', 'approaches', 'that', 'tackle', 'the', 'problem', 'of', 'node', 'classification', 'consider', 'nodes', 'to', 'be', 'similar', 'if', 'they', 'have', 'shared', 'neighbors', 'or', 'are', 'close', 'to', 'each', 'other', 'in', 'the', 'graph', 'recent', 'methods', 'for', 'attributed', 'graphs', 'additionally', 'take', 'attributes', 'of', 'neighboring', 'nodes', 'into', 'account', 'we', 'argue', 'that', 'the', 'class', 'labels', 'of', 'the', 'neighbors', 'bear', 'important', 'information', 'and', 'considering', 'them', 'helps', 'to', 'improve', 'classification', 'quality', 'two', 'nodes', 'which', 'are', 'similar', 'based', 'on', 'class', 'labels', 'in', 'their', 'neighborhood', 'do', 'not', 'need', 'to', 'be', 'closeby', 'in', 'the', 'graph', 'and', 'may', 'even', 'belong', 'to', 'different', 'connected', 'components', 'in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'approach', 'for', 'the', 'semisupervised', 'node', 'classification', 'precisely', 'we', 'propose', 'a', 'new', 'node', 'embedding', 'which', 'is', 'based', 'on', 'the', 'class', 'labels', 'in', 'the', 'local', 'neighborhood', 'of', 'a', 'node', 'we', 'show', 'that', 'this', 'is', 'a', 'different', 'setting', 'from', 'attributebased', 'embeddings', 'and', 'thus', 'we', 'propose', 'a', 'new', 'method', 'to', 'learn', 'labelbased', 'node', 'embeddings', 'which', 'can', 'mirror', 'a', 'variety', 'of', 'relations', 'between', 'the', 'class', 'labels', 'of', 'neighboring', 'nodes', 'our', 'experimental', 'evaluation', 'demonstrates', 'that', 'our', 'new', 'methods', 'can', 'significantly', 'improve', 'the', 'prediction', 'quality', 'on', 'real', 'world', 'data', 'sets']] | [-0.08872445667835159, 0.019285965364219414, -0.04732218418244479, 0.05383125763489968, -0.14959899578243493, -0.1801600951908363, 0.11057408788086226, 0.43244308665808706, -0.2904791421056466, -0.33500506267106783, 0.040770691914561515, -0.29961034136487996, -0.17452839617229376, 0.1383167620431373, -0.13717448852128453, -0.008537395491859771, 0.13802458719453878, 0.10760464766062797, -0.045782319597977524, -0.2831174971306205, 0.37227366510778664, -0.0268489063769165, 0.31419169921427964, 0.03305063965704499, 0.07827135240465093, -0.01602530356677663, -0.018231848688770293, 0.06470564280041596, -0.06827570295637189, 0.17849111113011734, 0.29169704688505993, 0.15877130964201772, 0.30073585209126275, -0.41113005505952366, -0.2342847272184574, 0.1706927376333624, 0.14490420867481993, 0.129469927466966, -0.007640430406900123, -0.3152393831147088, 0.14546060809581024, -0.15567041560102046, -0.011337891368505855, -0.11061455367534008, -0.031401819834071726, 0.021848722045413323, -0.25886404572003, 0.007984882288534815, 0.06627352480750738, -0.003658268422198792, -0.0473620239037296, -0.09434473496706536, 0.009660420675451557, 0.19469205466642356, -0.0012042067705705349, 0.033341168283045085, 0.08747854571297972, -0.11282217649794701, -0.15825746461438636, 0.3679785117377631, 0.012210166142580824, -0.22229704153594665, 0.2333393405236873, -0.07552809363438023, -0.20564008354364585, 0.0618399147526361, 0.24514459976926445, 0.12211566859752768, -0.15284822543617338, 0.007785826760098442, -0.062239316374891336, 0.1468803797201771, 0.024026499348433896, 0.026438485060094132, 0.19555961346098533, 0.17147090476937593, 0.084923831254087, 0.13044279054382868, -0.10120296309356086, -0.04009140471591511, -0.23018856536493534, -0.1350193550577387, -0.21154158843112075, -0.014774566843455735, -0.12912784377606132, -0.14867166907165988, 0.4363676261467238, 0.208813318215026, 0.27691309694976857, 0.06949810877946826, 0.28703164749054444, 0.04116513618112852, 0.11032458659804736, 0.1358096988302552, 0.18830832651712828, 0.015046506773473488, 0.04218975890479568, -0.13592716856833753, 0.11523378612796983, 0.08752253882379996] |
1,802.05564 | Quantal Diffusion Description of Multi-Nucleon Transfers in Heavy-Ion
Collisions | Employing the stochastic mean-field (SMF) approach, we develop a quantal
diffusion description of the multi-nucleon transfer in heavy-ion collisions at
finite impact parameters. The quantal transport coefficients are determined by
the occupied single-particle wave functions of the time-dependent Hartree-Fock
equations. As a result, the primary fragment mass and charge distribution
functions are determined entirely in terms of the mean-field properties. This
powerful description does not involve any adjustable parameter, includes the
effects of shell structure and is consistent with the fluctuation-dissipation
theorem of the non-equilibrium statistical mechanics. As a first application of
the approach, we analyze the fragment mass distribution in
$^{48}\mathrm{Ca}+{}^{238}\mathrm{U}$ collisions at the bombarding energy
$E_{\text{c.m.}}=193$ MeV and compare the calculations with the experimental
data.
| nucl-th | employing the stochastic meanfield smf approach we develop a quantal diffusion description of the multinucleon transfer in heavyion collisions at finite impact parameters the quantal transport coefficients are determined by the occupied singleparticle wave functions of the timedependent hartreefock equations as a result the primary fragment mass and charge distribution functions are determined entirely in terms of the meanfield properties this powerful description does not involve any adjustable parameter includes the effects of shell structure and is consistent with the fluctuationdissipation theorem of the nonequilibrium statistical mechanics as a first application of the approach we analyze the fragment mass distribution in 48mathrmca238mathrmu collisions at the bombarding energy e_textcm193 mev and compare the calculations with the experimental data | [['employing', 'the', 'stochastic', 'meanfield', 'smf', 'approach', 'we', 'develop', 'a', 'quantal', 'diffusion', 'description', 'of', 'the', 'multinucleon', 'transfer', 'in', 'heavyion', 'collisions', 'at', 'finite', 'impact', 'parameters', 'the', 'quantal', 'transport', 'coefficients', 'are', 'determined', 'by', 'the', 'occupied', 'singleparticle', 'wave', 'functions', 'of', 'the', 'timedependent', 'hartreefock', 'equations', 'as', 'a', 'result', 'the', 'primary', 'fragment', 'mass', 'and', 'charge', 'distribution', 'functions', 'are', 'determined', 'entirely', 'in', 'terms', 'of', 'the', 'meanfield', 'properties', 'this', 'powerful', 'description', 'does', 'not', 'involve', 'any', 'adjustable', 'parameter', 'includes', 'the', 'effects', 'of', 'shell', 'structure', 'and', 'is', 'consistent', 'with', 'the', 'fluctuationdissipation', 'theorem', 'of', 'the', 'nonequilibrium', 'statistical', 'mechanics', 'as', 'a', 'first', 'application', 'of', 'the', 'approach', 'we', 'analyze', 'the', 'fragment', 'mass', 'distribution', 'in', '48mathrmca238mathrmu', 'collisions', 'at', 'the', 'bombarding', 'energy', 'e_textcm193', 'mev', 'and', 'compare', 'the', 'calculations', 'with', 'the', 'experimental', 'data']] | [-0.08143562630183347, 0.1471960187687174, -0.14145933373061859, 0.12803205650745203, 0.009088279838096755, -0.06452587936478464, 0.010604497020983178, 0.3066932716285405, -0.24980755946396485, -0.28585417364602506, -0.05085958594193115, -0.2914523701466944, -0.055917599270849126, 0.12876243425897607, 0.03977084593118533, 0.07073562395475481, 0.07436271213278499, 0.004617757232778746, -0.09992620266528557, -0.1241083085273757, 0.3357188506294852, 0.10067801564607931, 0.2479895048491333, 0.1018943023705936, 0.09533905188613774, 0.0742646555841455, -0.013656821867208117, 0.014166935112165368, -0.16511533761437497, 0.07509261599347077, 0.23883239661707825, 0.0567082951169299, 0.2508990877955828, -0.4353976166928592, -0.2229686737789408, 0.043275574031893325, 0.11482314663589932, 0.14717115482882312, -0.03365240767800613, -0.22992513813078402, 0.02255010523063981, -0.24157672782792994, -0.18164013101435875, -0.08486433546666218, -0.024535126287652097, 0.09783104505065991, -0.2627506373637437, 0.15512548651870178, 0.03657853558821523, 0.058551462295746086, -0.11763715839985273, -0.15205978118288127, -0.05328404811089454, 0.07711596805197389, 0.021158390990255967, 0.0019231784704100826, 0.1922484196803492, -0.11667930930043044, -0.09166081755867471, 0.3928581457666081, -0.0385063492409561, -0.20708997485420222, 0.14230679148889105, -0.1693847227882108, -0.11515263732036819, 0.15504434009932955, 0.147315098669218, 0.1334581154520097, -0.20827024643481507, 0.1060535236469308, -0.021997098578013602, 0.15378073617492033, 0.029819929615958876, 0.03969833228899085, 0.16305735199914678, 0.1773271986991977, -0.0327707597459464, 0.0823794627683642, -0.07451241204677068, -0.1843983840075848, -0.35553851850816737, -0.07187964312084343, -0.19644755799039873, 0.04828432102576303, -0.05944082751913178, -0.1578453762942682, 0.3852340707130244, 0.1161889526669098, 0.1890900599324833, 0.04487174730747938, 0.30168749573033143, 0.18361249897102622, 0.040369246005202114, 0.05998165176007087, 0.25102364068810384, 0.19345780012562222, 0.10230326607175495, -0.2871860041687994, 0.07563307401926621, 0.08715915949610265] |
1,802.05565 | Quantum interactions, Predictability and Emergence Of Gravity | In this paper, we will show that gravity can emerge from an effective field
theory, obtained by tracing out the fermionic system from an interacting
quantum field theory, when we impose the condition that the field equations
must be Cauchy predictable. The source of the gravitational field can be
identified with the quantum interactions that existed in the interacting QFT.
This relation is very similar to the ER= EPR conjecture and strongly relies on
the fact that emergence of a classical theory will be dependent on the
underlying quantum processes and interactions. We consider two concrete example
for reaching the result - one where initially there was no gravity and other
where gravity was present. The latter case will result in first order
corrections to Einstein's equations and immediately reproduces well-known
results like effective event horizons and gravitational birefringence.
| hep-th gr-qc | in this paper we will show that gravity can emerge from an effective field theory obtained by tracing out the fermionic system from an interacting quantum field theory when we impose the condition that the field equations must be cauchy predictable the source of the gravitational field can be identified with the quantum interactions that existed in the interacting qft this relation is very similar to the er epr conjecture and strongly relies on the fact that emergence of a classical theory will be dependent on the underlying quantum processes and interactions we consider two concrete example for reaching the result one where initially there was no gravity and other where gravity was present the latter case will result in first order corrections to einsteins equations and immediately reproduces wellknown results like effective event horizons and gravitational birefringence | [['in', 'this', 'paper', 'we', 'will', 'show', 'that', 'gravity', 'can', 'emerge', 'from', 'an', 'effective', 'field', 'theory', 'obtained', 'by', 'tracing', 'out', 'the', 'fermionic', 'system', 'from', 'an', 'interacting', 'quantum', 'field', 'theory', 'when', 'we', 'impose', 'the', 'condition', 'that', 'the', 'field', 'equations', 'must', 'be', 'cauchy', 'predictable', 'the', 'source', 'of', 'the', 'gravitational', 'field', 'can', 'be', 'identified', 'with', 'the', 'quantum', 'interactions', 'that', 'existed', 'in', 'the', 'interacting', 'qft', 'this', 'relation', 'is', 'very', 'similar', 'to', 'the', 'er', 'epr', 'conjecture', 'and', 'strongly', 'relies', 'on', 'the', 'fact', 'that', 'emergence', 'of', 'a', 'classical', 'theory', 'will', 'be', 'dependent', 'on', 'the', 'underlying', 'quantum', 'processes', 'and', 'interactions', 'we', 'consider', 'two', 'concrete', 'example', 'for', 'reaching', 'the', 'result', 'one', 'where', 'initially', 'there', 'was', 'no', 'gravity', 'and', 'other', 'where', 'gravity', 'was', 'present', 'the', 'latter', 'case', 'will', 'result', 'in', 'first', 'order', 'corrections', 'to', 'einsteins', 'equations', 'and', 'immediately', 'reproduces', 'wellknown', 'results', 'like', 'effective', 'event', 'horizons', 'and', 'gravitational', 'birefringence']] | [-0.14130977326261718, 0.17997954290995435, -0.13312571657318756, 0.08694796401423578, -0.07116356556155327, -0.14880442670276522, -0.04615854236897945, 0.29778491512642824, -0.2349789666916257, -0.291249701888233, 0.08495967412549678, -0.28851605754554865, -0.19009182228963228, 0.19041610637129674, -0.041415199806130884, -0.013823455968952698, 0.033087347763205835, 0.08127430051504432, -0.052460308182491935, -0.256178943118067, 0.35929125023033953, 0.058296657768010664, 0.22883889635187993, 0.05761577052644629, 0.07740979414244277, 0.025481390913583986, 0.011799339135852304, 0.07531049686224213, -0.10525585266198807, 0.05807858163598871, 0.215289429758095, 0.10778662152385907, 0.21795720110336939, -0.4646809141731996, -0.22713940956569073, 0.07339533988683336, 0.1376808092430018, 0.1756556808087634, -0.06558706845069115, -0.30469548637283617, 0.03682135627773739, -0.1496633746748979, -0.15002555430839784, -0.04503823988193619, 0.0020171958258024592, -0.027372414959878053, -0.23602872250763618, 0.06317367556334501, 0.06744414447820272, 0.002238774300971325, -0.06782293763915179, -0.028174954327329506, 0.0200802262187463, 0.09610852642230305, 0.06981881260888759, 0.05632054656946465, 0.11263712817816522, -0.1391330886112553, -0.11694748494504155, 0.39635480068914214, -0.10304166531389364, -0.17433784938538852, 0.20380068624533876, -0.16930350760315155, -0.14150320106874342, 0.07286322666534586, 0.11360917052092112, 0.12001246887265934, -0.15216406060779633, 0.11957917127301039, -0.02841386251637469, 0.15744052381711116, 0.056061088677792664, 0.02267601095609016, 0.25241007027891127, 0.08616149701697724, 0.04071956534829477, 0.11914054009400349, -0.04135658993534204, -0.13632069688047405, -0.3542350692078944, -0.16090836347944604, -0.16369897381915455, 0.09978173361362322, -0.07987344055721263, -0.14421147661641295, 0.32573679922674986, 0.19226223602342635, 0.10925615508028347, 0.029043053757682766, 0.23969568478186493, 0.15983505251621694, 0.05414813281833262, 0.05697136983002091, 0.3208954326430525, 0.13850111740749274, 0.09351433465169554, -0.20229200127979982, 0.007538703304000091, 0.05894816828473215] |
1,802.05566 | The gradient flow structure of an extended Maxwell viscoelastic model
and a structure-preserving finite element scheme | An extended Maxwell viscoelastic model with a relaxation parameter is studied
from mathematical and numerical points of view. It is shown that the model has
a gradient flow property with respect to a viscoelastic energy. Based on the
gradient flow structure, a structure-preserving time-discrete model is proposed
and existence of a unique solution is proved. Moreover, a structure-preserving
P1/P0 finite element scheme is presented and its stability in the sense of
energy is shown by using its discrete gradient flow structure. As typical
viscoelastic phenomena, two-dimensional numerical examples by the proposed
scheme for a creep deformation and a stress relaxation are shown and the
effects of the relaxation parameter are investigated.
| math.NA | an extended maxwell viscoelastic model with a relaxation parameter is studied from mathematical and numerical points of view it is shown that the model has a gradient flow property with respect to a viscoelastic energy based on the gradient flow structure a structurepreserving timediscrete model is proposed and existence of a unique solution is proved moreover a structurepreserving p1p0 finite element scheme is presented and its stability in the sense of energy is shown by using its discrete gradient flow structure as typical viscoelastic phenomena twodimensional numerical examples by the proposed scheme for a creep deformation and a stress relaxation are shown and the effects of the relaxation parameter are investigated | [['an', 'extended', 'maxwell', 'viscoelastic', 'model', 'with', 'a', 'relaxation', 'parameter', 'is', 'studied', 'from', 'mathematical', 'and', 'numerical', 'points', 'of', 'view', 'it', 'is', 'shown', 'that', 'the', 'model', 'has', 'a', 'gradient', 'flow', 'property', 'with', 'respect', 'to', 'a', 'viscoelastic', 'energy', 'based', 'on', 'the', 'gradient', 'flow', 'structure', 'a', 'structurepreserving', 'timediscrete', 'model', 'is', 'proposed', 'and', 'existence', 'of', 'a', 'unique', 'solution', 'is', 'proved', 'moreover', 'a', 'structurepreserving', 'p1p0', 'finite', 'element', 'scheme', 'is', 'presented', 'and', 'its', 'stability', 'in', 'the', 'sense', 'of', 'energy', 'is', 'shown', 'by', 'using', 'its', 'discrete', 'gradient', 'flow', 'structure', 'as', 'typical', 'viscoelastic', 'phenomena', 'twodimensional', 'numerical', 'examples', 'by', 'the', 'proposed', 'scheme', 'for', 'a', 'creep', 'deformation', 'and', 'a', 'stress', 'relaxation', 'are', 'shown', 'and', 'the', 'effects', 'of', 'the', 'relaxation', 'parameter', 'are', 'investigated']] | [-0.12278470312777974, 0.07173832547171817, -0.1599138830914288, 0.010321834558822416, -0.06836284309424259, -0.11948738013066955, -0.04573632818269166, 0.35718017693206267, -0.32489190113034333, -0.213618874732879, 0.14266310703808543, -0.2205488602882503, -0.19839411230573245, 0.1995082733468866, -0.03849275098895436, 0.12108293439886691, 0.04169380952612505, 0.02223809300879906, -0.06721421506734111, -0.18500954791198712, 0.26173004514101456, 0.0516153734663988, 0.3118936387645836, 0.05012357882449513, 0.17754580593995145, -0.07977990444481105, 0.007914211294773195, 0.12161738845532306, -0.15546697094389667, 0.06500899216353155, 0.19016243224997106, 0.018824832660758548, 0.29175234396799327, -0.37754087647641293, -0.3063794078372486, 0.03934000290695343, 0.08628235274070017, 0.08869754860328662, -0.08859317180562161, -0.24135577222248455, 0.10769773129508034, -0.15757113784081764, -0.13165832895298932, -0.11141615370204588, 0.02600762772852102, 0.048011601256491905, -0.3008730584170317, 0.09525070214425926, 0.08007373293727502, 0.05325383689623695, -0.10661882216001752, -0.06279034289187407, -0.050953730118570024, 0.02178716069708268, 0.07979497885822344, 0.007141107097603717, 0.10164969174510187, -0.09959978605243, -0.07908151301907727, 0.42721705783057856, -0.0489144331213456, -0.2807520036795386, 0.20460616799935633, -0.05647603476940243, -0.040442768478323496, 0.1637332324139975, 0.14330515651208525, 0.15017439839472105, -0.15213325041291714, 0.11583538739553963, -0.057945263402379585, 0.1583462595218071, -1.0269601737056766e-05, -0.0489612760290772, 0.11443904646345086, 0.23557413774668365, 0.10358450335223933, 0.1555309145845607, -0.07177401720315453, -0.14517982310808455, -0.3207637561183121, -0.1480530349376217, -0.19678956275671586, 0.03165377603701173, -0.08738869648394783, -0.15633412548534883, 0.3955153062551462, 0.057894163118960625, 0.17690625222534076, 0.05680058388089811, 0.26772517105564475, 0.13347902828470912, 0.036519800736526914, 0.11024427568951102, 0.265938748681062, 0.2002462648035673, 0.11109389147830305, -0.2704529410022571, 0.06073082407080644, 0.1401870898348657] |
1,802.05567 | Rate-Splitting for Multi-Antenna Non-Orthogonal Unicast and Multicast
Transmission | In a superimposed unicast and multicast transmission system, one layer of
Successive Interference Cancellation (SIC) is required at each receiver to
remove the multicast stream before decoding the unicast stream. In this paper,
we show that a linearly-precoded Rate-Splitting (RS) strategy at the
transmitter can efficiently exploit this existing SIC receiver architecture. By
splitting the unicast message into common and private parts and encoding the
common parts along with the multicast message into a super-common stream
decoded by all users, the SIC is used for the dual purpose of separating the
unicast and multicast streams as well as better managing the multi-user
interference between the unicast streams. The precoders are designed with the
objective of maximizing the Weighted Sum Rate (WSR) of the unicast messages
subject to a Quality of Service (QoS) requirement of the multicast message and
a sum power constraint. Numerical results show that RS outperforms existing
Multi-User Linear-Precoding (MU-LP) and power-domain Non-Orthogonal Multiple
Access (NOMA) in a wide range of user deployments (with a diversity of channel
directions and channel strengths). Moreover, since one layer of SIC is required
to separate the unicast and multicast streams, the performance gain of RS comes
without any increase in the receiver complexity compared with MU-LP. Hence, in
such non-orthogonal unicast and multicast transmissions, RS provides rate and
QoS enhancements at no extra cost for the receivers.
| cs.IT math.IT | in a superimposed unicast and multicast transmission system one layer of successive interference cancellation sic is required at each receiver to remove the multicast stream before decoding the unicast stream in this paper we show that a linearlyprecoded ratesplitting rs strategy at the transmitter can efficiently exploit this existing sic receiver architecture by splitting the unicast message into common and private parts and encoding the common parts along with the multicast message into a supercommon stream decoded by all users the sic is used for the dual purpose of separating the unicast and multicast streams as well as better managing the multiuser interference between the unicast streams the precoders are designed with the objective of maximizing the weighted sum rate wsr of the unicast messages subject to a quality of service qos requirement of the multicast message and a sum power constraint numerical results show that rs outperforms existing multiuser linearprecoding mulp and powerdomain nonorthogonal multiple access noma in a wide range of user deployments with a diversity of channel directions and channel strengths moreover since one layer of sic is required to separate the unicast and multicast streams the performance gain of rs comes without any increase in the receiver complexity compared with mulp hence in such nonorthogonal unicast and multicast transmissions rs provides rate and qos enhancements at no extra cost for the receivers | [['in', 'a', 'superimposed', 'unicast', 'and', 'multicast', 'transmission', 'system', 'one', 'layer', 'of', 'successive', 'interference', 'cancellation', 'sic', 'is', 'required', 'at', 'each', 'receiver', 'to', 'remove', 'the', 'multicast', 'stream', 'before', 'decoding', 'the', 'unicast', 'stream', 'in', 'this', 'paper', 'we', 'show', 'that', 'a', 'linearlyprecoded', 'ratesplitting', 'rs', 'strategy', 'at', 'the', 'transmitter', 'can', 'efficiently', 'exploit', 'this', 'existing', 'sic', 'receiver', 'architecture', 'by', 'splitting', 'the', 'unicast', 'message', 'into', 'common', 'and', 'private', 'parts', 'and', 'encoding', 'the', 'common', 'parts', 'along', 'with', 'the', 'multicast', 'message', 'into', 'a', 'supercommon', 'stream', 'decoded', 'by', 'all', 'users', 'the', 'sic', 'is', 'used', 'for', 'the', 'dual', 'purpose', 'of', 'separating', 'the', 'unicast', 'and', 'multicast', 'streams', 'as', 'well', 'as', 'better', 'managing', 'the', 'multiuser', 'interference', 'between', 'the', 'unicast', 'streams', 'the', 'precoders', 'are', 'designed', 'with', 'the', 'objective', 'of', 'maximizing', 'the', 'weighted', 'sum', 'rate', 'wsr', 'of', 'the', 'unicast', 'messages', 'subject', 'to', 'a', 'quality', 'of', 'service', 'qos', 'requirement', 'of', 'the', 'multicast', 'message', 'and', 'a', 'sum', 'power', 'constraint', 'numerical', 'results', 'show', 'that', 'rs', 'outperforms', 'existing', 'multiuser', 'linearprecoding', 'mulp', 'and', 'powerdomain', 'nonorthogonal', 'multiple', 'access', 'noma', 'in', 'a', 'wide', 'range', 'of', 'user', 'deployments', 'with', 'a', 'diversity', 'of', 'channel', 'directions', 'and', 'channel', 'strengths', 'moreover', 'since', 'one', 'layer', 'of', 'sic', 'is', 'required', 'to', 'separate', 'the', 'unicast', 'and', 'multicast', 'streams', 'the', 'performance', 'gain', 'of', 'rs', 'comes', 'without', 'any', 'increase', 'in', 'the', 'receiver', 'complexity', 'compared', 'with', 'mulp', 'hence', 'in', 'such', 'nonorthogonal', 'unicast', 'and', 'multicast', 'transmissions', 'rs', 'provides', 'rate', 'and', 'qos', 'enhancements', 'at', 'no', 'extra', 'cost', 'for', 'the', 'receivers']] | [-0.31322946003220575, -0.01927161918151205, 0.002909617955825655, -0.014907506779525346, -0.07749601641686575, -0.2998525509172257, 0.14828994880678892, 0.40144786599505644, -0.30756351514615016, -0.2572734312200292, 0.05774174159081578, -0.26533217063056713, -0.1400076368246269, 0.08024594855950018, -0.10903494125503563, 0.052398306968613556, 0.038418829081905796, 0.039743549809603214, -0.031257550775296905, -0.3205566992038326, 0.2838560491763765, 0.10499100632769277, 0.3731877419454434, 0.02665035689830145, 0.07105320205049581, 0.05410024909523938, -0.035050812549053824, -0.09053618242158117, -0.0462211511673269, 0.06391512213124488, 0.38503993003871373, 0.2521556964720445, 0.24237849360807995, -0.4209701077294256, -0.2891185504839559, 0.025101060920599598, 0.2057405346905345, 0.04291656856595292, -0.06070955247449116, -0.24147789753689494, 0.1867235113152474, -0.22423070600264677, 0.07521249239454088, 0.13548869191305588, -0.13515709165166312, 0.04773700497825233, -0.3767372252494765, -0.027889918061933843, -0.02111424477676957, -0.010482086936813767, -0.03541751630654383, -0.1164094819515033, 0.013975889588008748, 0.18652295068975522, 0.06728146388769701, 0.0006915089656544574, 0.052958810662291106, -0.07709411855979151, -0.1538724972424828, 0.4038395720435883, -0.004382498784725776, -0.21191655493220274, 0.13739139399221878, -0.02775583612041406, -0.06648810434201106, 0.19883467973681843, 0.2483133362019393, 0.04556978120146979, -0.1889346619679555, -0.003822026256943798, -0.027220654589512422, 0.18219156866066258, 0.17404934653078913, 0.1723026524046269, 0.1504016515512788, 0.15147428146893402, 0.1737935452060586, 0.15779162373606767, -0.11362835095627359, -0.10465195918906764, -0.21834584504664528, -0.16108272936312074, -0.20013544707498493, -0.0166889181780324, -0.15934571490146432, -0.04564009594570244, 0.37154132749618035, 0.08792194627400805, 0.11086292376725061, 0.13149640323268458, 0.46906578323632614, 0.05294263107919305, 0.1039524381007214, 0.19413084678159767, 0.141764695376613, 0.10540837582384524, 0.1418066742334887, -0.1917503252646347, 0.1008787872436803, -0.013009445846181012] |
1,802.05568 | CompetitiveBike: Competitive Prediction of Bike-Sharing Apps Using
Heterogeneous Crowdsourced Data | In recent years, bike-sharing systems have been deployed in many cities,
which provide an economical lifestyle. With the prevalence of bike-sharing
systems, a lot of companies join the market, leading to increasingly fierce
competition. To be competitive, bike-sharing companies and app developers need
to make strategic decisions for mobile apps development. Therefore, it is
significant to predict and compare the popularity of different bike-sharing
apps. However, existing works mostly focus on predicting the popularity of a
single app, the popularity contest among different apps has not been explored
yet. In this paper, we aim to forecast the popularity contest between Mobike
and Ofo, two most popular bike-sharing apps in China. We develop
CompetitiveBike, a system to predict the popularity contest among bike-sharing
apps. Moreover, we conduct experiments on real-world datasets collected from 11
app stores and Sina Weibo, and the experiments demonstrate the effectiveness of
our approach.
| cs.HC cs.CY | in recent years bikesharing systems have been deployed in many cities which provide an economical lifestyle with the prevalence of bikesharing systems a lot of companies join the market leading to increasingly fierce competition to be competitive bikesharing companies and app developers need to make strategic decisions for mobile apps development therefore it is significant to predict and compare the popularity of different bikesharing apps however existing works mostly focus on predicting the popularity of a single app the popularity contest among different apps has not been explored yet in this paper we aim to forecast the popularity contest between mobike and ofo two most popular bikesharing apps in china we develop competitivebike a system to predict the popularity contest among bikesharing apps moreover we conduct experiments on realworld datasets collected from 11 app stores and sina weibo and the experiments demonstrate the effectiveness of our approach | [['in', 'recent', 'years', 'bikesharing', 'systems', 'have', 'been', 'deployed', 'in', 'many', 'cities', 'which', 'provide', 'an', 'economical', 'lifestyle', 'with', 'the', 'prevalence', 'of', 'bikesharing', 'systems', 'a', 'lot', 'of', 'companies', 'join', 'the', 'market', 'leading', 'to', 'increasingly', 'fierce', 'competition', 'to', 'be', 'competitive', 'bikesharing', 'companies', 'and', 'app', 'developers', 'need', 'to', 'make', 'strategic', 'decisions', 'for', 'mobile', 'apps', 'development', 'therefore', 'it', 'is', 'significant', 'to', 'predict', 'and', 'compare', 'the', 'popularity', 'of', 'different', 'bikesharing', 'apps', 'however', 'existing', 'works', 'mostly', 'focus', 'on', 'predicting', 'the', 'popularity', 'of', 'a', 'single', 'app', 'the', 'popularity', 'contest', 'among', 'different', 'apps', 'has', 'not', 'been', 'explored', 'yet', 'in', 'this', 'paper', 'we', 'aim', 'to', 'forecast', 'the', 'popularity', 'contest', 'between', 'mobike', 'and', 'ofo', 'two', 'most', 'popular', 'bikesharing', 'apps', 'in', 'china', 'we', 'develop', 'competitivebike', 'a', 'system', 'to', 'predict', 'the', 'popularity', 'contest', 'among', 'bikesharing', 'apps', 'moreover', 'we', 'conduct', 'experiments', 'on', 'realworld', 'datasets', 'collected', 'from', '11', 'app', 'stores', 'and', 'sina', 'weibo', 'and', 'the', 'experiments', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approach']] | [-0.0988177203617939, -0.023230197089018575, -0.08059571813018546, 0.09202889850273831, -0.12979199925169654, -0.17654632885736246, 0.057113606119943046, 0.41928391579589613, -0.1734110177119824, -0.35211461317432047, 0.1290628761244453, -0.3918731533603309, -0.16584512129528065, 0.20101092603976187, -0.13685162043619953, 0.04605965956819103, 0.10893767854288118, 0.041459748811887465, 0.04964647916375264, -0.38381199647149405, 0.277536197198708, 0.0481562320500204, 0.38350766898477323, 0.10269616777077317, 0.044147640048073325, -0.02646768130385955, -0.08019341971910214, -0.009306758865458916, -0.08427152452888349, 0.17168485757907573, 0.38320783356026017, 0.21166604961912874, 0.3997252551042985, -0.4388741723083164, -0.146227166381958, 0.11716228979639709, 0.12595168478174568, 0.047998277892375346, -0.08154632935255816, -0.3426975762752229, 0.10818651742110513, -0.3163533532858048, -0.023522244817385934, -0.10112457714212598, 0.08729850191444363, 0.02368176544215913, -0.21826961804627862, -0.03983758868368929, -0.04753482710308561, 0.1128203252853494, 0.02119381976320268, -0.11846412027538562, -0.02709833172601265, 0.23866784946725078, 0.17404704650525923, -0.07725305121060308, 0.1579563411380075, -0.13401474691576593, -0.18472449311170064, 0.372953071105868, 0.006302737619740608, -0.06971085063271122, 0.24683667186006572, -0.04677716320482631, -0.17691434965443428, 0.027903976292055967, 0.311508668401623, 0.05812237629856697, -0.2138032563579307, -0.004090250787494244, -0.06620817586352207, 0.21052722123847023, 0.04059241807458233, -0.02393472282421673, 0.21144291199743748, 0.2841429792548696, 0.0449106623813325, 0.061232316836376664, -0.019692611239518817, -0.12986514611609842, -0.06875554116463531, -0.14755758104051706, -0.14231241332233105, 0.015354554886608352, -0.07472875519376168, -0.13360755601004787, 0.4031640549624109, 0.27606432936600833, 0.10521394083888767, 0.03272152584833922, 0.3051807901324475, -0.029468043064236105, 0.10213458973018147, 0.1246362268376126, 0.17798566522574283, -0.07155520150642077, 0.27887514692233645, -0.13395935318860136, 0.148092385835161, -0.04362186175541417] |
1,802.05569 | Moran-evolution of cooperation: From well-mixed to heterogeneous complex
networks | Configurational arrangement of network architecture and interaction character
of individuals are two most influential factors on the mechanisms underlying
the evolutionary outcome of cooperation, which is explained by the
well-established framework of evolutionary game theory. In the current study,
not only qualitatively but also quantitatively, we measure Moran-evolution of
cooperation to support an analytical agreement based on the consequences of the
replicator equation in a finite population. The validity of the measurement has
been double-checked in the well-mixed network by the Langevin stochastic
differential equation and the Gillespie-algorithmic version of Moran-evolution,
while in a structured network, the measurement of accuracy is verified by the
standard numerical simulation. Considering the Birth-Death and Death-Birth
updating rules through diffusion of individuals, the investigation is carried
out in the wide range of game environments those relate to the various social
dilemmas where we are able to draw a new rigorous mathematical track to tackle
the heterogeneity of complex networks. The set of modified criteria reveals the
exact fact about the emergence and maintenance of cooperation in the structured
population. We find that in general, nature promotes the environment of
coexistent traits.
| q-bio.PE | configurational arrangement of network architecture and interaction character of individuals are two most influential factors on the mechanisms underlying the evolutionary outcome of cooperation which is explained by the wellestablished framework of evolutionary game theory in the current study not only qualitatively but also quantitatively we measure moranevolution of cooperation to support an analytical agreement based on the consequences of the replicator equation in a finite population the validity of the measurement has been doublechecked in the wellmixed network by the langevin stochastic differential equation and the gillespiealgorithmic version of moranevolution while in a structured network the measurement of accuracy is verified by the standard numerical simulation considering the birthdeath and deathbirth updating rules through diffusion of individuals the investigation is carried out in the wide range of game environments those relate to the various social dilemmas where we are able to draw a new rigorous mathematical track to tackle the heterogeneity of complex networks the set of modified criteria reveals the exact fact about the emergence and maintenance of cooperation in the structured population we find that in general nature promotes the environment of coexistent traits | [['configurational', 'arrangement', 'of', 'network', 'architecture', 'and', 'interaction', 'character', 'of', 'individuals', 'are', 'two', 'most', 'influential', 'factors', 'on', 'the', 'mechanisms', 'underlying', 'the', 'evolutionary', 'outcome', 'of', 'cooperation', 'which', 'is', 'explained', 'by', 'the', 'wellestablished', 'framework', 'of', 'evolutionary', 'game', 'theory', 'in', 'the', 'current', 'study', 'not', 'only', 'qualitatively', 'but', 'also', 'quantitatively', 'we', 'measure', 'moranevolution', 'of', 'cooperation', 'to', 'support', 'an', 'analytical', 'agreement', 'based', 'on', 'the', 'consequences', 'of', 'the', 'replicator', 'equation', 'in', 'a', 'finite', 'population', 'the', 'validity', 'of', 'the', 'measurement', 'has', 'been', 'doublechecked', 'in', 'the', 'wellmixed', 'network', 'by', 'the', 'langevin', 'stochastic', 'differential', 'equation', 'and', 'the', 'gillespiealgorithmic', 'version', 'of', 'moranevolution', 'while', 'in', 'a', 'structured', 'network', 'the', 'measurement', 'of', 'accuracy', 'is', 'verified', 'by', 'the', 'standard', 'numerical', 'simulation', 'considering', 'the', 'birthdeath', 'and', 'deathbirth', 'updating', 'rules', 'through', 'diffusion', 'of', 'individuals', 'the', 'investigation', 'is', 'carried', 'out', 'in', 'the', 'wide', 'range', 'of', 'game', 'environments', 'those', 'relate', 'to', 'the', 'various', 'social', 'dilemmas', 'where', 'we', 'are', 'able', 'to', 'draw', 'a', 'new', 'rigorous', 'mathematical', 'track', 'to', 'tackle', 'the', 'heterogeneity', 'of', 'complex', 'networks', 'the', 'set', 'of', 'modified', 'criteria', 'reveals', 'the', 'exact', 'fact', 'about', 'the', 'emergence', 'and', 'maintenance', 'of', 'cooperation', 'in', 'the', 'structured', 'population', 'we', 'find', 'that', 'in', 'general', 'nature', 'promotes', 'the', 'environment', 'of', 'coexistent', 'traits']] | [-0.12063908245849622, 0.05901381239758441, -0.10478609376790542, 0.0973639053882919, -0.06480900261327217, -0.11978961354569415, 0.08756970599627051, 0.362452807088123, -0.2607492371672215, -0.2952464766841117, 0.056975166082428, -0.22288247568614253, -0.19719165405818348, 0.12270130640496321, -0.05857878099984484, -0.0009988351219939323, 0.07375554396335768, 0.028328021901756362, 0.025089722634369475, -0.2523231520419279, 0.35219233614250084, 0.0595706414731596, 0.29573100015439624, 0.03376225176613391, 0.10534387620171033, -0.0061238089174317206, -0.06249987899931402, 0.04328159370607203, -0.12302969508350965, 0.11195191889085242, 0.26193519041757735, 0.1673259471627105, 0.3264101024340492, -0.4422020664123075, -0.23669611513003952, 0.08360711462246101, 0.1396565945229628, 0.12488326967803283, -0.01578865573700782, -0.30001151584129515, 0.07104317196059586, -0.1808089528263348, -0.11311433886691846, -0.05971079227601081, -0.015125696617305848, 0.04369238098603648, -0.2521208918734856, 0.06952611829362214, 0.03077717910424038, 0.08346215697626273, -0.07079362218990881, -0.11292172111812572, -0.02880276156948177, 0.15549287478607454, 0.038903529748773515, -0.04417407138036472, 0.1284543446575602, -0.16012932246174316, -0.13689528211004665, 0.3788910094149859, -0.029227788009187156, -0.19954564918692688, 0.21892024020415024, -0.13503710732889448, -0.12368171077852692, 0.10315723149767501, 0.1707119781707154, 0.09341214567580632, -0.20030257457490663, 0.04051812469979616, -0.048950559294227855, 0.15300272219710032, 0.002426702263917713, -0.005227193216033995, 0.15494362448845975, 0.23331371614393967, 0.039364835970063024, 0.08365213249484331, -0.022105946331513953, -0.22589807691754865, -0.23721376236507802, -0.11970299350980751, -0.15596699722676124, 0.03338585978844954, -0.11876817785242898, -0.14054704336398613, 0.40212606343242235, 0.16943363849419713, 0.15840981370922752, 0.05910528665522999, 0.2520892248651817, 0.08236739965089879, 0.02618139324681703, 0.020140258104240145, 0.22719793825262719, 0.14370149923005024, 0.11242056207838239, -0.26788152088131245, 0.16002166971355636, 0.024361176100747832] |
1,802.0557 | Optimal Transport: Fast Probabilistic Approximation with Exact Solvers | We propose a simple subsampling scheme for fast randomized approximate
computation of optimal transport distances. This scheme operates on a random
subset of the full data and can use any exact algorithm as a black-box
back-end, including state-of-the-art solvers and entropically penalized
versions. It is based on averaging the exact distances between empirical
measures generated from independent samples from the original measures and can
easily be tuned towards higher accuracy or shorter computation times. To this
end, we give non-asymptotic deviation bounds for its accuracy in the case of
discrete optimal transport problems. In particular, we show that in many
important instances, including images (2D-histograms), the approximation error
is independent of the size of the full problem. We present numerical
experiments that demonstrate that a very good approximation in typical
applications can be obtained in a computation time that is several orders of
magnitude smaller than what is required for exact computation of the full
problem.
| stat.CO stat.ME | we propose a simple subsampling scheme for fast randomized approximate computation of optimal transport distances this scheme operates on a random subset of the full data and can use any exact algorithm as a blackbox backend including stateoftheart solvers and entropically penalized versions it is based on averaging the exact distances between empirical measures generated from independent samples from the original measures and can easily be tuned towards higher accuracy or shorter computation times to this end we give nonasymptotic deviation bounds for its accuracy in the case of discrete optimal transport problems in particular we show that in many important instances including images 2dhistograms the approximation error is independent of the size of the full problem we present numerical experiments that demonstrate that a very good approximation in typical applications can be obtained in a computation time that is several orders of magnitude smaller than what is required for exact computation of the full problem | [['we', 'propose', 'a', 'simple', 'subsampling', 'scheme', 'for', 'fast', 'randomized', 'approximate', 'computation', 'of', 'optimal', 'transport', 'distances', 'this', 'scheme', 'operates', 'on', 'a', 'random', 'subset', 'of', 'the', 'full', 'data', 'and', 'can', 'use', 'any', 'exact', 'algorithm', 'as', 'a', 'blackbox', 'backend', 'including', 'stateoftheart', 'solvers', 'and', 'entropically', 'penalized', 'versions', 'it', 'is', 'based', 'on', 'averaging', 'the', 'exact', 'distances', 'between', 'empirical', 'measures', 'generated', 'from', 'independent', 'samples', 'from', 'the', 'original', 'measures', 'and', 'can', 'easily', 'be', 'tuned', 'towards', 'higher', 'accuracy', 'or', 'shorter', 'computation', 'times', 'to', 'this', 'end', 'we', 'give', 'nonasymptotic', 'deviation', 'bounds', 'for', 'its', 'accuracy', 'in', 'the', 'case', 'of', 'discrete', 'optimal', 'transport', 'problems', 'in', 'particular', 'we', 'show', 'that', 'in', 'many', 'important', 'instances', 'including', 'images', '2dhistograms', 'the', 'approximation', 'error', 'is', 'independent', 'of', 'the', 'size', 'of', 'the', 'full', 'problem', 'we', 'present', 'numerical', 'experiments', 'that', 'demonstrate', 'that', 'a', 'very', 'good', 'approximation', 'in', 'typical', 'applications', 'can', 'be', 'obtained', 'in', 'a', 'computation', 'time', 'that', 'is', 'several', 'orders', 'of', 'magnitude', 'smaller', 'than', 'what', 'is', 'required', 'for', 'exact', 'computation', 'of', 'the', 'full', 'problem']] | [-0.09647244038961587, 0.030284006491063102, -0.09310232587759533, 0.10445980121561836, -0.04605576794053758, -0.1300563852933626, 0.08898055138697307, 0.40979122958115993, -0.27033405467387167, -0.31420482731153887, 0.1445834343937496, -0.23231160620287541, -0.1266053016462754, 0.2713195200153296, -0.06180642212534768, 0.0887042646202439, 0.10819622261990462, 0.01546288967252739, -0.13697861537127004, -0.27934221246940716, 0.22528863408933245, 0.05323508635929395, 0.2867082393713175, 0.019779624044895174, 0.12345255146539139, -0.013416263351832786, -0.008227536965522074, 0.05483253280361814, -0.11260608590692432, 0.1439619531389326, 0.2530487456899737, 0.13742127011505692, 0.30431864491754, -0.41679216250176393, -0.1806525798657188, 0.12365019308222878, 0.1648651703272105, 0.15993915167787381, -0.03142473939055156, -0.2413680842446704, 0.1130409414511955, -0.1362392685255937, -0.07271439518419004, -0.09289463568598993, -0.00274043811650406, 0.026635451867215096, -0.3292651167680179, 0.10328086149398118, 0.022010931495817437, 0.01978870629813642, -0.003874762786642438, -0.13329391214666106, 0.06917229454603888, 0.12291781242426124, 0.01981084941916408, 0.018653640012827613, 0.10013607321138072, -0.09133985530089346, -0.14099741353382989, 0.380026918835938, -0.06613471143505341, -0.21335354435347742, 0.17347607533447446, -0.08271388066932558, -0.1137553193366095, 0.13775661058964267, 0.19645948420849538, 0.15791650515410208, -0.11854658973433317, 0.08908297227462754, -0.05988460266361794, 0.1733397220103671, 0.03772378577888312, 0.040593213569973745, 0.10504015891121761, 0.18289045903553824, 0.12794144624626383, 0.15751648679706118, -0.060501635545534234, -0.1004753180636814, -0.28744594830298614, -0.12325276808227383, -0.21636415832495737, 0.03256840916470655, -0.15445609985552203, -0.14727725030839323, 0.3796227053334963, 0.21986777177681366, 0.18901781964326098, 0.1218271586112678, 0.35610340425083714, 0.12644960540421907, 0.04994402093204459, 0.12479815728692037, 0.193086450243549, 0.054676590180925785, 0.03597328132919727, -0.17957707062183367, 0.08875266592348775, 0.08455168978581505] |
1,802.05571 | Planck 2015 constraints on spatially-flat dynamical dark energy models | We determine constraints on spatially-flat tilted dynamical dark energy XCDM
and $\phi$CDM inflation models by analyzing Planck 2015 cosmic microwave
background (CMB) anisotropy data and baryon acoustic oscillation (BAO) distance
measurements. XCDM is a simple and widely used but physically inconsistent
parameterization of dynamical dark energy, while the $\phi$CDM model is a
physically consistent one in which a scalar field $\phi$ with an inverse
power-law potential energy density powers the currently accelerating
cosmological expansion. Both these models have one additional parameter
compared to standard $\Lambda$CDM and both better fit the TT + lowP + lensing +
BAO data than does the standard tilted flat-$\Lambda$CDM model, with $\Delta
\chi^2 = -1.26\ (-1.60)$ for the XCDM ($\phi$CDM) model relative to the
$\Lambda$CDM model. While this is a 1.1$\sigma$ (1.3$\sigma$) improvement over
standard $\Lambda$CDM and so not significant, dynamical dark energy models
cannot be ruled out. In addition, both dynamical dark energy models reduce the
tension between the Planck 2015 CMB anisotropy and the weak lensing $\sigma_8$
constraints.
| astro-ph.CO gr-qc hep-ph hep-th | we determine constraints on spatiallyflat tilted dynamical dark energy xcdm and phicdm inflation models by analyzing planck 2015 cosmic microwave background cmb anisotropy data and baryon acoustic oscillation bao distance measurements xcdm is a simple and widely used but physically inconsistent parameterization of dynamical dark energy while the phicdm model is a physically consistent one in which a scalar field phi with an inverse powerlaw potential energy density powers the currently accelerating cosmological expansion both these models have one additional parameter compared to standard lambdacdm and both better fit the tt lowp lensing bao data than does the standard tilted flatlambdacdm model with delta chi2 126 160 for the xcdm phicdm model relative to the lambdacdm model while this is a 11sigma 13sigma improvement over standard lambdacdm and so not significant dynamical dark energy models cannot be ruled out in addition both dynamical dark energy models reduce the tension between the planck 2015 cmb anisotropy and the weak lensing sigma_8 constraints | [['we', 'determine', 'constraints', 'on', 'spatiallyflat', 'tilted', 'dynamical', 'dark', 'energy', 'xcdm', 'and', 'phicdm', 'inflation', 'models', 'by', 'analyzing', 'planck', '2015', 'cosmic', 'microwave', 'background', 'cmb', 'anisotropy', 'data', 'and', 'baryon', 'acoustic', 'oscillation', 'bao', 'distance', 'measurements', 'xcdm', 'is', 'a', 'simple', 'and', 'widely', 'used', 'but', 'physically', 'inconsistent', 'parameterization', 'of', 'dynamical', 'dark', 'energy', 'while', 'the', 'phicdm', 'model', 'is', 'a', 'physically', 'consistent', 'one', 'in', 'which', 'a', 'scalar', 'field', 'phi', 'with', 'an', 'inverse', 'powerlaw', 'potential', 'energy', 'density', 'powers', 'the', 'currently', 'accelerating', 'cosmological', 'expansion', 'both', 'these', 'models', 'have', 'one', 'additional', 'parameter', 'compared', 'to', 'standard', 'lambdacdm', 'and', 'both', 'better', 'fit', 'the', 'tt', 'lowp', 'lensing', 'bao', 'data', 'than', 'does', 'the', 'standard', 'tilted', 'flatlambdacdm', 'model', 'with', 'delta', 'chi2', '126', '160', 'for', 'the', 'xcdm', 'phicdm', 'model', 'relative', 'to', 'the', 'lambdacdm', 'model', 'while', 'this', 'is', 'a', '11sigma', '13sigma', 'improvement', 'over', 'standard', 'lambdacdm', 'and', 'so', 'not', 'significant', 'dynamical', 'dark', 'energy', 'models', 'can', 'not', 'be', 'ruled', 'out', 'in', 'addition', 'both', 'dynamical', 'dark', 'energy', 'models', 'reduce', 'the', 'tension', 'between', 'the', 'planck', '2015', 'cmb', 'anisotropy', 'and', 'the', 'weak', 'lensing', 'sigma_8', 'constraints']] | [-0.08425971440666205, 0.11093551582841125, -0.0877529570867342, 0.17991030674548475, -0.15277152472710306, -0.18907179024909843, -0.04411622696487164, 0.3076454054587233, -0.22919114649203826, -0.3657509578610368, 0.008775248144822265, -0.3055211794045236, 0.01284713101469808, 0.1960490264924082, 0.060415752358550644, 0.03880837185446311, 0.03167183756437383, -0.028013089763713472, -0.04118611034649758, -0.2745824308051256, 0.2517627440795394, 0.20318815534083565, 0.2740297245413617, -0.042993702931490574, 0.0701590952920486, -0.09094691374425397, -0.06540122093276385, 0.029624009775831423, -0.229776878921706, 0.031464287799921026, 0.14453748699802585, 0.08929053503433587, 0.13951565446562053, -0.3471705637510038, -0.30377665243720936, 0.22931246362040164, 0.13077033214547015, 0.1357796124598, -0.01319071198138121, -0.2917257430072138, 0.0013712595481379533, -0.19683626915017763, -0.08106669332590644, -0.05451669269615071, -0.06345007119392747, -0.05084166963969898, -0.2758100882925691, 0.26286035615168973, -0.03823458569685398, 0.0015657822498016888, -0.10938567616315674, -0.12316334959303524, -0.08149956888519228, -0.07720414148701102, 0.07717828152925466, 0.0905885295683725, 0.13862105017171505, -0.14848870356182028, -0.04847869832129045, 0.41650672053435334, -0.1688572144108705, -0.14430432775730473, 0.11555241220372005, -0.1371262513940441, -0.13058342517893992, 0.048476775879626746, 0.09922415227629244, -0.055289007200181116, -0.17468006011489548, 0.19816294512898305, 0.03929270848841694, 0.25207186506681695, 0.08026211326481936, -0.051510893923724876, 0.34414019669049684, 0.11636456304494246, 0.05524972138421921, -0.015606100536612679, -0.10951839286092392, -0.05264790629519633, -0.3343416589231771, -0.013004417220751444, -0.13355968458244555, 0.04758095426249956, -0.21104836862560875, -0.15236717931650304, 0.3887374826511483, 0.12675896779358112, 0.23544057768505114, 0.07820276503040122, 0.3681314365685354, 0.05057077948507036, 0.04691335273458174, 0.0672309195484828, 0.3556311664826892, 0.12108970788899626, 0.10588986069441164, -0.20014261159568703, -0.04369632186897007, -0.07396687315575733] |
1,802.05572 | Slow quenches in two-dimensional time-reversal symmetric Z2 topological
insulators | We study the topological properties and transport in the
Bernevig-Hughes-Zhang (BHZ) model undergoing a slow quench between different
topological regimes. Due to the closing of the band gap during the quench, the
system ends up in an excited state. For quenches governed by a Hamiltonian that
preserves the symmetries present in the BHZ model (time-reversal, inversion,
and conservation of spin projection), the $\mathbb{Z}_2$ invariant remains
equal to the one evaluated in the initial state. The bulk spin Hall
conductivity does change and its time average approaches that of the ground
state of the final Hamiltonian. The deviations from the ground-state spin Hall
conductivity as a function of the quench time follow the Kibble-Zurek scaling.
We also consider the breaking of the time-reversal symmetry, which restores the
correspondence between the bulk invariant and the transport properties after
the quench.
| cond-mat.mes-hall | we study the topological properties and transport in the bernevighugheszhang bhz model undergoing a slow quench between different topological regimes due to the closing of the band gap during the quench the system ends up in an excited state for quenches governed by a hamiltonian that preserves the symmetries present in the bhz model timereversal inversion and conservation of spin projection the mathbbz_2 invariant remains equal to the one evaluated in the initial state the bulk spin hall conductivity does change and its time average approaches that of the ground state of the final hamiltonian the deviations from the groundstate spin hall conductivity as a function of the quench time follow the kibblezurek scaling we also consider the breaking of the timereversal symmetry which restores the correspondence between the bulk invariant and the transport properties after the quench | [['we', 'study', 'the', 'topological', 'properties', 'and', 'transport', 'in', 'the', 'bernevighugheszhang', 'bhz', 'model', 'undergoing', 'a', 'slow', 'quench', 'between', 'different', 'topological', 'regimes', 'due', 'to', 'the', 'closing', 'of', 'the', 'band', 'gap', 'during', 'the', 'quench', 'the', 'system', 'ends', 'up', 'in', 'an', 'excited', 'state', 'for', 'quenches', 'governed', 'by', 'a', 'hamiltonian', 'that', 'preserves', 'the', 'symmetries', 'present', 'in', 'the', 'bhz', 'model', 'timereversal', 'inversion', 'and', 'conservation', 'of', 'spin', 'projection', 'the', 'mathbbz_2', 'invariant', 'remains', 'equal', 'to', 'the', 'one', 'evaluated', 'in', 'the', 'initial', 'state', 'the', 'bulk', 'spin', 'hall', 'conductivity', 'does', 'change', 'and', 'its', 'time', 'average', 'approaches', 'that', 'of', 'the', 'ground', 'state', 'of', 'the', 'final', 'hamiltonian', 'the', 'deviations', 'from', 'the', 'groundstate', 'spin', 'hall', 'conductivity', 'as', 'a', 'function', 'of', 'the', 'quench', 'time', 'follow', 'the', 'kibblezurek', 'scaling', 'we', 'also', 'consider', 'the', 'breaking', 'of', 'the', 'timereversal', 'symmetry', 'which', 'restores', 'the', 'correspondence', 'between', 'the', 'bulk', 'invariant', 'and', 'the', 'transport', 'properties', 'after', 'the', 'quench']] | [-0.19062686426754016, 0.22184343517775246, -0.09614952656345954, 0.03681691326335936, 0.02858758628692316, -0.14936424880895927, 0.04974671484619055, 0.3114494144430627, -0.30975099820373714, -0.27141606733472884, 0.061442967257934855, -0.26663191632732103, -0.09394427694960673, 0.10310540685389677, 0.03246807123102464, 0.08092960324838581, -0.013676428398036438, -0.01894525912475597, -0.19373794280303022, -0.18318372102204603, 0.32922066177875886, -0.00789907198075367, 0.32588907304402115, 0.040122473534817495, 0.06803877084124563, 0.04302869950576375, 0.10721838512741354, -0.024553680804261156, -0.16406843812338606, 0.001986815482782929, 0.1454717671959256, -0.04490951891394629, 0.14791881437143445, -0.44251365047218144, -0.1866297873303942, 0.04743377354822334, 0.10042647075032869, 0.17319509442271394, -0.02285030122468437, -0.31433535481978586, 0.008667474074383685, -0.18685056150391482, -0.14761568638631076, -0.07286069749692536, 0.027182448317931183, -0.0776492618041221, -0.1895443023818518, 0.153266600216528, 0.10241078790378473, 0.061992001517311386, -0.09885598942249392, -0.026005015177888446, -0.13165276729252082, 0.1495038842060266, 0.08552161312705932, 0.029100950832640672, 0.14803046095809239, -0.18452147404879224, -0.1437538907714728, 0.3867280501737327, -0.06215656816240643, -0.14528743469196817, 0.18079241470136828, -0.1619333504075758, -0.1061665148615999, 0.1314504339589157, 0.0904106904880778, 0.07733886495934449, -0.11291737855999204, 0.10895694425277686, -0.03409696956826509, 0.13095188393945928, -0.029472924006319998, 0.045871373584014836, 0.24250452549777168, 0.15320850775806585, 0.07341918042705704, 0.17513410513545724, -0.09700367807501765, -0.1406384696441608, -0.3141528953379695, -0.16761117463043984, -0.26267931191925553, 0.1123214352224697, -0.04180180198391494, -0.14842853097218103, 0.4973448525466349, 0.1557263562293804, 0.20253531441963074, 0.02993788184898406, 0.22260433406083155, 0.17592744845677627, 0.05279852826134774, 0.09015804555256972, 0.24765848224152529, 0.15344600644691483, 0.10751794019133608, -0.39138258155266603, 0.04309858539836832, 0.0774610993195919] |
1,802.05573 | Asymptotic Behaviour for $\mathcal{H}-$holomorphic Cylinders of Small
Area | $\mathcal{H}-$holomorphic curves are solutions of a specific modification of
the pseudoholomorphic curve equation in symplectizations involving a harmonic
$1-$form as perturbation term. In this paper we study the asymptotics of
$\mathcal{H}-$holomorphic curves defined on a sequence of degenerating
cylinders.
| math.SG math.DG | mathcalhholomorphic curves are solutions of a specific modification of the pseudoholomorphic curve equation in symplectizations involving a harmonic 1form as perturbation term in this paper we study the asymptotics of mathcalhholomorphic curves defined on a sequence of degenerating cylinders | [['mathcalhholomorphic', 'curves', 'are', 'solutions', 'of', 'a', 'specific', 'modification', 'of', 'the', 'pseudoholomorphic', 'curve', 'equation', 'in', 'symplectizations', 'involving', 'a', 'harmonic', '1form', 'as', 'perturbation', 'term', 'in', 'this', 'paper', 'we', 'study', 'the', 'asymptotics', 'of', 'mathcalhholomorphic', 'curves', 'defined', 'on', 'a', 'sequence', 'of', 'degenerating', 'cylinders']] | [-0.26318526186813146, 0.03118589350905938, -0.16293480552923986, 0.08426368598026247, -0.1010974342815387, -0.10174406168218224, -0.0007599144397924343, 0.2940690036003406, -0.25254411632433915, -0.20626270556106016, 0.10892399229133168, -0.3160592031975587, -0.1885415336403709, 0.2345129903883506, -0.13493484624016744, 0.06740616306435698, 0.05207755216039144, 0.02323892804531333, -0.09809457587125973, -0.23025553974394614, 0.4350494537024926, -0.10605560701626998, 0.15543729336693501, 0.01690575485237134, 0.08357940134234153, -0.0020477256546608913, 0.0037968897093565036, -0.033755854345284976, -0.20439042724095857, 0.13449185021603718, 0.21276236038941604, 0.009996368991545377, 0.1704858428058334, -0.3737585455752336, -0.2306444287121569, 0.14432078804104373, 0.1450231582380067, 0.033971523722777, -0.020543108589780062, -0.19349256434883827, 0.01993135545508733, -0.08977494761646272, -0.23466232610054505, -0.07171427238828097, 0.0354303217488147, 0.13162495606005764, -0.1740536387436665, 0.04788239961728836, 0.09154843910931586, 0.1464281877120718, -0.10494583208734791, -0.02222799027386384, -0.02285729933721133, 0.04067270685799229, 0.07988929891815552, 0.08767024107062472, 0.04925503649820502, -0.12814159769540986, -0.060194650067923926, 0.3682028117756813, -0.19758372381329536, -0.2771743007768423, 0.0352448700234676, -0.13096939749681416, -0.13854747309755439, 0.09420065073153147, 0.18657599481491324, 0.2552506561176135, -0.12705996615859944, 0.143913524511915, -0.041818454885520995, 0.09591532727846733, 0.15353890292298716, -0.0644811528424422, 0.15581874195963907, 0.10956578752479683, 0.021888891067833472, 0.1862504757427348, -0.024415008216284406, -0.11424164049243793, -0.40503965127162445, -0.19380762865348983, -0.13204727675288153, 0.13512581152220568, -0.1193873629045601, -0.25672118819485873, 0.4343383598786134, -0.047495494578376964, 0.23825646955997515, 0.09078682464762376, 0.21780685029732874, 0.13209923900938472, -0.009233021583312597, 0.017398691712281644, 0.17092259670010743, 0.17918263874852505, 0.05666174373040215, -0.17821142075057977, -0.053022895844127886, 0.18668278311498654] |
1,802.05574 | Open Information Extraction on Scientific Text: An Evaluation | Open Information Extraction (OIE) is the task of the unsupervised creation of
structured information from text. OIE is often used as a starting point for a
number of downstream tasks including knowledge base construction, relation
extraction, and question answering. While OIE methods are targeted at being
domain independent, they have been evaluated primarily on newspaper,
encyclopedic or general web text. In this article, we evaluate the performance
of OIE on scientific texts originating from 10 different disciplines. To do so,
we use two state-of-the-art OIE systems applying a crowd-sourcing approach. We
find that OIE systems perform significantly worse on scientific text than
encyclopedic text. We also provide an error analysis and suggest areas of work
to reduce errors. Our corpus of sentences and judgments are made available.
| cs.CL | open information extraction oie is the task of the unsupervised creation of structured information from text oie is often used as a starting point for a number of downstream tasks including knowledge base construction relation extraction and question answering while oie methods are targeted at being domain independent they have been evaluated primarily on newspaper encyclopedic or general web text in this article we evaluate the performance of oie on scientific texts originating from 10 different disciplines to do so we use two stateoftheart oie systems applying a crowdsourcing approach we find that oie systems perform significantly worse on scientific text than encyclopedic text we also provide an error analysis and suggest areas of work to reduce errors our corpus of sentences and judgments are made available | [['open', 'information', 'extraction', 'oie', 'is', 'the', 'task', 'of', 'the', 'unsupervised', 'creation', 'of', 'structured', 'information', 'from', 'text', 'oie', 'is', 'often', 'used', 'as', 'a', 'starting', 'point', 'for', 'a', 'number', 'of', 'downstream', 'tasks', 'including', 'knowledge', 'base', 'construction', 'relation', 'extraction', 'and', 'question', 'answering', 'while', 'oie', 'methods', 'are', 'targeted', 'at', 'being', 'domain', 'independent', 'they', 'have', 'been', 'evaluated', 'primarily', 'on', 'newspaper', 'encyclopedic', 'or', 'general', 'web', 'text', 'in', 'this', 'article', 'we', 'evaluate', 'the', 'performance', 'of', 'oie', 'on', 'scientific', 'texts', 'originating', 'from', '10', 'different', 'disciplines', 'to', 'do', 'so', 'we', 'use', 'two', 'stateoftheart', 'oie', 'systems', 'applying', 'a', 'crowdsourcing', 'approach', 'we', 'find', 'that', 'oie', 'systems', 'perform', 'significantly', 'worse', 'on', 'scientific', 'text', 'than', 'encyclopedic', 'text', 'we', 'also', 'provide', 'an', 'error', 'analysis', 'and', 'suggest', 'areas', 'of', 'work', 'to', 'reduce', 'errors', 'our', 'corpus', 'of', 'sentences', 'and', 'judgments', 'are', 'made', 'available']] | [-0.053314193197724034, 0.02023893951240828, -0.03587704833448446, 0.07879767525211476, -0.15859293141292305, -0.12423934639746866, 0.08107202022847917, 0.4225460764050014, -0.24075093408899867, -0.34462635612159265, 0.09516428085685685, -0.37291968913059537, -0.11171962022524709, 0.26847503480123813, -0.09569301701876826, 0.0373917921688261, 0.1339254685472257, 0.07707010161733864, -0.053046865204503156, -0.3025465489880321, 0.3518159698353948, 0.009323527130818977, 0.3708166154981481, 0.07018676997019403, 0.06837013411137649, -0.058838547771273175, -0.1302348866762674, -0.012556870240630128, -0.09432542075681011, 0.16328331569620358, 0.3711092853698674, 0.220759047287382, 0.2994038832417917, -0.36193003548734537, -0.201773875126914, 0.030389683230369405, 0.18835190245670846, 0.14937358225813122, -0.03580086696232984, -0.32503959495486234, 0.08427778752584847, -0.15630961544665062, 0.05830682498424893, -0.11808133143638297, 0.022470845422876164, -0.011525010338555434, -0.21487938945262333, 0.05065133044744592, 0.1117409394474656, 0.16219193827338868, 0.0010200480464845896, -0.18353003609144516, 0.07559504671073629, 0.19400695069256702, 0.06996327782907766, 0.09839972625046557, 0.16854570587128986, -0.14612957872178792, -0.14431473913448534, 0.38285442922762997, -0.03690252755275895, -0.20520886970962596, 0.19208865165233788, -0.03309087332807423, -0.19055066982973515, 0.05637671697268805, 0.22103920185527814, 0.10854345952035992, -0.18225014334045878, 0.015979462279846497, -0.02899584271138402, 0.2579686939691131, 0.09539913789435166, 0.007470214892065109, 0.18240322329710773, 0.2274856711481148, -0.009621260409045406, 0.10732103783204623, -0.05655888709474326, -0.04765911724447735, -0.1871197518973252, -0.12023280685475118, -0.18754046845183833, 0.027715970564992937, -0.04079088577819625, -0.16303661779507878, 0.33623623425566307, 0.2703158576481455, 0.1666256656840913, 0.0372577367907786, 0.28910172325888955, -0.005818819286169734, 0.058839986203458365, 0.07045366910174415, 0.1405507346402531, -0.03225993268983805, 0.17782844023918368, -0.10734445905664891, 0.08611755848561567, 0.01810854012109926] |
1,802.05575 | A main sequence for quasars | The last 25 years saw a major step forward in the analysis of optical and UV
spectroscopic data of large quasar samples. Multivariate statistical approaches
have led to the definition of systematic trends in observational properties
that are the basis of physical and dynamical modeling of quasar structure. We
discuss the empirical correlates of the so-called "main sequence" associated
with the quasar Eigenvector 1, its governing physical parameters and several
implications on our view of the quasar structure, as well as some luminosity
effects associated with the virialized component of the line emitting regions.
We also briefly discuss quasars in a segment of the main sequence that includes
the strongest FeII emitters. These sources show a small dispersion around a
well-defined Eddington ratio value, a property which makes them potential
Eddington standard candles.
| astro-ph.GA | the last 25 years saw a major step forward in the analysis of optical and uv spectroscopic data of large quasar samples multivariate statistical approaches have led to the definition of systematic trends in observational properties that are the basis of physical and dynamical modeling of quasar structure we discuss the empirical correlates of the socalled main sequence associated with the quasar eigenvector 1 its governing physical parameters and several implications on our view of the quasar structure as well as some luminosity effects associated with the virialized component of the line emitting regions we also briefly discuss quasars in a segment of the main sequence that includes the strongest feii emitters these sources show a small dispersion around a welldefined eddington ratio value a property which makes them potential eddington standard candles | [['the', 'last', '25', 'years', 'saw', 'a', 'major', 'step', 'forward', 'in', 'the', 'analysis', 'of', 'optical', 'and', 'uv', 'spectroscopic', 'data', 'of', 'large', 'quasar', 'samples', 'multivariate', 'statistical', 'approaches', 'have', 'led', 'to', 'the', 'definition', 'of', 'systematic', 'trends', 'in', 'observational', 'properties', 'that', 'are', 'the', 'basis', 'of', 'physical', 'and', 'dynamical', 'modeling', 'of', 'quasar', 'structure', 'we', 'discuss', 'the', 'empirical', 'correlates', 'of', 'the', 'socalled', 'main', 'sequence', 'associated', 'with', 'the', 'quasar', 'eigenvector', '1', 'its', 'governing', 'physical', 'parameters', 'and', 'several', 'implications', 'on', 'our', 'view', 'of', 'the', 'quasar', 'structure', 'as', 'well', 'as', 'some', 'luminosity', 'effects', 'associated', 'with', 'the', 'virialized', 'component', 'of', 'the', 'line', 'emitting', 'regions', 'we', 'also', 'briefly', 'discuss', 'quasars', 'in', 'a', 'segment', 'of', 'the', 'main', 'sequence', 'that', 'includes', 'the', 'strongest', 'feii', 'emitters', 'these', 'sources', 'show', 'a', 'small', 'dispersion', 'around', 'a', 'welldefined', 'eddington', 'ratio', 'value', 'a', 'property', 'which', 'makes', 'them', 'potential', 'eddington', 'standard', 'candles']] | [-0.07019602588055782, 0.059249840843092115, -0.0484086139883874, 0.10484596419225174, -0.09309026888480648, -0.07490361553767375, 0.04736512306818556, 0.4357589792208116, -0.20084758557088644, -0.27754936562465937, 0.09256736588002623, -0.3099328523389715, -0.09196524091127951, 0.20736305215360976, -0.02827216428529499, 0.04810195917366913, 0.02790979775285026, -0.05813678891811156, -0.05008299581363405, -0.2060065518721546, 0.34551290372960775, 0.06702454365383749, 0.23999142041648702, -0.006202539835209237, 0.10048480974107672, -0.06649015331115658, -0.11373192629307732, 0.010192575108231907, -0.11422594992456611, 0.09438636690322169, 0.23080314433944404, 0.15243406699536213, 0.3078424715037857, -0.3059700781381444, -0.19995502869097895, 0.0731753663657079, 0.16815151479200258, 0.06756459849560983, -0.048775241476539666, -0.2393104422249292, 0.04538945401966208, -0.15855955448757886, -0.17277968154617943, 0.04859640447097249, 0.04562480184354616, 0.062044968334887936, -0.16104046189964966, 0.09364833947970476, 0.040109206368941885, 0.07889993725470583, -0.08204278432855144, -0.1191195815563538, -0.049231441628496, 0.09284707751209126, 0.0806242239038299, 0.021685352275862282, 0.16806890586342074, -0.14723290927897215, -0.09124216083804831, 0.4030295467368306, -0.05379342452773502, -0.043106211823782416, 0.18938123223658904, -0.16832964591567293, -0.1970615048430636, 0.09444483472174384, 0.17454566434550947, 0.08181655163967744, -0.12982450818898564, 0.027938436143033738, -0.01858820260110262, 0.21597844542921485, -0.008997945741687278, 0.10126291192661886, 0.2756304198077747, 0.13346044294171988, 0.010971494237857317, 0.10387797892807905, -0.17151854296947508, -0.057618888354110984, -0.32591686223430516, -0.1228779418449989, -0.12570112777254158, 0.09700374637163223, -0.17129079823846546, -0.1822713622503872, 0.4087083615866819, 0.17212886971428543, 0.2745331249136786, 0.05945875113208505, 0.2852829697758968, 0.0989000381774066, 0.08510920749557085, 0.032975358634668966, 0.318632036627181, 0.1759126015091525, 0.08479286224714347, -0.20166050462416352, 0.0799757205562568, 0.03305138047798572] |
1,802.05576 | Weil Algebra, 3-Lie Algebra and B.R.S. Algebra | We consider the 3-Lie algebra induced by a Lie algebra with the help of an
analog of a trace. We propose the extension of the Weil algebra of a Lie
algebra to the Weil algebra of induced 3-Lie algebra by introducing in addition
to an analog of connection and its curvature new elements and defining their
differential by means of structure constants of 3-Lie algebra. We also propose
a new approach to the universal B.R.S. algebra based on the quantum triple
Nambu bracket.
| math.RA hep-th | we consider the 3lie algebra induced by a lie algebra with the help of an analog of a trace we propose the extension of the weil algebra of a lie algebra to the weil algebra of induced 3lie algebra by introducing in addition to an analog of connection and its curvature new elements and defining their differential by means of structure constants of 3lie algebra we also propose a new approach to the universal brs algebra based on the quantum triple nambu bracket | [['we', 'consider', 'the', '3lie', 'algebra', 'induced', 'by', 'a', 'lie', 'algebra', 'with', 'the', 'help', 'of', 'an', 'analog', 'of', 'a', 'trace', 'we', 'propose', 'the', 'extension', 'of', 'the', 'weil', 'algebra', 'of', 'a', 'lie', 'algebra', 'to', 'the', 'weil', 'algebra', 'of', 'induced', '3lie', 'algebra', 'by', 'introducing', 'in', 'addition', 'to', 'an', 'analog', 'of', 'connection', 'and', 'its', 'curvature', 'new', 'elements', 'and', 'defining', 'their', 'differential', 'by', 'means', 'of', 'structure', 'constants', 'of', '3lie', 'algebra', 'we', 'also', 'propose', 'a', 'new', 'approach', 'to', 'the', 'universal', 'brs', 'algebra', 'based', 'on', 'the', 'quantum', 'triple', 'nambu', 'bracket']] | [-0.19404279203778302, 0.051174192860826334, -0.08817335366305099, 0.03428614183878863, -0.21288989349661103, -0.08697444639247225, 0.0012701732381415296, 0.3199647481396166, -0.4019922539591789, -0.2429325608087771, 0.100292479718968, -0.17346928214811416, -0.2253623816846724, 0.13401485520067163, -0.1384349865474211, -0.042150103858060554, 0.020981969356716396, 0.1428640624452158, -0.162814897092351, -0.17001882302630916, 0.4918854526547064, 0.07903808620561992, 0.2014778660503721, -0.01748519615236535, 0.18445498239338756, 0.024722903938851803, -0.007710226362638445, -0.03675821717514331, -0.16670317820508976, 0.19107787894556322, 0.22182952826393834, 0.06792555078976305, 0.16624529039520905, -0.40672990467668657, -0.04615498937845948, 0.1283878610099116, 0.15101673082078257, 0.0318996631315943, -0.0736071857951963, -0.3165750425387488, 0.07056910212780068, -0.2826731044529791, -0.10495338723041027, -0.08384898255567953, 0.039511235150317826, -0.08920479418866965, -0.21479086186077603, 0.023048214992741123, 0.08035331126302481, 0.1531503758987928, -0.08623445736025516, -0.09075234491793237, -0.06953760811004293, 0.017592446973928845, -0.12081041621992432, 0.005813166807708611, 0.12255984918966172, -0.08321801245953124, -0.23847083547657513, 0.35704815084765473, -0.04936859772417201, -0.23910972155091992, 0.06986607600239117, -0.1434045160380024, -0.16966004601219692, 0.04022367970726217, 0.08215024521720247, 0.08230893134352672, -0.10245094572948517, 0.22112648711814714, -0.08257534330239497, 0.004878731500581804, 0.05058891145534903, 0.006333819253886321, 0.14516919810908385, 0.13461639295635094, 0.015916443833834434, 0.14273291840835148, 0.05477427914935018, -0.058126580486276065, -0.3873417535460139, -0.24095797061875282, -0.0771191990541586, 0.12516386088836623, -0.11713637010838152, -0.15306804901695845, 0.4322854065930987, 0.13876285602574248, 0.20747922467494226, 0.0458710947444281, 0.19317715724997492, 0.16287146115967308, 0.19097572988381675, 0.039925592177244555, 0.16150937328137546, 0.3353590437306473, 0.030277893452130885, -0.1893415400107582, -0.08950898194887552, 0.22252732492893576] |
1,802.05577 | DR-BiLSTM: Dependent Reading Bidirectional LSTM for Natural Language
Inference | We present a novel deep learning architecture to address the natural language
inference (NLI) task. Existing approaches mostly rely on simple reading
mechanisms for independent encoding of the premise and hypothesis. Instead, we
propose a novel dependent reading bidirectional LSTM network (DR-BiLSTM) to
efficiently model the relationship between a premise and a hypothesis during
encoding and inference. We also introduce a sophisticated ensemble strategy to
combine our proposed models, which noticeably improves final predictions.
Finally, we demonstrate how the results can be improved further with an
additional preprocessing step. Our evaluation shows that DR-BiLSTM obtains the
best single model and ensemble model results achieving the new state-of-the-art
scores on the Stanford NLI dataset.
| cs.CL | we present a novel deep learning architecture to address the natural language inference nli task existing approaches mostly rely on simple reading mechanisms for independent encoding of the premise and hypothesis instead we propose a novel dependent reading bidirectional lstm network drbilstm to efficiently model the relationship between a premise and a hypothesis during encoding and inference we also introduce a sophisticated ensemble strategy to combine our proposed models which noticeably improves final predictions finally we demonstrate how the results can be improved further with an additional preprocessing step our evaluation shows that drbilstm obtains the best single model and ensemble model results achieving the new stateoftheart scores on the stanford nli dataset | [['we', 'present', 'a', 'novel', 'deep', 'learning', 'architecture', 'to', 'address', 'the', 'natural', 'language', 'inference', 'nli', 'task', 'existing', 'approaches', 'mostly', 'rely', 'on', 'simple', 'reading', 'mechanisms', 'for', 'independent', 'encoding', 'of', 'the', 'premise', 'and', 'hypothesis', 'instead', 'we', 'propose', 'a', 'novel', 'dependent', 'reading', 'bidirectional', 'lstm', 'network', 'drbilstm', 'to', 'efficiently', 'model', 'the', 'relationship', 'between', 'a', 'premise', 'and', 'a', 'hypothesis', 'during', 'encoding', 'and', 'inference', 'we', 'also', 'introduce', 'a', 'sophisticated', 'ensemble', 'strategy', 'to', 'combine', 'our', 'proposed', 'models', 'which', 'noticeably', 'improves', 'final', 'predictions', 'finally', 'we', 'demonstrate', 'how', 'the', 'results', 'can', 'be', 'improved', 'further', 'with', 'an', 'additional', 'preprocessing', 'step', 'our', 'evaluation', 'shows', 'that', 'drbilstm', 'obtains', 'the', 'best', 'single', 'model', 'and', 'ensemble', 'model', 'results', 'achieving', 'the', 'new', 'stateoftheart', 'scores', 'on', 'the', 'stanford', 'nli', 'dataset']] | [-0.035713172198885736, -0.01140010069207779, -0.10526020897065734, 0.07362355829661225, -0.12217750818980438, -0.20283841010736856, 0.1151748769685861, 0.4430426195398107, -0.2583000177715754, -0.3595519179461507, 0.016842595112786907, -0.22458108405473534, -0.21100844997652546, 0.20620166614592947, -0.10825201685473256, 0.05763393371399526, 0.16940775764938276, 0.02335192425059037, -0.06937274718363476, -0.2934672796956121, 0.2895483329896354, 0.10404594121516582, 0.40381389659166605, 0.02560736473045639, 0.15306380472506756, -0.012335852900234697, -0.048696560139121776, -0.04655640704771252, -0.062200974334078014, 0.19380230452605263, 0.22364368223573258, 0.23453513133335127, 0.31274663863351215, -0.41652174538204884, -0.2324047975644872, 0.04939502795218482, 0.14260336104570678, 0.16253707613397456, -0.023573954184833275, -0.3005558134031457, 0.06569944719389618, -0.16675478192297993, 0.047410432440186806, -0.162815776844467, -0.05988921866928403, -0.06001949076633061, -0.32222651329357177, 0.050289663722946285, 0.13710146479577096, 0.03300551571757407, -0.0455318728130445, -0.1391676962690277, 0.08813864101345341, 0.1309081738733955, -0.00971096336552118, 0.06946612248062953, 0.13601925487678312, -0.1383928442583629, -0.19427722329189917, 0.30870322339438105, -0.11713231823916824, -0.22050749571566042, 0.21015567084992523, 0.0010691060441302823, -0.20434823504707836, 0.013799261842929834, 0.22340830345008825, 0.11936391609393664, -0.16346592103710045, -0.023089112512565946, -0.06314773345785635, 0.24297671789420885, 0.004919636356937993, -0.039870646629096555, 0.19080937965059871, 0.297812561194102, -0.018208768600514076, 0.14677292733088237, -0.11504953795507013, -0.08757880904820857, -0.2351386847545032, -0.1064298658459741, -0.1204849457062009, -0.028722392976166564, -0.09891197081971997, -0.12323047031086308, 0.4021103284111968, 0.28717672801786315, 0.2245555735856026, 0.14989375614305236, 0.3510555346571916, 0.05209765091815309, 0.08235729621672952, 0.09934793588409603, 0.17695370978499586, -0.0032391447137604962, 0.09378441742428385, -0.1926146178455973, 0.09228404767618321, 0.04818343666491208] |
1,802.05578 | Regular blocks and Conley index of isolated invariant continua in
surfaces | In this paper we study topological and dynamical features of isolated
invariant continua of continuous flows defined on surfaces. We show that near
an isolated invariant continuum the flow is topologically equivalent to a C1
flow. We deduce that isolated invariant continua in surfaces have the shape of
finite polyhedra. We also show the existence of regular isolating blocks of
isolated invariant continua and we use them to compute their Conley index
provided that we have some knowledge about the truncated unstable manifold. We
also see that the ring structure of the cohomology index of an isolated
invariant continuum in a surface determines its Conley index. In addition, we
study the dynamics of non-saddle sets, preservation of topological and
dynamical properties by continuation and we give a topological classification
of isolated invariant continua which do not contain fixed points and, as a
consequence, we also classify isolated minimal sets.
| math.DS | in this paper we study topological and dynamical features of isolated invariant continua of continuous flows defined on surfaces we show that near an isolated invariant continuum the flow is topologically equivalent to a c1 flow we deduce that isolated invariant continua in surfaces have the shape of finite polyhedra we also show the existence of regular isolating blocks of isolated invariant continua and we use them to compute their conley index provided that we have some knowledge about the truncated unstable manifold we also see that the ring structure of the cohomology index of an isolated invariant continuum in a surface determines its conley index in addition we study the dynamics of nonsaddle sets preservation of topological and dynamical properties by continuation and we give a topological classification of isolated invariant continua which do not contain fixed points and as a consequence we also classify isolated minimal sets | [['in', 'this', 'paper', 'we', 'study', 'topological', 'and', 'dynamical', 'features', 'of', 'isolated', 'invariant', 'continua', 'of', 'continuous', 'flows', 'defined', 'on', 'surfaces', 'we', 'show', 'that', 'near', 'an', 'isolated', 'invariant', 'continuum', 'the', 'flow', 'is', 'topologically', 'equivalent', 'to', 'a', 'c1', 'flow', 'we', 'deduce', 'that', 'isolated', 'invariant', 'continua', 'in', 'surfaces', 'have', 'the', 'shape', 'of', 'finite', 'polyhedra', 'we', 'also', 'show', 'the', 'existence', 'of', 'regular', 'isolating', 'blocks', 'of', 'isolated', 'invariant', 'continua', 'and', 'we', 'use', 'them', 'to', 'compute', 'their', 'conley', 'index', 'provided', 'that', 'we', 'have', 'some', 'knowledge', 'about', 'the', 'truncated', 'unstable', 'manifold', 'we', 'also', 'see', 'that', 'the', 'ring', 'structure', 'of', 'the', 'cohomology', 'index', 'of', 'an', 'isolated', 'invariant', 'continuum', 'in', 'a', 'surface', 'determines', 'its', 'conley', 'index', 'in', 'addition', 'we', 'study', 'the', 'dynamics', 'of', 'nonsaddle', 'sets', 'preservation', 'of', 'topological', 'and', 'dynamical', 'properties', 'by', 'continuation', 'and', 'we', 'give', 'a', 'topological', 'classification', 'of', 'isolated', 'invariant', 'continua', 'which', 'do', 'not', 'contain', 'fixed', 'points', 'and', 'as', 'a', 'consequence', 'we', 'also', 'classify', 'isolated', 'minimal', 'sets']] | [-0.18905085570260183, 0.07747249689516486, -0.15375535591230446, 0.1089126764665414, -0.03476146946273644, -0.09274159027294775, 0.011235230031185752, 0.39771893920201884, -0.2655660357801306, -0.24699629320381772, 0.10143797513685071, -0.28281938892807934, -0.1827389166984182, 0.14473585292287547, -0.09779580535004603, 0.04527851480376538, 0.017745167727975936, 0.02883260632121323, -0.07993446952126601, -0.19779720057845865, 0.41692213366595693, -0.06337536314514859, 0.21284508452775744, 0.05103552697738945, 0.06465414086522397, -0.0045214455055960475, -0.0446590539380508, 0.07316104119687322, -0.20414397036816906, 0.13908264818507554, 0.2151446028896951, 0.06424344363216086, 0.14575138868257753, -0.37363539632384807, -0.1948480843566358, 0.14123626455239602, 0.12603172638622306, 0.06778670373863396, -0.046724273685300285, -0.23375794164923913, 0.16604562255947683, -0.13682762473421609, -0.20699775768068912, -0.10920288032483334, 0.055169164181230655, 0.0034207089010301053, -0.15762514995306343, 0.036710703990229986, 0.1310232803440378, 0.1200996117053816, -0.0890175417579723, 0.0012796157408480676, -0.1250198799304214, 0.15016875595116874, 0.0050070674831341425, -0.031176243402413872, 0.12586100734207753, -0.10387752833151127, -0.13417002440573986, 0.35026062162430494, -0.09792624899239323, -0.21044096351607433, 0.2367491749202795, -0.1491713031232607, -0.1870678507054112, 0.16549216863549246, 0.15439976322708415, 0.1549544728692346, -0.07758055098593898, 0.11430195912885974, -0.11363362477179742, 0.14634014111037222, 0.079561097022371, 0.047944285081787, 0.19709152518302803, 0.08153490538415092, 0.10331649785324612, 0.17591410909073066, -0.03445527763844268, -0.04166256445272507, -0.34172981191151497, -0.18480648107876713, -0.15469503391459083, 0.13218144338506496, -0.03700138874078129, -0.25131965871437784, 0.41110695706642914, 0.07627655201335282, 0.2310737022292494, 0.04505937360930288, 0.22038243482226894, 0.09159829206811576, 0.019350858575558204, 0.12614520133204207, 0.18190598919860324, 0.12836176789703235, -0.008066216980625918, -0.17970956115977177, -0.05650086077273942, 0.1306906839248243] |
1,802.05579 | Coarse geometry and topological phases | We propose the Roe C*-algebra from coarse geometry as a model for topological
phases of disordered materials. We explain the robustness of this C*-algebra
and formulate the bulk-edge correspondence in this framework. We describe the
map from the K-theory of the group C*-algebra of Z^d to the K-theory of the Roe
C*-algebra, both for real and complex K-theory.
| math-ph math.KT math.MP math.OA | we propose the roe calgebra from coarse geometry as a model for topological phases of disordered materials we explain the robustness of this calgebra and formulate the bulkedge correspondence in this framework we describe the map from the ktheory of the group calgebra of zd to the ktheory of the roe calgebra both for real and complex ktheory | [['we', 'propose', 'the', 'roe', 'calgebra', 'from', 'coarse', 'geometry', 'as', 'a', 'model', 'for', 'topological', 'phases', 'of', 'disordered', 'materials', 'we', 'explain', 'the', 'robustness', 'of', 'this', 'calgebra', 'and', 'formulate', 'the', 'bulkedge', 'correspondence', 'in', 'this', 'framework', 'we', 'describe', 'the', 'map', 'from', 'the', 'ktheory', 'of', 'the', 'group', 'calgebra', 'of', 'zd', 'to', 'the', 'ktheory', 'of', 'the', 'roe', 'calgebra', 'both', 'for', 'real', 'and', 'complex', 'ktheory']] | [-0.11359693594919197, 0.08966092738033883, -0.11785016204069915, 0.06938082160797485, -0.043326017735847114, -0.1331493725341841, 0.017142565439230407, 0.3888288001561987, -0.4073988474455887, -0.20514694898357166, 0.08540635880139046, -0.2112076134964872, -0.19416510763353315, 0.12090603961882278, -0.21809156125026016, -0.0019549155158215554, 0.03214362893125106, 0.05635905763583964, -0.10100929583583412, -0.1592056454352007, 0.44514111483244806, -0.010907200004520088, 0.2394281494559656, 0.07265856401224075, 0.0680697185934746, -0.008532915473112771, 0.019554585965093355, 0.0007350225551535601, -0.12790418838568288, 0.14071003217571254, 0.2979362785559276, 0.0694599243137857, 0.16498801555356074, -0.4219543277446566, -0.17553480948995928, 0.14478868037333775, 0.07253849360256873, 0.032038063621790756, -0.07441286818156469, -0.3559266618324508, 0.06556796345153246, -0.27812785622744085, -0.06474287579927979, -0.1608252067054654, 0.015072088881299413, -0.07330829558637121, -0.2340955251249774, 0.008488331102477065, 0.07368847422687144, 0.1383214425014589, -0.14484241974122566, 0.03202714544624604, -0.08824799693157447, 0.16024915430020412, -0.05977597897109608, -0.011715731005473384, 0.13182891528764418, -0.0806120064286194, -0.1660360453895229, 0.44665696272819205, 0.005683161595290334, -0.1638961060871852, 0.17676455736288738, -0.21798878198048974, -0.18990271493535618, 0.10922997213643172, 0.07249316672698178, 0.13091989475752003, 0.03926364714600917, 0.2013364839748929, -0.1377657515012884, 0.07491939174862386, -0.06817147759158679, 0.011396033609093264, 0.12500989431483223, 0.12748739377049537, 0.07125385051015122, 0.19535266292474135, 0.025006470013538312, -0.042451654014916254, -0.30680714412752924, -0.23027299519564057, -0.16265077763317345, 0.12300640222584379, -0.13502112779202308, -0.19124170694628667, 0.4944558424939369, 0.2096181356344083, 0.20676427183608556, 0.10022251476565826, 0.2759620155737703, 0.04803693945447368, -0.030009698122739792, 0.036741415632824445, 0.1442247523669282, 0.28071075597585277, 0.06514382132746536, -0.17861596958165796, -0.07882144833625905, 0.29259140569524006] |
1,802.0558 | Dynamically-coupled partial-waves in $\rho\pi$ isospin-2 scattering from
lattice QCD | We present the first determination of $\rho \pi$ scattering, incorporating
dynamically-coupled partial-waves, using lattice QCD, a first-principles
numerical approach to QCD. Considering the case of isospin-2 $\rho \pi$, we
calculate partial-wave amplitudes with $J \le 3$ and determine the degree of
dynamical mixing between the coupled $S$ and $D$-wave channels with $J^P=1^+$.
The analysis makes use of the relationship between scattering amplitudes and
the discrete spectrum of states in the finite volume lattice. Constraints on
the scattering amplitudes are provided by over one hundred energy levels
computed on two lattice volumes at various overall momenta and in several
irreducible representations of the relevant symmetry groups. The spectra follow
from variational analyses of matrices of correlations functions computed with
large bases of meson-meson operators. Calculations are performed with
degenerate light and strange quarks tuned to the physical strange quark mass so
that $m_\pi \sim 700$ MeV, ensuring that the $\rho$ is stable against strong
decay. This work demonstrates the successful application of techniques, opening
the door to calculations of scattering processes that incorporate the effects
of dynamically-coupled partial-waves, including those involving resonances or
bound states.
| hep-lat hep-ph | we present the first determination of rho pi scattering incorporating dynamicallycoupled partialwaves using lattice qcd a firstprinciples numerical approach to qcd considering the case of isospin2 rho pi we calculate partialwave amplitudes with j le 3 and determine the degree of dynamical mixing between the coupled s and dwave channels with jp1 the analysis makes use of the relationship between scattering amplitudes and the discrete spectrum of states in the finite volume lattice constraints on the scattering amplitudes are provided by over one hundred energy levels computed on two lattice volumes at various overall momenta and in several irreducible representations of the relevant symmetry groups the spectra follow from variational analyses of matrices of correlations functions computed with large bases of mesonmeson operators calculations are performed with degenerate light and strange quarks tuned to the physical strange quark mass so that m_pi sim 700 mev ensuring that the rho is stable against strong decay this work demonstrates the successful application of techniques opening the door to calculations of scattering processes that incorporate the effects of dynamicallycoupled partialwaves including those involving resonances or bound states | [['we', 'present', 'the', 'first', 'determination', 'of', 'rho', 'pi', 'scattering', 'incorporating', 'dynamicallycoupled', 'partialwaves', 'using', 'lattice', 'qcd', 'a', 'firstprinciples', 'numerical', 'approach', 'to', 'qcd', 'considering', 'the', 'case', 'of', 'isospin2', 'rho', 'pi', 'we', 'calculate', 'partialwave', 'amplitudes', 'with', 'j', 'le', '3', 'and', 'determine', 'the', 'degree', 'of', 'dynamical', 'mixing', 'between', 'the', 'coupled', 's', 'and', 'dwave', 'channels', 'with', 'jp1', 'the', 'analysis', 'makes', 'use', 'of', 'the', 'relationship', 'between', 'scattering', 'amplitudes', 'and', 'the', 'discrete', 'spectrum', 'of', 'states', 'in', 'the', 'finite', 'volume', 'lattice', 'constraints', 'on', 'the', 'scattering', 'amplitudes', 'are', 'provided', 'by', 'over', 'one', 'hundred', 'energy', 'levels', 'computed', 'on', 'two', 'lattice', 'volumes', 'at', 'various', 'overall', 'momenta', 'and', 'in', 'several', 'irreducible', 'representations', 'of', 'the', 'relevant', 'symmetry', 'groups', 'the', 'spectra', 'follow', 'from', 'variational', 'analyses', 'of', 'matrices', 'of', 'correlations', 'functions', 'computed', 'with', 'large', 'bases', 'of', 'mesonmeson', 'operators', 'calculations', 'are', 'performed', 'with', 'degenerate', 'light', 'and', 'strange', 'quarks', 'tuned', 'to', 'the', 'physical', 'strange', 'quark', 'mass', 'so', 'that', 'm_pi', 'sim', '700', 'mev', 'ensuring', 'that', 'the', 'rho', 'is', 'stable', 'against', 'strong', 'decay', 'this', 'work', 'demonstrates', 'the', 'successful', 'application', 'of', 'techniques', 'opening', 'the', 'door', 'to', 'calculations', 'of', 'scattering', 'processes', 'that', 'incorporate', 'the', 'effects', 'of', 'dynamicallycoupled', 'partialwaves', 'including', 'those', 'involving', 'resonances', 'or', 'bound', 'states']] | [-0.13400541829785495, 0.22856821049240156, -0.09960443469437609, 0.07289986699849935, -0.017926556162780362, -0.10619471136685563, 0.09790086012672754, 0.3380328014021, -0.23002138660218485, -0.2668041586192608, 0.004682302935575338, -0.3303330568008317, -0.0673251736747182, 0.1451336445145147, 0.10304564642517464, 0.09232252496092216, 0.06659741061309393, -0.006564350729129966, -0.1153716316216362, -0.1941430392079106, 0.3527701308371236, -0.013491285935110089, 0.2218066972432691, 0.12729169914255972, 0.03928370170583746, 0.0549269729564675, -0.04734111829083818, -0.07881015377200168, -0.13867890570275884, 0.11281927318866466, 0.2161391566709347, 0.034835969652150474, 0.13461907028028255, -0.38383703046154394, -0.17624196493188324, 0.07794991752851511, 0.1415347837141978, 0.10356102041955835, 0.014907754359149334, -0.2828285906086777, 0.0832984470635774, -0.16700359270093348, -0.15518563013756648, -0.14185055154223886, 0.005375870015996043, -0.020023104167826798, -0.29354364769539604, 0.09940934136418787, -0.045565163158165015, 0.06842624382348415, -0.050005372373245496, -0.21533924626166243, -0.038309532549211996, 0.09129873125272317, 0.06377365567680934, 0.01590764173053448, 0.1061250086647266, -0.12141908834366957, -0.12412926153553164, 0.3940234091752917, -0.052608528065004226, -0.16810930444626138, 0.16623120480495424, -0.16430820920251551, -0.12413253025506096, 0.15592631040667387, 0.16512846807017922, 0.10646151084169421, -0.11524228717494027, 0.10030170056922108, -0.018693396684482097, 0.17195688815390103, 0.09709721278277753, 0.07423260340558203, 0.15793439859154876, 0.1425485934647124, -0.026816289490101473, 0.08065742669777651, -0.08142763643042164, -0.10341648333807192, -0.3223641776813842, -0.06536345492508111, -0.1434453079108726, 0.06097254102465029, -0.08654086531414182, -0.1156956176336794, 0.3719085397897288, 0.09102856649754001, 0.23340326728319508, 0.035534723210097895, 0.2606867714835655, 0.10308860939087185, 0.0756906762417993, 0.07267832333404246, 0.23454513942693744, 0.22378148103725043, 0.053722856968069325, -0.2770534417555293, -0.02871613749353539, 0.04814129141311202] |
1,802.05581 | Improved Complexities of Conditional Gradient-Type Methods with
Applications to Robust Matrix Recovery Problems | Motivated by robust matrix recovery problems such as Robust Principal
Component Analysis, we consider a general optimization problem of minimizing a
smooth and strongly convex loss function applied to the sum of two blocks of
variables, where each block of variables is constrained or regularized
individually. We study a Conditional Gradient-Type method which is able to
leverage the special structure of the problem to obtain faster convergence
rates than those attainable via standard methods, under a variety of
assumptions. In particular, our method is appealing for matrix problems in
which one of the blocks corresponds to a low-rank matrix since it avoids
prohibitive full-rank singular value decompositions required by most standard
methods. While our initial motivation comes from problems which originated in
statistics, our analysis does not impose any statistical assumptions on the
data.
| cs.LG math.OC | motivated by robust matrix recovery problems such as robust principal component analysis we consider a general optimization problem of minimizing a smooth and strongly convex loss function applied to the sum of two blocks of variables where each block of variables is constrained or regularized individually we study a conditional gradienttype method which is able to leverage the special structure of the problem to obtain faster convergence rates than those attainable via standard methods under a variety of assumptions in particular our method is appealing for matrix problems in which one of the blocks corresponds to a lowrank matrix since it avoids prohibitive fullrank singular value decompositions required by most standard methods while our initial motivation comes from problems which originated in statistics our analysis does not impose any statistical assumptions on the data | [['motivated', 'by', 'robust', 'matrix', 'recovery', 'problems', 'such', 'as', 'robust', 'principal', 'component', 'analysis', 'we', 'consider', 'a', 'general', 'optimization', 'problem', 'of', 'minimizing', 'a', 'smooth', 'and', 'strongly', 'convex', 'loss', 'function', 'applied', 'to', 'the', 'sum', 'of', 'two', 'blocks', 'of', 'variables', 'where', 'each', 'block', 'of', 'variables', 'is', 'constrained', 'or', 'regularized', 'individually', 'we', 'study', 'a', 'conditional', 'gradienttype', 'method', 'which', 'is', 'able', 'to', 'leverage', 'the', 'special', 'structure', 'of', 'the', 'problem', 'to', 'obtain', 'faster', 'convergence', 'rates', 'than', 'those', 'attainable', 'via', 'standard', 'methods', 'under', 'a', 'variety', 'of', 'assumptions', 'in', 'particular', 'our', 'method', 'is', 'appealing', 'for', 'matrix', 'problems', 'in', 'which', 'one', 'of', 'the', 'blocks', 'corresponds', 'to', 'a', 'lowrank', 'matrix', 'since', 'it', 'avoids', 'prohibitive', 'fullrank', 'singular', 'value', 'decompositions', 'required', 'by', 'most', 'standard', 'methods', 'while', 'our', 'initial', 'motivation', 'comes', 'from', 'problems', 'which', 'originated', 'in', 'statistics', 'our', 'analysis', 'does', 'not', 'impose', 'any', 'statistical', 'assumptions', 'on', 'the', 'data']] | [-0.05937944253934408, -6.266621657327484e-05, -0.08064890775391693, 0.07592537078863955, -0.08482878823215559, -0.16379046282703197, 0.039121311046739125, 0.3443566886569137, -0.3202901153813061, -0.25721079111099243, 0.19004970430674503, -0.22370852921470832, -0.16723554584357553, 0.19689381857569427, -0.10281088012409632, 0.10481785636468192, 0.10345142321407434, 0.02202693764606852, -0.14694565226525458, -0.2568618434953934, 0.32761587683500637, 0.007422091383764993, 0.2881499953540181, -0.011078790270240366, 0.1308167895429017, 0.04957716809429312, -0.035356920007477276, 0.026068935616449244, -0.06134214615032299, 0.16117930097797356, 0.26291472165942636, 0.18370893826958404, 0.3323603913608466, -0.43151598930386686, -0.21355128176718838, 0.1764400530182548, 0.11336331816612562, 0.09192579772597902, -0.0017464336419630963, -0.2143607011304668, 0.11033974334062424, -0.10706523523158602, -0.09618777206250981, -0.0798918421140441, -0.05179987522537139, -0.014000966410420196, -0.37234781960715235, 0.10272876958974372, 0.06589959757124532, -0.006900375642911044, -0.028581186260249632, -0.17305165217796675, 0.050650610041165195, 0.06027640059499988, 0.09459475300417268, 0.019919221918446136, 0.13756186470611773, -0.11249210110712629, -0.1001059975581063, 0.39728130529627703, -0.04389053018672006, -0.26064154614326057, 0.18475037103226938, -0.06073118561406189, -0.16137391941816503, 0.1293447112548165, 0.1818459264850661, 0.1668805457484811, -0.1538488648127271, 0.08539691278771776, -0.05759990070390501, 0.1688066695455406, 0.00868845494019229, 0.0051686914464799385, 0.13621976905773436, 0.140211914396678, 0.1549671645790561, 0.12795108569952757, -0.022512951759802207, -0.10046894158889998, -0.2795601537478949, -0.0955794645723567, -0.23099302609951528, 0.03334839299241682, -0.12131171256167825, -0.18430278328448924, 0.38480808064619554, 0.14773808532992183, 0.2137597869706354, 0.07793689573291383, 0.3228660014305097, 0.11816555605992786, 0.0740549736586747, 0.08163460474782762, 0.19404571131740544, 0.1584603969101558, 0.021052656688187933, -0.16934007264451303, 0.08894076191128662, 0.07901888273642468] |
1,802.05582 | Distributed coloring in sparse graphs with fewer colors | This paper is concerned with efficiently coloring sparse graphs in the
distributed setting with as few colors as possible. According to the celebrated
Four Color Theorem, planar graphs can be colored with at most 4 colors, and the
proof gives a (sequential) quadratic algorithm finding such a coloring. A
natural problem is to improve this complexity in the distributed setting. Using
the fact that planar graphs contain linearly many vertices of degree at most 6,
Goldberg, Plotkin, and Shannon obtained a deterministic distributed algorithm
coloring $n$-vertex planar graphs with 7 colors in $O(\log n)$ rounds. Here, we
show how to color planar graphs with 6 colors in $\mbox{polylog}(n)$ rounds.
Our algorithm indeed works more generally in the list-coloring setting and for
sparse graphs (for such graphs we improve by at least one the number of colors
resulting from an efficient algorithm of Barenboim and Elkin, at the expense of
a slightly worst complexity). Our bounds on the number of colors turn out to be
quite sharp in general. Among other results, we show that no distributed
algorithm can color every $n$-vertex planar graph with 4 colors in $o(n)$
rounds.
| math.CO cs.DC cs.DS | this paper is concerned with efficiently coloring sparse graphs in the distributed setting with as few colors as possible according to the celebrated four color theorem planar graphs can be colored with at most 4 colors and the proof gives a sequential quadratic algorithm finding such a coloring a natural problem is to improve this complexity in the distributed setting using the fact that planar graphs contain linearly many vertices of degree at most 6 goldberg plotkin and shannon obtained a deterministic distributed algorithm coloring nvertex planar graphs with 7 colors in olog n rounds here we show how to color planar graphs with 6 colors in mboxpolylogn rounds our algorithm indeed works more generally in the listcoloring setting and for sparse graphs for such graphs we improve by at least one the number of colors resulting from an efficient algorithm of barenboim and elkin at the expense of a slightly worst complexity our bounds on the number of colors turn out to be quite sharp in general among other results we show that no distributed algorithm can color every nvertex planar graph with 4 colors in on rounds | [['this', 'paper', 'is', 'concerned', 'with', 'efficiently', 'coloring', 'sparse', 'graphs', 'in', 'the', 'distributed', 'setting', 'with', 'as', 'few', 'colors', 'as', 'possible', 'according', 'to', 'the', 'celebrated', 'four', 'color', 'theorem', 'planar', 'graphs', 'can', 'be', 'colored', 'with', 'at', 'most', '4', 'colors', 'and', 'the', 'proof', 'gives', 'a', 'sequential', 'quadratic', 'algorithm', 'finding', 'such', 'a', 'coloring', 'a', 'natural', 'problem', 'is', 'to', 'improve', 'this', 'complexity', 'in', 'the', 'distributed', 'setting', 'using', 'the', 'fact', 'that', 'planar', 'graphs', 'contain', 'linearly', 'many', 'vertices', 'of', 'degree', 'at', 'most', '6', 'goldberg', 'plotkin', 'and', 'shannon', 'obtained', 'a', 'deterministic', 'distributed', 'algorithm', 'coloring', 'nvertex', 'planar', 'graphs', 'with', '7', 'colors', 'in', 'olog', 'n', 'rounds', 'here', 'we', 'show', 'how', 'to', 'color', 'planar', 'graphs', 'with', '6', 'colors', 'in', 'mboxpolylogn', 'rounds', 'our', 'algorithm', 'indeed', 'works', 'more', 'generally', 'in', 'the', 'listcoloring', 'setting', 'and', 'for', 'sparse', 'graphs', 'for', 'such', 'graphs', 'we', 'improve', 'by', 'at', 'least', 'one', 'the', 'number', 'of', 'colors', 'resulting', 'from', 'an', 'efficient', 'algorithm', 'of', 'barenboim', 'and', 'elkin', 'at', 'the', 'expense', 'of', 'a', 'slightly', 'worst', 'complexity', 'our', 'bounds', 'on', 'the', 'number', 'of', 'colors', 'turn', 'out', 'to', 'be', 'quite', 'sharp', 'in', 'general', 'among', 'other', 'results', 'we', 'show', 'that', 'no', 'distributed', 'algorithm', 'can', 'color', 'every', 'nvertex', 'planar', 'graph', 'with', '4', 'colors', 'in', 'on', 'rounds']] | [-0.10895084995079155, 0.10388081885017171, -0.05413178679910267, 0.024687951078352633, -0.07400058004413805, -0.17589042397590463, 0.06768115003847039, 0.4299883797232594, -0.245007177214902, -0.4162637771146677, 0.07827672385549045, -0.2993360449567378, -0.16752318921745335, 0.14218330248530028, -0.1793181530308353, 0.03449940490881326, 0.09247573258394681, 0.046444787445127665, 0.06307191334919826, -0.36518505727949246, 0.22765698088406924, -0.044492433339150414, 0.1799080760166463, 0.05098958144693699, 0.03330919859627823, 0.06469611981489434, -0.010917775217128335, 0.08225354813830034, -0.11277204694723152, 0.07461962086412188, 0.29086304281926934, 0.15693128151848676, 0.23693163070591197, -0.3930132998387322, -0.13675384475755945, 0.19815087770730894, 0.13938070575967826, 0.11361836266048529, -0.030235652006542307, -0.1808411115189157, 0.12576099290579026, -0.0642363344530591, -0.08671362206731582, 0.034765545561491286, 0.057924714693356125, -0.018056228710092093, -0.288025765970507, -0.014967640526789837, 0.09644201753178129, 0.029395376506419213, 0.07611369973827134, -0.17163952199862925, 0.005309163358693243, 0.07601952620550359, -0.06391412839934073, 0.10075509995677898, 0.010905007160054372, -0.12118044480306919, -0.22545667470644706, 0.35683019957924017, -0.026578150167272836, -0.13658755184668633, 0.16622906416117475, -0.08961354920433627, -0.23398787591596523, 0.12860718008781236, 0.1592923273830108, 0.18460588047290763, -0.10432779614501952, 0.09209759517513688, -0.11846227743588979, 0.16277469405362371, 0.148165875188415, 0.05707307031874609, 0.08012906399650362, 0.14108744609199228, 0.17069156351776438, 0.1820861036650881, 0.02680274123256957, -0.03605072669439737, -0.24384247763920083, -0.07298461751637872, -0.24409883103220079, 0.014257802557145989, -0.2380239545622047, -0.15697214584973168, 0.3741824181464614, 0.13583185132617553, 0.20056205404005825, 0.1778541441474642, 0.2974572703439407, 0.05281086966011023, 0.052920525250512926, 0.22682715336319118, 0.1553794592101541, 0.12523274216184974, 0.037403981876436364, -0.15592856677470818, 0.048471813113551844, 0.12449033192368766] |
1,802.05583 | Tools and resources for Romanian text-to-speech and speech-to-text
applications | In this paper we introduce a set of resources and tools aimed at providing
support for natural language processing, text-to-speech synthesis and speech
recognition for Romanian. While the tools are general purpose and can be used
for any language (we successfully trained our system for more than 50 languages
and participated in the Universal Dependencies Shared Task), the resources are
only relevant for Romanian language processing.
| cs.CL | in this paper we introduce a set of resources and tools aimed at providing support for natural language processing texttospeech synthesis and speech recognition for romanian while the tools are general purpose and can be used for any language we successfully trained our system for more than 50 languages and participated in the universal dependencies shared task the resources are only relevant for romanian language processing | [['in', 'this', 'paper', 'we', 'introduce', 'a', 'set', 'of', 'resources', 'and', 'tools', 'aimed', 'at', 'providing', 'support', 'for', 'natural', 'language', 'processing', 'texttospeech', 'synthesis', 'and', 'speech', 'recognition', 'for', 'romanian', 'while', 'the', 'tools', 'are', 'general', 'purpose', 'and', 'can', 'be', 'used', 'for', 'any', 'language', 'we', 'successfully', 'trained', 'our', 'system', 'for', 'more', 'than', '50', 'languages', 'and', 'participated', 'in', 'the', 'universal', 'dependencies', 'shared', 'task', 'the', 'resources', 'are', 'only', 'relevant', 'for', 'romanian', 'language', 'processing']] | [-0.041628340010488915, 0.02471290003846992, -0.017873636736167653, 0.1266765071160273, -0.13551959214788495, -0.1935083621082771, 0.021111779202439004, 0.4048163544273738, -0.249636723561156, -0.34967664699511125, 0.10007919976840529, -0.2648178172495329, -0.12834931695551582, 0.30652177277387993, -0.12591930123215372, 0.10981041455472057, 0.11704374180937355, 0.07770909017982018, 0.014574833143728249, -0.26072658580431546, 0.28754762894558633, 0.004192922095006163, 0.32099950645175396, 0.03130033792871417, 0.07418338044998095, -0.017199830303787057, -0.0311389554179076, -0.05925207885659554, -0.03609739179426635, 0.22494688229353138, 0.432443913523898, 0.2761703330007466, 0.31592583257676754, -0.42602005499330436, -0.17637667642680532, 0.07258241529802256, 0.11581993994839264, 0.13400012450857143, -0.04930201854850483, -0.2974269931684389, 0.13070328329746245, -0.18099394134443367, 0.05526541550573187, -0.12957901281840872, 0.053732788479520066, -0.04901190759758747, -0.2733239981603357, -0.02557511456931631, 0.11586929075984341, 0.2065785922335856, -0.037562101490259396, -0.10427655126179823, 0.04184950875457038, 0.23295349746970742, -0.055366975043646315, 0.0436236298516054, 0.11872734205627983, -0.1340529654619538, -0.14489213837254228, 0.45659333738413727, -0.0464015916551227, -0.2183730983260003, 0.2659909113761828, -0.03496115439162223, -0.2587042855465728, 0.020520383604999744, 0.23516126672356305, 0.0829274205942497, -0.2463020832052059, 0.05557792114489006, 0.038583085096130766, 0.2512334823382623, 0.09084730362519622, 0.013037828895242208, 0.22750092305024294, 0.2571488176754704, -0.032039092550279966, 0.16124655146709163, -0.02862739632131927, -0.008694404552718906, -0.23416908704816844, -0.1843824234480659, -0.13849424064215837, -0.08514343574995908, -0.01681342385762202, -0.06315209977258222, 0.407612182199955, 0.20331918530406035, 0.06342957079918547, 0.17737109484997662, 0.30381399610390264, 0.04416576930992905, 0.12383150020049828, 0.13641678446561634, 0.08427120573557631, -0.03306952522446712, 0.18966639794366943, -0.13202638182591533, 0.11821379077225698, -0.0007464559466549845] |
1,802.05584 | Convolutional Analysis Operator Learning: Acceleration and Convergence | Convolutional operator learning is gaining attention in many signal
processing and computer vision applications. Learning kernels has mostly relied
on so-called patch-domain approaches that extract and store many overlapping
patches across training signals. Due to memory demands, patch-domain methods
have limitations when learning kernels from large datasets -- particularly with
multi-layered structures, e.g., convolutional neural networks -- or when
applying the learned kernels to high-dimensional signal recovery problems. The
so-called convolution approach does not store many overlapping patches, and
thus overcomes the memory problems particularly with careful algorithmic
designs; it has been studied within the "synthesis" signal model, e.g.,
convolutional dictionary learning. This paper proposes a new convolutional
analysis operator learning (CAOL) framework that learns an analysis sparsifying
regularizer with the convolution perspective, and develops a new convergent
Block Proximal Extrapolated Gradient method using a Majorizer (BPEG-M) to solve
the corresponding block multi-nonconvex problems. To learn diverse filters
within the CAOL framework, this paper introduces an orthogonality constraint
that enforces a tight-frame filter condition, and a regularizer that promotes
diversity between filters. Numerical experiments show that, with sharp
majorizers, BPEG-M significantly accelerates the CAOL convergence rate compared
to the state-of-the-art block proximal gradient (BPG) method. Numerical
experiments for sparse-view computational tomography show that a convolutional
sparsifying regularizer learned via CAOL significantly improves reconstruction
quality compared to a conventional edge-preserving regularizer. Using more and
wider kernels in a learned regularizer better preserves edges in reconstructed
images.
| eess.IV cs.CV cs.LG math.OC stat.ML | convolutional operator learning is gaining attention in many signal processing and computer vision applications learning kernels has mostly relied on socalled patchdomain approaches that extract and store many overlapping patches across training signals due to memory demands patchdomain methods have limitations when learning kernels from large datasets particularly with multilayered structures eg convolutional neural networks or when applying the learned kernels to highdimensional signal recovery problems the socalled convolution approach does not store many overlapping patches and thus overcomes the memory problems particularly with careful algorithmic designs it has been studied within the synthesis signal model eg convolutional dictionary learning this paper proposes a new convolutional analysis operator learning caol framework that learns an analysis sparsifying regularizer with the convolution perspective and develops a new convergent block proximal extrapolated gradient method using a majorizer bpegm to solve the corresponding block multinonconvex problems to learn diverse filters within the caol framework this paper introduces an orthogonality constraint that enforces a tightframe filter condition and a regularizer that promotes diversity between filters numerical experiments show that with sharp majorizers bpegm significantly accelerates the caol convergence rate compared to the stateoftheart block proximal gradient bpg method numerical experiments for sparseview computational tomography show that a convolutional sparsifying regularizer learned via caol significantly improves reconstruction quality compared to a conventional edgepreserving regularizer using more and wider kernels in a learned regularizer better preserves edges in reconstructed images | [['convolutional', 'operator', 'learning', 'is', 'gaining', 'attention', 'in', 'many', 'signal', 'processing', 'and', 'computer', 'vision', 'applications', 'learning', 'kernels', 'has', 'mostly', 'relied', 'on', 'socalled', 'patchdomain', 'approaches', 'that', 'extract', 'and', 'store', 'many', 'overlapping', 'patches', 'across', 'training', 'signals', 'due', 'to', 'memory', 'demands', 'patchdomain', 'methods', 'have', 'limitations', 'when', 'learning', 'kernels', 'from', 'large', 'datasets', 'particularly', 'with', 'multilayered', 'structures', 'eg', 'convolutional', 'neural', 'networks', 'or', 'when', 'applying', 'the', 'learned', 'kernels', 'to', 'highdimensional', 'signal', 'recovery', 'problems', 'the', 'socalled', 'convolution', 'approach', 'does', 'not', 'store', 'many', 'overlapping', 'patches', 'and', 'thus', 'overcomes', 'the', 'memory', 'problems', 'particularly', 'with', 'careful', 'algorithmic', 'designs', 'it', 'has', 'been', 'studied', 'within', 'the', 'synthesis', 'signal', 'model', 'eg', 'convolutional', 'dictionary', 'learning', 'this', 'paper', 'proposes', 'a', 'new', 'convolutional', 'analysis', 'operator', 'learning', 'caol', 'framework', 'that', 'learns', 'an', 'analysis', 'sparsifying', 'regularizer', 'with', 'the', 'convolution', 'perspective', 'and', 'develops', 'a', 'new', 'convergent', 'block', 'proximal', 'extrapolated', 'gradient', 'method', 'using', 'a', 'majorizer', 'bpegm', 'to', 'solve', 'the', 'corresponding', 'block', 'multinonconvex', 'problems', 'to', 'learn', 'diverse', 'filters', 'within', 'the', 'caol', 'framework', 'this', 'paper', 'introduces', 'an', 'orthogonality', 'constraint', 'that', 'enforces', 'a', 'tightframe', 'filter', 'condition', 'and', 'a', 'regularizer', 'that', 'promotes', 'diversity', 'between', 'filters', 'numerical', 'experiments', 'show', 'that', 'with', 'sharp', 'majorizers', 'bpegm', 'significantly', 'accelerates', 'the', 'caol', 'convergence', 'rate', 'compared', 'to', 'the', 'stateoftheart', 'block', 'proximal', 'gradient', 'bpg', 'method', 'numerical', 'experiments', 'for', 'sparseview', 'computational', 'tomography', 'show', 'that', 'a', 'convolutional', 'sparsifying', 'regularizer', 'learned', 'via', 'caol', 'significantly', 'improves', 'reconstruction', 'quality', 'compared', 'to', 'a', 'conventional', 'edgepreserving', 'regularizer', 'using', 'more', 'and', 'wider', 'kernels', 'in', 'a', 'learned', 'regularizer', 'better', 'preserves', 'edges', 'in', 'reconstructed', 'images']] | [-0.011719691378602235, -0.023150731610688747, -0.09137183447723816, 0.06097564428560681, -0.14041623298646555, -0.21135731986233672, -0.01798572043110637, 0.4797655870043264, -0.3466511852058925, -0.2848219467161566, 0.09193453482472697, -0.25389580913255677, -0.23496349209310943, 0.17291543224475167, -0.14935403617237808, 0.10912655861313014, 0.17189316792013287, -0.009008021631049351, -0.15051681495051047, -0.24726125360017218, 0.2551916594802925, 0.07504396975089453, 0.371140789040446, 0.0035268065597241125, 0.14409213384466343, -0.017935270308762005, -0.034802246533473136, -0.016945884131066697, -0.027954461720806296, 0.18362471199872202, 0.3215192740011078, 0.21078983321071096, 0.39819012996291314, -0.4380790537239559, -0.2651837488611866, 0.10320803600827053, 0.17458729052815583, 0.07988922078150433, -0.0736188895001792, -0.318082974014575, 0.08423420623518739, -0.13667445312756554, 0.06011648212963911, -0.1785343382914761, -0.08675396297353712, -0.02465955721134761, -0.3490783402659489, 0.0355631528818457, 0.1033611651918475, 0.01929962315000267, -0.03573537887617325, -0.1334460863870111, 0.050862576455090264, 0.07080006331900797, 0.014558403640924217, 0.06630478906006095, 0.1561406216524917, -0.16383338282538348, -0.12027349437407234, 0.29771615788258876, -0.036984276029040315, -0.22256423553660984, 0.18103548445689835, -0.006975125885985203, -0.14005057064085186, 0.13287374677734956, 0.2492594031837622, 0.1169828244555423, -0.15984188378831932, 0.06176335306015078, -0.0273985074824866, 0.18275655463558474, 0.07824952598751049, 0.01624475880076684, 0.09653812980589767, 0.2295148831285667, 0.10026810509423326, 0.16007572426430047, -0.12253830446596176, -0.0788207373856526, -0.174816822928015, -0.040590344211331716, -0.22822265807547393, -0.07273525428510702, -0.13350791270651124, -0.1751312279322296, 0.39374361921657336, 0.20458765431070342, 0.22564900794327913, 0.12481300370538456, 0.3552926881647293, 0.05201324175536763, 0.1965959664924875, 0.12766384392396726, 0.15582884497799618, 0.11779191922355574, 0.1432929419501019, -0.16712267660094718, 0.0609089191510289, 0.09835481170765042] |
1,802.05585 | Maximally nonlocal subspaces | A nonlocal subspace $\mathcal{H}_{NS}$ is a subspace within the Hilbert space
$\mathcal{H}_n$ of a multi-particle system such that every state $\psi \in
\mathcal{H}_{NS}$ violates a given Bell inequality $\mathcal{B}$. Subspace
$\mathcal{H}_{NS}$ is maximally nonlocal if each such state $\psi$ violates
$\mathcal{B}$ to its algebraic maximum. We propose ways by which states with a
stabilizer structure of graph states can be used to construct maximally
nonlocal subspaces, essentially as a degenerate eigenspace of Bell operators
derived from the stabilizer generators. Two cryptographic applications-- to
quantum information splitting and quantum subspace certification-- are
discussed.
| quant-ph | a nonlocal subspace mathcalh_ns is a subspace within the hilbert space mathcalh_n of a multiparticle system such that every state psi in mathcalh_ns violates a given bell inequality mathcalb subspace mathcalh_ns is maximally nonlocal if each such state psi violates mathcalb to its algebraic maximum we propose ways by which states with a stabilizer structure of graph states can be used to construct maximally nonlocal subspaces essentially as a degenerate eigenspace of bell operators derived from the stabilizer generators two cryptographic applications to quantum information splitting and quantum subspace certification are discussed | [['a', 'nonlocal', 'subspace', 'mathcalh_ns', 'is', 'a', 'subspace', 'within', 'the', 'hilbert', 'space', 'mathcalh_n', 'of', 'a', 'multiparticle', 'system', 'such', 'that', 'every', 'state', 'psi', 'in', 'mathcalh_ns', 'violates', 'a', 'given', 'bell', 'inequality', 'mathcalb', 'subspace', 'mathcalh_ns', 'is', 'maximally', 'nonlocal', 'if', 'each', 'such', 'state', 'psi', 'violates', 'mathcalb', 'to', 'its', 'algebraic', 'maximum', 'we', 'propose', 'ways', 'by', 'which', 'states', 'with', 'a', 'stabilizer', 'structure', 'of', 'graph', 'states', 'can', 'be', 'used', 'to', 'construct', 'maximally', 'nonlocal', 'subspaces', 'essentially', 'as', 'a', 'degenerate', 'eigenspace', 'of', 'bell', 'operators', 'derived', 'from', 'the', 'stabilizer', 'generators', 'two', 'cryptographic', 'applications', 'to', 'quantum', 'information', 'splitting', 'and', 'quantum', 'subspace', 'certification', 'are', 'discussed']] | [-0.1720481757277056, 0.1609400761536444, -0.07575321444512709, 0.06759944273432231, -0.03734626957346969, -0.22948555085990255, 0.0025024061324074864, 0.2789227609806087, -0.32684688626851194, -0.154374398432834, 0.07752711182009712, -0.28599638989924087, -0.09966146834599583, 0.1565145656425992, -0.084643847352076, 0.12883604939396837, 0.10407494579735414, 0.06961566740242035, -0.11364851779628383, -0.21880143096843865, 0.38000872541907366, -0.05302834110182669, 0.24283086008685845, -0.03701810685553304, 0.14689500646604953, 0.014378137914362647, 0.08600831916555762, -0.010796106152512315, -0.09770204330601226, 0.1290395755217026, 0.3287705244779911, 0.19880557550198358, 0.2608225845109226, -0.357331224771295, -0.13766447831791162, 0.1848293116984322, 0.10179764072729638, 0.13278663483746958, 0.018813583088795775, -0.35858046164250246, 0.04402381843765792, -0.20332366711986455, -0.09107163335378889, -0.1394734495906564, 0.03324761124752948, -0.10854203189702948, -0.3113492960799941, 0.05522676805064649, 0.0532279061001685, -0.002171375940594336, 0.03516725796330518, -0.07605129519082687, -0.08368668782160334, 0.04218833970472864, -0.114818430723339, 0.07424444781550531, 0.13351860218719355, -0.05541275400141983, -0.19063715454514907, 0.3542607915992646, -0.018489549487560947, -0.3082347628053116, 0.09591323225354047, -0.12525457334603465, -0.14088090033391895, 0.023041652485161372, 0.08941712897048211, 0.07966202045993312, -0.11249189201360264, 0.14880889143893475, -0.12039932835361232, 0.15777218238572063, 0.04088559370417067, 0.16742426529020557, 0.12324350659796239, 0.017032518836102732, 0.15993319334887454, 0.16661935229659203, 0.012489414530927721, -0.07681851492025485, -0.38667545726765756, -0.18861636102867677, -0.24810084018289394, 0.1316436208055719, -0.061318053572746146, -0.159806906407618, 0.41646888439604285, 0.023852001577008352, 0.18018748621841002, -0.02803297077543507, 0.20375131607136648, 0.10782458340501129, 0.039889409667407366, 0.13498211210801103, 0.1729898272568117, 0.20818348212481436, -0.030255873674911487, -0.18069516206109573, 0.04340515708242057, 0.1745234848197509] |
1,802.05586 | Complex magnetic fields: An improved Hardy-Laptev-Weidl inequality and
quasi-self-adjointness | We show that allowing magnetic fields to be complex-valued leads to an
improvement in the magnetic Hardy-type inequality due to Laptev and Weidl. The
proof is based on the study of momenta on the circle with complex magnetic
fields, which is of independent interest in the context of PT-symmetric and
quasi-Hermitian quantum mechanics. We study basis properties of the
non-self-adjoint momenta and derive closed formulae for the similarity
transforms relating them to self-adjoint operators.
| math-ph math.AP math.MP math.SP quant-ph | we show that allowing magnetic fields to be complexvalued leads to an improvement in the magnetic hardytype inequality due to laptev and weidl the proof is based on the study of momenta on the circle with complex magnetic fields which is of independent interest in the context of ptsymmetric and quasihermitian quantum mechanics we study basis properties of the nonselfadjoint momenta and derive closed formulae for the similarity transforms relating them to selfadjoint operators | [['we', 'show', 'that', 'allowing', 'magnetic', 'fields', 'to', 'be', 'complexvalued', 'leads', 'to', 'an', 'improvement', 'in', 'the', 'magnetic', 'hardytype', 'inequality', 'due', 'to', 'laptev', 'and', 'weidl', 'the', 'proof', 'is', 'based', 'on', 'the', 'study', 'of', 'momenta', 'on', 'the', 'circle', 'with', 'complex', 'magnetic', 'fields', 'which', 'is', 'of', 'independent', 'interest', 'in', 'the', 'context', 'of', 'ptsymmetric', 'and', 'quasihermitian', 'quantum', 'mechanics', 'we', 'study', 'basis', 'properties', 'of', 'the', 'nonselfadjoint', 'momenta', 'and', 'derive', 'closed', 'formulae', 'for', 'the', 'similarity', 'transforms', 'relating', 'them', 'to', 'selfadjoint', 'operators']] | [-0.13633860043577245, 0.11631201365968524, -0.06556640382906473, 0.04991355797942929, -0.11438601356112978, -0.09254129973517077, -0.023807203688979702, 0.35573310523319085, -0.23650053545920732, -0.25872786775800855, 0.07273695133060117, -0.25755171148056116, -0.145916457382358, 0.2358379731162426, -0.07557752902141295, 0.06088779675396713, 0.025332776043010322, 0.06215307430672535, -0.10300668070998949, -0.19785086452533063, 0.3805518121131369, -0.0009443902086491722, 0.2277163621541616, 0.0966430275977866, 0.06405473061887598, 0.04010138163859075, -0.002827461140318396, -0.01620693540049566, -0.11705363853065678, 0.1592579171615275, 0.21023606222022223, 0.06581889278940917, 0.2333558366218632, -0.43257713997484865, -0.15327523458698714, 0.1378094703336624, 0.1093657106488339, 0.05821475142933982, -0.017316770818512385, -0.3279697255395051, 0.023460601492646477, -0.0893235608331255, -0.16208862723480608, -0.15007486068517775, 0.04686042577078616, 0.021950756004583592, -0.31088650801747636, 0.08443277095746551, 0.09703566236232684, 0.08085510036530527, -0.09725576518669825, -0.07169643826027577, 0.017988438812411717, 0.06627887337644761, 0.06467393250204623, 0.023647861523755098, 0.08988302650962125, -0.0741453547081029, -0.13350298246872183, 0.3604095647161877, -0.021009108592831605, -0.24524518960734476, 0.13339208532439395, -0.17087320394411282, -0.12212296480917044, 0.07247208262088935, 0.16714499681885983, 0.12352037397716698, -0.13893839526871168, 0.16469255160002313, -0.04682783044975351, 0.10299751974289885, 0.06629739943388346, 0.09808956979572572, 0.1623096536794627, 0.05437006023586602, 0.07983531305138525, 0.1734600011998712, -0.008283772811410017, -0.1321748042214863, -0.3108270971003819, -0.20408754840468032, -0.18366606605264382, 0.095547852924446, -0.09662716433888056, -0.20588796302625859, 0.4153698202524636, 0.15633706659758212, 0.19546383386477828, 0.023857104807550943, 0.22284841922590057, 0.18821534657901204, 0.07666597771458328, 0.042233823528009896, 0.21675107103923485, 0.27914592934571003, 0.09457987812060605, -0.20794274720223305, -0.05046053427095349, 0.13770449919802313] |
1,802.05587 | Multiplicity spectra in pp collisions at LHC energies in terms of Gamma
and Tsallis distributions | In recent years the Tsallis statistics is gaining popularity in describing
charged particle produc- tion and their properties, in particular pT spectra
and the multiplicities in high energy particle collisions. Motivated by its
success, an analysis of the LHC data of proton-proton collisions at ener- gies
ranging from 0.9 TeV to 7 TeV in different rapidity windows for charged
particle multiplicities has been done. A comparative analysis is performed in
terms of the Tsallis distribution, the Gamma distribution and the shifted-Gamma
distribution. An interesting observation on the inapplicability of these
distributions at sqrt{s}=7 TeV in the lower rapidity windows is intriguing. The
non-extensive nature of the Tsallis statistics is studied by determining the
entropic index and its energy depen- dence. The analysis is extrapolated to
predict the multiplicity distribution at sqrt{s}=14 TeV for one rapidity
window, |y| < 1.5 with the Tsallis function.
| hep-ph | in recent years the tsallis statistics is gaining popularity in describing charged particle produc tion and their properties in particular pt spectra and the multiplicities in high energy particle collisions motivated by its success an analysis of the lhc data of protonproton collisions at ener gies ranging from 09 tev to 7 tev in different rapidity windows for charged particle multiplicities has been done a comparative analysis is performed in terms of the tsallis distribution the gamma distribution and the shiftedgamma distribution an interesting observation on the inapplicability of these distributions at sqrts7 tev in the lower rapidity windows is intriguing the nonextensive nature of the tsallis statistics is studied by determining the entropic index and its energy depen dence the analysis is extrapolated to predict the multiplicity distribution at sqrts14 tev for one rapidity window y 15 with the tsallis function | [['in', 'recent', 'years', 'the', 'tsallis', 'statistics', 'is', 'gaining', 'popularity', 'in', 'describing', 'charged', 'particle', 'produc', 'tion', 'and', 'their', 'properties', 'in', 'particular', 'pt', 'spectra', 'and', 'the', 'multiplicities', 'in', 'high', 'energy', 'particle', 'collisions', 'motivated', 'by', 'its', 'success', 'an', 'analysis', 'of', 'the', 'lhc', 'data', 'of', 'protonproton', 'collisions', 'at', 'ener', 'gies', 'ranging', 'from', '09', 'tev', 'to', '7', 'tev', 'in', 'different', 'rapidity', 'windows', 'for', 'charged', 'particle', 'multiplicities', 'has', 'been', 'done', 'a', 'comparative', 'analysis', 'is', 'performed', 'in', 'terms', 'of', 'the', 'tsallis', 'distribution', 'the', 'gamma', 'distribution', 'and', 'the', 'shiftedgamma', 'distribution', 'an', 'interesting', 'observation', 'on', 'the', 'inapplicability', 'of', 'these', 'distributions', 'at', 'sqrts7', 'tev', 'in', 'the', 'lower', 'rapidity', 'windows', 'is', 'intriguing', 'the', 'nonextensive', 'nature', 'of', 'the', 'tsallis', 'statistics', 'is', 'studied', 'by', 'determining', 'the', 'entropic', 'index', 'and', 'its', 'energy', 'depen', 'dence', 'the', 'analysis', 'is', 'extrapolated', 'to', 'predict', 'the', 'multiplicity', 'distribution', 'at', 'sqrts14', 'tev', 'for', 'one', 'rapidity', 'window', 'y', '15', 'with', 'the', 'tsallis', 'function']] | [-0.042090295378039495, 0.19334172936183638, -0.18750198036498317, 0.16206387127295518, 0.02938029970907679, -0.10011413172613962, -0.06074174263692917, 0.3365471276837725, -0.21264095167160457, -0.3687015202107793, -0.011943383686449247, -0.3800401988419447, 0.0886236791703718, 0.15131293562924528, -0.005479907418819184, 0.13183620489443526, 0.08611604961805959, 0.022212207856134376, -0.05184792328942964, -0.197921999290929, 0.2721379536265137, 0.1548507573241566, 0.2718759672815337, 0.1429784110043832, 0.08620207487598908, 0.08221556955175673, -0.044408369138968964, -0.038782214947335476, -0.18386408061132575, 0.09287251246695123, 0.2508170181680603, 0.07829788351225182, 0.20786959673971572, -0.28471090083162415, -0.16309344988763794, 0.14232654381024895, 0.14383399198971134, -0.009931361561984563, -0.06371077033608544, -0.2722765216802029, 0.11041688125791914, -0.23471795482204316, -0.14384928439473008, -0.0029165708618436722, 0.07917772238770275, 0.026249526232045066, -0.2392186459272783, 0.13670700509431408, -0.013341982092655509, 0.12077692555860577, -0.02062480622763805, -0.18934652930644097, -0.05405802796231517, 0.007390524356474056, 0.11911333958574584, 0.0062667668024276165, 0.15535896814408454, -0.15321723298716247, -0.16200531954408115, 0.3192145575353123, 0.02746623454628684, -0.12747803427186524, 0.17540325608487564, -0.19280567630656487, -0.14983466328683157, 0.16047403045619527, 0.23371519038704694, 0.08141785357308455, -0.19475243286170224, 0.12576980158151624, -0.0007556013313802421, 0.1522145518597136, 0.08639390345213684, 0.062160018970199085, 0.1869341872289037, 0.17909267035986673, -0.03000740737077146, 0.08977289398114943, -0.1391246575673923, -0.11742770859430023, -0.346070935091017, -0.11631028099416538, -0.20963076677120535, 0.025907426018182002, -0.12283136682702123, -0.047652731860941606, 0.3916019506765701, 0.09485009268870749, 0.28995852778064657, -0.012879328377848717, 0.22538510608612328, 0.14191332479265142, 0.004967532361319275, 0.07771542275667931, 0.26005343146331555, 0.14344508945776796, 0.23601108739905535, -0.17569439232197478, 0.029979249276716184, 0.036516517909336174] |
1,802.05588 | Pure spinors and a construction of the $E_*$-Lie algebras | Let $(V,g)$ be a $2n$-dimensional hyperbolic space and $C(V,g)$ its Clifford
algebra. $C(V,g)$ has a $\mathbb Z$-grading, $C^k $, and an algebra isomorphism
$C(V,g)\cong End(S)$, $S$ the space of spinors. \'E. Cartan defined operators
$L_k: End(S) \to C^k$ which are involved in the definition of pure spinors. We
shall give a more refined study of the operator $L_2$, in fact, obtain explicit
formulae for it in terms of spinor inner products and combinatorics, as well as
the matrix of it in a basis of pure spinors. Using this information we give a
construction of the exceptional Lie algebras $\mathfrak e_6, \mathfrak e_7,
\mathfrak e_8$ completely within the theory of Clifford algebras and spinors.
| math.RT hep-th math-ph math.MP | let vg be a 2ndimensional hyperbolic space and cvg its clifford algebra cvg has a mathbb zgrading ck and an algebra isomorphism cvgcong ends s the space of spinors e cartan defined operators l_k ends to ck which are involved in the definition of pure spinors we shall give a more refined study of the operator l_2 in fact obtain explicit formulae for it in terms of spinor inner products and combinatorics as well as the matrix of it in a basis of pure spinors using this information we give a construction of the exceptional lie algebras mathfrak e_6 mathfrak e_7 mathfrak e_8 completely within the theory of clifford algebras and spinors | [['let', 'vg', 'be', 'a', '2ndimensional', 'hyperbolic', 'space', 'and', 'cvg', 'its', 'clifford', 'algebra', 'cvg', 'has', 'a', 'mathbb', 'zgrading', 'ck', 'and', 'an', 'algebra', 'isomorphism', 'cvgcong', 'ends', 's', 'the', 'space', 'of', 'spinors', 'e', 'cartan', 'defined', 'operators', 'l_k', 'ends', 'to', 'ck', 'which', 'are', 'involved', 'in', 'the', 'definition', 'of', 'pure', 'spinors', 'we', 'shall', 'give', 'a', 'more', 'refined', 'study', 'of', 'the', 'operator', 'l_2', 'in', 'fact', 'obtain', 'explicit', 'formulae', 'for', 'it', 'in', 'terms', 'of', 'spinor', 'inner', 'products', 'and', 'combinatorics', 'as', 'well', 'as', 'the', 'matrix', 'of', 'it', 'in', 'a', 'basis', 'of', 'pure', 'spinors', 'using', 'this', 'information', 'we', 'give', 'a', 'construction', 'of', 'the', 'exceptional', 'lie', 'algebras', 'mathfrak', 'e_6', 'mathfrak', 'e_7', 'mathfrak', 'e_8', 'completely', 'within', 'the', 'theory', 'of', 'clifford', 'algebras', 'and', 'spinors']] | [-0.1897770649310923, 0.1131049313730195, -0.060077299932353535, 0.07467611811463595, -0.12096131999079171, -0.15500785347477003, -0.03819807268247042, 0.3333990867207716, -0.28888235387165806, -0.1891307100183792, 0.1168039709723949, -0.23104478452807745, -0.13888177841163432, 0.14542936970404274, -0.12702093146078558, -0.08026845902173049, 0.026312761713524122, 0.13594802320087412, -0.19603963751715045, -0.2743740199083412, 0.3822347476600191, -0.04632892495289714, 0.1888873916777975, 0.0033075294209862346, 0.1179767891571664, 0.0020544267309879935, 0.010686605270985548, -0.09567421627480553, -0.14737451414216882, 0.12508420695483619, 0.33478743229522834, 0.11342361258963744, 0.16195458427767967, -0.3911884175277911, -0.08330051384227527, 0.21068181986642606, 0.21400974446337098, -0.05991177490455107, 0.013087626522892524, -0.2900576564013488, 0.01364005320948792, -0.2146860895393131, -0.1572243974854549, -0.10184620637320788, 0.11347739561932867, -0.1028944514125485, -0.24245480962332572, 0.014699822522464904, 0.09924843401526445, 0.13643987606036234, -0.0758882261443514, -0.1411326277396969, -0.1340811047535222, 0.03666339911570823, -0.07868865921858463, 0.06885187710144532, 0.10777652091430584, -0.03249209241412983, -0.1722482848526524, 0.37958554948705275, -0.022331765926283626, -0.2880743063256346, 0.06852324899319592, -0.19014131680114177, -0.14784184633124922, 0.04700827758826383, 0.06512188032974263, 0.1360495280315009, -0.05878286374046421, 0.2714727620094981, -0.13808846230558874, -0.024554576139544714, 0.06870302522496262, 0.02484923791243099, 0.11903461418114603, 0.07698568710134374, 0.04124441221859809, 0.1137743167535125, 0.1122025495671944, 0.005308123288659362, -0.41664632544055713, -0.2387924595163854, -0.11210972201582547, 0.19052702409156538, -0.1423943253891618, -0.2031911908709738, 0.4057056957453087, 0.03308689961344138, 0.18563407393138823, 0.06690618761307518, 0.17940610002827, 0.08212581418742014, 0.11104251281148544, 0.06518180261005287, 0.10096590293923745, 0.27941057076761583, -0.03773914261048278, -0.119355840119743, -0.13256631272232478, 0.23836757613530568] |
1,802.05589 | Effects of Symmetry Breaking in Resonance Phenomena | We show that resonance phenomena can be treated as nonequilibrium phase
transitions. Resonance phenomena, similar to equilibrium phase transitions, are
accompanied by some kind of symmetry breaking and can be characterized by order
parameters. This is demonstrated for spin-wave resonance, helicon resonance,
and spin-reversal resonance.
| cond-mat.mes-hall | we show that resonance phenomena can be treated as nonequilibrium phase transitions resonance phenomena similar to equilibrium phase transitions are accompanied by some kind of symmetry breaking and can be characterized by order parameters this is demonstrated for spinwave resonance helicon resonance and spinreversal resonance | [['we', 'show', 'that', 'resonance', 'phenomena', 'can', 'be', 'treated', 'as', 'nonequilibrium', 'phase', 'transitions', 'resonance', 'phenomena', 'similar', 'to', 'equilibrium', 'phase', 'transitions', 'are', 'accompanied', 'by', 'some', 'kind', 'of', 'symmetry', 'breaking', 'and', 'can', 'be', 'characterized', 'by', 'order', 'parameters', 'this', 'is', 'demonstrated', 'for', 'spinwave', 'resonance', 'helicon', 'resonance', 'and', 'spinreversal', 'resonance']] | [-0.17777697468797365, 0.29029997549951075, -0.06561035006307066, 0.1072888303651578, -0.10267327109144794, -0.13921844375630218, 0.019430122953943082, 0.3877921346988943, -0.24947820231318474, -0.3134727027681139, 0.08672133331290549, -0.25057341477109324, -0.19680924897935861, 0.14381703140421045, 0.05839200754546457, 0.09198901241438256, 0.003231293915046586, -0.01731429882347584, -0.010539086758055621, -0.035749636445608406, 0.2924778761756089, -0.04151690229773521, 0.2286812071584993, 0.09931762084985772, 0.0026669148148761855, -0.04782093630896674, 0.18797520142462518, 0.02907685057984458, -0.1382789157597775, -0.06401786686231693, 0.32123807564170825, 0.006120693642232153, 0.13479182782272497, -0.4082753481550349, -0.2724496254904403, 0.051519232139819196, 0.23213554779585038, 0.16342218336131836, -0.06839825537883573, -0.39371089989112484, 0.011367672875834008, -0.11198222399171856, -0.1506007889699605, -0.2238788102236059, -0.0720975493805276, -0.0014206102324856652, -0.32389142320801817, 0.14305784424973858, 0.09609233724574248, 0.136056948473884, -0.017769344264848365, -0.07563087699624399, -0.03806614629510376, 0.03417049680526058, 0.037558079526449246, -0.011215615769227345, 0.19578280408814963, -0.0689848590383513, -0.16735808211896155, 0.37179346366061106, -0.06791966728503919, -0.08559646703716782, 0.16142289614718822, -0.204879732347197, -0.07509762344674932, 0.21669860370457172, 0.10000448460794158, 0.08126089396990008, -0.1482032287865877, -0.002569733309145603, 0.08919352951149145, 0.17490135116709604, 0.09205188245202105, 0.0563605110367967, 0.22589227507511775, 0.13490863309966195, -0.03162278315673272, 0.17838414480599266, -0.059629286867049006, -0.12889070957899093, -0.2597566059894032, -0.0880616248274843, -0.2050931711991628, 0.0157828070430292, 0.05075893413547116, -0.058728546049031945, 0.4322136161228021, 0.09681637280931076, 0.23903139697180853, -0.1343615984130237, 0.20034826709371473, 0.2410854033065132, 0.091198246470756, -0.02759771126632889, 0.35119042830451186, 0.15156212818498413, 0.07073660906818179, -0.2865185772275759, 0.054013100649333665, 0.007419745334320598] |
1,802.0559 | Relativistic Analogue of the Newtonian Fluid Energy Equation with
Nucleosynthesis | In Newtonian fluid dynamics simulations in which composition has been tracked
by a nuclear reaction network, energy generation due to composition changes has
generally been handled as a separate source term in the energy equation. A
relativistic equation in conservative form for total fluid energy, obtained
from the spacetime divergence of the stress-energy tensor, in principle
encompasses such energy generation; but it is not explicitly manifest. An
alternative relativistic energy equation in conservative form---in which the
nuclear energy generation appears explicitly, and that reduces directly to the
Newtonian internal + kinetic energy in the appropriate limit---emerges
naturally and self-consistently from the difference of the equation for total
fluid energy and the equation for baryon number conservation multiplied by the
average baryon mass $m$, when $m$ is expressed in terms of contributions from
the nuclear species in the fluid, and allowed to be mutable.
| astro-ph.HE | in newtonian fluid dynamics simulations in which composition has been tracked by a nuclear reaction network energy generation due to composition changes has generally been handled as a separate source term in the energy equation a relativistic equation in conservative form for total fluid energy obtained from the spacetime divergence of the stressenergy tensor in principle encompasses such energy generation but it is not explicitly manifest an alternative relativistic energy equation in conservative formin which the nuclear energy generation appears explicitly and that reduces directly to the newtonian internal kinetic energy in the appropriate limitemerges naturally and selfconsistently from the difference of the equation for total fluid energy and the equation for baryon number conservation multiplied by the average baryon mass m when m is expressed in terms of contributions from the nuclear species in the fluid and allowed to be mutable | [['in', 'newtonian', 'fluid', 'dynamics', 'simulations', 'in', 'which', 'composition', 'has', 'been', 'tracked', 'by', 'a', 'nuclear', 'reaction', 'network', 'energy', 'generation', 'due', 'to', 'composition', 'changes', 'has', 'generally', 'been', 'handled', 'as', 'a', 'separate', 'source', 'term', 'in', 'the', 'energy', 'equation', 'a', 'relativistic', 'equation', 'in', 'conservative', 'form', 'for', 'total', 'fluid', 'energy', 'obtained', 'from', 'the', 'spacetime', 'divergence', 'of', 'the', 'stressenergy', 'tensor', 'in', 'principle', 'encompasses', 'such', 'energy', 'generation', 'but', 'it', 'is', 'not', 'explicitly', 'manifest', 'an', 'alternative', 'relativistic', 'energy', 'equation', 'in', 'conservative', 'formin', 'which', 'the', 'nuclear', 'energy', 'generation', 'appears', 'explicitly', 'and', 'that', 'reduces', 'directly', 'to', 'the', 'newtonian', 'internal', 'kinetic', 'energy', 'in', 'the', 'appropriate', 'limitemerges', 'naturally', 'and', 'selfconsistently', 'from', 'the', 'difference', 'of', 'the', 'equation', 'for', 'total', 'fluid', 'energy', 'and', 'the', 'equation', 'for', 'baryon', 'number', 'conservation', 'multiplied', 'by', 'the', 'average', 'baryon', 'mass', 'm', 'when', 'm', 'is', 'expressed', 'in', 'terms', 'of', 'contributions', 'from', 'the', 'nuclear', 'species', 'in', 'the', 'fluid', 'and', 'allowed', 'to', 'be', 'mutable']] | [-0.09128408540273085, 0.15880466304214289, -0.08372820304627697, 0.09958748705186216, -0.05319165551835405, -0.062359073043002616, -0.02742122522655076, 0.2599809633784129, -0.28616299307905135, -0.3718715699655669, 0.01179819890946549, -0.2591808363263096, -0.03159505093270647, 0.1403210878738069, 0.000112736936924713, 0.027678203732440513, 0.030477965940787857, 0.08368748205081959, -0.03826196845454563, -0.1521191094902211, 0.33544772470403195, 0.09439911963085511, 0.2487411934017603, 0.0625294219785636, 0.15358936177965785, -0.031152075900796, -0.039781628283006805, 0.04867219318132681, -0.11358394477642182, 0.04703854900648626, 0.22928097538783082, 0.05350249199795404, 0.22827206939857986, -0.455117348461811, -0.27104159254979876, 0.1140009379978957, 0.12162274092968021, 0.1289089800473968, -0.040592580075774876, -0.2243102808092122, 0.01209768925660423, -0.21867304861745132, -0.13461161128112248, -0.06954161848708672, 0.04741146348283759, 0.05652131770122131, -0.24001822478437265, 0.17938308683889254, 0.026268119937075035, -0.037788519462836644, -0.12787243740999008, -0.11094417455439855, -0.08446616497156875, 0.06904160186136973, 0.06743048916105181, 0.05003858258818842, 0.1333010515850869, -0.16136982061767152, -0.014433530238290717, 0.44563767058508735, -0.09004400049535824, -0.2668368031137756, 0.12173875125923327, -0.1147718802959259, -0.1068919718365318, 0.17108105504885315, 0.15875187862132276, 0.09326967310480541, -0.2110578220459242, 0.11999580007811476, 0.011232947714493744, 0.15484240422291415, 0.08993681765028409, 0.004020834631020469, 0.20361700277509434, 0.11050373165968007, 0.03402513342776469, 0.0878960480106928, -0.04051562451890537, -0.14890862149851664, -0.32174488567481085, -0.15478121483907412, -0.21107249081666982, 0.08912725062951463, -0.07212010095453089, -0.1048544476756693, 0.3652012676715718, 0.07423219846636389, 0.12799446757625058, -0.025720549419721853, 0.32398725024291447, 0.17348447241238318, 0.0967456739942593, 0.11223737201320806, 0.2709002582156765, 0.15795746271864378, 0.15961987554328516, -0.27413430868348637, 0.021652394110736037, 0.08826033981250865] |
1,802.05591 | Towards End-to-End Lane Detection: an Instance Segmentation Approach | Modern cars are incorporating an increasing number of driver assist features,
among which automatic lane keeping. The latter allows the car to properly
position itself within the road lanes, which is also crucial for any subsequent
lane departure or trajectory planning decision in fully autonomous cars.
Traditional lane detection methods rely on a combination of highly-specialized,
hand-crafted features and heuristics, usually followed by post-processing
techniques, that are computationally expensive and prone to scalability due to
road scene variations. More recent approaches leverage deep learning models,
trained for pixel-wise lane segmentation, even when no markings are present in
the image due to their big receptive field. Despite their advantages, these
methods are limited to detecting a pre-defined, fixed number of lanes, e.g.
ego-lanes, and can not cope with lane changes. In this paper, we go beyond the
aforementioned limitations and propose to cast the lane detection problem as an
instance segmentation problem - in which each lane forms its own instance -
that can be trained end-to-end. To parametrize the segmented lane instances
before fitting the lane, we further propose to apply a learned perspective
transformation, conditioned on the image, in contrast to a fixed "bird's-eye
view" transformation. By doing so, we ensure a lane fitting which is robust
against road plane changes, unlike existing approaches that rely on a fixed,
pre-defined transformation. In summary, we propose a fast lane detection
algorithm, running at 50 fps, which can handle a variable number of lanes and
cope with lane changes. We verify our method on the tuSimple dataset and
achieve competitive results.
| cs.CV | modern cars are incorporating an increasing number of driver assist features among which automatic lane keeping the latter allows the car to properly position itself within the road lanes which is also crucial for any subsequent lane departure or trajectory planning decision in fully autonomous cars traditional lane detection methods rely on a combination of highlyspecialized handcrafted features and heuristics usually followed by postprocessing techniques that are computationally expensive and prone to scalability due to road scene variations more recent approaches leverage deep learning models trained for pixelwise lane segmentation even when no markings are present in the image due to their big receptive field despite their advantages these methods are limited to detecting a predefined fixed number of lanes eg egolanes and can not cope with lane changes in this paper we go beyond the aforementioned limitations and propose to cast the lane detection problem as an instance segmentation problem in which each lane forms its own instance that can be trained endtoend to parametrize the segmented lane instances before fitting the lane we further propose to apply a learned perspective transformation conditioned on the image in contrast to a fixed birdseye view transformation by doing so we ensure a lane fitting which is robust against road plane changes unlike existing approaches that rely on a fixed predefined transformation in summary we propose a fast lane detection algorithm running at 50 fps which can handle a variable number of lanes and cope with lane changes we verify our method on the tusimple dataset and achieve competitive results | [['modern', 'cars', 'are', 'incorporating', 'an', 'increasing', 'number', 'of', 'driver', 'assist', 'features', 'among', 'which', 'automatic', 'lane', 'keeping', 'the', 'latter', 'allows', 'the', 'car', 'to', 'properly', 'position', 'itself', 'within', 'the', 'road', 'lanes', 'which', 'is', 'also', 'crucial', 'for', 'any', 'subsequent', 'lane', 'departure', 'or', 'trajectory', 'planning', 'decision', 'in', 'fully', 'autonomous', 'cars', 'traditional', 'lane', 'detection', 'methods', 'rely', 'on', 'a', 'combination', 'of', 'highlyspecialized', 'handcrafted', 'features', 'and', 'heuristics', 'usually', 'followed', 'by', 'postprocessing', 'techniques', 'that', 'are', 'computationally', 'expensive', 'and', 'prone', 'to', 'scalability', 'due', 'to', 'road', 'scene', 'variations', 'more', 'recent', 'approaches', 'leverage', 'deep', 'learning', 'models', 'trained', 'for', 'pixelwise', 'lane', 'segmentation', 'even', 'when', 'no', 'markings', 'are', 'present', 'in', 'the', 'image', 'due', 'to', 'their', 'big', 'receptive', 'field', 'despite', 'their', 'advantages', 'these', 'methods', 'are', 'limited', 'to', 'detecting', 'a', 'predefined', 'fixed', 'number', 'of', 'lanes', 'eg', 'egolanes', 'and', 'can', 'not', 'cope', 'with', 'lane', 'changes', 'in', 'this', 'paper', 'we', 'go', 'beyond', 'the', 'aforementioned', 'limitations', 'and', 'propose', 'to', 'cast', 'the', 'lane', 'detection', 'problem', 'as', 'an', 'instance', 'segmentation', 'problem', 'in', 'which', 'each', 'lane', 'forms', 'its', 'own', 'instance', 'that', 'can', 'be', 'trained', 'endtoend', 'to', 'parametrize', 'the', 'segmented', 'lane', 'instances', 'before', 'fitting', 'the', 'lane', 'we', 'further', 'propose', 'to', 'apply', 'a', 'learned', 'perspective', 'transformation', 'conditioned', 'on', 'the', 'image', 'in', 'contrast', 'to', 'a', 'fixed', 'birdseye', 'view', 'transformation', 'by', 'doing', 'so', 'we', 'ensure', 'a', 'lane', 'fitting', 'which', 'is', 'robust', 'against', 'road', 'plane', 'changes', 'unlike', 'existing', 'approaches', 'that', 'rely', 'on', 'a', 'fixed', 'predefined', 'transformation', 'in', 'summary', 'we', 'propose', 'a', 'fast', 'lane', 'detection', 'algorithm', 'running', 'at', '50', 'fps', 'which', 'can', 'handle', 'a', 'variable', 'number', 'of', 'lanes', 'and', 'cope', 'with', 'lane', 'changes', 'we', 'verify', 'our', 'method', 'on', 'the', 'tusimple', 'dataset', 'and', 'achieve', 'competitive', 'results']] | [-0.06502180729535212, 0.007660141399469467, -0.08919475912261987, 0.03532656069228324, -0.13304626658555208, -0.1907146170960914, 0.05969990828361915, 0.4759312960704847, -0.2624549320771621, -0.33802348284189065, 0.12638634106997415, -0.23111227876057683, -0.1411228951119483, 0.16441928407493833, -0.1981411161041251, 0.07274670811943906, 0.10025420225838388, 0.025765047573258926, -0.038715201723789505, -0.24270683900249423, 0.27703715071857005, 0.02776598899970395, 0.30332701690440445, 0.021901149140830967, 0.09801570019487826, 0.010552672719313705, -0.08866915251564933, 0.022234730964555638, -0.046120917711220955, 0.12800674706463155, 0.3007147757222839, 0.13730097791994922, 0.28272367405952537, -0.46717522470953554, -0.2317011634731898, 0.1398153186273703, 0.16410544319768405, 0.10226491752064248, -0.025675639655958093, -0.3633058234272539, 0.09476093877940173, -0.15729693782850518, -0.06494388298960985, -0.09089255378603411, 0.0011293629181636788, 0.015806697776497458, -0.24617290517767287, 0.005519433540953855, 0.0672573878359799, 0.05203246868768474, -0.033673047796355604, -0.04343431778579543, 0.022140761250284413, 0.17706611954838536, 0.03279554859318523, 0.054001392726604536, 0.2075188543076365, -0.23040776231596283, -0.12533144046938105, 0.40721368655431434, -0.03345631354022771, -0.19540995625811775, 0.22318488175824314, -0.011856207840537536, -0.14718059782899218, 0.1559047312362054, 0.18902526560873412, 0.1263540521294999, -0.1221775811748671, -0.014974861596328992, -0.021221420753136044, 0.17126271845336305, 0.07255301532768499, -0.03413744658115547, 0.2143109099188223, 0.18800582512540132, 0.1169085679134696, 0.08967805515158034, -0.17220071906558587, -0.10213528433268948, -0.2390414060337207, -0.09966956187577125, -0.1319332225416474, -0.06707262817866422, -0.07317756179406842, -0.12946390848628653, 0.3709253185043053, 0.24934824076080986, 0.26069773304789123, 0.10454757279921978, 0.3927641875925474, 0.0705293728497054, 0.12000579349523832, 0.08419087285346905, 0.16769409649577938, -0.027339766622390016, 0.1268131983724743, -0.1690508531710293, 0.14158930580242668, 0.07177325364773424] |
1,802.05592 | 'Free-Space' Photonic Quantum Link and Chiral Quantum Optics | We present the design of a chiral photonic quantum link, where distant atoms
interact by exchanging photons propagating in a single direction in free-space.
This is achieved by coupling each atom in a laser-assisted process to an atomic
array acting as a quantum phased-array antenna. This provides a basic building
block for quantum networks in free space, i.e. without requiring cavities or
nanostructures, which we illustrate with high-fidelity quantum state transfer
protocols. Our setup can be implemented with neutral atoms using
Rydberg-dressed interactions.
| quant-ph physics.atom-ph physics.optics | we present the design of a chiral photonic quantum link where distant atoms interact by exchanging photons propagating in a single direction in freespace this is achieved by coupling each atom in a laserassisted process to an atomic array acting as a quantum phasedarray antenna this provides a basic building block for quantum networks in free space ie without requiring cavities or nanostructures which we illustrate with highfidelity quantum state transfer protocols our setup can be implemented with neutral atoms using rydbergdressed interactions | [['we', 'present', 'the', 'design', 'of', 'a', 'chiral', 'photonic', 'quantum', 'link', 'where', 'distant', 'atoms', 'interact', 'by', 'exchanging', 'photons', 'propagating', 'in', 'a', 'single', 'direction', 'in', 'freespace', 'this', 'is', 'achieved', 'by', 'coupling', 'each', 'atom', 'in', 'a', 'laserassisted', 'process', 'to', 'an', 'atomic', 'array', 'acting', 'as', 'a', 'quantum', 'phasedarray', 'antenna', 'this', 'provides', 'a', 'basic', 'building', 'block', 'for', 'quantum', 'networks', 'in', 'free', 'space', 'ie', 'without', 'requiring', 'cavities', 'or', 'nanostructures', 'which', 'we', 'illustrate', 'with', 'highfidelity', 'quantum', 'state', 'transfer', 'protocols', 'our', 'setup', 'can', 'be', 'implemented', 'with', 'neutral', 'atoms', 'using', 'rydbergdressed', 'interactions']] | [-0.18068693405163128, 0.2423934506728238, 0.0027318983359812163, -0.05835239117160276, -0.00647030838944736, -0.24463620617514453, 0.060058267200814495, 0.4652418731206871, -0.24444811558911958, -0.267042077763612, 0.0037331323711627938, -0.2559013379715293, -0.10040724147616112, 0.1957457191731601, 0.03162136136593454, 0.05277070915887514, 0.07373669949999775, -0.023620062664779555, -0.020171646406405595, -0.18329137259623013, 0.27316300380211994, 0.08096066720963242, 0.2695370142695954, 0.004322010131709906, 0.13669053802872638, 0.05835906813953476, 0.07176725738064711, -0.04794106033878928, -0.04454335127255868, 0.16644083058562534, 0.2783480196243085, 0.02749751822417041, 0.24689991489411836, -0.5247281895927995, -0.2519679381904832, 0.06092723889882306, 0.18885189403656377, 0.2152515110242074, -0.11148769985772221, -0.3373050096119384, -0.02560655628499317, -0.1996626817671784, -0.11042118220623717, -0.05404998383944832, -0.08077343192837953, -0.005066055995243859, -0.2832684401501284, -0.03484844299684088, 0.004399177104975265, 0.06394253244079336, 0.03541713551876236, 0.005835074406812887, 0.045239736643025136, 0.1178312269291919, -0.13670804743488119, 0.028724878597219127, 0.18887313572600126, -0.11968396623697446, -0.1834306058653417, 0.40551243637161083, -0.08271256484040788, -0.2183907130979989, 0.17526980368308273, -0.06812011056119599, -0.05706891732245504, 0.06719291967014412, 0.1617299004356904, 0.08158647697643344, -0.1471167720282024, 0.0696684863496886, -0.015436841096414858, 0.21861856242961597, 0.0797433086519455, 0.11704048512683037, 0.23991235428635616, 0.18586766511112093, 0.05979445907118988, 0.20015524924558822, -0.07206334316182926, -0.12269306007817567, -0.26724166984961606, -0.2241910424319107, -0.2370033797145967, 0.08811538987680821, -0.04666291397760611, -0.12257404226237481, 0.3412553676381617, 0.10545011793252036, 0.17666642933365811, -0.058051410657129286, 0.34793266676456097, 0.07852320704631598, 0.09920682962310601, 0.03366136396617954, 0.2500307442331462, 0.1442284474979682, 0.052889152306569626, -0.21193487892286425, -0.007755071278212659, 0.018403945050303298] |
1,802.05593 | System Identification via Polynomial Transformation Method | We propose a method based on minimum-variance polynomial approximation to
extract system poles from a data set of samples of the impulse response of a
linear system. The method is capable of handling the problem under general
conditions of sampling and noise characteristics. The superiority of the
proposed method is demonstrated by statistical comparison of its performance
with the performances of two exiting methods in the special case of uniform
sampling.
| cs.SY math.NA | we propose a method based on minimumvariance polynomial approximation to extract system poles from a data set of samples of the impulse response of a linear system the method is capable of handling the problem under general conditions of sampling and noise characteristics the superiority of the proposed method is demonstrated by statistical comparison of its performance with the performances of two exiting methods in the special case of uniform sampling | [['we', 'propose', 'a', 'method', 'based', 'on', 'minimumvariance', 'polynomial', 'approximation', 'to', 'extract', 'system', 'poles', 'from', 'a', 'data', 'set', 'of', 'samples', 'of', 'the', 'impulse', 'response', 'of', 'a', 'linear', 'system', 'the', 'method', 'is', 'capable', 'of', 'handling', 'the', 'problem', 'under', 'general', 'conditions', 'of', 'sampling', 'and', 'noise', 'characteristics', 'the', 'superiority', 'of', 'the', 'proposed', 'method', 'is', 'demonstrated', 'by', 'statistical', 'comparison', 'of', 'its', 'performance', 'with', 'the', 'performances', 'of', 'two', 'exiting', 'methods', 'in', 'the', 'special', 'case', 'of', 'uniform', 'sampling']] | [-0.0878260542284435, -0.03233473061938101, -0.11891402712773899, 0.01488473355888166, -0.03659252882410418, -0.09198201526428612, 0.06394768036692075, 0.36888562785592716, -0.24276509836421045, -0.2775108456368965, 0.11102696220358935, -0.2495661223156404, -0.16030866156240375, 0.2617016653202369, -0.07926579752386036, 0.12318683562482195, 0.09767017411199254, 0.04813335319771103, -0.09997465873701157, -0.27110524428352506, 0.3227293184420592, 0.05743716381700106, 0.35569026585156754, -0.025893092553072254, 0.17607903942419872, 0.015656896897191575, -0.031886127528170466, 0.0432934853654932, -0.05926721801154945, 0.12062478721187725, 0.19657115312949033, 0.14641086016716043, 0.31998770883385563, -0.37605519571774443, -0.19124819019573255, 0.07844121076009224, 0.06396037328358688, 0.0843342408852678, -0.05201880205717777, -0.2787280836254096, 0.09155761179822484, -0.13628305670556048, -0.103213559823032, -0.08958589311190684, -0.06458229077389648, 0.06472117400032953, -0.35073690704056915, 0.07277619178672518, 0.06969660649102338, 0.054149511099701196, -0.05078827664682405, -0.13405722949791596, 0.06656645087879413, 0.09698207795777371, 0.033570450553539355, -0.026204165379503663, 0.10110764907882877, -0.11600204029868186, -0.12160937509066622, 0.39211650358014544, -0.07645976645084963, -0.2573323545479019, 0.16865297971280213, -0.11669687987764327, -0.07646449431317898, 0.1798392692138113, 0.19685273014113935, 0.15228061089915237, -0.17601349730779167, 0.0803507554835089, -0.030655862527414108, 0.1294359363038355, 0.03237427881276104, 0.014184533674958569, 0.11621523019201843, 0.23703392454698471, 0.07268079658839065, 0.19154369615962807, -0.13860045925346792, -0.08007799645944853, -0.26370543165420984, -0.09225930196797134, -0.22184246067534868, -0.045794193042625844, -0.09914401835334835, -0.17862973152331904, 0.457307868545324, 0.20636544354312436, 0.16376737083478923, 0.0855048026915797, 0.36712483479313446, 0.10760415576149965, 0.014839535598761179, 0.05506739210875206, 0.18131779834733042, 0.1362632854126761, 0.05523927661288582, -0.24639848129443404, 0.09182433397050055, 0.07246389234779586] |
1,802.05594 | Prioritized Sweeping Neural DynaQ with Multiple Predecessors, and
Hippocampal Replays | During sleep and awake rest, the hippocampus replays sequences of place cells
that have been activated during prior experiences. These have been interpreted
as a memory consolidation process, but recent results suggest a possible
interpretation in terms of reinforcement learning. The Dyna reinforcement
learning algorithms use off-line replays to improve learning. Under limited
replay budget, a prioritized sweeping approach, which requires a model of the
transitions to the predecessors, can be used to improve performance. We
investigate whether such algorithms can explain the experimentally observed
replays. We propose a neural network version of prioritized sweeping
Q-learning, for which we developed a growing multiple expert algorithm, able to
cope with multiple predecessors. The resulting architecture is able to improve
the learning of simulated agents confronted to a navigation task. We predict
that, in animals, learning the world model should occur during rest periods,
and that the corresponding replays should be shuffled.
| cs.AI cs.NE | during sleep and awake rest the hippocampus replays sequences of place cells that have been activated during prior experiences these have been interpreted as a memory consolidation process but recent results suggest a possible interpretation in terms of reinforcement learning the dyna reinforcement learning algorithms use offline replays to improve learning under limited replay budget a prioritized sweeping approach which requires a model of the transitions to the predecessors can be used to improve performance we investigate whether such algorithms can explain the experimentally observed replays we propose a neural network version of prioritized sweeping qlearning for which we developed a growing multiple expert algorithm able to cope with multiple predecessors the resulting architecture is able to improve the learning of simulated agents confronted to a navigation task we predict that in animals learning the world model should occur during rest periods and that the corresponding replays should be shuffled | [['during', 'sleep', 'and', 'awake', 'rest', 'the', 'hippocampus', 'replays', 'sequences', 'of', 'place', 'cells', 'that', 'have', 'been', 'activated', 'during', 'prior', 'experiences', 'these', 'have', 'been', 'interpreted', 'as', 'a', 'memory', 'consolidation', 'process', 'but', 'recent', 'results', 'suggest', 'a', 'possible', 'interpretation', 'in', 'terms', 'of', 'reinforcement', 'learning', 'the', 'dyna', 'reinforcement', 'learning', 'algorithms', 'use', 'offline', 'replays', 'to', 'improve', 'learning', 'under', 'limited', 'replay', 'budget', 'a', 'prioritized', 'sweeping', 'approach', 'which', 'requires', 'a', 'model', 'of', 'the', 'transitions', 'to', 'the', 'predecessors', 'can', 'be', 'used', 'to', 'improve', 'performance', 'we', 'investigate', 'whether', 'such', 'algorithms', 'can', 'explain', 'the', 'experimentally', 'observed', 'replays', 'we', 'propose', 'a', 'neural', 'network', 'version', 'of', 'prioritized', 'sweeping', 'qlearning', 'for', 'which', 'we', 'developed', 'a', 'growing', 'multiple', 'expert', 'algorithm', 'able', 'to', 'cope', 'with', 'multiple', 'predecessors', 'the', 'resulting', 'architecture', 'is', 'able', 'to', 'improve', 'the', 'learning', 'of', 'simulated', 'agents', 'confronted', 'to', 'a', 'navigation', 'task', 'we', 'predict', 'that', 'in', 'animals', 'learning', 'the', 'world', 'model', 'should', 'occur', 'during', 'rest', 'periods', 'and', 'that', 'the', 'corresponding', 'replays', 'should', 'be', 'shuffled']] | [-0.046494940120416384, 0.09606383594917134, -0.1121516297198832, 0.07425708848174205, -0.13805554114553767, -0.1718809871437649, 0.09296547072008252, 0.4692740619630786, -0.2766364493655662, -0.33638137864666834, 0.08674711997775982, -0.2024078206727669, -0.19808757772669197, 0.17006058010272682, -0.1748265857528895, 0.06612542575846116, 0.1316163591404135, 0.08644563555096586, -0.001950845307437703, -0.3047706610461076, 0.21770729690324514, 0.05830409202103814, 0.2975914868960778, -0.03349615762514683, 0.12708393529057502, -0.04586331438117971, 0.008612526933817814, 0.012676433538241933, -0.056386860853478236, 0.10944225455944737, 0.32602864666531484, 0.22796276275999844, 0.36219670132733883, -0.486867620733877, -0.2320837763386468, 0.14078732874865332, 0.17928118518864114, 0.08828246854400883, -0.019170112051069735, -0.32921949808175366, 0.0963062774836241, -0.20738895488592485, -0.021450933044155438, -0.1203129467073207, -0.024288890408352016, 0.01231070124854644, -0.2873516037128866, -0.030373922800645232, 0.05293812716845423, 0.017173259989358484, -0.09362179618949691, -0.07631464721402154, 0.03525421315183242, 0.19097816278537114, 0.046731172819272616, 0.05836121568766733, 0.19330017008508246, -0.11677642705539862, -0.21486784057070812, 0.337218179491659, -0.02201317502806584, -0.1309976309662064, 0.21193464517282942, -0.040029769813021025, -0.15109690017377336, 0.12120299382600934, 0.26952701255329886, 0.09846921330938736, -0.15586322906116645, -0.03337466160378729, -0.004111942855330805, 0.1775320790708065, 0.050295748903105654, -0.03107508151171108, 0.16334428191029776, 0.24237996782641857, -0.011478467249156287, 0.1428195491929849, -0.08246463811645906, -0.12683245336986146, -0.1784169433770391, -0.09022480763650188, -0.16299326194295038, 0.002103622799428801, -0.04328977662429679, -0.1030392032302916, 0.3604778487359484, 0.2266843992533783, 0.2342053055095797, 0.10820266234067578, 0.3179432531973968, 0.05921470615935202, 0.13102750475596014, 0.1003480455368602, 0.2206011837814003, -0.0014393341727554799, 0.1883799536029498, -0.21291761725209654, 0.17035168378070617, 0.028226617655406395] |
1,802.05595 | Microfluidics in Late Adolescence | George Whitesides is a Woodford L. and Ann A. Flowers Professor at Harvard
University. In this contribution he describes the development of microfluidic
techniques, from the spark that ignited this branch of academic research and
its industrial sibling, to potential future application within medicine,
security and organic synthesis. The diversity in technologies as well as in
applications makes this an intriguing story, but it is in the simplest of
materials - paper - that we find some of the most successful applications so
far.
| physics.flu-dyn q-bio.OT | george whitesides is a woodford l and ann a flowers professor at harvard university in this contribution he describes the development of microfluidic techniques from the spark that ignited this branch of academic research and its industrial sibling to potential future application within medicine security and organic synthesis the diversity in technologies as well as in applications makes this an intriguing story but it is in the simplest of materials paper that we find some of the most successful applications so far | [['george', 'whitesides', 'is', 'a', 'woodford', 'l', 'and', 'ann', 'a', 'flowers', 'professor', 'at', 'harvard', 'university', 'in', 'this', 'contribution', 'he', 'describes', 'the', 'development', 'of', 'microfluidic', 'techniques', 'from', 'the', 'spark', 'that', 'ignited', 'this', 'branch', 'of', 'academic', 'research', 'and', 'its', 'industrial', 'sibling', 'to', 'potential', 'future', 'application', 'within', 'medicine', 'security', 'and', 'organic', 'synthesis', 'the', 'diversity', 'in', 'technologies', 'as', 'well', 'as', 'in', 'applications', 'makes', 'this', 'an', 'intriguing', 'story', 'but', 'it', 'is', 'in', 'the', 'simplest', 'of', 'materials', 'paper', 'that', 'we', 'find', 'some', 'of', 'the', 'most', 'successful', 'applications', 'so', 'far']] | [-0.02709543784205779, 0.0806210166435737, -0.060830262946759965, 0.029890981541162858, -0.11156891217091824, -0.13396171465084503, 0.03860479844421739, 0.348517686946363, -0.22983860679144016, -0.3095534748522701, 0.12189097021047662, -0.304221809659971, -0.21957393725425367, 0.2241885111959674, -0.13138302497667964, 0.012505641111269275, 0.042742355953811144, 0.021660163254681522, 0.007016122380907579, -0.24791894232990538, 0.22024074087782605, 0.09397211305161075, 0.33070600615734824, 0.10478564592578062, 0.05836610323408755, -0.010620246016670292, -0.010101305184567847, -0.06208090832820389, -0.09076054696978224, 0.1264063813610048, 0.3502181543082726, 0.20348025716432347, 0.3655881780517719, -0.3787830818626212, -0.18547818213190156, 0.06380957135044765, 0.13481151374914432, 0.11702715321708394, -0.11540546493388985, -0.2535033512565239, 0.043884913762889395, -0.21733773135716414, -0.14992501373152908, -0.008699343335337756, 0.09718300140371955, -0.0028639566380439735, -0.16858322179887625, -0.03278602994751276, 0.05093502962149725, 0.12205644729887931, 0.003950467439675022, -0.17272409524132565, 0.011374513246686903, 0.14926553590268624, 0.053960974413401835, 0.03774487158771968, 0.14888923725385855, -0.2049022569213199, -0.11933429132033957, 0.39917362063396267, -0.02676557106670083, -0.06240201663941417, 0.2191644235167698, -0.08842143329519142, -0.19316288960029984, 0.02690577043629274, 0.1772550438508028, 0.10025425329690844, -0.1725204942901278, 0.12781221255810546, -0.004677686209949415, 0.09110840033205998, 0.09058006380673317, -0.015111508313566446, 0.22114455576122896, 0.25047069356816526, 0.0081106643306046, 0.12217358548035163, -0.047520046213232886, -0.0704302407642145, -0.2508937753509821, -0.22232396846137395, -0.159455264810609, 0.05278717059778368, 0.0409983788542776, -0.17894396635635598, 0.3822878940348945, 0.1887582979695985, 0.11851870930730933, -0.07263773471321457, 0.2980933700029443, -0.022539898654497115, 0.08730913792941265, 0.06221349113734394, 0.2309576921813082, 0.1015856284761756, 0.23808046277021852, -0.12032724734219699, 0.08128925609379643, -0.00308227582221351] |
1,802.05596 | Order and Chaos: Collective Behavior of Crowded Drops in Microfluidic
Systems | Sindy Tang is assistant professor at in the Department of Mechanical
Engineering at Stanford University. In this contribution she describes how her
team uses droplet microfluidics to identify bacteria that could increase the
efficiency of generation of bioplastics, and how this work motivated them to
investigate the physics and design criteria necessary for further up-scaling of
the droplet technology.
| physics.flu-dyn cond-mat.soft q-bio.OT | sindy tang is assistant professor at in the department of mechanical engineering at stanford university in this contribution she describes how her team uses droplet microfluidics to identify bacteria that could increase the efficiency of generation of bioplastics and how this work motivated them to investigate the physics and design criteria necessary for further upscaling of the droplet technology | [['sindy', 'tang', 'is', 'assistant', 'professor', 'at', 'in', 'the', 'department', 'of', 'mechanical', 'engineering', 'at', 'stanford', 'university', 'in', 'this', 'contribution', 'she', 'describes', 'how', 'her', 'team', 'uses', 'droplet', 'microfluidics', 'to', 'identify', 'bacteria', 'that', 'could', 'increase', 'the', 'efficiency', 'of', 'generation', 'of', 'bioplastics', 'and', 'how', 'this', 'work', 'motivated', 'them', 'to', 'investigate', 'the', 'physics', 'and', 'design', 'criteria', 'necessary', 'for', 'further', 'upscaling', 'of', 'the', 'droplet', 'technology']] | [-0.02839875461186393, 0.109797380316087, -0.10552683786362789, -0.01009434983489435, -0.1284611948000729, -0.17102214171535382, 0.07293572948882514, 0.28070931603847926, -0.25394145022856734, -0.36830636353816015, 0.060031234693192576, -0.27308312184729816, -0.1632532867981847, 0.19686708021593297, -0.16391777495806248, 0.027684212520213452, 0.05284697829027486, -0.05105259686203326, 0.06493669456676028, -0.2684093138787075, 0.2406424241045774, 0.1297171554701813, 0.3675491797848273, 0.10993589735510996, 0.12611544183534334, 0.03659723883778867, -0.03726133126449787, -0.08740622319786226, -0.14801583887865644, 0.11541401296538317, 0.33959832709377347, 0.15837580369690718, 0.36189179140600863, -0.4179508815188024, -0.13647301394050404, 0.036487135641529396, 0.06995555084451276, 0.12507336320734377, -0.035179211310174124, -0.2535409507483749, 0.03633380494765164, -0.21186878056249628, -0.17026595545585377, -0.05653227387406563, 0.05249447952482408, -0.007110136774194948, -0.18629489660705045, 0.004216796166058314, 0.05981063104029429, 0.10709920745753383, -0.008377625405693711, -0.10844737921162682, 0.008819688032618013, 0.1879790826716413, 0.0003523782519150083, 0.0035787286015890414, 0.2206093754325362, -0.17560167985542094, -0.15362458859207268, 0.3785840983865625, -0.01040418490262355, -0.10203802369345548, 0.2198342276516102, -0.13474915708588847, -0.12510806037176211, 0.030418926636862048, 0.2568798764151032, 0.04795762937579114, -0.18213625299602243, 0.04371477663319684, 0.03417570217338912, 0.14410640738936045, 0.11170341040923308, -0.05817256990220335, 0.19263752044762594, 0.23806258267328395, 0.016871974645656044, 0.1615036040449799, -0.03627149540569902, -0.07107780108986012, -0.2656933154547745, -0.224642949683939, -0.17009022528842344, 0.02933143799871964, 0.059230910101609496, -0.06180889431734459, 0.41313533472307656, 0.20583926644807649, 0.04266226324805264, -0.04379864737896596, 0.24633313396598322, 0.00404126047042309, 0.03203522552625361, 0.03336053595767688, 0.24134626163769576, 0.08430401586248713, 0.25390924033472095, -0.28732420069212883, 0.06609796173870564, 0.042395064844039536] |
1,802.05597 | Theoretical aspects of microscale acoustofluidics | Henrik Bruus is professor of lab-chip systems and theoretical physics at the
Technical University of Denmark. In this contribution, he summarizes some of
the recent results within theory and simulation of microscale acoustofluidic
systems that he has obtained in collaboration with his students and
international colleagues. The main emphasis is on three dynamical effects
induced by external ultrasound fields acting on aqueous solutions and particle
suspensions: The acoustic radiation force acting on suspended micro- and
nanoparticles, the acoustic streaming appearing in the fluid, and the newly
discovered acoustic body force acting on inhomogeneous solutions.
| physics.flu-dyn q-bio.OT | henrik bruus is professor of labchip systems and theoretical physics at the technical university of denmark in this contribution he summarizes some of the recent results within theory and simulation of microscale acoustofluidic systems that he has obtained in collaboration with his students and international colleagues the main emphasis is on three dynamical effects induced by external ultrasound fields acting on aqueous solutions and particle suspensions the acoustic radiation force acting on suspended micro and nanoparticles the acoustic streaming appearing in the fluid and the newly discovered acoustic body force acting on inhomogeneous solutions | [['henrik', 'bruus', 'is', 'professor', 'of', 'labchip', 'systems', 'and', 'theoretical', 'physics', 'at', 'the', 'technical', 'university', 'of', 'denmark', 'in', 'this', 'contribution', 'he', 'summarizes', 'some', 'of', 'the', 'recent', 'results', 'within', 'theory', 'and', 'simulation', 'of', 'microscale', 'acoustofluidic', 'systems', 'that', 'he', 'has', 'obtained', 'in', 'collaboration', 'with', 'his', 'students', 'and', 'international', 'colleagues', 'the', 'main', 'emphasis', 'is', 'on', 'three', 'dynamical', 'effects', 'induced', 'by', 'external', 'ultrasound', 'fields', 'acting', 'on', 'aqueous', 'solutions', 'and', 'particle', 'suspensions', 'the', 'acoustic', 'radiation', 'force', 'acting', 'on', 'suspended', 'micro', 'and', 'nanoparticles', 'the', 'acoustic', 'streaming', 'appearing', 'in', 'the', 'fluid', 'and', 'the', 'newly', 'discovered', 'acoustic', 'body', 'force', 'acting', 'on', 'inhomogeneous', 'solutions']] | [-0.11130275614917852, 0.2041528183700783, -0.08372835629455909, -0.039296134131970806, -0.10797405168721146, -0.08401518962525117, -0.017262402268198248, 0.3106686171389871, -0.1950118578765746, -0.3229002384980629, 0.07798229594162287, -0.36004111535110317, -0.1640274394917619, 0.226797354383302, -0.04797504245876693, 0.03953458046909053, 0.05201071652757761, 0.03015217445995454, 0.06350407197017345, -0.20826080367787853, 0.32235896692273547, 0.10623316787142348, 0.2948037923037351, 0.07241984847728368, 0.11901510404525223, 0.031166792289446014, -0.08266361095625294, 0.024610888329334557, -0.13028246321458598, 0.10999236669350457, 0.22821612105510392, 0.044499643167460357, 0.27956655205119973, -0.4877081659141478, -0.23420749914002154, 0.005560592395140902, 0.05676260803682873, 0.11853743951440185, -0.12322297972207377, -0.34128810813302524, -0.004039856236796458, -0.15232412608156165, -0.11914511049002573, 0.0215716617128167, 0.056657636717248425, 0.08486582674815289, -0.15786788130567952, 0.07588130228507978, 0.05286191708304674, 0.14144035555156215, -0.12363556703388855, -0.13250558802878465, 0.02057699912872452, 0.13184876257430886, 0.06918710239415804, 0.021833487476764637, 0.20774056200848912, -0.1434691210461596, -0.09378064910952862, 0.4067671281377693, -0.06066026397248996, -0.13005539608715042, 0.25927690032084094, -0.16354605722865398, -0.08583502236697413, 0.06541649615494433, 0.23497396103710264, 0.0726629946160816, -0.14793328768420186, 0.11820033139032363, -0.0092217809786754, 0.13263833210138337, 0.12444142692538163, -0.04350939567538572, 0.19845225492103413, 0.18000523777867944, -0.050432555827793185, 0.08948420979604535, -0.031981357537046236, -0.06535275672449843, -0.2750442734418007, -0.1311623411519187, -0.15310799718353446, 0.02306359921387591, -0.0003978775364505434, -0.1323561277445201, 0.34438301481122335, 0.11477144244178147, 0.08851621410256805, -0.059953582498685015, 0.28541803055002796, 0.03131060570332601, 0.025198256412705223, 0.03190824818019602, 0.28041338415689776, 0.1659469312711895, 0.1941059200645803, -0.24053225757369956, 0.024207275482355156, 0.09703062316095763] |
1,802.05598 | The Development of Microfluidic Systems within the Harrison Research
Team | D. Jed Harrison is a full professor at the Department of Chemistry at the
University of Alberta. Here he describes the development of microfluidic
techniques in his lab from the initial demonstration of an integrated
separation system for samples in liquids to the recent development of methods
to fabricate crystalline packed beds with very low defect density.
| physics.flu-dyn q-bio.OT | d jed harrison is a full professor at the department of chemistry at the university of alberta here he describes the development of microfluidic techniques in his lab from the initial demonstration of an integrated separation system for samples in liquids to the recent development of methods to fabricate crystalline packed beds with very low defect density | [['d', 'jed', 'harrison', 'is', 'a', 'full', 'professor', 'at', 'the', 'department', 'of', 'chemistry', 'at', 'the', 'university', 'of', 'alberta', 'here', 'he', 'describes', 'the', 'development', 'of', 'microfluidic', 'techniques', 'in', 'his', 'lab', 'from', 'the', 'initial', 'demonstration', 'of', 'an', 'integrated', 'separation', 'system', 'for', 'samples', 'in', 'liquids', 'to', 'the', 'recent', 'development', 'of', 'methods', 'to', 'fabricate', 'crystalline', 'packed', 'beds', 'with', 'very', 'low', 'defect', 'density']] | [-0.04255540137130179, 0.14388987882161847, -0.1345973145012466, -0.055707607520417424, -0.011160956683421605, -0.1485724282745076, -0.000757380503050068, 0.3225221627048756, -0.2021100769276943, -0.35279116112934916, 0.07029242325459786, -0.2736758865219982, -0.07221291085149635, 0.18226650424236268, -0.08951629336367835, 0.06381002593001253, 0.0493432060701021, -0.04983722699985823, -0.05145882823292101, -0.2417234625144486, 0.232401264308576, 0.12450758933106013, 0.3444534243051812, 0.052610097354964205, 0.11412914224753254, 0.013250664738415364, 0.007982168787796246, -0.02963914736092352, -0.15885408289665193, 0.13155444173893907, 0.33619860157762704, 0.09408946979072011, 0.3008375175852786, -0.44839625684707834, -0.15245790679105803, -0.0292557836591936, 0.06751023621804882, 0.16233377619401404, -0.041801346280089205, -0.2682412485346982, 0.048807131649370776, -0.1843701843948414, -0.18246906755590125, 0.002629156093717667, 0.08584856165965137, -0.009266571100931941, -0.18341075361036419, -0.00026617682816689473, -0.015760984451493674, 0.14375039261945508, -0.05064447269889347, -0.15339067227640107, 0.003825108912822447, 0.12458049173450522, -0.04290202684831201, 0.02658290545693027, 0.19718513003828234, -0.17753228352593028, -0.10803758240664345, 0.3647745023563243, -0.022486628568322772, -0.06073533875965759, 0.27542962804600074, -0.19529757892157426, -0.1472315761901994, 0.14348437150188706, 0.21620573443278931, 0.09472180997724072, -0.13308388713681907, 0.06775768781376987, -0.0009950487241312338, 0.15794726297782177, 0.0731003485260564, -0.06531585239919654, 0.23921275959072405, 0.22849380991650386, -0.0041632245931970445, 0.11600469279086642, -0.07540880431208694, -0.03233485730168851, -0.24737332741272422, -0.23336104060147414, -0.2126429662631269, 0.04861179077507634, 0.04739053481209435, -0.17194185433745907, 0.3492960966143169, 0.10775490492386253, 0.11693826357000753, -0.044416955851933414, 0.2399066301030025, 0.009008250068546388, 0.05068619160406422, 0.031977773766572536, 0.19359315601136667, 0.16088762444754443, 0.23364988028218872, -0.2132371589888639, 0.0530028770889131, 0.030255871812665935] |
1,802.05599 | Electrochemical conversions in a microfluidic chip for xenobiotic
metabolism and proteomics | Albert van den Berg is a full professor on Miniaturized Systems for
(Bio)Chemical Analysis at at the University of Twente. In this contribution he
describes how microfluidic techniques can be used to mimic xenobiotic
metabolism in vitro. Similar devices can also be used to electrochemically
cleave proteins for mass spectrometric detection and database searching.
| physics.flu-dyn q-bio.OT | albert van den berg is a full professor on miniaturized systems for biochemical analysis at at the university of twente in this contribution he describes how microfluidic techniques can be used to mimic xenobiotic metabolism in vitro similar devices can also be used to electrochemically cleave proteins for mass spectrometric detection and database searching | [['albert', 'van', 'den', 'berg', 'is', 'a', 'full', 'professor', 'on', 'miniaturized', 'systems', 'for', 'biochemical', 'analysis', 'at', 'at', 'the', 'university', 'of', 'twente', 'in', 'this', 'contribution', 'he', 'describes', 'how', 'microfluidic', 'techniques', 'can', 'be', 'used', 'to', 'mimic', 'xenobiotic', 'metabolism', 'in', 'vitro', 'similar', 'devices', 'can', 'also', 'be', 'used', 'to', 'electrochemically', 'cleave', 'proteins', 'for', 'mass', 'spectrometric', 'detection', 'and', 'database', 'searching']] | [-0.01516594437284852, 0.11225333310804277, -0.07538331777103385, 0.05069318776159495, -0.06744366429113555, -0.19649960802657143, 0.007677438194459339, 0.35072470554765667, -0.1990220430054491, -0.31278945639167194, 0.02647241878758167, -0.30124742889179373, -0.21108403271239884, 0.2756615752740851, -0.13461210178914215, 0.031129419065590174, 0.07143326539915267, -0.0493509248250498, 0.07842628605101469, -0.21892634518268816, 0.1826485493220389, 0.1325192391028944, 0.2961872985481091, 0.07727386335016422, 0.04657041572280369, 0.015722667227305892, 0.008231292777466323, -0.014831294762497803, -0.15043970049833352, 0.09432601700273324, 0.369366216420565, 0.10735310004356335, 0.2763349488992595, -0.44319119181413696, -0.17709940942531488, 0.09500728331435963, 0.1467280587322026, 0.17823589738142095, -0.04049735150150603, -0.30843806683244007, 0.07766476335039116, -0.1756488274105271, -0.09615202985658916, -0.08226541336625814, 0.025381530573556445, 0.04461558674514856, -0.21045411009130613, 0.05888075931030677, -0.04188139680421577, 0.11866124581440159, -0.047225220229109875, -0.111091554239568, 0.007256508418271002, 0.17167583096526423, -0.09052605001378874, -0.0029632775376568425, 0.2565103125459743, -0.06374631366551907, -0.10595871420809999, 0.3463088728417203, -0.04456812415693728, -0.1212865856458556, 0.22720549068905693, -0.06516583936886405, -0.19178602398144748, 0.09388702672045186, 0.213988507895748, 0.0795765625102059, -0.2176480297139793, 0.07038866967415297, 0.005894548312391875, 0.15966744211344225, 0.16866039224781693, -0.09089035807915453, 0.23015837455695531, 0.20911838915550485, -0.052853967990058495, 0.07675045670256159, -0.07297841306195928, 0.009486136834998176, -0.17106979024016633, -0.2180211402756988, -0.15907903484789268, 0.08035850646369651, 0.03654870389162273, -0.13206651147876708, 0.33180738563807505, 0.12158014287926117, 0.11489654274212299, -0.03697314246048061, 0.21470841029571053, -0.004500524300141787, 0.14503632877724912, -0.030717937565707374, 0.21774493670310685, 0.135998264763434, 0.2327686628801221, -0.2311373491187246, 0.10668886810506009, 0.06656782515347004] |
1,802.056 | "Extreme" Microfluidics: Large-volumes and Complex Fluids | Mehmet Toner is the Helen Andrus Benedict Professor of Biomedical Engineering
at the Massachusetts General Hospital (MGH), Harvard Medical School, and
Harvard - MIT Health Sciences & Technology. Here he describes his labs efforts
to advance the field of microfluidics to process large-volumes of fluids.
Although somewhat counterintuitive, this approach has found a broad interest in
both academia and industry at an unprecedented rate due to its broad range of
utility in medical and industrial applications.
| physics.flu-dyn q-bio.OT | mehmet toner is the helen andrus benedict professor of biomedical engineering at the massachusetts general hospital mgh harvard medical school and harvard mit health sciences technology here he describes his labs efforts to advance the field of microfluidics to process largevolumes of fluids although somewhat counterintuitive this approach has found a broad interest in both academia and industry at an unprecedented rate due to its broad range of utility in medical and industrial applications | [['mehmet', 'toner', 'is', 'the', 'helen', 'andrus', 'benedict', 'professor', 'of', 'biomedical', 'engineering', 'at', 'the', 'massachusetts', 'general', 'hospital', 'mgh', 'harvard', 'medical', 'school', 'and', 'harvard', 'mit', 'health', 'sciences', 'technology', 'here', 'he', 'describes', 'his', 'labs', 'efforts', 'to', 'advance', 'the', 'field', 'of', 'microfluidics', 'to', 'process', 'largevolumes', 'of', 'fluids', 'although', 'somewhat', 'counterintuitive', 'this', 'approach', 'has', 'found', 'a', 'broad', 'interest', 'in', 'both', 'academia', 'and', 'industry', 'at', 'an', 'unprecedented', 'rate', 'due', 'to', 'its', 'broad', 'range', 'of', 'utility', 'in', 'medical', 'and', 'industrial', 'applications']] | [0.009868921267695095, 0.0645823898369817, -0.059156464160301944, -0.008645255583321838, -0.12319479279325042, -0.1466634928209471, 0.027368190540919, 0.3705598472709387, -0.1967182952753255, -0.3359726166851084, 0.10202609641070833, -0.3014578711320187, -0.14071876736698855, 0.2556804972635189, -0.20746031926262756, 0.021651030084426502, 0.047937537684485734, 0.0036767772595647356, 0.03490639413693841, -0.29185248564430316, 0.19602764597241307, 0.10028668660932863, 0.42703091876227145, 0.1667671898030676, 0.07577622926492296, 0.02547989379693295, -0.032256640874269146, -0.06095684453530211, -0.11592288487459677, 0.1478401271259071, 0.4493221108552436, 0.19269386852081394, 0.44822739628078023, -0.361532301720704, -0.19611309745847444, 0.012025788124703186, 0.051581479174504716, 0.08863242999933378, -0.06462108547156545, -0.3204770383857925, -0.028130903144852375, -0.22829571579464933, -0.14437283220058175, 0.0025791697479574612, 0.11155585370282314, -0.049854629233636906, -0.1859685012441076, 0.032222493092568825, -0.026857151374430725, 0.23068981469464553, -0.046178880250934036, -0.18241192381271543, 0.018673241341775153, 0.18431835181512674, 0.0518453034050074, 0.07286168771966452, 0.1791290499427369, -0.21683645119536404, -0.11981996777139499, 0.42916576506596216, 0.011466746139799205, 0.0026365163617990384, 0.2530024596621138, -0.15135955982382449, -0.15003583499748574, 0.05805848182087213, 0.2621507788680389, 0.07666896858816626, -0.21900221374882778, 0.12815659619543152, 0.03508970180762486, 0.10012225565684199, 0.10529682976784001, -0.06703592688878211, 0.20045521627114693, 0.16184379025624776, -0.0402232309226209, 0.05138284273603013, -0.04489040857469532, -0.08071758106193493, -0.17972402201480114, -0.19734428258953798, -0.14521340092211227, 0.03963410035497181, 0.024394872631757967, -0.14943824729449312, 0.3448504404177968, 0.187184916914139, 0.014696715202864627, -0.09763061062721404, 0.24723952926505147, 0.010567664877104928, 0.03215956110113733, 0.032726472138728896, 0.20171811740177695, 0.12280343284069652, 0.3582609785248486, -0.13106601783828678, 0.08614331809803843, -0.07274308815126268] |
1,802.05601 | Solving the Tyranny of Pipetting | Stephen Quake is the Lee Otterson Professor of Bioengineering and Applied
Physics at Stanford University. Here he reviews the early history of
microfluidics and discusses more recent developments, with a focus on
applications in biology and biochemistry.
| physics.flu-dyn q-bio.OT | stephen quake is the lee otterson professor of bioengineering and applied physics at stanford university here he reviews the early history of microfluidics and discusses more recent developments with a focus on applications in biology and biochemistry | [['stephen', 'quake', 'is', 'the', 'lee', 'otterson', 'professor', 'of', 'bioengineering', 'and', 'applied', 'physics', 'at', 'stanford', 'university', 'here', 'he', 'reviews', 'the', 'early', 'history', 'of', 'microfluidics', 'and', 'discusses', 'more', 'recent', 'developments', 'with', 'a', 'focus', 'on', 'applications', 'in', 'biology', 'and', 'biochemistry']] | [0.02348329506154793, 0.12447902249793212, -0.05712356268971538, 0.007641273592728087, -0.12393887941208151, -0.14178299618005338, -0.05042543888299002, 0.24753158094568384, -0.17225433081491953, -0.33072819873794085, 0.13627702468915637, -0.3109801391967469, -0.2098499686560697, 0.2779147565468318, -0.17513044768323502, -0.016419243170983262, 0.08315484877675772, 0.013590085682355695, 0.02447125100944605, -0.316619672657301, 0.22320483324842322, 0.16538354200828406, 0.3362069802177656, 0.1352720810359137, 0.09564617736678985, 0.039866945111296244, -0.14426498280631173, -0.08458894418759479, -0.16152235674154428, 0.150217145603771, 0.34548989719607764, 0.26136842601570404, 0.4027170803811815, -0.4683171953074634, -0.2285785031142748, -0.012579503443299068, 0.016310282646574907, 0.15275366813875735, -0.12765805665023638, -0.2927206024113629, -0.04258402139465842, -0.177993501122627, -0.06493467700460719, 0.029750973206116922, 0.15081382584240702, 0.013501268695108593, -0.10812052147876886, 0.037198579262217715, 0.022068227408453822, 0.21380267487580162, 0.032836129248607904, -0.2063242028363877, 0.07025099042544349, 0.10670883662533015, 0.024625169494861945, 0.0733201402084281, 0.18417416507792142, -0.2335678891071843, -0.2102137574305137, 0.40316742327478194, -0.04135812518911229, 0.01904934836137626, 0.29278163760641795, -0.12869836878962815, -0.21660136062807092, -0.04141482302091188, 0.23091206761697927, 0.08584995640234815, -0.15082188398163351, 0.2175864774892236, 0.052896987569207944, 0.06877474497175878, 0.1423341890072657, -0.10082785917135577, 0.2518829657023566, 0.2173821911112302, -0.09113140777400178, 0.05349927398169206, -0.023545091648379132, -0.12012475457352896, -0.1846576268888182, -0.17262283146070936, -0.11780001119607025, 0.07439293751182656, 0.134465940802329, -0.06927776290103793, 0.3853388059263428, 0.17567513663218254, 0.10127388980860512, -0.12281602344268726, 0.2103031860767967, -0.07733127454088794, -0.04057602806844645, 0.06729957967763767, 0.18203298885621028, 0.2065110982188748, 0.32685315418833244, -0.18120302814835063, 0.04934008101635198, 0.03724283862134649] |
1,802.05602 | Moving microfluidics ahead: Extending capabilities, accessibility, and
applications | Paul Blainey is professor of Biological Engineering at MIT. In this
contribution he describes three microfluidic technologies that he and his team
has developed to extend the capability, accessibility, and applications of
microfluidics: (1) Integrated microfluidic sample preparation for genomic
assays, (2) hydrogel-based microfluidics for single-cell genome sequencing, and
(3) an emulsion-based system for combinatorial drug screening.
| physics.flu-dyn q-bio.OT | paul blainey is professor of biological engineering at mit in this contribution he describes three microfluidic technologies that he and his team has developed to extend the capability accessibility and applications of microfluidics 1 integrated microfluidic sample preparation for genomic assays 2 hydrogelbased microfluidics for singlecell genome sequencing and 3 an emulsionbased system for combinatorial drug screening | [['paul', 'blainey', 'is', 'professor', 'of', 'biological', 'engineering', 'at', 'mit', 'in', 'this', 'contribution', 'he', 'describes', 'three', 'microfluidic', 'technologies', 'that', 'he', 'and', 'his', 'team', 'has', 'developed', 'to', 'extend', 'the', 'capability', 'accessibility', 'and', 'applications', 'of', 'microfluidics', '1', 'integrated', 'microfluidic', 'sample', 'preparation', 'for', 'genomic', 'assays', '2', 'hydrogelbased', 'microfluidics', 'for', 'singlecell', 'genome', 'sequencing', 'and', '3', 'an', 'emulsionbased', 'system', 'for', 'combinatorial', 'drug', 'screening']] | [-0.0013369763161920542, 0.12312047604505746, 0.006227967691042328, -0.013377184678185066, -0.036337738657104116, -0.23842843745036849, 0.012058733010365228, 0.3398382430896163, -0.22054425394162536, -0.2895324542956327, 0.0629603075722116, -0.28535044921695124, -0.1556511808718954, 0.2277709568983742, -0.1585666987271647, 0.08205012730988008, 0.09291069585430835, -0.08985044665418432, 0.14912620742493995, -0.25098328684855786, 0.19276936927261495, 0.05556226897585605, 0.3409693142623707, 0.10817837498949043, 0.1369200251231502, 0.04916766689608006, -0.04941365122795105, -0.04145468424706321, -0.19080748405355866, 0.16863755161674426, 0.3882140794968499, 0.2250845118957971, 0.3831711391436069, -0.427533241952785, -0.20401013212228594, 0.047299532020198445, 0.15598106184708221, 0.18330053072090127, -0.10170344023000714, -0.2499776312366261, 0.04634623313488971, -0.17601253432388017, -0.10608270423420306, -0.0476835616864264, 0.10435946121080113, 0.015423387056216598, -0.2051447883381375, 0.007529075739772192, -0.00931709774886258, 0.20124658900645695, -0.04728350355123569, -0.17347433209111582, 0.08563261804270692, 0.19874837326018938, -0.03327229049006876, 0.02796729150369564, 0.27143308324074106, -0.12417367575939611, -0.14545576776643948, 0.3151455423794687, 0.021568744247945557, -0.09924424191870328, 0.23357153225723387, -0.0793698143513341, -0.17140430871638404, 0.09722245115387652, 0.19002897004663413, 0.014822861645370722, -0.26096057056981536, 0.09731826273179779, 0.0729783171721335, 0.16692088832080895, 0.1682617378121774, -0.045004191617148796, 0.15112487838736602, 0.270188441134191, 0.014661264223312693, 0.07716964018930282, -0.09901321839009013, -0.02339796958092068, -0.19388522507090653, -0.2776562811673752, -0.14319498171763761, 0.05708752494371895, -0.006535146035405758, -0.14692213812044688, 0.3272987883870623, 0.09133741437524025, 0.022586738119051524, 0.01623243576614186, 0.23248956325863088, -0.09588403968310948, 0.10054708951689204, -0.08606298301310744, 0.13621106219943613, 0.12698925734730437, 0.2899175867039178, -0.23511605223341445, 0.05493443169897156, 0.0006628555642497044] |
1,802.05603 | Microfluidics for Ultra High-Throughput Experimentation: Droplets, Dots
& Photons | Andrew J. deMello is professor of Biochemical Engineering in the Department
of Chemistry and Applied Biosciences at ETH Z\"urich. In this contribution he
describes the efforts that his lab has undertaken in developing novel
microfluidic systems for molecular and nanomaterial synthesis, droplet-based
systems for ultra-high-throughput experimentation and novel optical techniques
for sensitive and rapid analysis in small volume environments.
| physics.flu-dyn q-bio.OT | andrew j demello is professor of biochemical engineering in the department of chemistry and applied biosciences at eth zurich in this contribution he describes the efforts that his lab has undertaken in developing novel microfluidic systems for molecular and nanomaterial synthesis dropletbased systems for ultrahighthroughput experimentation and novel optical techniques for sensitive and rapid analysis in small volume environments | [['andrew', 'j', 'demello', 'is', 'professor', 'of', 'biochemical', 'engineering', 'in', 'the', 'department', 'of', 'chemistry', 'and', 'applied', 'biosciences', 'at', 'eth', 'zurich', 'in', 'this', 'contribution', 'he', 'describes', 'the', 'efforts', 'that', 'his', 'lab', 'has', 'undertaken', 'in', 'developing', 'novel', 'microfluidic', 'systems', 'for', 'molecular', 'and', 'nanomaterial', 'synthesis', 'dropletbased', 'systems', 'for', 'ultrahighthroughput', 'experimentation', 'and', 'novel', 'optical', 'techniques', 'for', 'sensitive', 'and', 'rapid', 'analysis', 'in', 'small', 'volume', 'environments']] | [-0.04056526723791633, 0.09992086349806764, -0.08354621890752592, -0.016255330896871, -0.02987685284920429, -0.1708429083881671, 0.043079438116891605, 0.32976126729657773, -0.18751968639461616, -0.3186435682271207, 0.08478661668241809, -0.24469278808356376, -0.16872377853775233, 0.2477683954986564, -0.09807829549045939, 0.07178673971640437, 0.07665026070255983, -0.135480326093864, 0.04598831163572246, -0.20557321818839563, 0.2187601853521508, 0.10480142335750554, 0.35069608903876015, 0.10410653882284175, 0.07966139859912034, 0.04239310503920965, -0.0803309143888519, -0.04689140789406864, -0.12849331541426517, 0.13736229203641415, 0.3725330645970085, 0.17528033753236136, 0.3655682789292513, -0.4616196017320219, -0.19677579690489852, 0.04306409498186488, 0.07204001065621381, 0.1318738603588651, -0.1056738325574419, -0.27252822936300125, 0.016958359628915787, -0.17148237889877668, -0.1369016689346417, -0.08167359768413007, 0.11480053836937275, -0.012544503876645314, -0.18204928421529762, 0.004260735520929621, -0.0002787828275917523, 0.22349767542950677, -0.0232207104727103, -0.16693390660772198, 0.07047835871855025, 0.16131202920683121, -0.06847696300604168, 0.02851760385786755, 0.20435684255994202, -0.1539408331042515, -0.09001009397437437, 0.3911294114628905, -0.033687233855425006, -0.06744263644673322, 0.29245035454075324, -0.0954890918934293, -0.254989840566148, 0.10201244601947174, 0.24037280788220333, 0.07974603646353148, -0.20020161208026765, 0.1354667865548675, 0.030875728857752523, 0.13408046150416658, 0.03954839487478398, -0.06759347824641225, 0.1940415367737347, 0.21412958863207646, -0.005082576993133938, 0.08858528064886566, -0.04360391532904223, -0.07009165393384664, -0.19513685504595438, -0.243270032238542, -0.17845675166238817, 0.03720648936608708, 0.08303869737152893, -0.10975810265160378, 0.35918606216447396, 0.14800560938014665, 0.02422145500250943, -0.05728175910189748, 0.24606779453001523, 0.028181579600194503, 0.0773622758580339, 0.042411147183820344, 0.20538010101218038, 0.12244079801204957, 0.2971654144164763, -0.21432807344510302, 0.08262738879522913, 0.020962175422985303] |
1,802.05604 | Adventures with Micro- and Nanofabricated Devices for Chemical and
Biochemical Measurements; Early Days to Present! | J. Michael Ramsey holds the Minnie N. Goldby Distinguished Professor of
Chemistry Chair at the University of North Carolina - Chapel Hill. Here he
describes the development of micro- and nanofabricated devices in his lab from
the early developments that lead into the commercialization of the first active
control microfluidic device by Caliper Technologies and the follow-on micro-
and nanoscale devices with associated commercialization efforts.
| physics.flu-dyn q-bio.OT | j michael ramsey holds the minnie n goldby distinguished professor of chemistry chair at the university of north carolina chapel hill here he describes the development of micro and nanofabricated devices in his lab from the early developments that lead into the commercialization of the first active control microfluidic device by caliper technologies and the followon micro and nanoscale devices with associated commercialization efforts | [['j', 'michael', 'ramsey', 'holds', 'the', 'minnie', 'n', 'goldby', 'distinguished', 'professor', 'of', 'chemistry', 'chair', 'at', 'the', 'university', 'of', 'north', 'carolina', 'chapel', 'hill', 'here', 'he', 'describes', 'the', 'development', 'of', 'micro', 'and', 'nanofabricated', 'devices', 'in', 'his', 'lab', 'from', 'the', 'early', 'developments', 'that', 'lead', 'into', 'the', 'commercialization', 'of', 'the', 'first', 'active', 'control', 'microfluidic', 'device', 'by', 'caliper', 'technologies', 'and', 'the', 'followon', 'micro', 'and', 'nanoscale', 'devices', 'with', 'associated', 'commercialization', 'efforts']] | [-0.0947102366105443, 0.18062367919464445, -0.07265920838296053, -0.09876518846572106, -0.07481288538885213, -0.20693527928162966, 0.042586611516232935, 0.27860645544264584, -0.18997189353009866, -0.335517861790234, 0.099695282246572, -0.30158974432326374, -0.15146064458249678, 0.21432809777663, -0.13648088534002104, 0.009094356559216976, 0.03935179806825134, -0.06199748781059058, 0.05754988194788776, -0.21649500385167136, 0.19145637213612995, 0.10334239989770727, 0.35250797779759346, 0.07682278158233291, 0.1225552039874357, 0.03130508423782885, -0.03588835831971899, -0.04884082501033141, -0.149006785784173, 0.16284943011968636, 0.32674550760777726, 0.14549345194151805, 0.37809907037374235, -0.5200034792745306, -0.12799880201477679, -0.0053833303737196875, 0.05870007561339486, 0.04800940231390057, -0.07386922097254184, -0.33917285844443307, 0.007249065637288075, -0.19377832929979288, -0.1665212135802346, 0.036403719651242415, 0.06319093943813876, 0.041280227735818874, -0.11066638738397629, -0.04135634647982736, 0.0323310456869583, 0.12806607465890626, -0.019050828637949553, -0.17681956048604222, 0.01679185581123156, 0.1760841522425894, -0.07109567677093764, 0.021876719322115663, 0.2136291703209281, -0.15081381767747865, -0.17369008038733755, 0.366343567311208, 0.010696902750961242, 0.008221188259701575, 0.16757048644508504, -0.1948081786939574, -0.12033296315067057, 0.05403709325999502, 0.1844161673328809, 0.08235935028642416, -0.13292673299973454, 0.10809311617424922, 0.03538837678910744, 0.08366633449200421, 0.14133036121605866, 0.0027925457219563185, 0.2488851605674192, 0.20754034531813476, 0.019895044376983518, 0.07270785664478617, -0.08953473479731099, -0.06978819131731026, -0.21166645985231886, -0.2471581092705169, -0.15009572783545141, 0.07279986159635647, 0.04376476580317455, -0.07563395316772643, 0.34557050929194494, 0.12543953074923447, 0.05146048794830999, -0.08658085832552563, 0.25787301067142715, -0.056052091666647506, 0.09494549099115594, 0.04434738060714857, 0.21698130996552326, 0.14331754774696404, 0.2629616765846168, -0.2200391244991953, 0.05809396550372889, 0.02288800635705552] |
1,802.05605 | Achieving Analytical and Cellular Control in Confined Spaces and
Continuous Flow | Sabeth Verpoorte is professor at the University of Groningen. In this
contribution she describes the development of a microfluidic incubation system
for drug metabolism studies using a "top-down" precision-cut tissue slice
model. She also outlines a fundamental particle separation concept, which
relies on the generation of controlled bi-directional flow in microchannels
having variable cross-sectional dimensions, by opposing pressure-driven and
electrokinetic flows.
| physics.flu-dyn q-bio.OT | sabeth verpoorte is professor at the university of groningen in this contribution she describes the development of a microfluidic incubation system for drug metabolism studies using a topdown precisioncut tissue slice model she also outlines a fundamental particle separation concept which relies on the generation of controlled bidirectional flow in microchannels having variable crosssectional dimensions by opposing pressuredriven and electrokinetic flows | [['sabeth', 'verpoorte', 'is', 'professor', 'at', 'the', 'university', 'of', 'groningen', 'in', 'this', 'contribution', 'she', 'describes', 'the', 'development', 'of', 'a', 'microfluidic', 'incubation', 'system', 'for', 'drug', 'metabolism', 'studies', 'using', 'a', 'topdown', 'precisioncut', 'tissue', 'slice', 'model', 'she', 'also', 'outlines', 'a', 'fundamental', 'particle', 'separation', 'concept', 'which', 'relies', 'on', 'the', 'generation', 'of', 'controlled', 'bidirectional', 'flow', 'in', 'microchannels', 'having', 'variable', 'crosssectional', 'dimensions', 'by', 'opposing', 'pressuredriven', 'and', 'electrokinetic', 'flows']] | [-0.08481957090633183, 0.19379569082681475, -0.07292977419023498, -0.03706573004481094, -0.07547030178830028, -0.18665943611894958, 0.021769569801359342, 0.3280602391038475, -0.2351446058761714, -0.24180534607249088, 0.08237743614831586, -0.25010043605840926, -0.1692002680843118, 0.20283158698946174, -0.1178985557775816, 0.020949514374008466, 0.04323317375483698, -0.05562347151612028, 0.08039996747714306, -0.17262636695121383, 0.24078512504889532, 0.04332397669425298, 0.3736991601000572, 0.08913142523118134, 0.21555820934410239, 0.06118960071210589, -0.06453429561927272, 0.006140436286684768, -0.16534108942342474, 0.14077452839962368, 0.24842192857638642, 0.06333832939733462, 0.3233403396744538, -0.4523680841686718, -0.2608149108027333, -0.029163731470832538, 0.12260152739954405, 0.14302653567825346, -0.0695729027281451, -0.23387041185372348, 0.021146289667050386, -0.1893192838620523, -0.09888607805498459, 0.008540181878649083, 0.026144732664949422, 0.006117840859525162, -0.21239245946294275, 0.08519587165963081, 0.062214585695544194, 0.16546289012606802, -0.03706512948225156, -0.07753875023677367, -0.005963104319405453, 0.1490158198064129, 0.04303650395214108, 0.01761537551044904, 0.2640977508844085, -0.16494332115438864, -0.14710265963241972, 0.33356541271546275, -0.02966518321572321, -0.2108969115491571, 0.18516084683681677, -0.13590520112132976, -0.0878949846880679, 0.1160217903249351, 0.24385739921527946, 0.10631722406130927, -0.2007063946461883, 0.014866154527508429, -0.030660426501056243, 0.15022372043338314, 0.11869327831563764, -0.11986851942693365, 0.23530978266278219, 0.2904790540001002, 0.03404905773891971, 0.1409823077184887, -0.08899763580170814, -0.09666352447700398, -0.2782073190098564, -0.23549187033244506, -0.1423433101896582, 0.04197555821356845, -0.0110804012588703, -0.156794533061249, 0.41082310305651404, 0.07833022672426083, 0.09505099523210384, -0.021034465185446858, 0.28797286177246734, 0.008636860914552456, 0.06294053042275381, 0.025122879723343868, 0.15890976683846836, 0.10554366891176023, 0.24924724973770307, -0.25507983656857036, 0.12612186015005514, 0.10828749225515037] |
1,802.05606 | Microfluidic methods to form artificial cells and to study basic
functions of membranes | Petra S. Dittrich is associate professor for Bioanalytics at the Department
of Biosystems Science and Engineering at ETH Z\"urich. Here she describes the
microfluidic devices that her lab develops to facilitate comprehensive studies
on membranes with high resolution imaging techniques.
| physics.flu-dyn q-bio.OT | petra s dittrich is associate professor for bioanalytics at the department of biosystems science and engineering at eth zurich here she describes the microfluidic devices that her lab develops to facilitate comprehensive studies on membranes with high resolution imaging techniques | [['petra', 's', 'dittrich', 'is', 'associate', 'professor', 'for', 'bioanalytics', 'at', 'the', 'department', 'of', 'biosystems', 'science', 'and', 'engineering', 'at', 'eth', 'zurich', 'here', 'she', 'describes', 'the', 'microfluidic', 'devices', 'that', 'her', 'lab', 'develops', 'to', 'facilitate', 'comprehensive', 'studies', 'on', 'membranes', 'with', 'high', 'resolution', 'imaging', 'techniques']] | [-0.03181075939956384, 0.12973695813128963, -0.1105715177463702, -0.033195800825547524, -0.10748786873255785, -0.24188924103211135, 0.036199948631035976, 0.34531374896566075, -0.20695474254301724, -0.33157557993231773, 0.060261011840059206, -0.35913747319808376, -0.09534939722372936, 0.20354527486965823, -0.12007476966111706, -0.0060080100710575395, 0.0983186787328659, -0.055708022931447394, 0.025947916948308166, -0.20149516051587385, 0.18059989762229797, 0.15093219538147634, 0.40167077538820034, 0.09417120515344998, 0.14110082613590819, 0.08036133236227891, -0.03586454240557475, -0.08356300074583253, -0.16759743035911995, 0.0730744081382186, 0.3861980944489821, 0.171990462184812, 0.35849835397675633, -0.4614465821725436, -0.16626683682298812, -0.027390749122087773, 0.027999491550219364, 0.06842968756189713, -0.029820433447662838, -0.26964797912977445, 0.05972460953470988, -0.14552717179489824, -0.16326707658225084, -0.03506355978644047, 0.054433381459556326, -0.04358079696360689, -0.1803811568623552, -0.017109773754595946, -0.0503854594933681, 0.24317939301284078, -0.019523147987992838, -0.137039505972121, 0.022945975335553672, 0.12962248391256884, -0.08267115701873524, 0.028410491581337575, 0.1912919369359047, -0.1730469053488774, -0.17090103651086488, 0.3164739784283134, 0.009150787232778011, -0.03175871439564686, 0.25777315204509366, -0.19987280604739985, -0.19411076373683336, 0.0665456468764788, 0.22385839716746256, 0.06096693207151615, -0.13476880642179495, 0.1244109230913007, 0.023175797974451993, 0.14737803823290727, 0.09006868448490515, -0.03851838198562081, 0.21680297129429305, 0.2050733594940259, 0.013649621835121742, 0.06689864303916693, -0.0758105944065998, 0.011268467309538467, -0.25805064797019345, -0.24605658089216703, -0.18836304306601867, 0.08095669347601823, 0.13013480773280697, -0.06930274884097087, 0.3568292107815162, 0.15974678908689663, 0.030045188115670893, -0.0680537847085641, 0.23148982341472918, 0.012375464686789574, 0.08968510646492434, 0.014319525804752722, 0.17038743459703162, 0.06609133613080932, 0.32417024181296045, -0.23573726609958193, 0.05349283381171214, -0.004660017477969329] |
1,802.05607 | Microfluidics Development at Berkeley | Richard A. Mathies is professor emeritus of Chemistry at the University of
California, Berkeley. In this contribution he summarizes his journey through
microfluidics over the past 30 years from the invention of Capillary Array
Electrophoresis in the 1990s to recent attempts to launch a microfluidic system
into space.
| physics.flu-dyn q-bio.OT | richard a mathies is professor emeritus of chemistry at the university of california berkeley in this contribution he summarizes his journey through microfluidics over the past 30 years from the invention of capillary array electrophoresis in the 1990s to recent attempts to launch a microfluidic system into space | [['richard', 'a', 'mathies', 'is', 'professor', 'emeritus', 'of', 'chemistry', 'at', 'the', 'university', 'of', 'california', 'berkeley', 'in', 'this', 'contribution', 'he', 'summarizes', 'his', 'journey', 'through', 'microfluidics', 'over', 'the', 'past', '30', 'years', 'from', 'the', 'invention', 'of', 'capillary', 'array', 'electrophoresis', 'in', 'the', '1990s', 'to', 'recent', 'attempts', 'to', 'launch', 'a', 'microfluidic', 'system', 'into', 'space']] | [-0.027923364667816364, 0.1389262449551136, -0.13958855289866792, -0.11466281608173108, -0.12062229964624535, -0.07244975886684149, 0.03487013006939533, 0.2814373051391003, -0.20809031837679287, -0.3524940863568732, 0.09073630254220297, -0.31798277904299344, -0.11949478882424375, 0.21581907864248856, -0.1553761359066405, 0.0027253732600427687, 0.10868131555616856, -0.0539039361756295, 0.032517278428248905, -0.35114122939078096, 0.18966036708034734, 0.1633808971085447, 0.28693019412457943, 0.06665976365354467, 0.1506985009231783, 0.020064403228659895, -0.09276035380490283, -0.06975931449399449, -0.13033516978488324, 0.09705429922472289, 0.3312768017120184, 0.18763651197498782, 0.40939079756115343, -0.4640455346237472, -0.2169959578072365, -0.008525404722449626, 0.05694894978102851, 0.10614835252945727, -0.022045778586192333, -0.3411225529110178, -0.05513220619251753, -0.24799177216544271, -0.10747090162352678, 0.10844995740038205, 0.14566255454964777, -0.025535669633524216, -0.07688016147214047, -0.034183102342835135, -0.010388489119074445, 0.18213557963200072, 0.0032944182142060486, -0.14013772987651618, 0.07375767413883451, 0.1609572812201495, 0.04070282711132251, 0.11578475723558283, 0.15388404229219924, -0.1390863715007188, -0.09558773521294302, 0.3649302494731989, -0.04221477602085871, 0.03610291758036994, 0.21333256511493248, -0.2004983040523973, -0.13181815272880756, 0.15019680084437725, 0.22150615684702332, 0.05020443480858143, -0.15916777997738385, 0.1175141127363957, -0.028191038456923785, 0.07206182299241265, 0.19144012349003808, -0.11770471391525675, 0.2538376057797924, 0.21640771896915234, -0.05551753726173589, 0.10382691010872418, -0.10440047426109618, -0.12010125895129874, -0.2396587041489027, -0.24796541746051864, -0.13310665403433303, 0.06167951632944986, 0.11512094965957581, -0.05283444509544271, 0.3837453542138509, 0.10876666064909164, 0.08453413249647364, -0.07564701344025263, 0.27402450996352, -0.07494749368708382, 0.0659880124012682, 0.056318736803579204, 0.23896490249465754, 0.15474967042261617, 0.3140551427037435, -0.12678278113239783, 0.06058043974917382, 0.11536397555090011] |
1,802.05608 | Microfluidics for Biofabrication | Shoji Takeushi is professor in and the Director of the Center for
International Research on Integrative Biomedical Systems (CIBiS), Institute of
Industrial Science (IIS) at the University of Tokyo. Here he describes his
attempts to use inherent function of living materials in engineered systems by
reconstructing the biological structure using microfluidic technology.
| physics.flu-dyn q-bio.OT | shoji takeushi is professor in and the director of the center for international research on integrative biomedical systems cibis institute of industrial science iis at the university of tokyo here he describes his attempts to use inherent function of living materials in engineered systems by reconstructing the biological structure using microfluidic technology | [['shoji', 'takeushi', 'is', 'professor', 'in', 'and', 'the', 'director', 'of', 'the', 'center', 'for', 'international', 'research', 'on', 'integrative', 'biomedical', 'systems', 'cibis', 'institute', 'of', 'industrial', 'science', 'iis', 'at', 'the', 'university', 'of', 'tokyo', 'here', 'he', 'describes', 'his', 'attempts', 'to', 'use', 'inherent', 'function', 'of', 'living', 'materials', 'in', 'engineered', 'systems', 'by', 'reconstructing', 'the', 'biological', 'structure', 'using', 'microfluidic', 'technology']] | [-0.03420114814070985, 0.11520442975219339, -0.05428282412234694, -0.0366158555005677, -0.08834299221634864, -0.13389855220913888, -0.03155035402625799, 0.30907663837075233, -0.22392394933849574, -0.3436137306317687, 0.08725394355598837, -0.30853808647952974, -0.2150251024402678, 0.21842532370239495, -0.09914309022016823, 0.054453199626877904, 0.012886073738336563, -0.02336008337675594, 0.04531192595139146, -0.2317056332109496, 0.2445278406329453, 0.12505513224750758, 0.41630266490392387, 0.04267584771849215, 0.1471860885247588, 0.08069409538060426, -0.06409283451735974, -0.0756004404835403, -0.11887194122187793, 0.21547575110569597, 0.40195107938256114, 0.2124469195213169, 0.3953127774177119, -0.4494372959807515, -0.18858376199379565, 0.036923479828983544, 0.06299225034192205, 0.08818684674799443, -0.04086160796927288, -0.30989030953496693, -0.017485304176807402, -0.16133537533693015, -0.1854475731216371, 0.023455502968281507, 0.056650886787101624, 0.048369023455306887, -0.11468856840976514, -0.0012995638698339463, -0.04803314805962145, 0.22011638461612165, -0.08208713568747043, -0.145363202188164, 0.021879178248345853, 0.17747072096914052, -0.03651873141992837, 0.030195675967261196, 0.21051171757280826, -0.18302892388775946, -0.1655780134536326, 0.4106305849552154, -0.011752347052097321, -0.07465284317731857, 0.22448972280137242, -0.14028934518806635, -0.1787710376107134, 0.004371183477342128, 0.2748302890360355, 0.029835032606497405, -0.17475431978818962, 0.173778863287298, 0.036153379753232004, 0.12857571837957948, 0.09624801076948643, -0.05947723330929875, 0.23102407179772855, 0.227556857727468, -0.02574116598814726, 0.08654271831735968, -0.05793741293717176, -0.0917964045703411, -0.23226811935659497, -0.2155480982735753, -0.19101758932694793, 0.048628380224108696, 0.07844602734810906, -0.11186931880190969, 0.35140772234648465, 0.11644621714949607, 0.02159690435859375, -0.12941259038634598, 0.23589288488030433, -0.03139700714498758, 0.08653495183214545, 0.009988445015624165, 0.17855526810511946, 0.13935993528924884, 0.28955902679823337, -0.1781919806287624, 0.07396881083026528, 0.04535168678034097] |
1,802.05609 | Microfluidic tools for assaying immune cell function | Joel Voldman is a professor in the Electrical Engineering and Computer
Science Department at MIT. Here he describes his labs efforts to develop
microfluidic devices for cell manipulation and analysis.
| physics.flu-dyn q-bio.OT | joel voldman is a professor in the electrical engineering and computer science department at mit here he describes his labs efforts to develop microfluidic devices for cell manipulation and analysis | [['joel', 'voldman', 'is', 'a', 'professor', 'in', 'the', 'electrical', 'engineering', 'and', 'computer', 'science', 'department', 'at', 'mit', 'here', 'he', 'describes', 'his', 'labs', 'efforts', 'to', 'develop', 'microfluidic', 'devices', 'for', 'cell', 'manipulation', 'and', 'analysis']] | [-0.010377744566006908, 0.13418447431819192, -0.0766647230785597, -0.06866199666521801, -0.15352064236227808, -0.22927026924323932, 0.06436522163707635, 0.33501326215678245, -0.18051835669782654, -0.3789526654471611, 0.08533661229262963, -0.31663300212601136, -0.19511842856119418, 0.22689848951995373, -0.14063031606954232, 0.03146441152383541, 0.05594540804881474, -0.08486547911989278, 0.08209431229223466, -0.22429859535447483, 0.12251512417248611, 0.06147027696514952, 0.4071132471817064, 0.13330036934649828, 0.09402610716442096, 0.09251989425834396, -0.03431565353068812, -0.09387367440323377, -0.16908208145920572, 0.14147542731772209, 0.4304288564057186, 0.1460867096380941, 0.43226418938038164, -0.4898299887326771, -0.17852597368945336, -0.040677345422064436, 0.03324922222387174, 0.15934999434855476, -0.05878170043358515, -0.29424518057755356, 0.006046895804847109, -0.18277189618875755, -0.12124380102363046, -0.052231277050129296, 0.09878430745146911, -0.04304842035896305, -0.1413004600667748, -0.051004796975356495, -0.020898348170107807, 0.25265401799295995, 0.0061404834243525145, -0.12833577542212501, 0.09309153854525809, 0.1938513091701115, -0.11312474802553911, 0.009165728545009062, 0.25905133295675803, -0.21656614599813676, -0.17881008931275072, 0.37532159589744846, 0.08158298999328038, -0.022670637687732434, 0.2434394644525159, -0.1388963177832293, -0.1385193812411985, -0.019790177474376457, 0.2151330352343362, 0.02343951859350862, -0.19317538853220897, 0.12730369745384387, 0.03294114100522008, 0.1090924615233109, 0.08921910758162367, -0.11451875309235063, 0.23773243011714057, 0.19500670967430905, -0.02674344467834152, 0.07268945529157746, -0.01879276014093695, -0.03409175690391968, -0.23455125196226712, -0.2922897598995217, -0.185132988118406, 0.06968878987164975, 0.16570897080939553, -0.1118445085875433, 0.389632236212492, 0.13957521768993345, -0.04555131928545648, -0.12128841704367821, 0.2616217849326545, 0.007035217151559633, 0.03824173151675997, 0.07517793259165924, 0.1412091035524319, 0.15991473647541013, 0.3765344624889308, -0.2018650970742877, 0.07992111406578072, 0.03670063329025589] |
1,802.0561 | Centrifugal Microfluidics for Biomedical Applications | Yoon-Kyoung Cho is a full professor in Biomedical Engineering at UNIST. In
this contribution she describes a fully integrated and automated lab-on-a-disc
using centrifugal microfluidics to provide a "sample-in and answer-out" type of
biochemical analysis solution with simple, size-reduced, and cost-efficient
instrumentation. She also gives various examples of the fully integrated
"lab-on-a-disc" developed for broad applications ranging from medical
diagnostics to food, environment, and energy applications.
| physics.flu-dyn q-bio.OT | yoonkyoung cho is a full professor in biomedical engineering at unist in this contribution she describes a fully integrated and automated labonadisc using centrifugal microfluidics to provide a samplein and answerout type of biochemical analysis solution with simple sizereduced and costefficient instrumentation she also gives various examples of the fully integrated labonadisc developed for broad applications ranging from medical diagnostics to food environment and energy applications | [['yoonkyoung', 'cho', 'is', 'a', 'full', 'professor', 'in', 'biomedical', 'engineering', 'at', 'unist', 'in', 'this', 'contribution', 'she', 'describes', 'a', 'fully', 'integrated', 'and', 'automated', 'labonadisc', 'using', 'centrifugal', 'microfluidics', 'to', 'provide', 'a', 'samplein', 'and', 'answerout', 'type', 'of', 'biochemical', 'analysis', 'solution', 'with', 'simple', 'sizereduced', 'and', 'costefficient', 'instrumentation', 'she', 'also', 'gives', 'various', 'examples', 'of', 'the', 'fully', 'integrated', 'labonadisc', 'developed', 'for', 'broad', 'applications', 'ranging', 'from', 'medical', 'diagnostics', 'to', 'food', 'environment', 'and', 'energy', 'applications']] | [0.008981608801474006, 0.022373129282209834, -0.04130085161097853, 0.03233338126683829, -0.12354839290097608, -0.17047655098613793, 0.022910050447967092, 0.3614219081177676, -0.24651696641882093, -0.3215183908025087, 0.1088385916733325, -0.268531408666049, -0.13891651266712254, 0.28183436545275026, -0.09430552821732678, 0.0344762692022753, 0.07006887526456583, -0.051643085606313324, 0.017267109100091254, -0.16206085928163286, 0.20977442173318842, 0.05508382896245536, 0.3458199963226157, 0.11073689084594786, 0.1504948494000897, 0.025159085260199037, -0.07161522044216172, -0.012879146341928991, -0.11568110053411733, 0.1826069590880267, 0.3775085467111193, 0.1543167451933279, 0.3287905321014508, -0.43907351580337955, -0.22063005279939055, 0.04303159048165179, 0.10748175625152634, 0.15632355397851286, -0.1371709830680136, -0.2647112965015537, 0.05425175806602179, -0.23484610700664127, -0.14886058664928048, -0.09968250356141035, 0.06710387939997649, 0.010123636384131544, -0.2614752936603154, 0.00483454695569304, 0.0022879466217137494, 0.14264103299859215, -0.07158302496408381, -0.10231962425918398, 0.024935671189499988, 0.18625528110443787, -0.05918078347488101, 0.02280661936896711, 0.17741856556701457, -0.1516915786087955, -0.1267199596445376, 0.3733501281526129, -0.02500611139556109, -0.15729962225403574, 0.24689679480773413, -0.04572330718323336, -0.13183056387924036, 0.13239508190871044, 0.24316579734874985, 0.0621307009231236, -0.2379881258012127, 0.09328772572374319, 0.08682162014735957, 0.13651077187288616, 0.016565781228749427, -0.01773447609680184, 0.19564762255334753, 0.2144039088576022, 0.034511878881287775, 0.1314082582938974, -0.05175923687105967, -0.06177321275285745, -0.2737197007478799, -0.20362433134499242, -0.10669042614399124, 0.08089768455829471, -0.001537810228725548, -0.1800744312073467, 0.4150276069481999, 0.16053233237274117, 0.10536098841130605, -0.059724019982425845, 0.32182709683301086, 0.06262168845347271, 0.08218347025498496, 0.023591002567781735, 0.18628824644295847, 0.1234841607629432, 0.2503117974255613, -0.1449621863390903, 0.02925198509405225, 0.004156387860934108] |
1,802.05611 | Microfluidics for Chemical Synthesis: Flow Chemistry | Klavs F. Jensen is Warren K. Lewis Professor in Chemical Engineering and
Materials Science and Engineering at the Massachusetts Institute of Technology.
Here he describes the use of microfluidics for chemical synthesis, from the
early demonstration examples to the current efforts with automated droplet
microfluidic screening and optimization techniques.
| physics.flu-dyn q-bio.OT | klavs f jensen is warren k lewis professor in chemical engineering and materials science and engineering at the massachusetts institute of technology here he describes the use of microfluidics for chemical synthesis from the early demonstration examples to the current efforts with automated droplet microfluidic screening and optimization techniques | [['klavs', 'f', 'jensen', 'is', 'warren', 'k', 'lewis', 'professor', 'in', 'chemical', 'engineering', 'and', 'materials', 'science', 'and', 'engineering', 'at', 'the', 'massachusetts', 'institute', 'of', 'technology', 'here', 'he', 'describes', 'the', 'use', 'of', 'microfluidics', 'for', 'chemical', 'synthesis', 'from', 'the', 'early', 'demonstration', 'examples', 'to', 'the', 'current', 'efforts', 'with', 'automated', 'droplet', 'microfluidic', 'screening', 'and', 'optimization', 'techniques']] | [0.018913269794817705, 0.1269822856944908, -0.07185678576449088, -0.06428328877033589, -0.09162679768633097, -0.1512506483704783, 0.04277190203235174, 0.3070501076678435, -0.24167898623272777, -0.3769720527343452, 0.09598582351221314, -0.2880730256050204, -0.1804894980644652, 0.23341385546761254, -0.09897834302197832, 0.08417973814842601, 0.035731205328678094, -0.11440433538518846, -0.0029064343349697688, -0.19917041424196213, 0.21213055308908224, 0.06960186749347486, 0.36862528404647793, 0.11828376116075863, 0.08380462516409655, 0.020308443616765242, -0.06433512263659698, -0.07094108004821464, -0.20095551683819698, 0.13393953999426836, 0.367205922632517, 0.17874452657997608, 0.366188964593069, -0.41001794723949087, -0.2308486524852924, 0.026948973769322038, 0.032559130360217146, 0.16923446126747876, -0.1157948206916141, -0.2699805562927698, -0.020818081044126302, -0.15688382586813532, -0.1477119491319172, -0.05209607667832946, 0.09564780974566627, 0.03349155247754728, -0.21113484903859595, -0.025240505773884554, 0.018837115882585447, 0.19825985217660977, -0.051844778815090344, -0.2063979312273053, 0.006116247997852042, 0.13170796252476671, -0.04531487297208514, 0.05685914722077238, 0.24211617823069295, -0.15599341831208827, -0.12439928663661703, 0.3692207213801642, -0.03606613360655805, -0.05401045699060584, 0.2542964411356176, -0.08369293946695204, -0.1494238264276646, 0.06216614946606569, 0.18414069448287287, 0.09396696377856036, -0.17959197086747736, 0.15795363384556063, 0.08709052267173926, 0.09656048298347741, 0.12306579248979688, -0.09875356140158449, 0.20742024622935182, 0.22597470588516444, -0.013015002283888558, 0.0891262371490787, -0.03155361392418854, -0.047044800322813295, -0.24495231127366424, -0.22249575516131395, -0.1815375613514334, 0.061509989124412336, 0.0587063999661647, -0.12427153261766459, 0.36933190290195245, 0.1417445326417995, -1.009142336746057e-05, -0.07433049093621473, 0.26843566716706846, -0.01987910377404963, 0.06631705486991753, 0.02941032215312589, 0.18429952582588763, 0.19533797452459112, 0.2835878736805171, -0.22814945151185384, 0.07236408393752451, 0.06593477013908948] |
1,802.05612 | When Streams of Optofluidics Meet the Sea of Life | Luke P. Lee is a Tan Chin Tuan Centennial Professor at the National
University of Singapore. In this contribution he describes the power of
optofluidics as a research tool and reviews new insights within the areas of
single cell analysis, microphysiological analysis, and integrated systems.
| physics.flu-dyn q-bio.OT | luke p lee is a tan chin tuan centennial professor at the national university of singapore in this contribution he describes the power of optofluidics as a research tool and reviews new insights within the areas of single cell analysis microphysiological analysis and integrated systems | [['luke', 'p', 'lee', 'is', 'a', 'tan', 'chin', 'tuan', 'centennial', 'professor', 'at', 'the', 'national', 'university', 'of', 'singapore', 'in', 'this', 'contribution', 'he', 'describes', 'the', 'power', 'of', 'optofluidics', 'as', 'a', 'research', 'tool', 'and', 'reviews', 'new', 'insights', 'within', 'the', 'areas', 'of', 'single', 'cell', 'analysis', 'microphysiological', 'analysis', 'and', 'integrated', 'systems']] | [-0.07499089985239235, 0.063210572370074, -0.09767038269836287, 0.028035397726026447, -0.05566947892392901, -0.15203218528238888, 0.07635870701845059, 0.1925990650091659, -0.1892581604889446, -0.3417386734350161, 0.07137633751368742, -0.33675664655906573, -0.13971579760651698, 0.24112726163796402, -0.104925356852949, 0.0016523241065442562, 0.03688513515093787, -0.0371695661874996, 0.02493077495389364, -0.21623175023970279, 0.22208697753111747, 0.1629190833773464, 0.3477023489434611, 0.10434300571002743, 0.055816361638294024, 0.026200751699930566, -0.1245989533225921, -0.05566090678753839, -0.12665475136600435, 0.1485753025150519, 0.3342944521626288, 0.17520415131002665, 0.3814683133122427, -0.3256658596325327, -0.15283294452290813, -0.019898189475167204, 0.052792300237342715, 0.05582701038061218, -0.013561635955490849, -0.26768595251170074, 0.026315342888913372, -0.22702728567475622, -0.1595989368242127, 0.016063257882540875, 0.08973110098899766, 0.00880781465887346, -0.21814413102005015, -0.0009252969916401939, 0.03817010141739791, 0.18614470852877607, 0.0036738599407147954, -0.21449246324217794, 0.038376687433231964, 0.15028206980787218, -0.0086367416925813, 0.06319278417239813, 0.12450492073019798, -0.12244728008094667, -0.12836565805429762, 0.3493305425244299, -0.05865792519497601, -0.025359763806177812, 0.15016403518066826, -0.14497501923787323, -0.19323086713186718, 0.05744282695972784, 0.25009042574939405, 0.04669353967024521, -0.16723109629343857, 0.1599537304110444, -0.0460603884421289, 0.11974976355717941, 0.10386774966768413, -0.0916083802638406, 0.2019397017799995, 0.20172948079099032, -0.04977725310759111, 0.07978133533403954, -0.08618942002596502, -0.07983100858770988, -0.28471402861363126, -0.21192767278989777, -0.10112270473671908, 0.053087817065798765, 0.053607624426976225, -0.10366357175040651, 0.40651283794167364, 0.06892236559228464, 0.0999955883122642, -0.08495987228393047, 0.23444597511975604, 0.018184801982980305, 0.02547429603873752, 0.08866090252360498, 0.1764882596537725, 0.16491772860965945, 0.2711049081672999, -0.1673722089670429, 0.02032639165223703, 0.07126402223101733] |
1,802.05613 | The 500 ks Chandra observation of the z = 6.31 QSO SDSS J1030+0524 | We present the results from a $\sim500$ ks Chandra observation of the
$z=6.31$ QSO SDSS J1030+0524. This is the deepest X-ray observation to date of
a $z\sim6$ QSO. The QSO is detected with a total of 125 net counts in the full
($0.5-7$ keV) band and its spectrum can be modeled by a single power-law model
with photon index of $\Gamma = 1.81 \pm 0.18$ and full band flux of
$f=3.95\times 10^{-15}$ erg s$^{-1}$ cm$^{-2}$. When compared with the data
obtained by XMM-Newton in 2003, our Chandra observation in 2017 shows a harder
($\Delta \Gamma \approx -0.6$) spectrum and a 2.5 times fainter flux. Such a
variation, in a timespan of $\sim2$ yrs rest-frame, is unexpected for such a
luminous QSO powered by a $> 10^9 \: M_{\odot}$ black hole. The observed source
hardening and weakening could be related to an intrinsic variation in the
accretion rate. However, the limited photon statistics does not allow us to
discriminate between an intrinsic luminosity and spectral change, and an
absorption event produced by an intervening gas cloud along the line of sight.
We also report the discovery of diffuse X-ray emission that extends for 30"x20"
southward the QSO with a signal-to-noise ratio of $\sim$6, hardness ratio of
$HR=0.03_{-0.25}^{+0.20}$, and soft band flux of $f_{0.5-2 \: keV}=
1.1_{-0.3}^{+0.3} \times 10^{-15}$ erg s$^{-1}$ cm$^{-2}$, that is not
associated to a group or cluster of galaxies. We discuss two possible
explanations for the extended emission, which may be either associated with the
radio lobe of a nearby, foreground radio galaxy (at $z \approx 1-2$), or
ascribed to the feedback from the QSO itself acting on its surrounding
environment, as proposed by simulations of early black hole formation.
| astro-ph.GA | we present the results from a sim500 ks chandra observation of the z631 qso sdss j10300524 this is the deepest xray observation to date of a zsim6 qso the qso is detected with a total of 125 net counts in the full 057 kev band and its spectrum can be modeled by a single powerlaw model with photon index of gamma 181 pm 018 and full band flux of f395times 1015 erg s1 cm2 when compared with the data obtained by xmmnewton in 2003 our chandra observation in 2017 shows a harder delta gamma approx 06 spectrum and a 25 times fainter flux such a variation in a timespan of sim2 yrs restframe is unexpected for such a luminous qso powered by a 109 m_odot black hole the observed source hardening and weakening could be related to an intrinsic variation in the accretion rate however the limited photon statistics does not allow us to discriminate between an intrinsic luminosity and spectral change and an absorption event produced by an intervening gas cloud along the line of sight we also report the discovery of diffuse xray emission that extends for 30x20 southward the qso with a signaltonoise ratio of sim6 hardness ratio of hr003_025020 and soft band flux of f_052 kev 11_0303 times 1015 erg s1 cm2 that is not associated to a group or cluster of galaxies we discuss two possible explanations for the extended emission which may be either associated with the radio lobe of a nearby foreground radio galaxy at z approx 12 or ascribed to the feedback from the qso itself acting on its surrounding environment as proposed by simulations of early black hole formation | [['we', 'present', 'the', 'results', 'from', 'a', 'sim500', 'ks', 'chandra', 'observation', 'of', 'the', 'z631', 'qso', 'sdss', 'j10300524', 'this', 'is', 'the', 'deepest', 'xray', 'observation', 'to', 'date', 'of', 'a', 'zsim6', 'qso', 'the', 'qso', 'is', 'detected', 'with', 'a', 'total', 'of', '125', 'net', 'counts', 'in', 'the', 'full', '057', 'kev', 'band', 'and', 'its', 'spectrum', 'can', 'be', 'modeled', 'by', 'a', 'single', 'powerlaw', 'model', 'with', 'photon', 'index', 'of', 'gamma', '181', 'pm', '018', 'and', 'full', 'band', 'flux', 'of', 'f395times', '1015', 'erg', 's1', 'cm2', 'when', 'compared', 'with', 'the', 'data', 'obtained', 'by', 'xmmnewton', 'in', '2003', 'our', 'chandra', 'observation', 'in', '2017', 'shows', 'a', 'harder', 'delta', 'gamma', 'approx', '06', 'spectrum', 'and', 'a', '25', 'times', 'fainter', 'flux', 'such', 'a', 'variation', 'in', 'a', 'timespan', 'of', 'sim2', 'yrs', 'restframe', 'is', 'unexpected', 'for', 'such', 'a', 'luminous', 'qso', 'powered', 'by', 'a', '109', 'm_odot', 'black', 'hole', 'the', 'observed', 'source', 'hardening', 'and', 'weakening', 'could', 'be', 'related', 'to', 'an', 'intrinsic', 'variation', 'in', 'the', 'accretion', 'rate', 'however', 'the', 'limited', 'photon', 'statistics', 'does', 'not', 'allow', 'us', 'to', 'discriminate', 'between', 'an', 'intrinsic', 'luminosity', 'and', 'spectral', 'change', 'and', 'an', 'absorption', 'event', 'produced', 'by', 'an', 'intervening', 'gas', 'cloud', 'along', 'the', 'line', 'of', 'sight', 'we', 'also', 'report', 'the', 'discovery', 'of', 'diffuse', 'xray', 'emission', 'that', 'extends', 'for', '30x20', 'southward', 'the', 'qso', 'with', 'a', 'signaltonoise', 'ratio', 'of', 'sim6', 'hardness', 'ratio', 'of', 'hr003_025020', 'and', 'soft', 'band', 'flux', 'of', 'f_052', 'kev', '11_0303', 'times', '1015', 'erg', 's1', 'cm2', 'that', 'is', 'not', 'associated', 'to', 'a', 'group', 'or', 'cluster', 'of', 'galaxies', 'we', 'discuss', 'two', 'possible', 'explanations', 'for', 'the', 'extended', 'emission', 'which', 'may', 'be', 'either', 'associated', 'with', 'the', 'radio', 'lobe', 'of', 'a', 'nearby', 'foreground', 'radio', 'galaxy', 'at', 'z', 'approx', '12', 'or', 'ascribed', 'to', 'the', 'feedback', 'from', 'the', 'qso', 'itself', 'acting', 'on', 'its', 'surrounding', 'environment', 'as', 'proposed', 'by', 'simulations', 'of', 'early', 'black', 'hole', 'formation']] | [-0.06950050703400829, 0.09781047269627759, -0.027040070942824797, 0.07448275097570768, -0.08685517182058548, -0.0840759932919791, 0.07236576634425083, 0.45450661544288906, -0.14169959119357334, -0.3858668429012864, 0.06802186366441854, -0.3375135192011343, 0.017834047210358438, 0.19668191650976125, -0.035464669281835136, -0.05383530682960914, 0.02087786564236292, -0.06421442304809506, -0.06550754832326444, -0.21556761118006848, 0.2373320183135917, 0.11211230026322652, 0.18047329311126045, 0.025995254308503843, 0.0916246268401458, -0.04890132252972969, -0.05963203431390253, -0.024932422351105744, -0.1140259558737603, 0.03448463275503272, 0.21548486618161367, 0.10024212342738123, 0.208990711109856, -0.3132556221369422, -0.20673972461799045, 0.08514827442092773, 0.17981766870470492, -0.030260500056228188, -0.011983916327619974, -0.29510110110511845, 0.07577201107093867, -0.23399253501028042, -0.15144708214221939, 0.12644988571672322, 0.050300420729286505, -0.008542621844820368, -0.19798544531512405, 0.18045756996653192, -0.002641906456692629, 0.044086862925180804, -0.11851957468264787, -0.04975039901334669, -0.055762716342998675, 0.015351468687062579, 0.04778218189563138, 0.11267526936504116, 0.1881670153020939, -0.1252041753111134, -0.08190073846325947, 0.39122442763994686, -0.07451086524352021, 0.04305107265901871, 0.17509420872294948, -0.18857027506609295, -0.1759467365087143, 0.2608437414567631, 0.11649047757815331, 0.0876617836595373, -0.12761858024238054, 0.005605153059936555, -0.013632317268948034, 0.30249154474245105, 0.024771637228682582, 0.0588432758829182, 0.3139018170030672, 0.09064151621901263, 0.04278916677147928, 0.10779739817009126, -0.2564022502663201, 0.059419206830360775, -0.24967357343669994, -0.08410350722537953, -0.14810760043247606, 0.19082724871214107, -0.14504486342770306, -0.1127691113581069, 0.3582079809392457, 0.09921754192562617, 0.2718834018252872, 0.03612798526533453, 0.2841997094940217, 0.14134698218560263, 0.059076911808186014, 0.10030194631804995, 0.3181998428100577, 0.16805665863630098, 0.08825155873970562, -0.1940482323426385, 0.01981961813778201, -0.023084154235703987] |
1,802.05614 | On the binomial approximation of the American put | We consider the binomial approximation of the American put price in the
Black-Scholes model (with continuous dividend yield). Our main result is that
the error of approximation is $O((ln n) $\alpha$ /n)$ where n is the number of
time periods and the exponent $\alpha$ is a positive number, the value of which
may differ according to the respective levels of the interest rate and the
dividend yield.
| q-fin.MF math.PR q-fin.PR | we consider the binomial approximation of the american put price in the blackscholes model with continuous dividend yield our main result is that the error of approximation is oln n alpha n where n is the number of time periods and the exponent alpha is a positive number the value of which may differ according to the respective levels of the interest rate and the dividend yield | [['we', 'consider', 'the', 'binomial', 'approximation', 'of', 'the', 'american', 'put', 'price', 'in', 'the', 'blackscholes', 'model', 'with', 'continuous', 'dividend', 'yield', 'our', 'main', 'result', 'is', 'that', 'the', 'error', 'of', 'approximation', 'is', 'oln', 'n', 'alpha', 'n', 'where', 'n', 'is', 'the', 'number', 'of', 'time', 'periods', 'and', 'the', 'exponent', 'alpha', 'is', 'a', 'positive', 'number', 'the', 'value', 'of', 'which', 'may', 'differ', 'according', 'to', 'the', 'respective', 'levels', 'of', 'the', 'interest', 'rate', 'and', 'the', 'dividend', 'yield']] | [-0.14113895889760844, 0.10906214560312566, -0.07079430766153469, 0.045452916890438365, -0.02963993446501806, -0.14248449773068972, 0.11633271696184998, 0.30882838568580684, -0.26507260553789, -0.29483681158232156, 0.09821604917680761, -0.2879601865055547, -0.08909183156454185, 0.17662278551316418, -0.07337470759929561, 0.042265950215619, -0.01465889131789332, 0.09375145884036128, 0.03981283842585981, -0.33511741376315146, 0.2763054178690593, 0.06526598448295202, 0.23523620105306828, -0.007965170903437173, 0.05062563173167074, -0.020554533634863016, -0.013625569419184727, -0.023525862138889516, -0.172263927469851, 0.09345648952050885, 0.23733608391302735, 0.09796693334494953, 0.3355138290937601, -0.356068690085033, -0.1414227562664605, 0.17306424727413192, 0.05988912417817471, 0.036164885197432516, 0.007255079891921869, -0.18670265668474917, 0.06504137217372989, -0.1703341622635333, -0.12240898913578756, 0.036212245586203104, 0.06723068490513225, 0.08437809801257368, -0.3600108719833974, 0.09649892526664841, 0.06092536037287383, -0.04654844237296884, -0.06334920559919426, -0.21853841563909135, -0.017703141408986343, 0.1510281086857639, 0.15030844448440112, 0.013670943752139696, 0.07541031924201481, -0.11710894488687836, -0.12004828889534544, 0.3665822682095997, -0.07282167078871558, -0.20481862461389, 0.09012161211263556, -0.21149499047158368, -0.08575381613823015, 0.16141428494019738, 0.17208465919899407, 0.09714407815750856, -0.054018201779073745, 0.15111643278714157, -0.07237370587440568, 0.20687243274287948, 0.10616381747175509, -0.006769731383659502, 0.10071175395330387, 0.14226605303919138, 0.0973495364522756, 0.11864974852234347, -0.06985459683129369, -0.15433077141295062, -0.3314848309243793, -0.15818074439415958, -0.18457059275859328, 0.0947537704496019, -0.16031012447757662, -0.16020449843090862, 0.35589367971380254, 0.11459211580656858, 0.19568458902858085, 0.1714135781503908, 0.21863839583499217, 0.2458640704880149, -0.0626006053566043, 0.08282583443197741, 0.18566516771523364, 0.06428191459167805, 0.060590738041409804, -0.23539455263326362, 0.1645312862012035, 0.09570057847217392] |
1,802.05615 | Optimal launch states for the measurement of principal modes in optical
fibers | Modal dispersion characterization of multimode optical fibers can be
performed using the recently-proposed mode-dependent signal delay method. This
method consists of sending optical pulses using different combinations of modes
though the multimode optical fiber and measuring the mode group delay at the
fiber output. From these measurements, it is possible to estimate the modal
dispersion vector, the principal modes, and their corresponding differential
mode group delays. In this paper, we revise and extend the theoretical
framework of the mode-dependent signal delay method to include the impact of
receiver noise and mode-dependent loss. We compute optimal launch modes,
minimizing the noise error in the estimation of the fiber modal dispersion
vector. We show that, for a 40-mode fiber, the electronic signal-to-noise ratio
(SNR) is improved asymptotically by almost 6 dB compared to conventional mode
combinations.
| eess.SP physics.optics | modal dispersion characterization of multimode optical fibers can be performed using the recentlyproposed modedependent signal delay method this method consists of sending optical pulses using different combinations of modes though the multimode optical fiber and measuring the mode group delay at the fiber output from these measurements it is possible to estimate the modal dispersion vector the principal modes and their corresponding differential mode group delays in this paper we revise and extend the theoretical framework of the modedependent signal delay method to include the impact of receiver noise and modedependent loss we compute optimal launch modes minimizing the noise error in the estimation of the fiber modal dispersion vector we show that for a 40mode fiber the electronic signaltonoise ratio snr is improved asymptotically by almost 6 db compared to conventional mode combinations | [['modal', 'dispersion', 'characterization', 'of', 'multimode', 'optical', 'fibers', 'can', 'be', 'performed', 'using', 'the', 'recentlyproposed', 'modedependent', 'signal', 'delay', 'method', 'this', 'method', 'consists', 'of', 'sending', 'optical', 'pulses', 'using', 'different', 'combinations', 'of', 'modes', 'though', 'the', 'multimode', 'optical', 'fiber', 'and', 'measuring', 'the', 'mode', 'group', 'delay', 'at', 'the', 'fiber', 'output', 'from', 'these', 'measurements', 'it', 'is', 'possible', 'to', 'estimate', 'the', 'modal', 'dispersion', 'vector', 'the', 'principal', 'modes', 'and', 'their', 'corresponding', 'differential', 'mode', 'group', 'delays', 'in', 'this', 'paper', 'we', 'revise', 'and', 'extend', 'the', 'theoretical', 'framework', 'of', 'the', 'modedependent', 'signal', 'delay', 'method', 'to', 'include', 'the', 'impact', 'of', 'receiver', 'noise', 'and', 'modedependent', 'loss', 'we', 'compute', 'optimal', 'launch', 'modes', 'minimizing', 'the', 'noise', 'error', 'in', 'the', 'estimation', 'of', 'the', 'fiber', 'modal', 'dispersion', 'vector', 'we', 'show', 'that', 'for', 'a', '40mode', 'fiber', 'the', 'electronic', 'signaltonoise', 'ratio', 'snr', 'is', 'improved', 'asymptotically', 'by', 'almost', '6', 'db', 'compared', 'to', 'conventional', 'mode', 'combinations']] | [-0.17344389543553493, 0.07977534379526496, -0.08313343961394035, -0.0005214898540687404, -0.06299014862528757, -0.16163401976157737, 0.08435138976779115, 0.4490840698879464, -0.27090481789502546, -0.24538065029546283, 0.0914020108328642, -0.2552010900572054, -0.15749566658348357, 0.22337236666974886, -0.0736916598275696, 0.10503919051497951, 0.06888700188732796, 0.0008413814746991808, -0.04633766863910005, -0.19376179987750247, 0.2877589113138532, 0.06754528669486369, 0.34528457272895857, -0.061309743038889836, 0.1394150072001481, 0.06396868000423214, -0.06261186660582521, -0.026934889819178926, -0.11289845730110878, 0.10598680785598051, 0.24412930687833437, 0.08348414841234068, 0.23348612071512112, -0.3579276367860909, -0.22488175275476469, 0.10894543299787587, 0.12782047129642302, 0.1300993020072075, 0.04718165520466584, -0.2663818415625483, 0.06878350142571599, -0.16354514794298133, -0.09933231405290614, -0.04323527581387557, -0.050005573369702676, 0.0335150075642238, -0.2619397786298865, 0.0751463067402741, 0.023672895365975853, 0.05033822047797249, -0.02718445012359915, -0.08233338399068978, -0.018239415124674935, 0.09758679247706344, 0.010781198564944859, -0.0390083295419196, 0.14160232746595502, -0.07002315844612238, -0.0658769994918117, 0.349969081944765, -0.14082492495837964, -0.183618195494987, 0.09325221970789414, -0.13018052912618322, -0.01112720738270117, 0.19224982641469268, 0.22277219905833104, 0.04970128467845682, -0.10353838670578666, -0.021743525490094732, 0.049261196908590044, 0.21874802696161477, 0.13189194020219988, 0.16342140272035635, 0.13338977321142093, 0.16475511814250535, 0.02984655643568227, 0.13607805879713086, -0.1455402235494825, 0.010130754157750258, -0.29303245174285386, -0.135675165697204, -0.14500365828280337, -0.009472847571316407, -0.11715801593390665, -0.08526868717674922, 0.4154284567593184, 0.1021719467406042, 0.13278838936799675, 0.09981563748945867, 0.377771402674174, 0.17402904034553698, 0.054527902079367994, 0.04775101433795197, 0.35049558697002275, 0.2088683495399563, 0.05907880862880694, -0.2842155059754036, -0.01371241586030762, 0.0044484971024628195] |
1,802.05616 | Model Generation for Quantified Formulas: A Taint-Based Approach | We focus in this paper on generating models of quantified first-order
formulas over built-in theories, which is paramount in software verification
and bug finding. While standard methods are either geared toward proving the
absence of solution or targeted to specific theories, we propose a generic
approach based on a reduction to the quantifier-free case. Our technique allows
thus to reuse all the efficient machinery developed for that context.
Experiments show a substantial improvement over state-of-the-art methods.
| cs.LO | we focus in this paper on generating models of quantified firstorder formulas over builtin theories which is paramount in software verification and bug finding while standard methods are either geared toward proving the absence of solution or targeted to specific theories we propose a generic approach based on a reduction to the quantifierfree case our technique allows thus to reuse all the efficient machinery developed for that context experiments show a substantial improvement over stateoftheart methods | [['we', 'focus', 'in', 'this', 'paper', 'on', 'generating', 'models', 'of', 'quantified', 'firstorder', 'formulas', 'over', 'builtin', 'theories', 'which', 'is', 'paramount', 'in', 'software', 'verification', 'and', 'bug', 'finding', 'while', 'standard', 'methods', 'are', 'either', 'geared', 'toward', 'proving', 'the', 'absence', 'of', 'solution', 'or', 'targeted', 'to', 'specific', 'theories', 'we', 'propose', 'a', 'generic', 'approach', 'based', 'on', 'a', 'reduction', 'to', 'the', 'quantifierfree', 'case', 'our', 'technique', 'allows', 'thus', 'to', 'reuse', 'all', 'the', 'efficient', 'machinery', 'developed', 'for', 'that', 'context', 'experiments', 'show', 'a', 'substantial', 'improvement', 'over', 'stateoftheart', 'methods']] | [-0.08056026212503448, -0.018877651707857455, -0.05235856738382656, 0.04097222049696077, -0.10171920642575347, -0.1591864988808275, 0.05951377682197888, 0.37617980219472785, -0.215419588414462, -0.31047279871755135, 0.10217696074457643, -0.2026639634003866, -0.16278818538596265, 0.2687645449370489, -0.08350867520627951, 0.0828758107841407, 0.08208303524818468, -0.005708558668725584, -0.11006938015711248, -0.26409136910775777, 0.291638898549871, 0.04378016833461037, 0.32492294303435637, 0.07851591368671507, 0.09342345499163984, 0.021950539464964287, -0.06690960997519524, 0.04746963581266372, -0.08868555405139264, 0.19444973525395126, 0.3016706694821359, 0.1963779854367634, 0.315582468125381, -0.41860646101811555, -0.22383710880469726, 0.1135402761880725, 0.16861921390457274, 0.17765656818396805, -0.05953240709526366, -0.2685619717874368, 0.1483359285369883, -0.19823410695014326, -0.07829953133937363, -0.15612126870914117, -0.027046497996994538, -0.025535192610971678, -0.26472120185529713, 0.003772893206731073, 0.11400386214709694, 0.09892090080354951, -0.04368820295770236, -0.10404342202788316, 0.06705185121819868, 0.08676514406014528, 0.04565730259300357, 0.034719348695178176, 0.10497328047763164, -0.14760360436967426, -0.1813908381216032, 0.37441897230516924, -0.08806428344503633, -0.20276341068950532, 0.21869020104273468, -0.04128559770699786, -0.20396612544764617, 0.10185983364078167, 0.16367460834475137, 0.20480562101951555, -0.1392233876977116, 0.07693729428252769, 0.02024476317149636, 0.19748778310359308, 0.03712151589570567, -0.011367243855554415, 0.19888091445777958, 0.18849868984206727, 0.07105421176866482, 0.14824670245242919, -0.026615876575784857, -0.11810195743486188, -0.2818336793907771, -0.15670636894279405, -0.08779582799884099, -0.023132910467929355, -0.045485012514913443, -0.18075356960884834, 0.3825554199957926, 0.24028765705531296, 0.11482787322203972, 0.12513970541553326, 0.35362576467818335, 0.09678676668217552, 0.10800306006383739, 0.0575116259952713, 0.15162635380769834, 0.03963611438858176, 0.06731151240436654, -0.17588729012487947, 0.08997870699845646, 0.09042773927610956] |
1,802.05617 | Weakly localized states for nonlinear Dirac equations | We prove the existence of infinitely many non square-integrable stationary
solutions for a family of massless Dirac equations in 2D. They appear as
effective equations in two dimensional honeycomb structures. We give a direct
existence proof thanks to a particular radial ansatz, which also allows to
provide the exact asymptotic behavior of spinor components. Moreover, those
solutions admit a variational characterization. We also indicate how the
content of the present paper allows to extend our previous results for the
massive case [5] to more general nonlinearities.
| math.AP math-ph math.MP | we prove the existence of infinitely many non squareintegrable stationary solutions for a family of massless dirac equations in 2d they appear as effective equations in two dimensional honeycomb structures we give a direct existence proof thanks to a particular radial ansatz which also allows to provide the exact asymptotic behavior of spinor components moreover those solutions admit a variational characterization we also indicate how the content of the present paper allows to extend our previous results for the massive case 5 to more general nonlinearities | [['we', 'prove', 'the', 'existence', 'of', 'infinitely', 'many', 'non', 'squareintegrable', 'stationary', 'solutions', 'for', 'a', 'family', 'of', 'massless', 'dirac', 'equations', 'in', '2d', 'they', 'appear', 'as', 'effective', 'equations', 'in', 'two', 'dimensional', 'honeycomb', 'structures', 'we', 'give', 'a', 'direct', 'existence', 'proof', 'thanks', 'to', 'a', 'particular', 'radial', 'ansatz', 'which', 'also', 'allows', 'to', 'provide', 'the', 'exact', 'asymptotic', 'behavior', 'of', 'spinor', 'components', 'moreover', 'those', 'solutions', 'admit', 'a', 'variational', 'characterization', 'we', 'also', 'indicate', 'how', 'the', 'content', 'of', 'the', 'present', 'paper', 'allows', 'to', 'extend', 'our', 'previous', 'results', 'for', 'the', 'massive', 'case', '5', 'to', 'more', 'general', 'nonlinearities']] | [-0.15161606206336645, 0.07004740010394693, -0.1176449395283017, 0.0730006135566983, -0.1297795847924643, -0.11725830482752171, 0.002153767238988346, 0.3211349460274674, -0.1874137830942176, -0.24484742270392734, 0.08254010209456346, -0.25928165253047386, -0.193992106162748, 0.19766186608737984, -0.004565721181448722, 0.05605286540636836, 0.06252895742329921, 0.022474624744824912, -0.10909348782720478, -0.2626363904930131, 0.345943616486566, -0.05300657909436606, 0.2563069225343074, 0.03602031409350592, 0.07893406217484626, -0.00547681718003438, 0.023095152786185662, 0.015379843258753766, -0.17804664995001498, 0.13887197467455165, 0.2666906478793122, 0.05767088629532779, 0.23479438328379115, -0.4377366735405007, -0.20699319527701063, 0.10692414862298688, 0.20223511230785313, 0.17197500352699005, -0.078906137740739, -0.2563654203698862, 0.08275277936982728, -0.16373707507303809, -0.26484755423937945, -0.1581911899062783, -0.014931602360204209, 0.023765376939568237, -0.274167476514311, 0.09119675777680619, 0.11827543947499158, -0.002893127192374925, -0.11987057858455363, -0.08456812393824505, -0.009054762423634096, 0.07129893757316262, 0.05036956087014703, -0.051720352513109184, 0.005178994872758902, -0.1062323331768079, -0.11156641019963075, 0.35933998948556023, -0.09747945794532466, -0.2873670601091066, 0.2490495052621808, -0.1251705606511339, -0.16823025920623264, 0.11810889690139786, 0.15736093823689706, 0.1749683606904, -0.14754885766481937, 0.1253453728602116, -0.09805441245458327, 0.11115647639082961, 0.09613377003129138, 0.06944510813729382, 0.16617222069112889, 0.08296465766237139, 0.12804018757649532, 0.16200857699664614, -0.01309308826620149, -0.1137149867921158, -0.3240725223927997, -0.18408600540782952, -0.08963866450628916, 0.12257534805089669, -0.09220644010354083, -0.2257612818462211, 0.40199085140904023, 0.1576035744693336, 0.1698280886616991, 0.09885790218128064, 0.21499948556329188, 0.11841321751193772, -0.0032092414493131083, 0.07955111107290831, 0.22554942749462328, 0.16294148759266666, 0.09536074110588362, -0.13971309608855653, -0.03700366134952949, 0.11676475359126925] |
1,802.05618 | A novel wavelet-based optimal linear quadratic tracker for time-varying
systems with multiple delays | A new method for solving optimal tracking control of linear quadratic
time-varying systems with multiple time delays in state and input variables and
with combined constraints is presented in this paper. By using the relations of
Chebyshev wavelets, we simulate the optimal tracking problem to a static
optimization one. This alternative method is applied on different optimal
tracking systems and simulation results demonstrate the effectiveness of the
proposed method.
| math.OC | a new method for solving optimal tracking control of linear quadratic timevarying systems with multiple time delays in state and input variables and with combined constraints is presented in this paper by using the relations of chebyshev wavelets we simulate the optimal tracking problem to a static optimization one this alternative method is applied on different optimal tracking systems and simulation results demonstrate the effectiveness of the proposed method | [['a', 'new', 'method', 'for', 'solving', 'optimal', 'tracking', 'control', 'of', 'linear', 'quadratic', 'timevarying', 'systems', 'with', 'multiple', 'time', 'delays', 'in', 'state', 'and', 'input', 'variables', 'and', 'with', 'combined', 'constraints', 'is', 'presented', 'in', 'this', 'paper', 'by', 'using', 'the', 'relations', 'of', 'chebyshev', 'wavelets', 'we', 'simulate', 'the', 'optimal', 'tracking', 'problem', 'to', 'a', 'static', 'optimization', 'one', 'this', 'alternative', 'method', 'is', 'applied', 'on', 'different', 'optimal', 'tracking', 'systems', 'and', 'simulation', 'results', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method']] | [-0.12914787380672668, -0.008400574441243341, -0.09533547839500765, 0.027374571864155754, -0.062418599653503166, -0.16044264169328887, 0.029515202671788848, 0.3709819150980616, -0.304083076859082, -0.3301899953596834, 0.13681073786785314, -0.2160281739872543, -0.19718665764937043, 0.2564781946265071, -0.07859894182479037, 0.18812013900690322, 0.0931858543333584, -0.00930561719165332, -0.08166538309845803, -0.2627787770082553, 0.2911518944150674, 0.05020724415131237, 0.2941810766747896, -0.03818868829504303, 0.19352701584390108, 0.058531243684769106, -0.05323380797399559, 0.05342515897464709, -0.07199700209447116, 0.14705766296601328, 0.27934665036846656, 0.14954121785400354, 0.3065240773966239, -0.401078159124523, -0.204640483416185, 0.08399385404165673, 0.11927013101218187, 0.11233070446853188, -0.08749473944772035, -0.2937919933726822, 0.08763398367918326, -0.14217767567522283, -0.08062775888601723, -0.08246898193560216, -0.03351468416403277, 0.0733002398190075, -0.3402583607998879, 0.06740595363890348, 0.0066274951272846565, 0.013274443929718025, -0.1359372243717097, -0.08635438465094869, 0.07577896582475607, 0.11223199973017842, 0.007732494936689087, -0.0013199890693784623, 0.090054942283145, -0.06472921384282518, -0.19359054027692132, 0.3551953253538712, -0.049415642989502434, -0.290421097782319, 0.19104498829962552, -0.04527136047060291, -0.12439892938077125, 0.12254359377075688, 0.27475977118086553, 0.2008608924596152, -0.1888664879201763, 0.04370101497161027, -0.03744703403039687, 0.1789374511041071, 0.014501133852678797, -0.01450235727985484, 0.11459669944884228, 0.2066391975470427, 0.12951507377505733, 0.18851046628264737, -0.06578955773696088, -0.11734398880946463, -0.2502716094520334, -0.10814667766427864, -0.1866436557425861, -0.08504035972578423, -0.10793992129860587, -0.10507043228363214, 0.42378811756877793, 0.21173125745701618, 0.14716918550539707, 0.0851153320821839, 0.35699510817294533, 0.15102763534726008, 0.010325280598540237, 0.08217267791295181, 0.20759787189139836, 0.08797814813442528, 0.1174902319435732, -0.3011652532344063, 0.045913347012727805, 0.0772332363842946] |
1,802.05619 | Novel results on Hermite-Hadamard kind inequalities for $\eta$-convex
functions by means of $(k,r)$-fractional integral operators | We establish new integral inequalities of Hermite-Hadamard type for the
recent class of $\eta$-convex functions. This is done via generalized
$(k,r)$-Riemann-Liouville fractional integral operators. Our results generalize
some known theorems in the literature. By choosing different values for the
parameters $k$ and $r$, one obtains interesting new results.
| math.CA | we establish new integral inequalities of hermitehadamard type for the recent class of etaconvex functions this is done via generalized krriemannliouville fractional integral operators our results generalize some known theorems in the literature by choosing different values for the parameters k and r one obtains interesting new results | [['we', 'establish', 'new', 'integral', 'inequalities', 'of', 'hermitehadamard', 'type', 'for', 'the', 'recent', 'class', 'of', 'etaconvex', 'functions', 'this', 'is', 'done', 'via', 'generalized', 'krriemannliouville', 'fractional', 'integral', 'operators', 'our', 'results', 'generalize', 'some', 'known', 'theorems', 'in', 'the', 'literature', 'by', 'choosing', 'different', 'values', 'for', 'the', 'parameters', 'k', 'and', 'r', 'one', 'obtains', 'interesting', 'new', 'results']] | [-0.11159356673369589, 0.03541894576957692, -0.057736546175716365, 0.10166397387080867, -0.1399513587973121, -0.17634865416861747, 0.044919465081361326, 0.2879105200586112, -0.2722277663972067, -0.25759386222647584, 0.1193049220980712, -0.2601673829207278, -0.16456926111941753, 0.3206147155926927, -0.09144854335033376, 0.05294600239247539, 0.04583501139574725, 0.020012625412124653, -0.14922642924458437, -0.2897969815556122, 0.38415980784465437, -0.05567445283320368, 0.178337731955411, 0.04736492575814381, 0.07021810153863677, 0.03794261533766985, -0.10353603285899304, -0.01271162441243296, -0.2735593256176166, 0.1977732166516311, 0.26395954292915436, 0.08242212972887185, 0.28954970934833196, -0.36305661546066403, -0.22438632763679262, 0.09951019797565254, 0.06983391154031067, 0.030352993726568377, -0.05132203338586766, -0.29669141737015353, 0.05760486245803211, -0.11189332007147047, -0.21686559525804353, -0.11206819461253674, 0.010321073578265698, 0.09974348038414736, -0.33050798272471066, 0.09085775074630004, 0.06547545196245545, 0.005394013560599769, -0.07829403628230742, -0.2465690324568878, 0.1014108709110271, 0.0889117900059437, 0.046963637709901064, 0.002507462034649823, 0.03432507773496858, -0.07892658232974456, -0.17098904060928719, 0.24408355377533514, -0.07377373793607821, -0.21232954412698746, 0.13285591356132342, -0.12202663514155733, -0.23406513266103424, 0.03867994661888351, 0.056953917945856636, 0.19610667819886105, -0.17189681509752636, 0.12023374162811745, -0.12494998720838972, 0.037930171774781266, 0.05882121906008409, 0.0920641234792445, 0.07593229613469346, 0.05195956186229444, 0.0777075219919662, 0.2086183309717023, -0.001482434388574051, -0.09418711037901432, -0.3671151584662173, -0.16521504946538937, -0.17369983576076187, 0.036876795509749136, -0.16588187603369792, -0.08169730108879182, 0.37996803746437247, 0.10939237013783144, 0.1639609738536503, 0.09077481623819988, 0.19647194481576266, 0.169973814710671, 0.09438314560152915, 0.03710644249804318, 0.20246899127264245, 0.1588406905218068, 0.1343655247727166, -0.11658664461751671, 0.029043997073566297, 0.20271540190214696] |
1,802.0562 | Integrating AADL and FMI to Extend Virtual Integration Capability | Virtual Integration Capability is paramount to perform early validation of
Cyber Physical Systems. The objective is to guide the systems engineer so as to
ensure that the system under design meets multiple criteria through
high-fidelity simulation. In this paper, we present an integration scheme that
leverages the FMI (Functional Mock-Up interface) standard and the AADL
architecture description language. Their combination allows for validation of
systems combining embedded platform captured by the AADL, and FMI components
that represent physical elements, either mechanical parts, or the environment.
We present one approach, and demonstrator case studies.
| cs.SY | virtual integration capability is paramount to perform early validation of cyber physical systems the objective is to guide the systems engineer so as to ensure that the system under design meets multiple criteria through highfidelity simulation in this paper we present an integration scheme that leverages the fmi functional mockup interface standard and the aadl architecture description language their combination allows for validation of systems combining embedded platform captured by the aadl and fmi components that represent physical elements either mechanical parts or the environment we present one approach and demonstrator case studies | [['virtual', 'integration', 'capability', 'is', 'paramount', 'to', 'perform', 'early', 'validation', 'of', 'cyber', 'physical', 'systems', 'the', 'objective', 'is', 'to', 'guide', 'the', 'systems', 'engineer', 'so', 'as', 'to', 'ensure', 'that', 'the', 'system', 'under', 'design', 'meets', 'multiple', 'criteria', 'through', 'highfidelity', 'simulation', 'in', 'this', 'paper', 'we', 'present', 'an', 'integration', 'scheme', 'that', 'leverages', 'the', 'fmi', 'functional', 'mockup', 'interface', 'standard', 'and', 'the', 'aadl', 'architecture', 'description', 'language', 'their', 'combination', 'allows', 'for', 'validation', 'of', 'systems', 'combining', 'embedded', 'platform', 'captured', 'by', 'the', 'aadl', 'and', 'fmi', 'components', 'that', 'represent', 'physical', 'elements', 'either', 'mechanical', 'parts', 'or', 'the', 'environment', 'we', 'present', 'one', 'approach', 'and', 'demonstrator', 'case', 'studies']] | [-0.14727486774728443, -0.00511815132162038, -0.0857971207907183, 0.0021502350366884664, -0.07954054102501883, -0.1467860532343708, 0.029400364161589213, 0.3967837428533903, -0.24404689017182557, -0.33234829618845896, 0.09459258196750275, -0.22798188689921517, -0.1887371125706141, 0.22467295738608045, -0.05278454542220119, 0.09250673277789266, 0.09628891543314982, -0.05720825376419691, -0.007774283110554661, -0.18754987830236072, 0.31412686169227605, 0.04800033453671682, 0.3242681120392135, 0.0014317625781811614, 0.11369270798675116, 0.047012507943035936, 0.006640438030483902, -0.03460192239733152, -0.07428116339215976, 0.14572789995825938, 0.27389022055011925, 0.19029159988126448, 0.2961652309568699, -0.4882769085947544, -0.1874702926224438, 0.025814632985300276, 0.13099730482465158, 0.05280043298919355, -0.045153103853946414, -0.29552917015959096, 0.09797269807908163, -0.20883400018216783, -0.11639356151002869, -0.13595357966879684, -0.04825701103645868, -0.015289486330803684, -0.2721779847615248, -0.048501021944747494, 0.027986291215144177, 0.07597017787416936, -0.06611448044260283, -0.057779957388868174, 0.001275060438020255, 0.19001773423615403, -0.049101028072219645, 0.011221629508767247, 0.19240870482478573, -0.09429303543411836, -0.11947533872819716, 0.4009139753467533, -0.011218142603093418, -0.20693028448537612, 0.2655974413138083, -0.013277930693240255, -0.12345415107925893, 0.07471263005087773, 0.2064675333889662, 0.05840754204539843, -0.2201890803783411, 0.054466651973529887, 0.05433001376247855, 0.22533586130838, -0.039255478256632406, 0.04871537981514809, 0.23064392134146663, 0.26262872405750776, 0.021555903795102024, 0.14863469613395552, -0.03157880861482393, -0.10894007179185107, -0.30688471755235686, -0.22898644969988896, -0.1592492931472358, -0.04092852388238234, -0.008266401982406826, -0.15523712744595863, 0.34831624102454994, 0.22778540965850635, 0.09752973637503562, 0.023343665422671425, 0.3762621022760868, 0.055518476882078234, 0.08129496839217765, 0.0377393676649018, 0.18108577287745892, 0.07045952441240912, 0.1324639781177925, -0.18158036495949473, 0.10272291534259835, 0.03575347703180566] |
1,802.05621 | Low Vibration Laboratory with a Single-Stage Vibration Isolation for
Microscopy Applications | The construction and the vibrational performance of a low vibration
laboratory for microscopy applications comprising a 100 ton floating foundation
supported by passive pneumatic isolators (air springs), which rest themselves
on a 200 ton solid base plate is discussed. The optimization of the air spring
system lead to a vibration level on the floating floor below that induced by an
acceleration of 10 ng for most frequencies. Additional acoustic and
electromagnetic isolation is accomplished by a room-in-room concept.
| physics.ins-det | the construction and the vibrational performance of a low vibration laboratory for microscopy applications comprising a 100 ton floating foundation supported by passive pneumatic isolators air springs which rest themselves on a 200 ton solid base plate is discussed the optimization of the air spring system lead to a vibration level on the floating floor below that induced by an acceleration of 10 ng for most frequencies additional acoustic and electromagnetic isolation is accomplished by a roominroom concept | [['the', 'construction', 'and', 'the', 'vibrational', 'performance', 'of', 'a', 'low', 'vibration', 'laboratory', 'for', 'microscopy', 'applications', 'comprising', 'a', '100', 'ton', 'floating', 'foundation', 'supported', 'by', 'passive', 'pneumatic', 'isolators', 'air', 'springs', 'which', 'rest', 'themselves', 'on', 'a', '200', 'ton', 'solid', 'base', 'plate', 'is', 'discussed', 'the', 'optimization', 'of', 'the', 'air', 'spring', 'system', 'lead', 'to', 'a', 'vibration', 'level', 'on', 'the', 'floating', 'floor', 'below', 'that', 'induced', 'by', 'an', 'acceleration', 'of', '10', 'ng', 'for', 'most', 'frequencies', 'additional', 'acoustic', 'and', 'electromagnetic', 'isolation', 'is', 'accomplished', 'by', 'a', 'roominroom', 'concept']] | [-0.15409953887997704, 0.24547836230028355, -0.031849013387479565, -0.042956444347132146, -0.04438176503489641, -0.123666286547124, 0.0868701070370213, 0.34250674425781547, -0.22222916131941964, -0.316083160071791, 0.12158408528798587, -0.29132489104114184, -0.10832766130227935, 0.2699721520524714, -0.02242830783951205, 0.04877649151036734, 0.03786966963005917, 0.00282473970724681, 0.013841314849068786, -0.13022433499527442, 0.1823776230917542, 0.15541771798116433, 0.3116176398289571, 0.02773561938242479, 0.16163751681323174, -0.013661406925189998, 0.03526510002829328, -0.018009124697161864, -0.07446329868083, 0.10670186743720786, 0.2512506086669572, 0.030305922754084717, 0.27333188163382666, -0.469681594980421, -0.2070448314464899, 0.007959573082142062, 0.06280494520029464, 0.05643012215740156, -0.0706752524076199, -0.2751102861524983, 0.08449767798173254, -0.18159760554115495, -0.15162001120216853, -0.004251537991191757, -0.008492499196829347, 0.012350769386953347, -0.17559730836686183, 0.03002187189972633, 0.03370535755892853, 0.16332269964328447, -0.08743657442958808, -0.12106818307112516, 0.006458267775158603, 0.06670966813516162, -0.026303790189180668, 0.006899618751191014, 0.27655980405216285, -0.0900467383772038, -0.05222958366253546, 0.42130836043748765, -0.09211604289299288, -0.16913444664958235, 0.21685963259501892, -0.0643918710857533, -0.019985062033905612, 0.18794406558592597, 0.1748720740826873, 0.03605376012236267, -0.17755730621903748, -0.008974525894192592, 0.016380959650041996, 0.2203397618171263, 0.19197335085746917, -0.02647777069692633, 0.24912624272167103, 0.2502405965676555, 0.0829576400060255, 0.134812250043199, -0.10535539150866982, 0.028843923441630292, -0.3108499670377025, -0.1425227449103954, -0.17114521444521166, 0.044007141282177205, -0.028055911570184187, -0.15749327844468416, 0.36029405394181996, 0.04667189214136693, 0.12940033178099178, 0.007426332695978125, 0.35060296826935433, 0.02331442613299791, 0.07428969621851847, 0.025105998355459857, 0.30421082771613034, 0.11786566492980467, 0.10711501094863399, -0.2006383545382263, -0.00934101024932869, 0.005627715636601115] |
1,802.05622 | Conditioning of three-dimensional generative adversarial networks for
pore and reservoir-scale models | Geostatistical modeling of petrophysical properties is a key step in modern
integrated oil and gas reservoir studies. Recently, generative adversarial
networks (GAN) have been shown to be a successful method for generating
unconditional simulations of pore- and reservoir-scale models. This
contribution leverages the differentiable nature of neural networks to extend
GANs to the conditional simulation of three-dimensional pore- and
reservoir-scale models. Based on the previous work of Yeh et al. (2016), we use
a content loss to constrain to the conditioning data and a perceptual loss
obtained from the evaluation of the GAN discriminator network. The technique is
tested on the generation of three-dimensional micro-CT images of a Ketton
limestone constrained by two-dimensional cross-sections, and on the simulation
of the Maules Creek alluvial aquifer constrained by one-dimensional sections.
Our results show that GANs represent a powerful method for sampling conditioned
pore and reservoir samples for stochastic reservoir evaluation workflows.
| stat.ML cs.CV physics.geo-ph | geostatistical modeling of petrophysical properties is a key step in modern integrated oil and gas reservoir studies recently generative adversarial networks gan have been shown to be a successful method for generating unconditional simulations of pore and reservoirscale models this contribution leverages the differentiable nature of neural networks to extend gans to the conditional simulation of threedimensional pore and reservoirscale models based on the previous work of yeh et al 2016 we use a content loss to constrain to the conditioning data and a perceptual loss obtained from the evaluation of the gan discriminator network the technique is tested on the generation of threedimensional microct images of a ketton limestone constrained by twodimensional crosssections and on the simulation of the maules creek alluvial aquifer constrained by onedimensional sections our results show that gans represent a powerful method for sampling conditioned pore and reservoir samples for stochastic reservoir evaluation workflows | [['geostatistical', 'modeling', 'of', 'petrophysical', 'properties', 'is', 'a', 'key', 'step', 'in', 'modern', 'integrated', 'oil', 'and', 'gas', 'reservoir', 'studies', 'recently', 'generative', 'adversarial', 'networks', 'gan', 'have', 'been', 'shown', 'to', 'be', 'a', 'successful', 'method', 'for', 'generating', 'unconditional', 'simulations', 'of', 'pore', 'and', 'reservoirscale', 'models', 'this', 'contribution', 'leverages', 'the', 'differentiable', 'nature', 'of', 'neural', 'networks', 'to', 'extend', 'gans', 'to', 'the', 'conditional', 'simulation', 'of', 'threedimensional', 'pore', 'and', 'reservoirscale', 'models', 'based', 'on', 'the', 'previous', 'work', 'of', 'yeh', 'et', 'al', '2016', 'we', 'use', 'a', 'content', 'loss', 'to', 'constrain', 'to', 'the', 'conditioning', 'data', 'and', 'a', 'perceptual', 'loss', 'obtained', 'from', 'the', 'evaluation', 'of', 'the', 'gan', 'discriminator', 'network', 'the', 'technique', 'is', 'tested', 'on', 'the', 'generation', 'of', 'threedimensional', 'microct', 'images', 'of', 'a', 'ketton', 'limestone', 'constrained', 'by', 'twodimensional', 'crosssections', 'and', 'on', 'the', 'simulation', 'of', 'the', 'maules', 'creek', 'alluvial', 'aquifer', 'constrained', 'by', 'onedimensional', 'sections', 'our', 'results', 'show', 'that', 'gans', 'represent', 'a', 'powerful', 'method', 'for', 'sampling', 'conditioned', 'pore', 'and', 'reservoir', 'samples', 'for', 'stochastic', 'reservoir', 'evaluation', 'workflows']] | [0.009939963455321523, 0.02302945611523209, -0.0797254649080234, 0.062109697866891446, -0.0408856369067009, -0.10064407279204628, 0.008036423216203917, 0.4199271878763421, -0.22746169517033618, -0.3126009907445883, 0.062289408066035695, -0.2599855249704576, -0.18394542708259382, 0.20593314784920252, -0.09691537204772642, 0.15210740001272563, 0.10971268602449141, -0.08787466273866339, -0.014327014906472233, -0.2753909450942931, 0.2932536256856808, 0.09918317731393322, 0.3399288790836318, 0.03528399134137706, 0.15469521245490983, -0.05363739660162836, -0.040424073838998806, 0.0020231091543355933, -0.12366007361346767, 0.17832076386867524, 0.22977092132604823, 0.1433756057881074, 0.2980723986912468, -0.46700355285549, -0.3032874419953521, 0.062038028925300054, 0.08047007787585966, 0.09294201414920517, -0.06167133747558556, -0.3218387262672441, 0.058785875617129384, -0.16624188766980622, -0.0262865692740689, -0.09336577612892343, -0.02473433308139099, 0.029453033201830233, -0.3260082128985581, 0.054815109761763514, 0.06869328012753738, 0.04846142227314923, -0.044733677910998054, -0.11264863704037789, -0.06416343151087783, 0.10768896147803314, -0.014557574889207999, 0.040046110247701966, 0.16413686655689835, -0.1408222775335411, -0.12385440762122864, 0.3159948873958767, -0.05869462661929939, -0.17836710818355891, 0.17965433807654485, -0.05271947679224692, -0.12039528509971928, 0.10437438838432658, 0.25420582659976326, 0.12200591924332388, -0.17955415285103124, 0.03705451592614823, -0.058985529137354296, 0.1453876405304907, 0.017096337932480932, -0.04668635709453629, 0.169093439357486, 0.2701365614871252, -0.002328850662220933, 0.1480056197830629, -0.13709804407569695, -0.10799487232356587, -0.2081190495463152, -0.1551295186150564, -0.2411719293139033, 0.02249018644056066, -0.05707519574107583, -0.16038756971131876, 0.3745638238049227, 0.20089959164392457, 0.21804123800503064, 0.09362832237392256, 0.32120695048050113, 0.03825476416426532, 0.09217394151954517, 0.05668137869670069, 0.19174997730811338, 0.1363227517513099, 0.12955830771035884, -0.17468646445075586, 0.11440528447306013, 0.06800717229265975] |
1,802.05623 | An $O(1)$-Approximation Algorithm for Dynamic Weighted Vertex Cover with
Soft Capacity | This study considers the (soft) capacitated vertex cover problem in a dynamic
setting. This problem generalizes the dynamic model of the vertex cover
problem, which has been intensively studied in recent years. Given a
dynamically changing vertex-weighted graph $G=(V,E)$, which allows edge
insertions and edge deletions, the goal is to design a data structure that
maintains an approximate minimum vertex cover while satisfying the capacity
constraint of each vertex. That is, when picking a copy of a vertex $v$ in the
cover, the number of $v$'s incident edges covered by the copy is up to a given
capacity of $v$. We extend Bhattacharya et al.'s work [SODA'15 and ICALP'15] to
obtain a deterministic primal-dual algorithm for maintaining a constant-factor
approximate minimum capacitated vertex cover with $O(\log n / \epsilon)$
amortized update time, where $n$ is the number of vertices in the graph. The
algorithm can be extended to (1) a more general model in which each edge is
associated with a nonuniform and unsplittable demand, and (2) the more general
capacitated set cover problem.
| cs.DS | this study considers the soft capacitated vertex cover problem in a dynamic setting this problem generalizes the dynamic model of the vertex cover problem which has been intensively studied in recent years given a dynamically changing vertexweighted graph gve which allows edge insertions and edge deletions the goal is to design a data structure that maintains an approximate minimum vertex cover while satisfying the capacity constraint of each vertex that is when picking a copy of a vertex v in the cover the number of vs incident edges covered by the copy is up to a given capacity of v we extend bhattacharya et als work soda15 and icalp15 to obtain a deterministic primaldual algorithm for maintaining a constantfactor approximate minimum capacitated vertex cover with olog n epsilon amortized update time where n is the number of vertices in the graph the algorithm can be extended to 1 a more general model in which each edge is associated with a nonuniform and unsplittable demand and 2 the more general capacitated set cover problem | [['this', 'study', 'considers', 'the', 'soft', 'capacitated', 'vertex', 'cover', 'problem', 'in', 'a', 'dynamic', 'setting', 'this', 'problem', 'generalizes', 'the', 'dynamic', 'model', 'of', 'the', 'vertex', 'cover', 'problem', 'which', 'has', 'been', 'intensively', 'studied', 'in', 'recent', 'years', 'given', 'a', 'dynamically', 'changing', 'vertexweighted', 'graph', 'gve', 'which', 'allows', 'edge', 'insertions', 'and', 'edge', 'deletions', 'the', 'goal', 'is', 'to', 'design', 'a', 'data', 'structure', 'that', 'maintains', 'an', 'approximate', 'minimum', 'vertex', 'cover', 'while', 'satisfying', 'the', 'capacity', 'constraint', 'of', 'each', 'vertex', 'that', 'is', 'when', 'picking', 'a', 'copy', 'of', 'a', 'vertex', 'v', 'in', 'the', 'cover', 'the', 'number', 'of', 'vs', 'incident', 'edges', 'covered', 'by', 'the', 'copy', 'is', 'up', 'to', 'a', 'given', 'capacity', 'of', 'v', 'we', 'extend', 'bhattacharya', 'et', 'als', 'work', 'soda15', 'and', 'icalp15', 'to', 'obtain', 'a', 'deterministic', 'primaldual', 'algorithm', 'for', 'maintaining', 'a', 'constantfactor', 'approximate', 'minimum', 'capacitated', 'vertex', 'cover', 'with', 'olog', 'n', 'epsilon', 'amortized', 'update', 'time', 'where', 'n', 'is', 'the', 'number', 'of', 'vertices', 'in', 'the', 'graph', 'the', 'algorithm', 'can', 'be', 'extended', 'to', '1', 'a', 'more', 'general', 'model', 'in', 'which', 'each', 'edge', 'is', 'associated', 'with', 'a', 'nonuniform', 'and', 'unsplittable', 'demand', 'and', '2', 'the', 'more', 'general', 'capacitated', 'set', 'cover', 'problem']] | [-0.15457513928278807, 0.0848565796314304, -0.01981962674615011, -0.0021555792477057243, -0.1290552810270533, -0.20750952576087905, 0.12907722251048323, 0.3649761559942339, -0.2977105979915342, -0.3527620793616324, 0.0772851494839415, -0.2980157687003903, -0.12699090468702634, 0.0666147136732376, -0.14164701422724896, 0.07436575524164418, 0.09289204985013695, 0.08262133092560262, 0.027232407829105167, -0.2803576241689465, 0.2318467148929576, 0.010097339108715513, 0.19224893262426804, 0.07267751489803626, 0.08132889888892314, 0.09314045261839307, -0.017368816490678084, 0.09126177366225405, -0.141123683859794, 0.07851372654092191, 0.26930840662815153, 0.17703386076801386, 0.30225437591148463, -0.3998541392310592, -0.19460434749227212, 0.15897718122272048, 0.09661404689911193, 0.07171687027210683, 7.684165500831182e-05, -0.1617888836842838, 0.12591964473969416, -0.15046697804392073, -0.07355345503731249, 0.06011180475696039, 0.08339204898136372, -0.022797259176755593, -0.34597371194970583, -0.0407696980956102, 0.04437575985090753, -0.04560164810290205, 0.014530295021280195, -0.13020614363425384, -0.011433462847853241, 0.08864508752762933, -0.0792877317535438, 0.15167454387212032, 0.04005492585334346, -0.14651754646255188, -0.17708538475882457, 0.38127800704631415, -0.004485815911516117, -0.15947983517295364, 0.06890945156162734, -0.07840101222502273, -0.17836497524871647, 0.15016095109574626, 0.1752033818087869, 0.16558866764585664, -0.14083347152429027, 0.16712158814077993, -0.1388752463009919, 0.10018578865915279, 0.10619416350304994, -0.0010707826788316486, 0.10223843004403776, 0.19932755236809999, 0.21821236510281963, 0.1933116700568888, -0.022406765362422785, -0.06294400375767079, -0.2705821349700062, -0.07333773386871949, -0.200373689590205, 0.004406804014320319, -0.12690360831719893, -0.17354667013930963, 0.44566911022378014, 0.10223898508133787, 0.24910132567575902, 0.11166586830306628, 0.27898885869297246, 0.09556658540906537, 0.04829996875406518, 0.21159152605576237, 0.11023718884720796, 0.10565451431327709, 0.040975089859206636, -0.20298719146515032, 0.09563353926705793, 0.11745853718596301] |
1,802.05624 | Hunting Down Magnetic Monopoles in 2D Topological Insulators | Contrary to the electric charge that generates the electric field, magnetic
charge (namely magnetic monopoles) does not exist in the elementary
electromagnetism. Consequently, magnetic flux lines only form loops and cannot
have a source or a sink in nature. It is thus extraordinary to find that
magnetic monopoles can be pictured conceptually in topological materials.
Specifically in the 2D topological insulators, the topological invariant
corresponds to the total flux of an effective magnetic field (the Berry
curvature) over the reciprocal space.It is thus tempting to wrap the 2D
reciprocal space into a compact manifold--a torus, and imagine the total flux
to originate from magnetic monopoles inside the torus with a quantized total
charge. However, such a physically appealing picture has not been realized
quantitatively: other than their existence in a toy (actually misleading)
picture, the properties of the magnetic monopoles remain unknown. Here, we will
address this long-standing problem by hunting down the magnetic monopoles in
the reciprocal $k$-space. We will show that a simple and physically useful
picture will arrive upon analytically continuing the system to a third
imaginary momentum space. We then illustrate the evolution of the magnetic
monopoles across the topological phase transition and use it to provide natural
explanations on: 1) discontinuous jump of integer topological invariants, 2)
the semi-metallic nature on the phase boundary, and 3) how a change of global
topology can be induced via a local change in reciprocal space.
| cond-mat.mes-hall cond-mat.mtrl-sci | contrary to the electric charge that generates the electric field magnetic charge namely magnetic monopoles does not exist in the elementary electromagnetism consequently magnetic flux lines only form loops and cannot have a source or a sink in nature it is thus extraordinary to find that magnetic monopoles can be pictured conceptually in topological materials specifically in the 2d topological insulators the topological invariant corresponds to the total flux of an effective magnetic field the berry curvature over the reciprocal spaceit is thus tempting to wrap the 2d reciprocal space into a compact manifolda torus and imagine the total flux to originate from magnetic monopoles inside the torus with a quantized total charge however such a physically appealing picture has not been realized quantitatively other than their existence in a toy actually misleading picture the properties of the magnetic monopoles remain unknown here we will address this longstanding problem by hunting down the magnetic monopoles in the reciprocal kspace we will show that a simple and physically useful picture will arrive upon analytically continuing the system to a third imaginary momentum space we then illustrate the evolution of the magnetic monopoles across the topological phase transition and use it to provide natural explanations on 1 discontinuous jump of integer topological invariants 2 the semimetallic nature on the phase boundary and 3 how a change of global topology can be induced via a local change in reciprocal space | [['contrary', 'to', 'the', 'electric', 'charge', 'that', 'generates', 'the', 'electric', 'field', 'magnetic', 'charge', 'namely', 'magnetic', 'monopoles', 'does', 'not', 'exist', 'in', 'the', 'elementary', 'electromagnetism', 'consequently', 'magnetic', 'flux', 'lines', 'only', 'form', 'loops', 'and', 'can', 'not', 'have', 'a', 'source', 'or', 'a', 'sink', 'in', 'nature', 'it', 'is', 'thus', 'extraordinary', 'to', 'find', 'that', 'magnetic', 'monopoles', 'can', 'be', 'pictured', 'conceptually', 'in', 'topological', 'materials', 'specifically', 'in', 'the', '2d', 'topological', 'insulators', 'the', 'topological', 'invariant', 'corresponds', 'to', 'the', 'total', 'flux', 'of', 'an', 'effective', 'magnetic', 'field', 'the', 'berry', 'curvature', 'over', 'the', 'reciprocal', 'spaceit', 'is', 'thus', 'tempting', 'to', 'wrap', 'the', '2d', 'reciprocal', 'space', 'into', 'a', 'compact', 'manifolda', 'torus', 'and', 'imagine', 'the', 'total', 'flux', 'to', 'originate', 'from', 'magnetic', 'monopoles', 'inside', 'the', 'torus', 'with', 'a', 'quantized', 'total', 'charge', 'however', 'such', 'a', 'physically', 'appealing', 'picture', 'has', 'not', 'been', 'realized', 'quantitatively', 'other', 'than', 'their', 'existence', 'in', 'a', 'toy', 'actually', 'misleading', 'picture', 'the', 'properties', 'of', 'the', 'magnetic', 'monopoles', 'remain', 'unknown', 'here', 'we', 'will', 'address', 'this', 'longstanding', 'problem', 'by', 'hunting', 'down', 'the', 'magnetic', 'monopoles', 'in', 'the', 'reciprocal', 'kspace', 'we', 'will', 'show', 'that', 'a', 'simple', 'and', 'physically', 'useful', 'picture', 'will', 'arrive', 'upon', 'analytically', 'continuing', 'the', 'system', 'to', 'a', 'third', 'imaginary', 'momentum', 'space', 'we', 'then', 'illustrate', 'the', 'evolution', 'of', 'the', 'magnetic', 'monopoles', 'across', 'the', 'topological', 'phase', 'transition', 'and', 'use', 'it', 'to', 'provide', 'natural', 'explanations', 'on', '1', 'discontinuous', 'jump', 'of', 'integer', 'topological', 'invariants', '2', 'the', 'semimetallic', 'nature', 'on', 'the', 'phase', 'boundary', 'and', '3', 'how', 'a', 'change', 'of', 'global', 'topology', 'can', 'be', 'induced', 'via', 'a', 'local', 'change', 'in', 'reciprocal', 'space']] | [-0.18534854529936354, 0.2245249170147473, -0.075856793495013, 0.10437346341624809, -0.12599099361050858, -0.0975529206052171, 0.059381281484492156, 0.3789282648859522, -0.25654530573738465, -0.30747687392612677, 0.05890257404341052, -0.24532933051762748, -0.17166279641963456, 0.15541028901875678, -0.040875986036707015, -0.024818819898911576, -0.04508788674826172, 0.0507690251436731, -0.09845218151898166, -0.20251907455982476, 0.3141542933173949, -0.006845080692572558, 0.2674244803313622, 0.08018829157813707, 0.05707541834075497, -0.03471138375477076, 0.046211241913432816, 0.07148270446324292, -0.10253117841278288, 0.05296588080339841, 0.1968603071477657, 0.01305915598800791, 0.18749344505110307, -0.46949910817329893, -0.23140174574277636, 0.10733845554398302, 0.1595453030443534, 0.1056004874526134, -0.04781942036644387, -0.2763171353228076, 0.08125614133007227, -0.11710052947486252, -0.14042761457793196, -0.11796243384456899, 0.033672331884416914, -0.03698740633281207, -0.20655773003400943, 0.046610713489761355, 0.0710414994548798, 0.043429503956110165, -0.10935665796783985, -0.0448288916416647, -0.0821940846906244, 0.1087696091419298, 0.06337335543418861, 0.08913288037941049, 0.1374339760469768, -0.13523395751988052, -0.12790215043360878, 0.3748178560491101, -0.02721103285381596, -0.20683488449993453, 0.16989277944141676, -0.17793272642265487, -0.09457019191306038, 0.1829423177614022, 0.12683321615751786, 0.09810278234602529, -0.10588498143793598, 0.0920996435882056, -0.06052574733781082, 0.14089350002318746, 0.017246965935870315, 0.03720692052891014, 0.3224950563653769, 0.10592073739706716, 0.09305606223151622, 0.12702898399654838, -0.08139111998491971, -0.07366105108738008, -0.3007818431306615, -0.19901802645846886, -0.219796268564142, 0.10991980109032477, -0.04755176425358145, -0.1932976553275521, 0.3969525032203236, 0.16352699148048203, 0.2023344643410091, -0.06038628613518822, 0.27274094319623354, 0.10753866858025894, 0.07929047300747522, 0.06906487541356741, 0.24966458228165245, 0.13992192729608105, 0.14609932361017394, -0.21372759642589342, 0.007210451070187841, 0.08223793808496577] |
1,802.05625 | Alone on a wide wide sea. The origin of SECCO 1, an isolated
star-forming gas cloud in the Virgo cluster | SECCO1 is an extremely dark, low-mass (M_star=10^5 M_sun), star-forming
stellar system lying in the Low Velocity Cloud (LVC) substructure of the Virgo
cluster of galaxies, and hosting several HII regions. Here we review our
knowledge of this remarkable system, and present the results of (a) additional
analysis of our panoramic spectroscopic observations with MUSE, (b) the
combined analysis of Hubble Space Telescope and MUSE data, and (c) new
narrow-band observations obtained with OSIRIS@GTC to search for additional HII
regions in the surroundings of the system. We provide new evidence supporting
an age as young as 4 Myr for the stars that are currently ionising the gas in
SECCO1. We identify only one new promising candidate HII region possibly
associated with SECCO1, thus confirming the extreme isolation of the system. We
also identify three additional candidate pressure-supported dark clouds in
Virgo among the targets of the SECCO survey. Various possible hypotheses for
the nature and origin of SECCO1 are considered and discussed, also with the
help of dedicated hydrodynamical simulations showing that a hydrogen cloud with
the characteristics of SECCO1 can likely survive for >1 Gyr while traveling
within the LVC Intra Cluster Medium.
| astro-ph.GA | secco1 is an extremely dark lowmass m_star105 m_sun starforming stellar system lying in the low velocity cloud lvc substructure of the virgo cluster of galaxies and hosting several hii regions here we review our knowledge of this remarkable system and present the results of a additional analysis of our panoramic spectroscopic observations with muse b the combined analysis of hubble space telescope and muse data and c new narrowband observations obtained with osirisgtc to search for additional hii regions in the surroundings of the system we provide new evidence supporting an age as young as 4 myr for the stars that are currently ionising the gas in secco1 we identify only one new promising candidate hii region possibly associated with secco1 thus confirming the extreme isolation of the system we also identify three additional candidate pressuresupported dark clouds in virgo among the targets of the secco survey various possible hypotheses for the nature and origin of secco1 are considered and discussed also with the help of dedicated hydrodynamical simulations showing that a hydrogen cloud with the characteristics of secco1 can likely survive for 1 gyr while traveling within the lvc intra cluster medium | [['secco1', 'is', 'an', 'extremely', 'dark', 'lowmass', 'm_star105', 'm_sun', 'starforming', 'stellar', 'system', 'lying', 'in', 'the', 'low', 'velocity', 'cloud', 'lvc', 'substructure', 'of', 'the', 'virgo', 'cluster', 'of', 'galaxies', 'and', 'hosting', 'several', 'hii', 'regions', 'here', 'we', 'review', 'our', 'knowledge', 'of', 'this', 'remarkable', 'system', 'and', 'present', 'the', 'results', 'of', 'a', 'additional', 'analysis', 'of', 'our', 'panoramic', 'spectroscopic', 'observations', 'with', 'muse', 'b', 'the', 'combined', 'analysis', 'of', 'hubble', 'space', 'telescope', 'and', 'muse', 'data', 'and', 'c', 'new', 'narrowband', 'observations', 'obtained', 'with', 'osirisgtc', 'to', 'search', 'for', 'additional', 'hii', 'regions', 'in', 'the', 'surroundings', 'of', 'the', 'system', 'we', 'provide', 'new', 'evidence', 'supporting', 'an', 'age', 'as', 'young', 'as', '4', 'myr', 'for', 'the', 'stars', 'that', 'are', 'currently', 'ionising', 'the', 'gas', 'in', 'secco1', 'we', 'identify', 'only', 'one', 'new', 'promising', 'candidate', 'hii', 'region', 'possibly', 'associated', 'with', 'secco1', 'thus', 'confirming', 'the', 'extreme', 'isolation', 'of', 'the', 'system', 'we', 'also', 'identify', 'three', 'additional', 'candidate', 'pressuresupported', 'dark', 'clouds', 'in', 'virgo', 'among', 'the', 'targets', 'of', 'the', 'secco', 'survey', 'various', 'possible', 'hypotheses', 'for', 'the', 'nature', 'and', 'origin', 'of', 'secco1', 'are', 'considered', 'and', 'discussed', 'also', 'with', 'the', 'help', 'of', 'dedicated', 'hydrodynamical', 'simulations', 'showing', 'that', 'a', 'hydrogen', 'cloud', 'with', 'the', 'characteristics', 'of', 'secco1', 'can', 'likely', 'survive', 'for', '1', 'gyr', 'while', 'traveling', 'within', 'the', 'lvc', 'intra', 'cluster', 'medium']] | [-0.1010384335498505, 0.07192460428526222, -0.06436249554341582, 0.07270822227701501, -0.09154006943208515, -0.06114067382683667, 0.0693003080705239, 0.41197528317570686, -0.14392917948983572, -0.35755896375970525, 0.071330037444568, -0.265859235553459, -0.05556325989891775, 0.19864981987241967, 0.005172585335913027, -0.035789090437901905, 0.09299743274944679, -0.06509780891049861, 0.003195715684645014, -0.27154840691946447, 0.3286779608024517, 0.08144616127295497, 0.12236538138131436, -0.025461559886025498, 0.06414837010925112, -0.11288368557628321, -0.09415079990867525, -0.04574779423410291, -0.15239640813683764, 0.08102729812768909, 0.23344650568590927, 0.16542241678447075, 0.2528081370862007, -0.361782284322544, -0.20019233940183767, 0.04845894693789887, 0.22870520382942536, 0.02871642598741649, -0.10902657238451259, -0.3433005202896311, 0.08823495145285658, -0.18421355634806483, -0.2180345098070878, 0.031146088644163683, 0.027672834438817517, 0.049429062826372196, -0.21531110535291495, 0.12290715457523523, -0.026334225600294303, 0.07064874600231026, -0.16018466801809458, -0.12270492173168653, -0.032426244319746424, 0.09978650709611732, -0.011305931086705337, 0.05857615746693531, 0.15211527759007973, -0.1878246237623292, -0.024088652644422837, 0.3914091322997895, -0.05106325770369343, 0.007856592531121956, 0.29344574637555826, -0.19076744389652353, -0.21656843592063524, 0.12698260290502125, 0.1449927178643217, 0.0918987115995454, -0.17399836038991148, -0.0008582064139469973, -0.05030423378047999, 0.19177843636740968, 0.00373038984980667, 0.10671113721036818, 0.2973052117158659, 0.14938198764563518, 0.04353154617759477, 0.11632585531333461, -0.2332965585959149, -0.042325797628109285, -0.2832472538987834, -0.1644511794365826, -0.10404459854301724, 0.013577718173110043, -0.13660295903855513, -0.11522787034967526, 0.3022795526412665, 0.1347828808623793, 0.20021266982439556, -0.0007002446830786843, 0.3078170658651895, 0.017676839444902726, 0.107502580268374, 0.0988187949769781, 0.27655747252235113, 0.146453096512649, 0.07482720140130066, -0.21789648729190958, 0.04195514931780053, -0.03959408868710549] |
1,802.05626 | Contributions to the asymptotic study of Hermite driven processes | This thesis consists of two parts.
Part I is an introduction to Hermite processes, Hermite random fields, Fisher
information and to the papers constituting the thesis. More precisely, in
Section 1 we introduce Hermite processes in a nutshell, as well as some of its
basic properties. It is the necessary background for the articles [a] and [c].
In Section 2 we consider briefly the multiparameter Hermite random fields and
we study some less elementary facts which are used in the article [b]. In
section 3, we recall some terminology about Fisher information related to the
article [d]. Finally, our articles [a] to [d] are summarised in Section 4.
Part II consists of the articles themselves:
[a] T.T. Diu Tran (2017): Non-central limit theorem for quadratic functionals
of Hermite-driven long memory moving average processes. \textit{Stochastic and
Dynamics}, \textbf{18}, no. 4.
[b] T.T. Diu Tran (2016): Asymptotic behavior for quadratic variations of
non-Gaussian multiparameter Hermite random fields. Under revision for
\textit{Probability and Mathematical Statistics}.
[c] I. Nourdin, T.T. Diu Tran (2017): Statistical inference for Vasicek-type
model driven by Hermite processes. Submitted to \textit{Stochastic Process and
their Applications}.
[d] T.T. Diu Tran (2017+): Fisher information and multivariate Fouth Moment
Theorem. Main results have already been obtained. It should be submitted soon.
| math.PR | this thesis consists of two parts part i is an introduction to hermite processes hermite random fields fisher information and to the papers constituting the thesis more precisely in section 1 we introduce hermite processes in a nutshell as well as some of its basic properties it is the necessary background for the articles a and c in section 2 we consider briefly the multiparameter hermite random fields and we study some less elementary facts which are used in the article b in section 3 we recall some terminology about fisher information related to the article d finally our articles a to d are summarised in section 4 part ii consists of the articles themselves a tt diu tran 2017 noncentral limit theorem for quadratic functionals of hermitedriven long memory moving average processes textitstochastic and dynamics textbf18 no 4 b tt diu tran 2016 asymptotic behavior for quadratic variations of nongaussian multiparameter hermite random fields under revision for textitprobability and mathematical statistics c i nourdin tt diu tran 2017 statistical inference for vasicektype model driven by hermite processes submitted to textitstochastic process and their applications d tt diu tran 2017 fisher information and multivariate fouth moment theorem main results have already been obtained it should be submitted soon | [['this', 'thesis', 'consists', 'of', 'two', 'parts', 'part', 'i', 'is', 'an', 'introduction', 'to', 'hermite', 'processes', 'hermite', 'random', 'fields', 'fisher', 'information', 'and', 'to', 'the', 'papers', 'constituting', 'the', 'thesis', 'more', 'precisely', 'in', 'section', '1', 'we', 'introduce', 'hermite', 'processes', 'in', 'a', 'nutshell', 'as', 'well', 'as', 'some', 'of', 'its', 'basic', 'properties', 'it', 'is', 'the', 'necessary', 'background', 'for', 'the', 'articles', 'a', 'and', 'c', 'in', 'section', '2', 'we', 'consider', 'briefly', 'the', 'multiparameter', 'hermite', 'random', 'fields', 'and', 'we', 'study', 'some', 'less', 'elementary', 'facts', 'which', 'are', 'used', 'in', 'the', 'article', 'b', 'in', 'section', '3', 'we', 'recall', 'some', 'terminology', 'about', 'fisher', 'information', 'related', 'to', 'the', 'article', 'd', 'finally', 'our', 'articles', 'a', 'to', 'd', 'are', 'summarised', 'in', 'section', '4', 'part', 'ii', 'consists', 'of', 'the', 'articles', 'themselves', 'a', 'tt', 'diu', 'tran', '2017', 'noncentral', 'limit', 'theorem', 'for', 'quadratic', 'functionals', 'of', 'hermitedriven', 'long', 'memory', 'moving', 'average', 'processes', 'textitstochastic', 'and', 'dynamics', 'textbf18', 'no', '4', 'b', 'tt', 'diu', 'tran', '2016', 'asymptotic', 'behavior', 'for', 'quadratic', 'variations', 'of', 'nongaussian', 'multiparameter', 'hermite', 'random', 'fields', 'under', 'revision', 'for', 'textitprobability', 'and', 'mathematical', 'statistics', 'c', 'i', 'nourdin', 'tt', 'diu', 'tran', '2017', 'statistical', 'inference', 'for', 'vasicektype', 'model', 'driven', 'by', 'hermite', 'processes', 'submitted', 'to', 'textitstochastic', 'process', 'and', 'their', 'applications', 'd', 'tt', 'diu', 'tran', '2017', 'fisher', 'information', 'and', 'multivariate', 'fouth', 'moment', 'theorem', 'main', 'results', 'have', 'already', 'been', 'obtained', 'it', 'should', 'be', 'submitted', 'soon']] | [-0.07958506950398725, 0.09105307270450483, -0.07390634454559626, 0.08781627070861649, -0.06094342007687906, -0.11912054494250475, 0.016138835688172724, 0.3256858625142585, -0.25807152453173954, -0.24776008465304608, 0.11959588571179022, -0.3068361337205804, -0.160164018184594, 0.1686512227908413, -0.08207576102349998, 0.045459712952909216, 0.03540924378307309, 0.02223607618816015, -0.019060441106557847, -0.3277153635908645, 0.2759073626988272, 0.06810704339749929, 0.21353284681624757, 0.01570442469148874, 0.04927024481727219, 0.06095720613148154, -0.12561364924058135, -0.04168567476146741, -0.16010971146113262, 0.1006376997408707, 0.2533421393645723, 0.14351780943884146, 0.2664247420775454, -0.3623777004231403, -0.14190881004920455, 0.08251901014321825, 0.08284972340731722, 0.07266674323458928, 0.015056251991957585, -0.2860812696446551, 0.04551673239415012, -0.17704072236197024, -0.11582641898563541, -0.09330265068608086, 0.10142010203676252, 0.046354093886457566, -0.2720898498576589, 0.10333767984369088, 0.15413440808017806, 0.09712828265775632, 0.015387194199777186, -0.18914750668329539, 0.024260583762988085, 0.04333176183764164, 0.018042313160868816, 0.0359911748111566, 0.10057729425635643, -0.10594808337642107, -0.1382365664347961, 0.339116708184706, -0.07394291726082972, -0.171706432999089, 0.15781085324308994, -0.13441976980737796, -0.20217923391269657, 0.0750465304886059, 0.19135644048361516, 0.09776310989088038, -0.20040040712167578, 0.13488278722918662, 0.0014815277874288036, 0.1029249135245819, 0.10673008935480582, -0.0036572732877486, 0.12001238687917953, 0.09738211297293807, -0.016101062010473958, 0.09732078740702624, -0.04558472876698233, -0.09553970378573712, -0.3443512748654296, -0.19919093008175856, -0.16152028683118705, 0.0670834674386353, -0.04174353828967447, -0.14651315013264737, 0.37312311357023514, 0.12892308103079658, 0.15790922410059266, 0.026453735591366705, 0.22136382277055486, 0.09665614036536525, -0.017579323607752464, 0.10479034382918077, 0.15878393568947524, 0.19243244719350847, 0.1750632292159447, -0.06795837828071742, 0.026511903831780682, 0.09406478499948251] |
1,802.05627 | Crossovers and critical scaling in the one-dimensional transverse-field
Ising model | We consider the scaling behavior of thermodynamic quantities in the
one-dimensional transverse-field Ising model near its quantum critical point
(QCP). Our study has been motivated by the question about the thermodynamical
signatures of this paradigmatic quantum critical system and, more generally, by
the issue of how quantum criticality accumulates entropy. We find that the
crossovers in the phase diagram of temperature and (the non-thermal control
parameter) transverse field obey a general scaling ansatz, and so does the
critical scaling behavior of the specific heat and magnetic expansion
coefficient. Furthermore, the Gr\"{u}neisen ratio diverges in a power-law way
when the QCP is accessed as a function of the transverse field at zero
temperature, which follows the prediction of quantum critical scaling. However,
at the critical field, upon decreasing the temperature, the Gr\"uneisen ratio
approaches a constant instead of showing the expected divergence. We are able
to understand this unusual result in terms of a peculiar form of the quantum
critical scaling function for the free energy; the contribution to the
Gr\"uneisen ratio vanishes at the linear order in a suitable Taylor expansion
of the scaling function. In spite of this special form of the scaling function,
we show that the entropy is still maximized near the QCP, as expected from the
general scaling argument. Our results establish the telltale thermodynamic
signature of a transverse-field Ising chain, and will thus facilitate the
experimental identification of this model quantum-critical system in real
materials.
| cond-mat.str-el | we consider the scaling behavior of thermodynamic quantities in the onedimensional transversefield ising model near its quantum critical point qcp our study has been motivated by the question about the thermodynamical signatures of this paradigmatic quantum critical system and more generally by the issue of how quantum criticality accumulates entropy we find that the crossovers in the phase diagram of temperature and the nonthermal control parameter transverse field obey a general scaling ansatz and so does the critical scaling behavior of the specific heat and magnetic expansion coefficient furthermore the gruneisen ratio diverges in a powerlaw way when the qcp is accessed as a function of the transverse field at zero temperature which follows the prediction of quantum critical scaling however at the critical field upon decreasing the temperature the gruneisen ratio approaches a constant instead of showing the expected divergence we are able to understand this unusual result in terms of a peculiar form of the quantum critical scaling function for the free energy the contribution to the gruneisen ratio vanishes at the linear order in a suitable taylor expansion of the scaling function in spite of this special form of the scaling function we show that the entropy is still maximized near the qcp as expected from the general scaling argument our results establish the telltale thermodynamic signature of a transversefield ising chain and will thus facilitate the experimental identification of this model quantumcritical system in real materials | [['we', 'consider', 'the', 'scaling', 'behavior', 'of', 'thermodynamic', 'quantities', 'in', 'the', 'onedimensional', 'transversefield', 'ising', 'model', 'near', 'its', 'quantum', 'critical', 'point', 'qcp', 'our', 'study', 'has', 'been', 'motivated', 'by', 'the', 'question', 'about', 'the', 'thermodynamical', 'signatures', 'of', 'this', 'paradigmatic', 'quantum', 'critical', 'system', 'and', 'more', 'generally', 'by', 'the', 'issue', 'of', 'how', 'quantum', 'criticality', 'accumulates', 'entropy', 'we', 'find', 'that', 'the', 'crossovers', 'in', 'the', 'phase', 'diagram', 'of', 'temperature', 'and', 'the', 'nonthermal', 'control', 'parameter', 'transverse', 'field', 'obey', 'a', 'general', 'scaling', 'ansatz', 'and', 'so', 'does', 'the', 'critical', 'scaling', 'behavior', 'of', 'the', 'specific', 'heat', 'and', 'magnetic', 'expansion', 'coefficient', 'furthermore', 'the', 'gruneisen', 'ratio', 'diverges', 'in', 'a', 'powerlaw', 'way', 'when', 'the', 'qcp', 'is', 'accessed', 'as', 'a', 'function', 'of', 'the', 'transverse', 'field', 'at', 'zero', 'temperature', 'which', 'follows', 'the', 'prediction', 'of', 'quantum', 'critical', 'scaling', 'however', 'at', 'the', 'critical', 'field', 'upon', 'decreasing', 'the', 'temperature', 'the', 'gruneisen', 'ratio', 'approaches', 'a', 'constant', 'instead', 'of', 'showing', 'the', 'expected', 'divergence', 'we', 'are', 'able', 'to', 'understand', 'this', 'unusual', 'result', 'in', 'terms', 'of', 'a', 'peculiar', 'form', 'of', 'the', 'quantum', 'critical', 'scaling', 'function', 'for', 'the', 'free', 'energy', 'the', 'contribution', 'to', 'the', 'gruneisen', 'ratio', 'vanishes', 'at', 'the', 'linear', 'order', 'in', 'a', 'suitable', 'taylor', 'expansion', 'of', 'the', 'scaling', 'function', 'in', 'spite', 'of', 'this', 'special', 'form', 'of', 'the', 'scaling', 'function', 'we', 'show', 'that', 'the', 'entropy', 'is', 'still', 'maximized', 'near', 'the', 'qcp', 'as', 'expected', 'from', 'the', 'general', 'scaling', 'argument', 'our', 'results', 'establish', 'the', 'telltale', 'thermodynamic', 'signature', 'of', 'a', 'transversefield', 'ising', 'chain', 'and', 'will', 'thus', 'facilitate', 'the', 'experimental', 'identification', 'of', 'this', 'model', 'quantumcritical', 'system', 'in', 'real', 'materials']] | [-0.16432518444829233, 0.17573330516267258, -0.09829654492884098, 0.05354560471896548, -0.029512771978625098, -0.14232051148622607, 0.0972084905030594, 0.2742070419519829, -0.2672041942559493, -0.251036860809351, 0.05240804760105675, -0.3176150694518583, -0.1554111709226466, 0.18909356348255338, 0.0304419505642727, 0.10101270730689672, -0.05073614647505262, 0.07557350055042965, -0.10544199420449635, -0.1811272099391014, 0.32976761232712304, 0.08183811803804322, 0.33316608232077366, 0.09762521726467337, 0.04999319954464833, -0.011528885318981944, 0.06762746257591061, 0.04869581039141243, -0.19637974050353174, 0.009655786939401879, 0.21764473038298698, 0.020588577650293396, 0.22636008865990032, -0.3384892702335492, -0.22552661716084307, 0.09842591351092173, 0.1758133751359613, 0.09485109652499281, -0.005215329583067311, -0.21090248804733466, 0.039826957909584355, -0.14378236552486973, -0.17897976840419386, -0.09229334433330223, -0.005051940730481874, 0.004285835217160638, -0.23787550932417315, 0.1429459172145774, 0.08364828790654429, 0.09507415968885956, -0.0538702138151469, -0.0767109601899089, 0.010999854432884603, 0.11236315618892452, 0.07931034700838306, 0.07575360808405093, 0.16739292943578524, -0.17305029660249904, -0.08922068448058175, 0.35592837011208756, -0.058820556443727884, -0.13758720371406524, 0.16127586544316727, -0.20244434266157138, -0.12795067839033436, 0.09235601477412274, 0.11767602557277618, 0.07193924984118591, -0.1348341085960783, 0.10673733288494987, 0.006006045465862068, 0.15310328051515779, -0.0180444706173148, 0.020028441114603387, 0.24532816047139933, 0.13270368187998732, 0.033831353545732176, 0.20009324889106211, -0.06568945955368691, -0.15336182235890494, -0.32774211034023515, -0.17909213399980217, -0.23223993962019449, 0.09169247977552004, -0.15902028126844622, -0.20164192703038378, 0.3820031984418165, 0.1960687676982502, 0.22650418271756886, 0.04203634812292876, 0.248248540974843, 0.19789543024938513, 0.053049809667087784, 0.07915645905110674, 0.2525632942367035, 0.12356361044609608, 0.15445568803988863, -0.29578574527889334, 0.07280153038348848, 0.06433046224992722] |
1,802.05628 | Precursors of an upcoming solar cycle at high latitudes from coronal
green line data | After reviewing potential early indicators of an upcoming solar cycle at high
latitudes, we focus attention on the rush-to-the-poles (RTTP) phenomenon in
coronal green line emission. Considering various correlations between
properties of the RTTP with the upcoming solar cycle we find a correlation
between the rate of the RTTP and the time delay until the maximum of the next
solar cycle. On the basis of this correlation and the known internal
regularities of the sunspot number series we predict that, following a minimum
in 2019, cycle 25 will peak in late 2024 at an amplitude of about 130 (in terms
of smoothed monthly revised sunspot numbers). This slightly exceeds the
amplitude of cycle 24 but it would still make cycle 25 a fairly weak cycle.
| astro-ph.SR | after reviewing potential early indicators of an upcoming solar cycle at high latitudes we focus attention on the rushtothepoles rttp phenomenon in coronal green line emission considering various correlations between properties of the rttp with the upcoming solar cycle we find a correlation between the rate of the rttp and the time delay until the maximum of the next solar cycle on the basis of this correlation and the known internal regularities of the sunspot number series we predict that following a minimum in 2019 cycle 25 will peak in late 2024 at an amplitude of about 130 in terms of smoothed monthly revised sunspot numbers this slightly exceeds the amplitude of cycle 24 but it would still make cycle 25 a fairly weak cycle | [['after', 'reviewing', 'potential', 'early', 'indicators', 'of', 'an', 'upcoming', 'solar', 'cycle', 'at', 'high', 'latitudes', 'we', 'focus', 'attention', 'on', 'the', 'rushtothepoles', 'rttp', 'phenomenon', 'in', 'coronal', 'green', 'line', 'emission', 'considering', 'various', 'correlations', 'between', 'properties', 'of', 'the', 'rttp', 'with', 'the', 'upcoming', 'solar', 'cycle', 'we', 'find', 'a', 'correlation', 'between', 'the', 'rate', 'of', 'the', 'rttp', 'and', 'the', 'time', 'delay', 'until', 'the', 'maximum', 'of', 'the', 'next', 'solar', 'cycle', 'on', 'the', 'basis', 'of', 'this', 'correlation', 'and', 'the', 'known', 'internal', 'regularities', 'of', 'the', 'sunspot', 'number', 'series', 'we', 'predict', 'that', 'following', 'a', 'minimum', 'in', '2019', 'cycle', '25', 'will', 'peak', 'in', 'late', '2024', 'at', 'an', 'amplitude', 'of', 'about', '130', 'in', 'terms', 'of', 'smoothed', 'monthly', 'revised', 'sunspot', 'numbers', 'this', 'slightly', 'exceeds', 'the', 'amplitude', 'of', 'cycle', '24', 'but', 'it', 'would', 'still', 'make', 'cycle', '25', 'a', 'fairly', 'weak', 'cycle']] | [-0.1713484998871272, 0.18248908211746545, -0.022692899505097057, 0.11662658185495305, 0.006603960295192777, -0.034160537153272136, 0.10498609604509247, 0.3603202769769386, -0.2175550566452946, -0.36647614386052857, 0.1195383213851, -0.2592577272049722, -0.12711749730571623, 0.21304221372044976, -0.058413213788768306, -0.02320034040754, 0.09799936352553026, 0.04976797144439432, -0.04343674012136856, -0.24747021203379957, 0.20418782867660235, 0.15117602601141347, 0.2138335272714856, 0.038235792860148415, 0.05063402015084942, -0.03505478280449977, -0.0795611055199838, 0.004333294250236284, -0.12147546379814993, 0.05901715759002048, 0.1721635311541538, 0.17028507472376428, 0.2692293357104063, -0.44645560959414127, -0.1867029754530156, 0.09088939528690741, 0.10822797012834569, 0.03828811616967282, 0.023491934540816734, -0.16128204911646823, 0.060997400590549075, -0.16018442951533343, -0.13426135738019743, 0.09554647506334848, 0.11036022590293039, 0.03221757325433915, -0.21150376295929985, 0.07099560299332464, 0.0076474827937706704, 0.1613101968128655, -0.043630894701627475, -0.10122876964235347, -0.05359872332267133, 0.1420441006081209, 0.06157432276485188, 0.051585302474127424, 0.11178568834363814, -0.13620619234185846, -0.07183839294650111, 0.3627471157890414, -0.10418849858275105, 0.01868654049957836, 0.13204783849100604, -0.24543225633697735, -0.18172885086237184, 0.14806755550295836, 0.1475677409288173, 0.06332136604619483, -0.11480205985266835, -0.023277284490177408, -0.008817514960443782, 0.17688223014720866, 0.10500370774177774, 0.027396315186765167, 0.26370787825069253, 0.15476650493444816, 0.09374491998835677, 0.10142529755079698, -0.19046923983466602, -0.07634715117033451, -0.2978479315887295, -0.1021053996500409, -0.11249323217611339, 0.07568378811101278, -0.11612115138292035, -0.1443986132771017, 0.4714315794032788, 0.13362699974658748, 0.18967788242415765, 0.0548009107897674, 0.2330823895115886, 0.12347178915215115, 0.05271383795057303, 0.07562699660493602, 0.32282707190531634, 0.14437516041911178, 0.20233068658008932, -0.2325614995112823, 0.06166468087523695, 0.07873150081967094] |
1,802.05629 | Models of Type Theory Based on Moore Paths | This paper introduces a new family of models of intensional Martin-L\"of type
theory. We use constructive ordered algebra in toposes. Identity types in the
models are given by a notion of Moore path. By considering a particular gros
topos, we show that there is such a model that is non-truncated, i.e. contains
non-trivial structure at all dimensions. In other words, in this model a type
in a nested sequence of identity types can contain more than one element, no
matter how great the degree of nesting. Although inspired by existing
non-truncated models of type theory based on simplicial and cubical sets, the
notion of model presented here is notable for avoiding any form of Kan filling
condition in the semantics of types.
| cs.LO | this paper introduces a new family of models of intensional martinlof type theory we use constructive ordered algebra in toposes identity types in the models are given by a notion of moore path by considering a particular gros topos we show that there is such a model that is nontruncated ie contains nontrivial structure at all dimensions in other words in this model a type in a nested sequence of identity types can contain more than one element no matter how great the degree of nesting although inspired by existing nontruncated models of type theory based on simplicial and cubical sets the notion of model presented here is notable for avoiding any form of kan filling condition in the semantics of types | [['this', 'paper', 'introduces', 'a', 'new', 'family', 'of', 'models', 'of', 'intensional', 'martinlof', 'type', 'theory', 'we', 'use', 'constructive', 'ordered', 'algebra', 'in', 'toposes', 'identity', 'types', 'in', 'the', 'models', 'are', 'given', 'by', 'a', 'notion', 'of', 'moore', 'path', 'by', 'considering', 'a', 'particular', 'gros', 'topos', 'we', 'show', 'that', 'there', 'is', 'such', 'a', 'model', 'that', 'is', 'nontruncated', 'ie', 'contains', 'nontrivial', 'structure', 'at', 'all', 'dimensions', 'in', 'other', 'words', 'in', 'this', 'model', 'a', 'type', 'in', 'a', 'nested', 'sequence', 'of', 'identity', 'types', 'can', 'contain', 'more', 'than', 'one', 'element', 'no', 'matter', 'how', 'great', 'the', 'degree', 'of', 'nesting', 'although', 'inspired', 'by', 'existing', 'nontruncated', 'models', 'of', 'type', 'theory', 'based', 'on', 'simplicial', 'and', 'cubical', 'sets', 'the', 'notion', 'of', 'model', 'presented', 'here', 'is', 'notable', 'for', 'avoiding', 'any', 'form', 'of', 'kan', 'filling', 'condition', 'in', 'the', 'semantics', 'of', 'types']] | [-0.13089316317975735, 0.10054753433872915, -0.07059258517626, 0.09430260606373461, -0.08561467282764125, -0.15136250090922732, 0.04034401893951609, 0.33084279346875234, -0.29400770590625336, -0.24860456152284732, 0.045193066474118984, -0.2526723127048768, -0.18699203385803542, 0.15428726653974947, -0.1530711064334638, -0.07037253500263924, 0.03468432408551395, 0.06940349558994297, -0.053774528098521665, -0.2318676002142325, 0.408401522903749, -0.03774024119989977, 0.23678897467411322, -0.0036195621856289807, 0.08703223077034516, -0.005034723979436228, -0.022474446614486637, 0.07133874991817064, -0.12554957302056777, 0.15618681835896167, 0.2460629153792681, 0.16928574359273446, 0.2664592917416947, -0.40055586200696036, -0.21365338257422334, 0.12821740060892017, 0.09734237380707483, 0.09281568896391841, -0.041583723411155814, -0.24653138759255896, 0.11557058712513354, -0.20469336893963416, -0.1147442828581409, -0.05951141650391529, 0.030990061754757752, 0.008372019094674558, -0.23013091168879746, 0.035359743215357425, 0.141888442876764, 0.11477278837873066, -0.04424609085086916, -0.08255495461558954, -0.02428583278641349, 0.041161452866632676, -0.042987142980564386, 0.014430442051084132, 0.024224836974725373, -0.12873354415122046, -0.16493034850783098, 0.37729254142203766, -0.02967332807986436, -0.22993825435577359, 0.19662898918041258, -0.10115620411443906, -0.18870252694888803, 0.08497598963850712, 0.07388610164558546, 0.12447315344556434, -0.11848615206917366, 0.16678683329793456, -0.10414841542875425, 0.1571331314559354, 0.1049817898196214, 0.04941335716189389, 0.18858243441992853, 0.18822403115479916, 0.029978051132782072, 0.12832012643215063, 0.016102813457169372, -0.10937538066665169, -0.33498385803560254, -0.1460414819236173, -0.12473783880705014, 0.043833434177165634, -0.1038031748468085, -0.2269836232890604, 0.38536725277806344, 0.15051283570937812, 0.1495345262972806, 0.07438262854321082, 0.252672164311602, 0.062434014965413655, 0.10077848452234976, 0.040055485745723984, 0.12308174273243448, 0.11634534664812772, 0.008860980229238506, -0.08522256362618359, 0.08009189499740596, 0.19187129216199955] |
1,802.0563 | CNN+LSTM Architecture for Speech Emotion Recognition with Data
Augmentation | In this work we design a neural network for recognizing emotions in speech,
using the IEMOCAP dataset. Following the latest advances in audio analysis, we
use an architecture involving both convolutional layers, for extracting
high-level features from raw spectrograms, and recurrent ones for aggregating
long-term dependencies. We examine the techniques of data augmentation with
vocal track length perturbation, layer-wise optimizer adjustment, batch
normalization of recurrent layers and obtain highly competitive results of
64.5% for weighted accuracy and 61.7% for unweighted accuracy on four emotions.
| cs.SD cs.CL cs.LG eess.AS | in this work we design a neural network for recognizing emotions in speech using the iemocap dataset following the latest advances in audio analysis we use an architecture involving both convolutional layers for extracting highlevel features from raw spectrograms and recurrent ones for aggregating longterm dependencies we examine the techniques of data augmentation with vocal track length perturbation layerwise optimizer adjustment batch normalization of recurrent layers and obtain highly competitive results of 645 for weighted accuracy and 617 for unweighted accuracy on four emotions | [['in', 'this', 'work', 'we', 'design', 'a', 'neural', 'network', 'for', 'recognizing', 'emotions', 'in', 'speech', 'using', 'the', 'iemocap', 'dataset', 'following', 'the', 'latest', 'advances', 'in', 'audio', 'analysis', 'we', 'use', 'an', 'architecture', 'involving', 'both', 'convolutional', 'layers', 'for', 'extracting', 'highlevel', 'features', 'from', 'raw', 'spectrograms', 'and', 'recurrent', 'ones', 'for', 'aggregating', 'longterm', 'dependencies', 'we', 'examine', 'the', 'techniques', 'of', 'data', 'augmentation', 'with', 'vocal', 'track', 'length', 'perturbation', 'layerwise', 'optimizer', 'adjustment', 'batch', 'normalization', 'of', 'recurrent', 'layers', 'and', 'obtain', 'highly', 'competitive', 'results', 'of', '645', 'for', 'weighted', 'accuracy', 'and', '617', 'for', 'unweighted', 'accuracy', 'on', 'four', 'emotions']] | [-0.03470084992503481, -0.02849782190900268, -0.026284683085534544, 0.061067800440858785, -0.10311392364313915, -0.17337530612435548, 0.03273460580801059, 0.5050009966473139, -0.27655033011632485, -0.32719357014381484, 0.053570754788649665, -0.3318526435399517, -0.20993376647432646, 0.20302281730497876, -0.10787167856843942, 0.10681917007258605, 0.18554024629494442, 0.03758135524445346, -0.05667351713470582, -0.2604280432930127, 0.27676772065682426, 0.040666443922202145, 0.3327028329395467, -0.01693624939348194, 0.12929989876075915, 0.011984200895919154, -0.08435280392101656, -0.06387128422751889, -0.0569826939913799, 0.20257211152541763, 0.2945679675626923, 0.20132449851371348, 0.2900338894465849, -0.4443292599614887, -0.211477143999045, 0.03691589406558445, 0.11961923416016534, 0.10693242427493845, -0.006735031924022007, -0.3472662652354865, 0.10961331927406025, -0.16028074473364368, 0.07575617345892602, -0.17024143878647702, 0.007190832909795323, 0.007113893460925846, -0.3086908510096172, 0.05389803542389667, 0.09765804372173512, 0.1320731958119376, -0.09777599312586799, -0.1373949068642798, 0.04723352856845373, 0.19480261312925168, 0.013634102130752234, 0.04260987219666796, 0.13562651672067919, -0.2288623554160863, -0.14693715788667933, 0.2842292185606701, -0.13209160265424066, -0.18181424511463515, 0.1260100302086877, 0.017681568741820575, -0.1964486054022841, 0.06342029422965079, 0.27566948054923807, 0.0894367431756109, -0.1838788362829724, -0.06412593024946373, -0.011407243620072092, 0.23309304579050236, 0.11971892224391922, -0.018338393830206422, 0.12390858575236052, 0.3048209924212036, -0.03220863544958688, 0.1449515300364943, -0.16400647389292272, -0.014955228283291771, -0.18904930298837522, -0.0875177192834339, -0.1364885340666487, -0.04802281418856832, -0.1456114450586375, -0.1454855956101147, 0.4686039342944111, 0.21359433606266975, 0.2310527359645459, 0.17625981751119807, 0.33475094224281965, -0.003540466783479566, 0.09302350752321738, 0.10631255201241445, 0.16698548770537378, 0.017177025583805516, 0.1771879027143032, -0.16080243978233608, 0.08864630972744808, 0.08518023296104123] |
1,802.05631 | Direct Estimation of Differences in Causal Graphs | We consider the problem of estimating the differences between two causal
directed acyclic graph (DAG) models with a shared topological order given
i.i.d. samples from each model. This is of interest for example in genomics,
where changes in the structure or edge weights of the underlying causal graphs
reflect alterations in the gene regulatory networks. We here provide the first
provably consistent method for directly estimating the differences in a pair of
causal DAGs without separately learning two possibly large and dense DAG models
and computing their difference. Our two-step algorithm first uses invariance
tests between regression coefficients of the two data sets to estimate the
skeleton of the difference graph and then orients some of the edges using
invariance tests between regression residual variances. We demonstrate the
properties of our method through a simulation study and apply it to the
analysis of gene expression data from ovarian cancer and during T-cell
activation.
| stat.ME | we consider the problem of estimating the differences between two causal directed acyclic graph dag models with a shared topological order given iid samples from each model this is of interest for example in genomics where changes in the structure or edge weights of the underlying causal graphs reflect alterations in the gene regulatory networks we here provide the first provably consistent method for directly estimating the differences in a pair of causal dags without separately learning two possibly large and dense dag models and computing their difference our twostep algorithm first uses invariance tests between regression coefficients of the two data sets to estimate the skeleton of the difference graph and then orients some of the edges using invariance tests between regression residual variances we demonstrate the properties of our method through a simulation study and apply it to the analysis of gene expression data from ovarian cancer and during tcell activation | [['we', 'consider', 'the', 'problem', 'of', 'estimating', 'the', 'differences', 'between', 'two', 'causal', 'directed', 'acyclic', 'graph', 'dag', 'models', 'with', 'a', 'shared', 'topological', 'order', 'given', 'iid', 'samples', 'from', 'each', 'model', 'this', 'is', 'of', 'interest', 'for', 'example', 'in', 'genomics', 'where', 'changes', 'in', 'the', 'structure', 'or', 'edge', 'weights', 'of', 'the', 'underlying', 'causal', 'graphs', 'reflect', 'alterations', 'in', 'the', 'gene', 'regulatory', 'networks', 'we', 'here', 'provide', 'the', 'first', 'provably', 'consistent', 'method', 'for', 'directly', 'estimating', 'the', 'differences', 'in', 'a', 'pair', 'of', 'causal', 'dags', 'without', 'separately', 'learning', 'two', 'possibly', 'large', 'and', 'dense', 'dag', 'models', 'and', 'computing', 'their', 'difference', 'our', 'twostep', 'algorithm', 'first', 'uses', 'invariance', 'tests', 'between', 'regression', 'coefficients', 'of', 'the', 'two', 'data', 'sets', 'to', 'estimate', 'the', 'skeleton', 'of', 'the', 'difference', 'graph', 'and', 'then', 'orients', 'some', 'of', 'the', 'edges', 'using', 'invariance', 'tests', 'between', 'regression', 'residual', 'variances', 'we', 'demonstrate', 'the', 'properties', 'of', 'our', 'method', 'through', 'a', 'simulation', 'study', 'and', 'apply', 'it', 'to', 'the', 'analysis', 'of', 'gene', 'expression', 'data', 'from', 'ovarian', 'cancer', 'and', 'during', 'tcell', 'activation']] | [-0.07376714248219322, 0.057332022480812726, -0.05901900720265177, 0.085084471425492, -0.08683629265645507, -0.11324255949714118, 0.07804947608649682, 0.4107651002218131, -0.3071348539681411, -0.3012478671073183, 0.07313950522954947, -0.28691295460110006, -0.2156900916582588, 0.13810301496680777, -0.06315071675226433, 0.06085932495535102, 0.12433381787854327, 0.04622092244867387, -0.01825007202493307, -0.21965177727024698, 0.3225316538238058, -0.00040536911342463464, 0.29703817694003576, -0.006094853148728706, 0.12744395680146542, 0.008408647803650573, -0.07419938244932983, 0.04464487419494129, -0.12363920971622623, 0.1744843601433007, 0.28478196256070626, 0.19301246717766998, 0.2926937155075542, -0.44247549467604436, -0.20564762935699785, 0.168771252224794, 0.0815102234787119, 0.1220536663005238, -0.004666651145622037, -0.2637447537260824, 0.08332820690322204, -0.12554971852303282, -0.0034490991049001807, -0.04935946971713717, -0.009895035077884695, 0.011678100628260937, -0.31693954909337513, 0.1009649625945885, 0.049611735936814276, 0.09367810780779014, -0.04652802386698526, -0.11189869168561463, -0.04130661696670394, 0.1778719483409077, 0.056236053214353675, -0.003574774175991907, 0.10031607588205267, -0.12036734131724859, -0.17580593180434864, 0.31620990855655834, -0.025321671825961446, -0.219776186623361, 0.16282453338974734, -0.10844233410518153, -0.1977967975228976, 0.07354227745954216, 0.21126138875443562, 0.08735506812999257, -0.18047146744808498, 0.0388217944270639, -0.030520283043372377, 0.11837999774234406, 0.049552387853146966, -0.035181134628752865, 0.142886483073965, 0.18515903871579498, 0.037888940286767835, 0.16393517446133546, -0.10877240017159945, -0.07737489531023635, -0.2997162559380134, -0.1372719345099956, -0.20602857717769404, -0.037816595378197926, -0.20071184884076193, -0.19896685044902065, 0.4211447659721659, 0.16677741922766848, 0.24401282761976414, 0.10845205396812506, 0.28217871506619296, 0.03339369541332369, 0.05405215885386699, 0.09690128631731557, 0.12732003763827093, 0.15852148288836568, 0.020620416744088668, -0.2370420917777308, 0.16975556116922472, 0.04532228983950868] |
1,802.05632 | Strong* convergence of quantum channels | In [arXiv:1712.03219] the existence of a strongly (pointwise) converging
sequence of quantum channels that can not be represented as a reduction of a
sequence of unitary channels strongly converging to a unitary channel is shown.
In this work we give a simple characterization of sequences of quantum channels
that have the above representation. The corresponding convergence is called the
strong* convergence, since it is related to the convergence of selective
Stinespring isometries of quantum channels in the strong* operator topology.
Some properties of the strong* convergence of quantum channels are
considered. It is shown that for Bosonic Gaussian channels the strong*
convergence coincides with the strong convergence.
| quant-ph math-ph math.FA math.MP math.OA | in arxiv171203219 the existence of a strongly pointwise converging sequence of quantum channels that can not be represented as a reduction of a sequence of unitary channels strongly converging to a unitary channel is shown in this work we give a simple characterization of sequences of quantum channels that have the above representation the corresponding convergence is called the strong convergence since it is related to the convergence of selective stinespring isometries of quantum channels in the strong operator topology some properties of the strong convergence of quantum channels are considered it is shown that for bosonic gaussian channels the strong convergence coincides with the strong convergence | [['in', 'arxiv171203219', 'the', 'existence', 'of', 'a', 'strongly', 'pointwise', 'converging', 'sequence', 'of', 'quantum', 'channels', 'that', 'can', 'not', 'be', 'represented', 'as', 'a', 'reduction', 'of', 'a', 'sequence', 'of', 'unitary', 'channels', 'strongly', 'converging', 'to', 'a', 'unitary', 'channel', 'is', 'shown', 'in', 'this', 'work', 'we', 'give', 'a', 'simple', 'characterization', 'of', 'sequences', 'of', 'quantum', 'channels', 'that', 'have', 'the', 'above', 'representation', 'the', 'corresponding', 'convergence', 'is', 'called', 'the', 'strong', 'convergence', 'since', 'it', 'is', 'related', 'to', 'the', 'convergence', 'of', 'selective', 'stinespring', 'isometries', 'of', 'quantum', 'channels', 'in', 'the', 'strong', 'operator', 'topology', 'some', 'properties', 'of', 'the', 'strong', 'convergence', 'of', 'quantum', 'channels', 'are', 'considered', 'it', 'is', 'shown', 'that', 'for', 'bosonic', 'gaussian', 'channels', 'the', 'strong', 'convergence', 'coincides', 'with', 'the', 'strong', 'convergence']] | [-0.17640781745024658, 0.1499719250154295, -0.10522117789061565, 0.0625870580211686, 0.006210152297017147, -0.14615929220750365, 0.02172005225087182, 0.3728587995195445, -0.3161222120913905, -0.15208073252073998, 0.11431059814695234, -0.23991143706975118, -0.15918495669468957, 0.19246697032226706, -0.07903214199204911, 0.07052382542356357, 0.09296273173959838, 0.07548405648261872, -0.08574686083230981, -0.2591942333866719, 0.302096594915778, 0.0504610375720867, 0.274277048369975, 0.06368034339140889, 0.08110542012870593, -0.02418147725545151, 0.01193061941039731, -0.015373273194714819, -0.09855153244574948, 0.08704429078091569, 0.21732092319267257, 0.108457837611841, 0.2718644483137946, -0.350538305112354, -0.2088346397723862, 0.11964978389266245, 0.16463422756817825, 0.08983153365728147, -0.06961750748066478, -0.3007734127799576, 0.15402631051750537, -0.12423000882713581, -0.08346999311415514, -0.09505912637830062, -0.017829094969509345, 0.05768394156113126, -0.3110598609013975, 0.06778010731685977, 0.1717237635638635, 0.02479887315300557, -0.009028904082886171, -0.03142465533302078, 0.017890787327591823, 0.15090411312807844, 0.03208255512806815, 0.030754158565475833, 0.07438976637456778, -0.1409821327542886, -0.1234405170511103, 0.3335162150796573, -0.09593562636840737, -0.2273051652635606, 0.23229215929849195, -0.14229696570842895, -0.1144876867787526, 0.15876886674273266, 0.1318601849664635, 0.12021244097641616, -0.14788647751622605, 0.12816688606849397, -0.09796688189940914, 0.12565999525107163, 0.04483822263109515, 0.14321587974961214, 0.13341234833933413, 0.09992720014503542, 0.16631407273344626, 0.17177140558872125, -0.013403146791289438, -0.1555791969393503, -0.3454876053937764, -0.16632218344383082, -0.1978318159169746, 0.0954650785568893, -0.07076152352141743, -0.20628038579587088, 0.3910518638956589, 0.08397016122954774, 0.20218577263613213, 0.07014921524579514, 0.237511270187514, 0.1677065911111949, 0.03600370272102256, 0.06656897732249971, 0.2333340552464712, 0.2635708608365846, 0.0178690770605825, -0.2336737080477178, 0.06435679226788639, 0.07538735761113886] |
1,802.05633 | Tilings and matroids on regular subdivisions of a triangle | In this paper we investigate a family of matroids introduced by Ardila and
Billey to study one-dimensional intersections of complete flag arrangements of
$\mathbb{C}^n$. The set of lattice points $P_n$ inside the equilateral triangle
$S_n$ obtained by intersecting the nonnegative cone of $\mathbb{R}^3$ with the
affine hyperplane $x_1 + x_2 + x_3 = n-1$ is the ground set of a matroid
$\mathcal{T}_n$ whose independent sets are the subsets $S$ of $P_n$ satisfying
that $|S \cap P| \le k$ for each translation $P$ of the set $P_k$. Here we
study the structure of the matroids $\mathcal{T}_n$ in connection with tilings
of $S_n$ into unit triangles, rhombi, and trapezoids. First, we characterize
the independent sets of $\mathcal{T}_n$, extending a characterization of the
bases of $\mathcal{T}_n$ already given by Ardila and Billey. Then we explore
the connection between the rank function of $\mathcal{T}_n$ and the tilings of
$S_n$ into unit triangles and rhombi. Then we provide a tiling characterization
of the circuits of $\mathcal{T}_n$. We conclude with a geometric
characterization of the flats of $\mathcal{T}_n$.
| math.CO | in this paper we investigate a family of matroids introduced by ardila and billey to study onedimensional intersections of complete flag arrangements of mathbbcn the set of lattice points p_n inside the equilateral triangle s_n obtained by intersecting the nonnegative cone of mathbbr3 with the affine hyperplane x_1 x_2 x_3 n1 is the ground set of a matroid mathcalt_n whose independent sets are the subsets s of p_n satisfying that s cap p le k for each translation p of the set p_k here we study the structure of the matroids mathcalt_n in connection with tilings of s_n into unit triangles rhombi and trapezoids first we characterize the independent sets of mathcalt_n extending a characterization of the bases of mathcalt_n already given by ardila and billey then we explore the connection between the rank function of mathcalt_n and the tilings of s_n into unit triangles and rhombi then we provide a tiling characterization of the circuits of mathcalt_n we conclude with a geometric characterization of the flats of mathcalt_n | [['in', 'this', 'paper', 'we', 'investigate', 'a', 'family', 'of', 'matroids', 'introduced', 'by', 'ardila', 'and', 'billey', 'to', 'study', 'onedimensional', 'intersections', 'of', 'complete', 'flag', 'arrangements', 'of', 'mathbbcn', 'the', 'set', 'of', 'lattice', 'points', 'p_n', 'inside', 'the', 'equilateral', 'triangle', 's_n', 'obtained', 'by', 'intersecting', 'the', 'nonnegative', 'cone', 'of', 'mathbbr3', 'with', 'the', 'affine', 'hyperplane', 'x_1', 'x_2', 'x_3', 'n1', 'is', 'the', 'ground', 'set', 'of', 'a', 'matroid', 'mathcalt_n', 'whose', 'independent', 'sets', 'are', 'the', 'subsets', 's', 'of', 'p_n', 'satisfying', 'that', 's', 'cap', 'p', 'le', 'k', 'for', 'each', 'translation', 'p', 'of', 'the', 'set', 'p_k', 'here', 'we', 'study', 'the', 'structure', 'of', 'the', 'matroids', 'mathcalt_n', 'in', 'connection', 'with', 'tilings', 'of', 's_n', 'into', 'unit', 'triangles', 'rhombi', 'and', 'trapezoids', 'first', 'we', 'characterize', 'the', 'independent', 'sets', 'of', 'mathcalt_n', 'extending', 'a', 'characterization', 'of', 'the', 'bases', 'of', 'mathcalt_n', 'already', 'given', 'by', 'ardila', 'and', 'billey', 'then', 'we', 'explore', 'the', 'connection', 'between', 'the', 'rank', 'function', 'of', 'mathcalt_n', 'and', 'the', 'tilings', 'of', 's_n', 'into', 'unit', 'triangles', 'and', 'rhombi', 'then', 'we', 'provide', 'a', 'tiling', 'characterization', 'of', 'the', 'circuits', 'of', 'mathcalt_n', 'we', 'conclude', 'with', 'a', 'geometric', 'characterization', 'of', 'the', 'flats', 'of', 'mathcalt_n']] | [-0.2214994078402865, 0.10994498669748476, -0.004791921898777756, -0.014046652045530768, -0.0440241941498846, -0.08462714143207617, 0.07704598178739863, 0.36048037993043835, -0.3266512831265228, -0.18354224500703742, 0.08699598759443763, -0.33353556162462783, -0.1170578242924351, 0.1044818162146581, -0.092465125693879, 0.02152231856960164, 0.04023560048108535, 0.04391674827815298, -0.0728503206273618, -0.29340738411744804, 0.3340115857106694, -0.06654599179188617, 0.17561336853899634, -0.011684171975998086, 0.11470513196507766, 0.058582287617909484, 0.006344173263383688, 0.040938089364731804, -0.2661279928032257, 0.17662700108450854, 0.21994716610164333, 0.1692312963127545, 0.16804155471911048, -0.3820014227644579, -0.06522701061799152, 0.20865372527589107, 0.1526309509827761, -0.0369994827221043, 0.020530988770873237, -0.2511523260883767, 0.09341215612311687, -0.08527697954525257, -0.16378140495263438, -0.0237630954695612, 0.08494179013402879, 0.06362869804890374, -0.28937617273754634, -0.05739435458489688, 0.16911982908602474, 0.13381774447439515, 0.003570644306184272, -0.18712324420949059, -0.07056342099087876, 0.06992152824890442, -0.06585825092335557, 0.07691312049234496, 0.013562462772049847, -0.004110108744132625, -0.1705800737447199, 0.37568778389914664, 0.048315586535998524, -0.2252552911016495, 0.05160321697548649, -0.2339212893750849, -0.16906607201455173, 0.11547886780270282, 0.1125726247751898, 0.1511233722787287, -0.06367349512799307, 0.18299691618066116, -0.2083984941172485, 0.061810638434384516, 0.1931799337868551, 0.0036790404398512294, 0.1794678674151118, 0.09571893817949048, 0.1061290714847745, 0.23750229256459066, -0.0051421702993736116, 0.000815329976798691, -0.3479089664857416, -0.14443737341741308, -0.21456819765556318, 0.12570407159472183, -0.1768969243591942, -0.19837267213561655, 0.36921860414320196, 0.020010407237038456, 0.23556762347297505, 0.09204415575678311, 0.1623307662625014, -0.02352175921018817, 0.030209161624995737, 0.047922025896545456, 0.035096835496576405, 0.22281336610497543, -0.07758854914969109, -0.15647577300127705, -0.018869097237117015, 0.20119560985914128] |
1,802.05634 | Design study of a photon beamline for a soft X-ray FEL driven by high
gradient acceleration at EuPRAXIA@SPARC_LAB | We are proposing a facility based on high gradient acceleration via x-band RF
structures and plasma acceleration. We plan to reach an electron energy of the
order of 1 GeV, suitable to drive a Free Electron Laser for applications in the
so called "water window" (2 - 4 nm). A conceptual design of the beamline, from
the photon beam from the undulators to the user experimental chamber, mainly
focusing on diagnostic, manipulation and transport of the radiation is
presented and discussed. We also briefly outline a user end station for
coherent imaging, laser ablation and pump-probe experiments.
| physics.acc-ph | we are proposing a facility based on high gradient acceleration via xband rf structures and plasma acceleration we plan to reach an electron energy of the order of 1 gev suitable to drive a free electron laser for applications in the so called water window 2 4 nm a conceptual design of the beamline from the photon beam from the undulators to the user experimental chamber mainly focusing on diagnostic manipulation and transport of the radiation is presented and discussed we also briefly outline a user end station for coherent imaging laser ablation and pumpprobe experiments | [['we', 'are', 'proposing', 'a', 'facility', 'based', 'on', 'high', 'gradient', 'acceleration', 'via', 'xband', 'rf', 'structures', 'and', 'plasma', 'acceleration', 'we', 'plan', 'to', 'reach', 'an', 'electron', 'energy', 'of', 'the', 'order', 'of', '1', 'gev', 'suitable', 'to', 'drive', 'a', 'free', 'electron', 'laser', 'for', 'applications', 'in', 'the', 'so', 'called', 'water', 'window', '2', '4', 'nm', 'a', 'conceptual', 'design', 'of', 'the', 'beamline', 'from', 'the', 'photon', 'beam', 'from', 'the', 'undulators', 'to', 'the', 'user', 'experimental', 'chamber', 'mainly', 'focusing', 'on', 'diagnostic', 'manipulation', 'and', 'transport', 'of', 'the', 'radiation', 'is', 'presented', 'and', 'discussed', 'we', 'also', 'briefly', 'outline', 'a', 'user', 'end', 'station', 'for', 'coherent', 'imaging', 'laser', 'ablation', 'and', 'pumpprobe', 'experiments']] | [-0.0723307790637288, 0.1890576700790613, -0.05961495608789846, 0.036389815534979185, -0.061860291888782136, -0.1671796871717864, 0.04884588160105826, 0.47336938697844744, -0.23310332241817378, -0.29830855834976927, 0.07379573209982482, -0.27018707638490014, -0.024293944564609166, 0.2628264341158986, -0.011712801468092948, 0.08074581438753133, 0.04179010970983654, -0.02871598054965337, -0.009709799736204635, -0.1395551783789415, 0.2757712002785411, 0.17681241146055982, 0.3024105568365485, 0.1297885405656416, 0.1764457861330205, 0.007762378528544407, -0.00041154996627786505, -0.05343277341065308, -0.1365965603768018, 0.10261674837965984, 0.26846057920192834, 0.1164274926049984, 0.253681599557846, -0.4615253836955162, -0.21322289535116093, 0.0001536666604806669, 0.10692163185770671, 0.07884521217783913, -0.1407226243876115, -0.25477674037392717, 0.041125543464052804, -0.18069551310812434, -0.10512941158473647, 0.008850435221878191, -0.06381071809058388, 0.07809394225478172, -0.28963671911818284, -0.062453471585286024, -0.0250955099715308, 0.07911065752462794, -0.07526462643848693, -0.0797302219143603, 0.06138657844712725, 0.03823314805534513, 0.005807290341181215, 0.05664196812964898, 0.20916887863131706, -0.12527898242600108, -0.11006637414296468, 0.3832706030807458, -0.028076679718651576, -0.10840739718211505, 0.1675599433995861, -0.17831010850689685, -0.044186322130068824, 0.15371234437528378, 0.18571389009593986, 0.1329428063860784, -0.13620155469197925, 0.006649625417291342, 0.04176813036125774, 0.18110205211754268, 0.14316042655264027, 0.017565195958013646, 0.19425824600815153, 0.24222775376013791, 0.08150088627977918, 0.13509251811289383, -0.1973283771997861, -0.0035044097166974097, -0.3233268269977998, -0.1582611031093014, -0.14396097259790017, 0.040497066833874364, 0.014025115122421994, -0.0798370778405418, 0.44852688066506136, 0.17523612842099587, 0.11116064790015419, -0.06875333598873112, 0.3615062967570945, 0.08417082037582684, 0.013813280370717015, 0.021599962148078095, 0.23935664965150258, 0.09916216689452995, 0.16548927196466443, -0.2485320990284284, -0.04266950633488401, -0.0005697271287014397] |
1,802.05635 | Nonparametric Bayesian posterior contraction rates for scalar diffusions
with high-frequency data | We consider inference in the scalar diffusion model
$dX_t=b(X_t)dt+\sigma(X_t)dW_t$ with discrete data $(X_{j\Delta_n})_{0\leq j
\leq n}$, $n\to \infty,~\Delta_n\to 0$ and periodic coefficients. For $\sigma$
given, we prove a general theorem detailing conditions under which Bayesian
posteriors will contract in $L^2$-distance around the true drift function $b_0$
at the frequentist minimax rate (up to logarithmic factors) over Besov
smoothness classes. We exhibit natural nonparametric priors which satisfy our
conditions. Our results show that the Bayesian method adapts both to an unknown
sampling regime and to unknown smoothness.
| math.ST stat.TH | we consider inference in the scalar diffusion model dx_tbx_tdtsigmax_tdw_t with discrete data x_jdelta_n_0leq j leq n nto inftydelta_nto 0 and periodic coefficients for sigma given we prove a general theorem detailing conditions under which bayesian posteriors will contract in l2distance around the true drift function b_0 at the frequentist minimax rate up to logarithmic factors over besov smoothness classes we exhibit natural nonparametric priors which satisfy our conditions our results show that the bayesian method adapts both to an unknown sampling regime and to unknown smoothness | [['we', 'consider', 'inference', 'in', 'the', 'scalar', 'diffusion', 'model', 'dx_tbx_tdtsigmax_tdw_t', 'with', 'discrete', 'data', 'x_jdelta_n_0leq', 'j', 'leq', 'n', 'nto', 'inftydelta_nto', '0', 'and', 'periodic', 'coefficients', 'for', 'sigma', 'given', 'we', 'prove', 'a', 'general', 'theorem', 'detailing', 'conditions', 'under', 'which', 'bayesian', 'posteriors', 'will', 'contract', 'in', 'l2distance', 'around', 'the', 'true', 'drift', 'function', 'b_0', 'at', 'the', 'frequentist', 'minimax', 'rate', 'up', 'to', 'logarithmic', 'factors', 'over', 'besov', 'smoothness', 'classes', 'we', 'exhibit', 'natural', 'nonparametric', 'priors', 'which', 'satisfy', 'our', 'conditions', 'our', 'results', 'show', 'that', 'the', 'bayesian', 'method', 'adapts', 'both', 'to', 'an', 'unknown', 'sampling', 'regime', 'and', 'to', 'unknown', 'smoothness']] | [-0.0712884889343327, 0.056582029242838554, -0.08085413864555668, 0.10411777291503028, -0.09093222445079002, -0.1734496462607689, 0.06005256425263921, 0.40634905297802876, -0.32610191373401376, -0.2523993758305189, 0.0811573929484395, -0.2038825095956584, -0.11332716561954873, 0.15678057754243982, -0.12436577302392528, 0.09121784212696085, 0.01993406093286642, 0.015568499408482787, -0.09717634425453663, -0.29089546733513383, 0.3012033572184842, 0.01591274561921516, 0.27015344874760844, -0.02864595288649224, 0.13864165918581772, 0.01430190279967634, -0.0045022093129894105, -0.07013069411616278, -0.27572398727904535, 0.05365425326962428, 0.2624501007979354, 0.12337780748886695, 0.320040570235396, -0.3216587178498866, -0.20354208329984222, 0.16274553229920116, 0.10619143028294735, 0.022355743871822237, 0.02403081762492208, -0.2997150796140174, 0.09867791110840458, -0.1035076814580215, -0.13266447830541306, -0.11826704908162355, -0.01082815618130816, 0.03160788512687726, -0.4449492363506053, 0.1350100129528577, 0.10321890087012785, 0.0291832425710128, -0.0838131655501314, -0.1692879860813965, 0.025408833657941186, 0.04830530311643, 0.09583237363552921, 0.01615919225501368, 0.11487653902002487, -0.12642016595072417, -0.05881067246187433, 0.26587555634912596, -0.10990610017429993, -0.2694133626723505, 0.13460414201380258, -0.17165233213903316, -0.20038606360953032, 0.10736206808991461, 0.18119693791538657, 0.1363632217307676, -0.12375251416548952, 0.16148200561993767, -0.050516303126554356, 0.14259917175689016, 0.09929049700773489, -0.014529684779419372, 0.1017382177201672, 0.09723294553268387, 0.1259881962618106, 0.09196698910511851, -0.10624592627976538, -0.08616352650191052, -0.3651318909622819, -0.0887645247044513, -0.17340827331855804, 0.0521636684228812, -0.19562755934073567, -0.18329600188656744, 0.31052649606872035, 0.17925704478746257, 0.18387314347909336, 0.18668212392086903, 0.18845158816505986, 0.1313159125941211, -0.023539403711546617, 0.12818659876518132, 0.1591506723499666, 0.13729785820357052, 0.03683143361970917, -0.1323191013007638, 0.07931681336408639, 0.02398454729490072] |
1,802.05636 | Hadronic models of the Fermi bubbles: Future perspectives | The origin of sub-TeV gamma rays detected by Fermi-LAT from the Fermi bubbles
at the Galactic center is still unknown. In a hadronic model, acceleration of
protons and/or nuclei and their subsequent interactions with gas in the bubble
volume can produce observed gamma rays. Such interactions naturally produce
high-energy neutrinos, and detection of those can discriminate between a
hadronic and a leptonic origin of gamma rays. Additional constraints on the
Fermi bubbles gamma-ray flux in the TeV range from recent HAWC observations
restrict hadronic model parameters, which in turn disfavor Fermi bubbles as the
origin of a large fraction of neutrino events detected by IceCube along the
bubble directions. We revisit our hadronic model and discuss future constraints
on parameters from observations in very high-energy gamma rays and neutrinos.
| astro-ph.HE | the origin of subtev gamma rays detected by fermilat from the fermi bubbles at the galactic center is still unknown in a hadronic model acceleration of protons andor nuclei and their subsequent interactions with gas in the bubble volume can produce observed gamma rays such interactions naturally produce highenergy neutrinos and detection of those can discriminate between a hadronic and a leptonic origin of gamma rays additional constraints on the fermi bubbles gammaray flux in the tev range from recent hawc observations restrict hadronic model parameters which in turn disfavor fermi bubbles as the origin of a large fraction of neutrino events detected by icecube along the bubble directions we revisit our hadronic model and discuss future constraints on parameters from observations in very highenergy gamma rays and neutrinos | [['the', 'origin', 'of', 'subtev', 'gamma', 'rays', 'detected', 'by', 'fermilat', 'from', 'the', 'fermi', 'bubbles', 'at', 'the', 'galactic', 'center', 'is', 'still', 'unknown', 'in', 'a', 'hadronic', 'model', 'acceleration', 'of', 'protons', 'andor', 'nuclei', 'and', 'their', 'subsequent', 'interactions', 'with', 'gas', 'in', 'the', 'bubble', 'volume', 'can', 'produce', 'observed', 'gamma', 'rays', 'such', 'interactions', 'naturally', 'produce', 'highenergy', 'neutrinos', 'and', 'detection', 'of', 'those', 'can', 'discriminate', 'between', 'a', 'hadronic', 'and', 'a', 'leptonic', 'origin', 'of', 'gamma', 'rays', 'additional', 'constraints', 'on', 'the', 'fermi', 'bubbles', 'gammaray', 'flux', 'in', 'the', 'tev', 'range', 'from', 'recent', 'hawc', 'observations', 'restrict', 'hadronic', 'model', 'parameters', 'which', 'in', 'turn', 'disfavor', 'fermi', 'bubbles', 'as', 'the', 'origin', 'of', 'a', 'large', 'fraction', 'of', 'neutrino', 'events', 'detected', 'by', 'icecube', 'along', 'the', 'bubble', 'directions', 'we', 'revisit', 'our', 'hadronic', 'model', 'and', 'discuss', 'future', 'constraints', 'on', 'parameters', 'from', 'observations', 'in', 'very', 'highenergy', 'gamma', 'rays', 'and', 'neutrinos']] | [-0.07013041087536344, 0.2860137345648349, -0.05273840881887708, 0.1920772935922597, -0.08891400606588049, -0.05510719961219633, 0.08002893846886333, 0.37424927986905615, -0.24350500689790577, -0.3488613237453581, -0.02605130596811948, -0.351208162214246, 0.042433619860184284, 0.20551637675100576, 0.08557451787484131, -0.044391165104831834, 0.10475699672143357, -0.045818591129410176, -0.016937066840599906, -0.15862482684382864, 0.26934053648494244, 0.19814637558924597, 0.16084143930916175, 0.08156136567740477, 0.07287778875018044, -0.08000936954780373, -0.09572846554725091, -0.06551851501847192, -0.08381751159096837, 0.053261700189625484, 0.21740121789305478, 0.07665318039123172, 0.06437962906536206, -0.42299683457023873, -0.28413719504118656, 0.18453555068275493, 0.1453962542925232, -0.02014328067663826, -0.06476863390809401, -0.3532280203301546, -0.0108360565766555, -0.20168978166441584, -0.21196296139324242, 0.03983877403950391, -0.05399683704816325, 0.03882265197069839, -0.17103105003028646, 0.08215019326339397, -0.03153384027121834, -0.032570464850598294, -0.10009300956581972, -0.11738800520958133, 0.01724463095347029, 0.01088877797646578, 0.1735163349540933, 0.04740115449684419, 0.18167928207932804, -0.19258325999645992, -0.13252136580169546, 0.4340292449441356, -0.040848059940707775, -0.06658853872051072, 0.21299098934184096, -0.24964073771798564, -0.21552672440749268, 0.2723994262429864, 0.22523988672178383, 0.0025963258041545403, -0.18192675983706533, 0.13173436179040576, -0.027774314533254896, 0.1241913339152008, 0.055961459353493975, 0.0017685860290747974, 0.339089631803276, 0.1579635138515123, 0.033987964449320424, 0.03422099666249426, -0.2357519854603754, 0.04926218887314547, -0.379595134194305, -0.06252881914897021, -0.1502693058966204, 0.09466705265158946, -0.07992313718800018, -0.09865852252962862, 0.37479855621219144, 0.06354543850071324, 0.25999359827120466, -0.0446577533409938, 0.267820072259263, -0.011708685349449226, 0.007725325974368656, 0.11648940329995844, 0.3698544303215174, 0.09938030517046419, 0.08855116617407419, -0.19728732051132897, 0.07496434574055146, 0.024133888939612134] |
1,802.05637 | cGANs with Projection Discriminator | We propose a novel, projection based way to incorporate the conditional
information into the discriminator of GANs that respects the role of the
conditional information in the underlining probabilistic model. This approach
is in contrast with most frameworks of conditional GANs used in application
today, which use the conditional information by concatenating the (embedded)
conditional vector to the feature vectors. With this modification, we were able
to significantly improve the quality of the class conditional image generation
on ILSVRC2012 (ImageNet) 1000-class image dataset from the current
state-of-the-art result, and we achieved this with a single pair of a
discriminator and a generator. We were also able to extend the application to
super-resolution and succeeded in producing highly discriminative
super-resolution images. This new structure also enabled high quality category
transformation based on parametric functional transformation of conditional
batch normalization layers in the generator.
| cs.LG cs.CV stat.ML | we propose a novel projection based way to incorporate the conditional information into the discriminator of gans that respects the role of the conditional information in the underlining probabilistic model this approach is in contrast with most frameworks of conditional gans used in application today which use the conditional information by concatenating the embedded conditional vector to the feature vectors with this modification we were able to significantly improve the quality of the class conditional image generation on ilsvrc2012 imagenet 1000class image dataset from the current stateoftheart result and we achieved this with a single pair of a discriminator and a generator we were also able to extend the application to superresolution and succeeded in producing highly discriminative superresolution images this new structure also enabled high quality category transformation based on parametric functional transformation of conditional batch normalization layers in the generator | [['we', 'propose', 'a', 'novel', 'projection', 'based', 'way', 'to', 'incorporate', 'the', 'conditional', 'information', 'into', 'the', 'discriminator', 'of', 'gans', 'that', 'respects', 'the', 'role', 'of', 'the', 'conditional', 'information', 'in', 'the', 'underlining', 'probabilistic', 'model', 'this', 'approach', 'is', 'in', 'contrast', 'with', 'most', 'frameworks', 'of', 'conditional', 'gans', 'used', 'in', 'application', 'today', 'which', 'use', 'the', 'conditional', 'information', 'by', 'concatenating', 'the', 'embedded', 'conditional', 'vector', 'to', 'the', 'feature', 'vectors', 'with', 'this', 'modification', 'we', 'were', 'able', 'to', 'significantly', 'improve', 'the', 'quality', 'of', 'the', 'class', 'conditional', 'image', 'generation', 'on', 'ilsvrc2012', 'imagenet', '1000class', 'image', 'dataset', 'from', 'the', 'current', 'stateoftheart', 'result', 'and', 'we', 'achieved', 'this', 'with', 'a', 'single', 'pair', 'of', 'a', 'discriminator', 'and', 'a', 'generator', 'we', 'were', 'also', 'able', 'to', 'extend', 'the', 'application', 'to', 'superresolution', 'and', 'succeeded', 'in', 'producing', 'highly', 'discriminative', 'superresolution', 'images', 'this', 'new', 'structure', 'also', 'enabled', 'high', 'quality', 'category', 'transformation', 'based', 'on', 'parametric', 'functional', 'transformation', 'of', 'conditional', 'batch', 'normalization', 'layers', 'in', 'the', 'generator']] | [0.019389083207782494, -0.006890099547298389, -0.0835815202575964, 0.07092662772383462, -0.10163351090159267, -0.10919088176099098, 0.019157809513607914, 0.4399839611068158, -0.2868969690712156, -0.3150046985517715, 0.04434263234397291, -0.24851957629893867, -0.1755019241950514, 0.16478513146776863, -0.1501153329006908, 0.11684070900820431, 0.08792737881082412, 0.05000446194743501, -0.08452240746053473, -0.2683712843966237, 0.32943199320309335, 0.046148648724930595, 0.3917669278543285, -0.016652437759904375, 0.16829074582111248, 0.020016421140893033, -0.010797800109262618, -0.016965886061473315, -0.0685998030332459, 0.2328817470878048, 0.23975720927512773, 0.19277656459721776, 0.2933593256912247, -0.4349869325770144, -0.21260896972446164, 0.08177985046649168, 0.09651896147660806, 0.11535678097640466, -0.08916608894958725, -0.32450253153744507, 0.09744248258664837, -0.1728700679361256, 0.030189338566499278, -0.12314819260565958, -0.0800960252978052, -0.008468084771868209, -0.3318852012518721, 0.03572559129899904, 0.1134946222325236, 0.018385779137172226, -0.027777526624382695, -0.0749151521218075, 0.0030578985862748723, 0.13006389936888066, -0.0061869004152675855, 0.08166159276643925, 0.12485381060658665, -0.18716170146739977, -0.12718204316407652, 0.3098294751281673, -0.11698102124173089, -0.21684118187133694, 0.1547201783560269, -0.08103007521204861, -0.17100928268316662, 0.08483705634225003, 0.2011495229540537, 0.11839262668279485, -0.14390040459611428, 0.006740440180423525, -0.02301795764426163, 0.17273519151683397, 0.046964858088012734, 0.043876539040225704, 0.1644905359241587, 0.21377476785515606, 0.017793091250137543, 0.18506152145105453, -0.16643504723972102, -0.04852360154134812, -0.24339547855648355, -0.15100108998873546, -0.1880989050768106, 0.0015020123842782276, -0.08804151859812022, -0.14747851805328588, 0.4447076362623295, 0.24969713228531706, 0.2554481484776389, 0.07087883765687904, 0.32699144998906365, 0.06848457915393609, 0.12544294773981396, 0.06156518501491929, 0.2005134463219241, 0.09567203848544036, 0.08591712259648132, -0.1261659867907415, 0.10009691189699085, 0.08907505145466978] |
1,802.05638 | Monopoles on string-like models and the Coulomb's law | The t'Hooft-Polyakov monopole mass can be substantially altered, in the thick
GS and HC brane-world setup, and can be employed to constrain the brane
thickness limit. In this work, we comprise a brief review regarding gauge
fields localization in the string-like six dimensional brane-world models
setup. The correction to the Coulomb's law in two models is studied. Besides,
the monopole features are investigated from the point of view of the gauge
fields localization in the string-like brane-worlds and its thickness.
| hep-th | the thooftpolyakov monopole mass can be substantially altered in the thick gs and hc braneworld setup and can be employed to constrain the brane thickness limit in this work we comprise a brief review regarding gauge fields localization in the stringlike six dimensional braneworld models setup the correction to the coulombs law in two models is studied besides the monopole features are investigated from the point of view of the gauge fields localization in the stringlike braneworlds and its thickness | [['the', 'thooftpolyakov', 'monopole', 'mass', 'can', 'be', 'substantially', 'altered', 'in', 'the', 'thick', 'gs', 'and', 'hc', 'braneworld', 'setup', 'and', 'can', 'be', 'employed', 'to', 'constrain', 'the', 'brane', 'thickness', 'limit', 'in', 'this', 'work', 'we', 'comprise', 'a', 'brief', 'review', 'regarding', 'gauge', 'fields', 'localization', 'in', 'the', 'stringlike', 'six', 'dimensional', 'braneworld', 'models', 'setup', 'the', 'correction', 'to', 'the', 'coulombs', 'law', 'in', 'two', 'models', 'is', 'studied', 'besides', 'the', 'monopole', 'features', 'are', 'investigated', 'from', 'the', 'point', 'of', 'view', 'of', 'the', 'gauge', 'fields', 'localization', 'in', 'the', 'stringlike', 'braneworlds', 'and', 'its', 'thickness']] | [-0.11278688733000308, 0.13905598889105023, -0.0690875647822395, 0.11149363786680624, -0.04648952409334015, -0.15201918819220736, -0.029786008794326337, 0.34349759699543936, -0.17999529399094172, -0.2985588257550262, 0.06360179554321803, -0.24263701226736883, -0.11041916222311557, 0.13658766730222852, -0.07629575002356433, -0.020651833038573385, -0.0401057873677928, 0.044212298208731224, -0.06021738436538726, -0.2241268505807966, 0.3426993060391396, 0.04158936034946237, 0.2937654632754857, 0.04151260663347785, 0.03204788333387114, -0.05759137546992861, -0.018287207710091024, 0.07520952671766282, -0.16271608368260787, 0.07524344763223781, 0.17502897736094383, 0.03221723000751808, 0.12656415891833603, -0.4261434369487688, -0.2602710371953435, 0.0544876643398311, 0.18325145642156712, 0.16764558768481946, -0.024038413946982473, -0.30383192194858566, 0.05783893384905241, -0.19657378843985499, -0.15438402543368285, -0.035639822608209214, -0.03533657434163615, -0.05196099935565144, -0.23084032570477575, 0.06441532376920804, 0.05247724009968806, 0.023006551212165504, -0.1142355671574478, -0.08836082776542753, -0.05097968232585117, 0.07852000166312792, 0.15352108947990928, 0.03434551008976996, 0.1819589902937878, -0.19488546161128398, -0.1244831238174811, 0.3661192952189595, -0.09258433601353318, -0.21383515537017955, 0.17653679744835243, -0.14833417732734233, -0.11749717626371421, 0.09489227669546381, 0.13700774525350426, 0.14689819697714485, -0.1816818481660448, 0.18251667687218287, 0.011117645748890936, 0.15007701735776208, 0.09072253951453604, 0.04297421465162188, 0.2795895224902779, 0.16435274286195636, -0.01454508702736348, 0.15861565975646955, -0.11858289124211296, -0.11110850614495575, -0.34441037494689225, -0.12964692066889255, -0.13634269977919758, 0.07039587708422915, -0.11561970245620615, -0.14017698128009215, 0.3963939300738275, 0.16267316003431914, 0.18402421946520917, -0.043316845444496724, 0.22344754855148494, 0.06264369369018823, 0.11033025807701051, 0.01547588310786523, 0.3157496035121767, 0.14683031466556712, 0.12162237859447486, -0.20282846173795405, -0.09946407290699426, 0.10124066795106046] |
1,802.05639 | Reliable Uncertain Evidence Modeling in Bayesian Networks by Credal
Networks | A reliable modeling of uncertain evidence in Bayesian networks based on a
set-valued quantification is proposed. Both soft and virtual evidences are
considered. We show that evidence propagation in this setup can be reduced to
standard updating in an augmented credal network, equivalent to a set of
consistent Bayesian networks. A characterization of the computational
complexity for this task is derived together with an efficient exact procedure
for a subclass of instances. In the case of multiple uncertain evidences over
the same variable, the proposed procedure can provide a set-valued version of
the geometric approach to opinion pooling.
| cs.AI | a reliable modeling of uncertain evidence in bayesian networks based on a setvalued quantification is proposed both soft and virtual evidences are considered we show that evidence propagation in this setup can be reduced to standard updating in an augmented credal network equivalent to a set of consistent bayesian networks a characterization of the computational complexity for this task is derived together with an efficient exact procedure for a subclass of instances in the case of multiple uncertain evidences over the same variable the proposed procedure can provide a setvalued version of the geometric approach to opinion pooling | [['a', 'reliable', 'modeling', 'of', 'uncertain', 'evidence', 'in', 'bayesian', 'networks', 'based', 'on', 'a', 'setvalued', 'quantification', 'is', 'proposed', 'both', 'soft', 'and', 'virtual', 'evidences', 'are', 'considered', 'we', 'show', 'that', 'evidence', 'propagation', 'in', 'this', 'setup', 'can', 'be', 'reduced', 'to', 'standard', 'updating', 'in', 'an', 'augmented', 'credal', 'network', 'equivalent', 'to', 'a', 'set', 'of', 'consistent', 'bayesian', 'networks', 'a', 'characterization', 'of', 'the', 'computational', 'complexity', 'for', 'this', 'task', 'is', 'derived', 'together', 'with', 'an', 'efficient', 'exact', 'procedure', 'for', 'a', 'subclass', 'of', 'instances', 'in', 'the', 'case', 'of', 'multiple', 'uncertain', 'evidences', 'over', 'the', 'same', 'variable', 'the', 'proposed', 'procedure', 'can', 'provide', 'a', 'setvalued', 'version', 'of', 'the', 'geometric', 'approach', 'to', 'opinion', 'pooling']] | [-0.09371976494523031, -0.007265571402373952, -0.07712097473594608, 0.11084367724002472, -0.09502258932940205, -0.1199473199453585, 0.08954090996626385, 0.43609777895011465, -0.2555088327665414, -0.28595439291901276, 0.09079216306135819, -0.18940875774287447, -0.17842586623143633, 0.20931045026803502, -0.12130131767777612, 0.0737106719051906, 0.09355270481259771, 0.035003944488102096, -0.059161189038363496, -0.21913743317982523, 0.27085503855986254, 0.0386813039017119, 0.2969777759886822, 0.010174532536160658, 0.11760517838411033, 0.027905658186812485, -0.06347602005211675, 0.08399103253923014, -0.07891538180685566, 0.180935721559336, 0.2621266005788835, 0.18634882345985698, 0.3315552094457101, -0.4012942055207012, -0.23120909740160012, 0.10896306019989127, 0.12900530009492472, 0.11785814226890097, -0.018136399240964756, -0.2942645231200078, 0.09432478330326172, -0.19807077069975892, -0.06901368563899732, -0.08749216947970646, -0.017336665405606737, -0.020486734612673824, -0.34900642522819797, 0.048807542711705426, 0.05768014105721092, 0.0438149783817329, -0.07990578932293253, -0.09536520201161656, 0.013028635265666763, 0.07661684331180034, 0.0022500359301208233, 0.011008151469524113, 0.06304385769180954, -0.12780573388694652, -0.16508219527004628, 0.35313263103099807, -0.04549714911025854, -0.22928048284458263, 0.17371722904737202, -0.01394664365127065, -0.20751473912969232, 0.14520092332992246, 0.18348060837205576, 0.11723198987809676, -0.19360616018197366, 0.02398308050968418, -0.10309718474175553, 0.18377655225672893, -0.013088830865501446, 0.01247873653809787, 0.17495974786199478, 0.22655984726069228, 0.0815306941608005, 0.1716438127213576, -0.06015179040176528, -0.12857633200711666, -0.2996022153927289, -0.13111518792290128, -0.1665841746785469, 0.0004642752702442967, -0.12879622656818152, -0.18699282157348887, 0.36063362544934663, 0.16918447618467772, 0.18347192376885296, 0.12109769791203114, 0.29429194924174523, 0.11644940768093541, 0.03137431530357928, 0.06282996418541392, 0.20652140041799, 0.11592436936322828, 0.06268291025569815, -0.15434039595812482, 0.1268188083135732, 0.060856584129303844] |
1,802.0564 | Gradient Boosting With Piece-Wise Linear Regression Trees | Gradient Boosted Decision Trees (GBDT) is a very successful ensemble learning
algorithm widely used across a variety of applications. Recently, several
variants of GBDT training algorithms and implementations have been designed and
heavily optimized in some very popular open sourced toolkits including XGBoost,
LightGBM and CatBoost. In this paper, we show that both the accuracy and
efficiency of GBDT can be further enhanced by using more complex base learners.
Specifically, we extend gradient boosting to use piecewise linear regression
trees (PL Trees), instead of piecewise constant regression trees, as base
learners. We show that PL Trees can accelerate convergence of GBDT and improve
the accuracy. We also propose some optimization tricks to substantially reduce
the training time of PL Trees, with little sacrifice of accuracy. Moreover, we
propose several implementation techniques to speedup our algorithm on modern
computer architectures with powerful Single Instruction Multiple Data (SIMD)
parallelism. The experimental results show that GBDT with PL Trees can provide
very competitive testing accuracy with comparable or less training time.
| cs.LG | gradient boosted decision trees gbdt is a very successful ensemble learning algorithm widely used across a variety of applications recently several variants of gbdt training algorithms and implementations have been designed and heavily optimized in some very popular open sourced toolkits including xgboost lightgbm and catboost in this paper we show that both the accuracy and efficiency of gbdt can be further enhanced by using more complex base learners specifically we extend gradient boosting to use piecewise linear regression trees pl trees instead of piecewise constant regression trees as base learners we show that pl trees can accelerate convergence of gbdt and improve the accuracy we also propose some optimization tricks to substantially reduce the training time of pl trees with little sacrifice of accuracy moreover we propose several implementation techniques to speedup our algorithm on modern computer architectures with powerful single instruction multiple data simd parallelism the experimental results show that gbdt with pl trees can provide very competitive testing accuracy with comparable or less training time | [['gradient', 'boosted', 'decision', 'trees', 'gbdt', 'is', 'a', 'very', 'successful', 'ensemble', 'learning', 'algorithm', 'widely', 'used', 'across', 'a', 'variety', 'of', 'applications', 'recently', 'several', 'variants', 'of', 'gbdt', 'training', 'algorithms', 'and', 'implementations', 'have', 'been', 'designed', 'and', 'heavily', 'optimized', 'in', 'some', 'very', 'popular', 'open', 'sourced', 'toolkits', 'including', 'xgboost', 'lightgbm', 'and', 'catboost', 'in', 'this', 'paper', 'we', 'show', 'that', 'both', 'the', 'accuracy', 'and', 'efficiency', 'of', 'gbdt', 'can', 'be', 'further', 'enhanced', 'by', 'using', 'more', 'complex', 'base', 'learners', 'specifically', 'we', 'extend', 'gradient', 'boosting', 'to', 'use', 'piecewise', 'linear', 'regression', 'trees', 'pl', 'trees', 'instead', 'of', 'piecewise', 'constant', 'regression', 'trees', 'as', 'base', 'learners', 'we', 'show', 'that', 'pl', 'trees', 'can', 'accelerate', 'convergence', 'of', 'gbdt', 'and', 'improve', 'the', 'accuracy', 'we', 'also', 'propose', 'some', 'optimization', 'tricks', 'to', 'substantially', 'reduce', 'the', 'training', 'time', 'of', 'pl', 'trees', 'with', 'little', 'sacrifice', 'of', 'accuracy', 'moreover', 'we', 'propose', 'several', 'implementation', 'techniques', 'to', 'speedup', 'our', 'algorithm', 'on', 'modern', 'computer', 'architectures', 'with', 'powerful', 'single', 'instruction', 'multiple', 'data', 'simd', 'parallelism', 'the', 'experimental', 'results', 'show', 'that', 'gbdt', 'with', 'pl', 'trees', 'can', 'provide', 'very', 'competitive', 'testing', 'accuracy', 'with', 'comparable', 'or', 'less', 'training', 'time']] | [-0.027535416772783112, 0.02811097280175004, -0.08119776147040761, 0.09803900303363446, -0.13993172931285308, -0.22120860819372215, 0.08996492107689846, 0.5028786049002693, -0.2845009705689292, -0.3419786750871156, 0.11235269532023397, -0.20214414179957071, -0.17434286729050136, 0.25735606656027293, -0.11520831089001149, 0.13180867064234225, 0.16581073292486725, 0.0005673742175748062, -0.07471470471743184, -0.38310191545904326, 0.25153801474343274, 0.1050620121892453, 0.3115262393451606, -0.0022476975199034704, 0.12399072266011249, -0.01144451493330832, -0.013600802605478315, 0.05184026600978714, -0.052598429185439145, 0.16469457377457902, 0.3008100097968487, 0.21763135384285956, 0.3223078569364069, -0.40351806117576505, -0.19678747954700762, 0.12065817636349016, 0.18125306927443793, 0.11353280623387989, -0.05884373868883856, -0.22976910222565666, 0.09883692757769798, -0.159573159496566, -0.0008491135196804645, -0.18383779891744434, -0.07041176098642782, 0.06459913902550138, -0.2549349082899945, 0.006890424157020226, 0.06850267680142895, 0.05278862593141163, 0.03578846366352601, -0.1747652035306341, 0.027482523911333243, 0.07303502242818165, 0.009759761641145729, 0.06364729045613092, 0.12937696978250252, -0.11306456740740464, -0.2311184942380004, 0.3326214049454956, -0.1141896269199649, -0.2025795498990365, 0.2446967360419443, -0.014768564466586602, -0.20473572080871755, 0.07032678123851795, 0.2610316103368643, 0.13238093175459653, -0.13163119707522647, 0.07440216805324391, 0.028666373092814217, 0.18065948653176228, 0.11608840301189394, -0.045104584035774074, 0.08943100891026136, 0.24125046312387677, 0.048223204294377604, 0.15338930836740128, -0.05876697831609774, -0.06822589338601877, -0.1516742461081733, -0.12227669924946635, -0.12188795992794137, -0.02209117928924527, -0.18637458406278928, -0.16993504809770024, 0.32965439257566775, 0.20267268215095446, 0.19764898920575866, 0.1846408002545234, 0.33921648848003577, 0.03744113501549388, 0.11291072702373467, 0.1565371584064061, 0.1663622000331608, 0.08019154374848031, 0.1019099476314815, -0.16659000607580224, 0.08669947714190043, 0.029444566090768648] |
1,802.05641 | The underlying connections between identifiability, active subspaces,
and parameter space dimension reduction | The interactions between parameters, model structure, and outputs can
determine what inferences, predictions, and control strategies are possible for
a given system. Parameter space reduction and parameter estimation---and, more
generally, understanding the shape of the information contained in models with
observational structure---are thus essential for many questions in mathematical
modeling and uncertainty quantification. As such, different disciplines have
developed methods in parallel for approaching the questions in their field.
Many of these approaches, including identifiability, sloppiness, and active
subspaces, use related ideas to address questions of parameter dimension
reduction, parameter estimation, and robustness of inferences and quantities of
interest.
In this paper, we show that active subspace methods have intrinsic
connections to methods from sensitivity analysis and identifiability, and
indeed that it is possible to frame each approach in a unified framework. A
particular form of the Fisher information matrix (FIM), which we denote the
sensitivity FIM, is fundamental to all three approaches---active subspaces,
identifiability, and sloppiness. Through a series of examples and case studies,
we illustrate the properties of the sensitivity FIM in several contexts. These
initial examples show that the interplay between local and global and linear
and non-linear strongly impact the insights each approach can generate. These
observations underline that one's approach to parameter dimension reduction
should be driven by the scientific question and also open the door to using
tools from the other approaches to generate useful insights.
| math.DS | the interactions between parameters model structure and outputs can determine what inferences predictions and control strategies are possible for a given system parameter space reduction and parameter estimationand more generally understanding the shape of the information contained in models with observational structureare thus essential for many questions in mathematical modeling and uncertainty quantification as such different disciplines have developed methods in parallel for approaching the questions in their field many of these approaches including identifiability sloppiness and active subspaces use related ideas to address questions of parameter dimension reduction parameter estimation and robustness of inferences and quantities of interest in this paper we show that active subspace methods have intrinsic connections to methods from sensitivity analysis and identifiability and indeed that it is possible to frame each approach in a unified framework a particular form of the fisher information matrix fim which we denote the sensitivity fim is fundamental to all three approachesactive subspaces identifiability and sloppiness through a series of examples and case studies we illustrate the properties of the sensitivity fim in several contexts these initial examples show that the interplay between local and global and linear and nonlinear strongly impact the insights each approach can generate these observations underline that ones approach to parameter dimension reduction should be driven by the scientific question and also open the door to using tools from the other approaches to generate useful insights | [['the', 'interactions', 'between', 'parameters', 'model', 'structure', 'and', 'outputs', 'can', 'determine', 'what', 'inferences', 'predictions', 'and', 'control', 'strategies', 'are', 'possible', 'for', 'a', 'given', 'system', 'parameter', 'space', 'reduction', 'and', 'parameter', 'estimationand', 'more', 'generally', 'understanding', 'the', 'shape', 'of', 'the', 'information', 'contained', 'in', 'models', 'with', 'observational', 'structureare', 'thus', 'essential', 'for', 'many', 'questions', 'in', 'mathematical', 'modeling', 'and', 'uncertainty', 'quantification', 'as', 'such', 'different', 'disciplines', 'have', 'developed', 'methods', 'in', 'parallel', 'for', 'approaching', 'the', 'questions', 'in', 'their', 'field', 'many', 'of', 'these', 'approaches', 'including', 'identifiability', 'sloppiness', 'and', 'active', 'subspaces', 'use', 'related', 'ideas', 'to', 'address', 'questions', 'of', 'parameter', 'dimension', 'reduction', 'parameter', 'estimation', 'and', 'robustness', 'of', 'inferences', 'and', 'quantities', 'of', 'interest', 'in', 'this', 'paper', 'we', 'show', 'that', 'active', 'subspace', 'methods', 'have', 'intrinsic', 'connections', 'to', 'methods', 'from', 'sensitivity', 'analysis', 'and', 'identifiability', 'and', 'indeed', 'that', 'it', 'is', 'possible', 'to', 'frame', 'each', 'approach', 'in', 'a', 'unified', 'framework', 'a', 'particular', 'form', 'of', 'the', 'fisher', 'information', 'matrix', 'fim', 'which', 'we', 'denote', 'the', 'sensitivity', 'fim', 'is', 'fundamental', 'to', 'all', 'three', 'approachesactive', 'subspaces', 'identifiability', 'and', 'sloppiness', 'through', 'a', 'series', 'of', 'examples', 'and', 'case', 'studies', 'we', 'illustrate', 'the', 'properties', 'of', 'the', 'sensitivity', 'fim', 'in', 'several', 'contexts', 'these', 'initial', 'examples', 'show', 'that', 'the', 'interplay', 'between', 'local', 'and', 'global', 'and', 'linear', 'and', 'nonlinear', 'strongly', 'impact', 'the', 'insights', 'each', 'approach', 'can', 'generate', 'these', 'observations', 'underline', 'that', 'ones', 'approach', 'to', 'parameter', 'dimension', 'reduction', 'should', 'be', 'driven', 'by', 'the', 'scientific', 'question', 'and', 'also', 'open', 'the', 'door', 'to', 'using', 'tools', 'from', 'the', 'other', 'approaches', 'to', 'generate', 'useful', 'insights']] | [-0.04982014455452285, 0.07185515476183307, -0.07139839058107489, 0.09146355129636043, -0.08689692178049722, -0.13705962486809128, 0.046118703232081726, 0.35967358325020404, -0.3139009394776483, -0.3277500006756603, 0.1389979471998517, -0.267770943154101, -0.20333300865922269, 0.23291535113986955, -0.062435307509497655, 0.0710930895735408, 0.06703365989757384, 0.007935679490234718, -0.08610194069679061, -0.24650130577448462, 0.3254587730874743, 0.03811338162212328, 0.29194773582555555, 0.034436324696679545, 0.09262768886922391, -0.026617078884305458, -0.06340242504430975, 0.060796737653486976, -0.16943455096519772, 0.16960752454960482, 0.2986885551672855, 0.1963549236356236, 0.30293762989395084, -0.3884305921118853, -0.2579623617594818, 0.11294554068613391, 0.14074580964335448, 0.10716164219508346, -0.013253893135189217, -0.2734037614763027, 0.04799368914763756, -0.13588221904650882, -0.09322710836069317, -0.1618027086400195, 0.0028166794568894016, 0.0036045814245150272, -0.27530197768221004, 0.04942880926628833, 0.08678423385029073, 0.05377036950441167, -0.06588055846061737, -0.11667850141374875, 0.018335352867321155, 0.16392985634875837, 0.07944253535776533, -0.013564724472095157, 0.1177860118639879, -0.15102859307131344, -0.13192665116458838, 0.35272218894994284, -0.0009848370514688079, -0.24402701711652222, 0.20894146360879903, -0.1076786536362437, -0.15544438846592332, 0.07155885969239845, 0.19476514088811442, 0.06650122219908121, -0.14438409837573873, 0.07370362838239136, -0.008506781899463791, 0.16481539682946758, 0.016330065449707894, 0.0662481254475053, 0.19278217776877782, 0.15977476515367986, 0.0582782169087184, 0.07986706164975622, -0.06185042046597146, -0.1009976685389787, -0.2688559746800812, -0.13113924620193165, -0.12759835221733506, 0.004129270777435705, -0.10607994371761037, -0.1188299308513702, 0.41010005764895036, 0.2362998342507531, 0.21493822670954496, -0.004913074695952562, 0.2990250998058694, 0.05540540411724713, 0.01839625294417891, 0.03882265279240353, 0.21599059481291694, 0.153309025231334, 0.03788315423247791, -0.17530306948422084, 0.08744078629048273, 0.038116887627641254] |
1,802.05642 | The Mechanics of n-Player Differentiable Games | The cornerstone underpinning deep learning is the guarantee that gradient
descent on an objective converges to local minima. Unfortunately, this
guarantee fails in settings, such as generative adversarial nets, where there
are multiple interacting losses. The behavior of gradient-based methods in
games is not well understood -- and is becoming increasingly important as
adversarial and multi-objective architectures proliferate. In this paper, we
develop new techniques to understand and control the dynamics in general games.
The key result is to decompose the second-order dynamics into two components.
The first is related to potential games, which reduce to gradient descent on an
implicit function; the second relates to Hamiltonian games, a new class of
games that obey a conservation law, akin to conservation laws in classical
mechanical systems. The decomposition motivates Symplectic Gradient Adjustment
(SGA), a new algorithm for finding stable fixed points in general games. Basic
experiments show SGA is competitive with recently proposed algorithms for
finding stable fixed points in GANs -- whilst at the same time being applicable
to -- and having guarantees in -- much more general games.
| cs.LG cs.GT cs.MA cs.NE | the cornerstone underpinning deep learning is the guarantee that gradient descent on an objective converges to local minima unfortunately this guarantee fails in settings such as generative adversarial nets where there are multiple interacting losses the behavior of gradientbased methods in games is not well understood and is becoming increasingly important as adversarial and multiobjective architectures proliferate in this paper we develop new techniques to understand and control the dynamics in general games the key result is to decompose the secondorder dynamics into two components the first is related to potential games which reduce to gradient descent on an implicit function the second relates to hamiltonian games a new class of games that obey a conservation law akin to conservation laws in classical mechanical systems the decomposition motivates symplectic gradient adjustment sga a new algorithm for finding stable fixed points in general games basic experiments show sga is competitive with recently proposed algorithms for finding stable fixed points in gans whilst at the same time being applicable to and having guarantees in much more general games | [['the', 'cornerstone', 'underpinning', 'deep', 'learning', 'is', 'the', 'guarantee', 'that', 'gradient', 'descent', 'on', 'an', 'objective', 'converges', 'to', 'local', 'minima', 'unfortunately', 'this', 'guarantee', 'fails', 'in', 'settings', 'such', 'as', 'generative', 'adversarial', 'nets', 'where', 'there', 'are', 'multiple', 'interacting', 'losses', 'the', 'behavior', 'of', 'gradientbased', 'methods', 'in', 'games', 'is', 'not', 'well', 'understood', 'and', 'is', 'becoming', 'increasingly', 'important', 'as', 'adversarial', 'and', 'multiobjective', 'architectures', 'proliferate', 'in', 'this', 'paper', 'we', 'develop', 'new', 'techniques', 'to', 'understand', 'and', 'control', 'the', 'dynamics', 'in', 'general', 'games', 'the', 'key', 'result', 'is', 'to', 'decompose', 'the', 'secondorder', 'dynamics', 'into', 'two', 'components', 'the', 'first', 'is', 'related', 'to', 'potential', 'games', 'which', 'reduce', 'to', 'gradient', 'descent', 'on', 'an', 'implicit', 'function', 'the', 'second', 'relates', 'to', 'hamiltonian', 'games', 'a', 'new', 'class', 'of', 'games', 'that', 'obey', 'a', 'conservation', 'law', 'akin', 'to', 'conservation', 'laws', 'in', 'classical', 'mechanical', 'systems', 'the', 'decomposition', 'motivates', 'symplectic', 'gradient', 'adjustment', 'sga', 'a', 'new', 'algorithm', 'for', 'finding', 'stable', 'fixed', 'points', 'in', 'general', 'games', 'basic', 'experiments', 'show', 'sga', 'is', 'competitive', 'with', 'recently', 'proposed', 'algorithms', 'for', 'finding', 'stable', 'fixed', 'points', 'in', 'gans', 'whilst', 'at', 'the', 'same', 'time', 'being', 'applicable', 'to', 'and', 'having', 'guarantees', 'in', 'much', 'more', 'general', 'games']] | [-0.07892155538469194, 0.025301537571563545, -0.12688117343747185, 0.12859911904194055, -0.06817134688290852, -0.20428474582678807, 0.010107163837925658, 0.3792114850631068, -0.29207640374740795, -0.28749252081880433, 0.06241628906850978, -0.2297927020779091, -0.21583140715731794, 0.15891046224880317, -0.1649649941060819, 0.08786725992104039, 0.039345717885721984, 0.006772119263504547, -0.027430272235175256, -0.26710693702228705, 0.3067702023095494, 0.03065029927909729, 0.29305146386931563, 0.011886003734120592, 0.13647911415781974, -0.008491551910992712, 0.029197160621234532, 0.048170015344856605, -0.07649956564513229, 0.11090821684443984, 0.2895875369669573, 0.15788245406689716, 0.37471000930897636, -0.4322593240279027, -0.19150337236963175, 0.16818079830475405, 0.15455165635119722, 0.1320494757672515, -0.048923960450090155, -0.23975618298176082, 0.09768859293333, -0.10569126636784693, -0.09056528254719028, -0.14451998163713142, -0.01819154799622166, 0.03997372248903213, -0.297226340015186, 0.007108163230110553, 0.07764517982683504, 0.0545945526894436, -0.0689614473980617, -0.10971260006631796, 0.030575367573130115, 0.11808205794394863, 0.0381154613701669, 0.04470892763294449, 0.10609386640399779, -0.15413706277931025, -0.17284435464270329, 0.4012604085516862, -0.05470199443913192, -0.19336236781699964, 0.2010226315416565, -0.032210621854491445, -0.18358554148422132, 0.11032811669164486, 0.19889826959909193, 0.17647054702836779, -0.1431495392726819, 0.05563533447539984, -0.03575798992228969, 0.13856543325197312, 0.00995276353073264, -0.001218862617613261, 0.14437193086963485, 0.17783012860639824, 0.19689831631194465, 0.11907947688120078, 0.015061679399381816, -0.23504889087846756, -0.2681545660237713, -0.13252076456079853, -0.16462787823084826, 0.009821161125149625, -0.07611125589061306, -0.18440190639177506, 0.37137844672278414, 0.15063698543334877, 0.1644558797653934, 0.12165184691349912, 0.3244558039798655, 0.1282218325461806, 0.09298203804130688, 0.11330084408241832, 0.23326868499002143, 0.13592755460227968, 0.13947458506498317, -0.18001271553277381, 0.0947926674826621, 0.09075928964673287] |
1,802.05643 | Studies of $\rm t\bar{t}$+X at CMS | This talk is dedicated to the most recent measurements of the processes that
feature the production of a top quark pair either with an electroweak standard
model boson, or another pair of top, bottom or light quarks. For the
measurement of the production cross-section of top quark pair in association
with a photon, 19.7 $\rm fb^{-1}$ of proton-proton collision data collected by
CMS detector at $\sqrt{s}$ = 8 TeV is used, while for four top production, $\rm
t\bar{t}$ + bb, $\rm t\bar{t}$ + jj, $\rm t\bar{t}$W and $\rm t\bar{t}$Z the
data collected at $\sqrt{s}$ = 13 TeV amounting to 35.9 $\rm fb^{-1}$, is used.
The measurement of $\rm t\bar{t}\gamma$ is performed in the fiducial phase
space corresponding to the semileptonic decay chain of the top quark pair, and
the cross section is measured relative to the inclusive top quark pair
production cross section. The fiducial cross section for this process is found
to be 127 $\pm$ 27 (stat + syst) fb. The most recent search for the four top
quark production, that explores the same-sign dilepton final state, set the
upper observed (expected) limit to 4.6 ($2.9^{+1.4}_{-0.9}$) times predicted
standard model cross section. The measured cross section of the top pair
production with two b quarks is found to be $\sigma$($\rm t\bar{t}$ + bb) = 3.9
$\pm$ 0.6 (stat) $\pm$ 1.3 (syst) pb in the full phase space. The measurement
of the $\rm t\bar{t}$W and $\rm t\bar{t}$Z processes combines three final
states with two same-sign, three and four leptons. The $\rm t\bar{t}$W and $\rm
t\bar{t}$Z production cross sections are measured to be $\sigma$($\rm
t\bar{t}$Z) = $\rm 1.00^{+0.09}_{-0.08} (stat.)^{+0.12}_{-0.10} (sys.)$ pb and
$\sigma$($\rm t\bar{t}$W) = $\rm 0.80^{+0.12}_{-0.11} (stat.)^{+0.13}_{-0.12}
(sys.)$ pb with an expected (observed) significance of 4.6 (5.5) and 9.5 (9.9)
standard deviations from the background-only hypothesis.
| hep-ex | this talk is dedicated to the most recent measurements of the processes that feature the production of a top quark pair either with an electroweak standard model boson or another pair of top bottom or light quarks for the measurement of the production crosssection of top quark pair in association with a photon 197 rm fb1 of protonproton collision data collected by cms detector at sqrts 8 tev is used while for four top production rm tbart bb rm tbart jj rm tbartw and rm tbartz the data collected at sqrts 13 tev amounting to 359 rm fb1 is used the measurement of rm tbartgamma is performed in the fiducial phase space corresponding to the semileptonic decay chain of the top quark pair and the cross section is measured relative to the inclusive top quark pair production cross section the fiducial cross section for this process is found to be 127 pm 27 stat syst fb the most recent search for the four top quark production that explores the samesign dilepton final state set the upper observed expected limit to 46 2914_09 times predicted standard model cross section the measured cross section of the top pair production with two b quarks is found to be sigmarm tbart bb 39 pm 06 stat pm 13 syst pb in the full phase space the measurement of the rm tbartw and rm tbartz processes combines three final states with two samesign three and four leptons the rm tbartw and rm tbartz production cross sections are measured to be sigmarm tbartz rm 100009_008 stat012_010 sys pb and sigmarm tbartw rm 080012_011 stat013_012 sys pb with an expected observed significance of 46 55 and 95 99 standard deviations from the backgroundonly hypothesis | [['this', 'talk', 'is', 'dedicated', 'to', 'the', 'most', 'recent', 'measurements', 'of', 'the', 'processes', 'that', 'feature', 'the', 'production', 'of', 'a', 'top', 'quark', 'pair', 'either', 'with', 'an', 'electroweak', 'standard', 'model', 'boson', 'or', 'another', 'pair', 'of', 'top', 'bottom', 'or', 'light', 'quarks', 'for', 'the', 'measurement', 'of', 'the', 'production', 'crosssection', 'of', 'top', 'quark', 'pair', 'in', 'association', 'with', 'a', 'photon', '197', 'rm', 'fb1', 'of', 'protonproton', 'collision', 'data', 'collected', 'by', 'cms', 'detector', 'at', 'sqrts', '8', 'tev', 'is', 'used', 'while', 'for', 'four', 'top', 'production', 'rm', 'tbart', 'bb', 'rm', 'tbart', 'jj', 'rm', 'tbartw', 'and', 'rm', 'tbartz', 'the', 'data', 'collected', 'at', 'sqrts', '13', 'tev', 'amounting', 'to', '359', 'rm', 'fb1', 'is', 'used', 'the', 'measurement', 'of', 'rm', 'tbartgamma', 'is', 'performed', 'in', 'the', 'fiducial', 'phase', 'space', 'corresponding', 'to', 'the', 'semileptonic', 'decay', 'chain', 'of', 'the', 'top', 'quark', 'pair', 'and', 'the', 'cross', 'section', 'is', 'measured', 'relative', 'to', 'the', 'inclusive', 'top', 'quark', 'pair', 'production', 'cross', 'section', 'the', 'fiducial', 'cross', 'section', 'for', 'this', 'process', 'is', 'found', 'to', 'be', '127', 'pm', '27', 'stat', 'syst', 'fb', 'the', 'most', 'recent', 'search', 'for', 'the', 'four', 'top', 'quark', 'production', 'that', 'explores', 'the', 'samesign', 'dilepton', 'final', 'state', 'set', 'the', 'upper', 'observed', 'expected', 'limit', 'to', '46', '2914_09', 'times', 'predicted', 'standard', 'model', 'cross', 'section', 'the', 'measured', 'cross', 'section', 'of', 'the', 'top', 'pair', 'production', 'with', 'two', 'b', 'quarks', 'is', 'found', 'to', 'be', 'sigmarm', 'tbart', 'bb', '39', 'pm', '06', 'stat', 'pm', '13', 'syst', 'pb', 'in', 'the', 'full', 'phase', 'space', 'the', 'measurement', 'of', 'the', 'rm', 'tbartw', 'and', 'rm', 'tbartz', 'processes', 'combines', 'three', 'final', 'states', 'with', 'two', 'samesign', 'three', 'and', 'four', 'leptons', 'the', 'rm', 'tbartw', 'and', 'rm', 'tbartz', 'production', 'cross', 'sections', 'are', 'measured', 'to', 'be', 'sigmarm', 'tbartz', 'rm', '100009_008', 'stat012_010', 'sys', 'pb', 'and', 'sigmarm', 'tbartw', 'rm', '080012_011', 'stat013_012', 'sys', 'pb', 'with', 'an', 'expected', 'observed', 'significance', 'of', '46', '55', 'and', '95', '99', 'standard', 'deviations', 'from', 'the', 'backgroundonly', 'hypothesis']] | [-0.05206052032266314, 0.19656963881771064, -0.02377731966495461, 0.12354014665432402, 0.024579675074506563, -0.11158481832421946, 0.01834366815527967, 0.2871168911279962, -0.18226010957154848, -0.33672312368368, -0.025472623942145774, -0.4332488129668413, 0.16934323972520413, 0.16411907698031092, 0.09901292238166516, 0.12947180536691205, 0.1297913289559569, 0.017222439813269104, -0.0465434173366438, -0.24875065373217173, 0.21119318476709675, 0.03234110889190161, 0.27587827082049654, 0.11853739467708738, 0.05053740888334487, 0.05355575970862827, -0.07560333908235832, -0.14766749684597327, -0.11690639309773547, 0.08459140118174353, 0.21860510620750084, 0.0395667750077943, 0.03662202027725413, -0.26013750283391024, 0.03222714354373277, 0.17067598355174435, 0.12824781528667462, -0.003561942190004526, -0.010292365697892845, -0.3437137443057083, 0.2037633889955832, -0.260347687797819, -0.028683946434910415, 0.09544245925887178, 0.0451012729924727, -0.13430554599435968, -0.35471220837298334, 0.153511474787502, -0.07602465125894259, 0.06583215223725618, 0.032357680749194366, -0.2565812234112874, -0.17085515981761357, -0.09001182562816915, 0.061508877472749725, 0.14589804336017886, 0.22424697150238493, -0.094476523533371, -0.23880708516213767, 0.36799527109594, -0.12356406056606178, -0.15037396290266875, 0.1546014825935667, -0.20588359353132546, -0.12002136735476765, 0.19284445448639861, 0.2661745178786516, 0.06808646441171448, -0.2725052360531128, 0.10031987346749231, 0.00387920317378767, 0.23914938164191282, 0.07317584943181525, 0.014682404709325985, 0.18651090536170792, 0.23127933226216993, -0.04619620366563611, -0.010848000370699199, -0.22439014224058135, -0.04700443905312568, -0.46118215577600935, -0.1369576309078971, 0.022850326870085924, 0.11225006702283384, -0.05214675725979527, -0.028024867835457944, 0.28659925331751296, 0.06002172817679111, 0.36086420700984434, -0.012354499355358144, 0.2492793831298894, 0.11216005557205351, 0.04001369451503732, 0.060215549735048564, 0.33897850113914263, 0.2109603697334939, 0.13465193262016598, -0.16558129140027264, 0.021382342821733485, 0.029535346722283157] |
1,802.05644 | Equivariant Asymptotics of Szeg\"o kernels under Hamiltonian $U(2)$
actions | Let $M$ be complex projective manifold, and $A$ a positive line bundle on it.
Assume that a compact and connected Lie group $G$ acts on $M$ in a Hamiltonian
manner, and that this action linearizes to $A$. Then there is an associated
unitary representation of $G$ on the associated algebro-geometric Hardy space.
If the moment map is nowhere vanishing, the isotypical component are all finite
dimensional, they are generally not spaces of sections of some power of $A$.
One is then led to study the local and global asymptotic properties the
isotypical component associated to a weight $k \, \boldsymbol{\nu}$, when
$k\rightarrow +\infty$. In this paper, part of a series dedicated to this
general theme, we consider the case $G=U(2)$.
| math.SG math.CA math.CV | let m be complex projective manifold and a a positive line bundle on it assume that a compact and connected lie group g acts on m in a hamiltonian manner and that this action linearizes to a then there is an associated unitary representation of g on the associated algebrogeometric hardy space if the moment map is nowhere vanishing the isotypical component are all finite dimensional they are generally not spaces of sections of some power of a one is then led to study the local and global asymptotic properties the isotypical component associated to a weight k boldsymbolnu when krightarrow infty in this paper part of a series dedicated to this general theme we consider the case gu2 | [['let', 'm', 'be', 'complex', 'projective', 'manifold', 'and', 'a', 'a', 'positive', 'line', 'bundle', 'on', 'it', 'assume', 'that', 'a', 'compact', 'and', 'connected', 'lie', 'group', 'g', 'acts', 'on', 'm', 'in', 'a', 'hamiltonian', 'manner', 'and', 'that', 'this', 'action', 'linearizes', 'to', 'a', 'then', 'there', 'is', 'an', 'associated', 'unitary', 'representation', 'of', 'g', 'on', 'the', 'associated', 'algebrogeometric', 'hardy', 'space', 'if', 'the', 'moment', 'map', 'is', 'nowhere', 'vanishing', 'the', 'isotypical', 'component', 'are', 'all', 'finite', 'dimensional', 'they', 'are', 'generally', 'not', 'spaces', 'of', 'sections', 'of', 'some', 'power', 'of', 'a', 'one', 'is', 'then', 'led', 'to', 'study', 'the', 'local', 'and', 'global', 'asymptotic', 'properties', 'the', 'isotypical', 'component', 'associated', 'to', 'a', 'weight', 'k', 'boldsymbolnu', 'when', 'krightarrow', 'infty', 'in', 'this', 'paper', 'part', 'of', 'a', 'series', 'dedicated', 'to', 'this', 'general', 'theme', 'we', 'consider', 'the', 'case', 'gu2']] | [-0.18514768874562276, 0.0946617530935939, -0.08824475261406238, 0.01975208305472023, -0.11939465524941809, -0.10333002243629273, -0.008679825445234055, 0.380536877918018, -0.2921035859514685, -0.15788686632358728, 0.13198938461200593, -0.274014178820017, -0.15003945104026495, 0.17359359731835103, -0.09233912019481678, -0.03724592022143868, 0.04289154944346607, 0.1568341733351694, -0.07413549427854821, -0.24640652952430098, 0.4072460605442023, -0.020976349112710783, 0.2039051475042493, 0.019442111187215363, 0.1214618119919876, -0.010602649555643317, -0.005288428021643796, 0.0190684414141471, -0.10626977702131703, 0.11852339524071381, 0.27056137067774516, 0.06902706555380415, 0.2604545832478574, -0.3576421469230862, -0.1863487431262972, 0.22757233766948476, 0.11229486840174478, -0.03675377648323774, 0.006727806268017269, -0.25019608129465465, 0.11151010908789057, -0.1485328553909702, -0.1443947162440031, -0.07312484750790256, 0.07006523731563773, -0.023007890790653955, -0.27185141602570206, -0.010740803292475077, 0.10992685594290745, 0.07079943264012828, -0.0603063383468372, -0.07274303634742964, -0.04283120215111295, 0.08301262254362042, 0.002650417454986825, 0.10571399342147399, 0.0836982705332965, -0.07624840437701928, -0.04320525082156939, 0.3793501494053219, -0.08689480265328552, -0.24143174804254053, 0.16113998079594194, -0.1619386843605233, -0.17189944778889918, 0.11411285449304626, 0.14062850859736195, 0.17254109580085433, -0.06706594424422521, 0.17831149046551906, -0.0963443272019259, 0.11325534515301972, 0.03191819908332173, -0.01872866086714643, 0.154643070653664, 0.09085500639268518, 0.14331572863641157, 0.09146266396474406, -0.006688202680318475, -0.029352352920696607, -0.36121593292865184, -0.1978695055552046, -0.16857640265326695, 0.1535595553173114, -0.06147856522349547, -0.1730140022338689, 0.38594430445169076, 0.04366653489815697, 0.2561998980896579, 0.07932397948984965, 0.2511614956775633, 0.10943251117054342, 0.04242415157217188, 0.08727403495758146, 0.12153702830047612, 0.21195201944488154, 0.0012119523124346713, -0.1617494391056341, -0.02178659401085627, 0.14421137069751108] |
1,802.05645 | Exoplanetary atmosphere target selection in the era of comparative
planetology | The large number of new planets expected from wide-area transit surveys means
that follow-up transmission spectroscopy studies of their atmospheres will be
limited by the availability of telescope assets. We argue that telescopes
covering a broad range of apertures will be required, with even 1m-class
instruments providing a potentially important contribution. Survey strategies
that employ automated target selection will enable robust population studies.
As part of such a strategy, we propose a decision metric to pair the best
target to the most suitable telescope, and demonstrate its effectiveness even
when only primary transit observables are available. Transmission spectroscopy
target selection need not therefore be impeded by the bottle-neck of requiring
prior follow-up observations to determine the planet mass. The decision metric
can be easily deployed within a distributed heterogeneous network of telescopes
equipped to undertake either broadband photometry or spectroscopy. We show how
the metric can be used either to optimise the observing strategy for a given
telescope (e.g. choice of filter) or to enable the selection of the best
telescope to optimise the overall sample size. Our decision metric can also
provide the basis for a selection function to help evaluate the statistical
completeness of follow-up transmission spectroscopy datasets. Finally, we
validate our metric by comparing its ranked set of targets against lists of
planets that have had their atmospheres successfully probed, and against some
existing prioritised exoplanet lists.
| astro-ph.EP | the large number of new planets expected from widearea transit surveys means that followup transmission spectroscopy studies of their atmospheres will be limited by the availability of telescope assets we argue that telescopes covering a broad range of apertures will be required with even 1mclass instruments providing a potentially important contribution survey strategies that employ automated target selection will enable robust population studies as part of such a strategy we propose a decision metric to pair the best target to the most suitable telescope and demonstrate its effectiveness even when only primary transit observables are available transmission spectroscopy target selection need not therefore be impeded by the bottleneck of requiring prior followup observations to determine the planet mass the decision metric can be easily deployed within a distributed heterogeneous network of telescopes equipped to undertake either broadband photometry or spectroscopy we show how the metric can be used either to optimise the observing strategy for a given telescope eg choice of filter or to enable the selection of the best telescope to optimise the overall sample size our decision metric can also provide the basis for a selection function to help evaluate the statistical completeness of followup transmission spectroscopy datasets finally we validate our metric by comparing its ranked set of targets against lists of planets that have had their atmospheres successfully probed and against some existing prioritised exoplanet lists | [['the', 'large', 'number', 'of', 'new', 'planets', 'expected', 'from', 'widearea', 'transit', 'surveys', 'means', 'that', 'followup', 'transmission', 'spectroscopy', 'studies', 'of', 'their', 'atmospheres', 'will', 'be', 'limited', 'by', 'the', 'availability', 'of', 'telescope', 'assets', 'we', 'argue', 'that', 'telescopes', 'covering', 'a', 'broad', 'range', 'of', 'apertures', 'will', 'be', 'required', 'with', 'even', '1mclass', 'instruments', 'providing', 'a', 'potentially', 'important', 'contribution', 'survey', 'strategies', 'that', 'employ', 'automated', 'target', 'selection', 'will', 'enable', 'robust', 'population', 'studies', 'as', 'part', 'of', 'such', 'a', 'strategy', 'we', 'propose', 'a', 'decision', 'metric', 'to', 'pair', 'the', 'best', 'target', 'to', 'the', 'most', 'suitable', 'telescope', 'and', 'demonstrate', 'its', 'effectiveness', 'even', 'when', 'only', 'primary', 'transit', 'observables', 'are', 'available', 'transmission', 'spectroscopy', 'target', 'selection', 'need', 'not', 'therefore', 'be', 'impeded', 'by', 'the', 'bottleneck', 'of', 'requiring', 'prior', 'followup', 'observations', 'to', 'determine', 'the', 'planet', 'mass', 'the', 'decision', 'metric', 'can', 'be', 'easily', 'deployed', 'within', 'a', 'distributed', 'heterogeneous', 'network', 'of', 'telescopes', 'equipped', 'to', 'undertake', 'either', 'broadband', 'photometry', 'or', 'spectroscopy', 'we', 'show', 'how', 'the', 'metric', 'can', 'be', 'used', 'either', 'to', 'optimise', 'the', 'observing', 'strategy', 'for', 'a', 'given', 'telescope', 'eg', 'choice', 'of', 'filter', 'or', 'to', 'enable', 'the', 'selection', 'of', 'the', 'best', 'telescope', 'to', 'optimise', 'the', 'overall', 'sample', 'size', 'our', 'decision', 'metric', 'can', 'also', 'provide', 'the', 'basis', 'for', 'a', 'selection', 'function', 'to', 'help', 'evaluate', 'the', 'statistical', 'completeness', 'of', 'followup', 'transmission', 'spectroscopy', 'datasets', 'finally', 'we', 'validate', 'our', 'metric', 'by', 'comparing', 'its', 'ranked', 'set', 'of', 'targets', 'against', 'lists', 'of', 'planets', 'that', 'have', 'had', 'their', 'atmospheres', 'successfully', 'probed', 'and', 'against', 'some', 'existing', 'prioritised', 'exoplanet', 'lists']] | [-0.0813882586805646, 0.05982105357714159, -0.07910965496431226, 0.06890942427613166, -0.17255038966566486, -0.14714706455883772, 0.13457788155343303, 0.45167215995733506, -0.2023760527276191, -0.35881137594823603, 0.16097058841665074, -0.2719930871470791, -0.10621938631140991, 0.21955999889330047, -0.0806584006053922, 0.06610264929375895, 0.14926691356459226, -0.060288981903906226, 0.009911559209349038, -0.3041457099738814, 0.2945417509054887, 0.14347327875742769, 0.21832479054472692, -0.0027368491232071233, 0.05649613371402349, 0.015820294571028133, -0.10902057135902832, 0.027446458583859645, -0.11056665912455292, 0.09200034659943017, 0.3362813855865565, 0.23089585402352816, 0.2817241739041334, -0.37180985652866305, -0.21824476653710007, 0.11972132775649104, 0.14302864682818914, 0.05148448083080281, -0.013314456200105665, -0.3115542684023714, 0.0695825241971761, -0.17373995813288037, -0.15382449241436047, -0.09109033210324528, -0.032815531886223215, 0.049849491823545616, -0.27030063885183114, -0.050590743339726824, -0.046784664897005196, 0.06802117494744775, -0.08737645075737459, -0.11560730462407937, -0.02667557393990295, 0.15996605533380162, -0.018934206043005636, 0.01619274157160164, 0.13418589348540358, -0.11388860471295471, -0.09621034048032015, 0.3786045873659136, -0.07920018587914376, -0.1350368647636218, 0.18513954148688555, -0.1455848112479662, -0.12576164122893596, 0.12492897101809554, 0.21135467529959936, 0.15284061032428364, -0.20298153547419528, 0.0016960783977992833, 0.0050137492243463744, 0.21145575439921863, 0.03357871292543638, 0.07141481168041734, 0.273049403362624, 0.1826245486483221, 0.10718665785338406, 0.10968201627053888, -0.1987298305571565, 0.006403510398535139, -0.229294001868845, -0.12719843062855626, -0.17804132883598947, 0.04011697108843414, -0.08168365470799314, -0.11399673192012731, 0.3384164461015683, 0.20568167216691147, 0.13907217966777313, 0.07004405814526683, 0.3293243842077968, 0.04301541364003914, 0.1335673231550533, 0.02094398051723028, 0.2721757860070995, 0.04830382876098156, 0.0754347782359337, -0.2047040196975855, 0.10378152543435926, -0.04150062625589983] |
1,802.05646 | 4D blood flow mapping using SPIM-microPIV in the developing zebrafish
heart | Fluid-structure interaction in the developing heart is an active area of
research in developmental biology. However, investigation of heart dynamics is
mostly limited to computational fluid dynamics simulations using heart wall
structure information only, or single plane blood flow information - so there
is a need for 3D + time resolved data to fully understand cardiac function. We
present an imaging platform combining selective plane illumination microscopy
(SPIM) with micro particle image velocimetry ({\textmu}PIV) to enable
3D-resolved flow mapping in a microscopic environment, free from many of the
sources of error and bias present in traditional epifluorescence-based
{\textmu}PIV systems. By using our new system in conjunction with optical heart
beat synchronisation, we demonstrte the ability obtain non-invasive 3D + time
resolved blood flow measurements in the heart of a living zebrafish embryo.
| q-bio.QM | fluidstructure interaction in the developing heart is an active area of research in developmental biology however investigation of heart dynamics is mostly limited to computational fluid dynamics simulations using heart wall structure information only or single plane blood flow information so there is a need for 3d time resolved data to fully understand cardiac function we present an imaging platform combining selective plane illumination microscopy spim with micro particle image velocimetry textmupiv to enable 3dresolved flow mapping in a microscopic environment free from many of the sources of error and bias present in traditional epifluorescencebased textmupiv systems by using our new system in conjunction with optical heart beat synchronisation we demonstrte the ability obtain noninvasive 3d time resolved blood flow measurements in the heart of a living zebrafish embryo | [['fluidstructure', 'interaction', 'in', 'the', 'developing', 'heart', 'is', 'an', 'active', 'area', 'of', 'research', 'in', 'developmental', 'biology', 'however', 'investigation', 'of', 'heart', 'dynamics', 'is', 'mostly', 'limited', 'to', 'computational', 'fluid', 'dynamics', 'simulations', 'using', 'heart', 'wall', 'structure', 'information', 'only', 'or', 'single', 'plane', 'blood', 'flow', 'information', 'so', 'there', 'is', 'a', 'need', 'for', '3d', 'time', 'resolved', 'data', 'to', 'fully', 'understand', 'cardiac', 'function', 'we', 'present', 'an', 'imaging', 'platform', 'combining', 'selective', 'plane', 'illumination', 'microscopy', 'spim', 'with', 'micro', 'particle', 'image', 'velocimetry', 'textmupiv', 'to', 'enable', '3dresolved', 'flow', 'mapping', 'in', 'a', 'microscopic', 'environment', 'free', 'from', 'many', 'of', 'the', 'sources', 'of', 'error', 'and', 'bias', 'present', 'in', 'traditional', 'epifluorescencebased', 'textmupiv', 'systems', 'by', 'using', 'our', 'new', 'system', 'in', 'conjunction', 'with', 'optical', 'heart', 'beat', 'synchronisation', 'we', 'demonstrte', 'the', 'ability', 'obtain', 'noninvasive', '3d', 'time', 'resolved', 'blood', 'flow', 'measurements', 'in', 'the', 'heart', 'of', 'a', 'living', 'zebrafish', 'embryo']] | [-0.10408790112424252, 0.07282825142371416, -0.09625563648484287, 0.004031867057370442, -0.0676981610689132, -0.14415508715601097, -0.022489110344453837, 0.3857498067701536, -0.303390345949259, -0.28305635263302154, 0.13287050878786813, -0.2500812757850414, -0.17571281676458556, 0.23663786809230525, -0.12523090178447385, 0.07628272203803663, 0.09847747868033982, -0.011622413720620135, 0.038612703094258904, -0.1175712281744176, 0.22631552696205495, 0.028882401199230263, 0.3299788613428151, 0.02359292388803536, 0.1513910241314255, 0.03982982781693159, -0.02649873467312465, 0.02524151891139486, -0.14889709079908509, 0.13746606343005213, 0.2996819571656693, 0.12503940734126034, 0.30147896456013945, -0.5127452984827781, -0.2814665717268062, 0.03936595685269323, 0.1862399597096467, 0.13521867212388786, -0.13092047065841936, -0.2767817008143832, 0.03089726260382562, -0.09210203612043012, -0.08889343184719403, -0.06537165120244026, -0.007941293492612819, -0.0015922305221113587, -0.20898273620132973, 0.14569322867394094, -0.034446041163567816, 0.19373191202119475, -0.0841696940685412, 0.013409970804200238, -0.0006506034950425308, 0.228098430557199, -0.012568903933917623, 0.0918208799689197, 0.2326450228893889, -0.18784725319804443, -0.11234911095591323, 0.3755119093468473, -0.018242161351090837, -0.19447997520347277, 0.2527787485995495, -0.18986279367574402, -0.0911543064576108, 0.16208163378459792, 0.2007575854616833, 0.10842017848945913, -0.21007927295408257, -0.00857902129768439, 0.02711925146380259, 0.24200419623183175, 0.041255401237116705, -0.023513162057966955, 0.21609249930348126, 0.2744673013747219, 0.01707325902375047, 0.10933476146836314, -0.16210394246774096, -0.0764835285803964, -0.2083484806540993, -0.1574075713231709, -0.1621639495997149, 0.033800247504616215, -0.036083243073658046, -0.14393156046853325, 0.3682108298995562, 0.15994341662078496, 0.1419758487177352, -0.019265544553843116, 0.372063260750785, 0.005727587260245796, 0.07725921588491709, 0.01971681025104537, 0.21499390527981543, 0.09699258499266204, 0.13727958954780572, -0.24427415291035187, 0.04115260823539669, 0.03093640325636032] |
1,802.05647 | Non-thermal Leptogenesis after Majoron Hilltop Inflation | We analyse non-thermal leptogenesis after models of Majoron hilltop
inflation, where the scalar field that provides masses for the right-handed
neutrinos and sneutrinos via its vacuum expectation value acts as the inflaton.
We discuss different realisations of Majoron inflation models with different
hilltop shapes and couplings to the right-handed (s)neutrinos. To study the
non-thermally produced baryon asymmetry in these models, we numerically solve
the relevant Boltzmann equations. In contrast to previous studies, we include
the effects from resonant sneutrino particle production during preheating. We
find that these effects can result in an enhancement of the produced baryon
asymmetry by more than an order of magnitude. This can significantly change the
favoured parameter regions of these models.
| hep-ph | we analyse nonthermal leptogenesis after models of majoron hilltop inflation where the scalar field that provides masses for the righthanded neutrinos and sneutrinos via its vacuum expectation value acts as the inflaton we discuss different realisations of majoron inflation models with different hilltop shapes and couplings to the righthanded sneutrinos to study the nonthermally produced baryon asymmetry in these models we numerically solve the relevant boltzmann equations in contrast to previous studies we include the effects from resonant sneutrino particle production during preheating we find that these effects can result in an enhancement of the produced baryon asymmetry by more than an order of magnitude this can significantly change the favoured parameter regions of these models | [['we', 'analyse', 'nonthermal', 'leptogenesis', 'after', 'models', 'of', 'majoron', 'hilltop', 'inflation', 'where', 'the', 'scalar', 'field', 'that', 'provides', 'masses', 'for', 'the', 'righthanded', 'neutrinos', 'and', 'sneutrinos', 'via', 'its', 'vacuum', 'expectation', 'value', 'acts', 'as', 'the', 'inflaton', 'we', 'discuss', 'different', 'realisations', 'of', 'majoron', 'inflation', 'models', 'with', 'different', 'hilltop', 'shapes', 'and', 'couplings', 'to', 'the', 'righthanded', 'sneutrinos', 'to', 'study', 'the', 'nonthermally', 'produced', 'baryon', 'asymmetry', 'in', 'these', 'models', 'we', 'numerically', 'solve', 'the', 'relevant', 'boltzmann', 'equations', 'in', 'contrast', 'to', 'previous', 'studies', 'we', 'include', 'the', 'effects', 'from', 'resonant', 'sneutrino', 'particle', 'production', 'during', 'preheating', 'we', 'find', 'that', 'these', 'effects', 'can', 'result', 'in', 'an', 'enhancement', 'of', 'the', 'produced', 'baryon', 'asymmetry', 'by', 'more', 'than', 'an', 'order', 'of', 'magnitude', 'this', 'can', 'significantly', 'change', 'the', 'favoured', 'parameter', 'regions', 'of', 'these', 'models']] | [-0.10393509497677361, 0.2988188389936113, -0.038331519089767646, 0.17885898970015315, -0.08429939117170228, -0.1395155903441703, -0.010787463140802393, 0.32286417455380334, -0.22437874124293086, -0.312909184131121, -4.56023654210028e-05, -0.26236066395960794, -0.04590348159123597, 0.14290233490013132, 0.02442022431481244, -0.002533559820410025, 0.04013787445829025, -0.039357066696413374, -0.008257333793404415, -0.2772013419628914, 0.31143902295373443, 0.07655978692165608, 0.18602213423482367, 0.026182429957332026, 0.035054699011982, -0.08890978436001801, -0.003808154609628375, -0.07503149131762571, -0.15007732309672503, 0.02650049158596787, 0.14391577435049713, 0.09309072299169954, 0.1564521549654932, -0.44500566340163994, -0.22329362859454704, 0.269980777552801, 0.197807879396915, 0.1591057362524664, -0.07754222282215026, -0.2912358916685756, 0.047794395644249844, -0.2080671554852823, -0.09357049683076811, -0.07432514988663727, -0.05636814856753235, -0.1046789103079234, -0.3642426826118026, 0.1473949441268783, -0.06970236179366676, -0.05669852337149646, -0.05587747161264595, -0.13731711453372805, -0.08487215458921253, -0.03051406673380527, 0.2168259307107856, -0.06364352266747778, 0.20707918830810051, -0.22368905066857755, -0.12905836229088138, 0.40143538178607086, -0.1667034770398459, -0.12558889297511558, 0.11717923177839738, -0.13604731321061864, -0.14279401985173723, 0.08584784200527416, 0.1643005683977992, 0.12372231923429103, -0.12372587409255834, 0.12810211138025024, 0.01674685226191349, 0.12934851201435807, 0.06718085810606336, 0.002438709509141486, 0.30739183394752184, 0.14545451664638803, 0.0004040438657754968, 0.11608774264760573, -0.05388979078671927, -0.09815470708518065, -0.3767350762359926, -0.07217649755003894, -0.06144641571003815, 0.03852531898983529, -0.12139012074827595, -0.12017275401840694, 0.4726115005604666, 0.21950091428829935, 0.25841687147601927, -0.0033482632791454873, 0.2938054306272032, 0.11879420912611813, 0.07066241913356673, 0.018887403105979722, 0.32642294087995183, 0.13283844702628217, 0.13251839448087688, -0.2516874654654108, -0.021022665318390674, 0.025058610067734945] |
1,802.05648 | Light induced "Mock Gravity" at the nanoscale | The origin of long-range attractive interactions has fascinated scientist
along centuries. The remarkable Fatio-LeSage's corpuscular theory, introduced
as early as in 1690 and generalized to electromagnetic waves by Lorentz,
proposed that, due to their mutual shadowing, two absorbing particles in an
isotropic radiation field experience an attractive force which follows a
gravity-like inverse square distance law. Similar "Mock Gravity" interactions
were later introduced by Spitzer and Gamow in the context of Galaxy formation
but their actual relevance in Cosmology has never been unambiguously
established. Here we predict the existence of Mock-Gravity, inverse square
distance, attractive forces between two identical molecules or nanoparticles in
a quasi monochromatic isotropic random light field, whenever the light
frequency is tuned to an absorption line such that the real part of the
particle's electric polarizability is zero, i.e. at the so-called Froehlich
resonance. These interactions are scale independent, holding for both near and
far-field separation distances.
| physics.optics | the origin of longrange attractive interactions has fascinated scientist along centuries the remarkable fatiolesages corpuscular theory introduced as early as in 1690 and generalized to electromagnetic waves by lorentz proposed that due to their mutual shadowing two absorbing particles in an isotropic radiation field experience an attractive force which follows a gravitylike inverse square distance law similar mock gravity interactions were later introduced by spitzer and gamow in the context of galaxy formation but their actual relevance in cosmology has never been unambiguously established here we predict the existence of mockgravity inverse square distance attractive forces between two identical molecules or nanoparticles in a quasi monochromatic isotropic random light field whenever the light frequency is tuned to an absorption line such that the real part of the particles electric polarizability is zero ie at the socalled froehlich resonance these interactions are scale independent holding for both near and farfield separation distances | [['the', 'origin', 'of', 'longrange', 'attractive', 'interactions', 'has', 'fascinated', 'scientist', 'along', 'centuries', 'the', 'remarkable', 'fatiolesages', 'corpuscular', 'theory', 'introduced', 'as', 'early', 'as', 'in', '1690', 'and', 'generalized', 'to', 'electromagnetic', 'waves', 'by', 'lorentz', 'proposed', 'that', 'due', 'to', 'their', 'mutual', 'shadowing', 'two', 'absorbing', 'particles', 'in', 'an', 'isotropic', 'radiation', 'field', 'experience', 'an', 'attractive', 'force', 'which', 'follows', 'a', 'gravitylike', 'inverse', 'square', 'distance', 'law', 'similar', 'mock', 'gravity', 'interactions', 'were', 'later', 'introduced', 'by', 'spitzer', 'and', 'gamow', 'in', 'the', 'context', 'of', 'galaxy', 'formation', 'but', 'their', 'actual', 'relevance', 'in', 'cosmology', 'has', 'never', 'been', 'unambiguously', 'established', 'here', 'we', 'predict', 'the', 'existence', 'of', 'mockgravity', 'inverse', 'square', 'distance', 'attractive', 'forces', 'between', 'two', 'identical', 'molecules', 'or', 'nanoparticles', 'in', 'a', 'quasi', 'monochromatic', 'isotropic', 'random', 'light', 'field', 'whenever', 'the', 'light', 'frequency', 'is', 'tuned', 'to', 'an', 'absorption', 'line', 'such', 'that', 'the', 'real', 'part', 'of', 'the', 'particles', 'electric', 'polarizability', 'is', 'zero', 'ie', 'at', 'the', 'socalled', 'froehlich', 'resonance', 'these', 'interactions', 'are', 'scale', 'independent', 'holding', 'for', 'both', 'near', 'and', 'farfield', 'separation', 'distances']] | [-0.13435106850916756, 0.20206049057737466, -0.09032135976489396, 0.10791832750550652, -0.08416054183234392, -0.13909749284342882, -0.03738089611881956, 0.39951624593778745, -0.25384315552702486, -0.28572646640991206, 0.024311863238323204, -0.3006478908765536, -0.13438578991175648, 0.13602371639322064, 0.03077967478167078, 0.016599550755732013, -0.031062666204876747, 0.022749425849608526, -0.0030949888844668066, -0.20752247305736946, 0.2930142805593607, 0.09878794801571475, 0.24835409677193668, 0.07340078776539773, 0.09791923997823725, 0.0490560326975264, 0.009614987958272632, 0.02507191614229107, -0.10192826072946769, 0.05271928707034571, 0.18442582744392472, 0.017894499130801364, 0.2521283392038121, -0.4252807462725463, -0.2183123771226246, 0.11786603732597108, 0.16151821447400402, 0.08378630361422872, -0.06017133880456622, -0.3130040602233486, -0.011093301107894454, -0.13812113714548166, -0.18860630863564926, -0.015292589580827711, 0.08983284898646075, 0.04340404411777854, -0.21703144114139497, 0.0853589935792335, 0.053748763578900155, 0.06917190700519404, -0.07943661578371496, -0.09462445546269742, 0.007357300476377343, 0.1014601120415875, 0.07275356621412724, 0.033950393469441655, 0.14084762946746293, -0.12104522575539906, -0.09157173861218179, 0.39494090591051034, -0.07537410341534488, -0.11531366999479849, 0.23000426227914406, -0.138352430389644, -0.0419004201926541, 0.15869378808560788, 0.14911097378451252, 0.04037402475342794, -0.17768522218141655, 0.08200949529418722, -0.00998972834481689, 0.14630868918443687, 0.12883602678517955, 0.02957839160173547, 0.2848583142204373, 0.09300097191218762, 0.01279532931895064, 0.09258583681845425, -0.09573737624495512, -0.10048618298899008, -0.25959647312485334, -0.11546967360628581, -0.23687563585304974, 0.05713509747933521, -0.09207418397883103, -0.17138967509639305, 0.3142180427058831, 0.11719024795163797, 0.1482313921137544, -0.00033548865514188605, 0.27539736062800824, 0.06949823547698457, 0.0778690116392486, 0.023981102703189188, 0.36134313564785076, 0.172228841515783, 0.0894748194274241, -0.21693411013486502, 0.0289565167427313, 0.03919535155264323] |
1,802.05649 | Learning Determinantal Point Processes by Corrective Negative Sampling | Determinantal Point Processes (DPPs) have attracted significant interest from
the machine-learning community due to their ability to elegantly and tractably
model the delicate balance between quality and diversity of sets. DPPs are
commonly learned from data using maximum likelihood estimation (MLE). While
fitting observed sets well, MLE for DPPs may also assign high likelihoods to
unobserved sets that are far from the true generative distribution of the data.
To address this issue, which reduces the quality of the learned model, we
introduce a novel optimization problem, Contrastive Estimation (CE), which
encodes information about "negative" samples into the basic learning model. CE
is grounded in the successful use of negative information in machine-vision and
language modeling. Depending on the chosen negative distribution (which may be
static or evolve during optimization), CE assumes two different forms, which we
analyze theoretically and experimentally. We evaluate our new model on
real-world datasets; on a challenging dataset, CE learning delivers a
considerable improvement in predictive performance over a DPP learned without
using contrastive information.
| cs.LG | determinantal point processes dpps have attracted significant interest from the machinelearning community due to their ability to elegantly and tractably model the delicate balance between quality and diversity of sets dpps are commonly learned from data using maximum likelihood estimation mle while fitting observed sets well mle for dpps may also assign high likelihoods to unobserved sets that are far from the true generative distribution of the data to address this issue which reduces the quality of the learned model we introduce a novel optimization problem contrastive estimation ce which encodes information about negative samples into the basic learning model ce is grounded in the successful use of negative information in machinevision and language modeling depending on the chosen negative distribution which may be static or evolve during optimization ce assumes two different forms which we analyze theoretically and experimentally we evaluate our new model on realworld datasets on a challenging dataset ce learning delivers a considerable improvement in predictive performance over a dpp learned without using contrastive information | [['determinantal', 'point', 'processes', 'dpps', 'have', 'attracted', 'significant', 'interest', 'from', 'the', 'machinelearning', 'community', 'due', 'to', 'their', 'ability', 'to', 'elegantly', 'and', 'tractably', 'model', 'the', 'delicate', 'balance', 'between', 'quality', 'and', 'diversity', 'of', 'sets', 'dpps', 'are', 'commonly', 'learned', 'from', 'data', 'using', 'maximum', 'likelihood', 'estimation', 'mle', 'while', 'fitting', 'observed', 'sets', 'well', 'mle', 'for', 'dpps', 'may', 'also', 'assign', 'high', 'likelihoods', 'to', 'unobserved', 'sets', 'that', 'are', 'far', 'from', 'the', 'true', 'generative', 'distribution', 'of', 'the', 'data', 'to', 'address', 'this', 'issue', 'which', 'reduces', 'the', 'quality', 'of', 'the', 'learned', 'model', 'we', 'introduce', 'a', 'novel', 'optimization', 'problem', 'contrastive', 'estimation', 'ce', 'which', 'encodes', 'information', 'about', 'negative', 'samples', 'into', 'the', 'basic', 'learning', 'model', 'ce', 'is', 'grounded', 'in', 'the', 'successful', 'use', 'of', 'negative', 'information', 'in', 'machinevision', 'and', 'language', 'modeling', 'depending', 'on', 'the', 'chosen', 'negative', 'distribution', 'which', 'may', 'be', 'static', 'or', 'evolve', 'during', 'optimization', 'ce', 'assumes', 'two', 'different', 'forms', 'which', 'we', 'analyze', 'theoretically', 'and', 'experimentally', 'we', 'evaluate', 'our', 'new', 'model', 'on', 'realworld', 'datasets', 'on', 'a', 'challenging', 'dataset', 'ce', 'learning', 'delivers', 'a', 'considerable', 'improvement', 'in', 'predictive', 'performance', 'over', 'a', 'dpp', 'learned', 'without', 'using', 'contrastive', 'information']] | [-0.010724509032939136, 0.010894980243704772, -0.08563534972759393, 0.13221317381024933, -0.128330613136534, -0.17609266759331763, 0.07956669323653336, 0.4252955463092179, -0.29736941422958524, -0.34892429897738014, 0.05317295914539618, -0.3038373362526474, -0.16115870099299803, 0.16798193036776984, -0.11757880876931918, 0.07973318754766996, 0.0939017464301739, 0.024282189885143343, -0.10194696833037899, -0.264671536804502, 0.3194972212473206, 0.06884457106487109, 0.35613070138504166, -0.002761285856762934, 0.14991527671110128, 0.0012539898557863997, 0.0003693197211856849, 0.0056624154521692435, -0.10351588569596835, 0.1605296557729226, 0.28558320189225517, 0.2378022070759191, 0.33923636444915944, -0.36313476943625855, -0.25371207332255086, 0.1501336312445002, 0.14206649762503912, 0.08849249203948059, -0.04511346395427813, -0.28337932961094664, 0.05971552853089531, -0.1313476553269436, 0.029871523670973423, -0.14740795333533596, -0.0754967720837459, -0.013147774235463905, -0.3151495360194832, 0.05319475060306109, 0.058696273546827785, 0.06383226437979107, -0.02180676350711718, -0.18540684391397255, -0.026494530509033148, 0.12886062628843067, 0.0649108318102232, 0.005826222372087016, 0.1096761139280565, -0.1256690553947715, -0.11113535922527666, 0.338653300541657, -0.03874096193780693, -0.20488975332504325, 0.19211445709128352, -0.08103723871830255, -0.14796785059310605, 0.14294099704963129, 0.2608153773337388, 0.10797902199125589, -0.18674790283345435, 0.03810411458421697, -0.03351952396774081, 0.15958940646746858, 0.039767866480968805, -0.003832981511178983, 0.2276840605318392, 0.18783620168791104, 0.01784661796754061, 0.13785291136829347, -0.09990688231112381, -0.1357050467580116, -0.19246706542333025, -0.07656066928929567, -0.23478094042008799, 0.0022387092508728335, -0.1473696129641099, -0.16737502570038099, 0.3879278960207907, 0.23711506289033185, 0.22980100093078773, 0.05295256349690721, 0.30412639897955945, 0.06447654190409885, 0.052812026244637794, 0.06703574016839045, 0.18323185598028593, 0.05000119443608106, 0.07458903983072791, -0.16199455213644845, 0.1668423079932384, -0.019347681181736777] |
1,802.0565 | Ranks and Pseudo-Ranks - Paradoxical Results of Rank Tests - | Rank-based inference methods are applied in various disciplines, typically
when procedures relying on standard normal theory are not justifiable, for
example when data are not symmetrically distributed, contain outliers, or
responses are even measured on ordinal scales. Various specific rank-based
methods have been developed for two and more samples, and also for general
factorial designs (e.g., Kruskal-Wallis test, Jonckheere-Terpstra test). It is
the aim of the present paper (1) to demonstrate that traditional
rank-procedures for several samples or general factorial designs may lead to
paradoxical results in case of unbalanced samples, (2) to explain why this is
the case, and (3) to provide a way to overcome these disadvantages of
traditional rankbased inference. Theoretical investigations show that the
paradoxical results can be explained by carefully considering the
non-centralities of the test statistics which may be non-zero for the
traditional tests in unbalanced designs. These non-centralities may even become
arbitrarily large for increasing sample sizes in the unbalanced case. A simple
solution is the use of socalled pseudo-ranks instead of ranks. As a special
case, we illustrate the effects in sub-group analyses which are often used when
dealing with rare diseases.
| math.ST stat.TH | rankbased inference methods are applied in various disciplines typically when procedures relying on standard normal theory are not justifiable for example when data are not symmetrically distributed contain outliers or responses are even measured on ordinal scales various specific rankbased methods have been developed for two and more samples and also for general factorial designs eg kruskalwallis test jonckheereterpstra test it is the aim of the present paper 1 to demonstrate that traditional rankprocedures for several samples or general factorial designs may lead to paradoxical results in case of unbalanced samples 2 to explain why this is the case and 3 to provide a way to overcome these disadvantages of traditional rankbased inference theoretical investigations show that the paradoxical results can be explained by carefully considering the noncentralities of the test statistics which may be nonzero for the traditional tests in unbalanced designs these noncentralities may even become arbitrarily large for increasing sample sizes in the unbalanced case a simple solution is the use of socalled pseudoranks instead of ranks as a special case we illustrate the effects in subgroup analyses which are often used when dealing with rare diseases | [['rankbased', 'inference', 'methods', 'are', 'applied', 'in', 'various', 'disciplines', 'typically', 'when', 'procedures', 'relying', 'on', 'standard', 'normal', 'theory', 'are', 'not', 'justifiable', 'for', 'example', 'when', 'data', 'are', 'not', 'symmetrically', 'distributed', 'contain', 'outliers', 'or', 'responses', 'are', 'even', 'measured', 'on', 'ordinal', 'scales', 'various', 'specific', 'rankbased', 'methods', 'have', 'been', 'developed', 'for', 'two', 'and', 'more', 'samples', 'and', 'also', 'for', 'general', 'factorial', 'designs', 'eg', 'kruskalwallis', 'test', 'jonckheereterpstra', 'test', 'it', 'is', 'the', 'aim', 'of', 'the', 'present', 'paper', '1', 'to', 'demonstrate', 'that', 'traditional', 'rankprocedures', 'for', 'several', 'samples', 'or', 'general', 'factorial', 'designs', 'may', 'lead', 'to', 'paradoxical', 'results', 'in', 'case', 'of', 'unbalanced', 'samples', '2', 'to', 'explain', 'why', 'this', 'is', 'the', 'case', 'and', '3', 'to', 'provide', 'a', 'way', 'to', 'overcome', 'these', 'disadvantages', 'of', 'traditional', 'rankbased', 'inference', 'theoretical', 'investigations', 'show', 'that', 'the', 'paradoxical', 'results', 'can', 'be', 'explained', 'by', 'carefully', 'considering', 'the', 'noncentralities', 'of', 'the', 'test', 'statistics', 'which', 'may', 'be', 'nonzero', 'for', 'the', 'traditional', 'tests', 'in', 'unbalanced', 'designs', 'these', 'noncentralities', 'may', 'even', 'become', 'arbitrarily', 'large', 'for', 'increasing', 'sample', 'sizes', 'in', 'the', 'unbalanced', 'case', 'a', 'simple', 'solution', 'is', 'the', 'use', 'of', 'socalled', 'pseudoranks', 'instead', 'of', 'ranks', 'as', 'a', 'special', 'case', 'we', 'illustrate', 'the', 'effects', 'in', 'subgroup', 'analyses', 'which', 'are', 'often', 'used', 'when', 'dealing', 'with', 'rare', 'diseases']] | [-0.0391405188421895, 0.10222661341792225, -0.06246579974587705, 0.14396196939680422, -0.08205425802718949, -0.18998830937151168, 0.022826641091976213, 0.40186728250134635, -0.2137655397892829, -0.3095334457246134, 0.15109081381264872, -0.2669508502101274, -0.14261436404761027, 0.2557509414801324, -0.1206839263819888, 0.05106644279801765, 0.06661105950337809, 0.00984993608105248, -0.05387661132984716, -0.28880595143229976, 0.2965964721396213, 0.02185916654023065, 0.3223539267188391, -0.012624180742312927, 0.02914655085124478, -0.027070059826144497, -0.04573144976402054, 0.10763868740193445, -0.060825173373450524, 0.08734297311341317, 0.3051176576245878, 0.13761841929769394, 0.3169566816172084, -0.4377468491273199, -0.20689224701475453, 0.14176015115116497, 0.13505194510004445, 0.1221452960908111, -0.043870489017776765, -0.2273773494075883, 0.11700428724792358, -0.16426814938014422, -0.11370348747366586, -0.13719406736891943, -0.022923024210723345, 0.055035670730914615, -0.31035003060021915, 0.07770624456634569, 0.0835664101033094, 0.06971740874436659, 0.012346972839755787, -0.1703646513343965, 0.06899768119501705, 0.09722809268624169, 0.08398490534667429, -0.053700450924854426, 0.09443416023623777, -0.10602730194396164, -0.13968662524822395, 0.3772874760063919, 0.01979923327421971, -0.25938441032996856, 0.22327250881007293, -0.13681645913150262, -0.16568835986073355, 0.07843732391672863, 0.1871518198602103, 0.11298430471781742, -0.14307561408770836, 0.01851391360648228, -0.02466336480669073, 0.13393930044478258, 0.058461051670884764, -0.006602032319642603, 0.16635195896205668, 0.1423428565471408, 0.028649647245687006, 0.12461903572595376, -0.08540942141018505, -0.0741564977914095, -0.26624229838819924, -0.11817903889695534, -0.16314303889316883, 0.01817563625093474, -0.08133308019817845, -0.1664414827535684, 0.3478964829465022, 0.1778647770155756, 0.18671480329656923, 0.0566888687993727, 0.2927633337198278, 0.08472640068282851, 0.07306712500348285, 0.02752161868973761, 0.21753736731873172, 0.07306262419835942, 0.0240433020315863, -0.1266656617080239, 0.10894093457609415, -0.01268239755661705] |
1,802.05651 | Goldie ranks of primitive ideals and indexes of equivariant Azumaya
algebras | Let $\mathfrak{g}$ be a semisimple Lie algebra. We establish a new relation
between the Goldie rank of a primitive ideal $\mathcal{J}\subset
U(\mathfrak{g})$ and the dimension of the corresponding irreducible
representation $V$ of an appropriate finite W-algebra. Namely, we show that
$\operatorname{Grk}(\mathcal{J}) \leqslant \dim V/d_V$, where $d_V$ is the
index of a suitable equivariant Azumaya algebra on a homogeneous space. We also
compute $d_V$ in representation theoretic terms.
| math.RT math.RA | let mathfrakg be a semisimple lie algebra we establish a new relation between the goldie rank of a primitive ideal mathcaljsubset umathfrakg and the dimension of the corresponding irreducible representation v of an appropriate finite walgebra namely we show that operatornamegrkmathcalj leqslant dim vd_v where d_v is the index of a suitable equivariant azumaya algebra on a homogeneous space we also compute d_v in representation theoretic terms | [['let', 'mathfrakg', 'be', 'a', 'semisimple', 'lie', 'algebra', 'we', 'establish', 'a', 'new', 'relation', 'between', 'the', 'goldie', 'rank', 'of', 'a', 'primitive', 'ideal', 'mathcaljsubset', 'umathfrakg', 'and', 'the', 'dimension', 'of', 'the', 'corresponding', 'irreducible', 'representation', 'v', 'of', 'an', 'appropriate', 'finite', 'walgebra', 'namely', 'we', 'show', 'that', 'operatornamegrkmathcalj', 'leqslant', 'dim', 'vd_v', 'where', 'd_v', 'is', 'the', 'index', 'of', 'a', 'suitable', 'equivariant', 'azumaya', 'algebra', 'on', 'a', 'homogeneous', 'space', 'we', 'also', 'compute', 'd_v', 'in', 'representation', 'theoretic', 'terms']] | [-0.1840029113664059, 0.07521356100937737, -0.1049014684103895, 0.05115195597500133, -0.1560136029147543, -0.15834053874277743, -0.02785589047562098, 0.3300373551028315, -0.38033718965016305, -0.12274324317695573, 0.09279559853712271, -0.22414102296170313, -0.15068029523899895, 0.16775431831774767, -0.13803017798636574, -0.10783075535073294, 0.023706968102487735, 0.21790212256019004, -0.14547438536465052, -0.2255491606679243, 0.42674560949672014, -0.0601562514930265, 0.23328782495082123, 0.0027026540628867224, 0.17939169477904215, 0.028161516689579003, 0.002892412376240827, -0.01538464370651127, -0.1727554256364101, 0.15727108692226466, 0.3196395783452317, 0.07540473299377481, 0.20076437288116722, -0.30349602655041963, -0.06899685254029464, 0.24905685015255585, 0.17913540129666217, -0.07655086481099715, 0.011518443259774358, -0.2535946766001871, 0.1427922545117326, -0.29113844595849514, -0.15009276960336138, -0.06212043595587602, 0.15017610033282836, -0.07869096627109684, -0.32129125751089305, 0.016709515711681888, 0.06045045563951135, 0.17853381340319174, -0.11544148484972538, -0.1121410511987051, -0.08545262576080859, 0.04601951617769373, -0.15307269747790997, 0.05294963752021431, 0.06776838083169423, -0.07780510446173139, -0.11689401099283714, 0.377282620225742, -0.05795810354175046, -0.23689315927913412, 0.12684795466338983, -0.18817086130729876, -0.16294778147130273, 0.0346566205516865, 0.07209069424425252, 0.13490398936164638, 0.0017731933912727982, 0.2778035916844601, -0.1789082489121938, 0.06888902798527852, 0.028309511486440897, 0.01542742542369524, 0.10073468459449941, 0.09672356174996821, 0.06242836653473205, 0.11618618013562809, 0.03861830888854456, 0.09104338935867418, -0.4118544845841825, -0.2421382040483877, -0.14943466968543362, 0.19309742945915787, -0.20106241257940383, -0.12837800537818111, 0.39787105347932084, 0.10849778003466781, 0.18350915593327954, 0.1251886027312139, 0.18517568710376509, 0.1256693897594232, 0.043857531069079414, 0.11479121931188274, 0.07562890199187677, 0.28037184389540926, -0.08907274428202072, -0.15934284344984917, -0.08806209879548987, 0.266338693407306] |
1,802.05652 | Holographic Anisotropic Background with Confinement-Deconfinement Phase
Transition | We present new anisotropic black brane solutions in 5D
Einstein-dilaton-two-Maxwell system. The anisotropic background is specified by
an arbitrary dynamical exponent $\nu$, a nontrivial warp factor, a non-zero
dilaton field, a non-zero time component of the first Maxwell field and a
non-zero longitudinal magnetic component of the second Maxwell field. The
blackening function supports the Van der Waals-like phase transition between
small and large black holes for a suitable first Maxwell field charge. The
isotropic case corresponding to $\nu = 1$ and zero magnetic field reproduces
previously known solutions. We investigate the anisotropy influence on the
thermodynamic properties of our background, in particular, on the small/large
black holes phase transition diagram.
We discuss applications of the model to the bottom-up holographic QCD. The RG
flow interpolates between the UV section with two suppressed transversal
coordinates and the IR section with the suppressed time and longitudinal
coordinates due to anisotropic character of our solution. We study the temporal
Wilson loops, extended in longitudinal and transversal directions, by
calculating the minimal surfaces of the corresponding probing open string
world-sheet in anisotropic backgrounds with various temperatures and chemical
potentials. We find that dynamical wall locations depend on the orientation of
the quark pairs, that gives a crossover transition line between
confinement/deconfinement phases in the dual gauge theory. Instability of the
background leads to the appearance of the critical points $(\mu_{\vartheta,b},
T_{\vartheta,b})$ depending on the orientation $\vartheta$ of quark-antiquark
pairs in respect to the heavy ions collision line.
| hep-th | we present new anisotropic black brane solutions in 5d einsteindilatontwomaxwell system the anisotropic background is specified by an arbitrary dynamical exponent nu a nontrivial warp factor a nonzero dilaton field a nonzero time component of the first maxwell field and a nonzero longitudinal magnetic component of the second maxwell field the blackening function supports the van der waalslike phase transition between small and large black holes for a suitable first maxwell field charge the isotropic case corresponding to nu 1 and zero magnetic field reproduces previously known solutions we investigate the anisotropy influence on the thermodynamic properties of our background in particular on the smalllarge black holes phase transition diagram we discuss applications of the model to the bottomup holographic qcd the rg flow interpolates between the uv section with two suppressed transversal coordinates and the ir section with the suppressed time and longitudinal coordinates due to anisotropic character of our solution we study the temporal wilson loops extended in longitudinal and transversal directions by calculating the minimal surfaces of the corresponding probing open string worldsheet in anisotropic backgrounds with various temperatures and chemical potentials we find that dynamical wall locations depend on the orientation of the quark pairs that gives a crossover transition line between confinementdeconfinement phases in the dual gauge theory instability of the background leads to the appearance of the critical points mu_varthetab t_varthetab depending on the orientation vartheta of quarkantiquark pairs in respect to the heavy ions collision line | [['we', 'present', 'new', 'anisotropic', 'black', 'brane', 'solutions', 'in', '5d', 'einsteindilatontwomaxwell', 'system', 'the', 'anisotropic', 'background', 'is', 'specified', 'by', 'an', 'arbitrary', 'dynamical', 'exponent', 'nu', 'a', 'nontrivial', 'warp', 'factor', 'a', 'nonzero', 'dilaton', 'field', 'a', 'nonzero', 'time', 'component', 'of', 'the', 'first', 'maxwell', 'field', 'and', 'a', 'nonzero', 'longitudinal', 'magnetic', 'component', 'of', 'the', 'second', 'maxwell', 'field', 'the', 'blackening', 'function', 'supports', 'the', 'van', 'der', 'waalslike', 'phase', 'transition', 'between', 'small', 'and', 'large', 'black', 'holes', 'for', 'a', 'suitable', 'first', 'maxwell', 'field', 'charge', 'the', 'isotropic', 'case', 'corresponding', 'to', 'nu', '1', 'and', 'zero', 'magnetic', 'field', 'reproduces', 'previously', 'known', 'solutions', 'we', 'investigate', 'the', 'anisotropy', 'influence', 'on', 'the', 'thermodynamic', 'properties', 'of', 'our', 'background', 'in', 'particular', 'on', 'the', 'smalllarge', 'black', 'holes', 'phase', 'transition', 'diagram', 'we', 'discuss', 'applications', 'of', 'the', 'model', 'to', 'the', 'bottomup', 'holographic', 'qcd', 'the', 'rg', 'flow', 'interpolates', 'between', 'the', 'uv', 'section', 'with', 'two', 'suppressed', 'transversal', 'coordinates', 'and', 'the', 'ir', 'section', 'with', 'the', 'suppressed', 'time', 'and', 'longitudinal', 'coordinates', 'due', 'to', 'anisotropic', 'character', 'of', 'our', 'solution', 'we', 'study', 'the', 'temporal', 'wilson', 'loops', 'extended', 'in', 'longitudinal', 'and', 'transversal', 'directions', 'by', 'calculating', 'the', 'minimal', 'surfaces', 'of', 'the', 'corresponding', 'probing', 'open', 'string', 'worldsheet', 'in', 'anisotropic', 'backgrounds', 'with', 'various', 'temperatures', 'and', 'chemical', 'potentials', 'we', 'find', 'that', 'dynamical', 'wall', 'locations', 'depend', 'on', 'the', 'orientation', 'of', 'the', 'quark', 'pairs', 'that', 'gives', 'a', 'crossover', 'transition', 'line', 'between', 'confinementdeconfinement', 'phases', 'in', 'the', 'dual', 'gauge', 'theory', 'instability', 'of', 'the', 'background', 'leads', 'to', 'the', 'appearance', 'of', 'the', 'critical', 'points', 'mu_varthetab', 't_varthetab', 'depending', 'on', 'the', 'orientation', 'vartheta', 'of', 'quarkantiquark', 'pairs', 'in', 'respect', 'to', 'the', 'heavy', 'ions', 'collision', 'line']] | [-0.1949072643823456, 0.18671993646185, -0.05478434381792378, 0.06466274255702349, -0.06706662318604989, -0.11796910737078482, 0.01815792225728122, 0.3277473756907663, -0.19896362186409533, -0.24601720450276238, 0.017915800244372802, -0.2960925549423943, -0.11039973183263403, 0.1250838864701412, 0.03790397756965831, 0.020913109111522013, -0.048507908363050474, 0.026843194195680552, -0.11719810380279037, -0.19437263630873833, 0.37933104840146065, 0.02577163138776086, 0.2952735141094308, 0.06857132527511567, 0.07842083973616051, 0.009833829183480702, -0.0005089714706021671, 0.05415309548843652, -0.1712559795417595, 0.04900516508302341, 0.17064465845542146, -0.004081134715852386, 0.12616715597105213, -0.39643621766784537, -0.1935896915839597, 0.0785191944388013, 0.12482733255019411, 0.14200674016028642, -0.043000342190013426, -0.2733454125341571, 0.041189606282083936, -0.13018561502685772, -0.17862432026934888, -0.049253016808264265, 0.04741882207114637, -0.011606736171718998, -0.25147086244639166, 0.10039597048889845, 0.04054717030642981, 0.03668566729854016, -0.10032703377655708, -0.08020575360230092, -0.05184731050831033, 0.0947249488614034, 0.11898355285763197, 0.09570039205330734, 0.15360899837493586, -0.1717924041983982, -0.09880444714217447, 0.35135709380653374, -0.100876147900514, -0.17322258793671305, 0.17447880323743448, -0.19533042993189156, -0.0876356846303679, 0.15324329158426434, 0.15468496805600201, 0.13723856120098693, -0.10651577567914501, 0.15646828049624067, 0.016208009374289154, 0.1570451537583722, 0.08553886914257115, 0.013889041975683842, 0.2875301504973322, 0.09870080233425445, 0.024878277647561238, 0.16360874835324163, -0.07748601261215905, -0.11971585948679907, -0.3593164283471803, -0.14719086266656328, -0.14865720245288686, 0.06416527660330758, -0.17997098124427188, -0.22386687543961065, 0.39643630348145964, 0.12384305548497045, 0.22751083777402528, -0.01946753988740966, 0.23349820117064155, 0.10670637002234191, 0.03934013195491085, 0.07802807172896185, 0.27538064215089736, 0.16337392342005236, 0.1476255222922191, -0.29941012572489856, -0.05227492123958655, 0.11917715337379681] |
1,802.05653 | Persistence-infectivity trade-offs in environmentally transmitted
pathogens change population-level disease dynamics | Human pathogens transmitted through environmental pathways are subject to
stress and pressures outside of the host. These pressures may cause pathogen
pathovars to diverge in their environmental persistence and their infectivity
on an evolutionary time-scale. On a shorter time-scale, a single-genotype
pathogen population may display wide variation in persistence times and exhibit
biphasic decay. Using an infectious disease transmission modeling framework, we
demonstrate in both cases that fitness-preserving trade-offs have implications
for the dynamics of associated epidemics: less infectious, more persistent
pathogens cause epidemics to progress more slowly than more infectious, less
persistent (labile) pathogens, even when the overall risk is the same. Using
identifiability analysis, we show that the usual disease surveillance data does
not sufficiently inform these underlying pathogen population dynamics, even
with basic environmental monitoring. These results suggest directions for
future microbial research and environmental monitoring. In particular,
determining the relative infectivity of persistent pathogen subpopulations and
the rates of phenotypic conversion will help ascertain how much disease risk is
associated with the long tails of biphasic decay. Alternatively, risk can be
indirectly ascertained by developing methods to separately monitor labile and
persistent subpopulations. A better understanding of persistence--infectivity
trade-offs and associated dynamics can improve risk assessment and disease
control strategies.
| q-bio.PE | human pathogens transmitted through environmental pathways are subject to stress and pressures outside of the host these pressures may cause pathogen pathovars to diverge in their environmental persistence and their infectivity on an evolutionary timescale on a shorter timescale a singlegenotype pathogen population may display wide variation in persistence times and exhibit biphasic decay using an infectious disease transmission modeling framework we demonstrate in both cases that fitnesspreserving tradeoffs have implications for the dynamics of associated epidemics less infectious more persistent pathogens cause epidemics to progress more slowly than more infectious less persistent labile pathogens even when the overall risk is the same using identifiability analysis we show that the usual disease surveillance data does not sufficiently inform these underlying pathogen population dynamics even with basic environmental monitoring these results suggest directions for future microbial research and environmental monitoring in particular determining the relative infectivity of persistent pathogen subpopulations and the rates of phenotypic conversion will help ascertain how much disease risk is associated with the long tails of biphasic decay alternatively risk can be indirectly ascertained by developing methods to separately monitor labile and persistent subpopulations a better understanding of persistenceinfectivity tradeoffs and associated dynamics can improve risk assessment and disease control strategies | [['human', 'pathogens', 'transmitted', 'through', 'environmental', 'pathways', 'are', 'subject', 'to', 'stress', 'and', 'pressures', 'outside', 'of', 'the', 'host', 'these', 'pressures', 'may', 'cause', 'pathogen', 'pathovars', 'to', 'diverge', 'in', 'their', 'environmental', 'persistence', 'and', 'their', 'infectivity', 'on', 'an', 'evolutionary', 'timescale', 'on', 'a', 'shorter', 'timescale', 'a', 'singlegenotype', 'pathogen', 'population', 'may', 'display', 'wide', 'variation', 'in', 'persistence', 'times', 'and', 'exhibit', 'biphasic', 'decay', 'using', 'an', 'infectious', 'disease', 'transmission', 'modeling', 'framework', 'we', 'demonstrate', 'in', 'both', 'cases', 'that', 'fitnesspreserving', 'tradeoffs', 'have', 'implications', 'for', 'the', 'dynamics', 'of', 'associated', 'epidemics', 'less', 'infectious', 'more', 'persistent', 'pathogens', 'cause', 'epidemics', 'to', 'progress', 'more', 'slowly', 'than', 'more', 'infectious', 'less', 'persistent', 'labile', 'pathogens', 'even', 'when', 'the', 'overall', 'risk', 'is', 'the', 'same', 'using', 'identifiability', 'analysis', 'we', 'show', 'that', 'the', 'usual', 'disease', 'surveillance', 'data', 'does', 'not', 'sufficiently', 'inform', 'these', 'underlying', 'pathogen', 'population', 'dynamics', 'even', 'with', 'basic', 'environmental', 'monitoring', 'these', 'results', 'suggest', 'directions', 'for', 'future', 'microbial', 'research', 'and', 'environmental', 'monitoring', 'in', 'particular', 'determining', 'the', 'relative', 'infectivity', 'of', 'persistent', 'pathogen', 'subpopulations', 'and', 'the', 'rates', 'of', 'phenotypic', 'conversion', 'will', 'help', 'ascertain', 'how', 'much', 'disease', 'risk', 'is', 'associated', 'with', 'the', 'long', 'tails', 'of', 'biphasic', 'decay', 'alternatively', 'risk', 'can', 'be', 'indirectly', 'ascertained', 'by', 'developing', 'methods', 'to', 'separately', 'monitor', 'labile', 'and', 'persistent', 'subpopulations', 'a', 'better', 'understanding', 'of', 'persistenceinfectivity', 'tradeoffs', 'and', 'associated', 'dynamics', 'can', 'improve', 'risk', 'assessment', 'and', 'disease', 'control', 'strategies']] | [-0.10710322649742011, 0.16262283330448554, -0.0807385818939656, 0.16163969818386248, -0.05895375768232043, -0.1971542188175954, 0.08385503150522709, 0.41021194275468587, -0.25121873022784713, -0.2491615707357414, 0.14083084234269336, -0.25517679812386634, -0.23323798315483146, 0.20966257545631378, -0.15032999951225065, -0.01546497980132699, 0.08302312422032627, -0.023441784227907193, 0.06823399364948272, -0.26869886465137827, 0.23722190517000855, 0.06652228276012466, 0.28761020449455826, 0.037168998101260516, 0.02459979412786197, 0.007432122844038531, -0.05594755955040455, -0.0069432511366267135, -0.14518478806618076, 0.09264147506095469, 0.3317688051285222, 0.19191671239212155, 0.3650904425792396, -0.48440035987645386, -0.2926082718372345, 0.17091390362475067, 0.18494312532071489, 0.11942401294523734, 0.016788736073140173, -0.27823653802042825, 0.03105050692509394, -0.18713098768144845, -0.14984482447383926, -0.06719344407087192, 0.045508291320875284, 0.0474497404077556, -0.21320583381573668, 0.14431001703196672, -0.02594655721779418, 0.15185678604524583, -0.1044175414048368, -0.10196793328272179, -0.08367547005182133, 0.19831476572391693, 0.14408426052017603, -0.032423181043122896, 0.25573153926059605, -0.16077607596293092, -0.09637655497528613, 0.3049846148362849, -0.011980766744018182, -0.16086649177828805, 0.24545266760280357, -0.15102405077312142, -0.10451408118125982, 0.1753632395423483, 0.23168238173238934, 0.055665149093838406, -0.20572315699340835, -0.09427672079298645, 0.08983837236766704, 0.19156739119353006, 0.03916101556038484, 0.03201574400532991, 0.1938659022760112, 0.23249132567900233, 0.09777201812306885, 0.03730942048656288, -0.10060108558362117, -0.10696798298507929, -0.1465185207570903, -0.11139381944201887, -0.032456076042726635, 0.08254467283790291, -0.12242327990883496, -0.1433897139551118, 0.3950047638267279, 0.16794465879094786, 0.12872506357729435, 0.09017218717024661, 0.229953251122497, 0.024830551012419166, 0.03972753492416814, 0.028620609433855863, 0.15672695469809697, 0.06499170203052927, 0.08082437624922022, -0.29708425941411404, 0.2819089144631289, -0.08488758609979413] |
1,802.05654 | Thermal transport in 2D and 3D nanowire networks | We report on thermal transport properties in 2 and 3 dimensions
interconnected nanowire networks (strings and nodes). The thermal conductivity
of these nanostructures decreases in increasing the distance of the nodes,
reaching ultra-low values. This effect is much more pronounced in 3D networks
due to increased porosity, surface to volume ratio and the enhanced
backscattering at 3D nodes compared to 2D nodes. We propose a model to estimate
the thermal resistance related to the 2D and 3D interconnections in order to
provide an analytic description of thermal conductivity of such nanowire
networks; the latter is in good agreement with Molecular Dynamic results.
| cond-mat.mes-hall | we report on thermal transport properties in 2 and 3 dimensions interconnected nanowire networks strings and nodes the thermal conductivity of these nanostructures decreases in increasing the distance of the nodes reaching ultralow values this effect is much more pronounced in 3d networks due to increased porosity surface to volume ratio and the enhanced backscattering at 3d nodes compared to 2d nodes we propose a model to estimate the thermal resistance related to the 2d and 3d interconnections in order to provide an analytic description of thermal conductivity of such nanowire networks the latter is in good agreement with molecular dynamic results | [['we', 'report', 'on', 'thermal', 'transport', 'properties', 'in', '2', 'and', '3', 'dimensions', 'interconnected', 'nanowire', 'networks', 'strings', 'and', 'nodes', 'the', 'thermal', 'conductivity', 'of', 'these', 'nanostructures', 'decreases', 'in', 'increasing', 'the', 'distance', 'of', 'the', 'nodes', 'reaching', 'ultralow', 'values', 'this', 'effect', 'is', 'much', 'more', 'pronounced', 'in', '3d', 'networks', 'due', 'to', 'increased', 'porosity', 'surface', 'to', 'volume', 'ratio', 'and', 'the', 'enhanced', 'backscattering', 'at', '3d', 'nodes', 'compared', 'to', '2d', 'nodes', 'we', 'propose', 'a', 'model', 'to', 'estimate', 'the', 'thermal', 'resistance', 'related', 'to', 'the', '2d', 'and', '3d', 'interconnections', 'in', 'order', 'to', 'provide', 'an', 'analytic', 'description', 'of', 'thermal', 'conductivity', 'of', 'such', 'nanowire', 'networks', 'the', 'latter', 'is', 'in', 'good', 'agreement', 'with', 'molecular', 'dynamic', 'results']] | [-0.1486065327589327, 0.11697396942926229, 0.024857587089725568, -0.006115809780335529, -0.00692586491669656, -0.13075952592086704, 0.054227180304188355, 0.40138944227467566, -0.2553937728653717, -0.3283908356748083, 0.03379229175762328, -0.3483390489081834, -0.15653289692058667, 0.16472277121718826, -0.04973249740478601, 0.06578448343940431, 0.03571564581829543, -0.006867535633443599, -0.060800744832365534, -0.20175586219000466, 0.2743185436006124, 0.11084288645389617, 0.3463321687909318, 0.11254748030036103, 0.04756930782277064, -0.042237957154272816, 0.02230952240700158, 0.09354560313216757, -0.15906236367300153, 0.12486073777408284, 0.23507485048863672, -0.07066142674553774, 0.17292202261331327, -0.4999008996083456, -0.2342855036623922, 0.07380565363165065, 0.14947832976559214, 0.1395760831770067, -0.0021276637250112426, -0.23913219136496386, 0.11299746028859825, -0.12866355202334256, -0.11947204541488021, -0.048289092711866925, 0.031445695507321875, -0.030847386648768887, -0.23153768561086527, 0.10415790231861904, -0.0039570878291794774, 0.05698990840099606, -0.06753493572257724, -0.12160516963979486, -0.05723779472321564, 0.1253364239225858, 0.005427027900712382, 0.03066783974074996, 0.18347749798832572, -0.19345810187423565, -0.08202496188345786, 0.35567865615674094, -0.016175075921494805, -0.14758291367587506, 0.23346686554963098, -0.14244642673863792, -0.03952770770582206, 0.16869803990566118, 0.22147688608360933, 0.066535018434675, -0.11993954075025577, -0.012235113914928162, 0.02096548165176429, 0.17038211386249053, 0.0417604558352454, 0.08040553146187734, 0.1991638632801672, 0.2388449665158987, 0.04970173298509097, 0.16699370878518047, -0.12469684720431984, -0.03771994265672915, -0.18439408232841423, -0.17785254454094113, -0.20449968601700247, 0.06723490957280293, -0.16525543177918092, -0.1998433759892542, 0.3906838994144517, 0.19068406471142582, 0.22006358233892231, 0.05792694726009287, 0.29876386429018836, 0.11785727140365862, 0.09105175883308345, 0.08300942681072389, 0.23254103135938445, 0.16540808131114818, 0.14609464133322678, -0.23661900658329366, 0.06109671530259006, -0.0026106043791800154] |
1,802.05655 | Notes on the Dirichlet problem of a class of second order elliptic
partial differential equations on a Riemannian manifold | In these notes we study the Dirichlet problem for critical points of a convex
functional of the form \[ F(u)=\int_{\Omega}\phi\left( \left\vert \nabla
u\right\vert \right) , \] where $\Omega$ is a bounded domain of a complete
Riemannian manifold $\mathcal{M}.$ We also study the asymptotic Dirichlet
problem when $\Omega=\mathcal{M}$ is a Cartan-Hadamard manifold. Our aim is to
present a unified approach to this problem which comprises the classical
examples of the $p-$Laplacian ($\phi(s)=s^{p}$, $p>1)$ and the minimal surface
equation ($\phi(s)=\sqrt{1+s^{2}}$). Our approach does not use the direct
method of the Calculus of Variations which seems to be common in the case of
the $p-$Laplacian. Instead, we use the classical method of a-priori $C^{1}$
estimates of smooth solutions of the Euler-Lagrange equation. These estimates
are obtained by a coordinate free calculus. Degenerate elliptic equations like
the $p-$Laplacian are dealt with by an approximation argument.
These notes address mainly researchers and graduate students interested in
elliptic partial differential equations on Riemannian manifolds and may serve
as a material for corresponding courses and seminars.
| math.DG | in these notes we study the dirichlet problem for critical points of a convex functional of the form fuint_omegaphileft leftvert nabla urightvert right where omega is a bounded domain of a complete riemannian manifold mathcalm we also study the asymptotic dirichlet problem when omegamathcalm is a cartanhadamard manifold our aim is to present a unified approach to this problem which comprises the classical examples of the plaplacian phissp p1 and the minimal surface equation phissqrt1s2 our approach does not use the direct method of the calculus of variations which seems to be common in the case of the plaplacian instead we use the classical method of apriori c1 estimates of smooth solutions of the eulerlagrange equation these estimates are obtained by a coordinate free calculus degenerate elliptic equations like the plaplacian are dealt with by an approximation argument these notes address mainly researchers and graduate students interested in elliptic partial differential equations on riemannian manifolds and may serve as a material for corresponding courses and seminars | [['in', 'these', 'notes', 'we', 'study', 'the', 'dirichlet', 'problem', 'for', 'critical', 'points', 'of', 'a', 'convex', 'functional', 'of', 'the', 'form', 'fuint_omegaphileft', 'leftvert', 'nabla', 'urightvert', 'right', 'where', 'omega', 'is', 'a', 'bounded', 'domain', 'of', 'a', 'complete', 'riemannian', 'manifold', 'mathcalm', 'we', 'also', 'study', 'the', 'asymptotic', 'dirichlet', 'problem', 'when', 'omegamathcalm', 'is', 'a', 'cartanhadamard', 'manifold', 'our', 'aim', 'is', 'to', 'present', 'a', 'unified', 'approach', 'to', 'this', 'problem', 'which', 'comprises', 'the', 'classical', 'examples', 'of', 'the', 'plaplacian', 'phissp', 'p1', 'and', 'the', 'minimal', 'surface', 'equation', 'phissqrt1s2', 'our', 'approach', 'does', 'not', 'use', 'the', 'direct', 'method', 'of', 'the', 'calculus', 'of', 'variations', 'which', 'seems', 'to', 'be', 'common', 'in', 'the', 'case', 'of', 'the', 'plaplacian', 'instead', 'we', 'use', 'the', 'classical', 'method', 'of', 'apriori', 'c1', 'estimates', 'of', 'smooth', 'solutions', 'of', 'the', 'eulerlagrange', 'equation', 'these', 'estimates', 'are', 'obtained', 'by', 'a', 'coordinate', 'free', 'calculus', 'degenerate', 'elliptic', 'equations', 'like', 'the', 'plaplacian', 'are', 'dealt', 'with', 'by', 'an', 'approximation', 'argument', 'these', 'notes', 'address', 'mainly', 'researchers', 'and', 'graduate', 'students', 'interested', 'in', 'elliptic', 'partial', 'differential', 'equations', 'on', 'riemannian', 'manifolds', 'and', 'may', 'serve', 'as', 'a', 'material', 'for', 'corresponding', 'courses', 'and', 'seminars']] | [-0.11833734127957328, 0.018073920624576405, -0.09968073814130032, 0.08405801372884278, -0.16259249569388268, -0.15631674575895346, -0.012740548422709568, 0.2977545797554661, -0.291215416089988, -0.2572922291777407, 0.1471148674185158, -0.32027023205142696, -0.13905270895805716, 0.17800481230190116, -0.14225123209855806, 0.07887914721037687, 0.08572516795449005, 0.07890510456176636, -0.09719662062743288, -0.22036744291997618, 0.4110123615849901, -0.07063244152699172, 0.19556593103334308, 0.06126526350235957, 0.1043742052566858, -0.04324301380189287, 0.0028528285580744716, -0.015828597166770954, -0.1904290664601887, 0.158098807947187, 0.30999023826033983, 0.05508487747786681, 0.35112432166244145, -0.43841567133081916, -0.18844333125422436, 0.11139059055274651, 0.13035933189898913, 0.0407745288181935, -0.011713092811808082, -0.3101501346229472, 0.08268312908663059, -0.07682477545430079, -0.18008331788910759, -0.04823314774792963, -0.02978896292179455, 0.03378851209804396, -0.281451696889291, 0.08676776724395394, 0.10868333228346375, 0.06604911584657168, -0.1352751940606668, -0.12746410987075465, 0.001927050089256631, 0.06370972445537193, 0.03254387111232018, 0.0527581005288219, 0.05762141028327154, -0.09352742680089755, -0.08093574682802514, 0.3652978027584376, -0.05840634186910235, -0.30670184886404944, 0.10335747648984837, -0.11716240350111032, -0.13341722681106608, 0.06820392895800372, 0.17880792561401096, 0.23764797078911215, -0.1554897257956327, 0.16247232697105013, -0.04635989191718428, 0.1130131460369829, 0.060623837652167785, -0.058322976581913266, 0.09941628382736702, 0.11946373879995749, 0.11744356758599342, 0.09312886379897756, 0.005664549019176191, -0.1123666685120559, -0.38020022457787467, -0.17894544112668545, -0.15737472707405686, 0.10432927311347068, -0.08304316209978424, -0.1958208808525937, 0.35349071889765055, 0.0694022753511636, 0.14426002257940485, 0.06630429199661048, 0.23528940043768581, 0.1558649988599225, -0.020122846473514297, 0.07964410681498846, 0.14175625182228324, 0.16553786795954278, 0.13157912213312187, -0.18316537875216454, 0.0016371226340624286, 0.13465976991924603] |
1,802.05656 | 3D Convolutional Encoder-Decoder Network for Low-Dose CT via Transfer
Learning from a 2D Trained Network | Low-dose computed tomography (CT) has attracted a major attention in the
medical imaging field, since CT-associated x-ray radiation carries health risks
for patients. The reduction of CT radiation dose, however, compromises the
signal-to-noise ratio, and may compromise the image quality and the diagnostic
performance. Recently, deep-learning-based algorithms have achieved promising
results in low-dose CT denoising, especially convolutional neural network (CNN)
and generative adversarial network (GAN). This article introduces a Contracting
Path-based Convolutional Encoder-decoder (CPCE) network in 2D and 3D
configurations within the GAN framework for low-dose CT denoising. A novel
feature of our approach is that an initial 3D CPCE denoising model can be
directly obtained by extending a trained 2D CNN and then fine-tuned to
incorporate 3D spatial information from adjacent slices. Based on the transfer
learning from 2D to 3D, the 3D network converges faster and achieves a better
denoising performance than that trained from scratch. By comparing the CPCE
with recently published methods based on the simulated Mayo dataset and the
real MGH dataset, we demonstrate that the 3D CPCE denoising model has a better
performance, suppressing image noise and preserving subtle structures.
| cs.CV | lowdose computed tomography ct has attracted a major attention in the medical imaging field since ctassociated xray radiation carries health risks for patients the reduction of ct radiation dose however compromises the signaltonoise ratio and may compromise the image quality and the diagnostic performance recently deeplearningbased algorithms have achieved promising results in lowdose ct denoising especially convolutional neural network cnn and generative adversarial network gan this article introduces a contracting pathbased convolutional encoderdecoder cpce network in 2d and 3d configurations within the gan framework for lowdose ct denoising a novel feature of our approach is that an initial 3d cpce denoising model can be directly obtained by extending a trained 2d cnn and then finetuned to incorporate 3d spatial information from adjacent slices based on the transfer learning from 2d to 3d the 3d network converges faster and achieves a better denoising performance than that trained from scratch by comparing the cpce with recently published methods based on the simulated mayo dataset and the real mgh dataset we demonstrate that the 3d cpce denoising model has a better performance suppressing image noise and preserving subtle structures | [['lowdose', 'computed', 'tomography', 'ct', 'has', 'attracted', 'a', 'major', 'attention', 'in', 'the', 'medical', 'imaging', 'field', 'since', 'ctassociated', 'xray', 'radiation', 'carries', 'health', 'risks', 'for', 'patients', 'the', 'reduction', 'of', 'ct', 'radiation', 'dose', 'however', 'compromises', 'the', 'signaltonoise', 'ratio', 'and', 'may', 'compromise', 'the', 'image', 'quality', 'and', 'the', 'diagnostic', 'performance', 'recently', 'deeplearningbased', 'algorithms', 'have', 'achieved', 'promising', 'results', 'in', 'lowdose', 'ct', 'denoising', 'especially', 'convolutional', 'neural', 'network', 'cnn', 'and', 'generative', 'adversarial', 'network', 'gan', 'this', 'article', 'introduces', 'a', 'contracting', 'pathbased', 'convolutional', 'encoderdecoder', 'cpce', 'network', 'in', '2d', 'and', '3d', 'configurations', 'within', 'the', 'gan', 'framework', 'for', 'lowdose', 'ct', 'denoising', 'a', 'novel', 'feature', 'of', 'our', 'approach', 'is', 'that', 'an', 'initial', '3d', 'cpce', 'denoising', 'model', 'can', 'be', 'directly', 'obtained', 'by', 'extending', 'a', 'trained', '2d', 'cnn', 'and', 'then', 'finetuned', 'to', 'incorporate', '3d', 'spatial', 'information', 'from', 'adjacent', 'slices', 'based', 'on', 'the', 'transfer', 'learning', 'from', '2d', 'to', '3d', 'the', '3d', 'network', 'converges', 'faster', 'and', 'achieves', 'a', 'better', 'denoising', 'performance', 'than', 'that', 'trained', 'from', 'scratch', 'by', 'comparing', 'the', 'cpce', 'with', 'recently', 'published', 'methods', 'based', 'on', 'the', 'simulated', 'mayo', 'dataset', 'and', 'the', 'real', 'mgh', 'dataset', 'we', 'demonstrate', 'that', 'the', '3d', 'cpce', 'denoising', 'model', 'has', 'a', 'better', 'performance', 'suppressing', 'image', 'noise', 'and', 'preserving', 'subtle', 'structures']] | [0.05002883771761648, -0.05479055961296655, -0.03790783892083611, 0.05790627539705334, -0.04306441073406588, -0.21655280291530732, -0.03430376917350333, 0.48917451013584395, -0.2305976510148596, -0.32253193899082977, 0.06179458165000117, -0.29286474942959645, -0.2235104873298189, 0.18588602464721612, -0.17562903224842974, 0.12495159935363492, 0.16107107565511722, -0.0004048395511769765, -0.11108869707237023, -0.27840255699749733, 0.2831852524415464, 0.09144942613862883, 0.4214121911737665, -0.0018304286663093276, 0.13810771298720628, -0.04816450556186405, -0.023370682316001604, 0.03086563609666317, -0.043013418633829036, 0.1678741851141928, 0.2733824492004272, 0.19065106085161804, 0.30201332085337995, -0.4427211107933151, -0.3082790262795783, 0.07367978074864762, 0.14742006550266132, 0.09343677776412586, -0.09514937165186967, -0.3734370575311619, 0.09123756835438512, -0.12936396709316084, 0.09325751107346543, -0.13279753934491326, -0.07123392628241532, -0.07487572148391927, -0.3265446473064052, 0.08524268406468469, 0.032131263447573055, 0.057397589887920264, -0.09635893005525341, -0.12691961265848697, -0.046270065053643006, 0.16463366287282188, -0.00700302309532826, 0.15270417974317899, 0.1570111722295248, -0.23197534639715545, -0.12111359945171185, 0.33237736443611415, -0.032915053917236654, -0.189796578197589, 0.151853313888549, -0.03864120814596882, -0.11030369362466641, 0.17579246661751657, 0.22019712587164061, 0.11361628823938805, -0.15014791711158043, 0.01013036741044473, -0.027532043094067156, 0.17809144506054755, 0.05264790248050279, -0.03633899609809993, 0.1399163884916217, 0.2819008424657875, -0.0175080343338384, 0.1617276897030958, -0.24301958124379855, -0.013335371643581704, -0.12285144123424951, -0.12377867964599785, -0.22042660946718642, 0.027031124444879793, -0.11946195754587549, -0.1495727239692634, 0.43768089958592443, 0.22694448228686342, 0.1987945727525732, 0.06873877507860998, 0.3864317045823948, 0.006795624752428282, 0.1366710349168578, 0.06718421345073226, 0.1999178045567729, 0.01819007649665346, 0.1423591142561211, -0.16217645094226543, 0.06542660723726668, 0.0726504045387579] |
1,802.05657 | IRIS observations of magnetic interactions in the solar atmosphere
between pre-existing and emerging magnetic fields. I. Overall evolution | We report multi-wavelength ultraviolet observations taken with the IRIS
satellite, concerning the emergence phase in the upper chromosphere and
transition region of an emerging flux region (EFR) embedded in the pre-existing
field of active region NOAA 12529. IRIS data are complemented by full-disk
observations of the Solar Dynamics Observatory satellite, relevant to the
photosphere and the corona. The photospheric configuration of the EFR is also
analyzed by measurements taken with the spectropolarimeter aboard the Hinode
satellite, when the EFR was fully developed. Recurrent intense brightenings
that resemble UV bursts, with counterparts in all coronal passbands, are
identified at the edges of the EFR. Jet activity is also observed at
chromospheric and coronal levels, near the observed brightenings. The analysis
of the IRIS line profiles reveals the heating of dense plasma in the low solar
atmosphere and the driving of bi-directional high-velocity flows with speed up
to 100 km/s at the same locations. Compared with previous observations and
numerical models, these signatures suggest evidence of several long-lasting,
small-scale magnetic reconnection episodes between the emerging bipole and the
ambient field. This process leads to the cancellation of a pre-existing
photospheric flux concentration and appears to occur higher in the atmosphere
than usually found in UV bursts, explaining the observed coronal counterparts.
| astro-ph.SR | we report multiwavelength ultraviolet observations taken with the iris satellite concerning the emergence phase in the upper chromosphere and transition region of an emerging flux region efr embedded in the preexisting field of active region noaa 12529 iris data are complemented by fulldisk observations of the solar dynamics observatory satellite relevant to the photosphere and the corona the photospheric configuration of the efr is also analyzed by measurements taken with the spectropolarimeter aboard the hinode satellite when the efr was fully developed recurrent intense brightenings that resemble uv bursts with counterparts in all coronal passbands are identified at the edges of the efr jet activity is also observed at chromospheric and coronal levels near the observed brightenings the analysis of the iris line profiles reveals the heating of dense plasma in the low solar atmosphere and the driving of bidirectional highvelocity flows with speed up to 100 kms at the same locations compared with previous observations and numerical models these signatures suggest evidence of several longlasting smallscale magnetic reconnection episodes between the emerging bipole and the ambient field this process leads to the cancellation of a preexisting photospheric flux concentration and appears to occur higher in the atmosphere than usually found in uv bursts explaining the observed coronal counterparts | [['we', 'report', 'multiwavelength', 'ultraviolet', 'observations', 'taken', 'with', 'the', 'iris', 'satellite', 'concerning', 'the', 'emergence', 'phase', 'in', 'the', 'upper', 'chromosphere', 'and', 'transition', 'region', 'of', 'an', 'emerging', 'flux', 'region', 'efr', 'embedded', 'in', 'the', 'preexisting', 'field', 'of', 'active', 'region', 'noaa', '12529', 'iris', 'data', 'are', 'complemented', 'by', 'fulldisk', 'observations', 'of', 'the', 'solar', 'dynamics', 'observatory', 'satellite', 'relevant', 'to', 'the', 'photosphere', 'and', 'the', 'corona', 'the', 'photospheric', 'configuration', 'of', 'the', 'efr', 'is', 'also', 'analyzed', 'by', 'measurements', 'taken', 'with', 'the', 'spectropolarimeter', 'aboard', 'the', 'hinode', 'satellite', 'when', 'the', 'efr', 'was', 'fully', 'developed', 'recurrent', 'intense', 'brightenings', 'that', 'resemble', 'uv', 'bursts', 'with', 'counterparts', 'in', 'all', 'coronal', 'passbands', 'are', 'identified', 'at', 'the', 'edges', 'of', 'the', 'efr', 'jet', 'activity', 'is', 'also', 'observed', 'at', 'chromospheric', 'and', 'coronal', 'levels', 'near', 'the', 'observed', 'brightenings', 'the', 'analysis', 'of', 'the', 'iris', 'line', 'profiles', 'reveals', 'the', 'heating', 'of', 'dense', 'plasma', 'in', 'the', 'low', 'solar', 'atmosphere', 'and', 'the', 'driving', 'of', 'bidirectional', 'highvelocity', 'flows', 'with', 'speed', 'up', 'to', '100', 'kms', 'at', 'the', 'same', 'locations', 'compared', 'with', 'previous', 'observations', 'and', 'numerical', 'models', 'these', 'signatures', 'suggest', 'evidence', 'of', 'several', 'longlasting', 'smallscale', 'magnetic', 'reconnection', 'episodes', 'between', 'the', 'emerging', 'bipole', 'and', 'the', 'ambient', 'field', 'this', 'process', 'leads', 'to', 'the', 'cancellation', 'of', 'a', 'preexisting', 'photospheric', 'flux', 'concentration', 'and', 'appears', 'to', 'occur', 'higher', 'in', 'the', 'atmosphere', 'than', 'usually', 'found', 'in', 'uv', 'bursts', 'explaining', 'the', 'observed', 'coronal', 'counterparts']] | [-0.11042931471487873, 0.20238821606245616, 0.03144222651340923, 0.1238335891107519, -0.05193138113535014, -0.051899354263213265, 0.010278825080534666, 0.46159564723755325, -0.17208399643016417, -0.36672881262546236, 0.09572694699155193, -0.2931801518202541, -0.09746392369303745, 0.2134451229018315, -0.02362405232409501, -0.02497811375172479, 0.0953065356162809, -0.04572224799202728, -0.0011451453118530464, -0.16279139076125626, 0.2563199499158554, 0.15234222095103211, 0.23523387662692075, -0.02340330056953088, 0.050297473983406914, -0.16706776556126665, -0.07356554349220433, 0.008266384507257616, -0.1055500120592332, 0.04644795484257679, 0.20364392355483588, 0.1065735912950861, 0.19668228076949146, -0.4868834146953513, -0.2914150676881654, -0.028114079371870063, 0.17724751060579025, -0.04571036605886295, -0.02553703917722935, -0.31959681426627234, 0.036794836310119455, -0.0780672051467037, -0.10724313299029031, 0.08743112660747002, -9.222273741576945e-05, -0.0014015171748171583, -0.2730057540942322, 0.04032991337005058, 0.0012122808485492422, 0.1760503721843155, -0.15845154326756677, -0.0012125671778818923, -0.10393373130678096, 0.12666287800282103, 0.10892795532834315, 0.06489502374443747, 0.1784423956372909, -0.1457095870995475, -0.06678343138269831, 0.31908107378729506, -0.06684001508976821, 0.07775890959970404, 0.2130306214094162, -0.2707690824743396, -0.14484624110906424, 0.25461812756407526, 0.1206481371333368, 0.06189730895669801, -0.1006024494903239, -0.01688222656804627, -0.05440126967607467, 0.12796291064150167, 0.050213606760761385, 0.04717506079502297, 0.2900347804191687, 0.0901709333113417, 0.019796377905693493, 0.1386301543198205, -0.30895541558871004, -0.06526274002506954, -0.27844755570337393, -0.09494266844728881, -0.05668612912299477, 0.012618840894601687, -0.07647972583998291, -0.17434986176205416, 0.39634109267064827, 0.1647197092887745, 0.2387024947524552, -0.05217190909324187, 0.3095659135136771, 0.0968568699460022, 0.08842047932223555, 0.18469046462665906, 0.32435177747632543, 0.1856274600363555, 0.23516928831661374, -0.2312549608258272, 0.041820613836700264, 0.07139324069381847] |
1,802.05658 | Reconsidering evidence of shift current in a ferroelectric
charge-transfer complex | In Nakamura et al.[1], the authors present evidence of shift current in the
electronic ferroelectric tetrathiafulvalene-$p$-chloranil (TTF-CA). Since the
bulk photovoltaic current in non-centrosymmetric crystals has two
contributions, namely the ballistic and shift, we explain why the experimental
data and analysis presented by the authors does not permit unambiguous
identification of shift current, and is not consistent with the mechanism of
shift.
| cond-mat.mes-hall | in nakamura et al1 the authors present evidence of shift current in the electronic ferroelectric tetrathiafulvalenepchloranil ttfca since the bulk photovoltaic current in noncentrosymmetric crystals has two contributions namely the ballistic and shift we explain why the experimental data and analysis presented by the authors does not permit unambiguous identification of shift current and is not consistent with the mechanism of shift | [['in', 'nakamura', 'et', 'al1', 'the', 'authors', 'present', 'evidence', 'of', 'shift', 'current', 'in', 'the', 'electronic', 'ferroelectric', 'tetrathiafulvalenepchloranil', 'ttfca', 'since', 'the', 'bulk', 'photovoltaic', 'current', 'in', 'noncentrosymmetric', 'crystals', 'has', 'two', 'contributions', 'namely', 'the', 'ballistic', 'and', 'shift', 'we', 'explain', 'why', 'the', 'experimental', 'data', 'and', 'analysis', 'presented', 'by', 'the', 'authors', 'does', 'not', 'permit', 'unambiguous', 'identification', 'of', 'shift', 'current', 'and', 'is', 'not', 'consistent', 'with', 'the', 'mechanism', 'of', 'shift']] | [-0.132578881525044, 0.12873443229604634, -0.04651666880254784, -0.011157814171090122, -0.12978362158361462, -0.09996326201625409, 0.10317471939995285, 0.3779550700057899, -0.20262440382277652, -0.2900464933125242, 0.04083541664482665, -0.29456844958927364, -0.15600319385844014, 0.18680371626490547, -0.06968972418877867, 0.006752054537496259, -0.016010576376556267, -0.03518668132563753, -0.05741083626485159, -0.15541508762286074, 0.2604308014795665, 0.05225330731651235, 0.34385011863384035, 0.11728365463955749, 0.028769749774402307, -0.019451770293075713, -0.03622594924883977, 0.019723527561572772, -0.16623629844417015, 0.08131877048083791, 0.2582360529941657, 0.03024196345359087, 0.16130369820917445, -0.42883320612412307, -0.20263941839878116, 0.05780332670509515, 0.12078810740082015, 0.15925683490856882, -0.11220358185950786, -0.23881455674587238, 0.047032701692754225, -0.16260829862327345, -0.06674701994615456, -0.07752903975215891, 0.03709716160571383, -0.00308467285527337, -0.1935516197624947, 0.11467153072026709, 0.0989301974224227, 0.06537641665988392, -0.11400375755751625, -0.15687870793044567, -0.02234886182216747, 0.057182438386183594, 0.037739233650837936, 0.035971032846118176, 0.09272927232837726, -0.07138520778877841, -0.19666944636452582, 0.35156458940717483, -0.05192538771417833, -0.09795711976626227, 0.14031919242153246, -0.20779901453774544, -0.13466953295433232, 0.11893056920399109, 0.0505788357057158, 0.052551427698833114, -0.12496234304572065, 0.09700599534065282, -0.019932171855602535, 0.15976352373047942, 0.0439587933191609, 0.03927209393511857, 0.19203550993434845, 0.15752821466735295, -0.002197062987233362, 0.060501449440996495, -0.07064528528210376, -0.05240665904937252, -0.2732356819173982, -0.18519970218861295, -0.18093208714966633, 0.012198059889581805, 0.0480319030905394, -0.17326597537424776, 0.4314515144233742, 0.18041517801823154, 0.18037455343742734, -0.08090450517052124, 0.25581905204472283, 0.09288911022726566, 0.0903989722832076, 0.029873438397302263, 0.3371378764990837, 0.11559667928339613, 0.18435434450305277, -0.29503977317513236, 0.14234171221558486, 0.019538686310331666] |
1,802.05659 | Photo-excited states in correlated band insulators | We study the photo-excitation dynamics of correlated band insulators, using
non-equilibrium dynamical mean-field theory for the ionic Hubbard model. We
find two distinct behaviors, depending on the ratio of the on-site interaction
$U$ and the bare band gap $\Delta$. For small interactions, the relaxation is
characterized by intra-band carrier scattering in relatively rigid bands,
leading to a non-thermal intermediate state with separate thermal distributions
of electrons and holes. This behavior can be viewed as typical for a band
insulator with weak interactions. For larger interaction, on the other hand, we
observe a strong modification of the electronic spectrum and a filling-in of
the gap after photo-excitation, along with a rapid thermalization of the
system. The two behaviors therefore provide a dynamical distinction of a
correlated band insulator and a band-insulator, which can differ even when the
spectra of the two systems are similar in equilibrium. The crossover happens
when the interaction $U$ is comparable to $\Delta$.
| cond-mat.str-el | we study the photoexcitation dynamics of correlated band insulators using nonequilibrium dynamical meanfield theory for the ionic hubbard model we find two distinct behaviors depending on the ratio of the onsite interaction u and the bare band gap delta for small interactions the relaxation is characterized by intraband carrier scattering in relatively rigid bands leading to a nonthermal intermediate state with separate thermal distributions of electrons and holes this behavior can be viewed as typical for a band insulator with weak interactions for larger interaction on the other hand we observe a strong modification of the electronic spectrum and a fillingin of the gap after photoexcitation along with a rapid thermalization of the system the two behaviors therefore provide a dynamical distinction of a correlated band insulator and a bandinsulator which can differ even when the spectra of the two systems are similar in equilibrium the crossover happens when the interaction u is comparable to delta | [['we', 'study', 'the', 'photoexcitation', 'dynamics', 'of', 'correlated', 'band', 'insulators', 'using', 'nonequilibrium', 'dynamical', 'meanfield', 'theory', 'for', 'the', 'ionic', 'hubbard', 'model', 'we', 'find', 'two', 'distinct', 'behaviors', 'depending', 'on', 'the', 'ratio', 'of', 'the', 'onsite', 'interaction', 'u', 'and', 'the', 'bare', 'band', 'gap', 'delta', 'for', 'small', 'interactions', 'the', 'relaxation', 'is', 'characterized', 'by', 'intraband', 'carrier', 'scattering', 'in', 'relatively', 'rigid', 'bands', 'leading', 'to', 'a', 'nonthermal', 'intermediate', 'state', 'with', 'separate', 'thermal', 'distributions', 'of', 'electrons', 'and', 'holes', 'this', 'behavior', 'can', 'be', 'viewed', 'as', 'typical', 'for', 'a', 'band', 'insulator', 'with', 'weak', 'interactions', 'for', 'larger', 'interaction', 'on', 'the', 'other', 'hand', 'we', 'observe', 'a', 'strong', 'modification', 'of', 'the', 'electronic', 'spectrum', 'and', 'a', 'fillingin', 'of', 'the', 'gap', 'after', 'photoexcitation', 'along', 'with', 'a', 'rapid', 'thermalization', 'of', 'the', 'system', 'the', 'two', 'behaviors', 'therefore', 'provide', 'a', 'dynamical', 'distinction', 'of', 'a', 'correlated', 'band', 'insulator', 'and', 'a', 'bandinsulator', 'which', 'can', 'differ', 'even', 'when', 'the', 'spectra', 'of', 'the', 'two', 'systems', 'are', 'similar', 'in', 'equilibrium', 'the', 'crossover', 'happens', 'when', 'the', 'interaction', 'u', 'is', 'comparable', 'to', 'delta']] | [-0.17997269035699084, 0.2064580401272859, -0.08287153915779737, 0.0998212510804968, 0.00922411136353054, -0.1901481016016661, 0.06837061638212524, 0.38275723738404804, -0.28977470741105765, -0.28971560214025277, 0.02072010627046275, -0.3303817248998735, -0.10373287182301283, 0.1361743449099147, 0.07128611441033009, -0.040191379229490384, 0.022698225226635352, -0.04111863890918754, -0.1202441448903977, -0.13866656332408103, 0.33959626354193556, -0.0167092897851641, 0.24266725368141076, 0.10386565856587811, 0.000509738844508926, 0.028565591677294996, 0.10451231718373795, 0.04211779978000917, -0.10697062945930669, 0.05753761694097939, 0.21240086900182248, -0.0781681122413526, 0.2375269273015408, -0.4277856104935591, -0.22236794711930905, 0.03563343353557567, 0.14083662692111176, 0.12184088618587105, -0.034393221918248736, -0.27516376698398604, 0.006772938506821027, -0.18825933879289108, -0.09842565258403714, -0.045637599405241557, 0.029971503034735527, 0.024574525579690743, -0.2666832113299722, 0.12212762785836673, 0.04235423453120837, 0.04715277201448304, -0.09087302527339676, -0.09675858563143545, -0.06543644192891243, 0.1180687049088122, 0.0579137781908055, 0.014643669719449602, 0.1371473528456707, -0.15457258276411523, -0.07073942742023903, 0.4030048269300889, -0.10512376962026629, -0.10516311095740932, 0.2507110763496409, -0.1785865833487314, -0.0771972929718546, 0.1802824456578655, 0.10765666864478053, 0.08853114252418984, -0.12916207500492397, 0.06980753557171482, -0.001415308923102342, 0.18262536270478263, -0.015780800490831144, 0.09944276198840295, 0.23443037528210345, 0.18965293993898788, 0.054110724944621325, 0.12585829606075258, -0.09626122205279386, -0.08082869057006274, -0.23769714407479534, -0.10688275143575783, -0.21368487689267987, 0.06877255668111432, -0.07082867034888551, -0.1929558931837957, 0.4424007265225578, 0.11469713617444564, 0.2085714477042739, 0.007197385103865646, 0.21335182092514934, 0.16092524808930017, 0.015832386691517267, 0.03794969015647299, 0.28336703268070823, 0.10242002767149526, 0.0802981721667143, -0.2899532372278209, 0.052053451515698373, 0.016722307885244776] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.