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.06567
|
A Dual Approach to Scalable Verification of Deep Networks
|
This paper addresses the problem of formally verifying desirable properties
of neural networks, i.e., obtaining provable guarantees that neural networks
satisfy specifications relating their inputs and outputs (robustness to bounded
norm adversarial perturbations, for example). Most previous work on this topic
was limited in its applicability by the size of the network, network
architecture and the complexity of properties to be verified. In contrast, our
framework applies to a general class of activation functions and specifications
on neural network inputs and outputs. We formulate verification as an
optimization problem (seeking to find the largest violation of the
specification) and solve a Lagrangian relaxation of the optimization problem to
obtain an upper bound on the worst case violation of the specification being
verified. Our approach is anytime i.e. it can be stopped at any time and a
valid bound on the maximum violation can be obtained. We develop specialized
verification algorithms with provable tightness guarantees under special
assumptions and demonstrate the practical significance of our general
verification approach on a variety of verification tasks.
|
cs.LG stat.ML
|
this paper addresses the problem of formally verifying desirable properties of neural networks ie obtaining provable guarantees that neural networks satisfy specifications relating their inputs and outputs robustness to bounded norm adversarial perturbations for example most previous work on this topic was limited in its applicability by the size of the network network architecture and the complexity of properties to be verified in contrast our framework applies to a general class of activation functions and specifications on neural network inputs and outputs we formulate verification as an optimization problem seeking to find the largest violation of the specification and solve a lagrangian relaxation of the optimization problem to obtain an upper bound on the worst case violation of the specification being verified our approach is anytime ie it can be stopped at any time and a valid bound on the maximum violation can be obtained we develop specialized verification algorithms with provable tightness guarantees under special assumptions and demonstrate the practical significance of our general verification approach on a variety of verification tasks
|
[['this', 'paper', 'addresses', 'the', 'problem', 'of', 'formally', 'verifying', 'desirable', 'properties', 'of', 'neural', 'networks', 'ie', 'obtaining', 'provable', 'guarantees', 'that', 'neural', 'networks', 'satisfy', 'specifications', 'relating', 'their', 'inputs', 'and', 'outputs', 'robustness', 'to', 'bounded', 'norm', 'adversarial', 'perturbations', 'for', 'example', 'most', 'previous', 'work', 'on', 'this', 'topic', 'was', 'limited', 'in', 'its', 'applicability', 'by', 'the', 'size', 'of', 'the', 'network', 'network', 'architecture', 'and', 'the', 'complexity', 'of', 'properties', 'to', 'be', 'verified', 'in', 'contrast', 'our', 'framework', 'applies', 'to', 'a', 'general', 'class', 'of', 'activation', 'functions', 'and', 'specifications', 'on', 'neural', 'network', 'inputs', 'and', 'outputs', 'we', 'formulate', 'verification', 'as', 'an', 'optimization', 'problem', 'seeking', 'to', 'find', 'the', 'largest', 'violation', 'of', 'the', 'specification', 'and', 'solve', 'a', 'lagrangian', 'relaxation', 'of', 'the', 'optimization', 'problem', 'to', 'obtain', 'an', 'upper', 'bound', 'on', 'the', 'worst', 'case', 'violation', 'of', 'the', 'specification', 'being', 'verified', 'our', 'approach', 'is', 'anytime', 'ie', 'it', 'can', 'be', 'stopped', 'at', 'any', 'time', 'and', 'a', 'valid', 'bound', 'on', 'the', 'maximum', 'violation', 'can', 'be', 'obtained', 'we', 'develop', 'specialized', 'verification', 'algorithms', 'with', 'provable', 'tightness', 'guarantees', 'under', 'special', 'assumptions', 'and', 'demonstrate', 'the', 'practical', 'significance', 'of', 'our', 'general', 'verification', 'approach', 'on', 'a', 'variety', 'of', 'verification', 'tasks']]
|
[-0.1088728368002383, -0.03493209257355159, -0.05213235170231201, 0.07864915428755838, -0.08669804253028651, -0.1698381755678683, 0.06691570294451647, 0.35360257887965163, -0.2650520514778933, -0.32906968934687575, 0.1285880093914968, -0.20406359942990618, -0.1684149471313472, 0.20902594509251912, -0.12391054472950626, 0.15586045260059667, 0.08774727083893352, 0.030902203233681102, -0.06786281823024498, -0.28548583915360226, 0.2853965793892397, 0.04301254212791692, 0.3122368364825689, 0.07127724136084566, 0.09956924008162465, -0.007892701486825426, 0.038673262765585324, 0.035327736251298446, -0.09135744934168953, 0.14231126780845116, 0.267460126933057, 0.24053087301089326, 0.3118848949859209, -0.42563758196169243, -0.19238827653724505, 0.12727515570108774, 0.10021097953983103, 0.10652399657972458, -0.007003755050958968, -0.31831792979420437, 0.12147854428706055, -0.1373280342668295, -0.06988567787066446, -0.11719135976950988, -0.02767422405001573, -0.002408766462279193, -0.3178792151735525, 0.004986654064009731, 0.10875186036378576, 0.04209783766805625, -0.03877199325519425, -0.09557930050778467, 0.04447933425184748, 0.1188140416038734, 0.040615614223686945, 0.01649543856717431, 0.12798080257425418, -0.12627108784586277, -0.15359356434682028, 0.3655156047659458, -0.018689907434520262, -0.22766542916503774, 0.17375233676822888, -0.03327500461089301, -0.19772356339815111, 0.0758170837683151, 0.23062390392354146, 0.14039315733348015, -0.15694775586110685, 0.09492407203147274, -0.06956777789743046, 0.1954527779279083, 0.05397049629404021, 0.04699664821947865, 0.13460341101980666, 0.2229706531907351, 0.10878443221610061, 0.18068430626379983, -0.0075852032993096495, -0.07777848770045218, -0.3020043930447946, -0.12654452231736865, -0.20930622044999175, 0.0015768897894640707, -0.09121312188313307, -0.13337974669950114, 0.39691390064302723, 0.18461847454282546, 0.1642353692673405, 0.20611200663611035, 0.327185843683607, 0.12512033811576578, 0.03347915456299885, 0.12856323901036312, 0.22915875843478464, 0.12088179802710482, 0.08508585744155193, -0.1953876075130279, 0.1672533053980139, 0.05374564895043998]
|
1,803.06568
|
Splittable and unsplittable graphs and configurations
|
We prove that there exist infinitely many splittable and also infinitely many
unsplittable cyclic $(n_3)$ configurations. We also present a complete study of
trivalent cyclic Haar graphs on at most 60 vertices with respect to
splittability. Finally, we show that all cyclic flag-transitive configurations
with the exception of the Fano plane and the M\"obius-Kantor configuration are
splittable.
|
math.CO
|
we prove that there exist infinitely many splittable and also infinitely many unsplittable cyclic n_3 configurations we also present a complete study of trivalent cyclic haar graphs on at most 60 vertices with respect to splittability finally we show that all cyclic flagtransitive configurations with the exception of the fano plane and the mobiuskantor configuration are splittable
|
[['we', 'prove', 'that', 'there', 'exist', 'infinitely', 'many', 'splittable', 'and', 'also', 'infinitely', 'many', 'unsplittable', 'cyclic', 'n_3', 'configurations', 'we', 'also', 'present', 'a', 'complete', 'study', 'of', 'trivalent', 'cyclic', 'haar', 'graphs', 'on', 'at', 'most', '60', 'vertices', 'with', 'respect', 'to', 'splittability', 'finally', 'we', 'show', 'that', 'all', 'cyclic', 'flagtransitive', 'configurations', 'with', 'the', 'exception', 'of', 'the', 'fano', 'plane', 'and', 'the', 'mobiuskantor', 'configuration', 'are', 'splittable']]
|
[-0.23074120936686532, 0.15813010859123447, 0.00626983892237931, 0.04316134869300744, -0.01395863006218222, -0.16968599787766211, -0.009678345271631292, 0.4617518233625512, -0.2512908842957889, -0.23155604979011082, 0.08840002836822941, -0.33354833258087174, -0.19641116318668714, 0.16815371522189757, -0.07714202717812568, -0.024644463280166843, 0.1073024656231466, 0.1027991248686847, -0.026694878380288157, -0.2913292825585558, 0.3421132476314118, -0.08541799718187305, 0.20141938642451637, 0.05849025019428186, 0.08855714894863859, 0.0205908503563127, 0.037949630968158315, 0.07835083912339127, -0.19108976189403493, 0.045443581931881215, 0.2832595392277366, 0.10251590913864211, 0.14999279425593845, -0.3783405054883476, -0.11664352374837587, 0.24939375387079882, 0.10905855102464557, 0.09230553546691672, -0.06585966184400349, -0.15616394902922606, 0.17299527702689693, -0.164366673057278, -0.15441019671331896, -0.08312271760874673, 0.06809430824298608, 0.06948336017350748, -0.2142496428926263, -0.07558691228858375, 0.13254466613860832, 0.09993389312570032, -0.008420402476188252, -0.14382044717326367, -0.07215125734607379, 0.07379858535632752, -0.006578769567504264, -0.005506659347335236, 0.02250250868536042, -0.04341709674254321, -0.1866531528434471, 0.3682272920483037, -0.02809568082509366, -0.18286022735890328, 0.19411475789782248, -0.1375167117445942, -0.24862329589137644, 0.14707970276082816, 0.07390115856960938, 0.17848346218989605, -0.05275896309237731, 0.11330228886085056, -0.16518920555449368, 0.1254106745483321, 0.18847377535380555, 0.045364300099511944, 0.12029507171297282, 0.03656511891045069, 0.1754737776242556, 0.16201731072444664, 0.01447495423142978, -0.09428532104612443, -0.30121949337945697, -0.11374438297526356, -0.08186390796235125, 0.08795848144054935, -0.1216161566895735, -0.22294135648234373, 0.3897751790242629, 0.09052018921724275, 0.18685888583780053, 0.06337494452957783, 0.1931288555395185, -0.034787690838831556, 0.030218669719863357, 0.18002960873408275, 0.11381201343324951, 0.12415776277581851, -0.06879022233024762, -0.16542593522810198, -0.004341773025021611, 0.05861851014196873]
|
1,803.06569
|
On-Demand Generation of Neutral and Negatively-Charged Silicon-Vacancy
Centers in Diamond
|
Point defects in wide-bandgap semiconductors are emerging as versatile
resources for nanoscale sensing and quantum information science but our
understanding of the photo-ionization dynamics is presently incomplete. Here we
use two-color confocal microscopy to investigate the dynamics of charge in Type
1b diamond hosting nitrogen-vacancy (NV) and silicon-vacancy (SiV) centers. By
examining the non-local fluorescence patterns emerging from local laser
excitation, we show that in the simultaneous presence of photo-generated
electrons and holes, SiV (NV) centers selectively transform into the negative
(neutral) charge state. Unlike NVs, 532 nm illumination ionizes SiV- via a
single photon process thus hinting at a comparatively shallower ground state.
In particular, slower ionization rates at longer wavelengths suggest the latter
lies approximately ~1.9 eV below the conduction band minimum. Building on the
above observations we demonstrate on-demand SiV and NV charge initialization
over large areas via green laser illumination of variable intensity.
|
cond-mat.mes-hall
|
point defects in widebandgap semiconductors are emerging as versatile resources for nanoscale sensing and quantum information science but our understanding of the photoionization dynamics is presently incomplete here we use twocolor confocal microscopy to investigate the dynamics of charge in type 1b diamond hosting nitrogenvacancy nv and siliconvacancy siv centers by examining the nonlocal fluorescence patterns emerging from local laser excitation we show that in the simultaneous presence of photogenerated electrons and holes siv nv centers selectively transform into the negative neutral charge state unlike nvs 532 nm illumination ionizes siv via a single photon process thus hinting at a comparatively shallower ground state in particular slower ionization rates at longer wavelengths suggest the latter lies approximately 19 ev below the conduction band minimum building on the above observations we demonstrate ondemand siv and nv charge initialization over large areas via green laser illumination of variable intensity
|
[['point', 'defects', 'in', 'widebandgap', 'semiconductors', 'are', 'emerging', 'as', 'versatile', 'resources', 'for', 'nanoscale', 'sensing', 'and', 'quantum', 'information', 'science', 'but', 'our', 'understanding', 'of', 'the', 'photoionization', 'dynamics', 'is', 'presently', 'incomplete', 'here', 'we', 'use', 'twocolor', 'confocal', 'microscopy', 'to', 'investigate', 'the', 'dynamics', 'of', 'charge', 'in', 'type', '1b', 'diamond', 'hosting', 'nitrogenvacancy', 'nv', 'and', 'siliconvacancy', 'siv', 'centers', 'by', 'examining', 'the', 'nonlocal', 'fluorescence', 'patterns', 'emerging', 'from', 'local', 'laser', 'excitation', 'we', 'show', 'that', 'in', 'the', 'simultaneous', 'presence', 'of', 'photogenerated', 'electrons', 'and', 'holes', 'siv', 'nv', 'centers', 'selectively', 'transform', 'into', 'the', 'negative', 'neutral', 'charge', 'state', 'unlike', 'nvs', '532', 'nm', 'illumination', 'ionizes', 'siv', 'via', 'a', 'single', 'photon', 'process', 'thus', 'hinting', 'at', 'a', 'comparatively', 'shallower', 'ground', 'state', 'in', 'particular', 'slower', 'ionization', 'rates', 'at', 'longer', 'wavelengths', 'suggest', 'the', 'latter', 'lies', 'approximately', '19', 'ev', 'below', 'the', 'conduction', 'band', 'minimum', 'building', 'on', 'the', 'above', 'observations', 'we', 'demonstrate', 'ondemand', 'siv', 'and', 'nv', 'charge', 'initialization', 'over', 'large', 'areas', 'via', 'green', 'laser', 'illumination', 'of', 'variable', 'intensity']]
|
[-0.029759316030829562, 0.18642545823121862, 0.030479665332454806, 0.023861283421234586, 0.07232767467222297, -0.19504440512166035, 0.09488013636148186, 0.5275126285391676, -0.2289639680525985, -0.2974175237892132, 0.01896892576700165, -0.3464813468135184, -0.03514271404366104, 0.16555294466401344, -0.016570936422795057, -0.013010382503397814, 0.016662529031397637, -0.0917867251963285, 0.008685864063081186, -0.11921109220877822, 0.23754859435353048, 0.05624167361418672, 0.3813545003400317, 0.0926181679182895, 0.07900267894550854, 0.06778993654590683, 0.06143530142385842, -0.06693443581842039, -0.0885280520370809, 0.13098354351098593, 0.27751816026739723, 0.00838390697541387, 0.2525711592609937, -0.4534298551861247, -0.2384731069739376, 0.06504133204359532, 0.1804443504978098, 0.20440460805825533, -0.15394564933970342, -0.29035608473370095, 0.01703147055877398, -0.06537247895655939, -0.13597690085025163, -0.010286326969967407, -0.0069328711627900195, 0.016640712174453905, -0.21509939987903587, 0.08388675521539689, -0.012475081830527824, 0.05989884095425641, -0.10136686785377841, -0.06422675083562428, -0.0897182618175969, 0.02842902717636708, -0.07643189040336562, 0.038807235407123504, 0.33905080173380014, -0.14376715408023574, -0.16419383596160075, 0.32552645003207686, -0.062331515590844, -0.0025307918458442095, 0.16354423039117638, -0.2171045126881273, -0.0770226519936569, 0.18554303127651414, 0.0912637603469193, 0.1870011402560132, -0.14547220828030638, 0.0320849675339881, 0.012721527467614837, 0.22109971601982462, 0.12664209055353184, 0.1789440310046989, 0.2827627293949275, 0.15804230271629532, 0.09588966589598429, 0.1367560216878243, -0.18370605022393066, -0.06543227932479258, -0.18477806721047377, -0.1463785403531653, -0.1995726891343488, 0.1325459527738747, -0.08397146474948584, -0.1175099032393302, 0.3782609913903637, 0.1330031869318463, 0.14852915728008564, -0.09021465849688873, 0.29116262180773167, 0.06830491638761393, 0.09070943798996559, 0.028938059589736873, 0.24239255956589517, 0.165059916108853, 0.11391652798276952, -0.3052079430131913, -0.01151894538926252, -0.022266254038074796]
|
1,803.0657
|
Local Quantum Criticality of a One-Dimensional Kondo Insulator Model
|
The continuous quantum phase transition and the nature of quantum critical
point (QCP) in a modified Kondo lattice model with Ising anisotropic exchange
interactions is studied within the density-matrix renormalization group
algorithm. We investigate the effect of quantum fluctuations on critical Kondo
destruction QCP, by probing static and dynamic properties of the magnetic order
and the Kondo effect. In particular, we identify that local Kondo physics
itself becomes critical at the magnetic phase transition point, providing
unbiased evidences for local quantum criticality between two insulators without
resorting to the change of Fermi surface.
|
cond-mat.str-el
|
the continuous quantum phase transition and the nature of quantum critical point qcp in a modified kondo lattice model with ising anisotropic exchange interactions is studied within the densitymatrix renormalization group algorithm we investigate the effect of quantum fluctuations on critical kondo destruction qcp by probing static and dynamic properties of the magnetic order and the kondo effect in particular we identify that local kondo physics itself becomes critical at the magnetic phase transition point providing unbiased evidences for local quantum criticality between two insulators without resorting to the change of fermi surface
|
[['the', 'continuous', 'quantum', 'phase', 'transition', 'and', 'the', 'nature', 'of', 'quantum', 'critical', 'point', 'qcp', 'in', 'a', 'modified', 'kondo', 'lattice', 'model', 'with', 'ising', 'anisotropic', 'exchange', 'interactions', 'is', 'studied', 'within', 'the', 'densitymatrix', 'renormalization', 'group', 'algorithm', 'we', 'investigate', 'the', 'effect', 'of', 'quantum', 'fluctuations', 'on', 'critical', 'kondo', 'destruction', 'qcp', 'by', 'probing', 'static', 'and', 'dynamic', 'properties', 'of', 'the', 'magnetic', 'order', 'and', 'the', 'kondo', 'effect', 'in', 'particular', 'we', 'identify', 'that', 'local', 'kondo', 'physics', 'itself', 'becomes', 'critical', 'at', 'the', 'magnetic', 'phase', 'transition', 'point', 'providing', 'unbiased', 'evidences', 'for', 'local', 'quantum', 'criticality', 'between', 'two', 'insulators', 'without', 'resorting', 'to', 'the', 'change', 'of', 'fermi', 'surface']]
|
[-0.2088081435630879, 0.23852431930361256, -0.09850463322526525, 0.09056882749146392, -0.03151453114415129, -0.1901817938753514, 0.12129090335820952, 0.3101190006240241, -0.2724889320451566, -0.26597056425707316, 0.014716470536465446, -0.3176402804611992, -0.15699921359598476, 0.12379047128131553, 0.09532613997968535, 0.04637851367794698, -0.10372737069584188, 0.00021838120395137418, -0.1586534932633782, -0.2116750328556224, 0.34655087311021104, 0.03385114074955063, 0.31418138207687485, 0.12183175042962595, 0.011575220513247674, 0.04410144897998981, 0.12948711352142436, 0.04632548871199771, -0.16646983890372682, -0.011110275463070921, 0.22319677949292205, -0.11485236925723892, 0.22290085882324942, -0.40731598727244844, -0.23435904917817924, 0.06360614706852263, 0.11314889936963277, 0.17282373611865345, -0.08541898946252761, -0.3486204404904637, 0.029611771756042075, -0.1382220303439485, -0.12078692336937272, -0.11753840085058924, -0.052293040659478915, -0.08056321979490338, -0.23504769384500482, 0.14857829855855115, 0.04366030595615827, 0.16240579077112738, -0.04159915681567884, -0.027983309796220192, -0.006787754690414796, 0.11998427695825055, 0.0005887549831181444, 0.061971448657293156, 0.1954480659777439, -0.16522092924964044, -0.1609030206116938, 0.39732199851223216, -0.03010584610659549, -0.06981977638638308, 0.18706821083461725, -0.19725979535630153, -0.10329459730776087, 0.12195068342681294, 0.10542020186661713, 0.030028395334719328, -0.11388560217274453, 0.14051445999986403, 0.04512264014732453, 0.13419907870865178, -0.0764760140264507, 0.07446610658699947, 0.28692632294710607, 0.16392995066369973, 0.0843233236722568, 0.1700626653268613, -0.12052607881180662, -0.21562026204260928, -0.25788784189329994, -0.13610211219037732, -0.26247664677199495, 0.0819235394698798, -0.12304833255753908, -0.22139218975339206, 0.40702067677091847, 0.23275899951426332, 0.17220688129584955, -0.09304738758252032, 0.2124441523325219, 0.124929187969575, 0.013289706115560827, 0.07659787585538241, 0.23123120550586973, 0.14716050295429606, 0.07938483997838952, -0.35608705760590653, 0.054790224769823655, 0.12953548551967708]
|
1,803.06571
|
Orthogonal Representations for Output System Pairs
|
A new class of canonical forms is given proposed in which $(A, C)$ is in
Hessenberg observer or Schur form and output normal: $\bf{I} - A^*A =C^*C$.
Here, $C$ is the $d \times n$ measurement matrix and $A$ is the advance matrix.
The $(C, A)$ stack is expressed as the product of $n$ orthogonal matrices, each
of which depends on $d$ parameters. State updates require only ${\cal O}(nd)$
operations and derivatives of the system with respect to the parameters are
fast and convenient to compute. Restrictions are given such that these models
are generically identifiable. Since the observability Grammian is the identity
matrix, system identification is better conditioned than other classes of
models with fast updates.
|
stat.ME cs.SY eess.SY math.ST stat.TH
|
a new class of canonical forms is given proposed in which a c is in hessenberg observer or schur form and output normal bfi aa cc here c is the d times n measurement matrix and a is the advance matrix the c a stack is expressed as the product of n orthogonal matrices each of which depends on d parameters state updates require only cal ond operations and derivatives of the system with respect to the parameters are fast and convenient to compute restrictions are given such that these models are generically identifiable since the observability grammian is the identity matrix system identification is better conditioned than other classes of models with fast updates
|
[['a', 'new', 'class', 'of', 'canonical', 'forms', 'is', 'given', 'proposed', 'in', 'which', 'a', 'c', 'is', 'in', 'hessenberg', 'observer', 'or', 'schur', 'form', 'and', 'output', 'normal', 'bfi', 'aa', 'cc', 'here', 'c', 'is', 'the', 'd', 'times', 'n', 'measurement', 'matrix', 'and', 'a', 'is', 'the', 'advance', 'matrix', 'the', 'c', 'a', 'stack', 'is', 'expressed', 'as', 'the', 'product', 'of', 'n', 'orthogonal', 'matrices', 'each', 'of', 'which', 'depends', 'on', 'd', 'parameters', 'state', 'updates', 'require', 'only', 'cal', 'ond', 'operations', 'and', 'derivatives', 'of', 'the', 'system', 'with', 'respect', 'to', 'the', 'parameters', 'are', 'fast', 'and', 'convenient', 'to', 'compute', 'restrictions', 'are', 'given', 'such', 'that', 'these', 'models', 'are', 'generically', 'identifiable', 'since', 'the', 'observability', 'grammian', 'is', 'the', 'identity', 'matrix', 'system', 'identification', 'is', 'better', 'conditioned', 'than', 'other', 'classes', 'of', 'models', 'with', 'fast', 'updates']]
|
[-0.15509300021373706, 0.11454828285976597, -0.02057949858515159, 0.00423869208291011, -0.07780700439344282, -0.20880413913046536, 0.006873091075407422, 0.36746109153913414, -0.2739808812899434, -0.25564071172089115, 0.14581773887671853, -0.26495706903059846, -0.12095271227273928, 0.16048802610122315, -0.04087404713399061, 0.045232077291154346, 0.07921470485668143, 0.11125907333891677, -0.15245853849362745, -0.24166745702817063, 0.3018962681617426, 0.02150092872325331, 0.220602333655014, -0.038025249927507145, 0.09497167174906834, -0.008754359258581763, -0.03096667327715651, -0.0196432458722721, -0.04387578792780202, 0.11029350688559529, 0.21937469176260968, 0.20274772182937065, 0.20100516118109227, -0.3756974239874145, -0.11762594681881045, 0.14166256684162046, 0.12273632355601244, 0.05767298394854626, 0.0522772392247925, -0.23674084545801516, 0.09147381682098216, -0.15458667164911394, -0.09716213285396605, -0.05838226578198373, 0.09507179693116442, 0.04081659099471796, -0.35542405042797326, 0.027647874164192572, 0.044631633464166, 0.01959840916502087, 0.006699292203816383, -0.1543048238604451, -0.029520805143629727, 0.08775475797972278, -0.007167547323700526, 0.053094442696917966, 0.1417744916871332, -0.09031299508946097, -0.06618253523888795, 0.37624468935410615, -0.053700939341797496, -0.24990625203303668, 0.170973622450686, -0.12056087227335767, -0.12234086705695675, 0.11576150158096267, 0.13375961255806032, 0.1480698822228157, -0.10595964554535306, 0.1361710515014989, -0.06902179128044973, 0.17413038835030697, 0.034153057464762875, 0.04644753073301652, 0.12521007573636977, 0.1160022186965722, 0.06947033808607123, 0.08579177964205409, -0.01216547944274245, -0.05389029835856965, -0.32543848505162676, -0.19877347691875438, -0.18121172607592914, 0.06026752699247521, -0.11410633517459602, -0.18356430585617606, 0.39470224198075415, 0.08201123752185832, 0.2410664219804027, 0.05494389830197653, 0.2581506997265893, 0.14315129520077988, 0.07506823215694369, 0.10321173788574727, 0.15151050068114114, 0.15222012731044188, 0.03164354959178878, -0.17595477228093406, 0.1453734373147397, 0.10192932980337545]
|
1,803.06572
|
Non-hyperbolic ergodic measures and horseshoes in partially hyperbolic
homoclinic classes
|
We study a rich family of robustly non-hyperbolic transitive diffeomorphisms
and we show that each ergodic measure is approached by hyperbolic sets in
weak$*$-topology and in entropy. For hyperbolic ergodic measures, it is a
classical result of A. Katok. The novelty here is to deal with non-hyperbolic
ergodic measures.
|
math.DS
|
we study a rich family of robustly nonhyperbolic transitive diffeomorphisms and we show that each ergodic measure is approached by hyperbolic sets in weaktopology and in entropy for hyperbolic ergodic measures it is a classical result of a katok the novelty here is to deal with nonhyperbolic ergodic measures
|
[['we', 'study', 'a', 'rich', 'family', 'of', 'robustly', 'nonhyperbolic', 'transitive', 'diffeomorphisms', 'and', 'we', 'show', 'that', 'each', 'ergodic', 'measure', 'is', 'approached', 'by', 'hyperbolic', 'sets', 'in', 'weaktopology', 'and', 'in', 'entropy', 'for', 'hyperbolic', 'ergodic', 'measures', 'it', 'is', 'a', 'classical', 'result', 'of', 'a', 'katok', 'the', 'novelty', 'here', 'is', 'to', 'deal', 'with', 'nonhyperbolic', 'ergodic', 'measures']]
|
[-0.1789518685213157, 0.14991855096756196, -0.11446528158587765, 0.15307114634197205, -0.012050212379925105, -0.17075345092167965, 0.0605779550589469, 0.3387015617775674, -0.29004951976999943, -0.1049850531093472, 0.11956589401709106, -0.3808521604811659, -0.20135089181059476, 0.22924303592239714, -0.24400342117082707, 0.08867727999328351, 0.048381501894292175, 0.09152437615379387, -0.0738062595007751, -0.18070874608368898, 0.39226345261748957, -0.07892997964874518, 0.22421152398408373, 0.08650623728540174, 0.17466060247044174, -0.06974690516089678, -0.038997522431748866, 0.10319557189181143, -0.1934007389373823, 0.08437124850247435, 0.2834421761942153, 0.13014243707554984, 0.24889497990168782, -0.2032156488192933, -0.25583610246528166, 0.1740195391870731, 0.11187992530057625, 0.02032453477458686, -0.05597704523528109, -0.3597753057826538, 0.11822365526566092, -0.13320723762355594, -0.1990613449288874, -0.11938430621687855, 0.024343483064475716, 0.036089962581172585, -0.21132927091450107, 0.030967674465203772, 0.2105473029446237, 0.12714932514924784, -0.023584741015671467, 0.053552487151749546, -0.042504112749379507, 0.11633030210184503, 0.0717016500373352, 0.042610126533260455, 0.10083135515831564, 0.0723709272486823, -0.1295993610532308, 0.36399114649262926, -0.11432730404622092, -0.3323377545314784, 0.2346454467624426, -0.23197772390950394, -0.269785995785223, 0.16954110753817522, 0.15710779328887559, 0.10439902646657155, -0.15280968828925065, 0.15186542954666502, -0.1262981329607416, 0.12755860814026423, 0.023962179750052034, 0.006531620977864582, 0.1457862303573258, 0.13383997478332293, 0.228005026809263, 0.18361162491218777, 0.03472984651559774, -0.14401421594262429, -0.21827136713783352, -0.19695499514666748, -0.194089505277403, 0.1328356791173621, -0.07904566152018913, -0.182959040740923, 0.3609140733523028, 0.06081123144855267, 0.13736004261056445, 0.15958804192439635, 0.22240021976889396, 0.0852202464546058, -0.047361706343137334, 0.13061838805181336, 0.12491329723722017, 0.14963784297377022, -0.03257185452598698, -0.174060821105555, -0.0003165878089410918, 0.16892573568133676]
|
1,803.06573
|
On the Fenchel Duality between Strong Convexity and Lipschitz Continuous
Gradient
|
We provide a simple proof for the Fenchel duality between strong convexity
and Lipschitz continuous gradient. To this end, we first establish equivalent
conditions of convexity for a general function that may not be differentiable.
By utilizing these equivalent conditions, we can directly obtain equivalent
conditions for strong convexity and Lipschitz continuous gradient. Based on
these results, we can easily prove Fenchel duality. Beside this main result, we
also identify several conditions that are implied by strong convexity or
Lipschitz continuous gradient, but are not necessarily equivalent to them. This
means that these conditions are more general than strong convexity or Lipschitz
continuous gradient themselves.
|
math.OC
|
we provide a simple proof for the fenchel duality between strong convexity and lipschitz continuous gradient to this end we first establish equivalent conditions of convexity for a general function that may not be differentiable by utilizing these equivalent conditions we can directly obtain equivalent conditions for strong convexity and lipschitz continuous gradient based on these results we can easily prove fenchel duality beside this main result we also identify several conditions that are implied by strong convexity or lipschitz continuous gradient but are not necessarily equivalent to them this means that these conditions are more general than strong convexity or lipschitz continuous gradient themselves
|
[['we', 'provide', 'a', 'simple', 'proof', 'for', 'the', 'fenchel', 'duality', 'between', 'strong', 'convexity', 'and', 'lipschitz', 'continuous', 'gradient', 'to', 'this', 'end', 'we', 'first', 'establish', 'equivalent', 'conditions', 'of', 'convexity', 'for', 'a', 'general', 'function', 'that', 'may', 'not', 'be', 'differentiable', 'by', 'utilizing', 'these', 'equivalent', 'conditions', 'we', 'can', 'directly', 'obtain', 'equivalent', 'conditions', 'for', 'strong', 'convexity', 'and', 'lipschitz', 'continuous', 'gradient', 'based', 'on', 'these', 'results', 'we', 'can', 'easily', 'prove', 'fenchel', 'duality', 'beside', 'this', 'main', 'result', 'we', 'also', 'identify', 'several', 'conditions', 'that', 'are', 'implied', 'by', 'strong', 'convexity', 'or', 'lipschitz', 'continuous', 'gradient', 'but', 'are', 'not', 'necessarily', 'equivalent', 'to', 'them', 'this', 'means', 'that', 'these', 'conditions', 'are', 'more', 'general', 'than', 'strong', 'convexity', 'or', 'lipschitz', 'continuous', 'gradient', 'themselves']]
|
[-0.09083176712932375, 0.05982785957111489, -0.122375134298844, 0.16163221759211627, -0.16000330011537742, -0.18293603216963156, 0.017779666566777798, 0.49910786300897597, -0.33954499257462367, -0.1969575868431656, 0.16970014102047398, -0.15229968849148245, -0.1597612400007035, 0.19859065450284452, -0.14687721365286657, 0.06135358586907387, 0.037231911798673016, -0.025765245321062617, -0.1550465118516946, -0.25209120828658343, 0.35230413338258154, -0.061078518806468876, 0.22168662468237535, 0.1500271231490409, 0.09284864943918018, -0.015558092752915052, 0.021993158190023333, 0.08665887587038534, -0.1564603622192711, 0.13899343506033932, 0.19756696730674733, 0.1342537886285711, 0.3228072977846577, -0.45734347772030604, -0.17631883112092814, 0.18193262316109168, 0.06929125000190522, 0.028797009006320012, -0.06799343864369717, -0.2841197753413802, 0.13307379168413935, -0.06061193907988213, -0.11746467377635694, -0.15172381168674856, -0.07025034165098554, 0.11392780602133522, -0.3428283794738707, 0.08444615274950462, 0.15061482511726873, 0.04744521483246769, -0.10907204473346827, -0.051709025568284446, -0.030775155388705788, 0.05875604764247934, 0.04980693282116027, 0.06238256706634448, 0.10702621094616396, -0.052393701138152254, -0.034621847913201366, 0.28879434948875793, -0.08678668469836426, -0.2682542542084342, 0.2718651799329867, -0.11350700488491428, -0.1811474405450835, 0.07002620351988645, 0.12270142169048388, 0.16721368167726766, -0.20187966502493337, 0.06627662341398675, -0.08138300117016548, 0.1299140038944426, 0.09254394136812716, 0.04937783979167718, 0.11909992019867613, -0.0015472614206373692, 0.239537223659101, 0.1793480260042651, 0.06512826042488173, -0.08954808295571379, -0.39820060357451437, -0.14945530109107494, -0.1279378161898681, 0.07920537186991645, -0.1127567989383048, -0.14421280730914857, 0.3041309740926538, 0.13870049929357178, 0.16280195853185087, 0.17714906078541562, 0.2658020268238726, 0.17484853524005128, 0.046064385235132205, 0.08129559539790665, 0.274472810115133, 0.14046911652022528, 0.04432083540817811, -0.13361678339008773, 0.11690956867255625, 0.14768820982426406]
|
1,803.06574
|
Dynamical Localization in $\mathbb{Z}_2$ Lattice Gauge Theories
|
We study quantum quenches in two-dimensional lattice gauge theories with
fermions coupled to dynamical $\mathbb{Z}_2$ gauge fields. Through the
identification of an extensive set of conserved quantities, we propose a
generic mechanism of charge localization in the absence of quenched disorder
both in the Hamiltonian and in the initial states. We provide diagnostics of
this localization through a set of experimentally relevant dynamical measures,
entanglement measures, as well as spectral properties of the model. One of the
defining features of the models that we study is a binary nature of emergent
disorder, related to $\mathbb{Z}_2$ degrees of freedom. This results in a
qualitatively different behaviour in the strong disorder limit compared to
typically studied models of localization. For example it gives rise to a
possibility of a delocalization transition via a mechanism of quantum
percolation in dimensions higher than 1D. We highlight the importance of our
general phenomenology to questions related to dynamics of defects in Kitaev's
toric code, and to quantum quenches in Hubbard models. While the simplest
models we consider are effectively non-interacting, we also include
interactions leading to many-body localization-like logarithmic entanglement
growth. Finally, we consider effects of interactions that generate dynamics for
conserved charges, which gives rise to only transient localization behaviour,
or quasi-many-body-localization.
|
cond-mat.str-el
|
we study quantum quenches in twodimensional lattice gauge theories with fermions coupled to dynamical mathbbz_2 gauge fields through the identification of an extensive set of conserved quantities we propose a generic mechanism of charge localization in the absence of quenched disorder both in the hamiltonian and in the initial states we provide diagnostics of this localization through a set of experimentally relevant dynamical measures entanglement measures as well as spectral properties of the model one of the defining features of the models that we study is a binary nature of emergent disorder related to mathbbz_2 degrees of freedom this results in a qualitatively different behaviour in the strong disorder limit compared to typically studied models of localization for example it gives rise to a possibility of a delocalization transition via a mechanism of quantum percolation in dimensions higher than 1d we highlight the importance of our general phenomenology to questions related to dynamics of defects in kitaevs toric code and to quantum quenches in hubbard models while the simplest models we consider are effectively noninteracting we also include interactions leading to manybody localizationlike logarithmic entanglement growth finally we consider effects of interactions that generate dynamics for conserved charges which gives rise to only transient localization behaviour or quasimanybodylocalization
|
[['we', 'study', 'quantum', 'quenches', 'in', 'twodimensional', 'lattice', 'gauge', 'theories', 'with', 'fermions', 'coupled', 'to', 'dynamical', 'mathbbz_2', 'gauge', 'fields', 'through', 'the', 'identification', 'of', 'an', 'extensive', 'set', 'of', 'conserved', 'quantities', 'we', 'propose', 'a', 'generic', 'mechanism', 'of', 'charge', 'localization', 'in', 'the', 'absence', 'of', 'quenched', 'disorder', 'both', 'in', 'the', 'hamiltonian', 'and', 'in', 'the', 'initial', 'states', 'we', 'provide', 'diagnostics', 'of', 'this', 'localization', 'through', 'a', 'set', 'of', 'experimentally', 'relevant', 'dynamical', 'measures', 'entanglement', 'measures', 'as', 'well', 'as', 'spectral', 'properties', 'of', 'the', 'model', 'one', 'of', 'the', 'defining', 'features', 'of', 'the', 'models', 'that', 'we', 'study', 'is', 'a', 'binary', 'nature', 'of', 'emergent', 'disorder', 'related', 'to', 'mathbbz_2', 'degrees', 'of', 'freedom', 'this', 'results', 'in', 'a', 'qualitatively', 'different', 'behaviour', 'in', 'the', 'strong', 'disorder', 'limit', 'compared', 'to', 'typically', 'studied', 'models', 'of', 'localization', 'for', 'example', 'it', 'gives', 'rise', 'to', 'a', 'possibility', 'of', 'a', 'delocalization', 'transition', 'via', 'a', 'mechanism', 'of', 'quantum', 'percolation', 'in', 'dimensions', 'higher', 'than', '1d', 'we', 'highlight', 'the', 'importance', 'of', 'our', 'general', 'phenomenology', 'to', 'questions', 'related', 'to', 'dynamics', 'of', 'defects', 'in', 'kitaevs', 'toric', 'code', 'and', 'to', 'quantum', 'quenches', 'in', 'hubbard', 'models', 'while', 'the', 'simplest', 'models', 'we', 'consider', 'are', 'effectively', 'noninteracting', 'we', 'also', 'include', 'interactions', 'leading', 'to', 'manybody', 'localizationlike', 'logarithmic', 'entanglement', 'growth', 'finally', 'we', 'consider', 'effects', 'of', 'interactions', 'that', 'generate', 'dynamics', 'for', 'conserved', 'charges', 'which', 'gives', 'rise', 'to', 'only', 'transient', 'localization', 'behaviour', 'or', 'quasimanybodylocalization']]
|
[-0.1558455349472554, 0.18468188140874534, -0.07415269580523479, 0.09956582520181843, 0.01329157143327349, -0.16603995441090189, 0.016716030663231407, 0.33306052952167997, -0.23182763566447484, -0.2519882998849909, 0.05216534656375772, -0.28981059092290445, -0.18188928910823549, 0.13353913441831292, -0.0018507326415465506, 0.04263522913724472, 0.003526463983175547, 0.01204904612642488, -0.09560492199931096, -0.2418031720680765, 0.3221631512891699, 0.04090296228557987, 0.27427927464030794, 0.09748522832580271, 0.04809137899653563, 0.01700654463923496, 0.04422170121294721, 0.027203750805614362, -0.15760785953856268, 0.09041551452502383, 0.2074769761148027, 0.03581658745823419, 0.2020819880279762, -0.4177948186300011, -0.2608160213139898, 0.08706756352316498, 0.1517037427517392, 0.20039907385592892, -0.04681667573705028, -0.2964047419232348, 0.03454968665955939, -0.1938090646000588, -0.15764054547711884, -0.11709636787474516, 0.002700909085859711, -0.0074775940910148195, -0.2560454762680231, 0.11423420904928049, 0.07006891726393585, 0.07837012420961822, -0.06012152954328643, 9.801177755628087e-05, -0.03604304066134824, 0.13191195775682762, 0.062108748247127095, -0.011561949154731013, 0.11031853126649911, -0.20857234320863136, -0.18231639617284678, 0.4097038371834886, -0.06720799989729798, -0.21115257874792576, 0.253089705221175, -0.13115342035169764, -0.15470912639537585, 0.10293746579231487, 0.16928379413568312, 0.11492092976012551, -0.13888586667739755, 0.07563404747620135, -0.01667642463583517, 0.14441922613631053, -0.031166909917163244, 0.10946964397537184, 0.23660019167658428, 0.15656006478834988, 0.04146366304119572, 0.20569162607386457, -0.04652607906159859, -0.170325153734499, -0.30193248773578574, -0.13558578906481825, -0.17544381652063362, 0.10604531877755147, -0.07681745366552724, -0.2006674668693168, 0.469989449467402, 0.23266268581554636, 0.21004657717329295, 0.01506927656740904, 0.19622117295582298, 0.09782072635671767, 0.0595961325298005, 0.009118516623505936, 0.20049554007667778, 0.1384113141524511, 0.036770196247998856, -0.252019079681036, -0.003232323726558167, 0.10045250113558582]
|
1,803.06575
|
Dynamics of a Lattice Gauge Theory with Fermionic Matter -- Minimal
Quantum Simulator with Time-Dependent Impurities in Ultracold Gases
|
We propose a minimal model to study the real-time dynamics of a
$\mathbb{Z}_2$ lattice gauge theory coupled to fermionic matter in a cold atom
quantum simulator setup. We show that dynamical correlators of the gauge fields
can be measured in experiments studying the time-evolution of two pairs of
impurities, and suggest the protocol for implementing the model in cold atom
experiments. Further, we discuss a number of unexpected features found in the
integrable limit of the model, as well as its extensions to a non-integrable
case. A potential experimental implementation of our model in the latter regime
would allow one to simulate strongly-interacting lattice gauge theories beyond
current capabilities of classical computers.
|
cond-mat.quant-gas cond-mat.str-el
|
we propose a minimal model to study the realtime dynamics of a mathbbz_2 lattice gauge theory coupled to fermionic matter in a cold atom quantum simulator setup we show that dynamical correlators of the gauge fields can be measured in experiments studying the timeevolution of two pairs of impurities and suggest the protocol for implementing the model in cold atom experiments further we discuss a number of unexpected features found in the integrable limit of the model as well as its extensions to a nonintegrable case a potential experimental implementation of our model in the latter regime would allow one to simulate stronglyinteracting lattice gauge theories beyond current capabilities of classical computers
|
[['we', 'propose', 'a', 'minimal', 'model', 'to', 'study', 'the', 'realtime', 'dynamics', 'of', 'a', 'mathbbz_2', 'lattice', 'gauge', 'theory', 'coupled', 'to', 'fermionic', 'matter', 'in', 'a', 'cold', 'atom', 'quantum', 'simulator', 'setup', 'we', 'show', 'that', 'dynamical', 'correlators', 'of', 'the', 'gauge', 'fields', 'can', 'be', 'measured', 'in', 'experiments', 'studying', 'the', 'timeevolution', 'of', 'two', 'pairs', 'of', 'impurities', 'and', 'suggest', 'the', 'protocol', 'for', 'implementing', 'the', 'model', 'in', 'cold', 'atom', 'experiments', 'further', 'we', 'discuss', 'a', 'number', 'of', 'unexpected', 'features', 'found', 'in', 'the', 'integrable', 'limit', 'of', 'the', 'model', 'as', 'well', 'as', 'its', 'extensions', 'to', 'a', 'nonintegrable', 'case', 'a', 'potential', 'experimental', 'implementation', 'of', 'our', 'model', 'in', 'the', 'latter', 'regime', 'would', 'allow', 'one', 'to', 'simulate', 'stronglyinteracting', 'lattice', 'gauge', 'theories', 'beyond', 'current', 'capabilities', 'of', 'classical', 'computers']]
|
[-0.1442274874924416, 0.17413477990859455, -0.09050708437903918, 0.07975252764715281, -0.009672130557841488, -0.18168992557600308, 0.02051407417353143, 0.33882109768871616, -0.23220196193350212, -0.2773968300316483, 0.04871786166248577, -0.2731035649526997, -0.13795997003866692, 0.183303414340896, 0.01624940357786337, 0.074486959935062, 0.049137352483480105, 0.035861936537133134, -0.07131625424829378, -0.24847555279432396, 0.2495818071724248, 0.04611974750774347, 0.2514303256196269, 0.0820039623982406, 0.0717698545319893, 0.002113575814291835, 0.03709832220504593, -0.0032070765321675155, -0.09487878552662161, 0.08123652475686478, 0.21955108161949152, 0.05683697353898814, 0.19639963630054677, -0.4732440507172474, -0.2539386065161255, 0.10368565973476507, 0.14328927689764118, 0.19272232875560544, -0.055960957933815995, -0.3080281753105477, 0.003118094885784168, -0.21669966291353507, -0.1878486896904568, -0.11204879678137201, -0.051241268325871454, -0.02540366158895527, -0.2563343211222673, 0.0514561225073911, 0.02178288051670409, 0.037559853974796296, -0.03831301552054356, -0.023161255405284464, 0.005984031140022645, 0.042006662404414134, 0.010018902472698496, 0.016013794721012737, 0.15790774497353205, -0.2005050269300617, -0.17583079668111168, 0.43894755948401454, -0.13018798149278155, -0.18480257759802043, 0.21015135468249874, -0.1370731224971158, -0.14976762238490796, 0.02686031667482374, 0.16337621960389828, 0.08442641817964613, -0.13117027818225324, 0.12529116359188006, -0.0832123467220559, 0.1502781264799913, -0.029888495216645033, 0.06486231209211317, 0.2600415784982033, 0.1857644025990989, 0.012055834782846173, 0.1832953565275862, -0.0502197293930554, -0.17862296774858674, -0.3284512649489833, -0.16551566687329405, -0.16281957070376457, 0.04727762242172113, -0.05037403052626489, -0.13799748049599916, 0.4089447929041593, 0.2329147672919914, 0.18358132707154645, 0.015649660465507104, 0.2631536892731674, 0.07045545823452162, 0.07295796753688981, 0.005208508020067322, 0.21351870524501596, 0.14324338641017675, 0.05675694364721754, -0.26527292592384455, -0.0711774274324333, 0.06994539601146244]
|
1,803.06576
|
Projection-Based Finite Elements for Nonlinear Function Spaces
|
We introduce a novel type of approximation spaces for functions with values
in a nonlinear manifold. The discrete functions are constructed by piecewise
polynomial interpolation in a Euclidean embedding space, and then projecting
pointwise onto the manifold. We show optimal interpolation error bounds with
respect to Lebesgue and Sobolev norms. Additionally, we show similar bounds for
the test functions, i.e., variations of discrete functions. Combining these
results with a nonlinear C\'ea lemma, we prove optimal $L^2$ and $H^1$
discretization error bounds for harmonic maps from a planar domain into a
smooth manifold. All these error bounds are also verified numerically.
|
math.NA
|
we introduce a novel type of approximation spaces for functions with values in a nonlinear manifold the discrete functions are constructed by piecewise polynomial interpolation in a euclidean embedding space and then projecting pointwise onto the manifold we show optimal interpolation error bounds with respect to lebesgue and sobolev norms additionally we show similar bounds for the test functions ie variations of discrete functions combining these results with a nonlinear cea lemma we prove optimal l2 and h1 discretization error bounds for harmonic maps from a planar domain into a smooth manifold all these error bounds are also verified numerically
|
[['we', 'introduce', 'a', 'novel', 'type', 'of', 'approximation', 'spaces', 'for', 'functions', 'with', 'values', 'in', 'a', 'nonlinear', 'manifold', 'the', 'discrete', 'functions', 'are', 'constructed', 'by', 'piecewise', 'polynomial', 'interpolation', 'in', 'a', 'euclidean', 'embedding', 'space', 'and', 'then', 'projecting', 'pointwise', 'onto', 'the', 'manifold', 'we', 'show', 'optimal', 'interpolation', 'error', 'bounds', 'with', 'respect', 'to', 'lebesgue', 'and', 'sobolev', 'norms', 'additionally', 'we', 'show', 'similar', 'bounds', 'for', 'the', 'test', 'functions', 'ie', 'variations', 'of', 'discrete', 'functions', 'combining', 'these', 'results', 'with', 'a', 'nonlinear', 'cea', 'lemma', 'we', 'prove', 'optimal', 'l2', 'and', 'h1', 'discretization', 'error', 'bounds', 'for', 'harmonic', 'maps', 'from', 'a', 'planar', 'domain', 'into', 'a', 'smooth', 'manifold', 'all', 'these', 'error', 'bounds', 'are', 'also', 'verified', 'numerically']]
|
[-0.07191162602044641, 0.04369037628173828, -0.0804036808339879, 0.15035269756335765, -0.05691365275066346, -0.12403502007015049, 0.0319264235929586, 0.4047062856145203, -0.31377083480358126, -0.19441496509418357, 0.17027184628648684, -0.2518546981899999, -0.1764642694592476, 0.25206061579287053, -0.10174137588473968, 0.15759962164695027, 0.07410500112688169, -0.020257321912795306, -0.1924698180705309, -0.2531717707577627, 0.3856757536157966, -0.06310551134869456, 0.22425579737871884, 0.018110481668263675, 0.15845886585768312, -0.03830686955247074, -0.03584113314282149, 0.008443112236855087, -0.19932295394595712, 0.17305490280268715, 0.23687439577654004, 0.08128259946359322, 0.3004747673869133, -0.3841518604848534, -0.184350017409306, 0.17270201982930303, 0.12062941897660494, 0.051384357248898595, -0.044178783692186696, -0.3285927513707429, 0.08973810913972556, -0.0570766965043731, -0.11085842001950369, -0.12553714645560832, -0.02550124270375818, 0.09936899654567241, -0.3744398913811892, 0.051242021221842154, 0.06364691271097399, 0.04882031516870484, -0.14248691827058793, -0.11885679750703275, -0.004075582223013043, 0.06991363571956753, -0.0320915415417403, 0.08695185335818678, 0.04510199346579611, -0.01824357674457133, -0.11556304252007976, 0.3012242086650804, -0.10910625684075058, -0.36938964903354643, 0.10198492993600666, -0.16119113775435834, -0.1275133877946064, 0.08056691600941121, 0.20691021097823978, 0.11612877011153615, -0.07796691349707544, 0.16691196113650222, -0.047837689258158206, 0.14678685334511102, 0.10597062138374895, 0.04508496940135956, 0.036027616867795584, 0.09057867192663252, 0.1917581235151738, 0.16020162503467872, -0.03931475347140804, -0.08831608324020636, -0.35822482731193306, -0.1309666361194104, -0.19328827597317286, 0.0240241733007133, -0.19693420186129515, -0.18023241739254445, 0.35440304688643665, 0.02984967459924519, 0.20468562270980328, 0.20355462222360074, 0.26153126154094936, 0.1469560195063241, 0.009703191628213972, 0.14194796764291823, 0.19010003753937782, 0.12909085762919859, 0.0012209181301295758, -0.12025351160729769, -0.012243916920851916, 0.22842212880030274]
|
1,803.06577
|
Multi-user Multi-task Offloading and Resource Allocation in Mobile Cloud
Systems
|
We consider a general multi-user Mobile Cloud Computing (MCC) system where
each mobile user has multiple independent tasks. These mobile users share the
computation and communication resources while offloading tasks to the cloud. We
study both the conventional MCC where tasks are offloaded to the cloud through
a wireless access point, and MCC with a computing access point (CAP), where the
CAP serves both as the network access gateway and a computation service
provider to the mobile users. We aim to jointly optimize the offloading
decisions of all users as well as the allocation of computation and
communication resources, to minimize the overall cost of energy, computation,
and delay for all users. The optimization problem is formulated as a non-convex
quadratically constrained quadratic program, which is NP-hard in general. For
the case without a CAP, an efficient approximate solution named MUMTO is
proposed by using separable semidefinite relaxation (SDR), followed by recovery
of the binary offloading decision and optimal allocation of the communication
resource. To solve the more complicated problem with a CAP, we further propose
an efficient three-step algorithm named MUMTO-C comprising of generalized MUMTO
SDR with CAP, alternating optimization, and sequential tuning, which always
computes a locally optimal solution. For performance benchmarking, we further
present numerical lower bounds of the minimum system cost with and without the
CAP. By comparison with this lower bound, our simulation results show that the
proposed solutions for both scenarios give nearly optimal performance under
various parameter settings, and the resultant efficient utilization of a CAP
can bring substantial cost benefit.
|
cs.IT math.IT
|
we consider a general multiuser mobile cloud computing mcc system where each mobile user has multiple independent tasks these mobile users share the computation and communication resources while offloading tasks to the cloud we study both the conventional mcc where tasks are offloaded to the cloud through a wireless access point and mcc with a computing access point cap where the cap serves both as the network access gateway and a computation service provider to the mobile users we aim to jointly optimize the offloading decisions of all users as well as the allocation of computation and communication resources to minimize the overall cost of energy computation and delay for all users the optimization problem is formulated as a nonconvex quadratically constrained quadratic program which is nphard in general for the case without a cap an efficient approximate solution named mumto is proposed by using separable semidefinite relaxation sdr followed by recovery of the binary offloading decision and optimal allocation of the communication resource to solve the more complicated problem with a cap we further propose an efficient threestep algorithm named mumtoc comprising of generalized mumto sdr with cap alternating optimization and sequential tuning which always computes a locally optimal solution for performance benchmarking we further present numerical lower bounds of the minimum system cost with and without the cap by comparison with this lower bound our simulation results show that the proposed solutions for both scenarios give nearly optimal performance under various parameter settings and the resultant efficient utilization of a cap can bring substantial cost benefit
|
[['we', 'consider', 'a', 'general', 'multiuser', 'mobile', 'cloud', 'computing', 'mcc', 'system', 'where', 'each', 'mobile', 'user', 'has', 'multiple', 'independent', 'tasks', 'these', 'mobile', 'users', 'share', 'the', 'computation', 'and', 'communication', 'resources', 'while', 'offloading', 'tasks', 'to', 'the', 'cloud', 'we', 'study', 'both', 'the', 'conventional', 'mcc', 'where', 'tasks', 'are', 'offloaded', 'to', 'the', 'cloud', 'through', 'a', 'wireless', 'access', 'point', 'and', 'mcc', 'with', 'a', 'computing', 'access', 'point', 'cap', 'where', 'the', 'cap', 'serves', 'both', 'as', 'the', 'network', 'access', 'gateway', 'and', 'a', 'computation', 'service', 'provider', 'to', 'the', 'mobile', 'users', 'we', 'aim', 'to', 'jointly', 'optimize', 'the', 'offloading', 'decisions', 'of', 'all', 'users', 'as', 'well', 'as', 'the', 'allocation', 'of', 'computation', 'and', 'communication', 'resources', 'to', 'minimize', 'the', 'overall', 'cost', 'of', 'energy', 'computation', 'and', 'delay', 'for', 'all', 'users', 'the', 'optimization', 'problem', 'is', 'formulated', 'as', 'a', 'nonconvex', 'quadratically', 'constrained', 'quadratic', 'program', 'which', 'is', 'nphard', 'in', 'general', 'for', 'the', 'case', 'without', 'a', 'cap', 'an', 'efficient', 'approximate', 'solution', 'named', 'mumto', 'is', 'proposed', 'by', 'using', 'separable', 'semidefinite', 'relaxation', 'sdr', 'followed', 'by', 'recovery', 'of', 'the', 'binary', 'offloading', 'decision', 'and', 'optimal', 'allocation', 'of', 'the', 'communication', 'resource', 'to', 'solve', 'the', 'more', 'complicated', 'problem', 'with', 'a', 'cap', 'we', 'further', 'propose', 'an', 'efficient', 'threestep', 'algorithm', 'named', 'mumtoc', 'comprising', 'of', 'generalized', 'mumto', 'sdr', 'with', 'cap', 'alternating', 'optimization', 'and', 'sequential', 'tuning', 'which', 'always', 'computes', 'a', 'locally', 'optimal', 'solution', 'for', 'performance', 'benchmarking', 'we', 'further', 'present', 'numerical', 'lower', 'bounds', 'of', 'the', 'minimum', 'system', 'cost', 'with', 'and', 'without', 'the', 'cap', 'by', 'comparison', 'with', 'this', 'lower', 'bound', 'our', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'solutions', 'for', 'both', 'scenarios', 'give', 'nearly', 'optimal', 'performance', 'under', 'various', 'parameter', 'settings', 'and', 'the', 'resultant', 'efficient', 'utilization', 'of', 'a', 'cap', 'can', 'bring', 'substantial', 'cost', 'benefit']]
|
[-0.18578882518284212, -0.025340146548998025, -0.014834586920484843, 0.025193107953106673, -0.0847526086324007, -0.2192740566568297, 0.1396261183717125, 0.3777629564722804, -0.308920877438459, -0.3144145936520357, 0.1326160977584589, -0.22509225263488605, -0.15654710206975037, 0.1694584920466062, -0.09694244201224413, 0.08272020016155471, 0.06679385822404045, 0.013445612197154807, -0.041222126211143004, -0.28410725094512074, 0.2426186793357866, 0.09839683065348548, 0.32018608881109883, 0.06753557296999792, 0.07516101221843888, 0.0386016795718372, 0.02284515693925089, -0.007861768516552443, -0.09380009910332403, 0.14547064628520914, 0.3372802558284369, 0.23132546231123335, 0.33114706787574266, -0.43454132874130275, -0.1838064237211465, 0.1059728856560872, 0.16512682794136674, 0.015814919516639894, -0.06150240873890079, -0.23094618527158906, 0.11638665972150689, -0.21738210843390413, -0.023135576838381036, -0.05112833587601346, -0.028087562147585916, 0.018580476339165382, -0.373754746066805, -0.01917239954873579, -0.032788318740874386, -0.00039158101693694463, -0.08569751115532136, -0.12010583197716117, 0.04233152767261019, 0.1553054980341171, 0.020510919955726677, 0.04154324807962294, 0.13735778640515392, -0.1199007023493705, -0.16521833750196455, 0.40600912795485455, 0.007029048321181582, -0.2201236738580558, 0.16724568161504627, -0.0068467862556184774, -0.11564294580761561, 0.1265749582451866, 0.23732855553822121, 0.11184811399677036, -0.17278334615273755, 0.07385951259553049, -0.03894683785359683, 0.1336156999049545, 0.03945840568488268, 0.05152197693364064, 0.13411476772191575, 0.1965918932218786, 0.19840325633288589, 0.17752404482799658, -0.06647290230605477, -0.13877427658058905, -0.21085846880183587, -0.1613837075152467, -0.21833490998871943, 0.0105583118089087, -0.10285145324216168, -0.10844124760433438, 0.36487789166518686, 0.10507280670707965, 0.1408828672108599, 0.1331829642813566, 0.4025477005407968, 0.11739808372865115, 0.05842959606618682, 0.21056017583120135, 0.14705783225426539, 0.008222082723113292, 0.12962100023842246, -0.2482522532945419, 0.06809244838548673, 0.022739127292823236]
|
1,803.06578
|
A two-stage estimation procedure for non-linear structural equation
models
|
Applications of structural equation models (SEMs) are often restricted to
linear associations between variables. Maximum likelihood (ML) estimation in
non-linear models may be complex and require numerical integration.
Furthermore, ML inference is sensitive to distributional assumptions. In this
paper, we introduce a simple two-stage estimation technique for estimation of
non-linear associations between latent variables. Here both steps are based on
fitting linear SEMs: first a linear model is fitted to data on the latent
predictor and terms describing the non-linear effect are predicted by their
conditional means. In the second step, the predictions are included in a linear
model for the latent outcome variable. We show that this procedure is
consistent and identifies its asymptotic distribution. We also illustrate how
this framework easily allows the association between latent variables to be
modelled using restricted cubic splines and we develop a modified estimator
which is robust to non-normality of the latent predictor. In a simulation
study, we compare the proposed method to MLE and alternative two-stage
estimation techniques.
|
stat.ME
|
applications of structural equation models sems are often restricted to linear associations between variables maximum likelihood ml estimation in nonlinear models may be complex and require numerical integration furthermore ml inference is sensitive to distributional assumptions in this paper we introduce a simple twostage estimation technique for estimation of nonlinear associations between latent variables here both steps are based on fitting linear sems first a linear model is fitted to data on the latent predictor and terms describing the nonlinear effect are predicted by their conditional means in the second step the predictions are included in a linear model for the latent outcome variable we show that this procedure is consistent and identifies its asymptotic distribution we also illustrate how this framework easily allows the association between latent variables to be modelled using restricted cubic splines and we develop a modified estimator which is robust to nonnormality of the latent predictor in a simulation study we compare the proposed method to mle and alternative twostage estimation techniques
|
[['applications', 'of', 'structural', 'equation', 'models', 'sems', 'are', 'often', 'restricted', 'to', 'linear', 'associations', 'between', 'variables', 'maximum', 'likelihood', 'ml', 'estimation', 'in', 'nonlinear', 'models', 'may', 'be', 'complex', 'and', 'require', 'numerical', 'integration', 'furthermore', 'ml', 'inference', 'is', 'sensitive', 'to', 'distributional', 'assumptions', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'simple', 'twostage', 'estimation', 'technique', 'for', 'estimation', 'of', 'nonlinear', 'associations', 'between', 'latent', 'variables', 'here', 'both', 'steps', 'are', 'based', 'on', 'fitting', 'linear', 'sems', 'first', 'a', 'linear', 'model', 'is', 'fitted', 'to', 'data', 'on', 'the', 'latent', 'predictor', 'and', 'terms', 'describing', 'the', 'nonlinear', 'effect', 'are', 'predicted', 'by', 'their', 'conditional', 'means', 'in', 'the', 'second', 'step', 'the', 'predictions', 'are', 'included', 'in', 'a', 'linear', 'model', 'for', 'the', 'latent', 'outcome', 'variable', 'we', 'show', 'that', 'this', 'procedure', 'is', 'consistent', 'and', 'identifies', 'its', 'asymptotic', 'distribution', 'we', 'also', 'illustrate', 'how', 'this', 'framework', 'easily', 'allows', 'the', 'association', 'between', 'latent', 'variables', 'to', 'be', 'modelled', 'using', 'restricted', 'cubic', 'splines', 'and', 'we', 'develop', 'a', 'modified', 'estimator', 'which', 'is', 'robust', 'to', 'nonnormality', 'of', 'the', 'latent', 'predictor', 'in', 'a', 'simulation', 'study', 'we', 'compare', 'the', 'proposed', 'method', 'to', 'mle', 'and', 'alternative', 'twostage', 'estimation', 'techniques']]
|
[-0.03469158541693486, 0.026226541049733848, -0.11945624405261643, 0.12105991590062636, -0.15214889217168093, -0.17427909007284811, 0.06446436373447208, 0.4256596390302934, -0.2950675060113747, -0.30584750451638315, 0.11626243445127199, -0.23203918876129545, -0.2128787275011969, 0.17549664357225384, -0.08406880968612825, 0.1019680026000572, 0.051021983983653214, -0.002932246305985365, -0.08969658839482882, -0.24965218986484952, 0.2845039325640788, 0.05118195952367997, 0.2721950304429577, -0.07141623532254539, 0.13164462766841523, 0.01692904244054354, -0.08036308624909934, 0.038224612585754096, -0.11876891478555435, 0.1540120990589975, 0.27346799217087314, 0.14533710068727504, 0.32305220292579984, -0.38331627225207754, -0.25299938262334304, 0.10174925131500213, 0.11505897894353902, 0.10397091640778511, 0.014277867324549906, -0.24437125295144088, 0.05716759584353356, -0.16941107643913186, -0.05217542748725387, -0.15027562695036747, -0.060810545247471974, 0.027192740395810166, -0.3625289153720358, 0.14852613726373579, 0.047047480784668895, 0.045801940880692144, -0.05700645207470662, -0.11177368341069557, -0.000394348407855737, 0.06419309485748322, 0.047693439941953665, -0.026314474936452007, 0.07235140372959975, -0.1070030330789058, -0.09969434819343181, 0.3288132678661607, -0.07494991820327893, -0.28681281921704727, 0.17692741909075507, -0.07573654941244129, -0.17166210202121002, 0.06496425939188478, 0.25431418881757173, 0.1330684566658414, -0.2125009782542614, 0.05235906506708717, -0.02589837405802738, 0.18327834481696884, -0.021115867868219194, -0.051024430187441364, 0.16132879224926525, 0.1982736315070735, 0.023261300709187804, 0.14961561379803645, -0.11888989694779013, -0.11492156754889174, -0.2940958144901666, -0.1289797337714605, -0.1837485638826327, -0.052664381011339, -0.14773247896965166, -0.17817534277672897, 0.39097502767415104, 0.2011377153573781, 0.1941218880105563, 0.09458099057532646, 0.28980222105781944, 0.1670491909245754, 0.02522895803457561, 0.07436532315011778, 0.18445365015252824, 0.16045811823234632, 0.014407470905986017, -0.1940473304947484, 0.1607037202534311, 0.03736234436781999]
|
1,803.06579
|
A Multi-perspective Approach To Anomaly Detection For Self-aware
Embodied Agents
|
This paper focuses on multi-sensor anomaly detection for moving cognitive
agents using both external and private first-person visual observations. Both
observation types are used to characterize agents' motion in a given
environment. The proposed method generates locally uniform motion models by
dividing a Gaussian process that approximates agents' displacements on the
scene and provides a Shared Level (SL) self-awareness based on Environment
Centered (EC) models. Such models are then used to train in a semi-unsupervised
way a set of Generative Adversarial Networks (GANs) that produce an estimation
of external and internal parameters of moving agents. Obtained results
exemplify the feasibility of using multi-perspective data for predicting and
analyzing trajectory information.
|
cs.CV
|
this paper focuses on multisensor anomaly detection for moving cognitive agents using both external and private firstperson visual observations both observation types are used to characterize agents motion in a given environment the proposed method generates locally uniform motion models by dividing a gaussian process that approximates agents displacements on the scene and provides a shared level sl selfawareness based on environment centered ec models such models are then used to train in a semiunsupervised way a set of generative adversarial networks gans that produce an estimation of external and internal parameters of moving agents obtained results exemplify the feasibility of using multiperspective data for predicting and analyzing trajectory information
|
[['this', 'paper', 'focuses', 'on', 'multisensor', 'anomaly', 'detection', 'for', 'moving', 'cognitive', 'agents', 'using', 'both', 'external', 'and', 'private', 'firstperson', 'visual', 'observations', 'both', 'observation', 'types', 'are', 'used', 'to', 'characterize', 'agents', 'motion', 'in', 'a', 'given', 'environment', 'the', 'proposed', 'method', 'generates', 'locally', 'uniform', 'motion', 'models', 'by', 'dividing', 'a', 'gaussian', 'process', 'that', 'approximates', 'agents', 'displacements', 'on', 'the', 'scene', 'and', 'provides', 'a', 'shared', 'level', 'sl', 'selfawareness', 'based', 'on', 'environment', 'centered', 'ec', 'models', 'such', 'models', 'are', 'then', 'used', 'to', 'train', 'in', 'a', 'semiunsupervised', 'way', 'a', 'set', 'of', 'generative', 'adversarial', 'networks', 'gans', 'that', 'produce', 'an', 'estimation', 'of', 'external', 'and', 'internal', 'parameters', 'of', 'moving', 'agents', 'obtained', 'results', 'exemplify', 'the', 'feasibility', 'of', 'using', 'multiperspective', 'data', 'for', 'predicting', 'and', 'analyzing', 'trajectory', 'information']]
|
[-0.09330640136853817, 0.041610447263880204, -0.08837088523806423, 0.0408249445278562, -0.09762985019201259, -0.1649136537292955, 0.047070246132693054, 0.451481063465733, -0.25229399563710486, -0.31559508038607825, 0.05851474481446822, -0.24886429210731742, -0.17705514033991468, 0.1770842579458285, -0.13249746702158602, 0.05717117060403075, 0.0984849813693297, 0.06677402589905905, 0.03374239352292492, -0.2261129617904646, 0.313675622886192, 0.033464958789275634, 0.3126061756351809, -0.06382058340914061, 0.17893113028322166, 0.039881408459148074, -0.044818475197385486, 0.029167999139636618, -0.04529754305111539, 0.18132245341538017, 0.26267451577236606, 0.19586280083450394, 0.30672352984889384, -0.4469202889488378, -0.25028044602047617, 0.08836612169024184, 0.1108038174073904, 0.08602059104505481, -0.0698694272144108, -0.4019788291322392, 0.06107706570604799, -0.14336027380574598, -0.047414434253485925, -0.1145466818995432, -0.023261330741427735, 0.026448948883425888, -0.33655949505985877, 0.009859412517654924, 0.05484571313024114, 0.08938940894713096, -0.14145629902139578, -0.06275881124327147, 0.014435078792803742, 0.19421700033607012, -0.0050218256178136845, 0.02277295658852982, 0.19515240796064154, -0.18254325478850358, -0.17032066897121728, 0.3671486318846225, -0.065047165197363, -0.23074882865857776, 0.20979406051508603, -0.04216321824340645, -0.12171314602478518, 0.08397708981887463, 0.26648342229186667, 0.1229854781701819, -0.20318359978189435, 0.02251276240786623, -0.024450361917709607, 0.15820463176885055, 0.025536240663789553, -0.034750460399263494, 0.20481234110481694, 0.21736380428827684, 0.0427338228766046, 0.12121145905063856, -0.1336212585094906, -0.11645366010948195, -0.25271275442909585, -0.07769829628470037, -0.19393443247012862, -0.010391546347084533, -0.0788101980525684, -0.13656632265571608, 0.3839621368983607, 0.21357342122344797, 0.20880925653015323, 0.10101001655870895, 0.3405043097093291, 0.043745010064988515, 0.008589497369013453, 0.11644079396073971, 0.15744426634179753, 0.04447434307076037, 0.07041090083043647, -0.1549251561529439, 0.12378593139487122, 0.026156597542192]
|
1,803.0658
|
Aging is a log-Poisson Process, not a Renewal Process
|
Aging is a ubiquitous relaxation dynamic in disordered materials. It ensues
after a rapid quench from an equilibrium "fluid" state into a non-equilibrium,
history-dependent jammed state. We propose a physically motivated description
that contrasts sharply with a continuous-time random walk (CTRW) with broadly
distributed trapping times commonly used to fit aging data. A renewal process
like CTRW proves irreconcilable with the log-Poisson statistic exhibited, for
example, by jammed colloids as well as by disordered magnets. A log-Poisson
process is characteristic of the intermittent and decelerating dynamics of
jammed matter usually activated by record-breaking fluctuations ("quakes"). We
show that such a record dynamics (RD) provides a universal model for aging,
physically grounded in generic features of free-energy landscapes of disordered
systems.
|
cond-mat.soft cond-mat.dis-nn cond-mat.mtrl-sci
|
aging is a ubiquitous relaxation dynamic in disordered materials it ensues after a rapid quench from an equilibrium fluid state into a nonequilibrium historydependent jammed state we propose a physically motivated description that contrasts sharply with a continuoustime random walk ctrw with broadly distributed trapping times commonly used to fit aging data a renewal process like ctrw proves irreconcilable with the logpoisson statistic exhibited for example by jammed colloids as well as by disordered magnets a logpoisson process is characteristic of the intermittent and decelerating dynamics of jammed matter usually activated by recordbreaking fluctuations quakes we show that such a record dynamics rd provides a universal model for aging physically grounded in generic features of freeenergy landscapes of disordered systems
|
[['aging', 'is', 'a', 'ubiquitous', 'relaxation', 'dynamic', 'in', 'disordered', 'materials', 'it', 'ensues', 'after', 'a', 'rapid', 'quench', 'from', 'an', 'equilibrium', 'fluid', 'state', 'into', 'a', 'nonequilibrium', 'historydependent', 'jammed', 'state', 'we', 'propose', 'a', 'physically', 'motivated', 'description', 'that', 'contrasts', 'sharply', 'with', 'a', 'continuoustime', 'random', 'walk', 'ctrw', 'with', 'broadly', 'distributed', 'trapping', 'times', 'commonly', 'used', 'to', 'fit', 'aging', 'data', 'a', 'renewal', 'process', 'like', 'ctrw', 'proves', 'irreconcilable', 'with', 'the', 'logpoisson', 'statistic', 'exhibited', 'for', 'example', 'by', 'jammed', 'colloids', 'as', 'well', 'as', 'by', 'disordered', 'magnets', 'a', 'logpoisson', 'process', 'is', 'characteristic', 'of', 'the', 'intermittent', 'and', 'decelerating', 'dynamics', 'of', 'jammed', 'matter', 'usually', 'activated', 'by', 'recordbreaking', 'fluctuations', 'quakes', 'we', 'show', 'that', 'such', 'a', 'record', 'dynamics', 'rd', 'provides', 'a', 'universal', 'model', 'for', 'aging', 'physically', 'grounded', 'in', 'generic', 'features', 'of', 'freeenergy', 'landscapes', 'of', 'disordered', 'systems']]
|
[-0.09533285738046592, 0.2859030730994467, -0.169565070734825, 0.07830707311237954, 0.013549365072200696, -0.19488782816721748, 0.02337579200975597, 0.36499217196833345, -0.27474182296621924, -0.22089226252088945, 0.05865986951588032, -0.24926532686998445, -0.19919041159252326, 0.1516850098715319, -0.054265557450708005, 0.09375354467071399, -0.002922128223387214, -0.03212125303689391, 0.009836148412917585, -0.15702208989144614, 0.20051521195661431, 0.03749806963217755, 0.30848101869535943, -0.03929892035666853, 0.10583603510652513, 0.013798093108925968, 0.05630659672509258, 0.07240589268816014, -0.16108920358104417, -0.0018700438745630284, 0.26718222760634186, 0.025002033286727964, 0.25021528294309975, -0.4749458967708051, -0.30342835197225215, 0.10339756767110278, 0.1395229295924461, 0.11491955174133181, -0.0472854326867188, -0.2967559106104697, -0.02336264121113345, -0.17119677655476456, -0.13407538800044375, -0.10597751969471574, 0.06936065847209344, 0.04802964503954475, -0.28419681535742713, 0.17767447939064976, 0.08648388211634786, 0.06640959508755866, -0.06386932331758241, -0.0163060073973611, 0.01511628452281002, 0.03533682875568047, 0.03647585079403749, 0.01037902567962495, 0.2637890922138467, -0.1321306863295225, -0.13459844244158983, 0.38858894862545035, -0.037694423831029174, -0.1220593021872143, 0.2239010109178101, -0.11961179371379936, -0.13776814193867418, 0.2001931201084517, 0.13135453157519805, 0.05826815282343887, -0.2184854654284815, 0.003743585798171504, -0.030514136787193516, 0.1416744666872546, -0.030435487232171, -0.01832055413008978, 0.25506619628965077, 0.2778483139971892, 0.031558718059871656, 0.18915344371149936, -0.010268598814339688, -0.2171145156181107, -0.2563721834895356, -0.12390660790454906, -0.25298331999996054, 0.12952810619220448, -0.12775881210873194, -0.22548254057765008, 0.36961491027420074, 0.13147973430459386, 0.20979966684438597, 0.10241486240993254, 0.2186656918512502, 0.0576970565035784, -0.02237771803047508, 0.07384425119186441, 0.13532687809007862, 0.0994617648946587, 0.1538008003612049, -0.17543589675139326, 0.14088963029595714, 0.009975011099595577]
|
1,803.06581
|
Variational Knowledge Graph Reasoning
|
Inferring missing links in knowledge graphs (KG) has attracted a lot of
attention from the research community. In this paper, we tackle a practical
query answering task involving predicting the relation of a given entity pair.
We frame this prediction problem as an inference problem in a probabilistic
graphical model and aim at resolving it from a variational inference
perspective. In order to model the relation between the query entity pair, we
assume that there exists an underlying latent variable (paths connecting two
nodes) in the KG, which carries the equivalent semantics of their relations.
However, due to the intractability of connections in large KGs, we propose to
use variation inference to maximize the evidence lower bound. More
specifically, our framework (\textsc{Diva}) is composed of three modules, i.e.
a posterior approximator, a prior (path finder), and a likelihood (path
reasoner). By using variational inference, we are able to incorporate them
closely into a unified architecture and jointly optimize them to perform KG
reasoning. With active interactions among these sub-modules, \textsc{Diva} is
better at handling noise and coping with more complex reasoning scenarios. In
order to evaluate our method, we conduct the experiment of the link prediction
task on multiple datasets and achieve state-of-the-art performances on both
datasets.
|
cs.AI cs.CL
|
inferring missing links in knowledge graphs kg has attracted a lot of attention from the research community in this paper we tackle a practical query answering task involving predicting the relation of a given entity pair we frame this prediction problem as an inference problem in a probabilistic graphical model and aim at resolving it from a variational inference perspective in order to model the relation between the query entity pair we assume that there exists an underlying latent variable paths connecting two nodes in the kg which carries the equivalent semantics of their relations however due to the intractability of connections in large kgs we propose to use variation inference to maximize the evidence lower bound more specifically our framework textscdiva is composed of three modules ie a posterior approximator a prior path finder and a likelihood path reasoner by using variational inference we are able to incorporate them closely into a unified architecture and jointly optimize them to perform kg reasoning with active interactions among these submodules textscdiva is better at handling noise and coping with more complex reasoning scenarios in order to evaluate our method we conduct the experiment of the link prediction task on multiple datasets and achieve stateoftheart performances on both datasets
|
[['inferring', 'missing', 'links', 'in', 'knowledge', 'graphs', 'kg', 'has', 'attracted', 'a', 'lot', 'of', 'attention', 'from', 'the', 'research', 'community', 'in', 'this', 'paper', 'we', 'tackle', 'a', 'practical', 'query', 'answering', 'task', 'involving', 'predicting', 'the', 'relation', 'of', 'a', 'given', 'entity', 'pair', 'we', 'frame', 'this', 'prediction', 'problem', 'as', 'an', 'inference', 'problem', 'in', 'a', 'probabilistic', 'graphical', 'model', 'and', 'aim', 'at', 'resolving', 'it', 'from', 'a', 'variational', 'inference', 'perspective', 'in', 'order', 'to', 'model', 'the', 'relation', 'between', 'the', 'query', 'entity', 'pair', 'we', 'assume', 'that', 'there', 'exists', 'an', 'underlying', 'latent', 'variable', 'paths', 'connecting', 'two', 'nodes', 'in', 'the', 'kg', 'which', 'carries', 'the', 'equivalent', 'semantics', 'of', 'their', 'relations', 'however', 'due', 'to', 'the', 'intractability', 'of', 'connections', 'in', 'large', 'kgs', 'we', 'propose', 'to', 'use', 'variation', 'inference', 'to', 'maximize', 'the', 'evidence', 'lower', 'bound', 'more', 'specifically', 'our', 'framework', 'textscdiva', 'is', 'composed', 'of', 'three', 'modules', 'ie', 'a', 'posterior', 'approximator', 'a', 'prior', 'path', 'finder', 'and', 'a', 'likelihood', 'path', 'reasoner', 'by', 'using', 'variational', 'inference', 'we', 'are', 'able', 'to', 'incorporate', 'them', 'closely', 'into', 'a', 'unified', 'architecture', 'and', 'jointly', 'optimize', 'them', 'to', 'perform', 'kg', 'reasoning', 'with', 'active', 'interactions', 'among', 'these', 'submodules', 'textscdiva', 'is', 'better', 'at', 'handling', 'noise', 'and', 'coping', 'with', 'more', 'complex', 'reasoning', 'scenarios', 'in', 'order', 'to', 'evaluate', 'our', 'method', 'we', 'conduct', 'the', 'experiment', 'of', 'the', 'link', 'prediction', 'task', 'on', 'multiple', 'datasets', 'and', 'achieve', 'stateoftheart', 'performances', 'on', 'both', 'datasets']]
|
[-0.09425915600504817, 0.003509174189785859, -0.054237223476123225, 0.0986769403853431, -0.15597640302077662, -0.15697764728172886, 0.08459069533557517, 0.4339076900627555, -0.27882657293003144, -0.3885173607912914, 0.04157560197352545, -0.2765240696031691, -0.15601607753736216, 0.14670411650000548, -0.08899632360638551, 0.05094143974526626, 0.11517515673540624, 0.07657952652562683, -0.0646158680740017, -0.23764788856184701, 0.3193279309726743, 0.05166029338270608, 0.29778300042196015, 0.01497059250928365, 0.146017426790715, 0.009968653428027543, -0.05181547930782161, 0.0030208891575656286, -0.12204476743159254, 0.19604414092354114, 0.32092592618428173, 0.2131989127502027, 0.3339458256187599, -0.40381586484997195, -0.20347143920002186, 0.1271335043427648, 0.11417257736959471, 0.06754830178716674, -0.0063917223314425295, -0.29263934766498917, 0.0803909481792688, -0.19155848705913964, 0.007780773485102123, -0.0869400939858723, -0.0021264600862817068, -0.04812955920947943, -0.28286689236396695, 0.02013689887528194, 0.07531046436690703, 0.045738333009365126, -0.03995301512172218, -0.07249684483835064, 0.05239675743164631, 0.15529775657441194, 0.04116186132177529, 0.051211300845507804, 0.07725427475326309, -0.16547465843752612, -0.16292208413672973, 0.37501500337043914, -0.025797857268054673, -0.23549161001290309, 0.19810748686786833, -0.04316419265744072, -0.1775828860790991, 0.10175533464133013, 0.20466982677306345, 0.1154606416900983, -0.17783966293706127, 0.02590652632203362, -0.05027784827653682, 0.1726314718471613, 0.0448315573174779, -0.02272511666822361, 0.2247357770071575, 0.24752885201355307, 0.07200291401411339, 0.14738456413331555, -0.09321779169216071, -0.10904833384925817, -0.23648276425154152, -0.1428966947243458, -0.16062071995082788, -0.023714991134205242, -0.1028399690573257, -0.13933424584385826, 0.38399313052253026, 0.2311722609589285, 0.21405188550082285, 0.11969117287875766, 0.3031757803105681, 0.05203900011540277, 0.06364269681536115, 0.10058353801837146, 0.1475743398788703, 0.10870100821612584, 0.07482154649205325, -0.1441058506007965, 0.09996880259046831, 0.03325624265708029]
|
1,803.06582
|
Contrasting Various Notions of Convergence in Geometric Analysis
|
We explore the distinctions between $L^p$ convergence of metric tensors on a
fixed Riemannian manifold versus Gromov-Hausdorff, uniform, and intrinsic flat
convergence of the corresponding sequence of metric spaces. We provide a number
of examples which demonstrate these notions of convergence do not agree even
for two dimensional warped product manifolds with warping functions converging
in the $L^p$ sense. We then prove a theorem which requires $L^p$ bounds from
above and $C^0$ bounds from below on the warping functions to obtain enough
control for all these limits to agree.
|
math.MG math.DG
|
we explore the distinctions between lp convergence of metric tensors on a fixed riemannian manifold versus gromovhausdorff uniform and intrinsic flat convergence of the corresponding sequence of metric spaces we provide a number of examples which demonstrate these notions of convergence do not agree even for two dimensional warped product manifolds with warping functions converging in the lp sense we then prove a theorem which requires lp bounds from above and c0 bounds from below on the warping functions to obtain enough control for all these limits to agree
|
[['we', 'explore', 'the', 'distinctions', 'between', 'lp', 'convergence', 'of', 'metric', 'tensors', 'on', 'a', 'fixed', 'riemannian', 'manifold', 'versus', 'gromovhausdorff', 'uniform', 'and', 'intrinsic', 'flat', 'convergence', 'of', 'the', 'corresponding', 'sequence', 'of', 'metric', 'spaces', 'we', 'provide', 'a', 'number', 'of', 'examples', 'which', 'demonstrate', 'these', 'notions', 'of', 'convergence', 'do', 'not', 'agree', 'even', 'for', 'two', 'dimensional', 'warped', 'product', 'manifolds', 'with', 'warping', 'functions', 'converging', 'in', 'the', 'lp', 'sense', 'we', 'then', 'prove', 'a', 'theorem', 'which', 'requires', 'lp', 'bounds', 'from', 'above', 'and', 'c0', 'bounds', 'from', 'below', 'on', 'the', 'warping', 'functions', 'to', 'obtain', 'enough', 'control', 'for', 'all', 'these', 'limits', 'to', 'agree']]
|
[-0.10788208262973957, 0.057643709158828334, -0.08313301826167978, 0.157555154890994, -0.0691796080915655, -0.13369918992910323, 0.04703791709642941, 0.40534202047110945, -0.28169417977751643, -0.2585303990152047, 0.15896610818212079, -0.268223141503175, -0.1226094127789642, 0.21989754687476737, -0.11107522887020801, 0.04125597061238806, 0.051516098906861596, 0.04858016592922641, -0.19244069340926584, -0.24279465285663523, 0.4125812394751152, -0.032115671867400074, 0.24806633016115495, 0.06687299014079605, 0.1160220123325171, -0.0413283421710301, -0.009173145088670629, 0.024787758916532725, -0.20689325231347191, 0.13638221219265728, 0.24036244590494657, 0.08559374659573345, 0.23604369928453411, -0.38202950239392114, -0.14986133804607593, 0.14447807509117247, 0.13165203672362846, 0.021653853500722332, -0.002153216123455361, -0.2735545558624723, 0.1274518826086953, -0.06288829418762555, -0.09596627061202954, -0.1609446257143543, -0.03488572030799108, 0.04946890464340326, -0.27503090915845685, 0.0378015623270963, 0.14957386313864354, 0.03125144954603375, -0.1410969908694538, -0.11012643061871275, -0.020111048159848773, 0.12220274998147167, 0.07561653903737832, 0.05593510010290179, 0.07921403908076581, -0.04673094326066798, -0.11619459846438945, 0.3115310715040548, -0.10501546168888218, -0.2760078714574488, 0.18085444358627448, -0.1812808711102672, -0.13161228876560926, 0.0683163084231024, 0.17832196454695437, 0.18094961642381852, -0.0372763870027586, 0.1594896084940312, -0.036993401543645374, 0.10775433161578486, 0.11563741883493206, 0.09389558838015903, 0.13066646393932654, 0.09003236598931671, 0.21837034512028683, 0.12400469781956479, -0.024606327568128538, -0.11381701539791178, -0.36276802325391033, -0.12816407318028172, -0.1719798628002761, 0.10631378962193339, -0.2099999353872335, -0.20963294346544767, 0.32229116916907635, 0.06935207194353067, 0.23457754118723817, 0.2273588901244397, 0.2351830012761475, 0.0676568423324589, 0.018050491108736966, 0.13468927293074098, 0.253927839229281, 0.181925051280538, 0.03339318531366547, -0.11503893820296847, 0.014708992444355501, 0.16186471770025707]
|
1,803.06583
|
Circular orders, ultra-homogeneous order structures and their
automorphism groups
|
We study topological groups $G$ for which the universal minimal $G$-system
$M(G)$, or the universal irreducible affine $G$-system $IA(G)$ are tame. We
call such groups intrinsically tame and convexly intrinsically tame. These
notions are generalized versions of extreme amenability and amenability,
respectively. When $M(G)$, as a $G$-system, admits a circular order we say that
$G$ is intrinsically circularly ordered. This implies that $G$ is intrinsically
tame. We show that for every circularly ultrahomogeneous action $G
\curvearrowright X$ on a circularly ordered set $X$ the topological group $G$,
in its pointwise convergence topology, is intrinsically circularly ordered.
This result is a "circular" analog of Pestov's result about the extremal
amenability of ultrahomogeneous actions on linearly ordered sets by linear
order preserving transformations. In the case where $X$ is countable, the
corresponding Polish group of circular automorphisms $G$ admits a concrete
description. Using the Kechris-Pestov-Todorcevic construction we show that
$M(G)$ is a circularly ordered compact space obtained by splitting the rational
points on the circle. We show also that $G$ is Roelcke precompact, satisfies
Kazhdan's property $T$ (using results of Evans-Tsankov) and has the automatic
continuity property (using results of Rosendal-Solecki).
|
math.DS math.FA math.GN
|
we study topological groups g for which the universal minimal gsystem mg or the universal irreducible affine gsystem iag are tame we call such groups intrinsically tame and convexly intrinsically tame these notions are generalized versions of extreme amenability and amenability respectively when mg as a gsystem admits a circular order we say that g is intrinsically circularly ordered this implies that g is intrinsically tame we show that for every circularly ultrahomogeneous action g curvearrowright x on a circularly ordered set x the topological group g in its pointwise convergence topology is intrinsically circularly ordered this result is a circular analog of pestovs result about the extremal amenability of ultrahomogeneous actions on linearly ordered sets by linear order preserving transformations in the case where x is countable the corresponding polish group of circular automorphisms g admits a concrete description using the kechrispestovtodorcevic construction we show that mg is a circularly ordered compact space obtained by splitting the rational points on the circle we show also that g is roelcke precompact satisfies kazhdans property t using results of evanstsankov and has the automatic continuity property using results of rosendalsolecki
|
[['we', 'study', 'topological', 'groups', 'g', 'for', 'which', 'the', 'universal', 'minimal', 'gsystem', 'mg', 'or', 'the', 'universal', 'irreducible', 'affine', 'gsystem', 'iag', 'are', 'tame', 'we', 'call', 'such', 'groups', 'intrinsically', 'tame', 'and', 'convexly', 'intrinsically', 'tame', 'these', 'notions', 'are', 'generalized', 'versions', 'of', 'extreme', 'amenability', 'and', 'amenability', 'respectively', 'when', 'mg', 'as', 'a', 'gsystem', 'admits', 'a', 'circular', 'order', 'we', 'say', 'that', 'g', 'is', 'intrinsically', 'circularly', 'ordered', 'this', 'implies', 'that', 'g', 'is', 'intrinsically', 'tame', 'we', 'show', 'that', 'for', 'every', 'circularly', 'ultrahomogeneous', 'action', 'g', 'curvearrowright', 'x', 'on', 'a', 'circularly', 'ordered', 'set', 'x', 'the', 'topological', 'group', 'g', 'in', 'its', 'pointwise', 'convergence', 'topology', 'is', 'intrinsically', 'circularly', 'ordered', 'this', 'result', 'is', 'a', 'circular', 'analog', 'of', 'pestovs', 'result', 'about', 'the', 'extremal', 'amenability', 'of', 'ultrahomogeneous', 'actions', 'on', 'linearly', 'ordered', 'sets', 'by', 'linear', 'order', 'preserving', 'transformations', 'in', 'the', 'case', 'where', 'x', 'is', 'countable', 'the', 'corresponding', 'polish', 'group', 'of', 'circular', 'automorphisms', 'g', 'admits', 'a', 'concrete', 'description', 'using', 'the', 'kechrispestovtodorcevic', 'construction', 'we', 'show', 'that', 'mg', 'is', 'a', 'circularly', 'ordered', 'compact', 'space', 'obtained', 'by', 'splitting', 'the', 'rational', 'points', 'on', 'the', 'circle', 'we', 'show', 'also', 'that', 'g', 'is', 'roelcke', 'precompact', 'satisfies', 'kazhdans', 'property', 't', 'using', 'results', 'of', 'evanstsankov', 'and', 'has', 'the', 'automatic', 'continuity', 'property', 'using', 'results', 'of', 'rosendalsolecki']]
|
[-0.21408035659933472, 0.17662359220984286, -0.10924451297178944, 0.05987595428680294, -0.11492199737847568, -0.12457256035301535, 0.020158007491957695, 0.4611463822115631, -0.31247809171965496, -0.17093631835392287, 0.09208272761300475, -0.28352501728437485, -0.14243122856356802, 0.17354543442510437, -0.12958517935834227, -0.04790021629318007, 0.028991911762000565, 0.11621940266440578, -0.09216449531118938, -0.250492705807294, 0.3763506858345659, -0.08646583072604602, 0.2529925661183953, -0.0014119596419143764, 0.13609250103008938, 0.02313626243578479, 0.024031913530499858, 0.08272383118251882, -0.14349282551330375, 0.08972306120742292, 0.27311122859828174, 0.06437334688452731, 0.2082871191482493, -0.295702130002571, -0.1464184183304579, 0.17651463805493664, 0.05117294887911259, -0.03795316143840412, -0.06409115511446227, -0.32600766098510253, 0.16441622704147973, -0.13730953547749966, -0.13418196762767545, -0.09580198458002452, 0.10492348523790584, -0.012122245979829029, -0.25528741796235777, -0.013362854715582372, 0.17581379693997576, 0.09851633591507686, -0.02169827408129897, -0.03748622302583513, -0.11806611972674229, 0.05079640061572757, -0.027537131005957883, 0.06962781150720734, 0.09724363555881459, -0.027471582599502196, -0.13033316950662371, 0.4027580849248617, -0.10080784368876587, -0.17569811414070627, 0.15866424993208464, -0.1932569532929098, -0.20540482628926196, 0.13691057205289842, 0.07523833762326422, 0.19594666244023862, -0.015915813945239426, 0.2431854757316595, -0.17651233890213391, 0.1177475963866109, 0.08096483080613023, 0.04122391483686705, 0.1302115164129412, 0.09565494502869679, 0.15961650696727522, 0.14400925354304958, 0.054594802427700755, 0.05186637177786984, -0.338234958064588, -0.14027848499494028, -0.11897272664187028, 0.15617586628479116, -0.10346061745286549, -0.20321031345333407, 0.3480675169360142, 0.05602822360647394, 0.1055073114311233, 0.09619201677241287, 0.1842365464255373, 0.06581698966414586, -0.009713913119811426, 0.11373391507173525, 0.10986219557689474, 0.22929121215982154, -0.09926356626973352, -0.15281281452800302, 0.01494644529480029, 0.21026367060640916]
|
1,803.06584
|
Linear Instability of the Peregrine Breather: Numerical and Analytical
Investigations
|
We study the linear stability of the Peregrine breather both numerically and
with analytical arguments based on its derivation as the singular limit of a
single-mode spatially periodic breather as the spatial period becomes infinite.
By constructing solutions of the linearization of the nonlinear Schr\"odinger
equation in terms of quadratic products of components of the eigenfunctions of
the Zakharov-Shabat system, we show that the Peregrine breather is linearly
unstable. A numerical study employing a highly accurate Chebychev
pseudo-spectral integrator confirms exponential growth of random initial
perturbations of the Peregrine breather.
|
nlin.SI math-ph math.MP
|
we study the linear stability of the peregrine breather both numerically and with analytical arguments based on its derivation as the singular limit of a singlemode spatially periodic breather as the spatial period becomes infinite by constructing solutions of the linearization of the nonlinear schrodinger equation in terms of quadratic products of components of the eigenfunctions of the zakharovshabat system we show that the peregrine breather is linearly unstable a numerical study employing a highly accurate chebychev pseudospectral integrator confirms exponential growth of random initial perturbations of the peregrine breather
|
[['we', 'study', 'the', 'linear', 'stability', 'of', 'the', 'peregrine', 'breather', 'both', 'numerically', 'and', 'with', 'analytical', 'arguments', 'based', 'on', 'its', 'derivation', 'as', 'the', 'singular', 'limit', 'of', 'a', 'singlemode', 'spatially', 'periodic', 'breather', 'as', 'the', 'spatial', 'period', 'becomes', 'infinite', 'by', 'constructing', 'solutions', 'of', 'the', 'linearization', 'of', 'the', 'nonlinear', 'schrodinger', 'equation', 'in', 'terms', 'of', 'quadratic', 'products', 'of', 'components', 'of', 'the', 'eigenfunctions', 'of', 'the', 'zakharovshabat', 'system', 'we', 'show', 'that', 'the', 'peregrine', 'breather', 'is', 'linearly', 'unstable', 'a', 'numerical', 'study', 'employing', 'a', 'highly', 'accurate', 'chebychev', 'pseudospectral', 'integrator', 'confirms', 'exponential', 'growth', 'of', 'random', 'initial', 'perturbations', 'of', 'the', 'peregrine', 'breather']]
|
[-0.24067756193172601, 0.06939985021534893, -0.12633660262864496, 0.05060914394626808, -0.06486006629032394, -0.1108060516210066, -0.04356068288260657, 0.30259861583407555, -0.24766343736814128, -0.1463184041954163, 0.17286258282320988, -0.25154128678970866, -0.20733868880456108, 0.22542144702747463, 0.04986998775663475, 0.13616935232292032, 0.10679323756808622, 0.015574023932115072, -0.06054553670756933, -0.21267703130013413, 0.36027042088616223, 0.008220223006274965, 0.23249746592353202, -0.03514185127698713, 0.11551299883673588, -0.018219662320593164, -0.004241388939489197, -0.07283595438218779, -0.14327563844894434, 0.08159327679313719, 0.18721097850082313, 0.04164521204074845, 0.29694013028509086, -0.43026342029786774, -0.20907058218080138, 0.06069066191299094, 0.23186077627663812, 0.1741596990161472, -0.02492341248920032, -0.33221863332308, 0.07022996496072867, -0.1565557255192996, -0.27510405778367486, -0.09028383621739017, 0.0362960728092326, 0.15094410149807422, -0.2581559133508967, 0.15228420566094833, 0.08090842017490003, -0.009724034239641494, -0.13973649766929966, -0.04300697545598572, -0.1046816947352555, -0.004387673363089562, 0.06383578753254066, -0.09108145603806608, 0.03327875283753706, -0.091835493221879, -0.09374314895313647, 0.38203648841267246, -0.1390634165223067, -0.2530176065241297, 0.11420952000965674, -0.11045797956693504, -0.034845579713065594, 0.16400757996080856, 0.16140036458253032, 0.14904552344232797, -0.06938788764592674, 0.10058950840223892, -0.036116633297772045, 0.19976000841706992, 0.16599919396556087, 0.04089223181621896, 0.14192295420087045, 0.16329404276071324, 0.07822359684368065, 0.17607171984596384, -0.0016047452084927095, -0.15835495133780772, -0.31609921341554986, -0.07920835677440563, -0.19362709901502562, 0.06579917452893116, -0.16079883445555526, -0.2795735345635977, 0.4666676278743479, 0.05227537573211723, 0.12117681102827191, 0.08085996971155206, 0.24491448731989496, 0.2608118600703569, -0.060235447112386785, 0.035464529435962, 0.22586781913414597, 0.19555849079042673, 0.10395526357202066, -0.3008533918350521, -0.05029331791318125, 0.13035648571741248]
|
1,803.06585
|
Learning Long Term Dependencies via Fourier Recurrent Units
|
It is a known fact that training recurrent neural networks for tasks that
have long term dependencies is challenging. One of the main reasons is the
vanishing or exploding gradient problem, which prevents gradient information
from propagating to early layers. In this paper we propose a simple recurrent
architecture, the Fourier Recurrent Unit (FRU), that stabilizes the gradients
that arise in its training while giving us stronger expressive power.
Specifically, FRU summarizes the hidden states $h^{(t)}$ along the temporal
dimension with Fourier basis functions. This allows gradients to easily reach
any layer due to FRU's residual learning structure and the global support of
trigonometric functions. We show that FRU has gradient lower and upper bounds
independent of temporal dimension. We also show the strong expressivity of
sparse Fourier basis, from which FRU obtains its strong expressive power. Our
experimental study also demonstrates that with fewer parameters the proposed
architecture outperforms other recurrent architectures on many tasks.
|
cs.LG stat.ML
|
it is a known fact that training recurrent neural networks for tasks that have long term dependencies is challenging one of the main reasons is the vanishing or exploding gradient problem which prevents gradient information from propagating to early layers in this paper we propose a simple recurrent architecture the fourier recurrent unit fru that stabilizes the gradients that arise in its training while giving us stronger expressive power specifically fru summarizes the hidden states ht along the temporal dimension with fourier basis functions this allows gradients to easily reach any layer due to frus residual learning structure and the global support of trigonometric functions we show that fru has gradient lower and upper bounds independent of temporal dimension we also show the strong expressivity of sparse fourier basis from which fru obtains its strong expressive power our experimental study also demonstrates that with fewer parameters the proposed architecture outperforms other recurrent architectures on many tasks
|
[['it', 'is', 'a', 'known', 'fact', 'that', 'training', 'recurrent', 'neural', 'networks', 'for', 'tasks', 'that', 'have', 'long', 'term', 'dependencies', 'is', 'challenging', 'one', 'of', 'the', 'main', 'reasons', 'is', 'the', 'vanishing', 'or', 'exploding', 'gradient', 'problem', 'which', 'prevents', 'gradient', 'information', 'from', 'propagating', 'to', 'early', 'layers', 'in', 'this', 'paper', 'we', 'propose', 'a', 'simple', 'recurrent', 'architecture', 'the', 'fourier', 'recurrent', 'unit', 'fru', 'that', 'stabilizes', 'the', 'gradients', 'that', 'arise', 'in', 'its', 'training', 'while', 'giving', 'us', 'stronger', 'expressive', 'power', 'specifically', 'fru', 'summarizes', 'the', 'hidden', 'states', 'ht', 'along', 'the', 'temporal', 'dimension', 'with', 'fourier', 'basis', 'functions', 'this', 'allows', 'gradients', 'to', 'easily', 'reach', 'any', 'layer', 'due', 'to', 'frus', 'residual', 'learning', 'structure', 'and', 'the', 'global', 'support', 'of', 'trigonometric', 'functions', 'we', 'show', 'that', 'fru', 'has', 'gradient', 'lower', 'and', 'upper', 'bounds', 'independent', 'of', 'temporal', 'dimension', 'we', 'also', 'show', 'the', 'strong', 'expressivity', 'of', 'sparse', 'fourier', 'basis', 'from', 'which', 'fru', 'obtains', 'its', 'strong', 'expressive', 'power', 'our', 'experimental', 'study', 'also', 'demonstrates', 'that', 'with', 'fewer', 'parameters', 'the', 'proposed', 'architecture', 'outperforms', 'other', 'recurrent', 'architectures', 'on', 'many', 'tasks']]
|
[-0.1179178558980986, 0.06292232427625886, -0.0711237124227468, 0.060382688782298036, -0.13864904501505437, -0.1662699582235467, 0.027921587465361, 0.4296567416779937, -0.32383303008973596, -0.2518049073555777, 0.07904129656362197, -0.23460186618810233, -0.21370819681023637, 0.1885747783265317, -0.08216501148117165, 0.052593699325206536, 0.10051752986055949, 0.048358766803698196, -0.09197450560487566, -0.27597421044633996, 0.2883222172397279, 0.039527456761307776, 0.3139612873084843, 0.02158097574907926, 0.13035418376506816, -0.04833234005096939, 0.015027325414872218, -0.028193453006115893, -0.026626973753821316, 0.17682549700689232, 0.21786504230732398, 0.16202850736440122, 0.3108813545231016, -0.44602479828942204, -0.2599442936132677, 0.10934795209041406, 0.15747085651082376, 0.07923378503070243, -0.02019279068110571, -0.2431493965593437, 0.10494000939351897, -0.15157499531727103, -0.0448707462048098, -0.15001575976099457, 0.0011174991396406004, 0.02945314952465255, -0.2943564101726928, 0.0787614545563326, 0.1531090738912744, 0.029415130350671167, -0.0410859729369892, -0.12733315141315782, -0.019444983183676677, 0.1304623280321398, 0.05510389871384588, 0.07376637069223028, 0.08595980259499723, -0.14395960814830278, -0.1047361999757648, 0.28714773246357517, -0.0764002154776526, -0.19042280083822627, 0.21999054708848556, -0.11204657001240599, -0.1754994207872979, 0.08422586806719341, 0.1936602041065212, 0.09575793724234832, -0.1152674107710951, 0.07330229322561213, -0.05901218137793964, 0.21002624773330267, 0.054533036774204624, 0.06074534908327604, 0.1445893199002791, 0.1921560362221733, 0.10014855026590427, 0.17858906247720663, -0.09989755359335592, -0.07769589848936566, -0.2453631366452863, -0.10316634752427138, -0.17460825403461294, 0.0022876875828050317, -0.12278960238101952, -0.1729271360995969, 0.4226790317304192, 0.18542127807534511, 0.22191802464977597, 0.14422261965941757, 0.35307009892402996, 0.09665349966831385, 0.15426276672871844, 0.13913855709345832, 0.20039980912340744, 0.10707832403000324, 0.13169559103196427, -0.18018114167235552, 0.09881333895853811, 0.07656510948173462]
|
1,803.06586
|
Structural query-by-committee
|
In this work, we describe a framework that unifies many different interactive
learning tasks. We present a generalization of the {\it query-by-committee}
active learning algorithm for this setting, and we study its consistency and
rate of convergence, both theoretically and empirically, with and without
noise.
|
cs.LG stat.ML
|
in this work we describe a framework that unifies many different interactive learning tasks we present a generalization of the it querybycommittee active learning algorithm for this setting and we study its consistency and rate of convergence both theoretically and empirically with and without noise
|
[['in', 'this', 'work', 'we', 'describe', 'a', 'framework', 'that', 'unifies', 'many', 'different', 'interactive', 'learning', 'tasks', 'we', 'present', 'a', 'generalization', 'of', 'the', 'it', 'querybycommittee', 'active', 'learning', 'algorithm', 'for', 'this', 'setting', 'and', 'we', 'study', 'its', 'consistency', 'and', 'rate', 'of', 'convergence', 'both', 'theoretically', 'and', 'empirically', 'with', 'and', 'without', 'noise']]
|
[-0.045764471362862325, 0.013200121600594786, -0.11913953156520923, 0.07793912878777418, -0.04714581196506818, -0.13511572737350233, 0.07691293281709982, 0.44440126419067383, -0.2507446936331689, -0.32606225046846604, 0.08478055565048837, -0.1884689899575379, -0.26094374880194665, 0.2067775577927629, -0.12700278705192936, 0.07896559937831221, 0.07086024427165588, 0.00696837566792965, -0.050320015728680625, -0.2763981745319648, 0.3038400283911162, 0.0384240053801073, 0.30519686652243966, 0.03439240807460414, 0.15401260887997018, 0.035501274093985555, -0.007655639128966464, 0.04149997869713439, -0.14488941781407144, 0.17402574216636518, 0.2505751254657904, 0.2149491178492705, 0.3508698473374049, -0.34760772701766757, -0.2104301642212603, 0.1350865287706256, 0.15021201067914566, 0.13038055751886632, -0.09996696095913649, -0.25666415616869925, 0.10422911739183796, -0.20024833919273483, -0.007359047854940097, -0.17122432887554168, -0.04470532925592528, -0.003614902501511905, -0.28370300461020737, 0.048959168998731505, 0.15796645457545916, 0.061993322812809816, -0.07275617156022539, -0.04320385797570149, 0.11910846738351716, 0.14098049702329768, 0.07927736139131916, 0.01257671000332468, 0.09607541291043162, -0.15688312905323173, -0.15507745544115703, 0.3256113599985838, -0.07164080056051413, -0.198973790406146, 0.24330894044703907, -0.0619888945741372, -0.1971136589638061, 0.028925601434376506, 0.23383568566706445, 0.1707781176496711, -0.15018926871319613, 0.08493919137140943, -0.06772315237257216, 0.10117683477906717, 0.01515890452493396, 0.029775394571738112, 0.10667045700053374, 0.24778160823302137, 0.041594482005004665, 0.17945211888808343, -0.07094244468543265, -0.10138793571127785, -0.2802418134899603, -0.17610728074279097, -0.14354879615517954, -0.04011632568306393, -0.09600598144526076, -0.10900265192613005, 0.41049930140790014, 0.2512139666101171, 0.21949375778850583, 0.15495212386465734, 0.35900410535848803, 0.05151462399711212, -0.0038598273078807527, 0.14026785855078036, 0.21149382145247525, 0.0850670471166571, 0.13092572908434602, -0.2261774122947827, 0.051622138524221046, 0.01919637109256453]
|
1,803.06587
|
Comparative Study of Approximate Multipliers
|
Approximate multipliers are widely being advocated for energy-efficient
computing in applications that exhibit an inherent tolerance to inaccuracy.
However, the inclusion of accuracy as a key design parameter, besides the
performance, area and power, makes the identification of the most suitable
approximate multiplier quite challenging. In this paper, we identify three
major decision making factors for the selection of an approximate multipliers
circuit: (1) the type of approximate full adder (FA) used to construct the
multiplier, (2) the architecture, i.e., array or tree, of the multiplier and
(3) the placement of sub-modules of approximate and exact multipliers in the
main multiplier module. Based on these factors, we explored the design space
for circuit level implementations of approximate multipliers. We used circuit
level implementations of some of the most widely used approximate full adders,
i.e., approximate mirror adders, XOR/XNOR based approximate full adders and
Inexact adder cell. These FA cells are then used to develop circuits for the
approximate high order compressors as building blocks for 8x8 array and tree
multipliers. We then develop various implementations of higher bit multipliers
by using a combination of exact and inaccurate 8x8 multiplier cells. All these
implementations have been done using the Cadence's Spectre tool with the
TSMC65nm technology. The design space of these multipliers is explored based on
their power, area, delay and error and the best approximate multiplier designs
are identified. The report also presents the validation of our results using an
image blending application. An open source library of implemented cells and
multiplier circuits are available online.
|
cs.ET
|
approximate multipliers are widely being advocated for energyefficient computing in applications that exhibit an inherent tolerance to inaccuracy however the inclusion of accuracy as a key design parameter besides the performance area and power makes the identification of the most suitable approximate multiplier quite challenging in this paper we identify three major decision making factors for the selection of an approximate multipliers circuit 1 the type of approximate full adder fa used to construct the multiplier 2 the architecture ie array or tree of the multiplier and 3 the placement of submodules of approximate and exact multipliers in the main multiplier module based on these factors we explored the design space for circuit level implementations of approximate multipliers we used circuit level implementations of some of the most widely used approximate full adders ie approximate mirror adders xorxnor based approximate full adders and inexact adder cell these fa cells are then used to develop circuits for the approximate high order compressors as building blocks for 8x8 array and tree multipliers we then develop various implementations of higher bit multipliers by using a combination of exact and inaccurate 8x8 multiplier cells all these implementations have been done using the cadences spectre tool with the tsmc65nm technology the design space of these multipliers is explored based on their power area delay and error and the best approximate multiplier designs are identified the report also presents the validation of our results using an image blending application an open source library of implemented cells and multiplier circuits are available online
|
[['approximate', 'multipliers', 'are', 'widely', 'being', 'advocated', 'for', 'energyefficient', 'computing', 'in', 'applications', 'that', 'exhibit', 'an', 'inherent', 'tolerance', 'to', 'inaccuracy', 'however', 'the', 'inclusion', 'of', 'accuracy', 'as', 'a', 'key', 'design', 'parameter', 'besides', 'the', 'performance', 'area', 'and', 'power', 'makes', 'the', 'identification', 'of', 'the', 'most', 'suitable', 'approximate', 'multiplier', 'quite', 'challenging', 'in', 'this', 'paper', 'we', 'identify', 'three', 'major', 'decision', 'making', 'factors', 'for', 'the', 'selection', 'of', 'an', 'approximate', 'multipliers', 'circuit', '1', 'the', 'type', 'of', 'approximate', 'full', 'adder', 'fa', 'used', 'to', 'construct', 'the', 'multiplier', '2', 'the', 'architecture', 'ie', 'array', 'or', 'tree', 'of', 'the', 'multiplier', 'and', '3', 'the', 'placement', 'of', 'submodules', 'of', 'approximate', 'and', 'exact', 'multipliers', 'in', 'the', 'main', 'multiplier', 'module', 'based', 'on', 'these', 'factors', 'we', 'explored', 'the', 'design', 'space', 'for', 'circuit', 'level', 'implementations', 'of', 'approximate', 'multipliers', 'we', 'used', 'circuit', 'level', 'implementations', 'of', 'some', 'of', 'the', 'most', 'widely', 'used', 'approximate', 'full', 'adders', 'ie', 'approximate', 'mirror', 'adders', 'xorxnor', 'based', 'approximate', 'full', 'adders', 'and', 'inexact', 'adder', 'cell', 'these', 'fa', 'cells', 'are', 'then', 'used', 'to', 'develop', 'circuits', 'for', 'the', 'approximate', 'high', 'order', 'compressors', 'as', 'building', 'blocks', 'for', '8x8', 'array', 'and', 'tree', 'multipliers', 'we', 'then', 'develop', 'various', 'implementations', 'of', 'higher', 'bit', 'multipliers', 'by', 'using', 'a', 'combination', 'of', 'exact', 'and', 'inaccurate', '8x8', 'multiplier', 'cells', 'all', 'these', 'implementations', 'have', 'been', 'done', 'using', 'the', 'cadences', 'spectre', 'tool', 'with', 'the', 'tsmc65nm', 'technology', 'the', 'design', 'space', 'of', 'these', 'multipliers', 'is', 'explored', 'based', 'on', 'their', 'power', 'area', 'delay', 'and', 'error', 'and', 'the', 'best', 'approximate', 'multiplier', 'designs', 'are', 'identified', 'the', 'report', 'also', 'presents', 'the', 'validation', 'of', 'our', 'results', 'using', 'an', 'image', 'blending', 'application', 'an', 'open', 'source', 'library', 'of', 'implemented', 'cells', 'and', 'multiplier', 'circuits', 'are', 'available', 'online']]
|
[-0.11252000322770875, -0.02407243365134277, -0.0054928233737454694, 0.05194338207297465, -0.05931300114949836, -0.1653877348401675, 0.044710745151592964, 0.42167780072081323, -0.25589605376727004, -0.2990081296978044, 0.18062055219083514, -0.20178296383579863, -0.13571771840272728, 0.25187196298319775, -0.0680467553135446, 0.14305531054954318, 0.025318366678559457, -0.0049283464621825545, -0.10652509270950367, -0.25790028393852943, 0.2364972858580158, 0.09606449275880176, 0.29970966971972407, -0.03680278156683141, 0.13546633694558313, -0.014346478786319495, -0.038837499124244515, -0.027230438832239266, -0.09071853152198338, 0.1677189496174619, 0.2852668081218486, 0.15924376176542365, 0.2724888961780451, -0.4712714113404646, -0.12570596208668078, 0.077648525239498, 0.17656289154901078, 0.05189758899493837, -0.07665416620872623, -0.21843489269114227, 0.13461990162145857, -0.19951053722681678, -0.0758169430716639, -0.09128182691364439, -0.017960698164853395, 0.07488958213761376, -0.28558671035822114, -0.02342388692560752, 0.04477681825302687, 0.042849859162507685, -0.016257991576019454, -0.19868050804179088, 0.07163438213779134, 0.1403032477223771, -0.04550649929499509, -0.005765921386716632, 0.15115756170148506, -0.07185638634506247, -0.168391749921127, 0.324959733293337, 0.01203041505296806, -0.24233972337964338, 0.15201517256506372, -0.031452965626137, -0.10877989690531703, 0.09784538896900474, 0.1647418185374608, 0.08957085875684724, -0.15684082016449274, 0.10314011067567466, 0.019479093792181754, 0.19099923930696996, 0.08420161277000957, 0.05098273008696589, 0.13093675342844982, 0.1852137943665844, 0.10188838133277993, 0.13237131798820223, -0.10139785111315694, -0.04594480975841483, -0.2920199473552844, -0.18799098687264704, -0.1593100146541153, -0.013750749404596932, -0.07575555617559254, -0.19558196706953002, 0.4311657516358822, 0.19323093020539803, 0.11503997680950252, 0.0695070163912925, 0.34569605336177583, 0.11491400112772324, 0.11994228901469386, 0.09752989502021056, 0.1907593034487446, 0.13749292249809586, 0.06056732126356413, -0.18501711349167368, 0.028820951965034886, 0.1253639513097119]
|
1,803.06588
|
Cultural Evolution of Categorization
|
Categorization is a fundamental function of minds, with wide ranging
implications for the rest of the cognitive system. In humans, categories are
shared and communicated between minds, thus requiring explanations at the
population level. In this paper, we discuss the current state of research on
the cultural evolution of categorization. We begin by delineating key
properties of categories in need of evolutionary explanation. We then review
computational modeling and laboratory studies of category evolution, including
their major insights and limitations. Finally, we discuss remaining challenges
for understanding the cultural evolution of categorization.
|
physics.soc-ph
|
categorization is a fundamental function of minds with wide ranging implications for the rest of the cognitive system in humans categories are shared and communicated between minds thus requiring explanations at the population level in this paper we discuss the current state of research on the cultural evolution of categorization we begin by delineating key properties of categories in need of evolutionary explanation we then review computational modeling and laboratory studies of category evolution including their major insights and limitations finally we discuss remaining challenges for understanding the cultural evolution of categorization
|
[['categorization', 'is', 'a', 'fundamental', 'function', 'of', 'minds', 'with', 'wide', 'ranging', 'implications', 'for', 'the', 'rest', 'of', 'the', 'cognitive', 'system', 'in', 'humans', 'categories', 'are', 'shared', 'and', 'communicated', 'between', 'minds', 'thus', 'requiring', 'explanations', 'at', 'the', 'population', 'level', 'in', 'this', 'paper', 'we', 'discuss', 'the', 'current', 'state', 'of', 'research', 'on', 'the', 'cultural', 'evolution', 'of', 'categorization', 'we', 'begin', 'by', 'delineating', 'key', 'properties', 'of', 'categories', 'in', 'need', 'of', 'evolutionary', 'explanation', 'we', 'then', 'review', 'computational', 'modeling', 'and', 'laboratory', 'studies', 'of', 'category', 'evolution', 'including', 'their', 'major', 'insights', 'and', 'limitations', 'finally', 'we', 'discuss', 'remaining', 'challenges', 'for', 'understanding', 'the', 'cultural', 'evolution', 'of', 'categorization']]
|
[-0.07497867500490468, 0.06790041182514119, -0.06036706673204089, 0.08278975030913463, -0.10388336310406095, -0.09587729696447597, 0.06513748938627743, 0.38253965265745216, -0.2916158972631978, -0.36701735715462785, 0.08276070070417557, -0.23595797452245557, -0.17344188882523906, 0.16503409051295856, -0.12332583428613599, -0.02078046524927587, 0.08149849855260033, 0.01732347033786304, -0.05060947127134094, -0.22797506609450743, 0.39943029375686107, 0.04489874526473653, 0.2924029458638119, 0.07506414861215846, 0.07146343055343174, -0.037691313054655555, -0.12325114268890541, -0.036872377659639584, -0.11683784876114932, 0.16989828398167764, 0.32927244784229476, 0.24312860129461827, 0.3659231831919422, -0.45056813580753363, -0.19470512381825678, 0.07184726270877392, 0.1721130530906679, 0.10362525177998064, -0.0633143308944494, -0.3127399037551621, 0.0400726530984368, -0.18790662299294997, -0.09107188759472869, -0.04819829590902056, 0.05981317923768707, 0.023359129154730752, -0.1305349498744244, 0.020842007239875587, 0.059333462569275464, 0.14250710977079428, -0.13808493494845764, -0.14423524010192562, 0.027500120619230944, 0.23747453313705552, 0.07468528131215388, -0.04207747462477646, 0.143192555393477, -0.2600882723446652, -0.15691848533005331, 0.40458485684560047, 0.005495864826472192, -0.13538475304275102, 0.2576664213999681, -0.13375674456904602, -0.19194028267900096, 0.020205359805992845, 0.1948630447175516, 0.040950784009233444, -0.1667723056819776, 0.038984556842478923, 0.0020910772677187038, 0.11949788908595624, 0.02725956829406483, 0.07914553160536224, 0.28922688566229265, 0.2905166534018581, -0.027808042506322912, 0.0907523314311655, -0.04713041242971287, -0.13091689870318235, -0.296439906541744, -0.1687536202978505, -0.05853039810798415, 0.04322246514240523, -0.04594163007926039, -0.068946786639888, 0.431240442958053, 0.23247349319053287, 0.15710111185098471, 0.043771141497215824, 0.2741785028382488, 0.029467595204629975, 0.009620829675164397, 0.04694613180649669, 0.18558359487771825, 0.07784170435194898, 0.10996962607453536, -0.19485462325341676, 0.11397474490829905, 0.001954615617211422]
|
1,803.06589
|
Early hospital mortality prediction using vital signals
|
Early hospital mortality prediction is critical as intensivists strive to
make efficient medical decisions about the severely ill patients staying in
intensive care units. As a result, various methods have been developed to
address this problem based on clinical records. However, some of the laboratory
test results are time-consuming and need to be processed. In this paper, we
propose a novel method to predict mortality using features extracted from the
heart signals of patients within the first hour of ICU admission. In order to
predict the risk, quantitative features have been computed based on the heart
rate signals of ICU patients. Each signal is described in terms of 12
statistical and signal-based features. The extracted features are fed into
eight classifiers: decision tree, linear discriminant, logistic regression,
support vector machine (SVM), random forest, boosted trees, Gaussian SVM, and
K-nearest neighborhood (K-NN). To derive insight into the performance of the
proposed method, several experiments have been conducted using the well-known
clinical dataset named Medical Information Mart for Intensive Care III
(MIMIC-III). The experimental results demonstrate the capability of the
proposed method in terms of precision, recall, F1-score, and area under the
receiver operating characteristic curve (AUC). The decision tree classifier
satisfies both accuracy and interpretability better than the other classifiers,
producing an F1-score and AUC equal to 0.91 and 0.93, respectively. It
indicates that heart rate signals can be used for predicting mortality in
patients in the ICU, achieving a comparable performance with existing
predictions that rely on high dimensional features from clinical records which
need to be processed and may contain missing information.
|
cs.LG stat.ML
|
early hospital mortality prediction is critical as intensivists strive to make efficient medical decisions about the severely ill patients staying in intensive care units as a result various methods have been developed to address this problem based on clinical records however some of the laboratory test results are timeconsuming and need to be processed in this paper we propose a novel method to predict mortality using features extracted from the heart signals of patients within the first hour of icu admission in order to predict the risk quantitative features have been computed based on the heart rate signals of icu patients each signal is described in terms of 12 statistical and signalbased features the extracted features are fed into eight classifiers decision tree linear discriminant logistic regression support vector machine svm random forest boosted trees gaussian svm and knearest neighborhood knn to derive insight into the performance of the proposed method several experiments have been conducted using the wellknown clinical dataset named medical information mart for intensive care iii mimiciii the experimental results demonstrate the capability of the proposed method in terms of precision recall f1score and area under the receiver operating characteristic curve auc the decision tree classifier satisfies both accuracy and interpretability better than the other classifiers producing an f1score and auc equal to 091 and 093 respectively it indicates that heart rate signals can be used for predicting mortality in patients in the icu achieving a comparable performance with existing predictions that rely on high dimensional features from clinical records which need to be processed and may contain missing information
|
[['early', 'hospital', 'mortality', 'prediction', 'is', 'critical', 'as', 'intensivists', 'strive', 'to', 'make', 'efficient', 'medical', 'decisions', 'about', 'the', 'severely', 'ill', 'patients', 'staying', 'in', 'intensive', 'care', 'units', 'as', 'a', 'result', 'various', 'methods', 'have', 'been', 'developed', 'to', 'address', 'this', 'problem', 'based', 'on', 'clinical', 'records', 'however', 'some', 'of', 'the', 'laboratory', 'test', 'results', 'are', 'timeconsuming', 'and', 'need', 'to', 'be', 'processed', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'method', 'to', 'predict', 'mortality', 'using', 'features', 'extracted', 'from', 'the', 'heart', 'signals', 'of', 'patients', 'within', 'the', 'first', 'hour', 'of', 'icu', 'admission', 'in', 'order', 'to', 'predict', 'the', 'risk', 'quantitative', 'features', 'have', 'been', 'computed', 'based', 'on', 'the', 'heart', 'rate', 'signals', 'of', 'icu', 'patients', 'each', 'signal', 'is', 'described', 'in', 'terms', 'of', '12', 'statistical', 'and', 'signalbased', 'features', 'the', 'extracted', 'features', 'are', 'fed', 'into', 'eight', 'classifiers', 'decision', 'tree', 'linear', 'discriminant', 'logistic', 'regression', 'support', 'vector', 'machine', 'svm', 'random', 'forest', 'boosted', 'trees', 'gaussian', 'svm', 'and', 'knearest', 'neighborhood', 'knn', 'to', 'derive', 'insight', 'into', 'the', 'performance', 'of', 'the', 'proposed', 'method', 'several', 'experiments', 'have', 'been', 'conducted', 'using', 'the', 'wellknown', 'clinical', 'dataset', 'named', 'medical', 'information', 'mart', 'for', 'intensive', 'care', 'iii', 'mimiciii', 'the', 'experimental', 'results', 'demonstrate', 'the', 'capability', 'of', 'the', 'proposed', 'method', 'in', 'terms', 'of', 'precision', 'recall', 'f1score', 'and', 'area', 'under', 'the', 'receiver', 'operating', 'characteristic', 'curve', 'auc', 'the', 'decision', 'tree', 'classifier', 'satisfies', 'both', 'accuracy', 'and', 'interpretability', 'better', 'than', 'the', 'other', 'classifiers', 'producing', 'an', 'f1score', 'and', 'auc', 'equal', 'to', '091', 'and', '093', 'respectively', 'it', 'indicates', 'that', 'heart', 'rate', 'signals', 'can', 'be', 'used', 'for', 'predicting', 'mortality', 'in', 'patients', 'in', 'the', 'icu', 'achieving', 'a', 'comparable', 'performance', 'with', 'existing', 'predictions', 'that', 'rely', 'on', 'high', 'dimensional', 'features', 'from', 'clinical', 'records', 'which', 'need', 'to', 'be', 'processed', 'and', 'may', 'contain', 'missing', 'information']]
|
[-0.012032970885625322, 0.00030616449263481824, -0.07880401337656309, 0.08581729242507055, -0.10315299591845797, -0.19981823839560037, 0.09105589786297393, 0.4093690751971791, -0.20596336225982584, -0.2971799537212453, 0.1633734996044006, -0.3248859452090816, -0.1259904306653873, 0.23710508314680037, -0.14279377828476567, 0.12095412073340552, 0.1489385927983787, 0.12603636925688141, -0.022450995882119955, -0.34520710517922487, 0.2181739208167632, 0.08059678977099426, 0.3764402294026702, 0.0168641145094049, 0.11315895115133759, -0.0007365074716081828, -0.04115547767292907, -0.012702599500185091, -0.04802503377846344, 0.14488988632970767, 0.37963663503876, 0.22019390398121033, 0.34896839106142635, -0.3961962338482325, -0.2282029393525396, 0.10745528180912876, 0.10177649391743085, 0.03471063084870164, -0.0004739126715745123, -0.32418977557361583, 0.1125186740977064, -0.15168616314150238, -0.015308250179016636, -0.12368069759473198, -0.0624567971339108, -0.018365730068518403, -0.3058625781510509, 0.11444853695077495, -0.012649648537582056, 0.13352114957302297, -0.09673066989550694, -0.18349892127359613, 0.01730245223068028, 0.168438351009297, 0.0626317921418071, 0.07124971961940262, 0.15757262285595283, -0.14371226151787186, -0.15798728768038386, 0.3523182882642985, -0.04174651239292371, -0.17288862620231532, 0.172949421682523, -0.0831642587356383, -0.1279221679153319, 0.12524383667437003, 0.27736096316815234, 0.06394711653666414, -0.19912812415553072, -0.059993473542977495, 0.0398683876566987, 0.17993593716483833, 0.059290407784460895, -0.03327936469621686, 0.17772450760710728, 0.22750077104482103, -0.04712869369563512, 0.10773727688507376, -0.16431889943165334, -0.028640863124391364, -0.19582739409271677, -0.12820474557464814, -0.13650795535490146, -0.004464569854823773, -0.1172994323255217, -0.13840666942996904, 0.38637025791881535, 0.22739718499249523, 0.17380827220284756, 0.09659674301839484, 0.30260195698365144, 0.05745960156680333, 0.11177732170211109, 0.07229094240167498, 0.18697574500313102, 0.03345640512176199, 0.07175764196395931, -0.18032321457276548, 0.14783546846015166, 0.03883336499361819]
|
1,803.0659
|
Cell Decompositions for Rank Two Quiver Grassmannians
|
We prove that all quiver Grassmannians for exceptional representations of a
generalized Kronecker quiver admit a cell decomposition. In the process, we
introduce a class of regular representations which arise as quotients of
consecutive preprojective representations. Cell decompositions for quiver
Grassmannians of these "truncated preprojectives" are also established. We also
provide two natural combinatorial labelings for these cells. On the one hand,
they are labeled by certain subsets of a so-called 2-quiver attached to a
(truncated) preprojective representation. On the other hand, the cells are in
bijection with compatible pairs in a maximal Dyck path as predicted by the
theory of cluster algebras. The natural bijection between these two labelings
gives a geometric explanation for the appearance of Dyck path combinatorics in
the theory of quiver Grassmannians.
|
math.RT math.AG math.RA
|
we prove that all quiver grassmannians for exceptional representations of a generalized kronecker quiver admit a cell decomposition in the process we introduce a class of regular representations which arise as quotients of consecutive preprojective representations cell decompositions for quiver grassmannians of these truncated preprojectives are also established we also provide two natural combinatorial labelings for these cells on the one hand they are labeled by certain subsets of a socalled 2quiver attached to a truncated preprojective representation on the other hand the cells are in bijection with compatible pairs in a maximal dyck path as predicted by the theory of cluster algebras the natural bijection between these two labelings gives a geometric explanation for the appearance of dyck path combinatorics in the theory of quiver grassmannians
|
[['we', 'prove', 'that', 'all', 'quiver', 'grassmannians', 'for', 'exceptional', 'representations', 'of', 'a', 'generalized', 'kronecker', 'quiver', 'admit', 'a', 'cell', 'decomposition', 'in', 'the', 'process', 'we', 'introduce', 'a', 'class', 'of', 'regular', 'representations', 'which', 'arise', 'as', 'quotients', 'of', 'consecutive', 'preprojective', 'representations', 'cell', 'decompositions', 'for', 'quiver', 'grassmannians', 'of', 'these', 'truncated', 'preprojectives', 'are', 'also', 'established', 'we', 'also', 'provide', 'two', 'natural', 'combinatorial', 'labelings', 'for', 'these', 'cells', 'on', 'the', 'one', 'hand', 'they', 'are', 'labeled', 'by', 'certain', 'subsets', 'of', 'a', 'socalled', '2quiver', 'attached', 'to', 'a', 'truncated', 'preprojective', 'representation', 'on', 'the', 'other', 'hand', 'the', 'cells', 'are', 'in', 'bijection', 'with', 'compatible', 'pairs', 'in', 'a', 'maximal', 'dyck', 'path', 'as', 'predicted', 'by', 'the', 'theory', 'of', 'cluster', 'algebras', 'the', 'natural', 'bijection', 'between', 'these', 'two', 'labelings', 'gives', 'a', 'geometric', 'explanation', 'for', 'the', 'appearance', 'of', 'dyck', 'path', 'combinatorics', 'in', 'the', 'theory', 'of', 'quiver', 'grassmannians']]
|
[-0.13766367785818875, 0.1313017854169011, -0.07243119394293535, 0.1022861270611902, -0.12796019307896495, -0.14190901277586818, 0.024970963627099992, 0.38215773540735243, -0.372152140006423, -0.21133539202809334, 0.07150070553459227, -0.23591177555173634, -0.2194954453781247, 0.1659533343464136, -0.19881133323162795, -0.05011254751309752, 0.11463313542306423, 0.09720236453250981, -0.0652285332120373, -0.2565194068532437, 0.37121265423297883, -0.07231908075418324, 0.2521195612878073, -0.03638441746588796, 0.13316337429732084, 0.03177451761811972, -0.033490564309060576, 0.004268559537827969, -0.13566596924728946, 0.20214436373114586, 0.31137472778558734, 0.11148579771176446, 0.15311729506589472, -0.41896234306693075, -0.11785571458935738, 0.1848276538401842, 0.19211837889254094, 0.05702534091565758, -0.020004659574478865, -0.22464069217443466, 0.055711243193596605, -0.18606267843768, -0.10847922905720771, -0.05004299963824451, 0.04307514788210392, 0.050963331051170825, -0.2513821504786611, -0.008333594348747283, 0.07781630184873939, 0.11532739780843258, -0.07510635524988174, -0.1626762482635677, -0.04592629775963724, 0.10889206940308213, -0.06103650834434666, -0.015183344453573227, 0.03978099727630615, -0.1389898519143462, -0.23055179060250522, 0.3495507498309016, 0.05866136414185166, -0.250845620110631, 0.1755761652365327, -0.1653995688520372, -0.19997197922691703, 0.12557107785716654, 0.055547918535768986, 0.1336904076281935, -0.040432330533396454, 0.0962564241886139, -0.1856011278629303, -0.0303790448224172, 0.19095882018283009, 0.038586268494836984, 0.22498993682453874, 0.10564080545678735, 0.03776362237334251, 0.15993955695675685, 0.000608051922172308, -0.08090037072449922, -0.3172735029757023, -0.15707215545699, -0.09076790866535157, 0.07453453356586397, -0.1643258598148823, -0.25337538522481917, 0.3843656780719757, 0.07415114422887564, 0.23148818783462047, 0.17066170284058899, 0.1720599318705499, 0.03696376344375312, 0.1162108000330627, -0.046093498036265376, 0.09277516876161099, 0.2429592826254666, -0.054448020055890084, -0.14086093870550395, -0.03903591841645539, 0.26697427821718156]
|
1,803.06591
|
Recognizing number of communities and detecting community structures in
complex networks
|
Recognizing number of communities and detecting community structures of
complex network are discussed in this paper. As a visual and feasible
algorithm, block model has been successfully applied to detect community
structures in complex network. In order to measure the quality of the block
model, we first define an objective function WQ value. For obtaining block
model B of a network, GSA algorithm is applied to optimize WQ with the help of
random keys. After executing processes AO (Adding Ones) and RO (Removing Ones)
on block model B, the number of communities of a network can be recognized
distinctly. Furthermore, based on the advantage of block model that its sort
order of nodes is in correspondence with sort order of communities, so a new
fuzzy boundary algorithm for detecting community structures is proposed and
successfully applied to some representative networks. Finally, experimental
results demonstrate the feasibility of the proposed algorithm.
|
physics.soc-ph cs.SI
|
recognizing number of communities and detecting community structures of complex network are discussed in this paper as a visual and feasible algorithm block model has been successfully applied to detect community structures in complex network in order to measure the quality of the block model we first define an objective function wq value for obtaining block model b of a network gsa algorithm is applied to optimize wq with the help of random keys after executing processes ao adding ones and ro removing ones on block model b the number of communities of a network can be recognized distinctly furthermore based on the advantage of block model that its sort order of nodes is in correspondence with sort order of communities so a new fuzzy boundary algorithm for detecting community structures is proposed and successfully applied to some representative networks finally experimental results demonstrate the feasibility of the proposed algorithm
|
[['recognizing', 'number', 'of', 'communities', 'and', 'detecting', 'community', 'structures', 'of', 'complex', 'network', 'are', 'discussed', 'in', 'this', 'paper', 'as', 'a', 'visual', 'and', 'feasible', 'algorithm', 'block', 'model', 'has', 'been', 'successfully', 'applied', 'to', 'detect', 'community', 'structures', 'in', 'complex', 'network', 'in', 'order', 'to', 'measure', 'the', 'quality', 'of', 'the', 'block', 'model', 'we', 'first', 'define', 'an', 'objective', 'function', 'wq', 'value', 'for', 'obtaining', 'block', 'model', 'b', 'of', 'a', 'network', 'gsa', 'algorithm', 'is', 'applied', 'to', 'optimize', 'wq', 'with', 'the', 'help', 'of', 'random', 'keys', 'after', 'executing', 'processes', 'ao', 'adding', 'ones', 'and', 'ro', 'removing', 'ones', 'on', 'block', 'model', 'b', 'the', 'number', 'of', 'communities', 'of', 'a', 'network', 'can', 'be', 'recognized', 'distinctly', 'furthermore', 'based', 'on', 'the', 'advantage', 'of', 'block', 'model', 'that', 'its', 'sort', 'order', 'of', 'nodes', 'is', 'in', 'correspondence', 'with', 'sort', 'order', 'of', 'communities', 'so', 'a', 'new', 'fuzzy', 'boundary', 'algorithm', 'for', 'detecting', 'community', 'structures', 'is', 'proposed', 'and', 'successfully', 'applied', 'to', 'some', 'representative', 'networks', 'finally', 'experimental', 'results', 'demonstrate', 'the', 'feasibility', 'of', 'the', 'proposed', 'algorithm']]
|
[-0.11224450354949415, 0.01271657360184084, -0.06524345871681968, 0.03570773327878366, -0.08393115014613917, -0.16263007380078004, 0.06161690670453633, 0.40388296914597355, -0.27738713830709455, -0.3320932875573635, 0.10381761409031848, -0.23993529624926546, -0.21462566554546356, 0.15748925381495307, -0.04903379718967093, 0.09821627533024488, 0.06723495323210954, 0.06972605528309941, 0.018532258124711612, -0.27421145199487607, 0.2970657058308522, 0.07213594937386612, 0.2835507890783871, 0.00321623505714039, 0.07958695427437003, -0.02562251316693922, -0.04067498982573549, 0.072095679724589, -0.05829561326211357, 0.12563741443368295, 0.270648347089688, 0.20267862905903408, 0.2895933040448775, -0.41590138417979083, -0.19901721574366094, 0.13404204625015456, 0.13481327455801267, 0.11480492930238445, -0.02105498412779222, -0.3084277642890811, 0.1490427525496731, -0.1800696295266971, -0.0785332449618727, -0.09909668928012252, -0.0006845696767171224, 0.004183876259873311, -0.2937240228126757, -0.01256352630754312, 0.03837729192028443, 0.017034571804106235, -0.015119377785207083, -0.12092732821746419, 0.017776807006448507, 0.1539980634332945, 0.014001214671103905, 0.033267921957497795, 0.12234247328713536, -0.11759184193331748, -0.1537363224600752, 0.389150766034921, -0.01693277833168395, -0.18085271353212495, 0.1750961090065539, -0.05373538793685535, -0.1608014734989653, 0.10554882319954534, 0.23547308839857578, 0.10870034256018699, -0.1528068776304523, 0.04572921134997159, -0.054619660209088275, 0.17004349210338357, 0.051284672136728965, -0.0006199038680642843, 0.15015783407104513, 0.21704740504423778, 0.0847249292768538, 0.1615464343666099, -0.09354695829407622, -0.07921379826962947, -0.2118044173469146, -0.15730729278177022, -0.20670672447731098, -0.06522711091985305, -0.0998709445411805, -0.14944045810494572, 0.45789313338386517, 0.18594495438970626, 0.19720462270081043, 0.07209024303592741, 0.2678144604510938, 0.048003518239129336, 0.10193636272878696, 0.06329902360681444, 0.17084488150139804, 0.12369309523608535, 0.08276430055188636, -0.1665792620461434, 0.11448624611832202, 0.08710205588644991]
|
1,803.06592
|
Layer structure of irreducible Lie algebra modules
|
Let $\mathfrak{g}$ be a finite-dimensional simple complex Lie algebra. A
layer sum is introduced as the sum of formal exponentials of the distinct
weights appearing in an irreducible $\mathfrak{g}$-module. It is argued that
the character of every finite-dimensional irreducible $\mathfrak{g}$-module
admits a decomposition in terms of layer sums, with only non-negative integer
coefficients. Ensuing results include a new approach to the computation of Weyl
characters and weight multiplicities, and a closed-form expression for the
number of distinct weights in a finite-dimensional irreducible
$\mathfrak{g}$-module. The latter is given by a polynomial in the Dynkin
labels, of degree equal to the rank of $\mathfrak{g}$.
|
math.RT hep-th math-ph math.CO math.MP
|
let mathfrakg be a finitedimensional simple complex lie algebra a layer sum is introduced as the sum of formal exponentials of the distinct weights appearing in an irreducible mathfrakgmodule it is argued that the character of every finitedimensional irreducible mathfrakgmodule admits a decomposition in terms of layer sums with only nonnegative integer coefficients ensuing results include a new approach to the computation of weyl characters and weight multiplicities and a closedform expression for the number of distinct weights in a finitedimensional irreducible mathfrakgmodule the latter is given by a polynomial in the dynkin labels of degree equal to the rank of mathfrakg
|
[['let', 'mathfrakg', 'be', 'a', 'finitedimensional', 'simple', 'complex', 'lie', 'algebra', 'a', 'layer', 'sum', 'is', 'introduced', 'as', 'the', 'sum', 'of', 'formal', 'exponentials', 'of', 'the', 'distinct', 'weights', 'appearing', 'in', 'an', 'irreducible', 'mathfrakgmodule', 'it', 'is', 'argued', 'that', 'the', 'character', 'of', 'every', 'finitedimensional', 'irreducible', 'mathfrakgmodule', 'admits', 'a', 'decomposition', 'in', 'terms', 'of', 'layer', 'sums', 'with', 'only', 'nonnegative', 'integer', 'coefficients', 'ensuing', 'results', 'include', 'a', 'new', 'approach', 'to', 'the', 'computation', 'of', 'weyl', 'characters', 'and', 'weight', 'multiplicities', 'and', 'a', 'closedform', 'expression', 'for', 'the', 'number', 'of', 'distinct', 'weights', 'in', 'a', 'finitedimensional', 'irreducible', 'mathfrakgmodule', 'the', 'latter', 'is', 'given', 'by', 'a', 'polynomial', 'in', 'the', 'dynkin', 'labels', 'of', 'degree', 'equal', 'to', 'the', 'rank', 'of', 'mathfrakg']]
|
[-0.2065452652453792, 0.08577260927367937, -0.07332945007867381, -0.04074315605434023, -0.14210002303269564, -0.16448891411225, -0.0029284112593706917, 0.3207662413992426, -0.35070258196370274, -0.1488442292354782, 0.06112941289229282, -0.22311528370368713, -0.18519556893072292, 0.1446163498524887, -0.09736063933501012, -0.049626233074448856, 0.09584562591843161, 0.17348643937422073, -0.09079726717170036, -0.288264844794849, 0.3645820664789747, -0.04690844673371198, 0.19930062506019192, 0.018697168719133034, 0.19516786369985864, 0.028629986834073185, 0.0008023510431396027, -0.02469182334265069, -0.08666826102361323, 0.1236891698653755, 0.3600266078103553, 0.05804542063817601, 0.25158279582826126, -0.33445625374517085, -0.10476595354175158, 0.2219794753381946, 0.18019366932704167, -0.008742466295028435, 0.05296244131693361, -0.23202612912099735, 0.10305362979096233, -0.24724365437906076, -0.12911163116622643, -0.08104132219016844, 0.0923920935031264, -0.03863471087214409, -0.30920584391181666, 0.05942517395448579, 0.08791766440845095, 0.09742082781432305, -0.09400175342007595, -0.21343175216358812, -0.06868520511574495, 0.07800163923963613, -0.05993249562030256, 0.02803168436466698, 0.039817443609981816, -0.13136064920428336, -0.1662396584071365, 0.36329095305272324, 0.0022400389733614728, -0.29494900199785534, 0.10389244911607866, -0.1535870718322329, -0.13357733837420158, 0.16099472639753537, 0.09206110969934539, 0.11833544607375812, -0.0525972451558154, 0.16363954858046353, -0.14117458424366572, 0.03888310823936527, 0.07764019079360307, -0.0064304637238748515, 0.16434466705986245, 0.05993387968662907, 0.03126255342424117, 0.14062529495647907, 0.04292555293981351, -0.007220602192569012, -0.3628737244061103, -0.19363340314057673, -0.22817639634469708, 0.13265766772240692, -0.1773986482451209, -0.2054578114903587, 0.4424340070827919, 0.01877007241744329, 0.23640926458014577, 0.14042097121002337, 0.21667953453930644, 0.17060966703780545, 0.09832195574206565, 0.06517839102147549, 0.06963815888408206, 0.24122029992377422, -0.0664717059733127, -0.1501668045461616, 0.02750187981947937, 0.22430448775070116]
|
1,803.06593
|
Bulk transport properties of Bismuth selenide thin films approaching the
two-dimensional limit
|
We have investigated the transport properties of topological insulator Bi2Se3
thin films grown using magnetron sputtering with an emphasis on understanding
the behavior as a function of thickness. We show that thickness has a strong
influence on all aspects of transport as the two-dimensional limit is
approached. Bulk resistivity and Hall mobility show disproportionately large
changes below 6 quintuple layer which we directly correlate to an increase in
the bulk band gap of few-layer Bi2Se3, an effect that is concomitant with
surface gap opening. A tendency to crossover from a metallic to an insulating
behavior in temperature-dependent resistivity measurements in ultra-thin Bi2Se3
is also consistent with an increase in the bulk band gap along with enhanced
disorder at the film-substrate interface. Our work highlights that the
properties of few-layer Bi2Se3 are tunable that may be attractive for a variety
of device applications in areas such as optoelectronics, nanoelectronics and
spintronics.
|
cond-mat.mtrl-sci
|
we have investigated the transport properties of topological insulator bi2se3 thin films grown using magnetron sputtering with an emphasis on understanding the behavior as a function of thickness we show that thickness has a strong influence on all aspects of transport as the twodimensional limit is approached bulk resistivity and hall mobility show disproportionately large changes below 6 quintuple layer which we directly correlate to an increase in the bulk band gap of fewlayer bi2se3 an effect that is concomitant with surface gap opening a tendency to crossover from a metallic to an insulating behavior in temperaturedependent resistivity measurements in ultrathin bi2se3 is also consistent with an increase in the bulk band gap along with enhanced disorder at the filmsubstrate interface our work highlights that the properties of fewlayer bi2se3 are tunable that may be attractive for a variety of device applications in areas such as optoelectronics nanoelectronics and spintronics
|
[['we', 'have', 'investigated', 'the', 'transport', 'properties', 'of', 'topological', 'insulator', 'bi2se3', 'thin', 'films', 'grown', 'using', 'magnetron', 'sputtering', 'with', 'an', 'emphasis', 'on', 'understanding', 'the', 'behavior', 'as', 'a', 'function', 'of', 'thickness', 'we', 'show', 'that', 'thickness', 'has', 'a', 'strong', 'influence', 'on', 'all', 'aspects', 'of', 'transport', 'as', 'the', 'twodimensional', 'limit', 'is', 'approached', 'bulk', 'resistivity', 'and', 'hall', 'mobility', 'show', 'disproportionately', 'large', 'changes', 'below', '6', 'quintuple', 'layer', 'which', 'we', 'directly', 'correlate', 'to', 'an', 'increase', 'in', 'the', 'bulk', 'band', 'gap', 'of', 'fewlayer', 'bi2se3', 'an', 'effect', 'that', 'is', 'concomitant', 'with', 'surface', 'gap', 'opening', 'a', 'tendency', 'to', 'crossover', 'from', 'a', 'metallic', 'to', 'an', 'insulating', 'behavior', 'in', 'temperaturedependent', 'resistivity', 'measurements', 'in', 'ultrathin', 'bi2se3', 'is', 'also', 'consistent', 'with', 'an', 'increase', 'in', 'the', 'bulk', 'band', 'gap', 'along', 'with', 'enhanced', 'disorder', 'at', 'the', 'filmsubstrate', 'interface', 'our', 'work', 'highlights', 'that', 'the', 'properties', 'of', 'fewlayer', 'bi2se3', 'are', 'tunable', 'that', 'may', 'be', 'attractive', 'for', 'a', 'variety', 'of', 'device', 'applications', 'in', 'areas', 'such', 'as', 'optoelectronics', 'nanoelectronics', 'and', 'spintronics']]
|
[-0.15042068269103764, 0.1665247351153327, -0.047064065706605714, -0.0682576696629015, -0.04824561822383354, -0.15250278894789518, 0.07779148138128221, 0.4265330726529161, -0.30172083991890153, -0.31698869068796437, 0.01712096930559104, -0.3668675960817685, -0.17291479180101305, 0.24204610702892146, -0.021306897904723884, 0.041415736443838495, -0.040596093106238795, -0.13525081964209676, -0.14622142256237566, -0.17455534326999136, 0.29418188995371264, 0.04599058594554663, 0.36563438369892537, 0.15855856799986212, -0.005732217105105519, -0.04214078865945339, 0.1742042838378499, 0.0717810210150977, -0.18142085443347847, 0.04564985387924632, 0.2626693950640038, -0.18498628094171485, 0.2308096426228682, -0.45637112299601235, -0.2634943188851078, -0.0731005726987496, 0.12897826755264152, 0.10074261078999068, -0.12349428835945825, -0.23070358042915662, 0.11683470842738947, -0.15532183727559945, -0.10030519659863785, -0.059956577317789195, 0.008144746147639428, -0.04775034596600259, -0.19033626960474068, 0.055685252843541096, 0.047882608668878675, 0.12096596295634905, -0.10188674328693499, -0.13550501476352414, -0.13673060139796386, 0.09493208451817434, 0.08490459581371397, 0.04952707570822289, 0.23620488484545302, -0.17132269621516266, -0.10950179542725284, 0.3201102034623424, -0.07428845064714551, -0.0806360029662028, 0.20295631383235255, -0.17696492734365166, -0.05461874128629764, 0.15991963148117067, 0.14755306068963062, 0.09946376762042443, -0.1102582462442418, 0.0700550491324005, -0.03290979004620264, 0.22207430123972396, 0.0414058782843252, 0.12848729895738265, 0.2720858819844822, 0.27217976450920106, 0.06657297561721255, 0.15929659973752375, -0.11477118688169867, 0.05318259572299818, -0.20754329311971864, -0.24647795240705211, -0.25511059602024033, 0.10749234545665483, -0.06333837434940506, -0.23506875863143553, 0.3807554617493103, 0.15191066673103099, 0.18587110576219856, -0.04720573329599574, 0.22109740282098453, 0.10239588931280498, 0.08869832931086422, 0.017873004594196877, 0.2676048111061876, 0.1435151496110484, 0.14249050626696166, -0.24668850584731747, 0.13169394317859162, -0.04458484631652633]
|
1,803.06594
|
Efficient and accurate inversion of multiple scattering with deep
learning
|
Image reconstruction under multiple light scattering is crucial in a number
of applications such as diffraction tomography. The reconstruction problem is
often formulated as a nonconvex optimization, where a nonlinear measurement
model is used to account for multiple scattering and regularization is used to
enforce prior constraints on the object. In this paper, we propose a powerful
alternative to this optimization-based view of image reconstruction by
designing and training a deep convolutional neural network that can invert
multiple scattered measurements to produce a high-quality image of the
refractive index. Our results on both simulated and experimental datasets show
that the proposed approach is substantially faster and achieves higher imaging
quality compared to the state-of-the-art methods based on optimization.
|
cs.CV
|
image reconstruction under multiple light scattering is crucial in a number of applications such as diffraction tomography the reconstruction problem is often formulated as a nonconvex optimization where a nonlinear measurement model is used to account for multiple scattering and regularization is used to enforce prior constraints on the object in this paper we propose a powerful alternative to this optimizationbased view of image reconstruction by designing and training a deep convolutional neural network that can invert multiple scattered measurements to produce a highquality image of the refractive index our results on both simulated and experimental datasets show that the proposed approach is substantially faster and achieves higher imaging quality compared to the stateoftheart methods based on optimization
|
[['image', 'reconstruction', 'under', 'multiple', 'light', 'scattering', 'is', 'crucial', 'in', 'a', 'number', 'of', 'applications', 'such', 'as', 'diffraction', 'tomography', 'the', 'reconstruction', 'problem', 'is', 'often', 'formulated', 'as', 'a', 'nonconvex', 'optimization', 'where', 'a', 'nonlinear', 'measurement', 'model', 'is', 'used', 'to', 'account', 'for', 'multiple', 'scattering', 'and', 'regularization', 'is', 'used', 'to', 'enforce', 'prior', 'constraints', 'on', 'the', 'object', 'in', 'this', 'paper', 'we', 'propose', 'a', 'powerful', 'alternative', 'to', 'this', 'optimizationbased', 'view', 'of', 'image', 'reconstruction', 'by', 'designing', 'and', 'training', 'a', 'deep', 'convolutional', 'neural', 'network', 'that', 'can', 'invert', 'multiple', 'scattered', 'measurements', 'to', 'produce', 'a', 'highquality', 'image', 'of', 'the', 'refractive', 'index', 'our', 'results', 'on', 'both', 'simulated', 'and', 'experimental', 'datasets', 'show', 'that', 'the', 'proposed', 'approach', 'is', 'substantially', 'faster', 'and', 'achieves', 'higher', 'imaging', 'quality', 'compared', 'to', 'the', 'stateoftheart', 'methods', 'based', 'on', 'optimization']]
|
[-0.042276113416399745, -0.022011970264553014, -0.11181950040548345, 0.06653094688485676, -0.09752468472757077, -0.15248569158710917, -0.01001276376448035, 0.44789265171956205, -0.2756244099967308, -0.35655527448250074, 0.11307082578768733, -0.24900960766363067, -0.19900204433065097, 0.2350027477348981, -0.12521520926680227, 0.14614766884311023, 0.11720965817665398, -0.016964890189090018, -0.08195227218034157, -0.2451180586970206, 0.2670829878109744, 0.05655033174301379, 0.35923319717600816, 0.02496575663345708, 0.13117607020757208, 0.056544991198264186, -0.018767814071043946, 0.030162380131206208, -0.03069983568139694, 0.18089972493155876, 0.2980837426700835, 0.17981534158037502, 0.27511507961346565, -0.4395010951211897, -0.2770693182897896, 0.0750831304339029, 0.16862522296891627, 0.09584530298630174, -0.09713665253021043, -0.27471236134800364, 0.07441297536558014, -0.09634441795553696, 0.017845668407725328, -0.12964119304413513, -0.07503150756691851, -0.04723772199792882, -0.3665734084951494, 0.0428209891384941, 0.019533706098889648, -0.003936806608828069, -0.09425272088955645, -0.09675313145222174, 0.04076460965364477, 0.09452271150815758, 0.01021695772079372, 0.09284112508156163, 0.1202809040945702, -0.17375827663956936, -0.1258200642936942, 0.3881250503394058, -0.060748983354642405, -0.2314004748901826, 0.19416090609087466, -0.04060314453633155, -0.117438452657691, 0.1502009705182607, 0.24960335080267199, 0.16165343541809815, -0.14585986206213297, -0.004665947458075391, -0.05968152559993757, 0.18948141480717112, 0.051271030557010384, 0.003454268177955459, 0.13880444600609904, 0.25344149626680984, 0.07339877868465827, 0.15689076734529175, -0.18312867727896232, -0.01548663591492479, -0.21419815510517318, -0.1012438927950748, -0.21573235489372797, 0.013980003133005762, -0.09793002072325119, -0.14997795655123763, 0.39647591216647526, 0.24114094964638985, 0.2183560846586538, 0.06305198668170783, 0.42114697245217986, 0.08532592419227111, 0.10161475446548755, 0.024915090829165557, 0.22816969495329817, 0.07137217652249955, 0.11447282954784094, -0.19218171230848816, 0.06858768669288542, 0.04165431335607891]
|
1,803.06595
|
New Nanoporous Graphyne Monolayer as Nodal Line Semimetal: Double Dirac
Points with an Ultrahigh Fermi Velocity
|
Two-dimensional (2D) carbon materials play an important role in
nanomaterials. We propose a new carbon monolayer, named
hexagonal-4,4,4-graphyne (H4,4,4-graphyne), which is a nanoporous structure
composed of rectangular carbon rings and triple bonds of carbon. Using
first-principles calculations, we systematically studied the structure,
stability, and band structure of this new material. We found that its energy is
much lower than that of some experimental carbon materials and it is stable at
least up to 1500 K. In contrast to the single Dirac point band structure of
other 2D carbon monolayers, the band structure of H4,4,4-graphyne exhibits
double Dirac points along the high symmetry points and the corresponding Fermi
velocities (1.04~1.27 * 106 m/s) are asymmetric and higher than that of
graphene. The origin of these double Dirac points is traced back to the nodal
line states, which can be well explained by a tight-binding model. The
H4,4,4-graphyne forms a moir\'e superstructure when placed on top of a BN
substrate, while keeping the double Dirac points. These properties make
H4,4,4-graphyne a promising semimetal material for applications in high-speed
electronic devices.
|
cond-mat.mtrl-sci
|
twodimensional 2d carbon materials play an important role in nanomaterials we propose a new carbon monolayer named hexagonal444graphyne h444graphyne which is a nanoporous structure composed of rectangular carbon rings and triple bonds of carbon using firstprinciples calculations we systematically studied the structure stability and band structure of this new material we found that its energy is much lower than that of some experimental carbon materials and it is stable at least up to 1500 k in contrast to the single dirac point band structure of other 2d carbon monolayers the band structure of h444graphyne exhibits double dirac points along the high symmetry points and the corresponding fermi velocities 104127 106 ms are asymmetric and higher than that of graphene the origin of these double dirac points is traced back to the nodal line states which can be well explained by a tightbinding model the h444graphyne forms a moire superstructure when placed on top of a bn substrate while keeping the double dirac points these properties make h444graphyne a promising semimetal material for applications in highspeed electronic devices
|
[['twodimensional', '2d', 'carbon', 'materials', 'play', 'an', 'important', 'role', 'in', 'nanomaterials', 'we', 'propose', 'a', 'new', 'carbon', 'monolayer', 'named', 'hexagonal444graphyne', 'h444graphyne', 'which', 'is', 'a', 'nanoporous', 'structure', 'composed', 'of', 'rectangular', 'carbon', 'rings', 'and', 'triple', 'bonds', 'of', 'carbon', 'using', 'firstprinciples', 'calculations', 'we', 'systematically', 'studied', 'the', 'structure', 'stability', 'and', 'band', 'structure', 'of', 'this', 'new', 'material', 'we', 'found', 'that', 'its', 'energy', 'is', 'much', 'lower', 'than', 'that', 'of', 'some', 'experimental', 'carbon', 'materials', 'and', 'it', 'is', 'stable', 'at', 'least', 'up', 'to', '1500', 'k', 'in', 'contrast', 'to', 'the', 'single', 'dirac', 'point', 'band', 'structure', 'of', 'other', '2d', 'carbon', 'monolayers', 'the', 'band', 'structure', 'of', 'h444graphyne', 'exhibits', 'double', 'dirac', 'points', 'along', 'the', 'high', 'symmetry', 'points', 'and', 'the', 'corresponding', 'fermi', 'velocities', '104127', '106', 'ms', 'are', 'asymmetric', 'and', 'higher', 'than', 'that', 'of', 'graphene', 'the', 'origin', 'of', 'these', 'double', 'dirac', 'points', 'is', 'traced', 'back', 'to', 'the', 'nodal', 'line', 'states', 'which', 'can', 'be', 'well', 'explained', 'by', 'a', 'tightbinding', 'model', 'the', 'h444graphyne', 'forms', 'a', 'moire', 'superstructure', 'when', 'placed', 'on', 'top', 'of', 'a', 'bn', 'substrate', 'while', 'keeping', 'the', 'double', 'dirac', 'points', 'these', 'properties', 'make', 'h444graphyne', 'a', 'promising', 'semimetal', 'material', 'for', 'applications', 'in', 'highspeed', 'electronic', 'devices']]
|
[-0.16401529527934533, 0.11605932997281862, -0.031188569281782423, 0.005756676192062774, -0.026462184863963296, -0.17294760977051088, 0.12301258835409369, 0.42999527149235034, -0.2769736174241241, -0.27584986214392954, 0.01211744688251721, -0.32975979711328235, -0.16933895211001593, 0.16000631677585522, 0.0395988509883838, 0.026000719985459, 0.03753989277274481, -0.058927852476813966, -0.11195292404852808, -0.2006822341534176, 0.27200530448263244, 0.058644182482800844, 0.30344277635881944, 0.05870831091721941, 0.014842848188376853, -0.04157561500290675, 0.11501988525369337, 0.013674127605876753, -0.12285491350967537, 0.14428424362725178, 0.207430913117049, -0.1152932557596692, 0.19444758227494147, -0.45515206587633916, -0.21073244495583432, -0.009547974080113429, 0.13505894844021116, 0.09661921830315676, -0.08669520922337792, -0.24930669979325362, 0.11692789754098547, -0.12591358573841196, -0.16274237442354206, -0.04036447009869984, -0.010379034655966929, -0.016613542044069618, -0.16601899924588256, 0.044617619714034454, 0.017780308493945216, 0.058697208147121795, -0.07514667577950085, -0.1742248328901561, -0.14351190236397088, 0.051796470768250794, -0.005827102510125509, 0.0018012867069670132, 0.1691567991121805, -0.10704365134904427, -0.08697942857231412, 0.4796877601529871, -0.05205467736697756, -0.10265540937760047, 0.17738649057856362, -0.14995094380607563, -0.10562567061877677, 0.1859635889184262, 0.12186307822586968, 0.10982844504660794, -0.13282945989963732, 0.07172989632634978, -0.06253980889600436, 0.13048520783311687, 0.0832674334517547, 0.06981356174418969, 0.2958184045313724, 0.21417955951898227, 0.05823617693036795, 0.10940166628620188, -0.14636558723902063, -0.03797055958238031, -0.21073957646265626, -0.22280441315711608, -0.18357130631804466, 0.07639656813565775, -0.07218188650332324, -0.22986680682748556, 0.4338468322796481, 0.07019841334383403, 0.21676758995678808, -0.08141129972546228, 0.209553877442543, 0.09451889342761466, 0.11383041485345789, 0.031173987362001623, 0.2291382237452282, 0.1477134426696492, 0.07523281003880714, -0.164019234573269, 0.03246713522555573, 0.02147469534139548]
|
1,803.06596
|
Network Service Orchestration: A Survey
|
Business models of network service providers are undergoing an evolving
transformation fueled by vertical customer demands and technological advances
such as 5G, Software Defined Networking~(SDN), and Network Function
Virtualization~(NFV). Emerging scenarios call for agile network services
consuming network, storage, and compute resources across heterogeneous
infrastructures and administrative domains. Coordinating resource control and
service creation across interconnected domains and diverse technologies becomes
a grand challenge. Research and development efforts are being devoted to
enabling orchestration processes to automate, coordinate, and manage the
deployment and operation of network services. In this survey, we delve into the
topic of Network Service Orchestration~(NSO) by reviewing the historical
background, relevant research projects, enabling technologies, and
standardization activities. We define key concepts and propose a taxonomy of
NSO approaches and solutions to pave the way towards a common understanding of
the various ongoing efforts around the realization of diverse NSO application
scenarios. Based on the analysis of the state of affairs, we present a series
of open challenges and research opportunities, altogether contributing to a
timely and comprehensive survey on the vibrant and strategic topic of network
service orchestration.
|
cs.NI
|
business models of network service providers are undergoing an evolving transformation fueled by vertical customer demands and technological advances such as 5g software defined networkingsdn and network function virtualizationnfv emerging scenarios call for agile network services consuming network storage and compute resources across heterogeneous infrastructures and administrative domains coordinating resource control and service creation across interconnected domains and diverse technologies becomes a grand challenge research and development efforts are being devoted to enabling orchestration processes to automate coordinate and manage the deployment and operation of network services in this survey we delve into the topic of network service orchestrationnso by reviewing the historical background relevant research projects enabling technologies and standardization activities we define key concepts and propose a taxonomy of nso approaches and solutions to pave the way towards a common understanding of the various ongoing efforts around the realization of diverse nso application scenarios based on the analysis of the state of affairs we present a series of open challenges and research opportunities altogether contributing to a timely and comprehensive survey on the vibrant and strategic topic of network service orchestration
|
[['business', 'models', 'of', 'network', 'service', 'providers', 'are', 'undergoing', 'an', 'evolving', 'transformation', 'fueled', 'by', 'vertical', 'customer', 'demands', 'and', 'technological', 'advances', 'such', 'as', '5g', 'software', 'defined', 'networkingsdn', 'and', 'network', 'function', 'virtualizationnfv', 'emerging', 'scenarios', 'call', 'for', 'agile', 'network', 'services', 'consuming', 'network', 'storage', 'and', 'compute', 'resources', 'across', 'heterogeneous', 'infrastructures', 'and', 'administrative', 'domains', 'coordinating', 'resource', 'control', 'and', 'service', 'creation', 'across', 'interconnected', 'domains', 'and', 'diverse', 'technologies', 'becomes', 'a', 'grand', 'challenge', 'research', 'and', 'development', 'efforts', 'are', 'being', 'devoted', 'to', 'enabling', 'orchestration', 'processes', 'to', 'automate', 'coordinate', 'and', 'manage', 'the', 'deployment', 'and', 'operation', 'of', 'network', 'services', 'in', 'this', 'survey', 'we', 'delve', 'into', 'the', 'topic', 'of', 'network', 'service', 'orchestrationnso', 'by', 'reviewing', 'the', 'historical', 'background', 'relevant', 'research', 'projects', 'enabling', 'technologies', 'and', 'standardization', 'activities', 'we', 'define', 'key', 'concepts', 'and', 'propose', 'a', 'taxonomy', 'of', 'nso', 'approaches', 'and', 'solutions', 'to', 'pave', 'the', 'way', 'towards', 'a', 'common', 'understanding', 'of', 'the', 'various', 'ongoing', 'efforts', 'around', 'the', 'realization', 'of', 'diverse', 'nso', 'application', 'scenarios', 'based', 'on', 'the', 'analysis', 'of', 'the', 'state', 'of', 'affairs', 'we', 'present', 'a', 'series', 'of', 'open', 'challenges', 'and', 'research', 'opportunities', 'altogether', 'contributing', 'to', 'a', 'timely', 'and', 'comprehensive', 'survey', 'on', 'the', 'vibrant', 'and', 'strategic', 'topic', 'of', 'network', 'service', 'orchestration']]
|
[-0.1683111749898169, 0.02822656453870435, -0.006774208199063017, 0.013661434214680522, -0.11647305524398609, -0.13653810612486872, 0.10452851784050218, 0.4019938811083525, -0.25665662152749275, -0.3275344822226473, 0.1317496302998136, -0.26502011127728786, -0.15828322590385352, 0.20099495746998003, -0.11077181056096388, 0.07440326213630853, 0.06777988753097584, -0.07076832707148066, -0.01227159650760924, -0.23974862514650294, 0.3069823714132673, 0.05619733854202111, 0.41974078620480404, 0.08686653207164279, 0.04599520592893685, -0.03082425395819199, -0.1413540564485805, -0.08273783412527869, -0.1012601267999213, 0.22571701156644366, 0.3939036229706425, 0.2876481449550522, 0.3989281931181968, -0.5045018030628974, -0.19070989291765084, 0.04843599930878675, 0.15908062679934937, 0.019407768442439563, -0.03309213982004858, -0.34043248189170716, 0.0061291091266932034, -0.2756134672399137, -0.13212803351944982, -0.11112374518994751, 0.025901689528595676, 0.04066560187155782, -0.22212443222325212, -0.08209401426846255, -0.017582492543981303, 0.09855217389371349, -0.07539752592301789, -0.06993935416447442, 0.011167496977276195, 0.22087562843663258, 0.05312083630683672, 0.03833716789656705, 0.2117550785303404, -0.19329991060674437, -0.1671148900744037, 0.4041287888211934, 0.044242238679911054, -0.08955627729719406, 0.18459165267239824, -0.01626415757555, -0.21322448166262215, 0.03571532735310351, 0.26335575778258563, 0.035707172358830495, -0.24494253526549806, 0.03423255842046565, 0.08354370227181326, 0.09531289489312067, 0.01336623308922869, 0.07000226502754411, 0.29312106948577443, 0.3144236497930894, 0.13562600224572158, 0.10943729109876887, -0.006126785739607985, -0.15073084701830264, -0.20685487235150202, -0.14468414432855414, -0.10572483973112601, 0.028952363037854145, -0.018639878638796844, -0.14400632134047003, 0.41207227532530605, 0.17492613575591073, 0.09471932379335926, 0.015915837135996917, 0.34813285933277516, -0.021358339373891894, 0.11676290923554594, 0.10180510678455601, 0.08879687763925498, -0.0029637005825871757, 0.25823634133856865, -0.11493171451070465, 0.10329982559183787, -0.018624413107619597]
|
1,803.06597
|
Schwinger-Dyson Equations in Coulomb Gauge Consistent with Numerical
Simulation
|
In the present work we undertake a study of the Schwinger-Dyson equation
(SDE) in the Euclidean formulation of local quantum gauge field theory, with
Coulomb gauge condition $\partial_i A_i = 0$. We continue a previous study
which kept only instantaneous terms in the SDE that are proportional to
$\delta(t)$ in order to calculate the instantaneous part of the time component
of the gluon propagator $D_{A_0 A_0}(t, R)$. We compare the results of that
study with a numerical simulation of lattice gauge theory and find that the
infrared critical exponents and related quantities agree to within 1\% to 3\%.
This raises the question, "Why is the agreement so good, despite the systematic
neglect of non-instantaneous terms?" We discovered the happy circumstance that
all the non-instantaneous terms are in fact zero. They are forbidden by the
symmetry of the local action in Coulomb gauge under time-dependent gauge
transformations $g(t)$. This remnant gauge symmetry is not fixed by the Coulomb
gauge condition. The numerical result of the present calculation is the same as
in the previous study; the novelty is that we now demonstrate that all the
non-instantaneous terms in the SDE vanish. We derive some elementary properties
of propagators which are a consequence of the remnant gauge symmetry. In
particular the time component of the gluon propagator is found to be purely
instantaneous $D_{A_0 A_0}(t, R) = \delta(t) V(R)$, where $V(R)$ is the
color-Coulomb potential. Our results support the simple physical scenario in
which confinement is the result of a linearly rising color-Coulomb potential,
$V(R) \sim \sigma R$ at large $R$.
|
hep-th
|
in the present work we undertake a study of the schwingerdyson equation sde in the euclidean formulation of local quantum gauge field theory with coulomb gauge condition partial_i a_i 0 we continue a previous study which kept only instantaneous terms in the sde that are proportional to deltat in order to calculate the instantaneous part of the time component of the gluon propagator d_a_0 a_0t r we compare the results of that study with a numerical simulation of lattice gauge theory and find that the infrared critical exponents and related quantities agree to within 1 to 3 this raises the question why is the agreement so good despite the systematic neglect of noninstantaneous terms we discovered the happy circumstance that all the noninstantaneous terms are in fact zero they are forbidden by the symmetry of the local action in coulomb gauge under timedependent gauge transformations gt this remnant gauge symmetry is not fixed by the coulomb gauge condition the numerical result of the present calculation is the same as in the previous study the novelty is that we now demonstrate that all the noninstantaneous terms in the sde vanish we derive some elementary properties of propagators which are a consequence of the remnant gauge symmetry in particular the time component of the gluon propagator is found to be purely instantaneous d_a_0 a_0t r deltat vr where vr is the colorcoulomb potential our results support the simple physical scenario in which confinement is the result of a linearly rising colorcoulomb potential vr sim sigma r at large r
|
[['in', 'the', 'present', 'work', 'we', 'undertake', 'a', 'study', 'of', 'the', 'schwingerdyson', 'equation', 'sde', 'in', 'the', 'euclidean', 'formulation', 'of', 'local', 'quantum', 'gauge', 'field', 'theory', 'with', 'coulomb', 'gauge', 'condition', 'partial_i', 'a_i', '0', 'we', 'continue', 'a', 'previous', 'study', 'which', 'kept', 'only', 'instantaneous', 'terms', 'in', 'the', 'sde', 'that', 'are', 'proportional', 'to', 'deltat', 'in', 'order', 'to', 'calculate', 'the', 'instantaneous', 'part', 'of', 'the', 'time', 'component', 'of', 'the', 'gluon', 'propagator', 'd_a_0', 'a_0t', 'r', 'we', 'compare', 'the', 'results', 'of', 'that', 'study', 'with', 'a', 'numerical', 'simulation', 'of', 'lattice', 'gauge', 'theory', 'and', 'find', 'that', 'the', 'infrared', 'critical', 'exponents', 'and', 'related', 'quantities', 'agree', 'to', 'within', '1', 'to', '3', 'this', 'raises', 'the', 'question', 'why', 'is', 'the', 'agreement', 'so', 'good', 'despite', 'the', 'systematic', 'neglect', 'of', 'noninstantaneous', 'terms', 'we', 'discovered', 'the', 'happy', 'circumstance', 'that', 'all', 'the', 'noninstantaneous', 'terms', 'are', 'in', 'fact', 'zero', 'they', 'are', 'forbidden', 'by', 'the', 'symmetry', 'of', 'the', 'local', 'action', 'in', 'coulomb', 'gauge', 'under', 'timedependent', 'gauge', 'transformations', 'gt', 'this', 'remnant', 'gauge', 'symmetry', 'is', 'not', 'fixed', 'by', 'the', 'coulomb', 'gauge', 'condition', 'the', 'numerical', 'result', 'of', 'the', 'present', 'calculation', 'is', 'the', 'same', 'as', 'in', 'the', 'previous', 'study', 'the', 'novelty', 'is', 'that', 'we', 'now', 'demonstrate', 'that', 'all', 'the', 'noninstantaneous', 'terms', 'in', 'the', 'sde', 'vanish', 'we', 'derive', 'some', 'elementary', 'properties', 'of', 'propagators', 'which', 'are', 'a', 'consequence', 'of', 'the', 'remnant', 'gauge', 'symmetry', 'in', 'particular', 'the', 'time', 'component', 'of', 'the', 'gluon', 'propagator', 'is', 'found', 'to', 'be', 'purely', 'instantaneous', 'd_a_0', 'a_0t', 'r', 'deltat', 'vr', 'where', 'vr', 'is', 'the', 'colorcoulomb', 'potential', 'our', 'results', 'support', 'the', 'simple', 'physical', 'scenario', 'in', 'which', 'confinement', 'is', 'the', 'result', 'of', 'a', 'linearly', 'rising', 'colorcoulomb', 'potential', 'vr', 'sim', 'sigma', 'r', 'at', 'large', 'r']]
|
[-0.15471744488975475, 0.15058758591232888, -0.09863129756975093, 0.055612168216385705, -0.049114262584618616, -0.10285316385756381, 0.01142321109720995, 0.3586514320008, -0.21955402096613866, -0.23743621698229173, 0.06221778362587181, -0.2657900628804117, -0.15015978346137576, 0.10847115306118467, -0.03309696580551507, 0.005720922308484752, 0.027919103079819724, 0.06278187070578221, -0.07249939606700759, -0.2604144481663023, 0.30736758896595423, 0.004790592206196301, 0.2233980956400386, 0.09440167386022284, 0.06909714024405245, 0.0009534361134446316, -0.026105925266844753, -0.001395580167193618, -0.13289876569488043, 0.03969668752762058, 0.1991896902261744, 0.04631773510165078, 0.2423827976005601, -0.39559328698839424, -0.1920959463901093, 0.09119554938239331, 0.15815572178621817, 0.10209797751221893, -0.024365046244578487, -0.24705743078769327, 0.09401939629580724, -0.16758293911981387, -0.18259248372297807, -0.059665318487886095, 0.018343969248688204, -0.00197574399150763, -0.2770155842981305, 0.10682591578310739, 0.02845284670721812, 0.06187076049296055, -0.06254591732485228, -0.0928090698582189, -0.034774436613595555, 0.08932562897902287, 0.11944780034984277, 0.0925427564195129, 0.10031954609411398, -0.16438880334300232, -0.07512740381170746, 0.4120213670496637, -0.08351062562050306, -0.19333043009955944, 0.15969869255061997, -0.18938942968660552, -0.11659166634133528, 0.11084326812616958, 0.09718296289578052, 0.11845783073027484, -0.15570810825721604, 0.17216451486331638, -0.05768761035790558, 0.13291726219069197, 0.03929454810348437, 0.05030864085034437, 0.14924220428421572, 0.08280446698457901, 0.03604850582488548, 0.10385941527376191, -0.01301512527931844, -0.12024267846066142, -0.40744522576318176, -0.13142128090137717, -0.17267659420042447, 0.07423025844234779, -0.10476041293115507, -0.14459804163826492, 0.3717559579956202, 0.1625471080867175, 0.18408569713949374, 0.06186752685695408, 0.2525394106798367, 0.1771776249889531, 0.06893151363626064, 0.057108556733970396, 0.25185559850228234, 0.13635167560960504, 0.10410937369014735, -0.27527528415626124, -0.02645301285692661, 0.10311793576172237]
|
1,803.06598
|
Facial Landmarks Detection by Self-Iterative Regression based
Landmarks-Attention Network
|
Cascaded Regression (CR) based methods have been proposed to solve facial
landmarks detection problem, which learn a series of descent directions by
multiple cascaded regressors separately trained in coarse and fine stages. They
outperform the traditional gradient descent based methods in both accuracy and
running speed. However, cascaded regression is not robust enough because each
regressor's training data comes from the output of previous regressor.
Moreover, training multiple regressors requires lots of computing resources,
especially for deep learning based methods. In this paper, we develop a
Self-Iterative Regression (SIR) framework to improve the model efficiency. Only
one self-iterative regressor is trained to learn the descent directions for
samples from coarse stages to fine stages, and parameters are iteratively
updated by the same regressor. Specifically, we proposed Landmarks-Attention
Network (LAN) as our regressor, which concurrently learns features around each
landmark and obtains the holistic location increment. By doing so, not only the
rest of regressors are removed to simplify the training process, but the number
of model parameters is significantly decreased. The experiments demonstrate
that with only 3.72M model parameters, our proposed method achieves the
state-of-the-art performance.
|
cs.CV
|
cascaded regression cr based methods have been proposed to solve facial landmarks detection problem which learn a series of descent directions by multiple cascaded regressors separately trained in coarse and fine stages they outperform the traditional gradient descent based methods in both accuracy and running speed however cascaded regression is not robust enough because each regressors training data comes from the output of previous regressor moreover training multiple regressors requires lots of computing resources especially for deep learning based methods in this paper we develop a selfiterative regression sir framework to improve the model efficiency only one selfiterative regressor is trained to learn the descent directions for samples from coarse stages to fine stages and parameters are iteratively updated by the same regressor specifically we proposed landmarksattention network lan as our regressor which concurrently learns features around each landmark and obtains the holistic location increment by doing so not only the rest of regressors are removed to simplify the training process but the number of model parameters is significantly decreased the experiments demonstrate that with only 372m model parameters our proposed method achieves the stateoftheart performance
|
[['cascaded', 'regression', 'cr', 'based', 'methods', 'have', 'been', 'proposed', 'to', 'solve', 'facial', 'landmarks', 'detection', 'problem', 'which', 'learn', 'a', 'series', 'of', 'descent', 'directions', 'by', 'multiple', 'cascaded', 'regressors', 'separately', 'trained', 'in', 'coarse', 'and', 'fine', 'stages', 'they', 'outperform', 'the', 'traditional', 'gradient', 'descent', 'based', 'methods', 'in', 'both', 'accuracy', 'and', 'running', 'speed', 'however', 'cascaded', 'regression', 'is', 'not', 'robust', 'enough', 'because', 'each', 'regressors', 'training', 'data', 'comes', 'from', 'the', 'output', 'of', 'previous', 'regressor', 'moreover', 'training', 'multiple', 'regressors', 'requires', 'lots', 'of', 'computing', 'resources', 'especially', 'for', 'deep', 'learning', 'based', 'methods', 'in', 'this', 'paper', 'we', 'develop', 'a', 'selfiterative', 'regression', 'sir', 'framework', 'to', 'improve', 'the', 'model', 'efficiency', 'only', 'one', 'selfiterative', 'regressor', 'is', 'trained', 'to', 'learn', 'the', 'descent', 'directions', 'for', 'samples', 'from', 'coarse', 'stages', 'to', 'fine', 'stages', 'and', 'parameters', 'are', 'iteratively', 'updated', 'by', 'the', 'same', 'regressor', 'specifically', 'we', 'proposed', 'landmarksattention', 'network', 'lan', 'as', 'our', 'regressor', 'which', 'concurrently', 'learns', 'features', 'around', 'each', 'landmark', 'and', 'obtains', 'the', 'holistic', 'location', 'increment', 'by', 'doing', 'so', 'not', 'only', 'the', 'rest', 'of', 'regressors', 'are', 'removed', 'to', 'simplify', 'the', 'training', 'process', 'but', 'the', 'number', 'of', 'model', 'parameters', 'is', 'significantly', 'decreased', 'the', 'experiments', 'demonstrate', 'that', 'with', 'only', '372m', 'model', 'parameters', 'our', 'proposed', 'method', 'achieves', 'the', 'stateoftheart', 'performance']]
|
[-0.0003607190408549466, -0.002881429251539265, -0.07119818559622618, 0.02649807599205455, -0.120034003605974, -0.24033044931059191, 0.024162296899773467, 0.46307368439386837, -0.28949156329598646, -0.3103442798767771, 0.08736118186933019, -0.23424195041777668, -0.16098904368406222, 0.1783380052906328, -0.1312464231620082, 0.11778418399946211, 0.15995106985024943, 0.02357969272390499, -0.06174615930089763, -0.35611568261859017, 0.2784699905762234, 0.09016795254137833, 0.35238796674165423, -0.06521552434232045, 0.17781740238897728, -0.029654414105167674, -0.04215325715767404, -0.015243605762377259, 0.00013987652446203455, 0.15055752951321755, 0.3094578104318826, 0.1842168831089921, 0.36786415627492325, -0.42281994735310363, -0.24990521977235983, 0.09716618370621691, 0.15612637974158095, 0.10191276927790759, 0.01785519385357275, -0.3002469117451295, 0.07742772220920485, -0.1257760189857416, 0.014074979198854774, -0.1324876521888015, -0.07354696710839621, 0.014132234014591181, -0.3501970967390462, 0.040407746113007785, 0.06911876005284324, 0.03635497297835792, -0.032353570203138206, -0.14797309925267985, -0.020761762970833333, 0.15470813428803992, 0.07329523718226982, 0.0336869092361367, 0.17436893605934148, -0.15153744792313684, -0.12414231638815561, 0.3243867954505341, -0.06977858875908859, -0.2284862128045451, 0.17983422231870694, -0.03290751277581676, -0.14849257115581696, 0.13934704984645718, 0.2554494603569005, 0.12619564537429712, -0.1544107626893322, 0.008820036483754578, -0.025718038739216933, 0.20839115815585132, 0.04143723719727739, -0.05659555454206254, 0.12162463989743329, 0.23313373627632364, 0.0515934127820451, 0.09155964402348868, -0.1728049893055948, -0.062098025367339396, -0.2140396385495858, -0.06612542077673825, -0.22398816372247432, -0.10483986844425729, -0.13449442788675828, -0.13436957877362787, 0.42431295761367777, 0.2539268318860495, 0.2704146383573291, 0.1380689361140357, 0.3639956671478493, 0.05917858854921248, 0.12100580723471377, 0.1329235021756696, 0.22491222190552976, 0.013663729610545869, 0.08965718364477372, -0.17728652849865073, 0.13476179611797517, 0.10710561126828767]
|
1,803.06599
|
Single-Photon-Triggered Quantum Phase Transition
|
We propose a hybrid quantum model combining cavity QED and optomechanics,
which allows the occurrence of equilibrium superradiant quantum phase
transition (QPT) triggered by a single photon. This single-photon-triggered QPT
exists both in the cases of ignoring and including the so-called $A^2$ term,
i.e., it is immune to the no-go theorem. It originally comes from the
photon-dependent quantum criticality featured by the proposed hybrid quantum
model. Moreover, a reversed superradiant QPT is induced by the competition
between the introduced $A^2$ term and the optomechanical interaction. This work
offers an approach to manipulate QPT with a single photon, which should inspire
the exploration of single-photon quantum-criticality physics and the
engineering of new single-photon quantum devices.
|
quant-ph cond-mat.stat-mech
|
we propose a hybrid quantum model combining cavity qed and optomechanics which allows the occurrence of equilibrium superradiant quantum phase transition qpt triggered by a single photon this singlephotontriggered qpt exists both in the cases of ignoring and including the socalled a2 term ie it is immune to the nogo theorem it originally comes from the photondependent quantum criticality featured by the proposed hybrid quantum model moreover a reversed superradiant qpt is induced by the competition between the introduced a2 term and the optomechanical interaction this work offers an approach to manipulate qpt with a single photon which should inspire the exploration of singlephoton quantumcriticality physics and the engineering of new singlephoton quantum devices
|
[['we', 'propose', 'a', 'hybrid', 'quantum', 'model', 'combining', 'cavity', 'qed', 'and', 'optomechanics', 'which', 'allows', 'the', 'occurrence', 'of', 'equilibrium', 'superradiant', 'quantum', 'phase', 'transition', 'qpt', 'triggered', 'by', 'a', 'single', 'photon', 'this', 'singlephotontriggered', 'qpt', 'exists', 'both', 'in', 'the', 'cases', 'of', 'ignoring', 'and', 'including', 'the', 'socalled', 'a2', 'term', 'ie', 'it', 'is', 'immune', 'to', 'the', 'nogo', 'theorem', 'it', 'originally', 'comes', 'from', 'the', 'photondependent', 'quantum', 'criticality', 'featured', 'by', 'the', 'proposed', 'hybrid', 'quantum', 'model', 'moreover', 'a', 'reversed', 'superradiant', 'qpt', 'is', 'induced', 'by', 'the', 'competition', 'between', 'the', 'introduced', 'a2', 'term', 'and', 'the', 'optomechanical', 'interaction', 'this', 'work', 'offers', 'an', 'approach', 'to', 'manipulate', 'qpt', 'with', 'a', 'single', 'photon', 'which', 'should', 'inspire', 'the', 'exploration', 'of', 'singlephoton', 'quantumcriticality', 'physics', 'and', 'the', 'engineering', 'of', 'new', 'singlephoton', 'quantum', 'devices']]
|
[-0.1522082371437656, 0.2314085506421699, -0.07953277071438995, 0.01642428895918004, -0.03232332074549049, -0.2441270677871736, 0.10374253939101306, 0.29080874057087513, -0.24987740694944346, -0.2558180145341404, -0.0005079648534384822, -0.2744446122941164, -0.18592539180203208, 0.18406568008192284, -0.022278505418008927, 0.0872094624210149, -0.002464307264225291, -0.04178213618329859, -0.023111523856641725, -0.15887689870266644, 0.3149226186672292, 0.04139810965092953, 0.322971850301006, 0.06677262060631099, 0.10859842130282361, 0.010156530412911837, 0.07833927800805084, -0.055247834959394435, -0.1159670960623771, 0.08101209611465622, 0.25827322957723353, 0.06590432161465287, 0.28694437005021556, -0.3998635543975979, -0.21737571642240386, 0.08428854293846857, 0.10548334721326162, 0.19086393301300372, -0.07935430584439018, -0.364113164799554, -0.001180566377505394, -0.20695113133323112, -0.09658964710238901, -0.0803297152493282, -0.05188397822868345, -0.08374292493265655, -0.25774124638909207, 0.04689842228045953, 0.12334625093665506, 0.007649045932339504, 0.02230661851548835, 0.019915539243291796, 0.03977311243319751, 0.09486053596317236, -0.047593811408400404, 0.05241713026355553, 0.13463749187316612, -0.15336866353650944, -0.21328642779761658, 0.3797854225267656, -0.03264276786649134, -0.09859440961320486, 0.18077855843876023, -0.10658764354385701, -0.06810487151960842, 0.10587406721190616, 0.06944310264329293, 0.07653647162182356, -0.12869860976934433, 0.10069933423697616, 0.03620426297753251, 0.2024204600300956, 0.038615542788258087, 0.09774684555096817, 0.2261119800553258, 0.15739412896177132, 0.021468052444106434, 0.21536252885458193, -0.08786446115326337, -0.18598037840066745, -0.3193959686406223, -0.15619563851422363, -0.2184519963422125, 0.07263534325466026, -0.04478148760089035, -0.1653697590788527, 0.374541741163869, 0.16840189636942732, 0.11806401920953899, -0.059173460798254904, 0.28768427938692703, 0.16599163759799143, 0.05636979827665657, 0.008966325399731951, 0.3103356463668336, 0.13111437172171594, 0.11930543437067952, -0.2990344246728845, 0.032257103868427554, 0.05704383945807682]
|
1,803.066
|
Optimizing the Efficiency of First-Order Methods for Decreasing the
Gradient of Smooth Convex Functions
|
This paper optimizes the step coefficients of first-order methods for smooth
convex minimization in terms of the worst-case convergence bound (i.e.,
efficiency) of the decrease in the gradient norm. This work is based on the
performance estimation problem approach. The worst-case gradient bound of the
resulting method is optimal up to a constant for large-dimensional smooth
convex minimization problems, under the initial bounded condition on the cost
function value. This paper then illustrates that the proposed method has a
computationally efficient form that is similar to the optimized gradient
method.
|
math.OC
|
this paper optimizes the step coefficients of firstorder methods for smooth convex minimization in terms of the worstcase convergence bound ie efficiency of the decrease in the gradient norm this work is based on the performance estimation problem approach the worstcase gradient bound of the resulting method is optimal up to a constant for largedimensional smooth convex minimization problems under the initial bounded condition on the cost function value this paper then illustrates that the proposed method has a computationally efficient form that is similar to the optimized gradient method
|
[['this', 'paper', 'optimizes', 'the', 'step', 'coefficients', 'of', 'firstorder', 'methods', 'for', 'smooth', 'convex', 'minimization', 'in', 'terms', 'of', 'the', 'worstcase', 'convergence', 'bound', 'ie', 'efficiency', 'of', 'the', 'decrease', 'in', 'the', 'gradient', 'norm', 'this', 'work', 'is', 'based', 'on', 'the', 'performance', 'estimation', 'problem', 'approach', 'the', 'worstcase', 'gradient', 'bound', 'of', 'the', 'resulting', 'method', 'is', 'optimal', 'up', 'to', 'a', 'constant', 'for', 'largedimensional', 'smooth', 'convex', 'minimization', 'problems', 'under', 'the', 'initial', 'bounded', 'condition', 'on', 'the', 'cost', 'function', 'value', 'this', 'paper', 'then', 'illustrates', 'that', 'the', 'proposed', 'method', 'has', 'a', 'computationally', 'efficient', 'form', 'that', 'is', 'similar', 'to', 'the', 'optimized', 'gradient', 'method']]
|
[-0.08034712643259101, -0.011823365081929499, -0.10698020350892977, 0.036814129465104393, -0.06562019798956398, -0.1194054453012844, 0.057777516970721386, 0.3770239139596621, -0.30795575969645544, -0.27777089854288434, 0.11706439170520752, -0.20896971416142252, -0.19819143657417346, 0.2015164630798002, -0.13755300535380632, 0.15576372335457966, 0.0887334215014966, 0.029900093086891705, -0.15053277676213636, -0.31877975658410124, 0.29603131821818857, 0.046346194524731904, 0.3231227049397098, 0.09995453497071544, 0.14540201873622008, -0.038106624554428786, 0.06859943243519713, 0.02978400243446231, -0.1271808086514486, 0.18661104396063213, 0.22811259298792316, 0.16803595909538369, 0.3910511567774746, -0.37308969205866255, -0.1749242580599255, 0.1585587323539787, 0.14078636246009005, 0.06195395820670658, -0.05009204554112835, -0.18390766096611819, 0.11695297650682429, -0.10491068044211715, -0.07758039327648779, -0.05895630379673093, -0.04569306644714541, 0.009507204711230264, -0.3692867940084802, 0.11404123218316171, 0.07427947204560041, 0.002620597763193978, -0.10860633325452605, -0.13260605415432816, 0.07887024227529764, 0.03976638515790303, 0.06881719768926915, 0.10303005581825143, 0.12256446837758024, -0.07908272297483765, -0.06936309495940804, 0.3391380995098088, -0.10393243187831508, -0.2804749305049578, 0.10025081183606138, -0.0365878504080077, -0.10721523200886117, 0.14945043123120236, 0.2343001776167916, 0.22610467556450103, -0.13890556611327662, 0.12180161665504177, -0.0474648502551847, 0.13927782573737205, 0.042592709252817766, -0.004307436684353484, 0.02882535083271149, 0.1665291792842456, 0.2431998888961971, 0.18732705506392652, -0.03562563760723505, -0.12532048952869243, -0.30566348750144245, -0.13519319508405817, -0.24768033967249922, -0.03640827177506354, -0.13523475661252934, -0.17601589630875322, 0.3890984948595158, 0.11790705848640452, 0.16945260516885255, 0.16904775511680378, 0.3889356890693307, 0.18358442483262882, -0.0005713834297946757, 0.11774403912584401, 0.23059207050957614, 0.09327555565266973, 0.060663553730895124, -0.2922563029401418, 0.1397593528368614, 0.1356055083042722]
|
1,803.06601
|
Convergence of Heisenberg Modules over Quantum 2-tori for the Modular
Gromov-Hausdorff Propinquity
|
The modular Gromov-Hausdorff propinquity is a distance on classes of modules
endowed with quantum metric information, in the form of a metric form of a
connection and a left Hilbert module structure. This paper proves that the
family of Heisenberg modules over quantum two tori, when endowed with their
canonical connections, form a continuous family for the modular propinquity.
|
math.OA
|
the modular gromovhausdorff propinquity is a distance on classes of modules endowed with quantum metric information in the form of a metric form of a connection and a left hilbert module structure this paper proves that the family of heisenberg modules over quantum two tori when endowed with their canonical connections form a continuous family for the modular propinquity
|
[['the', 'modular', 'gromovhausdorff', 'propinquity', 'is', 'a', 'distance', 'on', 'classes', 'of', 'modules', 'endowed', 'with', 'quantum', 'metric', 'information', 'in', 'the', 'form', 'of', 'a', 'metric', 'form', 'of', 'a', 'connection', 'and', 'a', 'left', 'hilbert', 'module', 'structure', 'this', 'paper', 'proves', 'that', 'the', 'family', 'of', 'heisenberg', 'modules', 'over', 'quantum', 'two', 'tori', 'when', 'endowed', 'with', 'their', 'canonical', 'connections', 'form', 'a', 'continuous', 'family', 'for', 'the', 'modular', 'propinquity']]
|
[-0.23320686446218672, 0.0811085026411308, -0.09680889681834033, 0.06507513201716593, -0.08813224519776591, -0.1347195786045138, -0.024844420022110188, 0.3651348054409027, -0.35220081475957976, -0.1643785761385146, 0.08309508543816727, -0.2711423522145566, -0.2044620378479614, 0.22073154921753932, -0.10678010315523814, 0.0034384848234259476, 0.07517359852869758, 0.16081583099755442, -0.15752836748152593, -0.22760047880001366, 0.5077771320623361, 0.03217033283800771, 0.26044746819820447, -0.03047638546620689, 0.18466194834307595, -0.0011674736042396497, 0.0403114312912448, 0.032865389676417334, -0.11885952436963543, 0.21898158783314087, 0.2586355777299505, 0.06684065988224189, 0.24748445054816115, -0.3490402226112349, -0.1328603031618868, 0.15590318727259667, 0.05179519656950892, -0.05560342822287042, -0.014364326398393487, -0.3109858644084405, 0.06373306632538177, -0.22538794810741636, -0.10313110392031623, -0.07072097329833245, 0.006806402893389686, -0.027497871731550008, -0.1919729701860934, -0.05104611482534368, 0.12050351068787908, 0.08293601052867154, -0.0769765670805917, 0.017707820460831716, -0.0009262523440233732, 0.09084257901640277, -0.07778093441768344, 0.09029956948667196, 0.06903108703446086, -0.0936333017494782, -0.14989760374429367, 0.3379966002016849, -0.04790108228177306, -0.28097167899989983, 0.1295537833850515, -0.12837645889780783, -0.13470956992547392, 0.02836271184417656, 0.10423447333781397, 0.11319243114725766, -0.10522265316572206, 0.20706682028623802, -0.09230975595192384, 0.07706472530203351, 0.06549786245923932, 0.11782491668837808, 0.19150850625108864, 0.12874150165293555, 0.09254602836918528, 0.15376497241589476, 0.011483072346644634, -0.1726004170032881, -0.33975394317185725, -0.2676706852359792, -0.13553467165615599, 0.16013624713266805, -0.14964366358506564, -0.22171352282797885, 0.42364399643788525, -0.01873690011058697, 0.24937325484766545, 0.18289740352054773, 0.16941958839484192, -0.022324504314969153, 0.09601274274400104, 0.08880505367513683, 0.15010971481264648, 0.24778057293871703, -0.02520624317931232, -0.09698020194073097, 0.008810667242160288, 0.16355411065900224]
|
1,803.06602
|
Two new classes of quantum MDS codes
|
Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using
generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we
construct two new classes of quantum maximum-distance- separable (MDS) codes
with parameters \[ [[tq, tq-2d+2, d]]_{q} \] for any $1 \leq t \leq q, 2 \leq d
\leq \lfloor \frac{tq+q-1}{q+1}\rfloor+1$, and \[ [[t(q+1)+2, t(q+1)-2d+4,
d]]_{q} \] for any $1 \leq t \leq q-1, 2 \leq d \leq t+2$ with $(p,t,d) \neq
(2, q-1, q)$. Our quantum codes have flexible parameters, and have minimum
distances larger than $\frac{q}{2}+1$ when $t > \frac{q}{2}$. Furthermore, it
turns out that our constructions generalize and improve some previous results.
|
cs.IT math.IT
|
let p be a prime and let q be a power of p in this paper by using generalized reedsolomon grs for short codes and extended grs codes we construct two new classes of quantum maximumdistance separable mds codes with parameters tq tq2d2 d_q for any 1 leq t leq q 2 leq d leq lfloor fractqq1q1rfloor1 and tq12 tq12d4 d_q for any 1 leq t leq q1 2 leq d leq t2 with ptd neq 2 q1 q our quantum codes have flexible parameters and have minimum distances larger than fracq21 when t fracq2 furthermore it turns out that our constructions generalize and improve some previous results
|
[['let', 'p', 'be', 'a', 'prime', 'and', 'let', 'q', 'be', 'a', 'power', 'of', 'p', 'in', 'this', 'paper', 'by', 'using', 'generalized', 'reedsolomon', 'grs', 'for', 'short', 'codes', 'and', 'extended', 'grs', 'codes', 'we', 'construct', 'two', 'new', 'classes', 'of', 'quantum', 'maximumdistance', 'separable', 'mds', 'codes', 'with', 'parameters', 'tq', 'tq2d2', 'd_q', 'for', 'any', '1', 'leq', 't', 'leq', 'q', '2', 'leq', 'd', 'leq', 'lfloor', 'fractqq1q1rfloor1', 'and', 'tq12', 'tq12d4', 'd_q', 'for', 'any', '1', 'leq', 't', 'leq', 'q1', '2', 'leq', 'd', 'leq', 't2', 'with', 'ptd', 'neq', '2', 'q1', 'q', 'our', 'quantum', 'codes', 'have', 'flexible', 'parameters', 'and', 'have', 'minimum', 'distances', 'larger', 'than', 'fracq21', 'when', 't', 'fracq2', 'furthermore', 'it', 'turns', 'out', 'that', 'our', 'constructions', 'generalize', 'and', 'improve', 'some', 'previous', 'results']]
|
[-0.1754729238709489, 0.1983094822606343, -0.0377634257548353, 0.05083644165300303, 0.006640418649660152, -0.3676845829083937, 0.0018030252495274237, 0.3340804955800001, -0.27069077327015617, -0.2685625030595845, 0.0484174169154693, -0.3114572242625709, -0.05414113983821612, 0.22366288627127132, -0.04046404374383607, 0.010108652731485087, -0.004373838225361503, 0.04217130144678273, -0.1474177616634813, -0.31341727978088757, 0.26458760268660714, -0.013967109038223268, 0.11008479214698366, -0.011601523873712686, 0.01593194648768138, 0.0259504922557152, 0.06339821040413333, -0.021913441625939122, -0.32311509513259173, 0.03353443499021594, 0.29339403125177166, 0.15966817438240768, 0.21873332400019596, -0.2451042713579333, -0.22047972279568023, 0.2022848345104207, 0.21910645933912218, -0.012376741623704873, 0.060389291323287395, -0.16529128690548603, 0.2495313540453688, -0.19645874628128068, -0.10273618370439243, -0.0637362395928612, 0.1800082301702893, 0.021367154929569913, -0.3643364794371487, 0.012995394439554041, 0.14777814590562027, 0.10314447989741575, 0.017199502037205164, -0.3078094833774619, 0.041829879043027034, 0.04583063208214369, -0.07103936149946695, 0.15276607912196552, -0.04663628932468376, -0.028940468120108385, -0.11019742406127088, 0.289314320925804, 0.010223538530464918, -0.1813181624973862, 0.04300148827837581, -0.1866930942503211, -0.15971659327341806, 0.08384081483502122, 0.12117419013012092, 0.21711142650959128, 0.0036967038599383176, 0.22918976201094887, -0.07200998666434033, 0.21632099329738072, 0.11583192280303796, 0.057558802322674435, 0.09041466863229147, 0.004149551270529628, 0.011111443138961653, 0.1227065453721771, -0.07377118988016855, 0.06787886416530507, -0.3451169464755261, -0.12510886447373054, -0.18963641151152913, 0.18709962223701684, -0.20786008461154162, -0.0028580288827708624, 0.270302405381955, 0.10431452911546074, 0.18817527159071953, 0.14040078954246726, 0.1669767208225591, -0.008265220802006068, 0.07752367863160314, 0.22026747528879534, 0.08963231553998324, 0.1639174163947334, -0.02608013024680244, -0.1476126217432501, -0.029216320488999768, 0.08124998082108434]
|
1,803.06603
|
Energy-aware networked control systems under temporal logic
specifications
|
In recent years, event and self-triggered control have been proposed as
energy-aware control strategies to expand the life-time of battery powered
devices in Networked Control Systems (NCSs). In contrast to the previous works
in which their control objective is to achieve stability, this paper presents a
novel energy-aware control scheme for achieving high level specifications, or
more specifically, temporal logic specifications. Inspired by the standard
hierarchical strategy that has been proposed in the field of formal control
synthesis paradigm, we propose a new abstraction procedure for jointly
synthesizing control and communication strategies, such that the communication
reduction in NCSs and the satisfaction of the temporal logic specifications are
guaranteed. The benefits of the proposal are illustrated through a numerical
example.
|
math.OC
|
in recent years event and selftriggered control have been proposed as energyaware control strategies to expand the lifetime of battery powered devices in networked control systems ncss in contrast to the previous works in which their control objective is to achieve stability this paper presents a novel energyaware control scheme for achieving high level specifications or more specifically temporal logic specifications inspired by the standard hierarchical strategy that has been proposed in the field of formal control synthesis paradigm we propose a new abstraction procedure for jointly synthesizing control and communication strategies such that the communication reduction in ncss and the satisfaction of the temporal logic specifications are guaranteed the benefits of the proposal are illustrated through a numerical example
|
[['in', 'recent', 'years', 'event', 'and', 'selftriggered', 'control', 'have', 'been', 'proposed', 'as', 'energyaware', 'control', 'strategies', 'to', 'expand', 'the', 'lifetime', 'of', 'battery', 'powered', 'devices', 'in', 'networked', 'control', 'systems', 'ncss', 'in', 'contrast', 'to', 'the', 'previous', 'works', 'in', 'which', 'their', 'control', 'objective', 'is', 'to', 'achieve', 'stability', 'this', 'paper', 'presents', 'a', 'novel', 'energyaware', 'control', 'scheme', 'for', 'achieving', 'high', 'level', 'specifications', 'or', 'more', 'specifically', 'temporal', 'logic', 'specifications', 'inspired', 'by', 'the', 'standard', 'hierarchical', 'strategy', 'that', 'has', 'been', 'proposed', 'in', 'the', 'field', 'of', 'formal', 'control', 'synthesis', 'paradigm', 'we', 'propose', 'a', 'new', 'abstraction', 'procedure', 'for', 'jointly', 'synthesizing', 'control', 'and', 'communication', 'strategies', 'such', 'that', 'the', 'communication', 'reduction', 'in', 'ncss', 'and', 'the', 'satisfaction', 'of', 'the', 'temporal', 'logic', 'specifications', 'are', 'guaranteed', 'the', 'benefits', 'of', 'the', 'proposal', 'are', 'illustrated', 'through', 'a', 'numerical', 'example']]
|
[-0.17636560175548463, 0.006138847954571247, -0.05451473129214719, -0.004057391632037858, -0.09540045610629022, -0.18582419332815334, 0.08448220327748762, 0.42074812746917206, -0.2712348004725451, -0.35797769024502485, 0.12657166111942691, -0.18019234730163589, -0.16646949516337675, 0.18806847700034268, -0.17926629612920805, 0.1523780723606857, 0.0009600400650621547, -0.026868199883028864, -0.028158596720701704, -0.23216775683686136, 0.25778037279572646, 0.07775924164258564, 0.36320349914797895, -0.00023117181068907182, 0.11370142816158477, 0.008901941143752387, -0.002610470560224106, 0.02059954379219562, -0.05605730836117194, 0.17483277447681758, 0.3380501203006133, 0.21259953271364793, 0.36692224139890944, -0.45524403175853273, -0.2625098517378016, 0.07360085043280075, 0.12444271236502875, 0.10272873449115044, -0.12316230811084097, -0.28315008521700896, 0.12344764385876866, -0.24770661290579785, -0.05932413628118714, -0.09673852035872793, -0.02089897638943512, 0.05181741533645739, -0.2811320534752061, -0.03377055920427665, 0.07039949402678758, 0.06493391169933602, -0.06700709484539402, -0.051103726495057344, 0.016085679269356962, 0.12428216679448573, -0.023833518252164745, -0.024113191895836886, 0.13263327228438962, -0.09939229276690943, -0.24040806846169288, 0.3426827834841485, 0.010392052067133287, -0.17869454959388045, 0.163398481317563, -0.01965993547734494, -0.17214303540531545, 0.10329333433570961, 0.22944421278176985, 0.12425418475516684, -0.2087115175323561, 0.07604215456958627, 0.029440454331537087, 0.19356360457410726, 0.008181486422351251, 0.07756737999928494, 0.16456428633925194, 0.30153377746852733, 0.12140541329087379, 0.1285984971288902, -0.02763223518850282, -0.1580051070001597, -0.22043429284822197, -0.13049013199439893, -0.11451959904128065, -0.046482855388118575, -0.005642861480616072, -0.09055077862770607, 0.40363558988031706, 0.20783915016800164, 0.11044003155936176, 0.1114567935457065, 0.3903569675128286, 0.1357494724089823, 0.08152202465765489, 0.04767145661559577, 0.2377030494438562, 0.057903684929866965, 0.17267727012901257, -0.22936331821838393, 0.11017420518231423, 0.003799622979325553]
|
1,803.06604
|
A Robust AUC Maximization Framework with Simultaneous Outlier Detection
and Feature Selection for Positive-Unlabeled Classification
|
The positive-unlabeled (PU) classification is a common scenario in real-world
applications such as healthcare, text classification, and bioinformatics, in
which we only observe a few samples labeled as "positive" together with a large
volume of "unlabeled" samples that may contain both positive and negative
samples. Building robust classifier for the PU problem is very challenging,
especially for complex data where the negative samples overwhelm and mislabeled
samples or corrupted features exist. To address these three issues, we propose
a robust learning framework that unifies AUC maximization (a robust metric for
biased labels), outlier detection (for excluding wrong labels), and feature
selection (for excluding corrupted features). The generalization error bounds
are provided for the proposed model that give valuable insight into the
theoretical performance of the method and lead to useful practical guidance,
e.g., to train a model, we find that the included unlabeled samples are
sufficient as long as the sample size is comparable to the number of positive
samples in the training process. Empirical comparisons and two real-world
applications on surgical site infection (SSI) and EEG seizure detection are
also conducted to show the effectiveness of the proposed model.
|
cs.LG stat.ML
|
the positiveunlabeled pu classification is a common scenario in realworld applications such as healthcare text classification and bioinformatics in which we only observe a few samples labeled as positive together with a large volume of unlabeled samples that may contain both positive and negative samples building robust classifier for the pu problem is very challenging especially for complex data where the negative samples overwhelm and mislabeled samples or corrupted features exist to address these three issues we propose a robust learning framework that unifies auc maximization a robust metric for biased labels outlier detection for excluding wrong labels and feature selection for excluding corrupted features the generalization error bounds are provided for the proposed model that give valuable insight into the theoretical performance of the method and lead to useful practical guidance eg to train a model we find that the included unlabeled samples are sufficient as long as the sample size is comparable to the number of positive samples in the training process empirical comparisons and two realworld applications on surgical site infection ssi and eeg seizure detection are also conducted to show the effectiveness of the proposed model
|
[['the', 'positiveunlabeled', 'pu', 'classification', 'is', 'a', 'common', 'scenario', 'in', 'realworld', 'applications', 'such', 'as', 'healthcare', 'text', 'classification', 'and', 'bioinformatics', 'in', 'which', 'we', 'only', 'observe', 'a', 'few', 'samples', 'labeled', 'as', 'positive', 'together', 'with', 'a', 'large', 'volume', 'of', 'unlabeled', 'samples', 'that', 'may', 'contain', 'both', 'positive', 'and', 'negative', 'samples', 'building', 'robust', 'classifier', 'for', 'the', 'pu', 'problem', 'is', 'very', 'challenging', 'especially', 'for', 'complex', 'data', 'where', 'the', 'negative', 'samples', 'overwhelm', 'and', 'mislabeled', 'samples', 'or', 'corrupted', 'features', 'exist', 'to', 'address', 'these', 'three', 'issues', 'we', 'propose', 'a', 'robust', 'learning', 'framework', 'that', 'unifies', 'auc', 'maximization', 'a', 'robust', 'metric', 'for', 'biased', 'labels', 'outlier', 'detection', 'for', 'excluding', 'wrong', 'labels', 'and', 'feature', 'selection', 'for', 'excluding', 'corrupted', 'features', 'the', 'generalization', 'error', 'bounds', 'are', 'provided', 'for', 'the', 'proposed', 'model', 'that', 'give', 'valuable', 'insight', 'into', 'the', 'theoretical', 'performance', 'of', 'the', 'method', 'and', 'lead', 'to', 'useful', 'practical', 'guidance', 'eg', 'to', 'train', 'a', 'model', 'we', 'find', 'that', 'the', 'included', 'unlabeled', 'samples', 'are', 'sufficient', 'as', 'long', 'as', 'the', 'sample', 'size', 'is', 'comparable', 'to', 'the', 'number', 'of', 'positive', 'samples', 'in', 'the', 'training', 'process', 'empirical', 'comparisons', 'and', 'two', 'realworld', 'applications', 'on', 'surgical', 'site', 'infection', 'ssi', 'and', 'eeg', 'seizure', 'detection', 'are', 'also', 'conducted', 'to', 'show', 'the', 'effectiveness', 'of', 'the', 'proposed', 'model']]
|
[-0.0411487041041255, 0.020208864900479583, -0.014837392238213828, 0.11319435481078759, -0.11108633049665705, -0.21857046264370805, 0.08287507604538022, 0.41489406240809906, -0.2377938116606521, -0.33959251701047544, 0.12062180028358278, -0.330721648988363, -0.1663705314570842, 0.21818283926718562, -0.12989925353689805, 0.05772417490615656, 0.1490457358806835, 0.05840118396537084, -0.016637312623329067, -0.30074806803053145, 0.269530593083044, 0.023728619637825576, 0.3388860598041088, 0.037469533862742155, 0.0973170159923795, -0.030867211551307457, -0.038467535652269264, 0.04097329280094097, -0.04381155834922346, 0.1109442838191937, 0.3432454162497858, 0.18813291349154163, 0.32144671012892534, -0.37083535758073066, -0.2425441646752389, 0.137864868561002, 0.11981802880419357, 0.11513348648410389, -0.10022992147071483, -0.3336442801819526, 0.125015424755647, -0.11904026739755767, 0.0011005398221497766, -0.14457200240882995, -0.005780467004699044, -0.01684705664060618, -0.35272041741562515, 0.0882813419195468, 0.06655947041581385, 0.04984447025168552, -0.06718335021287203, -0.1649036348699347, 0.024400799249691005, 0.17602223505290518, 0.07581637531785466, 0.009986862957502078, 0.11000159255375988, -0.1544995878093974, -0.09507230129215474, 0.34483116838688915, -0.01667968229341664, -0.1957138269269643, 0.21340070706853448, -0.0426196709189466, -0.16422646563549184, 0.12648978474355413, 0.2624869146629384, 0.1089004965168179, -0.14157489434828197, -0.01894764312953492, -0.02994390035685348, 0.1657786534412911, 0.024805875726068686, 0.0025968777334415597, 0.16307844736882926, 0.2123980527443468, 0.0464863861518863, 0.1468310354764598, -0.1453425428817833, -0.015533849339638101, -0.26069736977745045, -0.10689077417758343, -0.2175636972374234, 0.007985989307053387, -0.12319067844724295, -0.18542182218516245, 0.371843495283668, 0.21576514352774737, 0.24907382474231876, 0.08781129187034246, 0.31606364201656295, 0.016081884278805535, 0.06129863056305208, 0.039581279228686504, 0.16526148863823006, 0.03491030184944209, 0.06011201256003819, -0.15673802232302383, 0.126797119758435, -0.022764146951713454]
|
1,803.06605
|
An experimental and Ab-initio study of Electronic and Magnetic
properties of FeGa3
|
Electronic structure of FeGa3 has been studied using experiments and
ab-initio calculations. Magnetization measurements show that FeGa3 is
inherently diamagnetic in nature. Our studies indicate that the previously
reported magnetic moment on the Fe atoms in FeGa3 is not an intrinsic property
of FeGa3, but is primarily due to the presence of disorder, defects, grain
boundaries etc that break the symmetry about the Fe dimers. Analysis of the
results obtained from magnetic measurements, photoelectron spectroscopy, Fe
K-edge X-ray absorption near edge spectroscopy and ab-initio calculations
clearly indicates that, the effects of on-site Coulomb repulsion between the Fe
3d electrons do not play any role in determining the electronic and magnetic
properties of FeGa3. Detailed analysis of results of single crystal and
poycrystalline FeGa3, helps to resolve the discrepancy in the electronic and
magnetic properties in FeGa3 existing in the literature, consistently.
|
cond-mat.mtrl-sci
|
electronic structure of fega3 has been studied using experiments and abinitio calculations magnetization measurements show that fega3 is inherently diamagnetic in nature our studies indicate that the previously reported magnetic moment on the fe atoms in fega3 is not an intrinsic property of fega3 but is primarily due to the presence of disorder defects grain boundaries etc that break the symmetry about the fe dimers analysis of the results obtained from magnetic measurements photoelectron spectroscopy fe kedge xray absorption near edge spectroscopy and abinitio calculations clearly indicates that the effects of onsite coulomb repulsion between the fe 3d electrons do not play any role in determining the electronic and magnetic properties of fega3 detailed analysis of results of single crystal and poycrystalline fega3 helps to resolve the discrepancy in the electronic and magnetic properties in fega3 existing in the literature consistently
|
[['electronic', 'structure', 'of', 'fega3', 'has', 'been', 'studied', 'using', 'experiments', 'and', 'abinitio', 'calculations', 'magnetization', 'measurements', 'show', 'that', 'fega3', 'is', 'inherently', 'diamagnetic', 'in', 'nature', 'our', 'studies', 'indicate', 'that', 'the', 'previously', 'reported', 'magnetic', 'moment', 'on', 'the', 'fe', 'atoms', 'in', 'fega3', 'is', 'not', 'an', 'intrinsic', 'property', 'of', 'fega3', 'but', 'is', 'primarily', 'due', 'to', 'the', 'presence', 'of', 'disorder', 'defects', 'grain', 'boundaries', 'etc', 'that', 'break', 'the', 'symmetry', 'about', 'the', 'fe', 'dimers', 'analysis', 'of', 'the', 'results', 'obtained', 'from', 'magnetic', 'measurements', 'photoelectron', 'spectroscopy', 'fe', 'kedge', 'xray', 'absorption', 'near', 'edge', 'spectroscopy', 'and', 'abinitio', 'calculations', 'clearly', 'indicates', 'that', 'the', 'effects', 'of', 'onsite', 'coulomb', 'repulsion', 'between', 'the', 'fe', '3d', 'electrons', 'do', 'not', 'play', 'any', 'role', 'in', 'determining', 'the', 'electronic', 'and', 'magnetic', 'properties', 'of', 'fega3', 'detailed', 'analysis', 'of', 'results', 'of', 'single', 'crystal', 'and', 'poycrystalline', 'fega3', 'helps', 'to', 'resolve', 'the', 'discrepancy', 'in', 'the', 'electronic', 'and', 'magnetic', 'properties', 'in', 'fega3', 'existing', 'in', 'the', 'literature', 'consistently']]
|
[-0.08657459773655449, 0.12020928870946851, -0.03341340030476983, 0.04725045857734845, -0.035931287596135265, -0.08169541715843869, 0.08328184293516512, 0.46473311153905733, -0.2295393438344555, -0.33911276564800313, -0.014391004009771028, -0.375129941312064, -0.1121432346158794, 0.14163131925826228, 0.07757574581108721, -0.012245643142211651, 0.03142580565698674, -0.07382783071869718, -0.10187769919367773, -0.19057682261835518, 0.27714973809197546, 0.08575861142349563, 0.31699925450208993, 0.16164544187319865, -0.02787145469670317, 0.029468830126071616, 0.03904694139824382, 0.08152129862324468, -0.1258243072023366, 0.07844617579830811, 0.23224695794716743, -0.0703501017115611, 0.19721568508040427, -0.4970361526390272, -0.22779876517098663, 0.00017865987361541816, 0.1423705586768587, 0.13132121205063804, -0.10005437893477002, -0.2552269968403769, 0.061171911483896634, -0.05271027875465474, -0.1174967151742229, -0.11338243511771517, -0.02550672711804509, 0.01637656462179231, -0.2134128304884403, 0.1042334853056153, 0.08689304238650948, 0.14672334501758866, -0.1619052520371042, -0.12343584915589807, -0.09948981593728863, 0.05820427863925163, 0.0634535554505419, 0.03140026039244341, 0.17216170495292837, -0.08677389147092722, -0.13038581337064636, 0.3830835446715355, 0.0010497041445757661, -0.05776626109810812, 0.154247939184175, -0.2239328489705388, -0.17144437219748007, 0.19147063426103808, 0.05005695702732607, 0.09904575514207993, -0.1283212335751159, 0.1030381182387438, -0.042465323492485496, 0.23619718273236814, -0.007228959220395024, 0.10356067208839315, 0.18552638196519444, 0.13078082144077469, -0.03995142104270469, 0.09497151154293014, -0.17675484925857746, -0.03086178842931986, -0.17178907480223904, -0.14993796050049632, -0.2348462589450979, 0.04738942743154309, -0.05402669677059748, -0.20633985514952136, 0.3467116882985075, 0.16138365693124276, 0.15741597450105474, -0.16092360025338295, 0.2548489303062005, 0.06709263508673757, 0.08652237938450916, 0.018067741260996886, 0.29567847022553906, 0.2113439868803003, 0.11950026889930346, -0.3476051609314579, 0.1425484137676124, 0.015804590377956628]
|
1,803.06606
|
Stripes and honeycomb lattice of quantized vortices in rotating
two-component Bose-Einstein condensates
|
We study numerically the structure of a vortex lattice in two-component
Bose-Einstein condensates with equal atomic masses and equal intra- and
inter-component coupling strengths. The numerical simulations of the
Gross-Pitaevskii equation show that the quantized vortices form uncertain
lattice configurations accompanying the vortex stripes, honeycomb lattices, and
their complexes. This is a result of the degeneracy of the system for the SU(2)
symmetric operation, which makes a continuous transformation between the above
structures. In terms of the pseudospin representation, the complex lattice
structures are identified to a hexagonal lattice of doubly-winding
half-skyrmions.
|
cond-mat.quant-gas
|
we study numerically the structure of a vortex lattice in twocomponent boseeinstein condensates with equal atomic masses and equal intra and intercomponent coupling strengths the numerical simulations of the grosspitaevskii equation show that the quantized vortices form uncertain lattice configurations accompanying the vortex stripes honeycomb lattices and their complexes this is a result of the degeneracy of the system for the su2 symmetric operation which makes a continuous transformation between the above structures in terms of the pseudospin representation the complex lattice structures are identified to a hexagonal lattice of doublywinding halfskyrmions
|
[['we', 'study', 'numerically', 'the', 'structure', 'of', 'a', 'vortex', 'lattice', 'in', 'twocomponent', 'boseeinstein', 'condensates', 'with', 'equal', 'atomic', 'masses', 'and', 'equal', 'intra', 'and', 'intercomponent', 'coupling', 'strengths', 'the', 'numerical', 'simulations', 'of', 'the', 'grosspitaevskii', 'equation', 'show', 'that', 'the', 'quantized', 'vortices', 'form', 'uncertain', 'lattice', 'configurations', 'accompanying', 'the', 'vortex', 'stripes', 'honeycomb', 'lattices', 'and', 'their', 'complexes', 'this', 'is', 'a', 'result', 'of', 'the', 'degeneracy', 'of', 'the', 'system', 'for', 'the', 'su2', 'symmetric', 'operation', 'which', 'makes', 'a', 'continuous', 'transformation', 'between', 'the', 'above', 'structures', 'in', 'terms', 'of', 'the', 'pseudospin', 'representation', 'the', 'complex', 'lattice', 'structures', 'are', 'identified', 'to', 'a', 'hexagonal', 'lattice', 'of', 'doublywinding', 'halfskyrmions']]
|
[-0.2358137744857551, 0.21052369730199103, -0.021488679616435708, 0.05524886577584586, -0.03563155729200814, -0.09724595657662376, 0.03432846292443983, 0.40440859453199984, -0.26355471240950157, -0.20641371248044318, 0.04382135583200379, -0.23967010638379788, -0.14905479645796613, 0.08583903262023251, 0.11260994655786308, 0.015519933560146736, 0.01247033186175011, -0.011505076889419458, -0.11222470746437026, -0.2580121023616252, 0.3253985776432923, -0.022647782791774353, 0.3137317588859862, 0.04938427960643402, 0.08311283529945905, -0.025246724194673064, 0.08182328433862754, -0.02029363183652634, -0.1691371967001712, 0.11922043524068462, 0.15327844664372586, -0.07864523911848664, 0.16229939780320848, -0.42567215606078995, -0.17161296319042507, 0.07159876507312919, 0.17307743644546514, 0.18580284827660032, 0.007826407450241046, -0.31301457567938734, 0.02517461378106868, -0.1657182783359191, -0.17304646153166725, -0.09713559974865107, 0.023964184648510845, 0.06839655294431025, -0.25341486032082505, 0.09050519093831938, 0.06957855787906018, 0.08489514682646636, -0.11960510455665517, -0.08383703571974535, -0.09903697381410134, 0.044332656130491456, -0.020154393055466013, 0.014947759054069008, 0.06966534840802734, -0.18686224457009562, -0.1413987596048513, 0.4776026519875114, -0.026661961162872203, -0.21483001227306386, 0.16453383750906522, -0.1357573371094007, -0.045455233239988374, 0.15055512800648974, 0.1237277074839797, 0.06100638191839987, -0.07262938520052357, 0.07704333515625426, -0.12021204255070987, 0.1709913116109629, 0.07893811261465589, 0.04264576689104785, 0.281822177351217, 0.16646397072862792, 0.043513978202059704, 0.1815940922811873, -0.05560301778490072, -0.1912136500558028, -0.2513996868517127, -0.11734441923397174, -0.21458963962824462, 0.04620405468209596, -0.08623461910874639, -0.18928147969091988, 0.37730801866420516, 0.09825814278939596, 0.20880608310459878, -0.030118371522473684, 0.23922339388793643, 0.09838905185461044, 0.06838943525012788, -0.0024219015229411506, 0.1928456750708622, 0.19841026079810256, 0.07038955749166044, -0.3111946026508052, -0.09922534315642174, 0.10172996898232908]
|
1,803.06607
|
Valley Hall Transport of Photon-Dressed Quasiparticles in 2D Dirac
Semiconductors
|
We present a theory of the photovoltaic valley-dependent Hall effect in a
two-dimensional Dirac semiconductor subject to an intense near-resonant
electromagnetic field. Our theory captures and elucidates the influence of both
the field-induced resonant interband transitions and the nonequilibrium carrier
kinetics on the resulting valley Hall transport in terms of photon-dressed
quasiparticles. The non-perturbative renormalization effect of the pump field
manifests itself in the dynamics of the photon-dressed quasiparticles, with a
quasienergy spectrum characterized by {dynamical gaps $\delta_\eta$ ($\eta$ is
the valley index)} that strongly depend on field amplitude and polarization.
Nonequilibrium carrier distribution functions are determined by the pump field
frequency $\omega$ as well as the ratio of intraband relaxation time $\tau$ and
interband recombination time $\tau_{\mathrm{rec}}$. We obtain analytic results
in three regimes, when (I) all relaxation processes are negligible, (II) $\tau
\ll \tau_{\mathrm{rec}}$, and (III) $\tau \gg \tau_{\mathrm{rec}}$, and display
corresponding asymptotic dependences on $\delta_\eta$ and $\omega$. We then
apply our theory to two-dimensional transition-metal dichalcogenides, and find
a strong enhancement of valley-dependent Hall conductivity as the pump field
frequency approaches the transition energies between the pair of spin-resolved
conduction and valence bands at the two valleys.
|
cond-mat.mes-hall
|
we present a theory of the photovoltaic valleydependent hall effect in a twodimensional dirac semiconductor subject to an intense nearresonant electromagnetic field our theory captures and elucidates the influence of both the fieldinduced resonant interband transitions and the nonequilibrium carrier kinetics on the resulting valley hall transport in terms of photondressed quasiparticles the nonperturbative renormalization effect of the pump field manifests itself in the dynamics of the photondressed quasiparticles with a quasienergy spectrum characterized by dynamical gaps delta_eta eta is the valley index that strongly depend on field amplitude and polarization nonequilibrium carrier distribution functions are determined by the pump field frequency omega as well as the ratio of intraband relaxation time tau and interband recombination time tau_mathrmrec we obtain analytic results in three regimes when i all relaxation processes are negligible ii tau ll tau_mathrmrec and iii tau gg tau_mathrmrec and display corresponding asymptotic dependences on delta_eta and omega we then apply our theory to twodimensional transitionmetal dichalcogenides and find a strong enhancement of valleydependent hall conductivity as the pump field frequency approaches the transition energies between the pair of spinresolved conduction and valence bands at the two valleys
|
[['we', 'present', 'a', 'theory', 'of', 'the', 'photovoltaic', 'valleydependent', 'hall', 'effect', 'in', 'a', 'twodimensional', 'dirac', 'semiconductor', 'subject', 'to', 'an', 'intense', 'nearresonant', 'electromagnetic', 'field', 'our', 'theory', 'captures', 'and', 'elucidates', 'the', 'influence', 'of', 'both', 'the', 'fieldinduced', 'resonant', 'interband', 'transitions', 'and', 'the', 'nonequilibrium', 'carrier', 'kinetics', 'on', 'the', 'resulting', 'valley', 'hall', 'transport', 'in', 'terms', 'of', 'photondressed', 'quasiparticles', 'the', 'nonperturbative', 'renormalization', 'effect', 'of', 'the', 'pump', 'field', 'manifests', 'itself', 'in', 'the', 'dynamics', 'of', 'the', 'photondressed', 'quasiparticles', 'with', 'a', 'quasienergy', 'spectrum', 'characterized', 'by', 'dynamical', 'gaps', 'delta_eta', 'eta', 'is', 'the', 'valley', 'index', 'that', 'strongly', 'depend', 'on', 'field', 'amplitude', 'and', 'polarization', 'nonequilibrium', 'carrier', 'distribution', 'functions', 'are', 'determined', 'by', 'the', 'pump', 'field', 'frequency', 'omega', 'as', 'well', 'as', 'the', 'ratio', 'of', 'intraband', 'relaxation', 'time', 'tau', 'and', 'interband', 'recombination', 'time', 'tau_mathrmrec', 'we', 'obtain', 'analytic', 'results', 'in', 'three', 'regimes', 'when', 'i', 'all', 'relaxation', 'processes', 'are', 'negligible', 'ii', 'tau', 'll', 'tau_mathrmrec', 'and', 'iii', 'tau', 'gg', 'tau_mathrmrec', 'and', 'display', 'corresponding', 'asymptotic', 'dependences', 'on', 'delta_eta', 'and', 'omega', 'we', 'then', 'apply', 'our', 'theory', 'to', 'twodimensional', 'transitionmetal', 'dichalcogenides', 'and', 'find', 'a', 'strong', 'enhancement', 'of', 'valleydependent', 'hall', 'conductivity', 'as', 'the', 'pump', 'field', 'frequency', 'approaches', 'the', 'transition', 'energies', 'between', 'the', 'pair', 'of', 'spinresolved', 'conduction', 'and', 'valence', 'bands', 'at', 'the', 'two', 'valleys']]
|
[-0.18506291138964068, 0.24076100764374897, -0.06464794414902204, 0.049300178522734266, -0.010046035677537713, -0.13642317441745513, 0.07667456228396316, 0.3807959795390305, -0.26842722710203626, -0.2422875786763861, -0.05076052300926102, -0.28874781083217577, -0.1537968383660834, 0.17913521676642918, 0.0659469731561809, -0.0009742870926856995, -0.04362989262873797, -0.07916681577549561, -0.054318923782557246, -0.12664851238843863, 0.2960937116981337, -0.008058392057979577, 0.30476246577638544, 0.12665164202304655, 0.03673679259801774, 0.028692100994215396, 0.05426391110461401, -0.006440013438757313, -0.1501409114825181, -0.00440655216378601, 0.23246836529701556, -0.0943566451229057, 0.20371712052361354, -0.4158350660833285, -0.18302837356336807, -0.0034881010737368152, 0.14478792470242632, 0.10062651220390476, -0.027017686245840434, -0.2782336676003117, -0.00950864672072624, -0.12991865522620316, -0.07848676400945374, -0.06420456500736212, 0.04190315187381777, 0.005222484807630903, -0.2736763963586112, 0.12613461702865988, 0.0362876566983208, 0.055888294379569985, -0.07631555918211999, -0.1339257971261089, -0.0874253482496562, 0.07764267119484047, 0.08521797651498529, 0.020063010698772574, 0.18495561609681893, -0.15870192500051894, -0.147354822529872, 0.36149573147505226, -0.11512282625465703, -0.11743045462659976, 0.1662465992089557, -0.24687669237732496, -0.03547435546244838, 0.1770217044867183, 0.12638954889445908, 0.1265585414133966, -0.08291755390979999, 0.13217566344782858, -0.0006006453823494284, 0.13094940386516482, 0.048231783943054704, 0.16712692532639362, 0.23765202478113534, 0.13399592862084606, 0.026277168365317936, 0.09870085463932667, -0.12893757022010457, -0.055711733778987665, -0.28378452163091616, -0.1309638246354696, -0.21651905116527095, 0.11972764869661708, -0.05841634025150837, -0.17892066820671684, 0.45606571014872505, 0.09606297770515085, 0.17514300635207053, -0.003408773441946036, 0.24551464692003241, 0.2353653686311047, 0.016189636273530164, 0.04174207755020593, 0.24813209320173452, 0.20249569208581786, 0.11035301942427299, -0.3821139237402301, 0.0013229372776358535, 0.028123610257171094]
|
1,803.06608
|
Information-Theoretic Security or Covert Communication
|
Information-theoretic secrecy, in particular the wiretap channel formulation,
provides protection against interception of a message by adversary Eve and has
been widely studied in the last two decades. In contrast, covert communications
under an analogous formulation provides protection against even the detection
of the presence of the message by an adversary, and it has drawn significant
interest recently. These two security topics are generally applicable in
different scenarios; however, here we explore what can be learned by studying
them under a common framework. Under a similar but not identical mathematical
formulation, we introduce power optimization problems for each of the secrecy
and the covert communications scenario, and we exploit common aspects of the
problems to employ similar tools in their respective optimizations. Moreover,
due to the practical limitations, we assume only channel
|
cs.CR
|
informationtheoretic secrecy in particular the wiretap channel formulation provides protection against interception of a message by adversary eve and has been widely studied in the last two decades in contrast covert communications under an analogous formulation provides protection against even the detection of the presence of the message by an adversary and it has drawn significant interest recently these two security topics are generally applicable in different scenarios however here we explore what can be learned by studying them under a common framework under a similar but not identical mathematical formulation we introduce power optimization problems for each of the secrecy and the covert communications scenario and we exploit common aspects of the problems to employ similar tools in their respective optimizations moreover due to the practical limitations we assume only channel
|
[['informationtheoretic', 'secrecy', 'in', 'particular', 'the', 'wiretap', 'channel', 'formulation', 'provides', 'protection', 'against', 'interception', 'of', 'a', 'message', 'by', 'adversary', 'eve', 'and', 'has', 'been', 'widely', 'studied', 'in', 'the', 'last', 'two', 'decades', 'in', 'contrast', 'covert', 'communications', 'under', 'an', 'analogous', 'formulation', 'provides', 'protection', 'against', 'even', 'the', 'detection', 'of', 'the', 'presence', 'of', 'the', 'message', 'by', 'an', 'adversary', 'and', 'it', 'has', 'drawn', 'significant', 'interest', 'recently', 'these', 'two', 'security', 'topics', 'are', 'generally', 'applicable', 'in', 'different', 'scenarios', 'however', 'here', 'we', 'explore', 'what', 'can', 'be', 'learned', 'by', 'studying', 'them', 'under', 'a', 'common', 'framework', 'under', 'a', 'similar', 'but', 'not', 'identical', 'mathematical', 'formulation', 'we', 'introduce', 'power', 'optimization', 'problems', 'for', 'each', 'of', 'the', 'secrecy', 'and', 'the', 'covert', 'communications', 'scenario', 'and', 'we', 'exploit', 'common', 'aspects', 'of', 'the', 'problems', 'to', 'employ', 'similar', 'tools', 'in', 'their', 'respective', 'optimizations', 'moreover', 'due', 'to', 'the', 'practical', 'limitations', 'we', 'assume', 'only', 'channel']]
|
[-0.16719359599554798, 0.018703087390211735, -0.08211307724316914, 0.08574411933571383, -0.04498742439671222, -0.2781003821027381, 0.07599194299881205, 0.37491648172197695, -0.26917093763283145, -0.28226556981716194, 0.13599658183749963, -0.23933776068345955, -0.18747527210860315, 0.1690774576907808, -0.17557137320523686, 0.09334975124731885, 0.012540972451185526, 0.03911535132845694, -0.03027741671151792, -0.2820380119321106, 0.3183209501210403, 0.0679838337483957, 0.3306059908848538, 0.05637229568100972, 0.052723863730065976, 0.02934853427789428, -0.022166719698968034, -0.005502896725595223, -0.14114456171536763, 0.09228469601789997, 0.3110290513388022, 0.2027931262679031, 0.3229217045855793, -0.4496264464193673, -0.2813299760278879, 0.11839114668581521, 0.14339439542858268, 0.1288739898167974, -0.0839676508679104, -0.27795251285318623, 0.10243851691484451, -0.20501022821179393, -0.025024800305607532, -0.04856061913552835, -0.05126280116683395, -0.02318579705774248, -0.2634768501280412, -0.016337498570933487, 0.049631665559542, 0.059153107651086015, -0.012185552455555422, -0.07656012544810603, 0.062278700523276, 0.16678291735606213, 0.09454942913373199, -0.02617558254507568, 0.0931945111263882, -0.11950672028416937, -0.15100209958936003, 0.39289988741934806, -0.003771021454171701, -0.2179938180506173, 0.22191437365660077, -0.03999452317260544, -0.1446835889346954, 0.12055023059435895, 0.20682952297625667, 0.08763939360594095, -0.20149781152510762, 0.07098406035573024, -0.06214135732840408, 0.1601237627628231, 0.06903425827410749, 0.12982020298615238, 0.18019559100503102, 0.13681561422753008, 0.07705911203061766, 0.16711829114567742, -0.0773273274202383, -0.15046096262945372, -0.23367986046342235, -0.11450683234689871, -0.1729605463562731, 0.006782326858008288, -0.04853924790310857, -0.05523950262012835, 0.37637461067149136, 0.21555230993368296, 0.10523663845202519, 0.0343550542355374, 0.38760247946519294, 0.06427276335042817, 0.04447121733524413, 0.14207023437219587, 0.2714929457923228, 0.11695761358979243, 0.08618675997113866, -0.13082494618455795, 0.16106233982524523, -0.03588086614300581]
|
1,803.06609
|
Fundamental group of non-singular locus of Lauricella's $F_C$
|
In this paper, we give a set of generators and relations of the fundamental
group of the non-singular locus of Lauricella's hypergeometric functions
|
math.AG
|
in this paper we give a set of generators and relations of the fundamental group of the nonsingular locus of lauricellas hypergeometric functions
|
[['in', 'this', 'paper', 'we', 'give', 'a', 'set', 'of', 'generators', 'and', 'relations', 'of', 'the', 'fundamental', 'group', 'of', 'the', 'nonsingular', 'locus', 'of', 'lauricellas', 'hypergeometric', 'functions']]
|
[-0.23027565095411695, 0.020087959366324154, -0.125891181356881, 0.03979589641802823, -0.08347803702496964, -0.014426134749437157, 0.06500110642113925, 0.2603852227330208, -0.2963426981283271, -0.18983720911099858, 0.06620074579309997, -0.26639704778790474, -0.21914969911069973, 0.25134017707213113, -0.10287400582076414, 0.026247051261041477, -0.00549394556361696, 0.05661309818210809, -0.1626763825264314, -0.2945475439014642, 0.48585632909089327, -0.06638099884857303, 0.18372492459805115, -0.0031627166368391204, 0.1676860612452678, 0.019942956855115684, -0.06522386847063899, -0.07047388597351054, -0.17308976067958967, 0.17469540829567806, 0.3017837308023287, 0.16070157929283121, 0.19631956112773521, -0.367965845634108, -0.05679016760752901, 0.21338975429534912, 0.16754182478736923, 0.009126550153545712, -0.021540303309650524, -0.18108184279307074, 0.0386622520973501, -0.22724288394269737, -0.22268768438421513, -0.05848401566238507, 0.028874872292837372, 0.13328423051406507, -0.21452324157175812, 0.06382327389134013, 0.04974383415411348, 0.15284435957184303, -0.0016925513096477675, -0.10318623385999513, -0.023252331823839442, 0.11271429294720292, 0.031118156226432842, 0.0021136376561354036, 0.04096218735060614, -0.1468448449310887, -0.08280554146546384, 0.408735357184449, 0.01179439590676971, -0.23929059157228988, 0.08893875924505941, -0.19695507459666417, -0.20013102743288744, 0.0557726514728173, 0.1890737092041451, 0.13969289802986642, -0.14473599604452433, 0.14963646439339398, -0.12993049986012603, 0.07511819818097612, 0.08221970166525115, 0.011900435809207998, 0.15842290457500063, 0.09116702806204557, -0.023021551699418087, 0.14062291379694059, 0.08434038528281709, -0.0053075648358334665, -0.46973089096338855, -0.23069446380047695, -0.08364287777689954, 0.09436768455349881, -0.1501078219956506, -0.249126388731858, 0.50770394180132, 0.087590335017961, 0.18273018122367238, 0.13035369522707618, 0.18382874908654587, 0.18928817549844415, 0.021606221957051235, 0.020777516309981762, 0.11128938716390858, 0.19060524569257445, -0.04623591843182626, -0.15310424833518008, -0.03971148424012506, 0.21070663060021141]
|
1,803.0661
|
Can You Pave the Plane Nicely with Identical Tiles
|
Every body knows that identical regular triangles or squares can tile the
whole plane. Many people know that identical regular hexagons can tile the
plane properly as well. In fact, even the bees know and use this fact! Is there
any other convex domain which can tile the Euclidean plane? Yes, there is a
long list of them! To find the list and to show the completeness of the list is
a unique drama in mathematics, which has lasted for more than one century and
the completeness of the list has been mistakenly announced not only once! Up to
now, the list consists of triangles, quadrilaterals, three types of hexagons,
and fifteen types of pentagons. In 2017, Michael Rao announced a computer proof
for the completeness of the list. Meanwhile, Qi Yang and Chuanming Zong made a
series of unexpected discoveries in multiple tilings in the Euclidean plane.
For examples, besides parallelograms and centrally symmetric hexagons, there is
no other convex domain which can form any two-, three- or four-fold translative
tiling in the plane; there are only two types of octagons and one type of
decagons which can form five-fold translative tilings.
|
math.MG math.HO
|
every body knows that identical regular triangles or squares can tile the whole plane many people know that identical regular hexagons can tile the plane properly as well in fact even the bees know and use this fact is there any other convex domain which can tile the euclidean plane yes there is a long list of them to find the list and to show the completeness of the list is a unique drama in mathematics which has lasted for more than one century and the completeness of the list has been mistakenly announced not only once up to now the list consists of triangles quadrilaterals three types of hexagons and fifteen types of pentagons in 2017 michael rao announced a computer proof for the completeness of the list meanwhile qi yang and chuanming zong made a series of unexpected discoveries in multiple tilings in the euclidean plane for examples besides parallelograms and centrally symmetric hexagons there is no other convex domain which can form any two three or fourfold translative tiling in the plane there are only two types of octagons and one type of decagons which can form fivefold translative tilings
|
[['every', 'body', 'knows', 'that', 'identical', 'regular', 'triangles', 'or', 'squares', 'can', 'tile', 'the', 'whole', 'plane', 'many', 'people', 'know', 'that', 'identical', 'regular', 'hexagons', 'can', 'tile', 'the', 'plane', 'properly', 'as', 'well', 'in', 'fact', 'even', 'the', 'bees', 'know', 'and', 'use', 'this', 'fact', 'is', 'there', 'any', 'other', 'convex', 'domain', 'which', 'can', 'tile', 'the', 'euclidean', 'plane', 'yes', 'there', 'is', 'a', 'long', 'list', 'of', 'them', 'to', 'find', 'the', 'list', 'and', 'to', 'show', 'the', 'completeness', 'of', 'the', 'list', 'is', 'a', 'unique', 'drama', 'in', 'mathematics', 'which', 'has', 'lasted', 'for', 'more', 'than', 'one', 'century', 'and', 'the', 'completeness', 'of', 'the', 'list', 'has', 'been', 'mistakenly', 'announced', 'not', 'only', 'once', 'up', 'to', 'now', 'the', 'list', 'consists', 'of', 'triangles', 'quadrilaterals', 'three', 'types', 'of', 'hexagons', 'and', 'fifteen', 'types', 'of', 'pentagons', 'in', '2017', 'michael', 'rao', 'announced', 'a', 'computer', 'proof', 'for', 'the', 'completeness', 'of', 'the', 'list', 'meanwhile', 'qi', 'yang', 'and', 'chuanming', 'zong', 'made', 'a', 'series', 'of', 'unexpected', 'discoveries', 'in', 'multiple', 'tilings', 'in', 'the', 'euclidean', 'plane', 'for', 'examples', 'besides', 'parallelograms', 'and', 'centrally', 'symmetric', 'hexagons', 'there', 'is', 'no', 'other', 'convex', 'domain', 'which', 'can', 'form', 'any', 'two', 'three', 'or', 'fourfold', 'translative', 'tiling', 'in', 'the', 'plane', 'there', 'are', 'only', 'two', 'types', 'of', 'octagons', 'and', 'one', 'type', 'of', 'decagons', 'which', 'can', 'form', 'fivefold', 'translative', 'tilings']]
|
[-0.1412548995497976, 0.06538296769819378, -0.0258488312404855, 0.06433223864526856, -0.11590284536941908, -0.14953396509129865, 0.04862621948996093, 0.37617770419456065, -0.24528519317148798, -0.3016612459323369, 0.14497548064142998, -0.35171075898688287, -0.15105142270598057, 0.17829229456886728, -0.11442110986293604, -0.012189953295698311, 0.0508174852996793, 0.05642902833157374, -0.03511744026218366, -0.35967733013543085, 0.255259254387056, -0.09432534043420067, 0.20001595705010308, 0.01570084095389272, 0.0771129092220993, 0.047816839761253505, 0.002205707845860161, 0.04739716173329119, -0.10988900847140333, 0.08052083712937019, 0.2532488917216445, 0.1638683150461778, 0.21190697270988798, -0.39772483470900016, -0.14703702107605446, 0.15647038126432258, 0.16325634511667886, 0.09864718573711191, -0.04989214007590211, -0.22469776436143243, 0.07800936525381985, -0.0986835714782804, -0.14750067305249104, -0.013535136674666623, 0.08557313669492335, 0.013233981123145592, -0.17812678155557174, -0.00979580568006592, 0.1592167632146205, 0.08502514715504124, -0.0027960607961479886, -0.16380343421769794, -0.06922581761925055, 0.12669784121923536, 0.003949866105055359, 0.078115027116534, 0.03314237088519197, -0.06380400348643889, -0.17292565065145027, 0.4110302638534146, 0.06044456825801111, -0.20175130459513943, 0.1942593771503501, -0.18434897415863816, -0.15791811148659463, 0.16346682955918368, 0.0954074509985124, 0.09326392456447745, -0.16641591818915913, 0.09127202973256014, -0.13546787198477736, 0.17112683351479063, 0.20981762673909543, -0.028404316683615132, 0.23846016947936732, 0.08285281676823313, 0.11916596861040792, 0.15588654126198284, -0.03589875538348982, -0.08002550067855434, -0.2906726856917885, -0.15424524008024795, -0.16839974550930492, 0.01750461855294816, -0.07387247932585221, -0.18614750837150495, 0.3632082442774542, 0.01592044382414315, 0.13869702324276054, 0.022364174769866924, 0.22078270329802763, 0.012077000396554164, 0.11841159760660958, 0.09080185167840682, 0.21091995685371026, 0.06450591430620989, 0.03191314123099195, -0.08017954298217471, 0.029063880998971097, 0.09734045677275087]
|
1,803.06611
|
Active Manipulation of Electromagnetically Induced Transparency in a
Terahertz Hybrid Metamaterial
|
The metamaterial analogue of electromagnetically induced transparency (EIT)
in terahertz (THz) regime holds fascinating prospects for filling the THz gap
in various functional devices. In this paper, we propose a novel hybrid
metamaterial to actively manipulate the resonance strength of EIT effect. By
integrating a monolayer graphene into a THz metal metamaterial, an on-to-off
modulation of the EIT transparency window is achieved under different Fermi
levels of graphene. According to the classical two-particle model and the
distributions of the electric field and surface charge density, the physical
mechanism is attributable to the recombination effect of conductive graphene.
This work reveals a novel manipulation mechanism of EIT resonance in the hybrid
metamaterial and offers a new perspective towards designing THz functional
devices.
|
physics.optics
|
the metamaterial analogue of electromagnetically induced transparency eit in terahertz thz regime holds fascinating prospects for filling the thz gap in various functional devices in this paper we propose a novel hybrid metamaterial to actively manipulate the resonance strength of eit effect by integrating a monolayer graphene into a thz metal metamaterial an ontooff modulation of the eit transparency window is achieved under different fermi levels of graphene according to the classical twoparticle model and the distributions of the electric field and surface charge density the physical mechanism is attributable to the recombination effect of conductive graphene this work reveals a novel manipulation mechanism of eit resonance in the hybrid metamaterial and offers a new perspective towards designing thz functional devices
|
[['the', 'metamaterial', 'analogue', 'of', 'electromagnetically', 'induced', 'transparency', 'eit', 'in', 'terahertz', 'thz', 'regime', 'holds', 'fascinating', 'prospects', 'for', 'filling', 'the', 'thz', 'gap', 'in', 'various', 'functional', 'devices', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'hybrid', 'metamaterial', 'to', 'actively', 'manipulate', 'the', 'resonance', 'strength', 'of', 'eit', 'effect', 'by', 'integrating', 'a', 'monolayer', 'graphene', 'into', 'a', 'thz', 'metal', 'metamaterial', 'an', 'ontooff', 'modulation', 'of', 'the', 'eit', 'transparency', 'window', 'is', 'achieved', 'under', 'different', 'fermi', 'levels', 'of', 'graphene', 'according', 'to', 'the', 'classical', 'twoparticle', 'model', 'and', 'the', 'distributions', 'of', 'the', 'electric', 'field', 'and', 'surface', 'charge', 'density', 'the', 'physical', 'mechanism', 'is', 'attributable', 'to', 'the', 'recombination', 'effect', 'of', 'conductive', 'graphene', 'this', 'work', 'reveals', 'a', 'novel', 'manipulation', 'mechanism', 'of', 'eit', 'resonance', 'in', 'the', 'hybrid', 'metamaterial', 'and', 'offers', 'a', 'new', 'perspective', 'towards', 'designing', 'thz', 'functional', 'devices']]
|
[-0.20649820625250928, 0.19069376241327707, -0.04868977875179373, -0.004464646975975484, -0.07497529985675634, -0.14331469142593997, 0.10014657635522684, 0.4480641826309941, -0.26309587271145185, -0.29448100895243734, -0.08173890188355615, -0.2319298828066873, -0.21840627013497854, 0.21369151410469708, -0.008377879819006409, 0.05601268621885087, -0.04392784169282426, -0.10658498149757728, 0.003850287253668239, -0.062182749767810845, 0.30728604398236786, 0.054550483647718535, 0.3879462713606594, 0.12691965278705644, 0.07530113200326104, -0.011945649167553576, 0.11164956373255892, -0.022182352685579772, -0.1063764934766699, 0.13230890276439417, 0.2594402225665009, -0.049315195465229514, 0.30329020812430163, -0.4399504953425778, -0.2664843268407709, -0.006643021563914689, 0.1310939990495878, 0.14943906533808932, -0.13714436952347966, -0.3343364111155518, 0.03680107717917971, -0.12510916496403823, -0.11714109239598529, -0.023188380536061426, -0.04030994534750338, -0.0564006504425702, -0.2502059388034092, 0.012117810227931285, 0.02726122072690036, 0.06834348280383043, -0.09197208056277364, -0.07381399430734806, 0.03390967812339105, 0.030576209618502166, -0.04822633181764044, -0.011683832561551047, 0.21288065833601455, -0.15555891447338807, -0.1211660241030834, 0.38328892746863286, -0.09160938772588414, -0.07664399651025446, 0.12244872820047924, -0.16750613793977037, 0.027511439055265968, 0.17728373360404484, 0.1653742977256371, 0.10079949703221479, -0.1950359369651222, 0.06269377135923748, -0.012404677901640227, 0.16825694275234848, 0.1203631025100173, 0.15915950061368547, 0.2627959860842829, 0.253396292786645, 0.05957887897437269, 0.18298262718695502, -0.10469073515427722, 0.03636159251582585, -0.2182466152683574, -0.1967233920023461, -0.16580258227484532, 0.07597068173056545, -0.0470143307366241, -0.20292574392385349, 0.46631600035062015, 0.18642146884192412, 0.11988233114508065, -0.09770941871703287, 0.33416083384274453, 0.15180241802999797, 0.0810038603549777, -0.020162012859070596, 0.29336988080527693, 0.17278325502098776, 0.13601744678333277, -0.28268787094722847, -0.005041634829422412, -0.02574145471223068]
|
1,803.06612
|
New form of the exact NSVZ $\beta$-function: the three-loop verification
for terms containing Yukawa couplings
|
We investigate a recently proposed new form of the exact NSVZ
$\beta$-function, which relates the $\beta$-function to the anomalous
dimensions of the quantum gauge superfield, of the Faddeev--Popov ghosts, and
of the chiral matter superfields. Namely, for the general renormalizable ${\cal
N}=1$ supersymmetric gauge theory, regularized by higher covariant derivatives,
the sum of all three-loop contributions to the $\beta$-function containing the
Yukawa couplings is compared with the corresponding two-loop contributions to
the anomalous dimensions of the quantum superfields. It is demonstrated that
for the considered terms both new and original forms of the NSVZ relation are
valid independently of the subtraction scheme if the renormalization group
functions are defined in terms of the bare couplings. This result is obtained
from the equality relating the loop integrals, which, in turn, follows from the
factorization of the integrals for the $\beta$-function into integrals of
double total derivatives. For the renormalization group functions defined in
terms of the renormalized couplings we verify that the NSVZ scheme is obtained
with the higher covariant derivative regularization supplemented by the
subtraction scheme in which only powers of $\ln\Lambda/\mu$ are included into
the renormalization constants.
|
hep-th
|
we investigate a recently proposed new form of the exact nsvz betafunction which relates the betafunction to the anomalous dimensions of the quantum gauge superfield of the faddeevpopov ghosts and of the chiral matter superfields namely for the general renormalizable cal n1 supersymmetric gauge theory regularized by higher covariant derivatives the sum of all threeloop contributions to the betafunction containing the yukawa couplings is compared with the corresponding twoloop contributions to the anomalous dimensions of the quantum superfields it is demonstrated that for the considered terms both new and original forms of the nsvz relation are valid independently of the subtraction scheme if the renormalization group functions are defined in terms of the bare couplings this result is obtained from the equality relating the loop integrals which in turn follows from the factorization of the integrals for the betafunction into integrals of double total derivatives for the renormalization group functions defined in terms of the renormalized couplings we verify that the nsvz scheme is obtained with the higher covariant derivative regularization supplemented by the subtraction scheme in which only powers of lnlambdamu are included into the renormalization constants
|
[['we', 'investigate', 'a', 'recently', 'proposed', 'new', 'form', 'of', 'the', 'exact', 'nsvz', 'betafunction', 'which', 'relates', 'the', 'betafunction', 'to', 'the', 'anomalous', 'dimensions', 'of', 'the', 'quantum', 'gauge', 'superfield', 'of', 'the', 'faddeevpopov', 'ghosts', 'and', 'of', 'the', 'chiral', 'matter', 'superfields', 'namely', 'for', 'the', 'general', 'renormalizable', 'cal', 'n1', 'supersymmetric', 'gauge', 'theory', 'regularized', 'by', 'higher', 'covariant', 'derivatives', 'the', 'sum', 'of', 'all', 'threeloop', 'contributions', 'to', 'the', 'betafunction', 'containing', 'the', 'yukawa', 'couplings', 'is', 'compared', 'with', 'the', 'corresponding', 'twoloop', 'contributions', 'to', 'the', 'anomalous', 'dimensions', 'of', 'the', 'quantum', 'superfields', 'it', 'is', 'demonstrated', 'that', 'for', 'the', 'considered', 'terms', 'both', 'new', 'and', 'original', 'forms', 'of', 'the', 'nsvz', 'relation', 'are', 'valid', 'independently', 'of', 'the', 'subtraction', 'scheme', 'if', 'the', 'renormalization', 'group', 'functions', 'are', 'defined', 'in', 'terms', 'of', 'the', 'bare', 'couplings', 'this', 'result', 'is', 'obtained', 'from', 'the', 'equality', 'relating', 'the', 'loop', 'integrals', 'which', 'in', 'turn', 'follows', 'from', 'the', 'factorization', 'of', 'the', 'integrals', 'for', 'the', 'betafunction', 'into', 'integrals', 'of', 'double', 'total', 'derivatives', 'for', 'the', 'renormalization', 'group', 'functions', 'defined', 'in', 'terms', 'of', 'the', 'renormalized', 'couplings', 'we', 'verify', 'that', 'the', 'nsvz', 'scheme', 'is', 'obtained', 'with', 'the', 'higher', 'covariant', 'derivative', 'regularization', 'supplemented', 'by', 'the', 'subtraction', 'scheme', 'in', 'which', 'only', 'powers', 'of', 'lnlambdamu', 'are', 'included', 'into', 'the', 'renormalization', 'constants']]
|
[-0.15188083458283447, 0.15108458757746646, -0.07841353734673803, 0.10107926483935911, -0.06856100164717412, -0.10821596588839821, -0.011706699715257389, 0.27972222720198137, -0.18784064573583967, -0.24074785610446756, 0.041321407207960195, -0.2826659934169409, -0.17057373783087984, 0.12385709215556943, -0.0008240831931206313, 0.06551350097117178, -0.03526868293544945, 0.0640533005720363, -0.11135907199502708, -0.2990920570415051, 0.36101876336951705, -0.024529631196068012, 0.22506402802459377, 0.1028354954111289, 0.1476339522679461, 0.017563803111486895, -0.06558882461843345, -0.04944589260198614, -0.08106232109085226, 0.12203239208587849, 0.19672003319925246, -0.0071664237277831305, 0.15747693645827632, -0.36365973155069, -0.17878691034664196, 0.05309263953221912, 0.16128280965292596, 0.08496909121980263, 0.02323256844634758, -0.2850660537170336, 0.056758709962823416, -0.21391524433626488, -0.16222271038826933, -0.14040121675673176, -0.0324696381750671, -0.08878758721511791, -0.30526202774661426, 0.10115510867759187, -0.049687813280180175, -0.008966847919898834, -0.020452876761431163, -0.14977524225428243, -0.05717904619215166, 0.11516259833024864, 0.13628000567074527, 0.03277728350753373, 0.08474141748791392, -0.19566000931657213, -0.13743141330255665, 0.41201270252645494, -0.09875422080089762, -0.24387147417042981, 0.08226403204554861, -0.1608589783530025, -0.16091078797972855, 0.11808781622290009, 0.0569829886360841, 0.14692962959061381, -0.17884712307689024, 0.21904798679210663, -0.00534293085914404, 0.0913582951431835, 0.08894984581243785, 0.04119969739978336, 0.12254607215284664, 0.025347744337255684, 0.033594759763841006, 0.10913804356994875, 0.032385703238514175, -0.14347567124152805, -0.4621858166899273, -0.15534395014526034, -0.15465001072697243, 0.03828869799381112, -0.16426372113447751, -0.159054592301581, 0.41574914656524786, 0.13381013586957824, 0.1468352442271111, 0.10195437656593494, 0.27988365314462604, 0.2294473376941872, 0.17212072517915833, 0.02574710662471738, 0.2632586976057566, 0.19695313097809486, 0.02311718486433719, -0.28111662370909785, -0.07139652969943171, 0.22379873632229266]
|
1,803.06613
|
Trajectory-based Scene Understanding using Dirichlet Process Mixture
Model
|
Appropriate modeling of a surveillance scene is essential for detection of
anomalies in road traffic. Learning usual paths can provide valuable insight
into road traffic conditions and thus can help in identifying unusual routes
taken by commuters/vehicles. If usual traffic paths are learned in a
nonparametric way, manual interventions in road marking road can be avoided. In
this paper, we propose an unsupervised and nonparametric method to learn
frequently used paths from the tracks of moving objects in $\Theta(kn)$ time,
where $k$ denotes the number of paths and $n$ represents the number of tracks.
In the proposed method, temporal dependencies of the moving objects are
considered to make the clustering meaningful using Temporally Incremental
Gravity Model (TIGM). In addition, the distance-based scene learning makes it
intuitive to estimate the model parameters. Further, we have extended TIGM
hierarchically as Dynamically Evolving Model (DEM) to represent notable traffic
dynamics of a scene. Experimental validation reveals that the proposed method
can learn a scene quickly without prior knowledge about the number of paths
($k$). We have compared the results with various state-of-the-art methods. We
have also highlighted the advantages of the proposed method over existing
techniques popularly used for designing traffic monitoring applications. It can
be used for administrative decision making to control traffic at junctions or
crowded places and generate alarm signals, if necessary.
|
cs.CV
|
appropriate modeling of a surveillance scene is essential for detection of anomalies in road traffic learning usual paths can provide valuable insight into road traffic conditions and thus can help in identifying unusual routes taken by commutersvehicles if usual traffic paths are learned in a nonparametric way manual interventions in road marking road can be avoided in this paper we propose an unsupervised and nonparametric method to learn frequently used paths from the tracks of moving objects in thetakn time where k denotes the number of paths and n represents the number of tracks in the proposed method temporal dependencies of the moving objects are considered to make the clustering meaningful using temporally incremental gravity model tigm in addition the distancebased scene learning makes it intuitive to estimate the model parameters further we have extended tigm hierarchically as dynamically evolving model dem to represent notable traffic dynamics of a scene experimental validation reveals that the proposed method can learn a scene quickly without prior knowledge about the number of paths k we have compared the results with various stateoftheart methods we have also highlighted the advantages of the proposed method over existing techniques popularly used for designing traffic monitoring applications it can be used for administrative decision making to control traffic at junctions or crowded places and generate alarm signals if necessary
|
[['appropriate', 'modeling', 'of', 'a', 'surveillance', 'scene', 'is', 'essential', 'for', 'detection', 'of', 'anomalies', 'in', 'road', 'traffic', 'learning', 'usual', 'paths', 'can', 'provide', 'valuable', 'insight', 'into', 'road', 'traffic', 'conditions', 'and', 'thus', 'can', 'help', 'in', 'identifying', 'unusual', 'routes', 'taken', 'by', 'commutersvehicles', 'if', 'usual', 'traffic', 'paths', 'are', 'learned', 'in', 'a', 'nonparametric', 'way', 'manual', 'interventions', 'in', 'road', 'marking', 'road', 'can', 'be', 'avoided', 'in', 'this', 'paper', 'we', 'propose', 'an', 'unsupervised', 'and', 'nonparametric', 'method', 'to', 'learn', 'frequently', 'used', 'paths', 'from', 'the', 'tracks', 'of', 'moving', 'objects', 'in', 'thetakn', 'time', 'where', 'k', 'denotes', 'the', 'number', 'of', 'paths', 'and', 'n', 'represents', 'the', 'number', 'of', 'tracks', 'in', 'the', 'proposed', 'method', 'temporal', 'dependencies', 'of', 'the', 'moving', 'objects', 'are', 'considered', 'to', 'make', 'the', 'clustering', 'meaningful', 'using', 'temporally', 'incremental', 'gravity', 'model', 'tigm', 'in', 'addition', 'the', 'distancebased', 'scene', 'learning', 'makes', 'it', 'intuitive', 'to', 'estimate', 'the', 'model', 'parameters', 'further', 'we', 'have', 'extended', 'tigm', 'hierarchically', 'as', 'dynamically', 'evolving', 'model', 'dem', 'to', 'represent', 'notable', 'traffic', 'dynamics', 'of', 'a', 'scene', 'experimental', 'validation', 'reveals', 'that', 'the', 'proposed', 'method', 'can', 'learn', 'a', 'scene', 'quickly', 'without', 'prior', 'knowledge', 'about', 'the', 'number', 'of', 'paths', 'k', 'we', 'have', 'compared', 'the', 'results', 'with', 'various', 'stateoftheart', 'methods', 'we', 'have', 'also', 'highlighted', 'the', 'advantages', 'of', 'the', 'proposed', 'method', 'over', 'existing', 'techniques', 'popularly', 'used', 'for', 'designing', 'traffic', 'monitoring', 'applications', 'it', 'can', 'be', 'used', 'for', 'administrative', 'decision', 'making', 'to', 'control', 'traffic', 'at', 'junctions', 'or', 'crowded', 'places', 'and', 'generate', 'alarm', 'signals', 'if', 'necessary']]
|
[-0.0845756566702974, 0.06873793821689426, -0.12209852357348638, 0.06545224018727863, -0.12026232646091323, -0.16339881365014686, 0.0732065677251435, 0.44360466210416, -0.25772662947325214, -0.3614345217351191, 0.0665441434071884, -0.2533451102282093, -0.16081896936231213, 0.2008149734302108, -0.14029059594294807, 0.09722798210895321, 0.0919905892442659, 0.06324059343873102, -0.0019686641666734786, -0.24765895979955152, 0.24822301243825493, 0.007471432285678333, 0.2969038143577012, 0.018837812523108937, 0.09270638752121867, 0.00793056639450775, -0.08212764124803211, 0.031752560287714005, -0.07159104485637471, 0.12569754755380458, 0.3521540315950298, 0.1968996698417115, 0.27297355585238514, -0.45534427601388944, -0.2865911965933734, 0.12258936936347598, 0.16886767671981878, 0.09491217650506831, -0.009720263178818501, -0.3442255710483407, 0.09588318897149951, -0.13773707956037742, -0.08278611582720745, -0.10308337118898042, -0.01017489094219731, -0.003951475696640333, -0.276510774895414, 0.025053590008166166, 0.028578646357247092, 0.04459851178471252, -0.03630777103910686, -0.08150703787837363, -0.007892893459247551, 0.19694648415526603, 0.04048268423400971, 0.012039980468681563, 0.13736418728206762, -0.13965329901990586, -0.127935767496148, 0.40157152824335607, -0.025330996814044826, -0.1933126034524831, 0.19236060078740458, -0.013997525268032034, -0.13447168569093174, 0.1393317728960777, 0.22424770420105344, 0.11910081473842887, -0.1973458218148054, -0.0049426956386705734, -0.024556337126711913, 0.12923100186781578, 0.06301783678033368, -0.0074285775237628235, 0.19996681260455998, 0.2364105932852801, 0.09693548490495602, 0.11657294978090557, -0.13855764485170805, -0.06495632435304716, -0.23164736735397462, -0.12215253202470096, -0.13447614857817397, -0.029393925752945884, -0.12885896213920534, -0.12656267613714572, 0.3748585959449748, 0.263625590562635, 0.1969691485190781, 0.060698746453680424, 0.33570496872071665, 0.04391297058684844, 0.07401243131397064, 0.10464338580045293, 0.13844840476611772, 0.02923909447164321, 0.13004588194315772, -0.17814414468446402, 0.13881248193152979, 0.052181257277398425]
|
1,803.06614
|
On existence of out-of-plane equilibrium points in restricted three-body
problem with oblateness
|
We analyze in this paper the existence of the "out-of-plane" equilibrium
points in the restricted three-body problem with oblateness. From the series
expansion of the potential function of an oblate asteroid, we show analytically
all equilibrium points locate on the orbital plane of primaries and how
artificial equilibrium points may arise due to an inappropriate application of
the potential function. Using the closed form of the potential of a triaxial
ellipsoid, we analytically demonstrate that the gravitational acceleration in
$z$-direction is always pointing toward the equatorial plane, thus it could not
be balanced out at any value of $z\neq 0$ and the out-of-plane equilibrium
points cannot exist. The out-of-plane equilibrium points appear only when
additional acceleration other than the gravitation from primaries is taken into
account. We suggest that special attention must be paid to the application of
the spherical harmonics expansion of potential to find the equilibrium points,
especially when these points may be very close to the celestial body.
|
astro-ph.EP
|
we analyze in this paper the existence of the outofplane equilibrium points in the restricted threebody problem with oblateness from the series expansion of the potential function of an oblate asteroid we show analytically all equilibrium points locate on the orbital plane of primaries and how artificial equilibrium points may arise due to an inappropriate application of the potential function using the closed form of the potential of a triaxial ellipsoid we analytically demonstrate that the gravitational acceleration in zdirection is always pointing toward the equatorial plane thus it could not be balanced out at any value of zneq 0 and the outofplane equilibrium points cannot exist the outofplane equilibrium points appear only when additional acceleration other than the gravitation from primaries is taken into account we suggest that special attention must be paid to the application of the spherical harmonics expansion of potential to find the equilibrium points especially when these points may be very close to the celestial body
|
[['we', 'analyze', 'in', 'this', 'paper', 'the', 'existence', 'of', 'the', 'outofplane', 'equilibrium', 'points', 'in', 'the', 'restricted', 'threebody', 'problem', 'with', 'oblateness', 'from', 'the', 'series', 'expansion', 'of', 'the', 'potential', 'function', 'of', 'an', 'oblate', 'asteroid', 'we', 'show', 'analytically', 'all', 'equilibrium', 'points', 'locate', 'on', 'the', 'orbital', 'plane', 'of', 'primaries', 'and', 'how', 'artificial', 'equilibrium', 'points', 'may', 'arise', 'due', 'to', 'an', 'inappropriate', 'application', 'of', 'the', 'potential', 'function', 'using', 'the', 'closed', 'form', 'of', 'the', 'potential', 'of', 'a', 'triaxial', 'ellipsoid', 'we', 'analytically', 'demonstrate', 'that', 'the', 'gravitational', 'acceleration', 'in', 'zdirection', 'is', 'always', 'pointing', 'toward', 'the', 'equatorial', 'plane', 'thus', 'it', 'could', 'not', 'be', 'balanced', 'out', 'at', 'any', 'value', 'of', 'zneq', '0', 'and', 'the', 'outofplane', 'equilibrium', 'points', 'can', 'not', 'exist', 'the', 'outofplane', 'equilibrium', 'points', 'appear', 'only', 'when', 'additional', 'acceleration', 'other', 'than', 'the', 'gravitation', 'from', 'primaries', 'is', 'taken', 'into', 'account', 'we', 'suggest', 'that', 'special', 'attention', 'must', 'be', 'paid', 'to', 'the', 'application', 'of', 'the', 'spherical', 'harmonics', 'expansion', 'of', 'potential', 'to', 'find', 'the', 'equilibrium', 'points', 'especially', 'when', 'these', 'points', 'may', 'be', 'very', 'close', 'to', 'the', 'celestial', 'body']]
|
[-0.15132517621415542, 0.0950197512788747, -0.12171836638317247, 0.054802996360116214, -0.06474581522217457, -0.09325200984151, 0.04299012193367184, 0.354149836782412, -0.2686569294676668, -0.2533588688073243, 0.07581901574653953, -0.2794807433311678, -0.139712110143816, 0.16858868700463647, -0.028434808484212506, 0.014245529400391711, 0.06435061242132459, 0.03012947969707764, -0.06051802709353743, -0.2267442960292101, 0.3139034270590608, 0.03655865854356599, 0.19818892596967885, 0.03361501206390927, 0.04192140279912654, -0.0034808466803098533, 0.0588745915512037, 0.05126630588733579, -0.11952130799370396, 0.04929376536632463, 0.22255204394201022, 0.0627735948253331, 0.2520701898905782, -0.42172549736835524, -0.17525738354680348, 0.16885594743947832, 0.18456026283523966, 0.13672969141906058, -0.0224507129923613, -0.23855203136307312, 0.057588987090886445, -0.13857467430011358, -0.2301085052933087, -0.0802098001787485, 0.04425788074616849, 0.056022059596732926, -0.24037901516773819, 0.05213978053013116, 0.07430312431267934, 0.061542241684632536, -0.13207371977594806, -0.14543817326265537, -0.07701310707704613, 0.11768304722212589, 0.10995632869831573, 0.07245482555820526, 0.1435559930662153, -0.09838138409620036, -0.034894905570480556, 0.4467299199306671, -0.009688027294077422, -0.21708859084748927, 0.15376270910057405, -0.19789606738507887, -0.0841050910372517, 0.1456050962004178, 0.16908981060655212, 0.11052907289316256, -0.11524615958020419, 0.08364605805606662, -0.0037501397051124107, 0.1231869739037651, 0.09946874764828402, -0.045950247923395145, 0.319994700812795, 0.05255610866897544, 0.1004093345687624, 0.15511971001943034, -0.11734410608043595, -0.12275305938084874, -0.29225458133459825, -0.11643372602001936, -0.18700534657411347, 0.07339986870341997, -0.10858859351162804, -0.17139502051918779, 0.3543474252700783, 0.1489297156581471, 0.19473832569452992, -0.018577700285355984, 0.278315927453891, 0.13106508495179753, 0.048636079018498646, 0.09996766021854624, 0.3376952988486507, 0.06845561807319799, 0.054176363418522624, -0.22650842136598515, 0.03162861557319519, 0.030972016222177098]
|
1,803.06615
|
Feature Selection of Post-Graduation Income of College Students in the
United States
|
This study investigated the most important attributes of the 6-year
post-graduation income of college graduates who used financial aid during their
time at college in the United States. The latest data released by the United
States Department of Education was used. Specifically, 1,429 cohorts of
graduates from three years (2001, 2003, and 2005) were included in the data
analysis. Three attribute selection methods, including filter methods, forward
selection, and Genetic Algorithm, were applied to the attribute selection from
30 relevant attributes. Five groups of machine learning algorithms were applied
to the dataset for classification using the best selected attribute subsets.
Based on our findings, we discuss the role of neighborhood professional degree
attainment, parental income, SAT scores, and family college education in
post-graduation incomes and the implications for social stratification.
|
cs.CY
|
this study investigated the most important attributes of the 6year postgraduation income of college graduates who used financial aid during their time at college in the united states the latest data released by the united states department of education was used specifically 1429 cohorts of graduates from three years 2001 2003 and 2005 were included in the data analysis three attribute selection methods including filter methods forward selection and genetic algorithm were applied to the attribute selection from 30 relevant attributes five groups of machine learning algorithms were applied to the dataset for classification using the best selected attribute subsets based on our findings we discuss the role of neighborhood professional degree attainment parental income sat scores and family college education in postgraduation incomes and the implications for social stratification
|
[['this', 'study', 'investigated', 'the', 'most', 'important', 'attributes', 'of', 'the', '6year', 'postgraduation', 'income', 'of', 'college', 'graduates', 'who', 'used', 'financial', 'aid', 'during', 'their', 'time', 'at', 'college', 'in', 'the', 'united', 'states', 'the', 'latest', 'data', 'released', 'by', 'the', 'united', 'states', 'department', 'of', 'education', 'was', 'used', 'specifically', '1429', 'cohorts', 'of', 'graduates', 'from', 'three', 'years', '2001', '2003', 'and', '2005', 'were', 'included', 'in', 'the', 'data', 'analysis', 'three', 'attribute', 'selection', 'methods', 'including', 'filter', 'methods', 'forward', 'selection', 'and', 'genetic', 'algorithm', 'were', 'applied', 'to', 'the', 'attribute', 'selection', 'from', '30', 'relevant', 'attributes', 'five', 'groups', 'of', 'machine', 'learning', 'algorithms', 'were', 'applied', 'to', 'the', 'dataset', 'for', 'classification', 'using', 'the', 'best', 'selected', 'attribute', 'subsets', 'based', 'on', 'our', 'findings', 'we', 'discuss', 'the', 'role', 'of', 'neighborhood', 'professional', 'degree', 'attainment', 'parental', 'income', 'sat', 'scores', 'and', 'family', 'college', 'education', 'in', 'postgraduation', 'incomes', 'and', 'the', 'implications', 'for', 'social', 'stratification']]
|
[0.01685682384413667, 0.028141934644736466, -0.10014754523456304, 0.11704923866909667, -0.1055625199496717, -0.11151343423262006, 0.11789654055974097, 0.3777808948652819, -0.18542168496514932, -0.3868355614540633, 0.1280863714428051, -0.3039083764742827, -0.11284720943331195, 0.1945339299054467, -0.10476964378858611, 0.0363474181640413, 0.10223489844247524, 0.007968852412886918, 0.052993330395111116, -0.38668445733401313, 0.2969836325100914, 0.07326719952834537, 0.38735851770616136, -0.014101000717346324, 0.07158400967637135, 0.025108735634603363, -0.11346545230480842, -0.011264238753938116, -0.1107583445518685, 0.1605142599082683, 0.3705975516404578, 0.2350895426570787, 0.425029936057399, -0.3945812016099808, -0.1429278140558381, 0.05522135706996778, 0.04737009468226461, 0.07494043630140368, 0.01433978565455618, -0.34135596361011267, -0.02600055565017101, -0.19777852809772867, -0.08803877430545981, -0.05622952824569438, 0.016856836737133563, 0.0003518848308772249, -0.20927984209811257, 0.05295877294975071, -0.03866405720691546, 0.2037299448857084, -0.0949283932304752, -0.26205752764144563, -0.056357363691859064, 0.2056789104353811, 0.06491881512920372, -0.018303462365111045, 0.14772038787123165, -0.14680286081966187, -0.21512032277405524, 0.34772372529687345, -0.00911230374185834, -0.0499475021915714, 0.1887754519284499, -0.09877447132384987, -0.20209492155481712, 0.05834241004777141, 0.27998716031652293, 0.0671516276197508, -0.18209285011835163, 0.017445213215978583, -0.020667586355557432, 0.1429219977617322, 0.10353801017481601, -0.08000251781049883, 0.15227560200492007, 0.1615769967174856, -0.02098497477345518, 0.11807773679538514, -0.14088559451738547, -0.0656910030875224, -0.19175878455371276, -0.12492280227706942, -0.13083764582552249, -0.02308192889995553, -0.06588388937734635, -0.06634831647352257, 0.44189993088366464, 0.14466921392158838, 0.10355971126409713, 0.00013788711112283636, 0.1930651031070738, 0.007932630393952422, 0.07408820621094492, 0.11291505822373438, 0.193891630100552, 0.03338981675369723, 0.17300389428055496, -0.1697679667668126, 0.13727476174244657, 0.021900632556025812]
|
1,803.06616
|
Actively controlling the topological transition of dispersion based on
electrically controllable metamaterials
|
Topological transition of the iso-frequency contour (IFC) from a closed
ellipsoid to an open hyperboloid, will provide unique capabilities for
controlling the propagation of light. However, the ability to actively tune
these effects remains elusive and the related experimental observations are
highly desirable. Here, tunable electric IFC in periodic structure which is
composed of graphene/dielectric multilayers is investigated by tuning the
chemical potential of graphene layer. Specially, we present the actively
controlled transportation in two kinds of anisotropic zero-index media
containing PEC/PMC impurities. At last, by adding variable capacitance diodes
into two-dimensional transmission-line system, we present the experimental
demonstration of the actively controlled magnetic topological transition of
dispersion based on electrically controllable metamaterials. With the increase
of voltage, we measure the different emission patterns from a point source
inside the structure and observe the phase-transition process of IFCs. The
realization of actively tuned topological transition will opens up a new avenue
in the dynamical control of metamaterials.
|
physics.optics
|
topological transition of the isofrequency contour ifc from a closed ellipsoid to an open hyperboloid will provide unique capabilities for controlling the propagation of light however the ability to actively tune these effects remains elusive and the related experimental observations are highly desirable here tunable electric ifc in periodic structure which is composed of graphenedielectric multilayers is investigated by tuning the chemical potential of graphene layer specially we present the actively controlled transportation in two kinds of anisotropic zeroindex media containing pecpmc impurities at last by adding variable capacitance diodes into twodimensional transmissionline system we present the experimental demonstration of the actively controlled magnetic topological transition of dispersion based on electrically controllable metamaterials with the increase of voltage we measure the different emission patterns from a point source inside the structure and observe the phasetransition process of ifcs the realization of actively tuned topological transition will opens up a new avenue in the dynamical control of metamaterials
|
[['topological', 'transition', 'of', 'the', 'isofrequency', 'contour', 'ifc', 'from', 'a', 'closed', 'ellipsoid', 'to', 'an', 'open', 'hyperboloid', 'will', 'provide', 'unique', 'capabilities', 'for', 'controlling', 'the', 'propagation', 'of', 'light', 'however', 'the', 'ability', 'to', 'actively', 'tune', 'these', 'effects', 'remains', 'elusive', 'and', 'the', 'related', 'experimental', 'observations', 'are', 'highly', 'desirable', 'here', 'tunable', 'electric', 'ifc', 'in', 'periodic', 'structure', 'which', 'is', 'composed', 'of', 'graphenedielectric', 'multilayers', 'is', 'investigated', 'by', 'tuning', 'the', 'chemical', 'potential', 'of', 'graphene', 'layer', 'specially', 'we', 'present', 'the', 'actively', 'controlled', 'transportation', 'in', 'two', 'kinds', 'of', 'anisotropic', 'zeroindex', 'media', 'containing', 'pecpmc', 'impurities', 'at', 'last', 'by', 'adding', 'variable', 'capacitance', 'diodes', 'into', 'twodimensional', 'transmissionline', 'system', 'we', 'present', 'the', 'experimental', 'demonstration', 'of', 'the', 'actively', 'controlled', 'magnetic', 'topological', 'transition', 'of', 'dispersion', 'based', 'on', 'electrically', 'controllable', 'metamaterials', 'with', 'the', 'increase', 'of', 'voltage', 'we', 'measure', 'the', 'different', 'emission', 'patterns', 'from', 'a', 'point', 'source', 'inside', 'the', 'structure', 'and', 'observe', 'the', 'phasetransition', 'process', 'of', 'ifcs', 'the', 'realization', 'of', 'actively', 'tuned', 'topological', 'transition', 'will', 'opens', 'up', 'a', 'new', 'avenue', 'in', 'the', 'dynamical', 'control', 'of', 'metamaterials']]
|
[-0.17546501983470547, 0.20320757644824483, -0.03439429285637557, -0.034874119422301404, -0.08762910883897582, -0.1806083973206114, 0.07593196469585961, 0.44390668240017617, -0.30177605388542783, -0.2973179777976699, 0.03249459232849917, -0.2886328663085945, -0.18478711597242345, 0.21492140539265117, 0.00740481512203144, 0.08747982770317975, -0.043337676412193105, -0.0715298383130665, -0.0409199840699633, -0.14488738569586226, 0.326340226838604, 0.014563622292674458, 0.31566000145633155, 0.07012832495204818, 0.08619095299106377, -0.026522346573750466, 0.0403550273577611, 0.009927277706969434, -0.13336933918822652, 0.13105443010751444, 0.21533264665273377, -0.037643789286868505, 0.21929246820927334, -0.4438267218095298, -0.24150894604957637, 0.011093324538356123, 0.17023368312033993, 0.10842884320523948, -0.14574488217924506, -0.3204828596626146, 0.06481743620660825, -0.10166524216616288, -0.1657038230317621, -0.09101816792136584, 0.0019485236127645923, 0.019026704009425324, -0.20588174982978485, 0.003494535915356559, 0.022596415494776104, 0.05749310774412245, -0.07948903570650145, -0.049845978524386644, -0.024273262933815997, 0.13502428285163404, -0.040343671971641015, 0.006373778821375125, 0.19417722418140143, -0.13522621907162455, -0.11235062759190512, 0.3543017575911318, -0.050295493476695784, -0.1621334484229103, 0.15980056717018717, -0.13933503157395769, -0.04582015809137374, 0.14901898103431824, 0.20179253301709346, 0.08834175919391549, -0.17670653187087737, 0.050483036307970255, 0.020122573822169587, 0.1776547757313566, 0.057740612412229754, 0.07671734110977596, 0.2854616076130277, 0.23633393999905541, 0.04406536695732472, 0.20620119698548642, -0.07547155131947082, -0.052026722993618116, -0.2494508835654228, -0.15821988412883514, -0.170654998090751, 0.06397925660712644, -0.06195434400172253, -0.2061489768929254, 0.4390452466308115, 0.1675914551059787, 0.15765666449741006, -0.07317644074254741, 0.2692116220923475, 0.08372531299130806, 0.08291751113257562, 0.018463843255841102, 0.28205249660487214, 0.1347466339237797, 0.10984497697641835, -0.23539917844120795, 0.05331057868375538, -0.019150121182274934]
|
1,803.06617
|
Towards an Area-Efficient Implementation of a High ILP EDGE Soft
Processor
|
In-order scalar RISC architectures have been the dominant paradigm in FPGA
soft processor design for twenty years. Prior out-of-order superscalar
implementations have not exhibited competitive area or absolute performance.
This paper describes a new way to build fast and area-efficient out-of-order
superscalar soft processors by utilizing an Explicit Data Graph Execution
(EDGE) instruction set architecture. By carefully mapping the EDGE
microarchitecture, and in particular, its dataflow instruction scheduler, we
demonstrate the feasibility of an out-of-order FPGA architecture. Two scheduler
design alternatives are compared.
|
cs.AR
|
inorder scalar risc architectures have been the dominant paradigm in fpga soft processor design for twenty years prior outoforder superscalar implementations have not exhibited competitive area or absolute performance this paper describes a new way to build fast and areaefficient outoforder superscalar soft processors by utilizing an explicit data graph execution edge instruction set architecture by carefully mapping the edge microarchitecture and in particular its dataflow instruction scheduler we demonstrate the feasibility of an outoforder fpga architecture two scheduler design alternatives are compared
|
[['inorder', 'scalar', 'risc', 'architectures', 'have', 'been', 'the', 'dominant', 'paradigm', 'in', 'fpga', 'soft', 'processor', 'design', 'for', 'twenty', 'years', 'prior', 'outoforder', 'superscalar', 'implementations', 'have', 'not', 'exhibited', 'competitive', 'area', 'or', 'absolute', 'performance', 'this', 'paper', 'describes', 'a', 'new', 'way', 'to', 'build', 'fast', 'and', 'areaefficient', 'outoforder', 'superscalar', 'soft', 'processors', 'by', 'utilizing', 'an', 'explicit', 'data', 'graph', 'execution', 'edge', 'instruction', 'set', 'architecture', 'by', 'carefully', 'mapping', 'the', 'edge', 'microarchitecture', 'and', 'in', 'particular', 'its', 'dataflow', 'instruction', 'scheduler', 'we', 'demonstrate', 'the', 'feasibility', 'of', 'an', 'outoforder', 'fpga', 'architecture', 'two', 'scheduler', 'design', 'alternatives', 'are', 'compared']]
|
[-0.2172034449920238, 0.008222328479673871, -0.04962217058223414, -0.011356816263813302, -0.1291036005692938, -0.26932235572666646, 0.05962440084402326, 0.5152845767562289, -0.23432833748499313, -0.3957538751054959, 0.10698191867860775, -0.19817741963092284, -0.1424817573587713, 0.20223537360946367, -0.12216241945546255, 0.14181484391629495, 0.1449778666348107, -0.01389555814844298, -0.025505468052913958, -0.27611094917043066, 0.20948963199394294, 0.08900303127670503, 0.33178310671047007, -0.0005932645255093833, 0.06022663685599768, -0.06165594230574298, 0.0045108707307512505, -0.08342505333922713, -0.00886961886187993, 0.127831153055451, 0.29171577791672154, 0.2421279766467815, 0.3199582289264773, -0.5299055226685772, -0.0934577680091901, 0.043815638987818754, 0.12662446981924305, 0.0015985470388578363, -0.058361811703632034, -0.2533365452145956, 0.11054446265460496, -0.2828812355467354, 0.021645692261272526, -0.0848609602474327, 0.004743612775332238, 0.008862517656287155, -0.20548627367916417, -0.10230347060834069, 0.04246505966454924, 0.019289809475507003, 0.016806442277921163, -0.14297366852546672, 0.07259514431065195, 0.09184153048259891, -0.07758801396801529, 0.07165460479838481, 0.18990781552618347, -0.08255567148619566, -0.25096334792050834, 0.31848315506365643, 0.04027706175952791, -0.15957159003669238, 0.13678243414061256, 0.04965338156928858, -0.1867620233973735, 0.0838875121897064, 0.24600521163139716, 0.009353541459815285, -0.21653308519667172, 0.09905643486670297, 0.03509179022477334, 0.22548501536878476, 0.1005554415891508, 0.06491126713668366, 0.19602600622260158, 0.30658722944636213, 0.04204041848004044, 0.1996826264244246, -0.05141999366053616, -0.09808033657630524, -0.2033696514778737, -0.16117261678922967, -0.1600821856184896, -0.058501676608442264, -0.10118584281516665, -0.11736044341541198, 0.421247438785721, 0.1670247064538704, 0.08695533936731069, 0.1351863852174706, 0.4316293062215828, 0.021000349892938724, 0.19872738976951643, 0.21755102275679988, 0.11048835021140704, -0.0087050029570349, 0.16384586842214488, -0.1925504378054336, 0.059169304346755505, -0.01005812697898013]
|
1,803.06618
|
Simple mechanisms that impede the Berry phase identification from
magneto-oscillations
|
The phase of quantum magneto-oscillations is often associated with the Berry
phase and is widely used to argue in favor of topological nontriviality of the
system (Berry phase $2\pi n+\pi$). Nevertheless, the experimentally determined
value may deviate from $2\pi n+\pi$ arbitrarily, therefore more care should be
made analyzing the phase of magneto-oscillations to distinguish trivial systems
from nontrivial. In this paper we suggest two simple mechanisms dramatically
affecting the experimentally observed value of the phase in three-dimensional
topological insulators: (i) magnetic field dependence of the chemical
potential, and (ii) possible nonuniformity of the system. These mechanisms are
not limited to topological insulators and can be extended to other
topologically trivial and non-trivial systems.
|
cond-mat.str-el cond-mat.mes-hall
|
the phase of quantum magnetooscillations is often associated with the berry phase and is widely used to argue in favor of topological nontriviality of the system berry phase 2pi npi nevertheless the experimentally determined value may deviate from 2pi npi arbitrarily therefore more care should be made analyzing the phase of magnetooscillations to distinguish trivial systems from nontrivial in this paper we suggest two simple mechanisms dramatically affecting the experimentally observed value of the phase in threedimensional topological insulators i magnetic field dependence of the chemical potential and ii possible nonuniformity of the system these mechanisms are not limited to topological insulators and can be extended to other topologically trivial and nontrivial systems
|
[['the', 'phase', 'of', 'quantum', 'magnetooscillations', 'is', 'often', 'associated', 'with', 'the', 'berry', 'phase', 'and', 'is', 'widely', 'used', 'to', 'argue', 'in', 'favor', 'of', 'topological', 'nontriviality', 'of', 'the', 'system', 'berry', 'phase', '2pi', 'npi', 'nevertheless', 'the', 'experimentally', 'determined', 'value', 'may', 'deviate', 'from', '2pi', 'npi', 'arbitrarily', 'therefore', 'more', 'care', 'should', 'be', 'made', 'analyzing', 'the', 'phase', 'of', 'magnetooscillations', 'to', 'distinguish', 'trivial', 'systems', 'from', 'nontrivial', 'in', 'this', 'paper', 'we', 'suggest', 'two', 'simple', 'mechanisms', 'dramatically', 'affecting', 'the', 'experimentally', 'observed', 'value', 'of', 'the', 'phase', 'in', 'threedimensional', 'topological', 'insulators', 'i', 'magnetic', 'field', 'dependence', 'of', 'the', 'chemical', 'potential', 'and', 'ii', 'possible', 'nonuniformity', 'of', 'the', 'system', 'these', 'mechanisms', 'are', 'not', 'limited', 'to', 'topological', 'insulators', 'and', 'can', 'be', 'extended', 'to', 'other', 'topologically', 'trivial', 'and', 'nontrivial', 'systems']]
|
[-0.20984766741419228, 0.22060205308572117, -0.09644065466833061, 0.056956223538763555, -0.0750854105433136, -0.17790325443400481, 0.07639143625336114, 0.3447726198010542, -0.27674216038621635, -0.2875243771936646, 0.04496463880754711, -0.2711389836952074, -0.20951005532941988, 0.18900890283665694, -0.057651715802824105, 0.054524466531367694, -0.02289868030383919, -0.010000270750142832, -0.11568925645155008, -0.20061973096654478, 0.33333926718162815, -0.03267246711096702, 0.2722446040077283, 0.08813290873262207, -0.017762941118758337, -0.0709607593748158, 0.042027087441225235, 0.06581600003801616, -0.11703072578967673, 0.029835091945014696, 0.26080362115516864, -0.013108306197630884, 0.12941574821232166, -0.45223263186295476, -0.22763227574955835, 0.12319306712762444, 0.14969456732784092, 0.13384899377526172, -0.018927600954487235, -0.33271205162349266, 0.0939244195892047, -0.1459967016893546, -0.12226966818675102, -0.12792767979929934, 0.021070589881134836, -0.06650239562170696, -0.19996202438740077, 0.05115500041098227, 0.03940267797015541, 0.07079220803833641, -0.06881584873241661, -0.10639551770873368, -0.08645010506322162, 0.12598610507423239, 0.06384802118059149, 0.04923875149817462, 0.09921853791971781, -0.13819566399654357, -0.12771252061001362, 0.4077967979442493, -0.013291482356236835, -0.16046571847853927, 0.18423831215503303, -0.18048960161683833, -0.0955841784258332, 0.18349879263875496, 0.09779668275001088, 0.07076515571782942, -0.10998896196220828, 0.06348556501634287, 0.06071955961818123, 0.17171581264222618, -0.02233338768519791, 0.10435980033393191, 0.2698464614248513, 0.08716147289965796, 0.033571026576435674, 0.12406158844365499, -0.07322905922722714, -0.12219886973024288, -0.26996579882482774, -0.17887027419802726, -0.2147706689115251, 0.07021735850693267, -0.03935987677835175, -0.17892710816741517, 0.42474194725695175, 0.18933590321154622, 0.1788985454271325, -0.06276819014105847, 0.2544813476280367, 0.1364290300917408, 0.054665142835109634, 0.017845769824905204, 0.29703743366804797, 0.10708558468758005, 0.10319019911761305, -0.25076572932055696, 0.0799687454617063, 0.01543829339119581]
|
1,803.06619
|
The impact of Hubbard- and van der Waals-corrections on the DFT
calculation of epsilon-zeta transition pressure in solid oxygen
|
The aim of this study is to clarify the physics which governs the transition
from epsilon phase to zeta phase of solid oxygen observed experimentally at 96
GPa using density functional theory (DFT). The transition was predicted at 40
GPa with PBE functional. Then the Hubbard correction was added to enhance the
localization of p-orbital of oxygen. The epsilon-zeta transition pressure was
significantly improved to 70 GPa. Finally, we included the non-local van der
Waals correction. The transition pressure slightly increases to 80 GPa. These
results demonstrate that the contribution from Hubbard term is superior to van
der Waals term.
|
cond-mat.mtrl-sci
|
the aim of this study is to clarify the physics which governs the transition from epsilon phase to zeta phase of solid oxygen observed experimentally at 96 gpa using density functional theory dft the transition was predicted at 40 gpa with pbe functional then the hubbard correction was added to enhance the localization of porbital of oxygen the epsilonzeta transition pressure was significantly improved to 70 gpa finally we included the nonlocal van der waals correction the transition pressure slightly increases to 80 gpa these results demonstrate that the contribution from hubbard term is superior to van der waals term
|
[['the', 'aim', 'of', 'this', 'study', 'is', 'to', 'clarify', 'the', 'physics', 'which', 'governs', 'the', 'transition', 'from', 'epsilon', 'phase', 'to', 'zeta', 'phase', 'of', 'solid', 'oxygen', 'observed', 'experimentally', 'at', '96', 'gpa', 'using', 'density', 'functional', 'theory', 'dft', 'the', 'transition', 'was', 'predicted', 'at', '40', 'gpa', 'with', 'pbe', 'functional', 'then', 'the', 'hubbard', 'correction', 'was', 'added', 'to', 'enhance', 'the', 'localization', 'of', 'porbital', 'of', 'oxygen', 'the', 'epsilonzeta', 'transition', 'pressure', 'was', 'significantly', 'improved', 'to', '70', 'gpa', 'finally', 'we', 'included', 'the', 'nonlocal', 'van', 'der', 'waals', 'correction', 'the', 'transition', 'pressure', 'slightly', 'increases', 'to', '80', 'gpa', 'these', 'results', 'demonstrate', 'that', 'the', 'contribution', 'from', 'hubbard', 'term', 'is', 'superior', 'to', 'van', 'der', 'waals', 'term']]
|
[-0.08301335143753225, 0.14323660327507315, -0.07993850635007174, 0.027246841164823208, 0.0058009439721854045, -0.14165692983990102, 0.14133417050735178, 0.3248450758518896, -0.27741054870715043, -0.32269121967832265, -0.07044400339193567, -0.3892550009744938, -0.19129666433001707, 0.08134933164098648, 0.03274119241548834, 0.05828094880820976, -0.03127446099222083, -0.043676439033012195, -0.15632684742138167, -0.2909497968720818, 0.26711930530710204, 0.11416772241243209, 0.27145625776940524, 0.14629509531413065, -0.0008413302806215455, -0.05283480063268934, 0.10507973505071166, 0.020621646477869064, -0.24833303434820433, 0.043744121386547284, 0.27643439454741475, -0.12601395014372438, 0.27267518107111405, -0.402846310542887, -0.2194710834271679, -0.036988478666641796, 0.04416659396865542, 0.16440480280634617, -0.003524699450630431, -0.29266845770744665, 0.0758547776971351, -0.21564651366247975, -0.11823661887848919, -0.09976637463856752, -0.013024084947325966, -0.0038896030722882107, -0.2276313030302073, 0.18583577800767892, 0.006099550749617394, 0.05742446241919139, -0.14591437327026419, -0.1764184493087044, -0.05082794465594972, 0.03855077295818112, -0.004752616649681721, 0.12685733393182733, 0.21138936063895622, -0.08760333540755315, -0.003238942130760412, 0.41188255738880897, -0.08547340610330323, 0.018091552505137946, 0.19968914198265833, -0.14031609405194306, -0.0761675979919153, 0.2333478961854872, 0.05021331220808806, -0.006995050706947693, -0.12579050029844346, 0.08704741027281442, 0.10214828267444226, 0.2573708597231995, 0.12166277369962902, -0.05140353267485596, 0.14096549580713283, 0.1384175860680489, 0.006613026730565711, 0.14647146024637753, -0.1260826997670599, -0.08961281450841614, -0.21750587213671568, -0.1790718191745456, -0.19570308668313152, 0.02864604382399432, -0.07807581643150611, -0.1920348491820723, 0.3461905681631631, 0.17043299392580685, 0.09836233893616332, -0.003370529719195658, 0.1941536405462433, 0.13851081477325278, 0.07360722134454233, 0.007157298566942865, 0.3468172142677235, 0.17796555768952452, 0.11434824693233075, -0.2837945075536316, 0.056127923450225756, 0.10023791833329156]
|
1,803.0662
|
Characterizations of the Logistic and Related Distributions
|
It is known that few characterization results of the logistic distribution
were available before, although it is similar in shape to the normal one whose
characteristic properties have been well investigated. Fortunately, in the last
decade, several authors have made great progress in this topic. Some
interesting characterization results of the logistic distribution have been
developed recently. In this paper, we further provide some new results by the
distributional equalities in terms of order statistics of the underlying
distribution and the random exponential shifts. The characterization of the
closely related Pareto type II distribution is also investigated.
|
math.ST math.PR stat.TH
|
it is known that few characterization results of the logistic distribution were available before although it is similar in shape to the normal one whose characteristic properties have been well investigated fortunately in the last decade several authors have made great progress in this topic some interesting characterization results of the logistic distribution have been developed recently in this paper we further provide some new results by the distributional equalities in terms of order statistics of the underlying distribution and the random exponential shifts the characterization of the closely related pareto type ii distribution is also investigated
|
[['it', 'is', 'known', 'that', 'few', 'characterization', 'results', 'of', 'the', 'logistic', 'distribution', 'were', 'available', 'before', 'although', 'it', 'is', 'similar', 'in', 'shape', 'to', 'the', 'normal', 'one', 'whose', 'characteristic', 'properties', 'have', 'been', 'well', 'investigated', 'fortunately', 'in', 'the', 'last', 'decade', 'several', 'authors', 'have', 'made', 'great', 'progress', 'in', 'this', 'topic', 'some', 'interesting', 'characterization', 'results', 'of', 'the', 'logistic', 'distribution', 'have', 'been', 'developed', 'recently', 'in', 'this', 'paper', 'we', 'further', 'provide', 'some', 'new', 'results', 'by', 'the', 'distributional', 'equalities', 'in', 'terms', 'of', 'order', 'statistics', 'of', 'the', 'underlying', 'distribution', 'and', 'the', 'random', 'exponential', 'shifts', 'the', 'characterization', 'of', 'the', 'closely', 'related', 'pareto', 'type', 'ii', 'distribution', 'is', 'also', 'investigated']]
|
[-0.03983334163875924, 0.0681089619222606, -0.12240514163148095, 0.07881188860820779, -0.08667787778930566, -0.09543788168080074, -0.00616868816978615, 0.4013244560391633, -0.26385582069453506, -0.2957670617195749, 0.16020229267503722, -0.26030682875131517, -0.19812991649642125, 0.22738015807243353, -0.07202530215427126, 0.12209598103672573, 0.03248895442151686, 0.06309469523101556, -0.07329662840035696, -0.3282231325187634, 0.31238205897977056, 0.05216612197343529, 0.3039331784875123, 0.0452045610404967, 0.02892790458371536, -0.03898497523029441, -0.07220598734608016, 0.03480938129059817, -0.18304296457918287, 0.13515085029204557, 0.21236585318734966, 0.14314073666008478, 0.3092423355274056, -0.3836797340437002, -0.25336713204640393, 0.11683453280675542, 0.14470076757800027, 0.07256876368594077, -0.08597656125298787, -0.2526539253819849, 0.08715898875679974, -0.18267931419751154, -0.1516754854345675, -0.07620968041730296, 0.04967523560638434, 0.09687987572907172, -0.17631861041348004, 0.05170230125047065, 0.11392829206546519, 0.06355669308626621, -0.022894936016059873, -0.17060898291427143, 0.04231606608919185, 0.1269521404096146, 0.09013733461969677, -0.009048418281119816, 0.017861029316524772, -0.1253337420609578, -0.10654606796877901, 0.3286361468898267, -0.029752855963246495, -0.171115605297412, 0.18140151374253263, -0.1827412299408587, -0.19199572656226835, 0.1373811004558559, 0.13998059904414048, 0.09838986176440549, -0.21712791613427943, 0.07446587653578614, -0.09411119661034689, 0.08515987151600037, 0.08337618689984083, 0.05336757262535009, 0.15655204449233012, 0.15843720791006902, 0.013336138149300954, 0.15381964813370602, -0.06872911879927227, -0.12869073855738664, -0.25052037742949024, -0.1345540031349075, -0.190815859392631, 0.017812413110676193, -0.03016361787650595, -0.16081147910739035, 0.4251493327319622, 0.13286242618695976, 0.2073404670395341, 0.005973532824709858, 0.23701166649608268, 0.13437170773437343, 0.05536869711713078, 0.031034139723300373, 0.25784980296697374, 0.1658795995916211, 0.10016118929500586, -0.12234462313258003, 0.17402428338188947, 0.010117177688276646]
|
1,803.06621
|
Future of Pulsar Research and Facilities
|
Radio pulsars have been responsible for many astonishing astrophysical and
fundamental physics breakthroughs since their discovery 50 years ago. In this
review I will discuss many of the highlights, most of which were only possible
because of the provision of large-scale observing facilities. The next 50 years
of pulsar astronomy can be very bright, but only if our governments properly
plan and fund the infrastructure necessary to enable future discoveries. Being
a small sub-field of astronomy places an onus on the pulsar community to have
an open-source/open access approach to data, software, and major observing
facilities to enable new groups to emerge to keep the field vibrant.
|
astro-ph.IM
|
radio pulsars have been responsible for many astonishing astrophysical and fundamental physics breakthroughs since their discovery 50 years ago in this review i will discuss many of the highlights most of which were only possible because of the provision of largescale observing facilities the next 50 years of pulsar astronomy can be very bright but only if our governments properly plan and fund the infrastructure necessary to enable future discoveries being a small subfield of astronomy places an onus on the pulsar community to have an opensourceopen access approach to data software and major observing facilities to enable new groups to emerge to keep the field vibrant
|
[['radio', 'pulsars', 'have', 'been', 'responsible', 'for', 'many', 'astonishing', 'astrophysical', 'and', 'fundamental', 'physics', 'breakthroughs', 'since', 'their', 'discovery', '50', 'years', 'ago', 'in', 'this', 'review', 'i', 'will', 'discuss', 'many', 'of', 'the', 'highlights', 'most', 'of', 'which', 'were', 'only', 'possible', 'because', 'of', 'the', 'provision', 'of', 'largescale', 'observing', 'facilities', 'the', 'next', '50', 'years', 'of', 'pulsar', 'astronomy', 'can', 'be', 'very', 'bright', 'but', 'only', 'if', 'our', 'governments', 'properly', 'plan', 'and', 'fund', 'the', 'infrastructure', 'necessary', 'to', 'enable', 'future', 'discoveries', 'being', 'a', 'small', 'subfield', 'of', 'astronomy', 'places', 'an', 'onus', 'on', 'the', 'pulsar', 'community', 'to', 'have', 'an', 'opensourceopen', 'access', 'approach', 'to', 'data', 'software', 'and', 'major', 'observing', 'facilities', 'to', 'enable', 'new', 'groups', 'to', 'emerge', 'to', 'keep', 'the', 'field', 'vibrant']]
|
[-0.11654018312209409, 0.11779159698706726, -0.058094043409856, 0.0616513541625057, -0.18118188828932788, -0.12686960493601016, 0.05087948906815277, 0.3817463381356507, -0.2539463419750561, -0.3792351975659225, 0.16615488911530812, -0.26765703231278576, -0.07550940876782714, 0.2853798086508968, -0.07338289423617271, 0.0026708105721792103, 0.10853107386150064, -0.014172546082299273, 0.015562811205800588, -0.31225495556790056, 0.23216396635881503, 0.1409098357665089, 0.2451502704237289, 0.09167650417547743, 0.062119724076320326, -0.049883999154498836, -0.09434477049683854, -0.0732609291148003, -0.0631111225391681, 0.1257561630358533, 0.3546480115784227, 0.23997175168325105, 0.34741910789513364, -0.4693179684251828, -0.18562154497930403, 0.11294181940567521, 0.1490052954342111, 0.07795604259843218, -0.057351888922912965, -0.29674674876315416, 0.04595420001907151, -0.22820407643975726, -0.17206821377599998, -0.0557422481185124, 0.09189896077578799, 0.0321358440812888, -0.15173943905282836, -0.06979592559191417, -0.021290203714567534, 0.08313907752909593, -0.03966776359351879, -0.12752579717967166, 0.07119629721218755, 0.18937542892219322, 0.0969858111271125, 0.07235770236112107, 0.09290871750519453, -0.17997007097671125, -0.13825795663007806, 0.42533951388004254, 0.02883227082377246, -0.00875112121784181, 0.22388392263794984, -0.20896127023997735, -0.22052483320816085, 0.10137041591938128, 0.2212468415052841, 0.051078576181646226, -0.2079418718832422, 0.047846181707496244, 0.010289018016027392, 0.1373598182294957, 0.06815074670638116, 0.0900865532809271, 0.32836979986080583, 0.18198624203302283, 0.08727871757418022, 0.0283090136000746, -0.1311534832468924, -0.05689384101259628, -0.2145717333088506, -0.13057246614458426, -0.13040366284285654, 0.06056024883610179, -0.0005921019360100201, -0.11179393536261863, 0.40260732734470434, 0.1915673638808207, 0.08146023354932384, -0.038407601008657366, 0.26019519411756675, 0.02532455334461839, 0.1527182496666803, 0.11044244604725566, 0.2971177546061435, 0.0766032476808419, 0.13377086957477313, -0.09455176101962351, 0.08452808364944638, -0.09731039438695419]
|
1,803.06622
|
Learning recurrent dynamics in spiking networks
|
Spiking activity of neurons engaged in learning and performing a task show
complex spatiotemporal dynamics. While the output of recurrent network models
can learn to perform various tasks, the possible range of recurrent dynamics
that emerge after learning remains unknown. Here we show that modifying the
recurrent connectivity with a recursive least squares algorithm provides
sufficient flexibility for synaptic and spiking rate dynamics of spiking
networks to produce a wide range of spatiotemporal activity. We apply the
training method to learn arbitrary firing patterns, stabilize irregular spiking
activity of a balanced network, and reproduce the heterogeneous spiking rate
patterns of cortical neurons engaged in motor planning and movement. We
identify sufficient conditions for successful learning, characterize two types
of learning errors, and assess the network capacity. Our findings show that
synaptically-coupled recurrent spiking networks possess a vast computational
capability that can support the diverse activity patterns in the brain.
|
q-bio.NC cs.AI cs.LG cs.NE
|
spiking activity of neurons engaged in learning and performing a task show complex spatiotemporal dynamics while the output of recurrent network models can learn to perform various tasks the possible range of recurrent dynamics that emerge after learning remains unknown here we show that modifying the recurrent connectivity with a recursive least squares algorithm provides sufficient flexibility for synaptic and spiking rate dynamics of spiking networks to produce a wide range of spatiotemporal activity we apply the training method to learn arbitrary firing patterns stabilize irregular spiking activity of a balanced network and reproduce the heterogeneous spiking rate patterns of cortical neurons engaged in motor planning and movement we identify sufficient conditions for successful learning characterize two types of learning errors and assess the network capacity our findings show that synapticallycoupled recurrent spiking networks possess a vast computational capability that can support the diverse activity patterns in the brain
|
[['spiking', 'activity', 'of', 'neurons', 'engaged', 'in', 'learning', 'and', 'performing', 'a', 'task', 'show', 'complex', 'spatiotemporal', 'dynamics', 'while', 'the', 'output', 'of', 'recurrent', 'network', 'models', 'can', 'learn', 'to', 'perform', 'various', 'tasks', 'the', 'possible', 'range', 'of', 'recurrent', 'dynamics', 'that', 'emerge', 'after', 'learning', 'remains', 'unknown', 'here', 'we', 'show', 'that', 'modifying', 'the', 'recurrent', 'connectivity', 'with', 'a', 'recursive', 'least', 'squares', 'algorithm', 'provides', 'sufficient', 'flexibility', 'for', 'synaptic', 'and', 'spiking', 'rate', 'dynamics', 'of', 'spiking', 'networks', 'to', 'produce', 'a', 'wide', 'range', 'of', 'spatiotemporal', 'activity', 'we', 'apply', 'the', 'training', 'method', 'to', 'learn', 'arbitrary', 'firing', 'patterns', 'stabilize', 'irregular', 'spiking', 'activity', 'of', 'a', 'balanced', 'network', 'and', 'reproduce', 'the', 'heterogeneous', 'spiking', 'rate', 'patterns', 'of', 'cortical', 'neurons', 'engaged', 'in', 'motor', 'planning', 'and', 'movement', 'we', 'identify', 'sufficient', 'conditions', 'for', 'successful', 'learning', 'characterize', 'two', 'types', 'of', 'learning', 'errors', 'and', 'assess', 'the', 'network', 'capacity', 'our', 'findings', 'show', 'that', 'synapticallycoupled', 'recurrent', 'spiking', 'networks', 'possess', 'a', 'vast', 'computational', 'capability', 'that', 'can', 'support', 'the', 'diverse', 'activity', 'patterns', 'in', 'the', 'brain']]
|
[-0.11273007370481217, 0.10201441045658588, -0.012009491407740358, 0.1057260136082265, -0.09197743824601325, -0.20493724491963214, 0.05089974878009761, 0.48928077594137975, -0.28151945170719883, -0.28930952558860284, 0.0407189595602717, -0.18187749222537652, -0.3577309304774472, 0.17300763054801202, -0.12254980311892624, 0.06396397315217434, 0.1297115686646902, 0.06740262909364458, 0.004298428726001844, -0.2615656347983089, 0.22231249631432867, 0.01809765081349257, 0.32326607783230626, -0.04855444606840359, 0.17549496558746575, -0.07088174418281964, -0.00229061149199166, -0.047464965275532844, -0.04901762180147548, 0.16167334824599125, 0.3373039625973704, 0.21582513376346765, 0.3551145163238854, -0.5367598141468054, -0.3097527879101501, 0.13078619504655786, 0.13699967920232714, 0.10381510577674301, 0.007742290718581628, -0.28463094792253263, 0.1150137918877, -0.1541513988269946, -0.03141444211674703, -0.18937190916590593, 0.00017474808201596543, 0.08946364119372054, -0.3136078688336498, 0.05297079782561726, 0.08446626769806687, 0.09924628058876339, -0.06864010864975736, 0.008803619436819005, -0.01012346744647476, 0.22935572549908398, -0.014748201869912696, 0.006544342581528818, 0.20455280169404136, -0.19637419070853424, -0.1648433747405589, 0.25236940460682317, -0.0025923725192409917, -0.16776807516499823, 0.2327252018384988, -0.09052277650570849, -0.17150402783315527, 0.13031845971803507, 0.2731611134132018, 0.04173358017893357, -0.18952256215522317, -0.056173939810439666, -0.015968077775166446, 0.21731146407389157, 0.03811870217700866, 0.005835453174202828, 0.17595994161014017, 0.3093915705182086, 0.031756809393472564, 0.12465436796884279, -0.12189905866614788, -0.10859806248186647, -0.18908369629266294, -0.02185502730158938, -0.16084905306028352, 0.016169426942675223, -0.12527780358101842, -0.14736361321745398, 0.485518888532612, 0.1723023028855489, 0.23150141815956984, 0.19209700836044913, 0.22688388406036333, -0.005813424456612887, 0.10122693155741168, 0.11302724355128531, 0.1389905114003734, 0.10261516439464144, 0.1584525111751203, -0.26201295790205886, 0.14012046221240954, -0.001690231145649041]
|
1,803.06623
|
The invariant subspaces of the shift plus integer multiple of Volterra
operator on Hardy spaces
|
\v{C}u\v{c}kovi\'{c} and Paudyal recently characterized the lattice of
invariant subspaces of the shift plus a complex Volterra operator on the
Hilbert space $H^2$ on the unit disk. Motivated by the idea of Ong, in this
paper, we give a complete characterization of the lattice of invariant
subspaces of the shift operator plus a positive integer multiple of the
Volterra operator on Hardy spaces $H^p$, which essentially extends their works
to the more general cases when $1\leq p<\infty$.
|
math.CV
|
vcuvckovic and paudyal recently characterized the lattice of invariant subspaces of the shift plus a complex volterra operator on the hilbert space h2 on the unit disk motivated by the idea of ong in this paper we give a complete characterization of the lattice of invariant subspaces of the shift operator plus a positive integer multiple of the volterra operator on hardy spaces hp which essentially extends their works to the more general cases when 1leq pinfty
|
[['vcuvckovic', 'and', 'paudyal', 'recently', 'characterized', 'the', 'lattice', 'of', 'invariant', 'subspaces', 'of', 'the', 'shift', 'plus', 'a', 'complex', 'volterra', 'operator', 'on', 'the', 'hilbert', 'space', 'h2', 'on', 'the', 'unit', 'disk', 'motivated', 'by', 'the', 'idea', 'of', 'ong', 'in', 'this', 'paper', 'we', 'give', 'a', 'complete', 'characterization', 'of', 'the', 'lattice', 'of', 'invariant', 'subspaces', 'of', 'the', 'shift', 'operator', 'plus', 'a', 'positive', 'integer', 'multiple', 'of', 'the', 'volterra', 'operator', 'on', 'hardy', 'spaces', 'hp', 'which', 'essentially', 'extends', 'their', 'works', 'to', 'the', 'more', 'general', 'cases', 'when', '1leq', 'pinfty']]
|
[-0.1456406074319059, 0.1125679820316372, -0.029194145874640386, 0.06038675335229846, -0.0737339835734917, -0.09839644361069644, 0.03175287148098812, 0.3231671260452116, -0.28610899250398014, -0.14916309253494073, 0.1307067818464953, -0.2616716899679272, -0.14550688365692055, 0.1670172731452561, -0.09822701303554433, 0.05466374683242243, 0.019124678807792724, 0.042160255120849456, -0.11670090872552488, -0.2629556589360748, 0.4440297409892082, 0.01943605182111844, 0.14738926776479205, 0.013928123350654329, 0.11583247948921734, 0.04533304476675082, -0.06906136414399008, -0.04526592980541214, -0.16923954191484622, 0.19123378082166437, 0.20892934235078947, 0.06346648876470598, 0.27166308117002347, -0.3632928151637316, -0.20834527744657613, 0.16177072879168894, 0.12682680658052686, -0.03381732491588873, 0.006534288477646973, -0.31114111152513846, 0.015892295901627315, -0.11141180817957048, -0.10975117550243611, -0.07616433786687912, 0.025511133572231833, -0.016255664025348695, -0.3212292603664584, 0.048421426422216675, 0.16149747799840067, 0.08870711493269577, -0.14214771019609332, -0.1321851448322247, -0.022867527512180342, 0.030687897852032336, -0.032329131716064045, 0.08815883172452207, 0.048571413080510384, -0.01772276883908584, -0.12636950702176658, 0.3703613875361232, -0.07087242432080766, -0.2412306701449992, 0.13111138064414263, -0.19031007502639255, -0.12926238835728787, 0.0991728383935867, 0.11516068070256091, 0.14273981274069322, -0.0765721472987509, 0.20297840565319064, -0.12078266802497885, 0.09203401043430551, 0.08391221004308431, 0.08766475669486302, 0.07668833404948766, 0.07548241229885101, 0.14437334519333217, 0.15268504095880628, 0.016464891852758064, -0.10960123185658005, -0.31301438575686114, -0.17804425076714583, -0.20346290479692353, 0.08051579524823405, -0.07269891835246446, -0.18895012986930934, 0.4026741149786908, 0.02237968583849815, 0.22822912467504525, 0.06830392656212841, 0.23739379825820398, 0.11618514498090976, 0.06163881955873947, 0.020477949623502308, 0.1321042872157988, 0.17169549120529615, 0.10019097718797237, -0.20694683812703793, -0.035156069692321025, 0.20054041215085558]
|
1,803.06624
|
Blind quantum computing can always be made verifiable
|
Blind quantum computing enables a client, who does not have enough quantum
technologies, to delegate her quantum computing to a remote quantum server in
such a way that her privacy is protected against the server. Some blind quantum
computing protocols can be made verifiable, which means that the client can
check the correctness of server's quantum computing. Can any blind protocol
always be made verifiable? In this paper, we answer to the open problem
affirmatively. We propose a plug-in that makes any universal blind quantum
computing protocol automatically verifiable. The idea is that the client
blindly generates Feynman-Kitaev history states corresponding to the quantum
circuit that solves client's problem and its complement circuit. The client can
learn the solution of the problem and verify its correctness at the same time
by measuring energies of local Hamiltonians on these states. Measuring energies
of local Hamiltonians can be done with only single qubit measurements of Pauli
operators.
|
quant-ph
|
blind quantum computing enables a client who does not have enough quantum technologies to delegate her quantum computing to a remote quantum server in such a way that her privacy is protected against the server some blind quantum computing protocols can be made verifiable which means that the client can check the correctness of servers quantum computing can any blind protocol always be made verifiable in this paper we answer to the open problem affirmatively we propose a plugin that makes any universal blind quantum computing protocol automatically verifiable the idea is that the client blindly generates feynmankitaev history states corresponding to the quantum circuit that solves clients problem and its complement circuit the client can learn the solution of the problem and verify its correctness at the same time by measuring energies of local hamiltonians on these states measuring energies of local hamiltonians can be done with only single qubit measurements of pauli operators
|
[['blind', 'quantum', 'computing', 'enables', 'a', 'client', 'who', 'does', 'not', 'have', 'enough', 'quantum', 'technologies', 'to', 'delegate', 'her', 'quantum', 'computing', 'to', 'a', 'remote', 'quantum', 'server', 'in', 'such', 'a', 'way', 'that', 'her', 'privacy', 'is', 'protected', 'against', 'the', 'server', 'some', 'blind', 'quantum', 'computing', 'protocols', 'can', 'be', 'made', 'verifiable', 'which', 'means', 'that', 'the', 'client', 'can', 'check', 'the', 'correctness', 'of', 'servers', 'quantum', 'computing', 'can', 'any', 'blind', 'protocol', 'always', 'be', 'made', 'verifiable', 'in', 'this', 'paper', 'we', 'answer', 'to', 'the', 'open', 'problem', 'affirmatively', 'we', 'propose', 'a', 'plugin', 'that', 'makes', 'any', 'universal', 'blind', 'quantum', 'computing', 'protocol', 'automatically', 'verifiable', 'the', 'idea', 'is', 'that', 'the', 'client', 'blindly', 'generates', 'feynmankitaev', 'history', 'states', 'corresponding', 'to', 'the', 'quantum', 'circuit', 'that', 'solves', 'clients', 'problem', 'and', 'its', 'complement', 'circuit', 'the', 'client', 'can', 'learn', 'the', 'solution', 'of', 'the', 'problem', 'and', 'verify', 'its', 'correctness', 'at', 'the', 'same', 'time', 'by', 'measuring', 'energies', 'of', 'local', 'hamiltonians', 'on', 'these', 'states', 'measuring', 'energies', 'of', 'local', 'hamiltonians', 'can', 'be', 'done', 'with', 'only', 'single', 'qubit', 'measurements', 'of', 'pauli', 'operators']]
|
[-0.1974424616878687, 0.0797776308714322, -0.11648858492713302, 0.044755947797919714, -0.09549610029996163, -0.32719231226872053, 0.14219125075821554, 0.35538539557207016, -0.310637893942335, -0.31723799236839817, 0.08494990327275329, -0.250348130901975, -0.07427016433869157, 0.21002084016199074, -0.12731850280786955, 0.15065307876681008, 0.07233904316841114, 0.02613467095840362, -0.025877797130435226, -0.3076258339708851, 0.26653921395284874, 0.04398826656172112, 0.26649059153672666, 0.09493472144127854, 0.06490302077764945, 0.011648780137540832, 0.02342866338609207, -0.014775111748566551, -0.054003923974842986, 0.0938317276837845, 0.3274081637692307, 0.20550237371015453, 0.2841444338761991, -0.45617665761420806, -0.1042544654300136, 0.13212565876423352, 0.1312481430599526, 0.18832253290625708, -0.04533977968948743, -0.34973594950692305, 0.1324256022070204, -0.1996598545822405, -0.10103780427466957, -0.09695640121616664, -0.0474872897048631, -0.055268934471232274, -0.23045263313538125, -0.028932486417432946, 0.005393182621487687, -7.881496492172441e-05, 0.0268494340516026, 0.017393108186942917, 0.0466762445386379, 0.19186059496695956, -0.0819268494286359, 0.02036216985584507, 0.1959449110162114, -0.10271000568003905, -0.21391137347917163, 0.34734233282506466, 0.020882173213026215, -0.17404670762949653, 0.13429703729888123, -0.03732434787276772, -0.1462720233195972, 0.018073198089616434, 0.10300311470824865, 0.08658394494888208, -0.1881782191745456, 0.12659136900422915, -0.06541539712418472, 0.22051234400245331, 0.03471575583060903, 0.08530977438354204, 0.1997403950941178, 0.043214909585132716, 0.11379244087354069, 0.12838303663452427, -0.018512617416619775, -0.1322546881743737, -0.2787593170249414, -0.23322442159086706, -0.27804204434637103, 0.0863989104923319, -0.032361669317751585, -0.14110959951527371, 0.39521216610747, 0.19944419693201781, 0.12841611060223754, 0.06683736923338485, 0.36661124622389196, 0.11375973825117633, 0.1006321912799913, 0.16751494842972006, 0.1717360466637934, 0.07305163084454233, 0.11445448649746756, -0.2116946008011338, 0.1714650466106832, 0.0452634536631165]
|
1,803.06625
|
ShIFT: A Semi-haptic Interface for Flute Tutoring
|
Traditional instrument learning is time-consuming. It begins with learning
music notation and necessitates layers of sophistication and abstraction.
Haptic interfaces open another door to the music world for the vast majority of
beginners when traditional training methods are not effective. However,
existing haptic interfaces can only deal with specially designed pieces with
great restrictions on performance duration and pitch range due to the fact that
not all performance motions could be guided haptically for most instruments.
Our system breaks such restrictions using a semi-haptic interface. For the
first time, the pitch range of the haptically learned pieces goes beyond an
octave (with the fingering motion covers most of the possible choices) and the
duration of learned pieces cover a whole phrase. This significant change leads
to a more realistic instrument learning process. Experiments show that our
semi-haptic interface is effective as long as learners are not "tone deaf."
Using our prototype device, the learning rate is about 30% faster compared to
learning from videos.
|
cs.HC
|
traditional instrument learning is timeconsuming it begins with learning music notation and necessitates layers of sophistication and abstraction haptic interfaces open another door to the music world for the vast majority of beginners when traditional training methods are not effective however existing haptic interfaces can only deal with specially designed pieces with great restrictions on performance duration and pitch range due to the fact that not all performance motions could be guided haptically for most instruments our system breaks such restrictions using a semihaptic interface for the first time the pitch range of the haptically learned pieces goes beyond an octave with the fingering motion covers most of the possible choices and the duration of learned pieces cover a whole phrase this significant change leads to a more realistic instrument learning process experiments show that our semihaptic interface is effective as long as learners are not tone deaf using our prototype device the learning rate is about 30 faster compared to learning from videos
|
[['traditional', 'instrument', 'learning', 'is', 'timeconsuming', 'it', 'begins', 'with', 'learning', 'music', 'notation', 'and', 'necessitates', 'layers', 'of', 'sophistication', 'and', 'abstraction', 'haptic', 'interfaces', 'open', 'another', 'door', 'to', 'the', 'music', 'world', 'for', 'the', 'vast', 'majority', 'of', 'beginners', 'when', 'traditional', 'training', 'methods', 'are', 'not', 'effective', 'however', 'existing', 'haptic', 'interfaces', 'can', 'only', 'deal', 'with', 'specially', 'designed', 'pieces', 'with', 'great', 'restrictions', 'on', 'performance', 'duration', 'and', 'pitch', 'range', 'due', 'to', 'the', 'fact', 'that', 'not', 'all', 'performance', 'motions', 'could', 'be', 'guided', 'haptically', 'for', 'most', 'instruments', 'our', 'system', 'breaks', 'such', 'restrictions', 'using', 'a', 'semihaptic', 'interface', 'for', 'the', 'first', 'time', 'the', 'pitch', 'range', 'of', 'the', 'haptically', 'learned', 'pieces', 'goes', 'beyond', 'an', 'octave', 'with', 'the', 'fingering', 'motion', 'covers', 'most', 'of', 'the', 'possible', 'choices', 'and', 'the', 'duration', 'of', 'learned', 'pieces', 'cover', 'a', 'whole', 'phrase', 'this', 'significant', 'change', 'leads', 'to', 'a', 'more', 'realistic', 'instrument', 'learning', 'process', 'experiments', 'show', 'that', 'our', 'semihaptic', 'interface', 'is', 'effective', 'as', 'long', 'as', 'learners', 'are', 'not', 'tone', 'deaf', 'using', 'our', 'prototype', 'device', 'the', 'learning', 'rate', 'is', 'about', '30', 'faster', 'compared', 'to', 'learning', 'from', 'videos']]
|
[-0.06061886948099314, 0.09149979745452134, -0.06742593147763178, 0.047413339108690125, -0.1814277777750114, -0.17685878047156206, 0.01793938589549658, 0.43682545484086777, -0.2725120529224866, -0.3596340265357867, 0.08950940687080017, -0.25967189828494425, -0.13705902186044158, 0.2520033629944571, -0.12295484320076619, 0.056534057783457325, 0.1171205702092625, 0.020739696662654572, -0.04233746732805028, -0.2586595025545929, 0.2649647900144811, 0.06166785812281348, 0.29429281412704306, 0.018961591005072366, 0.11248882721109246, -0.01220181609797119, -0.006038504336399377, -0.01159328249366494, -0.06205823229358856, 0.11414763732111932, 0.33630798500962555, 0.15969704271202195, 0.32738694343083524, -0.42414993995133743, -0.21453713861949467, 0.029467021736005943, 0.15252774630178823, 0.1080320045541696, -0.03198635050379111, -0.3046116807992444, 0.06885327211650158, -0.15047575122918244, -0.02742510810379445, -0.0852589295130729, -0.0036820232937181435, -0.003102935434543286, -0.23525275109209304, -0.019109173009192203, 0.05882725844240207, 0.09149309033729182, -0.026361063162991662, -0.11843257394754385, 0.01885722992211626, 0.20478919238936483, 0.06376828495675359, 0.05331205659442478, 0.17899293211622186, -0.18263871840885437, -0.09962276231359553, 0.39470859255963636, -0.03701780364061073, -0.18131407534266697, 0.23225045961005913, -0.0802171380535044, -0.06760062579996884, 0.15628533279609488, 0.1588256425881057, 0.08936193122034088, -0.13132382337663992, 0.02806188625191557, 0.016526381749613784, 0.2566634593423697, 0.07431753021003794, -0.005760927592622645, 0.20171780040614123, 0.24507003490968296, 0.04804707204752004, 0.09670512048731685, -0.08589060046497364, -0.08105019867789563, -0.25578485883522295, -0.1351254544519808, -0.15130746819978627, -0.01331728206127149, -0.08715051808933451, -0.14628728485614476, 0.3686740834633877, 0.21244870720396716, 0.15912666676255563, 0.10271041629330059, 0.32792375705860277, 0.014868047080479884, 0.15706295425497732, 0.07745213215929214, 0.21090903876631026, 0.0002929569839321675, 0.16892391968415016, -0.14017697657497288, 0.10654410276343518, -0.00884985515738573]
|
1,803.06626
|
The Automatic Identification of Butterfly Species
|
The available butterfly data sets comprise a few limited species, and the
images in the data sets are always standard patterns without the images of
butterflies in their living environment. To overcome the aforementioned
limitations in the butterfly data sets, we build a butterfly data set composed
of all species of butterflies in China with 4270 standard pattern images of
1176 butterfly species, and 1425 images from living environment of 111 species.
We propose to use the deep learning technique Faster-Rcnn to train an automatic
butterfly identification system including butterfly position detection and
species recognition. We delete those species with only one living environment
image from data set, then partition the rest images from living environment
into two subsets, one used as test subset, the other as training subset
respectively combined with all standard pattern butterfly images or the
standard pattern butterfly images with the same species of the images from
living environment. In order to construct the training subset for FasterRcnn,
nine methods were adopted to amplifying the images in the training subset
including the turning of up and down, and left and right, rotation with
different angles, adding noises, blurring, and contrast ratio adjusting etc.
Three prediction models were trained. The mAP (Mean Average prediction)
criterion was used to evaluate the performance of the prediction model. The
experimental results demonstrate that our Faster-Rcnn based butterfly automatic
identification system performed well, and its worst mAP is up to 60%, and can
simultaneously detect the positions of more than one butterflies in one images
from living environment and recognize the species of those butterflies as well.
|
cs.CV
|
the available butterfly data sets comprise a few limited species and the images in the data sets are always standard patterns without the images of butterflies in their living environment to overcome the aforementioned limitations in the butterfly data sets we build a butterfly data set composed of all species of butterflies in china with 4270 standard pattern images of 1176 butterfly species and 1425 images from living environment of 111 species we propose to use the deep learning technique fasterrcnn to train an automatic butterfly identification system including butterfly position detection and species recognition we delete those species with only one living environment image from data set then partition the rest images from living environment into two subsets one used as test subset the other as training subset respectively combined with all standard pattern butterfly images or the standard pattern butterfly images with the same species of the images from living environment in order to construct the training subset for fasterrcnn nine methods were adopted to amplifying the images in the training subset including the turning of up and down and left and right rotation with different angles adding noises blurring and contrast ratio adjusting etc three prediction models were trained the map mean average prediction criterion was used to evaluate the performance of the prediction model the experimental results demonstrate that our fasterrcnn based butterfly automatic identification system performed well and its worst map is up to 60 and can simultaneously detect the positions of more than one butterflies in one images from living environment and recognize the species of those butterflies as well
|
[['the', 'available', 'butterfly', 'data', 'sets', 'comprise', 'a', 'few', 'limited', 'species', 'and', 'the', 'images', 'in', 'the', 'data', 'sets', 'are', 'always', 'standard', 'patterns', 'without', 'the', 'images', 'of', 'butterflies', 'in', 'their', 'living', 'environment', 'to', 'overcome', 'the', 'aforementioned', 'limitations', 'in', 'the', 'butterfly', 'data', 'sets', 'we', 'build', 'a', 'butterfly', 'data', 'set', 'composed', 'of', 'all', 'species', 'of', 'butterflies', 'in', 'china', 'with', '4270', 'standard', 'pattern', 'images', 'of', '1176', 'butterfly', 'species', 'and', '1425', 'images', 'from', 'living', 'environment', 'of', '111', 'species', 'we', 'propose', 'to', 'use', 'the', 'deep', 'learning', 'technique', 'fasterrcnn', 'to', 'train', 'an', 'automatic', 'butterfly', 'identification', 'system', 'including', 'butterfly', 'position', 'detection', 'and', 'species', 'recognition', 'we', 'delete', 'those', 'species', 'with', 'only', 'one', 'living', 'environment', 'image', 'from', 'data', 'set', 'then', 'partition', 'the', 'rest', 'images', 'from', 'living', 'environment', 'into', 'two', 'subsets', 'one', 'used', 'as', 'test', 'subset', 'the', 'other', 'as', 'training', 'subset', 'respectively', 'combined', 'with', 'all', 'standard', 'pattern', 'butterfly', 'images', 'or', 'the', 'standard', 'pattern', 'butterfly', 'images', 'with', 'the', 'same', 'species', 'of', 'the', 'images', 'from', 'living', 'environment', 'in', 'order', 'to', 'construct', 'the', 'training', 'subset', 'for', 'fasterrcnn', 'nine', 'methods', 'were', 'adopted', 'to', 'amplifying', 'the', 'images', 'in', 'the', 'training', 'subset', 'including', 'the', 'turning', 'of', 'up', 'and', 'down', 'and', 'left', 'and', 'right', 'rotation', 'with', 'different', 'angles', 'adding', 'noises', 'blurring', 'and', 'contrast', 'ratio', 'adjusting', 'etc', 'three', 'prediction', 'models', 'were', 'trained', 'the', 'map', 'mean', 'average', 'prediction', 'criterion', 'was', 'used', 'to', 'evaluate', 'the', 'performance', 'of', 'the', 'prediction', 'model', 'the', 'experimental', 'results', 'demonstrate', 'that', 'our', 'fasterrcnn', 'based', 'butterfly', 'automatic', 'identification', 'system', 'performed', 'well', 'and', 'its', 'worst', 'map', 'is', 'up', 'to', '60', 'and', 'can', 'simultaneously', 'detect', 'the', 'positions', 'of', 'more', 'than', 'one', 'butterflies', 'in', 'one', 'images', 'from', 'living', 'environment', 'and', 'recognize', 'the', 'species', 'of', 'those', 'butterflies', 'as', 'well']]
|
[-0.055439977374758115, 0.06732212495863799, -0.029246269281566987, 0.06133577903020986, -0.03736458272796195, -0.15961285146515605, 0.04408389126864385, 0.3947454699367847, -0.2663113504560348, -0.3629318869321273, 0.10174219262179972, -0.3212592624725317, -0.13366332939333933, 0.17415194712790116, -0.08962240991411063, 0.02078804106447178, 0.09747228580087705, 0.04611647090224444, -0.0014337360832559051, -0.25184022461433175, 0.2828321818156906, 0.012146030744990193, 0.3180230334831648, -0.0457151050437769, 0.10390038990966409, -0.04602899006655756, -0.052069519795828835, 0.00969482282492912, -0.044081196852411665, 0.11295857934351518, 0.22162040289342327, 0.1879550021212056, 0.19129366448219373, -0.4158706654214634, -0.18181557517217578, 0.10669435309070462, 0.15288268766840393, 0.10234980483908417, -0.022243856711429543, -0.3380105556779594, 0.05568519770738862, -0.11490796145824891, -0.07700856579994818, -0.050369122448676036, -0.012781025079201978, -0.003152551624994233, -0.24556270055824292, 0.05135699917544734, -0.007368948083054626, 0.11253602345175338, -0.07768453271260028, -0.1269135769887142, -0.04128494340364101, 0.23121537235389764, 0.006396297019695477, 0.03501534904616902, 0.15352037139983743, -0.16634116284788109, -0.11836536724014945, 0.40555495814472997, -0.07527813936066419, -0.1878785787888293, 0.2507855231935194, -0.13985938181362625, -0.10155157295741, 0.11862355861241736, 0.17094131564558923, 0.09782219965292036, -0.16502761048317519, -0.0045906892191302385, -0.0644157760161555, 0.16821861553515466, 0.10491981099201542, -0.0023011939213523325, 0.17539015909226366, 0.18517042671172124, 0.01372660850438307, 0.14942793776654587, -0.18767835931008997, -0.04406472979078315, -0.20448206067876012, -0.10120528046006583, -0.14589300697607885, -0.021493465980495115, -0.09911746215723226, -0.16571293330118764, 0.41399040135010234, 0.200909163156208, 0.23433148227719908, 0.05390590421925738, 0.3289461457012397, -0.007807605268921316, 0.15243690865628315, 0.0633342191629674, 0.15067902363590754, 0.045607689281328107, 0.08378371110159623, -0.15988251031376421, 0.044928271003629804, 0.049738411220528606]
|
1,803.06627
|
How to sheafify an elliptic quantum group
|
We give an introductory survey of the results in arXiv: 1708.01418. We
discuss a sheafified elliptic quantum group associated to any symmetric
Kac-Moody Lie algebra. The sheafification is obtained by applying the
equivariant elliptic cohomological theory to the moduli space of
representations of a preprojective algebra. By construction, the elliptic
quantum group naturally acts on the equivariant elliptic cohomology of Nakajima
quiver varieties. As an application, we obtain a relation between the
sheafified elliptic quantum group and the global affine Grassmannian over an
elliptic curve.
|
math.RT
|
we give an introductory survey of the results in arxiv 170801418 we discuss a sheafified elliptic quantum group associated to any symmetric kacmoody lie algebra the sheafification is obtained by applying the equivariant elliptic cohomological theory to the moduli space of representations of a preprojective algebra by construction the elliptic quantum group naturally acts on the equivariant elliptic cohomology of nakajima quiver varieties as an application we obtain a relation between the sheafified elliptic quantum group and the global affine grassmannian over an elliptic curve
|
[['we', 'give', 'an', 'introductory', 'survey', 'of', 'the', 'results', 'in', 'arxiv', '170801418', 'we', 'discuss', 'a', 'sheafified', 'elliptic', 'quantum', 'group', 'associated', 'to', 'any', 'symmetric', 'kacmoody', 'lie', 'algebra', 'the', 'sheafification', 'is', 'obtained', 'by', 'applying', 'the', 'equivariant', 'elliptic', 'cohomological', 'theory', 'to', 'the', 'moduli', 'space', 'of', 'representations', 'of', 'a', 'preprojective', 'algebra', 'by', 'construction', 'the', 'elliptic', 'quantum', 'group', 'naturally', 'acts', 'on', 'the', 'equivariant', 'elliptic', 'cohomology', 'of', 'nakajima', 'quiver', 'varieties', 'as', 'an', 'application', 'we', 'obtain', 'a', 'relation', 'between', 'the', 'sheafified', 'elliptic', 'quantum', 'group', 'and', 'the', 'global', 'affine', 'grassmannian', 'over', 'an', 'elliptic', 'curve']]
|
[-0.21652074809563124, 0.03796406591867535, -0.17435445569710628, 0.056058739052830445, -0.18359262806673846, -0.11456891894894874, -0.0863457449997354, 0.3038766637937875, -0.3958628696300799, -0.2102243833110801, 0.10374389315949797, -0.23687874414913712, -0.1622269035849188, 0.24290688849231673, -0.2345896064348164, -0.009445775167218276, 0.0345151618156316, 0.11087041220162064, -0.17016411920554847, -0.3220912242118391, 0.4741531332478016, -0.03611863948476855, 0.24165441830908613, 0.020849308630983745, 0.13625543893847084, 0.07985182419984735, -0.03511376140107002, -0.09853705195633838, -0.15185231584612102, 0.19290747991873927, 0.41861844593880787, -0.03360011392006917, 0.11625226035747412, -0.35103958909444155, -0.10533309262488426, 0.19230372139385768, 0.1389520312049648, 0.05840172266055431, -0.03598729848800715, -0.2988740674530466, 0.044413316351849405, -0.24680410233503652, -0.20011295476884006, -0.060688009746150955, 0.03778547168899206, -0.00884555003860788, -0.19083991205497158, -0.016550250251644423, 0.042606810168806644, 0.22973882299404413, -0.11065714056825354, -0.07552645960268342, -0.08534157247326914, 0.05328553914469445, -0.08454456606358733, 0.07002939965708979, 0.1188032231182747, -0.12637175450799987, -0.2041809391119473, 0.36389427190823925, -0.04208982159339246, -0.20546732610091567, 0.008700813741944287, -0.11276084499522335, -0.1591597811008493, 0.10140205761334593, 0.09980306241084777, 0.15566407739450888, 0.04424538322547007, 0.21921038281635402, -0.1613039539494951, 0.025758707826580143, 0.03542439615730906, -0.056182697902494555, 0.10167947407379481, 0.036727752946760686, 0.04544146385021685, 0.1306042602712599, 0.07269708241940298, -0.09075491519511811, -0.422628149478918, -0.23019916761889667, -0.030642974076770423, 0.21623167964363738, -0.14359576795565468, -0.15230049252776162, 0.40751443727363257, 0.05035396689726483, 0.19471527048153803, 0.09998487537779424, 0.14835823731430406, 0.10671962964919485, 0.06368351529263669, 0.020928030329135556, 0.10860798597180595, 0.30571386033469544, -0.015249275869878363, -0.1948134947798237, -0.12961098651534744, 0.31076725654392723]
|
1,803.06628
|
A machine learning method to separate cosmic ray electrons from protons
from 10 to 100 GeV using DAMPE data
|
DArk Matter Particle Explorer (DAMPE) is a general purpose high energy cosmic
ray and gamma ray observatory, aiming to detect high energy electrons and
gammas in the energy range 5 GeV to 10 TeV and hundreds of TeV for nuclei. This
paper provides a method using machine learning to identify electrons and
separate them from gammas,protons,helium and heavy nuclei with the DAMPE data
from 2016 January 1 to 2017 June 30, in energy range from 10 to 100 GeV.
|
astro-ph.IM physics.ins-det
|
dark matter particle explorer dampe is a general purpose high energy cosmic ray and gamma ray observatory aiming to detect high energy electrons and gammas in the energy range 5 gev to 10 tev and hundreds of tev for nuclei this paper provides a method using machine learning to identify electrons and separate them from gammasprotonshelium and heavy nuclei with the dampe data from 2016 january 1 to 2017 june 30 in energy range from 10 to 100 gev
|
[['dark', 'matter', 'particle', 'explorer', 'dampe', 'is', 'a', 'general', 'purpose', 'high', 'energy', 'cosmic', 'ray', 'and', 'gamma', 'ray', 'observatory', 'aiming', 'to', 'detect', 'high', 'energy', 'electrons', 'and', 'gammas', 'in', 'the', 'energy', 'range', '5', 'gev', 'to', '10', 'tev', 'and', 'hundreds', 'of', 'tev', 'for', 'nuclei', 'this', 'paper', 'provides', 'a', 'method', 'using', 'machine', 'learning', 'to', 'identify', 'electrons', 'and', 'separate', 'them', 'from', 'gammasprotonshelium', 'and', 'heavy', 'nuclei', 'with', 'the', 'dampe', 'data', 'from', '2016', 'january', '1', 'to', '2017', 'june', '30', 'in', 'energy', 'range', 'from', '10', 'to', '100', 'gev']]
|
[0.028701183042497948, 0.22057100609900096, -0.05152694092920193, 0.18766756231586137, -0.06790069452164552, -0.0842384143302647, 0.015756586675520223, 0.3730175013725574, -0.2316300873286449, -0.5442223130988005, -0.026077035566768013, -0.39441092553524637, 0.08932313214963636, 0.21356166183548525, 0.030535659621445797, 0.03593078992353418, 0.08490786873377286, -0.043510227816370435, 0.014512149476780532, -0.20914650569932583, 0.23273318293146217, 0.23185038762405896, 0.2103720938679404, 0.0991578376493775, 0.13692220815200692, 0.006187081611595857, -0.0284638481023602, -0.13428352295588225, -0.12308075831223948, 0.08831946890598211, 0.304054641412595, 0.10167751498281574, 0.18372077698138758, -0.36414418457887876, -0.17711781019058365, 0.17004608660219953, 0.06577001920399758, -0.02161043113282619, -0.08748339050903152, -0.3081006141534696, 0.11422816169961618, -0.25339028304920364, -0.13826605780288959, 0.03257137593120719, 0.007916027100947805, 0.017506605957467586, -0.20446984780331454, 0.07496251242283063, -0.07631828898611741, 0.03198113454840122, -0.11085288641222107, -0.09463981106632556, 0.06055058285785027, 0.00122984556051401, 0.10946763286259599, 0.095383310621867, 0.16769050486767903, -0.0700452513843536, -0.1259724878025456, 0.3906259458177747, -0.025633035400786843, 0.02843685220115078, 0.23245894955471158, -0.17548993101809174, -0.17098901171881992, 0.2600829461350655, 0.261096427617117, 0.04690516679189526, -0.2163867216485624, 0.1248992522544144, 0.04814510392502715, 0.24555478563818794, 0.07819650889350435, -0.015750619973121688, 0.24754674120161396, 0.1819669771223114, 0.052433627836692795, -0.0024053372609882783, -0.2711747701683541, 0.02706540513258332, -0.3156435778976466, -0.13486136918744215, -0.13258430645920527, 0.08779538840724108, -0.032813010688606974, 3.393517377284857e-05, 0.4360047707286401, 0.10299298200063789, 0.21675353528310856, -0.029121954110451043, 0.27538546067304337, 0.0023349964758381248, -0.00651174758035594, 0.16026660571328533, 0.33760432908550286, 0.09309356659650803, 0.23316770559176803, -0.09937254963621783, -0.1403860408657541, -0.008396624121814966]
|
1,803.06629
|
Cross-modality image synthesis from unpaired data using CycleGAN:
Effects of gradient consistency loss and training data size
|
CT is commonly used in orthopedic procedures. MRI is used along with CT to
identify muscle structures and diagnose osteonecrosis due to its superior soft
tissue contrast. However, MRI has poor contrast for bone structures. Clearly,
it would be helpful if a corresponding CT were available, as bone boundaries
are more clearly seen and CT has standardized (i.e., Hounsfield) units.
Therefore, we aim at MR-to-CT synthesis. The CycleGAN was successfully applied
to unpaired CT and MR images of the head, these images do not have as much
variation of intensity pairs as do images in the pelvic region due to the
presence of joints and muscles. In this paper, we extended the CycleGAN
approach by adding the gradient consistency loss to improve the accuracy at the
boundaries. We conducted two experiments. To evaluate image synthesis, we
investigated dependency of image synthesis accuracy on 1) the number of
training data and 2) the gradient consistency loss. To demonstrate the
applicability of our method, we also investigated a segmentation accuracy on
synthesized images.
|
cs.CV
|
ct is commonly used in orthopedic procedures mri is used along with ct to identify muscle structures and diagnose osteonecrosis due to its superior soft tissue contrast however mri has poor contrast for bone structures clearly it would be helpful if a corresponding ct were available as bone boundaries are more clearly seen and ct has standardized ie hounsfield units therefore we aim at mrtoct synthesis the cyclegan was successfully applied to unpaired ct and mr images of the head these images do not have as much variation of intensity pairs as do images in the pelvic region due to the presence of joints and muscles in this paper we extended the cyclegan approach by adding the gradient consistency loss to improve the accuracy at the boundaries we conducted two experiments to evaluate image synthesis we investigated dependency of image synthesis accuracy on 1 the number of training data and 2 the gradient consistency loss to demonstrate the applicability of our method we also investigated a segmentation accuracy on synthesized images
|
[['ct', 'is', 'commonly', 'used', 'in', 'orthopedic', 'procedures', 'mri', 'is', 'used', 'along', 'with', 'ct', 'to', 'identify', 'muscle', 'structures', 'and', 'diagnose', 'osteonecrosis', 'due', 'to', 'its', 'superior', 'soft', 'tissue', 'contrast', 'however', 'mri', 'has', 'poor', 'contrast', 'for', 'bone', 'structures', 'clearly', 'it', 'would', 'be', 'helpful', 'if', 'a', 'corresponding', 'ct', 'were', 'available', 'as', 'bone', 'boundaries', 'are', 'more', 'clearly', 'seen', 'and', 'ct', 'has', 'standardized', 'ie', 'hounsfield', 'units', 'therefore', 'we', 'aim', 'at', 'mrtoct', 'synthesis', 'the', 'cyclegan', 'was', 'successfully', 'applied', 'to', 'unpaired', 'ct', 'and', 'mr', 'images', 'of', 'the', 'head', 'these', 'images', 'do', 'not', 'have', 'as', 'much', 'variation', 'of', 'intensity', 'pairs', 'as', 'do', 'images', 'in', 'the', 'pelvic', 'region', 'due', 'to', 'the', 'presence', 'of', 'joints', 'and', 'muscles', 'in', 'this', 'paper', 'we', 'extended', 'the', 'cyclegan', 'approach', 'by', 'adding', 'the', 'gradient', 'consistency', 'loss', 'to', 'improve', 'the', 'accuracy', 'at', 'the', 'boundaries', 'we', 'conducted', 'two', 'experiments', 'to', 'evaluate', 'image', 'synthesis', 'we', 'investigated', 'dependency', 'of', 'image', 'synthesis', 'accuracy', 'on', '1', 'the', 'number', 'of', 'training', 'data', 'and', '2', 'the', 'gradient', 'consistency', 'loss', 'to', 'demonstrate', 'the', 'applicability', 'of', 'our', 'method', 'we', 'also', 'investigated', 'a', 'segmentation', 'accuracy', 'on', 'synthesized', 'images']]
|
[0.019926930728423244, 0.00029398396624909603, -0.048371811216587526, 0.09178134572267642, -0.05810798607383143, -0.10933703427093432, 0.009027003262000267, 0.4830453256254687, -0.24489475840921787, -0.3406503242375466, 0.13537361947066315, -0.2790302704800578, -0.1507413757376044, 0.18213600164197166, -0.15643296955677216, 0.08332507245975328, 0.078582149092108, 0.018963874558753827, -0.04154357071418096, -0.24590738553772953, 0.25184639069416065, 0.04568874965531423, 0.35014569263165707, 0.03979386139168021, 0.10655987038181218, -0.043742858508930484, 0.002806661160224501, 0.0540199316736749, -0.05930753758396296, 0.14104382883319083, 0.2781635437626392, 0.14246797243352322, 0.2557190320974983, -0.43217321530203606, -0.24198385783306817, 0.07923970126601702, 0.17926807801293976, 0.06867035961545566, -0.052920991330671206, -0.27304354190333363, 0.143621133108322, -0.09843985792797277, -0.009960727127926314, -0.11542636621058644, -0.04605376350912539, -0.028085366009926314, -0.2732501623028999, 0.11073089540946325, 0.031441414323361484, 0.09294684890328961, -0.10441493134028004, -0.10468382409034187, -0.032047331192092424, 0.18226915120064993, 0.04237734248094699, 0.08503259911530596, 0.159560750202988, -0.18113663334853994, -0.06952186286011162, 0.3487236027057995, -0.005176311234176597, -0.20152433437350042, 0.24654138911625043, -0.11734047620694207, -0.09781344834824696, 0.14390891759711152, 0.19169993099674362, 0.12681941088693052, -0.13309746161925004, -0.005902396557811538, 0.017449900929761283, 0.20645138357820755, 0.08502844837905073, -0.052647573618656573, 0.13318997504710056, 0.18141737260910518, -0.03752039419932236, 0.18015140343169847, -0.22180641686598607, 0.03443449604434564, -0.21771767812589293, -0.15341654701418628, -0.1663898246088887, -0.03338837662826443, -0.03812544872284086, -0.145796104471254, 0.3913911101846572, 0.2190019829034367, 0.21328807473525077, 0.029691486115403034, 0.3153095017105122, 0.01929659819476964, 0.1527628998943221, 0.0013725163086372263, 0.2264028239666539, 0.07657794211991131, 0.11481912760611843, -0.22665124240276568, 0.11861394486554405, 0.02046674333156689]
|
1,803.0663
|
Stellar Yields of Rotating First Stars. II. Pair Instability Supernovae
and Comparison with Observations
|
Recent theory predicts that a first star is born with a massive initial mass
of $\gtrsim$ 100 $M_\odot$. Pair instability supernova (PISN) is a common fate
for such a massive star. Our final goal is to prove the existence of PISN and
thus the high mass nature of the initial mass function in the early universe by
conducting {\it abundance profiling}, in which properties of a hypothetical
first star is constrained by metal-poor star abundances. In order to determine
reliable and useful abundances, we investigate the PISN nucleosynthesis taking
both rotating and non-rotating progenitors for the first time. We show that the
initial and CO core mass ranges for PISNe depend on the envelope structures:
non-magnetic rotating models developing inflated envelopes have a lower-shifted
CO mass range of $\sim$ 70--125 $M_\odot$, while non-rotating and magnetic
rotating models with deflated envelopes have a range of $\sim$ 80--135
$M_\odot$. However, we find no significant difference in explosive yields from
rotating and non-rotating progenitors, except for large nitrogen production in
non-magnetic rotating models. Furthermore, we conduct the first systematic
comparison between theoretical yields and a large sample of metal-poor star
abundances. We find that the predicted low [Na/Mg] $\sim$ $-1.5$ and high
[Ca/Mg] $\sim$ $0.5$--$1.3$ abundance ratios are the most important to
discriminate PISN signatures from normal metal-poor star abundances, and
confirm that no currently observed metal-poor star matches with the PISN
abundance. Extensive discussion on the non-detection is finally made.
|
astro-ph.SR
|
recent theory predicts that a first star is born with a massive initial mass of gtrsim 100 m_odot pair instability supernova pisn is a common fate for such a massive star our final goal is to prove the existence of pisn and thus the high mass nature of the initial mass function in the early universe by conducting it abundance profiling in which properties of a hypothetical first star is constrained by metalpoor star abundances in order to determine reliable and useful abundances we investigate the pisn nucleosynthesis taking both rotating and nonrotating progenitors for the first time we show that the initial and co core mass ranges for pisne depend on the envelope structures nonmagnetic rotating models developing inflated envelopes have a lowershifted co mass range of sim 70125 m_odot while nonrotating and magnetic rotating models with deflated envelopes have a range of sim 80135 m_odot however we find no significant difference in explosive yields from rotating and nonrotating progenitors except for large nitrogen production in nonmagnetic rotating models furthermore we conduct the first systematic comparison between theoretical yields and a large sample of metalpoor star abundances we find that the predicted low namg sim 15 and high camg sim 0513 abundance ratios are the most important to discriminate pisn signatures from normal metalpoor star abundances and confirm that no currently observed metalpoor star matches with the pisn abundance extensive discussion on the nondetection is finally made
|
[['recent', 'theory', 'predicts', 'that', 'a', 'first', 'star', 'is', 'born', 'with', 'a', 'massive', 'initial', 'mass', 'of', 'gtrsim', '100', 'm_odot', 'pair', 'instability', 'supernova', 'pisn', 'is', 'a', 'common', 'fate', 'for', 'such', 'a', 'massive', 'star', 'our', 'final', 'goal', 'is', 'to', 'prove', 'the', 'existence', 'of', 'pisn', 'and', 'thus', 'the', 'high', 'mass', 'nature', 'of', 'the', 'initial', 'mass', 'function', 'in', 'the', 'early', 'universe', 'by', 'conducting', 'it', 'abundance', 'profiling', 'in', 'which', 'properties', 'of', 'a', 'hypothetical', 'first', 'star', 'is', 'constrained', 'by', 'metalpoor', 'star', 'abundances', 'in', 'order', 'to', 'determine', 'reliable', 'and', 'useful', 'abundances', 'we', 'investigate', 'the', 'pisn', 'nucleosynthesis', 'taking', 'both', 'rotating', 'and', 'nonrotating', 'progenitors', 'for', 'the', 'first', 'time', 'we', 'show', 'that', 'the', 'initial', 'and', 'co', 'core', 'mass', 'ranges', 'for', 'pisne', 'depend', 'on', 'the', 'envelope', 'structures', 'nonmagnetic', 'rotating', 'models', 'developing', 'inflated', 'envelopes', 'have', 'a', 'lowershifted', 'co', 'mass', 'range', 'of', 'sim', '70125', 'm_odot', 'while', 'nonrotating', 'and', 'magnetic', 'rotating', 'models', 'with', 'deflated', 'envelopes', 'have', 'a', 'range', 'of', 'sim', '80135', 'm_odot', 'however', 'we', 'find', 'no', 'significant', 'difference', 'in', 'explosive', 'yields', 'from', 'rotating', 'and', 'nonrotating', 'progenitors', 'except', 'for', 'large', 'nitrogen', 'production', 'in', 'nonmagnetic', 'rotating', 'models', 'furthermore', 'we', 'conduct', 'the', 'first', 'systematic', 'comparison', 'between', 'theoretical', 'yields', 'and', 'a', 'large', 'sample', 'of', 'metalpoor', 'star', 'abundances', 'we', 'find', 'that', 'the', 'predicted', 'low', 'namg', 'sim', '15', 'and', 'high', 'camg', 'sim', '0513', 'abundance', 'ratios', 'are', 'the', 'most', 'important', 'to', 'discriminate', 'pisn', 'signatures', 'from', 'normal', 'metalpoor', 'star', 'abundances', 'and', 'confirm', 'that', 'no', 'currently', 'observed', 'metalpoor', 'star', 'matches', 'with', 'the', 'pisn', 'abundance', 'extensive', 'discussion', 'on', 'the', 'nondetection', 'is', 'finally', 'made']]
|
[-0.056281559949027414, 0.15706494741260688, -0.004345863716716462, 0.12451590081884902, -0.07415445134826401, -0.058356390974702355, 0.0588857631511154, 0.37902738359221755, -0.10905184963410919, -0.3706596499071159, 0.03581792445645291, -0.2842339273621427, 0.006121098131258437, 0.1737898889968687, -0.029614848454304513, -0.023586254276612654, 0.13668081567602905, -0.029116301650201227, -0.10397208372844344, -0.2453119178996124, 0.31932613708950736, 0.049771925753497696, 0.16016707450864798, -0.0182099856375568, 0.004746287803542107, -0.16688557739265542, -0.009318569325098888, -0.044865667669379966, -0.19448527472274516, -0.00725973932112151, 0.201967786810224, 0.1711279710407983, 0.1973992529553064, -0.3771819960126255, -0.21082353002213416, 0.08832673171455872, 0.20639706113712586, 0.09399524376915887, -0.17932097837130756, -0.22714598280417317, 0.126273934276616, -0.22057520277164083, -0.1584015983592798, 0.021905641951300996, 0.06389585084590238, 0.020887288056125747, -0.2835268160288638, 0.160478616865758, 0.02184074821441058, 0.052251177628901094, -0.10277201453213917, -0.13943680349360912, -0.1105670534183291, 0.03448823567162803, 0.06265823423485965, 0.0486845609454557, 0.13594009570933463, -0.11328147258659071, 0.025576775015252542, 0.42183379922458464, -0.12236370188060236, -0.011258710437315576, 0.24907295104869184, -0.2166371993324224, -0.1922982627961864, 0.12035972750349407, 0.14677465080699706, 0.16861807858333624, -0.14399044116503223, -0.034332865634264347, -0.012193020340550611, 0.208674155678501, 0.06967557477467555, 0.02384899179293264, 0.36618903614382475, 0.21388641987392243, -0.009319875426491367, 0.028157502402888335, -0.17548942748021254, -0.06544743392993002, -0.21080008494132693, -0.13964031193643175, -0.09640026357460846, 0.10076137608154974, -0.15642550862833926, -0.1313606826885742, 0.2925396264411826, 0.12807650240930787, 0.22744175866097607, 0.04286944192804475, 0.28738226498814023, 0.06776945365127177, 0.0685289000735638, 0.1315202326226504, 0.3260542569246064, 0.22462032676198856, 0.07517244174501839, -0.253785146781283, 0.11073547514165415, -0.007794409272994133]
|
1,803.06631
|
A Deal with the Devil: From Divergent Perturbation Theory to an
Exponentially-Convergent Self-Consistent Expansion
|
For many nonlinear physical systems, approximate solutions are pursued by
conventional perturbation theory in powers of the non-linear terms.
Unfortunately, this often produces divergent asymptotic series, collectively
dismissed by Abel as "an invention of the devil." An alternative method, the
self-consistent expansion (SCE), has been introduced by Schwartz and Edwards.
Its basic idea is a rescaling of the zeroth-order system around which the
solution is expanded, to achieve optimal results. While low-order SCEs have
been remarkably successful in describing the dynamics of non-equilibrium
many-body systems (e.g., the Kardar-Parisi-Zhang equation), its convergence
properties have not been elucidated before. To address this issue we apply this
technique to the canonical partition function of the classical harmonic
oscillator with a quartic $gx^{4}$ anharmonicity, for which perturbation
theory's divergence is well-known. We obtain the $N$th order SCE for the
partition function, which is rigorously found to converge exponentially fast in
$N$, and uniformly in $g\ge0$. We use our results to elucidate the relation
between the SCE and the class of approaches based on the so-called
"order-dependent mapping." Moreover, we put the SCE to test against other
methods that improve upon perturbation theory (Borel resummation,
hyperasymptotics, Pad\'e approximants, and the Lanczos $\tau$-method), and find
that it compares favorably with all of them for small $g$ and dominates over
them for large $g$. The SCE is shown to successfully capture the correct
partition function for the double-well potential case, where no perturbative
expansion exists. Our treatment is generalized to the case of many oscillators,
as well as to any nonlinearity of the form $g|x|^{q}$ with $q\ge0$ and complex
$g$. These results allow us to treat the Airy function, and to see the
fingerprints of Stokes lines in the SCE.
|
math-ph cond-mat.stat-mech hep-th math.MP
|
for many nonlinear physical systems approximate solutions are pursued by conventional perturbation theory in powers of the nonlinear terms unfortunately this often produces divergent asymptotic series collectively dismissed by abel as an invention of the devil an alternative method the selfconsistent expansion sce has been introduced by schwartz and edwards its basic idea is a rescaling of the zerothorder system around which the solution is expanded to achieve optimal results while loworder sces have been remarkably successful in describing the dynamics of nonequilibrium manybody systems eg the kardarparisizhang equation its convergence properties have not been elucidated before to address this issue we apply this technique to the canonical partition function of the classical harmonic oscillator with a quartic gx4 anharmonicity for which perturbation theorys divergence is wellknown we obtain the nth order sce for the partition function which is rigorously found to converge exponentially fast in n and uniformly in gge0 we use our results to elucidate the relation between the sce and the class of approaches based on the socalled orderdependent mapping moreover we put the sce to test against other methods that improve upon perturbation theory borel resummation hyperasymptotics pade approximants and the lanczos taumethod and find that it compares favorably with all of them for small g and dominates over them for large g the sce is shown to successfully capture the correct partition function for the doublewell potential case where no perturbative expansion exists our treatment is generalized to the case of many oscillators as well as to any nonlinearity of the form gxq with qge0 and complex g these results allow us to treat the airy function and to see the fingerprints of stokes lines in the sce
|
[['for', 'many', 'nonlinear', 'physical', 'systems', 'approximate', 'solutions', 'are', 'pursued', 'by', 'conventional', 'perturbation', 'theory', 'in', 'powers', 'of', 'the', 'nonlinear', 'terms', 'unfortunately', 'this', 'often', 'produces', 'divergent', 'asymptotic', 'series', 'collectively', 'dismissed', 'by', 'abel', 'as', 'an', 'invention', 'of', 'the', 'devil', 'an', 'alternative', 'method', 'the', 'selfconsistent', 'expansion', 'sce', 'has', 'been', 'introduced', 'by', 'schwartz', 'and', 'edwards', 'its', 'basic', 'idea', 'is', 'a', 'rescaling', 'of', 'the', 'zerothorder', 'system', 'around', 'which', 'the', 'solution', 'is', 'expanded', 'to', 'achieve', 'optimal', 'results', 'while', 'loworder', 'sces', 'have', 'been', 'remarkably', 'successful', 'in', 'describing', 'the', 'dynamics', 'of', 'nonequilibrium', 'manybody', 'systems', 'eg', 'the', 'kardarparisizhang', 'equation', 'its', 'convergence', 'properties', 'have', 'not', 'been', 'elucidated', 'before', 'to', 'address', 'this', 'issue', 'we', 'apply', 'this', 'technique', 'to', 'the', 'canonical', 'partition', 'function', 'of', 'the', 'classical', 'harmonic', 'oscillator', 'with', 'a', 'quartic', 'gx4', 'anharmonicity', 'for', 'which', 'perturbation', 'theorys', 'divergence', 'is', 'wellknown', 'we', 'obtain', 'the', 'nth', 'order', 'sce', 'for', 'the', 'partition', 'function', 'which', 'is', 'rigorously', 'found', 'to', 'converge', 'exponentially', 'fast', 'in', 'n', 'and', 'uniformly', 'in', 'gge0', 'we', 'use', 'our', 'results', 'to', 'elucidate', 'the', 'relation', 'between', 'the', 'sce', 'and', 'the', 'class', 'of', 'approaches', 'based', 'on', 'the', 'socalled', 'orderdependent', 'mapping', 'moreover', 'we', 'put', 'the', 'sce', 'to', 'test', 'against', 'other', 'methods', 'that', 'improve', 'upon', 'perturbation', 'theory', 'borel', 'resummation', 'hyperasymptotics', 'pade', 'approximants', 'and', 'the', 'lanczos', 'taumethod', 'and', 'find', 'that', 'it', 'compares', 'favorably', 'with', 'all', 'of', 'them', 'for', 'small', 'g', 'and', 'dominates', 'over', 'them', 'for', 'large', 'g', 'the', 'sce', 'is', 'shown', 'to', 'successfully', 'capture', 'the', 'correct', 'partition', 'function', 'for', 'the', 'doublewell', 'potential', 'case', 'where', 'no', 'perturbative', 'expansion', 'exists', 'our', 'treatment', 'is', 'generalized', 'to', 'the', 'case', 'of', 'many', 'oscillators', 'as', 'well', 'as', 'to', 'any', 'nonlinearity', 'of', 'the', 'form', 'gxq', 'with', 'qge0', 'and', 'complex', 'g', 'these', 'results', 'allow', 'us', 'to', 'treat', 'the', 'airy', 'function', 'and', 'to', 'see', 'the', 'fingerprints', 'of', 'stokes', 'lines', 'in', 'the', 'sce']]
|
[-0.07412738220701094, 0.04359053927826308, -0.11731840869224894, 0.071475685570359, -0.06301877073489637, -0.12600759291432223, 0.008395630269608457, 0.33342217538951424, -0.2544369977501665, -0.2501128130512292, 0.07624874950977423, -0.2774078371762682, -0.1773230228356109, 0.19124099044596582, -0.03885930125838593, 0.09594193251726742, 0.013104772044172156, 0.036695606295540126, -0.06293708880976057, -0.2533247669254126, 0.3024086430093013, 0.049617285106254336, 0.26031247794621465, 0.0411050396447327, 0.09263663397105511, -0.0011072059939732262, -0.007244353681655874, 0.008011818972773395, -0.12552222075287334, 0.08662028445304776, 0.24514691701899932, 0.08433630393182118, 0.30887932875143587, -0.4129806295684856, -0.22494162886368452, 0.09421049279104884, 0.16184052267281038, 0.1123483600627963, -0.005701296678644115, -0.24797152525388158, 0.07227588704060955, -0.18676540216073848, -0.1699484138804618, -0.1451964612622949, 0.02966899440313379, 0.0592275668587786, -0.2743074568906485, 0.06760396976958573, 0.05405524258871519, -0.009653300942046113, -0.023678046118344537, -0.09344082811574442, 0.009044514961480614, 0.11487762869158794, 0.06899001885465877, 0.051802055913567756, 0.0689206824163943, -0.11496098463900895, -0.07070129602733585, 0.3852953020429846, -0.078655549701834, -0.2131315499926353, 0.18019549111838998, -0.138575785202525, -0.12732836410676973, 0.1176810320750493, 0.10151998274275319, 0.1328585446840586, -0.13396850438942084, 0.12257758511303787, -0.006194212655019429, 0.1265177765300357, 0.07802023000407657, 0.011844245687304031, 0.1412109610738106, 0.10484863608311128, 0.05416307562760221, 0.12582974186113713, -0.02458513247814717, -0.13090042986132633, -0.2817759094092207, -0.11932323396533033, -0.20722060451679614, 0.03724718652086668, -0.07603886268664098, -0.21577046759704907, 0.3836410960180879, 0.1596855783893887, 0.16862201304375243, 0.06917870425874548, 0.2737267853105507, 0.17960855179578133, 0.06396940126547783, 0.040694775049805, 0.24489636587790184, 0.1514699836328332, 0.060916549129341475, -0.2409077948743751, 0.04566575948726453, 0.1260419481610846]
|
1,803.06632
|
A Guided FP-growth algorithm for multitude-targeted mining of big data
|
In this paper we present the GFP-growth (Guided FP-growth) algorithm, a novel
method for multitude-targeted mining: finding the count of a given large list
of itemsets in large data. The GFP-growth algorithm is designed to focus on the
specific multitude itemsets of interest and optimizes the time and memory
costs. We prove that the GFP-growth algorithm yields the exact frequency-counts
for the required itemsets. We show that for a number of different problems, a
solution can be devised which takes advantage of the efficient implementation
of multitude-targeted mining for boosting the performance. In particular, we
study in detail the problem of generating the minority-class rules from
imbalanced data, a scenario that appears in many real-life domains such as
medical applications, failure prediction, network and cyber security, and
maintenance. We develop the Minority-Report Algorithm that uses the GFP-growth
for boosting performance. We prove some theoretical properties of the
Minority-Report Algorithm and demonstrate its performance gain using
simulations and real data.
|
cs.DB
|
in this paper we present the gfpgrowth guided fpgrowth algorithm a novel method for multitudetargeted mining finding the count of a given large list of itemsets in large data the gfpgrowth algorithm is designed to focus on the specific multitude itemsets of interest and optimizes the time and memory costs we prove that the gfpgrowth algorithm yields the exact frequencycounts for the required itemsets we show that for a number of different problems a solution can be devised which takes advantage of the efficient implementation of multitudetargeted mining for boosting the performance in particular we study in detail the problem of generating the minorityclass rules from imbalanced data a scenario that appears in many reallife domains such as medical applications failure prediction network and cyber security and maintenance we develop the minorityreport algorithm that uses the gfpgrowth for boosting performance we prove some theoretical properties of the minorityreport algorithm and demonstrate its performance gain using simulations and real data
|
[['in', 'this', 'paper', 'we', 'present', 'the', 'gfpgrowth', 'guided', 'fpgrowth', 'algorithm', 'a', 'novel', 'method', 'for', 'multitudetargeted', 'mining', 'finding', 'the', 'count', 'of', 'a', 'given', 'large', 'list', 'of', 'itemsets', 'in', 'large', 'data', 'the', 'gfpgrowth', 'algorithm', 'is', 'designed', 'to', 'focus', 'on', 'the', 'specific', 'multitude', 'itemsets', 'of', 'interest', 'and', 'optimizes', 'the', 'time', 'and', 'memory', 'costs', 'we', 'prove', 'that', 'the', 'gfpgrowth', 'algorithm', 'yields', 'the', 'exact', 'frequencycounts', 'for', 'the', 'required', 'itemsets', 'we', 'show', 'that', 'for', 'a', 'number', 'of', 'different', 'problems', 'a', 'solution', 'can', 'be', 'devised', 'which', 'takes', 'advantage', 'of', 'the', 'efficient', 'implementation', 'of', 'multitudetargeted', 'mining', 'for', 'boosting', 'the', 'performance', 'in', 'particular', 'we', 'study', 'in', 'detail', 'the', 'problem', 'of', 'generating', 'the', 'minorityclass', 'rules', 'from', 'imbalanced', 'data', 'a', 'scenario', 'that', 'appears', 'in', 'many', 'reallife', 'domains', 'such', 'as', 'medical', 'applications', 'failure', 'prediction', 'network', 'and', 'cyber', 'security', 'and', 'maintenance', 'we', 'develop', 'the', 'minorityreport', 'algorithm', 'that', 'uses', 'the', 'gfpgrowth', 'for', 'boosting', 'performance', 'we', 'prove', 'some', 'theoretical', 'properties', 'of', 'the', 'minorityreport', 'algorithm', 'and', 'demonstrate', 'its', 'performance', 'gain', 'using', 'simulations', 'and', 'real', 'data']]
|
[-0.1258911032920545, 0.001448181013461032, -0.07280114218379596, 0.0776341483757825, -0.10042934142832273, -0.10567906494648044, 0.09159988165434353, 0.39363066501477184, -0.2635600829460457, -0.3253356034447457, 0.11475131948161992, -0.2368823909535517, -0.19495665864544173, 0.2446010899319149, -0.10447142912939288, 0.09785224764502845, 0.12044111013509869, 0.04684459807631237, -0.015704175404096448, -0.2817136905965657, 0.28197245240923674, 0.037405626836165884, 0.33071933553578464, 0.07247216308952059, 0.11550110038232934, 0.007758599575122003, -0.037979302480451615, 0.02854185026014236, -0.08524303517728174, 0.16681022453045752, 0.28103079149359533, 0.2567753566039446, 0.33660304100173555, -0.3996829368734087, -0.16143949870841906, 0.12488048149309322, 0.12878577787964757, 0.13236673886574246, -0.10996905836699762, -0.2428869370780459, 0.11868963962773872, -0.16203852574146213, -0.05649720962019333, -0.13234392865501982, -0.012876385144183254, 0.025693666255345044, -0.3174848858924473, 0.010710854116778553, 0.037431878196014685, 0.03567430901103744, -0.05073822049037523, -0.11045780853410951, 0.06550329284791172, 0.1163777826891092, 0.046227998890019224, -0.006436776203176409, 0.08270290325657507, -0.14316909782911097, -0.17778425742841625, 0.393642450853257, -0.026679612221378907, -0.1670478070154786, 0.14967154104603467, -0.05460159932841468, -0.19009251192857335, 0.118568188939974, 0.24178799337348322, 0.13662390366007934, -0.14210813758237398, 0.05475836836206392, -0.04265107495673731, 0.13695594426122756, 0.02380800876596005, 0.019941593492951465, 0.12942765772896606, 0.24521893737502884, 0.07482057304906786, 0.18813433127669507, -0.1158557160151818, -0.0687570710684739, -0.2523765482854561, -0.15755125596811934, -0.18849347192441035, -0.039217728104904974, -0.12036231355197588, -0.17297522240360969, 0.4130182287540116, 0.2281279201160704, 0.18838108525504174, 0.09538363274323809, 0.33294437174362684, 0.08554013933167713, 0.06889778479258073, 0.12744718191999138, 0.15837153682909036, 0.017065262456966285, 0.10770382633466224, -0.21762117988953453, 0.09307908329783994, 0.037758947343997706]
|
1,803.06633
|
Effects of the equation of state on the core-crust interface of slowly
rotating neutron stars
|
We systematically study the symmetry energy effects of the transition density
$n_{\rm t}$ and the transition pressure $P_{\rm t}$ around the crust-core
interface of a neutron star in the framework of the dynamical and the
thermodynamical method respectively. We employ both the parabolic approximation
and the full expansion, for the definition of the symmetry energy. We use
various theoretical nuclear models, which are suitable for reproducing the bulk
properties of nuclear matter at low densities, close to saturation density as
well as the maximum observational neutron star mass. Firstly we derive and
present an approximation for the transition pressure $P_{\rm t}$ and crustal
mass $M_{\rm crust}$. Secondly, we explore the effects of the Equation of State
(EoS) on a few astrophysical applications which are sensitive to the values of
$n_{\rm t}$ and $P_{\rm t}$ including neutron star oscillation frequencies,
thermal relaxation of the crust, crustal fraction of the moment of inertia and
the r-mode instability window of a rotating neutron star. We found that the
above quantities are sensitive mainly on the applied approximation for the
symmetry energy (confirming previous results). Furthermore, an additional
sensitivity also exists, depending on the used method (dynamical or
thermodynamical). The above findings lead us to claim that the determination of
the $n_{\rm t}$ and $P_{\rm t}$ must be reliable and accurate before they are
used to constrain relevant neutron star properties.
|
nucl-th astro-ph.HE
|
we systematically study the symmetry energy effects of the transition density n_rm t and the transition pressure p_rm t around the crustcore interface of a neutron star in the framework of the dynamical and the thermodynamical method respectively we employ both the parabolic approximation and the full expansion for the definition of the symmetry energy we use various theoretical nuclear models which are suitable for reproducing the bulk properties of nuclear matter at low densities close to saturation density as well as the maximum observational neutron star mass firstly we derive and present an approximation for the transition pressure p_rm t and crustal mass m_rm crust secondly we explore the effects of the equation of state eos on a few astrophysical applications which are sensitive to the values of n_rm t and p_rm t including neutron star oscillation frequencies thermal relaxation of the crust crustal fraction of the moment of inertia and the rmode instability window of a rotating neutron star we found that the above quantities are sensitive mainly on the applied approximation for the symmetry energy confirming previous results furthermore an additional sensitivity also exists depending on the used method dynamical or thermodynamical the above findings lead us to claim that the determination of the n_rm t and p_rm t must be reliable and accurate before they are used to constrain relevant neutron star properties
|
[['we', 'systematically', 'study', 'the', 'symmetry', 'energy', 'effects', 'of', 'the', 'transition', 'density', 'n_rm', 't', 'and', 'the', 'transition', 'pressure', 'p_rm', 't', 'around', 'the', 'crustcore', 'interface', 'of', 'a', 'neutron', 'star', 'in', 'the', 'framework', 'of', 'the', 'dynamical', 'and', 'the', 'thermodynamical', 'method', 'respectively', 'we', 'employ', 'both', 'the', 'parabolic', 'approximation', 'and', 'the', 'full', 'expansion', 'for', 'the', 'definition', 'of', 'the', 'symmetry', 'energy', 'we', 'use', 'various', 'theoretical', 'nuclear', 'models', 'which', 'are', 'suitable', 'for', 'reproducing', 'the', 'bulk', 'properties', 'of', 'nuclear', 'matter', 'at', 'low', 'densities', 'close', 'to', 'saturation', 'density', 'as', 'well', 'as', 'the', 'maximum', 'observational', 'neutron', 'star', 'mass', 'firstly', 'we', 'derive', 'and', 'present', 'an', 'approximation', 'for', 'the', 'transition', 'pressure', 'p_rm', 't', 'and', 'crustal', 'mass', 'm_rm', 'crust', 'secondly', 'we', 'explore', 'the', 'effects', 'of', 'the', 'equation', 'of', 'state', 'eos', 'on', 'a', 'few', 'astrophysical', 'applications', 'which', 'are', 'sensitive', 'to', 'the', 'values', 'of', 'n_rm', 't', 'and', 'p_rm', 't', 'including', 'neutron', 'star', 'oscillation', 'frequencies', 'thermal', 'relaxation', 'of', 'the', 'crust', 'crustal', 'fraction', 'of', 'the', 'moment', 'of', 'inertia', 'and', 'the', 'rmode', 'instability', 'window', 'of', 'a', 'rotating', 'neutron', 'star', 'we', 'found', 'that', 'the', 'above', 'quantities', 'are', 'sensitive', 'mainly', 'on', 'the', 'applied', 'approximation', 'for', 'the', 'symmetry', 'energy', 'confirming', 'previous', 'results', 'furthermore', 'an', 'additional', 'sensitivity', 'also', 'exists', 'depending', 'on', 'the', 'used', 'method', 'dynamical', 'or', 'thermodynamical', 'the', 'above', 'findings', 'lead', 'us', 'to', 'claim', 'that', 'the', 'determination', 'of', 'the', 'n_rm', 't', 'and', 'p_rm', 't', 'must', 'be', 'reliable', 'and', 'accurate', 'before', 'they', 'are', 'used', 'to', 'constrain', 'relevant', 'neutron', 'star', 'properties']]
|
[-0.0881623007923299, 0.214173256332544, -0.09464888608017485, 0.09414743112055544, -0.07549688923747036, -0.04255890893741687, 0.08056050381497049, 0.31570404009803277, -0.2194071424302403, -0.33779687877531095, 0.07782162111898729, -0.2789873197502436, -0.012204812344221095, 0.17702483992802087, 0.03802514240137478, 0.05440160027754622, 0.006686618097233156, 0.08377852194454308, -0.13735414707124446, -0.17130906363674295, 0.3135290788035298, 0.0680077657686128, 0.21805017232296922, 0.09200817802797855, 0.04388868584993012, -0.04858920440931152, 0.012653002398507054, 0.0069221884980469545, -0.22530357440809734, 0.006869121684409711, 0.2158541314183902, 0.08137289884947405, 0.17425835491588856, -0.4099686070045842, -0.21120777720019288, 0.0661405662848052, 0.09187710534274529, 0.07149209581122688, -0.046298227005736645, -0.21481695885889002, 0.05860220391797168, -0.22158024215758962, -0.15199969392341647, -0.1091428479356158, 0.039023338237611706, 0.052549849315864414, -0.2770262624481734, 0.15219202084917605, 0.06172351914356434, 0.006239435422164491, -0.1347826108631846, -0.15553271690884088, -0.04938086865922141, 0.05711035064569293, 0.06574898603524078, 0.0513025593137705, 0.17075614300071845, -0.14980770388642728, 0.006168037770923211, 0.3784223576753281, -0.06602876016250626, -0.09250565853774022, 0.17887968239723193, -0.2004798638023075, -0.17043073511875279, 0.11559039422968354, 0.16885053000868286, 0.16818567697935233, -0.1219389731667542, 0.041714823420548254, 0.024982821389146575, 0.16843263624802166, 0.057370168630788636, 0.030515392343226477, 0.26517855313643485, 0.17159463281616044, 0.01964261368868897, 0.08486581070703508, -0.16693224675547216, -0.06305956754152404, -0.3198712486753216, -0.09651486171733348, -0.13527875853751659, 0.05380908817069252, -0.11305113997260911, -0.11779333618859297, 0.35805951680019826, 0.13970711796405, 0.1997155699461477, 0.004879658073515094, 0.2649772295903718, 0.14849108998563207, 0.043474646100552856, 0.10891247797890213, 0.2841654265512782, 0.22996356223180628, 0.10657834136163168, -0.3358881890831212, 0.0633349859202896, 0.0411011210913536]
|
1,803.06634
|
Detection of a Double Relic in the Torpedo Cluster: SPT-CL J0245-5302
|
The Torpedo cluster, SPT-CL J0245-5302 (S0295) is a massive, merging cluster
at a redshift of z = 0.300, which exhibits a strikingly similar morphology to
the Bullet cluster 1E 0657-55.8 (z = 0.296), including a classic bow shock in
the cluster's intra-cluster medium revealed by Chandra X-ray observations. We
present Australia Telescope Compact Array data centred at 2.1 GHz and Murchison
Widefield Array data at frequencies between 72 MHz and 231 MHz which we use to
study the properties of the cluster. We characterise a number of discrete and
diffuse radio sources in the cluster, including the detection of two previously
unknown radio relics on the cluster periphery. The average spectral index of
the diffuse emission between 70 MHz and 3.1 GHz is
$\alpha=-1.63_{-0.10}^{+0.10}$ and a radio-derived Mach number for the shock in
the west of the cluster is calculated as M = 2.04. The Torpedo cluster is thus
as a double relic system at moderate redshift.
|
astro-ph.GA
|
the torpedo cluster sptcl j02455302 s0295 is a massive merging cluster at a redshift of z 0300 which exhibits a strikingly similar morphology to the bullet cluster 1e 0657558 z 0296 including a classic bow shock in the clusters intracluster medium revealed by chandra xray observations we present australia telescope compact array data centred at 21 ghz and murchison widefield array data at frequencies between 72 mhz and 231 mhz which we use to study the properties of the cluster we characterise a number of discrete and diffuse radio sources in the cluster including the detection of two previously unknown radio relics on the cluster periphery the average spectral index of the diffuse emission between 70 mhz and 31 ghz is alpha163_010010 and a radioderived mach number for the shock in the west of the cluster is calculated as m 204 the torpedo cluster is thus as a double relic system at moderate redshift
|
[['the', 'torpedo', 'cluster', 'sptcl', 'j02455302', 's0295', 'is', 'a', 'massive', 'merging', 'cluster', 'at', 'a', 'redshift', 'of', 'z', '0300', 'which', 'exhibits', 'a', 'strikingly', 'similar', 'morphology', 'to', 'the', 'bullet', 'cluster', '1e', '0657558', 'z', '0296', 'including', 'a', 'classic', 'bow', 'shock', 'in', 'the', 'clusters', 'intracluster', 'medium', 'revealed', 'by', 'chandra', 'xray', 'observations', 'we', 'present', 'australia', 'telescope', 'compact', 'array', 'data', 'centred', 'at', '21', 'ghz', 'and', 'murchison', 'widefield', 'array', 'data', 'at', 'frequencies', 'between', '72', 'mhz', 'and', '231', 'mhz', 'which', 'we', 'use', 'to', 'study', 'the', 'properties', 'of', 'the', 'cluster', 'we', 'characterise', 'a', 'number', 'of', 'discrete', 'and', 'diffuse', 'radio', 'sources', 'in', 'the', 'cluster', 'including', 'the', 'detection', 'of', 'two', 'previously', 'unknown', 'radio', 'relics', 'on', 'the', 'cluster', 'periphery', 'the', 'average', 'spectral', 'index', 'of', 'the', 'diffuse', 'emission', 'between', '70', 'mhz', 'and', '31', 'ghz', 'is', 'alpha163_010010', 'and', 'a', 'radioderived', 'mach', 'number', 'for', 'the', 'shock', 'in', 'the', 'west', 'of', 'the', 'cluster', 'is', 'calculated', 'as', 'm', '204', 'the', 'torpedo', 'cluster', 'is', 'thus', 'as', 'a', 'double', 'relic', 'system', 'at', 'moderate', 'redshift']]
|
[-0.10063157778230206, 0.102023355144736, -0.05338463667681478, 0.04960992308765255, -0.10111008620117821, -0.04665402542269289, 0.09762536824082597, 0.44441417344407924, -0.1602499710175437, -0.3495236200705288, 0.11055287637127971, -0.2851720680143462, -0.02693838645882954, 0.19500549730770783, 0.0702352897535442, -0.07518372214738502, 0.04498117163450464, -0.05817253585590284, -0.007537516829093598, -0.20022617981288063, 0.22911198170769292, 0.12845986254362154, 0.22934975605211314, -0.03618451779776111, 0.12015940999112629, -0.08604943753830743, -0.07967976047133175, -0.023632070561562548, -0.08697978668038221, 0.023454952043317726, 0.2298781786681406, 0.11755882600778776, 0.21952372554393595, -0.2992113700247561, -0.1752736537735786, 0.038116804132891806, 0.15817822802521594, 0.010501359279471024, -0.01734535022105232, -0.3357663547484488, 0.11173177533320441, -0.19977851572989283, -0.21232435803872762, 0.1851551394095484, 0.038029190938879694, 0.06982566440780184, -0.19128650737408276, 0.19219992780404177, -0.06727416216725768, 0.05046323783671027, -0.09795515108483517, -0.1312430669570539, -0.0018224273476786664, 0.0700064912247194, -0.07181349637245896, 0.0918777887601504, 0.15334756265622596, -0.12567474744868595, -0.07121516750286648, 0.3788904164985612, -0.03733537550121299, 0.06334229188644333, 0.25222789031138876, -0.24446683810308378, -0.25028765617965393, 0.1678270537511057, 0.15807446917913706, 0.022809429814274244, -0.13581089599563784, 0.048724503744785236, -0.06019951135154493, 0.25183757773403154, 0.11044288120257194, 0.05596231515611837, 0.26411114687359094, 0.10112860307655612, 0.06418802101313081, 0.17870185648504372, -0.30320176501860163, 0.040291275963224224, -0.21416350106657822, -0.07154665793915162, -0.14612440466695767, 0.0726315202684888, -0.16051924994031494, -0.1270981662014703, 0.3395186374426529, 0.03920727788735896, 0.16923392051059927, 0.056129053826382176, 0.2644319125136595, 0.045917303230465445, 0.07023665954479145, 0.13521957298469367, 0.2513340718748159, 0.22193629703706513, 0.08870841424283109, -0.2144221882119972, -0.03916530263924737, -0.028970327394835602]
|
1,803.06635
|
A stabilized cut discontinuous Galerkin framework: I. Elliptic boundary
value and interface problems
|
We develop a stabilized cut discontinuous Galerkin framework for the
numerical solution of el- liptic boundary value and interface problems on
complicated domains. The domain of interest is embedded in a structured,
unfitted background mesh in R d , so that the boundary or interface can cut
through it in an arbitrary fashion. The method is based on an unfitted variant
of the classical symmetric interior penalty method using piecewise
discontinuous polynomials defined on the back- ground mesh. Instead of the cell
agglomeration technique commonly used in previously introduced unfitted
discontinuous Galerkin methods, we employ and extend ghost penalty techniques
from recently developed continuous cut finite element methods, which allows for
a minimal extension of existing fitted discontinuous Galerkin software to
handle unfitted geometries. Identifying four abstract assumptions on the ghost
penalty, we derive geometrically robust a priori error and con- dition number
estimates for the Poisson boundary value problem which hold irrespective of the
particular cut configuration. Possible realizations of suitable ghost penalties
are discussed. We also demonstrate how the framework can be elegantly applied
to discretize high contrast interface problems. The theoretical results are
illustrated by a number of numerical experiments for various approximation
orders and for two and three-dimensional test problems.
|
math.NA cs.CE cs.NA
|
we develop a stabilized cut discontinuous galerkin framework for the numerical solution of el liptic boundary value and interface problems on complicated domains the domain of interest is embedded in a structured unfitted background mesh in r d so that the boundary or interface can cut through it in an arbitrary fashion the method is based on an unfitted variant of the classical symmetric interior penalty method using piecewise discontinuous polynomials defined on the back ground mesh instead of the cell agglomeration technique commonly used in previously introduced unfitted discontinuous galerkin methods we employ and extend ghost penalty techniques from recently developed continuous cut finite element methods which allows for a minimal extension of existing fitted discontinuous galerkin software to handle unfitted geometries identifying four abstract assumptions on the ghost penalty we derive geometrically robust a priori error and con dition number estimates for the poisson boundary value problem which hold irrespective of the particular cut configuration possible realizations of suitable ghost penalties are discussed we also demonstrate how the framework can be elegantly applied to discretize high contrast interface problems the theoretical results are illustrated by a number of numerical experiments for various approximation orders and for two and threedimensional test problems
|
[['we', 'develop', 'a', 'stabilized', 'cut', 'discontinuous', 'galerkin', 'framework', 'for', 'the', 'numerical', 'solution', 'of', 'el', 'liptic', 'boundary', 'value', 'and', 'interface', 'problems', 'on', 'complicated', 'domains', 'the', 'domain', 'of', 'interest', 'is', 'embedded', 'in', 'a', 'structured', 'unfitted', 'background', 'mesh', 'in', 'r', 'd', 'so', 'that', 'the', 'boundary', 'or', 'interface', 'can', 'cut', 'through', 'it', 'in', 'an', 'arbitrary', 'fashion', 'the', 'method', 'is', 'based', 'on', 'an', 'unfitted', 'variant', 'of', 'the', 'classical', 'symmetric', 'interior', 'penalty', 'method', 'using', 'piecewise', 'discontinuous', 'polynomials', 'defined', 'on', 'the', 'back', 'ground', 'mesh', 'instead', 'of', 'the', 'cell', 'agglomeration', 'technique', 'commonly', 'used', 'in', 'previously', 'introduced', 'unfitted', 'discontinuous', 'galerkin', 'methods', 'we', 'employ', 'and', 'extend', 'ghost', 'penalty', 'techniques', 'from', 'recently', 'developed', 'continuous', 'cut', 'finite', 'element', 'methods', 'which', 'allows', 'for', 'a', 'minimal', 'extension', 'of', 'existing', 'fitted', 'discontinuous', 'galerkin', 'software', 'to', 'handle', 'unfitted', 'geometries', 'identifying', 'four', 'abstract', 'assumptions', 'on', 'the', 'ghost', 'penalty', 'we', 'derive', 'geometrically', 'robust', 'a', 'priori', 'error', 'and', 'con', 'dition', 'number', 'estimates', 'for', 'the', 'poisson', 'boundary', 'value', 'problem', 'which', 'hold', 'irrespective', 'of', 'the', 'particular', 'cut', 'configuration', 'possible', 'realizations', 'of', 'suitable', 'ghost', 'penalties', 'are', 'discussed', 'we', 'also', 'demonstrate', 'how', 'the', 'framework', 'can', 'be', 'elegantly', 'applied', 'to', 'discretize', 'high', 'contrast', 'interface', 'problems', 'the', 'theoretical', 'results', 'are', 'illustrated', 'by', 'a', 'number', 'of', 'numerical', 'experiments', 'for', 'various', 'approximation', 'orders', 'and', 'for', 'two', 'and', 'threedimensional', 'test', 'problems']]
|
[-0.06818759427544209, 0.03117331653953839, -0.10443616572232677, 0.06471849817409189, -0.11733137150894445, -0.1622061568685798, 0.020288705342854974, 0.39496973619593473, -0.29656228119862443, -0.2693430538528995, 0.1634977732670936, -0.2021789994209084, -0.12823478905092187, 0.1709093854573583, -0.111831061227367, 0.1108711872112679, 0.059200365473239654, -0.03682468273437185, -0.10185835535533146, -0.21712313898398752, 0.3265844487255476, -0.027844500833993206, 0.2926095885381398, 0.04435551509671466, 0.1199612250484729, -0.027090424228007767, -0.0440953569901683, 0.09298043952975883, -0.13693293207343052, 0.11804527200304323, 0.2812711828247653, 0.06391985637670623, 0.30392463496623395, -0.44797339438377776, -0.24621968820465193, 0.0821524890082644, 0.14578439485043113, 0.09353520604666543, -0.06913235320509088, -0.25924529728599555, 0.08610620649213359, -0.15301989384760878, -0.14269788854866114, -0.08982948885393781, -0.0765670542121118, 0.012194362012577235, -0.3316549514650856, 0.058642860179125, 0.020672973149714273, 0.05576568328784687, -0.06385283781438006, -0.139397496188124, 0.013533005618264364, 0.0542086709064828, -0.0050761152046160905, 0.007218393166365083, 0.061320565016202554, -0.05126105465391411, -0.0957149088527952, 0.36229140216733635, -0.035792233456112904, -0.31790713467035847, 0.2005290809738113, -0.05373290099208197, -0.0936502605068064, 0.1390963957419084, 0.1814316208474338, 0.20956316819912432, -0.11798124120911897, 0.14606052178671666, -0.006177149129233848, 0.1450352297979407, 0.09565200415638156, -0.059330165329216956, 0.10046975207883901, 0.16076743516420927, 0.13031427402252166, 0.13746180442878073, -0.07184538603322303, -0.11239069888839673, -0.3329640598091675, -0.12372314571034126, -0.19670773447735584, -0.062011746283952555, -0.15427630027203698, -0.24790928863440778, 0.347268656471924, 0.14535092527944696, 0.11833126881473356, 0.025693501763460445, 0.3014159590088864, 0.11195285936199718, 0.040960851185355744, 0.08285442857465956, 0.1683707020855232, 0.13072410801259599, 0.0910620158653485, -0.21902689034877676, 0.04461536509685661, 0.17846673935315213]
|
1,803.06636
|
Complexity problems in enumerative combinatorics
|
We give a broad survey of recent results in Enumerative Combinatorics and
their complexity aspects.
|
math.CO cs.CC cs.DM math.HO math.PR
|
we give a broad survey of recent results in enumerative combinatorics and their complexity aspects
|
[['we', 'give', 'a', 'broad', 'survey', 'of', 'recent', 'results', 'in', 'enumerative', 'combinatorics', 'and', 'their', 'complexity', 'aspects']]
|
[-0.0995240178424865, -0.042697610488782324, -0.12787067331373692, 0.08833795444418986, -0.16346704239646595, -0.04967477989072601, 0.10241762213408948, 0.3334923781454563, -0.30657849212487537, -0.3537929562230905, 0.11475578943112244, -0.2820539807279905, -0.25150745213031767, 0.25722501973311107, -0.2387443478529652, 0.004601583878199259, 0.06154155259331067, -0.08787408632536729, -0.10855528929581244, -0.37847925797104837, 0.2831058800841371, 0.05344161354005337, 0.21950419545173644, 0.14619168490171433, 0.0026516102254390715, 0.016610412547985714, -0.16214883029460908, 0.027418601078291735, -0.33189467061311007, 0.24519425767163436, 0.41313400976359843, 0.27936576878031094, 0.21707939555247624, -0.4187964489062627, -0.13569250948106248, 0.04377225562930107, 0.12674057486777504, 0.16331576829155287, -0.13332298528403044, -0.2622421259681384, 0.00016249946008125942, -0.09968576114624739, -0.10458927899599076, -0.08457363359630107, 0.08370078007380168, 0.145455007130901, -0.05622941168646018, 0.008193319849669933, 0.08487931831429402, 0.2076805506522457, 0.011540855839848518, -0.204035917421182, 0.14062808272428812, 0.12281100436424215, 0.03860259229938189, -0.018327582255005838, 0.036245672559986515, -0.2107257013519605, -0.24027140488227208, 0.31647009154160816, 0.07689619412024816, -0.09852949703733126, 0.22997236102819443, -0.18586416815718015, -0.2911350247760614, 0.12866378160348782, 0.22700207972278197, 0.1532300795118014, -0.004975314003725847, 0.18739176578431702, -0.1448463688294093, 0.09235224525133769, -0.0061287378892302515, 0.14491518773138523, 0.20759117143849531, 0.12676776883502802, -0.01713099703192711, 0.2236267058334003, -0.009094492470224699, -0.1357569009065628, -0.26097168897589046, -0.08574728555977344, -0.04890350600083669, 0.0827542446553707, -0.10296451073663775, -0.16992024332284927, 0.4765480617682139, 0.14689051409562429, 0.23105062930844725, 0.1392701281234622, 0.2521114202837149, 0.015973017861445744, -0.06474167954487105, -0.04204838362832864, 0.15439859504501025, 0.2393108253677686, 0.1577653682480256, -0.10757833818594614, -0.025945491925813257, 0.08950356127073368]
|
1,803.06637
|
The nodal set of solutions to some elliptic problems: singular
nonlinearities
|
This paper deals with solutions to the equation \begin{equation*} -\Delta u =
\lambda_+ \left(u^+\right)^{q-1} - \lambda_- \left(u^-\right)^{q-1} \quad
\text{in $B_1$} \end{equation*} where $\lambda_+,\lambda_- > 0$, $q \in (0,1)$,
$B_1=B_1(0)$ is the unit ball in $\mathbb{R}^N$, $N \ge 2$, and $u^+:=
\max\{u,0\}$, $u^-:= \max\{-u,0\}$ are the positive and the negative part of
$u$, respectively. We extend to this class of \emph{singular} equations the
results recently obtained in \cite{SoTe2018} for \emph{sublinear and
discontinuous} equations, $1\leq q<2$, namely: (a) the finiteness of the
vanishing order at every point and the complete characterization of the order
spectrum; (b) a weak non-degeneracy property; (c) regularity of the nodal set
of any solution: the nodal set is a locally finite collection of regular
codimension one manifolds up to a residual singular set having Hausdorff
dimension at most $N-2$ (locally finite when $N=2$). As an intermediate step,
we establish the regularity of a class of \emph{not necessarily minimal}
solutions.
The proofs are based on a priori bounds, monotonicity formul\ae \ for a
$2$-parameter family of Weiss-type functionals, blow-up arguments, and the
classification of homogenous solutions.
|
math.AP
|
this paper deals with solutions to the equation beginequation delta u lambda_ lefturightq1 lambda_ lefturightq1 quad textin b_1 endequation where lambda_lambda_ 0 q in 01 b_1b_10 is the unit ball in mathbbrn n ge 2 and u maxu0 u maxu0 are the positive and the negative part of u respectively we extend to this class of emphsingular equations the results recently obtained in citesote2018 for emphsublinear and discontinuous equations 1leq q2 namely a the finiteness of the vanishing order at every point and the complete characterization of the order spectrum b a weak nondegeneracy property c regularity of the nodal set of any solution the nodal set is a locally finite collection of regular codimension one manifolds up to a residual singular set having hausdorff dimension at most n2 locally finite when n2 as an intermediate step we establish the regularity of a class of emphnot necessarily minimal solutions the proofs are based on a priori bounds monotonicity formulae for a 2parameter family of weisstype functionals blowup arguments and the classification of homogenous solutions
|
[['this', 'paper', 'deals', 'with', 'solutions', 'to', 'the', 'equation', 'beginequation', 'delta', 'u', 'lambda_', 'lefturightq1', 'lambda_', 'lefturightq1', 'quad', 'textin', 'b_1', 'endequation', 'where', 'lambda_lambda_', '0', 'q', 'in', '01', 'b_1b_10', 'is', 'the', 'unit', 'ball', 'in', 'mathbbrn', 'n', 'ge', '2', 'and', 'u', 'maxu0', 'u', 'maxu0', 'are', 'the', 'positive', 'and', 'the', 'negative', 'part', 'of', 'u', 'respectively', 'we', 'extend', 'to', 'this', 'class', 'of', 'emphsingular', 'equations', 'the', 'results', 'recently', 'obtained', 'in', 'citesote2018', 'for', 'emphsublinear', 'and', 'discontinuous', 'equations', '1leq', 'q2', 'namely', 'a', 'the', 'finiteness', 'of', 'the', 'vanishing', 'order', 'at', 'every', 'point', 'and', 'the', 'complete', 'characterization', 'of', 'the', 'order', 'spectrum', 'b', 'a', 'weak', 'nondegeneracy', 'property', 'c', 'regularity', 'of', 'the', 'nodal', 'set', 'of', 'any', 'solution', 'the', 'nodal', 'set', 'is', 'a', 'locally', 'finite', 'collection', 'of', 'regular', 'codimension', 'one', 'manifolds', 'up', 'to', 'a', 'residual', 'singular', 'set', 'having', 'hausdorff', 'dimension', 'at', 'most', 'n2', 'locally', 'finite', 'when', 'n2', 'as', 'an', 'intermediate', 'step', 'we', 'establish', 'the', 'regularity', 'of', 'a', 'class', 'of', 'emphnot', 'necessarily', 'minimal', 'solutions', 'the', 'proofs', 'are', 'based', 'on', 'a', 'priori', 'bounds', 'monotonicity', 'formulae', 'for', 'a', '2parameter', 'family', 'of', 'weisstype', 'functionals', 'blowup', 'arguments', 'and', 'the', 'classification', 'of', 'homogenous', 'solutions']]
|
[-0.19609602047827604, 0.06479015991494952, -0.0005425588650152434, 0.025429482495975354, -0.057924269001421974, -0.17816953887610676, 0.007847130602512638, 0.27494729496403275, -0.2825759275820442, -0.16711561657964838, 0.12445480568279636, -0.37820525754373086, -0.05875181102973604, 0.15116565277106886, -0.061448003338693186, 0.07271298879370375, 0.01505511871276445, 0.07993980485751012, -0.09188558023996911, -0.23714648499383678, 0.38128140359727103, -0.13398136927334722, 0.18108288976526277, 0.06813308014534414, 0.1081523513394343, -0.046271878884845345, 0.04820148630722881, -0.0027910334052691278, -0.2589103784826706, 0.09478681358822816, 0.23739751465185438, 0.04807122606042296, 0.30804403893497967, -0.340898550421962, -0.15461069126789415, 0.19711694009818656, 0.1299973400309682, 0.013007434735955876, 0.0022649525778623957, -0.26201025562815716, 0.1679357141229259, -0.08631850653165561, -0.22196687979158014, -0.04983617158520014, 0.07641039240217312, 0.046497670723785925, -0.34589404966898785, 0.08303707144981207, 0.12715628239878474, 0.044287225342528935, -0.09141361427481211, -0.16181283935682503, -0.05290796966319038, 0.06130844326354807, 0.007160542854974263, 0.10068057106772632, -0.016213143302254963, -0.09018762241832393, -0.035721168058401864, 0.3450381014503533, -0.07228662957421092, -0.2606742532468986, 0.11700118640248208, -0.2021942006526948, -0.1500670133878715, 0.10770390843119754, 0.11675771829712091, 0.20363778788542244, -0.09240712511238472, 0.22346642297566707, -0.07104611084634048, 0.13239783694819401, 0.1250851702129165, 0.016594628409515026, 0.06526004580434325, 0.09675802714704078, 0.1538170641179868, 0.07250548526238607, -0.025863438219286848, -0.017559216424097242, -0.4191447444704123, -0.1375267736716629, -0.15085528086773445, 0.16720892178154614, -0.13557120127599012, -0.20239512944190632, 0.3265839080423723, 0.03470740612423004, 0.20022828466811238, 0.1144082801129539, 0.19045579065243864, 0.11962973473478193, -0.019647598564746616, 0.10074739243163792, 0.10255164505919269, 0.14066543079625685, 0.07270102034589251, -0.18370914445556483, 0.002184320958656107, 0.1875633099928585]
|
1,803.06638
|
Adaptive Decision Making via Entropy Minimization
|
An agent choosing between various actions tends to take the one with the
lowest cost. But this choice is arguably too rigid (not adaptive) to be useful
in complex situations, e.g., where exploration-exploitation trade-off is
relevant in creative task solving or when stated preferences differ from
revealed ones. Here we study an agent who is willing to sacrifice a fixed
amount of expected utility for adaptation. How can/ought our agent choose an
optimal (in a technical sense) mixed action? We explore consequences of making
this choice via entropy minimization, which is argued to be a specific example
of risk-aversion. This recovers the $\epsilon$-greedy probabilities known in
reinforcement learning. We show that the entropy minimization leads to
rudimentary forms of intelligent behavior: (i) the agent assigns a
non-negligible probability to costly events; but (ii) chooses with a sizable
probability the action related to less cost (lesser of two evils) when
confronted with two actions with comparable costs; (iii) the agent is subject
to effects similar to cognitive dissonance and frustration. Neither of these
features are shown by entropy maximization.
|
physics.data-an cond-mat.stat-mech cs.GT
|
an agent choosing between various actions tends to take the one with the lowest cost but this choice is arguably too rigid not adaptive to be useful in complex situations eg where explorationexploitation tradeoff is relevant in creative task solving or when stated preferences differ from revealed ones here we study an agent who is willing to sacrifice a fixed amount of expected utility for adaptation how canought our agent choose an optimal in a technical sense mixed action we explore consequences of making this choice via entropy minimization which is argued to be a specific example of riskaversion this recovers the epsilongreedy probabilities known in reinforcement learning we show that the entropy minimization leads to rudimentary forms of intelligent behavior i the agent assigns a nonnegligible probability to costly events but ii chooses with a sizable probability the action related to less cost lesser of two evils when confronted with two actions with comparable costs iii the agent is subject to effects similar to cognitive dissonance and frustration neither of these features are shown by entropy maximization
|
[['an', 'agent', 'choosing', 'between', 'various', 'actions', 'tends', 'to', 'take', 'the', 'one', 'with', 'the', 'lowest', 'cost', 'but', 'this', 'choice', 'is', 'arguably', 'too', 'rigid', 'not', 'adaptive', 'to', 'be', 'useful', 'in', 'complex', 'situations', 'eg', 'where', 'explorationexploitation', 'tradeoff', 'is', 'relevant', 'in', 'creative', 'task', 'solving', 'or', 'when', 'stated', 'preferences', 'differ', 'from', 'revealed', 'ones', 'here', 'we', 'study', 'an', 'agent', 'who', 'is', 'willing', 'to', 'sacrifice', 'a', 'fixed', 'amount', 'of', 'expected', 'utility', 'for', 'adaptation', 'how', 'canought', 'our', 'agent', 'choose', 'an', 'optimal', 'in', 'a', 'technical', 'sense', 'mixed', 'action', 'we', 'explore', 'consequences', 'of', 'making', 'this', 'choice', 'via', 'entropy', 'minimization', 'which', 'is', 'argued', 'to', 'be', 'a', 'specific', 'example', 'of', 'riskaversion', 'this', 'recovers', 'the', 'epsilongreedy', 'probabilities', 'known', 'in', 'reinforcement', 'learning', 'we', 'show', 'that', 'the', 'entropy', 'minimization', 'leads', 'to', 'rudimentary', 'forms', 'of', 'intelligent', 'behavior', 'i', 'the', 'agent', 'assigns', 'a', 'nonnegligible', 'probability', 'to', 'costly', 'events', 'but', 'ii', 'chooses', 'with', 'a', 'sizable', 'probability', 'the', 'action', 'related', 'to', 'less', 'cost', 'lesser', 'of', 'two', 'evils', 'when', 'confronted', 'with', 'two', 'actions', 'with', 'comparable', 'costs', 'iii', 'the', 'agent', 'is', 'subject', 'to', 'effects', 'similar', 'to', 'cognitive', 'dissonance', 'and', 'frustration', 'neither', 'of', 'these', 'features', 'are', 'shown', 'by', 'entropy', 'maximization']]
|
[-0.07562424091156572, 0.09177864407605851, -0.08262860472116745, 0.105089745575057, -0.14485993380342627, -0.2326535502064573, 0.08780492507881553, 0.39923498724287343, -0.2866413516602821, -0.30913493351874044, 0.06593367228373927, -0.2754660568181636, -0.17931953312613408, 0.12738805291858518, -0.17989360163577617, -0.005847958916282587, 0.050977543650173957, 0.10078369976267335, -0.0045679874756336634, -0.2881927606018292, 0.3099036759829759, 0.08439063373690019, 0.2674026977360291, 0.018147139039185255, 0.10844394158161545, 0.0060570304029447545, 0.010815656833392752, 0.03693624484842106, -0.0974288424650042, 0.11608143691775931, 0.3271144628209078, 0.16314668648502667, 0.38076832426953955, -0.41099204109339726, -0.17519582901939246, 0.15758271659606027, 0.10509981808019474, 0.08624764104008065, -0.008278821797588955, -0.24888163767649799, 0.04273636160401291, -0.19197588245052907, -0.07265098192360736, -0.07687050501137214, 0.003160265597283293, -0.019993603293978646, -0.32126403066177067, 0.0024141622917716113, 0.027286943768764095, 0.03774863431535366, -0.0713258949358353, -0.11154108586337018, -0.0029789725532965725, 0.14992728110798767, 0.11729676581032596, 0.02808861161705822, 0.14988058341382923, -0.16758242742905635, -0.13207462448350518, 0.40500075822580334, 0.004621754945019039, -0.2518599091708071, 0.21570031329368552, -0.08825681635341738, -0.13798840090337783, 0.10730508816070686, 0.1445366568971257, 0.1250262632071551, -0.1417029169790965, 0.015619701168849792, 0.005799876502978136, 0.1834124126129568, 0.03797897184991125, 0.03516357449754168, 0.16103436035961755, 0.15501765384586097, 0.12135900341442624, 0.13611538387771885, 0.016017328658388497, -0.15611824349600212, -0.2549950951936597, -0.13573687368646095, -0.18730732623032573, 0.0855551704045485, -0.07580277020640153, -0.10593530503585066, 0.31460938740542715, 0.1810403721878801, 0.20501469877597187, 0.07434177134642483, 0.2819143945067111, 0.1211986030822904, 0.0510488890734959, 0.08968165159287289, 0.19920286640135498, 0.0028846168161848675, 0.05254318072634228, -0.23322478752704284, 0.16848446006786688, 0.02303623358750621]
|
1,803.06639
|
Stability of Energy Stable Flux Reconstruction for the Diffusion Problem
using the Interior Penalty and Bassi and Rebay II Numerical Fluxes
|
Recovering some prominent high-order approaches such as the discontinuous
Galerkin (DG) or the spectral difference (SD) methods, the flux reconstruction
(FR) approach has been adopted by many individuals in the research community
and is now commonly used to solve problems on unstructured grids over complex
geometries. This approach relies on the use of correction functions to obtain a
differential form for the discrete problem. A class of correction functions,
named energy stable flux reconstruction (ESFR) functions, has been proven
stable for the linear advection problem. This proof has then been extended for
the diffusion equation using the local discontinuous Galerkin (LDG) scheme to
compute the numerical fluxes. Although the LDG scheme is commonly used, many
prefer the interior penalty (IP), as well as the Bassi and Rebay II (BR2)
schemes. Similarly to the LDG proof, this article provides a stability analysis
for the IP and the BR2 numerical fluxes. In fact, we obtain a theoretical
condition on the penalty term to ensure stability. This result is then verified
through numerical simulations. To complete this study, a von Neumann analysis
is conducted to provide a combination of parameters producing the maximal time
step while converging at the correct order. All things considered, this article
has for purpose to provide the community with a stability condition while using
the IP and the BR2 schemes.
|
math.NA
|
recovering some prominent highorder approaches such as the discontinuous galerkin dg or the spectral difference sd methods the flux reconstruction fr approach has been adopted by many individuals in the research community and is now commonly used to solve problems on unstructured grids over complex geometries this approach relies on the use of correction functions to obtain a differential form for the discrete problem a class of correction functions named energy stable flux reconstruction esfr functions has been proven stable for the linear advection problem this proof has then been extended for the diffusion equation using the local discontinuous galerkin ldg scheme to compute the numerical fluxes although the ldg scheme is commonly used many prefer the interior penalty ip as well as the bassi and rebay ii br2 schemes similarly to the ldg proof this article provides a stability analysis for the ip and the br2 numerical fluxes in fact we obtain a theoretical condition on the penalty term to ensure stability this result is then verified through numerical simulations to complete this study a von neumann analysis is conducted to provide a combination of parameters producing the maximal time step while converging at the correct order all things considered this article has for purpose to provide the community with a stability condition while using the ip and the br2 schemes
|
[['recovering', 'some', 'prominent', 'highorder', 'approaches', 'such', 'as', 'the', 'discontinuous', 'galerkin', 'dg', 'or', 'the', 'spectral', 'difference', 'sd', 'methods', 'the', 'flux', 'reconstruction', 'fr', 'approach', 'has', 'been', 'adopted', 'by', 'many', 'individuals', 'in', 'the', 'research', 'community', 'and', 'is', 'now', 'commonly', 'used', 'to', 'solve', 'problems', 'on', 'unstructured', 'grids', 'over', 'complex', 'geometries', 'this', 'approach', 'relies', 'on', 'the', 'use', 'of', 'correction', 'functions', 'to', 'obtain', 'a', 'differential', 'form', 'for', 'the', 'discrete', 'problem', 'a', 'class', 'of', 'correction', 'functions', 'named', 'energy', 'stable', 'flux', 'reconstruction', 'esfr', 'functions', 'has', 'been', 'proven', 'stable', 'for', 'the', 'linear', 'advection', 'problem', 'this', 'proof', 'has', 'then', 'been', 'extended', 'for', 'the', 'diffusion', 'equation', 'using', 'the', 'local', 'discontinuous', 'galerkin', 'ldg', 'scheme', 'to', 'compute', 'the', 'numerical', 'fluxes', 'although', 'the', 'ldg', 'scheme', 'is', 'commonly', 'used', 'many', 'prefer', 'the', 'interior', 'penalty', 'ip', 'as', 'well', 'as', 'the', 'bassi', 'and', 'rebay', 'ii', 'br2', 'schemes', 'similarly', 'to', 'the', 'ldg', 'proof', 'this', 'article', 'provides', 'a', 'stability', 'analysis', 'for', 'the', 'ip', 'and', 'the', 'br2', 'numerical', 'fluxes', 'in', 'fact', 'we', 'obtain', 'a', 'theoretical', 'condition', 'on', 'the', 'penalty', 'term', 'to', 'ensure', 'stability', 'this', 'result', 'is', 'then', 'verified', 'through', 'numerical', 'simulations', 'to', 'complete', 'this', 'study', 'a', 'von', 'neumann', 'analysis', 'is', 'conducted', 'to', 'provide', 'a', 'combination', 'of', 'parameters', 'producing', 'the', 'maximal', 'time', 'step', 'while', 'converging', 'at', 'the', 'correct', 'order', 'all', 'things', 'considered', 'this', 'article', 'has', 'for', 'purpose', 'to', 'provide', 'the', 'community', 'with', 'a', 'stability', 'condition', 'while', 'using', 'the', 'ip', 'and', 'the', 'br2', 'schemes']]
|
[-0.07563708894094243, -0.02303217043512845, -0.10369764926197293, 0.07823753565642144, -0.06855107883100507, -0.13833848505096324, 0.014130994576860118, 0.3531972264927636, -0.27028362912326204, -0.27720478766908246, 0.16120942393401722, -0.23236256083557466, -0.10731879349269376, 0.18598075034747086, -0.06918115716696054, 0.09790149974628343, 0.051967081582506174, 0.0012378683148543477, -0.09187604951240155, -0.21818552280331519, 0.31007678102993463, 0.056643013420791644, 0.2888884536968125, 0.07036499945349312, 0.11216810828825745, -0.05000200530677732, -0.05988670849694392, 0.039011910599173964, -0.13871813866074895, 0.10393529471853194, 0.27432214421941686, 0.08075378865091684, 0.313449431487636, -0.41176965613723604, -0.25443015044538286, 0.11786259391905136, 0.1390243046707264, 0.10707125147628421, -0.06799133787160269, -0.23785911737060225, 0.1202700839415696, -0.17390374980525006, -0.13577753380738064, -0.09569810036787982, -0.004063594893359386, 0.04598356938820232, -0.30550708934278775, 0.05380769256452048, 0.03092007567478881, 0.04786275494592013, -0.05909141826627961, -0.11015849709741536, 0.01334037275687028, 0.08918623674633652, 0.04548571822611061, 0.019263717711919936, 0.04732608152259779, -0.05126762663660286, -0.08430238848296204, 0.39855895578852846, -0.03967938591728222, -0.2539527342363202, 0.18690682612023912, -0.05219469078803888, -0.12569196210641348, 0.13819209041560557, 0.14516999261025842, 0.17473700981343854, -0.12803423882520817, 0.10037715770492985, -0.022768998375951168, 0.14489177648798218, 0.0435929527025888, -0.017319928552128945, 0.09678223394360896, 0.1596956237917766, 0.12750302488141618, 0.09130296252378439, -0.08775798938193081, -0.10233120976995493, -0.2930777917830022, -0.15206736307916324, -0.16801779701212957, -0.007552582209485138, -0.058846508137837705, -0.20419630222861562, 0.40084238032566416, 0.11707487691868713, 0.12018784156975311, 0.057379449751261656, 0.33298155460674483, 0.15555486351362774, 0.05318260102990075, 0.08566013876315173, 0.2295927457488614, 0.15355768582997592, 0.1404839710889359, -0.21401854343439644, 0.06512103648541646, 0.17099103188091838]
|
1,803.0664
|
Invariant ultraviolet scale corrections to the thermodynamics of
degenerate Fermi gas and its implications
|
We study the invariant Planck scale correction to the thermodynamics of the
ideal Fermi gas. We have considered the modified dispersion relation and the
cut-off to the maximum possible momentum/energy (Planck energy) of the
non-interacting ideal degenerate Fermi gas particles. With such a modification
the expression for the degenerate pressure and the total energy gets modified
accordingly. We discuss the number density and mass dependence of the
degenerate pressure. We found that the degenerate pressure is perturbative in
the SR limit. We then take the example of white dwarfs to explore the possible
implications. Using this modified degenerate pressure, we calculate the
possible modification to the Chandrashekhar limit for white dwarfs using the
Magueijo-Smolin (MS) modified dispersion relation. The mass-radius M-R plot
shows that the modified/corrected radius of the white dwarf can be greater
than, equal to and smaller than the usual special relativity (SR) value for
particular masses. We found that the Chandrasekhar mass limit gets a positive
correction. We note that the presence of observed white dwarfs having radius
smaller than the SR Chandrasekhar limit may find an explanation if they are
modeled using a modified dispersion relation. As the correction is perturbative
in the SR limit, therefore this correction is solely because of the modified
dispersion relation. The value of the obtained degenerate pressure for a given
mass is found to be greater than, equal to and smaller than the usual special
relativity (SR) value for particular masses as expected. We have also
calculated the luminosity of the white dwarf by taking the model of partially
degenerate gas and considering the modified radiative envelope equation. The
luminosity also gets a negative correction. The correction to luminosity is
nonperturbative as expected for such a theory.
|
gr-qc
|
we study the invariant planck scale correction to the thermodynamics of the ideal fermi gas we have considered the modified dispersion relation and the cutoff to the maximum possible momentumenergy planck energy of the noninteracting ideal degenerate fermi gas particles with such a modification the expression for the degenerate pressure and the total energy gets modified accordingly we discuss the number density and mass dependence of the degenerate pressure we found that the degenerate pressure is perturbative in the sr limit we then take the example of white dwarfs to explore the possible implications using this modified degenerate pressure we calculate the possible modification to the chandrashekhar limit for white dwarfs using the magueijosmolin ms modified dispersion relation the massradius mr plot shows that the modifiedcorrected radius of the white dwarf can be greater than equal to and smaller than the usual special relativity sr value for particular masses we found that the chandrasekhar mass limit gets a positive correction we note that the presence of observed white dwarfs having radius smaller than the sr chandrasekhar limit may find an explanation if they are modeled using a modified dispersion relation as the correction is perturbative in the sr limit therefore this correction is solely because of the modified dispersion relation the value of the obtained degenerate pressure for a given mass is found to be greater than equal to and smaller than the usual special relativity sr value for particular masses as expected we have also calculated the luminosity of the white dwarf by taking the model of partially degenerate gas and considering the modified radiative envelope equation the luminosity also gets a negative correction the correction to luminosity is nonperturbative as expected for such a theory
|
[['we', 'study', 'the', 'invariant', 'planck', 'scale', 'correction', 'to', 'the', 'thermodynamics', 'of', 'the', 'ideal', 'fermi', 'gas', 'we', 'have', 'considered', 'the', 'modified', 'dispersion', 'relation', 'and', 'the', 'cutoff', 'to', 'the', 'maximum', 'possible', 'momentumenergy', 'planck', 'energy', 'of', 'the', 'noninteracting', 'ideal', 'degenerate', 'fermi', 'gas', 'particles', 'with', 'such', 'a', 'modification', 'the', 'expression', 'for', 'the', 'degenerate', 'pressure', 'and', 'the', 'total', 'energy', 'gets', 'modified', 'accordingly', 'we', 'discuss', 'the', 'number', 'density', 'and', 'mass', 'dependence', 'of', 'the', 'degenerate', 'pressure', 'we', 'found', 'that', 'the', 'degenerate', 'pressure', 'is', 'perturbative', 'in', 'the', 'sr', 'limit', 'we', 'then', 'take', 'the', 'example', 'of', 'white', 'dwarfs', 'to', 'explore', 'the', 'possible', 'implications', 'using', 'this', 'modified', 'degenerate', 'pressure', 'we', 'calculate', 'the', 'possible', 'modification', 'to', 'the', 'chandrashekhar', 'limit', 'for', 'white', 'dwarfs', 'using', 'the', 'magueijosmolin', 'ms', 'modified', 'dispersion', 'relation', 'the', 'massradius', 'mr', 'plot', 'shows', 'that', 'the', 'modifiedcorrected', 'radius', 'of', 'the', 'white', 'dwarf', 'can', 'be', 'greater', 'than', 'equal', 'to', 'and', 'smaller', 'than', 'the', 'usual', 'special', 'relativity', 'sr', 'value', 'for', 'particular', 'masses', 'we', 'found', 'that', 'the', 'chandrasekhar', 'mass', 'limit', 'gets', 'a', 'positive', 'correction', 'we', 'note', 'that', 'the', 'presence', 'of', 'observed', 'white', 'dwarfs', 'having', 'radius', 'smaller', 'than', 'the', 'sr', 'chandrasekhar', 'limit', 'may', 'find', 'an', 'explanation', 'if', 'they', 'are', 'modeled', 'using', 'a', 'modified', 'dispersion', 'relation', 'as', 'the', 'correction', 'is', 'perturbative', 'in', 'the', 'sr', 'limit', 'therefore', 'this', 'correction', 'is', 'solely', 'because', 'of', 'the', 'modified', 'dispersion', 'relation', 'the', 'value', 'of', 'the', 'obtained', 'degenerate', 'pressure', 'for', 'a', 'given', 'mass', 'is', 'found', 'to', 'be', 'greater', 'than', 'equal', 'to', 'and', 'smaller', 'than', 'the', 'usual', 'special', 'relativity', 'sr', 'value', 'for', 'particular', 'masses', 'as', 'expected', 'we', 'have', 'also', 'calculated', 'the', 'luminosity', 'of', 'the', 'white', 'dwarf', 'by', 'taking', 'the', 'model', 'of', 'partially', 'degenerate', 'gas', 'and', 'considering', 'the', 'modified', 'radiative', 'envelope', 'equation', 'the', 'luminosity', 'also', 'gets', 'a', 'negative', 'correction', 'the', 'correction', 'to', 'luminosity', 'is', 'nonperturbative', 'as', 'expected', 'for', 'such', 'a', 'theory']]
|
[-0.08330548951020497, 0.15277017915335042, -0.08007736088564762, 0.1538492644387232, -0.07229844437768826, -0.11822808381915743, 0.058692208606459954, 0.28839217281047175, -0.21191115305478964, -0.31783773431267875, 0.041718845111578445, -0.3139156798182472, -0.062175525740681255, 0.1842644209607172, -0.040020754026783095, 0.009930174668332549, 0.018264976846236552, 0.04930012684272296, -0.1472067654674622, -0.2301188730651031, 0.3560733859511939, 0.10876228948859694, 0.21510009491373297, 0.02172136722275844, 0.06387071891433814, -0.050296787006887965, 0.004374740025764527, 0.04373333601189868, -0.17107419452041395, 0.01816296216891753, 0.1629005282102934, 0.030367176502721607, 0.21412142305113896, -0.34124334200311424, -0.2152988362778141, 0.10389773142312399, 0.13769706131498025, 0.09785847161681606, -0.04793567124304811, -0.2261741610790987, 0.06593216137881026, -0.21877724425036824, -0.1866084549725023, -0.005799718380260926, 0.04258160028684806, -0.02330306496298579, -0.2474559645699272, 0.14204047987432142, 0.07146481636071486, -0.01820228308426229, -0.09185427577899105, -0.15494602470792232, -0.05567104439983809, 0.057910337212570405, 0.057234100299363086, 0.018356672073372517, 0.13430348963808866, -0.12194134642441685, 0.0229312164848996, 0.4316193907600225, -0.13708480501957962, -0.14443910836243767, 0.1482912062445877, -0.17894183918410403, -0.08352755381517321, 0.09828363128667501, 0.1270161894654002, 0.09128675701493931, -0.1407509891355371, 0.05679752790878716, -0.015786317798676997, 0.1672738271153213, 0.0967841760077924, 0.03219041256177063, 0.2565421815147506, 0.13115798253110134, 0.03027359078641512, 0.09499612369190355, -0.1495972633674428, -0.08806007620744193, -0.28867123044141524, -0.15157716777631558, -0.1637118988812061, 0.09286184047700485, -0.10525644061383971, -0.14478959827651303, 0.31354181931380154, 0.14363809415404652, 0.19725369290494316, 0.05636285910939707, 0.28975717076653995, 0.2320074011995848, 0.09272686594045376, 0.09222878060927224, 0.31773320416157896, 0.1680870986799221, 0.06017646886786068, -0.2664160251925159, 0.0033588682519519455, 0.05101865950818792]
|
1,803.06641
|
Zoom and Learn: Generalizing Deep Stereo Matching to Novel Domains
|
Despite the recent success of stereo matching with convolutional neural
networks (CNNs), it remains arduous to generalize a pre-trained deep stereo
model to a novel domain. A major difficulty is to collect accurate ground-truth
disparities for stereo pairs in the target domain. In this work, we propose a
self-adaptation approach for CNN training, utilizing both synthetic training
data (with ground-truth disparities) and stereo pairs in the new domain
(without ground-truths). Our method is driven by two empirical observations. By
feeding real stereo pairs of different domains to stereo models pre-trained
with synthetic data, we see that: i) a pre-trained model does not generalize
well to the new domain, producing artifacts at boundaries and ill-posed
regions; however, ii) feeding an up-sampled stereo pair leads to a disparity
map with extra details. To avoid i) while exploiting ii), we formulate an
iterative optimization problem with graph Laplacian regularization. At each
iteration, the CNN adapts itself better to the new domain: we let the CNN learn
its own higher-resolution output; at the meanwhile, a graph Laplacian
regularization is imposed to discriminatively keep the desired edges while
smoothing out the artifacts. We demonstrate the effectiveness of our method in
two domains: daily scenes collected by smartphone cameras, and street views
captured in a driving car.
|
cs.CV
|
despite the recent success of stereo matching with convolutional neural networks cnns it remains arduous to generalize a pretrained deep stereo model to a novel domain a major difficulty is to collect accurate groundtruth disparities for stereo pairs in the target domain in this work we propose a selfadaptation approach for cnn training utilizing both synthetic training data with groundtruth disparities and stereo pairs in the new domain without groundtruths our method is driven by two empirical observations by feeding real stereo pairs of different domains to stereo models pretrained with synthetic data we see that i a pretrained model does not generalize well to the new domain producing artifacts at boundaries and illposed regions however ii feeding an upsampled stereo pair leads to a disparity map with extra details to avoid i while exploiting ii we formulate an iterative optimization problem with graph laplacian regularization at each iteration the cnn adapts itself better to the new domain we let the cnn learn its own higherresolution output at the meanwhile a graph laplacian regularization is imposed to discriminatively keep the desired edges while smoothing out the artifacts we demonstrate the effectiveness of our method in two domains daily scenes collected by smartphone cameras and street views captured in a driving car
|
[['despite', 'the', 'recent', 'success', 'of', 'stereo', 'matching', 'with', 'convolutional', 'neural', 'networks', 'cnns', 'it', 'remains', 'arduous', 'to', 'generalize', 'a', 'pretrained', 'deep', 'stereo', 'model', 'to', 'a', 'novel', 'domain', 'a', 'major', 'difficulty', 'is', 'to', 'collect', 'accurate', 'groundtruth', 'disparities', 'for', 'stereo', 'pairs', 'in', 'the', 'target', 'domain', 'in', 'this', 'work', 'we', 'propose', 'a', 'selfadaptation', 'approach', 'for', 'cnn', 'training', 'utilizing', 'both', 'synthetic', 'training', 'data', 'with', 'groundtruth', 'disparities', 'and', 'stereo', 'pairs', 'in', 'the', 'new', 'domain', 'without', 'groundtruths', 'our', 'method', 'is', 'driven', 'by', 'two', 'empirical', 'observations', 'by', 'feeding', 'real', 'stereo', 'pairs', 'of', 'different', 'domains', 'to', 'stereo', 'models', 'pretrained', 'with', 'synthetic', 'data', 'we', 'see', 'that', 'i', 'a', 'pretrained', 'model', 'does', 'not', 'generalize', 'well', 'to', 'the', 'new', 'domain', 'producing', 'artifacts', 'at', 'boundaries', 'and', 'illposed', 'regions', 'however', 'ii', 'feeding', 'an', 'upsampled', 'stereo', 'pair', 'leads', 'to', 'a', 'disparity', 'map', 'with', 'extra', 'details', 'to', 'avoid', 'i', 'while', 'exploiting', 'ii', 'we', 'formulate', 'an', 'iterative', 'optimization', 'problem', 'with', 'graph', 'laplacian', 'regularization', 'at', 'each', 'iteration', 'the', 'cnn', 'adapts', 'itself', 'better', 'to', 'the', 'new', 'domain', 'we', 'let', 'the', 'cnn', 'learn', 'its', 'own', 'higherresolution', 'output', 'at', 'the', 'meanwhile', 'a', 'graph', 'laplacian', 'regularization', 'is', 'imposed', 'to', 'discriminatively', 'keep', 'the', 'desired', 'edges', 'while', 'smoothing', 'out', 'the', 'artifacts', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'method', 'in', 'two', 'domains', 'daily', 'scenes', 'collected', 'by', 'smartphone', 'cameras', 'and', 'street', 'views', 'captured', 'in', 'a', 'driving', 'car']]
|
[-0.03746458888936664, 0.0044123174356996255, -0.0514449871198155, 0.057611558196836665, -0.16848474873287242, -0.18664682860639592, 0.017832011438909504, 0.47938181495214527, -0.3139287747897349, -0.3541048112903585, 0.06838456785109918, -0.2904942113138135, -0.17052743929080771, 0.14571521620341174, -0.20103954890592826, 0.08582261877804244, 0.19131583671451885, -0.002780976758219337, -0.06842414460308249, -0.26041605272600693, 0.31733251112442623, 0.021153835314783924, 0.3201343586140917, 0.0012108693219350555, 0.15194509061764025, -0.03668077340300175, -0.037612050826886394, -0.02435215985097909, -0.03484424616843136, 0.16938701991634045, 0.2694059789643141, 0.19172569419979008, 0.31009339636536004, -0.4514567616408894, -0.23023265786910369, 0.09100310852689342, 0.15743252895819354, 0.07792957240199203, -0.03655938879019576, -0.37884710940104244, 0.08707018062282755, -0.10436060434368426, -0.009274187424966086, -0.08885850906879664, -0.024394512529621756, -0.03490053902791156, -0.3432343704294925, 0.01512954538352611, 0.037328592518132656, 0.08160120545405347, -0.05573030436903644, -0.06677391697648224, -0.01040494134451011, 0.17303828950485842, 0.021502739340877954, 0.0840332406502376, 0.1042402357600135, -0.2059542608890965, -0.10675211769878484, 0.32433408573799505, -0.034594040483201, -0.2036851223931158, 0.21223287416238037, -0.07430140092147965, -0.10860766663648612, 0.0930625727241285, 0.20281281586920166, 0.08725019102426183, -0.14962971982020903, 0.0036296757946113097, -0.046979145739465884, 0.1718633064963762, 0.06783515014751898, -0.055446527057197124, 0.17451549309605988, 0.2395389573295464, 0.06667488891277153, 0.1449353871381537, -0.18170557067256699, -0.024554992418502286, -0.2308642587390556, -0.06319995023087009, -0.23316301587280505, -0.06018839047065003, -0.11472072710192893, -0.1344806736101914, 0.4074695132655131, 0.24841298330663505, 0.2745477683374314, 0.0945181641992517, 0.3772086509331284, 0.012141221576983824, 0.13061376389831092, 0.11123463968079872, 0.17252602701097997, -0.005484977905898933, 0.17307352666385578, -0.1569383553484724, 0.03322849443272833, 0.1027068344730513]
|
1,803.06642
|
Enhancement of photon blockade effect via quantum interference
|
We study the photon blockade effect in a coupled cavity system, which is
formed by a linear cavity coupled to a Kerr-type nonlinear cavity via a
photon-hopping interaction. We explain the physical phenomenon from the
viewpoint of the conventional and unconventional photon blockade effects. The
corresponding physical mechanisms of the two kinds of photon blockade effects
are based on the anharmonicity in the eigenenergy spectrum and the destructive
quantum interference between two different transition paths, respectively. In
particular, we find that the photon blockade via destructive quantum
interference also exists in the conventional photon blockade regime, and that
the unconventional photon blockade occurs in both the weak- and strong-Kerr
nonlinearity cases. The photon blockade effect can be observed by calculating
the second-order correlation function of the cavity field. This model is
general and hence it can be implemented in various experimental setups such as
coupled optical-cavity systems, coupled photon-magnon systems, and coupled
superconducting-resonator systems. We present some discussions on the
experimental feasibility.
|
quant-ph
|
we study the photon blockade effect in a coupled cavity system which is formed by a linear cavity coupled to a kerrtype nonlinear cavity via a photonhopping interaction we explain the physical phenomenon from the viewpoint of the conventional and unconventional photon blockade effects the corresponding physical mechanisms of the two kinds of photon blockade effects are based on the anharmonicity in the eigenenergy spectrum and the destructive quantum interference between two different transition paths respectively in particular we find that the photon blockade via destructive quantum interference also exists in the conventional photon blockade regime and that the unconventional photon blockade occurs in both the weak and strongkerr nonlinearity cases the photon blockade effect can be observed by calculating the secondorder correlation function of the cavity field this model is general and hence it can be implemented in various experimental setups such as coupled opticalcavity systems coupled photonmagnon systems and coupled superconductingresonator systems we present some discussions on the experimental feasibility
|
[['we', 'study', 'the', 'photon', 'blockade', 'effect', 'in', 'a', 'coupled', 'cavity', 'system', 'which', 'is', 'formed', 'by', 'a', 'linear', 'cavity', 'coupled', 'to', 'a', 'kerrtype', 'nonlinear', 'cavity', 'via', 'a', 'photonhopping', 'interaction', 'we', 'explain', 'the', 'physical', 'phenomenon', 'from', 'the', 'viewpoint', 'of', 'the', 'conventional', 'and', 'unconventional', 'photon', 'blockade', 'effects', 'the', 'corresponding', 'physical', 'mechanisms', 'of', 'the', 'two', 'kinds', 'of', 'photon', 'blockade', 'effects', 'are', 'based', 'on', 'the', 'anharmonicity', 'in', 'the', 'eigenenergy', 'spectrum', 'and', 'the', 'destructive', 'quantum', 'interference', 'between', 'two', 'different', 'transition', 'paths', 'respectively', 'in', 'particular', 'we', 'find', 'that', 'the', 'photon', 'blockade', 'via', 'destructive', 'quantum', 'interference', 'also', 'exists', 'in', 'the', 'conventional', 'photon', 'blockade', 'regime', 'and', 'that', 'the', 'unconventional', 'photon', 'blockade', 'occurs', 'in', 'both', 'the', 'weak', 'and', 'strongkerr', 'nonlinearity', 'cases', 'the', 'photon', 'blockade', 'effect', 'can', 'be', 'observed', 'by', 'calculating', 'the', 'secondorder', 'correlation', 'function', 'of', 'the', 'cavity', 'field', 'this', 'model', 'is', 'general', 'and', 'hence', 'it', 'can', 'be', 'implemented', 'in', 'various', 'experimental', 'setups', 'such', 'as', 'coupled', 'opticalcavity', 'systems', 'coupled', 'photonmagnon', 'systems', 'and', 'coupled', 'superconductingresonator', 'systems', 'we', 'present', 'some', 'discussions', 'on', 'the', 'experimental', 'feasibility']]
|
[-0.19295223006629386, 0.18930230562909856, -0.06252403990365565, 0.07858621691630105, -0.01480268121813424, -0.1976796825765632, 0.04554740872408729, 0.3543757115548942, -0.2378886970313033, -0.28134607056272215, -0.012077503917680588, -0.3071361297741532, -0.17017891951836644, 0.21232052106497576, 0.0104163601557957, 0.038723437328008, 0.027688724098698003, -0.03503062173986109, -0.011034965046019352, -0.1550231586501468, 0.330297228131576, 0.01282486478539795, 0.3164277716714423, 0.11814000525337179, 0.10457903773349245, 0.020718995267816353, 0.09741986592998728, 0.0199194866371613, -0.0712546565530829, 0.03512791439134162, 0.2100204365739046, -0.0057123159582261, 0.23161567461211235, -0.4431842818390578, -0.19759799353778362, 0.07917547982215183, 0.1609574181769858, 0.17489914287943975, -0.06843289066600847, -0.29802296195412054, -0.042435115395346654, -0.18028379362076521, -0.055887848749989644, -0.02477131194609683, -0.048094909861538325, 0.018549506219278554, -0.27338812496745957, 0.10232152864755335, 0.0414976839965675, 0.01782417381182313, 0.019331036586663686, -0.009440570359220146, 0.012072816085856175, 0.06241407113848254, -0.039422518992068944, -0.04759041552460985, 0.16909237277577632, -0.12977483208669582, -0.1605802762958774, 0.36864632070064546, -0.07396103418286656, -0.1652391318642003, 0.189116933105106, -0.15744891401845962, -0.043967963544128, 0.1292581265239278, 0.14674330624984577, 0.0896874007084989, -0.15215220017853426, 0.05815939206295297, -0.008324270209413953, 0.16686345559355686, 0.051529695230419746, 0.15835177895678498, 0.22578054569894448, 0.1453766341335722, -0.014076594272773945, 0.18070530100812904, -0.0913009433861589, -0.1296119079401251, -0.3159960567951202, -0.09881958628102439, -0.17381291700876317, 0.0514587851066608, -0.05655768815140618, -0.1179653238854371, 0.39077824165578934, 0.1746323855855735, 0.16011559364269487, -0.06973130445621792, 0.32599378121303746, 0.20067235829119454, 0.06924876253469847, -0.02928857908700593, 0.3497875018258128, 0.1653272253650357, 0.061870580463437366, -0.36472055289777927, -0.0030334933631820603, -0.023147090995917097]
|
1,803.06643
|
The Web as a Knowledge-base for Answering Complex Questions
|
Answering complex questions is a time-consuming activity for humans that
requires reasoning and integration of information. Recent work on reading
comprehension made headway in answering simple questions, but tackling complex
questions is still an ongoing research challenge. Conversely, semantic parsers
have been successful at handling compositionality, but only when the
information resides in a target knowledge-base. In this paper, we present a
novel framework for answering broad and complex questions, assuming answering
simple questions is possible using a search engine and a reading comprehension
model. We propose to decompose complex questions into a sequence of simple
questions, and compute the final answer from the sequence of answers. To
illustrate the viability of our approach, we create a new dataset of complex
questions, ComplexWebQuestions, and present a model that decomposes questions
and interacts with the web to compute an answer. We empirically demonstrate
that question decomposition improves performance from 20.8 precision@1 to 27.5
precision@1 on this new dataset.
|
cs.CL cs.AI cs.LG
|
answering complex questions is a timeconsuming activity for humans that requires reasoning and integration of information recent work on reading comprehension made headway in answering simple questions but tackling complex questions is still an ongoing research challenge conversely semantic parsers have been successful at handling compositionality but only when the information resides in a target knowledgebase in this paper we present a novel framework for answering broad and complex questions assuming answering simple questions is possible using a search engine and a reading comprehension model we propose to decompose complex questions into a sequence of simple questions and compute the final answer from the sequence of answers to illustrate the viability of our approach we create a new dataset of complex questions complexwebquestions and present a model that decomposes questions and interacts with the web to compute an answer we empirically demonstrate that question decomposition improves performance from 208 precision1 to 275 precision1 on this new dataset
|
[['answering', 'complex', 'questions', 'is', 'a', 'timeconsuming', 'activity', 'for', 'humans', 'that', 'requires', 'reasoning', 'and', 'integration', 'of', 'information', 'recent', 'work', 'on', 'reading', 'comprehension', 'made', 'headway', 'in', 'answering', 'simple', 'questions', 'but', 'tackling', 'complex', 'questions', 'is', 'still', 'an', 'ongoing', 'research', 'challenge', 'conversely', 'semantic', 'parsers', 'have', 'been', 'successful', 'at', 'handling', 'compositionality', 'but', 'only', 'when', 'the', 'information', 'resides', 'in', 'a', 'target', 'knowledgebase', 'in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'framework', 'for', 'answering', 'broad', 'and', 'complex', 'questions', 'assuming', 'answering', 'simple', 'questions', 'is', 'possible', 'using', 'a', 'search', 'engine', 'and', 'a', 'reading', 'comprehension', 'model', 'we', 'propose', 'to', 'decompose', 'complex', 'questions', 'into', 'a', 'sequence', 'of', 'simple', 'questions', 'and', 'compute', 'the', 'final', 'answer', 'from', 'the', 'sequence', 'of', 'answers', 'to', 'illustrate', 'the', 'viability', 'of', 'our', 'approach', 'we', 'create', 'a', 'new', 'dataset', 'of', 'complex', 'questions', 'complexwebquestions', 'and', 'present', 'a', 'model', 'that', 'decomposes', 'questions', 'and', 'interacts', 'with', 'the', 'web', 'to', 'compute', 'an', 'answer', 'we', 'empirically', 'demonstrate', 'that', 'question', 'decomposition', 'improves', 'performance', 'from', '208', 'precision1', 'to', '275', 'precision1', 'on', 'this', 'new', 'dataset']]
|
[-0.04919685753489471, 0.023266284843160814, -0.044637776131201894, 0.09492469781929638, -0.1660112578564199, -0.16093950735102555, 0.08793930084352637, 0.3882281153824679, -0.2870003511375825, -0.371907674262573, 0.061330321536304515, -0.26682198840745125, -0.16270790096063903, 0.23386379501450166, -0.14207505033748924, -0.0008912311591041885, 0.13825640818519389, 0.016843237261625992, -0.02272715135573878, -0.30183919214281685, 0.334128742011347, 0.0475057022984193, 0.24751420330351134, 0.13011320431829448, 0.1410202770241815, -0.035114318119795034, -0.07890183029838713, -0.022338897233034016, -0.10169577850306008, 0.18245328415650874, 0.3048667325415785, 0.2631668333590007, 0.3546897643097457, -0.3739565484652853, -0.1957806752116722, 0.04664405206052266, 0.16123355660516364, 0.10287543928404902, -0.06371351844293012, -0.2928428172732994, 0.10516517587854367, -0.12765398230492642, -0.04325481439394888, -0.14440004808151988, 0.03977350588104907, -0.08761898695956916, -0.239622110987355, -0.004730103632352154, 0.1309363423152619, 0.09645779690687444, -0.05505743593713091, -0.054576961599456464, 0.11091047508944608, 0.1750905543491971, 0.005007442385469438, 0.08426515432371265, 0.11276355419296083, -0.18347230470134243, -0.18191564875613353, 0.3946196167688271, -0.014237835552472218, -0.17957671187450266, 0.2044941819492419, -0.06534587604343702, -0.19014053827130895, 0.06503160750481543, 0.1955883223070336, 0.14702652381572895, -0.16181394814820976, 0.060986755698308304, -0.10702707397063399, 0.2306785319314878, 0.07095712648147041, -0.04587080222732465, 0.2514148251209883, 0.26299123294432025, 3.773654561940652e-05, 0.1218178735773085, -0.0038277612121146954, -0.06604398236569954, -0.18851352878697927, -0.16547953121209885, -0.11067945637093608, 0.05796155244539118, 0.0013104551388351188, -0.14856111482201015, 0.4103306814150256, 0.2398496327304821, 0.23908449874324783, 0.0711986234553965, 0.31485323243697355, 0.01909103056276514, 0.01821760407939648, 0.0792811150650737, 0.0979291796743585, 0.04924811309523833, 0.11017450884838773, -0.12258863601585922, 0.06699598191423152, 0.03701632175665752]
|
1,803.06644
|
Computing and Testing Pareto Optimal Committees
|
Selecting a set of alternatives based on the preferences of agents is an
important problem in committee selection and beyond. Among the various criteria
put forth for the desirability of a committee, Pareto optimality is a minimal
and important requirement. As asking agents to specify their preferences over
exponentially many subsets of alternatives is practically infeasible, we assume
that each agent specifies a weak order on single alternatives, from which a
preference relation over subsets is derived using some preference extension. We
consider five prominent extensions (responsive, downward lexicographic, upward
lexicographic, best, and worst). For each of them, we consider the
corresponding Pareto optimality notion, and we study the complexity of
computing and verifying Pareto optimal outcomes. We also consider strategic
issues: for four of the set extensions, we present a linear-time, Pareto
optimal and strategyproof algorithm that even works for weak preferences.
|
cs.GT cs.AI cs.DS
|
selecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond among the various criteria put forth for the desirability of a committee pareto optimality is a minimal and important requirement as asking agents to specify their preferences over exponentially many subsets of alternatives is practically infeasible we assume that each agent specifies a weak order on single alternatives from which a preference relation over subsets is derived using some preference extension we consider five prominent extensions responsive downward lexicographic upward lexicographic best and worst for each of them we consider the corresponding pareto optimality notion and we study the complexity of computing and verifying pareto optimal outcomes we also consider strategic issues for four of the set extensions we present a lineartime pareto optimal and strategyproof algorithm that even works for weak preferences
|
[['selecting', 'a', 'set', 'of', 'alternatives', 'based', 'on', 'the', 'preferences', 'of', 'agents', 'is', 'an', 'important', 'problem', 'in', 'committee', 'selection', 'and', 'beyond', 'among', 'the', 'various', 'criteria', 'put', 'forth', 'for', 'the', 'desirability', 'of', 'a', 'committee', 'pareto', 'optimality', 'is', 'a', 'minimal', 'and', 'important', 'requirement', 'as', 'asking', 'agents', 'to', 'specify', 'their', 'preferences', 'over', 'exponentially', 'many', 'subsets', 'of', 'alternatives', 'is', 'practically', 'infeasible', 'we', 'assume', 'that', 'each', 'agent', 'specifies', 'a', 'weak', 'order', 'on', 'single', 'alternatives', 'from', 'which', 'a', 'preference', 'relation', 'over', 'subsets', 'is', 'derived', 'using', 'some', 'preference', 'extension', 'we', 'consider', 'five', 'prominent', 'extensions', 'responsive', 'downward', 'lexicographic', 'upward', 'lexicographic', 'best', 'and', 'worst', 'for', 'each', 'of', 'them', 'we', 'consider', 'the', 'corresponding', 'pareto', 'optimality', 'notion', 'and', 'we', 'study', 'the', 'complexity', 'of', 'computing', 'and', 'verifying', 'pareto', 'optimal', 'outcomes', 'we', 'also', 'consider', 'strategic', 'issues', 'for', 'four', 'of', 'the', 'set', 'extensions', 'we', 'present', 'a', 'lineartime', 'pareto', 'optimal', 'and', 'strategyproof', 'algorithm', 'that', 'even', 'works', 'for', 'weak', 'preferences']]
|
[-0.12331641395087842, 0.008272682388343236, -0.05719419432009434, 0.1462512337342165, -0.16711934577426188, -0.20264143809363558, 0.15829104807234362, 0.4185714614186827, -0.2794065133219103, -0.2800078828643252, 0.08724279898313245, -0.2655484335972452, -0.11756997569171074, 0.1431454303316199, -0.08468634236467208, 0.061478948500658666, 0.014994813725222033, 0.051468720086492024, -0.015729300313876694, -0.32239458700674556, 0.33447023847472523, 0.0206583217567914, 0.2735543829434506, -0.016279602924791668, 0.12603097971873944, 0.05176617285086923, -0.01892304978125006, 0.09632671999230565, -0.16012136058581072, 0.12762939692816822, 0.2975589790905767, 0.26000207135701303, 0.40589303473805216, -0.3656880783333958, -0.1055652610892495, 0.17470632553738835, 0.09661869751126669, 0.046589390302265804, -0.011739901587744798, -0.23675205483967504, 0.0912874918023997, -0.17295033040182126, -0.08303328004496341, -0.04749480456478529, 0.01889151679775254, 0.0601209870236763, -0.335125252005312, -0.04536873531072739, 0.059469763984109136, 0.049070722215086016, -0.0938125018720756, -0.1343280973134341, 0.03413156247811744, 0.08980309503416326, 0.049012939423286855, -0.05817507596692995, 0.10062240984069405, -0.13518616070944842, -0.19613193662615713, 0.4224648725215372, 0.00812627200177265, -0.19233028147649672, 0.1526155692893178, -0.07046670919378659, -0.1587872779187323, 0.07148956625650708, 0.14676648813423576, 0.12139404868264195, -0.1518370301000305, 0.07116524899749646, -0.12895276780416082, 0.1350085207007148, 0.1033489456460518, 0.03208076412027532, 0.17823803217729906, 0.19033551476309662, 0.19463111271298575, 0.1568294504292674, 0.030557285877061892, -0.12284442222387354, -0.30988993422108724, -0.14718818866445885, -0.10309631056217411, -0.03344026909672193, -0.1313452131533751, -0.1554201719956798, 0.398131232057418, 0.1670032658602414, 0.1593240512587078, 0.12621299425625224, 0.2686555120911632, 0.059557357842267095, -0.013344107598125963, 0.11908397418479402, 0.17721271322868354, 0.03138831589318864, 0.012696804666005961, -0.1588975929840748, 0.17848869392947925, 0.038828848854645145]
|
1,803.06645
|
Approximating the Likelihood in Approximate Bayesian Computation
|
This chapter will appear in the forthcoming Handbook of Approximate Bayesian
Computation (2018).
The conceptual and methodological framework that underpins approximate
Bayesian computation (ABC) is targetted primarily towards problems in which the
likelihood is either challenging or missing. ABC uses a simulation-based
non-parametric estimate of the likelihood of a summary statistic and assumes
that the generation of data from the model is computationally cheap. This
chapter reviews two alternative approaches for estimating the intractable
likelihood, with the goal of reducing the necessary model simulations to
produce an approximate posterior. The first of these is a Bayesian version of
the synthetic likelihood (SL), initially developed by Wood (2010), which uses a
multivariate normal approximation to the summary statistic likelihood. Using
the parametric approximation as opposed to the non-parametric approximation of
ABC, it is possible to reduce the number of model simulations required. The
second likelihood approximation method we consider in this chapter is based on
the empirical likelihood (EL), which is a non-parametric technique and involves
maximising a likelihood constructed empirically under a set of moment
constraints. Mengersen et al (2013) adapt the EL framework so that it can be
used to form an approximate posterior for problems where ABC can be applied,
that is, for models with intractable likelihoods. However, unlike ABC and the
Bayesian SL (BSL), the Bayesian EL (BCel) approach can be used to completely
avoid model simulations in some cases. The BSL and BCel methods are illustrated
on models of varying complexity.
|
stat.CO stat.ME
|
this chapter will appear in the forthcoming handbook of approximate bayesian computation 2018 the conceptual and methodological framework that underpins approximate bayesian computation abc is targetted primarily towards problems in which the likelihood is either challenging or missing abc uses a simulationbased nonparametric estimate of the likelihood of a summary statistic and assumes that the generation of data from the model is computationally cheap this chapter reviews two alternative approaches for estimating the intractable likelihood with the goal of reducing the necessary model simulations to produce an approximate posterior the first of these is a bayesian version of the synthetic likelihood sl initially developed by wood 2010 which uses a multivariate normal approximation to the summary statistic likelihood using the parametric approximation as opposed to the nonparametric approximation of abc it is possible to reduce the number of model simulations required the second likelihood approximation method we consider in this chapter is based on the empirical likelihood el which is a nonparametric technique and involves maximising a likelihood constructed empirically under a set of moment constraints mengersen et al 2013 adapt the el framework so that it can be used to form an approximate posterior for problems where abc can be applied that is for models with intractable likelihoods however unlike abc and the bayesian sl bsl the bayesian el bcel approach can be used to completely avoid model simulations in some cases the bsl and bcel methods are illustrated on models of varying complexity
|
[['this', 'chapter', 'will', 'appear', 'in', 'the', 'forthcoming', 'handbook', 'of', 'approximate', 'bayesian', 'computation', '2018', 'the', 'conceptual', 'and', 'methodological', 'framework', 'that', 'underpins', 'approximate', 'bayesian', 'computation', 'abc', 'is', 'targetted', 'primarily', 'towards', 'problems', 'in', 'which', 'the', 'likelihood', 'is', 'either', 'challenging', 'or', 'missing', 'abc', 'uses', 'a', 'simulationbased', 'nonparametric', 'estimate', 'of', 'the', 'likelihood', 'of', 'a', 'summary', 'statistic', 'and', 'assumes', 'that', 'the', 'generation', 'of', 'data', 'from', 'the', 'model', 'is', 'computationally', 'cheap', 'this', 'chapter', 'reviews', 'two', 'alternative', 'approaches', 'for', 'estimating', 'the', 'intractable', 'likelihood', 'with', 'the', 'goal', 'of', 'reducing', 'the', 'necessary', 'model', 'simulations', 'to', 'produce', 'an', 'approximate', 'posterior', 'the', 'first', 'of', 'these', 'is', 'a', 'bayesian', 'version', 'of', 'the', 'synthetic', 'likelihood', 'sl', 'initially', 'developed', 'by', 'wood', '2010', 'which', 'uses', 'a', 'multivariate', 'normal', 'approximation', 'to', 'the', 'summary', 'statistic', 'likelihood', 'using', 'the', 'parametric', 'approximation', 'as', 'opposed', 'to', 'the', 'nonparametric', 'approximation', 'of', 'abc', 'it', 'is', 'possible', 'to', 'reduce', 'the', 'number', 'of', 'model', 'simulations', 'required', 'the', 'second', 'likelihood', 'approximation', 'method', 'we', 'consider', 'in', 'this', 'chapter', 'is', 'based', 'on', 'the', 'empirical', 'likelihood', 'el', 'which', 'is', 'a', 'nonparametric', 'technique', 'and', 'involves', 'maximising', 'a', 'likelihood', 'constructed', 'empirically', 'under', 'a', 'set', 'of', 'moment', 'constraints', 'mengersen', 'et', 'al', '2013', 'adapt', 'the', 'el', 'framework', 'so', 'that', 'it', 'can', 'be', 'used', 'to', 'form', 'an', 'approximate', 'posterior', 'for', 'problems', 'where', 'abc', 'can', 'be', 'applied', 'that', 'is', 'for', 'models', 'with', 'intractable', 'likelihoods', 'however', 'unlike', 'abc', 'and', 'the', 'bayesian', 'sl', 'bsl', 'the', 'bayesian', 'el', 'bcel', 'approach', 'can', 'be', 'used', 'to', 'completely', 'avoid', 'model', 'simulations', 'in', 'some', 'cases', 'the', 'bsl', 'and', 'bcel', 'methods', 'are', 'illustrated', 'on', 'models', 'of', 'varying', 'complexity']]
|
[-0.020544440088299466, -0.017729307846902697, -0.11069260301942728, 0.11914419974533043, -0.10796694555604944, -0.13573514059357042, 0.062482603252580274, 0.3502431026945005, -0.25965715963583513, -0.355363365601064, 0.11433546510572565, -0.22523217179945537, -0.18115146147225014, 0.18667518469809116, -0.09273498983889948, 0.11448822902439504, 0.06266136837324926, -0.03979360734929844, -0.04338533693891285, -0.28229462402416583, 0.23719208402445122, 0.10667800335831255, 0.29464297745832985, -0.06117696815232119, 0.09087375862647457, 0.025893914492382687, -0.05453649436940952, 0.022140809197543958, -0.1413547324583324, 0.15782834037150048, 0.2630431979708433, 0.22395798918810123, 0.32012243898851533, -0.3950476151672477, -0.17869735100610676, 0.12745663702716026, 0.1502127694930615, 0.10889316335895421, 0.013674660210440658, -0.24090595621691674, 0.043906202236646596, -0.18321278133115979, -0.06645427417551757, -0.1004194966246545, -0.04473799933508343, 0.009677455972937146, -0.35199789071873744, 0.11193694435630222, 0.04084576575408633, 0.022555719600154126, 0.02605836192384714, -0.16562985652981668, 0.014132165052566906, 0.02496704861987382, 0.051706577703470785, 0.01809945909629519, 0.06395437592576372, -0.10922472791803278, -0.11468554522880182, 0.3277344458135396, -0.028832230169554145, -0.21591357156558305, 0.15695773961630707, -0.02831292948400488, -0.18453783261380632, 0.09857943569861201, 0.18911141109443744, 0.14988454465887377, -0.18803792804555625, 0.1080689862102023, -0.026804443664506687, 0.14480024836387256, 0.012771982127534491, -0.12223672541048454, 0.19547547430788376, 0.18656825305399846, 0.06430403354283118, 0.11798706031166853, -0.1396732977619965, -0.1166553405184793, -0.2707580328657653, -0.1523243111377696, -0.23847115663906598, -0.019881317252768392, -0.06962236036345772, -0.22000095821555932, 0.3718461966588713, 0.23024808151495396, 0.16983743362052708, 0.09387252656932996, 0.3227348644704539, 0.13289029249376189, -0.009811198103006416, 0.07039462712270264, 0.21981146916264802, 0.12966683634404777, 0.04081287108912912, -0.12848783623443782, 0.13507161776758542, 0.04330648636369377]
|
1,803.06646
|
Toric geometry of $G_2$-manifolds
|
We consider $G_2$-manifolds with an effective torus action that is
multi-Hamiltonian for one or more of the defining forms. The case of
$T^3$-actions is found to be distinguished. For such actions multi-Hamiltonian
with respect to both the three- and four-form, we derive a Gibbons-Hawking type
ansatz giving the geometry on an open dense set in terms a symmetric $3\times
3$-matrix of functions. This leads to particularly simple examples of explicit
metrics with holonomy equal to $G_2$. We prove that the multi-moment maps
exhibit the full orbit space topologically as a smooth four-manifold containing
a trivalent graph as the image of the set of special orbits and describe these
graphs in some complete examples.
|
math.DG hep-th
|
we consider g_2manifolds with an effective torus action that is multihamiltonian for one or more of the defining forms the case of t3actions is found to be distinguished for such actions multihamiltonian with respect to both the three and fourform we derive a gibbonshawking type ansatz giving the geometry on an open dense set in terms a symmetric 3times 3matrix of functions this leads to particularly simple examples of explicit metrics with holonomy equal to g_2 we prove that the multimoment maps exhibit the full orbit space topologically as a smooth fourmanifold containing a trivalent graph as the image of the set of special orbits and describe these graphs in some complete examples
|
[['we', 'consider', 'g_2manifolds', 'with', 'an', 'effective', 'torus', 'action', 'that', 'is', 'multihamiltonian', 'for', 'one', 'or', 'more', 'of', 'the', 'defining', 'forms', 'the', 'case', 'of', 't3actions', 'is', 'found', 'to', 'be', 'distinguished', 'for', 'such', 'actions', 'multihamiltonian', 'with', 'respect', 'to', 'both', 'the', 'three', 'and', 'fourform', 'we', 'derive', 'a', 'gibbonshawking', 'type', 'ansatz', 'giving', 'the', 'geometry', 'on', 'an', 'open', 'dense', 'set', 'in', 'terms', 'a', 'symmetric', '3times', '3matrix', 'of', 'functions', 'this', 'leads', 'to', 'particularly', 'simple', 'examples', 'of', 'explicit', 'metrics', 'with', 'holonomy', 'equal', 'to', 'g_2', 'we', 'prove', 'that', 'the', 'multimoment', 'maps', 'exhibit', 'the', 'full', 'orbit', 'space', 'topologically', 'as', 'a', 'smooth', 'fourmanifold', 'containing', 'a', 'trivalent', 'graph', 'as', 'the', 'image', 'of', 'the', 'set', 'of', 'special', 'orbits', 'and', 'describe', 'these', 'graphs', 'in', 'some', 'complete', 'examples']]
|
[-0.1724854883619368, 0.07040277260057337, -0.03882992435579321, 0.07057443255013952, -0.08890175681569547, -0.1256811560514117, -0.0261599590750328, 0.37852813532975105, -0.21803497879591305, -0.24282232535447942, 0.12102398726606875, -0.26618366907808066, -0.17385848119530628, 0.20400261888114204, -0.10230562318299365, -0.03326159943493882, 0.047126447199843824, 0.11242231951681399, -0.13777761294789212, -0.2534139841905666, 0.4059089979689036, -0.036037703132024035, 0.1880678430856538, 0.02860420086238134, 0.1307049778863854, -0.03502324478800541, 0.012292140508569511, 0.0466390613996087, -0.14046323785506892, 0.1402381398885544, 0.24348201508733577, 0.10107210431721926, 0.13778552551022066, -0.3917411504496288, -0.1809184119629208, 0.14784680160352895, 0.10082876317236307, 0.0889186460824151, -0.015367353648538742, -0.28865702810123495, 0.08699010142299812, -0.16809878279777227, -0.17338492358768626, -0.1191493938635436, 0.0414165655466994, -0.006400317585627947, -0.24481845201392258, -0.00641578788807757, 0.08577922882977873, 0.05742134125570634, -0.05647922654627889, -0.06996006337327085, -0.0660655997177985, 0.125545996301558, 0.011652101152451775, 0.052852836254585, 0.06620889162461806, -0.12554481590580377, -0.11584851309349428, 0.4070230542898311, -0.060125795392585654, -0.27900821452827324, 0.18416689345446816, -0.11408834477021758, -0.14542804690842917, 0.11748129154044104, 0.13307761429626094, 0.1595146393977172, -0.10689417291489788, 0.1276187517786249, -0.08022916116169654, 0.08639298485650215, 0.0858441590410491, 0.02241522041731514, 0.1651140137276213, 0.10761029689040567, 0.13104460570528836, 0.19005527624124494, 0.001178664477525412, -0.07320284632234168, -0.3438696642406285, -0.15622181372392724, -0.09906192973929658, 0.13591681848213608, -0.14083427127557765, -0.24961169104374545, 0.41364903981697615, 0.03948061267978379, 0.23067862718328666, 0.06821266877912942, 0.2116358409444469, 0.09355801604630999, 0.04722071181251002, 0.08901973640396525, 0.15152414035531234, 0.15098757746662678, -0.025597007633353184, -0.15841895185751906, -0.052888722514450946, 0.1300258292633641]
|
1,803.06647
|
Line Artist: A Multiple Style Sketch to Painting Synthesis Scheme
|
Drawing a beautiful painting is a dream of many people since childhood. In
this paper, we propose a novel scheme, Line Artist, to synthesize artistic
style paintings with freehand sketch images, leveraging the power of deep
learning and advanced algorithms. Our scheme includes three models. The Sketch
Image Extraction (SIE) model is applied to generate the training data. It
includes smoothing reality images and pencil sketch extraction. The Detailed
Image Synthesis (DIS) model trains a conditional generative adversarial network
to generate detailed real-world information. The Adaptively Weighted Artistic
Style Transfer (AWAST) model is capable to combine multiple style images with a
content with the VGG19 network and PageRank algorithm. The appealing artistic
images are then generated by optimization iterations. Experiments are operated
on the Kaggle Cats dataset and The Oxford Buildings Dataset. Our synthesis
results are proved to be artistic, beautiful and robust.
|
cs.CV
|
drawing a beautiful painting is a dream of many people since childhood in this paper we propose a novel scheme line artist to synthesize artistic style paintings with freehand sketch images leveraging the power of deep learning and advanced algorithms our scheme includes three models the sketch image extraction sie model is applied to generate the training data it includes smoothing reality images and pencil sketch extraction the detailed image synthesis dis model trains a conditional generative adversarial network to generate detailed realworld information the adaptively weighted artistic style transfer awast model is capable to combine multiple style images with a content with the vgg19 network and pagerank algorithm the appealing artistic images are then generated by optimization iterations experiments are operated on the kaggle cats dataset and the oxford buildings dataset our synthesis results are proved to be artistic beautiful and robust
|
[['drawing', 'a', 'beautiful', 'painting', 'is', 'a', 'dream', 'of', 'many', 'people', 'since', 'childhood', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'scheme', 'line', 'artist', 'to', 'synthesize', 'artistic', 'style', 'paintings', 'with', 'freehand', 'sketch', 'images', 'leveraging', 'the', 'power', 'of', 'deep', 'learning', 'and', 'advanced', 'algorithms', 'our', 'scheme', 'includes', 'three', 'models', 'the', 'sketch', 'image', 'extraction', 'sie', 'model', 'is', 'applied', 'to', 'generate', 'the', 'training', 'data', 'it', 'includes', 'smoothing', 'reality', 'images', 'and', 'pencil', 'sketch', 'extraction', 'the', 'detailed', 'image', 'synthesis', 'dis', 'model', 'trains', 'a', 'conditional', 'generative', 'adversarial', 'network', 'to', 'generate', 'detailed', 'realworld', 'information', 'the', 'adaptively', 'weighted', 'artistic', 'style', 'transfer', 'awast', 'model', 'is', 'capable', 'to', 'combine', 'multiple', 'style', 'images', 'with', 'a', 'content', 'with', 'the', 'vgg19', 'network', 'and', 'pagerank', 'algorithm', 'the', 'appealing', 'artistic', 'images', 'are', 'then', 'generated', 'by', 'optimization', 'iterations', 'experiments', 'are', 'operated', 'on', 'the', 'kaggle', 'cats', 'dataset', 'and', 'the', 'oxford', 'buildings', 'dataset', 'our', 'synthesis', 'results', 'are', 'proved', 'to', 'be', 'artistic', 'beautiful', 'and', 'robust']]
|
[0.03126173928662033, -0.024044677112612243, -0.11437022156068977, 0.1070881747184846, -0.16412658904167549, -0.2098618661624078, -0.016949177699157, 0.47883586123795574, -0.2629769123290521, -0.3620475404830256, 0.06578788295975217, -0.3103875094552485, -0.2137677148591176, 0.19629733307241187, -0.21412252510805996, 0.05748224837220156, 0.171300625015365, -0.02241887679507195, -0.006600936636997675, -0.3001111622401316, 0.31372833236868325, 0.024332698090059328, 0.36653590787359525, -0.02927219106005767, 0.17024506500046568, -0.03493692679545911, -0.07167853188740325, -0.058823076104679684, -0.02772944941165739, 0.19697541861899825, 0.3253285820069643, 0.27330495028520446, 0.3052161990100859, -0.416383248412798, -0.19209667978337702, 0.044654437075172304, 0.07793234004048814, 0.14875331395313893, -0.0992297446273241, -0.38228654521058353, 0.06488908138978754, -0.13680134363419993, 0.03431105667571078, -0.1650655090720327, -0.034209970245465744, -0.019279023790633648, -0.30615576498151403, -0.030235885417836547, 0.06208189374531134, 0.09274680356324559, -0.0007852523269551531, -0.11356225214459159, -0.013617760318160897, 0.17291854740068002, -0.024510659691451355, 0.07065371782141804, 0.17100439038009604, -0.1924836180430286, -0.12061465399759547, 0.36157410940820267, -0.0063291558271116564, -0.1471731486323644, 0.15238511725000933, -0.0012511474598513941, -0.09985526393062737, 0.10654027283873777, 0.22379296398262533, 0.14015753224203495, -0.14080254214776444, -0.02751557214528283, -0.09832864459341681, 0.18869521745651122, 0.06486084688172847, -0.08220314688350953, 0.16338233252442902, 0.2507945937399148, -0.01684769224678822, 0.15672002065169272, -0.10514774367469035, -0.04948735753612094, -0.17626933020770771, -0.09846214294223718, -0.19697153002259807, -0.017501670322840064, -0.08264416146604918, -0.15613833821418, 0.4397726910646155, 0.22080931061891917, 0.19917293154949348, 0.09505944401943978, 0.3781177216065182, -0.02371134307123983, 0.08896358287565305, 0.0679379196962158, 0.09251815058179462, 0.003090429036143485, 0.20747563642659553, -0.10090332651104202, 0.06778726404414735, 0.10876673317356954]
|
1,803.06648
|
Charge migration mechanisms in the DNA at finite temperature revisited;
from quasi-ballistic to subdiffusive transport
|
Various charge migration mechanisms in the DNA are studied within the
framework of the Peyrard-Bishop-Holstein model which has been widely used to
address charge dynamics in this macromolecule. To analyze these mechanisms we
consider characteristic size and time scales of the fluctuations of the
electronic and vibrational subsystems. It is shown, in particular, that due to
substantial differences in these timescales polaron formation is unlikely
within a broad range of temperatures. We demonstrate that at low temperatures
electronic transport can be quasi-ballistic. For high temperatures, we propose
an alternative to polaronic charge migration mechanism: the
fluctuation-assisted one, in which the electron dynamics is governed by
relatively slow fluctuations of the vibrational subsystem. We argue also that
the discussed methods and mechanisms can be relevant for other organic
macromolecular systems, such as conjugated polymers and molecular aggregates.
|
physics.bio-ph cond-mat.mes-hall
|
various charge migration mechanisms in the dna are studied within the framework of the peyrardbishopholstein model which has been widely used to address charge dynamics in this macromolecule to analyze these mechanisms we consider characteristic size and time scales of the fluctuations of the electronic and vibrational subsystems it is shown in particular that due to substantial differences in these timescales polaron formation is unlikely within a broad range of temperatures we demonstrate that at low temperatures electronic transport can be quasiballistic for high temperatures we propose an alternative to polaronic charge migration mechanism the fluctuationassisted one in which the electron dynamics is governed by relatively slow fluctuations of the vibrational subsystem we argue also that the discussed methods and mechanisms can be relevant for other organic macromolecular systems such as conjugated polymers and molecular aggregates
|
[['various', 'charge', 'migration', 'mechanisms', 'in', 'the', 'dna', 'are', 'studied', 'within', 'the', 'framework', 'of', 'the', 'peyrardbishopholstein', 'model', 'which', 'has', 'been', 'widely', 'used', 'to', 'address', 'charge', 'dynamics', 'in', 'this', 'macromolecule', 'to', 'analyze', 'these', 'mechanisms', 'we', 'consider', 'characteristic', 'size', 'and', 'time', 'scales', 'of', 'the', 'fluctuations', 'of', 'the', 'electronic', 'and', 'vibrational', 'subsystems', 'it', 'is', 'shown', 'in', 'particular', 'that', 'due', 'to', 'substantial', 'differences', 'in', 'these', 'timescales', 'polaron', 'formation', 'is', 'unlikely', 'within', 'a', 'broad', 'range', 'of', 'temperatures', 'we', 'demonstrate', 'that', 'at', 'low', 'temperatures', 'electronic', 'transport', 'can', 'be', 'quasiballistic', 'for', 'high', 'temperatures', 'we', 'propose', 'an', 'alternative', 'to', 'polaronic', 'charge', 'migration', 'mechanism', 'the', 'fluctuationassisted', 'one', 'in', 'which', 'the', 'electron', 'dynamics', 'is', 'governed', 'by', 'relatively', 'slow', 'fluctuations', 'of', 'the', 'vibrational', 'subsystem', 'we', 'argue', 'also', 'that', 'the', 'discussed', 'methods', 'and', 'mechanisms', 'can', 'be', 'relevant', 'for', 'other', 'organic', 'macromolecular', 'systems', 'such', 'as', 'conjugated', 'polymers', 'and', 'molecular', 'aggregates']]
|
[-0.12454638787700484, 0.19894795717975486, -0.06824101465236809, 0.0874981069713141, 0.03691759132780135, -0.12881271833622898, 0.01798341165434707, 0.3989356985729602, -0.3140984805093871, -0.26257465868386337, 0.045305510833686974, -0.2379380530229321, -0.13904226714124282, 0.1717699385472332, -0.013228996004909278, 0.016985588408661663, -0.004977424215111468, -0.04995233661762473, -0.0040587981679925215, -0.17755040510868034, 0.2665925848056321, 0.07928202799305803, 0.27723150970759214, 0.14904529144297596, 0.08055479751761865, -0.055287384993776126, 0.06219985452825549, 0.03127758578845748, -0.15947304208222907, 0.07649059159405254, 0.30062388668733614, 0.007414278262122362, 0.25286757028834134, -0.48663836812807454, -0.2577974793604679, 0.06294400653353444, 0.18213438469381935, 0.18095292285326178, -0.04157185937381453, -0.18850498254824843, 0.07735603964646105, -0.17351693558006512, -0.10327723118718024, -0.11724895013116853, 0.06421576088501348, 0.0518452161371156, -0.2090045188519138, 0.11288631166810066, 0.02220172068035161, 0.04050306437054166, -0.09539089863430018, -0.10454265485621161, -0.03328249208818845, 0.10252381266888093, 0.06834690830566817, -0.024212017851985162, 0.22235614435954226, -0.09207559097730728, -0.09671942995240292, 0.4134253774252203, -0.045072580499712515, -0.15996831450956286, 0.2701781556907075, -0.15944824228063226, -0.12213882016431954, 0.1621898746980285, 0.15719590321597127, 0.12986565211580858, -0.20143974415819954, 0.03522932311472552, 0.022257245025011124, 0.17213549300062436, 0.01455126167792413, 0.11925194593560365, 0.24287128024907023, 0.21164854519172674, -0.001001379080116749, 0.12209046532581043, -0.11346568456609492, -0.13507538708099337, -0.19426374774840144, -0.14593896744859025, -0.17395498564259873, 0.04121578900764386, -0.05784584082343995, -0.1316774059369453, 0.39863141106648575, 0.1768321963923949, 0.1961112265371614, -0.03570182224114736, 0.24149961645059564, 0.11465159620037647, 0.10019528573654868, 0.048168379137361494, 0.2285835307971057, 0.10156831128902181, 0.0871953491975243, -0.293263598072722, 0.09611088323096434, 0.0012780446852384893]
|
1,803.06649
|
Cubical Assemblies, a Univalent and Impredicative Universe and a Failure
of Propositional Resizing
|
We construct a model of cubical type theory with a univalent and
impredicative universe in a category of cubical assemblies. We show that this
impredicative universe in the cubical assembly model does not satisfy a form of
propositional resizing.
|
cs.LO
|
we construct a model of cubical type theory with a univalent and impredicative universe in a category of cubical assemblies we show that this impredicative universe in the cubical assembly model does not satisfy a form of propositional resizing
|
[['we', 'construct', 'a', 'model', 'of', 'cubical', 'type', 'theory', 'with', 'a', 'univalent', 'and', 'impredicative', 'universe', 'in', 'a', 'category', 'of', 'cubical', 'assemblies', 'we', 'show', 'that', 'this', 'impredicative', 'universe', 'in', 'the', 'cubical', 'assembly', 'model', 'does', 'not', 'satisfy', 'a', 'form', 'of', 'propositional', 'resizing']]
|
[-0.09519353703571817, 0.02968688137256182, -0.12061855402321388, 0.15727181506689447, -0.14159404863722813, -0.11833994372341877, -0.00020310998213692353, 0.3602922005244555, -0.27407805306407124, -0.19836722202121448, 0.04427473642863333, -0.1771639781550337, -0.14752947624462345, 0.1004663436816862, -0.18293369508897647, -0.12894810874683735, 0.024142367807097543, 0.05491507425904274, -0.013166943678441338, -0.22650715295607463, 0.34522161533673984, -0.0862210892045345, 0.22013482375022692, -0.018391099400245227, 0.1616325076812735, -0.0675026753033774, 0.03918744518588751, 0.11772938297154048, -0.19449307642170402, 0.1605557113324698, 0.26207015603685224, 0.1980075089690777, 0.26768020056009006, -0.4713787046762613, -0.14857777444502482, 0.1607166336467251, 0.11368258144610967, 0.12519602436954394, -0.06598713213148025, -0.2112932553371558, 0.057362822863536, -0.20575432092524493, -0.0929120962197582, -0.055480666004885465, 0.0008087243216160017, 0.045294289190608725, -0.23945718974573538, 0.024264776052381747, 0.18354209245015413, 0.06796913541471347, -0.10113782180138887, 0.04579223957485878, -0.031061629358774576, 0.008732304693414615, -0.13992588690673122, 0.02271360869352252, 0.12702380781038067, -0.10291779207853743, -0.10402052639386593, 0.44455857336139065, -0.07540364900174049, -0.18795650426107338, 0.15217742608048213, -0.17725114963757685, -0.2465329609859066, 0.08662115931749725, 0.02468534379910964, 0.12306443226929659, -0.11721208522048517, 0.1843959861778272, -0.12884693876959574, 0.2521807292046455, 0.12195398340909144, 0.008418722687145839, 0.2299610554264524, 0.2248353783805401, -0.023570638197736863, 0.1639303305807213, 0.08375964023602697, -0.1236854756776339, -0.4142313283892014, -0.1816338286973918, -0.0760224269858251, 0.09342690309523068, -0.11347065217612395, -0.3161671670774619, 0.3107822806490824, 0.1343918651676713, 0.15680219994810146, 0.21701015469928583, 0.23353979192101038, -0.06245056647234238, 0.1500569408138593, -0.02049426982800166, 0.1288988676447517, 0.1607661444025162, 0.09306569082232621, -0.04815511773221004, 0.0044912570633758335, 0.22698404573095152]
|
1,803.0665
|
A large and pristine sample of standard candles across the Milky Way:
~100,000 red clump stars with 3% contamination
|
Core helium-burning red clump (RC) stars are excellent standard candles in
the Milky Way. These stars may have more precise distance estimates from
spectrophotometry than from Gaia parallaxes beyond 3 kpc. However, RC stars
have $T_{\rm eff}$ and log g very similar to some red giant branch (RGB) stars.
Especially for low-resolution spectroscopic studies where $T_{\rm eff}$, log g,
and [Fe/H] can only be estimated with limited precision, separating RC stars
from RGB through established method can incur ~20% contamination. Recently,
Hawkins et al. (2018) demonstrated that the additional information in
single-epoch spectra, such as the C/N ratio, can be exploited to cleanly
differentiate RC and RGB stars. In this second paper of the series, we
establish a data-driven mapping from spectral flux space to independently
determined asteroseismic parameters, the frequency and the period spacing. From
this, we identify 210,371 RC stars from the publicly available LAMOST DR3 and
APOGEE DR14 data, with ~9% of contamination. We provide an RC sample of 92,249
stars with a contamination of only ~3%, by restricting the combined analysis to
LAMOST stars with ${\rm S/N}_{\rm pix}$ > 75. This demonstrates that high-S/N,
low-resolution spectra covering a broad wavelength range can identify RC
samples at least as pristine as their high-resolution counterparts. As coming
and ongoing surveys such as TESS, DESI, and LAMOST will continue to improve the
overlapping training spectroscopic-asteroseismic sample, the method presented
in this study provides an efficient and straightforward way to derive a vast
yet pristine RC stars to reveal the 3D structure of the Milky Way.
|
astro-ph.SR astro-ph.GA
|
core heliumburning red clump rc stars are excellent standard candles in the milky way these stars may have more precise distance estimates from spectrophotometry than from gaia parallaxes beyond 3 kpc however rc stars have t_rm eff and log g very similar to some red giant branch rgb stars especially for lowresolution spectroscopic studies where t_rm eff log g and feh can only be estimated with limited precision separating rc stars from rgb through established method can incur 20 contamination recently hawkins et al 2018 demonstrated that the additional information in singleepoch spectra such as the cn ratio can be exploited to cleanly differentiate rc and rgb stars in this second paper of the series we establish a datadriven mapping from spectral flux space to independently determined asteroseismic parameters the frequency and the period spacing from this we identify 210371 rc stars from the publicly available lamost dr3 and apogee dr14 data with 9 of contamination we provide an rc sample of 92249 stars with a contamination of only 3 by restricting the combined analysis to lamost stars with rm sn_rm pix 75 this demonstrates that highsn lowresolution spectra covering a broad wavelength range can identify rc samples at least as pristine as their highresolution counterparts as coming and ongoing surveys such as tess desi and lamost will continue to improve the overlapping training spectroscopicasteroseismic sample the method presented in this study provides an efficient and straightforward way to derive a vast yet pristine rc stars to reveal the 3d structure of the milky way
|
[['core', 'heliumburning', 'red', 'clump', 'rc', 'stars', 'are', 'excellent', 'standard', 'candles', 'in', 'the', 'milky', 'way', 'these', 'stars', 'may', 'have', 'more', 'precise', 'distance', 'estimates', 'from', 'spectrophotometry', 'than', 'from', 'gaia', 'parallaxes', 'beyond', '3', 'kpc', 'however', 'rc', 'stars', 'have', 't_rm', 'eff', 'and', 'log', 'g', 'very', 'similar', 'to', 'some', 'red', 'giant', 'branch', 'rgb', 'stars', 'especially', 'for', 'lowresolution', 'spectroscopic', 'studies', 'where', 't_rm', 'eff', 'log', 'g', 'and', 'feh', 'can', 'only', 'be', 'estimated', 'with', 'limited', 'precision', 'separating', 'rc', 'stars', 'from', 'rgb', 'through', 'established', 'method', 'can', 'incur', '20', 'contamination', 'recently', 'hawkins', 'et', 'al', '2018', 'demonstrated', 'that', 'the', 'additional', 'information', 'in', 'singleepoch', 'spectra', 'such', 'as', 'the', 'cn', 'ratio', 'can', 'be', 'exploited', 'to', 'cleanly', 'differentiate', 'rc', 'and', 'rgb', 'stars', 'in', 'this', 'second', 'paper', 'of', 'the', 'series', 'we', 'establish', 'a', 'datadriven', 'mapping', 'from', 'spectral', 'flux', 'space', 'to', 'independently', 'determined', 'asteroseismic', 'parameters', 'the', 'frequency', 'and', 'the', 'period', 'spacing', 'from', 'this', 'we', 'identify', '210371', 'rc', 'stars', 'from', 'the', 'publicly', 'available', 'lamost', 'dr3', 'and', 'apogee', 'dr14', 'data', 'with', '9', 'of', 'contamination', 'we', 'provide', 'an', 'rc', 'sample', 'of', '92249', 'stars', 'with', 'a', 'contamination', 'of', 'only', '3', 'by', 'restricting', 'the', 'combined', 'analysis', 'to', 'lamost', 'stars', 'with', 'rm', 'sn_rm', 'pix', '75', 'this', 'demonstrates', 'that', 'highsn', 'lowresolution', 'spectra', 'covering', 'a', 'broad', 'wavelength', 'range', 'can', 'identify', 'rc', 'samples', 'at', 'least', 'as', 'pristine', 'as', 'their', 'highresolution', 'counterparts', 'as', 'coming', 'and', 'ongoing', 'surveys', 'such', 'as', 'tess', 'desi', 'and', 'lamost', 'will', 'continue', 'to', 'improve', 'the', 'overlapping', 'training', 'spectroscopicasteroseismic', 'sample', 'the', 'method', 'presented', 'in', 'this', 'study', 'provides', 'an', 'efficient', 'and', 'straightforward', 'way', 'to', 'derive', 'a', 'vast', 'yet', 'pristine', 'rc', 'stars', 'to', 'reveal', 'the', '3d', 'structure', 'of', 'the', 'milky', 'way']]
|
[-0.0035772612119751375, 0.0686429591235263, -0.09458218761793678, 0.05451943778750738, -0.14981913456364374, -0.0819588840758014, 0.13468745725630368, 0.414532661964629, -0.1862567215730595, -0.40876147863898604, 0.032148161994030935, -0.3173178526617232, -0.029124239827358414, 0.2444089926928947, -0.1253149845694665, -0.010130283703643179, 0.14163575376594617, -0.07379625132388254, -0.044014816197713594, -0.27101267985999006, 0.2467470921230473, 0.03654891595850506, 0.17754692469154382, -0.12117605035899263, 0.012209896150226187, -0.11906900054207885, -0.09766214073597294, -0.0216573053715235, -0.17180895836685928, 0.05756010893373824, 0.30292758308173184, 0.15151288731777596, 0.2097087553378919, -0.3075456726454297, -0.20442115671245292, 0.07218813730980314, 0.24363329153441424, 0.07524298402333646, -0.03993647762082031, -0.2703916803584434, 0.10141673394352278, -0.1632199873408628, -0.13714049481946167, -0.024884197751008388, 0.03869819163071317, 0.03551824046492887, -0.24336555707827395, 0.07647219913852742, -0.002433849074083218, 0.1476532462332952, -0.054886370159996055, -0.21428114685067345, -0.08181922066409791, 0.1328909201565982, -0.05023581742346915, 0.0840420677148301, 0.1094613540072238, -0.09279906381723574, 0.03965300760954426, 0.38537466184916125, -0.13917823189284906, 0.008442887550036032, 0.18050122784916312, -0.15044993768438755, -0.15287333788185764, 0.07070722335964323, 0.1540602008977975, 0.16283857566766471, -0.21391683564595748, 0.02862751442432729, 0.02617864232946424, 0.20621851577870695, 0.08582593497657587, 0.07995325360735435, 0.26068889778403065, 0.1261347151317057, 0.04005622096121356, 0.05269997589020354, -0.2643299461813599, 0.022018826530372265, -0.2389270967382583, -0.10141370061504108, -0.13999116715248897, 0.07866006718240752, -0.143192010981101, -0.11395489055448996, 0.313108460837236, 0.14113764028436326, 0.24104468745645136, 0.04773400793182812, 0.33839695324145613, 0.05182122470328717, 0.15073603244970385, 0.10381271793333341, 0.3018456894802974, 0.17009568134866035, 0.08435882877240637, -0.20893773159655715, 0.018266580466713225, -0.016484009175901374]
|
1,803.06651
|
Limits in dagger categories
|
We develop a notion of limit for dagger categories, that we show is suitable in the following ways: it subsumes special cases known from the literature; dagger limits are unique up to unitary isomorphism; a wide class of dagger limits can be built from a small selection of them; dagger limits of a fixed shape can be phrased as dagger adjoints to a diagonal functor; dagger limits can be built from ordinary limits in the presence of polar decomposition; dagger limits commute with dagger colimits in many cases.
|
math.CT
|
we develop a notion of limit for dagger categories that we show is suitable in the following ways it subsumes special cases known from the literature dagger limits are unique up to unitary isomorphism a wide class of dagger limits can be built from a small selection of them dagger limits of a fixed shape can be phrased as dagger adjoints to a diagonal functor dagger limits can be built from ordinary limits in the presence of polar decomposition dagger limits commute with dagger colimits in many cases
|
[['we', 'develop', 'a', 'notion', 'of', 'limit', 'for', 'dagger', 'categories', 'that', 'we', 'show', 'is', 'suitable', 'in', 'the', 'following', 'ways', 'it', 'subsumes', 'special', 'cases', 'known', 'from', 'the', 'literature', 'dagger', 'limits', 'are', 'unique', 'up', 'to', 'unitary', 'isomorphism', 'a', 'wide', 'class', 'of', 'dagger', 'limits', 'can', 'be', 'built', 'from', 'a', 'small', 'selection', 'of', 'them', 'dagger', 'limits', 'of', 'a', 'fixed', 'shape', 'can', 'be', 'phrased', 'as', 'dagger', 'adjoints', 'to', 'a', 'diagonal', 'functor', 'dagger', 'limits', 'can', 'be', 'built', 'from', 'ordinary', 'limits', 'in', 'the', 'presence', 'of', 'polar', 'decomposition', 'dagger', 'limits', 'commute', 'with', 'dagger', 'colimits', 'in', 'many', 'cases']]
|
[-0.07790619486265561, 0.050367645411328835, -0.07966810889245773, 0.09028749441627455, -0.12166611074776897, -0.12955806438747625, 0.07986193981593136, 0.3982309486970983, -0.39711231040895323, -0.23566454018212177, 0.09774132524101085, -0.18080474673148605, -0.11162451983810487, 0.2410909334324639, -0.18250552301866596, -0.01592929867646572, 0.06786755103861321, 0.09712273510045964, -0.11807713380072858, -0.1945832702225413, 0.37531945926391264, -0.03089710293253037, 0.2625100926326757, -0.024117699607317758, 0.09309541373460722, -0.06480547297872942, 0.02561560699144717, 0.023424627214684402, -0.06455109737569066, 0.11353028159249913, 0.3718966423581481, 0.1370637227929282, 0.1802988373251124, -0.38479802055834705, -0.10983605288096111, 0.18080310759647877, 0.12778131308997134, 0.05566463697257198, 0.030795804552987895, -0.3422489044235342, 0.10002944436432286, -0.27119806190371903, -0.0806441889885305, -0.11381343310296704, 0.03326057831608606, 0.026772680205546996, -0.27782354571602563, -0.045345819354141975, 0.15895198288754644, -0.010777715201997622, -0.05242022911658172, -0.08534072374459356, -0.01660018460031345, 0.12365781197811222, -0.008520493164806712, -0.03200025211845059, 0.1977687981720506, -0.1336421789389781, -0.12946962910196322, 0.40389338398182933, -0.08393281761726196, -0.22328620877074587, 0.19899867144836622, -0.11698871720793912, -0.1801657042762434, 0.09718971253526186, 0.05982908306759782, 0.14841131219873205, -0.11635821947658603, 0.2455269942716272, -0.13891882453621787, 0.07185356993101198, 0.12271195390282875, 0.07824735830813138, 0.19543203945134088, 0.14357621878364377, 0.08585715670315866, 0.15624130880380768, 0.012726568396994315, -0.10706811618398536, -0.35846557620574127, -0.10471562663389539, -0.02402749346484515, 0.08360423224935816, -0.1064517875096168, -0.16988397021354598, 0.2974604155063968, 0.11737359691390091, 0.2013778450041586, 0.14448020569133488, 0.22765511469068853, 0.0953211032306585, 0.11877901848955927, 0.03151396310634234, 0.21530682160201567, 0.21529436706226657, 0.0074431106067177925, -0.028025349027964032, 0.02004230514549735, 0.1494226761754941]
|
1,803.06652
|
Hesperos: A geophysical mission to Venus
|
The Hesperos mission proposed in this paper is a mission to Venus to
investigate the interior structure and the current level of activity. The main
questions to be answered with this mission are whether Venus has an internal
structure and composition similar to Earth and if Venus is still tectonically
active. To do so the mission will consist of two elements: an orbiter to
investigate the interior and changes over longer periods of time and a balloon
floating at an altitude between 40 and 60\~km to investigate the composition of
the atmosphere. The mission will start with the deployment of the balloon which
will operate for about 25 days. During this time the orbiter acts as a relay
station for data communication with Earth. Once the balloon phase is finished
the orbiter will perform surface and gravity gradient mapping over the course
of 7 Venus days. This mission proposal is the result of the Alpbach Summer
School and the post-Alpbach week.
|
astro-ph.EP
|
the hesperos mission proposed in this paper is a mission to venus to investigate the interior structure and the current level of activity the main questions to be answered with this mission are whether venus has an internal structure and composition similar to earth and if venus is still tectonically active to do so the mission will consist of two elements an orbiter to investigate the interior and changes over longer periods of time and a balloon floating at an altitude between 40 and 60km to investigate the composition of the atmosphere the mission will start with the deployment of the balloon which will operate for about 25 days during this time the orbiter acts as a relay station for data communication with earth once the balloon phase is finished the orbiter will perform surface and gravity gradient mapping over the course of 7 venus days this mission proposal is the result of the alpbach summer school and the postalpbach week
|
[['the', 'hesperos', 'mission', 'proposed', 'in', 'this', 'paper', 'is', 'a', 'mission', 'to', 'venus', 'to', 'investigate', 'the', 'interior', 'structure', 'and', 'the', 'current', 'level', 'of', 'activity', 'the', 'main', 'questions', 'to', 'be', 'answered', 'with', 'this', 'mission', 'are', 'whether', 'venus', 'has', 'an', 'internal', 'structure', 'and', 'composition', 'similar', 'to', 'earth', 'and', 'if', 'venus', 'is', 'still', 'tectonically', 'active', 'to', 'do', 'so', 'the', 'mission', 'will', 'consist', 'of', 'two', 'elements', 'an', 'orbiter', 'to', 'investigate', 'the', 'interior', 'and', 'changes', 'over', 'longer', 'periods', 'of', 'time', 'and', 'a', 'balloon', 'floating', 'at', 'an', 'altitude', 'between', '40', 'and', '60km', 'to', 'investigate', 'the', 'composition', 'of', 'the', 'atmosphere', 'the', 'mission', 'will', 'start', 'with', 'the', 'deployment', 'of', 'the', 'balloon', 'which', 'will', 'operate', 'for', 'about', '25', 'days', 'during', 'this', 'time', 'the', 'orbiter', 'acts', 'as', 'a', 'relay', 'station', 'for', 'data', 'communication', 'with', 'earth', 'once', 'the', 'balloon', 'phase', 'is', 'finished', 'the', 'orbiter', 'will', 'perform', 'surface', 'and', 'gravity', 'gradient', 'mapping', 'over', 'the', 'course', 'of', '7', 'venus', 'days', 'this', 'mission', 'proposal', 'is', 'the', 'result', 'of', 'the', 'alpbach', 'summer', 'school', 'and', 'the', 'postalpbach', 'week']]
|
[-0.1076799027238088, 0.2146965120182301, -0.10333991750383621, 0.001953908066564011, -0.08968259967020098, -0.04706418406256363, 0.04188855722511433, 0.36367115554101065, -0.2617676828478305, -0.38285675228415234, 0.17094332886107103, -0.2906445481665447, -0.12221427414706855, 0.19061240553636244, -0.140181762318613, 0.0005744392668781509, 0.108398369270371, 0.05369221728951114, -0.057558773313912584, -0.29963697899870995, 0.22905772917687237, 0.21837328405137052, 0.14984849669367262, 0.002933809445854628, 0.08563230742638896, -0.054190613035809646, 0.002405641202554224, -0.07755634970025821, -0.12012974122750028, 0.07725307351691574, 0.2747913658964512, 0.1862812161902493, 0.23683965521272998, -0.46088409480058923, -0.22265580322142434, 0.06642756361438185, 0.03364715236678438, -0.012462582221729154, 0.003794037936103044, -0.27479408203430894, 0.05363693480590745, -0.19582031942657255, -0.14185555682169074, 0.0190065718378942, 0.06332997750467474, -0.03087001999711278, -0.22433990824150518, -0.06777825581829457, 0.03031295584807606, 0.12844373887908533, -0.13267016778963636, -0.07703131718602055, -0.040647731678056645, 0.190436587906179, 0.06158629535410389, 0.06898116557979693, 0.11567634282598518, -0.04505522981426626, -0.0505333964027605, 0.4154457692818353, -0.06634605757353253, -0.03587270547993153, 0.19447133684554282, -0.20199237372609055, -0.09781067014478569, 0.10907374952667914, 0.20228324141119075, 0.10440106562385629, -0.15029619908349812, 0.03890854947315822, 0.008834503222046033, 0.19930166839006938, 0.10375973778782682, -0.02454015872376801, 0.29620893226948175, 0.20546586567582856, 0.1541629698868466, 0.07912064087503946, -0.20547072148337117, -0.05239570409838555, -0.25331702341073714, -0.18846624223632538, -0.13689319898649674, 0.019692702088563604, 0.004922101914783084, -0.08556106279211693, 0.39547050233971354, 0.14316075604625703, 0.13228495344636762, 0.003206308278747184, 0.3233170522986062, 0.008323125505333755, 0.04364037848189004, 0.07948006599637791, 0.2918478142229969, 0.04286528877187638, 0.17536133493929398, -0.17088165724541665, 0.08162148964720187, 0.03515461289452729]
|
1,803.06653
|
Modeling stock markets through the reconstruction of market processes
|
There are two possible ways of interpreting the seemingly stochastic nature
of financial markets: the Efficient Market Hypothesis (EMH) and a set of
stylized facts that drive the behavior of the markets. We show evidence for
some of the stylized facts such as memory-like phenomena in price volatility in
the short term, a power-law behavior and non-linear dependencies on the
returns.
Given this, we construct a model of the market using Markov chains. Then, we
develop an algorithm that can be generalized for any N-symbol alphabet and
K-length Markov chain. Using this tool, we are able to show that it's, at
least, always better than a completely random model such as a Random Walk. The
code is written in MATLAB and maintained in GitHub.
|
q-fin.ST q-fin.CP
|
there are two possible ways of interpreting the seemingly stochastic nature of financial markets the efficient market hypothesis emh and a set of stylized facts that drive the behavior of the markets we show evidence for some of the stylized facts such as memorylike phenomena in price volatility in the short term a powerlaw behavior and nonlinear dependencies on the returns given this we construct a model of the market using markov chains then we develop an algorithm that can be generalized for any nsymbol alphabet and klength markov chain using this tool we are able to show that its at least always better than a completely random model such as a random walk the code is written in matlab and maintained in github
|
[['there', 'are', 'two', 'possible', 'ways', 'of', 'interpreting', 'the', 'seemingly', 'stochastic', 'nature', 'of', 'financial', 'markets', 'the', 'efficient', 'market', 'hypothesis', 'emh', 'and', 'a', 'set', 'of', 'stylized', 'facts', 'that', 'drive', 'the', 'behavior', 'of', 'the', 'markets', 'we', 'show', 'evidence', 'for', 'some', 'of', 'the', 'stylized', 'facts', 'such', 'as', 'memorylike', 'phenomena', 'in', 'price', 'volatility', 'in', 'the', 'short', 'term', 'a', 'powerlaw', 'behavior', 'and', 'nonlinear', 'dependencies', 'on', 'the', 'returns', 'given', 'this', 'we', 'construct', 'a', 'model', 'of', 'the', 'market', 'using', 'markov', 'chains', 'then', 'we', 'develop', 'an', 'algorithm', 'that', 'can', 'be', 'generalized', 'for', 'any', 'nsymbol', 'alphabet', 'and', 'klength', 'markov', 'chain', 'using', 'this', 'tool', 'we', 'are', 'able', 'to', 'show', 'that', 'its', 'at', 'least', 'always', 'better', 'than', 'a', 'completely', 'random', 'model', 'such', 'as', 'a', 'random', 'walk', 'the', 'code', 'is', 'written', 'in', 'matlab', 'and', 'maintained', 'in', 'github']]
|
[-0.0962171377462706, 0.10100371311563049, -0.11959627393739132, 0.15273649102110962, -0.06768265517799532, -0.15499984472232864, 0.05180695371104147, 0.42276670770129054, -0.31476593598329683, -0.23946339088516705, 0.14888362949326014, -0.2927740842853559, -0.19410845476090985, 0.21168713213694168, -0.057123264949011605, 0.027470893180660327, 0.036076030969369885, 0.026639802971991096, 0.03489964003475928, -0.2699474547724656, 0.2637961293850851, 0.036509809450518974, 0.2231489095583225, 0.023997240181164285, 0.14499353419050454, -0.03325452335932239, 0.0013721432400549331, 0.0343360032098807, -0.11179782338983453, 0.10802953692183383, 0.2671949450585355, 0.14402598788870907, 0.3137129942121787, -0.4401424215667374, -0.18697323344223868, 0.13620768872097255, 0.0790046320788513, 0.09337170155173759, 0.0027266287233498766, -0.23695250407875917, 0.07754288045159442, -0.22245231432825086, -0.10327434789661954, -0.09624269280944217, 0.006600023610744535, 0.029362487681475053, -0.2949507966395316, 0.026096754332595482, 0.1117287025658217, 0.06541950196596581, -0.019489237365721748, -0.0787990653917678, 0.0014067272659451738, 0.12391445178508274, 0.09308636345904381, -0.03249685404579935, 0.07612411856530159, -0.09692145944232257, -0.19244859231791148, 0.37035166789451995, -0.09735014683974441, -0.18872443420009885, 0.154527504428676, -0.11364422433032859, -0.16947349252148977, 0.07885749176962346, 0.16727376578572561, 0.0688876641035928, -0.19001220417756973, 0.05002859570237437, -0.09921575144947908, 0.19040321039293356, 0.02242485277082135, -0.00558255851359629, 0.1984703117400423, 0.18404912931193423, 0.05572225895096979, 0.16611494563379878, -0.020682743850838, -0.13720353101843938, -0.30079478757622524, -0.13566572144930442, -0.18142086766826793, 0.05905646098611074, -0.1441954354887139, -0.2190965073849491, 0.4059269716130282, 0.19856426793381335, 0.18279330739070002, 0.1171116506854996, 0.2471957883487145, 0.12136948421870536, -0.007609219892268501, 0.13914449070012425, 0.10257141890001438, 0.021566358285130767, 0.10815969123542915, -0.1343544869261559, 0.16758337733525086, 0.04423759668702033]
|
1,803.06654
|
Inelastic scattering of microwave radiation in the dynamical Coulomb
blockade
|
We study scattering of propagating microwave fields by a DC-voltage biased
Josephson junction. At sub-gap voltages, a small Josephson junction works
merely as a non-linear boundary that can absorb, amplify, and diversely convert
propagating microwaves. In the leading-order perturbation theory of the
Josephson coupling energy, the spectral density and quadrature fluctuations of
scattered thermal and coherent radiation can be described in terms of the
well-known $P(E)$ function. Applying this, we study how thermal and coherent
radiation is absorbed and amplified in an Ohmic transmission line and in a
circuit with a resonance frequency. We show when a coherent input can create a
two-mode squeezed output. In addition, we evaluate scattering amplitudes
between arbitrary photon-number (Fock) states, characterizing individual photon
multiplication and absorption processes occuring at the junction.
|
cond-mat.supr-con cond-mat.mes-hall quant-ph
|
we study scattering of propagating microwave fields by a dcvoltage biased josephson junction at subgap voltages a small josephson junction works merely as a nonlinear boundary that can absorb amplify and diversely convert propagating microwaves in the leadingorder perturbation theory of the josephson coupling energy the spectral density and quadrature fluctuations of scattered thermal and coherent radiation can be described in terms of the wellknown pe function applying this we study how thermal and coherent radiation is absorbed and amplified in an ohmic transmission line and in a circuit with a resonance frequency we show when a coherent input can create a twomode squeezed output in addition we evaluate scattering amplitudes between arbitrary photonnumber fock states characterizing individual photon multiplication and absorption processes occuring at the junction
|
[['we', 'study', 'scattering', 'of', 'propagating', 'microwave', 'fields', 'by', 'a', 'dcvoltage', 'biased', 'josephson', 'junction', 'at', 'subgap', 'voltages', 'a', 'small', 'josephson', 'junction', 'works', 'merely', 'as', 'a', 'nonlinear', 'boundary', 'that', 'can', 'absorb', 'amplify', 'and', 'diversely', 'convert', 'propagating', 'microwaves', 'in', 'the', 'leadingorder', 'perturbation', 'theory', 'of', 'the', 'josephson', 'coupling', 'energy', 'the', 'spectral', 'density', 'and', 'quadrature', 'fluctuations', 'of', 'scattered', 'thermal', 'and', 'coherent', 'radiation', 'can', 'be', 'described', 'in', 'terms', 'of', 'the', 'wellknown', 'pe', 'function', 'applying', 'this', 'we', 'study', 'how', 'thermal', 'and', 'coherent', 'radiation', 'is', 'absorbed', 'and', 'amplified', 'in', 'an', 'ohmic', 'transmission', 'line', 'and', 'in', 'a', 'circuit', 'with', 'a', 'resonance', 'frequency', 'we', 'show', 'when', 'a', 'coherent', 'input', 'can', 'create', 'a', 'twomode', 'squeezed', 'output', 'in', 'addition', 'we', 'evaluate', 'scattering', 'amplitudes', 'between', 'arbitrary', 'photonnumber', 'fock', 'states', 'characterizing', 'individual', 'photon', 'multiplication', 'and', 'absorption', 'processes', 'occuring', 'at', 'the', 'junction']]
|
[-0.19504020809687264, 0.24802238103765425, -0.060432991639923626, 0.06127365513000725, -0.02317175179661259, -0.15716851021962489, 0.0375815220003009, 0.39895698024825316, -0.24938573165408034, -0.2576169083334916, -0.029535056034095702, -0.2875088044371425, -0.1017656400139759, 0.2165638700376932, -0.002997146175044963, 0.014285429762163031, 0.016217746903870518, -0.03823064197236159, 0.007940696804476241, -0.11535253236253606, 0.31515679416415376, 0.027737629860199578, 0.31487470241190174, 0.05513139569207909, 0.08717869751441373, 0.01687563071944054, 0.02453462167562345, 0.01609939048946725, -0.06559369883778016, 0.05702735946145217, 0.2745164549784867, -0.017144485542690015, 0.18347050048324726, -0.4860684713422079, -0.2248877197372045, 0.08673827218141143, 0.17401598278120506, 0.17176585912880465, 0.016457077284438872, -0.2768745064500749, -0.012975883748067, -0.1607365597948784, -0.10100629695097176, -0.05926598083799866, -0.029598866102623012, 0.02150927583309345, -0.2818655000713573, 0.07092204764045364, 0.02614625067336441, -0.004669787435550389, 0.010524583188450242, -0.016590722468516634, -0.05914711702329026, 0.04440787020822305, -0.062433884627603756, -0.009005580313767738, 0.21102991154578726, -0.1718609315103381, -0.10471108328829717, 0.2569886489393644, -0.1421317065420641, -0.14680227222137418, 0.10286591353818891, -0.16915443773733407, 0.001753676852292022, 0.16038837031585965, 0.16082131569310437, 0.08569999856830347, -0.14553751254705877, 0.06970312556589442, 0.027832698934953513, 0.18976518550271712, 0.19055072260345882, 0.11087546660748171, 0.24004942029494586, 0.12716614239387156, 0.008972255945733683, 0.2083159799171487, -0.12347700916882422, -0.011413210233871452, -0.33313212904796796, -0.09327242047503942, -0.1888824939639784, 0.13643158587634446, -0.05575931386017941, -0.20131974564645233, 0.4190005388360207, 0.1587402157038157, 0.15970065557273236, -0.024194755529119507, 0.3773736790057242, 0.2524188161987122, 0.02431175424754033, 0.052048302662451605, 0.24486060814535993, 0.22444710509088917, 0.0842474960826528, -0.29409127720946987, -0.0180161499645649, -0.056549340517692795]
|
1,803.06655
|
Ratio-Preserving Half-Cylindrical Warps for Natural Image Stitching
|
A novel warp for natural image stitching is proposed that utilizes the
property of cylindrical warp and a horizontal pixel selection strategy. The
proposed ratio-preserving half-cylindrical warp is a combination of homography
and cylindrical warps which guarantees alignment by homography and possesses
less projective distortion by cylindrical warp. Unlike previous approaches
applying cylindrical warp before homography, we use partition lines to divide
the image into different parts and apply homography in the overlapping region
while a composition of homography and cylindrical warps in the non-overlapping
region. The pixel selection strategy then samples the points in horizontal and
reconstructs the image via interpolation to further reduce horizontal
distortion by maintaining the ratio as similarity. With applying
half-cylindrical warp and horizontal pixel selection, the projective distortion
in vertical and horizontal is mitigated simultaneously. Experiments show that
our warp is efficient and produces a more natural-looking stitched result than
previous methods.
|
cs.CV
|
a novel warp for natural image stitching is proposed that utilizes the property of cylindrical warp and a horizontal pixel selection strategy the proposed ratiopreserving halfcylindrical warp is a combination of homography and cylindrical warps which guarantees alignment by homography and possesses less projective distortion by cylindrical warp unlike previous approaches applying cylindrical warp before homography we use partition lines to divide the image into different parts and apply homography in the overlapping region while a composition of homography and cylindrical warps in the nonoverlapping region the pixel selection strategy then samples the points in horizontal and reconstructs the image via interpolation to further reduce horizontal distortion by maintaining the ratio as similarity with applying halfcylindrical warp and horizontal pixel selection the projective distortion in vertical and horizontal is mitigated simultaneously experiments show that our warp is efficient and produces a more naturallooking stitched result than previous methods
|
[['a', 'novel', 'warp', 'for', 'natural', 'image', 'stitching', 'is', 'proposed', 'that', 'utilizes', 'the', 'property', 'of', 'cylindrical', 'warp', 'and', 'a', 'horizontal', 'pixel', 'selection', 'strategy', 'the', 'proposed', 'ratiopreserving', 'halfcylindrical', 'warp', 'is', 'a', 'combination', 'of', 'homography', 'and', 'cylindrical', 'warps', 'which', 'guarantees', 'alignment', 'by', 'homography', 'and', 'possesses', 'less', 'projective', 'distortion', 'by', 'cylindrical', 'warp', 'unlike', 'previous', 'approaches', 'applying', 'cylindrical', 'warp', 'before', 'homography', 'we', 'use', 'partition', 'lines', 'to', 'divide', 'the', 'image', 'into', 'different', 'parts', 'and', 'apply', 'homography', 'in', 'the', 'overlapping', 'region', 'while', 'a', 'composition', 'of', 'homography', 'and', 'cylindrical', 'warps', 'in', 'the', 'nonoverlapping', 'region', 'the', 'pixel', 'selection', 'strategy', 'then', 'samples', 'the', 'points', 'in', 'horizontal', 'and', 'reconstructs', 'the', 'image', 'via', 'interpolation', 'to', 'further', 'reduce', 'horizontal', 'distortion', 'by', 'maintaining', 'the', 'ratio', 'as', 'similarity', 'with', 'applying', 'halfcylindrical', 'warp', 'and', 'horizontal', 'pixel', 'selection', 'the', 'projective', 'distortion', 'in', 'vertical', 'and', 'horizontal', 'is', 'mitigated', 'simultaneously', 'experiments', 'show', 'that', 'our', 'warp', 'is', 'efficient', 'and', 'produces', 'a', 'more', 'naturallooking', 'stitched', 'result', 'than', 'previous', 'methods']]
|
[-0.0959041398399959, -0.010015906019393226, -0.07492740001400996, 0.017222217621345973, -0.1052525990401748, -0.1319099075353608, 0.0169409089368479, 0.4835666592008081, -0.2531142425948176, -0.29546145163155324, 0.09054832992240272, -0.2051961473381982, -0.15495430805704333, 0.13993770031836525, -0.13600606278331692, 0.055083630269329095, 0.0557266254090415, -0.06143440298479179, -0.10334385540015224, -0.2160183175210038, 0.3281707992134937, 0.047718233605525615, 0.33214224711831275, -0.06919595152300237, 0.12365225360624428, 0.012401515023847079, -0.07960649120846185, 0.06433965146656004, -0.06151825453943557, 0.10506082743342067, 0.18653538996546432, 0.13397792839477288, 0.23770161383496277, -0.3957311217384092, -0.20836421085585807, 0.03559745279750947, 0.20423768269347733, 0.07610829264519672, -0.07570034467087304, -0.29083902337427797, 0.0915709466512861, -0.056478606544009505, -0.057788252441919055, -0.04007259919789845, -0.013209904327282104, -0.026211013844445477, -0.30191360600934974, 0.0647235008968233, 0.09849473195800815, 0.04267769935701428, -0.04709938590832312, -0.10117265175835326, -0.04820418888863561, 0.11684581920633029, 0.04146909743230308, 0.11934843885166378, 0.17456475325442594, -0.11769108748352476, -0.05973515842704038, 0.37171988532204053, -0.044195919161650415, -0.2729098839621092, 0.13614525950738582, -0.09363141478328356, -0.04381502996487864, 0.19953385248523334, 0.1810684246492797, 0.10273867261963335, -0.1030612524374035, 0.053083237717811274, -0.03324375482083394, 0.1604032185057114, 0.15341077523209667, -0.060706809196813864, 0.20240519495102866, 0.1527283611964306, 0.1391989876548278, 0.20894741985408974, -0.21908941061460765, -0.04531597787963933, -0.26783278515755105, -0.11235731116913517, -0.14150199992823062, -0.06653210824227025, -0.1771245975102547, -0.1605183712495812, 0.3942846588019667, 0.10190824307501316, 0.2920960196326005, 0.0375406682884706, 0.4130914945026924, 0.007028259540073059, 0.17096689558178507, 0.06793115105608415, 0.22241516931239388, 0.06053754486111475, 0.044847837361860377, -0.20111600786511755, 0.026679318618222043, 0.11066782243292907]
|
1,803.06656
|
Optical Property Study of Charge Compensated (Si, Na) Co-doped ZnO
|
ZnO is co-doped with Na+ and Si4+ in the ratio 2:1. The ratio was
intentionally chosen so that net valence state of dopant theoretically matches
that of host. This is to avoid dependence in the amount of oxygen
vacancies/interstitials arising out of cationic valence state of the dopant.
With such a combination, modifications in structural and optical properties do
not depend on excess or deficit of the dopant charge state. For lower doping,
Na+ ions behave as interstitial sites which enhance strain, lattice disorder
and thereby creating defects. Formation of interstitial defects leads to
reduction in bandgap energy and produce orange-red luminescence. For higher
doping, Na+ starts substituting at Zn2+ site which helps in reducing strain and
lattice disorder and thereby increases bandgap. Inspite of presence of Si4+
with higher charge, there is a gradual increase in oxygen vacancies due to
lattice disorder.
|
cond-mat.mtrl-sci
|
zno is codoped with na and si4 in the ratio 21 the ratio was intentionally chosen so that net valence state of dopant theoretically matches that of host this is to avoid dependence in the amount of oxygen vacanciesinterstitials arising out of cationic valence state of the dopant with such a combination modifications in structural and optical properties do not depend on excess or deficit of the dopant charge state for lower doping na ions behave as interstitial sites which enhance strain lattice disorder and thereby creating defects formation of interstitial defects leads to reduction in bandgap energy and produce orangered luminescence for higher doping na starts substituting at zn2 site which helps in reducing strain and lattice disorder and thereby increases bandgap inspite of presence of si4 with higher charge there is a gradual increase in oxygen vacancies due to lattice disorder
|
[['zno', 'is', 'codoped', 'with', 'na', 'and', 'si4', 'in', 'the', 'ratio', '21', 'the', 'ratio', 'was', 'intentionally', 'chosen', 'so', 'that', 'net', 'valence', 'state', 'of', 'dopant', 'theoretically', 'matches', 'that', 'of', 'host', 'this', 'is', 'to', 'avoid', 'dependence', 'in', 'the', 'amount', 'of', 'oxygen', 'vacanciesinterstitials', 'arising', 'out', 'of', 'cationic', 'valence', 'state', 'of', 'the', 'dopant', 'with', 'such', 'a', 'combination', 'modifications', 'in', 'structural', 'and', 'optical', 'properties', 'do', 'not', 'depend', 'on', 'excess', 'or', 'deficit', 'of', 'the', 'dopant', 'charge', 'state', 'for', 'lower', 'doping', 'na', 'ions', 'behave', 'as', 'interstitial', 'sites', 'which', 'enhance', 'strain', 'lattice', 'disorder', 'and', 'thereby', 'creating', 'defects', 'formation', 'of', 'interstitial', 'defects', 'leads', 'to', 'reduction', 'in', 'bandgap', 'energy', 'and', 'produce', 'orangered', 'luminescence', 'for', 'higher', 'doping', 'na', 'starts', 'substituting', 'at', 'zn2', 'site', 'which', 'helps', 'in', 'reducing', 'strain', 'and', 'lattice', 'disorder', 'and', 'thereby', 'increases', 'bandgap', 'inspite', 'of', 'presence', 'of', 'si4', 'with', 'higher', 'charge', 'there', 'is', 'a', 'gradual', 'increase', 'in', 'oxygen', 'vacancies', 'due', 'to', 'lattice', 'disorder']]
|
[-0.06622324536700444, 0.23994852001385264, 0.06408669685774392, -0.005045668013774278, 0.034156131676175226, -0.16928450470383632, 0.17373496028807828, 0.43295495491474867, -0.21655997380771688, -0.32477770531943567, -0.04085693522651588, -0.3853155442408588, -0.07232528277771207, 0.038089670659810254, -0.036268088451757184, -0.07408437932657838, -0.023860276796409046, -0.07104146387755976, -0.09197044079716672, -0.2567307732271319, 0.2469961105937689, 0.1283876050958856, 0.35035768073235807, 0.15661825479047609, -0.018922704209665388, 0.011469824923346686, 0.0934071294523933, 0.04620076542798902, -0.09728218546404888, 0.07838315057351408, 0.23317904603457681, -0.059866115283614525, 0.20656607606191832, -0.4646787514687109, -0.21268088593062434, 0.03988349332120007, 0.15315385335752196, 0.2053056767548133, -0.11219558966162443, -0.21661314395630182, 0.07597457060182933, -0.10499608080545572, -0.13537856713400556, -0.03965350334052141, 0.021992237044786905, 0.030580414918211982, -0.2589709346221996, 0.1459924027907439, 0.06249084307412079, 0.10888062673292949, -0.14211273802654215, -0.14766320590467624, -0.17769433627180545, 0.04406598968346092, 0.0507071452087421, 0.0506106993285152, 0.23549469196709844, -0.09889510997839954, -0.06481009363000031, 0.38842202308522145, -0.04020536104282758, -0.10012402467455872, 0.16912604635909304, -0.1582222639363338, -0.07432388431908281, 0.2385146448349344, 0.10106502390059997, 0.06087690276015078, -0.06462242570705712, 0.060165283103755504, 0.06476434486144235, 0.23519079806938978, 0.11466816341189641, 0.13467519492907842, 0.20512466148709432, 0.16946831394255843, 0.10986628426438932, 0.11729988548084831, -0.11411851157047327, -0.018679884951037, -0.16254381207801716, -0.20843295515252566, -0.18707414573996367, 0.08413333096879642, -0.1020047967906297, -0.216970449739831, 0.3289497932550353, 0.11636825528612334, 0.1912074747731463, -0.10458087001789466, 0.13087932076747857, 0.07903774875613238, 0.09995865948747476, -0.026623515589293878, 0.22704153412356184, 0.12954613054827066, 0.11440809834486163, -0.32142133436913434, 0.1360985519180835, 0.013691251572798675]
|
1,803.06657
|
Sdf-GAN: Semi-supervised Depth Fusion with Multi-scale Adversarial
Networks
|
Refining raw disparity maps from different algorithms to exploit their
complementary advantages is still challenging. Uncertainty estimation and
complex disparity relationships among pixels limit the accuracy and robustness
of existing methods and there is no standard method for fusion of different
kinds of depth data. In this paper, we introduce a new method to fuse disparity
maps from different sources, while incorporating supplementary information
(intensity, gradient, etc.) into a refiner network to better refine raw
disparity inputs. A discriminator network classifies disparities at different
receptive fields and scales. Assuming a Markov Random Field for the refined
disparity map produces better estimates of the true disparity distribution.
Both fully supervised and semi-supervised versions of the algorithm are
proposed. The approach includes a more robust loss function to inpaint invalid
disparity values and requires much less labeled data to train in the
semi-supervised learning mode. The algorithm can be generalized to fuse depths
from different kinds of depth sources. Experiments explored different fusion
opportunities: stereo-monocular fusion, stereo-ToF fusion and stereo-stereo
fusion. The experiments show the superiority of the proposed algorithm compared
with the most recent algorithms on public synthetic datasets (Scene Flow,
SYNTH3, our synthetic garden dataset) and real datasets (Kitti2015 dataset and
Trimbot2020 Garden dataset).
|
cs.CV
|
refining raw disparity maps from different algorithms to exploit their complementary advantages is still challenging uncertainty estimation and complex disparity relationships among pixels limit the accuracy and robustness of existing methods and there is no standard method for fusion of different kinds of depth data in this paper we introduce a new method to fuse disparity maps from different sources while incorporating supplementary information intensity gradient etc into a refiner network to better refine raw disparity inputs a discriminator network classifies disparities at different receptive fields and scales assuming a markov random field for the refined disparity map produces better estimates of the true disparity distribution both fully supervised and semisupervised versions of the algorithm are proposed the approach includes a more robust loss function to inpaint invalid disparity values and requires much less labeled data to train in the semisupervised learning mode the algorithm can be generalized to fuse depths from different kinds of depth sources experiments explored different fusion opportunities stereomonocular fusion stereotof fusion and stereostereo fusion the experiments show the superiority of the proposed algorithm compared with the most recent algorithms on public synthetic datasets scene flow synth3 our synthetic garden dataset and real datasets kitti2015 dataset and trimbot2020 garden dataset
|
[['refining', 'raw', 'disparity', 'maps', 'from', 'different', 'algorithms', 'to', 'exploit', 'their', 'complementary', 'advantages', 'is', 'still', 'challenging', 'uncertainty', 'estimation', 'and', 'complex', 'disparity', 'relationships', 'among', 'pixels', 'limit', 'the', 'accuracy', 'and', 'robustness', 'of', 'existing', 'methods', 'and', 'there', 'is', 'no', 'standard', 'method', 'for', 'fusion', 'of', 'different', 'kinds', 'of', 'depth', 'data', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'new', 'method', 'to', 'fuse', 'disparity', 'maps', 'from', 'different', 'sources', 'while', 'incorporating', 'supplementary', 'information', 'intensity', 'gradient', 'etc', 'into', 'a', 'refiner', 'network', 'to', 'better', 'refine', 'raw', 'disparity', 'inputs', 'a', 'discriminator', 'network', 'classifies', 'disparities', 'at', 'different', 'receptive', 'fields', 'and', 'scales', 'assuming', 'a', 'markov', 'random', 'field', 'for', 'the', 'refined', 'disparity', 'map', 'produces', 'better', 'estimates', 'of', 'the', 'true', 'disparity', 'distribution', 'both', 'fully', 'supervised', 'and', 'semisupervised', 'versions', 'of', 'the', 'algorithm', 'are', 'proposed', 'the', 'approach', 'includes', 'a', 'more', 'robust', 'loss', 'function', 'to', 'inpaint', 'invalid', 'disparity', 'values', 'and', 'requires', 'much', 'less', 'labeled', 'data', 'to', 'train', 'in', 'the', 'semisupervised', 'learning', 'mode', 'the', 'algorithm', 'can', 'be', 'generalized', 'to', 'fuse', 'depths', 'from', 'different', 'kinds', 'of', 'depth', 'sources', 'experiments', 'explored', 'different', 'fusion', 'opportunities', 'stereomonocular', 'fusion', 'stereotof', 'fusion', 'and', 'stereostereo', 'fusion', 'the', 'experiments', 'show', 'the', 'superiority', 'of', 'the', 'proposed', 'algorithm', 'compared', 'with', 'the', 'most', 'recent', 'algorithms', 'on', 'public', 'synthetic', 'datasets', 'scene', 'flow', 'synth3', 'our', 'synthetic', 'garden', 'dataset', 'and', 'real', 'datasets', 'kitti2015', 'dataset', 'and', 'trimbot2020', 'garden', 'dataset']]
|
[-0.0006438120239181444, 0.020416563460894394, -0.07623184712370858, 0.09712631834438071, -0.08344684018753469, -0.15739007361233234, 0.019708719216869213, 0.4631176399963442, -0.2907215900375741, -0.3436368359695189, 0.05999805464292876, -0.29388253905810413, -0.1438959783129394, 0.2106883745524101, -0.14497407315997407, 0.09167048136478115, 0.1571856735867914, 0.00688479034928605, -0.061193467675475406, -0.28270579111762345, 0.30340938360197467, 0.045523254911531696, 0.390252282887086, 0.00429396731313318, 0.15073416168452242, -0.028596903521101922, -0.08481147223850712, 0.020241456789663062, -0.05197297582868487, 0.17962000266561517, 0.2653835837449878, 0.2037934297719039, 0.26706902295351026, -0.3897309904894792, -0.25252001777873373, 0.11435557526303455, 0.12125584245281061, 0.10790120118195773, -0.01963660052722844, -0.35061370552983134, 0.07500855192076415, -0.1297384756617248, 0.045689759493106975, -0.1309947335603647, -0.010870042866445146, -0.005487672926683444, -0.34821197704877704, 0.07798394448473119, 0.028554029693477787, 0.09036401179619133, -0.05692008662386797, -0.15959471987123833, -0.004838164075044915, 0.2040782051673159, 0.022985277988482267, 0.0412082615372492, 0.12668626961589324, -0.18089834843063726, -0.11351292832288891, 0.32050770172383636, -0.05720629423623905, -0.1780468329694122, 0.21160279701696708, -0.045337620934005826, -0.13166010247485246, 0.12549272504402326, 0.2323351801748504, 0.11095545957796275, -0.1327782223629765, -0.014810573284339625, -0.04493323484668508, 0.16960276424884796, 0.04399593222013209, -0.004907795040053315, 0.16635287962388248, 0.21376698733773083, 0.04908084811642766, 0.1466854320274433, -0.1795710981672164, -0.08592706185765564, -0.20766958767548205, -0.07008040916756726, -0.17192632042613695, -0.06947573941200971, -0.14761091682994448, -0.10242413555562963, 0.39809204526711256, 0.2754817072208971, 0.23247638539643958, 0.10873809048905969, 0.382437572106719, 0.000831585168489255, 0.11821411901037208, 0.08228622380178421, 0.1702488830848597, 0.062721446872456, 0.11411936907912605, -0.13710293706913945, 0.05139691470831167, 0.05605552870896645]
|
1,803.06658
|
Temperature dependent dynamics in water-ethanol liquid mixtures
|
Temperature dependent hydrogen bond energetics and dynamical features, such
as the diffusion coefficient and reorientational times, have been determined
for ethanol-water mixtures with 10, 20 and 30 mol % of ethanol. Concerning
pairwise interaction energies between molecules, it is found that water-water
interactions become stronger, while ethanol-ethanol ones become significantly
weaker in the mixtures than the corresponding values characteristic to the pure
substances. Concerning the diffusion processes, for all concentrations the
activation barrier of water and ethanol molecule become very similar to each
other. Reorientation motions of water and ethanol become slower as ethanol
concentration is increasing. Characteristic reorientational times of water in
the mixtures are substantially longer than these values in the pure substance.
On the other hand, this change for ethanol is only moderate. The reorientation
motions of water (especially the ones related to the H-bonded interaction)
become very similar for those of ethanol in the mixtures.
|
physics.chem-ph cond-mat.soft
|
temperature dependent hydrogen bond energetics and dynamical features such as the diffusion coefficient and reorientational times have been determined for ethanolwater mixtures with 10 20 and 30 mol of ethanol concerning pairwise interaction energies between molecules it is found that waterwater interactions become stronger while ethanolethanol ones become significantly weaker in the mixtures than the corresponding values characteristic to the pure substances concerning the diffusion processes for all concentrations the activation barrier of water and ethanol molecule become very similar to each other reorientation motions of water and ethanol become slower as ethanol concentration is increasing characteristic reorientational times of water in the mixtures are substantially longer than these values in the pure substance on the other hand this change for ethanol is only moderate the reorientation motions of water especially the ones related to the hbonded interaction become very similar for those of ethanol in the mixtures
|
[['temperature', 'dependent', 'hydrogen', 'bond', 'energetics', 'and', 'dynamical', 'features', 'such', 'as', 'the', 'diffusion', 'coefficient', 'and', 'reorientational', 'times', 'have', 'been', 'determined', 'for', 'ethanolwater', 'mixtures', 'with', '10', '20', 'and', '30', 'mol', 'of', 'ethanol', 'concerning', 'pairwise', 'interaction', 'energies', 'between', 'molecules', 'it', 'is', 'found', 'that', 'waterwater', 'interactions', 'become', 'stronger', 'while', 'ethanolethanol', 'ones', 'become', 'significantly', 'weaker', 'in', 'the', 'mixtures', 'than', 'the', 'corresponding', 'values', 'characteristic', 'to', 'the', 'pure', 'substances', 'concerning', 'the', 'diffusion', 'processes', 'for', 'all', 'concentrations', 'the', 'activation', 'barrier', 'of', 'water', 'and', 'ethanol', 'molecule', 'become', 'very', 'similar', 'to', 'each', 'other', 'reorientation', 'motions', 'of', 'water', 'and', 'ethanol', 'become', 'slower', 'as', 'ethanol', 'concentration', 'is', 'increasing', 'characteristic', 'reorientational', 'times', 'of', 'water', 'in', 'the', 'mixtures', 'are', 'substantially', 'longer', 'than', 'these', 'values', 'in', 'the', 'pure', 'substance', 'on', 'the', 'other', 'hand', 'this', 'change', 'for', 'ethanol', 'is', 'only', 'moderate', 'the', 'reorientation', 'motions', 'of', 'water', 'especially', 'the', 'ones', 'related', 'to', 'the', 'hbonded', 'interaction', 'become', 'very', 'similar', 'for', 'those', 'of', 'ethanol', 'in', 'the', 'mixtures']]
|
[-0.05838262662608303, 0.22527190929731722, -0.015797087626902347, 0.040035517007226545, 0.03591773610207297, -0.16561491712436816, 0.015940103857290177, 0.39094552440809555, -0.22395285434678805, -0.2822958059406199, 0.08835011594184376, -0.3175158984832415, -0.049286471027247356, 0.16161216045713978, 0.06448907498587049, -0.020195411956753444, 0.008180845303929785, 0.0029116322866127808, -0.03149331485073329, -0.2047483397221674, 0.20191872838352407, 0.06980339368349131, 0.27029354969153596, 0.11697876218034803, 0.05534032072719871, -0.04589778443697055, 0.029179062748163127, 0.004316985261860956, -0.11563104983969777, 0.09753450507703586, 0.24680734968183524, -0.03655101279854825, 0.2035329929488825, -0.45392444655045766, -0.26585599166170065, 0.11126258491924933, 0.0944391669211339, 0.14891396515977373, -0.01002964791182514, -0.23205271130744495, -0.0012485936068657305, -0.15022338594810491, -0.11410351280066768, -0.037216892564149735, 0.10606892798159297, 0.07050883825068507, -0.22155580456767762, 0.18050539193256776, 0.04463332822307989, 0.0945615915258472, -0.13608695582493024, -0.24842032538505182, -0.08057138645628682, 0.08624995409370065, 0.11029896059003817, 0.005705528335050255, 0.246366343099852, -0.15218894493641003, 0.013909122992946835, 0.427000861260153, -0.08830726353572776, -0.15744466679610256, 0.3336546282081225, -0.17119079653401764, -0.13159880635081506, 0.2544224052911713, 0.1021834700526733, 0.1309790209182823, -0.15103713359816798, -0.06671712646572882, 0.018679182748405302, 0.20032748015483423, 0.17648134861128772, 0.018918531590464468, 0.1718069739722121, 0.1651057977495449, 0.053347459099363205, 0.10495832854910392, -0.09137524875216693, -0.14171187624930828, -0.11365188854084458, -0.2264303866944903, -0.13185543044973924, 0.03346806986346131, -0.10685495367980198, -0.12867302926919316, 0.3090579092698995, 0.09022203678277885, 0.16214918636469025, 0.04848861351583888, 0.1919910974395113, 0.049721281422732945, 0.07838488963819078, 0.02238079744904321, 0.2619494271914468, 0.1357593663847771, 0.12777039439569474, -0.2317708426370558, 0.20010322799310595, -0.003291793351321399]
|
1,803.06659
|
New characterizations of operator monotone functions
|
If $\sigma$ is a symmetric mean and $f$ is an operator monotone function on
$[0, \infty)$, then $$f(2(A^{-1}+B^{-1})^{-1})\le f(A\sigma B)\le f((A+B)/2).$$
Conversely, Ando and Hiai showed that if $f$ is a function that satisfies
either one of these inequalities for all positive operators $A$ and $B$ and a
symmetric mean different than the arithmetic and the harmonic mean, then the
function is operator monotone.
In this paper, we show that the arithmetic and the harmonic means can be
replaced by the geometric mean to obtain similar characterizations. Moreover,
we give characterizations of operator monotone functions using self-adjoint
means and general means subject to a constraint due to Kubo and Ando.
|
math.FA math.OA
|
if sigma is a symmetric mean and f is an operator monotone function on 0 infty then f2a1b11le fasigma ble fab2 conversely ando and hiai showed that if f is a function that satisfies either one of these inequalities for all positive operators a and b and a symmetric mean different than the arithmetic and the harmonic mean then the function is operator monotone in this paper we show that the arithmetic and the harmonic means can be replaced by the geometric mean to obtain similar characterizations moreover we give characterizations of operator monotone functions using selfadjoint means and general means subject to a constraint due to kubo and ando
|
[['if', 'sigma', 'is', 'a', 'symmetric', 'mean', 'and', 'f', 'is', 'an', 'operator', 'monotone', 'function', 'on', '0', 'infty', 'then', 'f2a1b11le', 'fasigma', 'ble', 'fab2', 'conversely', 'ando', 'and', 'hiai', 'showed', 'that', 'if', 'f', 'is', 'a', 'function', 'that', 'satisfies', 'either', 'one', 'of', 'these', 'inequalities', 'for', 'all', 'positive', 'operators', 'a', 'and', 'b', 'and', 'a', 'symmetric', 'mean', 'different', 'than', 'the', 'arithmetic', 'and', 'the', 'harmonic', 'mean', 'then', 'the', 'function', 'is', 'operator', 'monotone', 'in', 'this', 'paper', 'we', 'show', 'that', 'the', 'arithmetic', 'and', 'the', 'harmonic', 'means', 'can', 'be', 'replaced', 'by', 'the', 'geometric', 'mean', 'to', 'obtain', 'similar', 'characterizations', 'moreover', 'we', 'give', 'characterizations', 'of', 'operator', 'monotone', 'functions', 'using', 'selfadjoint', 'means', 'and', 'general', 'means', 'subject', 'to', 'a', 'constraint', 'due', 'to', 'kubo', 'and', 'ando']]
|
[-0.08796692484414213, 0.12328652098079138, -0.08596184304871848, 0.0849962713986757, -0.05640391524332776, -0.16271712103963037, 0.01569527335721721, 0.3571891280774584, -0.30595219246694977, -0.18840270764499067, 0.10756973543957259, -0.32009761867539904, -0.1964815866689537, 0.19211717192779912, -0.09222178980185886, 0.0520341789793815, 0.010409225213611237, 0.08665967718741605, -0.12578984942922594, -0.22809517763938023, 0.34472513341597305, -0.04673654119109857, 0.1553952926552254, 0.10925765313473573, 0.11631520355346604, 0.029161616620198588, -0.006246658551254284, 0.052742424220821565, -0.16846332658471477, 0.09498307028367559, 0.1845202453491043, 0.12631809810246122, 0.3045984353765706, -0.3807777496159216, -0.1457016649917116, 0.20234191333265783, 0.10813097937345922, -0.008948278413197704, -0.01865227071668465, -0.24503198417478075, 0.13397920168239938, -0.12465860238559892, -0.1207374215744018, -0.08563527125412616, 0.07101720516247867, 0.06924406473011335, -0.3818462279616533, 0.0719071530876246, 0.11780782916069588, 0.08941408722970426, -0.06607616954335124, -0.1179241526982895, -0.030520621417351415, 0.047562186205846686, -0.002681541796251435, 0.10529957779913827, 0.0729823452028855, -0.04089773762057248, -0.062152584418480365, 0.31530293951977356, -0.10363694761564768, -0.29437586858381176, 0.1095172764176381, -0.16899016484287438, -0.09481287399463564, 0.0221899182352925, 0.08156709164537698, 0.16767143798017195, -0.11151274293661118, 0.15306597584031661, -0.08853701965134834, 0.14303349551013628, 0.09904440086787548, 0.027042385450211814, 0.10010134807796539, 0.006635316943523483, 0.15963181962964135, 0.15861616033743023, 0.03310701821791443, -0.03699476300590785, -0.3252592358181131, -0.17968532530140463, -0.18517991024935532, 0.11906639036774705, -0.08337298767188582, -0.16884080854148786, 0.38751900620828167, 0.054707690224782606, 0.15680984520814686, 0.1496189112065656, 0.2426018520980795, 0.22910207256709583, 0.03616645012897326, 0.08067666099485114, 0.16670674172656558, 0.19866382751927197, 0.020010899221437558, -0.15142791504562597, 0.039776894072436286, 0.13339051662587395]
|
1,803.0666
|
Temperature dependent network stability in simple alcohols and pure
water: the evolution of Laplace spectra
|
A number of computer-generated models of water, methanol and ethanol are
considered at room temperature and ambient pressure, and also as a function of
temperature (for water and ethanol), and the potential model (for water only).
The Laplace matrices are determined, and various characteristics of this, such
as eigenvalues and eigenvectors, and the corresponding Laplace spectra are
calculated. It is revealed how the width of the spectral gap in the Laplace
matrix of H-bonded networks may be applied for characterising the stability of
the network. A novel method for detecting the presence percolated network in
these systems is also introduced.
|
physics.chem-ph
|
a number of computergenerated models of water methanol and ethanol are considered at room temperature and ambient pressure and also as a function of temperature for water and ethanol and the potential model for water only the laplace matrices are determined and various characteristics of this such as eigenvalues and eigenvectors and the corresponding laplace spectra are calculated it is revealed how the width of the spectral gap in the laplace matrix of hbonded networks may be applied for characterising the stability of the network a novel method for detecting the presence percolated network in these systems is also introduced
|
[['a', 'number', 'of', 'computergenerated', 'models', 'of', 'water', 'methanol', 'and', 'ethanol', 'are', 'considered', 'at', 'room', 'temperature', 'and', 'ambient', 'pressure', 'and', 'also', 'as', 'a', 'function', 'of', 'temperature', 'for', 'water', 'and', 'ethanol', 'and', 'the', 'potential', 'model', 'for', 'water', 'only', 'the', 'laplace', 'matrices', 'are', 'determined', 'and', 'various', 'characteristics', 'of', 'this', 'such', 'as', 'eigenvalues', 'and', 'eigenvectors', 'and', 'the', 'corresponding', 'laplace', 'spectra', 'are', 'calculated', 'it', 'is', 'revealed', 'how', 'the', 'width', 'of', 'the', 'spectral', 'gap', 'in', 'the', 'laplace', 'matrix', 'of', 'hbonded', 'networks', 'may', 'be', 'applied', 'for', 'characterising', 'the', 'stability', 'of', 'the', 'network', 'a', 'novel', 'method', 'for', 'detecting', 'the', 'presence', 'percolated', 'network', 'in', 'these', 'systems', 'is', 'also', 'introduced']]
|
[-0.07801481062546373, 0.11020951442420483, -0.048807820710353556, 0.03821497193654068, 0.013848690860904754, -0.10652309047523886, 0.03578784970566631, 0.39458326127380133, -0.2590142189338803, -0.2990604521194473, 0.14380437711952254, -0.2692286439612508, -0.16421668857801705, 0.17933409388875587, 0.014834553175605834, 0.08226322997827083, 0.015403635338880122, 0.029731567008420823, -0.05555797502864152, -0.17541049468331038, 0.3104959254898131, 0.05074861035682261, 0.2507577853812836, 0.13905047569191084, 0.07049000672064722, -0.06648762054741382, -0.002163857873529196, 0.029974678850267084, -0.08661247328855097, 0.10386199535103514, 0.24315546135581825, 0.0725921726739034, 0.21803488232195378, -0.397182515822351, -0.25839616486802697, 0.11128351636230946, 0.08692638790933416, 0.08948426176328211, -0.030060106674209237, -0.28944371480494735, 0.09930842938367278, -0.13882967432029544, -0.14279400995001196, -0.08232122166780755, 0.017707347813993694, 0.054899863405153154, -0.25158233058173207, 0.10337683923018631, 0.022553896440658718, 0.05315823832526803, -0.09725157948676497, -0.20074951714836062, -0.08219966155127623, 0.13375355347059667, 0.015263630732661113, -0.06322172588203102, 0.16030196730047463, -0.12783645541174338, -0.030692374943755568, 0.39090899713337424, -0.07448469107039273, -0.18503962007671362, 0.19266169377602638, -0.1051549479784444, -0.10355835699941963, 0.15106644543353467, 0.1702917208755389, 0.12552210787078366, -0.16875308049842716, 0.024826285215094685, -0.02053913694806397, 0.14941873926436527, 0.11097508787643165, 0.022173674162477255, 0.20144753533415496, 0.16832324310205876, 0.04743705002591014, 0.15254232380422764, -0.12857617858215234, -0.05171464543789625, -0.2250861707702279, -0.19974088196177037, -0.22983672672882677, -0.010664742523804307, -0.11618832147563808, -0.1823429666645825, 0.4222465488966554, 0.08903392714099027, 0.18754072081297635, 0.0570197789161466, 0.24377510234946384, 0.13203325181035325, 0.04487589549156837, 0.055069030150771144, 0.2005913787148893, 0.1688774479390122, 0.1393076227977872, -0.23372444634791464, 0.09428172369953244, 0.03328339044936001]
|
1,803.06661
|
New Approach To Fixed Point Theorems
|
In this article, we discuss a new version of metric fixed point theory
especially of Banach Contraction Principle, Ran-Reurings Theorem and others.
|
math.FA
|
in this article we discuss a new version of metric fixed point theory especially of banach contraction principle ranreurings theorem and others
|
[['in', 'this', 'article', 'we', 'discuss', 'a', 'new', 'version', 'of', 'metric', 'fixed', 'point', 'theory', 'especially', 'of', 'banach', 'contraction', 'principle', 'ranreurings', 'theorem', 'and', 'others']]
|
[-0.12977194695056163, 0.0871980831937187, -0.15897317125927657, 0.12081237972862172, -0.0778868559282273, -0.12987707248380917, 0.1341779163604687, 0.3169534752484072, -0.3276130157438191, -0.1552154413763095, 0.11421575007261708, -0.22375614395026455, -0.22701270200989462, 0.16459587089378724, -0.20433720815080134, -0.008533378385684708, 0.08524288372559981, 0.024848019302060657, -0.11625432650643316, -0.21331259057941762, 0.4138073592912406, 0.035325235771861946, 0.24010080844163895, 0.10862133372575045, 0.11717627324502576, 0.10791896042329344, -0.08147642524404959, 0.06534364938058636, -0.17725467643785206, 0.1690300004556775, 0.26291902329434047, 0.13676286209374666, 0.3369893275878646, -0.335505412383513, -0.16594731409780003, 0.16874470756473867, 0.012943077832460403, 0.09139804838394577, -0.07802180365913293, -0.2695241448977454, 0.09074183320626616, -0.19443190622736106, -0.24489567551724825, -0.08106141427362507, -0.023735675516284326, -0.026118901050226254, -0.20240596618334, 0.048650302860716525, 0.19226333003660495, 0.10583605380220847, -0.0761215840042992, -0.06277731742540543, 0.06496025774289262, -0.005693806187165054, 0.04319514039988545, 0.09872428797693415, 0.09676652111705732, -0.04100192709698935, -0.13975207670591772, 0.3494080840186639, -0.06265404384413903, -0.15417887609113345, 0.14045202190225775, -0.1246940850872885, -0.2567512660541318, -0.045377066866918045, 0.16047952601432122, 0.18164022660560228, -0.15664686495438218, 0.19236708965565247, -0.07768026688559489, 0.06369765806249977, 0.11214215139096434, 0.06164617218415846, 0.1267065252653662, 0.11411320447752421, 0.14408351351845672, 0.13034199593080717, 0.011049437590620735, -0.14590811179104177, -0.392665180970322, -0.2050106076692993, -0.13494771349624815, 0.10903270017694343, -0.1727522540280585, -0.1627900768071413, 0.3120275773954662, 0.1503129644869742, 0.1136220740577714, 0.09585067988320423, 0.17784354895014653, 0.11439853059974583, -0.044552322434769434, 0.03688081921162931, 0.21216788735579362, 0.20640540360049767, 0.10098797652277756, -0.03501142282038927, -0.09352070262486284, 0.25571577924049715]
|
1,803.06662
|
Fixed Point Theorems In Ordered Partial b-Metric Spaces With New Setting
|
The main purpose of this paper is to find the fixed point in such cases where
existing literature remain silent. In this paper we introduce partial
completeness, a new type of contraction and many other definitions. Using this
approach the existence of fixed point can be proved in incomplete metric spaces
with non-contraction map on it. We have reported an example in support our
result.
|
math.FA
|
the main purpose of this paper is to find the fixed point in such cases where existing literature remain silent in this paper we introduce partial completeness a new type of contraction and many other definitions using this approach the existence of fixed point can be proved in incomplete metric spaces with noncontraction map on it we have reported an example in support our result
|
[['the', 'main', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'find', 'the', 'fixed', 'point', 'in', 'such', 'cases', 'where', 'existing', 'literature', 'remain', 'silent', 'in', 'this', 'paper', 'we', 'introduce', 'partial', 'completeness', 'a', 'new', 'type', 'of', 'contraction', 'and', 'many', 'other', 'definitions', 'using', 'this', 'approach', 'the', 'existence', 'of', 'fixed', 'point', 'can', 'be', 'proved', 'in', 'incomplete', 'metric', 'spaces', 'with', 'noncontraction', 'map', 'on', 'it', 'we', 'have', 'reported', 'an', 'example', 'in', 'support', 'our', 'result']]
|
[-0.09190783497805778, 0.028798721729141948, -0.07188210169283243, 0.04041214942430647, -0.056376077148776786, -0.07743968092478239, 0.05373220473456268, 0.37953695686390765, -0.2836645749397576, -0.25482213568802065, 0.14414496075612707, -0.2468084687510362, -0.20988608349401217, 0.19073062266867893, -0.13648899315784757, 0.026090686008907283, 0.03915943284160816, 0.05012866361783101, -0.05164290882933598, -0.26832662730191187, 0.40987717921917255, -0.014650551444635942, 0.23837151647760318, 0.05161537960028419, 0.05644028009846806, -0.0026403148300372637, -0.05835235846013977, 0.040877478195621875, -0.14402621154171916, 0.10931090040920445, 0.283166673933514, 0.15035626012115524, 0.28381395827119166, -0.36469971305475785, -0.2042792225543123, 0.1558439702153779, 0.1280685842753603, 0.13659471715800464, -0.08651380872246452, -0.25660038674966645, 0.14356084763287352, -0.1699200772608702, -0.14333401874352533, -0.07970925636876088, -0.011608061165763782, 0.01892408113926649, -0.2149371401191904, 0.029975776897313504, 0.1318853066374476, 0.06929356299985487, -0.08036545255902008, -0.1081700302230624, 0.0539049516682728, 0.12128348452970386, 0.05850592117684965, 0.07469219983770298, 0.032192566675635484, -0.05747962024134512, -0.1213973598769651, 0.35381177726846474, -0.05337752141058445, -0.22458105376706675, 0.22442486086287178, -0.117405785057837, -0.2141260990872979, 0.04791880793009813, 0.14219215453530734, 0.16494654684972304, -0.15403102361238918, 0.09795426160294132, -0.07754548850397651, 0.12106948389331453, 0.07442377503388203, 0.03309527101138463, 0.15462514633635202, 0.17277993049042728, 0.10620311662787571, 0.15428843879982687, -0.04751501180446492, -0.07199788044403808, -0.35455358939675186, -0.17095100849580305, -0.13528917232671608, 0.05926589441414063, -0.050466827380408245, -0.18137173735751555, 0.33840020826229683, 0.20896174428411401, 0.20986048721063597, 0.0520539863464924, 0.27612486727392443, 0.11655229618951965, 0.009784328736937964, 0.08273234455488049, 0.2437415476100376, 0.05727947491865892, 0.08338465486438229, -0.09353664183559326, 0.047873196535958694, 0.07937459579597299]
|
1,803.06663
|
Direct Measurement of Focusing Fields in Active Plasma Lenses
|
Active plasma lenses have the potential to enable broad-ranging applications
of plasma-based accelerators owing to their compact design and radially
symmetric kT/m-level focusing fields, facilitating beam-quality preservation
and compact beam transport. We report on the direct measurement of magnetic
field gradients in active plasma lenses and demonstrate their impact on the
emittance of a charged particle beam. This is made possible by the use of a
well-characterized electron beam with 1.4 mm mrad normalized emittance from a
conventional accelerator. Field gradients of up to 823 T/m are investigated.
The observed emittance evolution is supported by numerical simulations, which
suggest the potential for conservation of the core beam emittance in such a
plasma lens setup.
|
physics.acc-ph
|
active plasma lenses have the potential to enable broadranging applications of plasmabased accelerators owing to their compact design and radially symmetric ktmlevel focusing fields facilitating beamquality preservation and compact beam transport we report on the direct measurement of magnetic field gradients in active plasma lenses and demonstrate their impact on the emittance of a charged particle beam this is made possible by the use of a wellcharacterized electron beam with 14 mm mrad normalized emittance from a conventional accelerator field gradients of up to 823 tm are investigated the observed emittance evolution is supported by numerical simulations which suggest the potential for conservation of the core beam emittance in such a plasma lens setup
|
[['active', 'plasma', 'lenses', 'have', 'the', 'potential', 'to', 'enable', 'broadranging', 'applications', 'of', 'plasmabased', 'accelerators', 'owing', 'to', 'their', 'compact', 'design', 'and', 'radially', 'symmetric', 'ktmlevel', 'focusing', 'fields', 'facilitating', 'beamquality', 'preservation', 'and', 'compact', 'beam', 'transport', 'we', 'report', 'on', 'the', 'direct', 'measurement', 'of', 'magnetic', 'field', 'gradients', 'in', 'active', 'plasma', 'lenses', 'and', 'demonstrate', 'their', 'impact', 'on', 'the', 'emittance', 'of', 'a', 'charged', 'particle', 'beam', 'this', 'is', 'made', 'possible', 'by', 'the', 'use', 'of', 'a', 'wellcharacterized', 'electron', 'beam', 'with', '14', 'mm', 'mrad', 'normalized', 'emittance', 'from', 'a', 'conventional', 'accelerator', 'field', 'gradients', 'of', 'up', 'to', '823', 'tm', 'are', 'investigated', 'the', 'observed', 'emittance', 'evolution', 'is', 'supported', 'by', 'numerical', 'simulations', 'which', 'suggest', 'the', 'potential', 'for', 'conservation', 'of', 'the', 'core', 'beam', 'emittance', 'in', 'such', 'a', 'plasma', 'lens', 'setup']]
|
[-0.11981851711600751, 0.17311346903023822, -0.04708845286655265, 0.0338530608794761, -0.024960574937296344, -0.10055268833598306, -0.020094108931418206, 0.4605082114738924, -0.19901364519856535, -0.3312777048564172, 0.07794923516753893, -0.24494048738264823, 0.0043890193222208065, 0.2558081592611448, 0.012158753656622794, 0.11047955376708561, 0.03539543160916986, -0.07103105366381036, -0.04797185204874909, -0.1666123020957719, 0.2974752490954088, 0.16218591127376836, 0.29166015757768005, 0.08315581921488047, 0.152816948992712, -0.0010196296540130904, -0.04101433918333134, 0.014590755839169293, -0.11259740565786545, 0.08595606128827811, 0.1685710319712221, 0.059230029983613805, 0.2454122217405621, -0.44927389080728497, -0.23041410197143083, 0.025728476913394156, 0.13391324394038534, 0.0926832869252492, -0.1908878348956539, -0.22752150402379198, 0.06437655158817081, -0.15469181092942622, -0.18840107397461595, -0.02965590227730908, -0.012421973337008207, 0.126859102565963, -0.26623394909138615, 0.04393827028337631, 0.011902745617008223, 0.08734467598421632, -0.024553809235258413, -0.12748903593652555, -0.0048647003021796, 0.011417205938398166, 0.03740671085747513, 0.08611187826724606, 0.22859245762732383, -0.12868834064795157, -0.08959853831208772, 0.38219552201864954, 0.0014163873059809342, -0.1687724118934827, 0.1660762644448393, -0.22173796678045848, 0.007859536203312444, 0.16793963210741142, 0.23859264590433454, 0.10165322029140887, -0.12863119965133904, 0.024756938553108992, 0.04152153125074734, 0.16733538092906913, 0.10963641018774528, 0.024524446065025823, 0.272246033943317, 0.20304504493335346, 0.08469522365805197, 0.12393731276529867, -0.14414218775844118, 0.0011017638534466896, -0.2729010603701075, -0.16855558187507833, -0.12490646290248847, 0.05870769018112516, -0.014642117161546028, -0.14086903139176937, 0.3994834482804075, 0.12284625567462262, 0.11685411093823679, -0.0517975417991496, 0.3242794951373661, 0.04476497780850476, 0.09566817420476058, 0.0404056093009474, 0.3150001012999145, 0.197783717873028, 0.1573505189924224, -0.2575343140791095, -0.04263247093940909, -0.03298680968205067]
|
1,803.06664
|
An Introduction to the Moebius Function
|
This is an introduction to the M\"obius function of a poset. The chief
novelty is in the exposition. We show how order-preserving maps from one poset
to another can be used to relate their M\"obius functions. We derive the basic
results on the M\"obius function, applying them in particular to geometric
lattices.
|
math.CO
|
this is an introduction to the mobius function of a poset the chief novelty is in the exposition we show how orderpreserving maps from one poset to another can be used to relate their mobius functions we derive the basic results on the mobius function applying them in particular to geometric lattices
|
[['this', 'is', 'an', 'introduction', 'to', 'the', 'mobius', 'function', 'of', 'a', 'poset', 'the', 'chief', 'novelty', 'is', 'in', 'the', 'exposition', 'we', 'show', 'how', 'orderpreserving', 'maps', 'from', 'one', 'poset', 'to', 'another', 'can', 'be', 'used', 'to', 'relate', 'their', 'mobius', 'functions', 'we', 'derive', 'the', 'basic', 'results', 'on', 'the', 'mobius', 'function', 'applying', 'them', 'in', 'particular', 'to', 'geometric', 'lattices']]
|
[-0.08370682534475166, 0.06882179962821493, -0.12517869723244354, 0.12056504371978988, -0.15309657622128725, -0.04810341335653972, 0.016292038803490307, 0.4118206872461507, -0.3807535017437588, -0.2004322178231982, 0.08707884267026272, -0.26491595138437474, -0.22275344457907173, 0.18356509453420025, -0.16107244823629466, 0.026670481973829176, -0.020601032964455392, 0.032248720419234954, -0.13573378297643593, -0.29429197742361934, 0.3606384653024949, -0.020202064564308293, 0.24145709408017305, 0.11260601933911228, 0.04537422749966096, 0.03832399018574506, -0.03895571440583668, -0.027706996215364106, -0.18831151170441165, 0.13407857078485763, 0.2057381615651628, 0.12254917570568907, 0.2299719677718643, -0.3900327839387151, -0.08566733512382668, 0.1085114280666368, 0.10638456801489855, 0.10356661052467714, 0.00334558355433938, -0.2531034225741258, 0.08198343982132009, -0.11146089801779734, -0.15198807174769732, -0.0680450562817546, -0.0057848450333739705, 0.04358182294079317, -0.2449393984861672, -0.05068628375346844, 0.08755531459330367, 0.06628805304017778, -0.014041867768145703, -0.10976907840141883, -0.016135032512605764, 0.14592390692828652, 0.016303248837805137, 0.08670059710633583, 0.08621599620136504, -0.05686832272644656, -0.11386100811740527, 0.40682529627632064, -0.05820667218918411, -0.2828004124502723, 0.14907135280708855, -0.1542660113907634, -0.16910293904724172, 0.056468789967206806, 0.1414325938363058, 0.10169142038704684, -0.1112897758049747, 0.0768977005321246, -0.116144424984948, 0.1412224973587749, 0.0749583829086847, -0.014915260199743968, 0.1608588180433099, 0.09825931165743476, 0.09013509497834513, 0.2729294140344092, 0.030683615790621843, -0.04815405630506575, -0.3200344363800608, -0.18166550195131165, -0.19949135986658242, 0.08720427411250196, -0.06357814292781629, -0.18487774347886443, 0.43998616407267177, 0.18922863315898353, 0.20173440164384934, 0.07952099774802963, 0.2455614089535979, 0.1354810805597271, 0.12097838820885115, -0.002734197066344607, 0.13078756222071555, 0.18184294421763086, -0.00452511935817221, -0.15539831972161594, -0.00026136866878145014, 0.18034748408871776]
|
1,803.06665
|
Les exposants de Liapounoff du flot de Teichm\"{u}ller
|
The purpose of the paper under review is to explain the main ideas and the
main ingredients of the involved and delicate work of A. Eskin, M. Kontsevich
and A. Zorich concerning the sum of the positive Lyapunov exponents of the
so-called Kontsevich- Zorich cocycle acting on the first cohomology spaces of
translation surfaces.
|
math.DS
|
the purpose of the paper under review is to explain the main ideas and the main ingredients of the involved and delicate work of a eskin m kontsevich and a zorich concerning the sum of the positive lyapunov exponents of the socalled kontsevich zorich cocycle acting on the first cohomology spaces of translation surfaces
|
[['the', 'purpose', 'of', 'the', 'paper', 'under', 'review', 'is', 'to', 'explain', 'the', 'main', 'ideas', 'and', 'the', 'main', 'ingredients', 'of', 'the', 'involved', 'and', 'delicate', 'work', 'of', 'a', 'eskin', 'm', 'kontsevich', 'and', 'a', 'zorich', 'concerning', 'the', 'sum', 'of', 'the', 'positive', 'lyapunov', 'exponents', 'of', 'the', 'socalled', 'kontsevich', 'zorich', 'cocycle', 'acting', 'on', 'the', 'first', 'cohomology', 'spaces', 'of', 'translation', 'surfaces']]
|
[-0.17910517731474507, 0.08588789409474919, -0.1168239690553121, 0.08828524416700627, -0.08523515768832078, -0.06429091825460394, 0.025924900014177656, 0.21849191571042562, -0.285843972315046, -0.23101511218205648, 0.11414267249508864, -0.21810087347748103, -0.23501255349428565, 0.2202783571858028, -0.18875142183430768, 0.048851115051312025, -0.0035214464318145205, 0.014354312369875886, -0.07198765072799115, -0.2967888793597619, 0.5062364452966938, 0.028003790484810318, 0.20625412172672372, 0.10764126170370555, 0.1108447081512875, 0.014410819181379068, -0.09717011351690248, -0.10203351911709264, -0.2006790382373664, 0.19993135793548492, 0.19731849138797433, 0.034198954973059394, 0.2598961141926271, -0.3487504580127144, -0.12524610835437974, 0.11537719078155027, 0.07775110559951928, -0.0175865707591314, 0.004101540632459715, -0.28675064053041516, 0.0792636254336685, -0.13318760082539585, -0.15092572114533848, -0.07550539034936163, 0.04576248758045646, 0.0599559165916785, -0.1924302540547042, -0.022383219493484055, 0.17133460562952138, 0.09226134405643852, -0.10404095791400997, -0.13357255494015086, -0.03518066499640958, 0.15800233138725162, 0.11803726580735573, 0.062179486403086535, 0.0912471878066383, -0.042371136619261014, -0.1588786327349091, 0.3409351781010628, -0.0193047243455011, -0.16300017402196923, 0.1393493384088355, -0.13711158598393755, -0.19450664230518872, 0.0705460478655166, 0.06932872588987704, 0.17797390961398682, -0.08155256690871385, 0.15637373225440065, -0.07005769571427393, 0.06781001647296189, 0.10336440536021083, -0.03996152563572482, 0.09685543626201926, 0.11315993878438517, 0.04741907430191835, 0.1206441428857269, 0.011245200052615945, -0.1106340064509789, -0.3805166738866656, -0.23800682028134665, -0.18658510966364433, 0.12518341647874978, -0.04476471154662755, -0.1477227513505905, 0.4668390935769788, 0.06324587041443144, 0.21121930818211426, 0.13408237330063624, 0.2772027997524236, 0.03395436176409324, 0.0238933349373164, -0.012941059389117139, 0.168426784850588, 0.25063957601647685, 0.07487247609188435, -0.19133307399331695, 0.02597408872787599, 0.2636976931244135]
|
1,803.06666
|
Causality Aspects of Modified Kerr-Newman spacetimes
|
In this paper, we address the problem of causality violation in the solutions
of Einstein equations and seek possible causality restoration mechanisms in
modifed theories of gravity. We choose for the above problem, the causality
violation due to the existence of closed time-like curves in the context of
Kerr-Newman black hole. We first revisit and quantify the details of the
causality violation in the Kerr-Newman spacetime. We then show that the issue
is also existent in two of the modified solutions to the Kerr Newman spacetime:
The Non-Commutativity inspired solution and the f(R)-Gravity modifed solution.
We explore the possibility of mechanisms present within the model that prevent
causality violation. We show that, in both the models, the model parameters can
be chosen such that the causality violating region is eliminated. We argue that
in the context of non commutativity inspired solution, the non commutativity
parameter can be chosen such that the causality violating region is eliminated
and the inner horizon is no longer the Cauchy horizon. We then discuss the
geodesic connectivity of the causality violating region in both the scenarios
and quantify the geodesics that have points in the causality violating regions.
We also discuss the causal aspects of Kerr Newman deSitter/antideSitter
spacetimes.
|
gr-qc
|
in this paper we address the problem of causality violation in the solutions of einstein equations and seek possible causality restoration mechanisms in modifed theories of gravity we choose for the above problem the causality violation due to the existence of closed timelike curves in the context of kerrnewman black hole we first revisit and quantify the details of the causality violation in the kerrnewman spacetime we then show that the issue is also existent in two of the modified solutions to the kerr newman spacetime the noncommutativity inspired solution and the frgravity modifed solution we explore the possibility of mechanisms present within the model that prevent causality violation we show that in both the models the model parameters can be chosen such that the causality violating region is eliminated we argue that in the context of non commutativity inspired solution the non commutativity parameter can be chosen such that the causality violating region is eliminated and the inner horizon is no longer the cauchy horizon we then discuss the geodesic connectivity of the causality violating region in both the scenarios and quantify the geodesics that have points in the causality violating regions we also discuss the causal aspects of kerr newman desitterantidesitter spacetimes
|
[['in', 'this', 'paper', 'we', 'address', 'the', 'problem', 'of', 'causality', 'violation', 'in', 'the', 'solutions', 'of', 'einstein', 'equations', 'and', 'seek', 'possible', 'causality', 'restoration', 'mechanisms', 'in', 'modifed', 'theories', 'of', 'gravity', 'we', 'choose', 'for', 'the', 'above', 'problem', 'the', 'causality', 'violation', 'due', 'to', 'the', 'existence', 'of', 'closed', 'timelike', 'curves', 'in', 'the', 'context', 'of', 'kerrnewman', 'black', 'hole', 'we', 'first', 'revisit', 'and', 'quantify', 'the', 'details', 'of', 'the', 'causality', 'violation', 'in', 'the', 'kerrnewman', 'spacetime', 'we', 'then', 'show', 'that', 'the', 'issue', 'is', 'also', 'existent', 'in', 'two', 'of', 'the', 'modified', 'solutions', 'to', 'the', 'kerr', 'newman', 'spacetime', 'the', 'noncommutativity', 'inspired', 'solution', 'and', 'the', 'frgravity', 'modifed', 'solution', 'we', 'explore', 'the', 'possibility', 'of', 'mechanisms', 'present', 'within', 'the', 'model', 'that', 'prevent', 'causality', 'violation', 'we', 'show', 'that', 'in', 'both', 'the', 'models', 'the', 'model', 'parameters', 'can', 'be', 'chosen', 'such', 'that', 'the', 'causality', 'violating', 'region', 'is', 'eliminated', 'we', 'argue', 'that', 'in', 'the', 'context', 'of', 'non', 'commutativity', 'inspired', 'solution', 'the', 'non', 'commutativity', 'parameter', 'can', 'be', 'chosen', 'such', 'that', 'the', 'causality', 'violating', 'region', 'is', 'eliminated', 'and', 'the', 'inner', 'horizon', 'is', 'no', 'longer', 'the', 'cauchy', 'horizon', 'we', 'then', 'discuss', 'the', 'geodesic', 'connectivity', 'of', 'the', 'causality', 'violating', 'region', 'in', 'both', 'the', 'scenarios', 'and', 'quantify', 'the', 'geodesics', 'that', 'have', 'points', 'in', 'the', 'causality', 'violating', 'regions', 'we', 'also', 'discuss', 'the', 'causal', 'aspects', 'of', 'kerr', 'newman', 'desitterantidesitter', 'spacetimes']]
|
[-0.183796152967978, 0.08883649526333684, -0.08361453264768194, 0.1440885453318645, -0.11324274691344775, -0.12648635443037357, 0.03889800695268887, 0.2599295129302173, -0.2496792049998225, -0.25536700216778024, 0.09328912645050788, -0.28704781892704845, -0.14954449087518998, 0.10532408473058948, -0.09264246819886664, 0.05862181689223192, -0.018359318448992197, 0.03505450279997854, -0.08468353110531877, -0.2060023568951401, 0.40097545582590066, 0.0675483317581221, 0.2639757844532285, 0.08108846822138784, 0.09136996574910917, -0.011428287986831124, -0.0061365195258699465, 0.0817708159158043, -0.1620976181926703, 0.028836967548575676, 0.2023229859800348, 0.22006978911664246, 0.21523401635731088, -0.44198715326197335, -0.24413599938686406, 0.15382807186616612, 0.13401391438387444, 0.13470128991553937, -0.036439287322550425, -0.3193394354650099, 0.06890337591935775, -0.14281093938909287, -0.1641156611909053, -0.07773218065812229, 0.0033427229623672703, -0.08492495757635982, -0.21605680047034337, 0.11277991004449917, 0.08482852798836131, -0.019650729781411257, -0.09535220815924, 0.006131145365655496, 0.01689558717298317, 0.06299528847287955, 0.14549388501361893, -0.039630583113545705, 0.0868121851350323, -0.11805497507078418, -0.14251684704382578, 0.3835727979195089, -0.020435862518443263, -0.2670184559959533, 0.1321111914788928, -0.2013062029053902, -0.14280496932694625, 0.022283810771212643, 0.14818884726852324, 0.1658535445099834, -0.1764768189475344, 0.16682201799715232, -0.041658897037741734, 0.11975943136804283, 0.12786613047017437, 0.058104009830892964, 0.23181067572750627, 0.09101027567536006, 0.053513784444400025, 0.13949213456305137, -0.06429608497456671, -0.10723976697428657, -0.420382399745102, -0.1626471089098254, -0.11150029004110468, 0.02443596578932601, -0.1665872661209765, -0.10713561133193678, 0.3552840938539304, 0.19063601559807955, 0.14366126645888602, 0.021004562036781183, 0.2414317174488908, 0.08954783887120671, 0.029739589207883686, 0.11659411044580302, 0.3664208671004681, 0.09065523932761343, 0.11247020762464206, -0.27843190019886044, 0.03432435531563727, 0.07432256042819672]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.