id
float64 706
1.8k
| title
stringlengths 1
343
| abstract
stringlengths 6
6.09k
| categories
stringlengths 5
125
| processed_abstract
stringlengths 2
5.96k
| tokenized_abstract
stringlengths 8
8.74k
| centroid
stringlengths 2.1k
2.17k
|
|---|---|---|---|---|---|---|
1,803.08567
|
Property FW, differentiable structures, and smoothability of singular
actions
|
We provide a smoothening criterion for group actions on manifolds by singular
diffeomorphisms. We prove that if a countable group $\Gamma$ has the fixed
point property FW for walls (e.g. if it has property (T)), every aperiodic
action of $\Gamma$ by diffeomorphisms that are of class $C^r$ with countably
many singularities is conjugate to an action by true diffeomorphisms of class
$C^r$ on a homeomorphic (possibly non-diffeomorphic) manifold. As applications,
we show that Navas's result for actions of Kazhdan groups on the circle, as
well as the recent solutions to Zimmer's conjecture, generalise to aperiodic
actions by diffeomorphisms with countably many singularities.
|
math.DS math.GR math.GT
|
we provide a smoothening criterion for group actions on manifolds by singular diffeomorphisms we prove that if a countable group gamma has the fixed point property fw for walls eg if it has property t every aperiodic action of gamma by diffeomorphisms that are of class cr with countably many singularities is conjugate to an action by true diffeomorphisms of class cr on a homeomorphic possibly nondiffeomorphic manifold as applications we show that navass result for actions of kazhdan groups on the circle as well as the recent solutions to zimmers conjecture generalise to aperiodic actions by diffeomorphisms with countably many singularities
|
[['we', 'provide', 'a', 'smoothening', 'criterion', 'for', 'group', 'actions', 'on', 'manifolds', 'by', 'singular', 'diffeomorphisms', 'we', 'prove', 'that', 'if', 'a', 'countable', 'group', 'gamma', 'has', 'the', 'fixed', 'point', 'property', 'fw', 'for', 'walls', 'eg', 'if', 'it', 'has', 'property', 't', 'every', 'aperiodic', 'action', 'of', 'gamma', 'by', 'diffeomorphisms', 'that', 'are', 'of', 'class', 'cr', 'with', 'countably', 'many', 'singularities', 'is', 'conjugate', 'to', 'an', 'action', 'by', 'true', 'diffeomorphisms', 'of', 'class', 'cr', 'on', 'a', 'homeomorphic', 'possibly', 'nondiffeomorphic', 'manifold', 'as', 'applications', 'we', 'show', 'that', 'navass', 'result', 'for', 'actions', 'of', 'kazhdan', 'groups', 'on', 'the', 'circle', 'as', 'well', 'as', 'the', 'recent', 'solutions', 'to', 'zimmers', 'conjecture', 'generalise', 'to', 'aperiodic', 'actions', 'by', 'diffeomorphisms', 'with', 'countably', 'many', 'singularities']]
|
[-0.17628061972410963, 0.1409797414523229, -0.08985764295379124, 0.0507386765537304, -0.10484293067486643, -0.15486659580325285, 0.022161710583189928, 0.4099580142093767, -0.2911371158085542, -0.1869588386968221, 0.14296206162486336, -0.31783479020359123, -0.1608126445553533, 0.22376779171391528, -0.16708048836023795, 0.015117510240340587, 0.07766278360112763, 0.11416792036708454, -0.05573589517273894, -0.2464442075147192, 0.42726048738649575, -0.062195424276339534, 0.18975363627518757, 0.05823525494554698, 0.14751564638479095, 0.004365105094332801, 0.031224186829577137, 0.03821803794915576, -0.10732647206622468, 0.05017213749302791, 0.2695034199606369, 0.08078187383425486, 0.24620790005025298, -0.3277795147551293, -0.27929029359694313, 0.19060545053683442, 0.10755584896861986, -0.02295366047920733, -0.0576032052418254, -0.3369105241196875, 0.15348050713373146, -0.13289079244598967, -0.18657558995050075, -0.13093187458960726, 0.09092119111596506, 0.008649164626356398, -0.19712039691829444, -0.023454523354879405, 0.18458792199449853, 0.10889761228261903, -0.07430736852883554, -0.00807961142428293, -0.07946929564505889, 0.10854843208372666, 0.0978082090842141, 0.06545240934569352, 0.11826353119905245, -0.014792539511281665, -0.16319908909868486, 0.4028570781033117, -0.08797050077966091, -0.27945709518055517, 0.20273864176124334, -0.1531361382648275, -0.26530201077382864, 0.1580674620345235, 0.09265576038362071, 0.15282468980703834, -0.05745265579385923, 0.2313994212112952, -0.12409218361988517, 0.056633389989746326, 0.08603621989437886, -0.0008717053846483773, 0.1321234773051473, 0.056285552113399945, 0.209858378352791, 0.08278434298526828, 0.058566877800547104, 0.01128824993433191, -0.329577498211719, -0.14528534850935534, -0.1400720111191236, 0.18494851431707934, -0.09458313726054707, -0.21339723316947976, 0.33096507838973316, 0.033814219213874626, 0.18914970377515447, 0.1359369111060635, 0.18219176378322416, 0.03485420465787485, 0.052794783177905445, 0.10465560842877125, 0.08774650858549199, 0.15688789010711826, -0.08769438576211433, -0.11290938161442628, -0.009279051812891249, 0.23895099762790273]
|
1,803.08568
|
Securing the Control-plane Channel and Cache of Pull-based ID/LOC
Protocols
|
Pull-based ID/LOC split protocols, such as LISP (RFC6830), retrieve mappings
from a mapping system to encapsulate and forward packets. This is done by means
of a control-plane channel. In this short paper we describe three attacks
against this channel (Denial-of-Service and overflowing) as well as the against
the local cache used to store such mappings. We also provide a solution against
such attacks that implements a per-source rate-limiter using a Count-Min Sketch
data-structure.
|
cs.NI
|
pullbased idloc split protocols such as lisp rfc6830 retrieve mappings from a mapping system to encapsulate and forward packets this is done by means of a controlplane channel in this short paper we describe three attacks against this channel denialofservice and overflowing as well as the against the local cache used to store such mappings we also provide a solution against such attacks that implements a persource ratelimiter using a countmin sketch datastructure
|
[['pullbased', 'idloc', 'split', 'protocols', 'such', 'as', 'lisp', 'rfc6830', 'retrieve', 'mappings', 'from', 'a', 'mapping', 'system', 'to', 'encapsulate', 'and', 'forward', 'packets', 'this', 'is', 'done', 'by', 'means', 'of', 'a', 'controlplane', 'channel', 'in', 'this', 'short', 'paper', 'we', 'describe', 'three', 'attacks', 'against', 'this', 'channel', 'denialofservice', 'and', 'overflowing', 'as', 'well', 'as', 'the', 'against', 'the', 'local', 'cache', 'used', 'to', 'store', 'such', 'mappings', 'we', 'also', 'provide', 'a', 'solution', 'against', 'such', 'attacks', 'that', 'implements', 'a', 'persource', 'ratelimiter', 'using', 'a', 'countmin', 'sketch', 'datastructure']]
|
[-0.1594912727666098, -0.02255553019442258, -0.09124154775012014, 0.10222609683641813, -0.05112183292436859, -0.23519558750389927, 0.12734860226518704, 0.35215016642072494, -0.32086585127357126, -0.2454993164949659, 0.1758386227015433, -0.28591863268419454, -0.17949833167527895, 0.18516266532242298, -0.12424792105709945, 0.1030673991240885, 0.013342197608690713, -0.01188803603155606, -0.004175066181957937, -0.21750252464435238, 0.32889723073205224, 0.05384078362376254, 0.24795955608504405, 0.02531928434104159, 0.09914863700775997, 0.042591477774650506, -0.027276481953921957, -0.0007221716577592103, -0.07274477527718536, 0.03722714458632728, 0.3082595896684443, 0.23127488235848537, 0.2555537651414457, -0.4460420804233223, -0.18145476863382087, 0.03866964508441911, 0.14361766926890265, 0.18439924735170993, -0.07429230368723148, -0.31326478668421076, 0.15180158539526706, -0.27581993906178337, -0.05966508861266724, -0.1093017435160236, -0.023735700468735202, 0.06967088127967672, -0.26234154371828167, -0.06611141697815755, 0.06469811395357322, 0.03056954041771267, -0.007653019512477128, -0.024556713831691963, 0.026256168345529317, 0.16093608064145065, 0.020572553225118074, 0.0569617851515827, 0.15610791742126795, -0.04288865369744599, -0.12362202505945512, 0.39922548013914755, -0.06502781552937476, -0.2186929492070677, 0.17482482513203623, 0.04799526991943518, -0.12157463022521224, 0.045525103955921055, 0.20543758158126604, 0.12889018810718603, -0.1570136036750847, -0.0030827207399694166, -0.04713789242711188, 0.192435423592173, 0.07660530631403452, 0.08185579331483746, 0.14560053991896194, 0.17863344511800056, 0.10034459304280471, 0.2200827599854033, -0.073075822500539, -0.04919562950406386, -0.2768921451508135, -0.16426686067943988, -0.1592388271684826, 0.029114216012691242, -0.002628278086363486, -0.162316879854821, 0.4012304437549218, 0.19405811852303104, 0.21478579034083994, 0.08229393073006709, 0.39940472426351864, 0.013698614332352536, 0.09820339569579, 0.1674259113809229, 0.12863469145436218, 0.05232563261212646, 0.12463789109049526, -0.10979233295116844, 0.13212653217783224, 0.046593022289807384]
|
1,803.08569
|
Modeling Aurora Type Phenomena by Short Wave-Long Wave Interactions in
Multi-Dimensional Large MHD Flows
|
We establish the convergence of an approximation scheme to a model for aurora
type phenomena. The latter, mathematically, means a system describing the short
wave-long wave (SW-LW) interactions for compressible magnetohydrodynamic (MHD)
flows, introduced in a previous work, which presents short waves, governed by a
nonlinear Schr\"odinger (NLS) equation based on the Lagrangian coordinates of
the fluid, and long waves, governed by the compressible MHD system. The NLS
equation and the compressible MHD system are also explicitly coupled by an
interaction potential in the NLS equation and an interaction surface force in
the momentum equation of the MHD system, both multiplied by a small
coefficient. Since the compressible MHD flow is assumed to have large amplitude
data, possibly forming vacuum, the coefficient of the interaction terms may be
taken as zero, due to the large difference in scale between the two types of
waves. In this case, the whole coupling lies in the Lagrangian coordinates of
the compressible MHD fluid upon which the NLS equation is formulated. However,
due to the possible occurrence of vacuum, these Lagrangian coordinates are not
well defined, and herein lies the importance of the approximation scheme. The
latter consists of a system that formally approximates the SW-LW interaction
system, including non-zero vanishing interaction coefficients, together with an
artificial viscosity in the continuity equation, an artificial energy balance
term, an artificial pressure in the momentum equation and approximate
Lagrangian coordinates, which circumvent the possible occurrence of vacuum. We
prove the convergence of the solutions of the approximation scheme to a
solution of a system consisting of a NLS equation based on the coordinate
system induced by the scheme, and a compressible MHD system.
|
math.AP
|
we establish the convergence of an approximation scheme to a model for aurora type phenomena the latter mathematically means a system describing the short wavelong wave swlw interactions for compressible magnetohydrodynamic mhd flows introduced in a previous work which presents short waves governed by a nonlinear schrodinger nls equation based on the lagrangian coordinates of the fluid and long waves governed by the compressible mhd system the nls equation and the compressible mhd system are also explicitly coupled by an interaction potential in the nls equation and an interaction surface force in the momentum equation of the mhd system both multiplied by a small coefficient since the compressible mhd flow is assumed to have large amplitude data possibly forming vacuum the coefficient of the interaction terms may be taken as zero due to the large difference in scale between the two types of waves in this case the whole coupling lies in the lagrangian coordinates of the compressible mhd fluid upon which the nls equation is formulated however due to the possible occurrence of vacuum these lagrangian coordinates are not well defined and herein lies the importance of the approximation scheme the latter consists of a system that formally approximates the swlw interaction system including nonzero vanishing interaction coefficients together with an artificial viscosity in the continuity equation an artificial energy balance term an artificial pressure in the momentum equation and approximate lagrangian coordinates which circumvent the possible occurrence of vacuum we prove the convergence of the solutions of the approximation scheme to a solution of a system consisting of a nls equation based on the coordinate system induced by the scheme and a compressible mhd system
|
[['we', 'establish', 'the', 'convergence', 'of', 'an', 'approximation', 'scheme', 'to', 'a', 'model', 'for', 'aurora', 'type', 'phenomena', 'the', 'latter', 'mathematically', 'means', 'a', 'system', 'describing', 'the', 'short', 'wavelong', 'wave', 'swlw', 'interactions', 'for', 'compressible', 'magnetohydrodynamic', 'mhd', 'flows', 'introduced', 'in', 'a', 'previous', 'work', 'which', 'presents', 'short', 'waves', 'governed', 'by', 'a', 'nonlinear', 'schrodinger', 'nls', 'equation', 'based', 'on', 'the', 'lagrangian', 'coordinates', 'of', 'the', 'fluid', 'and', 'long', 'waves', 'governed', 'by', 'the', 'compressible', 'mhd', 'system', 'the', 'nls', 'equation', 'and', 'the', 'compressible', 'mhd', 'system', 'are', 'also', 'explicitly', 'coupled', 'by', 'an', 'interaction', 'potential', 'in', 'the', 'nls', 'equation', 'and', 'an', 'interaction', 'surface', 'force', 'in', 'the', 'momentum', 'equation', 'of', 'the', 'mhd', 'system', 'both', 'multiplied', 'by', 'a', 'small', 'coefficient', 'since', 'the', 'compressible', 'mhd', 'flow', 'is', 'assumed', 'to', 'have', 'large', 'amplitude', 'data', 'possibly', 'forming', 'vacuum', 'the', 'coefficient', 'of', 'the', 'interaction', 'terms', 'may', 'be', 'taken', 'as', 'zero', 'due', 'to', 'the', 'large', 'difference', 'in', 'scale', 'between', 'the', 'two', 'types', 'of', 'waves', 'in', 'this', 'case', 'the', 'whole', 'coupling', 'lies', 'in', 'the', 'lagrangian', 'coordinates', 'of', 'the', 'compressible', 'mhd', 'fluid', 'upon', 'which', 'the', 'nls', 'equation', 'is', 'formulated', 'however', 'due', 'to', 'the', 'possible', 'occurrence', 'of', 'vacuum', 'these', 'lagrangian', 'coordinates', 'are', 'not', 'well', 'defined', 'and', 'herein', 'lies', 'the', 'importance', 'of', 'the', 'approximation', 'scheme', 'the', 'latter', 'consists', 'of', 'a', 'system', 'that', 'formally', 'approximates', 'the', 'swlw', 'interaction', 'system', 'including', 'nonzero', 'vanishing', 'interaction', 'coefficients', 'together', 'with', 'an', 'artificial', 'viscosity', 'in', 'the', 'continuity', 'equation', 'an', 'artificial', 'energy', 'balance', 'term', 'an', 'artificial', 'pressure', 'in', 'the', 'momentum', 'equation', 'and', 'approximate', 'lagrangian', 'coordinates', 'which', 'circumvent', 'the', 'possible', 'occurrence', 'of', 'vacuum', 'we', 'prove', 'the', 'convergence', 'of', 'the', 'solutions', 'of', 'the', 'approximation', 'scheme', 'to', 'a', 'solution', 'of', 'a', 'system', 'consisting', 'of', 'a', 'nls', 'equation', 'based', 'on', 'the', 'coordinate', 'system', 'induced', 'by', 'the', 'scheme', 'and', 'a', 'compressible', 'mhd', 'system']]
|
[-0.2229635281437895, 0.09803690952938506, -0.06707994499015184, 0.039653258741937876, -0.05185029888525605, -0.10751106545069268, -0.04043937639832713, 0.2395595809330057, -0.2996276787775771, -0.26633464057079476, 0.08479087223869114, -0.25880465508047223, -0.12795337826431985, 0.16101467159709157, 0.023052712625729433, 0.08896779679597112, 0.04916427721795828, -0.01160816953304912, -0.04837883662295771, -0.19027986723939766, 0.35434729057411407, 0.048382879886101335, 0.25143472890477575, 0.008816620554316087, 0.15721055763593092, -0.03521620243259679, 0.007775367380194096, 0.02338862338639455, -0.12442839269596848, 0.03868769203520218, 0.18055918269416998, 0.01926568485509631, 0.2698538135011694, -0.4645594331921767, -0.2487833993037002, 0.03832744431607695, 0.15251751820492707, 0.13841458356414543, -0.013532811774116388, -0.29272209289753676, 0.005786535829521607, -0.1661767168375461, -0.18578920463788445, -0.04904623686140268, 0.019112938529123432, 0.06634612690317411, -0.2773164831847627, 0.12388710087142882, 0.0932464212203648, 0.022181938801056105, -0.1522034638767144, -0.04067875794303752, -0.03132692418327771, 0.05253731278513653, 0.06895642194928993, 0.04218067969381134, 0.041979852046031316, -0.17505711339417493, -0.0371647078910441, 0.43340195966142137, -0.09263710344152903, -0.29749452027591766, 0.18372152489778734, -0.10492507654134238, -0.03481668235558639, 0.17143263658373684, 0.19039742657206143, 0.12038709437710814, -0.15579307001367534, 0.10882285043497678, -0.04505661088694688, 0.15719101569730032, 0.05261257726469658, -0.024997922097732637, 0.16909662515019486, 0.15565060537672884, 0.050900302895688976, 0.08976533197067287, -0.0513262441466171, -0.14482617878525492, -0.3305022083695276, -0.14510758862277304, -0.1911559490473482, 0.061534454539271435, -0.08843164745327237, -0.19248670792001285, 0.3814003106821527, 0.13678590094112197, 0.14634329704500304, -0.0023186148534043004, 0.30007614247058856, 0.19279013863094893, 0.011572588392047455, 0.10005211037502665, 0.27972826422057184, 0.16992028971013706, 0.15197135059692748, -0.27514705419594393, 0.022570867025617346, 0.1632000272401838]
|
1,803.0857
|
Neutrino oscillations and Lorentz Invariance Violation in a Finslerian
Geometrical model
|
Neutrino oscillations are one of the first evidences of physics beyond the
Standard Model (SM). Since Lorentz Invariance is a fundamental symmetry of the
SM, recently also neutrino physics has been explored to verify the eventual
modification of this symmetry and its potential magnitude. In this work we
study the consequences of the introduction of Lorentz Invariance Violation
(LIV) in the high energy neutrinos propagation and evaluate the impact of this
eventual violation on the oscillation predictions. An effective theory
explaining these physical effects is introduced via Modified Dispersion
Relations. This approach, originally introduced by Coleman and Glashow,
corresponds in our model to a modification of the special relativity geometry.
Moreover, the generalization of this perspective leads to the introduction of a
maximum attainable velocity which is specific of the particle. This can be
formalized in Finsler geometry, a more general theory of space-time. In the
present paper the impact of this kind of LIV on neutrino phenomenology is
studied, in particular by analyzing the corrections introduced in neutrino
oscillation probabilities for different values of neutrino energies and
baselines of experimental interest. The possibility of further improving the
present constraints on CPT-even LIV coefficients by means of our analysis is
also discussed.
|
hep-ph
|
neutrino oscillations are one of the first evidences of physics beyond the standard model sm since lorentz invariance is a fundamental symmetry of the sm recently also neutrino physics has been explored to verify the eventual modification of this symmetry and its potential magnitude in this work we study the consequences of the introduction of lorentz invariance violation liv in the high energy neutrinos propagation and evaluate the impact of this eventual violation on the oscillation predictions an effective theory explaining these physical effects is introduced via modified dispersion relations this approach originally introduced by coleman and glashow corresponds in our model to a modification of the special relativity geometry moreover the generalization of this perspective leads to the introduction of a maximum attainable velocity which is specific of the particle this can be formalized in finsler geometry a more general theory of spacetime in the present paper the impact of this kind of liv on neutrino phenomenology is studied in particular by analyzing the corrections introduced in neutrino oscillation probabilities for different values of neutrino energies and baselines of experimental interest the possibility of further improving the present constraints on cpteven liv coefficients by means of our analysis is also discussed
|
[['neutrino', 'oscillations', 'are', 'one', 'of', 'the', 'first', 'evidences', 'of', 'physics', 'beyond', 'the', 'standard', 'model', 'sm', 'since', 'lorentz', 'invariance', 'is', 'a', 'fundamental', 'symmetry', 'of', 'the', 'sm', 'recently', 'also', 'neutrino', 'physics', 'has', 'been', 'explored', 'to', 'verify', 'the', 'eventual', 'modification', 'of', 'this', 'symmetry', 'and', 'its', 'potential', 'magnitude', 'in', 'this', 'work', 'we', 'study', 'the', 'consequences', 'of', 'the', 'introduction', 'of', 'lorentz', 'invariance', 'violation', 'liv', 'in', 'the', 'high', 'energy', 'neutrinos', 'propagation', 'and', 'evaluate', 'the', 'impact', 'of', 'this', 'eventual', 'violation', 'on', 'the', 'oscillation', 'predictions', 'an', 'effective', 'theory', 'explaining', 'these', 'physical', 'effects', 'is', 'introduced', 'via', 'modified', 'dispersion', 'relations', 'this', 'approach', 'originally', 'introduced', 'by', 'coleman', 'and', 'glashow', 'corresponds', 'in', 'our', 'model', 'to', 'a', 'modification', 'of', 'the', 'special', 'relativity', 'geometry', 'moreover', 'the', 'generalization', 'of', 'this', 'perspective', 'leads', 'to', 'the', 'introduction', 'of', 'a', 'maximum', 'attainable', 'velocity', 'which', 'is', 'specific', 'of', 'the', 'particle', 'this', 'can', 'be', 'formalized', 'in', 'finsler', 'geometry', 'a', 'more', 'general', 'theory', 'of', 'spacetime', 'in', 'the', 'present', 'paper', 'the', 'impact', 'of', 'this', 'kind', 'of', 'liv', 'on', 'neutrino', 'phenomenology', 'is', 'studied', 'in', 'particular', 'by', 'analyzing', 'the', 'corrections', 'introduced', 'in', 'neutrino', 'oscillation', 'probabilities', 'for', 'different', 'values', 'of', 'neutrino', 'energies', 'and', 'baselines', 'of', 'experimental', 'interest', 'the', 'possibility', 'of', 'further', 'improving', 'the', 'present', 'constraints', 'on', 'cpteven', 'liv', 'coefficients', 'by', 'means', 'of', 'our', 'analysis', 'is', 'also', 'discussed']]
|
[-0.09999440256105667, 0.16619985569840456, -0.07856142839721154, 0.1367200287001318, -0.10743987453769487, -0.09752888556357732, 0.03425725346366589, 0.2642974366438529, -0.23194182332199398, -0.3201197061116005, 0.04087025793626591, -0.2298965639224977, -0.1476901447594092, 0.17559982472074007, -0.032443515075794835, 0.04776500685218005, 0.0014775728202876773, 0.02213122955256022, -0.11053379307187504, -0.23990925377474562, 0.3134820628888204, 0.14707065835170965, 0.2805526864145523, 0.10596351860791887, 0.08512007921362424, -0.009557863887593077, -0.0642596556629875, 0.005341601700955393, -0.1309543607779116, 0.12567005952183932, 0.16209953372588032, 0.1073310714558523, 0.2118603001800504, -0.39626214889772604, -0.24638784125373506, 0.10684916216391369, 0.09734433321547371, 0.13050436515690722, -0.0785268630761403, -0.3170330369531518, 0.031208696617804798, -0.20202490370167364, -0.1563441401121603, -0.05287944430273284, -0.0033347741746813943, -0.04662090982195211, -0.2334169596756375, 0.08516376594782894, 0.04814175815358389, 0.05099460336249748, -0.020027858792691224, -0.08961211988301303, 0.03227967428882597, 0.04766086275265137, 0.1579283303808822, -0.02798315816291488, 0.08363238367307378, -0.13421249529314405, -0.1424545668674135, 0.4482497760454322, -0.064317251332012, -0.19143946540869292, 0.12430273767763583, -0.1655065710015196, -0.16815621755647792, 0.07650607324143097, 0.18073644473374184, 0.08020981184972248, -0.17908354761254153, 0.15784757533963623, -0.0576753959020526, 0.10909623612354666, 0.08194961110913739, 0.04534671098681969, 0.20677232786570446, 0.19699645073425098, 0.03754920477397961, 0.07361729644955883, -0.0754410179371088, -0.06331194109412482, -0.3897016577348851, -0.13967587662362815, -0.13282076143751861, 0.05849126215487036, -0.0751917895386664, -0.09167692399270243, 0.45261609751159454, 0.17697018120873842, 0.16095387958460441, -0.0016190069352995864, 0.2722748481417259, 0.12432294109453548, 0.06302813215510883, -0.0052973273320303365, 0.34686496597484195, 0.15544936660156208, 0.09752353432468407, -0.26050903459856434, 0.051400735647542085, 0.09369348846998361]
|
1,803.08571
|
The Non-Abelian Gauge Field Propagator in a Plane Wave Background Field
|
Employing methods introduced by Schwinger in quantum electrodynamics, we
compute the propagator for a non-Abelian gauge field in a plane wave background
field. In the long distance limit a mass-like term for the gauge field is
induced by this interaction.
|
hep-th
|
employing methods introduced by schwinger in quantum electrodynamics we compute the propagator for a nonabelian gauge field in a plane wave background field in the long distance limit a masslike term for the gauge field is induced by this interaction
|
[['employing', 'methods', 'introduced', 'by', 'schwinger', 'in', 'quantum', 'electrodynamics', 'we', 'compute', 'the', 'propagator', 'for', 'a', 'nonabelian', 'gauge', 'field', 'in', 'a', 'plane', 'wave', 'background', 'field', 'in', 'the', 'long', 'distance', 'limit', 'a', 'masslike', 'term', 'for', 'the', 'gauge', 'field', 'is', 'induced', 'by', 'this', 'interaction']]
|
[-0.22271722801961005, 0.23439912900794296, -0.08648839420638979, 0.1316038943361491, -0.07248940446879715, -0.05649952410021797, -0.006831551954383031, 0.3470592012628913, -0.1711680106818676, -0.2341764173936099, 0.006476586093776859, -0.2071047923527658, -0.14901770688593388, 0.13611964909359814, 0.019878833426628262, 0.011496975272893905, -0.03373974416172132, 0.07951529973652213, -0.05180305117974058, -0.21835027413908392, 0.3385345154674724, 0.025224669961608014, 0.2525939780054614, 0.03828261513262987, 0.14765962648671122, 0.11385335485683754, 0.0074069610796868805, 0.07432227525860072, -0.09964059003104922, 0.03949962288606912, 0.16809489394217964, -0.006399473268538713, 0.2068979324772954, -0.3903235243167728, -0.2790869139134884, 0.04275359846651554, 0.13140884544700385, 0.20275836209766568, -0.08427844480611384, -0.3544493021443486, -0.010871703713200986, -0.18795024175196887, -0.15362675956566818, -0.05732804487342946, 0.02903206278278958, -0.06768210199661553, -0.2916840623132885, 0.06625131880573462, -0.005170986941084266, 0.07443878536578268, 0.0019047270063310862, -0.011513942992314697, 0.05501880347728729, 0.04806074312655255, 0.11387671480770223, 0.19353371830657123, 0.08722752937992481, -0.27309111796203067, -0.16417580202687532, 0.3955703696236014, -0.196530341450125, -0.2580751133151352, 0.08199799945577979, -0.10817054770886898, -0.07953453523514327, 0.13194965707079973, 0.12739544380456208, 0.1185343952383846, -0.20624315924942493, 0.2655663891462609, 0.029387257155394763, 0.09340590764768422, 0.1013148923870176, 0.02799773821607232, 0.23613599850796163, 0.08254235135391355, 0.027786381682381033, 0.14509705612435936, -0.044803992728702724, -0.12271018973551691, -0.36804038207046685, -0.16460324316285552, -0.213204406449222, 0.10145195890327159, -0.08498460902483203, -0.18723925964441152, 0.40415058459620923, 0.18031788184307515, 0.11151712713763118, -0.0002991645014844835, 0.25737876969506035, 0.19383711637929082, 0.12261552046984434, 0.06320620615733788, 0.2926737163681537, 0.2401498272200115, 0.0795644321013242, -0.2676813714322634, -0.15877010005060582, 0.19786387339700012]
|
1,803.08572
|
Commensurating actions for groups of piecewise continuous
transformations
|
We use partial actions, as formalized by Exel, to construct various
commensurating actions. We use this in the context of groups piecewise
preserving a geometric structure, and we interpret the transfixing property of
these commensurating actions as the existence of a model for which the group
acts preserving the geometric structure. We apply this to many groups with
piecewise properties in dimension 1, notably piecewise of class C^k, piecewise
affine, piecewise projective (possibly discontinuous).
We derive various conjugacy results for subgroups with Property FW, or
distorted cyclic subgroups, or more generally in the presence of rigidity
properties for commensurating actions. For instance we obtain, under suitable
assumptions, the conjugacy of a given piecewise affine action to an affine
action on possibly another model. By the same method, we obtain a similar
result in the projective case. An illustrating corollary is the fact that the
group of piecewise projective self-transformations of the circle has no
infinite subgroup with Kazhdan's Property T; this corollary is new even in the
piecewise affine case.
In addition, we use this to provide of the classification of circle subgroups
of piecewise projective homeomorphisms of the projective line. The piecewise
affine case is a classical result of Minakawa.
|
math.DS math.GR math.GT
|
we use partial actions as formalized by exel to construct various commensurating actions we use this in the context of groups piecewise preserving a geometric structure and we interpret the transfixing property of these commensurating actions as the existence of a model for which the group acts preserving the geometric structure we apply this to many groups with piecewise properties in dimension 1 notably piecewise of class ck piecewise affine piecewise projective possibly discontinuous we derive various conjugacy results for subgroups with property fw or distorted cyclic subgroups or more generally in the presence of rigidity properties for commensurating actions for instance we obtain under suitable assumptions the conjugacy of a given piecewise affine action to an affine action on possibly another model by the same method we obtain a similar result in the projective case an illustrating corollary is the fact that the group of piecewise projective selftransformations of the circle has no infinite subgroup with kazhdans property t this corollary is new even in the piecewise affine case in addition we use this to provide of the classification of circle subgroups of piecewise projective homeomorphisms of the projective line the piecewise affine case is a classical result of minakawa
|
[['we', 'use', 'partial', 'actions', 'as', 'formalized', 'by', 'exel', 'to', 'construct', 'various', 'commensurating', 'actions', 'we', 'use', 'this', 'in', 'the', 'context', 'of', 'groups', 'piecewise', 'preserving', 'a', 'geometric', 'structure', 'and', 'we', 'interpret', 'the', 'transfixing', 'property', 'of', 'these', 'commensurating', 'actions', 'as', 'the', 'existence', 'of', 'a', 'model', 'for', 'which', 'the', 'group', 'acts', 'preserving', 'the', 'geometric', 'structure', 'we', 'apply', 'this', 'to', 'many', 'groups', 'with', 'piecewise', 'properties', 'in', 'dimension', '1', 'notably', 'piecewise', 'of', 'class', 'ck', 'piecewise', 'affine', 'piecewise', 'projective', 'possibly', 'discontinuous', 'we', 'derive', 'various', 'conjugacy', 'results', 'for', 'subgroups', 'with', 'property', 'fw', 'or', 'distorted', 'cyclic', 'subgroups', 'or', 'more', 'generally', 'in', 'the', 'presence', 'of', 'rigidity', 'properties', 'for', 'commensurating', 'actions', 'for', 'instance', 'we', 'obtain', 'under', 'suitable', 'assumptions', 'the', 'conjugacy', 'of', 'a', 'given', 'piecewise', 'affine', 'action', 'to', 'an', 'affine', 'action', 'on', 'possibly', 'another', 'model', 'by', 'the', 'same', 'method', 'we', 'obtain', 'a', 'similar', 'result', 'in', 'the', 'projective', 'case', 'an', 'illustrating', 'corollary', 'is', 'the', 'fact', 'that', 'the', 'group', 'of', 'piecewise', 'projective', 'selftransformations', 'of', 'the', 'circle', 'has', 'no', 'infinite', 'subgroup', 'with', 'kazhdans', 'property', 't', 'this', 'corollary', 'is', 'new', 'even', 'in', 'the', 'piecewise', 'affine', 'case', 'in', 'addition', 'we', 'use', 'this', 'to', 'provide', 'of', 'the', 'classification', 'of', 'circle', 'subgroups', 'of', 'piecewise', 'projective', 'homeomorphisms', 'of', 'the', 'projective', 'line', 'the', 'piecewise', 'affine', 'case', 'is', 'a', 'classical', 'result', 'of', 'minakawa']]
|
[-0.14146895875426563, 0.05159460673773844, -0.06797343999353336, 0.02804522491212298, -0.10284699973575397, -0.12626532017108258, 0.02753065621957707, 0.4159166934670665, -0.35748114447979884, -0.19262051122057153, 0.14040670694897991, -0.20934186288244536, -0.16594663728496536, 0.21636244130377008, -0.16373314291482147, 0.036022143006142246, -0.002818110292477898, 0.0951119761800817, -0.12853319788627776, -0.26552421473968196, 0.3792062308381887, -0.04642839307414751, 0.21411712785443318, 0.01197749192109238, 0.1321533166536659, 0.025679718674951463, -0.021737625794344812, 0.019542389525914913, -0.11337950694318141, 0.11475858845322126, 0.2618387499730566, 0.076804044107139, 0.2310163197014013, -0.3511600706389352, -0.22003924546660342, 0.209820279547355, 0.08909352554532526, 0.0649546116289809, -0.06757552891797983, -0.290202827921755, 0.06650833734521765, -0.15849137158675972, -0.184688409177315, -0.07649961290834238, 0.013676305399767717, 0.004267045865935184, -0.23693577939440874, 0.023425080464806538, 0.1339692319673135, 0.12914615273873448, -0.09298071135116283, -0.023399257147918694, -0.04452982563034037, 0.13630962768164767, 0.006146322772019173, 0.038092839301109835, 0.08871845615765632, -0.0673640632402882, -0.12489890675680553, 0.42584832133163686, -0.07983864829337327, -0.2656961139478725, 0.2010891740818756, -0.15683785068624695, -0.221092046243162, 0.0997562726536045, 0.1452278113928647, 0.16293360309759577, -0.052874755809883864, 0.1628888809346201, -0.1335424816975342, 0.10077514932093085, 0.07007629567775969, -0.016521884208596568, 0.07328795903273413, 0.09145913988845564, 0.12784643820457714, 0.1691395838255877, 0.03620354186897938, -0.029053002450821087, -0.3564704273963094, -0.18143316093205133, -0.07615684816173872, 0.11141618944461172, -0.12956511738176876, -0.21723705095159423, 0.4010918236351642, 0.07206224790164714, 0.1963857672453376, 0.14797592906505994, 0.23055728393882963, 0.06438139497639433, 0.031999405737891416, 0.06184247919842695, 0.14366647338344898, 0.1821241984448054, -0.07503597470861509, -0.145939493792286, 0.042479898754844266, 0.1917993792323349]
|
1,803.08573
|
The effects of cyclical simulation on the axon hillock diameter of
murine intracortical neurons
|
Changes to the axon hillock in frequently firing neurons are known to be
important predictors of early disease states. Studying this phenomenon is
critical to understanding the first insult implicated in multiple
neuro-degenerative disorders. To study these changes we used cyclical
stimulations using micro-electrodes to the axon hillock of mouse intracortical
neurons. Numerical simulation results indicate that axon hillock water
potential fluctuated sinusoidally on high voltage only. Fluctuations in the
amplitude and trend were caused by calcium flow and storage resistance,
respectively. The change in axon hillock-stored water was proportional to the
change rate in water potential. Axon hillock diameter increased with
fluctuations in calcium free media; moreover, it varied slightly under low
voltage conditions. Changes in axon hillock diameter were caused by changes in
water potential, which was determined by subcellular gated channels, media
calcium potential, and other baseline characteristics of neurons.
|
q-bio.NC
|
changes to the axon hillock in frequently firing neurons are known to be important predictors of early disease states studying this phenomenon is critical to understanding the first insult implicated in multiple neurodegenerative disorders to study these changes we used cyclical stimulations using microelectrodes to the axon hillock of mouse intracortical neurons numerical simulation results indicate that axon hillock water potential fluctuated sinusoidally on high voltage only fluctuations in the amplitude and trend were caused by calcium flow and storage resistance respectively the change in axon hillockstored water was proportional to the change rate in water potential axon hillock diameter increased with fluctuations in calcium free media moreover it varied slightly under low voltage conditions changes in axon hillock diameter were caused by changes in water potential which was determined by subcellular gated channels media calcium potential and other baseline characteristics of neurons
|
[['changes', 'to', 'the', 'axon', 'hillock', 'in', 'frequently', 'firing', 'neurons', 'are', 'known', 'to', 'be', 'important', 'predictors', 'of', 'early', 'disease', 'states', 'studying', 'this', 'phenomenon', 'is', 'critical', 'to', 'understanding', 'the', 'first', 'insult', 'implicated', 'in', 'multiple', 'neurodegenerative', 'disorders', 'to', 'study', 'these', 'changes', 'we', 'used', 'cyclical', 'stimulations', 'using', 'microelectrodes', 'to', 'the', 'axon', 'hillock', 'of', 'mouse', 'intracortical', 'neurons', 'numerical', 'simulation', 'results', 'indicate', 'that', 'axon', 'hillock', 'water', 'potential', 'fluctuated', 'sinusoidally', 'on', 'high', 'voltage', 'only', 'fluctuations', 'in', 'the', 'amplitude', 'and', 'trend', 'were', 'caused', 'by', 'calcium', 'flow', 'and', 'storage', 'resistance', 'respectively', 'the', 'change', 'in', 'axon', 'hillockstored', 'water', 'was', 'proportional', 'to', 'the', 'change', 'rate', 'in', 'water', 'potential', 'axon', 'hillock', 'diameter', 'increased', 'with', 'fluctuations', 'in', 'calcium', 'free', 'media', 'moreover', 'it', 'varied', 'slightly', 'under', 'low', 'voltage', 'conditions', 'changes', 'in', 'axon', 'hillock', 'diameter', 'were', 'caused', 'by', 'changes', 'in', 'water', 'potential', 'which', 'was', 'determined', 'by', 'subcellular', 'gated', 'channels', 'media', 'calcium', 'potential', 'and', 'other', 'baseline', 'characteristics', 'of', 'neurons']]
|
[-0.12175333477609174, 0.2004819340630054, 0.02117816826597538, 0.024911550450807726, 0.006307701573667812, -0.18575704709666085, 0.044344390762156585, 0.43631527612221915, -0.24842331083622618, -0.2750205243609741, 0.07551649836888931, -0.29766961168432216, -0.2680919478708078, 0.1678958035165995, -0.12103782716194089, 0.027963294795202747, 0.054360606284602216, 0.01524661197064733, 0.0668416165215501, -0.2065256255888708, 0.18638253462841917, 0.08441247105287736, 0.31943712837364474, 0.0951423049706828, 0.06565815182960212, -0.05122776438062355, 0.02324403399063773, 0.0009386133579668445, -0.1301339802869311, 0.05435630104903781, 0.2533005343858336, 0.010395419658456837, 0.2626021581793755, -0.5242769805137331, -0.3199448913440738, 0.06248118480237883, 0.13991146943610633, 0.1169613197037596, -0.01692854917139261, -0.2678311296122175, 0.08406532749297543, -0.09957279522188375, -0.12269306576705839, 0.003297621423614697, 0.065559778775705, 0.0960218493521712, -0.23179283051285893, 0.1414140483666159, -0.024770308889343704, 0.1357997896995815, -0.1084851823143766, -0.10185028658933859, -0.09000858328055958, 0.1710828663490247, 0.09749265786253808, 0.04503936846871716, 0.3202490454447836, -0.12812507271760104, -0.028771942307595427, 0.2504801335424828, -0.09517002865855753, -0.12523781939364173, 0.1863192299472719, -0.16262866655351516, -0.02999140823286184, 0.18999331859006008, 0.17238244881630468, 0.02020020167094091, -0.18712146319186604, -0.09280473986106866, 0.08043486357692786, 0.20699262464235366, 0.186074041062966, -0.01332140194980139, 0.15169546322472408, 0.23669634125864422, -0.003424841313767181, 0.1282810328674214, -0.13271800979552134, -0.050842998391935526, -0.17655446935850064, -0.09363133632774714, -0.09495202406689944, 0.023632873216984977, -0.08796524351208986, -0.1584805087088017, 0.43991328465660484, 0.10230084083003688, 0.15584975595808995, -0.009344499862365897, 0.21724351675866146, 0.03706273857936997, 0.14820276955011444, 0.005841977197453905, 0.21023962227627635, 0.14129466000509047, 0.1894158143779709, -0.31578644614299417, 0.20116010521584465, -0.029599956002309392]
|
1,803.08574
|
Synthesis of nanoparticles in carbon arc: measurements and modeling
|
This work studies the region of nanoparticle growth in atmospheric pressure
carbon arc. Detection of the nanoparticles is realized via the planar laser
induced incandescence (PLII) approach. Measurements revealed large clouds of
nanoparticles in the arc periphery, bordering the region with high density of
diatomic carbon molecules. Two-dimensional computational fluid dynamic
simulations of the arc combined with thermodynamic modeling explain these
results due to interplay of the condensation of carbon molecular species and
the convection flow pattern. The results have shown that the nanoparticles are
formed in the colder, outside regions of the arc and described the parameters
necessary for coagulation.
|
physics.plasm-ph
|
this work studies the region of nanoparticle growth in atmospheric pressure carbon arc detection of the nanoparticles is realized via the planar laser induced incandescence plii approach measurements revealed large clouds of nanoparticles in the arc periphery bordering the region with high density of diatomic carbon molecules twodimensional computational fluid dynamic simulations of the arc combined with thermodynamic modeling explain these results due to interplay of the condensation of carbon molecular species and the convection flow pattern the results have shown that the nanoparticles are formed in the colder outside regions of the arc and described the parameters necessary for coagulation
|
[['this', 'work', 'studies', 'the', 'region', 'of', 'nanoparticle', 'growth', 'in', 'atmospheric', 'pressure', 'carbon', 'arc', 'detection', 'of', 'the', 'nanoparticles', 'is', 'realized', 'via', 'the', 'planar', 'laser', 'induced', 'incandescence', 'plii', 'approach', 'measurements', 'revealed', 'large', 'clouds', 'of', 'nanoparticles', 'in', 'the', 'arc', 'periphery', 'bordering', 'the', 'region', 'with', 'high', 'density', 'of', 'diatomic', 'carbon', 'molecules', 'twodimensional', 'computational', 'fluid', 'dynamic', 'simulations', 'of', 'the', 'arc', 'combined', 'with', 'thermodynamic', 'modeling', 'explain', 'these', 'results', 'due', 'to', 'interplay', 'of', 'the', 'condensation', 'of', 'carbon', 'molecular', 'species', 'and', 'the', 'convection', 'flow', 'pattern', 'the', 'results', 'have', 'shown', 'that', 'the', 'nanoparticles', 'are', 'formed', 'in', 'the', 'colder', 'outside', 'regions', 'of', 'the', 'arc', 'and', 'described', 'the', 'parameters', 'necessary', 'for', 'coagulation']]
|
[-0.11118091889540666, 0.1777952882181853, -0.03056816281750798, -0.025689340359531344, 0.03603207784704864, -0.061566441906616094, 0.04529448681510985, 0.3875690843490884, -0.2355794109404087, -0.3113102903123945, 0.044102286297129464, -0.26874363474547863, -0.10508367035537958, 0.13646820975467563, 0.00869031518639531, 0.016729044043459, 0.07490316475741565, -0.07162785742431879, 0.007199734298046679, -0.1686588461883366, 0.27001826600637285, 0.08767505285795778, 0.2646955373324454, 0.11363313262350858, 0.04897237783297896, -0.1071124020498246, -0.006211607044097036, 0.06064098823815584, -0.20686524431024736, 0.1308094405848533, 0.22433250576723368, 0.005549728674814105, 0.18187231369316578, -0.5161078977026046, -0.2957386047206819, 0.022769994360860437, 0.14890373361762613, 0.0905636644596234, -0.08895111741963774, -0.26031685899943113, 0.034582124967128036, -0.10956623400561512, -0.19034217800945044, 0.01577801014529541, 0.006488333358429372, 0.06826087313063908, -0.22921931313350796, 0.08548465479630978, 0.0812772279465571, 0.0966179527901113, -0.09233582623768598, -0.10554927454330026, -0.08716954703442753, 0.07287550789420492, 0.01443095423746854, -0.013520873403176665, 0.25381446234998295, -0.1662706942181103, -0.024018395310267806, 0.40420367643237115, -0.07342930092243477, -0.09354550676420331, 0.25132260482758284, -0.21676470543257892, -0.09208585163229145, 0.24002521812915803, 0.13854442615935114, 0.13673461282858626, -0.1374121497326996, 0.023453613583769767, -0.052193904329324144, 0.14024734900856856, 0.12526682704221456, -0.0016228816797956825, 0.2615090937167406, 0.22466885164380074, 0.017111877913121135, 0.1784075439767912, -0.16267756631132216, -0.10364396092947573, -0.19513704791665076, -0.15544686666689814, -0.17189336329698562, -0.026465810164809228, -0.10093248759367271, -0.18223345948004863, 0.3283353425562382, 0.08384559989033732, 0.16985569417709484, -0.05817853148560971, 0.27290405514184385, 0.07223449094104581, 0.09279609323479235, 0.032877772711217404, 0.24448280917014928, 0.1933274371526204, 0.09075745411217212, -0.3010844511771575, 0.08703656266909093, 0.011423358481843025]
|
1,803.08575
|
The bromodomain-containing protein Ibd1 links multiple chromatin related
protein complexes to highly expressed genes in Tetrahymena thermophila
|
Background: The chromatin remodelers of the SWI/SNF family are critical
transcriptional regulators. Recognition of lysine acetylation through a
bromodomain (BRD) component is key to SWI/SNF function; in most eukaryotes,
this function is attributed to SNF2/Brg1.
Results: Using affinity purification coupled to mass spectrometry (AP-MS) we
identified members of a SWI/SNF complex (SWI/SNFTt) in Tetrahymena thermophila.
SWI/SNFTt is composed of 11 proteins, Snf5Tt, Swi1Tt, Swi3Tt, Snf12Tt, Brg1Tt,
two proteins with potential chromatin interacting domains and four proteins
without orthologs to SWI/SNF proteins in yeast or mammals. SWI/SNFTt subunits
localize exclusively to the transcriptionally active macronucleus (MAC) during
growth and development, consistent with a role in transcription. While
Tetrahymena Brg1 does not contain a BRD, our AP-MS results identified a
BRD-containing SWI/SNFTt component, Ibd1 that associates with SWI/SNFTt during
growth but not development. AP-MS analysis of epitope-tagged Ibd1 revealed it
to be a subunit of several additional protein complexes, including putative
SWRTt, and SAGATt complexes as well as a putative H3K4-specific histone methyl
transferase complex. Recombinant Ibd1 recognizes acetyl-lysine marks on
histones correlated with active transcription. Consistent with our AP-MS and
histone array data suggesting a role in regulation of gene expression, ChIP-Seq
analysis of Ibd1 indicated that it primarily binds near promoters and within
gene bodies of highly expressed genes during growth.
Conclusions: Our results suggest that through recognizing specific histones
marks, Ibd1 targets active chromatin regions of highly expressed genes in
Tetrahymena where it subsequently might coordinate the recruitment of several
chromatin remodeling complexes to regulate the transcriptional landscape of
vegetatively growing Tetrahymena cells.
|
q-bio.GN
|
background the chromatin remodelers of the swisnf family are critical transcriptional regulators recognition of lysine acetylation through a bromodomain brd component is key to swisnf function in most eukaryotes this function is attributed to snf2brg1 results using affinity purification coupled to mass spectrometry apms we identified members of a swisnf complex swisnftt in tetrahymena thermophila swisnftt is composed of 11 proteins snf5tt swi1tt swi3tt snf12tt brg1tt two proteins with potential chromatin interacting domains and four proteins without orthologs to swisnf proteins in yeast or mammals swisnftt subunits localize exclusively to the transcriptionally active macronucleus mac during growth and development consistent with a role in transcription while tetrahymena brg1 does not contain a brd our apms results identified a brdcontaining swisnftt component ibd1 that associates with swisnftt during growth but not development apms analysis of epitopetagged ibd1 revealed it to be a subunit of several additional protein complexes including putative swrtt and sagatt complexes as well as a putative h3k4specific histone methyl transferase complex recombinant ibd1 recognizes acetyllysine marks on histones correlated with active transcription consistent with our apms and histone array data suggesting a role in regulation of gene expression chipseq analysis of ibd1 indicated that it primarily binds near promoters and within gene bodies of highly expressed genes during growth conclusions our results suggest that through recognizing specific histones marks ibd1 targets active chromatin regions of highly expressed genes in tetrahymena where it subsequently might coordinate the recruitment of several chromatin remodeling complexes to regulate the transcriptional landscape of vegetatively growing tetrahymena cells
|
[['background', 'the', 'chromatin', 'remodelers', 'of', 'the', 'swisnf', 'family', 'are', 'critical', 'transcriptional', 'regulators', 'recognition', 'of', 'lysine', 'acetylation', 'through', 'a', 'bromodomain', 'brd', 'component', 'is', 'key', 'to', 'swisnf', 'function', 'in', 'most', 'eukaryotes', 'this', 'function', 'is', 'attributed', 'to', 'snf2brg1', 'results', 'using', 'affinity', 'purification', 'coupled', 'to', 'mass', 'spectrometry', 'apms', 'we', 'identified', 'members', 'of', 'a', 'swisnf', 'complex', 'swisnftt', 'in', 'tetrahymena', 'thermophila', 'swisnftt', 'is', 'composed', 'of', '11', 'proteins', 'snf5tt', 'swi1tt', 'swi3tt', 'snf12tt', 'brg1tt', 'two', 'proteins', 'with', 'potential', 'chromatin', 'interacting', 'domains', 'and', 'four', 'proteins', 'without', 'orthologs', 'to', 'swisnf', 'proteins', 'in', 'yeast', 'or', 'mammals', 'swisnftt', 'subunits', 'localize', 'exclusively', 'to', 'the', 'transcriptionally', 'active', 'macronucleus', 'mac', 'during', 'growth', 'and', 'development', 'consistent', 'with', 'a', 'role', 'in', 'transcription', 'while', 'tetrahymena', 'brg1', 'does', 'not', 'contain', 'a', 'brd', 'our', 'apms', 'results', 'identified', 'a', 'brdcontaining', 'swisnftt', 'component', 'ibd1', 'that', 'associates', 'with', 'swisnftt', 'during', 'growth', 'but', 'not', 'development', 'apms', 'analysis', 'of', 'epitopetagged', 'ibd1', 'revealed', 'it', 'to', 'be', 'a', 'subunit', 'of', 'several', 'additional', 'protein', 'complexes', 'including', 'putative', 'swrtt', 'and', 'sagatt', 'complexes', 'as', 'well', 'as', 'a', 'putative', 'h3k4specific', 'histone', 'methyl', 'transferase', 'complex', 'recombinant', 'ibd1', 'recognizes', 'acetyllysine', 'marks', 'on', 'histones', 'correlated', 'with', 'active', 'transcription', 'consistent', 'with', 'our', 'apms', 'and', 'histone', 'array', 'data', 'suggesting', 'a', 'role', 'in', 'regulation', 'of', 'gene', 'expression', 'chipseq', 'analysis', 'of', 'ibd1', 'indicated', 'that', 'it', 'primarily', 'binds', 'near', 'promoters', 'and', 'within', 'gene', 'bodies', 'of', 'highly', 'expressed', 'genes', 'during', 'growth', 'conclusions', 'our', 'results', 'suggest', 'that', 'through', 'recognizing', 'specific', 'histones', 'marks', 'ibd1', 'targets', 'active', 'chromatin', 'regions', 'of', 'highly', 'expressed', 'genes', 'in', 'tetrahymena', 'where', 'it', 'subsequently', 'might', 'coordinate', 'the', 'recruitment', 'of', 'several', 'chromatin', 'remodeling', 'complexes', 'to', 'regulate', 'the', 'transcriptional', 'landscape', 'of', 'vegetatively', 'growing', 'tetrahymena', 'cells']]
|
[-0.11814371535765837, 0.1346622626688488, 0.004890467877648458, 0.04198062136385809, -0.026699826340464985, -0.14703030962430472, 0.0450313860526555, 0.366782129134571, -0.19281951162206917, -0.23939695330669306, 0.011842509313924787, -0.2810411973711604, -0.26037014967922373, 0.1780681466916576, -0.0729486184603605, -0.055464425290046464, 0.08843425292220405, 0.034943989000651016, 0.13699842530142264, -0.15953095225585984, 0.2459328655595451, 0.07742259935319361, 0.23789120670662364, 0.04928396606403051, 0.09390323426468815, -0.060223800119427386, -0.023075129351570828, -0.0622005932406765, -0.10915979386008068, 0.188289309085832, 0.3264246097552598, 0.14730503527592367, 0.2593117458518387, -0.40787450770237055, -0.22325433485069068, 0.09882763751093768, 0.2139482663204784, 0.09253127103966872, -0.07763160681479196, -0.2666301311251997, 0.056686088097225015, -0.1303407762770956, -0.07969846406231533, -0.06071139471468461, 0.022146878044019228, 0.08475556843248862, -0.2213744847417003, 0.1540682624473761, -0.010995154555186536, 0.109359889979936, -0.12504180323845168, -0.11996309079832453, -0.1075100206316081, 0.1788598018113383, 0.06855431708072883, 0.07234248122153412, 0.30897383150221985, -0.10677680252178595, -0.11681527250931606, 0.2921906390529177, -0.0024258556763275658, -0.1690172386970058, 0.22081147816360874, -0.11341095712850802, -0.2482534177159155, 0.17180325234105356, 0.10491935515131086, 0.08186653759937045, -0.18729634573996193, -0.024026969608659035, 0.025982990727159233, 0.24464818415576356, 0.13849151025412745, -0.042911329249921845, 0.17811869422439486, 0.21984381571083383, -0.023173327479480196, 0.1019543292193611, -0.05391794408646123, -0.1146736057853559, -0.17279572856510764, -0.15157091398449504, -0.08790933486355954, 0.028937376424315105, -0.06505480731372523, -0.2037504550634894, 0.3538911355612408, -0.008741618542941268, 0.18189261464143813, 0.02027575386589796, 0.1443520180446667, -0.08914483804402466, 0.18929972634415979, -0.011447097316918457, 0.1236344700099063, 0.07877679783537858, 0.0342429451118106, -0.2664483137460065, 0.16672213270696773, 0.03228175874012953]
|
1,803.08576
|
On the nonnegativity of stringy Hodge numbers
|
We study the nonnegativity of stringy Hodge numbers of a projective variety
with Gorenstein canonical singularities, which was conjectured by Batyrev. We
prove that the $(p,1)$-stringy Hodge numbers are nonnegative, and for
threefolds we obtain new results about the stringy Hodge diamond, which hold
even when the stringy $E$-function is not a polynomial. We also use the
Decomposition Theorem and mixed Hodge theory to prove Batyrev's conjecture for
a class of fourfolds.
|
math.AG
|
we study the nonnegativity of stringy hodge numbers of a projective variety with gorenstein canonical singularities which was conjectured by batyrev we prove that the p1stringy hodge numbers are nonnegative and for threefolds we obtain new results about the stringy hodge diamond which hold even when the stringy efunction is not a polynomial we also use the decomposition theorem and mixed hodge theory to prove batyrevs conjecture for a class of fourfolds
|
[['we', 'study', 'the', 'nonnegativity', 'of', 'stringy', 'hodge', 'numbers', 'of', 'a', 'projective', 'variety', 'with', 'gorenstein', 'canonical', 'singularities', 'which', 'was', 'conjectured', 'by', 'batyrev', 'we', 'prove', 'that', 'the', 'p1stringy', 'hodge', 'numbers', 'are', 'nonnegative', 'and', 'for', 'threefolds', 'we', 'obtain', 'new', 'results', 'about', 'the', 'stringy', 'hodge', 'diamond', 'which', 'hold', 'even', 'when', 'the', 'stringy', 'efunction', 'is', 'not', 'a', 'polynomial', 'we', 'also', 'use', 'the', 'decomposition', 'theorem', 'and', 'mixed', 'hodge', 'theory', 'to', 'prove', 'batyrevs', 'conjecture', 'for', 'a', 'class', 'of', 'fourfolds']]
|
[-0.1658115601232669, 0.03292771277319587, -0.17384624796014436, 0.18342609560071216, -0.11842111091483647, -0.20019329545862027, -0.057701476997184295, 0.2560282334108168, -0.30899159746690535, -0.21299753465991414, 0.12478368982187354, -0.1841012005149846, -0.19022747785062857, 0.18399878670002373, -0.22672496582578186, -0.008150617301818246, 0.04834557764894578, 0.028309736453311543, -0.05345000034119462, -0.3929887240306592, 0.4556434305686451, -0.08052182765546399, 0.22262729394813657, 0.16318867196866743, 0.11940088521190723, 0.0043691246455509055, 0.034749468716359894, -0.02853318184456775, -0.1768710872616076, 0.1845115220902199, 0.30717658757848637, 0.07706376959399229, 0.12707162678609013, -0.4030982638171441, -0.12490475996607311, 0.2537587663080071, 0.042475488541883905, 0.1306947323552687, -0.003808495765683097, -0.21951465998631967, 0.17848134578945948, -0.11776133137591131, -0.24253797939729313, -0.16236127150887755, 0.011697415341164025, -0.0038534303976249106, -0.2299871813623943, 0.02146572954452623, 0.06845394434066306, 0.11087173901655724, -0.0638396103840164, -0.1284144530663083, -0.11982684254541363, -0.05598596315691576, -0.0008003173402549935, -0.027659249108310947, 0.024877865379020363, -0.12442864859345514, -0.1672412217397925, 0.3248428591776272, -0.03466844872873224, -0.18406108306379806, 0.049023739427072326, -0.18034942873792958, -0.24898137160393238, 0.10833579093270318, 0.03833518792468477, 0.2540200869421619, 0.046667089071542905, 0.162026502085443, -0.18284460358669272, 0.06772559167633593, 0.19130347336603093, 0.02172472542414153, 0.17558408148166998, 0.05334256089974562, 0.05448283855868897, 0.15527876617114755, -0.03481913276646339, -0.07123088405769266, -0.38651267680483803, -0.23553278741859635, -0.16291193513881783, 0.22825062753731865, -0.15176622413425103, -0.18569044783239214, 0.3486332258498165, -0.0040261314486638765, 0.14336943699860236, 0.17297464491419073, 0.19176635565892072, 0.03532725625054937, 0.027516103356184676, 0.009517430832845643, 0.15296197344522766, 0.29741985610896116, 0.01450552279457555, -0.12352759623900056, -0.06462443199559627, 0.23331285772425397]
|
1,803.08577
|
Unbiased scalable softmax optimization
|
Recent neural network and language models rely on softmax distributions with
an extremely large number of categories. Since calculating the softmax
normalizing constant in this context is prohibitively expensive, there is a
growing literature of efficiently computable but biased estimates of the
softmax. In this paper we propose the first unbiased algorithms for maximizing
the softmax likelihood whose work per iteration is independent of the number of
classes and datapoints (and no extra work is required at the end of each
epoch). We show that our proposed unbiased methods comprehensively outperform
the state-of-the-art on seven real world datasets.
|
stat.ML cs.LG
|
recent neural network and language models rely on softmax distributions with an extremely large number of categories since calculating the softmax normalizing constant in this context is prohibitively expensive there is a growing literature of efficiently computable but biased estimates of the softmax in this paper we propose the first unbiased algorithms for maximizing the softmax likelihood whose work per iteration is independent of the number of classes and datapoints and no extra work is required at the end of each epoch we show that our proposed unbiased methods comprehensively outperform the stateoftheart on seven real world datasets
|
[['recent', 'neural', 'network', 'and', 'language', 'models', 'rely', 'on', 'softmax', 'distributions', 'with', 'an', 'extremely', 'large', 'number', 'of', 'categories', 'since', 'calculating', 'the', 'softmax', 'normalizing', 'constant', 'in', 'this', 'context', 'is', 'prohibitively', 'expensive', 'there', 'is', 'a', 'growing', 'literature', 'of', 'efficiently', 'computable', 'but', 'biased', 'estimates', 'of', 'the', 'softmax', 'in', 'this', 'paper', 'we', 'propose', 'the', 'first', 'unbiased', 'algorithms', 'for', 'maximizing', 'the', 'softmax', 'likelihood', 'whose', 'work', 'per', 'iteration', 'is', 'independent', 'of', 'the', 'number', 'of', 'classes', 'and', 'datapoints', 'and', 'no', 'extra', 'work', 'is', 'required', 'at', 'the', 'end', 'of', 'each', 'epoch', 'we', 'show', 'that', 'our', 'proposed', 'unbiased', 'methods', 'comprehensively', 'outperform', 'the', 'stateoftheart', 'on', 'seven', 'real', 'world', 'datasets']]
|
[-0.06688307180325975, 0.018619694962191197, -0.030788082700716903, 0.07086201866718048, -0.08474766314314792, -0.15533368452452123, 0.06531188608983493, 0.4186552334122469, -0.2313856241502324, -0.3269916906078555, 0.08401673459281613, -0.275164563912062, -0.16506925371608563, 0.20338774105647997, -0.11888791848810351, 0.09370806398777748, 0.13781931296428096, 0.03351140856904415, -0.07467454821536583, -0.37029336835732873, 0.3335035687540563, 0.06689306366856076, 0.30227521383108535, -0.02409621995959279, 0.13890564406043565, -0.0383926933388967, -0.08265877029103018, -0.00130868880957251, -0.09146618057431104, 0.20968531735469492, 0.258498108671862, 0.19191220574541556, 0.365434431371146, -0.39254766994878193, -0.17058736785333983, 0.1741198649634702, 0.15706679533824933, 0.11044297692955743, -0.004469368267063127, -0.20837951515212047, 0.06761502526458163, -0.18157813952741575, 0.015926805609951213, -0.09700488274422836, 0.004440860404651992, -0.0013081409626317267, -0.28865926457944385, 0.06917121452849587, 0.04151012855510665, 0.050070827351692986, -0.023658531805861513, -0.17046534103265373, 0.014062081043114315, 0.11373405106251641, 0.06936709161809816, 0.05326099564292829, 0.1126561355587019, -0.14875939037063995, -0.12006215193327896, 0.3035778799949556, -0.06967867659499907, -0.22001674731395074, 0.1921490664208992, -0.07151123853780482, -0.2031756337323435, 0.12422271830039289, 0.18388125392619037, 0.1814120400278848, -0.14627281507021006, 0.062314300425469454, -0.06390186474297424, 0.17081124420106716, 0.045592252008274804, -0.002508205942552993, 0.1620958799363247, 0.21922766518474993, 0.056521190544210224, 0.13639181239853557, -0.09467317805891591, -0.0701947991204049, -0.2692174069982554, -0.11651497095709248, -0.277844832896502, -0.013010570874475703, -0.10155376119551615, -0.19366920152108888, 0.38105605390607095, 0.23710269629907776, 0.23529959327484273, 0.16606491930991868, 0.36029478179633007, 0.08939624555071587, 0.09810932588107808, 0.12408438385274186, 0.20219309860602858, 0.041249595653759887, 0.07881377579416243, -0.13740538655096018, 0.12351056706393138, 0.04246819986010265]
|
1,803.08578
|
The Open Graph Axiom and Menger's Conjecture
|
Menger conjectured that subsets of $\mathbb R$ with the Menger property must
be $\sigma$-compact. While this is false when there is no restriction on the
subsets of $\mathbb R$, for projective subsets it is known to follow from the
Axiom of Projective Determinacy, which has considerable large cardinal
consistency strength. We show that the perfect set version of the Open Graph
Axiom for projective sets of reals, with consistency strength only an
inaccessible cardinal, also implies Menger's conjecture restricted to this
family of subsets of $\mathbb R$.
|
math.LO math.GN
|
menger conjectured that subsets of mathbb r with the menger property must be sigmacompact while this is false when there is no restriction on the subsets of mathbb r for projective subsets it is known to follow from the axiom of projective determinacy which has considerable large cardinal consistency strength we show that the perfect set version of the open graph axiom for projective sets of reals with consistency strength only an inaccessible cardinal also implies mengers conjecture restricted to this family of subsets of mathbb r
|
[['menger', 'conjectured', 'that', 'subsets', 'of', 'mathbb', 'r', 'with', 'the', 'menger', 'property', 'must', 'be', 'sigmacompact', 'while', 'this', 'is', 'false', 'when', 'there', 'is', 'no', 'restriction', 'on', 'the', 'subsets', 'of', 'mathbb', 'r', 'for', 'projective', 'subsets', 'it', 'is', 'known', 'to', 'follow', 'from', 'the', 'axiom', 'of', 'projective', 'determinacy', 'which', 'has', 'considerable', 'large', 'cardinal', 'consistency', 'strength', 'we', 'show', 'that', 'the', 'perfect', 'set', 'version', 'of', 'the', 'open', 'graph', 'axiom', 'for', 'projective', 'sets', 'of', 'reals', 'with', 'consistency', 'strength', 'only', 'an', 'inaccessible', 'cardinal', 'also', 'implies', 'mengers', 'conjecture', 'restricted', 'to', 'this', 'family', 'of', 'subsets', 'of', 'mathbb', 'r']]
|
[-0.1855424953860113, 0.08159368832735478, -0.04642994838884507, 0.05287146172887678, -0.10898698825421262, -0.16385794428830175, 0.03706404486746024, 0.3374763557676697, -0.3297833260362861, -0.1717749165167668, 0.09660176993829422, -0.276758133431083, -0.027898631403864973, 0.18730402149356387, -0.1844582800357335, 0.016154447035200293, 0.056064967357756935, 0.09460388483672307, 0.0031284556627787395, -0.3423749908939373, 0.40614321349916616, -0.07715420380780666, 0.23536641420475368, 0.08570658102974124, 0.11828767855105729, 0.021574420303149128, 0.028153267266207385, 0.1154428485127958, -0.18837609692913582, 0.06767124057501211, 0.2596826238862785, 0.22107792652650982, 0.27986126876939305, -0.3170299261016236, -0.18324160757046407, 0.28975044514839376, 0.09538687876928811, -0.03986478337199138, 0.03734663995277222, -0.3057232468292631, 0.14983461158692665, -0.0992290965955833, -0.15067599309158736, -0.06923775322435574, 0.14144350314812584, 0.006255278566547124, -0.28594461405628374, -0.04342153329360727, 0.14750324199297304, 0.14821256817072287, -0.021663986435481185, -0.09274996760376227, -0.07358775178409428, 0.03094127173060498, 0.025678624445840115, 0.1301439169944189, 0.02866710356340326, -0.004052382899212769, -0.08712076453154842, 0.35983543580962646, -0.02663307045532883, -0.23450914581691654, 0.15534696202917858, -0.19313321876521597, -0.21392479538382297, 0.11144757839240904, -0.007006020606334867, 0.09924685609815963, -0.02404689791845827, 0.2621545417344026, -0.2292455221130245, 0.1948792201175151, 0.12700751483782954, 0.0844947363306158, 0.14559308522255107, 0.07343986786463051, 0.1323519320542999, 0.1565591383754843, 0.045918061454170225, -0.01093710420503356, -0.36218845210541256, -0.12396595292007444, -0.19047471041384356, 0.1632663892346552, -0.15568633283081668, -0.2245245734229684, 0.27697247600760955, 0.13732121506406145, 0.10968150311931112, 0.16256881530005912, 0.2146404268455574, -0.004845397863851528, 0.06407075624206457, 0.09371362910850171, 0.1462646227800983, 0.16430035832969622, -0.08729528480787473, -0.08104281161440773, 0.0897288669098768, 0.16122603065323557]
|
1,803.08579
|
The Roots of Bias on Uber
|
In the last decade, there has been a growth in, what we call, digitally
mediated workplaces. A digitally mediated workplace is one where interactions
between stakeholders are primarily managed by proprietary, algorithmically
managed digital platform. The replacement of the relationships between the
stakeholders by the platform is a key feature of these workplaces, and is a
contributing factor to the decrease in contractual responsibilities each
stakeholder has to one another. In this paper, we discuss some of the ways in
which this structure and lack of accountability serves as a root of, or at
least an enabler to, the realization of biases in the ridesharing application
Uber, a digitally mediated workplace.
|
cs.CY
|
in the last decade there has been a growth in what we call digitally mediated workplaces a digitally mediated workplace is one where interactions between stakeholders are primarily managed by proprietary algorithmically managed digital platform the replacement of the relationships between the stakeholders by the platform is a key feature of these workplaces and is a contributing factor to the decrease in contractual responsibilities each stakeholder has to one another in this paper we discuss some of the ways in which this structure and lack of accountability serves as a root of or at least an enabler to the realization of biases in the ridesharing application uber a digitally mediated workplace
|
[['in', 'the', 'last', 'decade', 'there', 'has', 'been', 'a', 'growth', 'in', 'what', 'we', 'call', 'digitally', 'mediated', 'workplaces', 'a', 'digitally', 'mediated', 'workplace', 'is', 'one', 'where', 'interactions', 'between', 'stakeholders', 'are', 'primarily', 'managed', 'by', 'proprietary', 'algorithmically', 'managed', 'digital', 'platform', 'the', 'replacement', 'of', 'the', 'relationships', 'between', 'the', 'stakeholders', 'by', 'the', 'platform', 'is', 'a', 'key', 'feature', 'of', 'these', 'workplaces', 'and', 'is', 'a', 'contributing', 'factor', 'to', 'the', 'decrease', 'in', 'contractual', 'responsibilities', 'each', 'stakeholder', 'has', 'to', 'one', 'another', 'in', 'this', 'paper', 'we', 'discuss', 'some', 'of', 'the', 'ways', 'in', 'which', 'this', 'structure', 'and', 'lack', 'of', 'accountability', 'serves', 'as', 'a', 'root', 'of', 'or', 'at', 'least', 'an', 'enabler', 'to', 'the', 'realization', 'of', 'biases', 'in', 'the', 'ridesharing', 'application', 'uber', 'a', 'digitally', 'mediated', 'workplace']]
|
[-0.15185508382011642, 0.11590273976695686, -0.05119804507551446, 0.04686397883038431, -0.10543839763094848, -0.1221759587543102, 0.07436857766289315, 0.3839151647134877, -0.30883145641099224, -0.2952220448468988, 0.12051574995967786, -0.32737260809386365, -0.19786021898097889, 0.17619523196061654, -0.10307365386570627, -0.031689572416514426, -0.032671272746278894, 0.013174681882332038, 0.025494442216481443, -0.25221737034341973, 0.31800184734920794, 0.03872754611494439, 0.2893467305043528, 0.10276234371856123, 0.05926070930798085, -0.021478979735056292, -0.019033060482543735, -0.03260232620192943, -0.056295726439907205, 0.17331515692661073, 0.337034037848515, 0.16747420598115134, 0.39628871317390724, -0.4120461008519874, -0.12589057250292385, 0.11153777443745115, 0.14939331805736228, 0.05471351791722784, -0.08289402057123077, -0.2874702449116084, 0.06589823417986433, -0.2612222816232961, -0.11803775477466417, -0.002081156557274831, 0.020192209194909345, 0.014853115707975687, -0.23087218862607958, -0.008234035265673924, 0.008462517555836623, 0.11897841148783227, 0.0035834134050837913, -0.04516036106642705, -0.031140688135548756, 0.22566132368897465, 0.05854633738452501, 0.008046551880233729, 0.1173806654096388, -0.16904574921270749, -0.1504476561823541, 0.4037546783618562, 0.011650328395409963, -0.17074231992303687, 0.18100367392086097, -0.07636158239633382, -0.12445158474902446, 0.04301352199032769, 0.18654598225210164, 0.022666857695324463, -0.21437915444829259, 0.0467769351341082, 0.016207531312698715, 0.16424675466207503, 0.07343566674017557, 0.007631523199043832, 0.23023773747630552, 0.23926956240121308, 0.07457184507553508, 0.11659007616706092, -0.0012182349733471333, -0.07526108907401427, -0.24838097821417693, -0.2034229108275057, -0.14059326240398526, 0.027969705712822108, -0.027309505549744022, -0.11098113258344096, 0.3822011201483038, 0.15802341177723966, 0.16878848164636004, -0.04664942307653627, 0.32626939979423814, 0.06711660883796343, 0.1760574712308946, 0.05812384538050439, 0.19244195168197095, 0.009682043044416755, 0.15523037995706807, -0.13426581287320266, 0.15212761586729168, 0.009925590710596996]
|
1,803.0858
|
Weighted Bilinear Coding over Salient Body Parts for Person
Re-identification
|
Deep convolutional neural networks (CNNs) have demonstrated dominant
performance in person re-identification (Re-ID). Existing CNN based methods
utilize global average pooling (GAP) to aggregate intermediate convolutional
features for Re-ID. However, this strategy only considers the first-order
statistics of local features and treats local features at different locations
equally important, leading to sub-optimal feature representation. To deal with
these issues, we propose a novel weighted bilinear coding (WBC) framework for
local feature aggregation in CNN networks to pursue more representative and
discriminative feature representations, which can adapt to other
state-of-the-art methods and improve their performance. In specific, bilinear
coding is used to encode the channel-wise feature correlations to capture
richer feature interactions. Meanwhile, a weighting scheme is applied on the
bilinear coding to adaptively adjust the weights of local features at different
locations based on their importance in recognition, further improving the
discriminability of feature aggregation. To handle the spatial misalignment
issue, we use a salient part net (spatial attention module) to derive salient
body parts, and apply the WBC model on each part. The final representation,
formed by concatenating the WBC encoded features of each part, is both
discriminative and resistant to spatial misalignment. Experiments on three
benchmarks including Market-1501, DukeMTMC-reID and CUHK03 evidence the
favorable performance of our method against other outstanding methods.
|
cs.CV
|
deep convolutional neural networks cnns have demonstrated dominant performance in person reidentification reid existing cnn based methods utilize global average pooling gap to aggregate intermediate convolutional features for reid however this strategy only considers the firstorder statistics of local features and treats local features at different locations equally important leading to suboptimal feature representation to deal with these issues we propose a novel weighted bilinear coding wbc framework for local feature aggregation in cnn networks to pursue more representative and discriminative feature representations which can adapt to other stateoftheart methods and improve their performance in specific bilinear coding is used to encode the channelwise feature correlations to capture richer feature interactions meanwhile a weighting scheme is applied on the bilinear coding to adaptively adjust the weights of local features at different locations based on their importance in recognition further improving the discriminability of feature aggregation to handle the spatial misalignment issue we use a salient part net spatial attention module to derive salient body parts and apply the wbc model on each part the final representation formed by concatenating the wbc encoded features of each part is both discriminative and resistant to spatial misalignment experiments on three benchmarks including market1501 dukemtmcreid and cuhk03 evidence the favorable performance of our method against other outstanding methods
|
[['deep', 'convolutional', 'neural', 'networks', 'cnns', 'have', 'demonstrated', 'dominant', 'performance', 'in', 'person', 'reidentification', 'reid', 'existing', 'cnn', 'based', 'methods', 'utilize', 'global', 'average', 'pooling', 'gap', 'to', 'aggregate', 'intermediate', 'convolutional', 'features', 'for', 'reid', 'however', 'this', 'strategy', 'only', 'considers', 'the', 'firstorder', 'statistics', 'of', 'local', 'features', 'and', 'treats', 'local', 'features', 'at', 'different', 'locations', 'equally', 'important', 'leading', 'to', 'suboptimal', 'feature', 'representation', 'to', 'deal', 'with', 'these', 'issues', 'we', 'propose', 'a', 'novel', 'weighted', 'bilinear', 'coding', 'wbc', 'framework', 'for', 'local', 'feature', 'aggregation', 'in', 'cnn', 'networks', 'to', 'pursue', 'more', 'representative', 'and', 'discriminative', 'feature', 'representations', 'which', 'can', 'adapt', 'to', 'other', 'stateoftheart', 'methods', 'and', 'improve', 'their', 'performance', 'in', 'specific', 'bilinear', 'coding', 'is', 'used', 'to', 'encode', 'the', 'channelwise', 'feature', 'correlations', 'to', 'capture', 'richer', 'feature', 'interactions', 'meanwhile', 'a', 'weighting', 'scheme', 'is', 'applied', 'on', 'the', 'bilinear', 'coding', 'to', 'adaptively', 'adjust', 'the', 'weights', 'of', 'local', 'features', 'at', 'different', 'locations', 'based', 'on', 'their', 'importance', 'in', 'recognition', 'further', 'improving', 'the', 'discriminability', 'of', 'feature', 'aggregation', 'to', 'handle', 'the', 'spatial', 'misalignment', 'issue', 'we', 'use', 'a', 'salient', 'part', 'net', 'spatial', 'attention', 'module', 'to', 'derive', 'salient', 'body', 'parts', 'and', 'apply', 'the', 'wbc', 'model', 'on', 'each', 'part', 'the', 'final', 'representation', 'formed', 'by', 'concatenating', 'the', 'wbc', 'encoded', 'features', 'of', 'each', 'part', 'is', 'both', 'discriminative', 'and', 'resistant', 'to', 'spatial', 'misalignment', 'experiments', 'on', 'three', 'benchmarks', 'including', 'market1501', 'dukemtmcreid', 'and', 'cuhk03', 'evidence', 'the', 'favorable', 'performance', 'of', 'our', 'method', 'against', 'other', 'outstanding', 'methods']]
|
[-0.04907510942881753, -0.04347382317390728, -0.07488044970108536, 0.08510208686391571, -0.11010968225581624, -0.22886471782166895, -0.010544511665825113, 0.4515805921787135, -0.3020832699616918, -0.28614170726815186, 0.04402166975022372, -0.26313017150517726, -0.19365606523743423, 0.12393601169095975, -0.12910174703112343, 0.0778240509389434, 0.08761232630045057, 0.03817563230241431, -0.07811956037699232, -0.306760472997046, 0.3237134480596494, 0.06290190857190478, 0.3944469754710341, 0.025422784051570658, 0.13726922205557382, -0.025834236302735094, -0.08792162112016927, -0.04441360376120292, -0.02394644755469722, 0.20547079368794738, 0.3159996024985737, 0.1461346788537497, 0.3187427132457895, -0.41232713496434353, -0.25127478692001687, 0.07035811543388501, 0.15810389450215953, 0.09862453845562413, -0.012610375864127167, -0.3444105620902885, 0.10797069967228258, -0.1616696970859351, 0.029166134067802368, -0.1643738348448266, -0.024783908950913452, -0.023888235887247092, -0.3179221209943747, 0.06000619737766509, 0.07704107788452338, 0.031925097403821545, -0.058127836378674226, -0.14487583542821458, 0.013756886806782926, 0.18612108396466334, 0.006386714831329708, 0.024641218416775777, 0.14918631468203233, -0.20423033226240062, -0.11186990293317309, 0.3363718406745248, -0.049427229519411225, -0.23846685495466935, 0.21363012242635765, -0.012871129529672527, -0.15781464282353627, 0.10441346766392344, 0.2596310450843422, 0.11498469049323168, -0.1334581706807818, -0.036003579920327516, -0.025943284140569026, 0.17822706366390878, 0.06640463336218566, 0.07007399182020041, 0.1992180038087949, 0.22550311617479252, 0.04286450328779729, 0.14511351437127287, -0.17660815427357235, -0.0962422604440868, -0.17230485139140495, -0.03914093699362825, -0.17646973979742067, -0.098139680474322, -0.1181179713758381, -0.11072605329230602, 0.46581101328276725, 0.2310981809229739, 0.24563495468818278, 0.07077759991032202, 0.33976768834024634, -0.0050390880662625846, 0.17678559418967882, 0.09019827732389846, 0.19143616212978, 0.025969475806934463, 0.09851178225776111, -0.1850080626677269, 0.09310758652853145, 0.1318419292290634]
|
1,803.08581
|
Depth-dependent hysteresis in adhesive elastic contacts at large surface
roughness
|
Contact force--indentation depth measurements in contact experiments
involving compliant materials, such as polymers and gels, show a hysteresis
loop whose size depends on the maximum indentation depth. This depth-dependent
hysteresis (DDH) is not explained by classical contact mechanics theories and
was believed to be due to effects such as material viscoelasticity, plasticity,
surface polymer interdigitation, and moisture, etc. It has been observed that
the DDH energy loss initially increases and then decreases with roughness. A
mechanics model based on the occurrence of adhesion and roughness related
small-scale instabilities was presented by one of the authors for explaining
DDH. However, that model only applies in the regime of infinitesimally small
surface roughness, and consequently it does not capture the decrease in energy
loss with surface roughness at the large roughness regime. We present a new
mechanics model that applies in the regime of large surface roughness based on
the Maugis--Dugdale theory of adhesive elastic contacts and Nayak's theory of
rough surfaces. The model captures the trend of decreasing energy loss with
increasing roughness. It also captures the experimentally observed dependencies
of energy loss on the maximum indentation depth, and material and surface
properties.
|
cond-mat.soft
|
contact forceindentation depth measurements in contact experiments involving compliant materials such as polymers and gels show a hysteresis loop whose size depends on the maximum indentation depth this depthdependent hysteresis ddh is not explained by classical contact mechanics theories and was believed to be due to effects such as material viscoelasticity plasticity surface polymer interdigitation and moisture etc it has been observed that the ddh energy loss initially increases and then decreases with roughness a mechanics model based on the occurrence of adhesion and roughness related smallscale instabilities was presented by one of the authors for explaining ddh however that model only applies in the regime of infinitesimally small surface roughness and consequently it does not capture the decrease in energy loss with surface roughness at the large roughness regime we present a new mechanics model that applies in the regime of large surface roughness based on the maugisdugdale theory of adhesive elastic contacts and nayaks theory of rough surfaces the model captures the trend of decreasing energy loss with increasing roughness it also captures the experimentally observed dependencies of energy loss on the maximum indentation depth and material and surface properties
|
[['contact', 'forceindentation', 'depth', 'measurements', 'in', 'contact', 'experiments', 'involving', 'compliant', 'materials', 'such', 'as', 'polymers', 'and', 'gels', 'show', 'a', 'hysteresis', 'loop', 'whose', 'size', 'depends', 'on', 'the', 'maximum', 'indentation', 'depth', 'this', 'depthdependent', 'hysteresis', 'ddh', 'is', 'not', 'explained', 'by', 'classical', 'contact', 'mechanics', 'theories', 'and', 'was', 'believed', 'to', 'be', 'due', 'to', 'effects', 'such', 'as', 'material', 'viscoelasticity', 'plasticity', 'surface', 'polymer', 'interdigitation', 'and', 'moisture', 'etc', 'it', 'has', 'been', 'observed', 'that', 'the', 'ddh', 'energy', 'loss', 'initially', 'increases', 'and', 'then', 'decreases', 'with', 'roughness', 'a', 'mechanics', 'model', 'based', 'on', 'the', 'occurrence', 'of', 'adhesion', 'and', 'roughness', 'related', 'smallscale', 'instabilities', 'was', 'presented', 'by', 'one', 'of', 'the', 'authors', 'for', 'explaining', 'ddh', 'however', 'that', 'model', 'only', 'applies', 'in', 'the', 'regime', 'of', 'infinitesimally', 'small', 'surface', 'roughness', 'and', 'consequently', 'it', 'does', 'not', 'capture', 'the', 'decrease', 'in', 'energy', 'loss', 'with', 'surface', 'roughness', 'at', 'the', 'large', 'roughness', 'regime', 'we', 'present', 'a', 'new', 'mechanics', 'model', 'that', 'applies', 'in', 'the', 'regime', 'of', 'large', 'surface', 'roughness', 'based', 'on', 'the', 'maugisdugdale', 'theory', 'of', 'adhesive', 'elastic', 'contacts', 'and', 'nayaks', 'theory', 'of', 'rough', 'surfaces', 'the', 'model', 'captures', 'the', 'trend', 'of', 'decreasing', 'energy', 'loss', 'with', 'increasing', 'roughness', 'it', 'also', 'captures', 'the', 'experimentally', 'observed', 'dependencies', 'of', 'energy', 'loss', 'on', 'the', 'maximum', 'indentation', 'depth', 'and', 'material', 'and', 'surface', 'properties']]
|
[-0.07616271657371865, 0.18649246932753405, -0.0997316331885443, 0.05547088008259389, -0.028291214218470438, -0.1758548890152722, 0.018425890999719384, 0.3657221648139947, -0.28820630430161015, -0.3262790440586615, 0.04388757234473386, -0.2998798435617297, -0.2105283580076788, 0.19452431600014264, -0.09462408618562665, 0.09328844896834636, 0.023053061981388023, -0.025799016331697944, -0.034281417004903045, -0.1961032569857012, 0.28384811724097275, 0.08135525086597194, 0.3101861102174948, 0.16545040980566547, 0.09366439917441445, 0.032018568739725466, 0.052269582942625535, 0.11009605449785269, -0.1900888694412089, 0.08095447619656511, 0.17591623303173257, -0.04107162726589562, 0.21031834759032694, -0.4653802052510814, -0.3136578821942834, 0.029545319943167073, 0.08054949174006104, 0.08137209693467273, 0.009159747245404576, -0.1882900259352694, 0.029243214409408302, -0.12915270131432416, -0.12215588578023855, -0.02477979582992836, 0.047574287958209116, 0.03978287178659763, -0.19797542937958115, 0.1177615963728033, 0.06791617172155821, 0.10432605439168036, -0.09362647750205239, -0.08491057833822453, -0.0802784874750038, 0.08417314614281449, 0.08936475680199944, 0.017401673150838827, 0.22218261485314728, -0.15747208719590378, -0.019024886061676353, 0.3621034727746338, -0.04664066659179345, -0.18083779327693292, 0.2070312837689764, -0.13531461273471176, -0.0498810258862521, 0.1744009004198795, 0.17519532377144117, 0.06732994574244032, -0.09939946236420442, 0.06379519677592968, 0.009967982951254237, 0.204583368166618, 0.0865078399589295, -0.026594135160582306, 0.18568898584323093, 0.2409066054823745, 0.024559978598055882, 0.12161154363180038, -0.13666062837183787, -0.062201745010892914, -0.29407231081813495, -0.1429804006557307, -0.20760189380048144, 0.013755434574114394, -0.09572918425825808, -0.22365812873662844, 0.30721177593975557, 0.10834369530714805, 0.18630055515631955, 0.0682421773403922, 0.2453240150517506, 0.09566841886259361, 0.11868074328116877, 0.03757127871522339, 0.287153590407164, 0.15143673527615234, 0.10585003912982809, -0.25357604333070344, 0.17540504384044733, 0.02157051906496145]
|
1,803.08582
|
Friction weakening by mechanical vibrations: a velocity-controlled
process
|
Frictional weakening by vibrations was first invoked in the 70's to explain
unusual fault slips and earthquakes, low viscosity during the collapse of
impact craters or the extraordinary mobility of sturzstroms, peculiar rock
avalanches which travels large horizontal distances. This mechanism was further
invoked to explain the remote triggering of earthquakes or abnormally large
landslides or pyroclastic flows runout. Recent experimental and theoretical
work pointed out the velocity of vibration as the key parameter which governs
frictional weakening in sheared granular media. Here we show that the grains
mobility is not mandatory, and that the vibration velocity governs both
granular and solid frictional weakening. The velocity threshold controlling the
transition from stick-slip motion to continuous sliding is of the same order of
magnitude, namely a hundred microns per second. It is linked to the roughness
distribution of the asperities at the contact surface.
|
physics.geo-ph cond-mat.soft
|
frictional weakening by vibrations was first invoked in the 70s to explain unusual fault slips and earthquakes low viscosity during the collapse of impact craters or the extraordinary mobility of sturzstroms peculiar rock avalanches which travels large horizontal distances this mechanism was further invoked to explain the remote triggering of earthquakes or abnormally large landslides or pyroclastic flows runout recent experimental and theoretical work pointed out the velocity of vibration as the key parameter which governs frictional weakening in sheared granular media here we show that the grains mobility is not mandatory and that the vibration velocity governs both granular and solid frictional weakening the velocity threshold controlling the transition from stickslip motion to continuous sliding is of the same order of magnitude namely a hundred microns per second it is linked to the roughness distribution of the asperities at the contact surface
|
[['frictional', 'weakening', 'by', 'vibrations', 'was', 'first', 'invoked', 'in', 'the', '70s', 'to', 'explain', 'unusual', 'fault', 'slips', 'and', 'earthquakes', 'low', 'viscosity', 'during', 'the', 'collapse', 'of', 'impact', 'craters', 'or', 'the', 'extraordinary', 'mobility', 'of', 'sturzstroms', 'peculiar', 'rock', 'avalanches', 'which', 'travels', 'large', 'horizontal', 'distances', 'this', 'mechanism', 'was', 'further', 'invoked', 'to', 'explain', 'the', 'remote', 'triggering', 'of', 'earthquakes', 'or', 'abnormally', 'large', 'landslides', 'or', 'pyroclastic', 'flows', 'runout', 'recent', 'experimental', 'and', 'theoretical', 'work', 'pointed', 'out', 'the', 'velocity', 'of', 'vibration', 'as', 'the', 'key', 'parameter', 'which', 'governs', 'frictional', 'weakening', 'in', 'sheared', 'granular', 'media', 'here', 'we', 'show', 'that', 'the', 'grains', 'mobility', 'is', 'not', 'mandatory', 'and', 'that', 'the', 'vibration', 'velocity', 'governs', 'both', 'granular', 'and', 'solid', 'frictional', 'weakening', 'the', 'velocity', 'threshold', 'controlling', 'the', 'transition', 'from', 'stickslip', 'motion', 'to', 'continuous', 'sliding', 'is', 'of', 'the', 'same', 'order', 'of', 'magnitude', 'namely', 'a', 'hundred', 'microns', 'per', 'second', 'it', 'is', 'linked', 'to', 'the', 'roughness', 'distribution', 'of', 'the', 'asperities', 'at', 'the', 'contact', 'surface']]
|
[-0.16600451608923014, 0.2572597236451234, -0.08655675047267439, 0.03027470444138883, -0.08678522239222755, -0.0862117865201558, 0.038581243998200544, 0.3282999755670382, -0.29162293244612364, -0.2914024459289938, 0.06676886923132386, -0.26534426887335194, -0.16034850234355988, 0.1465809191159025, -0.06857752183150552, 0.07456502412170382, 0.014507365802325091, -0.027803726661556834, 0.02166008049930433, -0.18861331822494912, 0.2454437599484612, 0.09424419992957526, 0.30724977745517146, 0.09286065115781934, 0.09367325419599426, -0.05232234291968421, -0.004719627025852006, 0.04961052054906605, -0.1791095605623641, 0.023699886565634484, 0.17738245084593204, -0.05729729515085535, 0.25345700261392956, -0.47046200519191544, -0.2603928732200408, 0.07487514174156364, 0.12048060239069688, 0.08722207094968992, 0.013166699023559873, -0.25769362839358584, 0.050923072742822935, -0.15584648089667022, -0.16438339021332352, 0.0036241306536371858, 0.09521865492201292, 0.06325756375428657, -0.18492997401643177, 0.1504957596049972, 0.10127934975661075, 0.1120627769137877, -0.09054675046354532, -0.03398213595230604, -0.07351427449529964, 0.11608591416201383, 0.13445507341661347, -0.0027253969743008346, 0.25076376829414404, -0.12055626652092004, -0.026849979003497833, 0.42804185543897966, -0.015611571704962251, -0.06221540654274884, 0.25321695563534247, -0.1740388652296658, -0.0687034107370853, 0.227517081952562, 0.1879662393828408, 0.02797646884737589, -0.11674464002422148, -0.07077714660295947, 0.008454524252799824, 0.15013958699345378, 0.13288621092010225, -0.06196353879132518, 0.24013208113217227, 0.2235360882363059, 0.03582675368065985, 0.13026789918830486, -0.18979116295575832, -0.06447219971278814, -0.2953769455337569, -0.1483024762103885, -0.18220424775729402, 0.030594860078233234, -0.08393682133444112, -0.18039769020823526, 0.3276602917032736, 0.15077701736320281, 0.20851790131082837, -0.005639292744093273, 0.2644234053744659, 0.053603986123229155, 0.11943652178324811, 0.0731388592525241, 0.3056178225424062, 0.14301308646755503, 0.15224030304004924, -0.25249926201875394, 0.1814088886316774, 0.047449998495260805]
|
1,803.08583
|
Visible Light Communication for Wearable Computing
|
Visible Light Communication (VLC) is emerging as a means to network computing
devices that ameliorates many hurdles of radio-frequency (RF) communications,
for example, the limited available spectrum. Enabling VLC in wearable
computing, however, is challenging because mobility induces unpredictable
drastic changes in light conditions, for example, due to reflective surfaces
and obstacles casting shadows. We experimentally demonstrate that such changes
are so extreme that no single design of a VLC receiver can provide efficient
performance across the board. The diversity found in current wearable devices
complicates matters. Based on these observations, we present three different
designs of VLC receivers that i) are individually orders of magnitude more
efficient than the state-of-the-art in a subset of the possible conditions, and
i) can be combined in a single unit that dynamically switches to the best
performing receiver based on the light conditions. Our evaluation indicates
that dynamic switching incurs minimal overhead, that we can obtain throughput
in the order of MBit/s, and at energy costs lower than many RF devices.
|
cs.NI cs.ET
|
visible light communication vlc is emerging as a means to network computing devices that ameliorates many hurdles of radiofrequency rf communications for example the limited available spectrum enabling vlc in wearable computing however is challenging because mobility induces unpredictable drastic changes in light conditions for example due to reflective surfaces and obstacles casting shadows we experimentally demonstrate that such changes are so extreme that no single design of a vlc receiver can provide efficient performance across the board the diversity found in current wearable devices complicates matters based on these observations we present three different designs of vlc receivers that i are individually orders of magnitude more efficient than the stateoftheart in a subset of the possible conditions and i can be combined in a single unit that dynamically switches to the best performing receiver based on the light conditions our evaluation indicates that dynamic switching incurs minimal overhead that we can obtain throughput in the order of mbits and at energy costs lower than many rf devices
|
[['visible', 'light', 'communication', 'vlc', 'is', 'emerging', 'as', 'a', 'means', 'to', 'network', 'computing', 'devices', 'that', 'ameliorates', 'many', 'hurdles', 'of', 'radiofrequency', 'rf', 'communications', 'for', 'example', 'the', 'limited', 'available', 'spectrum', 'enabling', 'vlc', 'in', 'wearable', 'computing', 'however', 'is', 'challenging', 'because', 'mobility', 'induces', 'unpredictable', 'drastic', 'changes', 'in', 'light', 'conditions', 'for', 'example', 'due', 'to', 'reflective', 'surfaces', 'and', 'obstacles', 'casting', 'shadows', 'we', 'experimentally', 'demonstrate', 'that', 'such', 'changes', 'are', 'so', 'extreme', 'that', 'no', 'single', 'design', 'of', 'a', 'vlc', 'receiver', 'can', 'provide', 'efficient', 'performance', 'across', 'the', 'board', 'the', 'diversity', 'found', 'in', 'current', 'wearable', 'devices', 'complicates', 'matters', 'based', 'on', 'these', 'observations', 'we', 'present', 'three', 'different', 'designs', 'of', 'vlc', 'receivers', 'that', 'i', 'are', 'individually', 'orders', 'of', 'magnitude', 'more', 'efficient', 'than', 'the', 'stateoftheart', 'in', 'a', 'subset', 'of', 'the', 'possible', 'conditions', 'and', 'i', 'can', 'be', 'combined', 'in', 'a', 'single', 'unit', 'that', 'dynamically', 'switches', 'to', 'the', 'best', 'performing', 'receiver', 'based', 'on', 'the', 'light', 'conditions', 'our', 'evaluation', 'indicates', 'that', 'dynamic', 'switching', 'incurs', 'minimal', 'overhead', 'that', 'we', 'can', 'obtain', 'throughput', 'in', 'the', 'order', 'of', 'mbits', 'and', 'at', 'energy', 'costs', 'lower', 'than', 'many', 'rf', 'devices']]
|
[-0.21048816427511546, 0.09075246612164414, -0.030324913310496845, 0.0038259139996842436, -0.095200834763957, -0.21131002570646593, 0.08119722021538542, 0.4626324968551108, -0.21571307559636244, -0.32598058987752576, 0.11636663680491481, -0.26254974848069695, -0.1865252684302894, 0.2622993937790549, -0.1566713462955141, 0.05057539251477768, 0.07010823199414604, -0.00018735373946366876, -0.049588846950168124, -0.23827313248711152, 0.2238064385351858, 0.050633538995281835, 0.3407452273725842, 0.07471037035741444, 0.07715814089724085, -0.00439100235650715, 0.017135196240858585, -0.009985778371282365, -0.04918417963073721, 0.135470461080331, 0.2973214006300883, 0.13970184684841938, 0.26020567888294216, -0.4867863820510961, -0.24873066241326297, 0.10258927052096364, 0.14354877580245512, 0.055919745576656646, -0.07989499648699296, -0.2323519877446372, 0.10093163580694679, -0.16368703169947757, -0.07851716464808435, -0.04186162029214929, -0.02731311575709177, 0.026361839696792663, -0.265749803777518, -0.020743864618929193, -0.022957533815531946, 0.06487043931182208, -0.028067713283841538, -0.10458961452102467, 0.00900492804828987, 0.14021758327726275, 0.0026696163667587654, -0.037851458229678905, 0.16451845325354952, -0.1399480026184825, -0.12484198434200759, 0.38746360950643155, -0.04322369517969838, -0.1589114662811404, 0.1880118347887349, -0.09409686504278354, -0.09361582486114155, 0.16143828057240517, 0.19859345614323892, 0.08824037669910467, -0.16267945823277669, 0.028053470799585783, 0.03902845102545273, 0.20754432164886522, 0.08277303531316907, 0.1475705239025133, 0.193496329046043, 0.213802648497568, 0.11331009335879658, 0.12957715932931196, -0.11250912127572865, -0.07491983246048524, -0.2177179824128481, -0.13769062213777078, -0.19052519809476853, 0.03639894571391605, -0.07842980741172921, -0.09603330252936021, 0.37606058059082853, 0.21174352509912014, 0.13746812364531383, 0.036385549362204894, 0.4192753348588234, 0.08149872748375249, 0.11836736703324797, 0.10921926493895062, 0.240895470799019, -0.0032088205029833176, 0.12069852239940138, -0.19387376620545096, 0.07609753782110472, -0.07395580369934794]
|
1,803.08584
|
Curvature of Hypergraphs via Multi-Marginal Optimal Transport
|
We introduce a novel definition of curvature for hypergraphs, a natural
generalization of graphs, by introducing a multi-marginal optimal transport
problem for a naturally defined random walk on the hypergraph. This curvature,
termed \emph{coarse scalar curvature}, generalizes a recent definition of Ricci
curvature for Markov chains on metric spaces by Ollivier [Journal of Functional
Analysis 256 (2009) 810-864], and is related to the scalar curvature when the
hypergraph arises naturally from a Riemannian manifold. We investigate basic
properties of the coarse scalar curvature and obtain several bounds. Empirical
experiments indicate that coarse scalar curvatures are capable of detecting
"bridges" across connected components in hypergraphs, suggesting it is an
appropriate generalization of curvature on simple graphs.
|
cs.IT cs.DM cs.SI math.IT stat.AP stat.ML
|
we introduce a novel definition of curvature for hypergraphs a natural generalization of graphs by introducing a multimarginal optimal transport problem for a naturally defined random walk on the hypergraph this curvature termed emphcoarse scalar curvature generalizes a recent definition of ricci curvature for markov chains on metric spaces by ollivier journal of functional analysis 256 2009 810864 and is related to the scalar curvature when the hypergraph arises naturally from a riemannian manifold we investigate basic properties of the coarse scalar curvature and obtain several bounds empirical experiments indicate that coarse scalar curvatures are capable of detecting bridges across connected components in hypergraphs suggesting it is an appropriate generalization of curvature on simple graphs
|
[['we', 'introduce', 'a', 'novel', 'definition', 'of', 'curvature', 'for', 'hypergraphs', 'a', 'natural', 'generalization', 'of', 'graphs', 'by', 'introducing', 'a', 'multimarginal', 'optimal', 'transport', 'problem', 'for', 'a', 'naturally', 'defined', 'random', 'walk', 'on', 'the', 'hypergraph', 'this', 'curvature', 'termed', 'emphcoarse', 'scalar', 'curvature', 'generalizes', 'a', 'recent', 'definition', 'of', 'ricci', 'curvature', 'for', 'markov', 'chains', 'on', 'metric', 'spaces', 'by', 'ollivier', 'journal', 'of', 'functional', 'analysis', '256', '2009', '810864', 'and', 'is', 'related', 'to', 'the', 'scalar', 'curvature', 'when', 'the', 'hypergraph', 'arises', 'naturally', 'from', 'a', 'riemannian', 'manifold', 'we', 'investigate', 'basic', 'properties', 'of', 'the', 'coarse', 'scalar', 'curvature', 'and', 'obtain', 'several', 'bounds', 'empirical', 'experiments', 'indicate', 'that', 'coarse', 'scalar', 'curvatures', 'are', 'capable', 'of', 'detecting', 'bridges', 'across', 'connected', 'components', 'in', 'hypergraphs', 'suggesting', 'it', 'is', 'an', 'appropriate', 'generalization', 'of', 'curvature', 'on', 'simple', 'graphs']]
|
[-0.1635203824782398, 0.13605205565848102, -0.07301555485753096, 0.10838654668346476, -0.13114817600812664, -0.15560498776787943, -0.035389277391729104, 0.3532913220444678, -0.2656796956599682, -0.2812148042649558, 0.08218875202140152, -0.24710930156958313, -0.21393226501655527, 0.14610600593887205, -0.14984200596479716, 0.04930214673709289, 0.06923036070425162, 0.05551520840108263, -0.011800484449512004, -0.19917315685404546, 0.4109462603959626, 0.017149712198075994, 0.24444774769048774, 0.1344992071905264, 0.12411458519971476, -0.0040084516475171845, -0.0408504722573984, 0.1089357637215109, -0.20730393288474977, 0.15385273220821127, 0.18810703519698793, 0.11125780616895156, 0.2743540522601225, -0.35542726137601166, -0.2970320040244708, 0.1469454721720741, 0.07880787665551875, 0.04002995626146872, -0.015808387683185262, -0.31243208147568907, 0.08264968000698537, -0.060373969178284165, -0.08120146281842093, -0.09765863381491034, -0.016566916871651086, -0.020942380305676335, -0.2555826384392855, 0.06332603317223885, 0.09558551723294093, 0.05372569205747316, -0.021013045102456766, -0.1440250182903446, -0.0021480377186584264, 0.0253943315518101, 0.008743918265949571, 0.013093732247969746, 0.12404865684169056, -0.07220774246750614, -0.14792314843085091, 0.322341204690953, -0.12072334040895896, -0.2536831759802371, 0.08002906288556029, -0.038950821298248735, -0.18245477283752598, 0.0691970348094417, 0.18084202491703022, 0.17910013522178067, -0.11656549473283338, 0.1477407186108732, -0.06996775017968848, 0.08062253884179929, 0.10755082388177711, 0.021618743035612644, 0.16138433127260182, 0.12312016681257008, 0.17419797644183704, 0.1863961555434605, 0.02306764972791801, -0.15121809003073144, -0.3091174579695263, -0.2000065085156697, -0.23112370536159887, 0.12135017424537511, -0.2247469789939376, -0.22373365146309895, 0.44715448698045407, 0.060924166632173336, 0.21899846646176502, 0.15846245711750714, 0.24129477932027218, 0.027035619008593855, 0.02824702294362066, 0.13451649355331222, 0.17431134145410188, 0.26450006980696217, 0.07217088609983303, -0.11374145329196368, -0.0015981558048932822, 0.14938469480442923]
|
1,803.08585
|
Motivic correlators, cluster varieties and Zagier's conjecture on
zeta(F,4)
|
We prove Zagier's conjecture on the value at s=4 of the Dedekind
zeta-function of a number field F. For any field F, we define a map from the
appropriate pieces of algebraic K-theory of F to the cohomology of the weight 4
polylogarithmic motivic complex. When F is the function field of a complex
variety, composing this map with the regulator map on the polylogarithmic
complex to the Deligne cohomology, we get a rational multiple of Beilinson's
regulator. This plus Borel's theorem implies Zagier's conjecture. Another
application is a formula expressing the value at s=4 of the L-function of an
elliptic curve E over Q via generalized Eisenstein-Kronecker series. We get a
strong evidence for the part of Freeness Conjecture describing the weight four
part of the motivic Lie coalgebra of F via higher Bloch groups. Our main tools
are motivic correlators and a new link of cluster varieties to polylogarithms.
|
math.NT math.AG
|
we prove zagiers conjecture on the value at s4 of the dedekind zetafunction of a number field f for any field f we define a map from the appropriate pieces of algebraic ktheory of f to the cohomology of the weight 4 polylogarithmic motivic complex when f is the function field of a complex variety composing this map with the regulator map on the polylogarithmic complex to the deligne cohomology we get a rational multiple of beilinsons regulator this plus borels theorem implies zagiers conjecture another application is a formula expressing the value at s4 of the lfunction of an elliptic curve e over q via generalized eisensteinkronecker series we get a strong evidence for the part of freeness conjecture describing the weight four part of the motivic lie coalgebra of f via higher bloch groups our main tools are motivic correlators and a new link of cluster varieties to polylogarithms
|
[['we', 'prove', 'zagiers', 'conjecture', 'on', 'the', 'value', 'at', 's4', 'of', 'the', 'dedekind', 'zetafunction', 'of', 'a', 'number', 'field', 'f', 'for', 'any', 'field', 'f', 'we', 'define', 'a', 'map', 'from', 'the', 'appropriate', 'pieces', 'of', 'algebraic', 'ktheory', 'of', 'f', 'to', 'the', 'cohomology', 'of', 'the', 'weight', '4', 'polylogarithmic', 'motivic', 'complex', 'when', 'f', 'is', 'the', 'function', 'field', 'of', 'a', 'complex', 'variety', 'composing', 'this', 'map', 'with', 'the', 'regulator', 'map', 'on', 'the', 'polylogarithmic', 'complex', 'to', 'the', 'deligne', 'cohomology', 'we', 'get', 'a', 'rational', 'multiple', 'of', 'beilinsons', 'regulator', 'this', 'plus', 'borels', 'theorem', 'implies', 'zagiers', 'conjecture', 'another', 'application', 'is', 'a', 'formula', 'expressing', 'the', 'value', 'at', 's4', 'of', 'the', 'lfunction', 'of', 'an', 'elliptic', 'curve', 'e', 'over', 'q', 'via', 'generalized', 'eisensteinkronecker', 'series', 'we', 'get', 'a', 'strong', 'evidence', 'for', 'the', 'part', 'of', 'freeness', 'conjecture', 'describing', 'the', 'weight', 'four', 'part', 'of', 'the', 'motivic', 'lie', 'coalgebra', 'of', 'f', 'via', 'higher', 'bloch', 'groups', 'our', 'main', 'tools', 'are', 'motivic', 'correlators', 'and', 'a', 'new', 'link', 'of', 'cluster', 'varieties', 'to', 'polylogarithms']]
|
[-0.2647305771196569, -0.01261698229719086, -0.1704550777555795, 0.08066018034290794, -0.09587773413008807, -0.11501383948269368, 0.03228667070811602, 0.26650228067910275, -0.3311402757917315, -0.23016996412932725, 0.06389858326042033, -0.19898257236380365, -0.15141263138502836, 0.22791037132303593, -0.12331331248043587, -0.002849877355558588, 0.0013934133731642899, 0.10321462157472278, -0.05706471620768999, -0.32268762212733904, 0.43806279738069764, -0.042115094070014424, 0.18340172983678243, 0.08393709988808197, 0.09302602412598517, 0.05922653696296231, -0.011999546096888402, -0.10230708299883154, -0.11221062919334662, 0.16702092582643624, 0.30304161815083774, 0.06692728353201702, 0.25168771373219045, -0.3462310599668926, -0.1051765272489422, 0.18149331625896375, 0.09891515360244654, 0.005669700330283666, 0.04384939187508545, -0.2287437310103105, 0.09108061726445592, -0.18949215163149877, -0.19191535254662845, -0.07369310579328976, 0.05540919658459649, 0.022664223547827527, -0.27216897465270135, -0.00024669934125826846, 0.051557375334005874, 0.17434720406274076, -0.0913713079050726, -0.12402894294786804, -0.049025733848811676, 0.09522609802102516, 0.01640420114707868, 0.12396144443222426, 0.11792209517482101, -0.13818418183394812, -0.1179403080389101, 0.32155317989554233, -0.08492952842105007, -0.16541271466786497, 0.07502100606825178, -0.18366068081054465, -0.20599591385400454, 0.14733571747305574, 0.03620623125515829, 0.16898010380948517, 0.02598680559010322, 0.17953218477246172, -0.13628679165899574, 0.10271341196378532, 0.14339391880711874, -0.04556487362511111, 0.16110032158194493, 0.02513092167101899, 0.03770093579733411, 0.16581948349462045, 0.0060754946729057275, -0.03522862557519153, -0.3650181891727385, -0.22941474502733508, -0.13362514373803178, 0.17362494364269818, -0.15893028765006703, -0.19772691155216404, 0.4246263474392526, 0.05658349021344094, 0.1907819692193475, 0.1869307482354528, 0.25265991025826345, 0.14197511648811673, 0.0876356762816932, -0.010417043465800238, 0.09432031361953608, 0.23464253401254237, 0.016154752365029758, -0.12572985274920745, -0.0486648389001821, 0.2365031596782019]
|
1,803.08586
|
Optimization of Smooth Functions with Noisy Observations: Local Minimax
Rates
|
We consider the problem of global optimization of an unknown non-convex
smooth function with zeroth-order feedback. In this setup, an algorithm is
allowed to adaptively query the underlying function at different locations and
receives noisy evaluations of function values at the queried points (i.e. the
algorithm has access to zeroth-order information). Optimization performance is
evaluated by the expected difference of function values at the estimated
optimum and the true optimum. In contrast to the classical optimization setup,
first-order information like gradients are not directly accessible to the
optimization algorithm. We show that the classical minimax framework of
analysis, which roughly characterizes the worst-case query complexity of an
optimization algorithm in this setting, leads to excessively pessimistic
results. We propose a local minimax framework to study the fundamental
difficulty of optimizing smooth functions with adaptive function evaluations,
which provides a refined picture of the intrinsic difficulty of zeroth-order
optimization. We show that for functions with fast level set growth around the
global minimum, carefully designed optimization algorithms can identify a near
global minimizer with many fewer queries. For the special case of strongly
convex and smooth functions, our implied convergence rates match the ones
developed for zeroth-order convex optimization problems. At the other end of
the spectrum, for worst-case smooth functions no algorithm can converge faster
than the minimax rate of estimating the entire unknown function in the
$\ell_\infty$-norm. We provide an intuitive and efficient algorithm that
attains the derived upper error bounds.
|
stat.ML cs.LG math.ST stat.TH
|
we consider the problem of global optimization of an unknown nonconvex smooth function with zerothorder feedback in this setup an algorithm is allowed to adaptively query the underlying function at different locations and receives noisy evaluations of function values at the queried points ie the algorithm has access to zerothorder information optimization performance is evaluated by the expected difference of function values at the estimated optimum and the true optimum in contrast to the classical optimization setup firstorder information like gradients are not directly accessible to the optimization algorithm we show that the classical minimax framework of analysis which roughly characterizes the worstcase query complexity of an optimization algorithm in this setting leads to excessively pessimistic results we propose a local minimax framework to study the fundamental difficulty of optimizing smooth functions with adaptive function evaluations which provides a refined picture of the intrinsic difficulty of zerothorder optimization we show that for functions with fast level set growth around the global minimum carefully designed optimization algorithms can identify a near global minimizer with many fewer queries for the special case of strongly convex and smooth functions our implied convergence rates match the ones developed for zerothorder convex optimization problems at the other end of the spectrum for worstcase smooth functions no algorithm can converge faster than the minimax rate of estimating the entire unknown function in the ell_inftynorm we provide an intuitive and efficient algorithm that attains the derived upper error bounds
|
[['we', 'consider', 'the', 'problem', 'of', 'global', 'optimization', 'of', 'an', 'unknown', 'nonconvex', 'smooth', 'function', 'with', 'zerothorder', 'feedback', 'in', 'this', 'setup', 'an', 'algorithm', 'is', 'allowed', 'to', 'adaptively', 'query', 'the', 'underlying', 'function', 'at', 'different', 'locations', 'and', 'receives', 'noisy', 'evaluations', 'of', 'function', 'values', 'at', 'the', 'queried', 'points', 'ie', 'the', 'algorithm', 'has', 'access', 'to', 'zerothorder', 'information', 'optimization', 'performance', 'is', 'evaluated', 'by', 'the', 'expected', 'difference', 'of', 'function', 'values', 'at', 'the', 'estimated', 'optimum', 'and', 'the', 'true', 'optimum', 'in', 'contrast', 'to', 'the', 'classical', 'optimization', 'setup', 'firstorder', 'information', 'like', 'gradients', 'are', 'not', 'directly', 'accessible', 'to', 'the', 'optimization', 'algorithm', 'we', 'show', 'that', 'the', 'classical', 'minimax', 'framework', 'of', 'analysis', 'which', 'roughly', 'characterizes', 'the', 'worstcase', 'query', 'complexity', 'of', 'an', 'optimization', 'algorithm', 'in', 'this', 'setting', 'leads', 'to', 'excessively', 'pessimistic', 'results', 'we', 'propose', 'a', 'local', 'minimax', 'framework', 'to', 'study', 'the', 'fundamental', 'difficulty', 'of', 'optimizing', 'smooth', 'functions', 'with', 'adaptive', 'function', 'evaluations', 'which', 'provides', 'a', 'refined', 'picture', 'of', 'the', 'intrinsic', 'difficulty', 'of', 'zerothorder', 'optimization', 'we', 'show', 'that', 'for', 'functions', 'with', 'fast', 'level', 'set', 'growth', 'around', 'the', 'global', 'minimum', 'carefully', 'designed', 'optimization', 'algorithms', 'can', 'identify', 'a', 'near', 'global', 'minimizer', 'with', 'many', 'fewer', 'queries', 'for', 'the', 'special', 'case', 'of', 'strongly', 'convex', 'and', 'smooth', 'functions', 'our', 'implied', 'convergence', 'rates', 'match', 'the', 'ones', 'developed', 'for', 'zerothorder', 'convex', 'optimization', 'problems', 'at', 'the', 'other', 'end', 'of', 'the', 'spectrum', 'for', 'worstcase', 'smooth', 'functions', 'no', 'algorithm', 'can', 'converge', 'faster', 'than', 'the', 'minimax', 'rate', 'of', 'estimating', 'the', 'entire', 'unknown', 'function', 'in', 'the', 'ell_inftynorm', 'we', 'provide', 'an', 'intuitive', 'and', 'efficient', 'algorithm', 'that', 'attains', 'the', 'derived', 'upper', 'error', 'bounds']]
|
[-0.09099752190118764, -0.021577698536253773, -0.09541733223225245, 0.1122513302979021, -0.07042834978196616, -0.1576652499435331, 0.08419479858293775, 0.3881150638301711, -0.3066681258280354, -0.3268071701519253, 0.1032526195539962, -0.23247904143938872, -0.16870836492277652, 0.20010712561447727, -0.10687588722289208, 0.11413973575750894, 0.03827276889885168, 0.03370608435498747, -0.1302857510309419, -0.2872019937610223, 0.27161398685554056, 0.06254116549783902, 0.2642794546771271, 0.01566498324757034, 0.11215687987456206, 0.03125232875670406, 0.013905306610332664, 0.015111807699980068, -0.1482189246828267, 0.13206486937480263, 0.26605720895396406, 0.20942027032690907, 0.3507134531767008, -0.38384607813632776, -0.15930729710269903, 0.14887723519105064, 0.1417605772533662, 0.07751570858180615, -0.029345578166236716, -0.22565471623689398, 0.09556821195220128, -0.08300695726878879, -0.08404443869925265, -0.06848631661446873, -0.044503020901956465, 0.022315295541675894, -0.36719142801555504, 0.051122765860150854, 0.023568393965636588, 0.00437525449566493, -0.08526775220405187, -0.13615685256213925, 0.03555313140069219, 0.10839875365418866, 0.04962537060097275, 0.09159274971411344, 0.14679148643516188, -0.11420935997547012, -0.11818873456656194, 0.33080753966170645, -0.05723680975234323, -0.22714508064033478, 0.15345986631471847, -0.12180287662069968, -0.10563245768541439, 0.1829769830128047, 0.20802653563393603, 0.166985814154633, -0.13995623711664, 0.08286450420937323, -0.046775283229398765, 0.16026019336932823, 0.027533592096787747, 0.04458099537219252, 0.12183588106100532, 0.14380352214278946, 0.1848193666328145, 0.16710203955231873, -0.02961492068822157, -0.12320349405688996, -0.2974943182025151, -0.08708264682516995, -0.2142886412060581, -0.031246208381290212, -0.15671040768103003, -0.17741227803043713, 0.3790668821008491, 0.13320910879401182, 0.20189640825529667, 0.14551290649100984, 0.3350049733753847, 0.16385962495062942, 0.02210030050694265, 0.14583374748452882, 0.21347502026945536, 0.046006659256517576, 0.06012795055823878, -0.22591532638281092, 0.12687607425311195, 0.08521002780238152]
|
1,803.08587
|
On the Emergence of Topologically Protected Boundary States in
Topological/Normal Insulator Heterostructures
|
We have performed a systematic investigation of the formation of
topologically protected boundary states (TPBS) in topological/normal insulators
(TI/NI) heterostructures. Using a recently developed scheme to construct {\it
ab-initio} tight-binding Hamiltonian matrices from density functional theory
(DFT) calculations, we studied systems of realistic size with high accuracy and
control over the relevant parameters such as TI and NI band alignment, NI gap
and spin-orbit coupling strength. Our findings point to the existence of an NI
critical thickness for the emergence of TPBS and to the importance of the band
alignment between the TI and NI for the appearance of the TPBS. We chose
Bi$_{2}$Se$_{3}$ as a prototypical case where the topological/normal insulator
behavior is modeled by regions with/without spin-orbit coupling. Finally, we
validate our approach comparing our model with fully relativistic DFT
calculations for TI/NI heterostructures of Bi$_{2}$Se$_{3}$/Sb$_{2}$Se$_{3}$.
|
cond-mat.mtrl-sci
|
we have performed a systematic investigation of the formation of topologically protected boundary states tpbs in topologicalnormal insulators tini heterostructures using a recently developed scheme to construct it abinitio tightbinding hamiltonian matrices from density functional theory dft calculations we studied systems of realistic size with high accuracy and control over the relevant parameters such as ti and ni band alignment ni gap and spinorbit coupling strength our findings point to the existence of an ni critical thickness for the emergence of tpbs and to the importance of the band alignment between the ti and ni for the appearance of the tpbs we chose bi_2se_3 as a prototypical case where the topologicalnormal insulator behavior is modeled by regions withwithout spinorbit coupling finally we validate our approach comparing our model with fully relativistic dft calculations for tini heterostructures of bi_2se_3sb_2se_3
|
[['we', 'have', 'performed', 'a', 'systematic', 'investigation', 'of', 'the', 'formation', 'of', 'topologically', 'protected', 'boundary', 'states', 'tpbs', 'in', 'topologicalnormal', 'insulators', 'tini', 'heterostructures', 'using', 'a', 'recently', 'developed', 'scheme', 'to', 'construct', 'it', 'abinitio', 'tightbinding', 'hamiltonian', 'matrices', 'from', 'density', 'functional', 'theory', 'dft', 'calculations', 'we', 'studied', 'systems', 'of', 'realistic', 'size', 'with', 'high', 'accuracy', 'and', 'control', 'over', 'the', 'relevant', 'parameters', 'such', 'as', 'ti', 'and', 'ni', 'band', 'alignment', 'ni', 'gap', 'and', 'spinorbit', 'coupling', 'strength', 'our', 'findings', 'point', 'to', 'the', 'existence', 'of', 'an', 'ni', 'critical', 'thickness', 'for', 'the', 'emergence', 'of', 'tpbs', 'and', 'to', 'the', 'importance', 'of', 'the', 'band', 'alignment', 'between', 'the', 'ti', 'and', 'ni', 'for', 'the', 'appearance', 'of', 'the', 'tpbs', 'we', 'chose', 'bi_2se_3', 'as', 'a', 'prototypical', 'case', 'where', 'the', 'topologicalnormal', 'insulator', 'behavior', 'is', 'modeled', 'by', 'regions', 'withwithout', 'spinorbit', 'coupling', 'finally', 'we', 'validate', 'our', 'approach', 'comparing', 'our', 'model', 'with', 'fully', 'relativistic', 'dft', 'calculations', 'for', 'tini', 'heterostructures', 'of', 'bi_2se_3sb_2se_3']]
|
[-0.13812549976822341, 0.0849549296962303, -0.011019340383868804, 0.032255608534923055, 0.011643043161798133, -0.15239083678903478, 0.09629762629607869, 0.3981117352462598, -0.22323116451080371, -0.3384903427791258, -0.015174683692430004, -0.30990726713186306, -0.17250183340243613, 0.14783486214221667, 0.06114129395985527, 0.05845839304494311, -0.011482168825166504, -0.11859493763152047, -0.1438405050141533, -0.1897535928436657, 0.3150466108783046, 0.03704326248550992, 0.2818309048489824, 0.08370469731319505, -0.012572299298170928, 0.0003081025372184541, 0.11397761042250225, 0.041568391776242615, -0.17508175462334805, 0.09860707650829555, 0.24301772896900609, -0.07969378663410083, 0.21985432367608712, -0.47552950847486075, -0.2358507971027798, -0.04887730635389903, 0.0943097880001377, 0.14586337740587438, -0.09477556930569402, -0.3246022301528902, 0.0946550431362197, -0.19198273188250997, -0.10504824448297018, -0.10933628324827138, 0.0038972511704005027, -0.017700175494278516, -0.26490521696430164, 0.04423212978893714, 0.0215852071249001, 0.09884040541239474, -0.12159142719690491, -0.11670302522341537, -0.13787177034116682, 0.09168873999920422, 0.037948691436551836, 0.02940902871888702, 0.12012226405098056, -0.06824418248431961, -0.11025934650759844, 0.3831986685548603, -0.0652470850716277, -0.15338443085784093, 0.1849152414760396, -0.11037316151731477, -0.09963464904508561, 0.0951620651388636, 0.11593497764441545, 0.12348909939156615, -0.08285154956970772, 0.1083072936396033, -0.0067876718673229655, 0.18011185620766113, -0.028884669500709014, 0.059702746264201446, 0.20600671902380502, 0.2127202923620378, 0.01373920993995003, 0.08924687664316845, -0.15191238239342958, -0.07272351387018053, -0.25176417554327607, -0.17026172506276274, -0.24453936302422608, 0.04317263172545137, -0.061521097427437145, -0.20299929433780975, 0.41377483674649124, 0.15758629809439617, 0.15282989702574964, -0.024049794717766616, 0.2267884370143505, 0.0944717806113041, 0.04997718941427114, 0.015940001081457756, 0.23753110384636553, 0.1846740256916786, 0.059966994829333126, -0.2740730411852336, 0.0521568762933849, 0.04158498066898952]
|
1,803.08588
|
Search for streaming dark matter axions or other exotica
|
We suggest a new approach to search for galactic axions or other similar
exotica. Streaming dark matter (DM) could have a better discovery potential
because of flux enhancement, due to gravitational lensing when the Sun and/or a
planet are aligned with a DM stream. Of interest are also axion miniclusters,
in particular, if the solar system has trapped one during its formation.
Wide-band axion antennae fit this concept, but also the proposed fast narrow
band scanning. A network of detectors can provide full time coverage and a
large axion mass acceptance. Other DM searches may profit from this proposal.
|
astro-ph.IM
|
we suggest a new approach to search for galactic axions or other similar exotica streaming dark matter dm could have a better discovery potential because of flux enhancement due to gravitational lensing when the sun andor a planet are aligned with a dm stream of interest are also axion miniclusters in particular if the solar system has trapped one during its formation wideband axion antennae fit this concept but also the proposed fast narrow band scanning a network of detectors can provide full time coverage and a large axion mass acceptance other dm searches may profit from this proposal
|
[['we', 'suggest', 'a', 'new', 'approach', 'to', 'search', 'for', 'galactic', 'axions', 'or', 'other', 'similar', 'exotica', 'streaming', 'dark', 'matter', 'dm', 'could', 'have', 'a', 'better', 'discovery', 'potential', 'because', 'of', 'flux', 'enhancement', 'due', 'to', 'gravitational', 'lensing', 'when', 'the', 'sun', 'andor', 'a', 'planet', 'are', 'aligned', 'with', 'a', 'dm', 'stream', 'of', 'interest', 'are', 'also', 'axion', 'miniclusters', 'in', 'particular', 'if', 'the', 'solar', 'system', 'has', 'trapped', 'one', 'during', 'its', 'formation', 'wideband', 'axion', 'antennae', 'fit', 'this', 'concept', 'but', 'also', 'the', 'proposed', 'fast', 'narrow', 'band', 'scanning', 'a', 'network', 'of', 'detectors', 'can', 'provide', 'full', 'time', 'coverage', 'and', 'a', 'large', 'axion', 'mass', 'acceptance', 'other', 'dm', 'searches', 'may', 'profit', 'from', 'this', 'proposal']]
|
[-0.13117172770117494, 0.15801922468035812, -0.08115667079277267, 0.13004625464714312, -0.16329427478797356, -0.13237857098945163, 0.03805969767460619, 0.3753494947320885, -0.2046022345911655, -0.4005756974126203, 0.060024192461489954, -0.22940589039765222, -0.06839517190948957, 0.19961471724408594, -0.02914760359257196, 0.015371628979931237, 0.0911092849558859, 0.012919727727274571, -0.03351993085651875, -0.25128576941223757, 0.2262352365116128, 0.10046159004736127, 0.17484134254328004, 0.03778874291744403, 0.029704883501799118, -0.05334135013011595, -0.03896437674252824, -0.05366320945816397, -0.10877546637949317, 0.07503324785655496, 0.21084163235641565, 0.14163447982358812, 0.2151452454413767, -0.3976683943494778, -0.24276753536641899, 0.16574949634760017, 0.2081851607395543, 0.10022993082876759, -0.1627277971640455, -0.33365253259361993, 0.06719243839898174, -0.24007506085315136, -0.10193681616260848, -0.013879896914163097, 0.012470489715912728, 0.019461587568829684, -0.27098442917934273, 0.046548491841854736, -0.013230089770836962, -0.07565217702226205, -0.0757331066056992, -0.09680495561556797, 0.0032745339446748145, -0.009300522194326281, 0.09277950116254464, 0.05601600518995764, 0.2236574685078754, -0.16549122285606346, -0.08344902370284979, 0.4282493018121882, -0.11300198491333485, -0.08902942806110727, 0.2102989587801123, -0.17775038701089363, -0.15594884175148727, 0.17783902523418268, 0.18939298582075145, 0.062064481386444485, -0.1598371883010259, 0.08566276663197016, -0.04996826149984216, 0.19526770167203264, 0.06745362466182371, 0.08672091669657013, 0.41685616142219967, 0.20304529391925294, 0.12515688830789065, 0.04970967184488821, -0.1881283381342361, -0.0339896645999015, -0.24153542386443175, -0.12868886146308722, -0.14441934949483234, 0.009022664219950034, -0.08301841987827863, -0.12701602096697598, 0.3382105841630637, 0.13341838903748665, 0.1851496807102001, 0.005548943624351964, 0.34570223836209435, 0.06246628701766821, 0.10117631040588775, 0.03279080337873011, 0.33444771492345765, 0.0808092775575892, 0.14849968091937515, -0.19003204217491051, 0.009416131888318694, -0.029044550471948555]
|
1,803.08589
|
The Monte Carlo wave-function method: a robust adaptive algorithm and a
study in convergence
|
We present a stepwise adaptive-timestep version of the Quantum Jump (Monte
Carlo wave-function) algorithm. Our method has proved to remain robust even for
problems where the integrating implementation of the Quantum Jump method is
numerically problematic. The only specific parameter of our algorithm is the
single a priori parameter of the Quantum Jump method, the maximal allowed total
jump probability per timestep. We study the convergence of ensembles of
trajectories to the solution of the full master equation as a function of this
parameter. This study is expected to pertain to any possible implementation of
the Quantum Jump method.
|
quant-ph
|
we present a stepwise adaptivetimestep version of the quantum jump monte carlo wavefunction algorithm our method has proved to remain robust even for problems where the integrating implementation of the quantum jump method is numerically problematic the only specific parameter of our algorithm is the single a priori parameter of the quantum jump method the maximal allowed total jump probability per timestep we study the convergence of ensembles of trajectories to the solution of the full master equation as a function of this parameter this study is expected to pertain to any possible implementation of the quantum jump method
|
[['we', 'present', 'a', 'stepwise', 'adaptivetimestep', 'version', 'of', 'the', 'quantum', 'jump', 'monte', 'carlo', 'wavefunction', 'algorithm', 'our', 'method', 'has', 'proved', 'to', 'remain', 'robust', 'even', 'for', 'problems', 'where', 'the', 'integrating', 'implementation', 'of', 'the', 'quantum', 'jump', 'method', 'is', 'numerically', 'problematic', 'the', 'only', 'specific', 'parameter', 'of', 'our', 'algorithm', 'is', 'the', 'single', 'a', 'priori', 'parameter', 'of', 'the', 'quantum', 'jump', 'method', 'the', 'maximal', 'allowed', 'total', 'jump', 'probability', 'per', 'timestep', 'we', 'study', 'the', 'convergence', 'of', 'ensembles', 'of', 'trajectories', 'to', 'the', 'solution', 'of', 'the', 'full', 'master', 'equation', 'as', 'a', 'function', 'of', 'this', 'parameter', 'this', 'study', 'is', 'expected', 'to', 'pertain', 'to', 'any', 'possible', 'implementation', 'of', 'the', 'quantum', 'jump', 'method']]
|
[-0.10479428354954841, 0.07824110335727431, -0.12073506665777187, 0.04716004690331198, -0.05687665420926499, -0.15674291528780393, 0.10774868051283898, 0.3474254907698047, -0.27489192219337033, -0.2850314968417646, 0.09909028411196659, -0.2211957411194334, -0.12680129505389806, 0.20726558882553053, -0.027243111491659467, 0.1421411103207846, 0.09261263745637345, 0.04878317544768963, -0.08653894739940629, -0.26856454834817167, 0.2738458250022056, 0.06428947289740401, 0.24865607130436265, 0.023108106733736943, 0.17420035081782512, -0.0168469091330902, 0.00923503714860702, -0.006240589848282386, -0.15508155846892266, 0.0955491982096312, 0.2047038929422899, 0.11387691509016619, 0.3287339995482138, -0.353237111444528, -0.1931964682895638, 0.12870650618261067, 0.12736517849511333, 0.1919089613900501, -0.00602261000550447, -0.27202174702317133, 0.07957040390227826, -0.16419044864953172, -0.167128074686138, -0.07574921101331711, -0.0349203779229096, 0.014093099470839513, -0.2692835380190185, 0.10550414237706941, 0.036978488042891236, 0.006848034002266976, -0.0017228700952338321, -0.07178222977233176, 0.020410798570825433, 0.09320120232616913, 0.022932344183981494, 0.028909107223533247, 0.12756899750924536, -0.10040566697716713, -0.13147100517336202, 0.35201396154505865, -0.03130417787564956, -0.240758384684842, 0.12927962595843995, -0.13498026736042634, -0.13011936803481408, 0.14917848505821002, 0.1405424191141311, 0.20718843107853008, -0.1467316026647328, 0.11831647683676257, -0.015018157499405195, 0.16467056740241656, -0.01838161947433742, -0.023798333442941005, 0.10880533602962993, 0.17468573044681426, 0.11343493841930616, 0.17555444987433755, -0.09880454907649938, -0.20927075224474775, -0.37327586248403, -0.21766294640897565, -0.23660537048613614, 0.03774850991345486, -0.11045100189013672, -0.22843391728606455, 0.385268835673983, 0.21479539999667654, 0.16895262257443094, 0.06832890071887143, 0.2989571729380333, 0.20175781606682291, 0.020540231287631452, 0.06016163984123541, 0.1643481305550917, 0.13611600711960725, 0.06873989090019343, -0.28142336643376975, 0.10598567416606357, 0.0822675604449243]
|
1,803.0859
|
Subgap states in two dimensional spectroscopy of unconventional
superconductors using graphene
|
The two-dimensional nature of graphene makes it an ideal platform to explore
proximity-induced unconventional planar superconductivity and the possibility
of topological superconductivity. Using Green's functions techniques, we study
the transport properties of a finite size ballistic graphene layer placed
between a normal state electrode and a graphene lead with proximity-induced
unconventional superconductivity. Our microscopic description of such a
junction allows us to consider the effect of edge states in the graphene layer
and the imperfect coupling to the electrodes. The tunnel conductance through
the junction and the spectral density of states feature a rich interplay
between graphene's edge states, interface bound states formed at the
graphene-superconductor junction, Fabry-P\'erot resonances originated from the
finite size of the graphene layer, and the characteristic Andreev surface
states of unconventional superconductors. Within our analytical formalism, we
identify the separate contribution from each of these subgap states to the
conductance and density of states. Our results show that graphene provides an
advisable tool to determine experimentally the pairing symmetry of
proximity-induced unconventional superconductivity.
|
cond-mat.mes-hall cond-mat.supr-con
|
the twodimensional nature of graphene makes it an ideal platform to explore proximityinduced unconventional planar superconductivity and the possibility of topological superconductivity using greens functions techniques we study the transport properties of a finite size ballistic graphene layer placed between a normal state electrode and a graphene lead with proximityinduced unconventional superconductivity our microscopic description of such a junction allows us to consider the effect of edge states in the graphene layer and the imperfect coupling to the electrodes the tunnel conductance through the junction and the spectral density of states feature a rich interplay between graphenes edge states interface bound states formed at the graphenesuperconductor junction fabryperot resonances originated from the finite size of the graphene layer and the characteristic andreev surface states of unconventional superconductors within our analytical formalism we identify the separate contribution from each of these subgap states to the conductance and density of states our results show that graphene provides an advisable tool to determine experimentally the pairing symmetry of proximityinduced unconventional superconductivity
|
[['the', 'twodimensional', 'nature', 'of', 'graphene', 'makes', 'it', 'an', 'ideal', 'platform', 'to', 'explore', 'proximityinduced', 'unconventional', 'planar', 'superconductivity', 'and', 'the', 'possibility', 'of', 'topological', 'superconductivity', 'using', 'greens', 'functions', 'techniques', 'we', 'study', 'the', 'transport', 'properties', 'of', 'a', 'finite', 'size', 'ballistic', 'graphene', 'layer', 'placed', 'between', 'a', 'normal', 'state', 'electrode', 'and', 'a', 'graphene', 'lead', 'with', 'proximityinduced', 'unconventional', 'superconductivity', 'our', 'microscopic', 'description', 'of', 'such', 'a', 'junction', 'allows', 'us', 'to', 'consider', 'the', 'effect', 'of', 'edge', 'states', 'in', 'the', 'graphene', 'layer', 'and', 'the', 'imperfect', 'coupling', 'to', 'the', 'electrodes', 'the', 'tunnel', 'conductance', 'through', 'the', 'junction', 'and', 'the', 'spectral', 'density', 'of', 'states', 'feature', 'a', 'rich', 'interplay', 'between', 'graphenes', 'edge', 'states', 'interface', 'bound', 'states', 'formed', 'at', 'the', 'graphenesuperconductor', 'junction', 'fabryperot', 'resonances', 'originated', 'from', 'the', 'finite', 'size', 'of', 'the', 'graphene', 'layer', 'and', 'the', 'characteristic', 'andreev', 'surface', 'states', 'of', 'unconventional', 'superconductors', 'within', 'our', 'analytical', 'formalism', 'we', 'identify', 'the', 'separate', 'contribution', 'from', 'each', 'of', 'these', 'subgap', 'states', 'to', 'the', 'conductance', 'and', 'density', 'of', 'states', 'our', 'results', 'show', 'that', 'graphene', 'provides', 'an', 'advisable', 'tool', 'to', 'determine', 'experimentally', 'the', 'pairing', 'symmetry', 'of', 'proximityinduced', 'unconventional', 'superconductivity']]
|
[-0.22347630637453958, 0.1509207593253883, -0.10723621868445272, 0.028787968951898318, -0.047861343316201656, -0.17840505606173315, 0.13350482118437954, 0.33390621486164274, -0.2693524983506428, -0.2678144931394075, -0.09454118342130512, -0.3253488742561569, -0.1525156711307188, 0.14142035461762653, 0.051863618567863125, 0.051683355715968424, -0.014588502365984909, -0.0811720727499397, -0.0677302404212588, -0.17748269599091837, 0.34919423155120705, -0.021978526681085072, 0.38653057082999676, 0.15302589424425692, 0.007098158563686801, -0.01377687297229256, 0.15006704525911205, 0.002245796273373777, -0.1631995525082987, 0.0882305814403004, 0.28966216597889016, -0.13792222000968954, 0.16979712849604853, -0.5321563525081036, -0.20122349325919503, -0.04469094104466161, 0.12465930072427173, 0.172287189605413, -0.05882878991819564, -0.33185828163654413, 0.06321771926775996, -0.15193881347797633, -0.14170775156179888, -0.031415056719976873, -0.023793458770905135, -0.07957482870274578, -0.21960389638219827, 0.055096523462062966, 0.04681737945620192, 0.03729182171602068, -0.04657695255653899, -0.1107544008510082, -0.10203602500786517, 0.07801746708684645, -0.007139920826635456, -0.026769947501764233, 0.1767074916318788, -0.1580823042341286, -0.12412346298861805, 0.2838500239720036, -0.04029669965772579, -0.10515722065992165, 0.21718466264151393, -0.1357612694597005, -0.00350389122918603, 0.10765475048503417, 0.10546033148143795, 0.07173558456789968, -0.13579158361868135, 0.09329593829464838, -0.046774752833048945, 0.14829181540352737, 0.04260778439735683, 0.13654775398996813, 0.2811098726399775, 0.21929766620243235, 0.08765878710186198, 0.1720472105104515, -0.14433446346360834, -0.016698279764525415, -0.2713270955608182, -0.2164056097461374, -0.23348392275788465, 0.07316756419493772, -0.038253842535119646, -0.2623956998300162, 0.476591642059031, 0.1719162767847246, 0.19988468857038588, -0.08247062120409239, 0.2430424715386748, 0.11638848805679507, 0.07513464045145415, 0.034397036876595975, 0.20194902367282858, 0.22358626184341984, 0.04809481704918047, -0.33643189108018606, 0.06933047505749744, -0.0030155593080313076]
|
1,803.08591
|
End-to-End Learning for the Deep Multivariate Probit Model
|
The multivariate probit model (MVP) is a popular classic model for studying
binary responses of multiple entities. Nevertheless, the computational
challenge of learning the MVP model, given that its likelihood involves
integrating over a multidimensional constrained space of latent variables,
significantly limits its application in practice. We propose a flexible deep
generalization of the classic MVP, the Deep Multivariate Probit Model (DMVP),
which is an end-to-end learning scheme that uses an efficient parallel sampling
process of the multivariate probit model to exploit GPU-boosted deep neural
networks. We present both theoretical and empirical analysis of the convergence
behavior of DMVP's sampling process with respect to the resolution of the
correlation structure. We provide convergence guarantees for DMVP and our
empirical analysis demonstrates the advantages of DMVP's sampling compared with
standard MCMC-based methods. We also show that when applied to multi-entity
modelling problems, which are natural DMVP applications, DMVP trains faster
than classical MVP, by at least an order of magnitude, captures rich
correlations among entities, and further improves the joint likelihood of
entities compared with several competitive models.
|
cs.LG stat.ML
|
the multivariate probit model mvp is a popular classic model for studying binary responses of multiple entities nevertheless the computational challenge of learning the mvp model given that its likelihood involves integrating over a multidimensional constrained space of latent variables significantly limits its application in practice we propose a flexible deep generalization of the classic mvp the deep multivariate probit model dmvp which is an endtoend learning scheme that uses an efficient parallel sampling process of the multivariate probit model to exploit gpuboosted deep neural networks we present both theoretical and empirical analysis of the convergence behavior of dmvps sampling process with respect to the resolution of the correlation structure we provide convergence guarantees for dmvp and our empirical analysis demonstrates the advantages of dmvps sampling compared with standard mcmcbased methods we also show that when applied to multientity modelling problems which are natural dmvp applications dmvp trains faster than classical mvp by at least an order of magnitude captures rich correlations among entities and further improves the joint likelihood of entities compared with several competitive models
|
[['the', 'multivariate', 'probit', 'model', 'mvp', 'is', 'a', 'popular', 'classic', 'model', 'for', 'studying', 'binary', 'responses', 'of', 'multiple', 'entities', 'nevertheless', 'the', 'computational', 'challenge', 'of', 'learning', 'the', 'mvp', 'model', 'given', 'that', 'its', 'likelihood', 'involves', 'integrating', 'over', 'a', 'multidimensional', 'constrained', 'space', 'of', 'latent', 'variables', 'significantly', 'limits', 'its', 'application', 'in', 'practice', 'we', 'propose', 'a', 'flexible', 'deep', 'generalization', 'of', 'the', 'classic', 'mvp', 'the', 'deep', 'multivariate', 'probit', 'model', 'dmvp', 'which', 'is', 'an', 'endtoend', 'learning', 'scheme', 'that', 'uses', 'an', 'efficient', 'parallel', 'sampling', 'process', 'of', 'the', 'multivariate', 'probit', 'model', 'to', 'exploit', 'gpuboosted', 'deep', 'neural', 'networks', 'we', 'present', 'both', 'theoretical', 'and', 'empirical', 'analysis', 'of', 'the', 'convergence', 'behavior', 'of', 'dmvps', 'sampling', 'process', 'with', 'respect', 'to', 'the', 'resolution', 'of', 'the', 'correlation', 'structure', 'we', 'provide', 'convergence', 'guarantees', 'for', 'dmvp', 'and', 'our', 'empirical', 'analysis', 'demonstrates', 'the', 'advantages', 'of', 'dmvps', 'sampling', 'compared', 'with', 'standard', 'mcmcbased', 'methods', 'we', 'also', 'show', 'that', 'when', 'applied', 'to', 'multientity', 'modelling', 'problems', 'which', 'are', 'natural', 'dmvp', 'applications', 'dmvp', 'trains', 'faster', 'than', 'classical', 'mvp', 'by', 'at', 'least', 'an', 'order', 'of', 'magnitude', 'captures', 'rich', 'correlations', 'among', 'entities', 'and', 'further', 'improves', 'the', 'joint', 'likelihood', 'of', 'entities', 'compared', 'with', 'several', 'competitive', 'models']]
|
[-0.03473937027584547, -0.029326810876604024, -0.11506791804360504, 0.1090765038082062, -0.0988987616702229, -0.14726566263988358, 0.03929036429042168, 0.4155840377869277, -0.2951354779003338, -0.2972032856721372, 0.06551669447029802, -0.2572479619505419, -0.1880231810520917, 0.20251847623082028, -0.08527602984077544, 0.09747864368261941, 0.09308836886380938, 0.01177556071870013, -0.06777498547399909, -0.2736666606265473, 0.26422440363682975, 0.08799433854395851, 0.33778636452163857, -0.047819881443062734, 0.15185040247562373, 0.035049544398448075, -0.05783345042620839, 0.0011795830781419023, -0.0745775809172583, 0.19035241675921769, 0.25759912102480953, 0.20195548236370087, 0.33401760108495965, -0.38746525458563336, -0.24990775010644875, 0.11118661041034321, 0.15326884454490894, 0.04807147659741385, 0.0016933899137309227, -0.27401876015302284, 0.04457423965521585, -0.18150903398021198, -0.03501060558215383, -0.14694623801664547, -0.06405882854496353, 0.04851397504125476, -0.3387892424458793, 0.10053785843088896, 0.0897047130481993, 0.05403197494420108, -0.019988118318958616, -0.1469860752166688, 0.052863306889107085, 0.07724220553983736, 0.06989880552516725, 0.02776517157560621, 0.07773751020431519, -0.16392278333258783, -0.16907022687928996, 0.3434361883428419, -0.06686775872844135, -0.19849826986419744, 0.21461656454939868, -0.041973755413923286, -0.1652262428877126, 0.10557368297488483, 0.2199261304547732, 0.10515946079976857, -0.15645510606923016, 0.03714143883486428, -0.049531411719454944, 0.17881743542999887, -0.004136153049874066, -0.03145535251034702, 0.14806510841115325, 0.2898688910772553, 0.05488774049545413, 0.14461611812377625, -0.12545348749089258, -0.1575334515401173, -0.2234571802770403, -0.12047718137759587, -0.17062907183714127, -0.054594816524942205, -0.17368961850306, -0.18102235859795207, 0.4030818793536577, 0.2220949718856451, 0.19965328352161865, 0.16860750327207918, 0.3246968247039222, 0.0933820505742915, 0.042072660878471946, 0.0892289146384888, 0.1560097749675517, 0.11226079823186985, 0.09455944795961674, -0.15871188624082241, 0.12158205425473807, 0.006458466096470754]
|
1,803.08592
|
The cosmic transparency measured with Type Ia supernovae: implications
for intergalactic dust
|
Observations of high-redshift Type Ia supernovae (SNe~Ia) are used to study
the cosmic transparency at optical wavelengths. Assuming a flat $\Lambda$CDM
cosmological model based on BAO and CMB results, redshift dependent deviations
of SN~Ia distances are used to constrain mechanisms that would dim light. The
analysis is based on the most recent Pantheon SN compilation, for which there
is a $0.03\pm0.01 {\textrm \,(\rm stat)}$ mag discrepancy in the distant
supernova distance moduli relative to the $\Lambda$CDM model anchored by
supernovae at $z<0.05$. While there are known systematic uncertainties that
combined could explain the observed offset, here we entertain the possibility
that the discrepancy may instead be explained by scattering of supernova light
in the intergalactic medium (IGM). We focus on two effects: Compton scattering
by free electrons and extinction by dust in the IGM. We find that if the
discrepancy is due entirely to dimming by dust, the measurements can be modeled
with a cosmic dust density $\Omega_{\rm IGM}^{\rm dust} = 8 \cdot 10^{-5}
(1+z)^{-1}$, corresponding to an average attenuation of $2\cdot 10^{-5}$ mag
Mpc$^{-1}$ in V-band. Forthcoming SN~Ia studies may provide a definitive
measurement of the IGM dust properties, while still providing an unbiased
estimate of cosmological parameters by introducing additional parameters in the
global fits to the observations.
|
astro-ph.CO
|
observations of highredshift type ia supernovae sneia are used to study the cosmic transparency at optical wavelengths assuming a flat lambdacdm cosmological model based on bao and cmb results redshift dependent deviations of snia distances are used to constrain mechanisms that would dim light the analysis is based on the most recent pantheon sn compilation for which there is a 003pm001 textrm rm stat mag discrepancy in the distant supernova distance moduli relative to the lambdacdm model anchored by supernovae at z005 while there are known systematic uncertainties that combined could explain the observed offset here we entertain the possibility that the discrepancy may instead be explained by scattering of supernova light in the intergalactic medium igm we focus on two effects compton scattering by free electrons and extinction by dust in the igm we find that if the discrepancy is due entirely to dimming by dust the measurements can be modeled with a cosmic dust density omega_rm igmrm dust 8 cdot 105 1z1 corresponding to an average attenuation of 2cdot 105 mag mpc1 in vband forthcoming snia studies may provide a definitive measurement of the igm dust properties while still providing an unbiased estimate of cosmological parameters by introducing additional parameters in the global fits to the observations
|
[['observations', 'of', 'highredshift', 'type', 'ia', 'supernovae', 'sneia', 'are', 'used', 'to', 'study', 'the', 'cosmic', 'transparency', 'at', 'optical', 'wavelengths', 'assuming', 'a', 'flat', 'lambdacdm', 'cosmological', 'model', 'based', 'on', 'bao', 'and', 'cmb', 'results', 'redshift', 'dependent', 'deviations', 'of', 'snia', 'distances', 'are', 'used', 'to', 'constrain', 'mechanisms', 'that', 'would', 'dim', 'light', 'the', 'analysis', 'is', 'based', 'on', 'the', 'most', 'recent', 'pantheon', 'sn', 'compilation', 'for', 'which', 'there', 'is', 'a', '003pm001', 'textrm', 'rm', 'stat', 'mag', 'discrepancy', 'in', 'the', 'distant', 'supernova', 'distance', 'moduli', 'relative', 'to', 'the', 'lambdacdm', 'model', 'anchored', 'by', 'supernovae', 'at', 'z005', 'while', 'there', 'are', 'known', 'systematic', 'uncertainties', 'that', 'combined', 'could', 'explain', 'the', 'observed', 'offset', 'here', 'we', 'entertain', 'the', 'possibility', 'that', 'the', 'discrepancy', 'may', 'instead', 'be', 'explained', 'by', 'scattering', 'of', 'supernova', 'light', 'in', 'the', 'intergalactic', 'medium', 'igm', 'we', 'focus', 'on', 'two', 'effects', 'compton', 'scattering', 'by', 'free', 'electrons', 'and', 'extinction', 'by', 'dust', 'in', 'the', 'igm', 'we', 'find', 'that', 'if', 'the', 'discrepancy', 'is', 'due', 'entirely', 'to', 'dimming', 'by', 'dust', 'the', 'measurements', 'can', 'be', 'modeled', 'with', 'a', 'cosmic', 'dust', 'density', 'omega_rm', 'igmrm', 'dust', '8', 'cdot', '105', '1z1', 'corresponding', 'to', 'an', 'average', 'attenuation', 'of', '2cdot', '105', 'mag', 'mpc1', 'in', 'vband', 'forthcoming', 'snia', 'studies', 'may', 'provide', 'a', 'definitive', 'measurement', 'of', 'the', 'igm', 'dust', 'properties', 'while', 'still', 'providing', 'an', 'unbiased', 'estimate', 'of', 'cosmological', 'parameters', 'by', 'introducing', 'additional', 'parameters', 'in', 'the', 'global', 'fits', 'to', 'the', 'observations']]
|
[-0.04696652773110635, 0.14781174101811373, -0.05478618150272478, 0.1433258653800854, -0.11604755918289392, -0.08316067063088457, 0.042829353109342404, 0.411897795382314, -0.202447755220279, -0.3021908903090382, 0.039901893815952535, -0.3225703707161861, 0.013198642889479882, 0.21060444197904032, -0.03708559539525315, -0.029689745717265535, 0.03894689015970261, -0.1367253787252244, -0.047086622148946426, -0.3092451713970289, 0.2817851063882699, 0.13417578136012218, 0.20745053515733722, -0.008880178559383448, 0.06231220609221894, -0.10430625097964927, -0.1178676345578144, -0.013578918231919838, -0.21600433135063213, 0.05312174659635415, 0.21496290512690253, 0.13854005388566293, 0.16974942670024645, -0.3737043506922558, -0.27455340382025145, 0.1443333919926842, 0.18978304265272947, 0.08930577296492768, -0.020207828850498818, -0.26497890671956925, 0.0417552092051035, -0.13149063057566168, -0.14359251864236564, 0.07567737818373224, 0.019060623592500072, -0.028395831258631706, -0.24658554215476705, 0.19168794479964374, -0.042518495250533306, 0.047130911418487534, -0.08088241084232532, -0.09482008789815993, -0.025982869538263634, -0.008670185948106406, 0.03021515675153261, 0.07544074679362194, 0.13398983803982936, -0.1146018849999214, -0.01632020636819876, 0.43933399596706013, -0.12671657400978104, -0.021792733253767856, 0.12679360652020058, -0.18773528970912315, -0.12353956602209319, 0.11886484346065956, 0.1449968135029149, 0.007421923096094711, -0.19238833478168368, 0.04486721486710639, -0.0006494725043571984, 0.22947125428226384, 0.050477420136583254, 0.04732097874882758, 0.2969740593196967, 0.12007636092424107, 0.013696086999306526, 0.003129830332069944, -0.18121326371021076, 0.07239700675619623, -0.31018960984063315, -0.05296417388420265, -0.15026667738633337, 0.16863290146004425, -0.19109418115658627, -0.09757948770633308, 0.28232130507687825, 0.15641495932896549, 0.2527136687690822, 0.04124530376765716, 0.31029705924559564, 0.04727462080896098, 0.06805272707088779, 0.10127452503701743, 0.374294483810305, 0.16614898879421303, 0.051597523144804515, -0.22074984464919767, 0.11103831645148322, 0.010972344290516607]
|
1,803.08593
|
Stochastic and variational approach to finite difference approximation
of Hamilton-Jacobi equations
|
The author presented a stochastic and variational approach to the
Lax-Friedrichs finite difference scheme applied to hyperbolic scalar
conservation laws and the corresponding Hamilton-Jacobi equations with convex
and superlinear Hamiltonians in the one-dimensional periodic setting, showing
new results on the stability and convergence of the scheme [Soga, Math. Comp.
(2015)]. In the current paper, we extend these results to the higher
dimensional setting. Our framework with a deterministic scheme provides
approximation of viscosity solutions of Hamilton-Jacobi equations, their
spatial derivatives and the backward characteristic curves at the same time,
within an arbitrary time interval. The proof is based on stochastic calculus of
variations with random walks; a priori boundedness of minimizers of the
variational problems that verifies a CFL type stability condition; the law of
large numbers for random walks under the hyperbolic scaling limit. Convergence
of approximation and the rate of convergence are obtained in terms of
probability theory. The idea is reminiscent of the stochastic and variational
approach to the vanishing viscosity method introduced in [Fleming, J. Differ.
Eqs (1969)].
|
math.NA math.AP
|
the author presented a stochastic and variational approach to the laxfriedrichs finite difference scheme applied to hyperbolic scalar conservation laws and the corresponding hamiltonjacobi equations with convex and superlinear hamiltonians in the onedimensional periodic setting showing new results on the stability and convergence of the scheme soga math comp 2015 in the current paper we extend these results to the higher dimensional setting our framework with a deterministic scheme provides approximation of viscosity solutions of hamiltonjacobi equations their spatial derivatives and the backward characteristic curves at the same time within an arbitrary time interval the proof is based on stochastic calculus of variations with random walks a priori boundedness of minimizers of the variational problems that verifies a cfl type stability condition the law of large numbers for random walks under the hyperbolic scaling limit convergence of approximation and the rate of convergence are obtained in terms of probability theory the idea is reminiscent of the stochastic and variational approach to the vanishing viscosity method introduced in fleming j differ eqs 1969
|
[['the', 'author', 'presented', 'a', 'stochastic', 'and', 'variational', 'approach', 'to', 'the', 'laxfriedrichs', 'finite', 'difference', 'scheme', 'applied', 'to', 'hyperbolic', 'scalar', 'conservation', 'laws', 'and', 'the', 'corresponding', 'hamiltonjacobi', 'equations', 'with', 'convex', 'and', 'superlinear', 'hamiltonians', 'in', 'the', 'onedimensional', 'periodic', 'setting', 'showing', 'new', 'results', 'on', 'the', 'stability', 'and', 'convergence', 'of', 'the', 'scheme', 'soga', 'math', 'comp', '2015', 'in', 'the', 'current', 'paper', 'we', 'extend', 'these', 'results', 'to', 'the', 'higher', 'dimensional', 'setting', 'our', 'framework', 'with', 'a', 'deterministic', 'scheme', 'provides', 'approximation', 'of', 'viscosity', 'solutions', 'of', 'hamiltonjacobi', 'equations', 'their', 'spatial', 'derivatives', 'and', 'the', 'backward', 'characteristic', 'curves', 'at', 'the', 'same', 'time', 'within', 'an', 'arbitrary', 'time', 'interval', 'the', 'proof', 'is', 'based', 'on', 'stochastic', 'calculus', 'of', 'variations', 'with', 'random', 'walks', 'a', 'priori', 'boundedness', 'of', 'minimizers', 'of', 'the', 'variational', 'problems', 'that', 'verifies', 'a', 'cfl', 'type', 'stability', 'condition', 'the', 'law', 'of', 'large', 'numbers', 'for', 'random', 'walks', 'under', 'the', 'hyperbolic', 'scaling', 'limit', 'convergence', 'of', 'approximation', 'and', 'the', 'rate', 'of', 'convergence', 'are', 'obtained', 'in', 'terms', 'of', 'probability', 'theory', 'the', 'idea', 'is', 'reminiscent', 'of', 'the', 'stochastic', 'and', 'variational', 'approach', 'to', 'the', 'vanishing', 'viscosity', 'method', 'introduced', 'in', 'fleming', 'j', 'differ', 'eqs', '1969']]
|
[-0.1342015642405907, 0.052640283523942344, -0.12314734284150583, 0.058758248532822695, -0.07054596146764724, -0.11711928454276763, 0.06684772571554266, 0.2795135779796462, -0.2828591728136379, -0.2664758848068604, 0.0959792213469515, -0.2383248362668425, -0.135276967188485, 0.1856857306481889, -0.10319554921217829, 0.12477075079985628, 0.04318476525783452, -0.01684720200018097, -0.08404248836041804, -0.2757193247776762, 0.3104318137367784, -0.006574432139573564, 0.29177247108677157, 0.03659305993123089, 0.15271760290352443, -0.007530761024865665, -0.02893067653187447, 0.04225623229660137, -0.16366752961600964, 0.1189623982591108, 0.20335979179590832, 0.04369066048846498, 0.30558505546225356, -0.3959509135055089, -0.20222713855471006, 0.08371068951701037, 0.09862605829832786, 0.0994468027350019, -0.008941523236500328, -0.30547765926975345, 0.09554785043743237, -0.12339787656299726, -0.18878560488409096, -0.07641338386534773, -0.0004437506492984922, 0.10409119320564975, -0.29303637165467294, 0.1402033967107578, 0.11903704895381952, 0.05048525659639758, -0.10225318237725231, -0.07712924047999563, 0.005701214515560508, 0.039008064977062204, 0.06443836004609427, -0.00034306212791312507, 0.05023553076728481, -0.060430937888359786, -0.1437058669456406, 0.35406055845516293, -0.09346960812442179, -0.26211048784251845, 0.18075584010384455, -0.13076012420920077, -0.1394483217974983, 0.135254308223256, 0.17905732013328732, 0.1910324563303018, -0.13502992423011634, 0.14148334520548986, -0.03384169803561959, 0.10336729180873154, 0.08925090273106961, 0.004181030899427875, 0.0430625725118171, 0.12703236013280544, 0.13158710577596, 0.10108891826964457, -0.02360176388446612, -0.20700343387277678, -0.35319249997220453, -0.14911349588863507, -0.1813779968158369, 0.05409062612387869, -0.1432322024890087, -0.17334074985061648, 0.3687055840231051, 0.11699925485980692, 0.12953297988299214, 0.15369823931754506, 0.24076669126591096, 0.21427192233573666, -0.026934820269534025, 0.11130445732936611, 0.20123497519658454, 0.2123807123385653, 0.16294053356076063, -0.22175005911468196, 0.026605956329915085, 0.20665719931977883]
|
1,803.08594
|
Propagative and diffusive regimes of acoustic damping in bulk amorphous
material
|
In amorphous solids, a non-negligible part of thermal conductivity results
from phonon scattering on the structural disorder. The conversion of acoustic
energy into thermal energy is often measured by the Dynamical Structure Factor
(DSF) thanks to inelastic neutron or X-Ray scattering. The DSF is used to
quantify the dispersion relation of phonons, together with their damping.
However, the connection of the dynamical structure factor with dynamical
attenuation of wave packets in glasses is still a matter of debate. We focus
here on the analysis of wave packets propagation in numerical models of
amorphous silicon. We show that the DHO fits (Damped Harmonic Oscillator model)
of the dynamical structure factors give a good estimate of the wave packets
mean-free path, only below the Ioffe-Regel limit. Above the Ioffe-Regel limit
and below the mobility edge, a pure diffusive regime without a definite mean
free path is observed. The high-frequency mobility edge is characteristic of a
transition to localized vibrations. Below the Ioffe-Regel criterion, a mixed
regime is evidenced at intermediate frequencies, with a coexistence of
propagative and diffusive wave fronts. The transition between these different
regimes is analyzed in details and reveals a complex dynamics for energy
transportation, thus raising the question of the correct modeling of thermal
transport in amorphous materials.
|
cond-mat.dis-nn
|
in amorphous solids a nonnegligible part of thermal conductivity results from phonon scattering on the structural disorder the conversion of acoustic energy into thermal energy is often measured by the dynamical structure factor dsf thanks to inelastic neutron or xray scattering the dsf is used to quantify the dispersion relation of phonons together with their damping however the connection of the dynamical structure factor with dynamical attenuation of wave packets in glasses is still a matter of debate we focus here on the analysis of wave packets propagation in numerical models of amorphous silicon we show that the dho fits damped harmonic oscillator model of the dynamical structure factors give a good estimate of the wave packets meanfree path only below the iofferegel limit above the iofferegel limit and below the mobility edge a pure diffusive regime without a definite mean free path is observed the highfrequency mobility edge is characteristic of a transition to localized vibrations below the iofferegel criterion a mixed regime is evidenced at intermediate frequencies with a coexistence of propagative and diffusive wave fronts the transition between these different regimes is analyzed in details and reveals a complex dynamics for energy transportation thus raising the question of the correct modeling of thermal transport in amorphous materials
|
[['in', 'amorphous', 'solids', 'a', 'nonnegligible', 'part', 'of', 'thermal', 'conductivity', 'results', 'from', 'phonon', 'scattering', 'on', 'the', 'structural', 'disorder', 'the', 'conversion', 'of', 'acoustic', 'energy', 'into', 'thermal', 'energy', 'is', 'often', 'measured', 'by', 'the', 'dynamical', 'structure', 'factor', 'dsf', 'thanks', 'to', 'inelastic', 'neutron', 'or', 'xray', 'scattering', 'the', 'dsf', 'is', 'used', 'to', 'quantify', 'the', 'dispersion', 'relation', 'of', 'phonons', 'together', 'with', 'their', 'damping', 'however', 'the', 'connection', 'of', 'the', 'dynamical', 'structure', 'factor', 'with', 'dynamical', 'attenuation', 'of', 'wave', 'packets', 'in', 'glasses', 'is', 'still', 'a', 'matter', 'of', 'debate', 'we', 'focus', 'here', 'on', 'the', 'analysis', 'of', 'wave', 'packets', 'propagation', 'in', 'numerical', 'models', 'of', 'amorphous', 'silicon', 'we', 'show', 'that', 'the', 'dho', 'fits', 'damped', 'harmonic', 'oscillator', 'model', 'of', 'the', 'dynamical', 'structure', 'factors', 'give', 'a', 'good', 'estimate', 'of', 'the', 'wave', 'packets', 'meanfree', 'path', 'only', 'below', 'the', 'iofferegel', 'limit', 'above', 'the', 'iofferegel', 'limit', 'and', 'below', 'the', 'mobility', 'edge', 'a', 'pure', 'diffusive', 'regime', 'without', 'a', 'definite', 'mean', 'free', 'path', 'is', 'observed', 'the', 'highfrequency', 'mobility', 'edge', 'is', 'characteristic', 'of', 'a', 'transition', 'to', 'localized', 'vibrations', 'below', 'the', 'iofferegel', 'criterion', 'a', 'mixed', 'regime', 'is', 'evidenced', 'at', 'intermediate', 'frequencies', 'with', 'a', 'coexistence', 'of', 'propagative', 'and', 'diffusive', 'wave', 'fronts', 'the', 'transition', 'between', 'these', 'different', 'regimes', 'is', 'analyzed', 'in', 'details', 'and', 'reveals', 'a', 'complex', 'dynamics', 'for', 'energy', 'transportation', 'thus', 'raising', 'the', 'question', 'of', 'the', 'correct', 'modeling', 'of', 'thermal', 'transport', 'in', 'amorphous', 'materials']]
|
[-0.17056951197972964, 0.2282175006189694, -0.08700589183496223, 0.06309806722149786, -0.03870191831097362, -0.0902106894512101, 0.07377787380967112, 0.35865569111137163, -0.2921501529580426, -0.25154068469557733, 0.04911134077452256, -0.31923016214388467, -0.13563230411132932, 0.1685640470878709, 0.054402517058908764, 0.05347560040120568, 0.019328084608007754, 0.010350933613344318, -0.04723747119950574, -0.12041627609758593, 0.30176948916965296, 0.0681007516171251, 0.31813049352328693, 0.07683529768837616, 0.06901114845888862, 0.011523952766410297, 0.030284695054537483, -0.0013723138891648325, -0.1605820463340067, 0.05047305750000911, 0.24330635936121758, -0.03969941117490331, 0.22475414768726165, -0.4301486983983999, -0.29294746047595427, 0.027522720349952578, 0.14195196852420588, 0.11614803491933604, -0.008798936809900971, -0.23301958434638523, 0.02497961165693899, -0.12024372410406137, -0.15191167268148137, -0.022197501844770852, 0.02734535815127726, 0.012704891184118121, -0.21657313465645225, 0.16294349008627856, 0.06616014124371022, 0.03484011090671023, -0.11035370165703907, -0.08194335327882851, -0.0601717319672129, 0.07889389796515128, 0.03881699584612978, -0.012233202365626182, 0.15841456711336616, -0.1663857313516062, -0.06485506010884863, 0.3963329992656197, -0.06361066374284703, -0.11305895076975936, 0.19752619193999896, -0.1798909208142764, -0.05025701745679336, 0.22240253318810746, 0.1626170465523111, 0.04874025879183873, -0.13761780441550184, 0.03876574387069836, -0.004842015925428963, 0.18244289007769632, 0.07385398733340913, 0.0746754355490252, 0.21491981817477304, 0.2223585524795843, 0.01638846590760208, 0.12483753441650021, -0.09758755357858415, -0.05538634528915974, -0.26246004028556247, -0.12323301772010468, -0.2073723757938881, 0.09097842684686405, -0.08720805938889195, -0.17918942806870855, 0.3932819186643298, 0.12306229841778986, 0.18678739309266565, 0.030772706514800942, 0.28184686638359424, 0.1814159694682097, 0.024437378643501904, 0.07059430357822705, 0.2863579208618917, 0.18569475810952663, 0.0964086380099789, -0.27892478639149065, 0.044663636189042816, 0.008800135958673698]
|
1,803.08595
|
Calculating normal tissue complication probabilities and probabilities
of complication-free tumour control from stochastic models of population
dynamics
|
We use a stochastic birth-death model for a population of cells to estimate
the normal tissue complication probability (NTCP) under a particular
radiotherapy protocol. We specifically allow for interaction between cells, via
a nonlinear logistic growth model. To capture some of the effects of intrinsic
noise in the population we develop several approximations of NTCP, using
Kramers-Moyal expansion techniques. These approaches provide an approximation
to the first and second moments of a general first-passage time problem in the
limit of large, but finite populations. We use this method to study NTCP in a
simple model of normal cells and in a model of normal and damaged cells. We
also study a combined model of normal tissue cells and tumour cells. Based on
existing methods to calculate tumour control probabilities, and our procedure
to approximate NTCP, we estimate the probability of complication free tumour
control.
|
q-bio.PE cond-mat.stat-mech q-bio.TO
|
we use a stochastic birthdeath model for a population of cells to estimate the normal tissue complication probability ntcp under a particular radiotherapy protocol we specifically allow for interaction between cells via a nonlinear logistic growth model to capture some of the effects of intrinsic noise in the population we develop several approximations of ntcp using kramersmoyal expansion techniques these approaches provide an approximation to the first and second moments of a general firstpassage time problem in the limit of large but finite populations we use this method to study ntcp in a simple model of normal cells and in a model of normal and damaged cells we also study a combined model of normal tissue cells and tumour cells based on existing methods to calculate tumour control probabilities and our procedure to approximate ntcp we estimate the probability of complication free tumour control
|
[['we', 'use', 'a', 'stochastic', 'birthdeath', 'model', 'for', 'a', 'population', 'of', 'cells', 'to', 'estimate', 'the', 'normal', 'tissue', 'complication', 'probability', 'ntcp', 'under', 'a', 'particular', 'radiotherapy', 'protocol', 'we', 'specifically', 'allow', 'for', 'interaction', 'between', 'cells', 'via', 'a', 'nonlinear', 'logistic', 'growth', 'model', 'to', 'capture', 'some', 'of', 'the', 'effects', 'of', 'intrinsic', 'noise', 'in', 'the', 'population', 'we', 'develop', 'several', 'approximations', 'of', 'ntcp', 'using', 'kramersmoyal', 'expansion', 'techniques', 'these', 'approaches', 'provide', 'an', 'approximation', 'to', 'the', 'first', 'and', 'second', 'moments', 'of', 'a', 'general', 'firstpassage', 'time', 'problem', 'in', 'the', 'limit', 'of', 'large', 'but', 'finite', 'populations', 'we', 'use', 'this', 'method', 'to', 'study', 'ntcp', 'in', 'a', 'simple', 'model', 'of', 'normal', 'cells', 'and', 'in', 'a', 'model', 'of', 'normal', 'and', 'damaged', 'cells', 'we', 'also', 'study', 'a', 'combined', 'model', 'of', 'normal', 'tissue', 'cells', 'and', 'tumour', 'cells', 'based', 'on', 'existing', 'methods', 'to', 'calculate', 'tumour', 'control', 'probabilities', 'and', 'our', 'procedure', 'to', 'approximate', 'ntcp', 'we', 'estimate', 'the', 'probability', 'of', 'complication', 'free', 'tumour', 'control']]
|
[-0.014021043858115768, 0.051976394041755865, -0.07860671819071285, 0.09924642044885938, -0.03260792118574803, -0.11871472559222537, 0.1342412099733742, 0.3741497348948744, -0.24797394150583488, -0.2241205720541378, 0.0774048760423385, -0.24910520796482968, -0.20711784973860226, 0.17394659415812283, -0.11767782222725348, 0.046506400646952294, 0.03305032013061767, 0.010269850405368035, -0.014380622237998372, -0.21411888770267573, 0.2720123179153436, -0.002977826968870229, 0.293409184488054, -0.009424837883772044, 0.15242024761715178, -0.006362700602039695, -0.011143080081738945, 0.019363422706697345, -0.16416248856936969, 0.16129637210704256, 0.2163438758373862, 0.13895394549924983, 0.32113160508581334, -0.5011174656554229, -0.23178411109579933, 0.1378600954764503, 0.14118140893596218, 0.1710420262404821, -0.033890082259151515, -0.21647787953649336, 0.061032106782982334, -0.19194581533601093, -0.13841179115580518, -0.06733445070373516, -0.04094286292739627, 0.0439940897489982, -0.33330596692394465, 0.13257514387866345, 0.04097572548198514, 0.034259687371862434, -0.10199641095419389, -0.08095205711611521, 0.03845728726203864, 0.1617791970800479, 0.04580393213675254, -0.03325215153179468, 0.13251573792917448, -0.14541695614631558, -0.09785004691042963, 0.32516057423910955, -0.03613616774641236, -0.2452994257134075, 0.17411028550810037, -0.16403086936204797, -0.10230454966141325, 0.1276119766666347, 0.2420492675478777, 0.1293643482996332, -0.20469860370697765, 0.03243435224794666, 0.022712843799834244, 0.13843156451669833, 0.03739804135532015, -0.055872171827407634, 0.1039934587736045, 0.227963146823135, 0.0315431077291982, 0.10889573214808479, -0.13374927431222103, -0.07258152492189159, -0.26447630647776854, -0.17606922722835508, -0.10482076470119257, 0.023640934710985877, -0.10950917397096621, -0.23924256451492612, 0.4025074533549034, 0.16250774741315077, 0.17992654379243808, 0.10452780689552633, 0.3104040489997715, 0.10086375798709923, 0.031789257905782305, -0.005774981567002315, 0.13883599632976662, 0.15139841670881854, 0.01829146659939498, -0.2524552152230576, 0.1094545366375112, 0.07215628386216445]
|
1,803.08596
|
Hidden correlation between absorption peaks in achiral carbon nanotubes
and nanoribbons
|
In this paper we study the effect of absorption peak correlation in finite
length carbon nanotubes and graphene nanoribbons. It is shown, in the
orthogonal {\pi}-orbital tight-binding model with the nearest neighbor
approximation, that if the ribbon width is a half of the tube circumference the
effect takes place for all achiral ribbons (zigzag, armchair and bearded), and
corresponding tubes, starting from lengths of about 30 nm. This correlation
should be useful in designing nanoribbon-based optoelectronics devices fully
integrated into a single layer of graphene.
|
cond-mat.mes-hall
|
in this paper we study the effect of absorption peak correlation in finite length carbon nanotubes and graphene nanoribbons it is shown in the orthogonal piorbital tightbinding model with the nearest neighbor approximation that if the ribbon width is a half of the tube circumference the effect takes place for all achiral ribbons zigzag armchair and bearded and corresponding tubes starting from lengths of about 30 nm this correlation should be useful in designing nanoribbonbased optoelectronics devices fully integrated into a single layer of graphene
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'effect', 'of', 'absorption', 'peak', 'correlation', 'in', 'finite', 'length', 'carbon', 'nanotubes', 'and', 'graphene', 'nanoribbons', 'it', 'is', 'shown', 'in', 'the', 'orthogonal', 'piorbital', 'tightbinding', 'model', 'with', 'the', 'nearest', 'neighbor', 'approximation', 'that', 'if', 'the', 'ribbon', 'width', 'is', 'a', 'half', 'of', 'the', 'tube', 'circumference', 'the', 'effect', 'takes', 'place', 'for', 'all', 'achiral', 'ribbons', 'zigzag', 'armchair', 'and', 'bearded', 'and', 'corresponding', 'tubes', 'starting', 'from', 'lengths', 'of', 'about', '30', 'nm', 'this', 'correlation', 'should', 'be', 'useful', 'in', 'designing', 'nanoribbonbased', 'optoelectronics', 'devices', 'fully', 'integrated', 'into', 'a', 'single', 'layer', 'of', 'graphene']]
|
[-0.17454364604234476, 0.13627204568166396, -0.006668366678059101, 0.01667217660750098, -0.008900336997227415, -0.18734314130509602, 0.041666478303480234, 0.538229898231871, -0.2647108247996691, -0.2364582791157505, 0.014777675610693063, -0.3018960364162922, -0.13031233969856712, 0.12818922869696775, 0.06220783720559934, 0.01712577326551956, 0.09568894005873624, -0.04644357686971917, -0.04762508243267589, -0.19687191238079002, 0.1863435784354806, 0.03416834511958501, 0.3392613699659705, 0.1352095041259685, 0.0006242205060141928, 0.06007832322160111, 0.10560412101776284, 0.055561485426390875, -0.14463202814504791, 0.10571427083135966, 0.20247766364584951, -0.13789386885131108, 0.23546744850738083, -0.49024090705549017, -0.16756505628856008, -0.0011875820839229753, 0.1878634784863714, 0.1333525337443194, 0.02437938595779569, -0.24781339450136702, 0.12641117639346597, -0.11675023412989342, -0.10984697709363364, 0.09150427876122515, 0.07483233632519841, -0.03107312053496785, -0.20202270220307744, 0.04269193620694911, 0.06183645022307139, 0.0431202355060069, -0.04983249112693182, -0.15866914883475094, -0.08204405921347001, 0.08234691097236732, -0.006876184343469932, 0.008529263999148764, 0.18587486433303532, -0.07601711378597162, -0.0916238758041907, 0.41185119239722984, -0.05395610209225732, -0.12108978170024998, 0.06985304451766698, -0.15581570671433034, -0.06050259560237036, 0.16642865064855228, 0.10376704156617908, 0.09241644424550674, -0.167606728633537, 0.06722817708916196, -0.054632008459199875, 0.14792717460762053, 0.1102953368688331, 0.08445238215191399, 0.28639420568943025, 0.2138518302317928, 0.06727781955097967, 0.17803986209362527, -0.15186366144677296, -0.020470843831186785, -0.23453442025518811, -0.19255013588870712, -0.17488090937053236, 0.09075216213789056, -0.09642165376589058, -0.23587405278504936, 0.44603798068402445, 0.13648448898730908, 0.17245093524894295, 0.022120698952280422, 0.24022629708051682, 0.11074003333992818, 0.13604025619433208, 0.03309222202857628, 0.23043629233999288, 0.1934493321336477, 0.08031301644137677, -0.18367589636815382, 0.0320155995514463, 0.03214974940535339]
|
1,803.08597
|
Doping evolution of charge and spin excitations in two-leg Hubbard
ladders: comparing DMRG and RPA+FLEX results
|
We study the magnetic and charge dynamical response of a Hubbard model in a
two-leg ladder geometry using the density matrix renormalization group (DMRG)
method and the random phase approximation within the fluctuation-exchange
approximation (RPA+FLEX). Our calculations reveal that RPA+FLEX can capture the
main features of the magnetic response from weak up to intermediate Hubbard
repulsion for doped ladders, when compared with the numerically exact DMRG
results. However, while at weak Hubbard repulsion both the spin and charge
spectra can be understood in terms of weakly-interacting electron-hole
excitations across the Fermi surface, at intermediate coupling DMRG shows
gapped spin excitations at large momentum transfer that remain gapless within
the RPA+FLEX approximation. For the charge response, RPA+FLEX can only
reproduce the main features of the DMRG spectra at weak coupling and high
doping levels, while it shows an incoherent character away from this limit.
Overall, our analysis shows that RPA+FLEX works surprisingly well for spin
excitations at weak and intermediate Hubbard $U$ values even in the difficult
low-dimensional geometry such as a two-leg ladder. Finally, we discuss the
implications of our results for neutron scattering and resonant inelastic x-ray
scattering experiments on two-leg ladder cuprate compounds.
|
cond-mat.str-el cond-mat.supr-con
|
we study the magnetic and charge dynamical response of a hubbard model in a twoleg ladder geometry using the density matrix renormalization group dmrg method and the random phase approximation within the fluctuationexchange approximation rpaflex our calculations reveal that rpaflex can capture the main features of the magnetic response from weak up to intermediate hubbard repulsion for doped ladders when compared with the numerically exact dmrg results however while at weak hubbard repulsion both the spin and charge spectra can be understood in terms of weaklyinteracting electronhole excitations across the fermi surface at intermediate coupling dmrg shows gapped spin excitations at large momentum transfer that remain gapless within the rpaflex approximation for the charge response rpaflex can only reproduce the main features of the dmrg spectra at weak coupling and high doping levels while it shows an incoherent character away from this limit overall our analysis shows that rpaflex works surprisingly well for spin excitations at weak and intermediate hubbard u values even in the difficult lowdimensional geometry such as a twoleg ladder finally we discuss the implications of our results for neutron scattering and resonant inelastic xray scattering experiments on twoleg ladder cuprate compounds
|
[['we', 'study', 'the', 'magnetic', 'and', 'charge', 'dynamical', 'response', 'of', 'a', 'hubbard', 'model', 'in', 'a', 'twoleg', 'ladder', 'geometry', 'using', 'the', 'density', 'matrix', 'renormalization', 'group', 'dmrg', 'method', 'and', 'the', 'random', 'phase', 'approximation', 'within', 'the', 'fluctuationexchange', 'approximation', 'rpaflex', 'our', 'calculations', 'reveal', 'that', 'rpaflex', 'can', 'capture', 'the', 'main', 'features', 'of', 'the', 'magnetic', 'response', 'from', 'weak', 'up', 'to', 'intermediate', 'hubbard', 'repulsion', 'for', 'doped', 'ladders', 'when', 'compared', 'with', 'the', 'numerically', 'exact', 'dmrg', 'results', 'however', 'while', 'at', 'weak', 'hubbard', 'repulsion', 'both', 'the', 'spin', 'and', 'charge', 'spectra', 'can', 'be', 'understood', 'in', 'terms', 'of', 'weaklyinteracting', 'electronhole', 'excitations', 'across', 'the', 'fermi', 'surface', 'at', 'intermediate', 'coupling', 'dmrg', 'shows', 'gapped', 'spin', 'excitations', 'at', 'large', 'momentum', 'transfer', 'that', 'remain', 'gapless', 'within', 'the', 'rpaflex', 'approximation', 'for', 'the', 'charge', 'response', 'rpaflex', 'can', 'only', 'reproduce', 'the', 'main', 'features', 'of', 'the', 'dmrg', 'spectra', 'at', 'weak', 'coupling', 'and', 'high', 'doping', 'levels', 'while', 'it', 'shows', 'an', 'incoherent', 'character', 'away', 'from', 'this', 'limit', 'overall', 'our', 'analysis', 'shows', 'that', 'rpaflex', 'works', 'surprisingly', 'well', 'for', 'spin', 'excitations', 'at', 'weak', 'and', 'intermediate', 'hubbard', 'u', 'values', 'even', 'in', 'the', 'difficult', 'lowdimensional', 'geometry', 'such', 'as', 'a', 'twoleg', 'ladder', 'finally', 'we', 'discuss', 'the', 'implications', 'of', 'our', 'results', 'for', 'neutron', 'scattering', 'and', 'resonant', 'inelastic', 'xray', 'scattering', 'experiments', 'on', 'twoleg', 'ladder', 'cuprate', 'compounds']]
|
[-0.12766639064066113, 0.1818919324752642, -0.0414414211603192, 0.11145360267733057, 0.013184880853320162, -0.13717716578931477, 0.08813665367615146, 0.3915766287308473, -0.24633277142659213, -0.24447609627476105, 0.0008475449300394991, -0.36270656673094404, -0.11390573405530095, 0.15972660827280308, 0.11312741798062165, -0.004524388272264519, 0.02338816330839808, -0.022156223746685265, -0.159534446336329, -0.20849415035571348, 0.2802843897436292, 0.03315112183276468, 0.28816001787781714, 0.12169919970851296, 0.03183923227569232, 0.07799480280313545, 0.12571314573049164, 0.013858407602096215, -0.09655593890657213, 0.026367638827277683, 0.30621722780812816, -0.12647042992548682, 0.16676478950927656, -0.43315270650081145, -0.20499804196640467, -0.04947320744992258, 0.2010118923555964, 0.18685799923797067, -0.04165420611329281, -0.3111120025937756, 0.005623972712036891, -0.2242792594891328, -0.13583368248282335, -0.17285517945240897, -0.04573933069522564, 0.013307319447780267, -0.24575089876754927, 0.13134713033333612, 0.041984322283100575, 0.0515498319076216, -0.10472528445653809, -0.12141433415862803, -0.0612643505888394, 0.07889666206707867, 0.06098121715148386, 0.041489123420503274, 0.12053591258441791, -0.14563220757871675, -0.08309901190491822, 0.3323600196810917, -0.09263199783760147, -0.10956269627771316, 0.2001772628285182, -0.20084386334682885, -0.13386596590758135, 0.1522328655116069, 0.07520208835440616, 0.07680669956339094, -0.11599571143600863, 0.14482840589092424, -0.05443074064006886, 0.20477039956320556, -0.009953950468498545, 0.07890432841944485, 0.22451693809662873, 0.18684966865724, 0.04780200316499059, 0.10993493746381063, -0.13698228813397387, -0.09512767549723578, -0.24309838521891297, -0.06586416542040519, -0.237727694448609, 0.05200579572224225, -0.09875515563703047, -0.18046430709450179, 0.41200648500727344, 0.169971707293716, 0.18318212134047196, 0.00499811412823291, 0.2532920046828878, 0.13451145371923653, 0.05117849143735396, 0.08371203201942337, 0.242365137878089, 0.1770490692832913, 0.06441726667913966, -0.3468034976400817, 0.025971331908248175, 0.07864806837318704]
|
1,803.08598
|
Voltage Control of Magnetic Monopoles in Artificial Spin Ice
|
Current research on artificial spin ice (ASI) systems has revealed unique
hysteretic memory effects and mobile quasi-particle monopoles controlled by
externally applied magnetic fields. Here, we numerically demonstrate a
strain-mediated multiferroic approach to locally control the ASI monopoles. The
magnetization of individual lattice elements is controlled by applying voltage
pulses to the piezoelectric layer resulting in strain-induced magnetic
precession timed for 180 degree reorientation. The model demonstrates localized
voltage control to move the magnetic monopoles across lattice sites, in CoFeB,
Ni, and FeGa based ASI$'$s. The switching is achieved at frequencies near
ferromagnetic resonance and requires energies below 620 aJ. The results
demonstrate that ASI monopoles can be efficiently and locally controlled with a
strain-mediated multiferroic approach.
|
physics.app-ph cond-mat.mes-hall
|
current research on artificial spin ice asi systems has revealed unique hysteretic memory effects and mobile quasiparticle monopoles controlled by externally applied magnetic fields here we numerically demonstrate a strainmediated multiferroic approach to locally control the asi monopoles the magnetization of individual lattice elements is controlled by applying voltage pulses to the piezoelectric layer resulting in straininduced magnetic precession timed for 180 degree reorientation the model demonstrates localized voltage control to move the magnetic monopoles across lattice sites in cofeb ni and fega based asis the switching is achieved at frequencies near ferromagnetic resonance and requires energies below 620 aj the results demonstrate that asi monopoles can be efficiently and locally controlled with a strainmediated multiferroic approach
|
[['current', 'research', 'on', 'artificial', 'spin', 'ice', 'asi', 'systems', 'has', 'revealed', 'unique', 'hysteretic', 'memory', 'effects', 'and', 'mobile', 'quasiparticle', 'monopoles', 'controlled', 'by', 'externally', 'applied', 'magnetic', 'fields', 'here', 'we', 'numerically', 'demonstrate', 'a', 'strainmediated', 'multiferroic', 'approach', 'to', 'locally', 'control', 'the', 'asi', 'monopoles', 'the', 'magnetization', 'of', 'individual', 'lattice', 'elements', 'is', 'controlled', 'by', 'applying', 'voltage', 'pulses', 'to', 'the', 'piezoelectric', 'layer', 'resulting', 'in', 'straininduced', 'magnetic', 'precession', 'timed', 'for', '180', 'degree', 'reorientation', 'the', 'model', 'demonstrates', 'localized', 'voltage', 'control', 'to', 'move', 'the', 'magnetic', 'monopoles', 'across', 'lattice', 'sites', 'in', 'cofeb', 'ni', 'and', 'fega', 'based', 'asis', 'the', 'switching', 'is', 'achieved', 'at', 'frequencies', 'near', 'ferromagnetic', 'resonance', 'and', 'requires', 'energies', 'below', '620', 'aj', 'the', 'results', 'demonstrate', 'that', 'asi', 'monopoles', 'can', 'be', 'efficiently', 'and', 'locally', 'controlled', 'with', 'a', 'strainmediated', 'multiferroic', 'approach']]
|
[-0.1915835468337322, 0.25371493825402397, 0.028327324479404423, -0.015179253881797194, -0.07911149797658636, -0.13784170197720966, 0.1028434625850656, 0.4908678509995469, -0.28869877399430954, -0.32143867795124775, 0.007960858455815345, -0.2391312790907219, -0.11312206055268519, 0.22568903166729098, 0.015604675031052185, -0.009852357320169099, -0.0395090366120681, -0.055058778709389716, -0.006216324983228348, -0.21132039301033712, 0.18192085436680633, 0.004573468544767198, 0.36753401355658716, 0.0710400499514917, 0.08985593273407882, -0.017693876818172697, 0.1570369236660787, 0.04572973956461423, -0.11117333914263972, 0.05073635225693206, 0.25048823808479065, -0.11951845020660733, 0.1865373449638868, -0.504628812314636, -0.1841619586906372, 0.0019217666843508044, 0.12344427484796087, 0.1650776618660794, -0.06441310132977067, -0.3083714499002975, 0.10534987315479825, -0.11249088830278259, -0.13486958689923978, -0.13880256169403976, -0.023556593741871353, 0.027133309249029867, -0.2894364852591569, 0.015759082296146795, 0.077674878652717, 0.1516367421986965, -0.1365452705321308, -0.0938508269480533, -0.09968582904324509, 0.02433678536112699, 0.030624381548120107, 0.09024762955661385, 0.2679795921047847, -0.041061202673098214, -0.20326902351986903, 0.2939475962263333, -0.0362211594141176, -0.11345610608999482, 0.12328068944068354, -0.16971474698880035, -0.008137402403303701, 0.15878976058437783, 0.1571648291224598, 0.11250711518785574, -0.1675671354174001, 0.08694627882642114, 0.054674993484066084, 0.20841462813461056, 0.06370830527132648, 0.005681835441316804, 0.29242314336996555, 0.23186797782595658, 0.06875099861421265, 0.16309367872985542, -0.12853682221462712, -0.04912810720917252, -0.16166059696712556, -0.10456050247049485, -0.23054413022433654, 0.0732879293545221, -0.05881449637852975, -0.14192812439675132, 0.3832224000754774, 0.15992315052451295, 0.08848524794507867, -0.07531245669741064, 0.2508175342829309, 0.06556471645768382, 0.10288372562609167, 0.05566484089065184, 0.26233374578161883, 0.1855754166857427, 0.20142374255766088, -0.3244053968108999, 0.04850363740538303, 0.009897730719202604]
|
1,803.08599
|
Archaeoastronomical study of Andean temples in Arica and Parinacota,
Chile
|
After a historical and cultural overview of the "Indian republic", the Andean
religiosity and the churches of the highlands of Arica, we detail our
archaeoastronomical studies on the orientations of the Andean Christian
churches in the region of Arica and Parinacota, and analyze some preliminary
results. We conclude with a brief discussion on the patterns of orientation
found in our measurements and on their possible causes.
|
physics.hist-ph astro-ph.IM
|
after a historical and cultural overview of the indian republic the andean religiosity and the churches of the highlands of arica we detail our archaeoastronomical studies on the orientations of the andean christian churches in the region of arica and parinacota and analyze some preliminary results we conclude with a brief discussion on the patterns of orientation found in our measurements and on their possible causes
|
[['after', 'a', 'historical', 'and', 'cultural', 'overview', 'of', 'the', 'indian', 'republic', 'the', 'andean', 'religiosity', 'and', 'the', 'churches', 'of', 'the', 'highlands', 'of', 'arica', 'we', 'detail', 'our', 'archaeoastronomical', 'studies', 'on', 'the', 'orientations', 'of', 'the', 'andean', 'christian', 'churches', 'in', 'the', 'region', 'of', 'arica', 'and', 'parinacota', 'and', 'analyze', 'some', 'preliminary', 'results', 'we', 'conclude', 'with', 'a', 'brief', 'discussion', 'on', 'the', 'patterns', 'of', 'orientation', 'found', 'in', 'our', 'measurements', 'and', 'on', 'their', 'possible', 'causes']]
|
[-0.09923171803899412, 0.07142386901735638, -0.07829470014465707, 0.05582173973957579, -0.061794398677727534, 0.027165819766990368, 0.07345453957243571, 0.35496293289202546, -0.14166954242520863, -0.30653370590880513, 0.15805586121813764, -0.3196172049594304, -0.17901708071844447, 0.20931333752851639, -0.10614846332325778, -0.07924978801655391, 0.06826873868703842, 0.040178264476477155, -0.040070543938782066, -0.248364215805417, 0.2998516023572948, 0.09247866308405286, 0.28556936228322605, 0.10112294889543028, 0.09782328744906754, 0.011886129747070963, -0.1647322369768979, -0.015572859816962764, -0.19384541285652962, 0.12829915798520522, 0.1941272531976066, 0.17730461889582258, 0.2596015611899987, -0.4243698323825522, -0.10027384472685674, -0.017720767725554722, 0.06311040212001119, 0.07216675230671489, -0.04202370080978624, -0.3605578108912423, 0.019216908807201043, -0.13553176483228094, -0.13159535331503738, 0.023563837410793417, 0.042759580434196524, 0.0514256606942841, -0.15134197362839052, 0.032939905078992956, 0.060749780970610796, 0.163153058287525, -0.08829115597265107, -0.1898325922056323, -0.02257473822239609, 0.14897840506293708, 0.09878630971624738, 0.005707650268006893, 0.09106808787004815, -0.12516205262629285, -0.11051333974307728, 0.3680086134385968, -0.01582723850059131, -0.06733358414873244, 0.18335470445786736, -0.18913254534293497, -0.1735397670270195, 0.009865328906074403, 0.18781729358329718, 0.10648741681010478, -0.10391636633328975, 0.01265273454122334, -0.07618195504423171, 0.10123104444660601, 0.05937180552809011, -0.01853361764242725, 0.21639162748460733, 0.19131949665172707, -0.012449185083073282, 0.13358704355870565, -0.14703612121575999, -0.11578667829171681, -0.28692839049275903, -0.1450740898523243, -0.06079268516115253, -0.0009006926760314003, -0.06783391104245166, -0.11596741157746504, 0.4689877030424892, 0.16163435204338933, 0.19474403007281205, -0.026334634627259913, 0.24093053035349363, -0.04871935590857729, 0.017547436646141466, 0.030556021380193886, 0.212539737718457, 0.07668404600449971, 0.1776755238617105, -0.20662568503665546, 0.10401440723725254, -0.03170056958934144]
|
1,803.086
|
Lower error bounds for the stochastic gradient descent optimization
algorithm: Sharp convergence rates for slowly and fast decaying learning
rates
|
The stochastic gradient descent (SGD) optimization algorithm plays a central
role in a series of machine learning applications. The scientific literature
provides a vast amount of upper error bounds for the SGD method. Much less
attention as been paid to proving lower error bounds for the SGD method. It is
the key contribution of this paper to make a step in this direction. More
precisely, in this article we establish for every $\gamma, \nu \in (0,\infty)$
essentially matching lower and upper bounds for the mean square error of the
SGD process with learning rates $(\frac{\gamma}{n^\nu})_{n \in \mathbb{N}}$
associated to a simple quadratic stochastic optimization problem. This allows
us to precisely quantify the mean square convergence rate of the SGD method in
dependence on the asymptotic behavior of the learning rates.
|
math.NA math.PR stat.ML
|
the stochastic gradient descent sgd optimization algorithm plays a central role in a series of machine learning applications the scientific literature provides a vast amount of upper error bounds for the sgd method much less attention as been paid to proving lower error bounds for the sgd method it is the key contribution of this paper to make a step in this direction more precisely in this article we establish for every gamma nu in 0infty essentially matching lower and upper bounds for the mean square error of the sgd process with learning rates fracgammannu_n in mathbbn associated to a simple quadratic stochastic optimization problem this allows us to precisely quantify the mean square convergence rate of the sgd method in dependence on the asymptotic behavior of the learning rates
|
[['the', 'stochastic', 'gradient', 'descent', 'sgd', 'optimization', 'algorithm', 'plays', 'a', 'central', 'role', 'in', 'a', 'series', 'of', 'machine', 'learning', 'applications', 'the', 'scientific', 'literature', 'provides', 'a', 'vast', 'amount', 'of', 'upper', 'error', 'bounds', 'for', 'the', 'sgd', 'method', 'much', 'less', 'attention', 'as', 'been', 'paid', 'to', 'proving', 'lower', 'error', 'bounds', 'for', 'the', 'sgd', 'method', 'it', 'is', 'the', 'key', 'contribution', 'of', 'this', 'paper', 'to', 'make', 'a', 'step', 'in', 'this', 'direction', 'more', 'precisely', 'in', 'this', 'article', 'we', 'establish', 'for', 'every', 'gamma', 'nu', 'in', '0infty', 'essentially', 'matching', 'lower', 'and', 'upper', 'bounds', 'for', 'the', 'mean', 'square', 'error', 'of', 'the', 'sgd', 'process', 'with', 'learning', 'rates', 'fracgammannu_n', 'in', 'mathbbn', 'associated', 'to', 'a', 'simple', 'quadratic', 'stochastic', 'optimization', 'problem', 'this', 'allows', 'us', 'to', 'precisely', 'quantify', 'the', 'mean', 'square', 'convergence', 'rate', 'of', 'the', 'sgd', 'method', 'in', 'dependence', 'on', 'the', 'asymptotic', 'behavior', 'of', 'the', 'learning', 'rates']]
|
[-0.08951533674858077, 0.01344469526797071, -0.10983058748687365, 0.12896508253827277, -0.08147641453285549, -0.1276624862577535, 0.09338938068804266, 0.37781975615784064, -0.30601998074918757, -0.3045104619750912, 0.11073126471890209, -0.23601005740597747, -0.1516182875953788, 0.26239843487869513, -0.12559844047379817, 0.09672559089164516, 0.06790846346177218, 0.0602633355387537, -0.08255112757581438, -0.30800425132751, 0.2198928772767847, 0.10485959344709567, 0.29260565514510223, 0.019531049410083382, 0.10777519770370897, -0.026942912640786448, -0.005126841806683892, -0.044542468853237094, -0.18538500705567845, 0.19494167096504955, 0.2485806305401836, 0.12163513460802998, 0.4184156072708641, -0.35733098481387415, -0.15356517464009134, 0.20771581120067095, 0.1801382806616864, 0.10105757075614592, -0.06468755718604427, -0.19933833904174525, 0.07278401012507145, -0.12747607527430668, -0.07697933106845635, -0.055787534091997056, 0.007489189009232692, 0.020778367618936325, -0.3191828375191305, 0.07424064580163406, 0.11961689403699349, 0.0612694123618182, -0.0064976720158335605, -0.15708086761292214, 0.07362504021892714, 0.10695285909960783, 0.10977239391108606, 0.08439227719538549, 0.12521265417494443, -0.12740414151777477, -0.09926194275996482, 0.30947160759810793, -0.09814822448818229, -0.22652280976086162, 0.09391248024018235, -0.11843440287869221, -0.17691673893957985, 0.14380641300736588, 0.2624179960206844, 0.15486859326619049, -0.15224164633383586, 0.10127362410326726, -0.020897804817199245, 0.11151777519014223, 0.01430550855837127, 0.025933519142946993, 0.08413625359102044, 0.20414988332890088, 0.2099455178484263, 0.1557354165535319, -0.0875568290826749, -0.13706988459380792, -0.28796512296408877, -0.16592761261980662, -0.17275614837227865, 0.02642741386125283, -0.14001762890787128, -0.1527994463135409, 0.3598005890759618, 0.16619600529616424, 0.1995245438545596, 0.1518663009069138, 0.312880867788958, 0.13481453190559464, 0.038555758676758804, 0.1313282593528834, 0.23436011005799437, 0.17245430209811113, 0.1393746811113241, -0.2141900864834067, 0.1264460565478996, 0.13689621716246816]
|
1,803.08601
|
Design Principles for Sparse Matrix Multiplication on the GPU
|
We implement two novel algorithms for sparse-matrix dense-matrix
multiplication (SpMM) on the GPU. Our algorithms expect the sparse input in the
popular compressed-sparse-row (CSR) format and thus do not require expensive
format conversion. While previous SpMM work concentrates on thread-level
parallelism, we additionally focus on latency hiding with instruction-level
parallelism and load-balancing. We show, both theoretically and experimentally,
that the proposed SpMM is a better fit for the GPU than previous approaches. We
identify a key memory access pattern that allows efficient access into both
input and output matrices that is crucial to getting excellent performance on
SpMM. By combining these two ingredients---(i) merge-based load-balancing and
(ii) row-major coalesced memory access---we demonstrate a 4.1x peak speedup and
a 31.7% geomean speedup over state-of-the-art SpMM implementations on
real-world datasets.
|
cs.DC
|
we implement two novel algorithms for sparsematrix densematrix multiplication spmm on the gpu our algorithms expect the sparse input in the popular compressedsparserow csr format and thus do not require expensive format conversion while previous spmm work concentrates on threadlevel parallelism we additionally focus on latency hiding with instructionlevel parallelism and loadbalancing we show both theoretically and experimentally that the proposed spmm is a better fit for the gpu than previous approaches we identify a key memory access pattern that allows efficient access into both input and output matrices that is crucial to getting excellent performance on spmm by combining these two ingredientsi mergebased loadbalancing and ii rowmajor coalesced memory accesswe demonstrate a 41x peak speedup and a 317 geomean speedup over stateoftheart spmm implementations on realworld datasets
|
[['we', 'implement', 'two', 'novel', 'algorithms', 'for', 'sparsematrix', 'densematrix', 'multiplication', 'spmm', 'on', 'the', 'gpu', 'our', 'algorithms', 'expect', 'the', 'sparse', 'input', 'in', 'the', 'popular', 'compressedsparserow', 'csr', 'format', 'and', 'thus', 'do', 'not', 'require', 'expensive', 'format', 'conversion', 'while', 'previous', 'spmm', 'work', 'concentrates', 'on', 'threadlevel', 'parallelism', 'we', 'additionally', 'focus', 'on', 'latency', 'hiding', 'with', 'instructionlevel', 'parallelism', 'and', 'loadbalancing', 'we', 'show', 'both', 'theoretically', 'and', 'experimentally', 'that', 'the', 'proposed', 'spmm', 'is', 'a', 'better', 'fit', 'for', 'the', 'gpu', 'than', 'previous', 'approaches', 'we', 'identify', 'a', 'key', 'memory', 'access', 'pattern', 'that', 'allows', 'efficient', 'access', 'into', 'both', 'input', 'and', 'output', 'matrices', 'that', 'is', 'crucial', 'to', 'getting', 'excellent', 'performance', 'on', 'spmm', 'by', 'combining', 'these', 'two', 'ingredientsi', 'mergebased', 'loadbalancing', 'and', 'ii', 'rowmajor', 'coalesced', 'memory', 'accesswe', 'demonstrate', 'a', '41x', 'peak', 'speedup', 'and', 'a', '317', 'geomean', 'speedup', 'over', 'stateoftheart', 'spmm', 'implementations', 'on', 'realworld', 'datasets']]
|
[-0.11483032273159163, -0.025496289760473596, -0.05074283501255463, 0.05225461714359031, -0.09215644452736148, -0.20371061694029657, 0.07245811362193562, 0.4816684336706874, -0.2098839317456071, -0.3500035847441797, 0.09241763052251953, -0.2135425287195802, -0.14123726436166, 0.2503158702967368, -0.08858780445698954, 0.10095463067934406, 0.13660590179249277, -0.0014019024894252176, -0.09905162897365564, -0.30980003153767866, 0.22597129497348833, 0.07988695269755897, 0.3613427475430682, 0.0415345872494728, 0.09614143868312851, -0.0260105196741547, -0.027808196922825254, -0.05612281855714858, -0.026982074663494848, 0.1438641357731807, 0.21505016360821233, 0.1947494749605778, 0.2735309922413091, -0.462661506921114, -0.15041733446977573, 0.055526315031351796, 0.18071605935387436, 0.05986182129339288, -0.06932380082196418, -0.22299720648462412, 0.12380204272177833, -0.16423428237064147, 0.06136767716971455, -0.1944729739754293, -0.030191100678658572, -0.010862594710846172, -0.29801276434245366, 0.0011055786887825025, 0.05816015503636454, 0.02369731537173273, 0.018758509322890218, -0.17633842288317983, 0.07902525185004304, 0.07590248266265529, -0.06262263749939863, 0.036912366522659286, 0.10273183236417711, -0.09722454919953083, -0.19367176290509885, 0.3802116160151228, -0.04254022522194437, -0.17337517957126752, 0.196305768251358, -0.03815087552380855, -0.1633206891987595, 0.09747042357692587, 0.21945971191753863, 0.07241132877362495, -0.10436016095031175, 0.07365826840730018, -0.008582121391063098, 0.23507216364740716, 0.08442590110477244, 0.052399585935760475, 0.10202360708365736, 0.22928039271567688, 0.04747242153980998, 0.12393894340088171, -0.06870582308138332, -0.11739991536673128, -0.1698807438827868, -0.15173780302837736, -0.1819034704640813, -0.013302200242803531, -0.12395606462420995, -0.1220918440519542, 0.38994097637898123, 0.24036980598218372, 0.17167536048294946, 0.14249730359030063, 0.42950994227478495, -0.007901480281152992, 0.1569708168151651, 0.21126551010462716, 0.13303903119636654, 0.015450546630566603, 0.1458967293194709, -0.20485842985207917, 0.06765651557647974, -0.014023301480996392]
|
1,803.08602
|
Maximum Consensus Parameter Estimation by Reweighted $\ell_1$ Methods
|
Robust parameter estimation in computer vision is frequently accomplished by
solving the maximum consensus (MaxCon) problem. Widely used randomized methods
for MaxCon, however, can only produce {random} approximate solutions, while
global methods are too slow to exercise on realistic problem sizes. Here we
analyse MaxCon as iterative reweighted algorithms on the data residuals. We
propose a smooth surrogate function, the minimization of which leads to an
extremely simple iteratively reweighted algorithm for MaxCon. We show that our
algorithm is very efficient and in many cases, yields the global solution. This
makes it an attractive alternative for randomized methods and global
optimizers. The convergence analysis of our method and its fundamental
differences from the other iteratively reweighted methods are also presented.
|
cs.CV
|
robust parameter estimation in computer vision is frequently accomplished by solving the maximum consensus maxcon problem widely used randomized methods for maxcon however can only produce random approximate solutions while global methods are too slow to exercise on realistic problem sizes here we analyse maxcon as iterative reweighted algorithms on the data residuals we propose a smooth surrogate function the minimization of which leads to an extremely simple iteratively reweighted algorithm for maxcon we show that our algorithm is very efficient and in many cases yields the global solution this makes it an attractive alternative for randomized methods and global optimizers the convergence analysis of our method and its fundamental differences from the other iteratively reweighted methods are also presented
|
[['robust', 'parameter', 'estimation', 'in', 'computer', 'vision', 'is', 'frequently', 'accomplished', 'by', 'solving', 'the', 'maximum', 'consensus', 'maxcon', 'problem', 'widely', 'used', 'randomized', 'methods', 'for', 'maxcon', 'however', 'can', 'only', 'produce', 'random', 'approximate', 'solutions', 'while', 'global', 'methods', 'are', 'too', 'slow', 'to', 'exercise', 'on', 'realistic', 'problem', 'sizes', 'here', 'we', 'analyse', 'maxcon', 'as', 'iterative', 'reweighted', 'algorithms', 'on', 'the', 'data', 'residuals', 'we', 'propose', 'a', 'smooth', 'surrogate', 'function', 'the', 'minimization', 'of', 'which', 'leads', 'to', 'an', 'extremely', 'simple', 'iteratively', 'reweighted', 'algorithm', 'for', 'maxcon', 'we', 'show', 'that', 'our', 'algorithm', 'is', 'very', 'efficient', 'and', 'in', 'many', 'cases', 'yields', 'the', 'global', 'solution', 'this', 'makes', 'it', 'an', 'attractive', 'alternative', 'for', 'randomized', 'methods', 'and', 'global', 'optimizers', 'the', 'convergence', 'analysis', 'of', 'our', 'method', 'and', 'its', 'fundamental', 'differences', 'from', 'the', 'other', 'iteratively', 'reweighted', 'methods', 'are', 'also', 'presented']]
|
[-0.02985104949135954, -0.01947622863202317, -0.13666079042789836, 0.13414743775113797, -0.0723146353305007, -0.17940749508173515, 0.03471119361638557, 0.4593855111161247, -0.3049112496936383, -0.31921157451967397, 0.17128057675630165, -0.2261376356414985, -0.20853142810131733, 0.23549471211930115, -0.11215887053792055, 0.14055754886891617, 0.11463621280466517, 0.002009222710815569, -0.09912384010191697, -0.28340788137478135, 0.22522038046930296, 0.045299843947092695, 0.273772687765692, -0.01427034514490515, 0.12875001066519567, -0.003283853264292702, -0.025999730445134143, 0.030998051642973222, -0.09896030400056285, 0.1288796139046705, 0.2784585123648867, 0.19997839526428532, 0.3571830596619596, -0.41469675763510166, -0.1552034981859227, 0.14655280147950786, 0.1940448898075071, 0.15735643106648542, -0.06922637949658868, -0.23152089427070072, 0.10196738413069398, -0.10780553872367211, -0.06131386612541974, -0.1644430592850161, -0.03750059293427815, 0.02389640228987749, -0.35016738732034963, 0.09169636068957819, 0.020224878657609226, 0.006502696382813156, -0.03809644502956265, -0.1519771054154262, 0.0842551740759518, 0.05390906713049238, 0.0677470629530338, 0.045787414685279755, 0.09706293366228541, -0.10528673927959366, -0.11981901592031742, 0.3572713823057711, -0.020637587667442857, -0.2158571560801647, 0.19189261470455676, 0.036131841402190425, -0.15669460914990244, 0.13644693634317567, 0.1986832777542683, 0.18952930168015883, -0.16045851747815806, 0.05013491270995776, -0.04781064133470257, 0.1366180960923278, -0.008657863433472811, -0.04617612703780954, 0.10825963644310832, 0.16813814682342734, 0.17850010957966636, 0.11890714833328578, -0.07329790684695278, -0.09105642641273638, -0.21822517765685917, -0.06397123124237017, -0.20509113085378583, -0.04720541291462723, -0.1431750084231074, -0.17892523255043974, 0.37332590396205584, 0.19913641610570873, 0.1687641887537514, 0.08349423861460915, 0.374212514081349, 0.11383121107646729, 0.02523479248629883, 0.12950877863913773, 0.24080936028428065, 0.07638893337959113, 0.0757012866185202, -0.21886738318329055, 0.10600491895262773, 0.12513845086408157]
|
1,803.08603
|
One-dimensional three-boson problem with two- and three-body
interactions
|
We solve the three-boson problem with contact two- and three-body
interactions in one dimension and analytically calculate the ground and excited
trimer-state energies. Then, by using the diffusion Monte Carlo technique we
calculate the binding energy of three dimers formed in a one-dimensional
Bose-Bose or Fermi-Bose mixture with attractive interspecies and repulsive
intraspecies interactions. Combining these results with our three-body
analytics we extract the three-dimer scattering length close to the dimer-dimer
zero crossing. In both considered cases the three-dimer interaction turns out
to be repulsive. Our results constitute a concrete proposal for obtaining a
one-dimensional gas with a pure three-body repulsion.
|
cond-mat.quant-gas
|
we solve the threeboson problem with contact two and threebody interactions in one dimension and analytically calculate the ground and excited trimerstate energies then by using the diffusion monte carlo technique we calculate the binding energy of three dimers formed in a onedimensional bosebose or fermibose mixture with attractive interspecies and repulsive intraspecies interactions combining these results with our threebody analytics we extract the threedimer scattering length close to the dimerdimer zero crossing in both considered cases the threedimer interaction turns out to be repulsive our results constitute a concrete proposal for obtaining a onedimensional gas with a pure threebody repulsion
|
[['we', 'solve', 'the', 'threeboson', 'problem', 'with', 'contact', 'two', 'and', 'threebody', 'interactions', 'in', 'one', 'dimension', 'and', 'analytically', 'calculate', 'the', 'ground', 'and', 'excited', 'trimerstate', 'energies', 'then', 'by', 'using', 'the', 'diffusion', 'monte', 'carlo', 'technique', 'we', 'calculate', 'the', 'binding', 'energy', 'of', 'three', 'dimers', 'formed', 'in', 'a', 'onedimensional', 'bosebose', 'or', 'fermibose', 'mixture', 'with', 'attractive', 'interspecies', 'and', 'repulsive', 'intraspecies', 'interactions', 'combining', 'these', 'results', 'with', 'our', 'threebody', 'analytics', 'we', 'extract', 'the', 'threedimer', 'scattering', 'length', 'close', 'to', 'the', 'dimerdimer', 'zero', 'crossing', 'in', 'both', 'considered', 'cases', 'the', 'threedimer', 'interaction', 'turns', 'out', 'to', 'be', 'repulsive', 'our', 'results', 'constitute', 'a', 'concrete', 'proposal', 'for', 'obtaining', 'a', 'onedimensional', 'gas', 'with', 'a', 'pure', 'threebody', 'repulsion']]
|
[-0.11247321892587933, 0.1948352337628603, -0.05990702048758976, 0.10876382539747283, 0.027928608902730048, -0.22935296284034848, 0.03385528084821999, 0.36569405304268005, -0.2419614048115909, -0.24533421932719648, -0.031240043443394826, -0.3394597612915095, -0.10530758553999477, 0.12125300828134641, 0.17289744148030878, 0.03958174668718129, 0.09464311831165105, 0.002279136599972844, -0.07460559604689479, -0.24201212300453334, 0.3328159106359817, -0.002747534569934942, 0.16932316432707012, 0.1664295479329303, 0.03980211913585663, 0.08728800694225355, 0.0666340989433229, -0.006535210272868425, -0.2076907380227931, 0.09977888908120804, 0.23652910783712286, -0.05770437044324353, 0.20137410056311636, -0.41275010917335747, -0.18059443770907818, 0.1290368859935552, 0.19433570225723087, 0.19028834312688558, -0.025204947707243262, -0.34302870829589666, -0.08023316903971135, -0.22489886987954377, -0.174160833847709, -0.1147923494828865, 0.00490928340703249, 0.03670517773600295, -0.2948429729603231, 0.10131134884431958, 0.024591781478375197, 0.0016344926413148643, -0.10793914826586842, -0.11516275506466628, 0.0097207015985623, 0.07690903051872738, 0.02989715742656699, -0.012632369147613644, 0.11354731432627886, -0.12773761533200742, -0.09450327478349209, 0.3905771304201335, -0.08043948896229267, -0.22471087644807994, 0.27324478530324997, -0.0753928212018218, -0.09061045351438224, 0.16658412077464163, 0.1279667830374092, 0.063166133222403, -0.15535337053239345, 0.07325289990520105, -0.018136471034958957, 0.14963568083418066, 0.08765719515271485, -0.04820415832102299, 0.2076643834449351, 0.18795471409335732, -0.00518483723164536, 0.19646954294643365, -0.11670024303079117, -0.18094149105250834, -0.22244573080912233, -0.09787868309766054, -0.22314985207049176, 0.024139514160342514, -0.05934330633317586, -0.15533831434324383, 0.3050679304683581, 0.12838220481295137, 0.21192463796585798, 0.05983117308467627, 0.28528988355305046, 0.1192507985397242, 0.05259189077711199, 0.0406131318572443, 0.27211940923705696, 0.13922002737759612, 0.002570481584407389, -0.3173442608979531, -0.03266493004746735, 0.10051278460770846]
|
1,803.08604
|
Learning State Representations for Query Optimization with Deep
Reinforcement Learning
|
Deep reinforcement learning is quickly changing the field of artificial
intelligence. These models are able to capture a high level understanding of
their environment, enabling them to learn difficult dynamic tasks in a variety
of domains. In the database field, query optimization remains a difficult
problem. Our goal in this work is to explore the capabilities of deep
reinforcement learning in the context of query optimization. At each state, we
build queries incrementally and encode properties of subqueries through a
learned representation. The challenge here lies in the formation of the state
transition function, which defines how the current subquery state combines with
the next query operation (action) to yield the next state. As a first step in
this direction, we focus the state representation problem and the formation of
the state transition function. We describe our approach and show preliminary
results. We further discuss how we can use the state representation to improve
query optimization using reinforcement learning.
|
cs.DB cs.AI cs.LG
|
deep reinforcement learning is quickly changing the field of artificial intelligence these models are able to capture a high level understanding of their environment enabling them to learn difficult dynamic tasks in a variety of domains in the database field query optimization remains a difficult problem our goal in this work is to explore the capabilities of deep reinforcement learning in the context of query optimization at each state we build queries incrementally and encode properties of subqueries through a learned representation the challenge here lies in the formation of the state transition function which defines how the current subquery state combines with the next query operation action to yield the next state as a first step in this direction we focus the state representation problem and the formation of the state transition function we describe our approach and show preliminary results we further discuss how we can use the state representation to improve query optimization using reinforcement learning
|
[['deep', 'reinforcement', 'learning', 'is', 'quickly', 'changing', 'the', 'field', 'of', 'artificial', 'intelligence', 'these', 'models', 'are', 'able', 'to', 'capture', 'a', 'high', 'level', 'understanding', 'of', 'their', 'environment', 'enabling', 'them', 'to', 'learn', 'difficult', 'dynamic', 'tasks', 'in', 'a', 'variety', 'of', 'domains', 'in', 'the', 'database', 'field', 'query', 'optimization', 'remains', 'a', 'difficult', 'problem', 'our', 'goal', 'in', 'this', 'work', 'is', 'to', 'explore', 'the', 'capabilities', 'of', 'deep', 'reinforcement', 'learning', 'in', 'the', 'context', 'of', 'query', 'optimization', 'at', 'each', 'state', 'we', 'build', 'queries', 'incrementally', 'and', 'encode', 'properties', 'of', 'subqueries', 'through', 'a', 'learned', 'representation', 'the', 'challenge', 'here', 'lies', 'in', 'the', 'formation', 'of', 'the', 'state', 'transition', 'function', 'which', 'defines', 'how', 'the', 'current', 'subquery', 'state', 'combines', 'with', 'the', 'next', 'query', 'operation', 'action', 'to', 'yield', 'the', 'next', 'state', 'as', 'a', 'first', 'step', 'in', 'this', 'direction', 'we', 'focus', 'the', 'state', 'representation', 'problem', 'and', 'the', 'formation', 'of', 'the', 'state', 'transition', 'function', 'we', 'describe', 'our', 'approach', 'and', 'show', 'preliminary', 'results', 'we', 'further', 'discuss', 'how', 'we', 'can', 'use', 'the', 'state', 'representation', 'to', 'improve', 'query', 'optimization', 'using', 'reinforcement', 'learning']]
|
[-0.06510794366586883, 0.0419940250023684, -0.09927962825387576, 0.04625438544650287, -0.13194187286561765, -0.09826450347724669, 0.07795549473438249, 0.4402774829394038, -0.3518141529628269, -0.33735416482243713, 0.07793138804406209, -0.23684971898196722, -0.17553338110183347, 0.13307092751159608, -0.08208293220578874, 0.0687638774994503, 0.07466551013299669, 0.06449035580018125, -0.07506346586306796, -0.261997761427419, 0.34148952749458217, 0.024466616181735793, 0.2958318980721136, 0.027688629913536256, 0.11402478822618255, 0.00537407051174427, 0.032284045195113284, -0.028910992491357732, -0.0986221421146824, 0.18045952340804697, 0.3406446593510525, 0.2378592077092086, 0.33340989757305795, -0.42771719936164293, -0.18132492995223487, 0.09112786780676728, 0.1380877463555596, 0.13268034021537048, -0.04124494167205837, -0.30572413495205836, 0.05927475785789718, -0.16096684261687896, -0.04521522138548909, -0.13514501898426493, -0.02575335383661232, -0.027978933186038932, -0.253849277061955, -0.034451884832584635, 0.06192445133390995, -0.008610856088732058, -0.09111088674234331, -0.07110014341994182, 0.059647447549673556, 0.18842553972623916, 0.00048082247786458183, 0.1059340994474522, 0.1640365054192455, -0.22054660089062117, -0.1730896816621886, 0.3558552034035231, -0.0550367810343152, -0.18184568551984034, 0.19785608549795622, -0.07992794476859506, -0.1586273541035564, 0.08102393849992996, 0.24383897627425621, 0.15291328910363358, -0.12749652542853318, 0.062300866805441654, -0.010900154106506387, 0.17672225042047132, -0.017444134992620552, -0.0037898612933514536, 0.20546279169777232, 0.2894039998159, 0.053044359095734336, 0.17826721656323652, -0.07905728658298822, -0.11635873769702823, -0.2270454573240014, -0.152206106779148, -0.17896767687374643, -0.0069489109142443295, -0.06417270367879072, -0.12551756810117587, 0.41568598641176363, 0.25739284000599627, 0.23062747266178704, 0.08966692213815455, 0.3010872956936441, 0.09023941547899805, 0.045895508541754865, 0.0854276813546184, 0.20565123557487983, 0.0580016966695376, 0.14760283676544264, -0.2192721858081765, 0.10923888306309171, 0.03832058079903887]
|
1,803.08605
|
iBrownout: An Integrated Approach for Managing Energy and Brownout in
Container-based Clouds
|
Energy consumption of Cloud data centers has been a major concern of many
researchers, and one of the reasons for huge energy consumption of Clouds lies
in the inefficient utilization of computing resources. Besides energy
consumption, another challenge of data centers is the unexpected loads, which
leads to the overloads and performance degradation. Compared with VM
consolidation and Dynamic Voltage Frequency Scaling that cannot function well
when the whole data center is overloaded, brownout has shown to be a promising
technique to handle both overloads and energy consumption through dynamically
deactivating application optional components, which are also identified as
containers/microservices. In this work, we propose an integrated approach to
manage energy consumption and brownout in container-based cloud data centers.
\color{black} We also evaluate our proposed scheduling policies with real
traces in a prototype system. The results show that our approach reduces about
40%, 20% and 10% energy than the approach without power-saving techniques,
brownout-overbooking approach and auto-scaling approach respectively while
ensuring Quality of Service.
|
cs.DC
|
energy consumption of cloud data centers has been a major concern of many researchers and one of the reasons for huge energy consumption of clouds lies in the inefficient utilization of computing resources besides energy consumption another challenge of data centers is the unexpected loads which leads to the overloads and performance degradation compared with vm consolidation and dynamic voltage frequency scaling that cannot function well when the whole data center is overloaded brownout has shown to be a promising technique to handle both overloads and energy consumption through dynamically deactivating application optional components which are also identified as containersmicroservices in this work we propose an integrated approach to manage energy consumption and brownout in containerbased cloud data centers colorblack we also evaluate our proposed scheduling policies with real traces in a prototype system the results show that our approach reduces about 40 20 and 10 energy than the approach without powersaving techniques brownoutoverbooking approach and autoscaling approach respectively while ensuring quality of service
|
[['energy', 'consumption', 'of', 'cloud', 'data', 'centers', 'has', 'been', 'a', 'major', 'concern', 'of', 'many', 'researchers', 'and', 'one', 'of', 'the', 'reasons', 'for', 'huge', 'energy', 'consumption', 'of', 'clouds', 'lies', 'in', 'the', 'inefficient', 'utilization', 'of', 'computing', 'resources', 'besides', 'energy', 'consumption', 'another', 'challenge', 'of', 'data', 'centers', 'is', 'the', 'unexpected', 'loads', 'which', 'leads', 'to', 'the', 'overloads', 'and', 'performance', 'degradation', 'compared', 'with', 'vm', 'consolidation', 'and', 'dynamic', 'voltage', 'frequency', 'scaling', 'that', 'can', 'not', 'function', 'well', 'when', 'the', 'whole', 'data', 'center', 'is', 'overloaded', 'brownout', 'has', 'shown', 'to', 'be', 'a', 'promising', 'technique', 'to', 'handle', 'both', 'overloads', 'and', 'energy', 'consumption', 'through', 'dynamically', 'deactivating', 'application', 'optional', 'components', 'which', 'are', 'also', 'identified', 'as', 'containersmicroservices', 'in', 'this', 'work', 'we', 'propose', 'an', 'integrated', 'approach', 'to', 'manage', 'energy', 'consumption', 'and', 'brownout', 'in', 'containerbased', 'cloud', 'data', 'centers', 'colorblack', 'we', 'also', 'evaluate', 'our', 'proposed', 'scheduling', 'policies', 'with', 'real', 'traces', 'in', 'a', 'prototype', 'system', 'the', 'results', 'show', 'that', 'our', 'approach', 'reduces', 'about', '40', '20', 'and', '10', 'energy', 'than', 'the', 'approach', 'without', 'powersaving', 'techniques', 'brownoutoverbooking', 'approach', 'and', 'autoscaling', 'approach', 'respectively', 'while', 'ensuring', 'quality', 'of', 'service']]
|
[-0.12895695879795457, 0.015421371176453919, -0.054821620925266774, 0.03437030899511262, -0.0485420853093815, -0.13100347073785845, 0.1139377645949656, 0.3975702717763149, -0.25821130658482755, -0.3893260685327046, 0.1210033374572847, -0.2683439090036633, -0.09983563244605631, 0.23440963687108077, -0.1246098516383237, 0.07274254065355504, 0.08151406646946137, 0.009599338542738575, 0.011346282420302826, -0.26095795255594323, 0.2668989998248457, 0.10791964173185542, 0.3899257261123211, 0.12076460645516958, 0.07317546520245038, -0.050929980813897005, 0.0019957663525650106, -0.017714167959013944, -0.02587905063687044, 0.14424461619628515, 0.2930213486185823, 0.1586258561604662, 0.3143950866255338, -0.4344176969553795, -0.20849328394122194, 0.09703374282096976, 0.15369338369242663, 0.05681263123056137, -0.06014134030520596, -0.21500547063048425, 0.13154471351085173, -0.24658198543235751, -0.11281965235876708, -0.08534505971324591, 0.01362338337327348, 0.03422282606990368, -0.249101787025646, 0.043615303333331634, -0.0036774856185517704, 0.015296215155237623, -0.11593019337524757, -0.10978854520666338, -0.024756807861049758, 0.1336300486860871, 0.058687222678717114, 0.007345639711297317, 0.17958894397269226, -0.11978683772562407, -0.1151419705061379, 0.39758464929424914, -0.0005983819823856379, -0.15212558092195197, 0.18954246686600104, -0.037089674362192855, -0.1259176014676873, 0.12937895581411896, 0.20988220700057098, 0.05320262853111543, -0.18265620124945203, 0.03307572814837338, 0.05603313175789966, 0.1774438799507459, 0.0633631324841201, 0.034908359899507704, 0.1471224794509975, 0.2265620897538343, 0.11746913023742789, 0.15411949781858095, -0.0872387116363535, -0.1067621345557501, -0.18725779895710706, -0.1658232126047869, -0.17462236743043263, 0.017178611525000883, -0.08096410064364175, -0.08056102128341605, 0.3623220623218015, 0.17636034867092054, 0.18949093861916771, 0.05528374563624434, 0.40362801065417064, 0.1198256476560859, 0.1611065993062649, 0.15275832960393532, 0.16304574511513867, -0.005918701657842548, 0.1916664104231639, -0.20989892801392732, 0.036957449494165434, -0.06682365733067408]
|
1,803.08606
|
DeepDRR -- A Catalyst for Machine Learning in Fluoroscopy-guided
Procedures
|
Machine learning-based approaches outperform competing methods in most
disciplines relevant to diagnostic radiology. Interventional radiology,
however, has not yet benefited substantially from the advent of deep learning,
in particular because of two reasons: 1) Most images acquired during the
procedure are never archived and are thus not available for learning, and 2)
even if they were available, annotations would be a severe challenge due to the
vast amounts of data. When considering fluoroscopy-guided procedures, an
interesting alternative to true interventional fluoroscopy is in silico
simulation of the procedure from 3D diagnostic CT. In this case, labeling is
comparably easy and potentially readily available, yet, the appropriateness of
resulting synthetic data is dependent on the forward model. In this work, we
propose DeepDRR, a framework for fast and realistic simulation of fluoroscopy
and digital radiography from CT scans, tightly integrated with the software
platforms native to deep learning. We use machine learning for material
decomposition and scatter estimation in 3D and 2D, respectively, combined with
analytic forward projection and noise injection to achieve the required
performance. On the example of anatomical landmark detection in X-ray images of
the pelvis, we demonstrate that machine learning models trained on DeepDRRs
generalize to unseen clinically acquired data without the need for re-training
or domain adaptation. Our results are promising and promote the establishment
of machine learning in fluoroscopy-guided procedures.
|
physics.med-ph cs.CV
|
machine learningbased approaches outperform competing methods in most disciplines relevant to diagnostic radiology interventional radiology however has not yet benefited substantially from the advent of deep learning in particular because of two reasons 1 most images acquired during the procedure are never archived and are thus not available for learning and 2 even if they were available annotations would be a severe challenge due to the vast amounts of data when considering fluoroscopyguided procedures an interesting alternative to true interventional fluoroscopy is in silico simulation of the procedure from 3d diagnostic ct in this case labeling is comparably easy and potentially readily available yet the appropriateness of resulting synthetic data is dependent on the forward model in this work we propose deepdrr a framework for fast and realistic simulation of fluoroscopy and digital radiography from ct scans tightly integrated with the software platforms native to deep learning we use machine learning for material decomposition and scatter estimation in 3d and 2d respectively combined with analytic forward projection and noise injection to achieve the required performance on the example of anatomical landmark detection in xray images of the pelvis we demonstrate that machine learning models trained on deepdrrs generalize to unseen clinically acquired data without the need for retraining or domain adaptation our results are promising and promote the establishment of machine learning in fluoroscopyguided procedures
|
[['machine', 'learningbased', 'approaches', 'outperform', 'competing', 'methods', 'in', 'most', 'disciplines', 'relevant', 'to', 'diagnostic', 'radiology', 'interventional', 'radiology', 'however', 'has', 'not', 'yet', 'benefited', 'substantially', 'from', 'the', 'advent', 'of', 'deep', 'learning', 'in', 'particular', 'because', 'of', 'two', 'reasons', '1', 'most', 'images', 'acquired', 'during', 'the', 'procedure', 'are', 'never', 'archived', 'and', 'are', 'thus', 'not', 'available', 'for', 'learning', 'and', '2', 'even', 'if', 'they', 'were', 'available', 'annotations', 'would', 'be', 'a', 'severe', 'challenge', 'due', 'to', 'the', 'vast', 'amounts', 'of', 'data', 'when', 'considering', 'fluoroscopyguided', 'procedures', 'an', 'interesting', 'alternative', 'to', 'true', 'interventional', 'fluoroscopy', 'is', 'in', 'silico', 'simulation', 'of', 'the', 'procedure', 'from', '3d', 'diagnostic', 'ct', 'in', 'this', 'case', 'labeling', 'is', 'comparably', 'easy', 'and', 'potentially', 'readily', 'available', 'yet', 'the', 'appropriateness', 'of', 'resulting', 'synthetic', 'data', 'is', 'dependent', 'on', 'the', 'forward', 'model', 'in', 'this', 'work', 'we', 'propose', 'deepdrr', 'a', 'framework', 'for', 'fast', 'and', 'realistic', 'simulation', 'of', 'fluoroscopy', 'and', 'digital', 'radiography', 'from', 'ct', 'scans', 'tightly', 'integrated', 'with', 'the', 'software', 'platforms', 'native', 'to', 'deep', 'learning', 'we', 'use', 'machine', 'learning', 'for', 'material', 'decomposition', 'and', 'scatter', 'estimation', 'in', '3d', 'and', '2d', 'respectively', 'combined', 'with', 'analytic', 'forward', 'projection', 'and', 'noise', 'injection', 'to', 'achieve', 'the', 'required', 'performance', 'on', 'the', 'example', 'of', 'anatomical', 'landmark', 'detection', 'in', 'xray', 'images', 'of', 'the', 'pelvis', 'we', 'demonstrate', 'that', 'machine', 'learning', 'models', 'trained', 'on', 'deepdrrs', 'generalize', 'to', 'unseen', 'clinically', 'acquired', 'data', 'without', 'the', 'need', 'for', 'retraining', 'or', 'domain', 'adaptation', 'our', 'results', 'are', 'promising', 'and', 'promote', 'the', 'establishment', 'of', 'machine', 'learning', 'in', 'fluoroscopyguided', 'procedures']]
|
[0.02902391528061747, 0.017546868690869525, -0.06283590842746367, 0.07729399967933394, -0.1193730829966284, -0.1868736651363652, 0.03113924038103398, 0.45668968871210563, -0.24361325622055832, -0.35695058470634045, 0.13482174008760214, -0.27088049156549154, -0.13594625206196437, 0.2667206702672253, -0.1323378292182081, 0.09484854377216209, 0.14771131643255314, -0.002022159934819284, -0.05211401921254477, -0.25948220999527943, 0.2736324690318165, 0.042719449824495534, 0.3642650083617657, 0.016170589913871155, 0.09447132232988767, -0.006206265977284622, -0.06290715058624946, -0.007601009634411915, -0.06482448954071572, 0.1758803037875985, 0.35709002877057044, 0.23202465466177302, 0.2951237721710015, -0.44263756964108125, -0.2243330176346577, 0.10963839240692455, 0.17683750579167343, 0.12656565808914433, -0.07589962235462275, -0.3064260025186321, 0.07670915262495501, -0.1381887872566414, -0.0056214107082507726, -0.1463518897830024, -0.03668531912223044, -0.03901490106455965, -0.28500869409370816, 0.062075964604479124, 0.013697744593681657, 0.10996944291466569, -0.087563580949264, -0.10815853168935055, 0.024756063257314567, 0.15878853816957827, 0.04121266090473354, 0.07042895310518345, 0.12781546436876007, -0.21622169407203634, -0.12133706906363705, 0.3577072862303938, 0.006342043894726564, -0.18255389453442894, 0.24213400482446612, -0.07279347172386236, -0.15143382928715554, 0.13005053800134603, 0.21432241873986327, 0.11190507719123355, -0.16981568809829672, 0.027346888693772272, 0.028183696182587974, 0.16700672594476407, 0.012984076479546794, -0.03981378346226469, 0.1740728281791284, 0.2227202561021281, -0.030427099668317605, 0.11540925676451903, -0.1743335609768867, -0.032185502187032845, -0.21205662972213726, -0.1332734687489824, -0.19383300745404616, -0.0054279446175977235, -0.06409666702151035, -0.14817439839222818, 0.3424277035119138, 0.24573682571921446, 0.1627812006445475, 0.03731798183392076, 0.3758635858739663, 0.002112793091924785, 0.1340580900479951, 0.059207945790276675, 0.21661034087983394, 0.009145105062158949, 0.13053175894337035, -0.15471659100833624, 0.11581911328375104, -0.01980563149602064]
|
1,803.08607
|
A Quantization-Friendly Separable Convolution for MobileNets
|
As deep learning (DL) is being rapidly pushed to edge computing, researchers
invented various ways to make inference computation more efficient on
mobile/IoT devices, such as network pruning, parameter compression, and etc.
Quantization, as one of the key approaches, can effectively offload GPU, and
make it possible to deploy DL on fixed-point pipeline. Unfortunately, not all
existing networks design are friendly to quantization. For example, the popular
lightweight MobileNetV1, while it successfully reduces parameter size and
computation latency with separable convolution, our experiment shows its
quantized models have large accuracy gap against its float point models. To
resolve this, we analyzed the root cause of quantization loss and proposed a
quantization-friendly separable convolution architecture. By evaluating the
image classification task on ImageNet2012 dataset, our modified MobileNetV1
model can archive 8-bit inference top-1 accuracy in 68.03%, almost closed the
gap to the float pipeline.
|
cs.CV
|
as deep learning dl is being rapidly pushed to edge computing researchers invented various ways to make inference computation more efficient on mobileiot devices such as network pruning parameter compression and etc quantization as one of the key approaches can effectively offload gpu and make it possible to deploy dl on fixedpoint pipeline unfortunately not all existing networks design are friendly to quantization for example the popular lightweight mobilenetv1 while it successfully reduces parameter size and computation latency with separable convolution our experiment shows its quantized models have large accuracy gap against its float point models to resolve this we analyzed the root cause of quantization loss and proposed a quantizationfriendly separable convolution architecture by evaluating the image classification task on imagenet2012 dataset our modified mobilenetv1 model can archive 8bit inference top1 accuracy in 6803 almost closed the gap to the float pipeline
|
[['as', 'deep', 'learning', 'dl', 'is', 'being', 'rapidly', 'pushed', 'to', 'edge', 'computing', 'researchers', 'invented', 'various', 'ways', 'to', 'make', 'inference', 'computation', 'more', 'efficient', 'on', 'mobileiot', 'devices', 'such', 'as', 'network', 'pruning', 'parameter', 'compression', 'and', 'etc', 'quantization', 'as', 'one', 'of', 'the', 'key', 'approaches', 'can', 'effectively', 'offload', 'gpu', 'and', 'make', 'it', 'possible', 'to', 'deploy', 'dl', 'on', 'fixedpoint', 'pipeline', 'unfortunately', 'not', 'all', 'existing', 'networks', 'design', 'are', 'friendly', 'to', 'quantization', 'for', 'example', 'the', 'popular', 'lightweight', 'mobilenetv1', 'while', 'it', 'successfully', 'reduces', 'parameter', 'size', 'and', 'computation', 'latency', 'with', 'separable', 'convolution', 'our', 'experiment', 'shows', 'its', 'quantized', 'models', 'have', 'large', 'accuracy', 'gap', 'against', 'its', 'float', 'point', 'models', 'to', 'resolve', 'this', 'we', 'analyzed', 'the', 'root', 'cause', 'of', 'quantization', 'loss', 'and', 'proposed', 'a', 'quantizationfriendly', 'separable', 'convolution', 'architecture', 'by', 'evaluating', 'the', 'image', 'classification', 'task', 'on', 'imagenet2012', 'dataset', 'our', 'modified', 'mobilenetv1', 'model', 'can', 'archive', '8bit', 'inference', 'top1', 'accuracy', 'in', '6803', 'almost', 'closed', 'the', 'gap', 'to', 'the', 'float', 'pipeline']]
|
[-0.07547089906247557, 0.004273047140660755, -0.05257561116261368, 0.06241061837504889, -0.13105252412550733, -0.2520916941839911, 0.08034269429465875, 0.4295806808278282, -0.29234930592529634, -0.35273556158950564, 0.09604235949136766, -0.24125318949157043, -0.16388905146456462, 0.2020507155577421, -0.128691086252897, 0.12950122606666456, 0.13450581065861258, 0.030553915795493634, -0.07601732879580686, -0.3211007450396816, 0.2388674291230553, 0.11468417045692517, 0.34605808707006963, 0.026254260047266248, 0.09465433220570603, -0.02919133838740052, -0.024762862329354762, -0.02634518676526607, -0.047332105273050616, 0.13005451488321818, 0.29824108446285447, 0.17710204039706934, 0.29590484471859557, -0.4162673225315909, -0.2086947889410699, 0.06600350443874849, 0.16938373359772277, 0.06655624024536963, -0.005334126548069622, -0.2908020978719194, 0.1344190538887278, -0.24010452059764706, -0.01772176959303766, -0.1854517592467262, 0.0002803888852239078, -0.04171690619624953, -0.2226487643560989, -0.007341746977325661, 0.04204717657284428, 0.006044498522574386, -0.009035883129244927, -0.13859184942512065, 0.021546955916416297, 0.13798385743276342, -0.004597835083399628, 0.08532393008391274, 0.16597344922166027, -0.1532677371601462, -0.10279575883285373, 0.34805769017560684, -0.026227404136815048, -0.22824747462142655, 0.17855423883760368, 0.007284006305329554, -0.11647616862814794, 0.07679674450426976, 0.2023956664104728, 0.07449536731611964, -0.1274687193985533, 0.04911744436381239, 0.03597721625912063, 0.16473265158541744, 0.08214080780381271, 0.006257787969372902, 0.16066648269811948, 0.2290290868015471, 0.06182285250124938, 0.135834636476307, -0.13123374988476857, -0.10755983488807613, -0.19767792411652188, -0.1311775850568046, -0.19273603157592767, 0.003480334064517837, -0.0967612240512208, -0.16826438035895216, 0.3641665784034429, 0.20964780667506105, 0.1799293308525432, 0.10948300763224879, 0.389793027842959, 0.06080617580533107, 0.18752303389594593, 0.1374984603298412, 0.18231218146715075, 0.0415442101706929, 0.12567021622626334, -0.1543963934915761, 0.05016643001618696, 0.042290251644894625]
|
1,803.08608
|
X-ray-transform Invariant Anatomical Landmark Detection for Pelvic
Trauma Surgery
|
X-ray image guidance enables percutaneous alternatives to complex procedures.
Unfortunately, the indirect view onto the anatomy in addition to projective
simplification substantially increase the task-load for the surgeon. Additional
3D information such as knowledge of anatomical landmarks can benefit surgical
decision making in complicated scenarios. Automatic detection of these
landmarks in transmission imaging is challenging since image-domain features
characteristic to a certain landmark change substantially depending on the
viewing direction. Consequently and to the best of our knowledge, the above
problem has not yet been addressed. In this work, we present a method to
automatically detect anatomical landmarks in X-ray images independent of the
viewing direction. To this end, a sequential prediction framework based on
convolutional layers is trained on synthetically generated data of the pelvic
anatomy to predict 23 landmarks in single X-ray images. View independence is
contingent on training conditions and, here, is achieved on a spherical segment
covering (120 x 90) degrees in LAO/RAO and CRAN/CAUD, respectively, centered
around AP. On synthetic data, the proposed approach achieves a mean prediction
error of 5.6 +- 4.5 mm. We demonstrate that the proposed network is immediately
applicable to clinically acquired data of the pelvis. In particular, we show
that our intra-operative landmark detection together with pre-operative CT
enables X-ray pose estimation which, ultimately, benefits initialization of
image-based 2D/3D registration.
|
cs.CV
|
xray image guidance enables percutaneous alternatives to complex procedures unfortunately the indirect view onto the anatomy in addition to projective simplification substantially increase the taskload for the surgeon additional 3d information such as knowledge of anatomical landmarks can benefit surgical decision making in complicated scenarios automatic detection of these landmarks in transmission imaging is challenging since imagedomain features characteristic to a certain landmark change substantially depending on the viewing direction consequently and to the best of our knowledge the above problem has not yet been addressed in this work we present a method to automatically detect anatomical landmarks in xray images independent of the viewing direction to this end a sequential prediction framework based on convolutional layers is trained on synthetically generated data of the pelvic anatomy to predict 23 landmarks in single xray images view independence is contingent on training conditions and here is achieved on a spherical segment covering 120 x 90 degrees in laorao and crancaud respectively centered around ap on synthetic data the proposed approach achieves a mean prediction error of 56 45 mm we demonstrate that the proposed network is immediately applicable to clinically acquired data of the pelvis in particular we show that our intraoperative landmark detection together with preoperative ct enables xray pose estimation which ultimately benefits initialization of imagebased 2d3d registration
|
[['xray', 'image', 'guidance', 'enables', 'percutaneous', 'alternatives', 'to', 'complex', 'procedures', 'unfortunately', 'the', 'indirect', 'view', 'onto', 'the', 'anatomy', 'in', 'addition', 'to', 'projective', 'simplification', 'substantially', 'increase', 'the', 'taskload', 'for', 'the', 'surgeon', 'additional', '3d', 'information', 'such', 'as', 'knowledge', 'of', 'anatomical', 'landmarks', 'can', 'benefit', 'surgical', 'decision', 'making', 'in', 'complicated', 'scenarios', 'automatic', 'detection', 'of', 'these', 'landmarks', 'in', 'transmission', 'imaging', 'is', 'challenging', 'since', 'imagedomain', 'features', 'characteristic', 'to', 'a', 'certain', 'landmark', 'change', 'substantially', 'depending', 'on', 'the', 'viewing', 'direction', 'consequently', 'and', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'the', 'above', 'problem', 'has', 'not', 'yet', 'been', 'addressed', 'in', 'this', 'work', 'we', 'present', 'a', 'method', 'to', 'automatically', 'detect', 'anatomical', 'landmarks', 'in', 'xray', 'images', 'independent', 'of', 'the', 'viewing', 'direction', 'to', 'this', 'end', 'a', 'sequential', 'prediction', 'framework', 'based', 'on', 'convolutional', 'layers', 'is', 'trained', 'on', 'synthetically', 'generated', 'data', 'of', 'the', 'pelvic', 'anatomy', 'to', 'predict', '23', 'landmarks', 'in', 'single', 'xray', 'images', 'view', 'independence', 'is', 'contingent', 'on', 'training', 'conditions', 'and', 'here', 'is', 'achieved', 'on', 'a', 'spherical', 'segment', 'covering', '120', 'x', '90', 'degrees', 'in', 'laorao', 'and', 'crancaud', 'respectively', 'centered', 'around', 'ap', 'on', 'synthetic', 'data', 'the', 'proposed', 'approach', 'achieves', 'a', 'mean', 'prediction', 'error', 'of', '56', '45', 'mm', 'we', 'demonstrate', 'that', 'the', 'proposed', 'network', 'is', 'immediately', 'applicable', 'to', 'clinically', 'acquired', 'data', 'of', 'the', 'pelvis', 'in', 'particular', 'we', 'show', 'that', 'our', 'intraoperative', 'landmark', 'detection', 'together', 'with', 'preoperative', 'ct', 'enables', 'xray', 'pose', 'estimation', 'which', 'ultimately', 'benefits', 'initialization', 'of', 'imagebased', '2d3d', 'registration']]
|
[-0.036283700610108646, -0.012885110253202063, -0.04570586597847362, 0.0381154362015718, -0.11574276534020729, -0.14088635320395923, 0.0649153961425042, 0.46473806693051267, -0.23628857849522017, -0.36177591141742493, 0.1237861372472521, -0.2607619114164349, -0.16373973335289665, 0.20243604204237617, -0.16926064855051076, 0.0640382480481425, 0.1293297211997949, 0.04407806426162235, -0.0895391217280557, -0.248894508614222, 0.2448984590650875, 0.046345117777395, 0.3384623577848317, 0.039127115878031894, 0.13503944264580806, 0.03058224801008465, -0.049349198745529295, -0.009418002366515365, -0.058861455042465066, 0.1595792942825267, 0.3235228735318382, 0.18733112692152562, 0.2532398717516544, -0.4093013897490975, -0.22736923594761657, 0.05942103800402465, 0.14975155893635983, 0.07853825223602114, -0.025008352477133514, -0.34129281541169515, 0.08472857969890302, -0.0805903369419208, -0.04087902296523345, -0.07775232797136641, -0.03170901440697709, -0.05793767012355308, -0.3004736839021097, 0.06440298908608987, 0.024496436143757492, 0.10621486297563955, -0.0925086775755999, -0.07028203159474128, -0.007602497800639594, 0.1563291475455779, 0.01847416909372923, 0.08352922235373064, 0.17696139679723827, -0.1752133606267827, -0.11024500130062004, 0.3445851386777954, 0.0053327147197622105, -0.1872060496890102, 0.17808631411109824, -0.11142589441234511, -0.14447390037687488, 0.18575953662691613, 0.2044294978200119, 0.1343594898270177, -0.15168943081033945, -0.013357737681813418, -0.034540514956327144, 0.20983508079471538, 0.07574201656198601, -0.046003983639318, 0.19154030255316692, 0.21629775459406048, 0.02939840705103932, 0.11441117965869503, -0.23531283741851214, -0.019745265060718158, -0.2224416469791389, -0.1313253359021222, -0.18051060131849714, 0.016401085570255564, -0.10174625445660772, -0.14857683177449427, 0.4112601387078449, 0.2329751037236642, 0.19985077493236086, 0.0480387947540344, 0.3473153288416084, -0.00545750408967708, 0.10269707866165409, 0.013169371606653324, 0.23418363783087942, 0.012582143870514817, 0.08480734711760775, -0.1598106771181788, 0.10083602833956445, 0.03496845532101386]
|
1,803.08609
|
Toward Adaptive Causal Consistency for Replicated Data Stores
|
Causal consistency for key-value stores has two main requirements (1) do not
make a version visible if some of its dependencies are invisible as it may
violate causal consistency in the future and (2) make a version visible as soon
as possible so that clients have the most recent information (to the extent
feasible). These two requirements conflict with each other. Existing key-value
stores that provide causal consistency (or detection of causal violation)
utilize a static approach in the trade-off between these requirements.
Depending upon the choice, it assists some applications and penalizes some
applications. We propose an alternative where the system provides a set of
tracking groups and checking groups. This allows the application to choose the
settings that are most suitable for that application. Furthermore, these groups
can be dynamically changed based on application requirements.
|
cs.DC
|
causal consistency for keyvalue stores has two main requirements 1 do not make a version visible if some of its dependencies are invisible as it may violate causal consistency in the future and 2 make a version visible as soon as possible so that clients have the most recent information to the extent feasible these two requirements conflict with each other existing keyvalue stores that provide causal consistency or detection of causal violation utilize a static approach in the tradeoff between these requirements depending upon the choice it assists some applications and penalizes some applications we propose an alternative where the system provides a set of tracking groups and checking groups this allows the application to choose the settings that are most suitable for that application furthermore these groups can be dynamically changed based on application requirements
|
[['causal', 'consistency', 'for', 'keyvalue', 'stores', 'has', 'two', 'main', 'requirements', '1', 'do', 'not', 'make', 'a', 'version', 'visible', 'if', 'some', 'of', 'its', 'dependencies', 'are', 'invisible', 'as', 'it', 'may', 'violate', 'causal', 'consistency', 'in', 'the', 'future', 'and', '2', 'make', 'a', 'version', 'visible', 'as', 'soon', 'as', 'possible', 'so', 'that', 'clients', 'have', 'the', 'most', 'recent', 'information', 'to', 'the', 'extent', 'feasible', 'these', 'two', 'requirements', 'conflict', 'with', 'each', 'other', 'existing', 'keyvalue', 'stores', 'that', 'provide', 'causal', 'consistency', 'or', 'detection', 'of', 'causal', 'violation', 'utilize', 'a', 'static', 'approach', 'in', 'the', 'tradeoff', 'between', 'these', 'requirements', 'depending', 'upon', 'the', 'choice', 'it', 'assists', 'some', 'applications', 'and', 'penalizes', 'some', 'applications', 'we', 'propose', 'an', 'alternative', 'where', 'the', 'system', 'provides', 'a', 'set', 'of', 'tracking', 'groups', 'and', 'checking', 'groups', 'this', 'allows', 'the', 'application', 'to', 'choose', 'the', 'settings', 'that', 'are', 'most', 'suitable', 'for', 'that', 'application', 'furthermore', 'these', 'groups', 'can', 'be', 'dynamically', 'changed', 'based', 'on', 'application', 'requirements']]
|
[-0.120444682063059, 0.0670016538599263, -0.08712829402002105, 0.09237767661408433, -0.16475500327868076, -0.1933135545037578, 0.0704866562864614, 0.39651789393847003, -0.2638858275090337, -0.3297887335082747, 0.16131585232410445, -0.2643758608522208, -0.1328361948364054, 0.18664936982282185, -0.09678323004381174, 0.045666171715808966, 0.06594962050907151, 0.08532440833714247, -0.03961181204067543, -0.25960322118697376, 0.3118753729092406, 0.029111378193989287, 0.3015564591810787, 0.06946812171563778, 0.06296912007659239, 0.040674167873854514, -0.0166919408255617, 0.03959506205928913, -0.08862441319404646, 0.11927980274798172, 0.27372142246305725, 0.23903839769739196, 0.3078558303884836, -0.45164815314712314, -0.18885874249598514, 0.11713751288892253, 0.13224675639253788, 0.0809011076216715, -0.05928920910364003, -0.25556711858328784, 0.09161208690455129, -0.18671919429933068, -0.06549613775998137, -0.11851204188717325, -0.00043080799471940435, 0.010415392618517589, -0.27222699939823936, -0.0056855385327698104, 0.027418270255065096, 0.0012681830715197716, -0.02376969881401649, -0.06783538598605061, 0.0019325928704772334, 0.173694837248687, 0.04594825214985078, -0.010956483885448724, 0.1256876797177387, -0.09845956396073592, -0.15337124349970888, 0.38942502305781757, 0.007293569518892217, -0.22048154369975528, 0.23180610385050412, -0.050865213726613207, -0.21799692561863548, 0.03884165747648608, 0.11857337782662498, 0.0623223160148809, -0.16803709395233216, 0.07354511108026793, -0.03856016311711244, 0.17574631842193159, 0.07358043689797394, 0.12659033913722764, 0.21414121416275028, 0.16297011834103614, 0.11082070176387682, 0.1062306202841875, -0.057427152581716864, -0.04545663746564996, -0.34392328277556566, -0.16096646445089557, -0.1229312993164589, -0.010139351872022835, -0.11189248229610227, -0.1329545518570328, 0.345832676048914, 0.24560137065280446, 0.1825383886963428, 0.05842501889155025, 0.3111684572522658, 0.028994462150425216, 0.10430229680330567, 0.10256096709478837, 0.22165551005984166, 0.03846634700078599, 0.09719848307911783, -0.13499382196714843, 0.13395284439618088, -0.005448839973903051]
|
1,803.0861
|
Closing the Calibration Loop: An Inside-out-tracking Paradigm for
Augmented Reality in Orthopedic Surgery
|
In percutaneous orthopedic interventions the surgeon attempts to reduce and
fixate fractures in bony structures. The complexity of these interventions
arises when the surgeon performs the challenging task of navigating surgical
tools percutaneously only under the guidance of 2D interventional X-ray
imaging. Moreover, the intra-operatively acquired data is only visualized
indirectly on external displays. In this work, we propose a flexible Augmented
Reality (AR) paradigm using optical see-through head mounted displays. The key
technical contribution of this work includes the marker-less and dynamic
tracking concept which closes the calibration loop between patient, C-arm and
the surgeon. This calibration is enabled using Simultaneous Localization and
Mapping of the environment of the operating theater. In return, the proposed
solution provides in situ visualization of pre- and intra-operative 3D medical
data directly at the surgical site. We demonstrate pre-clinical evaluation of a
prototype system, and report errors for calibration and target registration.
Finally, we demonstrate the usefulness of the proposed inside-out tracking
system in achieving "bull's eye" view for C-arm-guided punctures. This AR
solution provides an intuitive visualization of the anatomy and can simplify
the hand-eye coordination for the orthopedic surgeon.
|
cs.CV
|
in percutaneous orthopedic interventions the surgeon attempts to reduce and fixate fractures in bony structures the complexity of these interventions arises when the surgeon performs the challenging task of navigating surgical tools percutaneously only under the guidance of 2d interventional xray imaging moreover the intraoperatively acquired data is only visualized indirectly on external displays in this work we propose a flexible augmented reality ar paradigm using optical seethrough head mounted displays the key technical contribution of this work includes the markerless and dynamic tracking concept which closes the calibration loop between patient carm and the surgeon this calibration is enabled using simultaneous localization and mapping of the environment of the operating theater in return the proposed solution provides in situ visualization of pre and intraoperative 3d medical data directly at the surgical site we demonstrate preclinical evaluation of a prototype system and report errors for calibration and target registration finally we demonstrate the usefulness of the proposed insideout tracking system in achieving bulls eye view for carmguided punctures this ar solution provides an intuitive visualization of the anatomy and can simplify the handeye coordination for the orthopedic surgeon
|
[['in', 'percutaneous', 'orthopedic', 'interventions', 'the', 'surgeon', 'attempts', 'to', 'reduce', 'and', 'fixate', 'fractures', 'in', 'bony', 'structures', 'the', 'complexity', 'of', 'these', 'interventions', 'arises', 'when', 'the', 'surgeon', 'performs', 'the', 'challenging', 'task', 'of', 'navigating', 'surgical', 'tools', 'percutaneously', 'only', 'under', 'the', 'guidance', 'of', '2d', 'interventional', 'xray', 'imaging', 'moreover', 'the', 'intraoperatively', 'acquired', 'data', 'is', 'only', 'visualized', 'indirectly', 'on', 'external', 'displays', 'in', 'this', 'work', 'we', 'propose', 'a', 'flexible', 'augmented', 'reality', 'ar', 'paradigm', 'using', 'optical', 'seethrough', 'head', 'mounted', 'displays', 'the', 'key', 'technical', 'contribution', 'of', 'this', 'work', 'includes', 'the', 'markerless', 'and', 'dynamic', 'tracking', 'concept', 'which', 'closes', 'the', 'calibration', 'loop', 'between', 'patient', 'carm', 'and', 'the', 'surgeon', 'this', 'calibration', 'is', 'enabled', 'using', 'simultaneous', 'localization', 'and', 'mapping', 'of', 'the', 'environment', 'of', 'the', 'operating', 'theater', 'in', 'return', 'the', 'proposed', 'solution', 'provides', 'in', 'situ', 'visualization', 'of', 'pre', 'and', 'intraoperative', '3d', 'medical', 'data', 'directly', 'at', 'the', 'surgical', 'site', 'we', 'demonstrate', 'preclinical', 'evaluation', 'of', 'a', 'prototype', 'system', 'and', 'report', 'errors', 'for', 'calibration', 'and', 'target', 'registration', 'finally', 'we', 'demonstrate', 'the', 'usefulness', 'of', 'the', 'proposed', 'insideout', 'tracking', 'system', 'in', 'achieving', 'bulls', 'eye', 'view', 'for', 'carmguided', 'punctures', 'this', 'ar', 'solution', 'provides', 'an', 'intuitive', 'visualization', 'of', 'the', 'anatomy', 'and', 'can', 'simplify', 'the', 'handeye', 'coordination', 'for', 'the', 'orthopedic', 'surgeon']]
|
[-0.07420899955898784, 0.024318646422480307, -0.0668312592008802, 0.009281420232152306, -0.08832435134888417, -0.17123014693178476, 0.04709646663558419, 0.4205774018160438, -0.2006201024908292, -0.3499847103250764, 0.1161851714063506, -0.23807280762521651, -0.19383608482237305, 0.211262135955465, -0.18876365842222567, 0.07211015370964843, 0.1386999725789753, -0.0024388239378490117, -0.03534711540679157, -0.19292600157480405, 0.2370563466552525, 0.071821102207484, 0.3287842151037948, 0.03869426454102429, 0.13616862271596947, 0.08953657354758952, -0.06381385365716352, -0.01091103748698789, -0.07608911613476843, 0.14853158363038474, 0.3091909771094159, 0.20181639560858808, 0.284962282798964, -0.45628733147387596, -0.18495429817446937, 0.012115963018669556, 0.12566525910940943, 0.06361323721226185, -0.07353891637537727, -0.3547230477554984, 0.025372186460987895, -0.12667154004767298, -0.1124806966061794, -0.08492741688287327, -0.040333204221741484, -0.03250627958585674, -0.29152990445765037, 0.03351615567100785, -0.0024932167126349002, 0.15399435850020537, -0.11962294360367401, -0.02972665349251881, 0.0181561088294632, 0.23943877275435438, -0.002452855071012852, 0.04177689850480566, 0.18511515900195996, -0.1733328487866612, -0.10327087172998055, 0.3582961332673828, 0.03800550868993836, -0.1590553310885024, 0.1995827636220843, -0.09857363121644143, -0.12174918868714163, 0.12472461286421505, 0.17942943178512838, 0.1037891494023854, -0.16487599020707733, 0.025727193825127136, 0.027250791749646588, 0.171125380700374, 0.052164083597705926, -0.050932658580882896, 0.15943501607429797, 0.25368774934078475, 0.02618450049551264, 0.16920348090089618, -0.19559720198759029, -0.02125420354767352, -0.2541063867386691, -0.2159128059753247, -0.13010119964739167, -0.01685167670435202, -0.06898681327114783, -0.15822536911519985, 0.3798627787499979, 0.21377418159447129, 0.10999069503954141, 0.011748478239056684, 0.3742567535229428, 0.02434090216442572, 0.06636858515451433, 0.019179126774449082, 0.1964112962746332, -0.015136252744473838, 0.18017448761352708, -0.24400802847919284, 0.10607547648826875, 0.029665174263138926]
|
1,803.08611
|
The local information of difference equations
|
We give a definition for the restriction of a difference module on the affine
line to a formal neighborhood of an orbit, trying to mimic the analogous
definition and properties for a D-module. We show that this definition is
reasonable in two ways. First, we show that specifying a difference module on
the affine line is equivalent to giving its restriction to the complement of an
orbit, together with its restriction to a neighborhood of an orbit and an
isomorphism between the restriction of both to the intersection. We also give a
definition for vanishing cycles of a difference module and define a local
Mellin transform, which is an equivalence between vanishing cycles of a
difference module and nearby cycles of its Mellin transform, a D-module.
|
math.AG
|
we give a definition for the restriction of a difference module on the affine line to a formal neighborhood of an orbit trying to mimic the analogous definition and properties for a dmodule we show that this definition is reasonable in two ways first we show that specifying a difference module on the affine line is equivalent to giving its restriction to the complement of an orbit together with its restriction to a neighborhood of an orbit and an isomorphism between the restriction of both to the intersection we also give a definition for vanishing cycles of a difference module and define a local mellin transform which is an equivalence between vanishing cycles of a difference module and nearby cycles of its mellin transform a dmodule
|
[['we', 'give', 'a', 'definition', 'for', 'the', 'restriction', 'of', 'a', 'difference', 'module', 'on', 'the', 'affine', 'line', 'to', 'a', 'formal', 'neighborhood', 'of', 'an', 'orbit', 'trying', 'to', 'mimic', 'the', 'analogous', 'definition', 'and', 'properties', 'for', 'a', 'dmodule', 'we', 'show', 'that', 'this', 'definition', 'is', 'reasonable', 'in', 'two', 'ways', 'first', 'we', 'show', 'that', 'specifying', 'a', 'difference', 'module', 'on', 'the', 'affine', 'line', 'is', 'equivalent', 'to', 'giving', 'its', 'restriction', 'to', 'the', 'complement', 'of', 'an', 'orbit', 'together', 'with', 'its', 'restriction', 'to', 'a', 'neighborhood', 'of', 'an', 'orbit', 'and', 'an', 'isomorphism', 'between', 'the', 'restriction', 'of', 'both', 'to', 'the', 'intersection', 'we', 'also', 'give', 'a', 'definition', 'for', 'vanishing', 'cycles', 'of', 'a', 'difference', 'module', 'and', 'define', 'a', 'local', 'mellin', 'transform', 'which', 'is', 'an', 'equivalence', 'between', 'vanishing', 'cycles', 'of', 'a', 'difference', 'module', 'and', 'nearby', 'cycles', 'of', 'its', 'mellin', 'transform', 'a', 'dmodule']]
|
[-0.18688862377570736, 0.02011607911233099, -0.1584882602938229, 0.05784350746156027, -0.11228531717307984, -0.06615081722922032, 0.06462015748940526, 0.3584078508946631, -0.33703948989037485, -0.23735130586040518, 0.09856364276123396, -0.2163662915487611, -0.13610236841948734, 0.1977184201694197, -0.1325217728976101, -0.044677324387492494, 0.06477628434668221, 0.0944452670454565, -0.1343456272974551, -0.218808101556663, 0.3760620520435392, 0.019764419290281478, 0.2075828366731811, 0.044199427796734705, 0.17209704139358586, 0.011106703966294252, -0.0028245926184195373, -0.0019425905442663602, -0.12743071786422255, 0.16199792608145683, 0.20907194582775, 0.1164252111569993, 0.21222230036269932, -0.3748526115059143, -0.1050168665140749, 0.17347370117481442, 0.09625965431480417, 0.03877061555468817, -0.0003058503969528136, -0.2409733502223851, 0.11414904198387549, -0.18334120017844105, -0.1405469280120636, -0.04245540555030669, 0.1072826462443031, -0.0026145895854348226, -0.26934258951731616, -0.0630023686664774, 0.1260295229416991, 0.12491130979642981, -0.0698926849392361, -0.030173308504301877, -0.012968264617181072, 0.1208033952972896, -0.007363957450872967, 0.043838053768027636, 0.09074178460748895, -0.09172659715275383, -0.11176158939044745, 0.3681007129628034, -0.07029994883175407, -0.22115758032027988, 0.17883790914146674, -0.1244646579374574, -0.12813888003103555, 0.09252899791675782, 0.07878575114799398, 0.10164422556639664, -0.08362752911708658, 0.10848381961067577, -0.08219783719155997, 0.129213417640015, 0.08591959266258138, 0.003613120617551936, 0.19167077786377854, 0.11206309030216838, 0.14904742978424543, 0.14888624953372137, -0.040298775610853994, -0.060610942646033235, -0.37505951846047997, -0.24657298760518195, -0.1193452957381923, 0.07407865715434864, -0.08427213832675036, -0.21098331186462135, 0.42111715860664845, 0.11058592794108249, 0.2599277285090278, 0.11217274219037905, 0.2691192417091409, 0.14182812565871114, 0.05269963990911723, 0.013513569590739079, 0.17405144873607373, 0.19763723200941014, 0.011223571578277245, -0.18959660803352202, -0.004128797656102549, 0.15669917817124063]
|
1,803.08612
|
Evaluating How Developers Use General-Purpose Web-Search for Code
Retrieval
|
Search is an integral part of a software development process. Developers
often use search engines to look for information during development, including
reusable code snippets, API understanding, and reference examples. Developers
tend to prefer general-purpose search engines like Google, which are often not
optimized for code related documents and use search strategies and ranking
techniques that are more optimized for generic, non-code related information.
In this paper, we explore whether a general purpose search engine like Google
is an optimal choice for code-related searches. In particular, we investigate
whether the performance of searching with Google varies for code vs. non-code
related searches. To analyze this, we collect search logs from 310 developers
that contains nearly 150,000 search queries from Google and the associated
result clicks. To differentiate between code-related searches and non-code
related searches, we build a model which identifies the code intent of queries.
Leveraging this model, we build an automatic classifier that detects a code and
non-code related query. We confirm the effectiveness of the classifier on
manually annotated queries where the classifier achieves a precision of 87%, a
recall of 86%, and an F1-score of 87%. We apply this classifier to
automatically annotate all the queries in the dataset. Analyzing this dataset,
we observe that code related searching often requires more effort (e.g., time,
result clicks, and query modifications) than general non-code search, which
indicates code search performance with a general search engine is less
effective.
|
cs.SE cs.IR
|
search is an integral part of a software development process developers often use search engines to look for information during development including reusable code snippets api understanding and reference examples developers tend to prefer generalpurpose search engines like google which are often not optimized for code related documents and use search strategies and ranking techniques that are more optimized for generic noncode related information in this paper we explore whether a general purpose search engine like google is an optimal choice for coderelated searches in particular we investigate whether the performance of searching with google varies for code vs noncode related searches to analyze this we collect search logs from 310 developers that contains nearly 150000 search queries from google and the associated result clicks to differentiate between coderelated searches and noncode related searches we build a model which identifies the code intent of queries leveraging this model we build an automatic classifier that detects a code and noncode related query we confirm the effectiveness of the classifier on manually annotated queries where the classifier achieves a precision of 87 a recall of 86 and an f1score of 87 we apply this classifier to automatically annotate all the queries in the dataset analyzing this dataset we observe that code related searching often requires more effort eg time result clicks and query modifications than general noncode search which indicates code search performance with a general search engine is less effective
|
[['search', 'is', 'an', 'integral', 'part', 'of', 'a', 'software', 'development', 'process', 'developers', 'often', 'use', 'search', 'engines', 'to', 'look', 'for', 'information', 'during', 'development', 'including', 'reusable', 'code', 'snippets', 'api', 'understanding', 'and', 'reference', 'examples', 'developers', 'tend', 'to', 'prefer', 'generalpurpose', 'search', 'engines', 'like', 'google', 'which', 'are', 'often', 'not', 'optimized', 'for', 'code', 'related', 'documents', 'and', 'use', 'search', 'strategies', 'and', 'ranking', 'techniques', 'that', 'are', 'more', 'optimized', 'for', 'generic', 'noncode', 'related', 'information', 'in', 'this', 'paper', 'we', 'explore', 'whether', 'a', 'general', 'purpose', 'search', 'engine', 'like', 'google', 'is', 'an', 'optimal', 'choice', 'for', 'coderelated', 'searches', 'in', 'particular', 'we', 'investigate', 'whether', 'the', 'performance', 'of', 'searching', 'with', 'google', 'varies', 'for', 'code', 'vs', 'noncode', 'related', 'searches', 'to', 'analyze', 'this', 'we', 'collect', 'search', 'logs', 'from', '310', 'developers', 'that', 'contains', 'nearly', '150000', 'search', 'queries', 'from', 'google', 'and', 'the', 'associated', 'result', 'clicks', 'to', 'differentiate', 'between', 'coderelated', 'searches', 'and', 'noncode', 'related', 'searches', 'we', 'build', 'a', 'model', 'which', 'identifies', 'the', 'code', 'intent', 'of', 'queries', 'leveraging', 'this', 'model', 'we', 'build', 'an', 'automatic', 'classifier', 'that', 'detects', 'a', 'code', 'and', 'noncode', 'related', 'query', 'we', 'confirm', 'the', 'effectiveness', 'of', 'the', 'classifier', 'on', 'manually', 'annotated', 'queries', 'where', 'the', 'classifier', 'achieves', 'a', 'precision', 'of', '87', 'a', 'recall', 'of', '86', 'and', 'an', 'f1score', 'of', '87', 'we', 'apply', 'this', 'classifier', 'to', 'automatically', 'annotate', 'all', 'the', 'queries', 'in', 'the', 'dataset', 'analyzing', 'this', 'dataset', 'we', 'observe', 'that', 'code', 'related', 'searching', 'often', 'requires', 'more', 'effort', 'eg', 'time', 'result', 'clicks', 'and', 'query', 'modifications', 'than', 'general', 'noncode', 'search', 'which', 'indicates', 'code', 'search', 'performance', 'with', 'a', 'general', 'search', 'engine', 'is', 'less', 'effective']]
|
[-0.06080331731973426, 0.010412411214335662, -0.03739910500750499, 0.13793070161028256, -0.15553596109603862, -0.20223105963413063, 0.1171574889283791, 0.4077533445511964, -0.23007814737746032, -0.4086080290275825, 0.09682903348255871, -0.3418707570653393, -0.11980305628063913, 0.23335455039737232, -0.053189053106663366, 0.02511033697529193, 0.121344532696803, 0.06194521018565013, -0.06114775410007732, -0.2698851451711246, 0.2641028039815941, 0.13184313456601926, 0.25665299175307155, 0.01307367983519657, -0.005769889073596905, -0.0024267381866205345, -0.14169623753422225, -0.039985138852788316, -0.10021804722192089, 0.14025373499797633, 0.3291160543156967, 0.28102092717474164, 0.2768144719088333, -0.3267659960221109, -0.10308459469323752, 0.12588444936759458, 0.12676177207870307, 0.10359518468101357, -0.0945904119317488, -0.32829162583561716, 0.09529789465576484, -0.17891539195279696, -0.0038086767795507378, -0.12399668954558783, 0.016436577004976728, 0.00633279110741447, -0.27432090958783006, -0.04690953289418263, 0.04754295730261935, 0.07370158983102247, -0.030736364782729408, -0.06923681284860166, 0.045055718291463195, 0.14581396801506313, 0.020091964992685788, 0.08178498368431662, 0.17612553243505844, -0.13926094703638836, -0.19658541320784165, 0.40016284000487007, -0.04842550704329008, -0.1564329638453707, 0.20917515018097588, -0.016257275619727236, -0.16343274832241408, 0.11228846072776547, 0.26440951416744346, 0.1520435048703681, -0.21529847280430184, 0.022759802284880414, -0.034408877317055234, 0.2621695350419153, 0.06816963973346997, -0.018367057227554915, 0.20429202389930642, 0.22894432362476871, 0.017889028154001823, 0.1603348529917114, -0.07684573115635795, -0.047307836587412215, -0.2359579532917698, -0.18939577409350722, -0.1430730441839446, -0.007750307326631282, -0.08222802147360822, -0.17556310405907957, 0.3874998621050284, 0.27973656352827614, 0.1299866819013861, 0.0878305204595521, 0.2774585171497454, -0.023199642302612598, 0.11705262372932673, 0.15933965942452205, 0.14058271424053823, -0.07111221439620113, 0.14306602826771603, -0.14319023573683443, 0.10781563694830439, 0.05077328135855652]
|
1,803.08613
|
Origin of chaos near three-dimensional quantum vortices: A general
Bohmian theory
|
We provide a general theory for the structure of the quantum flow near 3-d
nodal lines, i.e. one-dimensional loci where the 3-d wavefunction becomes equal
to zero. In suitably defined co- ordinates (co-moving with the nodal line) the
generic structure of the flow implies the formation of 3-d quantum vortices. We
show that such vortices are accompanied by nearby invariant lines of the
co-moving quantum flow, called X-lines, which are normally hyperbolic.
Furthermore, the stable and unstable manifolds of the X-lines produce chaotic
scatterings of nearby quantum (Bohmian) trajectories, thus inducing an
intricate form of the quantum current in the neighborhood of each 3-d quantum
vortex. Generic formulas describing the structure around 3-d quantum vortices
are provided, applicable to an arbitrary choice of 3-d wavefunction. We also
give specific numerical examples, as well as a discussion of the physical
consequences of chaos near 3-d quantum vortices.
|
quant-ph
|
we provide a general theory for the structure of the quantum flow near 3d nodal lines ie onedimensional loci where the 3d wavefunction becomes equal to zero in suitably defined co ordinates comoving with the nodal line the generic structure of the flow implies the formation of 3d quantum vortices we show that such vortices are accompanied by nearby invariant lines of the comoving quantum flow called xlines which are normally hyperbolic furthermore the stable and unstable manifolds of the xlines produce chaotic scatterings of nearby quantum bohmian trajectories thus inducing an intricate form of the quantum current in the neighborhood of each 3d quantum vortex generic formulas describing the structure around 3d quantum vortices are provided applicable to an arbitrary choice of 3d wavefunction we also give specific numerical examples as well as a discussion of the physical consequences of chaos near 3d quantum vortices
|
[['we', 'provide', 'a', 'general', 'theory', 'for', 'the', 'structure', 'of', 'the', 'quantum', 'flow', 'near', '3d', 'nodal', 'lines', 'ie', 'onedimensional', 'loci', 'where', 'the', '3d', 'wavefunction', 'becomes', 'equal', 'to', 'zero', 'in', 'suitably', 'defined', 'co', 'ordinates', 'comoving', 'with', 'the', 'nodal', 'line', 'the', 'generic', 'structure', 'of', 'the', 'flow', 'implies', 'the', 'formation', 'of', '3d', 'quantum', 'vortices', 'we', 'show', 'that', 'such', 'vortices', 'are', 'accompanied', 'by', 'nearby', 'invariant', 'lines', 'of', 'the', 'comoving', 'quantum', 'flow', 'called', 'xlines', 'which', 'are', 'normally', 'hyperbolic', 'furthermore', 'the', 'stable', 'and', 'unstable', 'manifolds', 'of', 'the', 'xlines', 'produce', 'chaotic', 'scatterings', 'of', 'nearby', 'quantum', 'bohmian', 'trajectories', 'thus', 'inducing', 'an', 'intricate', 'form', 'of', 'the', 'quantum', 'current', 'in', 'the', 'neighborhood', 'of', 'each', '3d', 'quantum', 'vortex', 'generic', 'formulas', 'describing', 'the', 'structure', 'around', '3d', 'quantum', 'vortices', 'are', 'provided', 'applicable', 'to', 'an', 'arbitrary', 'choice', 'of', '3d', 'wavefunction', 'we', 'also', 'give', 'specific', 'numerical', 'examples', 'as', 'well', 'as', 'a', 'discussion', 'of', 'the', 'physical', 'consequences', 'of', 'chaos', 'near', '3d', 'quantum', 'vortices']]
|
[-0.17775987409221086, 0.1646292723656699, -0.041008463768888115, 0.0710272931155736, -0.03953416984885523, -0.13233553844006501, -0.02520930785956882, 0.3127257467442103, -0.24757277103115435, -0.22098726858799536, 0.04117713442984458, -0.2557331015011423, -0.1487213976725885, 0.19334043488576244, -0.008693435655453096, 0.06971778241560271, 0.03970512280986989, 0.040531741826968865, -0.08942640734013578, -0.1920724177512991, 0.37695446646491654, 0.02406775500714677, 0.2677632045233622, 0.0221311454374139, 0.07686473742567564, -0.03383345748478274, 0.017766639992135437, 0.051203035727168805, -0.1732470037622241, 0.11375402669543527, 0.21937367522591494, 0.05219245094754924, 0.1913711053593569, -0.46922748515458956, -0.2162449167302191, 0.05626618679077046, 0.1999760184641162, 0.16104482452637095, -0.036815700693134126, -0.32858001775656864, 0.08389672482615873, -0.09410655419884428, -0.21664547452652086, -0.08230200442381853, 0.004758818854884028, 0.027313684087808, -0.21000323839739207, 0.07293935840106601, 0.08249119435012825, 0.10672484076010184, -0.0450154768194595, 0.013029466320167308, -0.08748051125320211, 0.12628125944111038, -0.012986988447963784, 0.020368097011918482, 0.14466372660794996, -0.14834196842913452, -0.12343273706230246, 0.4208023921101775, -0.016512154579188112, -0.21398161670626842, 0.16421581870136298, -0.1412831792585577, -0.07904779223712442, 0.16846672610430788, 0.1263525569747674, 0.15355450142021865, -0.03762240068666471, 0.0795023230439505, -0.0699268465599345, 0.09510175358605322, 0.058586342467556465, 0.053472794996246006, 0.2938640162138243, 0.09343364191152258, 0.07591636092338251, 0.11673889955751317, -0.1379430500937192, -0.21571651209075615, -0.33791315611707023, -0.1967865860548942, -0.1834621307446481, 0.09800402844988115, -0.09657389750336982, -0.26222752334473476, 0.3828686347585299, 0.09386757923753004, 0.24715896197479084, -0.014647525192193738, 0.2642620673549859, 0.1260754625151119, 0.03305566154598986, 0.09965138200491871, 0.19847793343846928, 0.1319148271641222, 0.0669188000762529, -0.24096537386992156, -0.016378314448010228, 0.09563345573396001]
|
1,803.08614
|
MultiBooked: A Corpus of Basque and Catalan Hotel Reviews Annotated for
Aspect-level Sentiment Classification
|
While sentiment analysis has become an established field in the NLP
community, research into languages other than English has been hindered by the
lack of resources. Although much research in multi-lingual and cross-lingual
sentiment analysis has focused on unsupervised or semi-supervised approaches,
these still require a large number of resources and do not reach the
performance of supervised approaches. With this in mind, we introduce two
datasets for supervised aspect-level sentiment analysis in Basque and Catalan,
both of which are under-resourced languages. We provide high-quality
annotations and benchmarks with the hope that they will be useful to the
growing community of researchers working on these languages.
|
cs.CL
|
while sentiment analysis has become an established field in the nlp community research into languages other than english has been hindered by the lack of resources although much research in multilingual and crosslingual sentiment analysis has focused on unsupervised or semisupervised approaches these still require a large number of resources and do not reach the performance of supervised approaches with this in mind we introduce two datasets for supervised aspectlevel sentiment analysis in basque and catalan both of which are underresourced languages we provide highquality annotations and benchmarks with the hope that they will be useful to the growing community of researchers working on these languages
|
[['while', 'sentiment', 'analysis', 'has', 'become', 'an', 'established', 'field', 'in', 'the', 'nlp', 'community', 'research', 'into', 'languages', 'other', 'than', 'english', 'has', 'been', 'hindered', 'by', 'the', 'lack', 'of', 'resources', 'although', 'much', 'research', 'in', 'multilingual', 'and', 'crosslingual', 'sentiment', 'analysis', 'has', 'focused', 'on', 'unsupervised', 'or', 'semisupervised', 'approaches', 'these', 'still', 'require', 'a', 'large', 'number', 'of', 'resources', 'and', 'do', 'not', 'reach', 'the', 'performance', 'of', 'supervised', 'approaches', 'with', 'this', 'in', 'mind', 'we', 'introduce', 'two', 'datasets', 'for', 'supervised', 'aspectlevel', 'sentiment', 'analysis', 'in', 'basque', 'and', 'catalan', 'both', 'of', 'which', 'are', 'underresourced', 'languages', 'we', 'provide', 'highquality', 'annotations', 'and', 'benchmarks', 'with', 'the', 'hope', 'that', 'they', 'will', 'be', 'useful', 'to', 'the', 'growing', 'community', 'of', 'researchers', 'working', 'on', 'these', 'languages']]
|
[-0.03675146965982111, 0.019246341323590935, -0.05318997473508682, 0.08864537475714108, -0.18588384614712647, -0.17599482394212349, 0.04942754207108662, 0.46889459833097513, -0.21308609577915016, -0.3484564172455443, 0.09591966824834498, -0.32437153260513507, -0.0795208850462552, 0.2535107718365495, -0.11907877655313262, 0.04457730767404977, 0.1604780030331381, 0.09006024341627226, -0.02270760696341793, -0.29549581784851636, 0.29475474972629323, 0.025679202271484822, 0.3757148986014555, 0.08209484741355311, 0.020041476965899457, -0.08646327625731674, -0.1027011966029674, 0.017922884835158737, -0.06473082912250319, 0.21716793871952556, 0.44230491867868826, 0.2680393938076208, 0.39935508008413717, -0.4225357744319997, -0.19639282025185958, 0.09505393885445061, 0.2052026449676322, 0.11405653453814767, -0.040354129236701106, -0.3542712194458494, 0.05007179405316183, -0.18223596682754467, 0.06757903496409713, -0.1877291146376146, 0.028545370884459326, -0.007155957474166808, -0.1651349552678612, 0.017983854080567945, 0.13010853230778868, 0.1870133546883908, -0.006610103323698738, -0.1827413759563329, 0.05067644078056065, 0.18705851158768572, 0.1299021474507479, 0.04744169522814874, 0.08406607723654301, -0.2072747385037079, -0.1750242009425079, 0.37196036114550707, -0.04166132483902093, -0.22847298695266527, 0.2572221202635259, -0.07559077419287893, -0.2529029521063181, 0.03303047878456847, 0.2315964073663191, 0.10848185651109747, -0.1559060043831057, 0.060603636464121625, -0.05581221251555209, 0.230083150982435, 0.08517082724368798, -0.004333312254188195, 0.2279520376705134, 0.2828435821102862, 0.013735724707520654, 0.10250705339943657, -0.030567357558229903, -0.04289844004823914, -0.12459931297684615, -0.1175064461235449, -0.15659011738761416, -0.037546984643652324, -0.0412511887014536, -0.17970895118800537, 0.37495497998974797, 0.20899069949299237, 0.09528824533248004, 0.08413434891004933, 0.301467938110329, -0.002944578833983473, 0.167120853944172, 0.11529705755880436, 0.19619833499210765, -0.028795474573512964, 0.19102423452939135, -0.11133619241926046, 0.09426727320862723, -0.008103626753853739]
|
1,803.08615
|
Probing the gluonic structure of the nucleon through quarkonium
production
|
Heavy quarkonium production will provide for novel opportunities to study the
gluonic structure of the nucleon in the near future. Near threshold quarkonium
production allows for direct experimental access of the dynamic origin of the
nucleon mass as well as the nature of the color Van der Waals force, while
quarkonium production at high energies can be used to create a full
three-dimensional tomographic image of the gluons inside the nucleon,
constraining the gluonic radius of the nucleon.
|
hep-ph hep-ex nucl-ex
|
heavy quarkonium production will provide for novel opportunities to study the gluonic structure of the nucleon in the near future near threshold quarkonium production allows for direct experimental access of the dynamic origin of the nucleon mass as well as the nature of the color van der waals force while quarkonium production at high energies can be used to create a full threedimensional tomographic image of the gluons inside the nucleon constraining the gluonic radius of the nucleon
|
[['heavy', 'quarkonium', 'production', 'will', 'provide', 'for', 'novel', 'opportunities', 'to', 'study', 'the', 'gluonic', 'structure', 'of', 'the', 'nucleon', 'in', 'the', 'near', 'future', 'near', 'threshold', 'quarkonium', 'production', 'allows', 'for', 'direct', 'experimental', 'access', 'of', 'the', 'dynamic', 'origin', 'of', 'the', 'nucleon', 'mass', 'as', 'well', 'as', 'the', 'nature', 'of', 'the', 'color', 'van', 'der', 'waals', 'force', 'while', 'quarkonium', 'production', 'at', 'high', 'energies', 'can', 'be', 'used', 'to', 'create', 'a', 'full', 'threedimensional', 'tomographic', 'image', 'of', 'the', 'gluons', 'inside', 'the', 'nucleon', 'constraining', 'the', 'gluonic', 'radius', 'of', 'the', 'nucleon']]
|
[-0.041157852073247805, 0.2262122652684458, -0.11916761562968485, 0.12644516719648471, -0.0511004775046156, -0.055646615383477926, 0.017020166373978823, 0.3061580381069619, -0.20680317150739333, -0.24418478741501579, -0.0816147607491495, -0.3041510548569838, 0.005854838611319279, 0.12450258913808145, 0.09235021936444518, 0.12612553728887668, 0.049550038434039705, 0.049917515878079056, -0.052212051259210475, -0.17759663299418604, 0.3614159800255528, 0.11544112547133596, 0.20855035204201555, 0.2863908741676893, 0.01727418130180106, 0.09639537567272782, -0.004859958991008357, -0.05598659384756898, -0.13602118085411627, 0.11659951445360023, 0.25323374430911666, 0.04598042410678971, 0.18742786363686603, -0.42185349084245855, -0.16850079538730475, 0.06369431317748073, 0.1616265305559724, 0.14848654728848487, -0.07108767206470172, -0.26736281101759046, 0.09224334003579898, -0.23727889572723937, -0.2003034924945006, -0.12928756616579798, -0.039775161502453, 0.020640181152908228, -0.2986105616086533, 0.08970854815859826, -0.06339249088733385, -0.011379879615747202, -0.06566111342936683, -0.19267554294604522, -0.06131122288449357, 0.11402182277435294, 0.02328556877984785, 0.10353789050191736, 0.21811204343938675, -0.23952860073544657, -0.13093557067585584, 0.4463458170588964, -0.02274273109073058, -0.11659281023849662, 0.15324198821177468, -0.1672958439717499, -0.1007695188268255, 0.13805011163155237, 0.2316829792391031, 0.05847601434335303, -0.18805392636419035, 0.0630231339436693, 0.0035286989639131115, 0.15223576129975322, 0.13517473324333343, 0.1606640601530671, 0.30186008552137095, 0.22657899231387255, 0.00735324053451992, 0.09637330554706307, -0.13907715659707975, -0.049625344980412565, -0.3430885258727731, -0.160328933228858, -0.15722726509930232, 0.06114146099813903, -0.07797539831573466, -0.16955528207696402, 0.39346816414632857, 0.08361302259473656, 0.21476767025887966, -0.04656341942683913, 0.3443964151158117, 0.06223358465537716, 0.08471409324556589, 0.04419894369605642, 0.3096646739122195, 0.1687508742683209, 0.16883721596931514, -0.29397655058747685, 0.01299556099379865, 0.07217451841689837]
|
1,803.08616
|
On the Unification Problem in Physics
|
Revised translation of Kaluza's historic 1921 paper, "Zum Unit\"atsproblem
der Physik," on 5-dimensional spacetime, used to unify gravity and
electromagnetism. This version is based, in part, on a 1984 translation
provided by T. Muta, but revised and formatted using LaTeX to closely match the
original paper in appearance and pagination. Kaluza's original notation is
restored.
|
physics.hist-ph gr-qc
|
revised translation of kaluzas historic 1921 paper zum unitatsproblem der physik on 5dimensional spacetime used to unify gravity and electromagnetism this version is based in part on a 1984 translation provided by t muta but revised and formatted using latex to closely match the original paper in appearance and pagination kaluzas original notation is restored
|
[['revised', 'translation', 'of', 'kaluzas', 'historic', '1921', 'paper', 'zum', 'unitatsproblem', 'der', 'physik', 'on', '5dimensional', 'spacetime', 'used', 'to', 'unify', 'gravity', 'and', 'electromagnetism', 'this', 'version', 'is', 'based', 'in', 'part', 'on', 'a', '1984', 'translation', 'provided', 'by', 't', 'muta', 'but', 'revised', 'and', 'formatted', 'using', 'latex', 'to', 'closely', 'match', 'the', 'original', 'paper', 'in', 'appearance', 'and', 'pagination', 'kaluzas', 'original', 'notation', 'is', 'restored']]
|
[-0.028565774438902736, 0.040205573557682756, -0.11307388479869741, 0.08159784698762211, -0.12706370341573964, -0.16635438964157453, 0.020784534834641613, 0.2597041605216152, -0.19189800835161838, -0.33267024521417216, 0.06671105011120299, -0.284153130151472, -0.15431259270265418, 0.1425506966364271, -0.2517283011825298, -0.0015309544034161657, 0.0016325557569287859, 0.007351128164819389, -0.06008379119184782, -0.2905788720796271, 0.2686193209703801, 0.08221500222834777, 0.2723934332453558, 0.0016878795159875222, 0.11760644637540264, 0.03260314556822743, -0.07146761703463096, 0.023711871694035408, -0.15830224231522494, 0.12975890509221913, 0.19130082102053148, 0.11432857546798296, 0.18823253918650015, -0.3834700516934665, -0.11637788743905302, -0.028343082159617037, 0.09365269673531348, 0.12023177273782357, -0.0019987374236631506, -0.3657958646006179, 0.047511413113547944, -0.17109924333416066, -0.06952737726025143, -0.04238063980877962, 0.03851407286623176, -0.07448555631035904, -0.15812406896279668, 0.07610042574200428, 0.09824673035445641, 0.08741058163204284, -0.065989670935658, -0.10158451688355098, 0.018742474375890113, 0.048243041598361056, 0.028776656265177253, 0.1522193129859724, 0.07408605621389623, -0.01447665173437376, -0.07844460766129899, 0.4480236341017035, -0.09581933842251464, -0.17148996618980505, 0.14882364663084582, -0.0528958928068432, -0.16587967260406827, 0.023294807394158165, 0.11840623537219076, 0.05120641120626011, -0.19804638894801996, 0.1368535843662443, -0.04009464230247826, 0.19119871850564796, 0.1703063342544549, -0.06153498823701773, 0.19080504947254118, 0.09053664046539024, -0.08994207069945503, 0.13179572149759755, 0.03764117044343982, -0.09211798839903665, -0.30318034870796046, -0.16202181408990105, -0.17490710199916, 0.03951778015086673, 0.012940399481350433, -0.16921387665536045, 0.34941828802649705, 0.183595771690444, 0.09063427579009307, 0.07255137241709064, 0.2344373765946278, 0.030785545583744096, 0.03732089859758556, 0.12336982805984763, 0.21433356088006272, 0.11052568008209455, 0.23762237484004559, -0.1323162371398143, -0.02654972678612707, 0.22396753463050667]
|
1,803.08617
|
Multiversion Concurrency with Bounded Delay and Precise Garbage
Collection
|
In this paper we are interested in bounding the number of instructions taken
to process transactions. The main result is a multiversion transactional system
that supports constant delay (extra instructions beyond running in isolation)
for all read-only transactions, delay equal to the number of processes for
writing transactions that are not concurrent with other writers, and
lock-freedom for concurrent writers. The system supports precise garbage
collection in that versions are identified for collection as soon as the last
transaction releases them. As far as we know these are first results that bound
delays for multiple readers and even a single writer. The approach is
particularly useful in situations where read-transactions dominate write
transactions, or where write transactions come in as streams or batches and can
be processed by a single writer (possibly in parallel).
The approach is based on using functional data structures to support multiple
versions, and an efficient solution to the Version Maintenance (VM) problem for
acquiring, updating and releasing versions. Our solution to the VM problem is
precise, safe and wait-free (PSWF).
We experimentally validate our approach by applying it to balanced tree data
structures for maintaining ordered maps. We test the transactional system using
multiple algorithms for the VM problem, including our PSWF VM algorithm, and
implementations with weaker guarantees based on epochs, hazard pointers, and
read-copy-update. To evaluate the functional data structure for concurrency and
multi-versioning, we implement batched updates for functional tree structures
and compare the performance with state-of-the-art concurrent data structures
for balanced trees. The experiments indicate our approach works well in
practice over a broad set of criteria.
|
cs.DC cs.DS
|
in this paper we are interested in bounding the number of instructions taken to process transactions the main result is a multiversion transactional system that supports constant delay extra instructions beyond running in isolation for all readonly transactions delay equal to the number of processes for writing transactions that are not concurrent with other writers and lockfreedom for concurrent writers the system supports precise garbage collection in that versions are identified for collection as soon as the last transaction releases them as far as we know these are first results that bound delays for multiple readers and even a single writer the approach is particularly useful in situations where readtransactions dominate write transactions or where write transactions come in as streams or batches and can be processed by a single writer possibly in parallel the approach is based on using functional data structures to support multiple versions and an efficient solution to the version maintenance vm problem for acquiring updating and releasing versions our solution to the vm problem is precise safe and waitfree pswf we experimentally validate our approach by applying it to balanced tree data structures for maintaining ordered maps we test the transactional system using multiple algorithms for the vm problem including our pswf vm algorithm and implementations with weaker guarantees based on epochs hazard pointers and readcopyupdate to evaluate the functional data structure for concurrency and multiversioning we implement batched updates for functional tree structures and compare the performance with stateoftheart concurrent data structures for balanced trees the experiments indicate our approach works well in practice over a broad set of criteria
|
[['in', 'this', 'paper', 'we', 'are', 'interested', 'in', 'bounding', 'the', 'number', 'of', 'instructions', 'taken', 'to', 'process', 'transactions', 'the', 'main', 'result', 'is', 'a', 'multiversion', 'transactional', 'system', 'that', 'supports', 'constant', 'delay', 'extra', 'instructions', 'beyond', 'running', 'in', 'isolation', 'for', 'all', 'readonly', 'transactions', 'delay', 'equal', 'to', 'the', 'number', 'of', 'processes', 'for', 'writing', 'transactions', 'that', 'are', 'not', 'concurrent', 'with', 'other', 'writers', 'and', 'lockfreedom', 'for', 'concurrent', 'writers', 'the', 'system', 'supports', 'precise', 'garbage', 'collection', 'in', 'that', 'versions', 'are', 'identified', 'for', 'collection', 'as', 'soon', 'as', 'the', 'last', 'transaction', 'releases', 'them', 'as', 'far', 'as', 'we', 'know', 'these', 'are', 'first', 'results', 'that', 'bound', 'delays', 'for', 'multiple', 'readers', 'and', 'even', 'a', 'single', 'writer', 'the', 'approach', 'is', 'particularly', 'useful', 'in', 'situations', 'where', 'readtransactions', 'dominate', 'write', 'transactions', 'or', 'where', 'write', 'transactions', 'come', 'in', 'as', 'streams', 'or', 'batches', 'and', 'can', 'be', 'processed', 'by', 'a', 'single', 'writer', 'possibly', 'in', 'parallel', 'the', 'approach', 'is', 'based', 'on', 'using', 'functional', 'data', 'structures', 'to', 'support', 'multiple', 'versions', 'and', 'an', 'efficient', 'solution', 'to', 'the', 'version', 'maintenance', 'vm', 'problem', 'for', 'acquiring', 'updating', 'and', 'releasing', 'versions', 'our', 'solution', 'to', 'the', 'vm', 'problem', 'is', 'precise', 'safe', 'and', 'waitfree', 'pswf', 'we', 'experimentally', 'validate', 'our', 'approach', 'by', 'applying', 'it', 'to', 'balanced', 'tree', 'data', 'structures', 'for', 'maintaining', 'ordered', 'maps', 'we', 'test', 'the', 'transactional', 'system', 'using', 'multiple', 'algorithms', 'for', 'the', 'vm', 'problem', 'including', 'our', 'pswf', 'vm', 'algorithm', 'and', 'implementations', 'with', 'weaker', 'guarantees', 'based', 'on', 'epochs', 'hazard', 'pointers', 'and', 'readcopyupdate', 'to', 'evaluate', 'the', 'functional', 'data', 'structure', 'for', 'concurrency', 'and', 'multiversioning', 'we', 'implement', 'batched', 'updates', 'for', 'functional', 'tree', 'structures', 'and', 'compare', 'the', 'performance', 'with', 'stateoftheart', 'concurrent', 'data', 'structures', 'for', 'balanced', 'trees', 'the', 'experiments', 'indicate', 'our', 'approach', 'works', 'well', 'in', 'practice', 'over', 'a', 'broad', 'set', 'of', 'criteria']]
|
[-0.1383590191588596, 0.041884443716105925, -0.037129259682401564, 0.07159542103515763, -0.10263989370485599, -0.1680952946295623, 0.1241433222193419, 0.39594510950370354, -0.2654393372588057, -0.34977262129541487, 0.13930621416180988, -0.2687060015159659, -0.10391526511794479, 0.22248169321700875, -0.09779219239399853, 0.06717545734004075, 0.11378148918668034, 0.02090319488321036, 0.014521397373975946, -0.30867521910907025, 0.267917984356631, 0.0429843625461217, 0.2699443953549207, 0.021829491185736984, 0.07650333249264142, 0.044080070949293615, -0.034987535897402486, 0.0272485839633384, -0.04664492995707957, 0.09475221556556679, 0.29284730237696116, 0.2209820066945571, 0.28017544900649227, -0.48462502141906455, -0.14295910432349157, 0.03746761384448319, 0.11696855135453392, 0.12143430842711082, -0.011077298202453125, -0.2601173903800152, 0.14323094847680873, -0.1701846353786426, -0.04338834042331049, -0.11676716695585514, 0.014231334560353196, 0.021602805163252702, -0.30284701655094093, 0.004479745581964821, 0.03621973901538171, 0.039641040772425404, -0.06169262615334115, -0.09383610290900503, 0.025208352442308696, 0.12802604212210458, 0.022364919022396807, 0.02064753210200279, 0.1246272965411966, -0.08708810378820173, -0.18619799965138858, 0.3769968029139846, -0.04461463665233389, -0.18279348336209572, 0.20158275244510593, -0.01883839709317368, -0.18483821716985072, 0.08251643810019066, 0.18500906871508271, 0.11562250343691134, -0.16559415037596464, 0.04697538056246809, -0.017919935376884303, 0.1830650145173863, 0.09425837599503045, 0.033837388464510725, 0.14888651511247383, 0.17606752837838774, 0.07681984967238156, 0.1293203903749765, -0.024429183360828603, -0.11155294143204766, -0.26142598577015713, -0.1741627508840104, -0.14603025191172492, -0.03539406585812024, -0.06216582994161537, -0.17505882609332207, 0.33244498490504076, 0.18608058613255818, 0.17250468948799552, 0.1167585220797319, 0.3575309895007222, 0.06452953838881072, 0.10479545710943443, 0.14597035104154862, 0.11461620164460107, 0.02525810416359904, 0.13834042132569294, -0.1312509868999548, 0.11835274663859639, 0.016752219402957107]
|
1,803.08618
|
Geometry of Two-Sheeted Spacetime Solutions
|
In contrast to Einstein's theory, the first order formulation of gravity
turns out to be a natural habitat for double-sheeted spacetime solutions which
satisfy the vacuum field equations everywhere. These bridge-like geometries
exhibit degenerate tetrads at their core that separates the two sheets. Here we
study the geodesics of these solutions and elucidate their causal structure.
These spacetimes emerge as a classical realization of a two-universe solution
in pure gravity. We also find the angle of deflection of light propagating in a
bridge geometry. From this, we conclude that this spacetime would be
indistinguishable from the Schwarzschild exterior when observed from
asymptotia.
|
gr-qc
|
in contrast to einsteins theory the first order formulation of gravity turns out to be a natural habitat for doublesheeted spacetime solutions which satisfy the vacuum field equations everywhere these bridgelike geometries exhibit degenerate tetrads at their core that separates the two sheets here we study the geodesics of these solutions and elucidate their causal structure these spacetimes emerge as a classical realization of a twouniverse solution in pure gravity we also find the angle of deflection of light propagating in a bridge geometry from this we conclude that this spacetime would be indistinguishable from the schwarzschild exterior when observed from asymptotia
|
[['in', 'contrast', 'to', 'einsteins', 'theory', 'the', 'first', 'order', 'formulation', 'of', 'gravity', 'turns', 'out', 'to', 'be', 'a', 'natural', 'habitat', 'for', 'doublesheeted', 'spacetime', 'solutions', 'which', 'satisfy', 'the', 'vacuum', 'field', 'equations', 'everywhere', 'these', 'bridgelike', 'geometries', 'exhibit', 'degenerate', 'tetrads', 'at', 'their', 'core', 'that', 'separates', 'the', 'two', 'sheets', 'here', 'we', 'study', 'the', 'geodesics', 'of', 'these', 'solutions', 'and', 'elucidate', 'their', 'causal', 'structure', 'these', 'spacetimes', 'emerge', 'as', 'a', 'classical', 'realization', 'of', 'a', 'twouniverse', 'solution', 'in', 'pure', 'gravity', 'we', 'also', 'find', 'the', 'angle', 'of', 'deflection', 'of', 'light', 'propagating', 'in', 'a', 'bridge', 'geometry', 'from', 'this', 'we', 'conclude', 'that', 'this', 'spacetime', 'would', 'be', 'indistinguishable', 'from', 'the', 'schwarzschild', 'exterior', 'when', 'observed', 'from', 'asymptotia']]
|
[-0.1531355215818621, 0.12479038397315889, -0.13738227466586977, 0.08512472247646656, -0.08154287552461029, -0.1224375397991389, -0.022423030451172964, 0.3184284883365035, -0.26046366409864274, -0.26386863842140884, 0.07452020356664434, -0.27390855554491284, -0.17244695220142603, 0.14869614093215205, -0.045719690839760005, -0.007655435329070315, 0.009478143035667018, 0.01918398995883763, -0.10314175742096268, -0.17878568482818083, 0.3813896196661517, 0.0159881529933773, 0.25517442877870056, -0.020542006506584585, 0.11152715265518054, -0.07992708536796272, 0.01604508829303086, 0.09816660957876593, -0.15318406516526012, 0.06298759165918455, 0.23423929221462458, 0.09226885495707393, 0.19251433585071936, -0.4551538568735123, -0.2185110758803785, 0.06081681192386895, 0.13950185674242677, 0.17329652203596196, -0.051305286919814536, -0.29651565544307235, 0.04108003968372941, -0.11599124108441174, -0.20532455399632454, -0.041113626398146155, -0.012960944812512025, -0.03638519828906283, -0.179659916011733, 0.0699414529997739, 0.06556004398036748, -0.01241870983503759, -0.1055008321069181, -0.04335124873789027, -0.04581813613884151, 0.08903380434698192, 0.12077998991822823, 0.010996633518952876, 0.0939096755720675, -0.12355521683814004, -0.09192805445753038, 0.399720175974071, -0.05655020382371731, -0.2424363815970719, 0.16818490009987727, -0.20744185857940464, -0.10017098124604672, 0.1106788731738925, 0.15501118175219744, 0.18042686184402557, -0.1294552470454073, 0.11592335629218724, -0.051238723029382524, 0.11609688219614327, 0.16394974068738521, 0.05140732715837657, 0.3247588675189763, 0.06987451679771767, 0.04802158599253744, 0.12098810145398602, -0.038131597856990995, -0.13710489260207395, -0.37582597084343433, -0.19305383453145622, -0.10240415732143447, 0.11971440478228032, -0.13354681287411949, -0.2088217576686293, 0.33286809546872975, 0.16418833389121573, 0.1377636972628534, 0.02788825337658636, 0.2197234928398393, 0.08103222077712417, 0.04655063876416534, 0.09730726836714894, 0.34567085903137923, 0.13860074371797965, 0.105339185311459, -0.19708445557625964, -0.04331593958777376, 0.04247515598777682]
|
1,803.08619
|
Information Erasure
|
Information is central to thermodynamics, providing the grounds to the
formulation of the theory in powerful abstract statistical terms. One must not
forget, however, that, as put by Landauer, {\it information is physical}. This
means that the processing of information will be unavoidably linked to the
costs of manipulating the real physical systems carrying the information. Here
we will focus on the particular process of erasing information, which plays a
fundamental role in the description of heat engines. We will review Landauer's
principle and the associated erasure energy cost. We will also show, following
the recent contributions from Vaccaro and Barnett, that cost of erasing does
not need to be paid with energy, but with any other conserved quantity.
Finally, we will address the issue of designing heat engines based on these new
concepts.
|
quant-ph
|
information is central to thermodynamics providing the grounds to the formulation of the theory in powerful abstract statistical terms one must not forget however that as put by landauer it information is physical this means that the processing of information will be unavoidably linked to the costs of manipulating the real physical systems carrying the information here we will focus on the particular process of erasing information which plays a fundamental role in the description of heat engines we will review landauers principle and the associated erasure energy cost we will also show following the recent contributions from vaccaro and barnett that cost of erasing does not need to be paid with energy but with any other conserved quantity finally we will address the issue of designing heat engines based on these new concepts
|
[['information', 'is', 'central', 'to', 'thermodynamics', 'providing', 'the', 'grounds', 'to', 'the', 'formulation', 'of', 'the', 'theory', 'in', 'powerful', 'abstract', 'statistical', 'terms', 'one', 'must', 'not', 'forget', 'however', 'that', 'as', 'put', 'by', 'landauer', 'it', 'information', 'is', 'physical', 'this', 'means', 'that', 'the', 'processing', 'of', 'information', 'will', 'be', 'unavoidably', 'linked', 'to', 'the', 'costs', 'of', 'manipulating', 'the', 'real', 'physical', 'systems', 'carrying', 'the', 'information', 'here', 'we', 'will', 'focus', 'on', 'the', 'particular', 'process', 'of', 'erasing', 'information', 'which', 'plays', 'a', 'fundamental', 'role', 'in', 'the', 'description', 'of', 'heat', 'engines', 'we', 'will', 'review', 'landauers', 'principle', 'and', 'the', 'associated', 'erasure', 'energy', 'cost', 'we', 'will', 'also', 'show', 'following', 'the', 'recent', 'contributions', 'from', 'vaccaro', 'and', 'barnett', 'that', 'cost', 'of', 'erasing', 'does', 'not', 'need', 'to', 'be', 'paid', 'with', 'energy', 'but', 'with', 'any', 'other', 'conserved', 'quantity', 'finally', 'we', 'will', 'address', 'the', 'issue', 'of', 'designing', 'heat', 'engines', 'based', 'on', 'these', 'new', 'concepts']]
|
[-0.11839604734051312, 0.11668459747209033, -0.10782594719915581, 0.07935772698558356, -0.13790093579871662, -0.13326451750889198, 0.09531760808869279, 0.3293803155060802, -0.29233352278025626, -0.2993394319148762, 0.13169437502128586, -0.2947904416985476, -0.13944582171988354, 0.2228661457045393, -0.1124070049141909, 0.029608148122345333, 0.05145075173228423, 0.07873296721772388, -0.056913527499349206, -0.2276744765764686, 0.34357038084521835, 0.1347149688361296, 0.2709649953706218, 0.1353536173319027, 0.08134842180619155, 0.015875227127307608, -0.06559221754059084, 0.03345542648501361, -0.1366208900102747, 0.17060114665707546, 0.26532711144606236, 0.1647174823403692, 0.3042879538860784, -0.4834922020003867, -0.24191276426079558, 0.1211197087680226, 0.11277406588335757, 0.13786223995301233, -0.05941110287980635, -0.20927864037203922, 0.04380934323364897, -0.14815116249747687, -0.07607002115335816, -0.10375185118581572, 0.00753638870430304, -0.0007894194777012427, -0.19814237775350574, 0.049584478106646825, 0.11541847568074826, 0.0017975966112493578, -0.01934166397350326, -0.06871283571270587, -0.020759946274842178, 0.15357653918995787, 0.013028232126849454, 0.01095664389205596, 0.17113145311196237, -0.12251009994165611, -0.12879144723193525, 0.38068620741902504, -0.008561853861954035, -0.23212098722248825, 0.16933885638675056, -0.11833265299279827, -0.17756065867021123, 0.05106118101793439, 0.1484409140252661, 0.06369551287207287, -0.2227444083971986, 0.045287862117749766, 0.011225630967085487, 0.16978857346893803, 0.02260136218574732, 0.13077665778891698, 0.25614702678980555, 0.15689501697857822, 0.025075202130142655, 0.1269677837067388, -0.04434545842432, -0.12982554103720434, -0.319488251331582, -0.20058945551820434, -0.21193272039231692, 0.10528330097809858, -0.04372089845019761, -0.08440292582833278, 0.3290313012383656, 0.22272068418305255, 0.12873345228309965, 0.008995939144315615, 0.3173160088846265, 0.1319777998967277, 0.08173647917000883, 0.09344235794278168, 0.22721780241300255, 0.08018470497336239, 0.15237480741856035, -0.2025866474792945, 0.09302422467275147, 0.05597552119531849]
|
1,803.0862
|
Noether's problem for orientation $p$-subgroups of symmetric groups
|
We give a positive solution to Noether's rationality problem for certain
index $p$ subgroups of the $p$-Sylow subgoups of symmetric groups.
|
math.AC math.GR
|
we give a positive solution to noethers rationality problem for certain index p subgroups of the psylow subgoups of symmetric groups
|
[['we', 'give', 'a', 'positive', 'solution', 'to', 'noethers', 'rationality', 'problem', 'for', 'certain', 'index', 'p', 'subgroups', 'of', 'the', 'psylow', 'subgoups', 'of', 'symmetric', 'groups']]
|
[-0.2614970498141788, 0.048111636856836934, -0.12882061222834246, 0.09672882390164193, -0.13980082200751417, -0.15060485795228964, 0.08758939091404457, 0.3144496060198262, -0.35525745721090407, -0.27932265897591907, 0.08909921092535592, -0.23884938275885015, -0.06759675372658032, 0.12235497692156405, -0.15651696419254654, -0.007978911555948712, -0.01894994687643789, 0.11630895033123947, -0.03472666761704853, -0.2769306502526715, 0.4042014412227131, -0.10441796996054195, 0.2039366905533132, 0.0769499952771834, 0.0686634276949224, 0.04450163905996652, 0.028292858086171605, -0.039296919479966164, -0.19822449519831156, 0.10752143231331415, 0.3256157361680553, 0.11304532182181165, 0.2681150095803397, -0.2840836186494146, -0.11646058231902619, 0.29033035239470856, 0.061836773197033575, 0.0010167699573295458, -0.11592043656855822, -0.2604941606876396, 0.19670335145755893, -0.19050632951603758, -0.2038097068490017, -0.02728562420677571, 0.14053975010202044, -0.016461671906567756, -0.2900968808680773, 0.06949755168032079, 0.10397578323526042, 0.11761292349547148, -0.13750947274578115, -0.13716338532755062, 0.02376347922143482, 0.11904343605662386, 0.0771535508157242, -0.08706739651859693, 0.060817382631025145, -0.08304006712777275, -0.16369838409480594, 0.448756978625343, 0.01641129453976949, -0.24485068156250886, 0.03788837382481212, -0.14807003701017016, -0.1958213902655102, 0.11721617799984026, 0.13175860255779254, 0.20049021464018596, 0.03051839919672126, 0.1591576218959831, -0.19934393048641227, 0.08955358830834961, 0.12509787459636018, -0.09960670973218623, 0.05568881124435436, -0.03181743692784082, 0.18389107105100438, 0.1479395742561402, 0.1442811725040277, 0.058635446886044176, -0.3650490159080142, -0.21749806359765075, -0.043615243098299415, 0.1889136918776092, -0.13698283514185322, -0.2147378303398866, 0.4229899659043267, 0.017242280500275747, 0.041876738536215964, 0.18386684429077876, 0.10998440870926493, 0.11189143696711176, -0.023734974674880505, 0.0471014121458644, 0.07494260140118145, 0.2883970014462691, -0.07872868267198403, -0.15272285647335507, -0.0320286565415916, 0.23711370723322034]
|
1,803.08621
|
Parallel Range, Segment and Rectangle Queries with Augmented Maps
|
The range, segment and rectangle query problems are fundamental problems in
computational geometry, and have extensive applications in many domains.
Despite the significant theoretical work on these problems, efficient
implementations can be complicated. We know of very few practical
implementations of the algorithms in parallel, and most implementations do not
have tight theoretical bounds. We focus on simple and efficient parallel
algorithms and implementations for these queries, which have tight worst-case
bound in theory and good parallel performance in practice. We propose to use a
simple framework (the augmented map) to model the problem. Based on the
augmented map interface, we develop both multi-level tree structures and
sweepline algorithms supporting range, segment and rectangle queries in two
dimensions. For the sweepline algorithms, we propose a parallel paradigm and
show corresponding cost bounds. All of our data structures are work-efficient
to build in theory and achieve a low parallel depth. The query time is almost
linear to the output size.
We have implemented all the data structures described in the paper using a
parallel augmented map library. Based on the library each data structure only
requires about 100 lines of C++ code. We test their performance on large data
sets (up to $10^8$ elements) and a machine with 72-cores (144 hyperthreads).
The parallel construction achieves 32-68x speedup. Speedup numbers on queries
are up to 126-fold. Our sequential implementation outperforms the CGAL library
by at least 2x in both construction and queries. Our sequential implementation
can be slightly slower than the R-tree in the Boost library in some cases
(0.6-2.5x), but has significantly better query performance (1.6-1400x) than
Boost.
|
cs.CG cs.DS
|
the range segment and rectangle query problems are fundamental problems in computational geometry and have extensive applications in many domains despite the significant theoretical work on these problems efficient implementations can be complicated we know of very few practical implementations of the algorithms in parallel and most implementations do not have tight theoretical bounds we focus on simple and efficient parallel algorithms and implementations for these queries which have tight worstcase bound in theory and good parallel performance in practice we propose to use a simple framework the augmented map to model the problem based on the augmented map interface we develop both multilevel tree structures and sweepline algorithms supporting range segment and rectangle queries in two dimensions for the sweepline algorithms we propose a parallel paradigm and show corresponding cost bounds all of our data structures are workefficient to build in theory and achieve a low parallel depth the query time is almost linear to the output size we have implemented all the data structures described in the paper using a parallel augmented map library based on the library each data structure only requires about 100 lines of c code we test their performance on large data sets up to 108 elements and a machine with 72cores 144 hyperthreads the parallel construction achieves 3268x speedup speedup numbers on queries are up to 126fold our sequential implementation outperforms the cgal library by at least 2x in both construction and queries our sequential implementation can be slightly slower than the rtree in the boost library in some cases 0625x but has significantly better query performance 161400x than boost
|
[['the', 'range', 'segment', 'and', 'rectangle', 'query', 'problems', 'are', 'fundamental', 'problems', 'in', 'computational', 'geometry', 'and', 'have', 'extensive', 'applications', 'in', 'many', 'domains', 'despite', 'the', 'significant', 'theoretical', 'work', 'on', 'these', 'problems', 'efficient', 'implementations', 'can', 'be', 'complicated', 'we', 'know', 'of', 'very', 'few', 'practical', 'implementations', 'of', 'the', 'algorithms', 'in', 'parallel', 'and', 'most', 'implementations', 'do', 'not', 'have', 'tight', 'theoretical', 'bounds', 'we', 'focus', 'on', 'simple', 'and', 'efficient', 'parallel', 'algorithms', 'and', 'implementations', 'for', 'these', 'queries', 'which', 'have', 'tight', 'worstcase', 'bound', 'in', 'theory', 'and', 'good', 'parallel', 'performance', 'in', 'practice', 'we', 'propose', 'to', 'use', 'a', 'simple', 'framework', 'the', 'augmented', 'map', 'to', 'model', 'the', 'problem', 'based', 'on', 'the', 'augmented', 'map', 'interface', 'we', 'develop', 'both', 'multilevel', 'tree', 'structures', 'and', 'sweepline', 'algorithms', 'supporting', 'range', 'segment', 'and', 'rectangle', 'queries', 'in', 'two', 'dimensions', 'for', 'the', 'sweepline', 'algorithms', 'we', 'propose', 'a', 'parallel', 'paradigm', 'and', 'show', 'corresponding', 'cost', 'bounds', 'all', 'of', 'our', 'data', 'structures', 'are', 'workefficient', 'to', 'build', 'in', 'theory', 'and', 'achieve', 'a', 'low', 'parallel', 'depth', 'the', 'query', 'time', 'is', 'almost', 'linear', 'to', 'the', 'output', 'size', 'we', 'have', 'implemented', 'all', 'the', 'data', 'structures', 'described', 'in', 'the', 'paper', 'using', 'a', 'parallel', 'augmented', 'map', 'library', 'based', 'on', 'the', 'library', 'each', 'data', 'structure', 'only', 'requires', 'about', '100', 'lines', 'of', 'c', 'code', 'we', 'test', 'their', 'performance', 'on', 'large', 'data', 'sets', 'up', 'to', '108', 'elements', 'and', 'a', 'machine', 'with', '72cores', '144', 'hyperthreads', 'the', 'parallel', 'construction', 'achieves', '3268x', 'speedup', 'speedup', 'numbers', 'on', 'queries', 'are', 'up', 'to', '126fold', 'our', 'sequential', 'implementation', 'outperforms', 'the', 'cgal', 'library', 'by', 'at', 'least', '2x', 'in', 'both', 'construction', 'and', 'queries', 'our', 'sequential', 'implementation', 'can', 'be', 'slightly', 'slower', 'than', 'the', 'rtree', 'in', 'the', 'boost', 'library', 'in', 'some', 'cases', '0625x', 'but', 'has', 'significantly', 'better', 'query', 'performance', '161400x', 'than', 'boost']]
|
[-0.10384209819006024, -0.002443544288751066, -0.03185500943733529, 0.06343051508092232, -0.08806029867320196, -0.161813506772706, 0.07467353152480491, 0.46346172844541483, -0.25300418282814424, -0.37116295255370924, 0.11151162301809295, -0.25124538731600704, -0.11547438603008729, 0.2688451032417423, -0.07515966708654132, 0.08313510948444192, 0.12058256982229792, 0.011551314187450227, -0.09042813250216498, -0.31297856261614726, 0.23552081791525242, 0.05426126110842059, 0.296465987878427, 0.044607079957194366, 0.06639876633068953, -0.0337062538150962, -0.012746766492835036, 0.021453201923821507, -0.09269470105061871, 0.15629207724803465, 0.26701529675798485, 0.20588821672631064, 0.26374189716307056, -0.45153651635744163, -0.14135062159819642, 0.06525745689315843, 0.16248888780552023, 0.11300847442397827, -0.04181128898474934, -0.21923654547792598, 0.12143520938528708, -0.12738802802920257, -0.007693541951663078, -0.10798121181002665, -0.015384334022441515, -0.004697769161731261, -0.25174095990404777, -0.006950785377387571, 0.045681744637288926, 0.06646913477894047, -0.001534197015609321, -0.14171593400232238, 0.07906549531561448, 0.08664459239698633, -0.02469781503996587, 0.06728995506833682, 0.10909032507110887, -0.09002859716328625, -0.18940166897279606, 0.39136775077045877, -0.05678045110104844, -0.21653969564128994, 0.21698486672043515, -0.0648587909027563, -0.1622157511791978, 0.11830369553660752, 0.24141735726721242, 0.12836084902171452, -0.11209514163683393, 0.12593264169416188, -0.0377941714917306, 0.18594114824779817, 0.06487445123457988, 0.030856093302568943, 0.12961266820708833, 0.18565022261720507, 0.06020938644521973, 0.13398659424129267, -0.04984624771893263, -0.1139966714230698, -0.23238311204131534, -0.14692046572619308, -0.16026083552242895, -0.06390736177888158, -0.13685365852750875, -0.17845691656212098, 0.37667061019175013, 0.20367942313695775, 0.19628578204290506, 0.1229019009501948, 0.3442942027816142, 0.0627222568919825, 0.10947266700401032, 0.1936023436661567, 0.16493497640521165, 0.05135999960821279, 0.08966493458929561, -0.13844129834208152, 0.05723411506898273, 0.02469078562368721]
|
1,803.08622
|
Individuals' Mobility May Promote Criticality in Animal Collective
Decision-making
|
It is highly believed that the individuals' mobility plays an important role
in phase transition in animal collective motion. Here, we propose a model to
study the effects of individuals' mobility in a distributed animal collective
decision-making process, during which each individual faces two options with
equal quality. We implement the quorum response rule, a type of social
interaction rule which is taxonomically recognized in animal collective
decision-making, as the sole interaction rule. After the introduction of
individuals' mobility, we find that the group can reach a consensus decision at
one of the options at some critical points even the interaction is local. This
result is an obvious contrast to the stationary individuals, the population of
which is always equally distributed between the two options with fluctuations.
In order to explore the information dynamics, we introduce an important
information-theoretic measure, mutual information, to study the critical
behaviors. Furthermore, we study the case when individuals interact globally,
and also find some qualitative similar critical behaviors.
|
physics.soc-ph cond-mat.stat-mech q-bio.PE
|
it is highly believed that the individuals mobility plays an important role in phase transition in animal collective motion here we propose a model to study the effects of individuals mobility in a distributed animal collective decisionmaking process during which each individual faces two options with equal quality we implement the quorum response rule a type of social interaction rule which is taxonomically recognized in animal collective decisionmaking as the sole interaction rule after the introduction of individuals mobility we find that the group can reach a consensus decision at one of the options at some critical points even the interaction is local this result is an obvious contrast to the stationary individuals the population of which is always equally distributed between the two options with fluctuations in order to explore the information dynamics we introduce an important informationtheoretic measure mutual information to study the critical behaviors furthermore we study the case when individuals interact globally and also find some qualitative similar critical behaviors
|
[['it', 'is', 'highly', 'believed', 'that', 'the', 'individuals', 'mobility', 'plays', 'an', 'important', 'role', 'in', 'phase', 'transition', 'in', 'animal', 'collective', 'motion', 'here', 'we', 'propose', 'a', 'model', 'to', 'study', 'the', 'effects', 'of', 'individuals', 'mobility', 'in', 'a', 'distributed', 'animal', 'collective', 'decisionmaking', 'process', 'during', 'which', 'each', 'individual', 'faces', 'two', 'options', 'with', 'equal', 'quality', 'we', 'implement', 'the', 'quorum', 'response', 'rule', 'a', 'type', 'of', 'social', 'interaction', 'rule', 'which', 'is', 'taxonomically', 'recognized', 'in', 'animal', 'collective', 'decisionmaking', 'as', 'the', 'sole', 'interaction', 'rule', 'after', 'the', 'introduction', 'of', 'individuals', 'mobility', 'we', 'find', 'that', 'the', 'group', 'can', 'reach', 'a', 'consensus', 'decision', 'at', 'one', 'of', 'the', 'options', 'at', 'some', 'critical', 'points', 'even', 'the', 'interaction', 'is', 'local', 'this', 'result', 'is', 'an', 'obvious', 'contrast', 'to', 'the', 'stationary', 'individuals', 'the', 'population', 'of', 'which', 'is', 'always', 'equally', 'distributed', 'between', 'the', 'two', 'options', 'with', 'fluctuations', 'in', 'order', 'to', 'explore', 'the', 'information', 'dynamics', 'we', 'introduce', 'an', 'important', 'informationtheoretic', 'measure', 'mutual', 'information', 'to', 'study', 'the', 'critical', 'behaviors', 'furthermore', 'we', 'study', 'the', 'case', 'when', 'individuals', 'interact', 'globally', 'and', 'also', 'find', 'some', 'qualitative', 'similar', 'critical', 'behaviors']]
|
[-0.1412183374546968, 0.142561807902938, -0.10471682919177977, 0.10499786269159503, -0.062363554013711284, -0.15861763495372655, 0.09383568193524985, 0.3939181959665403, -0.27656008918179065, -0.26884566527995757, 0.0699848332236487, -0.30604161406163033, -0.2118925811721455, 0.1010693935833576, -0.07229906417679315, -0.03550747023304788, 0.027477739150238382, 0.10157994742550683, 0.05734640286551084, -0.2407632016551272, 0.30406468881651894, 0.05230247061529265, 0.3344933118915367, 0.02182648366703311, 0.09387210836327385, 0.024960370754209777, 0.018936546451962983, 0.013362971608663296, -0.11642554399840287, 0.10024751048313635, 0.30589243368261276, 0.09399427150865228, 0.3499047126757299, -0.4055528122386554, -0.17960999912877634, 0.13367115431325013, 0.17115269519570397, 0.1254813298859872, -0.022201897731553424, -0.2665424624375613, 0.021621953957237122, -0.17034858401592184, -0.1417747603542322, -0.06184693089992989, 0.027500378679222906, 0.009757548410206943, -0.26866770644243465, 0.061777222187296636, 0.05062345579329015, 0.09261276000520079, -0.053703680088801775, -0.060922407442930995, 0.003028807996931236, 0.2119986044107042, 0.08215439607294861, -0.027411832306647628, 0.18014486617601772, -0.15888294962762922, -0.1303731692137151, 0.3852072293577693, 0.009332276826082706, -0.17745811089382807, 0.21307227077394178, -0.125072635136681, -0.13464200413621188, 0.09791687619304512, 0.1922580591039505, 0.07976570624642347, -0.2057485442638586, -0.018657893771887757, -0.03505221322298095, 0.1703046961693184, -0.002901348481295494, 0.03136741637504978, 0.208620401468446, 0.1996175517603505, 0.09355900022655544, 0.10315660924775662, -0.045445530848554905, -0.165526968759212, -0.24818608426011918, -0.14155661926154764, -0.12002112709905771, 0.054170457528415705, -0.10933449545514233, -0.14797120807953634, 0.3723590482514715, 0.19949800371499052, 0.1832794997807047, 0.023607647636331754, 0.24805126802799882, 0.0945858994630881, 0.037287258451148615, 0.058242938854652114, 0.2155060393969307, 0.02067797491894808, 0.10030293837047705, -0.24286968806025958, 0.15199995423147522, 0.015325104704704533]
|
1,803.08623
|
Hyperexpansive Weighted Translation Semigroups
|
The weighted shift operators turn out to be extremely useful in supplying
interesting examples of operators on Hilbert spaces. With a view to study a
continuous analogue of weighted shifts, M. Embry and A. Lambert initiated the
study of a semigroup of operators $\{S_t\}$ indexed by a non-negative real
number $t$ and termed it as weighted translation semigroup. The operators $S_t$
are defined on $L^2(\mathbb R_+)$ by using a weight function. In this paper, we
continue the work carried out there and obtain characterizations of
hyperexpansive weighted translation semigroups in terms of their symbols. We
also discuss Cauchy dual of a hyperexpansive weighted translation semigroup. As
an application of the techniques developed, we present new proofs of a couple
of known results.
|
math.FA
|
the weighted shift operators turn out to be extremely useful in supplying interesting examples of operators on hilbert spaces with a view to study a continuous analogue of weighted shifts m embry and a lambert initiated the study of a semigroup of operators s_t indexed by a nonnegative real number t and termed it as weighted translation semigroup the operators s_t are defined on l2mathbb r_ by using a weight function in this paper we continue the work carried out there and obtain characterizations of hyperexpansive weighted translation semigroups in terms of their symbols we also discuss cauchy dual of a hyperexpansive weighted translation semigroup as an application of the techniques developed we present new proofs of a couple of known results
|
[['the', 'weighted', 'shift', 'operators', 'turn', 'out', 'to', 'be', 'extremely', 'useful', 'in', 'supplying', 'interesting', 'examples', 'of', 'operators', 'on', 'hilbert', 'spaces', 'with', 'a', 'view', 'to', 'study', 'a', 'continuous', 'analogue', 'of', 'weighted', 'shifts', 'm', 'embry', 'and', 'a', 'lambert', 'initiated', 'the', 'study', 'of', 'a', 'semigroup', 'of', 'operators', 's_t', 'indexed', 'by', 'a', 'nonnegative', 'real', 'number', 't', 'and', 'termed', 'it', 'as', 'weighted', 'translation', 'semigroup', 'the', 'operators', 's_t', 'are', 'defined', 'on', 'l2mathbb', 'r_', 'by', 'using', 'a', 'weight', 'function', 'in', 'this', 'paper', 'we', 'continue', 'the', 'work', 'carried', 'out', 'there', 'and', 'obtain', 'characterizations', 'of', 'hyperexpansive', 'weighted', 'translation', 'semigroups', 'in', 'terms', 'of', 'their', 'symbols', 'we', 'also', 'discuss', 'cauchy', 'dual', 'of', 'a', 'hyperexpansive', 'weighted', 'translation', 'semigroup', 'as', 'an', 'application', 'of', 'the', 'techniques', 'developed', 'we', 'present', 'new', 'proofs', 'of', 'a', 'couple', 'of', 'known', 'results']]
|
[-0.10933623805434108, 0.12193538347122233, -0.06595363867560737, 0.09885593363060997, -0.06699822686582071, -0.07003303950072312, 0.06816921846799888, 0.3563313922982235, -0.32244067518880254, -0.1762046518384433, 0.15754693863077518, -0.30164893747299726, -0.17642176084861647, 0.23587886134704544, -0.10974921087627529, 0.058185228795484926, 0.05626283791374232, 0.06660534387462025, -0.13902669637769338, -0.22524992148410988, 0.3784138748239054, 0.017802992648613014, 0.1912500296001796, 0.04443774339895634, 0.10881817383600063, 0.01539636073542423, -0.12205712722812886, -0.002218329011783248, -0.160883433800038, 0.1449544160210787, 0.26121056220898803, 0.12409454673437066, 0.2983339350769815, -0.3726361436372409, -0.17117312525353226, 0.1880367303478959, 0.13173810316661952, -0.04642046846976107, -0.04913409712503008, -0.3042740965868942, 0.058680151161722476, -0.16713660232509014, -0.12120765872818769, -0.12871412587634548, 0.03155522862617232, 0.04038182857873865, -0.2919562286010287, -0.012558685652157826, 0.1374859190216769, 0.0900308326579493, -0.08319967237041621, -0.0983059013483771, -0.021973341821738688, 0.07580873428569099, 0.008197577922131683, 0.061054064651767985, 0.06977972402390031, -0.03750096109398015, -0.13956459245232286, 0.3301246679296381, -0.10019095122888608, -0.24542021708272885, 0.09853273284331453, -0.11560769650138548, -0.13555529745310912, 0.036184899302840724, 0.1725940234428577, 0.19689261800319444, -0.12096445932679001, 0.1385791900851115, -0.10983516511003502, 0.08002770410804841, 0.09597685071639717, 0.057515345941312974, 0.11658971424817612, 0.1119199448387276, 0.10112175077856442, 0.20607077993822787, 0.03759964232974243, -0.051968163689961044, -0.3542597605312457, -0.17502340852649365, -0.16444247519047778, 0.0989746700926516, -0.05702666228708189, -0.20269516873799387, 0.39420303806173995, 0.08230013930864755, 0.23134577761358413, 0.09977244720107219, 0.18178846338977578, 0.15013116491828724, 0.06274166159507376, 0.039092394519505684, 0.08569037602531158, 0.18884962822165585, 0.1188172793882273, -0.15490631938083707, -0.006666739880380251, 0.19865924348581399]
|
1,803.08624
|
Classification of simulated radio signals using Wide Residual Networks
for use in the search for extra-terrestrial intelligence
|
We describe a new approach and algorithm for the detection of artificial
signals and their classification in the search for extraterrestrial
intelligence (SETI). The characteristics of radio signals observed during SETI
research are often most apparent when those signals are represented as
spectrograms. Additionally, many observed signals tend to share the same
characteristics, allowing for sorting of the signals into different classes.
For this work, complex-valued time-series data were simulated to produce a
corpus of 140,000 signals from seven different signal classes. A wide residual
neural network was then trained to classify these signal types using the
gray-scale 2D spectrogram representation of those signals. An average $F_1$
score of 95.11\% was attained when tested on previously unobserved simulated
signals. We also report on the performance of the model across a range of
signal amplitudes.
|
cs.LG astro-ph.IM cs.CV
|
we describe a new approach and algorithm for the detection of artificial signals and their classification in the search for extraterrestrial intelligence seti the characteristics of radio signals observed during seti research are often most apparent when those signals are represented as spectrograms additionally many observed signals tend to share the same characteristics allowing for sorting of the signals into different classes for this work complexvalued timeseries data were simulated to produce a corpus of 140000 signals from seven different signal classes a wide residual neural network was then trained to classify these signal types using the grayscale 2d spectrogram representation of those signals an average f_1 score of 9511 was attained when tested on previously unobserved simulated signals we also report on the performance of the model across a range of signal amplitudes
|
[['we', 'describe', 'a', 'new', 'approach', 'and', 'algorithm', 'for', 'the', 'detection', 'of', 'artificial', 'signals', 'and', 'their', 'classification', 'in', 'the', 'search', 'for', 'extraterrestrial', 'intelligence', 'seti', 'the', 'characteristics', 'of', 'radio', 'signals', 'observed', 'during', 'seti', 'research', 'are', 'often', 'most', 'apparent', 'when', 'those', 'signals', 'are', 'represented', 'as', 'spectrograms', 'additionally', 'many', 'observed', 'signals', 'tend', 'to', 'share', 'the', 'same', 'characteristics', 'allowing', 'for', 'sorting', 'of', 'the', 'signals', 'into', 'different', 'classes', 'for', 'this', 'work', 'complexvalued', 'timeseries', 'data', 'were', 'simulated', 'to', 'produce', 'a', 'corpus', 'of', '140000', 'signals', 'from', 'seven', 'different', 'signal', 'classes', 'a', 'wide', 'residual', 'neural', 'network', 'was', 'then', 'trained', 'to', 'classify', 'these', 'signal', 'types', 'using', 'the', 'grayscale', '2d', 'spectrogram', 'representation', 'of', 'those', 'signals', 'an', 'average', 'f_1', 'score', 'of', '9511', 'was', 'attained', 'when', 'tested', 'on', 'previously', 'unobserved', 'simulated', 'signals', 'we', 'also', 'report', 'on', 'the', 'performance', 'of', 'the', 'model', 'across', 'a', 'range', 'of', 'signal', 'amplitudes']]
|
[-0.07837534886329695, 0.07807503178239979, -0.07612569848621699, 0.07849537484484367, -0.11360536594139903, -0.13207514413205304, 0.019675677873306256, 0.43468564429453443, -0.25732596145498154, -0.3737221414335352, 0.099422289448076, -0.3043134943477081, -0.1829468703695706, 0.26119796634490666, -0.022911561491962214, 0.0536081801611524, 0.07661961686195232, 0.06900381320156157, -0.03816152283137566, -0.2427861496449021, 0.24688712983651268, 0.015973804192967657, 0.3287072829986201, -0.07312783544981166, 0.08165051211004279, -0.041333821700199655, -0.0952850934555684, -0.031024901106204362, -0.011984586545889428, 0.0835677245351717, 0.30625573595936756, 0.21414020572810022, 0.22084114658541248, -0.4089908237688075, -0.24520991132458972, 0.17426309413171576, 0.10828756480792859, 0.10101529275928449, -0.04176612690098135, -0.3698293118688621, 0.10637558515260655, -0.1022755793449854, -0.007431062246511753, -0.0417547541271363, 0.028845855637096372, 0.04300697699506046, -0.2627082012061562, 0.0432155161018963, 0.026428672982225742, 0.10072847333722713, -0.09897740591576505, -0.16571796433720037, 0.026377347497535602, 0.1720274699474615, 0.025503377751377235, -0.007120887392648685, 0.12034404166813072, -0.13666425536288634, -0.15863787214082659, 0.3514864690080145, -0.0711126491056293, -0.17041062337829543, 0.21396788342197642, -0.10520952788384673, -0.14849795453614534, 0.15787962340413683, 0.27453970399342087, 0.09114251312575675, -0.20121412047581516, -0.048031760968751086, -0.013546306821972803, 0.17140307394031407, 0.0757802351766539, 0.033430434038680526, 0.2266213015462377, 0.1717692184843179, -0.034942044246735235, 0.13536476098085032, -0.20219476290985494, 0.004820954095733289, -0.20071792545206704, -0.08017907113088925, -0.1913641535810937, -0.01645400845340656, -0.06841437801122631, -0.12842909797598936, 0.47579364288122133, 0.1857507974189475, 0.19034080402190356, 0.0872594913539102, 0.31362061396493274, 0.056373906872389294, 0.09479761128383864, 0.022461813797516033, 0.2276866607529048, 0.048407463456637094, 0.09297074084835392, -0.12161008868177414, 0.08285766505440206, -0.025244469581306668]
|
1,803.08625
|
A Concept Learning Tool Based On Calculating Version Space Cardinality
|
In this paper, we proposed VeSC-CoL (Version Space Cardinality based Concept
Learning) to deal with concept learning on extremely imbalanced datasets,
especially when cross-validation is not a viable option. VeSC-CoL uses version
space cardinality as a measure for model quality to replace cross-validation.
Instead of naive enumeration of the version space, Ordered Binary Decision
Diagram and Boolean Satisfiability are used to compute the version space.
Experiments show that VeSC-CoL can accurately learn the target concept when
computational resource is allowed.
|
cs.AI
|
in this paper we proposed vesccol version space cardinality based concept learning to deal with concept learning on extremely imbalanced datasets especially when crossvalidation is not a viable option vesccol uses version space cardinality as a measure for model quality to replace crossvalidation instead of naive enumeration of the version space ordered binary decision diagram and boolean satisfiability are used to compute the version space experiments show that vesccol can accurately learn the target concept when computational resource is allowed
|
[['in', 'this', 'paper', 'we', 'proposed', 'vesccol', 'version', 'space', 'cardinality', 'based', 'concept', 'learning', 'to', 'deal', 'with', 'concept', 'learning', 'on', 'extremely', 'imbalanced', 'datasets', 'especially', 'when', 'crossvalidation', 'is', 'not', 'a', 'viable', 'option', 'vesccol', 'uses', 'version', 'space', 'cardinality', 'as', 'a', 'measure', 'for', 'model', 'quality', 'to', 'replace', 'crossvalidation', 'instead', 'of', 'naive', 'enumeration', 'of', 'the', 'version', 'space', 'ordered', 'binary', 'decision', 'diagram', 'and', 'boolean', 'satisfiability', 'are', 'used', 'to', 'compute', 'the', 'version', 'space', 'experiments', 'show', 'that', 'vesccol', 'can', 'accurately', 'learn', 'the', 'target', 'concept', 'when', 'computational', 'resource', 'is', 'allowed']]
|
[-0.020617474819300697, 0.0503414351347601, -0.08232726159039885, 0.1609937717046705, -0.19179115851584355, -0.16792922624154016, 0.10426670044107596, 0.39927378416759896, -0.2738607035018504, -0.299299309134949, 0.11530107746220893, -0.21749613317660987, -0.1404004675336182, 0.19212653267604765, -0.1753854375332594, 0.05707930751377717, 0.1098750182252843, 0.0434262425173074, -0.0565061272791354, -0.3248727280064486, 0.3110353114432655, 0.04698541103862226, 0.3373689638916403, -0.04387719749938697, 0.10005307112587616, 0.06004418298543897, 0.023729689142783172, 0.06336997903272276, -0.11463140594178185, 0.150395366770681, 0.3280505443792208, 0.21080859557841905, 0.3198539020959288, -0.3232912784209475, -0.17312263965141028, 0.18399885788094253, 0.11982231507427059, 0.077787720140077, 0.004874652640137356, -0.2792418751938385, 0.06934024966321886, -0.20318155973218383, -0.0508049140105868, -0.18111088982986984, -0.02005027962732129, -0.05996570815332234, -0.30958840810344557, -0.045439980531227775, 0.0002167725993786007, 0.018677497759927063, -0.030704961105948315, -0.10701258365879766, 0.03599546152981929, 0.01893456020989106, -0.01108261564077111, 0.08552857496833895, 0.10400878026266583, -0.09061172153742518, -0.16691501807654277, 0.36932375038741155, -0.046509823772066736, -0.260368224629201, 0.14828240802744402, -0.037864029919728634, -0.17992235958517994, 0.0997941334033385, 0.1860881896223873, 0.10331637598574162, -0.11001184368105896, 0.09169024764487403, -0.08721815862227231, 0.22003206491062882, 0.053034214177750984, 0.01329740796936676, 0.14091945481486617, 0.2561297993583139, 0.09304406888550147, 0.19928748715319672, -0.09428442899661604, -0.10670231593539939, -0.22692851981846615, -0.13661921754246578, -0.22273021419532596, -0.026138101113429003, -0.07517707651695674, -0.19352520295888098, 0.31162083092640386, 0.20178353002411314, 0.14178210352547466, 0.14364528310252353, 0.30576985601801426, 0.05057144611928379, 0.04721975667780498, 0.08998486706987023, 0.12413663139159326, 0.06642776681401301, 0.0584665772083099, -0.16066794021171518, 0.11350753892911598, 0.1593552200938575]
|
1,803.08626
|
Crosstalk-free multi-wavelength coherent light storage via Brillouin
interaction
|
Stimulated Brillouin scattering drives a coherent interaction between optical
signals and acoustic phonons and this effect can be used for storing optical
information in acoustic waves. An important consideration arises when multiple
optical frequencies are simultaneously employed in the Brillouin process: in
this case the acoustic phonons that are addressed by each optical wavelength
can be separated by frequencies far smaller than the acoustic phonon linewidth,
potentially leading to crosstalk between the optical modes. Here we extend the
concept of Brillouin-based light storage to multiple wavelength channels. We
experimentally and theoretically show that the accumulated phase mismatch over
the length of the spatially extended phonons allows each optical wavelength
channel to address a distinct phonon mode, ensuring negligible crosstalk, even
if the phonons overlap in frequency. Moreover, we demonstrate that the strict
phase matching condition enables the preservation of the coherence of the
opto-acoustic transfer at closely spaced multiple acoustic frequencies. This
particular phase-mismatch for broad-bandwidth pulses has far-reaching
implications allowing dense wavelength multiplexing in Brillouin-based light
storage, multi-frequency Brillouin sensing, multi-wavelength Brillouin lasers,
parallel microwave processing and quantum photon-phonon interactions.
|
physics.optics
|
stimulated brillouin scattering drives a coherent interaction between optical signals and acoustic phonons and this effect can be used for storing optical information in acoustic waves an important consideration arises when multiple optical frequencies are simultaneously employed in the brillouin process in this case the acoustic phonons that are addressed by each optical wavelength can be separated by frequencies far smaller than the acoustic phonon linewidth potentially leading to crosstalk between the optical modes here we extend the concept of brillouinbased light storage to multiple wavelength channels we experimentally and theoretically show that the accumulated phase mismatch over the length of the spatially extended phonons allows each optical wavelength channel to address a distinct phonon mode ensuring negligible crosstalk even if the phonons overlap in frequency moreover we demonstrate that the strict phase matching condition enables the preservation of the coherence of the optoacoustic transfer at closely spaced multiple acoustic frequencies this particular phasemismatch for broadbandwidth pulses has farreaching implications allowing dense wavelength multiplexing in brillouinbased light storage multifrequency brillouin sensing multiwavelength brillouin lasers parallel microwave processing and quantum photonphonon interactions
|
[['stimulated', 'brillouin', 'scattering', 'drives', 'a', 'coherent', 'interaction', 'between', 'optical', 'signals', 'and', 'acoustic', 'phonons', 'and', 'this', 'effect', 'can', 'be', 'used', 'for', 'storing', 'optical', 'information', 'in', 'acoustic', 'waves', 'an', 'important', 'consideration', 'arises', 'when', 'multiple', 'optical', 'frequencies', 'are', 'simultaneously', 'employed', 'in', 'the', 'brillouin', 'process', 'in', 'this', 'case', 'the', 'acoustic', 'phonons', 'that', 'are', 'addressed', 'by', 'each', 'optical', 'wavelength', 'can', 'be', 'separated', 'by', 'frequencies', 'far', 'smaller', 'than', 'the', 'acoustic', 'phonon', 'linewidth', 'potentially', 'leading', 'to', 'crosstalk', 'between', 'the', 'optical', 'modes', 'here', 'we', 'extend', 'the', 'concept', 'of', 'brillouinbased', 'light', 'storage', 'to', 'multiple', 'wavelength', 'channels', 'we', 'experimentally', 'and', 'theoretically', 'show', 'that', 'the', 'accumulated', 'phase', 'mismatch', 'over', 'the', 'length', 'of', 'the', 'spatially', 'extended', 'phonons', 'allows', 'each', 'optical', 'wavelength', 'channel', 'to', 'address', 'a', 'distinct', 'phonon', 'mode', 'ensuring', 'negligible', 'crosstalk', 'even', 'if', 'the', 'phonons', 'overlap', 'in', 'frequency', 'moreover', 'we', 'demonstrate', 'that', 'the', 'strict', 'phase', 'matching', 'condition', 'enables', 'the', 'preservation', 'of', 'the', 'coherence', 'of', 'the', 'optoacoustic', 'transfer', 'at', 'closely', 'spaced', 'multiple', 'acoustic', 'frequencies', 'this', 'particular', 'phasemismatch', 'for', 'broadbandwidth', 'pulses', 'has', 'farreaching', 'implications', 'allowing', 'dense', 'wavelength', 'multiplexing', 'in', 'brillouinbased', 'light', 'storage', 'multifrequency', 'brillouin', 'sensing', 'multiwavelength', 'brillouin', 'lasers', 'parallel', 'microwave', 'processing', 'and', 'quantum', 'photonphonon', 'interactions']]
|
[-0.1913682846521553, 0.24553699277456156, -0.032515470562460465, 0.013864714930381697, -0.09238119416495566, -0.13732238551835899, 0.07058446608059754, 0.48113350887059664, -0.30939547553028934, -0.19112119932175098, 0.037938338029978785, -0.27802398364316844, -0.1105215940819585, 0.25321550241817187, 0.008063043439084424, 0.051499629497278335, 0.04640909055684948, -0.06016751392692452, 0.029627838013329487, -0.12847223986794148, 0.23986807934336324, 0.07416663382803323, 0.38689463301795907, 0.05662493167091265, 0.0763732444926805, 0.0615941528074005, -0.00023731276621865162, -0.078184165983388, -0.07829121862307767, 0.09275799851042515, 0.33580176348637986, 0.004409693487186255, 0.2546594920203964, -0.4485717233707452, -0.2923031592918508, 0.1108920646456783, 0.20392887432056, 0.18046561460785943, -0.024530422108315512, -0.25577258450686724, 0.0021869432305989984, -0.09682460336857501, -0.08490771394972195, -0.022948742597676066, -0.010992240725220415, -0.026872755556403758, -0.2339222716042699, 0.07604779157652286, 0.023882938178864895, 0.043669016423047255, -0.06827719886065331, -0.025921596627807318, -0.022541087316856435, 0.10230373122092654, -0.029726025605653596, -0.039180798852145045, 0.10942698926788458, -0.05001269716785066, -0.09686172315486649, 0.37307483196133673, -0.06284106053275709, -0.10114889028456124, 0.168182326155889, -0.15456550280100473, 0.018018291854721043, 0.18306543545630974, 0.17330324403635472, 0.05136075986558363, -0.13315147366584473, 0.007591277416847521, 0.03420438994159246, 0.22063995393607036, 0.18591403487715974, 0.21217500752452031, 0.24552806845330244, 0.1566353391351272, 0.010871663918541797, 0.15893574344909975, -0.16031670516003027, 0.004652995664324591, -0.22710620754401006, -0.07415178315076644, -0.20789289912621897, 0.016517740760165052, -0.08261227851191161, -0.09885814100212557, 0.41430728417410195, 0.17592293519771257, 0.15324355549746135, -0.004487158534215899, 0.3682892936510788, 0.11974754055191934, 0.12288485890691424, 0.047659482889639296, 0.33713350782181295, 0.14699785711956548, 0.11889071245586719, -0.3034079019825739, -0.046712074652522306, -0.04013423407034085]
|
1,803.08627
|
Holographic complexity of the disk subregion in (2+1)-dimensional gapped
systems
|
Using the volume of the space enclosed by the Ryu-Takayanagi (RT) surface, we
study the complexity of the disk-shape subregion (with radius R) in various
(2+1)-dimensional gapped systems with gravity dual. These systems include a
class of toy models with singular IR and the bottom-up models for quantum
chromodynamics and fractional quantum Hall effects. Two main results are: i) in
the large-R expansion of the complexity, the R-linear term is always absent,
similar to the absence of topological entanglement entropy; ii) when the
entanglement entropy exhibits the classic `swallowtail' phase transition, the
complexity is sensitive but reacts differently.
|
hep-th gr-qc
|
using the volume of the space enclosed by the ryutakayanagi rt surface we study the complexity of the diskshape subregion with radius r in various 21dimensional gapped systems with gravity dual these systems include a class of toy models with singular ir and the bottomup models for quantum chromodynamics and fractional quantum hall effects two main results are i in the larger expansion of the complexity the rlinear term is always absent similar to the absence of topological entanglement entropy ii when the entanglement entropy exhibits the classic swallowtail phase transition the complexity is sensitive but reacts differently
|
[['using', 'the', 'volume', 'of', 'the', 'space', 'enclosed', 'by', 'the', 'ryutakayanagi', 'rt', 'surface', 'we', 'study', 'the', 'complexity', 'of', 'the', 'diskshape', 'subregion', 'with', 'radius', 'r', 'in', 'various', '21dimensional', 'gapped', 'systems', 'with', 'gravity', 'dual', 'these', 'systems', 'include', 'a', 'class', 'of', 'toy', 'models', 'with', 'singular', 'ir', 'and', 'the', 'bottomup', 'models', 'for', 'quantum', 'chromodynamics', 'and', 'fractional', 'quantum', 'hall', 'effects', 'two', 'main', 'results', 'are', 'i', 'in', 'the', 'larger', 'expansion', 'of', 'the', 'complexity', 'the', 'rlinear', 'term', 'is', 'always', 'absent', 'similar', 'to', 'the', 'absence', 'of', 'topological', 'entanglement', 'entropy', 'ii', 'when', 'the', 'entanglement', 'entropy', 'exhibits', 'the', 'classic', 'swallowtail', 'phase', 'transition', 'the', 'complexity', 'is', 'sensitive', 'but', 'reacts', 'differently']]
|
[-0.13951767947553295, 0.15968489512440046, -0.0742570883974585, 0.06300142867614192, -0.013559280799663797, -0.18205583002893444, -0.02761663076211223, 0.28333444454308065, -0.25179373980404773, -0.24728954445371137, 0.09637180916556366, -0.3125942915735044, -0.14522510687155382, 0.14705847437037345, -0.08056113816683694, 0.07623889018800489, -0.03137532777951232, 0.03836422343263213, -0.12469027603843383, -0.24410213747451423, 0.35985973661727444, 0.02700994102930536, 0.2870502863934606, 0.048113169984853994, 0.024382267432401374, -0.047420153760218194, 0.010862871923730994, 0.10055458079993829, -0.18261539943193142, 0.0851939476216307, 0.2180006137265193, 0.05865882912280076, 0.20400221182071432, -0.3965246938359068, -0.23689511154388668, 0.0765659695714522, 0.09050416873235788, 0.13231843100784688, -0.023058128955403382, -0.2703021982570692, 0.02830760194254773, -0.15695690173163954, -0.11221831627855343, -0.03151616142416487, 0.0257198418566615, -0.06262415526577328, -0.1940009972194628, 0.12554281049084906, 0.04618936841262086, 0.0442892670707435, -0.02832800378709347, -0.07037438664167207, -0.07099096340540682, 0.10524921599515401, 0.028285510063513507, 0.03796371581669593, 0.13183970943245352, -0.15291047464980154, -0.11711062052363187, 0.3715248374501243, -0.0784892376217687, -0.16541839245592757, 0.2218449248894289, -0.18186962576487994, -0.10247335194286947, 0.12716991575529837, 0.09132467651245546, 0.1182997876790718, -0.07507190848917496, 0.1475870075661746, 0.0007017559564330292, 0.15825095673908993, 0.013935537198653482, 0.11881218007789468, 0.2521164395504308, 0.11374536445792004, 0.033419436627846896, 0.22068353424654152, -0.07067193272428549, -0.1745061907651169, -0.34050027562343343, -0.20028707885886637, -0.19689736271524155, 0.04123268038870729, -0.14872140919626928, -0.19208874087780714, 0.36092613821514236, 0.0987013600937718, 0.16590204490918894, 0.060166057793195456, 0.2569842908616957, 0.13936300915951022, 0.06960072472682033, 0.09318050575366586, 0.2253895877974526, 0.12224417727450099, 0.10882354632010494, -0.3255685696459128, 0.020847535668397133, 0.1349312018755139]
|
1,803.08628
|
Enhanced single photon emission from carbon nanotube dopant states
coupled to silicon microcavities
|
Single-walled carbon nanotubes are a promising material as quantum light
sources at room temperature and as nanoscale light sources for integrated
photonic circuits on silicon. Here we show that integration of dopant states in
carbon nanotubes and silicon microcavities can provide bright and high-purity
single photon emitters on silicon photonics platform at room temperature. We
perform photoluminescence spectroscopy and observe enhancement of emission from
the dopant states by a factor of $\sim$100, and cavity-enhanced radiative decay
is confirmed using time-resolved measurements, where $\sim$30% decrease of
emission lifetime is observed. Statistics of photons emitted from the
cavity-coupled dopant states are investigated by photon correlation
measurements, and high-purity single photon generation is observed. Excitation
power dependence of photon emission statistics shows that the degree of photon
antibunching can be kept low even when the excitation power increases, while
single photon emission rate can be increased up to $\sim 1.7 \times 10^7$ Hz.
|
cond-mat.mes-hall
|
singlewalled carbon nanotubes are a promising material as quantum light sources at room temperature and as nanoscale light sources for integrated photonic circuits on silicon here we show that integration of dopant states in carbon nanotubes and silicon microcavities can provide bright and highpurity single photon emitters on silicon photonics platform at room temperature we perform photoluminescence spectroscopy and observe enhancement of emission from the dopant states by a factor of sim100 and cavityenhanced radiative decay is confirmed using timeresolved measurements where sim30 decrease of emission lifetime is observed statistics of photons emitted from the cavitycoupled dopant states are investigated by photon correlation measurements and highpurity single photon generation is observed excitation power dependence of photon emission statistics shows that the degree of photon antibunching can be kept low even when the excitation power increases while single photon emission rate can be increased up to sim 17 times 107 hz
|
[['singlewalled', 'carbon', 'nanotubes', 'are', 'a', 'promising', 'material', 'as', 'quantum', 'light', 'sources', 'at', 'room', 'temperature', 'and', 'as', 'nanoscale', 'light', 'sources', 'for', 'integrated', 'photonic', 'circuits', 'on', 'silicon', 'here', 'we', 'show', 'that', 'integration', 'of', 'dopant', 'states', 'in', 'carbon', 'nanotubes', 'and', 'silicon', 'microcavities', 'can', 'provide', 'bright', 'and', 'highpurity', 'single', 'photon', 'emitters', 'on', 'silicon', 'photonics', 'platform', 'at', 'room', 'temperature', 'we', 'perform', 'photoluminescence', 'spectroscopy', 'and', 'observe', 'enhancement', 'of', 'emission', 'from', 'the', 'dopant', 'states', 'by', 'a', 'factor', 'of', 'sim100', 'and', 'cavityenhanced', 'radiative', 'decay', 'is', 'confirmed', 'using', 'timeresolved', 'measurements', 'where', 'sim30', 'decrease', 'of', 'emission', 'lifetime', 'is', 'observed', 'statistics', 'of', 'photons', 'emitted', 'from', 'the', 'cavitycoupled', 'dopant', 'states', 'are', 'investigated', 'by', 'photon', 'correlation', 'measurements', 'and', 'highpurity', 'single', 'photon', 'generation', 'is', 'observed', 'excitation', 'power', 'dependence', 'of', 'photon', 'emission', 'statistics', 'shows', 'that', 'the', 'degree', 'of', 'photon', 'antibunching', 'can', 'be', 'kept', 'low', 'even', 'when', 'the', 'excitation', 'power', 'increases', 'while', 'single', 'photon', 'emission', 'rate', 'can', 'be', 'increased', 'up', 'to', 'sim', '17', 'times', '107', 'hz']]
|
[-0.060147247798740866, 0.2656784138828516, -0.002539574448019266, -0.017008267148048616, 0.04920665957188854, -0.1997294458343337, 0.10037510787757735, 0.5108127305656671, -0.18670707441866397, -0.35998763638742576, -0.008869503433040033, -0.4187294586375356, 0.015358450260634223, 0.25800053528199596, 0.06531539781329533, 0.044262184804926316, 0.04515927329193801, -0.0921291635571591, -0.005431550239833693, -0.14561995677649975, 0.20217971132680154, 0.09802437702853543, 0.36082872403475147, 0.14470230985122423, 0.11923961335793137, -0.053190194213142, 0.06150187507737428, -0.08418107932588706, -0.05212760743035081, 0.03998041074761811, 0.25610595966223626, -0.02107819667396446, 0.17111417689671118, -0.42333082952536644, -0.22328448882636925, 0.06255726132585551, 0.19241751849340896, 0.12290467291759948, -0.1008035847125575, -0.26752092064668737, 0.039137691229892274, -0.12298962478555041, -0.10331225058917577, -0.022872393789390724, -0.00595661743854483, -0.007702364446983362, -0.21463629031553866, 0.11403687491081654, -0.040326312208392966, 0.05471668069949374, -0.006736988822619121, -0.05113142689689994, -0.05925921523633103, -0.0006230261772482966, -0.05784315734325598, -0.00985536380438134, 0.3258728259797984, -0.0985140536702238, -0.15685831285353438, 0.34543828488948447, -0.12375486296912035, -0.009354416721810897, 0.1081150866994479, -0.22418548703348884, -0.05960370043544875, 0.23780691562841336, 0.146803116183728, 0.14359299451423188, -0.1322903720647446, -0.026660261398452956, 0.06108292005956173, 0.2788932393025607, 0.11447738231470188, 0.2198993731259058, 0.2688586210521559, 0.20450640686477223, -0.01711596354842186, 0.159191181769905, -0.19737188877848288, 0.05181615870601187, -0.22073911054370304, -0.18162395862086367, -0.21548722023920466, 0.17078067543605963, -0.08535798069341884, -0.10096159092073019, 0.3765196029903988, 0.06910420186196764, 0.12980748839365938, -0.00840294774932166, 0.28768127056459586, 0.17089415718490877, 0.10374065891529123, 0.003446408435702324, 0.32645114805549386, 0.2010266303581496, 0.07690688855480403, -0.24817900000450513, 0.009351386395283044, -0.13443088562383007]
|
1,803.08629
|
Generalization Challenges for Neural Architectures in Audio Source
Separation
|
Recent work has shown that recurrent neural networks can be trained to
separate individual speakers in a sound mixture with high fidelity. Here we
explore convolutional neural network models as an alternative and show that
they achieve state-of-the-art results with an order of magnitude fewer
parameters. We also characterize and compare the robustness and ability of
these different approaches to generalize under three different test conditions:
longer time sequences, the addition of intermittent noise, and different
datasets not seen during training. For the last condition, we create a new
dataset, RealTalkLibri, to test source separation in real-world environments.
We show that the acoustics of the environment have significant impact on the
structure of the waveform and the overall performance of neural network models,
with the convolutional model showing superior ability to generalize to new
environments. The code for our study is available at
https://github.com/ShariqM/source_separation.
|
cs.SD cs.LG eess.SP
|
recent work has shown that recurrent neural networks can be trained to separate individual speakers in a sound mixture with high fidelity here we explore convolutional neural network models as an alternative and show that they achieve stateoftheart results with an order of magnitude fewer parameters we also characterize and compare the robustness and ability of these different approaches to generalize under three different test conditions longer time sequences the addition of intermittent noise and different datasets not seen during training for the last condition we create a new dataset realtalklibri to test source separation in realworld environments we show that the acoustics of the environment have significant impact on the structure of the waveform and the overall performance of neural network models with the convolutional model showing superior ability to generalize to new environments the code for our study is available at httpsgithubcomshariqmsource_separation
|
[['recent', 'work', 'has', 'shown', 'that', 'recurrent', 'neural', 'networks', 'can', 'be', 'trained', 'to', 'separate', 'individual', 'speakers', 'in', 'a', 'sound', 'mixture', 'with', 'high', 'fidelity', 'here', 'we', 'explore', 'convolutional', 'neural', 'network', 'models', 'as', 'an', 'alternative', 'and', 'show', 'that', 'they', 'achieve', 'stateoftheart', 'results', 'with', 'an', 'order', 'of', 'magnitude', 'fewer', 'parameters', 'we', 'also', 'characterize', 'and', 'compare', 'the', 'robustness', 'and', 'ability', 'of', 'these', 'different', 'approaches', 'to', 'generalize', 'under', 'three', 'different', 'test', 'conditions', 'longer', 'time', 'sequences', 'the', 'addition', 'of', 'intermittent', 'noise', 'and', 'different', 'datasets', 'not', 'seen', 'during', 'training', 'for', 'the', 'last', 'condition', 'we', 'create', 'a', 'new', 'dataset', 'realtalklibri', 'to', 'test', 'source', 'separation', 'in', 'realworld', 'environments', 'we', 'show', 'that', 'the', 'acoustics', 'of', 'the', 'environment', 'have', 'significant', 'impact', 'on', 'the', 'structure', 'of', 'the', 'waveform', 'and', 'the', 'overall', 'performance', 'of', 'neural', 'network', 'models', 'with', 'the', 'convolutional', 'model', 'showing', 'superior', 'ability', 'to', 'generalize', 'to', 'new', 'environments', 'the', 'code', 'for', 'our', 'study', 'is', 'available', 'at', 'httpsgithubcomshariqmsource_separation']]
|
[-0.05789092811017992, 0.036619133596565955, -0.06438049928836105, 0.0519863105228197, -0.05448091539888787, -0.1531732528713125, -0.0035461018084955048, 0.4697690539481774, -0.2520429423360915, -0.34333307907177124, 0.06725502002846555, -0.23442408749440186, -0.1994426005428106, 0.22801157594232124, -0.11345720532822462, 0.07728360855663327, 0.13391022368426053, 0.03468033282781466, -0.08088579393093619, -0.3175812121726651, 0.29953186805720744, 0.0810841568220984, 0.3405877149854065, 0.02043051307514297, 0.1161673167526958, -0.1086828472407561, -0.019327616524016877, -0.001409790552431114, -0.07794236387104628, 0.10968155711790888, 0.23832861045737214, 0.1599029995087849, 0.2788751545562212, -0.4588315133923586, -0.26626999523411965, 0.11475905930807054, 0.11657453669418752, 0.1284192355004718, -0.005467049906220497, -0.3150083427760147, 0.11368313401980115, -0.18421885694219717, -0.0336075140438764, -0.14109869115054607, -0.012422357161175197, 0.03147302623215118, -0.27582126107553845, 0.03826488578560087, 0.08294794755876327, 0.039675521041253506, -0.05743424739675518, -0.11165581393042501, 0.005192536672144393, 0.18126139630855415, 0.03546345540286291, 0.03260111198170294, 0.09127394374932202, -0.1670171909647482, -0.14967681754144355, 0.322348338053365, -0.09423564036268557, -0.19522665001937306, 0.27620251248525063, -0.07889338784103453, -0.13947059926380154, 0.07833212535684063, 0.27560840881409937, 0.09862873548458159, -0.1664414834563168, -0.031072068144977222, -0.037967704887449424, 0.21316756847524412, 0.05358326685628001, 0.026247029495261556, 0.16586645720706938, 0.2370254290355763, 0.010077785151276055, 0.17996379557396874, -0.1352836361702558, -0.058494450553963094, -0.21228123860741951, -0.09884703099320997, -0.16684691626644155, -0.009572192336146517, -0.09906539516341069, -0.12678209688857978, 0.4330277495794523, 0.27488177300522654, 0.19371460667732632, 0.12990924656312441, 0.3202651943486761, 0.022114044257019922, 0.09846399365481592, 0.08506075728645313, 0.22195004672139987, 0.037255481074065705, 0.10067285857373245, -0.18325272782600788, 0.08613906999062879, -0.022770398696490998]
|
1,803.0863
|
Energy nonconservation as a link between $f(R,T)$ gravity and
noncommutative quantum theory
|
$f(R,T)$ gravity was proposed as an extension of the $f(R)$ theories,
containing not just geometrical correction terms to the General Relativity
equations, but also material correction terms, dependent on the trace of the
energy-momentum tensor $T$. These material extra terms prevent the
energy-momentum tensor of the theory to be conserved, even in a flat
background. Energy nonconservation is a prediction of quantum theory with
time-space noncommutativity. If time is considered as an operator and there are
compact spatial coordinates which do not commute with time, then the time
evolution gets quantized and energy conservation can be violated. In the
present work we construct a model in a 5-dimensional flat spacetime consisting
of 3 commutative spatial dimensions and 1 compact spatial dimension whose
coordinate does not commute with time. We show that energy flows from the
3-dimensional commutative slice into the compact extra dimension (and
vice-versa), so that conservation of energy is restored. In this model the
energy flux is proportional to the energy density of the matter content,
leading to a differential equation for $f(R,T)$, thus providing a physical
criterion to restrict the functional form of $f(R,T)$. We solve this equation
and analyze the behavior of its solution in a spherically symmetric context.
|
gr-qc hep-th math-ph math.MP
|
frt gravity was proposed as an extension of the fr theories containing not just geometrical correction terms to the general relativity equations but also material correction terms dependent on the trace of the energymomentum tensor t these material extra terms prevent the energymomentum tensor of the theory to be conserved even in a flat background energy nonconservation is a prediction of quantum theory with timespace noncommutativity if time is considered as an operator and there are compact spatial coordinates which do not commute with time then the time evolution gets quantized and energy conservation can be violated in the present work we construct a model in a 5dimensional flat spacetime consisting of 3 commutative spatial dimensions and 1 compact spatial dimension whose coordinate does not commute with time we show that energy flows from the 3dimensional commutative slice into the compact extra dimension and viceversa so that conservation of energy is restored in this model the energy flux is proportional to the energy density of the matter content leading to a differential equation for frt thus providing a physical criterion to restrict the functional form of frt we solve this equation and analyze the behavior of its solution in a spherically symmetric context
|
[['frt', 'gravity', 'was', 'proposed', 'as', 'an', 'extension', 'of', 'the', 'fr', 'theories', 'containing', 'not', 'just', 'geometrical', 'correction', 'terms', 'to', 'the', 'general', 'relativity', 'equations', 'but', 'also', 'material', 'correction', 'terms', 'dependent', 'on', 'the', 'trace', 'of', 'the', 'energymomentum', 'tensor', 't', 'these', 'material', 'extra', 'terms', 'prevent', 'the', 'energymomentum', 'tensor', 'of', 'the', 'theory', 'to', 'be', 'conserved', 'even', 'in', 'a', 'flat', 'background', 'energy', 'nonconservation', 'is', 'a', 'prediction', 'of', 'quantum', 'theory', 'with', 'timespace', 'noncommutativity', 'if', 'time', 'is', 'considered', 'as', 'an', 'operator', 'and', 'there', 'are', 'compact', 'spatial', 'coordinates', 'which', 'do', 'not', 'commute', 'with', 'time', 'then', 'the', 'time', 'evolution', 'gets', 'quantized', 'and', 'energy', 'conservation', 'can', 'be', 'violated', 'in', 'the', 'present', 'work', 'we', 'construct', 'a', 'model', 'in', 'a', '5dimensional', 'flat', 'spacetime', 'consisting', 'of', '3', 'commutative', 'spatial', 'dimensions', 'and', '1', 'compact', 'spatial', 'dimension', 'whose', 'coordinate', 'does', 'not', 'commute', 'with', 'time', 'we', 'show', 'that', 'energy', 'flows', 'from', 'the', '3dimensional', 'commutative', 'slice', 'into', 'the', 'compact', 'extra', 'dimension', 'and', 'viceversa', 'so', 'that', 'conservation', 'of', 'energy', 'is', 'restored', 'in', 'this', 'model', 'the', 'energy', 'flux', 'is', 'proportional', 'to', 'the', 'energy', 'density', 'of', 'the', 'matter', 'content', 'leading', 'to', 'a', 'differential', 'equation', 'for', 'frt', 'thus', 'providing', 'a', 'physical', 'criterion', 'to', 'restrict', 'the', 'functional', 'form', 'of', 'frt', 'we', 'solve', 'this', 'equation', 'and', 'analyze', 'the', 'behavior', 'of', 'its', 'solution', 'in', 'a', 'spherically', 'symmetric', 'context']]
|
[-0.1457973438730289, 0.12339733211737094, -0.08986913135591802, 0.07950938745227464, -0.10027790620230286, -0.15130703119340863, -0.06012892006527119, 0.30614938745458653, -0.24636238309430886, -0.277688770842844, 0.07347991233955371, -0.24232952354540085, -0.10341378706255056, 0.09178311132603403, -0.06413280463713253, -0.015142936235995679, -0.02243526477660305, 0.09752044097515823, -0.10598004092416483, -0.2214207971936523, 0.3653416620026081, 0.07671622090727513, 0.2535988892270298, 0.04850486333807701, 0.14124409590839618, -0.031759157578410406, -0.03507079446706646, 0.08335208694170702, -0.11151019776083146, 0.060194556199913395, 0.22150498017751305, 0.08602636195134299, 0.20750814672614554, -0.44812454216714415, -0.23478456963028008, 0.13356931650267886, 0.1247692833599529, 0.11401848978961684, -0.03056630999448576, -0.2488601455221806, 0.061091050375154755, -0.19685527573803008, -0.16722768031088223, -0.08358794254746306, 0.046306020509121304, -0.04185773403466372, -0.24045620505408993, 0.13027171192795675, 0.06407288330712635, -0.017163745484319447, -0.11846600447866258, -0.03926547477365898, -0.05773552685397966, 0.07032409039173468, 0.061530339724287904, 0.03286881373250132, 0.1023144610478483, -0.11725901826766544, -0.06584965914322678, 0.40665960879400004, -0.07864855391689085, -0.3057635362750938, 0.13083300008117382, -0.15922388716100766, -0.11530572081929798, 0.09537852876429707, 0.13934373365155436, 0.15053444742907546, -0.15317328741517047, 0.17999649949210095, -0.025719094574749652, 0.1731842944611855, 0.07062239140923608, 0.06299058867192923, 0.2059542868295547, 0.09059792807958837, 0.06164705194876956, 0.09348349388243786, -0.03354532012757226, -0.12096973089615956, -0.3863162056501643, -0.20115823176198552, -0.17639225100401074, 0.11343607702314007, -0.12631513670124422, -0.1747088859596386, 0.38575601215666994, 0.10181650095917467, 0.1463564914000895, 0.0645506592608502, 0.2800704748943228, 0.15380519348210447, 0.09294529617425706, 0.1107333232373403, 0.21622378445056087, 0.1376186087475218, 0.12453849688562303, -0.20230156842509073, -0.022864175792967012, 0.10584417906855899]
|
1,803.08631
|
SEGEN: Sample-Ensemble Genetic Evolutional Network Model
|
Deep learning, a rebranding of deep neural network research works, has
achieved a remarkable success in recent years. With multiple hidden layers,
deep learning models aim at computing the hierarchical feature representations
of the observational data. Meanwhile, due to its severe disadvantages in data
consumption, computational resources, parameter tuning costs and the lack of
result explainability, deep learning has also suffered from lots of criticism.
In this paper, we will introduce a new representation learning model, namely
"Sample-Ensemble Genetic Evolutionary Network" (SEGEN), which can serve as an
alternative approach to deep learning models. Instead of building one single
deep model, based on a set of sampled sub-instances, SEGEN adopts a
genetic-evolutionary learning strategy to build a group of unit models
generations by generations. The unit models incorporated in SEGEN can be either
traditional machine learning models or the recent deep learning models with a
much "narrower" and "shallower" architecture. The learning results of each
instance at the final generation will be effectively combined from each unit
model via diffusive propagation and ensemble learning strategies. From the
computational perspective, SEGEN requires far less data, fewer computational
resources and parameter tuning efforts, but has sound theoretic
interpretability of the learning process and results. Extensive experiments
have been done on several different real-world benchmark datasets, and the
experimental results obtained by SEGEN have demonstrated its advantages over
the state-of-the-art representation learning models.
|
cs.NE cs.AI cs.LG
|
deep learning a rebranding of deep neural network research works has achieved a remarkable success in recent years with multiple hidden layers deep learning models aim at computing the hierarchical feature representations of the observational data meanwhile due to its severe disadvantages in data consumption computational resources parameter tuning costs and the lack of result explainability deep learning has also suffered from lots of criticism in this paper we will introduce a new representation learning model namely sampleensemble genetic evolutionary network segen which can serve as an alternative approach to deep learning models instead of building one single deep model based on a set of sampled subinstances segen adopts a geneticevolutionary learning strategy to build a group of unit models generations by generations the unit models incorporated in segen can be either traditional machine learning models or the recent deep learning models with a much narrower and shallower architecture the learning results of each instance at the final generation will be effectively combined from each unit model via diffusive propagation and ensemble learning strategies from the computational perspective segen requires far less data fewer computational resources and parameter tuning efforts but has sound theoretic interpretability of the learning process and results extensive experiments have been done on several different realworld benchmark datasets and the experimental results obtained by segen have demonstrated its advantages over the stateoftheart representation learning models
|
[['deep', 'learning', 'a', 'rebranding', 'of', 'deep', 'neural', 'network', 'research', 'works', 'has', 'achieved', 'a', 'remarkable', 'success', 'in', 'recent', 'years', 'with', 'multiple', 'hidden', 'layers', 'deep', 'learning', 'models', 'aim', 'at', 'computing', 'the', 'hierarchical', 'feature', 'representations', 'of', 'the', 'observational', 'data', 'meanwhile', 'due', 'to', 'its', 'severe', 'disadvantages', 'in', 'data', 'consumption', 'computational', 'resources', 'parameter', 'tuning', 'costs', 'and', 'the', 'lack', 'of', 'result', 'explainability', 'deep', 'learning', 'has', 'also', 'suffered', 'from', 'lots', 'of', 'criticism', 'in', 'this', 'paper', 'we', 'will', 'introduce', 'a', 'new', 'representation', 'learning', 'model', 'namely', 'sampleensemble', 'genetic', 'evolutionary', 'network', 'segen', 'which', 'can', 'serve', 'as', 'an', 'alternative', 'approach', 'to', 'deep', 'learning', 'models', 'instead', 'of', 'building', 'one', 'single', 'deep', 'model', 'based', 'on', 'a', 'set', 'of', 'sampled', 'subinstances', 'segen', 'adopts', 'a', 'geneticevolutionary', 'learning', 'strategy', 'to', 'build', 'a', 'group', 'of', 'unit', 'models', 'generations', 'by', 'generations', 'the', 'unit', 'models', 'incorporated', 'in', 'segen', 'can', 'be', 'either', 'traditional', 'machine', 'learning', 'models', 'or', 'the', 'recent', 'deep', 'learning', 'models', 'with', 'a', 'much', 'narrower', 'and', 'shallower', 'architecture', 'the', 'learning', 'results', 'of', 'each', 'instance', 'at', 'the', 'final', 'generation', 'will', 'be', 'effectively', 'combined', 'from', 'each', 'unit', 'model', 'via', 'diffusive', 'propagation', 'and', 'ensemble', 'learning', 'strategies', 'from', 'the', 'computational', 'perspective', 'segen', 'requires', 'far', 'less', 'data', 'fewer', 'computational', 'resources', 'and', 'parameter', 'tuning', 'efforts', 'but', 'has', 'sound', 'theoretic', 'interpretability', 'of', 'the', 'learning', 'process', 'and', 'results', 'extensive', 'experiments', 'have', 'been', 'done', 'on', 'several', 'different', 'realworld', 'benchmark', 'datasets', 'and', 'the', 'experimental', 'results', 'obtained', 'by', 'segen', 'have', 'demonstrated', 'its', 'advantages', 'over', 'the', 'stateoftheart', 'representation', 'learning', 'models']]
|
[-0.020169941567926616, 0.027861877927715103, -0.09296324565988198, 0.028844347035722657, -0.12439327970729723, -0.19148478999381088, 0.06366248083011646, 0.4364147460096339, -0.2907883814220124, -0.3449817193417691, 0.07664981482259207, -0.25656830798629426, -0.1753218865087707, 0.19441083831084885, -0.11283622088427717, 0.09075801309130446, 0.14917610293984546, 0.01968039850661293, -0.06605128095062687, -0.29261045205193503, 0.28374969092041813, 0.08145615001045484, 0.3618728861067596, -0.0024604833939231704, 0.1294390952008436, -0.05088006449034561, -0.03853206149823471, -0.020476745446171563, -0.06356345838303001, 0.20638770650711222, 0.29562312890849546, 0.22465961154997513, 0.3926061215894584, -0.4539784197264765, -0.3089644460475261, 0.1279391904211796, 0.1678782883079698, 0.10069277259068089, -0.06045870267835318, -0.3000989715693855, 0.034665564851556384, -0.20372491018510205, -0.0029602709384265844, -0.1321182755413896, -0.04397368808235924, -0.034518336767478466, -0.2510459711313625, -0.015415643540950541, 0.05638063089134344, 0.08383087895601364, -0.04162500090722717, -0.18156108440008703, 0.024171417264169336, 0.11737519138213658, 0.04630744156706155, 0.06688503051045379, 0.12808560434803737, -0.20869699142778925, -0.18366112584778466, 0.32333762096938584, -0.05678999391107488, -0.1702679580514471, 0.2354335543834953, 0.0007099581628243976, -0.17887940479130668, 0.08859233159391365, 0.24117276319897515, 0.0843917290384713, -0.15299505175661607, 0.06042540488541044, -0.027292384861431, 0.14565130619543484, 0.0009880913903583908, -0.009514117771390383, 0.19758357321802478, 0.30605509292358934, -0.010487819182797281, 0.09435757339238661, -0.11179751297048732, -0.1067149831445699, -0.17242160638089657, -0.06839881052205643, -0.18996437753772255, -0.00932764599103858, -0.10387498616009627, -0.094984715894718, 0.3897620879179318, 0.1907407865194924, 0.20582391660981544, 0.10951794477206314, 0.36086219729699753, 0.0539946853510019, 0.17359210229540317, 0.0822755038858256, 0.1980894557877325, 0.03618043725940887, 0.13173891065410434, -0.13711564351254787, 0.09299038254885651, 0.020289287504448764]
|
1,803.08632
|
Effects of dynamical paths on the energy gap and the corrections to free
energy in path integrals of mean-field quantum spin systems
|
In current studies of mean-field quantum spin systems, much attention is
placed on the calculation of the ground-state energy and the excitation gap,
especially the latter which plays an important role in quantum annealing. In
pure systems, the finite gap can be obtained by various existing methods such
as the Holstein-Primakoff transform, while the tunneling splitting at
first-order phase transitions has also been studied in detail using instantons
in many previous works. In disordered systems, however, it remains challenging
to compute the gap of large-size systems with specific realization of disorder.
Hitherto, only quantum Monte Carlo techniques are practical for such studies.
Recently, Knysh [Nature Comm. \textbf{7}, 12370 (2016)] proposed a method where
the exponentially large dimensionality of such systems is condensed onto a
random potential of much lower dimension, enabling efficient study of such
systems. Here we propose a slightly different approach, building upon the
method of static approximation of the partition function widely used for
analyzing mean-field models. Quantum effects giving rise to the excitation gap
and non-extensive corrections to the free energy are accounted for by
incorporating dynamical paths into the path integral. The time-dependence of
the trace of the time-ordered exponential of the effective Hamiltonian is
calculated by solving a differential equation perturbatively, yielding a
finite-size series expansion of the path integral. Formulae for the first
excited-state energy are proposed to aid in computing the gap. We illustrate
our approach using the infinite-range ferromagnetic Ising model and the
Hopfield model, both in the presence of a transverse field.
|
cond-mat.dis-nn
|
in current studies of meanfield quantum spin systems much attention is placed on the calculation of the groundstate energy and the excitation gap especially the latter which plays an important role in quantum annealing in pure systems the finite gap can be obtained by various existing methods such as the holsteinprimakoff transform while the tunneling splitting at firstorder phase transitions has also been studied in detail using instantons in many previous works in disordered systems however it remains challenging to compute the gap of largesize systems with specific realization of disorder hitherto only quantum monte carlo techniques are practical for such studies recently knysh nature comm textbf7 12370 2016 proposed a method where the exponentially large dimensionality of such systems is condensed onto a random potential of much lower dimension enabling efficient study of such systems here we propose a slightly different approach building upon the method of static approximation of the partition function widely used for analyzing meanfield models quantum effects giving rise to the excitation gap and nonextensive corrections to the free energy are accounted for by incorporating dynamical paths into the path integral the timedependence of the trace of the timeordered exponential of the effective hamiltonian is calculated by solving a differential equation perturbatively yielding a finitesize series expansion of the path integral formulae for the first excitedstate energy are proposed to aid in computing the gap we illustrate our approach using the infiniterange ferromagnetic ising model and the hopfield model both in the presence of a transverse field
|
[['in', 'current', 'studies', 'of', 'meanfield', 'quantum', 'spin', 'systems', 'much', 'attention', 'is', 'placed', 'on', 'the', 'calculation', 'of', 'the', 'groundstate', 'energy', 'and', 'the', 'excitation', 'gap', 'especially', 'the', 'latter', 'which', 'plays', 'an', 'important', 'role', 'in', 'quantum', 'annealing', 'in', 'pure', 'systems', 'the', 'finite', 'gap', 'can', 'be', 'obtained', 'by', 'various', 'existing', 'methods', 'such', 'as', 'the', 'holsteinprimakoff', 'transform', 'while', 'the', 'tunneling', 'splitting', 'at', 'firstorder', 'phase', 'transitions', 'has', 'also', 'been', 'studied', 'in', 'detail', 'using', 'instantons', 'in', 'many', 'previous', 'works', 'in', 'disordered', 'systems', 'however', 'it', 'remains', 'challenging', 'to', 'compute', 'the', 'gap', 'of', 'largesize', 'systems', 'with', 'specific', 'realization', 'of', 'disorder', 'hitherto', 'only', 'quantum', 'monte', 'carlo', 'techniques', 'are', 'practical', 'for', 'such', 'studies', 'recently', 'knysh', 'nature', 'comm', 'textbf7', '12370', '2016', 'proposed', 'a', 'method', 'where', 'the', 'exponentially', 'large', 'dimensionality', 'of', 'such', 'systems', 'is', 'condensed', 'onto', 'a', 'random', 'potential', 'of', 'much', 'lower', 'dimension', 'enabling', 'efficient', 'study', 'of', 'such', 'systems', 'here', 'we', 'propose', 'a', 'slightly', 'different', 'approach', 'building', 'upon', 'the', 'method', 'of', 'static', 'approximation', 'of', 'the', 'partition', 'function', 'widely', 'used', 'for', 'analyzing', 'meanfield', 'models', 'quantum', 'effects', 'giving', 'rise', 'to', 'the', 'excitation', 'gap', 'and', 'nonextensive', 'corrections', 'to', 'the', 'free', 'energy', 'are', 'accounted', 'for', 'by', 'incorporating', 'dynamical', 'paths', 'into', 'the', 'path', 'integral', 'the', 'timedependence', 'of', 'the', 'trace', 'of', 'the', 'timeordered', 'exponential', 'of', 'the', 'effective', 'hamiltonian', 'is', 'calculated', 'by', 'solving', 'a', 'differential', 'equation', 'perturbatively', 'yielding', 'a', 'finitesize', 'series', 'expansion', 'of', 'the', 'path', 'integral', 'formulae', 'for', 'the', 'first', 'excitedstate', 'energy', 'are', 'proposed', 'to', 'aid', 'in', 'computing', 'the', 'gap', 'we', 'illustrate', 'our', 'approach', 'using', 'the', 'infiniterange', 'ferromagnetic', 'ising', 'model', 'and', 'the', 'hopfield', 'model', 'both', 'in', 'the', 'presence', 'of', 'a', 'transverse', 'field']]
|
[-0.11991226820275187, 0.1272212460587907, -0.08609348494186997, 0.08391772270342335, -0.016914075144566595, -0.12615129864076152, 0.025257330308668315, 0.35281362519785764, -0.24088143752887844, -0.31195736093074083, 0.06570034036412835, -0.2685604178458452, -0.15034337294474245, 0.20145087777264417, 0.02576004139892757, 0.10832144096447155, 0.03412665536720306, 0.00489463809132576, -0.08970411912724376, -0.2168001929218881, 0.3055335967592255, 0.05896169587224722, 0.2876678723152727, 0.06865104866120965, 0.061738065512967295, 0.04743589133489877, 0.018132762756198646, 0.028257577318698168, -0.13523212119331585, 0.11036942277289927, 0.2514539147901378, 0.02149306867271662, 0.25733098457939924, -0.42424594827368856, -0.2643831577906385, 0.08552725019212812, 0.17101704931957648, 0.17889787171315402, -0.05056979500455782, -0.28691664554178714, 0.03264471264928579, -0.19225255167740396, -0.1124649848547997, -0.11660429139994084, 0.005034517908003181, -0.0032800192076247185, -0.23569008181802928, 0.08096113001019693, 0.06416988702432719, 0.049785791954025625, -0.05020611293800175, -0.13251352876611053, 0.006580941886175424, 0.10938307491829619, 0.015086616658605636, 0.02929076779168099, 0.1024466021861881, -0.14075107112620025, -0.13848946650931612, 0.3741036025118083, -0.04071483940863982, -0.17677025706949645, 0.17834275689348578, -0.09784742747060955, -0.12084544587787241, 0.13815972648654132, 0.14060466438252478, 0.13508403338491917, -0.16657976460503415, 0.1390301522410009, 0.02113161681033671, 0.12540270540025086, 0.007367866154760122, 0.04654456997010857, 0.18135821985366055, 0.18053398412466048, 0.03581376306037418, 0.16880674434406684, -0.06532951133744791, -0.2009522882439196, -0.24687225883081557, -0.15500208891555667, -0.2310853129858151, 0.05314135608822107, -0.06720992766862037, -0.1817162739317864, 0.38807913917303083, 0.1611716797790141, 0.17091944172978402, 0.007945194906089454, 0.2944929943215102, 0.19534627681970596, 0.0688413932453841, 0.04707739494609996, 0.2273480365104042, 0.14964478643424808, 0.09317178424604936, -0.2607604765961878, 0.03363632744783535, 0.08037250443920493]
|
1,803.08633
|
Stochastic homogenization of certain nonconvex Hamilton-Jacobi equations
|
In this paper, we prove the stochastic homogenization of certain nonconvex
Hamilton-Jacobi equations. The nonconvex Hamiltonians, which are generally
uneven and inseparable, are generated by a sequence of quasiconvex Hamiltonians
and a sequence of quasiconcave Hamiltonians through the min-max formula. We
provide a monotonicity assumption on the contact values between those stably
paired Hamiltonians so as to guarantee the stochastic homogenzation.
|
math.AP
|
in this paper we prove the stochastic homogenization of certain nonconvex hamiltonjacobi equations the nonconvex hamiltonians which are generally uneven and inseparable are generated by a sequence of quasiconvex hamiltonians and a sequence of quasiconcave hamiltonians through the minmax formula we provide a monotonicity assumption on the contact values between those stably paired hamiltonians so as to guarantee the stochastic homogenzation
|
[['in', 'this', 'paper', 'we', 'prove', 'the', 'stochastic', 'homogenization', 'of', 'certain', 'nonconvex', 'hamiltonjacobi', 'equations', 'the', 'nonconvex', 'hamiltonians', 'which', 'are', 'generally', 'uneven', 'and', 'inseparable', 'are', 'generated', 'by', 'a', 'sequence', 'of', 'quasiconvex', 'hamiltonians', 'and', 'a', 'sequence', 'of', 'quasiconcave', 'hamiltonians', 'through', 'the', 'minmax', 'formula', 'we', 'provide', 'a', 'monotonicity', 'assumption', 'on', 'the', 'contact', 'values', 'between', 'those', 'stably', 'paired', 'hamiltonians', 'so', 'as', 'to', 'guarantee', 'the', 'stochastic', 'homogenzation']]
|
[-0.1494599158099542, 0.09140498996712268, -0.10189624178844194, 0.12003376170954046, -0.06330839193736514, -0.17589693756308405, 0.020035204887002087, 0.3739424984902143, -0.3432464262470603, -0.27573051045959196, 0.08015570262408195, -0.2505716087296605, -0.18551373753386238, 0.16981299721325438, -0.1363402447818468, 0.11889741230819102, 0.10487683441412325, -0.005166772290734419, -0.1317706990443791, -0.24804143796985348, 0.3583668095370134, -0.08516950557823293, 0.17782264221459626, 0.02827727052693566, 0.10338900191709399, 0.03408812806786348, 0.06629349101955692, 0.02047422075702343, -0.13102048084450266, 0.12697261149684588, 0.2914885831375917, 0.08281506378746901, 0.3175962108808259, -0.43163823887977437, -0.18762795121098558, 0.16166931800544262, 0.09573083511883548, 0.10027141656222133, -0.016082812952420984, -0.2920968446570138, 0.07571549823818108, -0.1382455881490993, -0.09978881718125195, -0.09033070878746609, -0.030851217778399588, 0.12313617902497451, -0.31064622771615785, 0.07000995062602063, 0.13265991799222926, 0.061451492947526276, -0.12786713743116707, -0.07435327362424383, -0.04756548668568333, 0.03267104452631126, 0.06942356048384682, -0.018558963395965595, 0.07926763871607061, -0.04930148887991284, -0.058999934094026686, 0.3564802521063636, -0.037539930261361106, -0.30108536320428053, 0.15973901188311476, -0.07432181388139725, -0.13153552021831275, 0.11832004045136273, 0.15672923911479303, 0.22227067893060545, -0.20190245462581516, 0.1173133245029021, -0.06766308867372572, 0.05571168217575177, 0.034119595571731526, 0.031196589240183432, 0.11065390910953284, 0.06304836788525184, 0.1754144253830115, 0.16383230161930745, 0.06547738947362329, -0.15328092601460716, -0.33413348561152817, -0.11700340438013275, -0.23670787705729404, 0.11114469617605209, -0.08936044385918648, -0.21068941773846744, 0.3736301328210781, 0.09360232688486576, 0.1734643563317756, 0.18094671246944927, 0.2528381638849775, 0.2123927580328503, 0.010151776826630036, 0.089641317150866, 0.19707250591988365, 0.15981437253455322, 0.05294076865538955, -0.19252924929217746, 0.043427903507836166, 0.15573115495499223]
|
1,803.08634
|
Joint Head Selection and Airtime Allocation for Data Dissemination in
Mobile Social Networks
|
Mobile social networks (MSNs) enable people with similar interests to
interact without Internet access. By forming a temporary group, users can
disseminate their data to other interested users in proximity with short-range
communication technologies. However, due to user mobility, airtime available
for users in the same group to disseminate data is limited. In addition, for
practical consideration, a star network topology among users in the group is
expected. For the former, unfair airtime allocation among the users will
undermine their willingness to participate in MSNs. For the latter, a group
head is required to connect other users. These two problems have to be properly
addressed to enable real implementation and adoption of MSNs. To this aim, we
propose a Nash bargaining-based joint head selection and airtime allocation
scheme for data dissemination within the group. Specifically, the bargaining
game of joint head selection and airtime allocation is first formulated. Then,
Nash bargaining solution (NBS) based optimization problems are proposed for a
homogeneous case and a more general heterogeneous case. For both cases, the
existence of solution to the optimization problem is proved, which guarantees
Pareto optimality and proportional fairness. Next, an algorithm, allowing
distributed implementation, for join head selection and airtime allocation is
introduced. Finally, numerical results are presented to evaluate the
performance, validate intuitions and derive insights of the proposed scheme.
|
cs.NI
|
mobile social networks msns enable people with similar interests to interact without internet access by forming a temporary group users can disseminate their data to other interested users in proximity with shortrange communication technologies however due to user mobility airtime available for users in the same group to disseminate data is limited in addition for practical consideration a star network topology among users in the group is expected for the former unfair airtime allocation among the users will undermine their willingness to participate in msns for the latter a group head is required to connect other users these two problems have to be properly addressed to enable real implementation and adoption of msns to this aim we propose a nash bargainingbased joint head selection and airtime allocation scheme for data dissemination within the group specifically the bargaining game of joint head selection and airtime allocation is first formulated then nash bargaining solution nbs based optimization problems are proposed for a homogeneous case and a more general heterogeneous case for both cases the existence of solution to the optimization problem is proved which guarantees pareto optimality and proportional fairness next an algorithm allowing distributed implementation for join head selection and airtime allocation is introduced finally numerical results are presented to evaluate the performance validate intuitions and derive insights of the proposed scheme
|
[['mobile', 'social', 'networks', 'msns', 'enable', 'people', 'with', 'similar', 'interests', 'to', 'interact', 'without', 'internet', 'access', 'by', 'forming', 'a', 'temporary', 'group', 'users', 'can', 'disseminate', 'their', 'data', 'to', 'other', 'interested', 'users', 'in', 'proximity', 'with', 'shortrange', 'communication', 'technologies', 'however', 'due', 'to', 'user', 'mobility', 'airtime', 'available', 'for', 'users', 'in', 'the', 'same', 'group', 'to', 'disseminate', 'data', 'is', 'limited', 'in', 'addition', 'for', 'practical', 'consideration', 'a', 'star', 'network', 'topology', 'among', 'users', 'in', 'the', 'group', 'is', 'expected', 'for', 'the', 'former', 'unfair', 'airtime', 'allocation', 'among', 'the', 'users', 'will', 'undermine', 'their', 'willingness', 'to', 'participate', 'in', 'msns', 'for', 'the', 'latter', 'a', 'group', 'head', 'is', 'required', 'to', 'connect', 'other', 'users', 'these', 'two', 'problems', 'have', 'to', 'be', 'properly', 'addressed', 'to', 'enable', 'real', 'implementation', 'and', 'adoption', 'of', 'msns', 'to', 'this', 'aim', 'we', 'propose', 'a', 'nash', 'bargainingbased', 'joint', 'head', 'selection', 'and', 'airtime', 'allocation', 'scheme', 'for', 'data', 'dissemination', 'within', 'the', 'group', 'specifically', 'the', 'bargaining', 'game', 'of', 'joint', 'head', 'selection', 'and', 'airtime', 'allocation', 'is', 'first', 'formulated', 'then', 'nash', 'bargaining', 'solution', 'nbs', 'based', 'optimization', 'problems', 'are', 'proposed', 'for', 'a', 'homogeneous', 'case', 'and', 'a', 'more', 'general', 'heterogeneous', 'case', 'for', 'both', 'cases', 'the', 'existence', 'of', 'solution', 'to', 'the', 'optimization', 'problem', 'is', 'proved', 'which', 'guarantees', 'pareto', 'optimality', 'and', 'proportional', 'fairness', 'next', 'an', 'algorithm', 'allowing', 'distributed', 'implementation', 'for', 'join', 'head', 'selection', 'and', 'airtime', 'allocation', 'is', 'introduced', 'finally', 'numerical', 'results', 'are', 'presented', 'to', 'evaluate', 'the', 'performance', 'validate', 'intuitions', 'and', 'derive', 'insights', 'of', 'the', 'proposed', 'scheme']]
|
[-0.16155063719435764, -0.02775222620237566, -0.060853426196527755, 0.0636314238045915, -0.18447227482260628, -0.23905816084112633, 0.1416914310824888, 0.44058857881040736, -0.27553347245980564, -0.29882076433859767, 0.09019784211625599, -0.275139402105891, -0.1436279321518007, 0.11625544389826245, -0.14006493821189822, 0.03015383217187429, 0.058630092988923105, 0.06024067100370303, 0.036652083497028795, -0.31809071552918544, 0.28822420855920594, 0.08994161901910874, 0.37681224912574346, 0.050825630395080555, 0.033816229086898436, 0.016236156346382234, -0.04853141971609809, -0.00308197786792913, -0.09401846489636227, 0.1361065111181233, 0.38100749395618383, 0.2015665220572952, 0.38106048748489807, -0.4361261916939508, -0.19169149411080236, 0.10203838478350503, 0.16382756740786136, 0.044407221310327503, -0.05492863068496014, -0.3080505300800062, 0.1390362290305678, -0.238451985396122, -0.0726954065199772, -0.059603384281085296, -0.033211968818002126, 0.0547823703493288, -0.34694121479141443, -0.020075389399955217, -0.058926903060108254, 0.0077479791383005, -0.0750316980808169, -0.0796808433173944, 0.0281053338305686, 0.2242864479787055, 0.05873613429298116, -0.056439855417490685, 0.12671622252991338, -0.12787810346632217, -0.1614958520497153, 0.43725624503567817, 0.052038348203429695, -0.21435542691668327, 0.17487680872542444, -0.034114454151131214, -0.12683790063549003, 0.10747292871608145, 0.23812156704608986, 0.08396377316887745, -0.18664510858255778, -0.002297788968214511, -0.04032070727024058, 0.12287684566002678, 0.058597954287490046, 0.051570847497946076, 0.13264524803433397, 0.17491214815738865, 0.16426449604702859, 0.09434864299943332, -0.004214542261748152, -0.14693066491322085, -0.1868281369055198, -0.13881715873086994, -0.16794000967532735, -0.017183205546726556, -0.09330574790821464, -0.07482821601654657, 0.3505789724931012, 0.14891366673083128, 0.0909310039460913, 0.11428559662467293, 0.32784654868195173, 0.040135489417430524, 0.04560511677991599, 0.16192222094290298, 0.1527455439325422, 0.05108775305932134, 0.16490803747437893, -0.21186182905221357, 0.11423245894204063, -0.0005181526024402543]
|
1,803.08635
|
Hardware based Spatio-Temporal Neural Processing Backend for Imaging
Sensors: Towards a Smart Camera
|
In this work we show how we can build a technology platform for cognitive
imaging sensors using recent advances in recurrent neural network architectures
and training methods inspired from biology. We demonstrate learning and
processing tasks specific to imaging sensors, including enhancement of
sensitivity and signal-to-noise ratio (SNR) purely through neural filtering
beyond the fundamental limits sensor materials, and inferencing and
spatio-temporal pattern recognition capabilities of these networks with
applications in object detection, motion tracking and prediction. We then show
designs of unit hardware cells built using complementary metal-oxide
semiconductor (CMOS) and emerging materials technologies for ultra-compact and
energy-efficient embedded neural processors for smart cameras.
|
cs.CV cs.ET cs.NE
|
in this work we show how we can build a technology platform for cognitive imaging sensors using recent advances in recurrent neural network architectures and training methods inspired from biology we demonstrate learning and processing tasks specific to imaging sensors including enhancement of sensitivity and signaltonoise ratio snr purely through neural filtering beyond the fundamental limits sensor materials and inferencing and spatiotemporal pattern recognition capabilities of these networks with applications in object detection motion tracking and prediction we then show designs of unit hardware cells built using complementary metaloxide semiconductor cmos and emerging materials technologies for ultracompact and energyefficient embedded neural processors for smart cameras
|
[['in', 'this', 'work', 'we', 'show', 'how', 'we', 'can', 'build', 'a', 'technology', 'platform', 'for', 'cognitive', 'imaging', 'sensors', 'using', 'recent', 'advances', 'in', 'recurrent', 'neural', 'network', 'architectures', 'and', 'training', 'methods', 'inspired', 'from', 'biology', 'we', 'demonstrate', 'learning', 'and', 'processing', 'tasks', 'specific', 'to', 'imaging', 'sensors', 'including', 'enhancement', 'of', 'sensitivity', 'and', 'signaltonoise', 'ratio', 'snr', 'purely', 'through', 'neural', 'filtering', 'beyond', 'the', 'fundamental', 'limits', 'sensor', 'materials', 'and', 'inferencing', 'and', 'spatiotemporal', 'pattern', 'recognition', 'capabilities', 'of', 'these', 'networks', 'with', 'applications', 'in', 'object', 'detection', 'motion', 'tracking', 'and', 'prediction', 'we', 'then', 'show', 'designs', 'of', 'unit', 'hardware', 'cells', 'built', 'using', 'complementary', 'metaloxide', 'semiconductor', 'cmos', 'and', 'emerging', 'materials', 'technologies', 'for', 'ultracompact', 'and', 'energyefficient', 'embedded', 'neural', 'processors', 'for', 'smart', 'cameras']]
|
[-0.08853684025151388, 0.013501322976801367, 0.010026143491268158, -0.04256312934504378, -0.08935879816611608, -0.23206297886957014, 0.01331011534978946, 0.5042611333231132, -0.27812913472631146, -0.3407744620616237, 0.0827768523700624, -0.2633190904167436, -0.2971087911964527, 0.2579432517001849, -0.1526527353207625, 0.1407584063575736, 0.12521646668513617, -0.03246556758614523, -0.042496513790961, -0.19536238821511645, 0.1945463376252779, 0.053135223433907544, 0.39185623311038525, 0.01361687353679112, 0.15769927216072877, -0.030619948375083153, -0.007533119326191289, -0.03209411758774271, -0.07587286198423022, 0.2264320070190089, 0.35841318717935966, 0.200654077911306, 0.27106838788327187, -0.5026523402271171, -0.27477395903496515, 0.06764891381331142, 0.19978229925923405, 0.04714420349558904, -0.11438453287950584, -0.3450626946453537, 0.0848481610993899, -0.18543808568002923, 0.010027416547139486, -0.10777823059969316, -0.004774725295248486, 0.044607440650551805, -0.26884294961069133, -0.03776266366420757, 0.014855616712676628, 0.1016076679274972, -0.06330321356654167, -0.1130036674883394, 0.10409171179025656, 0.15049242627851311, -0.07283440055381063, -0.011023927493286984, 0.24386724163556384, -0.24686914753124473, -0.22838602985388468, 0.3136425980721556, -0.005720826903624194, -0.1562638291468223, 0.2309245048445605, -0.051431308498251296, -0.17731001840993052, 0.04661063780742032, 0.2750055251410231, 0.06183646320853205, -0.1844204897105339, 0.035311576760640104, 0.10576461777091026, 0.1904281817531834, 0.05146335261829552, 0.09664934498612725, 0.243513602062705, 0.3659906932463249, 0.02972856814573918, 0.11898500372966131, -0.19834030647983864, -0.03356266304007953, -0.148353736102581, -0.14219006373591367, -0.19846426029800482, 0.02847504721333583, -0.08248199809320449, -0.12093292411771558, 0.3443813046706574, 0.24365228348248083, 0.12024387252694439, 0.06712287756215249, 0.41606198893416496, 0.008395749410348279, 0.18704835171146053, 0.061453698469059806, 0.19533805799160509, 0.08525793795429525, 0.22275087373508584, -0.13011469792885086, -0.002807164887365486, -0.0024308786239652406]
|
1,803.08636
|
PDNet: Prior-model Guided Depth-enhanced Network for Salient Object
Detection
|
Fully convolutional neural networks (FCNs) have shown outstanding performance
in many computer vision tasks including salient object detection. However,
there still remains two issues needed to be addressed in deep learning based
saliency detection. One is the lack of tremendous amount of annotated data to
train a network. The other is the lack of robustness for extracting salient
objects in images containing complex scenes. In this paper, we present a new
architecture$ - $PDNet, a robust prior-model guided depth-enhanced network for
RGB-D salient object detection. In contrast to existing works, in which RGB-D
values of image pixels are fed directly to a network, the proposed architecture
is composed of a master network for processing RGB values, and a sub-network
making full use of depth cues and incorporate depth-based features into the
master network. To overcome the limited size of the labeled RGB-D dataset for
training, we employ a large conventional RGB dataset to pre-train the master
network, which proves to contribute largely to the final accuracy. Extensive
evaluations over five benchmark datasets demonstrate that our proposed method
performs favorably against the state-of-the-art approaches.
|
cs.CV cs.AI cs.MM
|
fully convolutional neural networks fcns have shown outstanding performance in many computer vision tasks including salient object detection however there still remains two issues needed to be addressed in deep learning based saliency detection one is the lack of tremendous amount of annotated data to train a network the other is the lack of robustness for extracting salient objects in images containing complex scenes in this paper we present a new architecture pdnet a robust priormodel guided depthenhanced network for rgbd salient object detection in contrast to existing works in which rgbd values of image pixels are fed directly to a network the proposed architecture is composed of a master network for processing rgb values and a subnetwork making full use of depth cues and incorporate depthbased features into the master network to overcome the limited size of the labeled rgbd dataset for training we employ a large conventional rgb dataset to pretrain the master network which proves to contribute largely to the final accuracy extensive evaluations over five benchmark datasets demonstrate that our proposed method performs favorably against the stateoftheart approaches
|
[['fully', 'convolutional', 'neural', 'networks', 'fcns', 'have', 'shown', 'outstanding', 'performance', 'in', 'many', 'computer', 'vision', 'tasks', 'including', 'salient', 'object', 'detection', 'however', 'there', 'still', 'remains', 'two', 'issues', 'needed', 'to', 'be', 'addressed', 'in', 'deep', 'learning', 'based', 'saliency', 'detection', 'one', 'is', 'the', 'lack', 'of', 'tremendous', 'amount', 'of', 'annotated', 'data', 'to', 'train', 'a', 'network', 'the', 'other', 'is', 'the', 'lack', 'of', 'robustness', 'for', 'extracting', 'salient', 'objects', 'in', 'images', 'containing', 'complex', 'scenes', 'in', 'this', 'paper', 'we', 'present', 'a', 'new', 'architecture', 'pdnet', 'a', 'robust', 'priormodel', 'guided', 'depthenhanced', 'network', 'for', 'rgbd', 'salient', 'object', 'detection', 'in', 'contrast', 'to', 'existing', 'works', 'in', 'which', 'rgbd', 'values', 'of', 'image', 'pixels', 'are', 'fed', 'directly', 'to', 'a', 'network', 'the', 'proposed', 'architecture', 'is', 'composed', 'of', 'a', 'master', 'network', 'for', 'processing', 'rgb', 'values', 'and', 'a', 'subnetwork', 'making', 'full', 'use', 'of', 'depth', 'cues', 'and', 'incorporate', 'depthbased', 'features', 'into', 'the', 'master', 'network', 'to', 'overcome', 'the', 'limited', 'size', 'of', 'the', 'labeled', 'rgbd', 'dataset', 'for', 'training', 'we', 'employ', 'a', 'large', 'conventional', 'rgb', 'dataset', 'to', 'pretrain', 'the', 'master', 'network', 'which', 'proves', 'to', 'contribute', 'largely', 'to', 'the', 'final', 'accuracy', 'extensive', 'evaluations', 'over', 'five', 'benchmark', 'datasets', 'demonstrate', 'that', 'our', 'proposed', 'method', 'performs', 'favorably', 'against', 'the', 'stateoftheart', 'approaches']]
|
[-0.05352073168452288, -0.06091335415319857, -0.027779657207689556, 0.025853019345593354, -0.10682540196358284, -0.17920232954689994, -0.01093845628266998, 0.46843845709409127, -0.2343215292928397, -0.36540862360147125, 0.0646099214241762, -0.2841482795878995, -0.18335239918559124, 0.19684835955729532, -0.1976667237780239, 0.11150861926869146, 0.2176189768172322, 0.06442519642904339, -0.03462335531984836, -0.29844599705275315, 0.28877185973355324, 0.006816872948222643, 0.3573782058515945, 0.014623257278220197, 0.1702631639229529, -0.08272817096537677, -0.04532090521173021, -0.009668490971460048, -0.0011958547105037805, 0.20620496438291996, 0.3406025494797436, 0.19376222099380452, 0.3031338340155364, -0.4266091336980046, -0.26677506041385274, 0.07960403316222422, 0.15575259281894682, 0.13383204598370327, -0.027440420508010096, -0.38728917838729837, 0.10789601901915528, -0.15632504626572674, 0.026119685605657417, -0.14888691005957777, 0.0019518772833434313, -0.06130852654976927, -0.2817112662408022, 0.026596861566266033, 0.030738994615756018, 0.054234535212227916, -0.03421776965078403, -0.10683958836982037, 0.023209542136212718, 0.2126029307470142, -0.011583903247058682, 0.07163084096498995, 0.15713255131336232, -0.26387223532012344, -0.1156522025882303, 0.34979899124601366, -0.04474262117314563, -0.20371313306227243, 0.21697722103410302, -0.012926485630106076, -0.1776161419316169, 0.134803521426072, 0.21534239726795362, 0.1335433761266648, -0.18467018511159314, -0.02663346597022122, -0.04888107427903165, 0.1980375506337628, 0.03340230307245221, 0.016255101653377853, 0.19284111801040613, 0.3327974055519109, -0.00886392348358803, 0.16091827686593801, -0.2086648381934319, -0.061188906738170366, -0.1876139875941041, -0.054643873088894276, -0.221978102641586, -0.056587135174061956, -0.0661445967396188, -0.15019716951113543, 0.42646111849716256, 0.3149328012625536, 0.23915736238191207, 0.10325560991017553, 0.4175407461946903, -0.025671704247588675, 0.17015207998777152, 0.08667930678396835, 0.1971361785060492, 0.012399353854379009, 0.12843082904199127, -0.1539937349767346, 0.07128877755561479, 0.06085426904594099]
|
1,803.08637
|
Difference Weak Measurement
|
We propose the difference weak measurement scheme, and illustrate its
advantages for measuring small longitude phase-shift in high precision.
Compared to the standard interferometry and standard weak measurement schemes,
the proposed scheme has much higher resolution in present of various practical
imperfections, such as alignment error and light intensity variation error.
Moreover, we highlight the advantage of utilizing complex weak value, where its
imaginary part can reduce the harmful effect induced by channel decoherence.
Finally, we propose closed-loop scenario to solve the narrow dynamic range
problem obsessing the current weak measurement schemes. Difference weak
measurement scheme simultaneously fulfills the requirements of high precision,
wide dynamic range and strong robustness, which makes it a powerfully practical
tool for phase-shift measurement and other metrological tasks.
|
quant-ph physics.optics
|
we propose the difference weak measurement scheme and illustrate its advantages for measuring small longitude phaseshift in high precision compared to the standard interferometry and standard weak measurement schemes the proposed scheme has much higher resolution in present of various practical imperfections such as alignment error and light intensity variation error moreover we highlight the advantage of utilizing complex weak value where its imaginary part can reduce the harmful effect induced by channel decoherence finally we propose closedloop scenario to solve the narrow dynamic range problem obsessing the current weak measurement schemes difference weak measurement scheme simultaneously fulfills the requirements of high precision wide dynamic range and strong robustness which makes it a powerfully practical tool for phaseshift measurement and other metrological tasks
|
[['we', 'propose', 'the', 'difference', 'weak', 'measurement', 'scheme', 'and', 'illustrate', 'its', 'advantages', 'for', 'measuring', 'small', 'longitude', 'phaseshift', 'in', 'high', 'precision', 'compared', 'to', 'the', 'standard', 'interferometry', 'and', 'standard', 'weak', 'measurement', 'schemes', 'the', 'proposed', 'scheme', 'has', 'much', 'higher', 'resolution', 'in', 'present', 'of', 'various', 'practical', 'imperfections', 'such', 'as', 'alignment', 'error', 'and', 'light', 'intensity', 'variation', 'error', 'moreover', 'we', 'highlight', 'the', 'advantage', 'of', 'utilizing', 'complex', 'weak', 'value', 'where', 'its', 'imaginary', 'part', 'can', 'reduce', 'the', 'harmful', 'effect', 'induced', 'by', 'channel', 'decoherence', 'finally', 'we', 'propose', 'closedloop', 'scenario', 'to', 'solve', 'the', 'narrow', 'dynamic', 'range', 'problem', 'obsessing', 'the', 'current', 'weak', 'measurement', 'schemes', 'difference', 'weak', 'measurement', 'scheme', 'simultaneously', 'fulfills', 'the', 'requirements', 'of', 'high', 'precision', 'wide', 'dynamic', 'range', 'and', 'strong', 'robustness', 'which', 'makes', 'it', 'a', 'powerfully', 'practical', 'tool', 'for', 'phaseshift', 'measurement', 'and', 'other', 'metrological', 'tasks']]
|
[-0.15766100456831275, 0.05752460896342871, -0.03064594015509623, 0.07645229033392961, -0.06997501802035287, -0.18858230410555957, 0.07518368566477457, 0.3983535519266715, -0.3127986572560717, -0.3372444984213006, 0.08359623199794441, -0.1985897665354805, -0.0921246161756915, 0.2338975126717667, -0.09695952869455529, 0.11881395158659452, 0.09128724973358703, -0.031589780353986824, -0.09299924389123305, -0.19404998191701034, 0.27471033213125756, 0.08319297530993697, 0.3667252448799669, 0.10160624024030737, 0.14854952934976728, 0.03475423039654728, -0.026803463502771786, 0.014711928256161388, -0.0799974339926371, 0.06055525404145391, 0.23831501595111046, 0.11133551900656741, 0.2940655876901459, -0.34282268903630436, -0.22787658387001175, 0.1337047942778569, 0.1072473564666131, 0.1420455927012076, -0.06689876030565652, -0.32030898222669224, 0.10780028961064508, -0.19414540756776258, -0.10725949951600222, -0.12588402697817444, -0.013926271265219958, 0.0001037837632122587, -0.2993913472278929, 0.09081385113665315, 0.012341014426354258, 0.060427110764335414, 0.02111834692425232, -0.11389891500012247, 0.1009918553783314, 0.13434938874933486, 0.011961177749116524, 0.00555073772843347, 0.13617357231875057, -0.09568741021449255, -0.08965425589503567, 0.3824599456942839, -0.10894357419971636, -0.1966710150161697, 0.1651831824398317, -0.13262094141625355, -0.08502950136297856, 0.12090929278905396, 0.1769002666696906, 0.08355920350743977, -0.0966937799392207, 0.03136305948318608, 0.05244302820246361, 0.19311964240108356, 0.03809028613900185, 0.1581563802252783, 0.12724725949791732, 0.17591563121369871, 0.10666946259510444, 0.10658145604939505, -0.16943820112873417, -0.09845446783011078, -0.2836242606710704, -0.09658658028519178, -0.1310798405807038, -0.012474249300287395, -0.1080700979355988, -0.07749253540437241, 0.36226935579456876, 0.20153047543278604, 0.15843786935886886, 0.03265604926044213, 0.4249130476258512, 0.13126577646757828, 0.03929502456534852, -0.03072224634501045, 0.30810411512607433, 0.14095470505636795, 0.11170598424848963, -0.2809765816773059, 0.07252743923807609, -0.017032389899288288]
|
1,803.08638
|
Accretion Flow Dynamics During 1999 Outburst of XTE J1859+226 - Modeling
of Broadband Spectra and Constraining the Source Mass
|
We examine the dynamical behavior of accretion flow around XTE J1859+226
during the 1999 outburst by analyzing the entire outburst data ($\sim$ 166
days) from RXTE Satellite. Towards this, we study the hysteresis behavior in
the hardness intensity diagram (HID) based on the broadband ($3 - 150$ keV)
spectral modeling, spectral signature of jet ejection and the evolution of
Quasi-periodic Oscillation (QPO) frequencies using the two-component advective
flow model around a black hole. We compute the flow parameters, namely
Keplerian accretion rate (${\dot m}_d$), sub-Keplerian accretion rate (${\dot
m}_h$), shock location ($r_s$) and black hole mass ($M_{bh}$) from the spectral
modeling and study their evolution along the q-diagram. Subsequently, the
kinetic jet power is computed as $L^{\rm obs}_{\rm jet}\sim 3 - 6 \times
10^{37}$ erg~s$^{-1}$ during one of the observed radio flares which indicates
that jet power corresponds to $8-16\%$ mass outflow rate from the disc. This
estimate of mass outflow rate is in close agreement with the change in total
accretion rate ($\sim 14\%$) required for spectral modeling before and during
the flare. Finally, we provide a mass estimate of the source XTE J1859+226
based on the spectral modeling that lies in the range of $5.2 - 7.9 M_{\odot}$
with 90\% confidence.
|
astro-ph.HE
|
we examine the dynamical behavior of accretion flow around xte j1859226 during the 1999 outburst by analyzing the entire outburst data sim 166 days from rxte satellite towards this we study the hysteresis behavior in the hardness intensity diagram hid based on the broadband 3 150 kev spectral modeling spectral signature of jet ejection and the evolution of quasiperiodic oscillation qpo frequencies using the twocomponent advective flow model around a black hole we compute the flow parameters namely keplerian accretion rate dot m_d subkeplerian accretion rate dot m_h shock location r_s and black hole mass m_bh from the spectral modeling and study their evolution along the qdiagram subsequently the kinetic jet power is computed as lrm obs_rm jetsim 3 6 times 1037 ergs1 during one of the observed radio flares which indicates that jet power corresponds to 816 mass outflow rate from the disc this estimate of mass outflow rate is in close agreement with the change in total accretion rate sim 14 required for spectral modeling before and during the flare finally we provide a mass estimate of the source xte j1859226 based on the spectral modeling that lies in the range of 52 79 m_odot with 90 confidence
|
[['we', 'examine', 'the', 'dynamical', 'behavior', 'of', 'accretion', 'flow', 'around', 'xte', 'j1859226', 'during', 'the', '1999', 'outburst', 'by', 'analyzing', 'the', 'entire', 'outburst', 'data', 'sim', '166', 'days', 'from', 'rxte', 'satellite', 'towards', 'this', 'we', 'study', 'the', 'hysteresis', 'behavior', 'in', 'the', 'hardness', 'intensity', 'diagram', 'hid', 'based', 'on', 'the', 'broadband', '3', '150', 'kev', 'spectral', 'modeling', 'spectral', 'signature', 'of', 'jet', 'ejection', 'and', 'the', 'evolution', 'of', 'quasiperiodic', 'oscillation', 'qpo', 'frequencies', 'using', 'the', 'twocomponent', 'advective', 'flow', 'model', 'around', 'a', 'black', 'hole', 'we', 'compute', 'the', 'flow', 'parameters', 'namely', 'keplerian', 'accretion', 'rate', 'dot', 'm_d', 'subkeplerian', 'accretion', 'rate', 'dot', 'm_h', 'shock', 'location', 'r_s', 'and', 'black', 'hole', 'mass', 'm_bh', 'from', 'the', 'spectral', 'modeling', 'and', 'study', 'their', 'evolution', 'along', 'the', 'qdiagram', 'subsequently', 'the', 'kinetic', 'jet', 'power', 'is', 'computed', 'as', 'lrm', 'obs_rm', 'jetsim', '3', '6', 'times', '1037', 'ergs1', 'during', 'one', 'of', 'the', 'observed', 'radio', 'flares', 'which', 'indicates', 'that', 'jet', 'power', 'corresponds', 'to', '816', 'mass', 'outflow', 'rate', 'from', 'the', 'disc', 'this', 'estimate', 'of', 'mass', 'outflow', 'rate', 'is', 'in', 'close', 'agreement', 'with', 'the', 'change', 'in', 'total', 'accretion', 'rate', 'sim', '14', 'required', 'for', 'spectral', 'modeling', 'before', 'and', 'during', 'the', 'flare', 'finally', 'we', 'provide', 'a', 'mass', 'estimate', 'of', 'the', 'source', 'xte', 'j1859226', 'based', 'on', 'the', 'spectral', 'modeling', 'that', 'lies', 'in', 'the', 'range', 'of', '52', '79', 'm_odot', 'with', '90', 'confidence']]
|
[-0.10087013634223364, 0.09560363890245707, -0.036030835609629074, 0.1097889286089651, -0.05938049374769131, -0.09349449139354149, 0.05586221741249013, 0.4074456424739287, -0.1681241719851816, -0.36271237439918097, 0.12910252602034802, -0.3016533416871104, 0.01213143275512119, 0.2545493450098097, -0.031145798476006688, 0.03030074504909642, 0.05681126375889613, -0.05631354422590135, -0.10642012203643757, -0.15936582811403727, 0.26732487975610325, 0.10024459907935575, 0.1654681301031337, -0.0023780743746707835, 0.07121310510315151, -0.05058710987096408, -0.020393835945111332, -0.11103743268647279, -0.20341329289298338, 0.009114381876030956, 0.18222815077399102, 0.11210475397629033, 0.18574080573902887, -0.3175544627786924, -0.21853728439997544, 0.029572862035811248, 0.17194565083370592, -0.03944963349483324, -0.00693297704253722, -0.19759550407667634, 0.05842448764179617, -0.28430356350115904, -0.12417617447043985, 0.09257194873726353, 0.08171532958313221, -0.0021797548215177777, -0.21518668939707555, 0.21720877556704135, 0.03844369365995388, 0.039680668127733625, -0.15875363157064926, -0.009815499251190987, -0.0915987721226599, 0.04147804336095549, 0.13196713281407332, 0.0819165972278999, 0.22475999120312432, -0.09536418482905837, -0.07507829141868937, 0.34202311685040704, -0.09028431497992845, 0.03994101367189991, 0.1529687574830593, -0.2610380788159679, -0.12960567439887485, 0.22414974307622573, 0.18490267346490813, 0.09923334727345993, -0.13074415579033696, -0.009041641910579244, -0.011825692441580216, 0.28313987960008846, 0.07514444268496726, 0.010363909663687486, 0.3500638997906612, 0.14246922982809596, -0.01534832350091275, 0.11479279932547172, -0.25143474443683944, -0.04177544651390759, -0.23077100782768067, -0.05880429527491232, -0.1333076696010363, 0.1443450839089399, -0.19075380670197187, -0.08978793542418215, 0.41722368050103237, 0.10296901077093237, 0.28052876556216916, 0.04495476770880303, 0.2746890454712992, 0.14855126909102606, -0.0003239028402745272, 0.20859162026758757, 0.33025970005176286, 0.16352778525242226, 0.17461311273897687, -0.2945821465738588, 0.027550217156966376, 0.053993663849365534]
|
1,803.08639
|
Examining High Energy Radiation Mechanisms of Knots and Hotspots in
Active Galactic Nucleus Jets
|
We compile the radio-optical-X-ray spectral energy distributions (SEDs) of 65
knots and 29 hotspots in 41 active galactic nucleus jets to examine their high
energy radiation mechanisms. Their SEDs can be fitted with the single-zone
leptonic models, except for the hotspot of Pictor A and six knots of 3C 273.
The X-ray emission of one hotspot and 22 knots is well explained as synchrotron
radiations under the equipartition condition; they usually have lower X-ray and
radio luminosities than the others, which may be due to a lower beaming factor.
An inverse Compton (IC) process is involved for explaining the X-ray emission
of the other SEDs. Without considering the equipartition condition, their X-ray
emission can be attributed to the synchrotron-self-Compton (SSC) process, but
the derived jet power (P_jet) are not correlated with L_k and most of them are
larger than L_k with more than three orders of magnitude, where L_k is the jet
kinetic power estimated with their radio emission. Under the equipartition
condition, the X-ray emission is well interpreted with the IC process to the
cosmic microwave background photons (IC/CMB). In this scenario, the derived
P_jet of knots and hotspots are correlated with and comparable to L_k. These
results suggest that the IC/CMB model may be the promising interpretation of
their X-ray emission. In addition, a tentative knot-hotspot sequence in the
synchrotron peak-energy--peak-luminosity plane is observed, similar to the
blazar sequence, which may be attributed to their different cooling mechanisms
of electrons.
|
astro-ph.HE
|
we compile the radioopticalxray spectral energy distributions seds of 65 knots and 29 hotspots in 41 active galactic nucleus jets to examine their high energy radiation mechanisms their seds can be fitted with the singlezone leptonic models except for the hotspot of pictor a and six knots of 3c 273 the xray emission of one hotspot and 22 knots is well explained as synchrotron radiations under the equipartition condition they usually have lower xray and radio luminosities than the others which may be due to a lower beaming factor an inverse compton ic process is involved for explaining the xray emission of the other seds without considering the equipartition condition their xray emission can be attributed to the synchrotronselfcompton ssc process but the derived jet power p_jet are not correlated with l_k and most of them are larger than l_k with more than three orders of magnitude where l_k is the jet kinetic power estimated with their radio emission under the equipartition condition the xray emission is well interpreted with the ic process to the cosmic microwave background photons iccmb in this scenario the derived p_jet of knots and hotspots are correlated with and comparable to l_k these results suggest that the iccmb model may be the promising interpretation of their xray emission in addition a tentative knothotspot sequence in the synchrotron peakenergypeakluminosity plane is observed similar to the blazar sequence which may be attributed to their different cooling mechanisms of electrons
|
[['we', 'compile', 'the', 'radioopticalxray', 'spectral', 'energy', 'distributions', 'seds', 'of', '65', 'knots', 'and', '29', 'hotspots', 'in', '41', 'active', 'galactic', 'nucleus', 'jets', 'to', 'examine', 'their', 'high', 'energy', 'radiation', 'mechanisms', 'their', 'seds', 'can', 'be', 'fitted', 'with', 'the', 'singlezone', 'leptonic', 'models', 'except', 'for', 'the', 'hotspot', 'of', 'pictor', 'a', 'and', 'six', 'knots', 'of', '3c', '273', 'the', 'xray', 'emission', 'of', 'one', 'hotspot', 'and', '22', 'knots', 'is', 'well', 'explained', 'as', 'synchrotron', 'radiations', 'under', 'the', 'equipartition', 'condition', 'they', 'usually', 'have', 'lower', 'xray', 'and', 'radio', 'luminosities', 'than', 'the', 'others', 'which', 'may', 'be', 'due', 'to', 'a', 'lower', 'beaming', 'factor', 'an', 'inverse', 'compton', 'ic', 'process', 'is', 'involved', 'for', 'explaining', 'the', 'xray', 'emission', 'of', 'the', 'other', 'seds', 'without', 'considering', 'the', 'equipartition', 'condition', 'their', 'xray', 'emission', 'can', 'be', 'attributed', 'to', 'the', 'synchrotronselfcompton', 'ssc', 'process', 'but', 'the', 'derived', 'jet', 'power', 'p_jet', 'are', 'not', 'correlated', 'with', 'l_k', 'and', 'most', 'of', 'them', 'are', 'larger', 'than', 'l_k', 'with', 'more', 'than', 'three', 'orders', 'of', 'magnitude', 'where', 'l_k', 'is', 'the', 'jet', 'kinetic', 'power', 'estimated', 'with', 'their', 'radio', 'emission', 'under', 'the', 'equipartition', 'condition', 'the', 'xray', 'emission', 'is', 'well', 'interpreted', 'with', 'the', 'ic', 'process', 'to', 'the', 'cosmic', 'microwave', 'background', 'photons', 'iccmb', 'in', 'this', 'scenario', 'the', 'derived', 'p_jet', 'of', 'knots', 'and', 'hotspots', 'are', 'correlated', 'with', 'and', 'comparable', 'to', 'l_k', 'these', 'results', 'suggest', 'that', 'the', 'iccmb', 'model', 'may', 'be', 'the', 'promising', 'interpretation', 'of', 'their', 'xray', 'emission', 'in', 'addition', 'a', 'tentative', 'knothotspot', 'sequence', 'in', 'the', 'synchrotron', 'peakenergypeakluminosity', 'plane', 'is', 'observed', 'similar', 'to', 'the', 'blazar', 'sequence', 'which', 'may', 'be', 'attributed', 'to', 'their', 'different', 'cooling', 'mechanisms', 'of', 'electrons']]
|
[-0.05773451950371964, 0.15608797753672357, -0.05068116359858929, 0.19156565765987732, -0.1099482150146893, -0.11798816914282119, 0.006130168009743405, 0.49407388088293375, -0.20831678537506376, -0.35281131870384946, 0.04976904380988951, -0.28303258450080954, 0.03949674721807241, 0.23431793118118852, 0.002643761894432828, -0.04650199710789214, -0.02129267980781151, -0.09987937772336106, 0.011365992766513955, -0.1722419337000853, 0.28878796052110073, 0.1530821037789186, 0.24007412046970178, 0.027234833008484807, 0.040089263097615915, -0.09487039173254744, -0.06628627090540248, -0.023369161256899435, -0.05814513996995932, 0.07660339630383532, 0.21079169329188213, 0.08890913083644894, 0.14345701152554588, -0.3774225627848258, -0.26490670075872913, 0.11613534024606148, 0.18423305488152739, -0.03743857457011472, 0.022422081486547542, -0.20647586409856256, 0.07126374287205788, -0.2060687785745055, -0.13705127908615394, 0.07105665279571743, -0.02023932595499597, 0.030685485670498263, -0.22263079937450433, 0.1322665077226702, 0.04200618163655842, 0.03065992525856321, -0.1321501564680754, -0.09904609268899851, -0.03885595748821894, 0.04092607222652684, 0.09677887528681216, 0.059166718319950934, 0.18533942252591562, -0.14040892982836037, -0.16214459576488782, 0.42377959546477845, -0.012248245178428381, -0.035290154424728826, 0.21999508469792392, -0.21379219240625388, -0.14768056203514182, 0.23265974395520364, 0.10717240174029333, 0.10702156891250827, -0.1586952868490092, -0.030635530383005972, -0.011682506348976555, 0.16792438552268626, 0.024825845552065098, 0.08850914254920401, 0.2676730996618668, 0.07331319009147895, -0.016021625801416424, 0.15807557831455293, -0.19786170425274274, 0.005648459504785327, -0.2832963021103448, -0.055697667833495265, -0.1391355646007772, 0.13728803343844145, -0.1391063119688018, -0.10777403205671969, 0.3512068155454472, 0.06928394852487448, 0.21565938080117728, 0.041241318490695754, 0.3155985143113261, 0.1692344332691088, 0.08049742849543691, 0.16991181918031847, 0.3244770286954008, 0.13771219862198147, 0.07087939807776517, -0.1962220288415362, 0.08070972312125377, -0.01796254963070775]
|
1,803.0864
|
Cooperative Secure Transmission by Exploiting Social Ties in Random
Networks
|
Social awareness and social ties are becoming increasingly popular with
emerging mobile and handheld devices. Social trust degree describing the
strength of the social ties has drawn lots of research interests in many fields
in wireless communications, such as resource sharing, cooperative communication
and so on. In this paper, we propose a hybrid cooperative beamforming and
jamming scheme to secure communication based on the social trust degree under a
stochastic geometry framework. The friendly nodes are categorized into relays
and jammers according to their locations and social trust degrees with the
source node. We aim to analyze the involved connection outage probability (COP)
and secrecy outage probability (SOP) of the performance in the networks. To
achieve this target, we propose a double Gamma ratio (DGR) approach through
Gamma approximation. Based on this, the COP and SOP are tractably obtained in
closed-form. We further consider the SOP in the presence of Poisson Point
Process (PPP) distributed eavesdroppers and derive an upper bound. The
simulation results verify our theoretical findings, and validate that the
social trust degree has dramatic influences on the security performance in the
networks.
|
cs.IT math.IT
|
social awareness and social ties are becoming increasingly popular with emerging mobile and handheld devices social trust degree describing the strength of the social ties has drawn lots of research interests in many fields in wireless communications such as resource sharing cooperative communication and so on in this paper we propose a hybrid cooperative beamforming and jamming scheme to secure communication based on the social trust degree under a stochastic geometry framework the friendly nodes are categorized into relays and jammers according to their locations and social trust degrees with the source node we aim to analyze the involved connection outage probability cop and secrecy outage probability sop of the performance in the networks to achieve this target we propose a double gamma ratio dgr approach through gamma approximation based on this the cop and sop are tractably obtained in closedform we further consider the sop in the presence of poisson point process ppp distributed eavesdroppers and derive an upper bound the simulation results verify our theoretical findings and validate that the social trust degree has dramatic influences on the security performance in the networks
|
[['social', 'awareness', 'and', 'social', 'ties', 'are', 'becoming', 'increasingly', 'popular', 'with', 'emerging', 'mobile', 'and', 'handheld', 'devices', 'social', 'trust', 'degree', 'describing', 'the', 'strength', 'of', 'the', 'social', 'ties', 'has', 'drawn', 'lots', 'of', 'research', 'interests', 'in', 'many', 'fields', 'in', 'wireless', 'communications', 'such', 'as', 'resource', 'sharing', 'cooperative', 'communication', 'and', 'so', 'on', 'in', 'this', 'paper', 'we', 'propose', 'a', 'hybrid', 'cooperative', 'beamforming', 'and', 'jamming', 'scheme', 'to', 'secure', 'communication', 'based', 'on', 'the', 'social', 'trust', 'degree', 'under', 'a', 'stochastic', 'geometry', 'framework', 'the', 'friendly', 'nodes', 'are', 'categorized', 'into', 'relays', 'and', 'jammers', 'according', 'to', 'their', 'locations', 'and', 'social', 'trust', 'degrees', 'with', 'the', 'source', 'node', 'we', 'aim', 'to', 'analyze', 'the', 'involved', 'connection', 'outage', 'probability', 'cop', 'and', 'secrecy', 'outage', 'probability', 'sop', 'of', 'the', 'performance', 'in', 'the', 'networks', 'to', 'achieve', 'this', 'target', 'we', 'propose', 'a', 'double', 'gamma', 'ratio', 'dgr', 'approach', 'through', 'gamma', 'approximation', 'based', 'on', 'this', 'the', 'cop', 'and', 'sop', 'are', 'tractably', 'obtained', 'in', 'closedform', 'we', 'further', 'consider', 'the', 'sop', 'in', 'the', 'presence', 'of', 'poisson', 'point', 'process', 'ppp', 'distributed', 'eavesdroppers', 'and', 'derive', 'an', 'upper', 'bound', 'the', 'simulation', 'results', 'verify', 'our', 'theoretical', 'findings', 'and', 'validate', 'that', 'the', 'social', 'trust', 'degree', 'has', 'dramatic', 'influences', 'on', 'the', 'security', 'performance', 'in', 'the', 'networks']]
|
[-0.22661584736527624, 0.012251838250164371, -0.020201512363210723, 0.02601536920824524, -0.08449855100967595, -0.22031709899421076, 0.16434079114209257, 0.4257658889718555, -0.24737377140444478, -0.2687004311069531, 0.025297634437604733, -0.2756894892836745, -0.24457658545390978, 0.09854076316114516, -0.11428665197328539, 0.048873631167854814, 0.009756381746469618, 0.101128712213422, 0.05828229991909482, -0.2750382336976661, 0.3107947025404035, 0.10705260263906943, 0.4047138569373134, 0.10008074590476934, 0.04588103625117927, 0.028335085153781078, -0.03784212110111037, -0.010713286495592911, -0.1537318316579724, 0.1569842494558543, 0.3565403083440017, 0.21867646077094047, 0.3365473545030565, -0.43529321250279207, -0.2159717235563172, 0.09442212495172547, 0.1562684177784438, 0.04240267831278411, -0.05879473391907743, -0.3564875759536753, 0.09896034837851451, -0.23204826038115267, -0.05067936937895767, -0.012919185033722504, -0.06670791747080354, 0.09464169880155021, -0.2795509293826448, -0.0156478871843098, -0.013174302152962097, 0.08512647165067343, 0.009530062849139417, -0.10018230071039619, 0.00018926661184712036, 0.18292527741979103, 0.061953175719040826, -0.0501308646632006, 0.15837234008704892, -0.14349865469502637, -0.16354191786785785, 0.37871508570639667, 0.0407821187548138, -0.2110507891991654, 0.16248330646572082, -0.040680832204383774, -0.15562984980516942, 0.10037975363634728, 0.30201480866636377, 0.042181192570038745, -0.17769333913519575, 0.034387791528668554, -0.025532702126263365, 0.1472083699293246, 0.052958432788885124, 0.07651152518401677, 0.15056468840260562, 0.18274108400266315, 0.1375534182260241, 0.11119522989123455, -0.08739715482712396, -0.16208707275926262, -0.19185677836271556, -0.14038819607403885, -0.21173736353820138, 0.03556982606800424, -0.1620904540836597, -0.07439555139910127, 0.35471867090789205, 0.14974089127373755, 0.12129327489056851, 0.1197682007895531, 0.3608591120992158, 0.08974023146548535, 0.004290578477839763, 0.14238503098588537, 0.2137746208573918, 0.09502449307112476, 0.14313212536476755, -0.16385150363014356, 0.15567651956241477, 0.00113028604033831]
|
1,803.08641
|
On difference graphs and the local dimension of posets
|
The dimension of a partially-ordered set (poset), introduced by Dushnik and
Miller (1941), has been studied extensively in the literature. Recently,
Ueckerdt (2016) proposed a variation called local dimension which makes use of
partial linear extensions. While local dimension is bounded above by dimension,
they can be arbitrarily far apart as the dimension of the standard example is
$n$ while its local dimension is only $3$.
Hiraguchi (1955) proved that the maximum dimension of a poset of order $n$ is
$n/2$. However, we find a very different result for local dimension, proving a
bound of $\Theta(n/\log n)$. This follows from connections with covering graphs
using difference graphs which are bipartite graphs whose vertices in a single
class have nested neighborhoods.
We also prove that the local dimension of the $n$-dimensional Boolean lattice
is $\Omega(n/\log n)$ and make progress toward resolving a version of the
removable pair conjecture for local dimension.
|
math.CO cs.DM
|
the dimension of a partiallyordered set poset introduced by dushnik and miller 1941 has been studied extensively in the literature recently ueckerdt 2016 proposed a variation called local dimension which makes use of partial linear extensions while local dimension is bounded above by dimension they can be arbitrarily far apart as the dimension of the standard example is n while its local dimension is only 3 hiraguchi 1955 proved that the maximum dimension of a poset of order n is n2 however we find a very different result for local dimension proving a bound of thetanlog n this follows from connections with covering graphs using difference graphs which are bipartite graphs whose vertices in a single class have nested neighborhoods we also prove that the local dimension of the ndimensional boolean lattice is omeganlog n and make progress toward resolving a version of the removable pair conjecture for local dimension
|
[['the', 'dimension', 'of', 'a', 'partiallyordered', 'set', 'poset', 'introduced', 'by', 'dushnik', 'and', 'miller', '1941', 'has', 'been', 'studied', 'extensively', 'in', 'the', 'literature', 'recently', 'ueckerdt', '2016', 'proposed', 'a', 'variation', 'called', 'local', 'dimension', 'which', 'makes', 'use', 'of', 'partial', 'linear', 'extensions', 'while', 'local', 'dimension', 'is', 'bounded', 'above', 'by', 'dimension', 'they', 'can', 'be', 'arbitrarily', 'far', 'apart', 'as', 'the', 'dimension', 'of', 'the', 'standard', 'example', 'is', 'n', 'while', 'its', 'local', 'dimension', 'is', 'only', '3', 'hiraguchi', '1955', 'proved', 'that', 'the', 'maximum', 'dimension', 'of', 'a', 'poset', 'of', 'order', 'n', 'is', 'n2', 'however', 'we', 'find', 'a', 'very', 'different', 'result', 'for', 'local', 'dimension', 'proving', 'a', 'bound', 'of', 'thetanlog', 'n', 'this', 'follows', 'from', 'connections', 'with', 'covering', 'graphs', 'using', 'difference', 'graphs', 'which', 'are', 'bipartite', 'graphs', 'whose', 'vertices', 'in', 'a', 'single', 'class', 'have', 'nested', 'neighborhoods', 'we', 'also', 'prove', 'that', 'the', 'local', 'dimension', 'of', 'the', 'ndimensional', 'boolean', 'lattice', 'is', 'omeganlog', 'n', 'and', 'make', 'progress', 'toward', 'resolving', 'a', 'version', 'of', 'the', 'removable', 'pair', 'conjecture', 'for', 'local', 'dimension']]
|
[-0.12536107015877263, 0.1265328922715263, -0.042382099734456745, 0.04921686898716944, -0.0644717645509506, -0.15984232236799978, 0.015578225315173451, 0.3090045492871096, -0.2635194937004739, -0.2815088811299245, 0.11706315836050367, -0.2800900468012105, -0.14241186472831058, 0.13999702769562902, -0.07330237413114311, 0.05181089821763824, 0.026835096571844495, 0.09085768852507908, -0.030105022583063065, -0.34501156070888445, 0.3344627772551655, -0.012777849622445818, 0.22598909019748836, 0.059097917934037014, 0.10515167313352877, 0.0009950907000859312, -0.012598518085284722, 0.11854325758758932, -0.13743261124787542, 0.13686523545570922, 0.25077852401601136, 0.1177635831514611, 0.2674939764738583, -0.3498770730857481, -0.2137445642334728, 0.17314185839046367, 0.14043315210545299, 0.10066127829369308, 0.009740467944288714, -0.23307396287736076, 0.13003582907403075, -0.1294721167678351, -0.18112140823891637, -0.04417605985865472, 0.12021921983304365, -0.033502062227133186, -0.2819286803496164, 0.004902857935310798, 0.15466721694691468, 0.09510179734226291, 0.05081811744872881, -0.12862359716450708, -0.04301083210586951, 0.0825961614074498, -0.048193624263454304, 0.058693038180920504, 0.02496382104382919, -0.08148375236594912, -0.1642040765325495, 0.3221846320260091, -0.010132949125027947, -0.17868971359297234, 0.17117112336349016, -0.12991475920953602, -0.16148287179604823, 0.10875047640812477, 0.09964510006517571, 0.1296852405679931, -0.08916652662017001, 0.21431826689708727, -0.1570734355548684, 0.16954999056725994, 0.16490638070746055, 0.032958130755355496, 0.08293096019555159, 0.12637783874813843, 0.14924177168493452, 0.1661928828591606, -0.0372674608030419, -0.07584894862926046, -0.2702266511776103, -0.14308118222370406, -0.22762595624162896, 0.10680005364370027, -0.11796838327564124, -0.14928344762165274, 0.3523514662437991, 0.0453317143060517, 0.23013039858349219, 0.11496700055353444, 0.22259582838062322, 0.08729414477322842, 0.05633009533435356, 0.13547055342940975, 0.17874541106140054, 0.16207926166001646, 0.01617434733366006, -0.12608881018299534, 0.06596263146165433, 0.19735131410898676]
|
1,803.08642
|
Photonics and Spectroscopy in Nanojunctions: A Theoretical Insight
|
Progress of experimental techniques at nanoscale in the last decade made
optical measurements in current-carrying nanojunctions a reality thus
indicating emergence of a new field of research coined as optoelectronics.
Optical spectroscopy of open nonequilibrium systems is a natural meeting point
for (at least) two research areas: nonlinear optical spectroscopy and quantum
transport, each with its own theoretical toolbox. We review recent progress in
the field comparing theoretical treatments of optical response in nanojunctions
as is accepted in nonlinear spectroscopy and quantum transport communities. A
unified theoretical description of spectroscopy in nanojunctions is presented.
We argue that theoretical approaches of the quantum transport community (and in
particular, the Green function based considerations) yield a convenient tool
for optoelectronics when radiation field is treated classically, and that
differences between the toolboxes may become critical when studying quantum
radiation field in junctions.
|
cond-mat.mes-hall
|
progress of experimental techniques at nanoscale in the last decade made optical measurements in currentcarrying nanojunctions a reality thus indicating emergence of a new field of research coined as optoelectronics optical spectroscopy of open nonequilibrium systems is a natural meeting point for at least two research areas nonlinear optical spectroscopy and quantum transport each with its own theoretical toolbox we review recent progress in the field comparing theoretical treatments of optical response in nanojunctions as is accepted in nonlinear spectroscopy and quantum transport communities a unified theoretical description of spectroscopy in nanojunctions is presented we argue that theoretical approaches of the quantum transport community and in particular the green function based considerations yield a convenient tool for optoelectronics when radiation field is treated classically and that differences between the toolboxes may become critical when studying quantum radiation field in junctions
|
[['progress', 'of', 'experimental', 'techniques', 'at', 'nanoscale', 'in', 'the', 'last', 'decade', 'made', 'optical', 'measurements', 'in', 'currentcarrying', 'nanojunctions', 'a', 'reality', 'thus', 'indicating', 'emergence', 'of', 'a', 'new', 'field', 'of', 'research', 'coined', 'as', 'optoelectronics', 'optical', 'spectroscopy', 'of', 'open', 'nonequilibrium', 'systems', 'is', 'a', 'natural', 'meeting', 'point', 'for', 'at', 'least', 'two', 'research', 'areas', 'nonlinear', 'optical', 'spectroscopy', 'and', 'quantum', 'transport', 'each', 'with', 'its', 'own', 'theoretical', 'toolbox', 'we', 'review', 'recent', 'progress', 'in', 'the', 'field', 'comparing', 'theoretical', 'treatments', 'of', 'optical', 'response', 'in', 'nanojunctions', 'as', 'is', 'accepted', 'in', 'nonlinear', 'spectroscopy', 'and', 'quantum', 'transport', 'communities', 'a', 'unified', 'theoretical', 'description', 'of', 'spectroscopy', 'in', 'nanojunctions', 'is', 'presented', 'we', 'argue', 'that', 'theoretical', 'approaches', 'of', 'the', 'quantum', 'transport', 'community', 'and', 'in', 'particular', 'the', 'green', 'function', 'based', 'considerations', 'yield', 'a', 'convenient', 'tool', 'for', 'optoelectronics', 'when', 'radiation', 'field', 'is', 'treated', 'classically', 'and', 'that', 'differences', 'between', 'the', 'toolboxes', 'may', 'become', 'critical', 'when', 'studying', 'quantum', 'radiation', 'field', 'in', 'junctions']]
|
[-0.12420632761703539, 0.1160065851307341, -0.11045455567239384, 0.008664467272215657, -0.049197329944997495, -0.172950568763086, 0.028231513984168746, 0.4181103664583394, -0.23622177576180547, -0.2604817081641938, 0.05038196962060673, -0.2967178606062329, -0.18067331546252327, 0.2863486776993211, -0.018119268884350146, 0.09115063922571218, 0.04877587762395186, -0.05528356152478539, -0.03344065802105303, -0.19743616377402629, 0.24045059658986118, 0.05779862459873714, 0.3315300994635826, 0.12227347509386684, 0.04507580943422259, 0.02211696609655129, -0.0161454742242183, 0.042642145818431995, -0.1389357974458627, 0.13913305198574172, 0.3229079372515636, 0.059650346443855334, 0.33300669198589666, -0.48536502585879393, -0.2704631059563586, 0.01598362893777708, 0.1392682900070213, 0.15182188610280198, -0.12302825498627498, -0.22352247508907958, 0.0028173780126962812, -0.11529824972468694, -0.12921428807312624, -0.06757083889720629, 0.03461642527420606, 0.004319157391520483, -0.18828562704480387, 0.041881902004492336, -0.020029931298423825, 0.14383281183961247, -0.050078986720680924, -0.10798836549344872, 0.04083968798596678, 0.10817387679999228, -0.0014002843793215496, 0.051525454572401944, 0.17842804164891796, -0.21041196250755873, -0.16382932660302946, 0.3627435443124601, -0.0432434101040209, -0.08955245932073531, 0.19298723823490685, -0.1538181023954946, -0.13629120085222116, 0.07559626381844282, 0.13514227416100247, 0.10963419658364729, -0.1899235402643431, 0.08601910423188071, 0.009372459764459303, 0.10299564069490381, 0.004002145192186747, 0.1267252681377743, 0.28338415070403633, 0.22071825959220795, 0.001466810646733003, 0.10012520773868476, -0.0537620938299889, -0.12549910848195264, -0.27967966623338203, -0.1877215447569532, -0.19281852605220462, 0.0822541707577849, 0.013996720657035309, -0.17626227065255598, 0.39797060983255506, 0.17959701630170458, 0.12433284302242101, -0.054472954612824004, 0.33573779556900263, 0.10407869676211183, 0.046662433754785786, 0.019496022916531987, 0.2883348757841824, 0.20934270230687357, 0.14635130130752388, -0.22121750102295273, 0.01136503298351142, -0.025224446754769553]
|
1,803.08643
|
Numerical simulation of the geometrical-optics reduction of CE2 and
comparisons to quasilinear dynamics
|
Zonal flows have been observed to appear spontaneously from turbulence in a
number of physical settings. A complete theory for their behavior is still
lacking. Recently, a number of studies have investigated the dynamics of zonal
flows using quasilinear theories and the statistical framework of a
second-order cumulant expansion (CE2). A geometrical-optics (GO) reduction of
CE2, derived under an assumption of separation of scales between the
fluctuations and the zonal flow, is studied here numerically. The reduced
model, CE2-GO, has a similar phase-space mathematical structure to the
traditional wave-kinetic equation, but that wave-kinetic equation has been
shown to fail to preserve enstrophy conservation and to exhibit an ultraviolet
catastrophe. CE2-GO, in contrast, preserves nonlinear conservation of both
energy and enstrophy. We show here how to retain these conservation properties
in a pseudospectral simulation of CE2-GO. We then present nonlinear simulations
of CE2-GO and compare with direct simulations of quasilinear (QL) dynamics. We
find that CE2-GO retains some similarities to QL. The partitioning of energy
that resides in the zonal flow is in good quantitative agreement between CE2-GO
and QL. On the other hand, the length scale of the zonal flow does not follow
the same qualitative trend in the two models. Overall, these simulations
indicate that CE2-GO provides a simpler and more tractable statistical paradigm
than CE2, but CE2-GO is missing important physics.
|
physics.plasm-ph physics.ao-ph
|
zonal flows have been observed to appear spontaneously from turbulence in a number of physical settings a complete theory for their behavior is still lacking recently a number of studies have investigated the dynamics of zonal flows using quasilinear theories and the statistical framework of a secondorder cumulant expansion ce2 a geometricaloptics go reduction of ce2 derived under an assumption of separation of scales between the fluctuations and the zonal flow is studied here numerically the reduced model ce2go has a similar phasespace mathematical structure to the traditional wavekinetic equation but that wavekinetic equation has been shown to fail to preserve enstrophy conservation and to exhibit an ultraviolet catastrophe ce2go in contrast preserves nonlinear conservation of both energy and enstrophy we show here how to retain these conservation properties in a pseudospectral simulation of ce2go we then present nonlinear simulations of ce2go and compare with direct simulations of quasilinear ql dynamics we find that ce2go retains some similarities to ql the partitioning of energy that resides in the zonal flow is in good quantitative agreement between ce2go and ql on the other hand the length scale of the zonal flow does not follow the same qualitative trend in the two models overall these simulations indicate that ce2go provides a simpler and more tractable statistical paradigm than ce2 but ce2go is missing important physics
|
[['zonal', 'flows', 'have', 'been', 'observed', 'to', 'appear', 'spontaneously', 'from', 'turbulence', 'in', 'a', 'number', 'of', 'physical', 'settings', 'a', 'complete', 'theory', 'for', 'their', 'behavior', 'is', 'still', 'lacking', 'recently', 'a', 'number', 'of', 'studies', 'have', 'investigated', 'the', 'dynamics', 'of', 'zonal', 'flows', 'using', 'quasilinear', 'theories', 'and', 'the', 'statistical', 'framework', 'of', 'a', 'secondorder', 'cumulant', 'expansion', 'ce2', 'a', 'geometricaloptics', 'go', 'reduction', 'of', 'ce2', 'derived', 'under', 'an', 'assumption', 'of', 'separation', 'of', 'scales', 'between', 'the', 'fluctuations', 'and', 'the', 'zonal', 'flow', 'is', 'studied', 'here', 'numerically', 'the', 'reduced', 'model', 'ce2go', 'has', 'a', 'similar', 'phasespace', 'mathematical', 'structure', 'to', 'the', 'traditional', 'wavekinetic', 'equation', 'but', 'that', 'wavekinetic', 'equation', 'has', 'been', 'shown', 'to', 'fail', 'to', 'preserve', 'enstrophy', 'conservation', 'and', 'to', 'exhibit', 'an', 'ultraviolet', 'catastrophe', 'ce2go', 'in', 'contrast', 'preserves', 'nonlinear', 'conservation', 'of', 'both', 'energy', 'and', 'enstrophy', 'we', 'show', 'here', 'how', 'to', 'retain', 'these', 'conservation', 'properties', 'in', 'a', 'pseudospectral', 'simulation', 'of', 'ce2go', 'we', 'then', 'present', 'nonlinear', 'simulations', 'of', 'ce2go', 'and', 'compare', 'with', 'direct', 'simulations', 'of', 'quasilinear', 'ql', 'dynamics', 'we', 'find', 'that', 'ce2go', 'retains', 'some', 'similarities', 'to', 'ql', 'the', 'partitioning', 'of', 'energy', 'that', 'resides', 'in', 'the', 'zonal', 'flow', 'is', 'in', 'good', 'quantitative', 'agreement', 'between', 'ce2go', 'and', 'ql', 'on', 'the', 'other', 'hand', 'the', 'length', 'scale', 'of', 'the', 'zonal', 'flow', 'does', 'not', 'follow', 'the', 'same', 'qualitative', 'trend', 'in', 'the', 'two', 'models', 'overall', 'these', 'simulations', 'indicate', 'that', 'ce2go', 'provides', 'a', 'simpler', 'and', 'more', 'tractable', 'statistical', 'paradigm', 'than', 'ce2', 'but', 'ce2go', 'is', 'missing', 'important', 'physics']]
|
[-0.125550534581398, 0.09040925136964137, -0.15281148933108077, 0.11495135182038685, -0.05608661986747548, -0.09496180457898286, -0.04872167411295806, 0.320647690374187, -0.2679414884709323, -0.2885670480339249, 0.04918942721080319, -0.27716358165327676, -0.14521146125698906, 0.18677881762548246, -0.005984510959130231, 0.0803415870958012, 0.02676216259832607, -0.004421233903249149, -0.08170755052022352, -0.17248383364139017, 0.280923351986885, 0.07329457031871973, 0.288045731531832, 0.0276116709078186, 0.09514033776444838, -0.0771748083852432, -0.02184013306108959, 0.07949716681948625, -0.16097896712617593, 0.07974060703496524, 0.19463183399313141, 0.07137790761758561, 0.27779710602386953, -0.47537292824064137, -0.267635525275239, 0.049514950295354784, 0.16510025898047886, 0.10991083453054386, -0.05478042810655464, -0.18104286520269955, 0.0890188231550558, -0.15954796596943932, -0.11443690544687579, -0.12136361053455705, -0.004673715259027855, 0.023551563768868956, -0.24685198613760925, 0.17030850410327783, 0.0850760118436536, 0.09190456305250459, -0.053338480918070995, -0.07260759087538372, -0.07816649101373861, 0.09007206621147575, 0.07589373232198006, -0.021192158670519632, 0.0707227026003793, -0.16453901572662485, -0.09629857680037818, 0.4130411706029567, -0.04343831803078811, -0.22211209896350523, 0.21563630974475678, -0.1833387504210654, -0.14080824891121999, 0.13079409505816952, 0.16082258113438572, 0.08952746503066841, -0.1140231353425496, 0.06351147891119364, -0.09125063428968491, 0.1875970308301394, 0.04249548765876635, 0.01073937967908125, 0.15472194794022515, 0.17019041312332245, 0.04357067126396526, 0.08264492574537323, -0.05827241877590895, -0.18490979270779867, -0.26994896826288356, -0.12101810402758921, -0.13304251340539466, 0.04040618886918742, -0.05727530452583326, -0.17272271560920055, 0.37452266176937005, 0.1703894748540403, 0.16343506485653933, 0.07128337662533393, 0.28399611984467293, 0.14241121768859535, 0.053596425209520175, 0.10065158215276229, 0.27391854366206675, 0.15943543591501083, 0.1326605994880801, -0.23932663282727187, 0.05763737529577821, 0.06684402044812393]
|
1,803.08644
|
A Robust Interferometry Against Imperfections Base on Weak Value
Amplification
|
The optical interferometry has been widely used in various high precision
applications. Usually, the minimum precision of an interferometry is limited by
various technique noises in practice. To suppress such kind of noises, we
propose a novel scheme, which combines the weak measurement with the standard
interferometry. The proposed scheme dramatically outperforms the standard
interferometry in the signal noise ratio and the robustness against noises
caused by the optical elements' reflections and the offset fluctuation between
two paths. A proof-of-principle experiment is demonstrated to validate the
amplification theory.
|
physics.optics
|
the optical interferometry has been widely used in various high precision applications usually the minimum precision of an interferometry is limited by various technique noises in practice to suppress such kind of noises we propose a novel scheme which combines the weak measurement with the standard interferometry the proposed scheme dramatically outperforms the standard interferometry in the signal noise ratio and the robustness against noises caused by the optical elements reflections and the offset fluctuation between two paths a proofofprinciple experiment is demonstrated to validate the amplification theory
|
[['the', 'optical', 'interferometry', 'has', 'been', 'widely', 'used', 'in', 'various', 'high', 'precision', 'applications', 'usually', 'the', 'minimum', 'precision', 'of', 'an', 'interferometry', 'is', 'limited', 'by', 'various', 'technique', 'noises', 'in', 'practice', 'to', 'suppress', 'such', 'kind', 'of', 'noises', 'we', 'propose', 'a', 'novel', 'scheme', 'which', 'combines', 'the', 'weak', 'measurement', 'with', 'the', 'standard', 'interferometry', 'the', 'proposed', 'scheme', 'dramatically', 'outperforms', 'the', 'standard', 'interferometry', 'in', 'the', 'signal', 'noise', 'ratio', 'and', 'the', 'robustness', 'against', 'noises', 'caused', 'by', 'the', 'optical', 'elements', 'reflections', 'and', 'the', 'offset', 'fluctuation', 'between', 'two', 'paths', 'a', 'proofofprinciple', 'experiment', 'is', 'demonstrated', 'to', 'validate', 'the', 'amplification', 'theory']]
|
[-0.12297238215317273, 0.10567170294383356, -0.08327194675803185, 0.05395580215686509, -0.009500118565152992, -0.15038567484060134, 0.03472861839558887, 0.3961401079987726, -0.28574208966033027, -0.3214805301236497, 0.10719205267378129, -0.2560032763801494, -0.1619266398325139, 0.23570444394665008, -0.12290153103690087, 0.1350495569164526, 0.05552893195867496, -0.04266488588076423, -0.05488038020716472, -0.18696699206801978, 0.24259523630536767, 0.10785553401166742, 0.39314910799095576, 0.02185933105647564, 0.1370014806532047, -0.0016111258935945277, -0.08202596223484514, 0.02827148837968707, -0.035522871439091185, 0.05875870126659389, 0.21589170142330907, 0.08520451652425849, 0.2774113288614899, -0.39169390829788014, -0.26037012363403017, 0.13358383409848268, 0.1039446992005899, 0.15984588965577792, -0.0750991408713162, -0.337260939032686, 0.05555505335558502, -0.17066532180813904, -0.0931008279281245, -0.0853002234467898, -0.02734871869060126, 0.0446871332612566, -0.29472279793117195, 0.05800665484275669, 0.015590998386456207, 0.042773951490579006, 0.05918673376171765, -0.09969813203629614, 0.10273133629710753, 0.11129142762299372, -0.0190230638360266, 0.03158131398694505, 0.10105992268389938, -0.10332417793423784, -0.15629485257721337, 0.37307144582948903, -0.13147442731530068, -0.17178201633611356, 0.1982381701448255, -0.10538268206768077, -0.06777838330758228, 0.1269879379013384, 0.1322409574409407, 0.09520114230161364, -0.1547093553870747, 0.007826125105070374, 0.05672376112885435, 0.22636644859713587, 0.0776443926363506, 0.12701566006977705, 0.16070302191656083, 0.19543194935911082, 0.041880734360099516, 0.13311600798359988, -0.2023006843572313, -0.05820822682951323, -0.24680685285817494, -0.06610151830086992, -0.20745534456562548, -0.04151775784240189, -0.07116691246384024, -0.07931891968473792, 0.36296723912949924, 0.2319150521652773, 0.14672047104051505, -0.03782099575751503, 0.4299486152489077, 0.12446988374523987, 0.07884663148169321, -0.021868264344944197, 0.320317647525702, 0.18888659367274324, 0.09741366331317378, -0.2683304229497232, 0.06388861422998492, 0.009204912898977373]
|
1,803.08645
|
Photoproduction of dileptons and photons in p-p collisions at Large
Hadron Collider energies
|
The production of large $p_{T}$ dileptons and photons originating from
photoproduction processes in p-p collisions at Large Hadron Collider energies
is calculated. The comparisons between the exact treatment results and the ones
of the equivalent photon approximation approach are expressed as the $Q^{2}$
(the virtuality of photon) and $p_{T}$ distributions. The method developed by
Martin and Ryskin is used for avoiding double counting when the coherent and
incoherent contributions are considered simultaneously. The numerical results
indicate that, the equivalent photon approximation is only effective in small
$Q^{2}$ region and can be used for coherent photoproduction processes with
proper choice of $Q^{2}_{\textrm{max}}$ ( the choices $Q^{2}_{\textrm{max}}\sim
\hat{s}$ or $\infty$ will cause obvious errors), but can not be used for
incoherent photoproduction processes. The exact treatment is needed to deal
accurately with the photoproduction of large $p_{T}$ dileptons and photons.
|
hep-ph
|
the production of large p_t dileptons and photons originating from photoproduction processes in pp collisions at large hadron collider energies is calculated the comparisons between the exact treatment results and the ones of the equivalent photon approximation approach are expressed as the q2 the virtuality of photon and p_t distributions the method developed by martin and ryskin is used for avoiding double counting when the coherent and incoherent contributions are considered simultaneously the numerical results indicate that the equivalent photon approximation is only effective in small q2 region and can be used for coherent photoproduction processes with proper choice of q2_textrmmax the choices q2_textrmmaxsim hats or infty will cause obvious errors but can not be used for incoherent photoproduction processes the exact treatment is needed to deal accurately with the photoproduction of large p_t dileptons and photons
|
[['the', 'production', 'of', 'large', 'p_t', 'dileptons', 'and', 'photons', 'originating', 'from', 'photoproduction', 'processes', 'in', 'pp', 'collisions', 'at', 'large', 'hadron', 'collider', 'energies', 'is', 'calculated', 'the', 'comparisons', 'between', 'the', 'exact', 'treatment', 'results', 'and', 'the', 'ones', 'of', 'the', 'equivalent', 'photon', 'approximation', 'approach', 'are', 'expressed', 'as', 'the', 'q2', 'the', 'virtuality', 'of', 'photon', 'and', 'p_t', 'distributions', 'the', 'method', 'developed', 'by', 'martin', 'and', 'ryskin', 'is', 'used', 'for', 'avoiding', 'double', 'counting', 'when', 'the', 'coherent', 'and', 'incoherent', 'contributions', 'are', 'considered', 'simultaneously', 'the', 'numerical', 'results', 'indicate', 'that', 'the', 'equivalent', 'photon', 'approximation', 'is', 'only', 'effective', 'in', 'small', 'q2', 'region', 'and', 'can', 'be', 'used', 'for', 'coherent', 'photoproduction', 'processes', 'with', 'proper', 'choice', 'of', 'q2_textrmmax', 'the', 'choices', 'q2_textrmmaxsim', 'hats', 'or', 'infty', 'will', 'cause', 'obvious', 'errors', 'but', 'can', 'not', 'be', 'used', 'for', 'incoherent', 'photoproduction', 'processes', 'the', 'exact', 'treatment', 'is', 'needed', 'to', 'deal', 'accurately', 'with', 'the', 'photoproduction', 'of', 'large', 'p_t', 'dileptons', 'and', 'photons']]
|
[-0.018681056176622707, 0.240026441042277, -0.12305072665697446, 0.17225298970523809, -0.020359889217824848, -0.13120640316219243, 0.015326159492273022, 0.37748008594434296, -0.2004170440585801, -0.2529346856961234, -0.036323436844611055, -0.3444320364303335, 0.03187078432593909, 0.20011171869485192, 0.015550751878698874, 0.10932421840520369, 0.1271472519884507, -0.023441509098780376, 0.02731371951220488, -0.17839161581790972, 0.3137628251824666, 0.0699116669319294, 0.2342657521918968, 0.1358012915231046, 0.09882400309735978, 0.08680384719606352, -0.06410004188677434, -0.006550249243500056, -0.09434016374035747, 0.06302466175919916, 0.3254416185224222, 0.06136363181113093, 0.1573510216790493, -0.35263021556591545, -0.12095327737430732, 0.13072620150805622, 0.15840095172127433, 0.10609405400162494, -0.011700919839657015, -0.2577086644290291, 0.07698098084785872, -0.20689324216779184, -0.12240482910915658, -0.10842695404533986, -0.025524220917011713, 0.018834601949762414, -0.3536707907949609, 0.08800959602856354, -0.009839863300806394, -0.0009270661579513992, 0.003285163616830552, -0.17259703662453427, -0.027281193824967853, 0.08319215426950163, 0.09126391779217455, 0.05617630206117476, 0.14740893784565506, -0.166726594081114, -0.16469404174497834, 0.3876429568148322, 0.003193769155553094, -0.20419609861241447, 0.1597206252730555, -0.19876264846987193, -0.08106866649662454, 0.2135144377244783, 0.1961708728413753, 0.12598917100565613, -0.15447790019043842, 0.10367490271218466, 0.0020443283267215723, 0.15677282691898722, 0.10627935472875834, 0.08467205507698021, 0.1207407842045305, 0.12392743840917117, -0.0365433930384892, 0.07206527077489429, -0.0956271632608992, -0.07752802682419618, -0.40590695002012783, -0.07527193082668991, -0.11809951906885814, 0.07968601643687752, -0.0676343887605644, -0.09310567478252643, 0.311059984733799, 0.08690181163967484, 0.23522184500901924, 0.003960483969637641, 0.3452953720965457, 0.17030846405757108, 0.057121373122532126, 0.0929255807689279, 0.25690360666183687, 0.15969820041381927, 0.12321516532726862, -0.21809687007356574, 0.07330804611038831, 0.025838731419019125]
|
1,803.08646
|
An iterative nonlocal residual constitutive model for nonlocal
elasticity
|
Recently, it was claimed that the two-phase local/nonlocal constitutive
models give well-posed nonlocal field problems and eliminates the ill-posedness
of the fully nonlocal constitutive models. In this study, it is demonstrated
that, both, the fully nonlocal and the two-phase local/nonlocal constitutive
models secrete ill-posed nonlocal boundary value problems. Moreover, it is
revealed that all Eringen integral and differential nonlocal constitutive
models secrete unsolvable nonlocal boundary value problems. In this study, it
is demonstrated that solutions of nonlocal elasticity problems are exist, and
Eringen constitutive model cannot determine these solutions. To overcome the
limitations of Eringen constitutive models, novel integral and differential
iterative nonlocal residual constitutive models are proposed. Using these two
constitutive models, the sum of the nonlocal residual field at a point is
iteratively formed. Then, this nonlocal residual is imposed to the local
boundary value problem. Thus, the nonlocal elasticity is obtained in the form
of a local boundary value problem with an imposed nonlocal residual field.
Using any of these constitutive models, a solution is guaranteed for a nonlocal
field problem. To show the effectiveness of the proposed constitutive models,
the nonlocal field problems of beams with different natural boundary conditions
are considered. The results of the proposed integral and differential
constitutive models are identical and feasible.
|
physics.app-ph
|
recently it was claimed that the twophase localnonlocal constitutive models give wellposed nonlocal field problems and eliminates the illposedness of the fully nonlocal constitutive models in this study it is demonstrated that both the fully nonlocal and the twophase localnonlocal constitutive models secrete illposed nonlocal boundary value problems moreover it is revealed that all eringen integral and differential nonlocal constitutive models secrete unsolvable nonlocal boundary value problems in this study it is demonstrated that solutions of nonlocal elasticity problems are exist and eringen constitutive model cannot determine these solutions to overcome the limitations of eringen constitutive models novel integral and differential iterative nonlocal residual constitutive models are proposed using these two constitutive models the sum of the nonlocal residual field at a point is iteratively formed then this nonlocal residual is imposed to the local boundary value problem thus the nonlocal elasticity is obtained in the form of a local boundary value problem with an imposed nonlocal residual field using any of these constitutive models a solution is guaranteed for a nonlocal field problem to show the effectiveness of the proposed constitutive models the nonlocal field problems of beams with different natural boundary conditions are considered the results of the proposed integral and differential constitutive models are identical and feasible
|
[['recently', 'it', 'was', 'claimed', 'that', 'the', 'twophase', 'localnonlocal', 'constitutive', 'models', 'give', 'wellposed', 'nonlocal', 'field', 'problems', 'and', 'eliminates', 'the', 'illposedness', 'of', 'the', 'fully', 'nonlocal', 'constitutive', 'models', 'in', 'this', 'study', 'it', 'is', 'demonstrated', 'that', 'both', 'the', 'fully', 'nonlocal', 'and', 'the', 'twophase', 'localnonlocal', 'constitutive', 'models', 'secrete', 'illposed', 'nonlocal', 'boundary', 'value', 'problems', 'moreover', 'it', 'is', 'revealed', 'that', 'all', 'eringen', 'integral', 'and', 'differential', 'nonlocal', 'constitutive', 'models', 'secrete', 'unsolvable', 'nonlocal', 'boundary', 'value', 'problems', 'in', 'this', 'study', 'it', 'is', 'demonstrated', 'that', 'solutions', 'of', 'nonlocal', 'elasticity', 'problems', 'are', 'exist', 'and', 'eringen', 'constitutive', 'model', 'can', 'not', 'determine', 'these', 'solutions', 'to', 'overcome', 'the', 'limitations', 'of', 'eringen', 'constitutive', 'models', 'novel', 'integral', 'and', 'differential', 'iterative', 'nonlocal', 'residual', 'constitutive', 'models', 'are', 'proposed', 'using', 'these', 'two', 'constitutive', 'models', 'the', 'sum', 'of', 'the', 'nonlocal', 'residual', 'field', 'at', 'a', 'point', 'is', 'iteratively', 'formed', 'then', 'this', 'nonlocal', 'residual', 'is', 'imposed', 'to', 'the', 'local', 'boundary', 'value', 'problem', 'thus', 'the', 'nonlocal', 'elasticity', 'is', 'obtained', 'in', 'the', 'form', 'of', 'a', 'local', 'boundary', 'value', 'problem', 'with', 'an', 'imposed', 'nonlocal', 'residual', 'field', 'using', 'any', 'of', 'these', 'constitutive', 'models', 'a', 'solution', 'is', 'guaranteed', 'for', 'a', 'nonlocal', 'field', 'problem', 'to', 'show', 'the', 'effectiveness', 'of', 'the', 'proposed', 'constitutive', 'models', 'the', 'nonlocal', 'field', 'problems', 'of', 'beams', 'with', 'different', 'natural', 'boundary', 'conditions', 'are', 'considered', 'the', 'results', 'of', 'the', 'proposed', 'integral', 'and', 'differential', 'constitutive', 'models', 'are', 'identical', 'and', 'feasible']]
|
[-0.11365624772764354, 0.032876653378893915, -0.07938775794262781, 0.04547681831158874, -0.13047035123768894, -0.19490746282906188, -0.10116355332559178, 0.32737639147382214, -0.33094068526586085, -0.2619387362443652, 0.11843170437981679, -0.2617786941626131, -0.19227239782083339, 0.1472268175583121, -0.0620998954345247, 0.14793316836985296, 0.0355426588292141, -0.020672413189476137, -0.07015693967475586, -0.24028394216786347, 0.359430639360153, -0.042696151454266494, 0.2921953102699547, 0.039047443557318776, 0.15166900750090725, -0.06666061360034782, -0.01589167586823493, 0.10893833618257989, -0.14046062293125347, 0.09948250948908292, 0.2275044401342138, 0.02874137333901025, 0.28038650526007486, -0.4928177390909661, -0.3073446091366005, 0.10780961863625954, 0.05609873358063153, 0.10959138827711803, 0.014691086516878898, -0.26992604015086075, 0.052192303113709974, -0.10791908560201562, -0.126704111891706, -0.0800881268880308, 0.009119918337643534, 0.0075167830817189545, -0.32914350034616074, 0.152127372405505, 0.06500324308519115, 0.011639798077714952, -0.14632082955086365, -0.10099123857730019, -0.023572253270772114, 0.04954742470654654, 0.04911425684399956, -0.03337710129838631, 0.06444923778316139, -0.19286851765768895, -0.06278174000867241, 0.36883377926468286, -0.02843565806764138, -0.27283268604842476, 0.15741433512189942, -0.03992839892487532, -0.07439010379774169, 0.10134734311174178, 0.12047896686703037, 0.13865019019441546, -0.25320984770089244, 0.08071546539718338, -0.07812330830275077, 0.15035689701240673, 0.025960448789476502, -0.04606873651313203, 0.1445157342608047, 0.13438651317364197, 0.06449549305318938, 0.11108612156168544, 0.0012151116220571842, -0.1178718050136297, -0.36861829332548296, -0.12571590232234714, -0.13994214642336106, 0.008398142261543727, -0.1040505200688053, -0.1843947059435161, 0.3341317036977011, 0.18021853119620426, 0.10956809066138914, 0.05099928300492289, 0.236199389611287, 0.20026197226197234, 0.09475723153059658, 0.07524625511213219, 0.2780378618734443, 0.16690410054244667, 0.13121656600995016, -0.2649066949147903, 0.061877761787615754, 0.12452567208964395]
|
1,803.08647
|
Fictitious GAN: Training GANs with Historical Models
|
Generative adversarial networks (GANs) are powerful tools for learning
generative models. In practice, the training may suffer from lack of
convergence. GANs are commonly viewed as a two-player zero-sum game between two
neural networks. Here, we leverage this game theoretic view to study the
convergence behavior of the training process. Inspired by the fictitious play
learning process, a novel training method, referred to as Fictitious GAN, is
introduced. Fictitious GAN trains the deep neural networks using a mixture of
historical models. Specifically, the discriminator (resp. generator) is updated
according to the best-response to the mixture outputs from a sequence of
previously trained generators (resp. discriminators). It is shown that
Fictitious GAN can effectively resolve some convergence issues that cannot be
resolved by the standard training approach. It is proved that asymptotically
the average of the generator outputs has the same distribution as the data
samples.
|
cs.LG cs.CV stat.ML
|
generative adversarial networks gans are powerful tools for learning generative models in practice the training may suffer from lack of convergence gans are commonly viewed as a twoplayer zerosum game between two neural networks here we leverage this game theoretic view to study the convergence behavior of the training process inspired by the fictitious play learning process a novel training method referred to as fictitious gan is introduced fictitious gan trains the deep neural networks using a mixture of historical models specifically the discriminator resp generator is updated according to the bestresponse to the mixture outputs from a sequence of previously trained generators resp discriminators it is shown that fictitious gan can effectively resolve some convergence issues that cannot be resolved by the standard training approach it is proved that asymptotically the average of the generator outputs has the same distribution as the data samples
|
[['generative', 'adversarial', 'networks', 'gans', 'are', 'powerful', 'tools', 'for', 'learning', 'generative', 'models', 'in', 'practice', 'the', 'training', 'may', 'suffer', 'from', 'lack', 'of', 'convergence', 'gans', 'are', 'commonly', 'viewed', 'as', 'a', 'twoplayer', 'zerosum', 'game', 'between', 'two', 'neural', 'networks', 'here', 'we', 'leverage', 'this', 'game', 'theoretic', 'view', 'to', 'study', 'the', 'convergence', 'behavior', 'of', 'the', 'training', 'process', 'inspired', 'by', 'the', 'fictitious', 'play', 'learning', 'process', 'a', 'novel', 'training', 'method', 'referred', 'to', 'as', 'fictitious', 'gan', 'is', 'introduced', 'fictitious', 'gan', 'trains', 'the', 'deep', 'neural', 'networks', 'using', 'a', 'mixture', 'of', 'historical', 'models', 'specifically', 'the', 'discriminator', 'resp', 'generator', 'is', 'updated', 'according', 'to', 'the', 'bestresponse', 'to', 'the', 'mixture', 'outputs', 'from', 'a', 'sequence', 'of', 'previously', 'trained', 'generators', 'resp', 'discriminators', 'it', 'is', 'shown', 'that', 'fictitious', 'gan', 'can', 'effectively', 'resolve', 'some', 'convergence', 'issues', 'that', 'can', 'not', 'be', 'resolved', 'by', 'the', 'standard', 'training', 'approach', 'it', 'is', 'proved', 'that', 'asymptotically', 'the', 'average', 'of', 'the', 'generator', 'outputs', 'has', 'the', 'same', 'distribution', 'as', 'the', 'data', 'samples']]
|
[-0.00030515425478120983, 0.04455759392234765, -0.11513448939722491, 0.1557785948637639, -0.0821274442164457, -0.20440812637289502, -0.0006519475101002122, 0.45057071986518904, -0.3204337071295675, -0.3157034288224292, 0.044531703463353674, -0.2662431509489168, -0.22947282554607276, 0.1088507781176005, -0.19509515731774066, 0.0932168053719853, 0.12226944119184699, 0.02340295415671466, -0.013389240404948185, -0.29800937898865304, 0.31913084858926394, 0.06865732218214624, 0.3409039648377324, -0.08119227253666071, 0.15751252639225416, -0.06846785546624906, 0.044629475331469756, -0.008725872520512459, -0.04587152495509618, 0.12689358450166166, 0.29759634860970874, 0.2124609787029865, 0.4005519557131888, -0.4218340000418359, -0.251441360617133, 0.15210090749833274, 0.15441348609093525, 0.12896576959780123, -0.049258122290803556, -0.31367739072557516, 0.10970996544147803, -0.14074976743782602, 0.025425725635651448, -0.12485194676364325, -0.07905220148498066, 0.03663530175283883, -0.3504397039180494, -0.034985642350750835, 0.12246711962307764, 0.05350949755576376, -0.00804373939371706, -0.10728211979356224, -0.039902969981122714, 0.1493956594606734, 0.05425819752009088, 0.06931071977724308, 0.11988092070662301, -0.14487682031116716, -0.18194662487494748, 0.3033298300642979, -0.0825939720930302, -0.20818776592085209, 0.15302831681655746, 0.014698070327253782, -0.11521916340539003, 0.08938604554206082, 0.22226756380405277, 0.15219580540305946, -0.20067690371548477, 0.026564988202402648, -0.05750870629539075, 0.13329528906535715, 0.02448778068136475, -0.023283084629626614, 0.16225531164713025, 0.23419638138506815, 0.03566402300541634, 0.16722536160313997, -0.09000668667690599, -0.14993078623617656, -0.2546883188825968, -0.050312171690166, -0.2569561512034055, 0.06513734845544629, -0.08892222476982806, -0.18215111816482943, 0.35236024829775914, 0.18979602156618405, 0.21250528131279942, 0.13374198648491747, 0.31025322065656774, 0.06387062167369263, 0.10940694881041776, 0.09239587105877621, 0.20096702961516663, 0.1046873674670566, 0.12968019263385094, -0.13828894671065453, 0.1573658024490339, 0.07959970375459181]
|
1,803.08648
|
Seshadri constants and Grassmann bundles over curves
|
Let $X$ be a smooth complex projective curve, and let $E$ be a vector bundle
on $X$ which is not semistable. For a suitably chosen integer $r$, let
$\text{Gr}(E)$ be the Grassmann bundle over $X$ that parametrizes the quotients
of the fibers of $E$ of dimension $r$. Assuming some numerical conditions on
the Harder-Narasimhan filtration of $E$, we study Seshadri constants of ample
line bundles on $\text{Gr}(E)$. In many cases, we give the precise value of
Seshadri constant. Our results generalize various known results for ${\rm
rank}(E)=2$.
|
math.AG
|
let x be a smooth complex projective curve and let e be a vector bundle on x which is not semistable for a suitably chosen integer r let textgre be the grassmann bundle over x that parametrizes the quotients of the fibers of e of dimension r assuming some numerical conditions on the hardernarasimhan filtration of e we study seshadri constants of ample line bundles on textgre in many cases we give the precise value of seshadri constant our results generalize various known results for rm ranke2
|
[['let', 'x', 'be', 'a', 'smooth', 'complex', 'projective', 'curve', 'and', 'let', 'e', 'be', 'a', 'vector', 'bundle', 'on', 'x', 'which', 'is', 'not', 'semistable', 'for', 'a', 'suitably', 'chosen', 'integer', 'r', 'let', 'textgre', 'be', 'the', 'grassmann', 'bundle', 'over', 'x', 'that', 'parametrizes', 'the', 'quotients', 'of', 'the', 'fibers', 'of', 'e', 'of', 'dimension', 'r', 'assuming', 'some', 'numerical', 'conditions', 'on', 'the', 'hardernarasimhan', 'filtration', 'of', 'e', 'we', 'study', 'seshadri', 'constants', 'of', 'ample', 'line', 'bundles', 'on', 'textgre', 'in', 'many', 'cases', 'we', 'give', 'the', 'precise', 'value', 'of', 'seshadri', 'constant', 'our', 'results', 'generalize', 'various', 'known', 'results', 'for', 'rm', 'ranke2']]
|
[-0.2467731520356167, 0.05025721144227732, -0.08588777322854314, -0.025449132234955738, -0.10294092189620382, -0.2047150034645927, 0.007133104217549165, 0.3822677971883899, -0.3053105014287645, -0.13539555549089397, 0.09606269576692111, -0.21845610766848994, -0.08878140498529233, 0.2655315547072816, -0.14728984776662574, -0.03315620938138593, 0.044133422050869, 0.10558627283067576, -0.07572752096235663, -0.32003375391442596, 0.39018560258582946, -0.02721331322321757, 0.1915449208047773, 0.08892497100723198, 0.10913764263525427, 0.01739371898916683, 0.014783280557908472, -0.004094403667966704, -0.2327493576453673, 0.14592468138739823, 0.3041559296706553, 0.07507943519158289, 0.17821604004573255, -0.33534646848039257, -0.20026637566652858, 0.27799164492864203, 0.11435926041962202, -0.09835228561894924, 0.060821796591404735, -0.2359385141559566, 0.1396986488751801, -0.06892314993698771, -0.16693085054811535, -0.11053624435416645, 0.11823655042376015, 0.04485938265099235, -0.3066856846867484, -0.08545274305201712, 0.035905713825264855, 0.15129486195343947, -0.04807982654199891, -0.15907310216598922, -0.10699707547263686, -0.024453141971857155, 0.016080823679831588, 0.09957739888479755, 0.11729535298045016, -0.04250693212573727, -0.09095001378695347, 0.3804750204186088, -0.13093060403618784, -0.272153478625807, 0.0647986904729069, -0.17580667488731533, -0.09639904187393508, 0.16164839828741692, 0.1379990983599176, 0.22745601860584602, 0.08278596902354843, 0.2164396919231097, -0.16567977609485665, 0.09028367236966178, 0.06888733425044588, -0.049450653832450155, 0.156632921381277, 0.06845161104796543, 0.06548272898501073, 0.03357168863710415, -0.019159096151789918, 0.01985323258365194, -0.43194924348167013, -0.23198941857775762, -0.11402902093028561, 0.2684985914552055, -0.16297771774458983, -0.11500950213355411, 0.3588801153458744, 0.028854104729058843, 0.308340252066652, 0.1273400017428988, 0.192756428460901, 0.034252582845510915, -0.00781471053570775, 0.031307987802262814, 0.1250686027969572, 0.21875313515331418, -0.047757752457289915, -0.11662206693186558, 0.008523089794575103, 0.16758942857961215]
|
1,803.08649
|
An equivalent formulation of chromatic quasi-polynomials
|
Given a central integral arrangement, the reduction of the arrangement modulo
positive integers $q$ gives rise to a subgroup arrangement in
$(\mathbb{Z}/q\mathbb{Z})^\ell$. Kamiya-Takemura-Terao (2008) introduced the
notion of characteristic quasi-polynomials, which uses to evaluate the
cardinality of the complement of the subgroup arrangement. Chen-Wang (2012)
found a similar but more general setting that replacing the integral
arrangement by its restriction to a subspace of $\mathbb{R}^\ell$, and
evaluating the cardinality of the $q$-reduction complement will also lead to a
quasi-polynomial in $q$. On an independent study, Br\"and\'en-Moci (2014)
defined the so-called chromatic quasi-polynomial, and initiated the study of
$q$-colorings on a finite list of elements in a finitely generated abelian
group. The main purpose of this paper is to verify that the Chen-Wang's
quasi-polynomial and the Br\"and\'en-Moci's chromatic quasi-polynomial are
equivalent in the sense that the quasi-polynomials enumerate the cardinalities
of isomorphic sets.
|
math.CO
|
given a central integral arrangement the reduction of the arrangement modulo positive integers q gives rise to a subgroup arrangement in mathbbzqmathbbzell kamiyatakemuraterao 2008 introduced the notion of characteristic quasipolynomials which uses to evaluate the cardinality of the complement of the subgroup arrangement chenwang 2012 found a similar but more general setting that replacing the integral arrangement by its restriction to a subspace of mathbbrell and evaluating the cardinality of the qreduction complement will also lead to a quasipolynomial in q on an independent study brandenmoci 2014 defined the socalled chromatic quasipolynomial and initiated the study of qcolorings on a finite list of elements in a finitely generated abelian group the main purpose of this paper is to verify that the chenwangs quasipolynomial and the brandenmocis chromatic quasipolynomial are equivalent in the sense that the quasipolynomials enumerate the cardinalities of isomorphic sets
|
[['given', 'a', 'central', 'integral', 'arrangement', 'the', 'reduction', 'of', 'the', 'arrangement', 'modulo', 'positive', 'integers', 'q', 'gives', 'rise', 'to', 'a', 'subgroup', 'arrangement', 'in', 'mathbbzqmathbbzell', 'kamiyatakemuraterao', '2008', 'introduced', 'the', 'notion', 'of', 'characteristic', 'quasipolynomials', 'which', 'uses', 'to', 'evaluate', 'the', 'cardinality', 'of', 'the', 'complement', 'of', 'the', 'subgroup', 'arrangement', 'chenwang', '2012', 'found', 'a', 'similar', 'but', 'more', 'general', 'setting', 'that', 'replacing', 'the', 'integral', 'arrangement', 'by', 'its', 'restriction', 'to', 'a', 'subspace', 'of', 'mathbbrell', 'and', 'evaluating', 'the', 'cardinality', 'of', 'the', 'qreduction', 'complement', 'will', 'also', 'lead', 'to', 'a', 'quasipolynomial', 'in', 'q', 'on', 'an', 'independent', 'study', 'brandenmoci', '2014', 'defined', 'the', 'socalled', 'chromatic', 'quasipolynomial', 'and', 'initiated', 'the', 'study', 'of', 'qcolorings', 'on', 'a', 'finite', 'list', 'of', 'elements', 'in', 'a', 'finitely', 'generated', 'abelian', 'group', 'the', 'main', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'verify', 'that', 'the', 'chenwangs', 'quasipolynomial', 'and', 'the', 'brandenmocis', 'chromatic', 'quasipolynomial', 'are', 'equivalent', 'in', 'the', 'sense', 'that', 'the', 'quasipolynomials', 'enumerate', 'the', 'cardinalities', 'of', 'isomorphic', 'sets']]
|
[-0.18343514506790703, 0.07270576711497971, -0.08516223541022662, 0.02963278261021889, -0.09920041452449582, -0.0808835476226009, 0.037416857996825405, 0.29597338240401927, -0.29573824802440973, -0.26350775806863297, 0.07868387435412254, -0.23721459490137503, -0.13746838167357697, 0.18063196709708257, -0.14107753456953695, -0.002019954263660646, 0.037806157813654005, 0.06501914080752827, -0.022582598424324876, -0.33131065993460224, 0.32898167634346676, 0.013835265862700693, 0.21669069359332377, 0.04148372940664344, 0.08813929449688122, 0.041113028785569924, -0.061469389550278294, 0.0473786011502585, -0.1671042201743844, 0.13817772417849697, 0.2528983496869093, 0.10876047190295675, 0.2395727486385594, -0.34942642563050064, -0.07893561160616468, 0.20195149866562775, 0.1341878539738793, -0.006913510443101747, 0.0017442096598054323, -0.23066425296094487, 0.1042031991733786, -0.1471326376640183, -0.1660060514798662, -0.027766858350814265, 0.11046525768880897, 0.02323320885325837, -0.25743604417178123, -0.05673650102813982, 0.12387127729187555, 0.10247694087036721, -0.010652220303788507, -0.13193115258421612, -0.00043582585674491436, 0.0577400606331032, -0.030794729254386553, 0.06940819768094704, 0.04391608400585349, -0.0790622381878968, -0.15564953365366604, 0.3918049554888378, -0.01651118607568445, -0.1824914590756902, 0.14226893897113554, -0.16960449082783752, -0.14220067018793678, 0.15771363698877394, 0.137431728783721, 0.1289993474698242, -0.041561141254051644, 0.15219659355395432, -0.17301234637167962, 0.13567391723421784, 0.14144928691401967, 0.0031100906220244188, 0.11211199768962722, 0.06478103255058694, 0.0977809059276136, 0.1848784211666926, 0.030877843660110718, -0.010455644083455862, -0.3424968055778128, -0.17913474828032228, -0.20404684821979197, 0.07038938189490342, -0.09459887337085521, -0.19774305507855708, 0.43121581274659976, 0.11220590578501716, 0.1874742970445796, 0.09535509066036492, 0.2048236504967516, 0.0769856697811252, 0.050959026120835915, 0.06825127515270758, 0.12086751706459943, 0.19358009899973266, -0.041384886169586986, -0.21489825093800285, 0.05409211739692289, 0.1896519466775798]
|
1,803.0865
|
Optimal Compression and Transmission Rate Control for Node-Lifetime
Maximization
|
We consider a system that is composed of an energy constrained sensor node
and a sink node, and devise optimal data compression and transmission policies
with an objective to prolong the lifetime of the sensor node. While applying
compression before transmission reduces the energy consumption of transmitting
the sensed data, blindly applying too much compression may even exceed the cost
of transmitting raw data, thereby losing its purpose. Hence, it is important to
investigate the trade-off between data compression and transmission energy
costs. In this paper, we study the joint optimal compression-transmission
design in three scenarios which differ in terms of the available channel
information at the sensor node, and cover a wide range of practical situations.
We formulate and solve joint optimization problems aiming to maximize the
lifetime of the sensor node whilst satisfying specific delay and bit error rate
(BER) constraints. Our results show that a jointly optimized
compression-transmission policy achieves significantly longer lifetime (90% to
2000%) as compared to optimizing transmission only without compression.
Importantly, this performance advantage is most profound when the delay
constraint is stringent, which demonstrates its suitability for low latency
communication in future wireless networks.
|
cs.IT math.IT
|
we consider a system that is composed of an energy constrained sensor node and a sink node and devise optimal data compression and transmission policies with an objective to prolong the lifetime of the sensor node while applying compression before transmission reduces the energy consumption of transmitting the sensed data blindly applying too much compression may even exceed the cost of transmitting raw data thereby losing its purpose hence it is important to investigate the tradeoff between data compression and transmission energy costs in this paper we study the joint optimal compressiontransmission design in three scenarios which differ in terms of the available channel information at the sensor node and cover a wide range of practical situations we formulate and solve joint optimization problems aiming to maximize the lifetime of the sensor node whilst satisfying specific delay and bit error rate ber constraints our results show that a jointly optimized compressiontransmission policy achieves significantly longer lifetime 90 to 2000 as compared to optimizing transmission only without compression importantly this performance advantage is most profound when the delay constraint is stringent which demonstrates its suitability for low latency communication in future wireless networks
|
[['we', 'consider', 'a', 'system', 'that', 'is', 'composed', 'of', 'an', 'energy', 'constrained', 'sensor', 'node', 'and', 'a', 'sink', 'node', 'and', 'devise', 'optimal', 'data', 'compression', 'and', 'transmission', 'policies', 'with', 'an', 'objective', 'to', 'prolong', 'the', 'lifetime', 'of', 'the', 'sensor', 'node', 'while', 'applying', 'compression', 'before', 'transmission', 'reduces', 'the', 'energy', 'consumption', 'of', 'transmitting', 'the', 'sensed', 'data', 'blindly', 'applying', 'too', 'much', 'compression', 'may', 'even', 'exceed', 'the', 'cost', 'of', 'transmitting', 'raw', 'data', 'thereby', 'losing', 'its', 'purpose', 'hence', 'it', 'is', 'important', 'to', 'investigate', 'the', 'tradeoff', 'between', 'data', 'compression', 'and', 'transmission', 'energy', 'costs', 'in', 'this', 'paper', 'we', 'study', 'the', 'joint', 'optimal', 'compressiontransmission', 'design', 'in', 'three', 'scenarios', 'which', 'differ', 'in', 'terms', 'of', 'the', 'available', 'channel', 'information', 'at', 'the', 'sensor', 'node', 'and', 'cover', 'a', 'wide', 'range', 'of', 'practical', 'situations', 'we', 'formulate', 'and', 'solve', 'joint', 'optimization', 'problems', 'aiming', 'to', 'maximize', 'the', 'lifetime', 'of', 'the', 'sensor', 'node', 'whilst', 'satisfying', 'specific', 'delay', 'and', 'bit', 'error', 'rate', 'ber', 'constraints', 'our', 'results', 'show', 'that', 'a', 'jointly', 'optimized', 'compressiontransmission', 'policy', 'achieves', 'significantly', 'longer', 'lifetime', '90', 'to', '2000', 'as', 'compared', 'to', 'optimizing', 'transmission', 'only', 'without', 'compression', 'importantly', 'this', 'performance', 'advantage', 'is', 'most', 'profound', 'when', 'the', 'delay', 'constraint', 'is', 'stringent', 'which', 'demonstrates', 'its', 'suitability', 'for', 'low', 'latency', 'communication', 'in', 'future', 'wireless', 'networks']]
|
[-0.18997409652526442, 0.010988235477462263, -0.012314016494507852, 0.022784578335765554, -0.069595136752009, -0.21993542870163527, 0.14167476581764946, 0.3930231421597694, -0.3045163559696735, -0.3434309575535161, 0.12741281817128, -0.2562953424689017, -0.10227896825189849, 0.18155861754632113, -0.13539261271883, 0.09241772881512972, 0.11214748391587483, 0.07439976408710017, -0.04690833117285939, -0.288641401323931, 0.25243423920137026, 0.16950346807410058, 0.3706380367793731, 0.06307565308862219, 0.10894357666593829, 0.0479073304781004, -0.01529236376089485, -0.028763501282389227, -0.10783978378741793, 0.10679921057614448, 0.3048959046087571, 0.1996007173420175, 0.2879649048401533, -0.4341280430506327, -0.2645763604705663, 0.11550647956319153, 0.1379475320223719, 0.07908373054876727, -0.02676804068277737, -0.22192719748341724, 0.12744161485675967, -0.18529659003803606, -0.01813769346397174, -0.004500987989778974, -0.015158497402444482, 0.0316371695662383, -0.3180612527403833, 0.052439791037652055, -0.02293802048814924, -0.006422608701120082, -0.08246606146107967, -0.08803609148660478, 0.00675869539355565, 0.1615640846738212, 0.014409475586695695, 0.014436946311769517, 0.15965306964016668, -0.1308305649233884, -0.0760497635077244, 0.39518153290019226, 0.010208954402294598, -0.1756021433056479, 0.1258899909912878, -0.05787432766642029, -0.09932260148619351, 0.15837476101066722, 0.23225259803676684, 0.06377507223943739, -0.18185156129130567, -0.006963611595902445, 0.05672566697957288, 0.18952698385048855, 0.10105049270817912, 0.10336473455505543, 0.1417647482949848, 0.22025426005589235, 0.15703660252406018, 0.1573113418993001, -0.1268261825641323, -0.0872846912617158, -0.21443893174934936, -0.13088860262773538, -0.21821777784314594, 0.017118138604258235, -0.11965058353234781, -0.033016417195138176, 0.3768008146508548, 0.18574423628413475, 0.19050319343468322, 0.11762575501128786, 0.40118530991634255, 0.11627591705550194, 0.054129958606484396, 0.126626847042261, 0.22745475365633244, 0.04719212543629845, 0.1303540730545616, -0.22640656143622964, 0.10046041520361446, -0.07619734572761348]
|
1,803.08651
|
Learning Recommendations While Influencing Interests
|
Personalized recommendation systems (RS) are extensively used in many
services. Many of these are based on learning algorithms where the RS uses the
recommendation history and the user response to learn an optimal strategy.
Further, these algorithms are based on the assumption that the user interests
are rigid. Specifically, they do not account for the effect of learning
strategy on the evolution of the user interests. In this paper we develop
influence models for a learning algorithm that is used to optimally recommend
websites to web users. We adapt the model of \cite{Ioannidis10} to include an
item-dependent reward to the RS from the suggestions that are accepted by the
user. For this we first develop a static optimisation scheme when all the
parameters are known. Next we develop a stochastic approximation based learning
scheme for the RS to learn the optimal strategy when the user profiles are not
known. Finally, we describe several user-influence models for the learning
algorithm and analyze their effect on the steady user interests and on the
steady state optimal strategy as compared to that when the users are not
influenced.
|
cs.IR cs.LG stat.ML
|
personalized recommendation systems rs are extensively used in many services many of these are based on learning algorithms where the rs uses the recommendation history and the user response to learn an optimal strategy further these algorithms are based on the assumption that the user interests are rigid specifically they do not account for the effect of learning strategy on the evolution of the user interests in this paper we develop influence models for a learning algorithm that is used to optimally recommend websites to web users we adapt the model of citeioannidis10 to include an itemdependent reward to the rs from the suggestions that are accepted by the user for this we first develop a static optimisation scheme when all the parameters are known next we develop a stochastic approximation based learning scheme for the rs to learn the optimal strategy when the user profiles are not known finally we describe several userinfluence models for the learning algorithm and analyze their effect on the steady user interests and on the steady state optimal strategy as compared to that when the users are not influenced
|
[['personalized', 'recommendation', 'systems', 'rs', 'are', 'extensively', 'used', 'in', 'many', 'services', 'many', 'of', 'these', 'are', 'based', 'on', 'learning', 'algorithms', 'where', 'the', 'rs', 'uses', 'the', 'recommendation', 'history', 'and', 'the', 'user', 'response', 'to', 'learn', 'an', 'optimal', 'strategy', 'further', 'these', 'algorithms', 'are', 'based', 'on', 'the', 'assumption', 'that', 'the', 'user', 'interests', 'are', 'rigid', 'specifically', 'they', 'do', 'not', 'account', 'for', 'the', 'effect', 'of', 'learning', 'strategy', 'on', 'the', 'evolution', 'of', 'the', 'user', 'interests', 'in', 'this', 'paper', 'we', 'develop', 'influence', 'models', 'for', 'a', 'learning', 'algorithm', 'that', 'is', 'used', 'to', 'optimally', 'recommend', 'websites', 'to', 'web', 'users', 'we', 'adapt', 'the', 'model', 'of', 'citeioannidis10', 'to', 'include', 'an', 'itemdependent', 'reward', 'to', 'the', 'rs', 'from', 'the', 'suggestions', 'that', 'are', 'accepted', 'by', 'the', 'user', 'for', 'this', 'we', 'first', 'develop', 'a', 'static', 'optimisation', 'scheme', 'when', 'all', 'the', 'parameters', 'are', 'known', 'next', 'we', 'develop', 'a', 'stochastic', 'approximation', 'based', 'learning', 'scheme', 'for', 'the', 'rs', 'to', 'learn', 'the', 'optimal', 'strategy', 'when', 'the', 'user', 'profiles', 'are', 'not', 'known', 'finally', 'we', 'describe', 'several', 'userinfluence', 'models', 'for', 'the', 'learning', 'algorithm', 'and', 'analyze', 'their', 'effect', 'on', 'the', 'steady', 'user', 'interests', 'and', 'on', 'the', 'steady', 'state', 'optimal', 'strategy', 'as', 'compared', 'to', 'that', 'when', 'the', 'users', 'are', 'not', 'influenced']]
|
[-0.050579451043721656, 0.01968919964981199, -0.0932834810157726, 0.09138833476770362, -0.14880644569460016, -0.1930699989348036, 0.07881608266181282, 0.46786371747461647, -0.2683958931426917, -0.307742190792911, 0.09466929353164652, -0.2567927229351231, -0.21359658292187686, 0.19893709140967905, -0.09722703709241494, 0.06126130619316597, 0.015823898321736585, 0.09886325018705575, -0.0431958966802775, -0.334133169235109, 0.34099526663955587, 0.05080128677578254, 0.31483386699519644, 0.010096095384681945, 0.07081492075307684, 0.011233416158235171, -0.038962724951228926, 0.01017818605568219, -0.13633977004232853, 0.13063762246651556, 0.30517428822913445, 0.20905193721537815, 0.3403020693516297, -0.4215073534031654, -0.19351645841027845, 0.08344364132102743, 0.13697569721341926, 0.13830662305098396, -0.0583452094342447, -0.275586051666843, 0.1313756839576904, -0.2032937281585943, -0.011942946206225635, -0.08162132606606234, -0.04705112126840094, 0.062487749551719686, -0.31650477409321853, -0.038417849996751484, 0.03818730987060897, 0.005480569306310717, -0.08030565228929826, -0.10189537128438703, 0.03416835015721537, 0.19665593687034913, 0.07816560340566807, -0.028603650821413803, 0.14885186964030644, -0.13059693675457532, -0.15410922436557895, 0.38474286421826415, -0.014897837711991947, -0.2211187041395313, 0.1821916522163959, -0.04041804275782472, -0.1445522753043346, 0.09479577366421306, 0.27111350613963475, 0.13267642723084275, -0.17829287463821827, 0.02240713249673238, -0.04143864747423392, 0.16454528499865434, -0.01408636034850113, 0.008443920694005031, 0.1735121783017498, 0.1751443312598065, 0.08237856591266202, 0.0735870492430327, -0.06277429887508093, -0.10194865391579466, -0.21284807874606207, -0.11018707805215944, -0.16990435924918318, -0.029544362551190476, -0.06936895952198288, -0.13851754495104554, 0.38821822953304747, 0.22652816289401317, 0.1633056992496067, 0.08324292976956732, 0.31402906988859997, 0.08283909630212052, 0.04487175134184596, 0.14717302962902237, 0.21185365912074652, 0.011293672849065982, 0.15585359034722077, -0.21222124472490747, 0.14330621324172552, 0.04698388553275676]
|
1,803.08652
|
Studio Ousia's Quiz Bowl Question Answering System
|
In this chapter, we describe our question answering system, which was the
winning system at the Human-Computer Question Answering (HCQA) Competition at
the Thirty-first Annual Conference on Neural Information Processing Systems
(NIPS). The competition requires participants to address a factoid question
answering task referred to as quiz bowl. To address this task, we use two novel
neural network models and combine these models with conventional information
retrieval models using a supervised machine learning model. Our system achieved
the best performance among the systems submitted in the competition and won a
match against six top human quiz experts by a wide margin.
|
cs.CL
|
in this chapter we describe our question answering system which was the winning system at the humancomputer question answering hcqa competition at the thirtyfirst annual conference on neural information processing systems nips the competition requires participants to address a factoid question answering task referred to as quiz bowl to address this task we use two novel neural network models and combine these models with conventional information retrieval models using a supervised machine learning model our system achieved the best performance among the systems submitted in the competition and won a match against six top human quiz experts by a wide margin
|
[['in', 'this', 'chapter', 'we', 'describe', 'our', 'question', 'answering', 'system', 'which', 'was', 'the', 'winning', 'system', 'at', 'the', 'humancomputer', 'question', 'answering', 'hcqa', 'competition', 'at', 'the', 'thirtyfirst', 'annual', 'conference', 'on', 'neural', 'information', 'processing', 'systems', 'nips', 'the', 'competition', 'requires', 'participants', 'to', 'address', 'a', 'factoid', 'question', 'answering', 'task', 'referred', 'to', 'as', 'quiz', 'bowl', 'to', 'address', 'this', 'task', 'we', 'use', 'two', 'novel', 'neural', 'network', 'models', 'and', 'combine', 'these', 'models', 'with', 'conventional', 'information', 'retrieval', 'models', 'using', 'a', 'supervised', 'machine', 'learning', 'model', 'our', 'system', 'achieved', 'the', 'best', 'performance', 'among', 'the', 'systems', 'submitted', 'in', 'the', 'competition', 'and', 'won', 'a', 'match', 'against', 'six', 'top', 'human', 'quiz', 'experts', 'by', 'a', 'wide', 'margin']]
|
[-0.06507190581411124, -0.004733494068495929, -0.016194903999567033, 0.08836088967858814, -0.10514653274440207, -0.22757433775812388, 0.07310663516167551, 0.35800217408686874, -0.279897309007938, -0.4063674882799387, 0.05967892837477848, -0.3230273434892297, -0.1875228018895723, 0.16234134088037536, -0.17784732410684229, 0.0702912843460217, 0.1443568025715649, 0.04186536641092971, 0.02163562538102269, -0.39999662032350897, 0.3241820183722302, 0.03224635090213269, 0.33459408493712545, 0.0646155970171094, 0.1356879172148183, -0.01570091803558171, -0.031482857475057247, -0.046188917217077685, -0.08940572804305702, 0.17251175694167614, 0.364034778711175, 0.20575185253750533, 0.38976082630455494, -0.3569957918301225, -0.18820278322324158, 0.06934111348702572, 0.09642671277746558, 0.10814739584340714, -0.004332521996693686, -0.34938193126581607, 0.03428831839002669, -0.20688447318971157, 0.05204619551310316, -0.10026476136408746, -0.009928766903467477, -0.06423219212330877, -0.22983177308924496, 0.0005245183315128088, 0.12509055281057954, 0.13334660853259264, -0.06201629921793938, -0.0943340316080139, 0.09899333918932825, 0.20428653429728003, 0.0012973360333126038, 0.10036147268139757, 0.10466919861268252, -0.21134342978242784, -0.23139013537205755, 0.38491904199123383, -0.06028422543546185, -0.16209083921974524, 0.2379766273126006, -0.015098554387222976, -0.1611800994630903, 0.00396762493532151, 0.2827683800132945, 0.08338052708189934, -0.17459256844595075, -0.0017041618388611824, -0.07382437575608491, 0.2541261753812432, 0.08380444888724015, -0.08476221691817046, 0.24134482409106567, 0.2999235243909061, -0.006511374991387129, 0.11063338710926474, -0.007017563607078046, -0.10292814954649657, -0.146635735752061, -0.07528776467777788, -0.14485629669157787, -0.031230804005172103, 0.019169698451005388, -0.10784707303624601, 0.3936242431867868, 0.24245567557401956, 0.17029899448156358, 0.06446299255476333, 0.29881435312330723, -0.012247265983605758, 0.04339442032855004, 0.09298268657992594, 0.17547835832927375, -0.009069205352570862, 0.23072854389902203, -0.1842912339605391, 0.09392457622569055, 0.08967101166257635]
|
1,803.08653
|
The maximum $p$-Spectral Radius of Hypergraphs with $m$ Edges
|
For $r\geq 2$ and $p\geq 1$, the $p$-spectral radius of an $r$-uniform
hypergraph $H=(V,E)$ on $n$ vertices is defined to be $$\rho_p(H)=\max_{{\bf
x}\in \mathbb{R}^n: \|{\bf x}\|_p=1}r \cdot \!\!\!\! \sum_{\{i_1,i_2,\ldots,
i_r\}\in E(H)} x_{i_1}x_{i_2}\cdots x_{i_r},$$ where the maximum is taken over
all ${\bf x\in \mathbb{R}^n}$ with the $p$-norm equals 1. In this paper, we
proved for any integer $r\geq 2$, and any real $p\geq 1$, and any $r$-uniform
hypergraph $H$ with $m={s\choose r}$ edges (for some real $s\geq r-1$), we have
$$\lambda_p(H)\leq \frac{rm}{s^{r/p}}.$$ The equality holds if and only if $s$
is an integer and $H$ is the complete $r$-uniform hypergraph $K^r_s$ with some
possible isolated vertices added. Thus, we completely settled a conjecture of
Nikiforov. In particular, we settled all the principal cases of the
Frankl-F\"{u}redi's Conjecture on the Lagrangians of $r$-uniform hypergraphs
for all $r\geq 2$.
|
math.CO
|
for rgeq 2 and pgeq 1 the pspectral radius of an runiform hypergraph hve on n vertices is defined to be rho_phmax_bf xin mathbbrn bf x_p1r cdot sum_i_1i_2ldots i_rin eh x_i_1x_i_2cdots x_i_r where the maximum is taken over all bf xin mathbbrn with the pnorm equals 1 in this paper we proved for any integer rgeq 2 and any real pgeq 1 and any runiform hypergraph h with mschoose r edges for some real sgeq r1 we have lambda_phleq fracrmsrp the equality holds if and only if s is an integer and h is the complete runiform hypergraph kr_s with some possible isolated vertices added thus we completely settled a conjecture of nikiforov in particular we settled all the principal cases of the franklfuredis conjecture on the lagrangians of runiform hypergraphs for all rgeq 2
|
[['for', 'rgeq', '2', 'and', 'pgeq', '1', 'the', 'pspectral', 'radius', 'of', 'an', 'runiform', 'hypergraph', 'hve', 'on', 'n', 'vertices', 'is', 'defined', 'to', 'be', 'rho_phmax_bf', 'xin', 'mathbbrn', 'bf', 'x_p1r', 'cdot', 'sum_i_1i_2ldots', 'i_rin', 'eh', 'x_i_1x_i_2cdots', 'x_i_r', 'where', 'the', 'maximum', 'is', 'taken', 'over', 'all', 'bf', 'xin', 'mathbbrn', 'with', 'the', 'pnorm', 'equals', '1', 'in', 'this', 'paper', 'we', 'proved', 'for', 'any', 'integer', 'rgeq', '2', 'and', 'any', 'real', 'pgeq', '1', 'and', 'any', 'runiform', 'hypergraph', 'h', 'with', 'mschoose', 'r', 'edges', 'for', 'some', 'real', 'sgeq', 'r1', 'we', 'have', 'lambda_phleq', 'fracrmsrp', 'the', 'equality', 'holds', 'if', 'and', 'only', 'if', 's', 'is', 'an', 'integer', 'and', 'h', 'is', 'the', 'complete', 'runiform', 'hypergraph', 'kr_s', 'with', 'some', 'possible', 'isolated', 'vertices', 'added', 'thus', 'we', 'completely', 'settled', 'a', 'conjecture', 'of', 'nikiforov', 'in', 'particular', 'we', 'settled', 'all', 'the', 'principal', 'cases', 'of', 'the', 'franklfuredis', 'conjecture', 'on', 'the', 'lagrangians', 'of', 'runiform', 'hypergraphs', 'for', 'all', 'rgeq', '2']]
|
[-0.21378986801331243, 0.12802412939125798, 0.03315467745923097, -0.00837400376090839, -0.02982389196635239, -0.2626478931134833, -0.05663547697310735, 0.35760035631912096, -0.22912276267547102, -0.2598139529249498, 0.08638333581898007, -0.36383151051233564, -0.07785363193224407, 0.06809304065130178, -0.0932388034102226, 0.028557148155948474, 0.05334067297360254, 0.11327411055875321, 0.009634367300711188, -0.3597929500956236, 0.29912978445091065, -0.121314479699654, 0.05652250725007246, 0.1399105289906618, 0.06148304768453633, 0.05877019624994506, 0.07245052746304917, 0.055020880330240676, -0.25627988094966564, 0.04868736676363614, 0.2739854587301139, 0.19989939159639772, 0.2794894426913252, -0.3615642844344534, -0.1511776759695735, 0.29230921817499966, 0.14858698984146088, -0.03974611208670669, 0.046358127411203605, -0.22605566745106545, 0.22762295083578912, -0.07408450364083466, -0.13446958527885497, 0.03509660975061475, 0.2134138627628249, -0.023877638057687334, -0.39877506501470056, -0.014229427295042172, 0.18429961250836235, 0.056395430920048735, -0.01702423667949107, -0.2463349540983992, -0.06420660490495345, 0.035463815325841544, -0.09571117640931219, 0.1345488505681888, -0.019409514671664626, -0.04854819662166789, -0.10789516287308837, 0.3355001285547457, -0.030764601481634946, -0.1721734054005956, 0.03470249909774533, -0.1684330664870758, -0.20025033051414148, 0.08137828542570037, 0.06825634541862186, 0.21319209624614036, 0.003489295580601763, 0.2472272188756578, -0.1595983848683462, 0.11081738663571221, 0.1577739961304894, -0.010406947896135823, 0.07550470778138361, 0.058139485055728565, 0.1798741587831284, 0.09216202130921865, -0.009800373905500958, 0.10572315439409095, -0.37792565023142194, -0.14158826267094043, -0.2760600781036792, 0.18104500793814954, -0.19159516684342792, -0.09216441339000113, 0.33455980640821276, 0.10336869968367475, 0.15555198400443981, 0.1309577348080301, 0.1787148124592874, 0.06245698344834622, -0.02039714023749906, 0.22683194303323354, 0.09337196368511604, 0.18585900898786292, -0.05333462760447421, -0.09853443901594137, -0.014670650482118602, 0.11281029575519146]
|
1,803.08654
|
A groupoid approach to $C^*$-algebras associated with $\lambda$-graph
systems and continuous orbit equivalence of subshifts
|
A $\lambda$-graph system $\frak L$ is a labeled Bratteli diagram with shift
operation. It is a generalized notion of finite labeled graph and presents a
subshifts. We will study continuous orbit equivalence of one-sided subshifts
and topological conjugacy of two-sided subshifts from the view points of
groupoids and $C^*$-algebras constructed from $\lambda$-graph systems.
|
math.OA math.DS
|
a lambdagraph system frak l is a labeled bratteli diagram with shift operation it is a generalized notion of finite labeled graph and presents a subshifts we will study continuous orbit equivalence of onesided subshifts and topological conjugacy of twosided subshifts from the view points of groupoids and calgebras constructed from lambdagraph systems
|
[['a', 'lambdagraph', 'system', 'frak', 'l', 'is', 'a', 'labeled', 'bratteli', 'diagram', 'with', 'shift', 'operation', 'it', 'is', 'a', 'generalized', 'notion', 'of', 'finite', 'labeled', 'graph', 'and', 'presents', 'a', 'subshifts', 'we', 'will', 'study', 'continuous', 'orbit', 'equivalence', 'of', 'onesided', 'subshifts', 'and', 'topological', 'conjugacy', 'of', 'twosided', 'subshifts', 'from', 'the', 'view', 'points', 'of', 'groupoids', 'and', 'calgebras', 'constructed', 'from', 'lambdagraph', 'systems']]
|
[-0.23973120920324945, 0.18546450784746207, -0.052208686800989904, 0.0679789978663771, -0.11744670865108382, -0.2102503885497462, 0.1400295017673722, 0.3764153952306172, -0.401866300628995, -0.14419655515900198, 0.10741558590165849, -0.329085428074424, -0.12434338131603205, 0.19149411432796493, -0.24752725028204467, 0.04702976700753184, 0.14600072024425245, 0.09542832401897407, -0.16955440064435298, -0.14763806647245492, 0.40674597195367207, -0.0664252662121863, 0.21664764259432284, -0.049087875461170695, 0.12797649366394528, -0.022538920403194596, -0.02672466516213597, 0.06302281766075571, -0.17686265322186476, 0.08613422126421388, 0.30776595854956024, 0.1157785718854218, 0.20815750613000314, -0.21560385976127297, -0.11386571713406944, 0.24160817936106743, 0.07571796925281579, 0.020002735778689384, -0.03657957899190907, -0.36910490340219354, 0.10782502342085794, -0.30465527919103513, -0.07992272149279432, -0.07278220509266797, 0.126098904082165, 0.01238883704491803, -0.252823148309341, -0.06747631320975861, 0.19334350357640465, 0.23495055938508572, -0.02836505983481711, 0.00022889182788653756, -0.10746051717707712, 0.09605851173752321, -0.10481846347486354, -0.002601740648970008, 0.09058892682089277, 0.02918434453214396, -0.20140937033970402, 0.38940461429784884, 0.015412273733296766, -0.18643512967578574, 0.1968057789962809, -0.15858132202389105, -0.18241728308065883, 0.15174626569562363, 0.07389321787511262, 0.11895565444357553, -0.08708316852110175, 0.21201083172696977, -0.13947559323794437, 0.0990112132287391, 0.03814819618567543, 0.03059514341348747, 0.16581264137343135, 0.16093793863492123, 0.1114168575666142, 0.2401084602054841, 0.0777019977147849, -0.02115542000546208, -0.29976741368618776, -0.11981432069585009, -0.120716524732141, 0.12683895683654076, -0.06416266023995187, -0.26299191227639623, 0.38543039876616225, 0.07493322218750727, 0.13892191382265598, 0.15752934198826551, 0.17957681224171845, 0.05643328743600199, 0.03089271257367899, 0.0610075485011242, 0.019502464295277057, 0.262483047778314, -0.005231883939144746, -0.1324327163637686, -0.03670520987800972, 0.32294333889588434]
|
1,803.08655
|
Tunable fluid-solid metamaterials for manipulation of elastic wave
propagation in broad frequency range
|
Current strategies for designing tunable locally resonant metamaterials are
based on tuning the stiffness of the resonator; however, this approach presents
a major shortcoming as the effective mass density is constant at high
frequency. Here, this paper reports a type of tunable locally elastic
metamaterial-'called tunable fluid-solid composite'-inspired by the functions
of heart and vessels in animals and humans. The proposed metamaterial consists
of several liquid or gas inclusions in a solid matrix, controlled through a
pair of embedded pumps. Both the band gap and effective mass density at high
frequency can be tuned by controlling the liquid distribution in the unit cell,
as demonstrated through a combination of theoretical analysis, numerical
simulation, and experimental testing. Finally, we show that the tunable
fluid-solid metamaterial can be utilized to manipulate wave propagation over a
broad frequency range, providing new avenues for vibration isolation and wave
guiding.
|
physics.app-ph
|
current strategies for designing tunable locally resonant metamaterials are based on tuning the stiffness of the resonator however this approach presents a major shortcoming as the effective mass density is constant at high frequency here this paper reports a type of tunable locally elastic metamaterialcalled tunable fluidsolid compositeinspired by the functions of heart and vessels in animals and humans the proposed metamaterial consists of several liquid or gas inclusions in a solid matrix controlled through a pair of embedded pumps both the band gap and effective mass density at high frequency can be tuned by controlling the liquid distribution in the unit cell as demonstrated through a combination of theoretical analysis numerical simulation and experimental testing finally we show that the tunable fluidsolid metamaterial can be utilized to manipulate wave propagation over a broad frequency range providing new avenues for vibration isolation and wave guiding
|
[['current', 'strategies', 'for', 'designing', 'tunable', 'locally', 'resonant', 'metamaterials', 'are', 'based', 'on', 'tuning', 'the', 'stiffness', 'of', 'the', 'resonator', 'however', 'this', 'approach', 'presents', 'a', 'major', 'shortcoming', 'as', 'the', 'effective', 'mass', 'density', 'is', 'constant', 'at', 'high', 'frequency', 'here', 'this', 'paper', 'reports', 'a', 'type', 'of', 'tunable', 'locally', 'elastic', 'metamaterialcalled', 'tunable', 'fluidsolid', 'compositeinspired', 'by', 'the', 'functions', 'of', 'heart', 'and', 'vessels', 'in', 'animals', 'and', 'humans', 'the', 'proposed', 'metamaterial', 'consists', 'of', 'several', 'liquid', 'or', 'gas', 'inclusions', 'in', 'a', 'solid', 'matrix', 'controlled', 'through', 'a', 'pair', 'of', 'embedded', 'pumps', 'both', 'the', 'band', 'gap', 'and', 'effective', 'mass', 'density', 'at', 'high', 'frequency', 'can', 'be', 'tuned', 'by', 'controlling', 'the', 'liquid', 'distribution', 'in', 'the', 'unit', 'cell', 'as', 'demonstrated', 'through', 'a', 'combination', 'of', 'theoretical', 'analysis', 'numerical', 'simulation', 'and', 'experimental', 'testing', 'finally', 'we', 'show', 'that', 'the', 'tunable', 'fluidsolid', 'metamaterial', 'can', 'be', 'utilized', 'to', 'manipulate', 'wave', 'propagation', 'over', 'a', 'broad', 'frequency', 'range', 'providing', 'new', 'avenues', 'for', 'vibration', 'isolation', 'and', 'wave', 'guiding']]
|
[-0.1512948417412508, 0.18569842805529105, -0.02547517874102284, -0.04696177546963929, -0.07415927671241229, -0.1531972804308667, 0.07845075909859156, 0.4390999449716581, -0.260052245937392, -0.29894459426038333, 0.07353310020708877, -0.22179370924465722, -0.16593373742221587, 0.2399413439728502, -0.002733602910628217, 0.0956265002104838, 0.005883450997615611, -0.06759785920694157, -0.04635913459538528, -0.10384465908465608, 0.2857166363994454, 0.04367942977094228, 0.3219532534525684, 0.1040894547770438, 0.12951303670716868, 0.0005685942332175645, 0.03989002421531677, 0.023818512066182764, -0.10984888530387812, 0.12427693299649582, 0.30037787026836427, 0.004163999348175484, 0.29733362675553276, -0.42625990803060415, -0.25851513950115107, 0.045552599302434424, 0.17689318169995985, 0.11469626209008267, -0.09927477681491576, -0.2744467375585093, 0.06436808639160403, -0.17518028452132756, -0.15539261159264006, -0.0852419428455715, -0.026900796404505684, 0.04207219492841082, -0.2507404673232378, 0.04436390945432265, -0.015802037804485202, 0.06905143997156536, -0.08000706177745405, -0.09072501648875227, 0.007249204730094, 0.08362015925992566, -0.024674596989501293, -0.005456308638872383, 0.21170528234842306, -0.11588124709995137, -0.08518363491117538, 0.3710460069115515, -0.0667988819031898, -0.1953136819875571, 0.1996772971600164, -0.10593264598877274, -0.011960582006592434, 0.1504796346294583, 0.20994328600647566, 0.07578375501805669, -0.15116908528982057, 0.010566928146742415, -0.0029852260349862198, 0.20403443412672911, 0.09107522135339938, 0.007499499349460865, 0.2710945760811699, 0.24904017134120207, 0.056570995660902526, 0.12852587525316, -0.07909318558640543, -0.008341476425424323, -0.2734735306625912, -0.15369601136112546, -0.2107845995464473, -0.013572474503832694, -0.08575072231931674, -0.17822007972900136, 0.4306871898576513, 0.1163615034681491, 0.15013801529873294, 0.01551620620530802, 0.3025713830639224, 0.10788820212596206, 0.07746950893376309, 0.0238688841406777, 0.275704054448467, 0.12071558911600834, 0.09304966600986289, -0.2593280257155689, 0.03783978127314338, -0.01713121305480339]
|
1,803.08656
|
Derived equivalence and fibrations over curves and surfaces
|
We prove that the bounded derived category of coherent sheaves on a smooth
projective complex variety reconstructs the isomorphism classes of fibrations
onto smooth projective curves of genus $g\geq 2$. Moreover, in dimension at
most four, we prove that the same category reconstructs the isomorphism classes
of fibrations onto normal projective surfaces with positive holomorphic Euler
characteristic and admitting a finite morphism to an abelian variety. Finally,
we study the derived invariance of a class of fibrations with minimal
base-dimension under the condition that all the Hodge numbers of type
$h^{0,p}(X)$ are derived invariant.
|
math.AG
|
we prove that the bounded derived category of coherent sheaves on a smooth projective complex variety reconstructs the isomorphism classes of fibrations onto smooth projective curves of genus ggeq 2 moreover in dimension at most four we prove that the same category reconstructs the isomorphism classes of fibrations onto normal projective surfaces with positive holomorphic euler characteristic and admitting a finite morphism to an abelian variety finally we study the derived invariance of a class of fibrations with minimal basedimension under the condition that all the hodge numbers of type h0px are derived invariant
|
[['we', 'prove', 'that', 'the', 'bounded', 'derived', 'category', 'of', 'coherent', 'sheaves', 'on', 'a', 'smooth', 'projective', 'complex', 'variety', 'reconstructs', 'the', 'isomorphism', 'classes', 'of', 'fibrations', 'onto', 'smooth', 'projective', 'curves', 'of', 'genus', 'ggeq', '2', 'moreover', 'in', 'dimension', 'at', 'most', 'four', 'we', 'prove', 'that', 'the', 'same', 'category', 'reconstructs', 'the', 'isomorphism', 'classes', 'of', 'fibrations', 'onto', 'normal', 'projective', 'surfaces', 'with', 'positive', 'holomorphic', 'euler', 'characteristic', 'and', 'admitting', 'a', 'finite', 'morphism', 'to', 'an', 'abelian', 'variety', 'finally', 'we', 'study', 'the', 'derived', 'invariance', 'of', 'a', 'class', 'of', 'fibrations', 'with', 'minimal', 'basedimension', 'under', 'the', 'condition', 'that', 'all', 'the', 'hodge', 'numbers', 'of', 'type', 'h0px', 'are', 'derived', 'invariant']]
|
[-0.2146522900717252, 0.05733750065748767, -0.07095729254449354, 0.0900312888375281, -0.083819356023172, -0.17489666364702355, -0.08475094008178491, 0.34253312662021135, -0.39584315314752294, -0.19919258971577106, 0.0641490247609276, -0.20544205946878166, -0.12467764249152463, 0.2544943549892987, -0.18724890442757422, -0.024581389799056087, 0.04325520604565416, 0.0788383612247265, -0.16015342464063154, -0.3113488000210213, 0.5293504334581287, -0.17041807844425025, 0.26484673352831084, 0.04833941155242349, 0.19598223091831998, -0.001160200103186071, 0.025238886009901762, -0.0005756385786377865, -0.15978192440453984, 0.1339600826942605, 0.3512964238939078, 0.06702843910012313, 0.0935098780141941, -0.3641807639606945, -0.16126873303690684, 0.28105577103712637, 0.0677379652020729, 0.006028839144045892, -0.01704529371320108, -0.2566112374846378, 0.13969356124795487, -0.10876466526204477, -0.19411742847169872, -0.08314857293811181, 0.056717546180943434, 0.022114054474513978, -0.18357124219840878, -0.07415318680147681, 0.09737641424062135, 0.17792919139458757, -0.09678286905451071, -0.043213397545395826, -0.161106766416671, 0.03827620710565142, -0.027593700792235526, 0.05159906744982278, 0.08817670197806918, -0.13117053214987012, -0.09556297131348401, 0.3403544692352981, -0.09005908350493132, -0.2396972290361705, 0.14129448280436918, -0.15383190564487292, -0.1692331538474916, 0.21008655269701115, 0.07429558291788334, 0.20029791931459762, 0.03352440125308931, 0.17594270678376273, -0.17283083038890493, 0.07800826697569826, 0.12642969663315656, -0.042787759772339916, 0.09625158384290483, 0.07077973827456488, 0.062153574099521276, 0.12385012452242612, -0.06920596897227528, -0.0476959452903627, -0.4110198853456456, -0.18198515126562637, -0.07867163260411673, 0.2199220344672263, -0.1296590687148716, -0.17877516923877207, 0.4562758111556911, -0.008178045780843368, 0.21308246200256373, 0.22710100345758963, 0.2187050439964008, -0.009151653538498542, 0.027342454283548843, 0.04313591412147102, 0.11678279786998325, 0.23346500828578745, -0.10981795825975259, -0.09062913464604998, -0.0285224278771278, 0.2505480844188044]
|
1,803.08657
|
Spontaneous continuous orbital motion of a pair of nanoparticles
levitated in air
|
We report on the discovery of a unidirectional continuous orbital motion of a
single pair of nanoparticles which occurs spontaneously in room-temperature air
and can be manipulated by light. By varying the relative position of two
nanoparticles, we demonstrate a phase transition between two Brownian particles
and a pair of co-orbiting particles. The orbital motion is sensitive to air
pressure and is vanishing at low pressure, suggesting that the orbital motion
is supported by air. Our results pave the way for manipulating nanoscale
objects on the basis of their cooperative dynamics.
|
cond-mat.mes-hall
|
we report on the discovery of a unidirectional continuous orbital motion of a single pair of nanoparticles which occurs spontaneously in roomtemperature air and can be manipulated by light by varying the relative position of two nanoparticles we demonstrate a phase transition between two brownian particles and a pair of coorbiting particles the orbital motion is sensitive to air pressure and is vanishing at low pressure suggesting that the orbital motion is supported by air our results pave the way for manipulating nanoscale objects on the basis of their cooperative dynamics
|
[['we', 'report', 'on', 'the', 'discovery', 'of', 'a', 'unidirectional', 'continuous', 'orbital', 'motion', 'of', 'a', 'single', 'pair', 'of', 'nanoparticles', 'which', 'occurs', 'spontaneously', 'in', 'roomtemperature', 'air', 'and', 'can', 'be', 'manipulated', 'by', 'light', 'by', 'varying', 'the', 'relative', 'position', 'of', 'two', 'nanoparticles', 'we', 'demonstrate', 'a', 'phase', 'transition', 'between', 'two', 'brownian', 'particles', 'and', 'a', 'pair', 'of', 'coorbiting', 'particles', 'the', 'orbital', 'motion', 'is', 'sensitive', 'to', 'air', 'pressure', 'and', 'is', 'vanishing', 'at', 'low', 'pressure', 'suggesting', 'that', 'the', 'orbital', 'motion', 'is', 'supported', 'by', 'air', 'our', 'results', 'pave', 'the', 'way', 'for', 'manipulating', 'nanoscale', 'objects', 'on', 'the', 'basis', 'of', 'their', 'cooperative', 'dynamics']]
|
[-0.1872461013199127, 0.2852351748548284, -0.08880845079669258, -0.041716846431462236, -0.04592207912611519, -0.07862680855688157, 0.06475123617501295, 0.4302929104766348, -0.26364012789185887, -0.32601588442512264, 0.04418707268880578, -0.28013704492004365, -0.11729188436376196, 0.19056487906273906, -0.011139738915877028, 0.023994282972845404, 0.048947863055618254, -0.02988322120118927, -0.022444750271880858, -0.13039804793443982, 0.2710749305232049, 0.016677307831711945, 0.2576520022537027, 0.07605462271597359, 0.14743563709371202, 0.01643116912384937, 0.025647709146142006, 0.0059681147603052, -0.08234744880562406, 0.12573143483681992, 0.16448168399242255, -0.017829772217997482, 0.22360654877355465, -0.4433603469937385, -0.2068194584552567, 0.04835090608469397, 0.1315111009363126, 0.1302719347391298, -0.10715948017749034, -0.3309257171874109, 0.07071833240871246, -0.12922615221200082, -0.16172623488499405, -0.0571115058693257, 0.021412921567948964, 0.057336092732109864, -0.22318564707433786, 0.08500863959664827, 0.06704302686613609, 0.09345020390637629, -0.09349209447851875, -0.05873882730624506, -0.07291495306724376, 0.10660119198779525, 0.026091155915899753, 0.021359289546016152, 0.21917803339394076, -0.11710385321946508, -0.12159014140143172, 0.4255403641324777, -0.08665710738808899, -0.1771203598959351, 0.21305950071949226, -0.18351281776635364, -0.018150587269401813, 0.18508563978740802, 0.17835901417656913, 0.15383598138834095, -0.16212643804745033, -0.013822258899441234, 0.0115056379831263, 0.18398157420189498, 0.08885995323186392, 0.03379120751908356, 0.31596321546713113, 0.18647392857615108, 0.06898163566058808, 0.16429701637973046, -0.12954927454344356, -0.07887174860461728, -0.22486139522804008, -0.2029105869689854, -0.22318575285620743, 0.008313220784907321, -0.08796777080819343, -0.10740675472214327, 0.37038357544608497, 0.1236419481491404, 0.20218635610417351, -0.03367444846118995, 0.2566224154811557, 0.06675910942159224, 0.0007290877990301821, 0.022429638954166036, 0.283314494068151, 0.0856869473342098, 0.08422047275906572, -0.2752121375786693, 0.08903289839093174, 0.016621946254847468]
|
1,803.08658
|
Proving a conjecture on chromatic polynomials by counting the number of
acyclic orientations
|
The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be
expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is
interpreted as the number of broken-cycle free spanning subgraphs of $G$ with
exactly $i$ components. The parameter $\epsilon(G)=\sum\limits_{i=1}^n
(n-i)a_i/\sum\limits_{i=1}^n a_i$ is the mean size of a broken-cycle-free
spanning subgraph of $G$. In this article, we confirm and strengthen a
conjecture proposed by Lundow and Markstr\"{o}m in 2006 that $\epsilon(T_n)<
\epsilon(G)<\epsilon(K_n)$ holds for any connected graph $G$ of order $n$ which
is neither the complete graph $K_n$ nor a tree $T_n$ of order $n$. The most
crucial step of our proof is to obtain the interpretation of all $a_i$'s by the
number of acyclic orientations of $G$.
|
math.CO
|
the chromatic polynomial pgx of a graph g of order n can be expressed as sumlimits_i1n1nia_ixi where a_i is interpreted as the number of brokencycle free spanning subgraphs of g with exactly i components the parameter epsilongsumlimits_i1n nia_isumlimits_i1n a_i is the mean size of a brokencyclefree spanning subgraph of g in this article we confirm and strengthen a conjecture proposed by lundow and markstrom in 2006 that epsilont_n epsilongepsilonk_n holds for any connected graph g of order n which is neither the complete graph k_n nor a tree t_n of order n the most crucial step of our proof is to obtain the interpretation of all a_is by the number of acyclic orientations of g
|
[['the', 'chromatic', 'polynomial', 'pgx', 'of', 'a', 'graph', 'g', 'of', 'order', 'n', 'can', 'be', 'expressed', 'as', 'sumlimits_i1n1nia_ixi', 'where', 'a_i', 'is', 'interpreted', 'as', 'the', 'number', 'of', 'brokencycle', 'free', 'spanning', 'subgraphs', 'of', 'g', 'with', 'exactly', 'i', 'components', 'the', 'parameter', 'epsilongsumlimits_i1n', 'nia_isumlimits_i1n', 'a_i', 'is', 'the', 'mean', 'size', 'of', 'a', 'brokencyclefree', 'spanning', 'subgraph', 'of', 'g', 'in', 'this', 'article', 'we', 'confirm', 'and', 'strengthen', 'a', 'conjecture', 'proposed', 'by', 'lundow', 'and', 'markstrom', 'in', '2006', 'that', 'epsilont_n', 'epsilongepsilonk_n', 'holds', 'for', 'any', 'connected', 'graph', 'g', 'of', 'order', 'n', 'which', 'is', 'neither', 'the', 'complete', 'graph', 'k_n', 'nor', 'a', 'tree', 't_n', 'of', 'order', 'n', 'the', 'most', 'crucial', 'step', 'of', 'our', 'proof', 'is', 'to', 'obtain', 'the', 'interpretation', 'of', 'all', 'a_is', 'by', 'the', 'number', 'of', 'acyclic', 'orientations', 'of', 'g']]
|
[-0.20576641286930275, 0.12613292859384306, -0.04074089951313066, -0.034899660887377754, -0.10295118614858775, -0.08759858157416736, 0.034460883751442586, 0.34174984352042276, -0.2444043579291449, -0.3548585420638254, 0.07946529533294072, -0.2576119711006026, -0.1299620919852276, 0.11823750715875239, -0.0691219315243264, -0.013690505033419295, 0.07682866793712256, 0.13477000552746984, 0.05905692192027345, -0.28654017222638856, 0.27820491981132095, -0.06002245760585841, 0.14849593165261601, 0.06519910578370197, 0.09103894448263519, 0.05434172566876643, -0.018264785124402907, 0.09796829350482396, -0.16074311949079048, 0.0909175353617347, 0.2840237204433867, 0.1448968590012993, 0.2508523021997125, -0.35969547854943407, -0.16112058120995276, 0.21881991618795804, 0.1435827345121652, 0.014787063299014268, 0.06217466198183872, -0.19507531335154824, 0.14577459780654559, -0.13146494779114923, -0.11071680917585683, 0.01216749801662647, 0.1174897064489347, 0.017355143448286172, -0.31368569944849395, 0.024362960235319205, 0.14125419985847892, 0.04644717900427403, 0.0833890539037788, -0.17338526311020055, -0.08190811025970443, 0.11653411612604503, -0.04411287242180185, 0.10540730274213408, 0.012278172222000582, -0.10815352090867236, -0.15304179823336503, 0.394908985368804, -0.05558329202230433, -0.1006775607475666, 0.08543126968477198, -0.15451231877388502, -0.1787832600702704, 0.10838129530505587, 0.08633803030372494, 0.17785662257423004, -0.059215453194661274, 0.15484644832085231, -0.1255161432394137, 0.1419249387820148, 0.10548354444714884, -0.0017724141469915157, 0.12029589453919066, 0.12012228234406966, 0.1288255194467638, 0.15061315653427435, 0.019601546370217368, 0.0679198328052061, -0.36194532759556614, -0.15050635623090244, -0.27531986669917524, 0.07947621124522239, -0.18779252099139504, -0.1811750140041113, 0.39486594551622317, 0.10628926645020126, 0.22220884765826027, 0.11142582408501767, 0.20154276175027783, 0.08835603678232508, 0.03610037658708515, 0.13165030389575771, 0.1021771438579351, 0.23047509049582812, -0.05822136194910854, -0.18003502399315713, 0.0786249992045298, 0.15783524152141548]
|
1,803.08659
|
On the semigroup generated by the renormalized Nelson Hamiltonian
|
Let us consider the renormalized Nelson model at a fixed total momentum $P$:
$H_{\mathrm{ren}}(P)$; The Hamiltonian $H_{\mathrm{ren}}(P)$ is defined through
an infinite energy renormalization. We prove that $e^{-\beta
H_{\mathrm{ren}}(P)}$ is positivity improving for all $P\in \mathbb{R}^3$ and
$\beta >0$ in the Fock representation.
|
math-ph math.MP
|
let us consider the renormalized nelson model at a fixed total momentum p h_mathrmrenp the hamiltonian h_mathrmrenp is defined through an infinite energy renormalization we prove that ebeta h_mathrmrenp is positivity improving for all pin mathbbr3 and beta 0 in the fock representation
|
[['let', 'us', 'consider', 'the', 'renormalized', 'nelson', 'model', 'at', 'a', 'fixed', 'total', 'momentum', 'p', 'h_mathrmrenp', 'the', 'hamiltonian', 'h_mathrmrenp', 'is', 'defined', 'through', 'an', 'infinite', 'energy', 'renormalization', 'we', 'prove', 'that', 'ebeta', 'h_mathrmrenp', 'is', 'positivity', 'improving', 'for', 'all', 'pin', 'mathbbr3', 'and', 'beta', '0', 'in', 'the', 'fock', 'representation']]
|
[-0.16455369854215965, 0.21533946388943911, -0.08356492667523928, 0.0523476792596887, -0.0324983132819017, -0.14397176717906152, 0.010957379327263943, 0.29591658525168896, -0.27181951944218125, -0.2156995188358218, -0.016276493151455598, -0.3259830788470978, -0.029218975914815485, 0.10374199702447756, -0.021580217232884363, 0.037197112322373445, 0.030122879665171683, 0.08000447407234894, -0.09415926227649284, -0.18601418720276722, 0.3130926485065111, -0.007660271859792776, 0.19720172474897185, 0.10448704443352166, 0.12837339385390975, 0.12019412797269259, 0.013361419875954473, -0.07108806264803333, -0.23144205998129153, 0.022529854764078937, 0.220701863753696, 0.03044210423628778, 0.2909350737626123, -0.3347135699938896, -0.20381870915636766, 0.1792037675243824, 0.1680072722523365, -0.0272606547791944, 0.058303367947553135, -0.2299978170803813, 0.08508248425218774, -0.1842006763096812, -0.22559463143955136, -0.09469734855689281, 0.06264316819088403, -0.03252676404406165, -0.30255341152985427, 0.050185255283966314, 0.03796548799200113, 0.02010740723114374, -0.09449886231206704, -0.14121090020811142, -0.09511461798751424, 0.07341304156106225, -0.021408402669611713, 0.11005825437821967, 0.061565843161715324, -0.07666371931690116, -0.046018295379918674, 0.32493234677023664, -0.09954858723443089, -0.26687416910778644, 0.04184531320839427, -0.14699461798421865, -0.14316094452298658, 0.09356339206529218, 0.06452452473688958, 0.11822756600761136, -0.0794093415444327, 0.3129282663454475, -0.09455388669617647, 0.09654796602702591, 0.08614529885871466, -0.005000099680538095, 0.06807577266726036, 0.057558745116017065, 0.1230999052275492, 0.08645158771663732, -0.011868451126352993, -0.08073542601710489, -0.3753092442314292, -0.17106632303533165, -0.20960579934085957, 0.1731201794951461, -0.10601585243556508, -0.14014724098405865, 0.33234241830055106, 0.08988208134203803, 0.20512255863828022, 0.12229268255015445, 0.19682251025251177, 0.2016368368640542, 0.024095708266073882, 0.1309675472073777, 0.09308318719592724, 0.154995996894878, 0.009720339299028003, -0.249295101024557, -0.05062472396313624, 0.17815695509184584]
|
1,803.0866
|
Lifting Layers: Analysis and Applications
|
The great advances of learning-based approaches in image processing and
computer vision are largely based on deeply nested networks that compose linear
transfer functions with suitable non-linearities. Interestingly, the most
frequently used non-linearities in imaging applications (variants of the
rectified linear unit) are uncommon in low dimensional approximation problems.
In this paper we propose a novel non-linear transfer function, called lifting,
which is motivated from a related technique in convex optimization. A lifting
layer increases the dimensionality of the input, naturally yields a linear
spline when combined with a fully connected layer, and therefore closes the gap
between low and high dimensional approximation problems. Moreover, applying the
lifting operation to the loss layer of the network allows us to handle
non-convex and flat (zero-gradient) cost functions. We analyze the proposed
lifting theoretically, exemplify interesting properties in synthetic
experiments and demonstrate its effectiveness in deep learning approaches to
image classification and denoising.
|
cs.CV cs.NE
|
the great advances of learningbased approaches in image processing and computer vision are largely based on deeply nested networks that compose linear transfer functions with suitable nonlinearities interestingly the most frequently used nonlinearities in imaging applications variants of the rectified linear unit are uncommon in low dimensional approximation problems in this paper we propose a novel nonlinear transfer function called lifting which is motivated from a related technique in convex optimization a lifting layer increases the dimensionality of the input naturally yields a linear spline when combined with a fully connected layer and therefore closes the gap between low and high dimensional approximation problems moreover applying the lifting operation to the loss layer of the network allows us to handle nonconvex and flat zerogradient cost functions we analyze the proposed lifting theoretically exemplify interesting properties in synthetic experiments and demonstrate its effectiveness in deep learning approaches to image classification and denoising
|
[['the', 'great', 'advances', 'of', 'learningbased', 'approaches', 'in', 'image', 'processing', 'and', 'computer', 'vision', 'are', 'largely', 'based', 'on', 'deeply', 'nested', 'networks', 'that', 'compose', 'linear', 'transfer', 'functions', 'with', 'suitable', 'nonlinearities', 'interestingly', 'the', 'most', 'frequently', 'used', 'nonlinearities', 'in', 'imaging', 'applications', 'variants', 'of', 'the', 'rectified', 'linear', 'unit', 'are', 'uncommon', 'in', 'low', 'dimensional', 'approximation', 'problems', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'nonlinear', 'transfer', 'function', 'called', 'lifting', 'which', 'is', 'motivated', 'from', 'a', 'related', 'technique', 'in', 'convex', 'optimization', 'a', 'lifting', 'layer', 'increases', 'the', 'dimensionality', 'of', 'the', 'input', 'naturally', 'yields', 'a', 'linear', 'spline', 'when', 'combined', 'with', 'a', 'fully', 'connected', 'layer', 'and', 'therefore', 'closes', 'the', 'gap', 'between', 'low', 'and', 'high', 'dimensional', 'approximation', 'problems', 'moreover', 'applying', 'the', 'lifting', 'operation', 'to', 'the', 'loss', 'layer', 'of', 'the', 'network', 'allows', 'us', 'to', 'handle', 'nonconvex', 'and', 'flat', 'zerogradient', 'cost', 'functions', 'we', 'analyze', 'the', 'proposed', 'lifting', 'theoretically', 'exemplify', 'interesting', 'properties', 'in', 'synthetic', 'experiments', 'and', 'demonstrate', 'its', 'effectiveness', 'in', 'deep', 'learning', 'approaches', 'to', 'image', 'classification', 'and', 'denoising']]
|
[-0.059413479302699364, 0.0036120811795505386, -0.046773905757193764, 0.05801471764377008, -0.10482630262772243, -0.16298199970896046, 0.013123455268796533, 0.414342289090467, -0.36799397874390705, -0.26877896015454705, 0.10578941104312738, -0.24108642261019364, -0.25096806813652317, 0.20071066674776375, -0.12800526312086732, 0.12460902809825104, 0.08403318603678296, -0.051251392277578516, -0.12832340129689934, -0.25065028918286164, 0.3120428385865913, 0.03015963077370543, 0.3339063096077492, 0.04951320584552983, 0.1452313909167424, 0.02290826588558654, 0.004276201700170835, 0.028334858410526065, -0.06985384154002532, 0.1932056351689001, 0.319134098837773, 0.1126950684034576, 0.3293233243888244, -0.44529015333702165, -0.24633253584926326, 0.07227446462726221, 0.13485197642818092, 0.07752110766790186, -0.07697400432933743, -0.2257742102071643, 0.06796967951891322, -0.13230421375017612, -0.029815119449049233, -0.13769980353458475, -0.04331474553793669, 0.008629509842333695, -0.2852323987792867, 0.050742795689341924, 0.06736356992584963, 0.02513776749993364, -0.07473336690377133, -0.10801482760036984, 0.019487864524126052, 0.08365279613314973, -0.008257633517496287, 0.030805384796112775, 0.09595280402728046, -0.18420137572694026, -0.1300029983681937, 0.33781589538790285, -0.053476761718435836, -0.2237324243038893, 0.2393545396393165, -0.060203592988351984, -0.14476985535836623, 0.10545550902374089, 0.2454119824866454, 0.1374949813603113, -0.1197306486829378, 0.11533026971039362, -0.009308188206826646, 0.1657200507260859, 0.07277660557224105, 0.009023945825077439, 0.14285291334458938, 0.22294413870976618, 0.08859574895041684, 0.2145158950177332, -0.10087356809604292, -0.09332277464990814, -0.22084133984521032, -0.1082020860289534, -0.19492555227596312, -0.01350837722265472, -0.08337186748724586, -0.1603910713021954, 0.41548427000641824, 0.1694926849589683, 0.2488934762092928, 0.051267245151878645, 0.3534085761383176, 0.13113897836146254, 0.13451008146318297, 0.06907269289096196, 0.20713925685423115, 0.13796025452398075, 0.08799434519993762, -0.19077533243379244, 0.020494307739039264, 0.048586081792600454]
|
1,803.08661
|
Bayesian Optimization with Expensive Integrands
|
We propose a Bayesian optimization algorithm for objective functions that are
sums or integrals of expensive-to-evaluate functions, allowing noisy
evaluations. These objective functions arise in multi-task Bayesian
optimization for tuning machine learning hyperparameters, optimization via
simulation, and sequential design of experiments with random environmental
conditions. Our method is average-case optimal by construction when a single
evaluation of the integrand remains within our evaluation budget. Achieving
this one-step optimality requires solving a challenging value of information
optimization problem, for which we provide a novel efficient
discretization-free computational method. We also provide consistency proofs
for our method in both continuum and discrete finite domains for objective
functions that are sums. In numerical experiments comparing against previous
state-of-the-art methods, including those that also leverage sum or integral
structure, our method performs as well or better across a wide range of
problems and offers significant improvements when evaluations are noisy or the
integrand varies smoothly in the integrated variables.
|
cs.LG stat.ML
|
we propose a bayesian optimization algorithm for objective functions that are sums or integrals of expensivetoevaluate functions allowing noisy evaluations these objective functions arise in multitask bayesian optimization for tuning machine learning hyperparameters optimization via simulation and sequential design of experiments with random environmental conditions our method is averagecase optimal by construction when a single evaluation of the integrand remains within our evaluation budget achieving this onestep optimality requires solving a challenging value of information optimization problem for which we provide a novel efficient discretizationfree computational method we also provide consistency proofs for our method in both continuum and discrete finite domains for objective functions that are sums in numerical experiments comparing against previous stateoftheart methods including those that also leverage sum or integral structure our method performs as well or better across a wide range of problems and offers significant improvements when evaluations are noisy or the integrand varies smoothly in the integrated variables
|
[['we', 'propose', 'a', 'bayesian', 'optimization', 'algorithm', 'for', 'objective', 'functions', 'that', 'are', 'sums', 'or', 'integrals', 'of', 'expensivetoevaluate', 'functions', 'allowing', 'noisy', 'evaluations', 'these', 'objective', 'functions', 'arise', 'in', 'multitask', 'bayesian', 'optimization', 'for', 'tuning', 'machine', 'learning', 'hyperparameters', 'optimization', 'via', 'simulation', 'and', 'sequential', 'design', 'of', 'experiments', 'with', 'random', 'environmental', 'conditions', 'our', 'method', 'is', 'averagecase', 'optimal', 'by', 'construction', 'when', 'a', 'single', 'evaluation', 'of', 'the', 'integrand', 'remains', 'within', 'our', 'evaluation', 'budget', 'achieving', 'this', 'onestep', 'optimality', 'requires', 'solving', 'a', 'challenging', 'value', 'of', 'information', 'optimization', 'problem', 'for', 'which', 'we', 'provide', 'a', 'novel', 'efficient', 'discretizationfree', 'computational', 'method', 'we', 'also', 'provide', 'consistency', 'proofs', 'for', 'our', 'method', 'in', 'both', 'continuum', 'and', 'discrete', 'finite', 'domains', 'for', 'objective', 'functions', 'that', 'are', 'sums', 'in', 'numerical', 'experiments', 'comparing', 'against', 'previous', 'stateoftheart', 'methods', 'including', 'those', 'that', 'also', 'leverage', 'sum', 'or', 'integral', 'structure', 'our', 'method', 'performs', 'as', 'well', 'or', 'better', 'across', 'a', 'wide', 'range', 'of', 'problems', 'and', 'offers', 'significant', 'improvements', 'when', 'evaluations', 'are', 'noisy', 'or', 'the', 'integrand', 'varies', 'smoothly', 'in', 'the', 'integrated', 'variables']]
|
[-0.07208239929412581, -0.030607219298760736, -0.09731697977610654, 0.07879223675737458, -0.09604099985782898, -0.15250408277215977, 0.08702002218624036, 0.4686964738693449, -0.26548205569626826, -0.3402093798643158, 0.1223572937411166, -0.2268185268997425, -0.19331113389963583, 0.24730617418704975, -0.07703175388667131, 0.14238348429001146, 0.1393968870022124, -0.06373330339030814, -0.12563217841238986, -0.30004087563288667, 0.27397193323420416, 0.017785364804008316, 0.2925968477802892, 0.04042140287497351, 0.11779138721420519, 0.03329099340724849, -0.025894372693953976, 0.015062340265402811, -0.07664927676458085, 0.14708377037783182, 0.323236516550664, 0.20653590839356184, 0.3691109424051378, -0.38218537620756954, -0.2056544810321347, 0.11255918764208835, 0.14467478574463918, 0.05982647094980723, -0.04475039523996172, -0.24682820342000453, 0.05015547452945142, -0.12277691270104579, -0.02021768488470585, -0.1849425456561749, -0.07898747227905739, 0.041413976401541264, -0.3815235102297588, 0.10444708273618392, 0.006614412543844552, 0.04970393394450507, -0.060842229373332474, -0.18780896672077718, 0.08356175645735235, 0.10529809377584307, 0.03143565241217373, 0.04759869951108891, 0.14881556951403319, -0.13155428202852848, -0.1808235546093314, 0.3364213963429774, -0.039926265976992587, -0.27917023503048827, 0.17212124723760833, -0.033810615572597714, -0.1512659434890074, 0.14098077668177506, 0.2037956971014219, 0.18079403601436606, -0.13301418284686553, 0.06759655856895411, -0.04851203277226417, 0.1426009027647876, 0.020653939274169746, 0.01687193779394992, 0.12113115889050306, 0.20506304479354331, 0.11380347181562214, 0.1822235356836069, -0.029581207237506825, -0.1474046441335832, -0.2991303927956089, -0.10388121628371488, -0.17444581254836053, -0.01960429385484707, -0.14355269263079765, -0.19112549773868054, 0.3635129821036131, 0.18218903799330996, 0.1586674824957886, 0.15701197274235798, 0.3676077069774751, 0.11516929102625938, 0.05866873434879967, 0.08356344997582417, 0.16721429479488684, 0.05312948307292836, 0.065211641160591, -0.1817956856106438, 0.08716833760601378, 0.04551419568278136]
|
1,803.08662
|
Muon content of extensive air showers: comparison of the energy spectra
obtained by the Sydney University Giant Air-shower Recorder and by the Pierre
Auger Observatory
|
The Sydney University Giant Air-shower Recorder (SUGAR) measured the energy
spectrum of ultra-high-energy cosmic rays reconstructed from muon-detector
readings, while the Pierre Auger Observatory, looking at the same Southern sky,
uses the calorimetric fluorescence method for the same purpose. Comparison of
their two spectra allows us to reconstruct the empirical dependence of the
number of muons in the shower on the primary energy for energies between
$10^{17}$ and $10^{18.5}$ eV. We compare this dependence with the predictions
of hadronic interaction models \mbox{QGSJET-II-04} and \mbox{EPOS-LHC}. The
empirically determined number of muons with energies above 0.75 GeV exceeds the
simulated one by the factors $\sim$1.67 and $\sim$1.28 for $10^{17}$ eV proton
and iron primaries, respectively. The muon excess grows moderately with the
primary energy, increasing by an additional factor of $\sim 1.2$ for
$10^{18.5}$ eV primaries.
|
astro-ph.HE hep-ph
|
the sydney university giant airshower recorder sugar measured the energy spectrum of ultrahighenergy cosmic rays reconstructed from muondetector readings while the pierre auger observatory looking at the same southern sky uses the calorimetric fluorescence method for the same purpose comparison of their two spectra allows us to reconstruct the empirical dependence of the number of muons in the shower on the primary energy for energies between 1017 and 10185 ev we compare this dependence with the predictions of hadronic interaction models mboxqgsjetii04 and mboxeposlhc the empirically determined number of muons with energies above 075 gev exceeds the simulated one by the factors sim167 and sim128 for 1017 ev proton and iron primaries respectively the muon excess grows moderately with the primary energy increasing by an additional factor of sim 12 for 10185 ev primaries
|
[['the', 'sydney', 'university', 'giant', 'airshower', 'recorder', 'sugar', 'measured', 'the', 'energy', 'spectrum', 'of', 'ultrahighenergy', 'cosmic', 'rays', 'reconstructed', 'from', 'muondetector', 'readings', 'while', 'the', 'pierre', 'auger', 'observatory', 'looking', 'at', 'the', 'same', 'southern', 'sky', 'uses', 'the', 'calorimetric', 'fluorescence', 'method', 'for', 'the', 'same', 'purpose', 'comparison', 'of', 'their', 'two', 'spectra', 'allows', 'us', 'to', 'reconstruct', 'the', 'empirical', 'dependence', 'of', 'the', 'number', 'of', 'muons', 'in', 'the', 'shower', 'on', 'the', 'primary', 'energy', 'for', 'energies', 'between', '1017', 'and', '10185', 'ev', 'we', 'compare', 'this', 'dependence', 'with', 'the', 'predictions', 'of', 'hadronic', 'interaction', 'models', 'mboxqgsjetii04', 'and', 'mboxeposlhc', 'the', 'empirically', 'determined', 'number', 'of', 'muons', 'with', 'energies', 'above', '075', 'gev', 'exceeds', 'the', 'simulated', 'one', 'by', 'the', 'factors', 'sim167', 'and', 'sim128', 'for', '1017', 'ev', 'proton', 'and', 'iron', 'primaries', 'respectively', 'the', 'muon', 'excess', 'grows', 'moderately', 'with', 'the', 'primary', 'energy', 'increasing', 'by', 'an', 'additional', 'factor', 'of', 'sim', '12', 'for', '10185', 'ev', 'primaries']]
|
[-0.023839956561800178, 0.24628165451810208, -0.0005518177893894319, 0.13163878608989096, 0.004629630151112343, -0.033537059193672544, 0.015412230396515313, 0.3622716439759913, -0.1820991988514216, -0.4588161565875279, -0.03329065925608752, -0.4116000639762816, 0.05375913283538841, 0.2017240975450241, 0.06498790523108408, -0.004047092611951227, 0.08839714640523982, 0.00027377367417775946, -0.0621108574799852, -0.15290742130054316, 0.23354169014016635, 0.22312209594155882, 0.2695201222663959, 0.10847388066436725, 0.13430814919211254, 0.009441114635516015, -0.03961612959570102, -0.07998136733836345, -0.13289949584055608, 0.09885455672771364, 0.22139885005859844, 0.09694609652941634, 0.14800780004899922, -0.3628783597760187, -0.1381876346377926, 0.12834602741894263, 0.09688896532099381, -0.02257479924907666, -0.022210411792301096, -0.28537975668281546, 0.10099365381001431, -0.1784807416318937, -0.1649988731351603, 0.07141617836274264, -0.06892098734539201, 0.052302349912880686, -0.21949666565753348, 0.07863259625146592, -0.07225424979763631, 0.08646074953161977, -0.12724742440920936, -0.22483754736364228, -0.023125549721467586, 0.1089671833710816, 0.1204521183692317, 0.0445049449620157, 0.1654741110187735, -0.09292796872047893, -0.0879221627993495, 0.35136049346045684, -0.076073108512894, -0.015560873240927404, 0.1531843919918396, -0.2230833539195387, -0.11920732144223711, 0.23842984456782237, 0.1445347967749561, 0.056648202427087055, -0.18439777041181127, 0.0718175120854338, 0.03496601152809636, 0.20318165859420792, 0.10181451500002436, -0.01062336255696723, 0.21650630590960895, 0.17186355719410368, 0.07894715255140576, 0.03828986584056055, -0.2211333217280597, 0.05099849962408989, -0.258748731051593, -0.10750459725364246, -0.17616382184018956, 0.08700734436270276, -0.09378409861962005, -0.0853468049459785, 0.42431141157414165, 0.11340506266774113, 0.18977694976932674, 0.021657503629458768, 0.3142071897519454, 0.06164020653956264, 0.034538812553225696, 0.07200700327938864, 0.3005502008697914, 0.1418623482676948, 0.13826144721451436, -0.2360656393304439, 0.022017738017616154, 0.015636820737130314]
|
1,803.08663
|
Into the fission valley of magic nucleus Polonium
|
The word "radioactive" was first coined by Marie Curie when she, along with
her husband Pierre Curie, discovered the element Polonium. The nucleus 210Po is
a testing ground for many theoretical and experimental aspects of nuclear
structure as well as nuclear fission dynamics as it is a magic nucleus with
neutron number N=126. At Variable Energy Cyclotron Centre, Kolkata the fission
of Polonium nuclei is being studied in order to understand the survival of
nuclear shell effects that is known to be the key for the stability of super
heavy elements (SHE).
|
nucl-ex
|
the word radioactive was first coined by marie curie when she along with her husband pierre curie discovered the element polonium the nucleus 210po is a testing ground for many theoretical and experimental aspects of nuclear structure as well as nuclear fission dynamics as it is a magic nucleus with neutron number n126 at variable energy cyclotron centre kolkata the fission of polonium nuclei is being studied in order to understand the survival of nuclear shell effects that is known to be the key for the stability of super heavy elements she
|
[['the', 'word', 'radioactive', 'was', 'first', 'coined', 'by', 'marie', 'curie', 'when', 'she', 'along', 'with', 'her', 'husband', 'pierre', 'curie', 'discovered', 'the', 'element', 'polonium', 'the', 'nucleus', '210po', 'is', 'a', 'testing', 'ground', 'for', 'many', 'theoretical', 'and', 'experimental', 'aspects', 'of', 'nuclear', 'structure', 'as', 'well', 'as', 'nuclear', 'fission', 'dynamics', 'as', 'it', 'is', 'a', 'magic', 'nucleus', 'with', 'neutron', 'number', 'n126', 'at', 'variable', 'energy', 'cyclotron', 'centre', 'kolkata', 'the', 'fission', 'of', 'polonium', 'nuclei', 'is', 'being', 'studied', 'in', 'order', 'to', 'understand', 'the', 'survival', 'of', 'nuclear', 'shell', 'effects', 'that', 'is', 'known', 'to', 'be', 'the', 'key', 'for', 'the', 'stability', 'of', 'super', 'heavy', 'elements', 'she']]
|
[0.009779866658272627, 0.19840378105721396, -0.08803633983125506, 0.13155385943473843, -0.03149320762199552, -0.1135960268970255, 0.04938759616798843, 0.3584077257015135, -0.24773354608687045, -0.28589150235411187, 0.06373332053012944, -0.3610139787602036, -0.008144361250426458, 0.16575461172539255, -0.002222413100990588, 0.028093097225317488, 0.0031816172413527966, 0.10247948956574597, -0.03257538612334705, -0.19177312250932396, 0.28502355289200076, 0.17880384890241144, 0.22929758791123395, 0.048386257086309815, 0.06487689375290243, 0.029965384604545998, 0.08482575207460247, -0.04824567644391209, -0.05398809561879518, 0.07357671205966693, 0.2813451176954676, 0.0581732323018672, 0.23309277860781827, -0.37966087993371056, -0.18977492826018968, 0.06741299561310923, 0.09858177138654434, 0.12928024475948643, -0.11712635879445335, -0.2944286205937438, 0.06318339183717794, -0.25213890209915524, -0.19198150720710502, -0.04784437825614789, 0.07009453238899131, 0.06805245393036824, -0.19647711540544507, 0.008953151196929748, 0.0198124030000105, 0.07268713445038251, -0.10101789861674541, -0.2412172769267193, -0.009617070776268678, 0.11549832297232174, 0.11535404079958149, 0.05282466826864275, 0.19268670739889468, -0.07219028251205126, -0.11197181937345506, 0.39803626169653045, 0.024989643218641108, -0.038994906034887485, 0.10018029919339587, -0.21446364025241169, -0.13536679586800543, 0.16410193002103252, 0.08821601714716172, 0.1076525060976248, -0.14497144715547303, 0.059187974709303766, -0.0329656595080767, 0.18228238382827208, 0.051102274178486805, 0.01139008601034141, 0.18725248170591405, 0.24677850657051592, 0.002339217983282414, 0.07074860664990569, -0.16085916904115077, -0.08819119850902454, -0.26739726478294673, -0.1585806071272363, -0.17362075723181275, 0.056160354275641075, 0.018353978916148542, -0.12865348787264616, 0.3511165592986483, -0.003681408808283184, 0.1365780753043035, -0.0934667677173148, 0.2462262995136173, 0.03139322122138844, 0.08183564814617453, 0.044824344818429694, 0.2760225107498548, 0.2091087583988986, 0.07115112576107292, -0.32787817661933927, 0.167592175704751, 0.0686407082729325]
|
1,803.08664
|
Fast, Accurate, and Lightweight Super-Resolution with Cascading Residual
Network
|
In recent years, deep learning methods have been successfully applied to
single-image super-resolution tasks. Despite their great performances, deep
learning methods cannot be easily applied to real-world applications due to the
requirement of heavy computation. In this paper, we address this issue by
proposing an accurate and lightweight deep network for image super-resolution.
In detail, we design an architecture that implements a cascading mechanism upon
a residual network. We also present variant models of the proposed cascading
residual network to further improve efficiency. Our extensive experiments show
that even with much fewer parameters and operations, our models achieve
performance comparable to that of state-of-the-art methods.
|
cs.CV
|
in recent years deep learning methods have been successfully applied to singleimage superresolution tasks despite their great performances deep learning methods cannot be easily applied to realworld applications due to the requirement of heavy computation in this paper we address this issue by proposing an accurate and lightweight deep network for image superresolution in detail we design an architecture that implements a cascading mechanism upon a residual network we also present variant models of the proposed cascading residual network to further improve efficiency our extensive experiments show that even with much fewer parameters and operations our models achieve performance comparable to that of stateoftheart methods
|
[['in', 'recent', 'years', 'deep', 'learning', 'methods', 'have', 'been', 'successfully', 'applied', 'to', 'singleimage', 'superresolution', 'tasks', 'despite', 'their', 'great', 'performances', 'deep', 'learning', 'methods', 'can', 'not', 'be', 'easily', 'applied', 'to', 'realworld', 'applications', 'due', 'to', 'the', 'requirement', 'of', 'heavy', 'computation', 'in', 'this', 'paper', 'we', 'address', 'this', 'issue', 'by', 'proposing', 'an', 'accurate', 'and', 'lightweight', 'deep', 'network', 'for', 'image', 'superresolution', 'in', 'detail', 'we', 'design', 'an', 'architecture', 'that', 'implements', 'a', 'cascading', 'mechanism', 'upon', 'a', 'residual', 'network', 'we', 'also', 'present', 'variant', 'models', 'of', 'the', 'proposed', 'cascading', 'residual', 'network', 'to', 'further', 'improve', 'efficiency', 'our', 'extensive', 'experiments', 'show', 'that', 'even', 'with', 'much', 'fewer', 'parameters', 'and', 'operations', 'our', 'models', 'achieve', 'performance', 'comparable', 'to', 'that', 'of', 'stateoftheart', 'methods']]
|
[-0.020151539705693722, -0.03711583584141786, -0.0685212048570151, 0.03832930557315572, -0.07218221630373935, -0.161672596846057, 0.028132055234822956, 0.5005180676168991, -0.2633229953078729, -0.34309772549653955, 0.08413131166038648, -0.2094508306659266, -0.26453029743685685, 0.224770026984361, -0.18052091261449946, 0.13186738855218655, 0.1686216849561359, -0.02552114000416554, -0.09744669632510643, -0.3493547986200044, 0.25058271183043646, 0.11939797439872735, 0.3906558814704559, 0.07984518847551267, 0.10681160404083301, -0.059778796754918005, 0.006389679034671061, 0.01631432385645139, -0.048961019757319625, 0.19722193642519414, 0.30509758958427446, 0.18470630729527054, 0.3323043472933109, -0.4862757118875688, -0.31021102285232255, 0.1341758119381683, 0.18996991220650808, 0.13334390119526465, -0.06948222431688095, -0.30704533442072923, 0.11663335729566104, -0.21185228306764983, -0.009359420351859814, -0.20079331230130573, -0.04473115394401522, -0.02600326781811298, -0.27568861269523864, -0.005882636103877921, 0.07345991731480749, 0.0282550473337255, 0.014261618972632964, -0.12125903492758297, 0.0915053097030394, 0.12419883465780965, 0.04332774620995207, 0.05209791144566997, 0.11807127012695484, -0.2023169910019035, -0.1787305219573373, 0.32956017648695773, -0.06727097309106644, -0.17891002751289392, 0.2163514398424974, 0.02071942621732201, -0.199957599441679, 0.11479504639282823, 0.25919160000207825, 0.1423188802162361, -0.1527079121332686, 0.014001446623434225, -0.01021477942056251, 0.19320983353580506, 0.0002916598404792823, 0.009865651104845247, 0.15218503175979867, 0.2935797129581981, 0.033805808757502095, 0.13512679212177522, -0.1282073654770359, -0.054044218733906746, -0.14369259032262666, -0.07883989822845971, -0.16321783606621945, -0.03999552052379652, -0.0523779723353416, -0.08269958859660996, 0.4114900079186795, 0.3078963492320464, 0.19539510969178014, 0.07519968987424981, 0.4008327156727044, 0.04976314756325183, 0.16052301623199558, 0.08830634110062471, 0.2572515115915042, 0.03613259706356264, 0.1349255998249886, -0.17950223946838445, 0.05048053900223612, 0.012019372628650294]
|
1,803.08665
|
Topological phase transiton of anisotropic XY model with
Dzyaloshinskii-Moriya interaction
|
Within the real space renormalization group we obtain the phase portrait of
the anisotropic quantum XY model on square lattice in presence of
Dzyaloshinskii-Moriya (DM) interaction. The model is characterized by two
parameters, $\lambda$ corresponding to XY anisotropy, and $D$ corresponding to
the strength of DM interaction. The flow portrait of the model is governed by
two global Ising-Kitaev attractors at $(\lambda=\pm1,D=0)$ and a repeller line,
$\lambda=0$. Renormalization flow of concurrence suggests that the $\lambda=0$
line corresponds to a topological phase transition. The gap starts at zero on
this repeller line corresponding to super-fluid phase of underlying bosons; and
flows towards a finite value at the Ising-Kitaev points. At these two fixed
points the spin fields become purely classical, and hence the resulting Ising
degeneracy can be interpreted as topological degeneracy of dual degrees of
freedom. The state of affairs at the Ising-Kitaev fixed point is consistent
with the picture of a p-wave pairing of strength $\lambda$ of Jordan-Wigner
fermions coupled with Chern-Simons gauge fields.
|
cond-mat.str-el cond-mat.stat-mech
|
within the real space renormalization group we obtain the phase portrait of the anisotropic quantum xy model on square lattice in presence of dzyaloshinskiimoriya dm interaction the model is characterized by two parameters lambda corresponding to xy anisotropy and d corresponding to the strength of dm interaction the flow portrait of the model is governed by two global isingkitaev attractors at lambdapm1d0 and a repeller line lambda0 renormalization flow of concurrence suggests that the lambda0 line corresponds to a topological phase transition the gap starts at zero on this repeller line corresponding to superfluid phase of underlying bosons and flows towards a finite value at the isingkitaev points at these two fixed points the spin fields become purely classical and hence the resulting ising degeneracy can be interpreted as topological degeneracy of dual degrees of freedom the state of affairs at the isingkitaev fixed point is consistent with the picture of a pwave pairing of strength lambda of jordanwigner fermions coupled with chernsimons gauge fields
|
[['within', 'the', 'real', 'space', 'renormalization', 'group', 'we', 'obtain', 'the', 'phase', 'portrait', 'of', 'the', 'anisotropic', 'quantum', 'xy', 'model', 'on', 'square', 'lattice', 'in', 'presence', 'of', 'dzyaloshinskiimoriya', 'dm', 'interaction', 'the', 'model', 'is', 'characterized', 'by', 'two', 'parameters', 'lambda', 'corresponding', 'to', 'xy', 'anisotropy', 'and', 'd', 'corresponding', 'to', 'the', 'strength', 'of', 'dm', 'interaction', 'the', 'flow', 'portrait', 'of', 'the', 'model', 'is', 'governed', 'by', 'two', 'global', 'isingkitaev', 'attractors', 'at', 'lambdapm1d0', 'and', 'a', 'repeller', 'line', 'lambda0', 'renormalization', 'flow', 'of', 'concurrence', 'suggests', 'that', 'the', 'lambda0', 'line', 'corresponds', 'to', 'a', 'topological', 'phase', 'transition', 'the', 'gap', 'starts', 'at', 'zero', 'on', 'this', 'repeller', 'line', 'corresponding', 'to', 'superfluid', 'phase', 'of', 'underlying', 'bosons', 'and', 'flows', 'towards', 'a', 'finite', 'value', 'at', 'the', 'isingkitaev', 'points', 'at', 'these', 'two', 'fixed', 'points', 'the', 'spin', 'fields', 'become', 'purely', 'classical', 'and', 'hence', 'the', 'resulting', 'ising', 'degeneracy', 'can', 'be', 'interpreted', 'as', 'topological', 'degeneracy', 'of', 'dual', 'degrees', 'of', 'freedom', 'the', 'state', 'of', 'affairs', 'at', 'the', 'isingkitaev', 'fixed', 'point', 'is', 'consistent', 'with', 'the', 'picture', 'of', 'a', 'pwave', 'pairing', 'of', 'strength', 'lambda', 'of', 'jordanwigner', 'fermions', 'coupled', 'with', 'chernsimons', 'gauge', 'fields']]
|
[-0.21808593908165833, 0.2268307717749849, -0.08168611693389077, 0.0360149210304726, -0.04084674380833238, -0.1653350762988827, 0.03084941572231445, 0.32210192957143413, -0.2605503568107762, -0.2407572363764502, 0.030494662924533393, -0.30548548652427043, -0.07154012338837563, 0.0976637886317515, 0.06984491979106101, 0.016381716274758575, -0.027921050693271908, 0.07031882898995608, -0.10077866479021884, -0.21001190264005123, 0.36194427214313024, -0.030806421217786876, 0.2656825824822413, 0.03477558854856619, 0.07693284460366136, 0.00831888213174463, 0.06715104186612113, 0.029889373261894656, -0.156786360586477, 0.04570311941731744, 0.19762611570952618, -0.02887484118081175, 0.15884432455002354, -0.35307752216666394, -0.21132378823055728, 0.1154459850939286, 0.16319586284935655, 0.1285335858829501, 0.018091971439411637, -0.343520049976821, 0.039165815853754414, -0.1461762491167841, -0.190329287800989, -0.04456893735417596, 0.014187345156309808, -0.04520527181703961, -0.2524375023984736, 0.09811812262732263, 0.044584790182231764, 0.10606677189083179, -0.04171956388603487, -0.07892116252900805, -0.1233058821568947, 0.08107377003832925, 0.06824353891183486, 0.09586125774104602, 0.11052985966671258, -0.17682462829738718, -0.10315965198366563, 0.3864372472290131, -0.08709093903918273, -0.17409146702763192, 0.1731107334759677, -0.128709441952396, -0.08548762169723376, 0.16345727429498078, 0.11725674867459641, 0.04702752766131264, -0.06871907959873902, 0.1468122423194894, -0.022927313777561322, 0.15620719571118727, -0.0011129074931576302, 0.01386992570875985, 0.2842092521306945, 0.11560473981364516, 0.09526068544038004, 0.15168864410810695, -0.06545267439491353, -0.17853895706556192, -0.33727262508146827, -0.1296139263105011, -0.22738506697493083, 0.06395456671896504, -0.13634778410387963, -0.162824172804859, 0.413310823709386, 0.126902423147751, 0.23775064247296895, -0.003594834550579147, 0.2060651857570586, 0.12147025537049602, 0.018448663580163224, 0.04338656700813927, 0.2424849670535811, 0.17408768966987093, 0.06698699533746283, -0.2858131813742902, -0.021537109766518923, 0.13399892203259942]
|
1,803.08666
|
APR: Architectural Pattern Recommender
|
This paper proposes Architectural Pattern Recommender (APR) system which
helps in such architecture selection process. Main contribution of this work is
in replacing the manual effort required to identify and analyse relevant
architectural patterns in context of a particular set of software requirements.
Key input to APR is a set of architecturally significant use cases concerning
the application being developed. Central idea of APR's design is two folds: a)
transform the unstructured information about software architecture design into
a structured form which is suitable for recognizing textual entailment between
a requirement scenario and a potential architectural pattern. b) leverage the
rich experiential knowledge embedded in discussions on professional developer
support forums such as Stackoverflow to check the sentiment about a design
decision. APR makes use of both the above elements to identify a suitable
architectural pattern and assess its suitability for a given set of
requirements. Efficacy of APR has been evaluated by comparing its
recommendations for "ground truth" scenarios (comprising of applications whose
architecture is well known).
|
cs.SE cs.AI
|
this paper proposes architectural pattern recommender apr system which helps in such architecture selection process main contribution of this work is in replacing the manual effort required to identify and analyse relevant architectural patterns in context of a particular set of software requirements key input to apr is a set of architecturally significant use cases concerning the application being developed central idea of aprs design is two folds a transform the unstructured information about software architecture design into a structured form which is suitable for recognizing textual entailment between a requirement scenario and a potential architectural pattern b leverage the rich experiential knowledge embedded in discussions on professional developer support forums such as stackoverflow to check the sentiment about a design decision apr makes use of both the above elements to identify a suitable architectural pattern and assess its suitability for a given set of requirements efficacy of apr has been evaluated by comparing its recommendations for ground truth scenarios comprising of applications whose architecture is well known
|
[['this', 'paper', 'proposes', 'architectural', 'pattern', 'recommender', 'apr', 'system', 'which', 'helps', 'in', 'such', 'architecture', 'selection', 'process', 'main', 'contribution', 'of', 'this', 'work', 'is', 'in', 'replacing', 'the', 'manual', 'effort', 'required', 'to', 'identify', 'and', 'analyse', 'relevant', 'architectural', 'patterns', 'in', 'context', 'of', 'a', 'particular', 'set', 'of', 'software', 'requirements', 'key', 'input', 'to', 'apr', 'is', 'a', 'set', 'of', 'architecturally', 'significant', 'use', 'cases', 'concerning', 'the', 'application', 'being', 'developed', 'central', 'idea', 'of', 'aprs', 'design', 'is', 'two', 'folds', 'a', 'transform', 'the', 'unstructured', 'information', 'about', 'software', 'architecture', 'design', 'into', 'a', 'structured', 'form', 'which', 'is', 'suitable', 'for', 'recognizing', 'textual', 'entailment', 'between', 'a', 'requirement', 'scenario', 'and', 'a', 'potential', 'architectural', 'pattern', 'b', 'leverage', 'the', 'rich', 'experiential', 'knowledge', 'embedded', 'in', 'discussions', 'on', 'professional', 'developer', 'support', 'forums', 'such', 'as', 'stackoverflow', 'to', 'check', 'the', 'sentiment', 'about', 'a', 'design', 'decision', 'apr', 'makes', 'use', 'of', 'both', 'the', 'above', 'elements', 'to', 'identify', 'a', 'suitable', 'architectural', 'pattern', 'and', 'assess', 'its', 'suitability', 'for', 'a', 'given', 'set', 'of', 'requirements', 'efficacy', 'of', 'apr', 'has', 'been', 'evaluated', 'by', 'comparing', 'its', 'recommendations', 'for', 'ground', 'truth', 'scenarios', 'comprising', 'of', 'applications', 'whose', 'architecture', 'is', 'well', 'known']]
|
[-0.10674819784842493, -0.019743543245740944, -0.03506516594955299, 0.0584235933652811, -0.15256627745527243, -0.14500241349950166, 0.06962104706880859, 0.4001471331076963, -0.23704612975762712, -0.3541031912179841, 0.12083057294408459, -0.2367979433093708, -0.18702295538969338, 0.1725284049974843, -0.11267650259625432, 0.07797819149744187, 0.08522009458448294, 0.055666810440708925, -0.037099705722149726, -0.24363320318627216, 0.32921332416922916, 0.05473399094660722, 0.3251681777432428, 0.04167555258165868, 0.08360575193711113, -0.02076897805783942, -0.06063234211753644, -0.05315453795101564, -0.05474076509043308, 0.1772365308217039, 0.33107931448501493, 0.2697293837568612, 0.3390825183582603, -0.3909025657433501, -0.17439980468424482, 0.035942658322580555, 0.12531065825169208, 0.053688976051229735, -0.040733363701812256, -0.29236157708579585, 0.10718484682590879, -0.20898309695673692, -0.08131747409546126, -0.09829030083935886, 0.026901295461270604, -0.011403047185879023, -0.2769083471392237, -0.05693782782847328, 0.08566826590201042, 0.0873100676385331, -0.04344389933283396, -0.1202797544101486, 0.018709977264128003, 0.1784431379637681, 0.01807516322514857, 0.04951357367168557, 0.13823307051400965, -0.15817770589741745, -0.14120605254651136, 0.41140536114662174, 0.03254909230495936, -0.17895301035224248, 0.19256023742768558, -0.007758955169785102, -0.16205999132667093, 0.07231493252662144, 0.2148279030474701, 0.05309664895520698, -0.20020286117159275, 0.05061686488798365, -0.0031291890800708815, 0.22607189181629414, 0.07296298388904515, 0.0039871047653529485, 0.21654096725978889, 0.28546401299951996, 0.014707761397446683, 0.16288496885404347, -0.044018449543121584, -0.07591498296131335, -0.26990776278156164, -0.16473523556210456, -0.12973097525259836, -0.0051784267956723595, -0.06706976038557991, -0.1653383964051803, 0.40905262399437126, 0.20973087606086796, 0.15281927728626346, 0.011852636424702637, 0.3285859680313262, 0.001401066231188625, 0.09129076353946446, 0.05678434306762591, 0.1314476328386393, 0.03698670455404291, 0.14242995737419864, -0.15473363670337545, 0.12416555856110617, 0.022918599352817096]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.