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.00167 | From Octopus to Dendrite - Semiflexible Polyelectrolyte Brush
Condensates in Trivalent Counterion Solution | Interplay between counterion-mediated interaction and stiffness inherent to
polymer chain can bring substantial complexity to the morphology and dynamics
of polyelectrolyte brush condensates. Trivalent counterions induce collapse of
flexible polyelectrolyte brushes, over a certain range of grafting density,
into octopus-like surface micelles; however, if individual chains are rigid
enough, the ion-mediated local nematic ordering assembles the brush chains into
fractal-like dendritic condensates whose relaxation dynamics is significantly
slower than that in the surface micelles. Notably, the trivalent ions condensed
in the dendritic condensates are highly mobile displaying quasi-one-dimensional
diffusion in parallel along the dendritic branches. Our findings in this study
are potentially of great significance to understanding the response of cellular
organization such as chromosomes and charged polysaccharides on membranes to
the change in ionic environment.
| cond-mat.soft physics.bio-ph | interplay between counterionmediated interaction and stiffness inherent to polymer chain can bring substantial complexity to the morphology and dynamics of polyelectrolyte brush condensates trivalent counterions induce collapse of flexible polyelectrolyte brushes over a certain range of grafting density into octopuslike surface micelles however if individual chains are rigid enough the ionmediated local nematic ordering assembles the brush chains into fractallike dendritic condensates whose relaxation dynamics is significantly slower than that in the surface micelles notably the trivalent ions condensed in the dendritic condensates are highly mobile displaying quasionedimensional diffusion in parallel along the dendritic branches our findings in this study are potentially of great significance to understanding the response of cellular organization such as chromosomes and charged polysaccharides on membranes to the change in ionic environment | [['interplay', 'between', 'counterionmediated', 'interaction', 'and', 'stiffness', 'inherent', 'to', 'polymer', 'chain', 'can', 'bring', 'substantial', 'complexity', 'to', 'the', 'morphology', 'and', 'dynamics', 'of', 'polyelectrolyte', 'brush', 'condensates', 'trivalent', 'counterions', 'induce', 'collapse', 'of', 'flexible', 'polyelectrolyte', 'brushes', 'over', 'a', 'certain', 'range', 'of', 'grafting', 'density', 'into', 'octopuslike', 'surface', 'micelles', 'however', 'if', 'individual', 'chains', 'are', 'rigid', 'enough', 'the', 'ionmediated', 'local', 'nematic', 'ordering', 'assembles', 'the', 'brush', 'chains', 'into', 'fractallike', 'dendritic', 'condensates', 'whose', 'relaxation', 'dynamics', 'is', 'significantly', 'slower', 'than', 'that', 'in', 'the', 'surface', 'micelles', 'notably', 'the', 'trivalent', 'ions', 'condensed', 'in', 'the', 'dendritic', 'condensates', 'are', 'highly', 'mobile', 'displaying', 'quasionedimensional', 'diffusion', 'in', 'parallel', 'along', 'the', 'dendritic', 'branches', 'our', 'findings', 'in', 'this', 'study', 'are', 'potentially', 'of', 'great', 'significance', 'to', 'understanding', 'the', 'response', 'of', 'cellular', 'organization', 'such', 'as', 'chromosomes', 'and', 'charged', 'polysaccharides', 'on', 'membranes', 'to', 'the', 'change', 'in', 'ionic', 'environment']] | [-0.15000125397066585, 0.26303665831685064, -0.032568205907940864, 0.0022646773690357803, -0.011683927465230226, -0.15684154146164656, -0.0246652274383232, 0.4150936688110232, -0.2698532310798764, -0.25571786335855723, -0.009404694287106394, -0.29811452310159803, -0.17253723408281804, 0.08089536964893342, 0.006318148907274008, -0.021376938447356223, 0.024679117117077112, -0.033636443078517916, 0.0009839220317080617, -0.1946109427511692, 0.19131303390394896, 0.033915378608740866, 0.3272370141670108, 0.10539435113221407, 0.04797429226897657, -0.01975929978862405, 0.11306522344052791, 0.06738525713980198, -0.19314615351177053, 0.14623001442104577, 0.27534147516684604, -0.021380395762622358, 0.19153221947699786, -0.5588115001469851, -0.24235989893600346, 0.08423176162317395, 0.23201426293328403, 0.16381176906079054, -0.046467819123528896, -0.2698352721035481, 0.0321166955716908, -0.13528692736849188, -0.11325129735097289, -0.08206190940365195, 0.05150435922294855, 0.12930639302125202, -0.1521797677874565, 0.103604456262663, 0.09770935508795082, 0.08394209899194538, -0.07418478242307901, -0.10409134378656745, -0.11862719452567398, 0.09148988319560886, 0.07314914719387888, 0.003415086282417178, 0.29746737153828146, -0.16113223355822265, -0.02319802602659911, 0.3512767863422632, -0.00902724300106638, -0.18707670402526855, 0.28015291172266005, -0.15568176035024225, -0.10066645474731922, 0.2546990564763546, 0.18083306081593037, 0.05379337522387505, -0.13459355268254877, 0.03606955029675737, 0.018681315380614252, 0.20482488395273685, 0.11441849787160754, 0.0020297040790319444, 0.2748387267328799, 0.2590555951297283, 0.04673220449313521, 0.19500412651896476, -0.03625989531911909, -0.18737548721954225, -0.12737470327690242, -0.2039152588546276, -0.1461786460680887, 0.021301666373270564, -0.13053393828833942, -0.2527758465781808, 0.34387179359048603, 0.0531033194705451, 0.17401438379101455, 0.03517735447734594, 0.18577217281237243, -0.05602761842682958, 0.08496392292715609, -0.02933998416364193, 0.15228752775490284, 0.1636285065561533, 0.09850327797140926, -0.29751498413877564, 0.12990316953882575, 0.04410356955416501] |
1,803.00168 | On the Performance of Network NOMA in Uplink CoMP Systems: A Stochastic
Geometry Approach | To improve the system throughput, this paper proposes a network
non-orthogonal multiple access (N-NOMA) technique for the uplink coordinated
multi-point transmission (CoMP). In the considered scenario, multiple base
stations collaborate with each other to serve a single user, referred to as the
CoMP user, which is the same as for conventional CoMP. However, unlike
conventional CoMP, each base station in N-NOMA opportunistically serves an
extra user, referred to as the NOMA user, while serving the CoMP user at the
same bandwidth. The CoMP user is typically located at the cell-edge, whereas
users close to the base stations are scheduled as NOMA users. Hence, the
channel conditions of the two kind of users are very distinctive, which
facilitates the implementation of NOMA. Compared to the conventional orthogonal
multiple access based CoMP scheme, where multiple base stations serve a single
CoMP user only, the proposed N-NOMA scheme can support larger connectivity by
serving the extra NOMA users, and improve the spectral efficiency by avoiding
the CoMP user solely occupying the spectrum. A stochastic geometry approach is
applied to model the considered N-NOMA scenario as a Poisson cluster process,
based on which closed-form analytical expressions for outage probabilities and
ergodic rates are obtained. Numerical results are presented to show the
accuracy of the analytical results and also demonstrate the superior
performance of the proposed N-NOMA scheme.
| cs.IT math.IT | to improve the system throughput this paper proposes a network nonorthogonal multiple access nnoma technique for the uplink coordinated multipoint transmission comp in the considered scenario multiple base stations collaborate with each other to serve a single user referred to as the comp user which is the same as for conventional comp however unlike conventional comp each base station in nnoma opportunistically serves an extra user referred to as the noma user while serving the comp user at the same bandwidth the comp user is typically located at the celledge whereas users close to the base stations are scheduled as noma users hence the channel conditions of the two kind of users are very distinctive which facilitates the implementation of noma compared to the conventional orthogonal multiple access based comp scheme where multiple base stations serve a single comp user only the proposed nnoma scheme can support larger connectivity by serving the extra noma users and improve the spectral efficiency by avoiding the comp user solely occupying the spectrum a stochastic geometry approach is applied to model the considered nnoma scenario as a poisson cluster process based on which closedform analytical expressions for outage probabilities and ergodic rates are obtained numerical results are presented to show the accuracy of the analytical results and also demonstrate the superior performance of the proposed nnoma scheme | [['to', 'improve', 'the', 'system', 'throughput', 'this', 'paper', 'proposes', 'a', 'network', 'nonorthogonal', 'multiple', 'access', 'nnoma', 'technique', 'for', 'the', 'uplink', 'coordinated', 'multipoint', 'transmission', 'comp', 'in', 'the', 'considered', 'scenario', 'multiple', 'base', 'stations', 'collaborate', 'with', 'each', 'other', 'to', 'serve', 'a', 'single', 'user', 'referred', 'to', 'as', 'the', 'comp', 'user', 'which', 'is', 'the', 'same', 'as', 'for', 'conventional', 'comp', 'however', 'unlike', 'conventional', 'comp', 'each', 'base', 'station', 'in', 'nnoma', 'opportunistically', 'serves', 'an', 'extra', 'user', 'referred', 'to', 'as', 'the', 'noma', 'user', 'while', 'serving', 'the', 'comp', 'user', 'at', 'the', 'same', 'bandwidth', 'the', 'comp', 'user', 'is', 'typically', 'located', 'at', 'the', 'celledge', 'whereas', 'users', 'close', 'to', 'the', 'base', 'stations', 'are', 'scheduled', 'as', 'noma', 'users', 'hence', 'the', 'channel', 'conditions', 'of', 'the', 'two', 'kind', 'of', 'users', 'are', 'very', 'distinctive', 'which', 'facilitates', 'the', 'implementation', 'of', 'noma', 'compared', 'to', 'the', 'conventional', 'orthogonal', 'multiple', 'access', 'based', 'comp', 'scheme', 'where', 'multiple', 'base', 'stations', 'serve', 'a', 'single', 'comp', 'user', 'only', 'the', 'proposed', 'nnoma', 'scheme', 'can', 'support', 'larger', 'connectivity', 'by', 'serving', 'the', 'extra', 'noma', 'users', 'and', 'improve', 'the', 'spectral', 'efficiency', 'by', 'avoiding', 'the', 'comp', 'user', 'solely', 'occupying', 'the', 'spectrum', 'a', 'stochastic', 'geometry', 'approach', 'is', 'applied', 'to', 'model', 'the', 'considered', 'nnoma', 'scenario', 'as', 'a', 'poisson', 'cluster', 'process', 'based', 'on', 'which', 'closedform', 'analytical', 'expressions', 'for', 'outage', 'probabilities', 'and', 'ergodic', 'rates', 'are', 'obtained', 'numerical', 'results', 'are', 'presented', 'to', 'show', 'the', 'accuracy', 'of', 'the', 'analytical', 'results', 'and', 'also', 'demonstrate', 'the', 'superior', 'performance', 'of', 'the', 'proposed', 'nnoma', 'scheme']] | [-0.23782051560748785, -0.052999376402288204, 0.005429467345032457, 0.027569279033207345, -0.1142500703016321, -0.2642273927512558, 0.17701406512595297, 0.36339648136443087, -0.21398377712114375, -0.2832833718617589, 0.01926181759296879, -0.22009091084664312, -0.1658901518102184, 0.15073075358789298, -0.10140977877989879, 0.014074845363766022, 0.05764954583954292, 0.08535999549143518, -0.02460844449974563, -0.2696815743502605, 0.2552625173034623, 0.20696785836793782, 0.4232909955468547, -0.00313820261215883, 0.04479793257251248, 0.03258969845154193, -0.04937331108303298, -0.05310875930533131, -0.027340446412980956, 0.07245809289275965, 0.38285384221407565, 0.16690898498085915, 0.28894387623253426, -0.4143787107342695, -0.27494570897629006, -0.0035068027929908226, 0.19159900976724467, -0.005030425144839748, 0.007277833243034312, -0.3014611476132304, 0.15368130142568723, -0.2603807316011344, -0.04300164500973918, 0.03125058025990366, -0.15815400307989708, 0.09455815640579901, -0.43408137507895384, -0.01763534869681814, -0.015903953203906394, 0.02253230234332416, -0.051557725208243484, -0.11257611520561252, 0.007288078489324972, 0.22039942995482228, 0.02809353881020145, -0.009334052675883933, 0.06970432531213881, -0.030525141185767646, -0.14955395328156618, 0.4107118269320026, 0.024349795358940423, -0.23685247223039113, 0.2109134268799208, -0.06699581777117311, -0.08399350283826146, 0.17933058376411484, 0.21969524915893918, 0.07474174794862089, -0.17610857899263166, 0.002230513520641127, -0.04503434289856542, 0.11510434465674943, 0.12831857062421004, 0.0977145654505386, 0.15172146973743067, 0.1590928324297772, 0.13449051292120343, 0.062479065849410265, -0.12995157298849136, -0.12508009913149853, -0.19402435996085238, -0.14004504757269282, -0.22268842177824724, -0.0016969982743463708, -0.0654780430583656, -0.06028991265247488, 0.3617873911192906, 0.1100574231535852, 0.14534144308167454, 0.06416971239547407, 0.3944551862208298, 0.1166510054410431, 0.06034393809869418, 0.14100516511068883, 0.15331884534954357, 0.060063148791287845, 0.20251316630548793, -0.21448059106608977, 0.007958938277873624, 0.03194576459874152] |
1,803.00169 | The Effect of Instruction Padding on SFI Overhead | Software-based fault isolation (SFI) is a technique to isolate a potentially
faulty or malicious software module from the rest of a system using
instruction-level rewriting. SFI implementations on CISC architectures,
including Google Native Client, use instruction padding to enforce an address
layout invariant and restrict control flow. However this padding decreases code
density and imposes runtime overhead. We analyze this overhead, and show that
it can be reduced by allowing some execution of overlapping instructions, as
long as those overlapping instructions are still safe according to the original
per-instruction policy. We implemented this change for both 32-bit and 64-bit
x86 versions of Native Client, and analyzed why the performance benefit is
higher on 32-bit. The optimization leads to a consistent decrease in the number
of instructions executed and savings averaging 8.6% in execution time (over
compatible benchmarks from SPECint2006) for x86-32. We describe how to modify
the validation algorithm to check the more permissive policy, and extend a
machine-checked Coq proof to confirm that the system's security is preserved.
| cs.SE cs.CR | softwarebased fault isolation sfi is a technique to isolate a potentially faulty or malicious software module from the rest of a system using instructionlevel rewriting sfi implementations on cisc architectures including google native client use instruction padding to enforce an address layout invariant and restrict control flow however this padding decreases code density and imposes runtime overhead we analyze this overhead and show that it can be reduced by allowing some execution of overlapping instructions as long as those overlapping instructions are still safe according to the original perinstruction policy we implemented this change for both 32bit and 64bit x86 versions of native client and analyzed why the performance benefit is higher on 32bit the optimization leads to a consistent decrease in the number of instructions executed and savings averaging 86 in execution time over compatible benchmarks from specint2006 for x8632 we describe how to modify the validation algorithm to check the more permissive policy and extend a machinechecked coq proof to confirm that the systems security is preserved | [['softwarebased', 'fault', 'isolation', 'sfi', 'is', 'a', 'technique', 'to', 'isolate', 'a', 'potentially', 'faulty', 'or', 'malicious', 'software', 'module', 'from', 'the', 'rest', 'of', 'a', 'system', 'using', 'instructionlevel', 'rewriting', 'sfi', 'implementations', 'on', 'cisc', 'architectures', 'including', 'google', 'native', 'client', 'use', 'instruction', 'padding', 'to', 'enforce', 'an', 'address', 'layout', 'invariant', 'and', 'restrict', 'control', 'flow', 'however', 'this', 'padding', 'decreases', 'code', 'density', 'and', 'imposes', 'runtime', 'overhead', 'we', 'analyze', 'this', 'overhead', 'and', 'show', 'that', 'it', 'can', 'be', 'reduced', 'by', 'allowing', 'some', 'execution', 'of', 'overlapping', 'instructions', 'as', 'long', 'as', 'those', 'overlapping', 'instructions', 'are', 'still', 'safe', 'according', 'to', 'the', 'original', 'perinstruction', 'policy', 'we', 'implemented', 'this', 'change', 'for', 'both', '32bit', 'and', '64bit', 'x86', 'versions', 'of', 'native', 'client', 'and', 'analyzed', 'why', 'the', 'performance', 'benefit', 'is', 'higher', 'on', '32bit', 'the', 'optimization', 'leads', 'to', 'a', 'consistent', 'decrease', 'in', 'the', 'number', 'of', 'instructions', 'executed', 'and', 'savings', 'averaging', '86', 'in', 'execution', 'time', 'over', 'compatible', 'benchmarks', 'from', 'specint2006', 'for', 'x8632', 'we', 'describe', 'how', 'to', 'modify', 'the', 'validation', 'algorithm', 'to', 'check', 'the', 'more', 'permissive', 'policy', 'and', 'extend', 'a', 'machinechecked', 'coq', 'proof', 'to', 'confirm', 'that', 'the', 'systems', 'security', 'is', 'preserved']] | [-0.15742424774721422, 0.0036419939211357936, -0.07536908124393997, 0.08616748717557414, -0.10768841765259943, -0.22182818478343627, 0.11908477074705087, 0.4035605631981898, -0.2688833123286176, -0.3626224282365966, 0.1320886359653851, -0.20436623721686473, -0.07542384037269695, 0.20848183926189295, -0.16373444272833595, 0.08731181358256523, 0.11212027992929419, 0.006191022354683064, -0.07148900388193692, -0.30338359948216814, 0.22490785141610148, 0.08140779702912972, 0.2764534159361508, 0.022092248293492628, 0.0665382187987442, 0.0031523549107340984, -0.032676553644004264, -0.006550933985175994, -0.02856142714478325, 0.08499775081101513, 0.2788439434658489, 0.22418802046407776, 0.2925055376450385, -0.4548189878710602, -0.09678712105574871, 0.03470349055995424, 0.13311435099437283, 0.11373538110988686, -0.0009268322523510791, -0.28126904149034837, 0.15868061029559832, -0.23841761073366885, -0.0351091367052307, -0.12255816812997303, -0.027555949840111185, 0.004630313393048358, -0.23849927050942354, -0.04509498029231958, 0.046680472699324994, 0.07598194110498999, 0.00048816133801073553, -0.07745224169065547, -0.040037651333105134, 0.1441396719015888, -0.006530616181363991, 0.04199416206936431, 0.2051401496934985, -0.0634184814695022, -0.17964411761993207, 0.37517990682453634, -0.01823174955003547, -0.1870011582476906, 0.18571369833009968, 0.012555620245949691, -0.1634502580104654, 0.12169505921276623, 0.19698926576424436, 0.050778184479775036, -0.15214881842047065, 0.06666226251540336, 0.015517960296220046, 0.25620180846988616, 0.11750714599957174, 0.03714173498103417, 0.14672801937874272, 0.18877741526805303, 0.07155632465819728, 0.181783419889987, -0.02302931347042771, -0.10113530127045485, -0.2579064513612763, -0.18057108164417096, -0.14225968391584032, -0.027515017517270094, -0.06857012338729096, -0.15076521333553886, 0.3739305782547019, 0.24611814353188657, 0.12054494610729527, 0.15289748112070767, 0.3884931986265064, 0.03469607558982245, 0.18035418124896116, 0.16458073774274123, 0.13084456793973026, 0.009690664847471178, 0.14288772904827451, -0.2201886281303792, 0.11629046877588045, 0.014773509123626289] |
1,803.0017 | Sequential Detection of Deception Attacks in Networked Control Systems
with Watermarking | In this paper, we investigate the role of a physical watermarking signal in
quickest detection of a deception attack in a scalar linear control system
where the sensor measurements can be replaced by an arbitrary stationary signal
generated by an attacker. By adding a random watermarking signal to the control
action, the controller designs a sequential test based on a Cumulative Sum
(CUSUM) method that accumulates the log-likelihood ratio of the joint
distribution of the residue and the watermarking signal (under attack) and the
joint distribution of the innovations and the watermarking signal under no
attack. As the average detection delay in such tests is asymptotically (as the
false alarm rate goes to zero) upper bounded by a quantity inversely
proportional to the Kullback-Leibler divergence(KLD) measure between the two
joint distributions mentioned above, we analyze the effect of the watermarking
signal variance on the above KLD. We also analyze the increase in the LQG
control cost due to the watermarking signal, and show that there is a tradeoff
between quick detection of attacks and the penalty in the control cost. It is
shown that by considering a sequential detection test based on the joint
distributions of residue/innovations and the watermarking signal, as opposed to
the distributions of the residue/innovations only, we can achieve a higher KLD,
thus resulting in a reduced average detection delay. Numerical results are
provided to support our claims.
| math.OC cs.SY | in this paper we investigate the role of a physical watermarking signal in quickest detection of a deception attack in a scalar linear control system where the sensor measurements can be replaced by an arbitrary stationary signal generated by an attacker by adding a random watermarking signal to the control action the controller designs a sequential test based on a cumulative sum cusum method that accumulates the loglikelihood ratio of the joint distribution of the residue and the watermarking signal under attack and the joint distribution of the innovations and the watermarking signal under no attack as the average detection delay in such tests is asymptotically as the false alarm rate goes to zero upper bounded by a quantity inversely proportional to the kullbackleibler divergencekld measure between the two joint distributions mentioned above we analyze the effect of the watermarking signal variance on the above kld we also analyze the increase in the lqg control cost due to the watermarking signal and show that there is a tradeoff between quick detection of attacks and the penalty in the control cost it is shown that by considering a sequential detection test based on the joint distributions of residueinnovations and the watermarking signal as opposed to the distributions of the residueinnovations only we can achieve a higher kld thus resulting in a reduced average detection delay numerical results are provided to support our claims | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'role', 'of', 'a', 'physical', 'watermarking', 'signal', 'in', 'quickest', 'detection', 'of', 'a', 'deception', 'attack', 'in', 'a', 'scalar', 'linear', 'control', 'system', 'where', 'the', 'sensor', 'measurements', 'can', 'be', 'replaced', 'by', 'an', 'arbitrary', 'stationary', 'signal', 'generated', 'by', 'an', 'attacker', 'by', 'adding', 'a', 'random', 'watermarking', 'signal', 'to', 'the', 'control', 'action', 'the', 'controller', 'designs', 'a', 'sequential', 'test', 'based', 'on', 'a', 'cumulative', 'sum', 'cusum', 'method', 'that', 'accumulates', 'the', 'loglikelihood', 'ratio', 'of', 'the', 'joint', 'distribution', 'of', 'the', 'residue', 'and', 'the', 'watermarking', 'signal', 'under', 'attack', 'and', 'the', 'joint', 'distribution', 'of', 'the', 'innovations', 'and', 'the', 'watermarking', 'signal', 'under', 'no', 'attack', 'as', 'the', 'average', 'detection', 'delay', 'in', 'such', 'tests', 'is', 'asymptotically', 'as', 'the', 'false', 'alarm', 'rate', 'goes', 'to', 'zero', 'upper', 'bounded', 'by', 'a', 'quantity', 'inversely', 'proportional', 'to', 'the', 'kullbackleibler', 'divergencekld', 'measure', 'between', 'the', 'two', 'joint', 'distributions', 'mentioned', 'above', 'we', 'analyze', 'the', 'effect', 'of', 'the', 'watermarking', 'signal', 'variance', 'on', 'the', 'above', 'kld', 'we', 'also', 'analyze', 'the', 'increase', 'in', 'the', 'lqg', 'control', 'cost', 'due', 'to', 'the', 'watermarking', 'signal', 'and', 'show', 'that', 'there', 'is', 'a', 'tradeoff', 'between', 'quick', 'detection', 'of', 'attacks', 'and', 'the', 'penalty', 'in', 'the', 'control', 'cost', 'it', 'is', 'shown', 'that', 'by', 'considering', 'a', 'sequential', 'detection', 'test', 'based', 'on', 'the', 'joint', 'distributions', 'of', 'residueinnovations', 'and', 'the', 'watermarking', 'signal', 'as', 'opposed', 'to', 'the', 'distributions', 'of', 'the', 'residueinnovations', 'only', 'we', 'can', 'achieve', 'a', 'higher', 'kld', 'thus', 'resulting', 'in', 'a', 'reduced', 'average', 'detection', 'delay', 'numerical', 'results', 'are', 'provided', 'to', 'support', 'our', 'claims']] | [-0.13812806947750556, 0.05123934909758793, -0.1119807664016221, 0.06054160199697459, -0.030596049376417717, -0.1448520356036853, 0.09916236423521291, 0.3385233107291357, -0.26172831651905154, -0.2914606062248024, 0.1414872324139929, -0.28673244848456964, -0.16608586549295284, 0.17388861146084475, -0.14674666519459809, 0.10977518721992012, -0.0060433250990204156, 0.06658583081441252, -0.049093319678081275, -0.25155022276329553, 0.2837977971684383, 0.09779929725034366, 0.3501440722629526, 0.03091069216500382, 0.13047526942110543, 0.027281847665509347, -0.055763952903282794, -0.009314287256644673, -0.08674652550994662, 0.0673162700185414, 0.24739955168209288, 0.2005452351567364, 0.292470145305643, -0.35066827770940734, -0.20542569547549996, 0.15751181438658793, 0.11544644990000533, 0.0704249439874916, -0.09202008861560358, -0.324433107021586, 0.12221490990525055, -0.1763665652071333, -0.016907680017149734, -0.01891628629006913, -0.013418020629710375, 0.03529387597385062, -0.30844637525052354, 0.05197662775245633, 0.0668403588613601, 0.038883414342018315, -0.041969305269346946, -0.0756447563841573, 0.019743750157550498, 0.10746802976273619, 0.09203866792854946, 0.01532651775406763, 0.17369754483321415, -0.14116268820336747, -0.14145390928761553, 0.33345697481412945, -0.1015986514963539, -0.25871658093381394, 0.12839719980515898, -0.08763546851671028, -0.07605113207940094, 0.1411858155401261, 0.21515613866717795, 0.1018747459206421, -0.1514907824851605, 0.017777524751765597, -0.0037817902655613213, 0.19898407833496165, 0.07295127615828767, 0.031421231426701245, 0.14758676862929782, 0.15480271557663206, 0.15439658580290958, 0.18156699673221832, -0.15796167693735308, -0.09316788693711031, -0.3096953348366454, -0.150904284355253, -0.23051603994480696, 0.006848447524035537, -0.09113247878811379, -0.1396059925228461, 0.3902916615609259, 0.1859522598600381, 0.2144716900926364, 0.09978650914562061, 0.37668979843045425, 0.14879474259646586, 0.05548400214342523, 0.0644200582130442, 0.24247543780259204, 0.09699504648123798, 0.04738396368351436, -0.22439995802141824, 0.1402166494123605, 0.002045767404345946] |
1,803.00171 | Charged Higgs boson contribution to $B^-_{q} \to \ell \bar \nu$ and
$\bar B\to (P, V) \ell \bar\nu$ in a generic two-Higgs doublet model | We comprehensively study the charged-Higgs contributions to the leptonic
$B^-_q \to \ell \bar \nu$ ($q=u,c$) and semileptonic $\bar B \to X_q \ell
\bar\nu$ ($X_u=\pi, \rho; X_c=D,D^*$) decays in the type-III two-Higgs-doublet
model (2HDM). We employ the Cheng-Sher ansatz to suppress the tree-level
flavor-changing neutral currents (FCNCs) in the quark sector. When the strict
constraints from the $\Delta B=2$ and $b\to s \gamma$ processes are considered,
parameters $\chi^u_{tq}$ from the quark couplings and $\chi^\ell_\ell$ from the
lepton couplings dictate the leptonic and semileptonic $B$ decays. It is found
that when the measured $B^-_u\to \tau \bar \nu$ and indirect bound of $B^-_c
\to \tau \bar \nu$ obtained by LEP1 data are taken into account, $R(D)$ and
$R(\pi)$ can have broadly allowed ranges; however, the values of $R(\rho)$ and
$R(D^*)$ are limited to approximately the standard model (SM) results. We also
find that the same behaviors also occur in the $\tau$-lepton polarizations and
forward-backward asymmetries ($A^{X_q,\tau}_{FB}$) of the semileptonic decays,
with the exception of $A^{D^*,\tau}_{FB}$, for which the deviation from the SM
due to the charged-Higgs effect is still sizable. In addition, the
$q^2$-dependent $A^{\pi,\tau}_{FB}$ and $A^{D,\tau}_{FB}$ can be very sensitive
to the charged-Higgs effects and have completely different shapes from the SM.
| hep-ph hep-ex | we comprehensively study the chargedhiggs contributions to the leptonic b_q to ell bar nu quc and semileptonic bar b to x_q ell barnu x_upi rho x_cdd decays in the typeiii twohiggsdoublet model 2hdm we employ the chengsher ansatz to suppress the treelevel flavorchanging neutral currents fcncs in the quark sector when the strict constraints from the delta b2 and bto s gamma processes are considered parameters chiu_tq from the quark couplings and chiell_ell from the lepton couplings dictate the leptonic and semileptonic b decays it is found that when the measured b_uto tau bar nu and indirect bound of b_c to tau bar nu obtained by lep1 data are taken into account rd and rpi can have broadly allowed ranges however the values of rrho and rd are limited to approximately the standard model sm results we also find that the same behaviors also occur in the taulepton polarizations and forwardbackward asymmetries ax_qtau_fb of the semileptonic decays with the exception of adtau_fb for which the deviation from the sm due to the chargedhiggs effect is still sizable in addition the q2dependent apitau_fb and adtau_fb can be very sensitive to the chargedhiggs effects and have completely different shapes from the sm | [['we', 'comprehensively', 'study', 'the', 'chargedhiggs', 'contributions', 'to', 'the', 'leptonic', 'b_q', 'to', 'ell', 'bar', 'nu', 'quc', 'and', 'semileptonic', 'bar', 'b', 'to', 'x_q', 'ell', 'barnu', 'x_upi', 'rho', 'x_cdd', 'decays', 'in', 'the', 'typeiii', 'twohiggsdoublet', 'model', '2hdm', 'we', 'employ', 'the', 'chengsher', 'ansatz', 'to', 'suppress', 'the', 'treelevel', 'flavorchanging', 'neutral', 'currents', 'fcncs', 'in', 'the', 'quark', 'sector', 'when', 'the', 'strict', 'constraints', 'from', 'the', 'delta', 'b2', 'and', 'bto', 's', 'gamma', 'processes', 'are', 'considered', 'parameters', 'chiu_tq', 'from', 'the', 'quark', 'couplings', 'and', 'chiell_ell', 'from', 'the', 'lepton', 'couplings', 'dictate', 'the', 'leptonic', 'and', 'semileptonic', 'b', 'decays', 'it', 'is', 'found', 'that', 'when', 'the', 'measured', 'b_uto', 'tau', 'bar', 'nu', 'and', 'indirect', 'bound', 'of', 'b_c', 'to', 'tau', 'bar', 'nu', 'obtained', 'by', 'lep1', 'data', 'are', 'taken', 'into', 'account', 'rd', 'and', 'rpi', 'can', 'have', 'broadly', 'allowed', 'ranges', 'however', 'the', 'values', 'of', 'rrho', 'and', 'rd', 'are', 'limited', 'to', 'approximately', 'the', 'standard', 'model', 'sm', 'results', 'we', 'also', 'find', 'that', 'the', 'same', 'behaviors', 'also', 'occur', 'in', 'the', 'taulepton', 'polarizations', 'and', 'forwardbackward', 'asymmetries', 'ax_qtau_fb', 'of', 'the', 'semileptonic', 'decays', 'with', 'the', 'exception', 'of', 'adtau_fb', 'for', 'which', 'the', 'deviation', 'from', 'the', 'sm', 'due', 'to', 'the', 'chargedhiggs', 'effect', 'is', 'still', 'sizable', 'in', 'addition', 'the', 'q2dependent', 'apitau_fb', 'and', 'adtau_fb', 'can', 'be', 'very', 'sensitive', 'to', 'the', 'chargedhiggs', 'effects', 'and', 'have', 'completely', 'different', 'shapes', 'from', 'the', 'sm']] | [-0.06357874504450142, 0.2610932638431832, -0.004315514739161146, 0.14791435604919823, -0.06695128818157792, -0.1931235190461745, 0.09144364562864925, 0.2711749728289001, -0.2649560115586957, -0.21763791566349797, -0.02863304945640266, -0.32959875521086845, -0.006098087803825506, 0.11397519298275866, 0.09845822808073507, 0.05796233121389415, 0.03729434948553782, -0.02646136830666477, -0.07098352457828742, -0.19498831785365595, 0.2532648538208096, -0.024661354874212716, 0.1814166186005357, 0.10204635047219987, -0.06770552181789997, -0.04785268898986127, -0.0662054715968534, -0.04446467777867753, -0.16991699578460442, -0.0011080843237463922, 0.17057030735184564, 0.0917578353585565, 0.04947283168889813, -0.33966182913756016, -0.047025393031401914, 0.18410860880316457, 0.1640758390908043, 0.06365863434171073, 0.014682354688759624, -0.3676937398375924, 0.1399707436170333, -0.17890078583540223, -0.0397590955181681, -0.08056714760077176, 0.03884765624726364, -0.0899435009455702, -0.418311512832213, 0.08707959817442804, -0.02949887953552216, -0.011100797230478606, 0.038948650035008636, -0.26782974715767066, -0.06489032342881157, 0.054976443307937516, 0.20547875422701126, 0.09034901244215399, 0.1695520931473194, -0.1574574409619204, -0.1487142280099395, 0.4246136493520024, -0.1009085845783084, -0.22327203104349294, 0.14007779949503116, -0.2767798060517681, -0.14916965925441059, 0.13544602646041162, 0.2113040870547021, 0.027115175896714267, -0.19635406763550284, 0.21808466420103267, -0.012088923235591884, 0.10461438885054637, 0.040012636550788565, 0.0700965199341095, 0.1839460300800112, 0.11800788623369635, -0.013908044158447458, 0.032348934263375005, -0.10927688106702468, -0.03283308970636314, -0.3914297177845171, -0.09713498508760504, -0.02670435604072877, 0.08553467268969134, -0.05574354002916509, -0.05350362058034642, 0.38941774666597395, 0.07762239395086318, 0.28265231604371027, 0.02616778911348221, 0.27766261829216915, 0.07714355670002088, 0.11156006370609098, 0.06762950914220635, 0.3191820035794193, 0.16894929153849514, 0.11512251336189928, -0.3000207243105589, 0.06181662893621101, 0.007532595291964172] |
1,803.00172 | Lovelock action with nonsmooth boundaries | We examine the variational problem in Lovelock gravity when the boundary
contains timelike and spacelike segments nonsmoothly glued. We show that two
kinds of contributions have to be added to the action. The first one is
associated to the presence of a boundary in every segment and it depends on
intrinsic and extrinsic curvatures. We can think of this contribution as adding
a total derivative to the usual surface term of Lovelock gravity. The second
one appears in every joint between two segments and it involves the integral
along the joint of the Jacobson-Myers entropy density weighted by the Lorentz
boost parameter which relates the orthonormal frames in each segment. We argue
that this term can be straightforwardly extended to the case of joints
involving null boundaries. As an application, we compute the contribution of
these terms to the complexity of global AdS in Lovelock gravity by using the
"complexity = action" proposal and we identify possible universal terms for
arbitrary values of the Lovelock couplings. We find that they depend on the
charge $a^*$ controlling the holographic entanglement entropy and on a new
constant that we characterize.
| gr-qc hep-th | we examine the variational problem in lovelock gravity when the boundary contains timelike and spacelike segments nonsmoothly glued we show that two kinds of contributions have to be added to the action the first one is associated to the presence of a boundary in every segment and it depends on intrinsic and extrinsic curvatures we can think of this contribution as adding a total derivative to the usual surface term of lovelock gravity the second one appears in every joint between two segments and it involves the integral along the joint of the jacobsonmyers entropy density weighted by the lorentz boost parameter which relates the orthonormal frames in each segment we argue that this term can be straightforwardly extended to the case of joints involving null boundaries as an application we compute the contribution of these terms to the complexity of global ads in lovelock gravity by using the complexity action proposal and we identify possible universal terms for arbitrary values of the lovelock couplings we find that they depend on the charge a controlling the holographic entanglement entropy and on a new constant that we characterize | [['we', 'examine', 'the', 'variational', 'problem', 'in', 'lovelock', 'gravity', 'when', 'the', 'boundary', 'contains', 'timelike', 'and', 'spacelike', 'segments', 'nonsmoothly', 'glued', 'we', 'show', 'that', 'two', 'kinds', 'of', 'contributions', 'have', 'to', 'be', 'added', 'to', 'the', 'action', 'the', 'first', 'one', 'is', 'associated', 'to', 'the', 'presence', 'of', 'a', 'boundary', 'in', 'every', 'segment', 'and', 'it', 'depends', 'on', 'intrinsic', 'and', 'extrinsic', 'curvatures', 'we', 'can', 'think', 'of', 'this', 'contribution', 'as', 'adding', 'a', 'total', 'derivative', 'to', 'the', 'usual', 'surface', 'term', 'of', 'lovelock', 'gravity', 'the', 'second', 'one', 'appears', 'in', 'every', 'joint', 'between', 'two', 'segments', 'and', 'it', 'involves', 'the', 'integral', 'along', 'the', 'joint', 'of', 'the', 'jacobsonmyers', 'entropy', 'density', 'weighted', 'by', 'the', 'lorentz', 'boost', 'parameter', 'which', 'relates', 'the', 'orthonormal', 'frames', 'in', 'each', 'segment', 'we', 'argue', 'that', 'this', 'term', 'can', 'be', 'straightforwardly', 'extended', 'to', 'the', 'case', 'of', 'joints', 'involving', 'null', 'boundaries', 'as', 'an', 'application', 'we', 'compute', 'the', 'contribution', 'of', 'these', 'terms', 'to', 'the', 'complexity', 'of', 'global', 'ads', 'in', 'lovelock', 'gravity', 'by', 'using', 'the', 'complexity', 'action', 'proposal', 'and', 'we', 'identify', 'possible', 'universal', 'terms', 'for', 'arbitrary', 'values', 'of', 'the', 'lovelock', 'couplings', 'we', 'find', 'that', 'they', 'depend', 'on', 'the', 'charge', 'a', 'controlling', 'the', 'holographic', 'entanglement', 'entropy', 'and', 'on', 'a', 'new', 'constant', 'that', 'we', 'characterize']] | [-0.15927805981902596, 0.10966777772044098, -0.06913796213348421, 0.06134543309105251, -0.08780501049290844, -0.11096608245316993, 0.0026247931973022573, 0.3171505318596003, -0.24779220841785166, -0.2661965349987946, 0.07555000654503922, -0.2983036139671178, -0.16440150118059413, 0.1348030596229442, -0.09154263003305955, 0.00909146392304901, -0.0024643343217162924, 0.10113191108323913, -0.09457509513206053, -0.25693981018774015, 0.38730545000815614, 0.0016906948755171529, 0.24203351602197332, 0.0739371193782053, 0.13149089826878538, 0.007161273227576266, -0.013130880262264433, 0.07019187388493416, -0.1450112402847816, 0.14021510085437128, 0.20668366442205394, 0.09099642557146795, 0.22169786411521827, -0.41040400018570644, -0.21352553627588214, 0.10368363254449585, 0.1034566075092849, 0.12118464191680783, 0.029042403936450852, -0.25811338709993537, 0.04923121368183809, -0.1480367936089356, -0.12661849670261544, -0.07843511250658511, 0.013739926949701208, -0.039000703270900695, -0.23725618692712588, 0.07850716827888002, 0.04845527204669972, -0.028529202167124033, -0.09265046223828738, -0.05157931782255437, -0.038911523265679454, 0.13944776113631258, 0.11610644725948213, 0.04957235348597667, 0.10617969682587082, -0.11912834506595811, -0.09405754654254904, 0.36880241842432454, -0.1162050892673632, -0.28287241095926036, 0.14524480405159015, -0.149931069025222, -0.15076087038954072, 0.08265444236722665, 0.13733212452227458, 0.1463742925186908, -0.12454262815509552, 0.10195936271883448, 0.004877167587656587, 0.14428500494456545, 0.1165573319948134, 0.033398968333510415, 0.22765441405845876, 0.06616090138176367, 0.07756737436922416, 0.2026569532805725, -0.08257185823201914, -0.07934783094837754, -0.3903689956750701, -0.217748427513942, -0.17843972099695932, 0.03700004351439881, -0.15271051761642582, -0.165411175208734, 0.38784349286047254, 0.13697853615727865, 0.19777086947143158, 0.05828198719642718, 0.24926890748338823, 0.12080305903704269, 0.10718394354120256, 0.08556209563745813, 0.2569132209195193, 0.0783423531407062, 0.04982194940828504, -0.24902956545141894, 0.02828747670559641, 0.1254366544813956] |
1,803.00173 | On the infinite tame-wild dichotomy conjecture and related problemns | We prove the tame-wild dichotomy conjecture, due to D. Simson, for infinite
dimensional algebras and coalgebras. The key part of the approach is proving
new representation theoretic characterizations local finiteness. Among other,
we show that the Ext quiver of the category ${\rm f.d.-}A$ of finite
dimensional representations of an arbitrary algebra $A$ is locally finite (i.e.
$\dim(\Ext^1(S,T))<\infty$ for all simple finite dimensional $A$-modules $S,T$)
if and only if for every dimension vector $\underline{d}$, the representations
of $A$ of dimension vector $\underline{d}$ are all contained in a finite
subcategory (a category of modules over a finite dimensional quotient algebra).
This allows one reduce the tame/wild problem to the finite dimensional case and
Drozd's classical result. Using this, we also prove a local-global principle
for tame/wild (in the sense of non-commutative localization): a category of
comodules is tame/not wild if and only if every ``finite" localization is so.
We give the relations to Simson's f.c.tame/f.c.wild dichotomy, and use the
methods and various embeddings we obtain to give connections to other problems
in the literature. We list several questions that naturally arise.
| math.RT math.QA math.RA | we prove the tamewild dichotomy conjecture due to d simson for infinite dimensional algebras and coalgebras the key part of the approach is proving new representation theoretic characterizations local finiteness among other we show that the ext quiver of the category rm fda of finite dimensional representations of an arbitrary algebra a is locally finite ie dimext1stinfty for all simple finite dimensional amodules st if and only if for every dimension vector underlined the representations of a of dimension vector underlined are all contained in a finite subcategory a category of modules over a finite dimensional quotient algebra this allows one reduce the tamewild problem to the finite dimensional case and drozds classical result using this we also prove a localglobal principle for tamewild in the sense of noncommutative localization a category of comodules is tamenot wild if and only if every finite localization is so we give the relations to simsons fctamefcwild dichotomy and use the methods and various embeddings we obtain to give connections to other problems in the literature we list several questions that naturally arise | [['we', 'prove', 'the', 'tamewild', 'dichotomy', 'conjecture', 'due', 'to', 'd', 'simson', 'for', 'infinite', 'dimensional', 'algebras', 'and', 'coalgebras', 'the', 'key', 'part', 'of', 'the', 'approach', 'is', 'proving', 'new', 'representation', 'theoretic', 'characterizations', 'local', 'finiteness', 'among', 'other', 'we', 'show', 'that', 'the', 'ext', 'quiver', 'of', 'the', 'category', 'rm', 'fda', 'of', 'finite', 'dimensional', 'representations', 'of', 'an', 'arbitrary', 'algebra', 'a', 'is', 'locally', 'finite', 'ie', 'dimext1stinfty', 'for', 'all', 'simple', 'finite', 'dimensional', 'amodules', 'st', 'if', 'and', 'only', 'if', 'for', 'every', 'dimension', 'vector', 'underlined', 'the', 'representations', 'of', 'a', 'of', 'dimension', 'vector', 'underlined', 'are', 'all', 'contained', 'in', 'a', 'finite', 'subcategory', 'a', 'category', 'of', 'modules', 'over', 'a', 'finite', 'dimensional', 'quotient', 'algebra', 'this', 'allows', 'one', 'reduce', 'the', 'tamewild', 'problem', 'to', 'the', 'finite', 'dimensional', 'case', 'and', 'drozds', 'classical', 'result', 'using', 'this', 'we', 'also', 'prove', 'a', 'localglobal', 'principle', 'for', 'tamewild', 'in', 'the', 'sense', 'of', 'noncommutative', 'localization', 'a', 'category', 'of', 'comodules', 'is', 'tamenot', 'wild', 'if', 'and', 'only', 'if', 'every', 'finite', 'localization', 'is', 'so', 'we', 'give', 'the', 'relations', 'to', 'simsons', 'fctamefcwild', 'dichotomy', 'and', 'use', 'the', 'methods', 'and', 'various', 'embeddings', 'we', 'obtain', 'to', 'give', 'connections', 'to', 'other', 'problems', 'in', 'the', 'literature', 'we', 'list', 'several', 'questions', 'that', 'naturally', 'arise']] | [-0.12137567438451308, 0.08484881193851054, -0.08183308938784259, 0.09545491308905184, -0.0992247366479465, -0.14916964504069516, -0.014290273196196981, 0.33773446909684157, -0.3832441895774433, -0.16442120540887117, 0.10770145258866251, -0.23571406701854097, -0.14574754383681077, 0.19258900732201126, -0.15618511664481569, -0.04894977551485811, 0.07487336838617921, 0.1272821872042758, -0.08887128004005977, -0.32186453045744984, 0.402640510004546, -0.06703976781905761, 0.26934007654764824, 0.07560022368424273, 0.155906213994271, 0.05446321047842503, -0.0057317120102899416, 0.054443564862012864, -0.1371564332340079, 0.14946739442047796, 0.3310359264577606, 0.10547452798645411, 0.25195178493192155, -0.33842986948621856, -0.168148935554283, 0.2058558280233826, 0.14395668906159698, 0.09696093321378742, -0.023035520303196142, -0.24300363803415426, 0.16915045737155845, -0.21653582915397626, -0.11303070947760716, -0.07087488019971976, 0.07426177952438592, -0.028555490103151115, -0.2539089538476297, 0.0068911991998486756, 0.12768528557249478, 0.11150124927184411, -0.11688304778487821, -0.060795612747647935, -0.0331813512296815, 0.1079723650496453, -0.0235886136335986, -0.004560376599963222, 0.03224963118920901, -0.10148856794199673, -0.15050002297719142, 0.3672934889101556, -0.025608671201126917, -0.23368101335795863, 0.20023120021314494, -0.15145542127213307, -0.1628258729965559, 0.06784557394417269, 0.06693405952836785, 0.15008277119469962, -0.040705746911200026, 0.2080376040968778, -0.14467006757855416, 0.0929169969619917, 0.07913851887253778, 0.03956599279173783, 0.11682148444333247, 0.12104203185598765, 0.09524478958653552, 0.14552631740391786, -0.006716596824782236, -0.019276643573705638, -0.3646054115306054, -0.19311654343668905, -0.10420520138527666, 0.10158853517180043, -0.11510984488846068, -0.1832623154297471, 0.3636273067231689, 0.1444334850679817, 0.18027204248522008, 0.1338841444812715, 0.24026889423174516, 0.09003127794712781, 0.06972102731067155, 0.07115572351430144, 0.11275572858218635, 0.23205726276550975, -0.02038797645829618, -0.11075794470097337, -0.02933211608523769, 0.23224977700571928] |
1,803.00174 | Milne-like Spacetimes and their Symmetries | When developing a quantum theory for a physical system, one determines the
system's symmetry group and its irreducible unitary representations. For
Minkowski space, the symmetry group is the Poincar\'e group, $\mathbb{R}^4
\rtimes \text{O}(1,3)$, and the irreducible unitary representations are
interpreted as elementary particles which determine the particle's mass and
spin. We determine the symmetry group for Milne-like spacetimes, a class of
cosmological spacetimes, to be $\mathbb{R} \times \text{O}(1,3)$ and classify
their irreducible unitary representations. Again they represent particles with
mass and spin. Unlike the classification for the Poincar\'e group, we do not
obtain any faster-than-light particles. The factor $\mathbb{R}$ corresponds to
cosmic time translations. These generate a mass Casimir operator which yields a
Lorentz invariant Dirac equation on Milne-like spacetimes. In fact it's just
the original Dirac equation multiplied by a conformal factor $\Omega$.
Therefore many of the invariants and symmetries still hold. We offer a new
interpretation of the negative energy states and propose a possible solution to
the matter-antimatter asymmetry problem in our universe.
| gr-qc | when developing a quantum theory for a physical system one determines the systems symmetry group and its irreducible unitary representations for minkowski space the symmetry group is the poincare group mathbbr4 rtimes texto13 and the irreducible unitary representations are interpreted as elementary particles which determine the particles mass and spin we determine the symmetry group for milnelike spacetimes a class of cosmological spacetimes to be mathbbr times texto13 and classify their irreducible unitary representations again they represent particles with mass and spin unlike the classification for the poincare group we do not obtain any fasterthanlight particles the factor mathbbr corresponds to cosmic time translations these generate a mass casimir operator which yields a lorentz invariant dirac equation on milnelike spacetimes in fact its just the original dirac equation multiplied by a conformal factor omega therefore many of the invariants and symmetries still hold we offer a new interpretation of the negative energy states and propose a possible solution to the matterantimatter asymmetry problem in our universe | [['when', 'developing', 'a', 'quantum', 'theory', 'for', 'a', 'physical', 'system', 'one', 'determines', 'the', 'systems', 'symmetry', 'group', 'and', 'its', 'irreducible', 'unitary', 'representations', 'for', 'minkowski', 'space', 'the', 'symmetry', 'group', 'is', 'the', 'poincare', 'group', 'mathbbr4', 'rtimes', 'texto13', 'and', 'the', 'irreducible', 'unitary', 'representations', 'are', 'interpreted', 'as', 'elementary', 'particles', 'which', 'determine', 'the', 'particles', 'mass', 'and', 'spin', 'we', 'determine', 'the', 'symmetry', 'group', 'for', 'milnelike', 'spacetimes', 'a', 'class', 'of', 'cosmological', 'spacetimes', 'to', 'be', 'mathbbr', 'times', 'texto13', 'and', 'classify', 'their', 'irreducible', 'unitary', 'representations', 'again', 'they', 'represent', 'particles', 'with', 'mass', 'and', 'spin', 'unlike', 'the', 'classification', 'for', 'the', 'poincare', 'group', 'we', 'do', 'not', 'obtain', 'any', 'fasterthanlight', 'particles', 'the', 'factor', 'mathbbr', 'corresponds', 'to', 'cosmic', 'time', 'translations', 'these', 'generate', 'a', 'mass', 'casimir', 'operator', 'which', 'yields', 'a', 'lorentz', 'invariant', 'dirac', 'equation', 'on', 'milnelike', 'spacetimes', 'in', 'fact', 'its', 'just', 'the', 'original', 'dirac', 'equation', 'multiplied', 'by', 'a', 'conformal', 'factor', 'omega', 'therefore', 'many', 'of', 'the', 'invariants', 'and', 'symmetries', 'still', 'hold', 'we', 'offer', 'a', 'new', 'interpretation', 'of', 'the', 'negative', 'energy', 'states', 'and', 'propose', 'a', 'possible', 'solution', 'to', 'the', 'matterantimatter', 'asymmetry', 'problem', 'in', 'our', 'universe']] | [-0.16924860359953217, 0.17957897834684244, -0.11891843814959341, 0.09635287278300583, -0.10863005461898155, -0.1418236063725156, -0.02508473261358875, 0.332717243979526, -0.24950296906527222, -0.2458789381198585, 0.07251438795781989, -0.26971451342446595, -0.0894771715652385, 0.13220486914875304, -0.029637315549047256, 0.028073871153315937, 0.008815316012038327, 0.09940240174253676, -0.1422626354441291, -0.23181262494791754, 0.3519290264769707, -0.010506953864511693, 0.24551193484548117, 0.004961331426052422, 0.15670067325969816, -0.0058937587196052806, -0.010303522543215034, -0.056091558700356425, -0.11130209373563625, 0.06785956831867579, 0.23717515783458268, 0.06370654041742588, 0.1489987172024529, -0.3927878442038668, -0.20377979427008186, 0.1935689852448044, 0.1594568898407288, 0.10262070655135619, -0.05755442841100597, -0.35692160590778943, 0.03089581001493171, -0.1676584759545399, -0.1977160027188181, -0.09457293813821019, 0.036804053955054816, -0.10925823456086729, -0.22052811047278073, 0.09676658968361686, 0.06870956346392632, 0.005544466412308194, -0.09414939065719387, -0.05415917936039566, -0.031950640019381464, 0.0889704922668809, 0.06230282196320775, 0.039378561002838354, 0.16260866924663211, -0.12118251563054112, -0.12450573948728738, 0.45731600985021853, -0.024483476068381582, -0.2727780808061475, 0.14061961905560855, -0.1648611379474992, -0.15674849071187852, 0.09570434460950243, 0.13568592779395147, 0.11431563577739658, -0.10571438033127002, 0.17193469277720774, -0.08881772176089991, 0.10413081682835161, 0.0829396484130085, 0.03040366762931027, 0.22487422037250704, 0.06172195518433355, 0.0799284182192911, 0.04077537964799487, 0.045938409630652155, -0.0547987830678921, -0.36738642996813103, -0.22331466481782405, -0.1557250915864687, 0.1367447416614152, -0.12907080707452956, -0.16058263895328997, 0.4006636777251005, 0.07628633405276071, 0.18352753941321792, 0.09604075678238054, 0.18034495953924773, 0.10961680463231283, 0.09224908171106619, 0.10116122844636088, 0.1905438722034621, 0.16995738851042783, 0.0313114449076593, -0.21238242531487742, -0.04822153898478463, 0.14527359239404974] |
1,803.00175 | Separability of multi-qubit states in terms of diagonal and
anti-diagonal entries | We give separability criteria for general multi-qubit states in terms of
diagonal and anti-diagonal entries. We define two numbers which are obtained
from diagonal and anti-diagonal entries, respectively, and compare them to get
criteria. They give rise to characterizations of separability when all the
entries are zero except for diagonal and anti-diagonal, like
Greenberger-Horne-Zeilinger diagonal states. The criteria is strong enough to
get nonzero volume of entanglement with positive partial transposes.
| quant-ph | we give separability criteria for general multiqubit states in terms of diagonal and antidiagonal entries we define two numbers which are obtained from diagonal and antidiagonal entries respectively and compare them to get criteria they give rise to characterizations of separability when all the entries are zero except for diagonal and antidiagonal like greenbergerhornezeilinger diagonal states the criteria is strong enough to get nonzero volume of entanglement with positive partial transposes | [['we', 'give', 'separability', 'criteria', 'for', 'general', 'multiqubit', 'states', 'in', 'terms', 'of', 'diagonal', 'and', 'antidiagonal', 'entries', 'we', 'define', 'two', 'numbers', 'which', 'are', 'obtained', 'from', 'diagonal', 'and', 'antidiagonal', 'entries', 'respectively', 'and', 'compare', 'them', 'to', 'get', 'criteria', 'they', 'give', 'rise', 'to', 'characterizations', 'of', 'separability', 'when', 'all', 'the', 'entries', 'are', 'zero', 'except', 'for', 'diagonal', 'and', 'antidiagonal', 'like', 'greenbergerhornezeilinger', 'diagonal', 'states', 'the', 'criteria', 'is', 'strong', 'enough', 'to', 'get', 'nonzero', 'volume', 'of', 'entanglement', 'with', 'positive', 'partial', 'transposes']] | [-0.1611605879758865, 0.1587750615263489, 0.003773320308873351, 0.07656641078384882, -0.036938021267751156, -0.25385678819262647, 0.04148056948373855, 0.35866483899069507, -0.22498135224089655, -0.2119183218972364, 0.14337765193760763, -0.3056548883692479, -0.0767053629625851, 0.11110121809260946, -0.04730843818208701, 0.046894004384816536, 0.06479062372818589, 0.08232857303982469, -0.16418571864143278, -0.31835973434294507, 0.3577048490725746, -0.08251873310655355, 0.2221887763196104, 0.05066377234081147, 0.07540453161099847, -0.02277148006037927, -0.01956770378886394, -0.00032964813142595154, -0.1063038176909404, 0.0584971565199019, 0.2714005256412734, 0.16553337035149757, 0.1920512989360157, -0.38813550909325273, -0.019787745432219873, 0.19235542101759306, 0.08582401858039305, 0.13262814193026123, 0.02795258122430721, -0.332161612428305, 0.11386509096859888, -0.15649526810903155, -0.15934352581979525, -0.1935475751836325, 0.04887034071110923, 0.013030142234769506, -0.3304133413779274, 0.10632107898750355, 0.10624583655784667, 0.022038384134107282, -0.03200584124039176, -0.23335791815196913, -0.0029465062150233227, 0.13413565821534115, -0.006395478001598951, -0.09466410000172353, 0.04755747168075661, -0.048411332090503315, -0.09412737500945657, 0.33950630642316293, -0.012558787671929474, -0.26344556665756336, 0.15176345907728855, -0.16450225035856728, -0.09119732236542122, 0.073942347055852, 0.10238094139896647, 0.04738637733824131, -0.08968637857203286, 0.02885566383901931, -0.09290850473056272, 0.11394944645359482, 0.12892870159006456, 0.17672911314966, 0.12815939257262457, -0.1183394534467444, 0.14433219409744505, 0.21385848602775195, 0.02414018022262124, -0.06620620917135352, -0.35152940503256, -0.18828847865954462, -0.18747635195064555, 0.11244049308900263, -0.10509907234989724, -0.2128641784820758, 0.41689414719224605, 0.08616953888829325, 0.22696585774841443, 0.10147423463919475, 0.19730579699258463, 0.10661177796661743, 0.046361711335585296, 0.05199014792927134, 0.14880971461665674, 0.2766528334337431, 0.028241312144402887, -0.13762371660813585, 0.060570822799132326, 0.12323046019169646] |
1,803.00176 | Reconstruction of primordial tensor power spectra from B-mode
polarization of the cosmic microwave background | Given observations of B-mode polarization power spectrum of the cosmic
microwave background (CMB), we can reconstruct power spectra of primordial
tensor modes from the early Universe without assuming their functional form
such as a power-law spectrum. Shape of the reconstructed spectra can then be
used to probe the origin of tensor modes in a model-independent manner. We use
the Fisher matrix to calculate the covariance matrix of tensor power spectra
reconstructed in bins. We find that the power spectra are best reconstructed at
wavenumbers in the vicinity of $k\approx 6\times 10^{-4}$ and $5\times
10^{-3}~{\rm Mpc}^{-1}$, which correspond to the "reionization bump" at
$\ell\lesssim 6$ and "recombination bump" at $\ell\approx 80$ of the CMB B-mode
power spectrum, respectively. The error bar between these two wavenumbers is
larger because of lack of the signal between the reionization and recombination
bumps. The error bars increase sharply towards smaller (larger) wavenumbers
because of the cosmic variance (CMB lensing and instrumental noise). To
demonstrate utility of the reconstructed power spectra we investigate whether
we can distinguish between various sources of tensor modes including those from
the vacuum metric fluctuation and SU(2) gauge fields during single-field
slow-roll inflation, open inflation and massive gravity inflation. The results
depend on the model parameters, but we find that future CMB experiments are
sensitive to differences in these models. We make our calculation tool
available on-line.
| astro-ph.CO gr-qc hep-ph hep-th | given observations of bmode polarization power spectrum of the cosmic microwave background cmb we can reconstruct power spectra of primordial tensor modes from the early universe without assuming their functional form such as a powerlaw spectrum shape of the reconstructed spectra can then be used to probe the origin of tensor modes in a modelindependent manner we use the fisher matrix to calculate the covariance matrix of tensor power spectra reconstructed in bins we find that the power spectra are best reconstructed at wavenumbers in the vicinity of kapprox 6times 104 and 5times 103rm mpc1 which correspond to the reionization bump at elllesssim 6 and recombination bump at ellapprox 80 of the cmb bmode power spectrum respectively the error bar between these two wavenumbers is larger because of lack of the signal between the reionization and recombination bumps the error bars increase sharply towards smaller larger wavenumbers because of the cosmic variance cmb lensing and instrumental noise to demonstrate utility of the reconstructed power spectra we investigate whether we can distinguish between various sources of tensor modes including those from the vacuum metric fluctuation and su2 gauge fields during singlefield slowroll inflation open inflation and massive gravity inflation the results depend on the model parameters but we find that future cmb experiments are sensitive to differences in these models we make our calculation tool available online | [['given', 'observations', 'of', 'bmode', 'polarization', 'power', 'spectrum', 'of', 'the', 'cosmic', 'microwave', 'background', 'cmb', 'we', 'can', 'reconstruct', 'power', 'spectra', 'of', 'primordial', 'tensor', 'modes', 'from', 'the', 'early', 'universe', 'without', 'assuming', 'their', 'functional', 'form', 'such', 'as', 'a', 'powerlaw', 'spectrum', 'shape', 'of', 'the', 'reconstructed', 'spectra', 'can', 'then', 'be', 'used', 'to', 'probe', 'the', 'origin', 'of', 'tensor', 'modes', 'in', 'a', 'modelindependent', 'manner', 'we', 'use', 'the', 'fisher', 'matrix', 'to', 'calculate', 'the', 'covariance', 'matrix', 'of', 'tensor', 'power', 'spectra', 'reconstructed', 'in', 'bins', 'we', 'find', 'that', 'the', 'power', 'spectra', 'are', 'best', 'reconstructed', 'at', 'wavenumbers', 'in', 'the', 'vicinity', 'of', 'kapprox', '6times', '104', 'and', '5times', '103rm', 'mpc1', 'which', 'correspond', 'to', 'the', 'reionization', 'bump', 'at', 'elllesssim', '6', 'and', 'recombination', 'bump', 'at', 'ellapprox', '80', 'of', 'the', 'cmb', 'bmode', 'power', 'spectrum', 'respectively', 'the', 'error', 'bar', 'between', 'these', 'two', 'wavenumbers', 'is', 'larger', 'because', 'of', 'lack', 'of', 'the', 'signal', 'between', 'the', 'reionization', 'and', 'recombination', 'bumps', 'the', 'error', 'bars', 'increase', 'sharply', 'towards', 'smaller', 'larger', 'wavenumbers', 'because', 'of', 'the', 'cosmic', 'variance', 'cmb', 'lensing', 'and', 'instrumental', 'noise', 'to', 'demonstrate', 'utility', 'of', 'the', 'reconstructed', 'power', 'spectra', 'we', 'investigate', 'whether', 'we', 'can', 'distinguish', 'between', 'various', 'sources', 'of', 'tensor', 'modes', 'including', 'those', 'from', 'the', 'vacuum', 'metric', 'fluctuation', 'and', 'su2', 'gauge', 'fields', 'during', 'singlefield', 'slowroll', 'inflation', 'open', 'inflation', 'and', 'massive', 'gravity', 'inflation', 'the', 'results', 'depend', 'on', 'the', 'model', 'parameters', 'but', 'we', 'find', 'that', 'future', 'cmb', 'experiments', 'are', 'sensitive', 'to', 'differences', 'in', 'these', 'models', 'we', 'make', 'our', 'calculation', 'tool', 'available', 'online']] | [-0.09163794269171271, 0.14930345027695155, -0.07607382905475828, 0.11334859961035983, -0.0654967105525043, -0.08182491775214738, -0.05852399261789891, 0.35837168106551703, -0.2339732321514954, -0.3233943768896459, 0.0456714749218282, -0.32749321754502575, -0.07033673971396896, 0.17746450727809615, 0.035979127277287824, 0.013713074909869285, 0.026951832538656066, -0.03265943226148992, -0.036032930118509825, -0.2325709182073659, 0.28805275745813497, 0.16470919465604938, 0.27207701584423144, 0.008948038591780758, 0.047671478494602064, -0.08959578752385831, -0.08378560589773239, -0.018586397601654175, -0.14190276594340864, 0.05852667479858264, 0.23339153377826863, 0.16725935020372765, 0.1550558907457883, -0.4004149589264164, -0.2043859767866634, 0.17647458589841833, 0.14919514242102253, 0.11564028353906294, 0.01708786988700946, -0.25133038920853124, 0.09709626775460557, -0.14102845406108247, -0.05732718489876643, -0.06810141579079054, -0.028075875533101834, -0.05464527440212041, -0.2853431902780503, 0.17762049980280278, -0.022861823766694232, 0.027209471422865724, -0.047177191837113844, -0.12045342472909365, -0.05452824799721006, 0.0694357936087155, 0.07761289133016532, 0.011817481260027105, 0.18719493843351317, -0.141127441880969, -0.03606333547947615, 0.3795654682557931, -0.15553544630065758, -0.08829466242701706, 0.08803822635054852, -0.22278052866324963, -0.13441356295818643, 0.12286197100106659, 0.18271657985707732, 0.04023952291973463, -0.09567977446213827, 0.08871085664609744, 0.08826568834813295, 0.20398556294931364, 0.11862506615863372, 0.07799299701840197, 0.3028014737375305, 0.046105703603233156, 0.03950711390862769, 0.09063066344397076, -0.14414591534553606, 0.019631986224001884, -0.32337779236701936, -0.04187088742732705, -0.1803755995042754, 0.09473272384684203, -0.16846379252169713, -0.14499402473514808, 0.4424323189202119, 0.14677658294888, 0.23710627783506086, 0.08208130217678598, 0.3230542797714768, 0.08188688842398403, 0.03166068914095022, 0.0724486386356051, 0.33334252248575863, 0.1616698325152171, 0.09628421230554844, -0.22630445204625746, -0.017949371744952765, -0.032758598549670614] |
1,803.00177 | Discovery of an extremely-luminous dust-obscured galaxy observed with
SDSS, WISE, JCMT, and SMA | We present the discovery of an extremely-luminous dust-obscured galaxy (DOG)
at $z_{\rm spec}$ = 3.703, WISE J101326.25+611220.1. This DOG is selected as a
candidate of extremely-luminous infrared (IR) galaxies based on the photometry
from the Sloan Digital Sky Survey and Wide-field Infrared Survey Explorer. In
order to derive its accurate IR luminosity, we perform follow-up observations
at 450 and 850 $\mu$m using the Submillimetre Common User Bolometer Array 2 on
the James Clerk Maxwell Telescope, and at 870 and 1300 $\mu$m using the
Submillimeter Array, which enable us to pin down its IR Spectral Energy
Distribution (SED). We perform SED fitting using 14 photometric data (0.4 -
1300 $\mu$m) and estimate its IR luminosity, $L_{\rm IR}$ (8-1000 $\mu$m), to
be $2.2^{+1.5}_{-1.0}$ $\times 10^{14}$ $L_{\odot}$, making it one of the most
luminous IR galaxies in the Universe. The energy contribution from an active
galactic nucleus (AGN) to the IR luminosity is $94^{+6}_{-20}$%, which
indicates it is an AGN-dominated DOG. On the other hand, its stellar mass
($M_*$) and star formation rate (SFR) are $\log \,(M_\ast/M_{\odot})$ =
$11.2^{+0.6}_{-0.2}$ and $\log \,({\rm SFR}/M_{\odot}\,{\rm yr}^{-1}$) =
$3.1^{+0.2}_{-0.1}$, respectively, which means that this DOG can be considered
as a starburst galaxy in $M_*$--SFR plane. This extremely-luminous DOG shows
significant AGN and star forming activity that provides us an important
laboratory to probe the maximum phase of the co-evolution of galaxies and
supermassive black holes.
| astro-ph.GA | we present the discovery of an extremelyluminous dustobscured galaxy dog at z_rm spec 3703 wise j101326256112201 this dog is selected as a candidate of extremelyluminous infrared ir galaxies based on the photometry from the sloan digital sky survey and widefield infrared survey explorer in order to derive its accurate ir luminosity we perform followup observations at 450 and 850 mum using the submillimetre common user bolometer array 2 on the james clerk maxwell telescope and at 870 and 1300 mum using the submillimeter array which enable us to pin down its ir spectral energy distribution sed we perform sed fitting using 14 photometric data 04 1300 mum and estimate its ir luminosity l_rm ir 81000 mum to be 2215_10 times 1014 l_odot making it one of the most luminous ir galaxies in the universe the energy contribution from an active galactic nucleus agn to the ir luminosity is 946_20 which indicates it is an agndominated dog on the other hand its stellar mass m_ and star formation rate sfr are log m_astm_odot 11206_02 and log rm sfrm_odotrm yr1 3102_01 respectively which means that this dog can be considered as a starburst galaxy in m_sfr plane this extremelyluminous dog shows significant agn and star forming activity that provides us an important laboratory to probe the maximum phase of the coevolution of galaxies and supermassive black holes | [['we', 'present', 'the', 'discovery', 'of', 'an', 'extremelyluminous', 'dustobscured', 'galaxy', 'dog', 'at', 'z_rm', 'spec', '3703', 'wise', 'j101326256112201', 'this', 'dog', 'is', 'selected', 'as', 'a', 'candidate', 'of', 'extremelyluminous', 'infrared', 'ir', 'galaxies', 'based', 'on', 'the', 'photometry', 'from', 'the', 'sloan', 'digital', 'sky', 'survey', 'and', 'widefield', 'infrared', 'survey', 'explorer', 'in', 'order', 'to', 'derive', 'its', 'accurate', 'ir', 'luminosity', 'we', 'perform', 'followup', 'observations', 'at', '450', 'and', '850', 'mum', 'using', 'the', 'submillimetre', 'common', 'user', 'bolometer', 'array', '2', 'on', 'the', 'james', 'clerk', 'maxwell', 'telescope', 'and', 'at', '870', 'and', '1300', 'mum', 'using', 'the', 'submillimeter', 'array', 'which', 'enable', 'us', 'to', 'pin', 'down', 'its', 'ir', 'spectral', 'energy', 'distribution', 'sed', 'we', 'perform', 'sed', 'fitting', 'using', '14', 'photometric', 'data', '04', '1300', 'mum', 'and', 'estimate', 'its', 'ir', 'luminosity', 'l_rm', 'ir', '81000', 'mum', 'to', 'be', '2215_10', 'times', '1014', 'l_odot', 'making', 'it', 'one', 'of', 'the', 'most', 'luminous', 'ir', 'galaxies', 'in', 'the', 'universe', 'the', 'energy', 'contribution', 'from', 'an', 'active', 'galactic', 'nucleus', 'agn', 'to', 'the', 'ir', 'luminosity', 'is', '946_20', 'which', 'indicates', 'it', 'is', 'an', 'agndominated', 'dog', 'on', 'the', 'other', 'hand', 'its', 'stellar', 'mass', 'm_', 'and', 'star', 'formation', 'rate', 'sfr', 'are', 'log', 'm_astm_odot', '11206_02', 'and', 'log', 'rm', 'sfrm_odotrm', 'yr1', '3102_01', 'respectively', 'which', 'means', 'that', 'this', 'dog', 'can', 'be', 'considered', 'as', 'a', 'starburst', 'galaxy', 'in', 'm_sfr', 'plane', 'this', 'extremelyluminous', 'dog', 'shows', 'significant', 'agn', 'and', 'star', 'forming', 'activity', 'that', 'provides', 'us', 'an', 'important', 'laboratory', 'to', 'probe', 'the', 'maximum', 'phase', 'of', 'the', 'coevolution', 'of', 'galaxies', 'and', 'supermassive', 'black', 'holes']] | [0.0224215473524416, 0.02079050724031021, -0.08424782776805363, 0.11953650732188736, -0.13021313949364777, -0.05637149855741151, 0.05685854612500938, 0.4839685180705024, -0.0764852203869954, -0.35470152376262154, 0.10527509516110371, -0.3666306285179097, 0.0017909472348427902, 0.17911120754020163, -0.027354444946974654, -0.05155572668834245, -0.035179765792946294, -0.15237973518159292, 0.016467285853891407, -0.27557401458592445, 0.24108070520403452, 0.14026750406020716, 0.18840436729045423, -0.04489410966238061, 0.09496427534124707, -0.0883725512492126, -0.11631993345329411, -0.09934404401372285, -0.1956758306888129, 0.014369124078859477, 0.302304870099229, 0.15205460197726034, 0.20432741820416733, -0.28617583514620726, -0.13532931767361553, 0.08270282831391719, 0.17328133324711886, -0.03497001721702312, -0.028405940794326432, -0.2606196103694096, 0.06001775969483265, -0.17283672790285454, -0.15758358958705124, 0.09877455587494591, 0.04164441299973456, 0.006245088824267673, -0.22890558337062367, 0.1263251376878385, -0.046671666447328376, 0.11177913096763159, -0.13382619135740922, -0.09327136978643126, -0.11013450349423796, 0.08169803166545112, -0.039671955025248805, 0.1812692604120183, 0.23896582661511284, -0.15601287127395913, -0.0027525435695126992, 0.3632303539399891, -0.07074282014876451, 0.09732915857407055, 0.22704121842448807, -0.18372615294522482, -0.18155717141458502, 0.15955650071362587, 0.14050190205171229, 0.14982482442445202, -0.20344947838994193, 0.02741286460470757, -0.0023657307836767202, 0.3169106507172051, 0.04336993493454437, 0.13183382645126573, 0.3646006350443788, 0.13310604025482212, 0.05252893782831031, 0.10435755255224914, -0.3048826816149447, 0.021121686407403178, -0.23260299891199424, -0.07952606845927504, -0.16240029610942233, 0.17507427737577158, -0.1710942836815771, -0.05758663751057362, 0.3091901808926096, 0.1326766223269281, 0.22377989279450722, 0.09750570449712324, 0.29432703377171665, 0.03964535871304818, 0.14917367055042557, 0.09439788945657138, 0.30546569271804125, 0.08273552442033304, 0.09750276427295008, -0.25158327973881506, -0.05235166594196859, 0.02293968134768069] |
1,803.00178 | Braiding a novel kind of Majorana-like quasiparticles in nanowire
quantum dots | For an electrically driven electron confined in a nanowire quantum dot with
spin-orbit coupling (SOC), we find a SOC-magnetism phase-locked condition under
which we derive a complete set of Schr\"odinger kitten states which contains
some novel degenerate ground states with oscillating wave packets or stationary
double packets in undriven case. We identify such wave packets as Majorana-like
quasiparticles and demonstrate that they obey non-Abelian statistics and behave
similarly to neutral particles. The braiding operations based on the
interchanges of the degenerate non-Abelian quasiparticles are shown, which
shift the system between different ground states and may be insensitive to
perturbations and weak noise from the environment. The results could be tested
experimentally in the existing setups and could be treated as the leading-order
results to directly extended to an array of weakly coupled single-electron
quantum dots for topological quantum computation.
| cond-mat.mes-hall quant-ph | for an electrically driven electron confined in a nanowire quantum dot with spinorbit coupling soc we find a socmagnetism phaselocked condition under which we derive a complete set of schrodinger kitten states which contains some novel degenerate ground states with oscillating wave packets or stationary double packets in undriven case we identify such wave packets as majoranalike quasiparticles and demonstrate that they obey nonabelian statistics and behave similarly to neutral particles the braiding operations based on the interchanges of the degenerate nonabelian quasiparticles are shown which shift the system between different ground states and may be insensitive to perturbations and weak noise from the environment the results could be tested experimentally in the existing setups and could be treated as the leadingorder results to directly extended to an array of weakly coupled singleelectron quantum dots for topological quantum computation | [['for', 'an', 'electrically', 'driven', 'electron', 'confined', 'in', 'a', 'nanowire', 'quantum', 'dot', 'with', 'spinorbit', 'coupling', 'soc', 'we', 'find', 'a', 'socmagnetism', 'phaselocked', 'condition', 'under', 'which', 'we', 'derive', 'a', 'complete', 'set', 'of', 'schrodinger', 'kitten', 'states', 'which', 'contains', 'some', 'novel', 'degenerate', 'ground', 'states', 'with', 'oscillating', 'wave', 'packets', 'or', 'stationary', 'double', 'packets', 'in', 'undriven', 'case', 'we', 'identify', 'such', 'wave', 'packets', 'as', 'majoranalike', 'quasiparticles', 'and', 'demonstrate', 'that', 'they', 'obey', 'nonabelian', 'statistics', 'and', 'behave', 'similarly', 'to', 'neutral', 'particles', 'the', 'braiding', 'operations', 'based', 'on', 'the', 'interchanges', 'of', 'the', 'degenerate', 'nonabelian', 'quasiparticles', 'are', 'shown', 'which', 'shift', 'the', 'system', 'between', 'different', 'ground', 'states', 'and', 'may', 'be', 'insensitive', 'to', 'perturbations', 'and', 'weak', 'noise', 'from', 'the', 'environment', 'the', 'results', 'could', 'be', 'tested', 'experimentally', 'in', 'the', 'existing', 'setups', 'and', 'could', 'be', 'treated', 'as', 'the', 'leadingorder', 'results', 'to', 'directly', 'extended', 'to', 'an', 'array', 'of', 'weakly', 'coupled', 'singleelectron', 'quantum', 'dots', 'for', 'topological', 'quantum', 'computation']] | [-0.18212537797070041, 0.254128509460724, -0.042100314003671854, 0.06477371108401027, -0.015940368291921914, -0.21372982666935716, 0.03157883593171457, 0.3542529416162575, -0.23443198320624567, -0.2563510014459599, 0.030532462332579915, -0.2902254941198381, -0.1207532696560889, 0.19575739923891597, -0.0013369197146950182, 0.06550983534923391, 0.05600076006637697, 0.02416650623427299, -0.048290498385145125, -0.2029859712752311, 0.30414445040599053, -0.010759975314916423, 0.3039857550841365, 0.024877315356338775, 0.06363274985114517, -0.007970272352500562, 0.08535576701936973, 0.007928139237396797, -0.08677445944809681, 0.03916558394237232, 0.2389097267434303, -0.017181220629751897, 0.18179010302908177, -0.49422960361276846, -0.17627736407102665, 0.07179667772320301, 0.15736174456327243, 0.18710972555572222, -0.03366463257006599, -0.39784025802931655, 0.032236475011576775, -0.1733346084618698, -0.13765188831620026, -0.10846605397207473, -0.010274001451182192, 0.03380217467539309, -0.2834204236801336, 0.06682954021422463, 0.04326134116685801, -0.03201771937934952, -0.031615591267177806, -0.03860314929371943, -0.045290861587526036, 0.0948658294054558, -0.014956241446560707, -0.009824543718106883, 0.1506759245218574, -0.12269495870345239, -0.15583741210360566, 0.36684030874807766, -0.09967956759973659, -0.22743432161708674, 0.19468089511476294, -0.12374227803767375, -0.08580789737659844, 0.11332071976115306, 0.14172788628333155, 0.08382709500163901, -0.1227079834063551, 0.061690965820478436, -0.038201267425893755, 0.15909804529307978, 0.06538239253037002, 0.14195438757187862, 0.2676601245918352, 0.08906156597810838, 0.08163150933746627, 0.1606775852185134, -0.07331598668015035, -0.11971018800218387, -0.30036586041788343, -0.15766910482721025, -0.21897485230853647, 0.10750370806119358, 0.026594272658310703, -0.20407530797904433, 0.4046026612294541, 0.12571579200785904, 0.1628352319686741, -0.04193260803889564, 0.22587486188791261, 0.17563869973294102, 0.04878050680744691, 0.0830598413147896, 0.2281228328687628, 0.1645835206196036, 0.03409048261296382, -0.25291648365901376, -0.045979031425752284, 0.011895734725681983] |
1,803.00179 | Matching Natural Language Sentences with Hierarchical Sentence
Factorization | Semantic matching of natural language sentences or identifying the
relationship between two sentences is a core research problem underlying many
natural language tasks. Depending on whether training data is available, prior
research has proposed both unsupervised distance-based schemes and supervised
deep learning schemes for sentence matching. However, previous approaches
either omit or fail to fully utilize the ordered, hierarchical, and flexible
structures of language objects, as well as the interactions between them. In
this paper, we propose Hierarchical Sentence Factorization---a technique to
factorize a sentence into a hierarchical representation, with the components at
each different scale reordered into a "predicate-argument" form. The proposed
sentence factorization technique leads to the invention of: 1) a new
unsupervised distance metric which calculates the semantic distance between a
pair of text snippets by solving a penalized optimal transport problem while
preserving the logical relationship of words in the reordered sentences, and 2)
new multi-scale deep learning models for supervised semantic training, based on
factorized sentence hierarchies. We apply our techniques to text-pair
similarity estimation and text-pair relationship classification tasks, based on
multiple datasets such as STSbenchmark, the Microsoft Research paraphrase
identification (MSRP) dataset, the SICK dataset, etc. Extensive experiments
show that the proposed hierarchical sentence factorization can be used to
significantly improve the performance of existing unsupervised distance-based
metrics as well as multiple supervised deep learning models based on the
convolutional neural network (CNN) and long short-term memory (LSTM).
| cs.CL | semantic matching of natural language sentences or identifying the relationship between two sentences is a core research problem underlying many natural language tasks depending on whether training data is available prior research has proposed both unsupervised distancebased schemes and supervised deep learning schemes for sentence matching however previous approaches either omit or fail to fully utilize the ordered hierarchical and flexible structures of language objects as well as the interactions between them in this paper we propose hierarchical sentence factorizationa technique to factorize a sentence into a hierarchical representation with the components at each different scale reordered into a predicateargument form the proposed sentence factorization technique leads to the invention of 1 a new unsupervised distance metric which calculates the semantic distance between a pair of text snippets by solving a penalized optimal transport problem while preserving the logical relationship of words in the reordered sentences and 2 new multiscale deep learning models for supervised semantic training based on factorized sentence hierarchies we apply our techniques to textpair similarity estimation and textpair relationship classification tasks based on multiple datasets such as stsbenchmark the microsoft research paraphrase identification msrp dataset the sick dataset etc extensive experiments show that the proposed hierarchical sentence factorization can be used to significantly improve the performance of existing unsupervised distancebased metrics as well as multiple supervised deep learning models based on the convolutional neural network cnn and long shortterm memory lstm | [['semantic', 'matching', 'of', 'natural', 'language', 'sentences', 'or', 'identifying', 'the', 'relationship', 'between', 'two', 'sentences', 'is', 'a', 'core', 'research', 'problem', 'underlying', 'many', 'natural', 'language', 'tasks', 'depending', 'on', 'whether', 'training', 'data', 'is', 'available', 'prior', 'research', 'has', 'proposed', 'both', 'unsupervised', 'distancebased', 'schemes', 'and', 'supervised', 'deep', 'learning', 'schemes', 'for', 'sentence', 'matching', 'however', 'previous', 'approaches', 'either', 'omit', 'or', 'fail', 'to', 'fully', 'utilize', 'the', 'ordered', 'hierarchical', 'and', 'flexible', 'structures', 'of', 'language', 'objects', 'as', 'well', 'as', 'the', 'interactions', 'between', 'them', 'in', 'this', 'paper', 'we', 'propose', 'hierarchical', 'sentence', 'factorizationa', 'technique', 'to', 'factorize', 'a', 'sentence', 'into', 'a', 'hierarchical', 'representation', 'with', 'the', 'components', 'at', 'each', 'different', 'scale', 'reordered', 'into', 'a', 'predicateargument', 'form', 'the', 'proposed', 'sentence', 'factorization', 'technique', 'leads', 'to', 'the', 'invention', 'of', '1', 'a', 'new', 'unsupervised', 'distance', 'metric', 'which', 'calculates', 'the', 'semantic', 'distance', 'between', 'a', 'pair', 'of', 'text', 'snippets', 'by', 'solving', 'a', 'penalized', 'optimal', 'transport', 'problem', 'while', 'preserving', 'the', 'logical', 'relationship', 'of', 'words', 'in', 'the', 'reordered', 'sentences', 'and', '2', 'new', 'multiscale', 'deep', 'learning', 'models', 'for', 'supervised', 'semantic', 'training', 'based', 'on', 'factorized', 'sentence', 'hierarchies', 'we', 'apply', 'our', 'techniques', 'to', 'textpair', 'similarity', 'estimation', 'and', 'textpair', 'relationship', 'classification', 'tasks', 'based', 'on', 'multiple', 'datasets', 'such', 'as', 'stsbenchmark', 'the', 'microsoft', 'research', 'paraphrase', 'identification', 'msrp', 'dataset', 'the', 'sick', 'dataset', 'etc', 'extensive', 'experiments', 'show', 'that', 'the', 'proposed', 'hierarchical', 'sentence', 'factorization', 'can', 'be', 'used', 'to', 'significantly', 'improve', 'the', 'performance', 'of', 'existing', 'unsupervised', 'distancebased', 'metrics', 'as', 'well', 'as', 'multiple', 'supervised', 'deep', 'learning', 'models', 'based', 'on', 'the', 'convolutional', 'neural', 'network', 'cnn', 'and', 'long', 'shortterm', 'memory', 'lstm']] | [-0.032807564455612656, -0.010966884153713654, -0.07415906222636945, 0.1313724484641379, -0.19049887622613862, -0.1922928234733625, 0.05242321742557441, 0.47254874382684114, -0.3308298748502613, -0.3289792691982347, 0.024821064844163077, -0.269642235844263, -0.16095780963037823, 0.14173009935428804, -0.10344019194548845, 0.10374241942455145, 0.15078576059620907, 0.07831279320684685, -0.0816943902770275, -0.287035092063353, 0.3540873800674494, 0.02480398472138979, 0.3821710856123404, 0.02079095699808266, 0.1772591987351617, -0.03017943252575507, -0.06776419213319851, -0.03493611673770061, -0.034443876162949735, 0.19786123266883066, 0.3793362187461595, 0.2544086917789322, 0.3301910448162232, -0.3961857081475583, -0.22699722315858065, 0.0716926093269704, 0.1617076896499939, 0.08087273148898674, 0.01772051781730412, -0.3652241949608864, 0.07987729133206553, -0.17863116565753112, 0.13803809289961602, -0.14336221874993924, -0.009784198829750995, -0.028404646567966048, -0.26599485873198336, 0.033875519388105346, 0.14503613782711972, 0.058744359386528465, -0.03086843539444625, -0.11983623358121674, 0.049335336990985065, 0.16680291450372797, 0.03273675002226227, 0.09285436623056471, 0.12215329312167061, -0.1791487108586957, -0.20402716882768776, 0.35570182802873257, -0.07131059031260252, -0.23301687995495993, 0.20676334448525627, 0.04861918409673489, -0.18034088824879685, 0.03267810232755909, 0.23866715692427187, 0.11116820303279729, -0.18041965295056694, 0.004611758528845747, -0.07579112344510144, 0.21877824495752135, 0.09406791369277516, -0.01032855666282353, 0.19614832764929885, 0.309301414486682, -0.010106408601210733, 0.11672363233061112, -0.11201505044395067, -0.040958135818167554, -0.18234288153889713, -0.09320601250460267, -0.1818498893539135, -0.08106848889623176, -0.1331276313894508, -0.19098299437351687, 0.4023974450512737, 0.2107422504255556, 0.2186841724271124, 0.1436758766326755, 0.3463287502738901, -0.00855065433377021, 0.1431860656344465, 0.08947413793494885, 0.11355864106691584, 0.01833884725327003, 0.1161690189521276, -0.14905133962709843, 0.10485736792100779, 0.11818041118946394] |
1,803.0018 | Towards Theory and Applications of Generalized Categories to Areas of
Type Theory and Categorical Logic | Motivated by potential applications to theoretical computer science, in
particular those areas where the Curry-Howard correspondence plays an important
role, as well as by the ongoing search in pure mathematics for feasible
approaches to higher category theory, we undertake a detailed study of a new
mathematical abstraction, the generalized category. It is a partially defined
monoid equipped with endomorphism maps defining sources and targets on
arbitrary elements, possibly allowing a proximal behavior with respect to
composition.
We first present a formal introduction to the theory of generalized
categories. We describe functors, equivalences, natural transformations,
adjoints, and limits in the generalized setting. Next we indicate how the
theory of monads extends to generalized categories. Next, we present a variant
of the calculus of deductive systems developed by Lambek, and give a
generalization of the Curry-Howard-Lambek theorem giving an equivalence between
the category of typed lambda-calculi and the category of cartesian closed
categories and exponential-preserving morphisms that leverages the theory of
generalized categories. Next, we develop elementary topos theory in the
generalized setting of ideal toposes, utilizing the formalism developed for the
Curry-Howard-Lambek theorem. In particular, we prove that ideal toposes possess
the same Heyting algebra structure and squares of adjoints that ordinary
toposes do. Finally, we develop generalized sheaves, and show that such
categories form ideal toposes. We extend Lawvere and Tierney's theorem relating
$j$-sheaves and sheaves in the sense of Grothendieck to the generalized
setting.
| math.CT | motivated by potential applications to theoretical computer science in particular those areas where the curryhoward correspondence plays an important role as well as by the ongoing search in pure mathematics for feasible approaches to higher category theory we undertake a detailed study of a new mathematical abstraction the generalized category it is a partially defined monoid equipped with endomorphism maps defining sources and targets on arbitrary elements possibly allowing a proximal behavior with respect to composition we first present a formal introduction to the theory of generalized categories we describe functors equivalences natural transformations adjoints and limits in the generalized setting next we indicate how the theory of monads extends to generalized categories next we present a variant of the calculus of deductive systems developed by lambek and give a generalization of the curryhowardlambek theorem giving an equivalence between the category of typed lambdacalculi and the category of cartesian closed categories and exponentialpreserving morphisms that leverages the theory of generalized categories next we develop elementary topos theory in the generalized setting of ideal toposes utilizing the formalism developed for the curryhowardlambek theorem in particular we prove that ideal toposes possess the same heyting algebra structure and squares of adjoints that ordinary toposes do finally we develop generalized sheaves and show that such categories form ideal toposes we extend lawvere and tierneys theorem relating jsheaves and sheaves in the sense of grothendieck to the generalized setting | [['motivated', 'by', 'potential', 'applications', 'to', 'theoretical', 'computer', 'science', 'in', 'particular', 'those', 'areas', 'where', 'the', 'curryhoward', 'correspondence', 'plays', 'an', 'important', 'role', 'as', 'well', 'as', 'by', 'the', 'ongoing', 'search', 'in', 'pure', 'mathematics', 'for', 'feasible', 'approaches', 'to', 'higher', 'category', 'theory', 'we', 'undertake', 'a', 'detailed', 'study', 'of', 'a', 'new', 'mathematical', 'abstraction', 'the', 'generalized', 'category', 'it', 'is', 'a', 'partially', 'defined', 'monoid', 'equipped', 'with', 'endomorphism', 'maps', 'defining', 'sources', 'and', 'targets', 'on', 'arbitrary', 'elements', 'possibly', 'allowing', 'a', 'proximal', 'behavior', 'with', 'respect', 'to', 'composition', 'we', 'first', 'present', 'a', 'formal', 'introduction', 'to', 'the', 'theory', 'of', 'generalized', 'categories', 'we', 'describe', 'functors', 'equivalences', 'natural', 'transformations', 'adjoints', 'and', 'limits', 'in', 'the', 'generalized', 'setting', 'next', 'we', 'indicate', 'how', 'the', 'theory', 'of', 'monads', 'extends', 'to', 'generalized', 'categories', 'next', 'we', 'present', 'a', 'variant', 'of', 'the', 'calculus', 'of', 'deductive', 'systems', 'developed', 'by', 'lambek', 'and', 'give', 'a', 'generalization', 'of', 'the', 'curryhowardlambek', 'theorem', 'giving', 'an', 'equivalence', 'between', 'the', 'category', 'of', 'typed', 'lambdacalculi', 'and', 'the', 'category', 'of', 'cartesian', 'closed', 'categories', 'and', 'exponentialpreserving', 'morphisms', 'that', 'leverages', 'the', 'theory', 'of', 'generalized', 'categories', 'next', 'we', 'develop', 'elementary', 'topos', 'theory', 'in', 'the', 'generalized', 'setting', 'of', 'ideal', 'toposes', 'utilizing', 'the', 'formalism', 'developed', 'for', 'the', 'curryhowardlambek', 'theorem', 'in', 'particular', 'we', 'prove', 'that', 'ideal', 'toposes', 'possess', 'the', 'same', 'heyting', 'algebra', 'structure', 'and', 'squares', 'of', 'adjoints', 'that', 'ordinary', 'toposes', 'do', 'finally', 'we', 'develop', 'generalized', 'sheaves', 'and', 'show', 'that', 'such', 'categories', 'form', 'ideal', 'toposes', 'we', 'extend', 'lawvere', 'and', 'tierneys', 'theorem', 'relating', 'jsheaves', 'and', 'sheaves', 'in', 'the', 'sense', 'of', 'grothendieck', 'to', 'the', 'generalized', 'setting']] | [-0.09100511961552346, 0.023516987624165705, -0.09734510403560025, 0.13661085396196196, -0.12288839592204975, -0.12297782282232596, 0.0145892219947639, 0.33624252694225387, -0.3809971681651499, -0.23954528240524112, 0.05692702048590632, -0.20122826681271644, -0.17122988566251449, 0.16104463188746415, -0.18819907269789837, -0.04222724608904361, 0.035253958661181466, 0.05653653848075292, -0.07952837497477644, -0.21933412880401915, 0.417571073103945, 0.018452323049884933, 0.2667532109591211, 0.03093880196282608, 0.10718798644415199, 0.04883190425080729, -0.035895961118010994, 0.03586653030100118, -0.15798624469218717, 0.18147835930370815, 0.3459430601415706, 0.13536163586380506, 0.24199495825551226, -0.43154893171218833, -0.11093169935990992, 0.12137788223355592, 0.07992691228744285, 0.055901974333241455, -0.01932354823130199, -0.31349534086545866, 0.07214098291447514, -0.2520076036551096, -0.11722437172911354, -0.1224287733624304, 0.044247346177520554, 0.02682461378822938, -0.23596552417313496, -0.033092332781083755, 0.12903441750727482, 0.1312750346443926, -0.0932026030818163, -0.05798462819577002, -0.011850083338654728, 0.08430756340285056, -0.05205852708654832, -0.01119631801125722, 0.11559881885728703, -0.09926195394730493, -0.18216915423670735, 0.37111366734888146, -0.06837552356466467, -0.2038850936825901, 0.1717846788694793, -0.07897397402095897, -0.19249613113311953, 0.04041055175335275, 0.06299714354952748, 0.16004407084908273, -0.06952005371893957, 0.17100407209037602, -0.11938909627095765, 0.08460313320994892, 0.10603025321073926, 0.0579435900435783, 0.16880126452426716, 0.14284071452606567, 0.033991907840666906, 0.1602204987610658, 0.03731396410449665, -0.11343852656989775, -0.35888545574411623, -0.18279858996502613, -0.03256827789852556, 0.06533749192925009, -0.04403689702823989, -0.174264095647106, 0.35823967509626026, 0.16066402503929567, 0.12220369862264087, 0.14645010426064456, 0.23852658362914647, 0.06753834408049568, 0.056663134487311695, 0.0013220055470497003, 0.1605935333726189, 0.2575911320414763, 0.04694030484975444, -0.05880407232576419, -0.005156708914377117, 0.21260867148621715] |
1,803.00181 | Breaking the habit - the peculiar 2016 eruption of the unique recurrent
nova M31N 2008-12a | Since its discovery in 2008, the Andromeda galaxy nova M31N 2008-12a has been
observed in eruption every single year. This unprecedented frequency indicates
an extreme object, with a massive white dwarf and a high accretion rate, which
is the most promising candidate for the single-degenerate progenitor of a
type-Ia supernova known to date. The previous three eruptions of M31N 2008-12a
have displayed remarkably homogeneous multi-wavelength properties: (i) From a
faint peak, the optical light curve declined rapidly by two magnitudes in less
than two days; (ii) Early spectra showed initial high velocities that slowed
down significantly within days and displayed clear He/N lines throughout; (iii)
The supersoft X-ray source (SSS) phase of the nova began extremely early, six
days after eruption, and only lasted for about two weeks. In contrast, the
peculiar 2016 eruption was clearly different. Here we report (i) the
considerable delay in the 2016 eruption date, (ii) the significantly shorter
SSS phase, and (iii) the brighter optical peak magnitude (with a hitherto
unobserved cusp shape). Early theoretical models suggest that these three
different effects can be consistently understood as caused by a lower
quiescence mass-accretion rate. The corresponding higher ignition mass caused a
brighter peak in the free-free emission model. The less-massive accretion disk
experienced greater disruption, consequently delaying re-establishment of
effective accretion. Without the early refueling, the SSS phase was shortened.
Observing the next few eruptions will determine whether the properties of the
2016 outburst make it a genuine outlier in the evolution of M31N 2008-12a.
| astro-ph.SR astro-ph.HE | since its discovery in 2008 the andromeda galaxy nova m31n 200812a has been observed in eruption every single year this unprecedented frequency indicates an extreme object with a massive white dwarf and a high accretion rate which is the most promising candidate for the singledegenerate progenitor of a typeia supernova known to date the previous three eruptions of m31n 200812a have displayed remarkably homogeneous multiwavelength properties i from a faint peak the optical light curve declined rapidly by two magnitudes in less than two days ii early spectra showed initial high velocities that slowed down significantly within days and displayed clear hen lines throughout iii the supersoft xray source sss phase of the nova began extremely early six days after eruption and only lasted for about two weeks in contrast the peculiar 2016 eruption was clearly different here we report i the considerable delay in the 2016 eruption date ii the significantly shorter sss phase and iii the brighter optical peak magnitude with a hitherto unobserved cusp shape early theoretical models suggest that these three different effects can be consistently understood as caused by a lower quiescence massaccretion rate the corresponding higher ignition mass caused a brighter peak in the freefree emission model the lessmassive accretion disk experienced greater disruption consequently delaying reestablishment of effective accretion without the early refueling the sss phase was shortened observing the next few eruptions will determine whether the properties of the 2016 outburst make it a genuine outlier in the evolution of m31n 200812a | [['since', 'its', 'discovery', 'in', '2008', 'the', 'andromeda', 'galaxy', 'nova', 'm31n', '200812a', 'has', 'been', 'observed', 'in', 'eruption', 'every', 'single', 'year', 'this', 'unprecedented', 'frequency', 'indicates', 'an', 'extreme', 'object', 'with', 'a', 'massive', 'white', 'dwarf', 'and', 'a', 'high', 'accretion', 'rate', 'which', 'is', 'the', 'most', 'promising', 'candidate', 'for', 'the', 'singledegenerate', 'progenitor', 'of', 'a', 'typeia', 'supernova', 'known', 'to', 'date', 'the', 'previous', 'three', 'eruptions', 'of', 'm31n', '200812a', 'have', 'displayed', 'remarkably', 'homogeneous', 'multiwavelength', 'properties', 'i', 'from', 'a', 'faint', 'peak', 'the', 'optical', 'light', 'curve', 'declined', 'rapidly', 'by', 'two', 'magnitudes', 'in', 'less', 'than', 'two', 'days', 'ii', 'early', 'spectra', 'showed', 'initial', 'high', 'velocities', 'that', 'slowed', 'down', 'significantly', 'within', 'days', 'and', 'displayed', 'clear', 'hen', 'lines', 'throughout', 'iii', 'the', 'supersoft', 'xray', 'source', 'sss', 'phase', 'of', 'the', 'nova', 'began', 'extremely', 'early', 'six', 'days', 'after', 'eruption', 'and', 'only', 'lasted', 'for', 'about', 'two', 'weeks', 'in', 'contrast', 'the', 'peculiar', '2016', 'eruption', 'was', 'clearly', 'different', 'here', 'we', 'report', 'i', 'the', 'considerable', 'delay', 'in', 'the', '2016', 'eruption', 'date', 'ii', 'the', 'significantly', 'shorter', 'sss', 'phase', 'and', 'iii', 'the', 'brighter', 'optical', 'peak', 'magnitude', 'with', 'a', 'hitherto', 'unobserved', 'cusp', 'shape', 'early', 'theoretical', 'models', 'suggest', 'that', 'these', 'three', 'different', 'effects', 'can', 'be', 'consistently', 'understood', 'as', 'caused', 'by', 'a', 'lower', 'quiescence', 'massaccretion', 'rate', 'the', 'corresponding', 'higher', 'ignition', 'mass', 'caused', 'a', 'brighter', 'peak', 'in', 'the', 'freefree', 'emission', 'model', 'the', 'lessmassive', 'accretion', 'disk', 'experienced', 'greater', 'disruption', 'consequently', 'delaying', 'reestablishment', 'of', 'effective', 'accretion', 'without', 'the', 'early', 'refueling', 'the', 'sss', 'phase', 'was', 'shortened', 'observing', 'the', 'next', 'few', 'eruptions', 'will', 'determine', 'whether', 'the', 'properties', 'of', 'the', '2016', 'outburst', 'make', 'it', 'a', 'genuine', 'outlier', 'in', 'the', 'evolution', 'of', 'm31n', '200812a']] | [-0.06197707267850638, 0.14202790908358293, -0.08193440765701235, 0.10434828074020333, -0.11047107537277043, -0.15258769115805626, 0.086331058813259, 0.43006152622401717, -0.14762267868162599, -0.3435581343844533, 0.13498153788223863, -0.2943461309038103, -0.0911885048066033, 0.20703197529981845, -0.08207801237609237, -0.03486395642277785, 0.13503644352592528, -0.04098629310750403, -0.11140268384292722, -0.3371318691680208, 0.20333832148648798, 0.08302144159562885, 0.1874850202286616, -0.0585646257083863, 0.043029293085855895, -0.10830262728594243, -0.0698556475210935, -0.11740783717297018, -0.07303133257274749, -0.03643506258353591, 0.18311312978297065, 0.12356662531779147, 0.23577838919498026, -0.39547762160317507, -0.25795737135177477, 0.08498899067053571, 0.20179749297816307, 0.01154242255166173, -0.03848911865055561, -0.25565710934437813, 0.029269309519557283, -0.2317002963796258, -0.16417428337968887, 0.12436998072825373, 0.13888511386699975, -0.025640151246450842, -0.17149375610472634, 0.14889684285165278, 0.0467192080388777, 0.06548948155995458, -0.12493919324269519, -0.060657449452439324, -0.06612822281569243, 0.046858738666400314, 0.06401253305235878, 0.08258290636446328, 0.10262326095602475, -0.1340857676146552, -0.054735206481069325, 0.36204649839014746, -0.08659539366030367, 0.13901359908888117, 0.21305943344905973, -0.209971937995404, -0.16248393647931517, 0.2347138785365969, 0.1128447675872594, 0.10684532349742949, -0.17495459038717673, -0.08935736451949924, 0.02758799883443862, 0.18986453865654768, 0.0756686900248751, 0.048478732143965315, 0.3343784700427204, 0.16685064013535156, -0.03183377837855369, 0.08724651633668691, -0.23820648457296192, -0.037082852630177514, -0.21290528731048108, -0.07701445108186454, -0.10511501322966069, 0.13560657396097667, -0.10256217449274846, -0.10938589327037335, 0.41583474314026536, 0.09738372931070625, 0.2085992406718433, -0.04947107490850613, 0.2602708269804716, 0.08907871223404072, 0.0721591212209314, 0.15353867237921803, 0.3839734521433711, 0.11792138393968343, 0.1859164323634468, -0.23099416629504413, 0.15570314485579728, 0.019953881768509745] |
1,803.00182 | SIR Meta Distribution of K-Tier Downlink Heterogeneous Cellular Networks
with Cell Range Expansion | Heterogeneous cellular networks (HCNs) constitute a necessary step in the
evolution of cellular networks. In this paper, we apply the
signal-to-interference ratio (SIR) meta distribution framework for a refined
SIR performance analysis of HCNs, focusing on K-tier heterogeneous cellular
networks based on the homogeneous independent Poisson point process (HIP)
model, with range expansion bias (offloading bias) in each tier. Expressions
for the b-th moment of the conditional success probability for both the entire
network and each tier are derived, based on which the exact meta distributions
and the beta approximations are evaluated and compared. Key performance metrics
including the mean success probability, the variance of the conditional success
probability, the mean local delay and the asymptotic SIR gains of each tier are
obtained. The results show that the biases are detrimental to the overall mean
success probability of the whole network and that the b-th moment curve (versus
the SIR threshold) of the conditional success probability of each tier can be
excellently approximated by the horizontal shifted versions of the first moment
curve of the single-tier PPP network. We also provide lower bounds for the
region of the active probabilities of the base stations to keep the mean local
delay of each tier finite.
| cs.IT math.IT | heterogeneous cellular networks hcns constitute a necessary step in the evolution of cellular networks in this paper we apply the signaltointerference ratio sir meta distribution framework for a refined sir performance analysis of hcns focusing on ktier heterogeneous cellular networks based on the homogeneous independent poisson point process hip model with range expansion bias offloading bias in each tier expressions for the bth moment of the conditional success probability for both the entire network and each tier are derived based on which the exact meta distributions and the beta approximations are evaluated and compared key performance metrics including the mean success probability the variance of the conditional success probability the mean local delay and the asymptotic sir gains of each tier are obtained the results show that the biases are detrimental to the overall mean success probability of the whole network and that the bth moment curve versus the sir threshold of the conditional success probability of each tier can be excellently approximated by the horizontal shifted versions of the first moment curve of the singletier ppp network we also provide lower bounds for the region of the active probabilities of the base stations to keep the mean local delay of each tier finite | [['heterogeneous', 'cellular', 'networks', 'hcns', 'constitute', 'a', 'necessary', 'step', 'in', 'the', 'evolution', 'of', 'cellular', 'networks', 'in', 'this', 'paper', 'we', 'apply', 'the', 'signaltointerference', 'ratio', 'sir', 'meta', 'distribution', 'framework', 'for', 'a', 'refined', 'sir', 'performance', 'analysis', 'of', 'hcns', 'focusing', 'on', 'ktier', 'heterogeneous', 'cellular', 'networks', 'based', 'on', 'the', 'homogeneous', 'independent', 'poisson', 'point', 'process', 'hip', 'model', 'with', 'range', 'expansion', 'bias', 'offloading', 'bias', 'in', 'each', 'tier', 'expressions', 'for', 'the', 'bth', 'moment', 'of', 'the', 'conditional', 'success', 'probability', 'for', 'both', 'the', 'entire', 'network', 'and', 'each', 'tier', 'are', 'derived', 'based', 'on', 'which', 'the', 'exact', 'meta', 'distributions', 'and', 'the', 'beta', 'approximations', 'are', 'evaluated', 'and', 'compared', 'key', 'performance', 'metrics', 'including', 'the', 'mean', 'success', 'probability', 'the', 'variance', 'of', 'the', 'conditional', 'success', 'probability', 'the', 'mean', 'local', 'delay', 'and', 'the', 'asymptotic', 'sir', 'gains', 'of', 'each', 'tier', 'are', 'obtained', 'the', 'results', 'show', 'that', 'the', 'biases', 'are', 'detrimental', 'to', 'the', 'overall', 'mean', 'success', 'probability', 'of', 'the', 'whole', 'network', 'and', 'that', 'the', 'bth', 'moment', 'curve', 'versus', 'the', 'sir', 'threshold', 'of', 'the', 'conditional', 'success', 'probability', 'of', 'each', 'tier', 'can', 'be', 'excellently', 'approximated', 'by', 'the', 'horizontal', 'shifted', 'versions', 'of', 'the', 'first', 'moment', 'curve', 'of', 'the', 'singletier', 'ppp', 'network', 'we', 'also', 'provide', 'lower', 'bounds', 'for', 'the', 'region', 'of', 'the', 'active', 'probabilities', 'of', 'the', 'base', 'stations', 'to', 'keep', 'the', 'mean', 'local', 'delay', 'of', 'each', 'tier', 'finite']] | [-0.14010934564787164, 0.012807203586870694, -0.0394467632560169, 0.08267195562365148, 0.00045304968222683554, -0.14134638290852308, 0.14279914483303596, 0.36432820492351026, -0.22499545046822259, -0.2557788308545509, 0.05183081428449619, -0.23411119310641845, -0.17535204694300488, 0.13790180642778674, -0.08036076383994477, 0.060319365237328205, 0.06155114997219404, 0.10290485189433835, -0.020552005401958583, -0.2965578751863373, 0.3222548118096265, 0.11950761870955866, 0.39479978432805807, -0.006330524349822572, 0.09741725307885288, -0.003346139320866296, -0.04028899759092989, 0.010712772571851555, -0.12302842925854231, 0.12993799076032111, 0.23006031507575958, 0.16322634555766782, 0.2736997109627826, -0.38519750326853613, -0.2277012842424287, 0.11397637838672381, 0.14656799308146468, 0.031822006165063664, 0.025510581854534538, -0.29511244134411363, 0.11250037857669168, -0.19484418796206476, -0.0801718938461158, 0.02267940390247888, -0.04054827331656627, 0.1472896663677495, -0.3278377282926265, 0.06375449529179034, 0.0031223445012252414, 0.04511306250431374, -0.04207218788888342, -0.1976257548987062, -0.0223525873349418, 0.20305869813241503, 0.016061792175676992, -0.022024893345694768, 0.1487780517003129, -0.1438220142379435, -0.10186984975977491, 0.3443543617750573, -0.0727431347488663, -0.23048146175421483, 0.1019428176246127, -0.12888925192551232, -0.13759581298412135, 0.15248196200449385, 0.2176815867720756, 0.07359763094641761, -0.171650011101555, 0.028610122772150526, 0.009225294795161224, 0.11784251406860159, 0.04904229598412035, 0.015396561338360804, 0.1638264429787466, 0.2120352842132835, 0.10470405098178662, 0.07899343439517086, -0.17572887338624865, -0.16298345349016874, -0.27394110938607186, -0.14016735736981453, -0.1916808915848378, 0.014511635835172938, -0.16160372664942804, -0.13602617210605839, 0.3809559382521091, 0.12269921763685952, 0.1893369402581205, 0.20730971570147255, 0.3074046533700882, 0.1705234723859558, 0.005762897486634114, 0.09574747182584058, 0.1686898863385888, 0.12778586390834556, 0.10185896886019584, -0.19507249085832953, 0.1420017216011069, 0.059526760838743226] |
1,803.00183 | Learning with Correntropy-induced Losses for Regression with Mixture of
Symmetric Stable Noise | In recent years, correntropy and its applications in machine learning have
been drawing continuous attention owing to its merits in dealing with
non-Gaussian noise and outliers. However, theoretical understanding of
correntropy, especially in the statistical learning context, is still limited.
In this study, within the statistical learning framework, we investigate
correntropy based regression in the presence of non-Gaussian noise or outliers.
Motivated by the practical way of generating non-Gaussian noise or outliers, we
introduce mixture of symmetric stable noise, which include Gaussian noise,
Cauchy noise, and their mixture as special cases, to model non-Gaussian noise
or outliers. We demonstrate that under the mixture of symmetric stable noise
assumption, correntropy based regression can learn the conditional mean
function or the conditional median function well without resorting to the
finite-variance or even the finite first-order moment condition on the noise.
In particular, for the above two cases, we establish asymptotic optimal
learning rates for correntropy based regression estimators that are
asymptotically of type $\mathcal{O}(n^{-1})$. These results justify the
effectiveness of the correntropy based regression estimators in dealing with
outliers as well as non-Gaussian noise. We believe that the present study
completes our understanding towards correntropy based regression from a
statistical learning viewpoint, and may also shed some light on robust
statistical learning for regression.
| cs.LG stat.ML | in recent years correntropy and its applications in machine learning have been drawing continuous attention owing to its merits in dealing with nongaussian noise and outliers however theoretical understanding of correntropy especially in the statistical learning context is still limited in this study within the statistical learning framework we investigate correntropy based regression in the presence of nongaussian noise or outliers motivated by the practical way of generating nongaussian noise or outliers we introduce mixture of symmetric stable noise which include gaussian noise cauchy noise and their mixture as special cases to model nongaussian noise or outliers we demonstrate that under the mixture of symmetric stable noise assumption correntropy based regression can learn the conditional mean function or the conditional median function well without resorting to the finitevariance or even the finite firstorder moment condition on the noise in particular for the above two cases we establish asymptotic optimal learning rates for correntropy based regression estimators that are asymptotically of type mathcalon1 these results justify the effectiveness of the correntropy based regression estimators in dealing with outliers as well as nongaussian noise we believe that the present study completes our understanding towards correntropy based regression from a statistical learning viewpoint and may also shed some light on robust statistical learning for regression | [['in', 'recent', 'years', 'correntropy', 'and', 'its', 'applications', 'in', 'machine', 'learning', 'have', 'been', 'drawing', 'continuous', 'attention', 'owing', 'to', 'its', 'merits', 'in', 'dealing', 'with', 'nongaussian', 'noise', 'and', 'outliers', 'however', 'theoretical', 'understanding', 'of', 'correntropy', 'especially', 'in', 'the', 'statistical', 'learning', 'context', 'is', 'still', 'limited', 'in', 'this', 'study', 'within', 'the', 'statistical', 'learning', 'framework', 'we', 'investigate', 'correntropy', 'based', 'regression', 'in', 'the', 'presence', 'of', 'nongaussian', 'noise', 'or', 'outliers', 'motivated', 'by', 'the', 'practical', 'way', 'of', 'generating', 'nongaussian', 'noise', 'or', 'outliers', 'we', 'introduce', 'mixture', 'of', 'symmetric', 'stable', 'noise', 'which', 'include', 'gaussian', 'noise', 'cauchy', 'noise', 'and', 'their', 'mixture', 'as', 'special', 'cases', 'to', 'model', 'nongaussian', 'noise', 'or', 'outliers', 'we', 'demonstrate', 'that', 'under', 'the', 'mixture', 'of', 'symmetric', 'stable', 'noise', 'assumption', 'correntropy', 'based', 'regression', 'can', 'learn', 'the', 'conditional', 'mean', 'function', 'or', 'the', 'conditional', 'median', 'function', 'well', 'without', 'resorting', 'to', 'the', 'finitevariance', 'or', 'even', 'the', 'finite', 'firstorder', 'moment', 'condition', 'on', 'the', 'noise', 'in', 'particular', 'for', 'the', 'above', 'two', 'cases', 'we', 'establish', 'asymptotic', 'optimal', 'learning', 'rates', 'for', 'correntropy', 'based', 'regression', 'estimators', 'that', 'are', 'asymptotically', 'of', 'type', 'mathcalon1', 'these', 'results', 'justify', 'the', 'effectiveness', 'of', 'the', 'correntropy', 'based', 'regression', 'estimators', 'in', 'dealing', 'with', 'outliers', 'as', 'well', 'as', 'nongaussian', 'noise', 'we', 'believe', 'that', 'the', 'present', 'study', 'completes', 'our', 'understanding', 'towards', 'correntropy', 'based', 'regression', 'from', 'a', 'statistical', 'learning', 'viewpoint', 'and', 'may', 'also', 'shed', 'some', 'light', 'on', 'robust', 'statistical', 'learning', 'for', 'regression']] | [-0.0163169277256425, 0.008159505073771865, -0.1122955526818328, 0.13097590271313236, -0.08282313848744621, -0.19620484597805254, 0.04307949253965283, 0.41410039391649783, -0.24825308142111302, -0.26724829317404414, 0.1373324023629978, -0.23775224772145762, -0.2105701592940846, 0.1710611242792165, -0.18254636801015603, 0.151019856761504, 0.04393127192369715, 0.019716159556992352, -0.09076199400620887, -0.2710838540422045, 0.3419649525389585, 0.05770277521542256, 0.32098655973974055, -0.04699029928080975, 0.10872024949859688, 0.0379127219312754, -0.0743472812793938, 0.010466214980092531, -0.05611741884974933, 0.1141424923171487, 0.2740102767777401, 0.14537242878083456, 0.3748305974141607, -0.35311567699009516, -0.28146812976074387, 0.18253895013487703, 0.10806973369677884, 0.08880467060349337, -0.06684773323402898, -0.33946110620185344, 0.05728140693566463, -0.13625966276499038, -0.05762084328719384, -0.162617816684772, -0.04422809105621264, 0.044267586524101885, -0.32025551447592115, 0.14452456146407816, 0.12887976292239609, 0.07107742140678451, -0.005236676431761809, -0.19766316991431182, 0.05272756316721053, 0.03642468254920974, 0.07925407668270329, -0.0274537854280459, 0.13544663138476745, -0.17102560737249353, -0.10553191082534503, 0.320140343278049, -0.07652304643097352, -0.23013306337514156, 0.17140839551685308, -0.09635219251174691, -0.1778632762516796, 0.09458729177592586, 0.23897523814916638, 0.07433410925035067, -0.1624645785025523, 0.0534948305378422, 0.010095002243892764, 0.13777736230052673, 0.05052982553079689, 0.02936927255084914, 0.1745207387852957, 0.19781143120204467, 0.06817043361798772, 0.16501848495393479, -0.15074013382468796, -0.099483247070995, -0.26115177770777837, -0.08233426332052024, -0.219554536165406, -0.00149348366210448, -0.13525472069790648, -0.21390280579657453, 0.36940893064305746, 0.22150572208426278, 0.19262144717010055, 0.12506121469558357, 0.32753446952105975, 0.11791246095869937, -0.03504788075718712, 0.10135452193866994, 0.2163514688371885, 0.17293075043246817, 0.03038200246003228, -0.17356686569192395, 0.13924494741829377, -0.02410550256488177] |
1,803.00184 | Learning Sparse Structured Ensembles with SG-MCMC and Network Pruning | An ensemble of neural networks is known to be more robust and accurate than
an individual network, however usually with linearly-increased cost in both
training and testing. In this work, we propose a two-stage method to learn
Sparse Structured Ensembles (SSEs) for neural networks. In the first stage, we
run SG-MCMC with group sparse priors to draw an ensemble of samples from the
posterior distribution of network parameters. In the second stage, we apply
weight-pruning to each sampled network and then perform retraining over the
remained connections. In this way of learning SSEs with SG-MCMC and pruning, we
not only achieve high prediction accuracy since SG-MCMC enhances exploration of
the model-parameter space, but also reduce memory and computation cost
significantly in both training and testing of NN ensembles. This is thoroughly
evaluated in the experiments of learning SSE ensembles of both FNNs and LSTMs.
For example, in LSTM based language modeling (LM), we obtain 21% relative
reduction in LM perplexity by learning a SSE of 4 large LSTM models, which has
only 30% of model parameters and 70% of computations in total, as compared to
the baseline large LSTM LM. To the best of our knowledge, this work represents
the first methodology and empirical study of integrating SG-MCMC, group sparse
prior and network pruning together for learning NN ensembles.
| stat.ML cs.LG | an ensemble of neural networks is known to be more robust and accurate than an individual network however usually with linearlyincreased cost in both training and testing in this work we propose a twostage method to learn sparse structured ensembles sses for neural networks in the first stage we run sgmcmc with group sparse priors to draw an ensemble of samples from the posterior distribution of network parameters in the second stage we apply weightpruning to each sampled network and then perform retraining over the remained connections in this way of learning sses with sgmcmc and pruning we not only achieve high prediction accuracy since sgmcmc enhances exploration of the modelparameter space but also reduce memory and computation cost significantly in both training and testing of nn ensembles this is thoroughly evaluated in the experiments of learning sse ensembles of both fnns and lstms for example in lstm based language modeling lm we obtain 21 relative reduction in lm perplexity by learning a sse of 4 large lstm models which has only 30 of model parameters and 70 of computations in total as compared to the baseline large lstm lm to the best of our knowledge this work represents the first methodology and empirical study of integrating sgmcmc group sparse prior and network pruning together for learning nn ensembles | [['an', 'ensemble', 'of', 'neural', 'networks', 'is', 'known', 'to', 'be', 'more', 'robust', 'and', 'accurate', 'than', 'an', 'individual', 'network', 'however', 'usually', 'with', 'linearlyincreased', 'cost', 'in', 'both', 'training', 'and', 'testing', 'in', 'this', 'work', 'we', 'propose', 'a', 'twostage', 'method', 'to', 'learn', 'sparse', 'structured', 'ensembles', 'sses', 'for', 'neural', 'networks', 'in', 'the', 'first', 'stage', 'we', 'run', 'sgmcmc', 'with', 'group', 'sparse', 'priors', 'to', 'draw', 'an', 'ensemble', 'of', 'samples', 'from', 'the', 'posterior', 'distribution', 'of', 'network', 'parameters', 'in', 'the', 'second', 'stage', 'we', 'apply', 'weightpruning', 'to', 'each', 'sampled', 'network', 'and', 'then', 'perform', 'retraining', 'over', 'the', 'remained', 'connections', 'in', 'this', 'way', 'of', 'learning', 'sses', 'with', 'sgmcmc', 'and', 'pruning', 'we', 'not', 'only', 'achieve', 'high', 'prediction', 'accuracy', 'since', 'sgmcmc', 'enhances', 'exploration', 'of', 'the', 'modelparameter', 'space', 'but', 'also', 'reduce', 'memory', 'and', 'computation', 'cost', 'significantly', 'in', 'both', 'training', 'and', 'testing', 'of', 'nn', 'ensembles', 'this', 'is', 'thoroughly', 'evaluated', 'in', 'the', 'experiments', 'of', 'learning', 'sse', 'ensembles', 'of', 'both', 'fnns', 'and', 'lstms', 'for', 'example', 'in', 'lstm', 'based', 'language', 'modeling', 'lm', 'we', 'obtain', '21', 'relative', 'reduction', 'in', 'lm', 'perplexity', 'by', 'learning', 'a', 'sse', 'of', '4', 'large', 'lstm', 'models', 'which', 'has', 'only', '30', 'of', 'model', 'parameters', 'and', '70', 'of', 'computations', 'in', 'total', 'as', 'compared', 'to', 'the', 'baseline', 'large', 'lstm', 'lm', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'work', 'represents', 'the', 'first', 'methodology', 'and', 'empirical', 'study', 'of', 'integrating', 'sgmcmc', 'group', 'sparse', 'prior', 'and', 'network', 'pruning', 'together', 'for', 'learning', 'nn', 'ensembles']] | [-0.017588600428873665, 0.045637976985158125, -0.053769727865199686, 0.0561877851136252, -0.06444652074806323, -0.16281351075434738, 0.0776178364766427, 0.4645305154759282, -0.25819094267068643, -0.3448088500597235, 0.07325211783317412, -0.23354308427556114, -0.1823594267759043, 0.1593320855038232, -0.08583812493053565, 0.08616645006068085, 0.1313558624288033, 0.04862450161081855, -0.0985024985540787, -0.31629583533973465, 0.26248988988465943, 0.10580824104820116, 0.3075199492253183, -0.0474142366248059, 0.13333025826613337, -0.02534961293468655, -0.042159451778510305, -0.022578311165229285, -0.030318444787872278, 0.18131049248188186, 0.2750291175469747, 0.1660772788677416, 0.32483617408836285, -0.4230587901847978, -0.23980382295574323, 0.13500092085933715, 0.1383760840369014, 0.12644419556833408, 0.014499335947501782, -0.2763403659989019, 0.09990392546469887, -0.1892563565183551, 0.0260067900488784, -0.15575355106604197, -0.01695446460936991, -0.008395429929688333, -0.31562682304022754, 0.04048062071903214, 0.09848937490104814, 0.06287698508218824, -0.026690873327077053, -0.1558735445528055, 0.03524084143825562, 0.1330183317567209, 0.03978912841068223, 0.0702168615438336, 0.10411453676787699, -0.15888685793701715, -0.14146769785511087, 0.32580391305588907, -0.09240171393254303, -0.19795360808767173, 0.16848926848843523, -0.053482592554359526, -0.1813747037764347, 0.08503021248766492, 0.25650608527564234, 0.10417497846027536, -0.15946212733670864, 0.03055529749559556, 0.0027068984659371492, 0.19201419511509518, 0.03378078971843532, -0.03778956102610733, 0.10845773284696901, 0.2915820288622091, 0.03539690374898883, 0.12471962192209549, -0.1339965251699296, -0.1070921553925435, -0.20711731860759638, -0.12445186804554882, -0.2206367155180789, -0.005911042526391686, -0.14806190816498327, -0.15492222613574827, 0.3951720408987992, 0.23111835451933987, 0.23677745228418695, 0.16635882585418887, 0.307961095261821, 0.03421407863969833, 0.12097089248816675, 0.12401498872400497, 0.18225162366591824, 0.08626419178227367, 0.09411534971572579, -0.18087140787277511, 0.0779669516621166, 0.01658178624173429] |
1,803.00185 | Facial Expression Recognition Based on Complexity Perception
Classification Algorithm | Facial expression recognition (FER) has always been a challenging issue in
computer vision. The different expressions of emotion and uncontrolled
environmental factors lead to inconsistencies in the complexity of FER and
variability of between expression categories, which is often overlooked in most
facial expression recognition systems. In order to solve this problem
effectively, we presented a simple and efficient CNN model to extract facial
features, and proposed a complexity perception classification (CPC) algorithm
for FER. The CPC algorithm divided the dataset into an easy classification
sample subspace and a complex classification sample subspace by evaluating the
complexity of facial features that are suitable for classification. The
experimental results of our proposed algorithm on Fer2013 and CK-plus datasets
demonstrated the algorithm's effectiveness and superiority over other
state-of-the-art approaches.
| cs.CV cs.AI | facial expression recognition fer has always been a challenging issue in computer vision the different expressions of emotion and uncontrolled environmental factors lead to inconsistencies in the complexity of fer and variability of between expression categories which is often overlooked in most facial expression recognition systems in order to solve this problem effectively we presented a simple and efficient cnn model to extract facial features and proposed a complexity perception classification cpc algorithm for fer the cpc algorithm divided the dataset into an easy classification sample subspace and a complex classification sample subspace by evaluating the complexity of facial features that are suitable for classification the experimental results of our proposed algorithm on fer2013 and ckplus datasets demonstrated the algorithms effectiveness and superiority over other stateoftheart approaches | [['facial', 'expression', 'recognition', 'fer', 'has', 'always', 'been', 'a', 'challenging', 'issue', 'in', 'computer', 'vision', 'the', 'different', 'expressions', 'of', 'emotion', 'and', 'uncontrolled', 'environmental', 'factors', 'lead', 'to', 'inconsistencies', 'in', 'the', 'complexity', 'of', 'fer', 'and', 'variability', 'of', 'between', 'expression', 'categories', 'which', 'is', 'often', 'overlooked', 'in', 'most', 'facial', 'expression', 'recognition', 'systems', 'in', 'order', 'to', 'solve', 'this', 'problem', 'effectively', 'we', 'presented', 'a', 'simple', 'and', 'efficient', 'cnn', 'model', 'to', 'extract', 'facial', 'features', 'and', 'proposed', 'a', 'complexity', 'perception', 'classification', 'cpc', 'algorithm', 'for', 'fer', 'the', 'cpc', 'algorithm', 'divided', 'the', 'dataset', 'into', 'an', 'easy', 'classification', 'sample', 'subspace', 'and', 'a', 'complex', 'classification', 'sample', 'subspace', 'by', 'evaluating', 'the', 'complexity', 'of', 'facial', 'features', 'that', 'are', 'suitable', 'for', 'classification', 'the', 'experimental', 'results', 'of', 'our', 'proposed', 'algorithm', 'on', 'fer2013', 'and', 'ckplus', 'datasets', 'demonstrated', 'the', 'algorithms', 'effectiveness', 'and', 'superiority', 'over', 'other', 'stateoftheart', 'approaches']] | [-0.06872442219081143, -0.09867988373529414, -0.05360863902532156, 0.06618935821784867, -0.06691376354530572, -0.18898035098044647, 0.009015519175648926, 0.4340174254547391, -0.21783062446555715, -0.34483581213724046, 0.0809617666084142, -0.2601889553553765, -0.24724695477856412, 0.25772480082528165, -0.17262907171740183, 0.09951131942123914, 0.12835033471041934, 0.06829244655276102, -0.06480554601876065, -0.30331004852990784, 0.2387817316477941, 0.024520805334701898, 0.38551546404108644, 0.06479272099640516, 0.14114199249473, -0.06304373229587716, -0.053087122939778346, 0.012258795459592154, -0.041763545405999705, 0.1862244982547718, 0.37245308808124966, 0.22243570502189594, 0.26867776345239863, -0.3483576947994787, -0.18582420747557152, 0.05562639098969244, 0.18191018653479182, 0.1323863145053832, -0.04122786534329256, -0.36821899836557725, 0.08030356375485777, -0.1741049408599446, 0.05587414060423653, -0.15877880596940125, 0.0715312384926374, -0.10137862862930411, -0.27537528211103074, 0.048908834774342796, 0.09550538464700656, 0.12148876506687394, -0.10961757873236719, -0.1457758643886163, 0.07495389567015485, 0.19798696530421103, 0.07554609764326689, 0.036937817729758245, 0.13862313690876205, -0.20580556253451734, -0.15886109231764245, 0.37455013638273593, -0.007270664269555478, -0.2541830156087166, 0.22321054159057518, -0.029481022437620494, -0.15719542646085813, 0.16414895118583764, 0.2422606462616444, 0.09585196452098899, -0.17794039785595878, 0.02476207284110835, -0.03640797443776613, 0.17894057766164814, 0.056403051148952235, -0.0012432997122347829, 0.11027112468663189, 0.21534904575211897, -0.012483857860345216, 0.15197999404035584, -0.13904246722444122, -0.05208204031389739, -0.16924900126214776, -0.09569070704044803, -0.17362338616531195, -0.0653024281389893, -0.12855956704452326, -0.1506628090633996, 0.45091675665406955, 0.2168907303629177, 0.1898873438689089, 0.09485430306559132, 0.3789467214355393, 0.04833379624289505, 0.09529538231112787, 0.0778947481220322, 0.15360739474583948, 0.02118111252673857, 0.059062794626076956, -0.2545082133765968, 0.091147985261318, 0.10213957446080352] |
1,803.00186 | Smoothed analysis for low-rank solutions to semidefinite programs in
quadratic penalty form | Semidefinite programs (SDP) are important in learning and combinatorial
optimization with numerous applications. In pursuit of low-rank solutions and
low complexity algorithms, we consider the Burer--Monteiro factorization
approach for solving SDPs. We show that all approximate local optima are global
optima for the penalty formulation of appropriately rank-constrained SDPs as
long as the number of constraints scales sub-quadratically with the desired
rank of the optimal solution. Our result is based on a simple penalty function
formulation of the rank-constrained SDP along with a smoothed analysis to avoid
worst-case cost matrices. We particularize our results to two applications,
namely, Max-Cut and matrix completion.
| stat.ML cs.LG math.OC | semidefinite programs sdp are important in learning and combinatorial optimization with numerous applications in pursuit of lowrank solutions and low complexity algorithms we consider the burermonteiro factorization approach for solving sdps we show that all approximate local optima are global optima for the penalty formulation of appropriately rankconstrained sdps as long as the number of constraints scales subquadratically with the desired rank of the optimal solution our result is based on a simple penalty function formulation of the rankconstrained sdp along with a smoothed analysis to avoid worstcase cost matrices we particularize our results to two applications namely maxcut and matrix completion | [['semidefinite', 'programs', 'sdp', 'are', 'important', 'in', 'learning', 'and', 'combinatorial', 'optimization', 'with', 'numerous', 'applications', 'in', 'pursuit', 'of', 'lowrank', 'solutions', 'and', 'low', 'complexity', 'algorithms', 'we', 'consider', 'the', 'burermonteiro', 'factorization', 'approach', 'for', 'solving', 'sdps', 'we', 'show', 'that', 'all', 'approximate', 'local', 'optima', 'are', 'global', 'optima', 'for', 'the', 'penalty', 'formulation', 'of', 'appropriately', 'rankconstrained', 'sdps', 'as', 'long', 'as', 'the', 'number', 'of', 'constraints', 'scales', 'subquadratically', 'with', 'the', 'desired', 'rank', 'of', 'the', 'optimal', 'solution', 'our', 'result', 'is', 'based', 'on', 'a', 'simple', 'penalty', 'function', 'formulation', 'of', 'the', 'rankconstrained', 'sdp', 'along', 'with', 'a', 'smoothed', 'analysis', 'to', 'avoid', 'worstcase', 'cost', 'matrices', 'we', 'particularize', 'our', 'results', 'to', 'two', 'applications', 'namely', 'maxcut', 'and', 'matrix', 'completion']] | [-0.1089129560608782, -0.08099994188010254, -0.09791904070766132, 0.10551922916384487, -0.10845171370059617, -0.18359355518466555, 0.0270295503969286, 0.36815311483965785, -0.34330462180443255, -0.3423779535737327, 0.18123820208825683, -0.24046160101744474, -0.21344696331824012, 0.1433188156042175, -0.07184016466250315, 0.1610755779981321, 0.07945320427454278, -0.042511296422019895, -0.16274817440567216, -0.2979835614895302, 0.25936284024546874, 0.02952412549433682, 0.22103225618746936, 0.038678637678351474, 0.11409540804943033, 0.025054995007510527, 0.02472184552792825, 0.07660802563323695, -0.05647077610952764, 0.1204977559984899, 0.3435000722369581, 0.2629331004778471, 0.3646586481595923, -0.4467758339117555, -0.13466269978522963, 0.1373172458580823, 0.11594779548399589, 0.11959130764601059, -0.04816282474705219, -0.22138663258074837, 0.11585778220072754, -0.08792420894172334, -0.04129256036899546, -0.12328594776016533, -0.060077462910318416, 0.023363894362952196, -0.35348284859940704, 0.04711336655172465, 0.0167966625589293, -0.03296756308854503, -0.08422361401037551, -0.224294215007046, 0.08756654437299813, 0.020729377820138253, 0.09758317597123667, 0.006296007578973384, 0.10541915485872795, -0.09480062684080764, -0.1534182722486245, 0.35914308862651095, -0.04027799642918741, -0.23098129103663287, 0.16737937045457096, -0.03284359638414839, -0.18421197100999018, 0.13383407250740656, 0.22510731622448885, 0.20395121388234352, -0.1013554367921589, 0.1495446139389042, -0.11395733749640047, 0.12928381989545681, 0.030705399948227054, 0.04314438202966224, 0.09287145209051303, 0.17132703294776672, 0.2386792692556685, 0.14858636257521735, 0.024915396488687097, -0.11771954943919007, -0.24768123518237295, -0.10733009390898195, -0.2515552827150232, -0.007761840269143018, -0.18023223169196476, -0.17055339943252357, 0.40968337263364124, 0.12311453838357884, 0.18367651785157768, 0.19886729286928825, 0.34679722766775417, 0.12274456241021992, 0.0453215318722833, 0.132230087735818, 0.17460667969448967, 0.1329680704511702, 0.05684869302486357, -0.2509292361061728, 0.047310218621301005, 0.15568612904890494] |
1,803.00187 | Mode Domain Spatial Active Noise Control Using Sparse Signal
Representation | Active noise control (ANC) over a sizeable space requires a large number of
reference and error microphones to satisfy the spatial Nyquist sampling
criterion, which limits the feasibility of practical realization of such
systems. This paper proposes a mode-domain feedforward ANC method to attenuate
the noise field over a large space while reducing the number of microphones
required. We adopt a sparse reference signal representation to precisely
calculate the reference mode coefficients. The proposed system consists of
circular reference and error microphone arrays, which capture the reference
noise signal and residual error signal, respectively, and a circular
loudspeaker array to drive the anti-noise signal. Experimental results indicate
that above the spatial Nyquist frequency,our proposed method can perform well
compared to a conventional methods. Moreover, the proposed method can even
reduce the number of reference microphones while achieving better noise
attenuation.
| cs.SD eess.AS eess.SP | active noise control anc over a sizeable space requires a large number of reference and error microphones to satisfy the spatial nyquist sampling criterion which limits the feasibility of practical realization of such systems this paper proposes a modedomain feedforward anc method to attenuate the noise field over a large space while reducing the number of microphones required we adopt a sparse reference signal representation to precisely calculate the reference mode coefficients the proposed system consists of circular reference and error microphone arrays which capture the reference noise signal and residual error signal respectively and a circular loudspeaker array to drive the antinoise signal experimental results indicate that above the spatial nyquist frequencyour proposed method can perform well compared to a conventional methods moreover the proposed method can even reduce the number of reference microphones while achieving better noise attenuation | [['active', 'noise', 'control', 'anc', 'over', 'a', 'sizeable', 'space', 'requires', 'a', 'large', 'number', 'of', 'reference', 'and', 'error', 'microphones', 'to', 'satisfy', 'the', 'spatial', 'nyquist', 'sampling', 'criterion', 'which', 'limits', 'the', 'feasibility', 'of', 'practical', 'realization', 'of', 'such', 'systems', 'this', 'paper', 'proposes', 'a', 'modedomain', 'feedforward', 'anc', 'method', 'to', 'attenuate', 'the', 'noise', 'field', 'over', 'a', 'large', 'space', 'while', 'reducing', 'the', 'number', 'of', 'microphones', 'required', 'we', 'adopt', 'a', 'sparse', 'reference', 'signal', 'representation', 'to', 'precisely', 'calculate', 'the', 'reference', 'mode', 'coefficients', 'the', 'proposed', 'system', 'consists', 'of', 'circular', 'reference', 'and', 'error', 'microphone', 'arrays', 'which', 'capture', 'the', 'reference', 'noise', 'signal', 'and', 'residual', 'error', 'signal', 'respectively', 'and', 'a', 'circular', 'loudspeaker', 'array', 'to', 'drive', 'the', 'antinoise', 'signal', 'experimental', 'results', 'indicate', 'that', 'above', 'the', 'spatial', 'nyquist', 'frequencyour', 'proposed', 'method', 'can', 'perform', 'well', 'compared', 'to', 'a', 'conventional', 'methods', 'moreover', 'the', 'proposed', 'method', 'can', 'even', 'reduce', 'the', 'number', 'of', 'reference', 'microphones', 'while', 'achieving', 'better', 'noise', 'attenuation']] | [-0.1405668468720725, 0.034349016679882785, -0.02723597320795491, 0.0328695584599779, -0.06997800797588476, -0.1540116638491821, 0.07576494070488717, 0.3698400860733312, -0.2540173284550015, -0.33815635574780795, 0.09711740870504097, -0.23408578072026695, -0.15254405834391524, 0.21644324496847347, -0.11834321927913613, 0.11917998870384232, 0.06812101021658737, 0.037784504057987986, -0.06476005264161411, -0.21182960212531, 0.2067621083477971, 0.11711274783896364, 0.3720622896284297, -0.06869947452071136, 0.1693479863696785, 0.02183028570531557, -0.04156404994833081, 0.000769581733038649, -0.032262008813341854, 0.08991008356510513, 0.2608493922237793, 0.10517429869345295, 0.25412180910453847, -0.38090644174878, -0.22706039877527434, 0.13442450335782452, 0.13919307665386493, 0.15062758447669877, -0.027676015415636357, -0.3086791528233637, 0.11541821499544101, -0.14765271341995054, -0.059243253865819155, -0.07865554311623175, -0.05664719054998452, 0.03972992673347556, -0.3564701753574005, 0.06606883195944238, 0.05655237467557975, 0.03896429048905122, -0.028579141937898123, -0.12792981166537662, 0.0554951895247686, 0.13853512254908032, 0.0037732135868914747, 0.041478510153061456, 0.16559879400259545, -0.0779123000709502, -0.08247853448425514, 0.34570806755589834, -0.08515368785162497, -0.24798929631926012, 0.14511330546541273, -0.12485356469625149, -0.048871139405241265, 0.2179964869721806, 0.22582338456793324, 0.03319011992720914, -0.12896070048441619, 0.014521516061495935, 0.019777096828202837, 0.24541298085418733, 0.09519856472405186, 0.10079784699769663, 0.1397221304098333, 0.19700038637560996, 0.11074306485175654, 0.13521773281230498, -0.19310031425666765, -0.007533092696246677, -0.26714621961076296, -0.10256999632532614, -0.22128855000293066, -0.03276927583763187, -0.11226704635993119, -0.13920616766140945, 0.3920321693117528, 0.2021764130399063, 0.16296543948271353, 0.09581352063485057, 0.4111365372234065, 0.0912287884823762, 0.07559322125946535, 0.05025817641475494, 0.23722145032893488, 0.12951745327386627, 0.08379921140790364, -0.22281261432605484, 0.014353320462312009, -0.008240951211664124] |
1,803.00188 | XNMT: The eXtensible Neural Machine Translation Toolkit | This paper describes XNMT, the eXtensible Neural Machine Translation toolkit.
XNMT distin- guishes itself from other open-source NMT toolkits by its focus on
modular code design, with the purpose of enabling fast iteration in research
and replicable, reliable results. In this paper we describe the design of XNMT
and its experiment configuration system, and demonstrate its utility on the
tasks of machine translation, speech recognition, and multi-tasked machine
translation/parsing. XNMT is available open-source at
https://github.com/neulab/xnmt
| cs.CL | this paper describes xnmt the extensible neural machine translation toolkit xnmt distin guishes itself from other opensource nmt toolkits by its focus on modular code design with the purpose of enabling fast iteration in research and replicable reliable results in this paper we describe the design of xnmt and its experiment configuration system and demonstrate its utility on the tasks of machine translation speech recognition and multitasked machine translationparsing xnmt is available opensource at httpsgithubcomneulabxnmt | [['this', 'paper', 'describes', 'xnmt', 'the', 'extensible', 'neural', 'machine', 'translation', 'toolkit', 'xnmt', 'distin', 'guishes', 'itself', 'from', 'other', 'opensource', 'nmt', 'toolkits', 'by', 'its', 'focus', 'on', 'modular', 'code', 'design', 'with', 'the', 'purpose', 'of', 'enabling', 'fast', 'iteration', 'in', 'research', 'and', 'replicable', 'reliable', 'results', 'in', 'this', 'paper', 'we', 'describe', 'the', 'design', 'of', 'xnmt', 'and', 'its', 'experiment', 'configuration', 'system', 'and', 'demonstrate', 'its', 'utility', 'on', 'the', 'tasks', 'of', 'machine', 'translation', 'speech', 'recognition', 'and', 'multitasked', 'machine', 'translationparsing', 'xnmt', 'is', 'available', 'opensource', 'at', 'httpsgithubcomneulabxnmt']] | [-0.08521680720797223, -0.004381787277654641, -0.06063642795844418, -0.003937842668771434, -0.11577181766430537, -0.21688730730804512, -0.02076162671437487, 0.4421084810876184, -0.27987536612717023, -0.27782864887800923, 0.09400107585113598, -0.2419937819164867, -0.17350073262221283, 0.2815485675819218, -0.10485628319697247, 0.1282341306383993, 0.18546965226212503, 0.05907741610038405, -0.027584441921337403, -0.2448887661594199, 0.27883093318410423, 0.10608659061189327, 0.3673001153413982, 0.039723249993080065, 0.11383938321766134, -0.004447136742480022, -0.04823414001536245, -0.13109285985895744, -0.09674538988878743, 0.23280777607578784, 0.3211911798053835, 0.28646531094434774, 0.3149057255035991, -0.3691335432490127, -0.10927456084431873, -0.005106050262434615, 0.11924991191416565, 0.10013473383150995, -0.05173849446065207, -0.30570846365299076, 0.06527197512008974, -0.22726717235572222, -0.047861121459087975, -0.1573783444861571, -0.025731699069082323, -0.00966340600926843, -0.18683710880577564, -0.0729165962159944, 0.10539164759716692, 0.19228027024978978, -0.042385049188548386, -0.09811825079345403, 0.055379123808557376, 0.10686370136681944, 0.04385598849492251, 0.13905705792260253, 0.14890926867438894, -0.13119900028363596, -0.14310452949980068, 0.3906139646246124, -0.05754683440641707, -0.18069412045103186, 0.1995177827258077, 0.01630231667917946, -0.20940382160996604, 0.009321835694006748, 0.3073942398449516, 0.06784243122415824, -0.18603068882495993, 0.13272805431430848, 0.019067379526354164, 0.20194536367327803, -0.015615003089705069, -0.07057005669533585, 0.16797662226276266, 0.28620042089945247, -0.04805595928337425, 0.19057014119284255, -0.036924036368468985, -0.04416222861295359, -0.22384167672134936, -0.16817400013355333, -0.16046933893166068, -0.044192327949632376, 0.002008918986474681, -0.14448090975444453, 0.41613746320621836, 0.23394185681051263, 0.056440848082679115, 0.13605428067967296, 0.3675827910580362, -0.022387381500771478, 0.1240832145493995, 0.14561975273601194, 0.1547297138329466, -0.028255944592981704, 0.18198056648381883, -0.21386760377855454, 0.059982567087798894, 0.024944800236779783] |
1,803.00189 | Growing Story Forest Online from Massive Breaking News | We describe our experience of implementing a news content organization system
at Tencent that discovers events from vast streams of breaking news and evolves
news story structures in an online fashion. Our real-world system has distinct
requirements in contrast to previous studies on topic detection and tracking
(TDT) and event timeline or graph generation, in that we 1) need to accurately
and quickly extract distinguishable events from massive streams of long text
documents that cover diverse topics and contain highly redundant information,
and 2) must develop the structures of event stories in an online manner,
without repeatedly restructuring previously formed stories, in order to
guarantee a consistent user viewing experience. In solving these challenges, we
propose Story Forest, a set of online schemes that automatically clusters
streaming documents into events, while connecting related events in growing
trees to tell evolving stories. We conducted extensive evaluation based on 60
GB of real-world Chinese news data, although our ideas are not
language-dependent and can easily be extended to other languages, through
detailed pilot user experience studies. The results demonstrate the superior
capability of Story Forest to accurately identify events and organize news text
into a logical structure that is appealing to human readers, compared to
multiple existing algorithm frameworks.
| cs.IR cs.CL | we describe our experience of implementing a news content organization system at tencent that discovers events from vast streams of breaking news and evolves news story structures in an online fashion our realworld system has distinct requirements in contrast to previous studies on topic detection and tracking tdt and event timeline or graph generation in that we 1 need to accurately and quickly extract distinguishable events from massive streams of long text documents that cover diverse topics and contain highly redundant information and 2 must develop the structures of event stories in an online manner without repeatedly restructuring previously formed stories in order to guarantee a consistent user viewing experience in solving these challenges we propose story forest a set of online schemes that automatically clusters streaming documents into events while connecting related events in growing trees to tell evolving stories we conducted extensive evaluation based on 60 gb of realworld chinese news data although our ideas are not languagedependent and can easily be extended to other languages through detailed pilot user experience studies the results demonstrate the superior capability of story forest to accurately identify events and organize news text into a logical structure that is appealing to human readers compared to multiple existing algorithm frameworks | [['we', 'describe', 'our', 'experience', 'of', 'implementing', 'a', 'news', 'content', 'organization', 'system', 'at', 'tencent', 'that', 'discovers', 'events', 'from', 'vast', 'streams', 'of', 'breaking', 'news', 'and', 'evolves', 'news', 'story', 'structures', 'in', 'an', 'online', 'fashion', 'our', 'realworld', 'system', 'has', 'distinct', 'requirements', 'in', 'contrast', 'to', 'previous', 'studies', 'on', 'topic', 'detection', 'and', 'tracking', 'tdt', 'and', 'event', 'timeline', 'or', 'graph', 'generation', 'in', 'that', 'we', '1', 'need', 'to', 'accurately', 'and', 'quickly', 'extract', 'distinguishable', 'events', 'from', 'massive', 'streams', 'of', 'long', 'text', 'documents', 'that', 'cover', 'diverse', 'topics', 'and', 'contain', 'highly', 'redundant', 'information', 'and', '2', 'must', 'develop', 'the', 'structures', 'of', 'event', 'stories', 'in', 'an', 'online', 'manner', 'without', 'repeatedly', 'restructuring', 'previously', 'formed', 'stories', 'in', 'order', 'to', 'guarantee', 'a', 'consistent', 'user', 'viewing', 'experience', 'in', 'solving', 'these', 'challenges', 'we', 'propose', 'story', 'forest', 'a', 'set', 'of', 'online', 'schemes', 'that', 'automatically', 'clusters', 'streaming', 'documents', 'into', 'events', 'while', 'connecting', 'related', 'events', 'in', 'growing', 'trees', 'to', 'tell', 'evolving', 'stories', 'we', 'conducted', 'extensive', 'evaluation', 'based', 'on', '60', 'gb', 'of', 'realworld', 'chinese', 'news', 'data', 'although', 'our', 'ideas', 'are', 'not', 'languagedependent', 'and', 'can', 'easily', 'be', 'extended', 'to', 'other', 'languages', 'through', 'detailed', 'pilot', 'user', 'experience', 'studies', 'the', 'results', 'demonstrate', 'the', 'superior', 'capability', 'of', 'story', 'forest', 'to', 'accurately', 'identify', 'events', 'and', 'organize', 'news', 'text', 'into', 'a', 'logical', 'structure', 'that', 'is', 'appealing', 'to', 'human', 'readers', 'compared', 'to', 'multiple', 'existing', 'algorithm', 'frameworks']] | [-0.09631728553460632, 0.06033219618552391, -0.08183185986225192, 0.10487247442270985, -0.18333170201813864, -0.11104326718599324, 0.07128488314720456, 0.4462023849725883, -0.2428381260752156, -0.36195016485343096, 0.07295825381050165, -0.3716286958784657, -0.1679535796067223, 0.1925606444772729, -0.08626605526730868, -0.001329614756097972, 0.14767915454067757, 0.04781651694230861, 0.01083171104332927, -0.31683823668157823, 0.286476438437647, 0.05843304947540524, 0.32562121370096425, 0.0017335889613534804, 0.0875770245321041, -0.01923519311076849, -0.1247282987782464, -0.002046415532386866, -0.05728130807720067, 0.11102299198450899, 0.38472664324287775, 0.27363416614631814, 0.28563137221654006, -0.4460861969026085, -0.19393651093162848, 0.04452876399770595, 0.1711352048408024, 0.10305178897868131, -0.06385638453808708, -0.3742216105133088, 0.11156329108741818, -0.19357726163037373, -0.016634955707541553, -0.07994004833941676, 0.019278966614769563, -0.0023174356303069794, -0.23942972952415625, 0.023725124467434227, 0.04863960503551047, 0.056217932150190796, 0.0016464296084995143, -0.05024956021309439, 0.023632865205659093, 0.1808136856118172, 0.08037537780471128, 0.02000512698483046, 0.16084257556785772, -0.14334730907559287, -0.18328534074325636, 0.3917104412896046, -0.016869154715165945, -0.14139525428804364, 0.21726440196431687, -0.06074302168399914, -0.17138382069685537, 0.15725425522772207, 0.27292247157507904, 0.08652507323757093, -0.1873370636986222, -0.04273496179533268, -0.036277322771234646, 0.2197784060029682, 0.07529791038745456, -0.0029359184664444647, 0.23727080114365776, 0.2006823418646205, 0.0036178361444513577, 0.09147332002299698, -0.02856556638841324, -0.0953044585460698, -0.19282780830430066, -0.10529814999953255, -0.12697188348446384, -0.0033513260037263694, -0.08223157733226653, -0.1448092770465798, 0.3931208014317253, 0.229144551784502, 0.19287853249672637, 0.03652131617528157, 0.29060758231995076, -0.03965680667525101, 0.10553428002268724, 0.09809872066458138, 0.09919634394253185, -0.05208623921048742, 0.17708083000011599, -0.08268599625528399, 0.10822831531019278, -0.0037200547707523556] |
1,803.0019 | On the Finite Number of Directional Stationary Values of Piecewise
Programs | Extending a fundamental result for (indefinite) quadratic programs, this
paper shows that certain non-convex piecewise programs have only a finite
number of directional stationary values, and thus, possess only finitely many
locally minimum values. We present various special cases of our main results,
in particular, an application to a least-squares piecewise affine regression
problem for which every directional stationary point is locally minimizing.
| math.OC | extending a fundamental result for indefinite quadratic programs this paper shows that certain nonconvex piecewise programs have only a finite number of directional stationary values and thus possess only finitely many locally minimum values we present various special cases of our main results in particular an application to a leastsquares piecewise affine regression problem for which every directional stationary point is locally minimizing | [['extending', 'a', 'fundamental', 'result', 'for', 'indefinite', 'quadratic', 'programs', 'this', 'paper', 'shows', 'that', 'certain', 'nonconvex', 'piecewise', 'programs', 'have', 'only', 'a', 'finite', 'number', 'of', 'directional', 'stationary', 'values', 'and', 'thus', 'possess', 'only', 'finitely', 'many', 'locally', 'minimum', 'values', 'we', 'present', 'various', 'special', 'cases', 'of', 'our', 'main', 'results', 'in', 'particular', 'an', 'application', 'to', 'a', 'leastsquares', 'piecewise', 'affine', 'regression', 'problem', 'for', 'which', 'every', 'directional', 'stationary', 'point', 'is', 'locally', 'minimizing']] | [-0.14680903866177514, 0.03447200256119859, -0.06163257420329111, 0.03528532498915281, -0.12360102732089304, -0.18312834248331095, 0.010002209633100955, 0.3840497451989601, -0.3401789030518442, -0.2113381272093171, 0.14941460021128433, -0.21231966223641638, -0.20320953378483417, 0.26072217359961497, -0.11190833121774689, 0.12237769775951858, 0.059597725846937726, 0.021377906343707488, -0.09068384690816322, -0.2879363024045551, 0.32536075206562165, -0.01972503790129272, 0.2192070104093069, 0.02947054911286585, 0.14308541720466955, 0.062710499642269, 0.023674097773249424, 0.05601430105043474, -0.0855819359797077, 0.10995738815686237, 0.35132435005572105, 0.09880339936722839, 0.3804980091868885, -0.34609089399057824, -0.21765565196613942, 0.2296880715866647, 0.0943304313945451, 0.0809347213463976, -0.0784253796621684, -0.19631887811221302, 0.1044849886813955, -0.12481010159374112, -0.12871292703563258, -0.07250184794178322, 0.0004923700221947261, 0.06646632308524753, -0.291135507088805, 0.02920355698803351, 0.10162234089026849, 0.0623312753492168, -0.10075251458744917, -0.13113200209207004, -0.010716148886814832, 0.05651749299824356, 0.03807939800788604, 0.04416636519488834, 0.05927198184266066, -0.045686695661898404, -0.11461071981235392, 0.34076449795374797, -0.03581754471515379, -0.2832743725369847, 0.1847909585469299, -0.11677455652268633, -0.19856975576470767, 0.1608239479440575, 0.19640331569733838, 0.19724187139599098, -0.13129797907516597, 0.15422582409680924, -0.1458481435649215, 0.12355431077848485, 0.10325555311190704, -0.0036863175161655935, 0.16528644563171954, 0.08231533981401414, 0.18410390302897356, 0.1586246080290053, 0.015348070818516944, -0.08207716260267983, -0.38797824545985177, -0.1439775764676077, -0.17637108308854438, 0.014545710629872269, -0.14466930119415916, -0.24927995818120147, 0.38795884790283347, 0.08021850127076345, 0.16409549412007132, 0.17807009520696565, 0.289964104869536, 0.14995142570068498, 0.004061060624995402, 0.11478743294904394, 0.16186000693530317, 0.12608410969435696, 0.0017896446266344615, -0.1421359732436637, 0.07503835873914853, 0.0567597294048894] |
1,803.00191 | Yuanfudao at SemEval-2018 Task 11: Three-way Attention and Relational
Knowledge for Commonsense Machine Comprehension | This paper describes our system for SemEval-2018 Task 11: Machine
Comprehension using Commonsense Knowledge. We use Three-way Attentive Networks
(TriAN) to model interactions between the passage, question and answers. To
incorporate commonsense knowledge, we augment the input with relation embedding
from the graph of general knowledge ConceptNet (Speer et al., 2017). As a
result, our system achieves state-of-the-art performance with 83.95% accuracy
on the official test data. Code is publicly available at
https://github.com/intfloat/commonsense-rc
| cs.CL | this paper describes our system for semeval2018 task 11 machine comprehension using commonsense knowledge we use threeway attentive networks trian to model interactions between the passage question and answers to incorporate commonsense knowledge we augment the input with relation embedding from the graph of general knowledge conceptnet speer et al 2017 as a result our system achieves stateoftheart performance with 8395 accuracy on the official test data code is publicly available at httpsgithubcomintfloatcommonsenserc | [['this', 'paper', 'describes', 'our', 'system', 'for', 'semeval2018', 'task', '11', 'machine', 'comprehension', 'using', 'commonsense', 'knowledge', 'we', 'use', 'threeway', 'attentive', 'networks', 'trian', 'to', 'model', 'interactions', 'between', 'the', 'passage', 'question', 'and', 'answers', 'to', 'incorporate', 'commonsense', 'knowledge', 'we', 'augment', 'the', 'input', 'with', 'relation', 'embedding', 'from', 'the', 'graph', 'of', 'general', 'knowledge', 'conceptnet', 'speer', 'et', 'al', '2017', 'as', 'a', 'result', 'our', 'system', 'achieves', 'stateoftheart', 'performance', 'with', '8395', 'accuracy', 'on', 'the', 'official', 'test', 'data', 'code', 'is', 'publicly', 'available', 'at', 'httpsgithubcomintfloatcommonsenserc']] | [-0.02243461916481869, -0.07240171016504367, -0.020614802479233023, 0.04567379499268201, -0.1750915439463117, -0.12977451654539132, 0.07052219411545796, 0.39566618566297823, -0.22353150536461422, -0.44484410859230494, 0.017110359829126134, -0.3179748391525613, -0.1602825130491207, 0.18049049314383106, -0.13161016681179818, 0.05653356251423247, 0.188738567651146, 0.03723550094420918, -0.00896304081996075, -0.3006015247620881, 0.33011029171434025, 0.09090144449146464, 0.34047221710594994, 0.04373404375736653, 0.13202168698868869, 0.012069802615668677, -0.0757634043564192, -0.08047691468770306, -0.11146634177485895, 0.1602660930277327, 0.2995697496711121, 0.26999837635796414, 0.2482980065785038, -0.35870910936500877, -0.19813326406357293, 0.012616457553425183, 0.08079884722570164, 0.13569720614759717, 0.030300816926885292, -0.3564314264804125, 0.03360833829436968, -0.21939924121316937, 0.011600180115136836, -0.121796248622963, -0.008842594565875415, -0.05634272041303726, -0.3080875359268652, 0.035406006707085505, 0.14485091206410694, 0.0988713485874339, -0.03509007646223634, -0.10933363383487125, 0.03801138982332001, 0.20480309217883688, -0.04743193990725558, 0.117005452054501, 0.07293328932589954, -0.11156918276295376, -0.20639027952630487, 0.3435626686550677, -0.10206783196190372, -0.16007952566683847, 0.20201177283888683, -0.015255820012599643, -0.1841152538917312, 0.019332802414687142, 0.2399104628323888, 0.06641025114287105, -0.16473844402935356, 0.07372685036696364, -0.09287331237768133, 0.24770696869947845, 0.08432086773164985, -0.06158458920981502, 0.14308384577290983, 0.27701866457937285, -0.07627288069084494, 0.10424105894182706, -0.04795315994932833, -0.08093044362047092, -0.22092640546098766, -0.10851491421150665, -0.2101190294035607, 0.0014995088632632461, -0.05210629697972359, -0.07731206686649886, 0.35518678174250656, 0.29269235079280204, 0.16352267873783907, 0.12046085419165643, 0.3435072036097861, -0.04235357875101423, 0.0312775675750648, 0.17130289228629814, 0.15724437828693125, 0.03896674518344096, 0.14194750046024435, -0.13760789172374643, 0.06998488643956888, 0.08574175093478213] |
1,803.00192 | Recover Fine-Grained Spatial Data from Coarse Aggregation | In this paper, we study a new type of spatial sparse recovery problem, that
is to infer the fine-grained spatial distribution of certain density data in a
region only based on the aggregate observations recorded for each of its
subregions. One typical example of this spatial sparse recovery problem is to
infer spatial distribution of cellphone activities based on aggregate mobile
traffic volumes observed at sparsely scattered base stations. We propose a
novel Constrained Spatial Smoothing (CSS) approach, which exploits the local
continuity that exists in many types of spatial data to perform sparse recovery
via finite-element methods, while enforcing the aggregated observation
constraints through an innovative use of the ADMM algorithm. We also improve
the approach to further utilize additional geographical attributes. Extensive
evaluations based on a large dataset of phone call records and a demographical
dataset from the city of Milan show that our approach significantly outperforms
various state-of-the-art approaches, including Spatial Spline Regression (SSR).
| cs.NA | in this paper we study a new type of spatial sparse recovery problem that is to infer the finegrained spatial distribution of certain density data in a region only based on the aggregate observations recorded for each of its subregions one typical example of this spatial sparse recovery problem is to infer spatial distribution of cellphone activities based on aggregate mobile traffic volumes observed at sparsely scattered base stations we propose a novel constrained spatial smoothing css approach which exploits the local continuity that exists in many types of spatial data to perform sparse recovery via finiteelement methods while enforcing the aggregated observation constraints through an innovative use of the admm algorithm we also improve the approach to further utilize additional geographical attributes extensive evaluations based on a large dataset of phone call records and a demographical dataset from the city of milan show that our approach significantly outperforms various stateoftheart approaches including spatial spline regression ssr | [['in', 'this', 'paper', 'we', 'study', 'a', 'new', 'type', 'of', 'spatial', 'sparse', 'recovery', 'problem', 'that', 'is', 'to', 'infer', 'the', 'finegrained', 'spatial', 'distribution', 'of', 'certain', 'density', 'data', 'in', 'a', 'region', 'only', 'based', 'on', 'the', 'aggregate', 'observations', 'recorded', 'for', 'each', 'of', 'its', 'subregions', 'one', 'typical', 'example', 'of', 'this', 'spatial', 'sparse', 'recovery', 'problem', 'is', 'to', 'infer', 'spatial', 'distribution', 'of', 'cellphone', 'activities', 'based', 'on', 'aggregate', 'mobile', 'traffic', 'volumes', 'observed', 'at', 'sparsely', 'scattered', 'base', 'stations', 'we', 'propose', 'a', 'novel', 'constrained', 'spatial', 'smoothing', 'css', 'approach', 'which', 'exploits', 'the', 'local', 'continuity', 'that', 'exists', 'in', 'many', 'types', 'of', 'spatial', 'data', 'to', 'perform', 'sparse', 'recovery', 'via', 'finiteelement', 'methods', 'while', 'enforcing', 'the', 'aggregated', 'observation', 'constraints', 'through', 'an', 'innovative', 'use', 'of', 'the', 'admm', 'algorithm', 'we', 'also', 'improve', 'the', 'approach', 'to', 'further', 'utilize', 'additional', 'geographical', 'attributes', 'extensive', 'evaluations', 'based', 'on', 'a', 'large', 'dataset', 'of', 'phone', 'call', 'records', 'and', 'a', 'demographical', 'dataset', 'from', 'the', 'city', 'of', 'milan', 'show', 'that', 'our', 'approach', 'significantly', 'outperforms', 'various', 'stateoftheart', 'approaches', 'including', 'spatial', 'spline', 'regression', 'ssr']] | [-0.08252433406123832, -0.019298448751492954, -0.10925997339580563, 0.05905160747148144, -0.10277449571717365, -0.1332922192456521, 0.06626945146831097, 0.40891809626274805, -0.27495626914819143, -0.32008212396673336, 0.12087284182984334, -0.26184752228770664, -0.16641038204661932, 0.15987182152902435, -0.11688115793168337, 0.04150486994419057, 0.09302227291616665, 0.03564821325233621, -0.07825039622112871, -0.24796422127305062, 0.3028083473700057, 0.03622188222754723, 0.3735629862032024, 0.004191926229673966, 0.1542069018702764, 0.019037324567414395, -0.09656950951832685, 0.019201261402462953, -0.0636573907033415, 0.20971980163008924, 0.25813821545404614, 0.21307498146334936, 0.3162597055742695, -0.4502753857285923, -0.25935715109489527, 0.0914951248426631, 0.14447390100663635, 0.06713256362757414, -0.024445239965400545, -0.32331777903233555, 0.09269589351513868, -0.15152228488972422, -0.05669556295938173, -0.08745076179290844, -0.045726282836477845, 0.043285463810201354, -0.33436390446724407, 0.08935902346423115, -0.016514791214281017, 0.0792053109628095, -0.05315752400034908, -0.10023463622423684, 0.01239434407599816, 0.13997503064178335, 0.04132328276036034, -0.01856593214491513, 0.13737146272679945, -0.10059226282640912, -0.11381634135336087, 0.3282265274660887, -0.04151227576124251, -0.19287246687984344, 0.18293810012797784, -0.09500674757317515, -0.17863471025992542, 0.13687546758550653, 0.263491443192266, 0.11678234550354492, -0.16992606699265017, 0.0076623249700393786, -0.11002060220425557, 0.2125992923218662, 0.05306862064957571, 0.031372572923417254, 0.1418712344139245, 0.24447851786449268, 0.1133379504424935, 0.11508941082105895, -0.194996179465596, -0.0550247987874659, -0.22306009637085117, -0.07830621163504625, -0.23067717264839419, -0.05557154279771694, -0.15375967778161295, -0.15170824286679196, 0.4087795098868323, 0.22771748395452787, 0.20789015823441326, 0.08069225957032862, 0.34739593815897846, 0.02339844830752392, 0.07636066436304882, 0.10024655728517871, 0.11182596099379051, 0.019521424534973825, 0.13596465342357802, -0.19071820517260415, 0.07543537262560218, 0.049150730512893884] |
1,803.00193 | Magnetic field-induced evolution of intertwined orders in the Kitaev
magnet $\beta$-Li$_2$IrO$_3$ | Recent scattering experiments in the 3D Kitaev magnet $\beta$-Li$_2$IrO$_3$
have shown that a relatively weak magnetic field along the crystallographic
${\bf b}$-axis drives the system from its incommensurate counter-rotating order
to a correlated paramagnet, with a significant uniform `zigzag' component
superimposing the magnetization along the field. Here it is shown that the
zigzag order is not emerging from its linear coupling to the field (via a
staggered, off-diagonal element of the ${\bf g}$-tensor), but from its
intertwining with the incommensurate order and the longitudinal magnetization.
The emerging picture explains all qualitative experimental findings at zero and
finite fields, including the rapid decline of the incommensurate order with
field and the so-called intensity sum rule. The latter are shown to be
independent signatures of the smallness of the Heisenberg exchange $J$,
compared to the Kitaev coupling $K$ and the off-diagonal anisotropy $\Gamma$.
Remarkably, in the regime of interest, the field $H^\ast$ at which the
incommensurate component vanishes, depends essentially only on $J$, which
allows to extract an estimate of $J\!\simeq\!4K$ from reported measurements of
$H^\ast$. We also comment on recent experiments in pressurized
$\beta$-Li$_2$IrO$_3$ and conclude that $J$ decreases with pressure.
| cond-mat.str-el | recent scattering experiments in the 3d kitaev magnet betali_2iro_3 have shown that a relatively weak magnetic field along the crystallographic bf baxis drives the system from its incommensurate counterrotating order to a correlated paramagnet with a significant uniform zigzag component superimposing the magnetization along the field here it is shown that the zigzag order is not emerging from its linear coupling to the field via a staggered offdiagonal element of the bf gtensor but from its intertwining with the incommensurate order and the longitudinal magnetization the emerging picture explains all qualitative experimental findings at zero and finite fields including the rapid decline of the incommensurate order with field and the socalled intensity sum rule the latter are shown to be independent signatures of the smallness of the heisenberg exchange j compared to the kitaev coupling k and the offdiagonal anisotropy gamma remarkably in the regime of interest the field hast at which the incommensurate component vanishes depends essentially only on j which allows to extract an estimate of jsimeq4k from reported measurements of hast we also comment on recent experiments in pressurized betali_2iro_3 and conclude that j decreases with pressure | [['recent', 'scattering', 'experiments', 'in', 'the', '3d', 'kitaev', 'magnet', 'betali_2iro_3', 'have', 'shown', 'that', 'a', 'relatively', 'weak', 'magnetic', 'field', 'along', 'the', 'crystallographic', 'bf', 'baxis', 'drives', 'the', 'system', 'from', 'its', 'incommensurate', 'counterrotating', 'order', 'to', 'a', 'correlated', 'paramagnet', 'with', 'a', 'significant', 'uniform', 'zigzag', 'component', 'superimposing', 'the', 'magnetization', 'along', 'the', 'field', 'here', 'it', 'is', 'shown', 'that', 'the', 'zigzag', 'order', 'is', 'not', 'emerging', 'from', 'its', 'linear', 'coupling', 'to', 'the', 'field', 'via', 'a', 'staggered', 'offdiagonal', 'element', 'of', 'the', 'bf', 'gtensor', 'but', 'from', 'its', 'intertwining', 'with', 'the', 'incommensurate', 'order', 'and', 'the', 'longitudinal', 'magnetization', 'the', 'emerging', 'picture', 'explains', 'all', 'qualitative', 'experimental', 'findings', 'at', 'zero', 'and', 'finite', 'fields', 'including', 'the', 'rapid', 'decline', 'of', 'the', 'incommensurate', 'order', 'with', 'field', 'and', 'the', 'socalled', 'intensity', 'sum', 'rule', 'the', 'latter', 'are', 'shown', 'to', 'be', 'independent', 'signatures', 'of', 'the', 'smallness', 'of', 'the', 'heisenberg', 'exchange', 'j', 'compared', 'to', 'the', 'kitaev', 'coupling', 'k', 'and', 'the', 'offdiagonal', 'anisotropy', 'gamma', 'remarkably', 'in', 'the', 'regime', 'of', 'interest', 'the', 'field', 'hast', 'at', 'which', 'the', 'incommensurate', 'component', 'vanishes', 'depends', 'essentially', 'only', 'on', 'j', 'which', 'allows', 'to', 'extract', 'an', 'estimate', 'of', 'jsimeq4k', 'from', 'reported', 'measurements', 'of', 'hast', 'we', 'also', 'comment', 'on', 'recent', 'experiments', 'in', 'pressurized', 'betali_2iro_3', 'and', 'conclude', 'that', 'j', 'decreases', 'with', 'pressure']] | [-0.18625687464280793, 0.2125048212782959, -0.04096532326497177, -0.02195676531834853, -0.08314762065598554, -0.11632164614275098, 0.026997434008600458, 0.38184570727091305, -0.2740355093135602, -0.24035145083772483, 0.04940032309337603, -0.3093588737976182, -0.10891951284668207, 0.17025554809157575, 0.07639959025093251, -0.018965581785234567, -0.01290442183534935, 0.05328422169220787, -0.09394331827695683, -0.23518336352475835, 0.27361820082835575, 0.03636710116363786, 0.30982898170280604, 0.07792145433581912, 0.0722903608992479, 0.017542404474976358, 0.038754130706250195, 0.028232433128530385, -0.14004538977630626, 0.06067758426070213, 0.20629195907897263, -0.0705114473061277, 0.1587711467885624, -0.4040113471142908, -0.17355330594477772, 0.04505080533849578, 0.13307099063294353, 0.12076652249464243, -0.023713920641168163, -0.2886817297656779, 0.06031383134464108, -0.16074190786657805, -0.13559066710461462, -0.09866322524520377, 0.02136701448369653, 0.02105876313499052, -0.29989308109211305, 0.10485777566218675, 0.104612236280147, 0.08598369392985232, -0.06803020971264227, -0.1359692160107895, -0.06801571635894044, 0.055103730893245446, 0.1238739711063712, 0.14877302137021192, 0.10265631876422693, -0.12606302439851105, -0.10828376365529876, 0.35161233017782845, -0.09141699270660639, -0.10185344912427127, 0.16026456568331, -0.2018818442547132, -0.08656793613129704, 0.15523253947437282, 0.08166734521430005, 0.04512767600962429, -0.07908137569883986, 0.11439098546462548, -0.03181704742311643, 0.158698250564239, 0.011327807159562196, 0.005338625947910326, 0.22948687882827862, 0.10866253295292456, 0.057993357908719824, 0.12283075751771254, -0.11447528135967712, -0.09621630971955639, -0.2701589534768746, -0.1246751235975396, -0.21207543733103507, 0.05385197580937683, -0.08285853963691148, -0.17607432713860857, 0.4028996224465864, 0.18088614771429173, 0.2020241704414643, -0.04945639060396287, 0.23658994968645472, 0.10433916427212318, 0.07771295103338108, 0.0627340632392261, 0.2712318642747406, 0.2404562710000882, 0.1211458201773918, -0.2791200458865475, 0.052340412932502293, 0.012405325730378055] |
1,803.00194 | Chordal Komatu-Loewner equation for a family of continuously growing
hulls | In this paper, we discuss the chordal Komatu-Loewner equation on standard
slit domains in a manner applicable not just to a simple curve but also a
family of continuously growing hulls. Especially a conformally invariant
characterization of the Komatu-Loewner evolution is obtained. As an
application, we prove a sort of conformal invariance, or locality, of the
stochastic Komatu-Loewner evolution $\mathrm{SKLE}_{\sqrt{6},
-b_{\mathrm{BMD}}}$ in a fully general setting, which solves an open problem
posed by Chen, Fukushima and Suzuki [Stochastic Komatu-Loewner evolutions and
SLEs, Stoch. Proc. Appl. 127 (2017), 2068-2087].
| math.PR math.CV | in this paper we discuss the chordal komatuloewner equation on standard slit domains in a manner applicable not just to a simple curve but also a family of continuously growing hulls especially a conformally invariant characterization of the komatuloewner evolution is obtained as an application we prove a sort of conformal invariance or locality of the stochastic komatuloewner evolution mathrmskle_sqrt6 b_mathrmbmd in a fully general setting which solves an open problem posed by chen fukushima and suzuki stochastic komatuloewner evolutions and sles stoch proc appl 127 2017 20682087 | [['in', 'this', 'paper', 'we', 'discuss', 'the', 'chordal', 'komatuloewner', 'equation', 'on', 'standard', 'slit', 'domains', 'in', 'a', 'manner', 'applicable', 'not', 'just', 'to', 'a', 'simple', 'curve', 'but', 'also', 'a', 'family', 'of', 'continuously', 'growing', 'hulls', 'especially', 'a', 'conformally', 'invariant', 'characterization', 'of', 'the', 'komatuloewner', 'evolution', 'is', 'obtained', 'as', 'an', 'application', 'we', 'prove', 'a', 'sort', 'of', 'conformal', 'invariance', 'or', 'locality', 'of', 'the', 'stochastic', 'komatuloewner', 'evolution', 'mathrmskle_sqrt6', 'b_mathrmbmd', 'in', 'a', 'fully', 'general', 'setting', 'which', 'solves', 'an', 'open', 'problem', 'posed', 'by', 'chen', 'fukushima', 'and', 'suzuki', 'stochastic', 'komatuloewner', 'evolutions', 'and', 'sles', 'stoch', 'proc', 'appl', '127', '2017', '20682087']] | [-0.12209220198530923, 0.05624329676639343, -0.075095929999781, 0.03798340787453686, -0.09587271496352247, -0.12442643520805766, -0.009414738672785462, 0.3159615942136631, -0.30635347953614067, -0.2559036930475165, 0.15359024046235445, -0.2326951587353559, -0.1764129925656187, 0.18970478225006338, -0.16192035232396687, 0.06994076822610462, 0.04411260116989176, -0.02188883488997817, -0.07186688248835066, -0.27044445736443296, 0.30027072034118807, 0.023594018455375645, 0.23093653381528223, 0.027053999720031724, 0.1218530252795009, 0.0500725330072729, -0.05555080894332872, 0.04355854645700139, -0.16344464067095782, 0.07378441302297527, 0.2417567636598559, 0.10001884558895494, 0.24992686908911257, -0.35486024260959204, -0.22423812939840204, 0.10210466354208834, 0.11805372307118138, 0.08445704901892254, -0.04355429427506512, -0.3002089999397011, 0.026500975280342735, -0.14385622339323162, -0.16670761076110305, -0.03422422250184943, 0.07268338551580468, -0.024731665542897057, -0.26113811126526665, 0.09398247740635483, 0.15960808934315163, 0.07609732365783523, -0.052580702291144164, -0.0351918126716662, 0.010165288737591574, 0.003986985825330896, -0.04447028878254487, 0.0749688845620874, 0.05992912640795112, -0.060879255121792944, -0.15789742489509723, 0.3699733336312313, -0.07561306969865281, -0.21815497605677914, 0.17446047503035517, -0.08558426118620178, -0.1893776366048876, 0.05341756044174818, 0.17082978891592254, 0.18281485474778011, -0.21575676864013077, 0.19964692081352148, -0.08578426442930803, 0.10673553570557166, 0.14533857428742683, -0.0705887302667286, 0.11229681381681825, 0.1283726882381255, 0.08242010098388966, 0.12878195448395083, 0.03290778406457428, -0.13774489129290862, -0.3291709786048159, -0.16545025128871202, -0.12829731785527923, 0.14115595871544964, -0.03839524641105741, -0.20812347469139186, 0.374046242280918, 0.060991548057063485, 0.1881641803199754, 0.09491056259858477, 0.1684649977613898, 0.10637206613661393, -0.012433244476372184, 0.1710067124434692, 0.15999329426490208, 0.17737529438591618, 0.1362719848847893, -0.17701440412715516, -0.0036753163070363157, 0.13482481207260313] |
1,803.00195 | The Anisotropic Noise in Stochastic Gradient Descent: Its Behavior of
Escaping from Sharp Minima and Regularization Effects | Understanding the behavior of stochastic gradient descent (SGD) in the
context of deep neural networks has raised lots of concerns recently. Along
this line, we study a general form of gradient based optimization dynamics with
unbiased noise, which unifies SGD and standard Langevin dynamics. Through
investigating this general optimization dynamics, we analyze the behavior of
SGD on escaping from minima and its regularization effects. A novel indicator
is derived to characterize the efficiency of escaping from minima through
measuring the alignment of noise covariance and the curvature of loss function.
Based on this indicator, two conditions are established to show which type of
noise structure is superior to isotropic noise in term of escaping efficiency.
We further show that the anisotropic noise in SGD satisfies the two conditions,
and thus helps to escape from sharp and poor minima effectively, towards more
stable and flat minima that typically generalize well. We systematically design
various experiments to verify the benefits of the anisotropic noise, compared
with full gradient descent plus isotropic diffusion (i.e. Langevin dynamics).
| stat.ML cs.LG | understanding the behavior of stochastic gradient descent sgd in the context of deep neural networks has raised lots of concerns recently along this line we study a general form of gradient based optimization dynamics with unbiased noise which unifies sgd and standard langevin dynamics through investigating this general optimization dynamics we analyze the behavior of sgd on escaping from minima and its regularization effects a novel indicator is derived to characterize the efficiency of escaping from minima through measuring the alignment of noise covariance and the curvature of loss function based on this indicator two conditions are established to show which type of noise structure is superior to isotropic noise in term of escaping efficiency we further show that the anisotropic noise in sgd satisfies the two conditions and thus helps to escape from sharp and poor minima effectively towards more stable and flat minima that typically generalize well we systematically design various experiments to verify the benefits of the anisotropic noise compared with full gradient descent plus isotropic diffusion ie langevin dynamics | [['understanding', 'the', 'behavior', 'of', 'stochastic', 'gradient', 'descent', 'sgd', 'in', 'the', 'context', 'of', 'deep', 'neural', 'networks', 'has', 'raised', 'lots', 'of', 'concerns', 'recently', 'along', 'this', 'line', 'we', 'study', 'a', 'general', 'form', 'of', 'gradient', 'based', 'optimization', 'dynamics', 'with', 'unbiased', 'noise', 'which', 'unifies', 'sgd', 'and', 'standard', 'langevin', 'dynamics', 'through', 'investigating', 'this', 'general', 'optimization', 'dynamics', 'we', 'analyze', 'the', 'behavior', 'of', 'sgd', 'on', 'escaping', 'from', 'minima', 'and', 'its', 'regularization', 'effects', 'a', 'novel', 'indicator', 'is', 'derived', 'to', 'characterize', 'the', 'efficiency', 'of', 'escaping', 'from', 'minima', 'through', 'measuring', 'the', 'alignment', 'of', 'noise', 'covariance', 'and', 'the', 'curvature', 'of', 'loss', 'function', 'based', 'on', 'this', 'indicator', 'two', 'conditions', 'are', 'established', 'to', 'show', 'which', 'type', 'of', 'noise', 'structure', 'is', 'superior', 'to', 'isotropic', 'noise', 'in', 'term', 'of', 'escaping', 'efficiency', 'we', 'further', 'show', 'that', 'the', 'anisotropic', 'noise', 'in', 'sgd', 'satisfies', 'the', 'two', 'conditions', 'and', 'thus', 'helps', 'to', 'escape', 'from', 'sharp', 'and', 'poor', 'minima', 'effectively', 'towards', 'more', 'stable', 'and', 'flat', 'minima', 'that', 'typically', 'generalize', 'well', 'we', 'systematically', 'design', 'various', 'experiments', 'to', 'verify', 'the', 'benefits', 'of', 'the', 'anisotropic', 'noise', 'compared', 'with', 'full', 'gradient', 'descent', 'plus', 'isotropic', 'diffusion', 'ie', 'langevin', 'dynamics']] | [-0.0984196241607222, 0.030968539858226143, -0.1189674036388926, 0.11091368114966038, -0.04373249007561217, -0.13792603911907342, 0.02367382102532883, 0.39727439205269893, -0.3152345262112559, -0.28576177688190346, 0.08871756242978457, -0.2544732934531535, -0.2046020438099237, 0.17160218016303688, -0.09254569169352811, 0.04146665869236283, 0.06404654797963324, -0.03718176395551576, -0.0894684988811526, -0.24207517896197478, 0.2941465747994882, 0.09894033883832196, 0.3079463356979342, -0.001883638388816418, 0.13644848428558926, -0.02022494115958238, -0.012655208266819316, 0.045028796457184876, -0.10388720966648442, 0.1329278722418892, 0.15862070795450078, 0.11315684754272244, 0.3145617470158684, -0.41826495634811806, -0.2585723399254628, 0.14065775037285566, 0.15366744229450924, 0.08624727459156056, -0.062124897554032964, -0.26972838741797156, 0.056537421194115124, -0.0865213318816736, -0.10397194984578931, -0.12116514205275847, -0.03954764001200654, 0.08188570580159911, -0.2780652870440915, 0.10568459171295769, 0.08128002387231938, 0.042873205843171634, -0.05655271220599662, -0.12275581107329513, -0.011147771105358667, 0.08812554696887043, 0.08338439803182907, 0.0017992646717385663, 0.16474718627966725, -0.14788554266708864, -0.08695086846370358, 0.3200550591842288, -0.1266295494124121, -0.20933322598377102, 0.19916554548336204, -0.1130213935070838, -0.10997605454338165, 0.1486535647835561, 0.202903949982632, 0.12116302437595808, -0.18153109070421009, 0.0574395117219376, 0.0419248579597542, 0.1003328776737336, 0.023166245226398367, 0.02121404787684344, 0.1326042082715198, 0.1757122424533429, 0.13756061080477142, 0.17834453081249158, -0.10406373690469245, -0.1701333012466852, -0.2540958730417783, -0.12092598312335208, -0.16679204814674364, 0.07284145370917125, -0.09366619177489013, -0.16759453166943755, 0.40655833631727006, 0.18227425297840655, 0.2384682905811795, 0.07029375306672465, 0.3242794549324135, 0.09239438704801778, 0.02671002249120374, 0.09850360112361653, 0.25820413254190644, 0.15251607898046732, 0.09980033942083748, -0.2545768458307371, 0.06942270974214108, 0.05163225741260227] |
1,803.00196 | Learning Flexible and Reusable Locomotion Primitives for a Microrobot | The design of gaits for robot locomotion can be a daunting process which
requires significant expert knowledge and engineering. This process is even
more challenging for robots that do not have an accurate physical model, such
as compliant or micro-scale robots. Data-driven gait optimization provides an
automated alternative to analytical gait design. In this paper, we propose a
novel approach to efficiently learn a wide range of locomotion tasks with
walking robots. This approach formalizes locomotion as a contextual policy
search task to collect data, and subsequently uses that data to learn
multi-objective locomotion primitives that can be used for planning. As a
proof-of-concept we consider a simulated hexapod modeled after a recently
developed microrobot, and we thoroughly evaluate the performance of this
microrobot on different tasks and gaits. Our results validate the proposed
controller and learning scheme on single and multi-objective locomotion tasks.
Moreover, the experimental simulations show that without any prior knowledge
about the robot used (e.g., dynamics model), our approach is capable of
learning locomotion primitives within 250 trials and subsequently using them to
successfully navigate through a maze.
| cs.RO cs.AI cs.LG stat.ML | the design of gaits for robot locomotion can be a daunting process which requires significant expert knowledge and engineering this process is even more challenging for robots that do not have an accurate physical model such as compliant or microscale robots datadriven gait optimization provides an automated alternative to analytical gait design in this paper we propose a novel approach to efficiently learn a wide range of locomotion tasks with walking robots this approach formalizes locomotion as a contextual policy search task to collect data and subsequently uses that data to learn multiobjective locomotion primitives that can be used for planning as a proofofconcept we consider a simulated hexapod modeled after a recently developed microrobot and we thoroughly evaluate the performance of this microrobot on different tasks and gaits our results validate the proposed controller and learning scheme on single and multiobjective locomotion tasks moreover the experimental simulations show that without any prior knowledge about the robot used eg dynamics model our approach is capable of learning locomotion primitives within 250 trials and subsequently using them to successfully navigate through a maze | [['the', 'design', 'of', 'gaits', 'for', 'robot', 'locomotion', 'can', 'be', 'a', 'daunting', 'process', 'which', 'requires', 'significant', 'expert', 'knowledge', 'and', 'engineering', 'this', 'process', 'is', 'even', 'more', 'challenging', 'for', 'robots', 'that', 'do', 'not', 'have', 'an', 'accurate', 'physical', 'model', 'such', 'as', 'compliant', 'or', 'microscale', 'robots', 'datadriven', 'gait', 'optimization', 'provides', 'an', 'automated', 'alternative', 'to', 'analytical', 'gait', 'design', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'approach', 'to', 'efficiently', 'learn', 'a', 'wide', 'range', 'of', 'locomotion', 'tasks', 'with', 'walking', 'robots', 'this', 'approach', 'formalizes', 'locomotion', 'as', 'a', 'contextual', 'policy', 'search', 'task', 'to', 'collect', 'data', 'and', 'subsequently', 'uses', 'that', 'data', 'to', 'learn', 'multiobjective', 'locomotion', 'primitives', 'that', 'can', 'be', 'used', 'for', 'planning', 'as', 'a', 'proofofconcept', 'we', 'consider', 'a', 'simulated', 'hexapod', 'modeled', 'after', 'a', 'recently', 'developed', 'microrobot', 'and', 'we', 'thoroughly', 'evaluate', 'the', 'performance', 'of', 'this', 'microrobot', 'on', 'different', 'tasks', 'and', 'gaits', 'our', 'results', 'validate', 'the', 'proposed', 'controller', 'and', 'learning', 'scheme', 'on', 'single', 'and', 'multiobjective', 'locomotion', 'tasks', 'moreover', 'the', 'experimental', 'simulations', 'show', 'that', 'without', 'any', 'prior', 'knowledge', 'about', 'the', 'robot', 'used', 'eg', 'dynamics', 'model', 'our', 'approach', 'is', 'capable', 'of', 'learning', 'locomotion', 'primitives', 'within', '250', 'trials', 'and', 'subsequently', 'using', 'them', 'to', 'successfully', 'navigate', 'through', 'a', 'maze']] | [-0.05268366650900814, 0.04453534261303683, -0.13348654925229622, 0.012199263942430651, -0.18344124969463427, -0.20342925856156008, 0.05545825527783913, 0.47472486470999953, -0.2500287194193883, -0.3935494099712961, 0.06099761466963913, -0.15671685661424647, -0.2428349030503471, 0.23864972428226802, -0.16678033380098845, 0.1420458285240354, 0.1346081001888756, -0.0010998186829325918, 0.03420831190961398, -0.18900460546841374, 0.22147990009462165, 0.004270612057503108, 0.2740677854194623, 0.00401785465822156, 0.19683476033298156, 0.002790232140386661, 0.05631722040233909, -0.012281966940653357, -0.09953359174519741, 0.14094818290450947, 0.3503092417204343, 0.2018343345773826, 0.33722315363811106, -0.4440358155867556, -0.2337168475656494, 0.09211886835100314, 0.1543355284196438, 0.08649264273405137, -0.04069422976061725, -0.34249720603718864, 0.09852549373709525, -0.18370272681516195, -0.05354760269312045, -0.17434729432500387, -0.0178260049900388, -0.026620538854091377, -0.29908801574364896, -0.04513893224258017, 0.025435234646435705, 0.09522009548055684, -0.0682174945186189, -0.062427191624090404, 0.030825024076665822, 0.19975378453554996, 0.011340311828522256, 0.03105171520587896, 0.22504210202944475, -0.14746735384523874, -0.21942210573943557, 0.4227155957570566, 0.0349762459505595, -0.2564393608795049, 0.2304071923871371, 0.004850456823727914, -0.12407967698975252, 0.10214333117499456, 0.2923456581903028, 0.1659142868778832, -0.2107179629473159, -0.046182031192814235, -0.04278202102696114, 0.18523833647518737, 0.013264988946912627, -0.12795887349664672, 0.15865721463246252, 0.2991086556217991, 0.07673714193259622, 0.12499989910501537, -0.060789970178470515, -0.09791648149961135, -0.22705731999927334, -0.12803911074545365, -0.15669149291896067, -0.03668080918498243, -0.08487526579847327, -0.0914507617242954, 0.37421546690108026, 0.2558852557213158, 0.17030612775892184, 0.13465346220003155, 0.39421803477619377, 0.003275890624186454, 0.08075234501694258, 0.08905211556287083, 0.2028177619481889, -0.04100809832727843, 0.16412908307808852, -0.20803329561693737, 0.10818659155092274, -0.01359592623763032] |
1,803.00197 | Temporally Identity-Aware SSD with Attentional LSTM | Temporal object detection has attracted significant attention, but most
popular detection methods cannot leverage rich temporal information in videos.
Very recently, many algorithms have been developed for video detection task,
yet very few approaches can achieve \emph{real-time online} object detection in
videos. In this paper, based on attention mechanism and convolutional long
short-term memory (ConvLSTM), we propose a temporal single-shot detector (TSSD)
for real-world detection. Distinct from previous methods, we take aim at
temporally integrating pyramidal feature hierarchy using ConvLSTM, and design a
novel structure including a low-level temporal unit as well as a high-level one
(LH-TU) for multi-scale feature maps. Moreover, we develop a creative temporal
analysis unit, namely, attentional ConvLSTM (AC-LSTM), in which a temporal
attention mechanism is specially tailored for background suppression and scale
suppression while a ConvLSTM integrates attention-aware features across time.
An association loss and a multi-step training are designed for temporal
coherence. Besides, an online tubelet analysis (OTA) is exploited for
identification. Our framework is evaluated on ImageNet VID dataset and 2DMOT15
dataset. Extensive comparisons on the detection and tracking capability
validate the superiority of the proposed approach. Consequently, the developed
TSSD-OTA achieves a fast speed and an overall competitive performance in terms
of detection and tracking. Finally, a real-world maneuver is conducted for
underwater object grasping. The source code is publicly available at
https://github.com/SeanChenxy/TSSD-OTA.
| cs.CV cs.RO | temporal object detection has attracted significant attention but most popular detection methods cannot leverage rich temporal information in videos very recently many algorithms have been developed for video detection task yet very few approaches can achieve emphrealtime online object detection in videos in this paper based on attention mechanism and convolutional long shortterm memory convlstm we propose a temporal singleshot detector tssd for realworld detection distinct from previous methods we take aim at temporally integrating pyramidal feature hierarchy using convlstm and design a novel structure including a lowlevel temporal unit as well as a highlevel one lhtu for multiscale feature maps moreover we develop a creative temporal analysis unit namely attentional convlstm aclstm in which a temporal attention mechanism is specially tailored for background suppression and scale suppression while a convlstm integrates attentionaware features across time an association loss and a multistep training are designed for temporal coherence besides an online tubelet analysis ota is exploited for identification our framework is evaluated on imagenet vid dataset and 2dmot15 dataset extensive comparisons on the detection and tracking capability validate the superiority of the proposed approach consequently the developed tssdota achieves a fast speed and an overall competitive performance in terms of detection and tracking finally a realworld maneuver is conducted for underwater object grasping the source code is publicly available at httpsgithubcomseanchenxytssdota | [['temporal', 'object', 'detection', 'has', 'attracted', 'significant', 'attention', 'but', 'most', 'popular', 'detection', 'methods', 'can', 'not', 'leverage', 'rich', 'temporal', 'information', 'in', 'videos', 'very', 'recently', 'many', 'algorithms', 'have', 'been', 'developed', 'for', 'video', 'detection', 'task', 'yet', 'very', 'few', 'approaches', 'can', 'achieve', 'emphrealtime', 'online', 'object', 'detection', 'in', 'videos', 'in', 'this', 'paper', 'based', 'on', 'attention', 'mechanism', 'and', 'convolutional', 'long', 'shortterm', 'memory', 'convlstm', 'we', 'propose', 'a', 'temporal', 'singleshot', 'detector', 'tssd', 'for', 'realworld', 'detection', 'distinct', 'from', 'previous', 'methods', 'we', 'take', 'aim', 'at', 'temporally', 'integrating', 'pyramidal', 'feature', 'hierarchy', 'using', 'convlstm', 'and', 'design', 'a', 'novel', 'structure', 'including', 'a', 'lowlevel', 'temporal', 'unit', 'as', 'well', 'as', 'a', 'highlevel', 'one', 'lhtu', 'for', 'multiscale', 'feature', 'maps', 'moreover', 'we', 'develop', 'a', 'creative', 'temporal', 'analysis', 'unit', 'namely', 'attentional', 'convlstm', 'aclstm', 'in', 'which', 'a', 'temporal', 'attention', 'mechanism', 'is', 'specially', 'tailored', 'for', 'background', 'suppression', 'and', 'scale', 'suppression', 'while', 'a', 'convlstm', 'integrates', 'attentionaware', 'features', 'across', 'time', 'an', 'association', 'loss', 'and', 'a', 'multistep', 'training', 'are', 'designed', 'for', 'temporal', 'coherence', 'besides', 'an', 'online', 'tubelet', 'analysis', 'ota', 'is', 'exploited', 'for', 'identification', 'our', 'framework', 'is', 'evaluated', 'on', 'imagenet', 'vid', 'dataset', 'and', '2dmot15', 'dataset', 'extensive', 'comparisons', 'on', 'the', 'detection', 'and', 'tracking', 'capability', 'validate', 'the', 'superiority', 'of', 'the', 'proposed', 'approach', 'consequently', 'the', 'developed', 'tssdota', 'achieves', 'a', 'fast', 'speed', 'and', 'an', 'overall', 'competitive', 'performance', 'in', 'terms', 'of', 'detection', 'and', 'tracking', 'finally', 'a', 'realworld', 'maneuver', 'is', 'conducted', 'for', 'underwater', 'object', 'grasping', 'the', 'source', 'code', 'is', 'publicly', 'available', 'at', 'httpsgithubcomseanchenxytssdota']] | [-0.06557818162525722, -0.01863981158747392, -0.07266439643450255, 0.06039413849195076, -0.1089814447213051, -0.19497908847731388, -0.02106697227058629, 0.5143977526055519, -0.22070769678184027, -0.33700253451243045, 0.1074747834890691, -0.26283496067382744, -0.18291833739901006, 0.20886754950313546, -0.1238073040005686, 0.11246209538184367, 0.14873556101391483, 0.07296874233396984, -0.03901259820301865, -0.2259741072109792, 0.22725097111664538, 0.11123100581557252, 0.37434866255105925, 0.07317433242014675, 0.19067503799038646, -0.03771724149897467, -0.08517207860903338, -0.004602336636636146, -0.015972504067386307, 0.15314173689274507, 0.3015810960264833, 0.19590922988258128, 0.32817053581198113, -0.40334785174318527, -0.2782226452473984, 0.046601861272397085, 0.16353669907507856, 0.09536193975269101, -0.10649798112734611, -0.36600194560840377, 0.10207657921100902, -0.19835457151625738, 0.054791145938513586, -0.158874231261786, 0.01658400770975277, -0.04136321140090437, -0.28621045375854687, 0.03060401081334973, 0.06840989251220382, 0.08533222734343347, -0.037472448803397805, -0.06339081662360492, 0.06371967596283486, 0.18260998451259247, -0.008194139507750785, 0.03106953926969233, 0.11336072447904667, -0.18539241563723705, -0.1765914653752779, 0.3546499337654474, -0.0702023894377161, -0.1879471800972296, 0.21757361708793702, -0.008517702701393254, -0.17108332861301512, 0.1382294303253645, 0.2754697192373664, 0.16368819061060286, -0.1838484716344473, -0.016069290119894716, -0.03458059997254506, 0.23354594995765837, 0.06650859046684102, 0.043924362529718944, 0.1910145413888575, 0.33553642666963646, 0.019961668631375964, 0.1351666090663436, -0.2159767871365211, -0.08527038642746765, -0.19123086549861487, -0.08275542202470608, -0.15771028369686804, -0.06186870462254372, -0.07725796782422464, -0.10723700396510838, 0.44016570517316805, 0.22426861037261958, 0.18365397687113388, 0.1076916252174902, 0.35443449052115683, 0.00213699477107459, 0.13214358918065594, 0.08019816383345832, 0.17295787190682751, -0.01963427257290933, 0.1541825007184322, -0.18931417117913274, 0.10294452747221776, 0.05990115515021391] |
1,803.00198 | Numbers of the connected components of the solution sets of monotone
affine vector variational inequalities | This paper establishes several upper and lower estimates for the maximal
number of the connected components of the solution sets of monotone affine
vector variational inequalities. Our results give a partial solution to
Question~2 in [N.D. Yen and J.-C. Yao, \textit{Monotone affine vector
variational inequalities}, Optimization 60 (2011), pp. 53--68] and point out
that the number depends not only on the number of the criteria but also on the
number of variables of the vector variational inequality under investigation.
| math.OC math.GN | this paper establishes several upper and lower estimates for the maximal number of the connected components of the solution sets of monotone affine vector variational inequalities our results give a partial solution to question2 in nd yen and jc yao textitmonotone affine vector variational inequalities optimization 60 2011 pp 5368 and point out that the number depends not only on the number of the criteria but also on the number of variables of the vector variational inequality under investigation | [['this', 'paper', 'establishes', 'several', 'upper', 'and', 'lower', 'estimates', 'for', 'the', 'maximal', 'number', 'of', 'the', 'connected', 'components', 'of', 'the', 'solution', 'sets', 'of', 'monotone', 'affine', 'vector', 'variational', 'inequalities', 'our', 'results', 'give', 'a', 'partial', 'solution', 'to', 'question2', 'in', 'nd', 'yen', 'and', 'jc', 'yao', 'textitmonotone', 'affine', 'vector', 'variational', 'inequalities', 'optimization', '60', '2011', 'pp', '5368', 'and', 'point', 'out', 'that', 'the', 'number', 'depends', 'not', 'only', 'on', 'the', 'number', 'of', 'the', 'criteria', 'but', 'also', 'on', 'the', 'number', 'of', 'variables', 'of', 'the', 'vector', 'variational', 'inequality', 'under', 'investigation']] | [-0.14944748044340544, 0.06769984138996474, -0.026216202796521513, 0.030074140460641642, -0.08510006161092164, -0.1270341603992531, 0.13065382706563822, 0.2707365934597933, -0.2546002530045324, -0.3170199795239061, 0.11963261415208266, -0.2812428917348772, -0.13400260091747168, 0.24027544978473866, -0.06271186304073055, 0.08109945182948579, 0.050616529455722925, 0.049790870482948696, -0.07186183474304808, -0.3378131439207823, 0.30355926653878257, -0.03275580710259738, 0.2839737914671952, 0.08210222859331709, 0.11588539120547667, 0.04284788903405334, -0.031224444076152786, 0.0232676834763064, -0.16870266184947444, 0.16412606931521329, 0.23044680586302435, 0.17777232943683283, 0.28389970032957856, -0.38181564898846987, -0.1432609730037292, 0.15461855056369073, 0.0997599035852238, 0.03702311941071764, 0.0020941604479131374, -0.2631204666497258, 0.06480620753673183, -0.09156758278946985, -0.13935792932964183, -0.07683498893755597, 0.0009847449066189976, 0.062108873208234834, -0.29213844978117515, 0.06898807972184286, 0.10586849618824078, 0.06983153103788795, -0.09452333335474424, -0.17491045199915187, -0.03910763110124881, -0.02652692954455103, 0.034615401585296086, 0.06641398871003033, 0.07334412189273092, -0.0952154162866003, -0.10492910839641442, 0.25435070596127346, -0.01246683072153624, -0.2571498712694103, 0.15068210591562092, -0.11079419977575927, -0.1722536984492432, 0.10268767824541632, 0.17500922950468473, 0.1333217129153623, -0.13976867365130743, 0.11361969750776718, -0.1387820453322553, 0.11642398547521768, 0.07097938780176949, 0.03758151298419077, 0.03517305004628157, 0.07456605949185112, 0.1744764886346499, 0.1241614913307856, -0.06784760356312255, -0.11052442493231653, -0.36173235143643695, -0.18613992177585725, -0.1745909094483918, 0.06612773697128574, -0.1609904682367674, -0.1683746264013764, 0.3604375319434451, 0.09256411390379071, 0.19919798334504102, 0.0834698931543858, 0.20927420176275366, 0.11573463830909414, -0.011071778034502959, 0.11712564074422245, 0.23347807028512288, 0.23393762173953575, 0.06105567693903849, -0.15914557959170794, 0.07424118301026862, 0.15844533708877861] |
1,803.00199 | An extension of polynomial integrability to dual quermassintegrals | A body $K$ is called polynomially integrable if its parallel section function
$V_{n-1}(K\cap\{\xi^\perp+t\xi\})$ is a polynomial of $t$ (on its support) for
every $\xi$. A complete characterization of such bodies was given recently.
Here we obtain a generalization of these results in the setting of dual
quermassintegrals. We also address the associated smoothness issues.
| math.MG | a body k is called polynomially integrable if its parallel section function v_n1kcapxiperptxi is a polynomial of t on its support for every xi a complete characterization of such bodies was given recently here we obtain a generalization of these results in the setting of dual quermassintegrals we also address the associated smoothness issues | [['a', 'body', 'k', 'is', 'called', 'polynomially', 'integrable', 'if', 'its', 'parallel', 'section', 'function', 'v_n1kcapxiperptxi', 'is', 'a', 'polynomial', 'of', 't', 'on', 'its', 'support', 'for', 'every', 'xi', 'a', 'complete', 'characterization', 'of', 'such', 'bodies', 'was', 'given', 'recently', 'here', 'we', 'obtain', 'a', 'generalization', 'of', 'these', 'results', 'in', 'the', 'setting', 'of', 'dual', 'quermassintegrals', 'we', 'also', 'address', 'the', 'associated', 'smoothness', 'issues']] | [-0.14851105260610017, 0.09358958756762012, -0.08521231017866225, 0.05476098601214306, -0.0947775773282321, -0.11282303129797275, 0.013468771997206617, 0.3447574544698, -0.29521897020486165, -0.17398621882575582, 0.1279347721939766, -0.2735371501800024, -0.18965182957713897, 0.20085789755267916, -0.11381732340339783, 0.06070333664560304, 0.0668099927979539, 0.11607341176636939, -0.0969651479906631, -0.2942443893835792, 0.3281354414088265, -0.016573952440664452, 0.15810945482467706, 0.11886126932881351, 0.1532130959742474, 0.007028315023009507, -0.016780817731863486, 0.061798095211105526, -0.1923830002054291, 0.12768097314105, 0.21917260273025846, 0.1597670994540852, 0.30669978092301564, -0.3371937059910467, -0.16154754831332643, 0.1459730976032761, 0.09900053898487592, 0.048734702459835216, -0.021531616656092118, -0.21667182294405857, 0.15675848471176512, -0.12821602232683943, -0.1775439072330043, -0.049743269622888206, 0.08006583266663102, 0.02201292710378766, -0.28229260708222975, 0.01877147125745772, 0.13769260330020255, 0.05978518575215756, -0.0835709909969976, -0.08682838458356992, 0.030606640458880167, 0.04311126372161901, -0.01241582791092542, 0.09331506972183597, 0.05937945767072961, -0.11022295918807669, -0.13297190779011767, 0.353332233105628, -0.03228297564288918, -0.26559649355147247, 0.1732015791085531, -0.11886613944299379, -0.16859724601062964, 0.08369887938266093, 0.17254716140341084, 0.1751245043574358, -0.10442680336605266, 0.198406669961394, -0.1314567037998646, 0.12604973352742646, 0.08142838783491894, 0.03701811139735411, 0.14970932284124056, 0.16319538210079354, 0.11817271887096313, 0.20194828897310457, -0.032751743555429196, -0.029763413751322142, -0.35503544489730077, -0.21619214892457678, -0.19776646074188767, 0.0650097966361088, -0.0712982556817807, -0.18088711229815227, 0.37617989358896353, 0.05453993917776728, 0.2426393818602247, 0.08884389250416239, 0.24055927151919537, 0.12066287120347316, 0.046148586570162256, 0.07861877643977697, 0.15944662131369114, 0.1765514956128274, 0.06349106754158747, -0.16134022823139532, 0.07660119827696175, 0.10047807806294481] |
1,803.002 | Probability-Scale Residuals in HIV/AIDS Research: Diagnostics and
Inference | The probability-scale residual (PSR) is well defined across a wide variety of
variable types and models, making it useful for studies of HIV/AIDS. In this
manuscript, we highlight some of the properties of the PSR and illustrate its
application with HIV data. As a residual, it can be useful for model
diagnostics; we demonstrate its use with ordered categorical data and
semiparametric transformation models. The PSR can also be used to construct
tests of residual correlation. In fact, partial Spearman's rank correlation
between $X$ and $Y$ while adjusting for covariates $Z$ can be constructed as
the correlation between PSRs from models of $Y$ on $Z$ and of $X$ on $Z$. The
covariance of PSRs is also useful in some settings. We apply these methods to a
variety of HIV datasets including 1) a study examining risk factors for more
severe forms of cervical lesions among 145 women living with HIV in Zambia, 2)
a study investigating the association between 21 metabolomic biomarkers among
70 HIV-positive patients in the southeastern United States, and 3) a genome
wide association study investigating the association between single nucleotide
polymorphisms and tenofovir clearance among 501 HIV-positive persons
participating in a multi-site randomized clinical trial.
| stat.AP | the probabilityscale residual psr is well defined across a wide variety of variable types and models making it useful for studies of hivaids in this manuscript we highlight some of the properties of the psr and illustrate its application with hiv data as a residual it can be useful for model diagnostics we demonstrate its use with ordered categorical data and semiparametric transformation models the psr can also be used to construct tests of residual correlation in fact partial spearmans rank correlation between x and y while adjusting for covariates z can be constructed as the correlation between psrs from models of y on z and of x on z the covariance of psrs is also useful in some settings we apply these methods to a variety of hiv datasets including 1 a study examining risk factors for more severe forms of cervical lesions among 145 women living with hiv in zambia 2 a study investigating the association between 21 metabolomic biomarkers among 70 hivpositive patients in the southeastern united states and 3 a genome wide association study investigating the association between single nucleotide polymorphisms and tenofovir clearance among 501 hivpositive persons participating in a multisite randomized clinical trial | [['the', 'probabilityscale', 'residual', 'psr', 'is', 'well', 'defined', 'across', 'a', 'wide', 'variety', 'of', 'variable', 'types', 'and', 'models', 'making', 'it', 'useful', 'for', 'studies', 'of', 'hivaids', 'in', 'this', 'manuscript', 'we', 'highlight', 'some', 'of', 'the', 'properties', 'of', 'the', 'psr', 'and', 'illustrate', 'its', 'application', 'with', 'hiv', 'data', 'as', 'a', 'residual', 'it', 'can', 'be', 'useful', 'for', 'model', 'diagnostics', 'we', 'demonstrate', 'its', 'use', 'with', 'ordered', 'categorical', 'data', 'and', 'semiparametric', 'transformation', 'models', 'the', 'psr', 'can', 'also', 'be', 'used', 'to', 'construct', 'tests', 'of', 'residual', 'correlation', 'in', 'fact', 'partial', 'spearmans', 'rank', 'correlation', 'between', 'x', 'and', 'y', 'while', 'adjusting', 'for', 'covariates', 'z', 'can', 'be', 'constructed', 'as', 'the', 'correlation', 'between', 'psrs', 'from', 'models', 'of', 'y', 'on', 'z', 'and', 'of', 'x', 'on', 'z', 'the', 'covariance', 'of', 'psrs', 'is', 'also', 'useful', 'in', 'some', 'settings', 'we', 'apply', 'these', 'methods', 'to', 'a', 'variety', 'of', 'hiv', 'datasets', 'including', '1', 'a', 'study', 'examining', 'risk', 'factors', 'for', 'more', 'severe', 'forms', 'of', 'cervical', 'lesions', 'among', '145', 'women', 'living', 'with', 'hiv', 'in', 'zambia', '2', 'a', 'study', 'investigating', 'the', 'association', 'between', '21', 'metabolomic', 'biomarkers', 'among', '70', 'hivpositive', 'patients', 'in', 'the', 'southeastern', 'united', 'states', 'and', '3', 'a', 'genome', 'wide', 'association', 'study', 'investigating', 'the', 'association', 'between', 'single', 'nucleotide', 'polymorphisms', 'and', 'tenofovir', 'clearance', 'among', '501', 'hivpositive', 'persons', 'participating', 'in', 'a', 'multisite', 'randomized', 'clinical', 'trial']] | [-0.05909314238809689, 0.07764764729242847, -0.050766559367096335, 0.13615711075030362, -0.047829466474458876, -0.16748734061944892, 0.10763940087685978, 0.4044842152677552, -0.22133872625088752, -0.29489870928463086, 0.10657005032613835, -0.295718486550969, -0.16252468155950986, 0.21967975557146763, -0.08147848133148268, -0.009105033439353597, 0.08432885726109486, 0.001451569304782709, -0.034868537424828365, -0.2758549500187398, 0.27278154400868737, 0.01787043338749708, 0.25113329314979527, 0.014088846747222536, 0.107525582214808, 0.028443141064296167, -0.06045177029892614, -0.0011858434629193836, -0.08211396566846153, 0.12923054802413758, 0.33045732029585445, 0.19194515468082343, 0.31056862969816934, -0.3363039251852009, -0.21650816057573516, 0.1463306424398483, 0.1032971328216566, 0.03262909172013734, 0.0020745818927558374, -0.3191188184304558, 0.07218215701339598, -0.20253722257724013, -0.07943400974277257, -0.0724553862807689, 0.018981192261568563, 0.053162984963626404, -0.2824630246714059, 0.14268090927154586, -0.042944409459126136, 0.14301676586543144, -0.07425284612985009, -0.16374694946400745, -0.03379625043093293, 0.16672238185202157, 0.10087608043845235, 0.03273536003608671, 0.10747894509918894, -0.15200041447450982, -0.12746373364011607, 0.33481593523644887, -0.01012908161477882, -0.16614872415437165, 0.21088635786013168, -0.16193502167747778, -0.1848896126512137, 0.057724655391836556, 0.21154317875848988, 0.09781502361536952, -0.1794270413617293, 0.012372561846271796, -0.03355148342212267, 0.17609510975160797, 0.05772836132426605, -0.0021617426172444464, 0.18199258671269158, 0.18126630185482404, -0.007072385736844606, 0.1128346034275095, -0.16731898801758735, -0.025341312511532446, -0.2397425544608121, -0.16438984624204236, -0.08733451141075659, 0.045702461952889205, -0.11778813127727857, -0.13513774806727666, 0.40991448289291427, 0.1265271733387966, 0.15587925519429693, 0.036977015276212534, 0.2052640078243602, 0.003016250503174208, 0.07256362824512627, 0.026294545866690125, 0.1419999493615857, 0.12804811833087693, 0.040018298158732556, -0.19468904774068063, 0.12484340614761517, -0.035505623316199456] |
1,803.00201 | An Application of the Tarski-Seidenberg Theorem with Quantifiers to
Vector Variational Inequalities | We study the connectedness structure of the proper Pareto solution sets, the
Pareto solution sets, the weak Pareto solution sets of polynomial vector
variational inequalities, as well as the connectedness structure of the
efficient solution sets and the weakly efficient solution sets of polynomial
vector optimization problems. By using the Tarski-Seidenberg Theorem with
quantifiers, we are able to prove that these solution sets are semi-algebraic
without imposing the Mangasarian-Fromovitz constraint qualification on the
system of constraints.
| math.OC math.AG | we study the connectedness structure of the proper pareto solution sets the pareto solution sets the weak pareto solution sets of polynomial vector variational inequalities as well as the connectedness structure of the efficient solution sets and the weakly efficient solution sets of polynomial vector optimization problems by using the tarskiseidenberg theorem with quantifiers we are able to prove that these solution sets are semialgebraic without imposing the mangasarianfromovitz constraint qualification on the system of constraints | [['we', 'study', 'the', 'connectedness', 'structure', 'of', 'the', 'proper', 'pareto', 'solution', 'sets', 'the', 'pareto', 'solution', 'sets', 'the', 'weak', 'pareto', 'solution', 'sets', 'of', 'polynomial', 'vector', 'variational', 'inequalities', 'as', 'well', 'as', 'the', 'connectedness', 'structure', 'of', 'the', 'efficient', 'solution', 'sets', 'and', 'the', 'weakly', 'efficient', 'solution', 'sets', 'of', 'polynomial', 'vector', 'optimization', 'problems', 'by', 'using', 'the', 'tarskiseidenberg', 'theorem', 'with', 'quantifiers', 'we', 'are', 'able', 'to', 'prove', 'that', 'these', 'solution', 'sets', 'are', 'semialgebraic', 'without', 'imposing', 'the', 'mangasarianfromovitz', 'constraint', 'qualification', 'on', 'the', 'system', 'of', 'constraints']] | [-0.14344562001526356, -0.0346994540343682, -0.09187698510165015, 0.11887597476442655, -0.107996152623867, -0.11355913675079743, 0.08997663932542006, 0.3241654745241006, -0.3853106374790271, -0.26584055703133347, 0.16063935025284687, -0.2799257841830452, -0.12150300006071726, 0.17552984585054218, -0.03861335339645545, 0.1522766867466271, 0.10098651932397236, 0.0019457376593103011, -0.046185859637334944, -0.2825217756846299, 0.402470153371493, -0.0386897553751866, 0.281672537929068, 0.052561745680868625, 0.1585544954488675, -0.023357175597921012, 0.03711569079508384, 0.09621472063163916, -0.14946627180761424, 0.15307855849464735, 0.22680121137139697, 0.2886544352180014, 0.2907307095391055, -0.39671053061882655, -0.11372004393488169, 0.1715799390276273, 0.07717735393593708, 0.03063480479021867, 0.02051942183325688, -0.30460058314104876, 0.10262465486923854, -0.07390436857628326, -0.17180342790981135, -0.16076332865903775, -0.044086916372179985, 0.10894321250108381, -0.32225135154556483, 0.03631810013204813, 0.06224239494806776, 0.027923433595957857, -0.16071400495866933, -0.10343681253958494, 0.0001740529900416732, -0.008385882787406445, 0.010442853818337122, -0.003483901306365927, 0.06725330885499715, -0.11502665577456356, -0.13755211151515445, 0.36098141645391785, -0.00996502587882181, -0.2972904827135305, 0.15477851898719866, -0.09948506822188695, -0.13181585935875773, 0.09046449692298969, 0.13084202289581298, 0.15561260048300027, -0.16627436087932437, 0.16322190386475996, -0.13319269141803186, 0.11869310801227888, 0.12206298572321733, 0.036550958678126334, 0.1153127965858827, 0.13832830170790356, 0.2314924414952596, 0.17642479275663694, 0.011001286385580898, -0.09611709917585055, -0.35514356901248295, -0.09007602409770091, -0.15794248901307584, 0.0006309725592533748, -0.19287501326432296, -0.23321726523339747, 0.3394918739919861, 0.052807022295892236, 0.1267783202479283, 0.12518521405756475, 0.2612042320768038, 0.13320104171521963, -0.0027752208026746907, 0.09933696980277697, 0.1954748721172412, 0.14687743732084832, 0.04339156593506535, -0.15784145161819954, 0.0978151114595433, 0.16414334826171398] |
1,803.00202 | Collaborative Metric Learning Recommendation System: Application to
Theatrical Movie Releases | Product recommendation systems are important for major movie studios during
the movie greenlight process and as part of machine learning personalization
pipelines. Collaborative Filtering (CF) models have proved to be effective at
powering recommender systems for online streaming services with explicit
customer feedback data. CF models do not perform well in scenarios in which
feedback data is not available, in cold start situations like new product
launches, and situations with markedly different customer tiers (e.g., high
frequency customers vs. casual customers). Generative natural language models
that create useful theme-based representations of an underlying corpus of
documents can be used to represent new product descriptions, like new movie
plots. When combined with CF, they have shown to increase the performance in
cold start situations. Outside of those cases though in which explicit customer
feedback is available, recommender engines must rely on binary purchase data,
which materially degrades performance. Fortunately, purchase data can be
combined with product descriptions to generate meaningful representations of
products and customer trajectories in a convenient product space in which
proximity represents similarity. Learning to measure the distance between
points in this space can be accomplished with a deep neural network that trains
on customer histories and on dense vectorizations of product descriptions. We
developed a system based on Collaborative (Deep) Metric Learning (CML) to
predict the purchase probabilities of new theatrical releases. We trained and
evaluated the model using a large dataset of customer histories, and tested the
model for a set of movies that were released outside of the training window.
Initial experiments show gains relative to models that do not train on
collaborative preferences.
| cs.IR cs.CL | product recommendation systems are important for major movie studios during the movie greenlight process and as part of machine learning personalization pipelines collaborative filtering cf models have proved to be effective at powering recommender systems for online streaming services with explicit customer feedback data cf models do not perform well in scenarios in which feedback data is not available in cold start situations like new product launches and situations with markedly different customer tiers eg high frequency customers vs casual customers generative natural language models that create useful themebased representations of an underlying corpus of documents can be used to represent new product descriptions like new movie plots when combined with cf they have shown to increase the performance in cold start situations outside of those cases though in which explicit customer feedback is available recommender engines must rely on binary purchase data which materially degrades performance fortunately purchase data can be combined with product descriptions to generate meaningful representations of products and customer trajectories in a convenient product space in which proximity represents similarity learning to measure the distance between points in this space can be accomplished with a deep neural network that trains on customer histories and on dense vectorizations of product descriptions we developed a system based on collaborative deep metric learning cml to predict the purchase probabilities of new theatrical releases we trained and evaluated the model using a large dataset of customer histories and tested the model for a set of movies that were released outside of the training window initial experiments show gains relative to models that do not train on collaborative preferences | [['product', 'recommendation', 'systems', 'are', 'important', 'for', 'major', 'movie', 'studios', 'during', 'the', 'movie', 'greenlight', 'process', 'and', 'as', 'part', 'of', 'machine', 'learning', 'personalization', 'pipelines', 'collaborative', 'filtering', 'cf', 'models', 'have', 'proved', 'to', 'be', 'effective', 'at', 'powering', 'recommender', 'systems', 'for', 'online', 'streaming', 'services', 'with', 'explicit', 'customer', 'feedback', 'data', 'cf', 'models', 'do', 'not', 'perform', 'well', 'in', 'scenarios', 'in', 'which', 'feedback', 'data', 'is', 'not', 'available', 'in', 'cold', 'start', 'situations', 'like', 'new', 'product', 'launches', 'and', 'situations', 'with', 'markedly', 'different', 'customer', 'tiers', 'eg', 'high', 'frequency', 'customers', 'vs', 'casual', 'customers', 'generative', 'natural', 'language', 'models', 'that', 'create', 'useful', 'themebased', 'representations', 'of', 'an', 'underlying', 'corpus', 'of', 'documents', 'can', 'be', 'used', 'to', 'represent', 'new', 'product', 'descriptions', 'like', 'new', 'movie', 'plots', 'when', 'combined', 'with', 'cf', 'they', 'have', 'shown', 'to', 'increase', 'the', 'performance', 'in', 'cold', 'start', 'situations', 'outside', 'of', 'those', 'cases', 'though', 'in', 'which', 'explicit', 'customer', 'feedback', 'is', 'available', 'recommender', 'engines', 'must', 'rely', 'on', 'binary', 'purchase', 'data', 'which', 'materially', 'degrades', 'performance', 'fortunately', 'purchase', 'data', 'can', 'be', 'combined', 'with', 'product', 'descriptions', 'to', 'generate', 'meaningful', 'representations', 'of', 'products', 'and', 'customer', 'trajectories', 'in', 'a', 'convenient', 'product', 'space', 'in', 'which', 'proximity', 'represents', 'similarity', 'learning', 'to', 'measure', 'the', 'distance', 'between', 'points', 'in', 'this', 'space', 'can', 'be', 'accomplished', 'with', 'a', 'deep', 'neural', 'network', 'that', 'trains', 'on', 'customer', 'histories', 'and', 'on', 'dense', 'vectorizations', 'of', 'product', 'descriptions', 'we', 'developed', 'a', 'system', 'based', 'on', 'collaborative', 'deep', 'metric', 'learning', 'cml', 'to', 'predict', 'the', 'purchase', 'probabilities', 'of', 'new', 'theatrical', 'releases', 'we', 'trained', 'and', 'evaluated', 'the', 'model', 'using', 'a', 'large', 'dataset', 'of', 'customer', 'histories', 'and', 'tested', 'the', 'model', 'for', 'a', 'set', 'of', 'movies', 'that', 'were', 'released', 'outside', 'of', 'the', 'training', 'window', 'initial', 'experiments', 'show', 'gains', 'relative', 'to', 'models', 'that', 'do', 'not', 'train', 'on', 'collaborative', 'preferences']] | [-0.04906568616070896, 0.05024568884032509, -0.06160586282138282, 0.09726395809426024, -0.1413469857313851, -0.18762506495070047, 0.06538391233866674, 0.45047549600365444, -0.252919664811482, -0.31408897845018935, 0.07565682226576523, -0.3157916482704789, -0.10521545262187164, 0.2148289286640973, -0.1289738641683457, 0.01638391924806551, 0.1492894067839066, 0.08684482772959702, -0.04539836983742895, -0.30493615936738117, 0.332441604250969, 0.06341270047544897, 0.3427937228263898, -0.00992517195704546, 0.09606822478751532, -0.019412653741371164, -0.05767058446975564, -0.017595186520019755, -0.07715563284271873, 0.116440511094024, 0.3629281419769052, 0.23780686109076574, 0.2922496195263994, -0.431248349499013, -0.2052295251415848, 0.0973472126234851, 0.14682885331340412, 0.04652770045743352, -0.03753229896034072, -0.3239761226860035, 0.048621199327458474, -0.25871998598667056, 0.004273325319527023, -0.13774285776281744, 0.004589498977423576, 0.03721939342786659, -0.30870400940949, 0.0049404073831296885, 0.01969025839188457, 0.04833379489154235, -0.06109289746602181, -0.09092463490660928, -0.0023230725548355215, 0.19199105205617928, 0.04003432127132355, 0.013451475723917639, 0.1690331916272668, -0.1655645539735204, -0.14581172406732507, 0.40396995761834864, -0.06185986430544073, -0.1828531458130742, 0.21517746748642497, -0.046981623122614544, -0.14652961777147852, 0.07822124066883385, 0.28315465200567314, 0.06616739985062185, -0.18110264438525261, -0.018287354826565776, -0.03343759084367124, 0.16770235572571504, 0.04392806681502027, -0.014840700321330396, 0.22496930796196057, 0.1994419519697427, 0.029383713578885255, 0.07679653819476658, -0.014221308030945653, -0.0976777536309769, -0.18796059401460868, -0.11499486179021534, -0.15877443418573978, 0.01395500700419322, -0.10420845144455679, -0.16399039006598706, 0.3354387898866866, 0.18180533669847274, 0.19288595029154668, 0.044700496884778756, 0.30982638944162805, 0.05837779965147649, 0.1213605534585033, 0.10174154354530428, 0.13751478939240716, -0.032577546061895814, 0.16885193509967136, -0.10747380862394765, 0.11709058964659752, 0.03041083885117003] |
1,803.00203 | An indecomposable continuum as subpower Higson corona | In this paper, we study the topological properties of the subpower Higson
corona of proper metric spaces and show that the subpower Higson corona of the
half open interval with the usual metric is an indecomposable continuum. Some
surjective maps from the Higson type coronas onto the Higson type
compactifications of the half open interval are also constructed.
| math.GN | in this paper we study the topological properties of the subpower higson corona of proper metric spaces and show that the subpower higson corona of the half open interval with the usual metric is an indecomposable continuum some surjective maps from the higson type coronas onto the higson type compactifications of the half open interval are also constructed | [['in', 'this', 'paper', 'we', 'study', 'the', 'topological', 'properties', 'of', 'the', 'subpower', 'higson', 'corona', 'of', 'proper', 'metric', 'spaces', 'and', 'show', 'that', 'the', 'subpower', 'higson', 'corona', 'of', 'the', 'half', 'open', 'interval', 'with', 'the', 'usual', 'metric', 'is', 'an', 'indecomposable', 'continuum', 'some', 'surjective', 'maps', 'from', 'the', 'higson', 'type', 'coronas', 'onto', 'the', 'higson', 'type', 'compactifications', 'of', 'the', 'half', 'open', 'interval', 'are', 'also', 'constructed']] | [-0.12782115200213318, 0.1393588748783102, -0.023152298743611778, 0.14730448328793563, -0.11754532575864217, -0.01155512953369782, 0.030396613727949946, 0.3977758786801634, -0.33427682083806604, -0.19189851605815106, 0.19529480811264688, -0.2655205376574705, -0.1166300111388033, 0.20967232346020895, -0.17883897482835012, -0.04566758574018705, 0.06734293015224152, 0.013516675969906923, -0.09016369308489536, -0.2346120114891854, 0.45557507384439994, -0.01178698487387135, 0.19271670969138885, 0.0348690768125756, 0.06348193467369881, -0.0643916972912848, -0.05436962126786339, 0.039930069770920895, -0.20032232936036648, 0.14613927941737248, 0.22572641755486356, 0.11022494852157502, 0.205622350283224, -0.33406362798193406, -0.22111426439971246, 0.10932885020457465, 0.08909886806464658, -0.07381583336371414, 0.0030981453039265914, -0.29075729715284604, 0.07315145778180711, -0.11740872763691405, -0.1521231952958323, 0.022715574628191775, 0.07509062199949704, -0.04325436383630309, -0.1527233386476492, -0.016486916486836232, 0.15029715012020334, 0.05010020958885936, -0.13476981030744983, -0.019879350519000458, -0.08594384429783657, 0.14135925462148313, -0.005552354288801294, 0.10744028071599916, 0.07353923110901539, -0.04389025504973813, -0.08650242008975353, 0.3372254637551719, -0.01286503442980606, -0.14857992006401563, 0.168550256639719, -0.22407831153671803, -0.19815402625706688, 0.1471810573471132, 0.02188215786912318, 0.15882916125501023, -0.06044828569002707, 0.23725437904318697, -0.16964613398986644, 0.08960043705983795, 0.058779221533894026, 0.04889993485191773, 0.14876704332258167, 0.09694621949617205, 0.09225220315094138, 0.2336604288329595, 0.006822436020292085, -0.0463156357983625, -0.3409405206811839, -0.170146855670188, -0.09118685635320585, 0.16057399546342163, -0.13556626060920374, -0.2485232530482884, 0.3897828562506314, 0.05158543235076399, 0.20880769523952541, 0.05704120398852332, 0.23488468201509838, 0.06659657932047186, -0.019460342760229933, 0.15601668573699184, 0.18075123470495374, 0.2328680032575182, 0.03323354758322239, -0.16684238589067688, -0.0879740236038021, 0.2722380409691611] |
1,803.00204 | Scalar Quantization as Sparse Least Square Optimization | Quantization can be used to form new vectors/matrices with shared values
close to the original. In recent years, the popularity of scalar quantization
for value-sharing applications has been soaring as it has been found huge
utilities in reducing the complexity of neural networks. Existing
clustering-based quantization techniques, while being well-developed, have
multiple drawbacks including the dependency of the random seed, empty or
out-of-the-range clusters, and high time complexity for a large number of
clusters. To overcome these problems, in this paper, the problem of scalar
quantization is examined from a new perspective, namely sparse least square
optimization. Specifically, inspired by the property of sparse least square
regression, several quantization algorithms based on $l_1$ least square are
proposed. In addition, similar schemes with $l_1 + l_2$ and $l_0$
regularization are proposed. Furthermore, to compute quantization results with
a given amount of values/clusters, this paper designed an iterative method and
a clustering-based method, and both of them are built on sparse least square.
The paper shows that the latter method is mathematically equivalent to an
improved version of k-means clustering-based quantization algorithm, although
the two algorithms originated from different intuitions. The algorithms
proposed were tested with three types of data and their computational
performances, including information loss, time consumption, and the
distribution of the values of the sparse vectors, were compared and analyzed.
The paper offers a new perspective to probe the area of quantization, and the
algorithms proposed can outperform existing methods especially under some
bit-width reduction scenarios, when the required post-quantization resolution
(number of values) is not significantly lower than the original number.
| cs.LG cs.AI cs.NA stat.ML | quantization can be used to form new vectorsmatrices with shared values close to the original in recent years the popularity of scalar quantization for valuesharing applications has been soaring as it has been found huge utilities in reducing the complexity of neural networks existing clusteringbased quantization techniques while being welldeveloped have multiple drawbacks including the dependency of the random seed empty or outoftherange clusters and high time complexity for a large number of clusters to overcome these problems in this paper the problem of scalar quantization is examined from a new perspective namely sparse least square optimization specifically inspired by the property of sparse least square regression several quantization algorithms based on l_1 least square are proposed in addition similar schemes with l_1 l_2 and l_0 regularization are proposed furthermore to compute quantization results with a given amount of valuesclusters this paper designed an iterative method and a clusteringbased method and both of them are built on sparse least square the paper shows that the latter method is mathematically equivalent to an improved version of kmeans clusteringbased quantization algorithm although the two algorithms originated from different intuitions the algorithms proposed were tested with three types of data and their computational performances including information loss time consumption and the distribution of the values of the sparse vectors were compared and analyzed the paper offers a new perspective to probe the area of quantization and the algorithms proposed can outperform existing methods especially under some bitwidth reduction scenarios when the required postquantization resolution number of values is not significantly lower than the original number | [['quantization', 'can', 'be', 'used', 'to', 'form', 'new', 'vectorsmatrices', 'with', 'shared', 'values', 'close', 'to', 'the', 'original', 'in', 'recent', 'years', 'the', 'popularity', 'of', 'scalar', 'quantization', 'for', 'valuesharing', 'applications', 'has', 'been', 'soaring', 'as', 'it', 'has', 'been', 'found', 'huge', 'utilities', 'in', 'reducing', 'the', 'complexity', 'of', 'neural', 'networks', 'existing', 'clusteringbased', 'quantization', 'techniques', 'while', 'being', 'welldeveloped', 'have', 'multiple', 'drawbacks', 'including', 'the', 'dependency', 'of', 'the', 'random', 'seed', 'empty', 'or', 'outoftherange', 'clusters', 'and', 'high', 'time', 'complexity', 'for', 'a', 'large', 'number', 'of', 'clusters', 'to', 'overcome', 'these', 'problems', 'in', 'this', 'paper', 'the', 'problem', 'of', 'scalar', 'quantization', 'is', 'examined', 'from', 'a', 'new', 'perspective', 'namely', 'sparse', 'least', 'square', 'optimization', 'specifically', 'inspired', 'by', 'the', 'property', 'of', 'sparse', 'least', 'square', 'regression', 'several', 'quantization', 'algorithms', 'based', 'on', 'l_1', 'least', 'square', 'are', 'proposed', 'in', 'addition', 'similar', 'schemes', 'with', 'l_1', 'l_2', 'and', 'l_0', 'regularization', 'are', 'proposed', 'furthermore', 'to', 'compute', 'quantization', 'results', 'with', 'a', 'given', 'amount', 'of', 'valuesclusters', 'this', 'paper', 'designed', 'an', 'iterative', 'method', 'and', 'a', 'clusteringbased', 'method', 'and', 'both', 'of', 'them', 'are', 'built', 'on', 'sparse', 'least', 'square', 'the', 'paper', 'shows', 'that', 'the', 'latter', 'method', 'is', 'mathematically', 'equivalent', 'to', 'an', 'improved', 'version', 'of', 'kmeans', 'clusteringbased', 'quantization', 'algorithm', 'although', 'the', 'two', 'algorithms', 'originated', 'from', 'different', 'intuitions', 'the', 'algorithms', 'proposed', 'were', 'tested', 'with', 'three', 'types', 'of', 'data', 'and', 'their', 'computational', 'performances', 'including', 'information', 'loss', 'time', 'consumption', 'and', 'the', 'distribution', 'of', 'the', 'values', 'of', 'the', 'sparse', 'vectors', 'were', 'compared', 'and', 'analyzed', 'the', 'paper', 'offers', 'a', 'new', 'perspective', 'to', 'probe', 'the', 'area', 'of', 'quantization', 'and', 'the', 'algorithms', 'proposed', 'can', 'outperform', 'existing', 'methods', 'especially', 'under', 'some', 'bitwidth', 'reduction', 'scenarios', 'when', 'the', 'required', 'postquantization', 'resolution', 'number', 'of', 'values', 'is', 'not', 'significantly', 'lower', 'than', 'the', 'original', 'number']] | [-0.076401475388448, 0.03874783112193233, -0.07441762768109021, 0.05544516846948894, -0.08162216565586221, -0.16335382407412463, 0.014359002566900004, 0.3906778625651092, -0.2736183522406835, -0.33723689082571473, 0.13581442340242708, -0.256140867567074, -0.1819151320510792, 0.19599992291302445, -0.1216094252736768, 0.10688584799857236, 0.07765659838932991, 0.04911807400685398, -0.10810748753337197, -0.33989537379102863, 0.2776706356316051, 0.08155430544979493, 0.323299470129296, -0.0036097171527047275, 0.11947585423096492, -0.019622684543379783, -0.043860009949561934, 0.07038997919824162, -0.07632281706077414, 0.16130627678065826, 0.23371163589321803, 0.1554152882677876, 0.34575883296938026, -0.40578107425493665, -0.22141252338147002, 0.12106282610703506, 0.16720731189865837, 0.09538707313135063, -0.04025617151626237, -0.24178996830924998, 0.13660406042615147, -0.15235223778041537, -0.03282780488167078, -0.08542162504867952, -0.04840488641084342, 0.014533099892618523, -0.2690817517779246, 0.040925788421116785, 0.032360115269713594, 0.0228682273005929, -0.04894502396497818, -0.20148264957095427, 0.050250655781669755, 0.1041435798525254, 0.07596801465616385, 0.025206129662312046, 0.06858752827080336, -0.11076409325519113, -0.15866404696882264, 0.36759211256889923, -0.024125361674048953, -0.21887328048102586, 0.19125664713140214, -0.049481271770655935, -0.13784596925974618, 0.13815069540697314, 0.19381414463286967, 0.10462301410281676, -0.1401732600639336, 0.06433381680520069, -0.017204151648288802, 0.15048651486963163, 0.07088647747470306, 0.06013099391240779, 0.12621629520333896, 0.1751610003860218, 0.07892758518766343, 0.13780604974241703, -0.12360712048130613, -0.10181250214868438, -0.22367952536797905, -0.11124820710822998, -0.2219330210959836, -0.02303473724242334, -0.1246074891376494, -0.14263104155101608, 0.38739019605749675, 0.16139053241875212, 0.20939856400198742, 0.09632029907473505, 0.3430540029263914, 0.10548312087943741, 0.09554761795894195, 0.10064365200386727, 0.19773518496769632, 0.1135740000093247, 0.07719286104414162, -0.18748844842877646, 0.05233819950199849, 0.07728841419219391] |
1,803.00205 | Composite Difference-Max Programs for Modern Statistical Estimation
Problems | Many modern statistical estimation problems are defined by three major
components: a statistical model that postulates the dependence of an output
variable on the input features; a loss function measuring the error between the
observed output and the model predicted output; and a regularizer that controls
the overfitting and/or variable selection in the model. We study the sampling
version of this generic statistical estimation problem where the model
parameters are estimated by empirical risk minimization, which involves the
minimization of the empirical average of the loss function at the data points
weighted by the model regularizer. In our setup we allow all three component
functions discussed above to be of the difference-of-convex (dc) type and
illustrate them with a host of commonly used examples, including those in
continuous piecewise affine regression and in deep learning (where the
activation functions are piecewise affine). We describe a nonmonotone
majorization-minimization (MM) algorithm for solving the unified nonconvex,
nondifferentiable optimization problem which is formulated as a specially
structured composite dc program of the pointwise max type, and present
convergence results to a directional stationary solution. An efficient
semismooth Newton method is proposed to solve the dual of the MM subproblems.
Numerical results are presented to demonstrate the effectiveness of the
proposed algorithm and the superiority of continuous piecewise affine
regression over the standard linear model.
| math.OC | many modern statistical estimation problems are defined by three major components a statistical model that postulates the dependence of an output variable on the input features a loss function measuring the error between the observed output and the model predicted output and a regularizer that controls the overfitting andor variable selection in the model we study the sampling version of this generic statistical estimation problem where the model parameters are estimated by empirical risk minimization which involves the minimization of the empirical average of the loss function at the data points weighted by the model regularizer in our setup we allow all three component functions discussed above to be of the differenceofconvex dc type and illustrate them with a host of commonly used examples including those in continuous piecewise affine regression and in deep learning where the activation functions are piecewise affine we describe a nonmonotone majorizationminimization mm algorithm for solving the unified nonconvex nondifferentiable optimization problem which is formulated as a specially structured composite dc program of the pointwise max type and present convergence results to a directional stationary solution an efficient semismooth newton method is proposed to solve the dual of the mm subproblems numerical results are presented to demonstrate the effectiveness of the proposed algorithm and the superiority of continuous piecewise affine regression over the standard linear model | [['many', 'modern', 'statistical', 'estimation', 'problems', 'are', 'defined', 'by', 'three', 'major', 'components', 'a', 'statistical', 'model', 'that', 'postulates', 'the', 'dependence', 'of', 'an', 'output', 'variable', 'on', 'the', 'input', 'features', 'a', 'loss', 'function', 'measuring', 'the', 'error', 'between', 'the', 'observed', 'output', 'and', 'the', 'model', 'predicted', 'output', 'and', 'a', 'regularizer', 'that', 'controls', 'the', 'overfitting', 'andor', 'variable', 'selection', 'in', 'the', 'model', 'we', 'study', 'the', 'sampling', 'version', 'of', 'this', 'generic', 'statistical', 'estimation', 'problem', 'where', 'the', 'model', 'parameters', 'are', 'estimated', 'by', 'empirical', 'risk', 'minimization', 'which', 'involves', 'the', 'minimization', 'of', 'the', 'empirical', 'average', 'of', 'the', 'loss', 'function', 'at', 'the', 'data', 'points', 'weighted', 'by', 'the', 'model', 'regularizer', 'in', 'our', 'setup', 'we', 'allow', 'all', 'three', 'component', 'functions', 'discussed', 'above', 'to', 'be', 'of', 'the', 'differenceofconvex', 'dc', 'type', 'and', 'illustrate', 'them', 'with', 'a', 'host', 'of', 'commonly', 'used', 'examples', 'including', 'those', 'in', 'continuous', 'piecewise', 'affine', 'regression', 'and', 'in', 'deep', 'learning', 'where', 'the', 'activation', 'functions', 'are', 'piecewise', 'affine', 'we', 'describe', 'a', 'nonmonotone', 'majorizationminimization', 'mm', 'algorithm', 'for', 'solving', 'the', 'unified', 'nonconvex', 'nondifferentiable', 'optimization', 'problem', 'which', 'is', 'formulated', 'as', 'a', 'specially', 'structured', 'composite', 'dc', 'program', 'of', 'the', 'pointwise', 'max', 'type', 'and', 'present', 'convergence', 'results', 'to', 'a', 'directional', 'stationary', 'solution', 'an', 'efficient', 'semismooth', 'newton', 'method', 'is', 'proposed', 'to', 'solve', 'the', 'dual', 'of', 'the', 'mm', 'subproblems', 'numerical', 'results', 'are', 'presented', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'algorithm', 'and', 'the', 'superiority', 'of', 'continuous', 'piecewise', 'affine', 'regression', 'over', 'the', 'standard', 'linear', 'model']] | [-0.042382428152865956, -0.01040285146187852, -0.06359499920269146, 0.08532287022973331, -0.07022484699348451, -0.16316533998725305, 0.0281795406265277, 0.39098034555522293, -0.3427113826003145, -0.2943751504434045, 0.13456372035102607, -0.2388711265705492, -0.19050905183041933, 0.19861328613057277, -0.08345378034566929, 0.14025187434742387, 0.040595506291575226, -0.02049891388031119, -0.10238419783541856, -0.2695553142970377, 0.2869784787857728, 0.02199353611745189, 0.2916283011984299, 0.0007795709842706428, 0.1606211557032749, 0.017113337221627053, -0.02787248952034018, 0.03323230235700441, -0.07488582759066559, 0.14838575533953627, 0.2628541757643425, 0.1711351917234852, 0.35166539246325984, -0.36769169164248383, -0.23102708908042352, 0.12758644805942995, 0.09312025323743, 0.03671052987577722, -0.028020448509152827, -0.24552724450590654, 0.051132958810102214, -0.12336091046040873, -0.0684597798685303, -0.06753864570529247, -0.06423133430682224, 0.0668025909790272, -0.3491918229665481, 0.08352654073935221, 0.045147398282348164, 0.03481489034765716, -0.11184676982909104, -0.14831579363234848, 0.008795534130986528, 0.042253742259990304, 0.04346095960127923, 0.050870935281957776, 0.12699508267229348, -0.109405373078792, -0.13500397211695048, 0.3292199341849976, -0.05924112789282297, -0.2609998492473458, 0.14977816094926713, -0.049844078902930564, -0.12178027913147137, 0.1148062538781216, 0.2266285915509271, 0.1386685185366188, -0.1652160366845414, 0.061094053528941664, -0.05842938981908142, 0.13917215432069893, -0.002489967510837438, -0.03937905653679061, 0.1328585889470675, 0.17811576054090153, 0.07935127903381653, 0.17798628508401992, -0.0881754287907841, -0.12495019225818758, -0.3343970925627251, -0.1043620286846525, -0.1936762737088133, -0.03842090052232247, -0.14522284776253133, -0.17681199931476382, 0.42112521324896707, 0.12771841901727443, 0.20623038818941733, 0.12341573329987973, 0.3317971945428437, 0.15526913773327458, 0.04966464605760799, 0.08302137584476078, 0.22937966473411128, 0.12322880852571373, 0.037562216878067954, -0.23269181294478392, 0.08111718075130792, 0.10250475903450432] |
1,803.00206 | All-optical quantum signal demultiplexer | Dense wavelength division multiplexing (DWDM) is one of the most successful
methods for enhancing data transmission rates in both classical and quantum
communication networks. Although signal multiplexing and demultiplexing are
equally important, traditional multiplexing and demultiplexing methods are
based on passive devices such as arrayed waveguides and fiber Bragg cascade
filters, which, although widely used in commercial devices, lack any active
tuning ability. In this work, we propose a signal demultiplexing method based
on sum frequency generation (SFG) with two significant features: first, any
signal from the common communication channel can be demultiplexed to a single
user by switching the pump wavelength; second, a cheap high-performance
detector can be used for signal detection. These two features were demonstrated
by demultiplexing multi-channel energy-time entanglement generated by a
micro-cavity silicon chip. High interference visibilities over three channels
after demultiplexing showed that entanglement was preserved and verified the
high performance of the demultiplexer, which will find wide application in
high-capacity quantum communication networks.
| quant-ph physics.optics | dense wavelength division multiplexing dwdm is one of the most successful methods for enhancing data transmission rates in both classical and quantum communication networks although signal multiplexing and demultiplexing are equally important traditional multiplexing and demultiplexing methods are based on passive devices such as arrayed waveguides and fiber bragg cascade filters which although widely used in commercial devices lack any active tuning ability in this work we propose a signal demultiplexing method based on sum frequency generation sfg with two significant features first any signal from the common communication channel can be demultiplexed to a single user by switching the pump wavelength second a cheap highperformance detector can be used for signal detection these two features were demonstrated by demultiplexing multichannel energytime entanglement generated by a microcavity silicon chip high interference visibilities over three channels after demultiplexing showed that entanglement was preserved and verified the high performance of the demultiplexer which will find wide application in highcapacity quantum communication networks | [['dense', 'wavelength', 'division', 'multiplexing', 'dwdm', 'is', 'one', 'of', 'the', 'most', 'successful', 'methods', 'for', 'enhancing', 'data', 'transmission', 'rates', 'in', 'both', 'classical', 'and', 'quantum', 'communication', 'networks', 'although', 'signal', 'multiplexing', 'and', 'demultiplexing', 'are', 'equally', 'important', 'traditional', 'multiplexing', 'and', 'demultiplexing', 'methods', 'are', 'based', 'on', 'passive', 'devices', 'such', 'as', 'arrayed', 'waveguides', 'and', 'fiber', 'bragg', 'cascade', 'filters', 'which', 'although', 'widely', 'used', 'in', 'commercial', 'devices', 'lack', 'any', 'active', 'tuning', 'ability', 'in', 'this', 'work', 'we', 'propose', 'a', 'signal', 'demultiplexing', 'method', 'based', 'on', 'sum', 'frequency', 'generation', 'sfg', 'with', 'two', 'significant', 'features', 'first', 'any', 'signal', 'from', 'the', 'common', 'communication', 'channel', 'can', 'be', 'demultiplexed', 'to', 'a', 'single', 'user', 'by', 'switching', 'the', 'pump', 'wavelength', 'second', 'a', 'cheap', 'highperformance', 'detector', 'can', 'be', 'used', 'for', 'signal', 'detection', 'these', 'two', 'features', 'were', 'demonstrated', 'by', 'demultiplexing', 'multichannel', 'energytime', 'entanglement', 'generated', 'by', 'a', 'microcavity', 'silicon', 'chip', 'high', 'interference', 'visibilities', 'over', 'three', 'channels', 'after', 'demultiplexing', 'showed', 'that', 'entanglement', 'was', 'preserved', 'and', 'verified', 'the', 'high', 'performance', 'of', 'the', 'demultiplexer', 'which', 'will', 'find', 'wide', 'application', 'in', 'highcapacity', 'quantum', 'communication', 'networks']] | [-0.171571713751473, 0.11855819416159648, -0.051509357977192846, -0.03456985241500661, -0.03365216778765898, -0.2632486623013392, 0.013659497079788707, 0.4933548663218971, -0.23654016804430283, -0.26547974144341424, 0.10652252971558482, -0.23978987765149212, -0.17474261404640856, 0.26771995909075486, -0.06380600144475465, 0.12683883204663288, 0.06954853052448015, -0.05497740285063628, 0.016390127218619453, -0.19616614577171276, 0.21525440201876336, 0.0655433421721682, 0.433971175638726, 0.024142677942290903, 0.1124262663819536, 0.02802852363383863, -0.037380099270376374, -0.08927692400975502, -0.02044256447684347, 0.10371888187364675, 0.3466297740524169, 0.127152793580899, 0.26428189003490843, -0.41526565023814327, -0.28089695704547923, 0.09750494837035148, 0.1811122171973693, 0.09823581506934716, -0.09257366139208897, -0.2916051543681533, 0.08420034019218292, -0.18253441084671068, 0.009487778911898203, -0.0342031569336541, -0.06402011031459551, 0.03627308156574145, -0.2704642582386441, 0.010976926138391718, 0.009464312615455129, 0.05010387391630502, 0.05396625158082315, -0.06059829498117324, 0.019621882648789325, 0.11758078414859482, -0.12675303775758948, -0.05210771495912923, 0.15157044836923889, -0.09900958854559576, -0.1915020845044637, 0.35827739780652335, -0.08051524707116187, -0.15752297264989465, 0.16284625527659954, -0.09495057311432901, -0.029494008389883676, 0.14734783958119807, 0.1973538322665263, 0.07609658359433524, -0.164757753595768, -0.035902257969792115, 0.051271988113876434, 0.2539945733413333, 0.14899587557301858, 0.1851979332335759, 0.21357810927729587, 0.1992325740895467, 0.04538703467696905, 0.12243979533814127, -0.1588997087412281, -0.05495394080935512, -0.20720142728023347, -0.13972243087046082, -0.24739251914434135, 0.00707713326337398, -0.09193996961357698, -0.07197831413068342, 0.3946881278010551, 0.13420645295191208, 0.11644394920003834, 0.021186930427211335, 0.42807086549000817, 0.10223803598128142, 0.16899092915700747, 0.03540955681091873, 0.27590727158385564, 0.11351193291484378, 0.12579970500592025, -0.18244194037997657, 0.012540108675602823, -0.0549035957257729] |
1,803.00207 | Revealing photons behaviors in a birefringent interferometer | The interferometer is one of the most important devices for revealing the
nature of light and for precision optical metrology. Though lots of experiments
were performed for probing photons behaviors in various configurations, a
complete study of photons behavior in a birefringent interferometer has not
ever been performed. Based on an environmental turbulence immune Mach-Zehnder
interferometer, tunable photonic beatings by rotating a birefringent crystal
versus the temperature of the crystal for both single-photon and two-photon are
observed. Furthermore, the two-photon interference fringes beat two times
faster than the single-photon interference fringes. This beating effect is used
to determine the thermal dispersion coefficients of the two principal
refractive axes with a single measurement, the two-photon interference shows
super-resolution and high sensitivity. Obvious differences between two-photon
and single photon interference are also revealed in an unbalanced situations.
In addition, influences of the photon bandwidth to the beating behaviors that
come from polarization-dependent decoherence are also investigated. Our
findings will be important for better understanding the behavior of two-photon
interference in a birefringent interferometer and for precision optical
metrology with quantum enhancement.
| quant-ph | the interferometer is one of the most important devices for revealing the nature of light and for precision optical metrology though lots of experiments were performed for probing photons behaviors in various configurations a complete study of photons behavior in a birefringent interferometer has not ever been performed based on an environmental turbulence immune machzehnder interferometer tunable photonic beatings by rotating a birefringent crystal versus the temperature of the crystal for both singlephoton and twophoton are observed furthermore the twophoton interference fringes beat two times faster than the singlephoton interference fringes this beating effect is used to determine the thermal dispersion coefficients of the two principal refractive axes with a single measurement the twophoton interference shows superresolution and high sensitivity obvious differences between twophoton and single photon interference are also revealed in an unbalanced situations in addition influences of the photon bandwidth to the beating behaviors that come from polarizationdependent decoherence are also investigated our findings will be important for better understanding the behavior of twophoton interference in a birefringent interferometer and for precision optical metrology with quantum enhancement | [['the', 'interferometer', 'is', 'one', 'of', 'the', 'most', 'important', 'devices', 'for', 'revealing', 'the', 'nature', 'of', 'light', 'and', 'for', 'precision', 'optical', 'metrology', 'though', 'lots', 'of', 'experiments', 'were', 'performed', 'for', 'probing', 'photons', 'behaviors', 'in', 'various', 'configurations', 'a', 'complete', 'study', 'of', 'photons', 'behavior', 'in', 'a', 'birefringent', 'interferometer', 'has', 'not', 'ever', 'been', 'performed', 'based', 'on', 'an', 'environmental', 'turbulence', 'immune', 'machzehnder', 'interferometer', 'tunable', 'photonic', 'beatings', 'by', 'rotating', 'a', 'birefringent', 'crystal', 'versus', 'the', 'temperature', 'of', 'the', 'crystal', 'for', 'both', 'singlephoton', 'and', 'twophoton', 'are', 'observed', 'furthermore', 'the', 'twophoton', 'interference', 'fringes', 'beat', 'two', 'times', 'faster', 'than', 'the', 'singlephoton', 'interference', 'fringes', 'this', 'beating', 'effect', 'is', 'used', 'to', 'determine', 'the', 'thermal', 'dispersion', 'coefficients', 'of', 'the', 'two', 'principal', 'refractive', 'axes', 'with', 'a', 'single', 'measurement', 'the', 'twophoton', 'interference', 'shows', 'superresolution', 'and', 'high', 'sensitivity', 'obvious', 'differences', 'between', 'twophoton', 'and', 'single', 'photon', 'interference', 'are', 'also', 'revealed', 'in', 'an', 'unbalanced', 'situations', 'in', 'addition', 'influences', 'of', 'the', 'photon', 'bandwidth', 'to', 'the', 'beating', 'behaviors', 'that', 'come', 'from', 'polarizationdependent', 'decoherence', 'are', 'also', 'investigated', 'our', 'findings', 'will', 'be', 'important', 'for', 'better', 'understanding', 'the', 'behavior', 'of', 'twophoton', 'interference', 'in', 'a', 'birefringent', 'interferometer', 'and', 'for', 'precision', 'optical', 'metrology', 'with', 'quantum', 'enhancement']] | [-0.1731238973914911, 0.202160888956502, -0.10524161750913791, 0.028417160958910163, -0.021284270615384564, -0.1964170865522042, 0.029023651248260333, 0.4608833477025924, -0.20135814408113525, -0.3045458844316572, 0.002952494663082313, -0.3044128451345478, -0.13130064697041274, 0.2583601537431127, -0.017987196973665468, 0.08693381610544991, 0.04877792723872309, -0.035816384474200574, -0.0033196999334376407, -0.1406838547323919, 0.2622442291607279, 0.07844919601764905, 0.358822574771358, 0.030556444392159748, 0.094084643873948, 0.027958235307986842, -0.018977014920232016, -0.043181626706295675, -0.060876731066413385, 0.049184482378167145, 0.2568758449389719, 0.016992798291001074, 0.20618949543330922, -0.4279591014645161, -0.20565145998652087, 0.09200095580105459, 0.15769188977483992, 0.15617169438621975, -0.05592224219301455, -0.31923136489684356, -0.034515798021649016, -0.09981512011863895, -0.09990340139183239, -0.043167263402098886, -0.022873117164422512, -0.021204603223621783, -0.23774345819812331, 0.04175159434089437, -0.014941751690290078, 0.06405819013360992, 0.04897629955740237, -0.06685821882932962, 0.029953599673326455, 0.09729346426108894, -0.05563991945093841, -0.0262634610385223, 0.14750530475271897, -0.15998311133342458, -0.17697149973008885, 0.38296708962769516, -0.07385744290584818, -0.12282620507745104, 0.13093705267213576, -0.21774132001114874, -0.060808322989439084, 0.172238896057197, 0.14628408610880603, 0.07045775136192375, -0.11081042518974515, -0.051653620330733896, 0.011693996382492215, 0.23931292940695983, 0.16371829181717054, 0.20057333143188633, 0.20554499094135142, 0.17386082078553944, 0.002565043015852987, 0.1536540020115455, -0.14526123188919904, -0.054037572467418686, -0.23092019891980306, -0.14299486751548487, -0.1778411438712049, 0.04621310697944234, -0.08439118845618197, -0.10950498179371297, 0.38193023633524026, 0.14080766720603632, 0.1247128599187406, -0.058510197728466475, 0.378277079441569, 0.11122448475089694, 0.05476424781418296, -0.048462399259448966, 0.3582141894753502, 0.16082410889249438, 0.10383327301154589, -0.3023220416842622, 0.05662402192744629, -0.09262984444767071] |
1,803.00208 | Topological time-series analysis with delay-variant embedding | Identifying the qualitative changes in time-series data provides insights
into the dynamics associated with such data. Such qualitative changes can be
detected through topological approaches, which first embed the data into a
high-dimensional space using a time-delay parameter and subsequently extract
topological features describing the shape of the data from the embedded points.
However, the essential topological features that are extracted using a single
time delay are considered to be insufficient for evaluating the aforementioned
qualitative changes, even when a well-selected time delay is used. We therefore
propose a delay-variant embedding method that constructs the extended
topological features by considering the time delay as a variable parameter
instead of considering it as a single fixed value. This delay-variant embedding
method reveals multiple-time-scale patterns in a time series by allowing the
observation of the variations in topological features, with the time delay
serving as an additional dimension in the topological feature space. We
theoretically prove that the constructed topological features are robust when
the time series is perturbed by noise. Furthermore, we combine these features
with the kernel technique in machine learning algorithms to classify the
general time-series data. We demonstrate the effectiveness of our method for
classifying the synthetic noisy biological and real time-series data. Our
method outperforms a method that is based on a single time delay and,
surprisingly, achieves the highest classification accuracy on an average among
the standard time-series analysis techniques.
| physics.data-an | identifying the qualitative changes in timeseries data provides insights into the dynamics associated with such data such qualitative changes can be detected through topological approaches which first embed the data into a highdimensional space using a timedelay parameter and subsequently extract topological features describing the shape of the data from the embedded points however the essential topological features that are extracted using a single time delay are considered to be insufficient for evaluating the aforementioned qualitative changes even when a wellselected time delay is used we therefore propose a delayvariant embedding method that constructs the extended topological features by considering the time delay as a variable parameter instead of considering it as a single fixed value this delayvariant embedding method reveals multipletimescale patterns in a time series by allowing the observation of the variations in topological features with the time delay serving as an additional dimension in the topological feature space we theoretically prove that the constructed topological features are robust when the time series is perturbed by noise furthermore we combine these features with the kernel technique in machine learning algorithms to classify the general timeseries data we demonstrate the effectiveness of our method for classifying the synthetic noisy biological and real timeseries data our method outperforms a method that is based on a single time delay and surprisingly achieves the highest classification accuracy on an average among the standard timeseries analysis techniques | [['identifying', 'the', 'qualitative', 'changes', 'in', 'timeseries', 'data', 'provides', 'insights', 'into', 'the', 'dynamics', 'associated', 'with', 'such', 'data', 'such', 'qualitative', 'changes', 'can', 'be', 'detected', 'through', 'topological', 'approaches', 'which', 'first', 'embed', 'the', 'data', 'into', 'a', 'highdimensional', 'space', 'using', 'a', 'timedelay', 'parameter', 'and', 'subsequently', 'extract', 'topological', 'features', 'describing', 'the', 'shape', 'of', 'the', 'data', 'from', 'the', 'embedded', 'points', 'however', 'the', 'essential', 'topological', 'features', 'that', 'are', 'extracted', 'using', 'a', 'single', 'time', 'delay', 'are', 'considered', 'to', 'be', 'insufficient', 'for', 'evaluating', 'the', 'aforementioned', 'qualitative', 'changes', 'even', 'when', 'a', 'wellselected', 'time', 'delay', 'is', 'used', 'we', 'therefore', 'propose', 'a', 'delayvariant', 'embedding', 'method', 'that', 'constructs', 'the', 'extended', 'topological', 'features', 'by', 'considering', 'the', 'time', 'delay', 'as', 'a', 'variable', 'parameter', 'instead', 'of', 'considering', 'it', 'as', 'a', 'single', 'fixed', 'value', 'this', 'delayvariant', 'embedding', 'method', 'reveals', 'multipletimescale', 'patterns', 'in', 'a', 'time', 'series', 'by', 'allowing', 'the', 'observation', 'of', 'the', 'variations', 'in', 'topological', 'features', 'with', 'the', 'time', 'delay', 'serving', 'as', 'an', 'additional', 'dimension', 'in', 'the', 'topological', 'feature', 'space', 'we', 'theoretically', 'prove', 'that', 'the', 'constructed', 'topological', 'features', 'are', 'robust', 'when', 'the', 'time', 'series', 'is', 'perturbed', 'by', 'noise', 'furthermore', 'we', 'combine', 'these', 'features', 'with', 'the', 'kernel', 'technique', 'in', 'machine', 'learning', 'algorithms', 'to', 'classify', 'the', 'general', 'timeseries', 'data', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'method', 'for', 'classifying', 'the', 'synthetic', 'noisy', 'biological', 'and', 'real', 'timeseries', 'data', 'our', 'method', 'outperforms', 'a', 'method', 'that', 'is', 'based', 'on', 'a', 'single', 'time', 'delay', 'and', 'surprisingly', 'achieves', 'the', 'highest', 'classification', 'accuracy', 'on', 'an', 'average', 'among', 'the', 'standard', 'timeseries', 'analysis', 'techniques']] | [-0.09424335097267839, 0.0436215850752668, -0.1244473671179329, 0.06522082070647418, -0.06928142859572384, -0.1379161144221394, 0.057752115075910014, 0.38959650826993686, -0.29727345512545633, -0.3057791498461578, 0.11230493858928295, -0.28117006717867954, -0.18628892182384554, 0.23319269861455943, -0.06056857607247115, 0.07379732082110171, 0.08656080969978638, 0.04582892305514743, -0.07401944116030916, -0.24865173886867303, 0.3181045102552663, 0.013644714655097702, 0.30145635513251584, -0.023178608128138625, 0.09774754351659293, -0.003833496729353571, -0.0664940060077211, 0.052691808765992956, -0.06697797848642824, 0.12418072464697616, 0.2676354455179535, 0.14067566316677177, 0.2600719342339415, -0.4028805591344657, -0.27483649292994883, 0.09099526063274142, 0.11652135165560798, 0.10855107330506394, -0.04234674748972636, -0.3364829462631766, 0.08338736274765388, -0.09059775001389489, -0.06554867045407922, -0.1466100289414091, 0.012291732300394055, 0.005392779304609826, -0.2696554473167735, 0.060848516809497155, 0.03433675215386882, 0.051131310977482296, -0.07496001591413194, -0.04531547348245834, -0.018540761497770918, 0.16439390480031604, 0.025285666769848142, 0.015110158750883722, 0.09051081433225873, -0.10698996600795313, -0.13358488972379087, 0.3730098694123344, -0.1050974312965991, -0.19693391903801338, 0.16534099963911134, -0.07612528206312884, -0.14916483866018726, 0.1373994285561915, 0.18560191056016703, 0.10916200497815916, -0.13655474893851627, 0.04344929485097086, -0.017586291641456572, 0.21263746865964817, 0.008653065227855253, 0.04314291794259494, 0.1612613326709332, 0.23232884415232674, 0.026983718981902147, 0.14919258742533015, -0.15292699442165783, -0.0698258845890262, -0.2672884661607958, -0.14153467265639158, -0.20055930406168296, -0.007906148916186668, -0.13562863825897914, -0.14352765944956977, 0.4463460901551398, 0.17076347753152668, 0.2683322352667315, 0.05758368982662495, 0.3339117610243005, 0.12710824313097843, 0.07595696221988905, 0.06465460565182027, 0.17335901402312348, 0.03383319321237023, 0.10256214557513635, -0.2059965531343237, 0.09151948786166031, 0.049772730508642594] |
1,803.00209 | Anisotropic Mimetic Cosmology | We consider a mimetic set up in which the mimetic scalar is coupled to a
vector field. It is shown that such a field with a time-like component does not
contribute to the background equations and yet produces healthy isocurvature
perturbations with respect to ghost and gradient instabilities in spite of the
absence of any propagating curvature perturbations at the level of the
quadratic action. We then consider a vector field with space-like components
which leads to an anisotropic Bianchi universe and show that the ghost and
gradient instabilities are absent in the limit of high momenta and that the
propagating curvature perturbations have healthy UV behavior.
| gr-qc hep-th | we consider a mimetic set up in which the mimetic scalar is coupled to a vector field it is shown that such a field with a timelike component does not contribute to the background equations and yet produces healthy isocurvature perturbations with respect to ghost and gradient instabilities in spite of the absence of any propagating curvature perturbations at the level of the quadratic action we then consider a vector field with spacelike components which leads to an anisotropic bianchi universe and show that the ghost and gradient instabilities are absent in the limit of high momenta and that the propagating curvature perturbations have healthy uv behavior | [['we', 'consider', 'a', 'mimetic', 'set', 'up', 'in', 'which', 'the', 'mimetic', 'scalar', 'is', 'coupled', 'to', 'a', 'vector', 'field', 'it', 'is', 'shown', 'that', 'such', 'a', 'field', 'with', 'a', 'timelike', 'component', 'does', 'not', 'contribute', 'to', 'the', 'background', 'equations', 'and', 'yet', 'produces', 'healthy', 'isocurvature', 'perturbations', 'with', 'respect', 'to', 'ghost', 'and', 'gradient', 'instabilities', 'in', 'spite', 'of', 'the', 'absence', 'of', 'any', 'propagating', 'curvature', 'perturbations', 'at', 'the', 'level', 'of', 'the', 'quadratic', 'action', 'we', 'then', 'consider', 'a', 'vector', 'field', 'with', 'spacelike', 'components', 'which', 'leads', 'to', 'an', 'anisotropic', 'bianchi', 'universe', 'and', 'show', 'that', 'the', 'ghost', 'and', 'gradient', 'instabilities', 'are', 'absent', 'in', 'the', 'limit', 'of', 'high', 'momenta', 'and', 'that', 'the', 'propagating', 'curvature', 'perturbations', 'have', 'healthy', 'uv', 'behavior']] | [-0.17057879545364668, 0.1940657216219164, -0.09953632556058675, 0.03822667735942126, -0.10645837512598416, -0.09914907508869177, -0.08618174897502481, 0.3415789482940998, -0.22735589509394682, -0.23779937376705582, 0.07476832105443056, -0.2793180896404469, -0.15301543905042878, 0.09493588697530816, -0.04408761422872265, -0.02857848389996825, 0.019004696170651467, 0.09646313847260218, -0.025778055789436552, -0.23666998890237273, 0.37873151536299804, 0.03654126113576588, 0.25289974159726475, 0.012927076574763127, 0.13750501903574738, -0.06006097733086654, 0.00988996090262989, 0.07793691268660755, -0.07124902154682106, 0.051346838948638916, 0.19176992415094196, 0.0766050248128301, 0.2707054088888777, -0.4261889823964823, -0.27433135761513816, 0.1608430790131755, 0.14595031114643284, 0.1532961528543731, -0.05995595810290809, -0.24681476584557338, 0.09875130013641074, -0.10184489129650816, -0.17773820747508207, -0.10065159085206687, -0.030738376491163448, -0.0516752387444863, -0.2869169555439083, 0.1360108660551432, 0.05402156434709502, 0.024086962253830144, -0.10367794616461218, -0.03309847387511318, -0.07120432536918496, 0.04126054720918291, 0.143055362835805, 0.08128523439844575, 0.11056040901969248, -0.20562449611383968, -0.05854806218352865, 0.3810718530423452, -0.17836528185267594, -0.25212954216262445, 0.17400873864121805, -0.15268336745657932, -0.06799070058808288, 0.12549860514569852, 0.15323851114817869, 0.11720901933089595, -0.12439667906124736, 0.15288474053638404, 0.04719723154198831, 0.15404115176855404, 0.10584463210880896, 0.03660224275674375, 0.23931568916712967, 0.05159425362944603, 0.07652438861892122, 0.1257253882388702, -0.0487341984114218, -0.08012530118853689, -0.3836063128312893, -0.14501846167824675, -0.08786820162035455, 0.05477508767325731, -0.1133133560003197, -0.25263028082771827, 0.4038061615135129, 0.13032822872329258, 0.16542498683382836, 0.04546873074103251, 0.269905254140357, 0.09656148992174753, 0.09885414320731832, 0.1467414689816047, 0.3104437591342656, 0.16463653175769566, 0.08430100557020057, -0.2508176115306669, -0.06106540148590352, 0.0030647872242136535] |
1,803.0021 | A Hybrid Artificial-Noise and Secret-Key Scheme for Securing OFDM
Transmissions in V2G Networks | We propose a new scheme to enhance the physical-layer security of wireless
single-input single-output orthogonal-frequency division-multiplexing (OFDM)
transmissions from an electric vehicle, Alice, to the aggregator, Bob, in the
presence of an eavesdropper, Eve. To prevent information leakage to Eve, Alice
exploits the wireless channel randomness to extract secret key symbols that are
used to encrypt some data symbols which are then multiplexed in the frequency
domain with the remaining unencrypted data symbols. To secure the unencrypted
data symbols, Alice transmits an artificial-noise (AN) signal superimposed over
her data signal. We propose a three-level optimization procedure to increase
the average secrecy rate of this wiretap channel by optimizing the transmit
power allocation between the encrypted data symbols, unencrypted data symbols
and the AN symbols. Our numerical results show that the proposed scheme
achieves considerable secrecy rate gains compared to the benchmark cases
| cs.IT cs.NI math.IT | we propose a new scheme to enhance the physicallayer security of wireless singleinput singleoutput orthogonalfrequency divisionmultiplexing ofdm transmissions from an electric vehicle alice to the aggregator bob in the presence of an eavesdropper eve to prevent information leakage to eve alice exploits the wireless channel randomness to extract secret key symbols that are used to encrypt some data symbols which are then multiplexed in the frequency domain with the remaining unencrypted data symbols to secure the unencrypted data symbols alice transmits an artificialnoise an signal superimposed over her data signal we propose a threelevel optimization procedure to increase the average secrecy rate of this wiretap channel by optimizing the transmit power allocation between the encrypted data symbols unencrypted data symbols and the an symbols our numerical results show that the proposed scheme achieves considerable secrecy rate gains compared to the benchmark cases | [['we', 'propose', 'a', 'new', 'scheme', 'to', 'enhance', 'the', 'physicallayer', 'security', 'of', 'wireless', 'singleinput', 'singleoutput', 'orthogonalfrequency', 'divisionmultiplexing', 'ofdm', 'transmissions', 'from', 'an', 'electric', 'vehicle', 'alice', 'to', 'the', 'aggregator', 'bob', 'in', 'the', 'presence', 'of', 'an', 'eavesdropper', 'eve', 'to', 'prevent', 'information', 'leakage', 'to', 'eve', 'alice', 'exploits', 'the', 'wireless', 'channel', 'randomness', 'to', 'extract', 'secret', 'key', 'symbols', 'that', 'are', 'used', 'to', 'encrypt', 'some', 'data', 'symbols', 'which', 'are', 'then', 'multiplexed', 'in', 'the', 'frequency', 'domain', 'with', 'the', 'remaining', 'unencrypted', 'data', 'symbols', 'to', 'secure', 'the', 'unencrypted', 'data', 'symbols', 'alice', 'transmits', 'an', 'artificialnoise', 'an', 'signal', 'superimposed', 'over', 'her', 'data', 'signal', 'we', 'propose', 'a', 'threelevel', 'optimization', 'procedure', 'to', 'increase', 'the', 'average', 'secrecy', 'rate', 'of', 'this', 'wiretap', 'channel', 'by', 'optimizing', 'the', 'transmit', 'power', 'allocation', 'between', 'the', 'encrypted', 'data', 'symbols', 'unencrypted', 'data', 'symbols', 'and', 'the', 'an', 'symbols', 'our', 'numerical', 'results', 'show', 'that', 'the', 'proposed', 'scheme', 'achieves', 'considerable', 'secrecy', 'rate', 'gains', 'compared', 'to', 'the', 'benchmark', 'cases']] | [-0.28244782625598475, -0.025261490847168205, -0.0470693813131607, 0.005297722746552041, -0.08530055145660402, -0.33998558475431184, 0.14281247827680188, 0.3651254648567303, -0.32972666655885097, -0.23967604211561302, 0.07569090934331588, -0.33674230717505654, -0.09095221118182473, 0.15554761335729284, -0.209788807145987, 0.10692408043191048, 0.045985608883466284, 0.06913444767408866, -0.000325006079457119, -0.3435445711716798, 0.30238480891385083, 0.17935650023228839, 0.37637030094835566, -0.025295231990014197, 0.08139273381778798, 0.03963072882331115, -0.03210165622604496, -0.20386406363570184, -0.08521193267452673, 0.06891256193663423, 0.39034523960889866, 0.2481040709407617, 0.26141856539439645, -0.4035628212298802, -0.2372467238340421, 0.11972027957597946, 0.14606146499058825, 0.11099042796822106, -0.07789239348969192, -0.34290039501687947, 0.14909597364062746, -0.2613259269426583, 0.04758570987090521, 0.010507518278619817, -0.11537418488069628, 0.034594389187264526, -0.41648283591560015, -0.029412735296505774, -0.02127211809105484, 0.04162649529596381, -0.02829845143310356, -0.0420280196736996, 0.03252615136134022, 0.23951524541984107, 0.046548031079781026, 0.028986029544059214, 0.11361305724419918, -0.03986739508431167, -0.15515315134713956, 0.27453787599736496, -0.00880445561913364, -0.21095047814025153, 0.04312851080581784, -0.08043775001560595, -0.04155926766693064, 0.18581955971737915, 0.26454676015233186, 0.028648500585869114, -0.18130163920973924, -0.049998668508343266, -0.03939093309883953, 0.3204925635248317, 0.10066970951643818, 0.18987848312455288, 0.10989003943721928, 0.07267502744860471, 0.1067047218267033, 0.16423403891959354, -0.15314467911813276, -0.10151577062974189, -0.24600614997697004, -0.11157030055418293, -0.250789221818724, -0.011083402601566086, -0.10606881004833725, -0.002635461185788009, 0.3315170883245544, 0.19409115876133903, 0.13131054063411826, 0.06737328968786944, 0.48135333307457306, 0.051404929875911394, 0.06445766595383802, 0.19077539280162636, 0.16046365256217335, 0.1194690836953488, 0.1738856914482106, -0.2029385954341422, 0.0737561100651345, -0.04759918919150183] |
1,803.00211 | Securing OFDM-Based Wireless Links Using Temporal Artificial-Noise
Injection | We investigate the physical layer security of wireless single-input
single-output orthogonal-division multiplexing (OFDM) when a transmitter, which
we refer to as Alice, sends her information to a receiver, which we refer to as
Bob, in the presence of an eavesdropping node, Eve. To prevent information
leakage, Alice sends an artificial-noise (AN) signal superimposed over her
information signal. We investigate the impact of the channel delay spread, OFDM
cyclic prefix, information/AN power allocation, and information and AN
precoders design on the achievable average secrecy rate. We consider the two
cases of known and unknown channel state information (CSI) at Alice.
Furthermore, we compare both cases of per-sub-channel processing and joint
sub-channels processing at Eve's receiver. Our numerical results show the gain
of AN injection in terms of average secrecy rate for different OFDM operating
conditions. Moreover, based on our new insights, we demonstrate that the
AN-aided scheme is effective and achieves almost the same average secrecy rate
as the full-CSI case without the need for Eve's instantaneous CSI at Alice.
| cs.IT cs.NI math.IT | we investigate the physical layer security of wireless singleinput singleoutput orthogonaldivision multiplexing ofdm when a transmitter which we refer to as alice sends her information to a receiver which we refer to as bob in the presence of an eavesdropping node eve to prevent information leakage alice sends an artificialnoise an signal superimposed over her information signal we investigate the impact of the channel delay spread ofdm cyclic prefix informationan power allocation and information and an precoders design on the achievable average secrecy rate we consider the two cases of known and unknown channel state information csi at alice furthermore we compare both cases of persubchannel processing and joint subchannels processing at eves receiver our numerical results show the gain of an injection in terms of average secrecy rate for different ofdm operating conditions moreover based on our new insights we demonstrate that the anaided scheme is effective and achieves almost the same average secrecy rate as the fullcsi case without the need for eves instantaneous csi at alice | [['we', 'investigate', 'the', 'physical', 'layer', 'security', 'of', 'wireless', 'singleinput', 'singleoutput', 'orthogonaldivision', 'multiplexing', 'ofdm', 'when', 'a', 'transmitter', 'which', 'we', 'refer', 'to', 'as', 'alice', 'sends', 'her', 'information', 'to', 'a', 'receiver', 'which', 'we', 'refer', 'to', 'as', 'bob', 'in', 'the', 'presence', 'of', 'an', 'eavesdropping', 'node', 'eve', 'to', 'prevent', 'information', 'leakage', 'alice', 'sends', 'an', 'artificialnoise', 'an', 'signal', 'superimposed', 'over', 'her', 'information', 'signal', 'we', 'investigate', 'the', 'impact', 'of', 'the', 'channel', 'delay', 'spread', 'ofdm', 'cyclic', 'prefix', 'informationan', 'power', 'allocation', 'and', 'information', 'and', 'an', 'precoders', 'design', 'on', 'the', 'achievable', 'average', 'secrecy', 'rate', 'we', 'consider', 'the', 'two', 'cases', 'of', 'known', 'and', 'unknown', 'channel', 'state', 'information', 'csi', 'at', 'alice', 'furthermore', 'we', 'compare', 'both', 'cases', 'of', 'persubchannel', 'processing', 'and', 'joint', 'subchannels', 'processing', 'at', 'eves', 'receiver', 'our', 'numerical', 'results', 'show', 'the', 'gain', 'of', 'an', 'injection', 'in', 'terms', 'of', 'average', 'secrecy', 'rate', 'for', 'different', 'ofdm', 'operating', 'conditions', 'moreover', 'based', 'on', 'our', 'new', 'insights', 'we', 'demonstrate', 'that', 'the', 'anaided', 'scheme', 'is', 'effective', 'and', 'achieves', 'almost', 'the', 'same', 'average', 'secrecy', 'rate', 'as', 'the', 'fullcsi', 'case', 'without', 'the', 'need', 'for', 'eves', 'instantaneous', 'csi', 'at', 'alice']] | [-0.26557052822527055, -0.01207416275581331, -0.05679989122635055, -0.0003776057382130962, -0.04776680746539579, -0.30800477212886074, 0.1186711690360736, 0.39468323057907784, -0.29039299697196946, -0.23455870501741677, 0.11350320736476092, -0.2986472385132429, -0.11488500982522964, 0.14218052599194297, -0.16619149252526952, 0.05815788351200119, 0.024991749972662704, 0.11880130993835293, -0.050911634378302505, -0.3058432914751643, 0.2856555307049773, 0.16376471601448908, 0.35894022482687127, 0.022044369780798694, 0.131998991696889, 0.06015674102616435, -0.019005888058039957, -0.141032623980198, -0.1303226484530302, -0.012661001010669653, 0.30773311154638044, 0.22118388246856407, 0.240596102059869, -0.3840344605861444, -0.2503144393680606, 0.10192349989561107, 0.15443478323990467, 0.0882879807014286, -0.07329974013023792, -0.27762431950687605, 0.11526650152570696, -0.25098687309414863, 0.034945833393578936, 0.060239370110651065, -0.12480520537056163, 0.029578597993104756, -0.3836691773546759, 0.008017172323627687, 0.02394729885161146, 0.04969681317577819, -0.036492257761004974, -0.11832142953097285, 0.02052576041607532, 0.2381600602385295, 0.007832712423430008, -0.025853838166500814, 0.11424554445819851, -0.10106796855218485, -0.13185418647306854, 0.3012487089727074, -0.025634332288134686, -0.21859103944821806, 0.09780677727146163, -0.11502649580005801, -0.05451216459452749, 0.14959132697148816, 0.2527721159349748, 0.04744739503973348, -0.16622559751516758, -0.041343028561984504, -0.014373262553659831, 0.26640797854808274, 0.10550670835892195, 0.21722330969150463, 0.13575843190439715, 0.12079276356004, 0.1412175230829681, 0.16861352646126673, -0.1575049174403002, -0.11172134188857086, -0.26061342899446394, -0.15166488066761794, -0.21227608358593444, 0.044980853800187834, -0.09133060275349407, 0.006859053985890514, 0.3477482386261689, 0.16279044006198287, 0.11523928232790769, 0.09073654825877242, 0.4466756819607969, 0.07132971227102115, -0.02424919901661084, 0.17286029659925464, 0.21596763176218925, 0.11765131059180789, 0.12373795949757757, -0.2488677978409666, 0.10075406973392419, -0.05759711652815699] |
1,803.00212 | prDeep: Robust Phase Retrieval with a Flexible Deep Network | Phase retrieval algorithms have become an important component in many modern
computational imaging systems. For instance, in the context of ptychography and
speckle correlation imaging, they enable imaging past the diffraction limit and
through scattering media, respectively. Unfortunately, traditional phase
retrieval algorithms struggle in the presence of noise. Progress has been made
recently on more robust algorithms using signal priors, but at the expense of
limiting the range of supported measurement models (e.g., to Gaussian or coded
diffraction patterns). In this work we leverage the regularization-by-denoising
framework and a convolutional neural network denoiser to create prDeep, a new
phase retrieval algorithm that is both robust and broadly applicable. We test
and validate prDeep in simulation to demonstrate that it is robust to noise and
can handle a variety of system models.
A MatConvNet implementation of prDeep is available at
https://github.com/ricedsp/prDeep.
| stat.ML cs.LG | phase retrieval algorithms have become an important component in many modern computational imaging systems for instance in the context of ptychography and speckle correlation imaging they enable imaging past the diffraction limit and through scattering media respectively unfortunately traditional phase retrieval algorithms struggle in the presence of noise progress has been made recently on more robust algorithms using signal priors but at the expense of limiting the range of supported measurement models eg to gaussian or coded diffraction patterns in this work we leverage the regularizationbydenoising framework and a convolutional neural network denoiser to create prdeep a new phase retrieval algorithm that is both robust and broadly applicable we test and validate prdeep in simulation to demonstrate that it is robust to noise and can handle a variety of system models a matconvnet implementation of prdeep is available at httpsgithubcomricedspprdeep | [['phase', 'retrieval', 'algorithms', 'have', 'become', 'an', 'important', 'component', 'in', 'many', 'modern', 'computational', 'imaging', 'systems', 'for', 'instance', 'in', 'the', 'context', 'of', 'ptychography', 'and', 'speckle', 'correlation', 'imaging', 'they', 'enable', 'imaging', 'past', 'the', 'diffraction', 'limit', 'and', 'through', 'scattering', 'media', 'respectively', 'unfortunately', 'traditional', 'phase', 'retrieval', 'algorithms', 'struggle', 'in', 'the', 'presence', 'of', 'noise', 'progress', 'has', 'been', 'made', 'recently', 'on', 'more', 'robust', 'algorithms', 'using', 'signal', 'priors', 'but', 'at', 'the', 'expense', 'of', 'limiting', 'the', 'range', 'of', 'supported', 'measurement', 'models', 'eg', 'to', 'gaussian', 'or', 'coded', 'diffraction', 'patterns', 'in', 'this', 'work', 'we', 'leverage', 'the', 'regularizationbydenoising', 'framework', 'and', 'a', 'convolutional', 'neural', 'network', 'denoiser', 'to', 'create', 'prdeep', 'a', 'new', 'phase', 'retrieval', 'algorithm', 'that', 'is', 'both', 'robust', 'and', 'broadly', 'applicable', 'we', 'test', 'and', 'validate', 'prdeep', 'in', 'simulation', 'to', 'demonstrate', 'that', 'it', 'is', 'robust', 'to', 'noise', 'and', 'can', 'handle', 'a', 'variety', 'of', 'system', 'models', 'a', 'matconvnet', 'implementation', 'of', 'prdeep', 'is', 'available', 'at', 'httpsgithubcomricedspprdeep']] | [-0.0654064120372177, 0.027995018631939445, -0.11349708548927531, 0.05268786941567247, -0.054095459466739354, -0.17470900145480814, 0.013838419883066545, 0.4606187231838703, -0.263957075069429, -0.3149240673114748, 0.15204574752757596, -0.2675320130833627, -0.20067097784013257, 0.23744552344104033, -0.09501843172314482, 0.12778215767183862, 0.08150389679856059, -0.02287825562255592, -0.0651336783126496, -0.2496382041658828, 0.25993286903299717, 0.07045329397584757, 0.3355176506118606, 0.015342030755203703, 0.08931193504700997, 0.019201492364315884, -0.05483441353451623, 0.02275767435144255, -0.03985204311828821, 0.1170190249795796, 0.29354207525503245, 0.16605989822098796, 0.26421770642417064, -0.4144476500299314, -0.2798190349105584, 0.11446912047972875, 0.1731906673769539, 0.13492659749665661, -0.07812823267264268, -0.2945770998147951, 0.05663909101386325, -0.1494686506567118, -0.024114489093071956, -0.15634428979443538, -0.01459276259276152, -0.02643959731389971, -0.2988269397705469, 0.04874481097795069, 0.04887025127781258, 0.06503727123060304, -0.021724256965250748, -0.09028781486752753, 0.07007027691925295, 0.1053652536635206, -0.014713707250084026, 0.05493073882805048, 0.09623596581724891, -0.17195857670056916, -0.11898446421390332, 0.3713111654328911, -0.04020922319403431, -0.1624755679412097, 0.21921936376357748, -0.09651476492349437, -0.14442797290309722, 0.1590194413235978, 0.2350547242221301, 0.10125786022694809, -0.15334057216060118, 0.041603263849063536, 0.013143912801330072, 0.2223253705440953, 0.05067248606338989, 0.05574560665980612, 0.1934680374426956, 0.23928916152647656, 0.04329280707136512, 0.12441647965191067, -0.1524127424408621, -0.08549388612458564, -0.1752635736357542, -0.11196621031453158, -0.19106370716126284, -0.052229190584393625, -0.06591807939791276, -0.16027552340908544, 0.34327222837432136, 0.24684579381921692, 0.14798347769386094, 0.03778639974484247, 0.36271261700523505, 0.06205853688584614, 0.09673690743933337, 0.061835278906231826, 0.2139861384757619, 0.12213836305275344, 0.15743087416352786, -0.14472986097562301, 0.07420233276207, -0.021524110329809828] |
1,803.00213 | Charge density functional plus $U$ theory of LaMnO$_3$: Phase diagram,
electronic structure, and magnetic interaction | We perform charge density functional theory plus $U$ calculation of
LaMnO$_3$. While all the previous calculations were based on spin density
functionals, our result and analysis show that the use of spin-unpolarized
charge-only density is crucial to correctly describe the phase diagram,
electronic structure and magnetic property. Using magnetic force linear
response calculation, a long-standing issue is clarified regarding the second
neighbor out-of-plane interaction strength. We also estimate the
orbital-resolved magnetic couplings. Remarkably, the inter-orbital
$e_g$-$t_{2g}$ interaction is quite significant due to the Jahn-Teller
distortion and orbital ordering.
| cond-mat.str-el cond-mat.mtrl-sci | we perform charge density functional theory plus u calculation of lamno_3 while all the previous calculations were based on spin density functionals our result and analysis show that the use of spinunpolarized chargeonly density is crucial to correctly describe the phase diagram electronic structure and magnetic property using magnetic force linear response calculation a longstanding issue is clarified regarding the second neighbor outofplane interaction strength we also estimate the orbitalresolved magnetic couplings remarkably the interorbital e_gt_2g interaction is quite significant due to the jahnteller distortion and orbital ordering | [['we', 'perform', 'charge', 'density', 'functional', 'theory', 'plus', 'u', 'calculation', 'of', 'lamno_3', 'while', 'all', 'the', 'previous', 'calculations', 'were', 'based', 'on', 'spin', 'density', 'functionals', 'our', 'result', 'and', 'analysis', 'show', 'that', 'the', 'use', 'of', 'spinunpolarized', 'chargeonly', 'density', 'is', 'crucial', 'to', 'correctly', 'describe', 'the', 'phase', 'diagram', 'electronic', 'structure', 'and', 'magnetic', 'property', 'using', 'magnetic', 'force', 'linear', 'response', 'calculation', 'a', 'longstanding', 'issue', 'is', 'clarified', 'regarding', 'the', 'second', 'neighbor', 'outofplane', 'interaction', 'strength', 'we', 'also', 'estimate', 'the', 'orbitalresolved', 'magnetic', 'couplings', 'remarkably', 'the', 'interorbital', 'e_gt_2g', 'interaction', 'is', 'quite', 'significant', 'due', 'to', 'the', 'jahnteller', 'distortion', 'and', 'orbital', 'ordering']] | [-0.17637444808761674, 0.13075596689966254, -0.05453797611831264, 0.10005244135258677, -0.06216718032638627, -0.0896622185669416, 0.06780981764975215, 0.3789552371970124, -0.250786175718531, -0.32287843377244746, -0.0304854179055176, -0.31039586024549365, -0.1764301265443051, 0.09667978773094629, 0.09609549574088305, 0.0007287374993955547, 0.001437026246673089, -0.0018018955438905819, -0.11370577762400816, -0.1855100613994926, 0.28121002980994736, 0.04924257318700918, 0.3051775793587281, 0.13764694551619786, 0.008760339257688347, 0.09488370460807842, 0.04792890406150201, 0.029884750261606478, -0.1545638895084432, 0.06389062542637641, 0.21308764908330471, -0.07070085780419917, 0.22798619781017557, -0.4389072550164366, -0.19923882771135223, 0.0016139373236166482, 0.08446908275271364, 0.16290127890004608, -0.05032287053803553, -0.2492369512275962, 0.034797576679424805, -0.18544963042421098, -0.1352357583448545, -0.20112014505800538, -0.0018098162571814928, 0.020972528483649843, -0.2658303955990546, 0.16671345869988066, 0.05492061176152096, 0.05263750838432977, -0.1467997360053811, -0.14256662023994562, -0.09454008204259233, 0.07544548432766036, 0.0980834788986778, 0.13892586084760047, 0.14995984875448895, -0.07441855522120022, -0.07415395087842956, 0.35542439885268157, -0.039324514038691465, -0.1260731199925596, 0.1406758294615429, -0.1605387104844505, -0.13230236650666816, 0.13210661269047044, 0.08464958427198739, 0.06367976206820458, -0.1371951068041116, 0.13084703581526727, 0.02099526196649425, 0.22050041089427064, -0.003225712827935984, 0.059599328034726735, 0.17925129010836827, 0.13889468381371858, 0.058841469983400944, 0.0844880649647993, -0.14190043917253867, -0.10386620394737375, -0.23391543863214215, -0.08907449156553908, -0.21813266234742265, 0.02942591143073514, -0.06830161351089456, -0.19286720920883288, 0.39084221653386275, 0.17566723339471288, 0.15609648418401115, -0.05007038176832297, 0.2884159485216845, 0.12541643971582578, 0.04360404299487444, 0.016983298026554457, 0.26293083349380386, 0.24715126914617774, 0.055240494847318834, -0.32910377375380695, 0.1028166472626088, 0.09676313939218578] |
1,803.00214 | Topological design of graphene | Topological defects (e.g. pentagons, heptagons and pentagon-heptagon pairs)
have been widely observed in large scale graphene and have been recognized to
play important roles in tailoring the mechanical and physical properties of
two-dimensional materials in general. Thanks to intensive studies over the past
few years, optimizing properties of graphene through topological design has
become a new and promising direction of research. In this chapter, we review
some of the recent advances in experimental, computational and theoretical
studies on the effects of topological defects on mechanical and physical
properties of graphene and applications of topologically designed graphene. The
discussions cover out-of-plane effects, inverse problems of designing
distributions of topological defects that make a graphene sheet conform to a
targeted three-dimensional surface, grain boundary engineering for graphene
strength, curved graphene for toughness enhancement and applications in
engineering energy materials, multifunctional materials and interactions with
biological systems. Despite the rapid developments in experiments and
simulations, our understanding on the relations between topological defects and
mechanical and physical properties of graphene and other 2D materials is still
in its infancy. The intention here is to draw the attention of the research
community to some of the open questions in this field.
| cond-mat.mes-hall | topological defects eg pentagons heptagons and pentagonheptagon pairs have been widely observed in large scale graphene and have been recognized to play important roles in tailoring the mechanical and physical properties of twodimensional materials in general thanks to intensive studies over the past few years optimizing properties of graphene through topological design has become a new and promising direction of research in this chapter we review some of the recent advances in experimental computational and theoretical studies on the effects of topological defects on mechanical and physical properties of graphene and applications of topologically designed graphene the discussions cover outofplane effects inverse problems of designing distributions of topological defects that make a graphene sheet conform to a targeted threedimensional surface grain boundary engineering for graphene strength curved graphene for toughness enhancement and applications in engineering energy materials multifunctional materials and interactions with biological systems despite the rapid developments in experiments and simulations our understanding on the relations between topological defects and mechanical and physical properties of graphene and other 2d materials is still in its infancy the intention here is to draw the attention of the research community to some of the open questions in this field | [['topological', 'defects', 'eg', 'pentagons', 'heptagons', 'and', 'pentagonheptagon', 'pairs', 'have', 'been', 'widely', 'observed', 'in', 'large', 'scale', 'graphene', 'and', 'have', 'been', 'recognized', 'to', 'play', 'important', 'roles', 'in', 'tailoring', 'the', 'mechanical', 'and', 'physical', 'properties', 'of', 'twodimensional', 'materials', 'in', 'general', 'thanks', 'to', 'intensive', 'studies', 'over', 'the', 'past', 'few', 'years', 'optimizing', 'properties', 'of', 'graphene', 'through', 'topological', 'design', 'has', 'become', 'a', 'new', 'and', 'promising', 'direction', 'of', 'research', 'in', 'this', 'chapter', 'we', 'review', 'some', 'of', 'the', 'recent', 'advances', 'in', 'experimental', 'computational', 'and', 'theoretical', 'studies', 'on', 'the', 'effects', 'of', 'topological', 'defects', 'on', 'mechanical', 'and', 'physical', 'properties', 'of', 'graphene', 'and', 'applications', 'of', 'topologically', 'designed', 'graphene', 'the', 'discussions', 'cover', 'outofplane', 'effects', 'inverse', 'problems', 'of', 'designing', 'distributions', 'of', 'topological', 'defects', 'that', 'make', 'a', 'graphene', 'sheet', 'conform', 'to', 'a', 'targeted', 'threedimensional', 'surface', 'grain', 'boundary', 'engineering', 'for', 'graphene', 'strength', 'curved', 'graphene', 'for', 'toughness', 'enhancement', 'and', 'applications', 'in', 'engineering', 'energy', 'materials', 'multifunctional', 'materials', 'and', 'interactions', 'with', 'biological', 'systems', 'despite', 'the', 'rapid', 'developments', 'in', 'experiments', 'and', 'simulations', 'our', 'understanding', 'on', 'the', 'relations', 'between', 'topological', 'defects', 'and', 'mechanical', 'and', 'physical', 'properties', 'of', 'graphene', 'and', 'other', '2d', 'materials', 'is', 'still', 'in', 'its', 'infancy', 'the', 'intention', 'here', 'is', 'to', 'draw', 'the', 'attention', 'of', 'the', 'research', 'community', 'to', 'some', 'of', 'the', 'open', 'questions', 'in', 'this', 'field']] | [-0.11520517097790796, 0.1362543343826372, -0.03651957685360685, -0.010266039009042898, -0.08460785991093853, -0.12245660655904883, 0.02734003594880309, 0.4319713442836921, -0.2522920685900649, -0.3107477702427334, 0.06607300551256004, -0.3039699315027272, -0.2250851756765455, 0.22669165349816006, -0.043831245881519494, 0.11046744867430074, 0.0433740289178606, -0.0887218545271358, -0.07345664048884158, -0.24022679047914325, 0.2611061902504017, 0.04884842367426771, 0.35802088729767745, 0.14366865369401455, 0.012270364136231808, -0.019260398647629746, 0.008732293968840602, 0.04227199336646248, -0.17624645348926232, 0.17350300514348427, 0.27698305509464466, -0.01371378140041822, 0.2849547065449359, -0.5122773325387483, -0.29091192024102824, 0.026837216599177816, 0.11276234221326478, 0.12713896899677926, -0.12444575511446213, -0.26261790711810895, 0.07547855500822065, -0.09156098419346559, -0.11001468498997277, -0.07002406472370955, 0.07550711066611017, 0.011253319248122158, -0.13509158305008304, 0.011953715393219266, 0.04655159241874433, 0.11881329270013546, -0.07449448810887953, -0.12228075934391998, -0.04752285142788465, 0.12559310004391666, 0.07341486750274594, 0.00806179214127097, 0.1906579828320005, -0.20737014214276586, -0.15738966401907506, 0.43060752282363507, 0.04376997712463008, -0.16082923885359227, 0.24517535083740477, -0.11293224552126252, -0.16285316829763466, 0.09248701727187951, 0.19403554183823354, 0.07598048429297954, -0.14602519656876622, 0.0962079587013716, 0.014147875808666313, 0.11323690765137255, 0.036354862583734965, 0.12227621643690553, 0.2858164267245737, 0.23440711219147378, 0.015981146696125284, 0.13739249203324574, -0.03707291187037747, -0.048724132020329006, -0.2053196546207962, -0.2183704477244974, -0.1846593529255446, 0.058576858031172255, -0.028408748213172807, -0.2093002180200127, 0.44175755060653127, 0.18509752288588374, 0.15128216213135398, -0.08983659493940206, 0.2341607980014104, 0.02537099184612578, 0.10830880667976468, -0.015082335196492182, 0.26836312606340973, 0.16460560850780173, 0.11775095936390784, -0.17822614154272576, 0.061589955454479504, -0.014870025050887829] |
1,803.00215 | The continued importance of habitability studies | This is a white paper in response to the National Academy of Sciences
"Exoplanet Science Strategy" call.
We summarize recent advances in theoretical habitability studies and argue
that such studies will remain important for guiding and interpreting
observations. Interactions between 1-D and 3-D climate modelers will be
necessary to resolve recent discrepancies in model results and improve
habitability studies. Observational capabilities will also need improvement.
Although basic observations can be performed with present capabilities,
technological advances will be necessary to improve climate models to the level
needed for planetary habitability studies.
| astro-ph.EP | this is a white paper in response to the national academy of sciences exoplanet science strategy call we summarize recent advances in theoretical habitability studies and argue that such studies will remain important for guiding and interpreting observations interactions between 1d and 3d climate modelers will be necessary to resolve recent discrepancies in model results and improve habitability studies observational capabilities will also need improvement although basic observations can be performed with present capabilities technological advances will be necessary to improve climate models to the level needed for planetary habitability studies | [['this', 'is', 'a', 'white', 'paper', 'in', 'response', 'to', 'the', 'national', 'academy', 'of', 'sciences', 'exoplanet', 'science', 'strategy', 'call', 'we', 'summarize', 'recent', 'advances', 'in', 'theoretical', 'habitability', 'studies', 'and', 'argue', 'that', 'such', 'studies', 'will', 'remain', 'important', 'for', 'guiding', 'and', 'interpreting', 'observations', 'interactions', 'between', '1d', 'and', '3d', 'climate', 'modelers', 'will', 'be', 'necessary', 'to', 'resolve', 'recent', 'discrepancies', 'in', 'model', 'results', 'and', 'improve', 'habitability', 'studies', 'observational', 'capabilities', 'will', 'also', 'need', 'improvement', 'although', 'basic', 'observations', 'can', 'be', 'performed', 'with', 'present', 'capabilities', 'technological', 'advances', 'will', 'be', 'necessary', 'to', 'improve', 'climate', 'models', 'to', 'the', 'level', 'needed', 'for', 'planetary', 'habitability', 'studies']] | [-0.0481088311170934, 0.11427364792613375, -0.056935855313485675, 0.0728208335733123, -0.17878461328775183, -0.08970694108303268, 0.042715794507895116, 0.3889781905563323, -0.18474712505281626, -0.3662084642756771, 0.14154605810648177, -0.26026045725486435, -0.22000934824329585, 0.2498313602402929, -0.1684196870722859, 0.08840433561376163, 0.2006284714481988, -0.09504529708487258, -0.04666288461341717, -0.30050477684362903, 0.22712047757058926, 0.18174673933126442, 0.20972370511435157, 0.1102231662761379, -0.03806315357336304, -0.05978008787464965, -0.10491537370790656, -0.002615920912760955, -0.2191737321859314, 0.13388724044825023, 0.39250474126554885, 0.23737322676230918, 0.3271720913126246, -0.5070697956892488, -0.3221541280413026, 0.07995331583251655, 0.1220478730603725, 0.06964606671065737, -0.055115273693105676, -0.24813785033484737, 0.019812389981810126, -0.16096601716068748, -0.1798269310966134, -0.11708225630182814, 0.040396398480899716, 0.022234801469104632, -0.25812723841466995, -1.9020192737046342e-05, 0.027076478712363065, 0.1164062012544741, -0.10854555204879124, -0.1577353640817679, 0.03083286877557799, 0.20529855980670877, 0.02308419813110319, 0.02432255983988468, 0.12469565851491067, -0.1378462976778622, -0.14893091305358602, 0.39220491171991045, -0.06810734649239988, -0.12134067432898618, 0.2430264255029385, -0.17560016979453164, -0.23394117625123198, 0.003975555454227296, 0.22600835735735658, 0.014435411379723758, -0.1625578909316663, 0.04156700968115519, 0.015834069022765525, 0.15287649733843384, -0.010405934446460598, 0.035443961374707275, 0.34049565742140286, 0.22679744813601477, 0.03685888765727753, 0.011749612503930681, -0.12130410305562091, -0.060684040521404574, -0.21220286745209616, -0.15985260597829307, -0.08686964804368032, 0.027624235826206732, 0.039628832963689305, -0.03849413244892935, 0.3522160106778636, 0.32245173170691827, 0.10228157057785071, -0.044440700278545804, 0.3259387360322852, 0.01785512038782894, 0.03790760816300063, 0.013862871805431096, 0.30394697372013557, 0.10106173430436424, 0.15188260862583314, -0.1790493995892805, 0.11085597871659467, -0.037479136497355424] |
1,803.00216 | Comment on (t, n) Threshold d-level Quantum Secret Sharing | This comment points out a problem in Song et al.'s (t, n) threshold quantum
secret sharing [Scientific Reports, Vol. 7, No. 1 (2017), pp. 6366], indicating
that the agent is unable to obtain the expected information.
| quant-ph | this comment points out a problem in song et als t n threshold quantum secret sharing scientific reports vol 7 no 1 2017 pp 6366 indicating that the agent is unable to obtain the expected information | [['this', 'comment', 'points', 'out', 'a', 'problem', 'in', 'song', 'et', 'als', 't', 'n', 'threshold', 'quantum', 'secret', 'sharing', 'scientific', 'reports', 'vol', '7', 'no', '1', '2017', 'pp', '6366', 'indicating', 'that', 'the', 'agent', 'is', 'unable', 'to', 'obtain', 'the', 'expected', 'information']] | [-0.13310707872733474, 0.047098230906865664, -0.08892464657158901, 0.04223412903957069, -0.06348556249092023, -0.20409153881741482, 0.131407904820258, 0.28583448697786984, -0.19182078757633766, -0.38713533115676707, 0.006827300113703434, -0.3729400584060285, -0.14000966814475962, 0.09643480111844838, -0.14904056942193872, 0.06120480291752352, 0.05603861882506559, 0.025417776002238195, 0.029725192379879042, -0.4159884967116846, 0.19810308882087055, 0.13271732715333606, 0.2577766298264679, 0.05754019490753611, 0.05552256195288566, 0.031698891479108066, -0.12523455948879322, -0.1030260819890019, -0.20127766527750485, 0.033618559346198, 0.37935172458593214, 0.1519121545780864, 0.30498075526621604, -0.33380365733885103, -0.16628245815324286, 0.1115200050537371, 0.05880059957659493, 0.10463036689907312, -0.008825212018564343, -0.25819918201563674, 0.11363112621863063, -0.17258422167247367, -0.06145577091309759, 0.02831103341466385, 0.13851387903559953, -0.062294350710645735, -0.2908282642925365, 0.09064506829923226, 0.10544130692465438, 0.10504120060553153, 0.04032777762040496, -0.15665853848784334, -0.017178567747275036, 0.06524439079738739, -0.06030581553285527, 0.15200671727911363, 0.11865437072184351, -0.09000083128274936, -0.21304695297860438, 0.34000877782495487, 0.03867830999661237, -0.04476703007498549, 0.16981553118805298, -0.10258274102428307, -0.13728668320820564, 0.10369012604415831, 0.10772115468151039, 0.06370992358360025, -0.13150060561019927, 0.11444937298074365, -0.10349027341645625, 0.29257292823038167, 0.12235630311382313, -0.02613604659887238, 0.12664222419779333, 0.04760639846790582, 0.04879373454281853, 0.014070899778744206, -0.07690971662911276, -0.08111435030069616, -0.2795646972954273, -0.15556432190351188, -0.17839825453443658, 0.10722489736831954, -0.00631532243763407, -0.05579084830565585, 0.26389048496578954, 0.1868564398545358, 0.2369669872827621, -0.02713310071784589, 0.20742615765064126, 0.022380857793096866, -0.045989672705117196, 0.2505157523555681, 0.24971663602627814, 0.05365871609602538, 0.23058378288988024, -0.1741031704392905, 0.044393060056285724, 0.05941822716138429] |
1,803.00217 | Theory of orbital magnetic quadrupole moment and magnetoelectric
susceptibility | We derive a quantum-mechanical formula of the orbital magnetic quadrupole
moment (MQM) in periodic systems by using the gauge-covariant gradient
expansion. This formula is valid for insulators and metals at zero and finite
temperature. We also prove a direct relation between the MQM and
magnetoelectric (ME) susceptibility for insulators at zero temperature. It
indicates that the MQM is a microscopic origin of the ME effect. Using the
formula, we quantitatively estimate these quantities for room-temperature
antiferromagnetic semiconductors BaMn$_2$As$_2$ and CeMn$_2$Ge$_{2 - x}$Si$_x$.
We find that the orbital contribution to the ME susceptibility is comparable
with or even dominant over the spin contribution.
| cond-mat.mtrl-sci | we derive a quantummechanical formula of the orbital magnetic quadrupole moment mqm in periodic systems by using the gaugecovariant gradient expansion this formula is valid for insulators and metals at zero and finite temperature we also prove a direct relation between the mqm and magnetoelectric me susceptibility for insulators at zero temperature it indicates that the mqm is a microscopic origin of the me effect using the formula we quantitatively estimate these quantities for roomtemperature antiferromagnetic semiconductors bamn_2as_2 and cemn_2ge_2 xsi_x we find that the orbital contribution to the me susceptibility is comparable with or even dominant over the spin contribution | [['we', 'derive', 'a', 'quantummechanical', 'formula', 'of', 'the', 'orbital', 'magnetic', 'quadrupole', 'moment', 'mqm', 'in', 'periodic', 'systems', 'by', 'using', 'the', 'gaugecovariant', 'gradient', 'expansion', 'this', 'formula', 'is', 'valid', 'for', 'insulators', 'and', 'metals', 'at', 'zero', 'and', 'finite', 'temperature', 'we', 'also', 'prove', 'a', 'direct', 'relation', 'between', 'the', 'mqm', 'and', 'magnetoelectric', 'me', 'susceptibility', 'for', 'insulators', 'at', 'zero', 'temperature', 'it', 'indicates', 'that', 'the', 'mqm', 'is', 'a', 'microscopic', 'origin', 'of', 'the', 'me', 'effect', 'using', 'the', 'formula', 'we', 'quantitatively', 'estimate', 'these', 'quantities', 'for', 'roomtemperature', 'antiferromagnetic', 'semiconductors', 'bamn_2as_2', 'and', 'cemn_2ge_2', 'xsi_x', 'we', 'find', 'that', 'the', 'orbital', 'contribution', 'to', 'the', 'me', 'susceptibility', 'is', 'comparable', 'with', 'or', 'even', 'dominant', 'over', 'the', 'spin', 'contribution']] | [-0.17137403541592636, 0.18195681589081733, -0.07931595046374232, 0.07768074324533268, -0.08190736245138175, -0.10661051771368342, 0.09387613453424884, 0.35554227729638416, -0.229053760406025, -0.25518872088404615, 0.011467742878294579, -0.3315407496434872, -0.14591470003572546, 0.20061774120073428, 0.08063979435599211, -0.015269524102673085, -0.05254971388859129, 0.024221687276631293, -0.1453813952229202, -0.1774315034236872, 0.2678091482851993, -0.0028570050543004818, 0.2533036877467024, 0.14002812530132802, 0.11335366960577291, 0.009589878418906168, 0.10336976475787885, 0.03481669502916059, -0.14467821748662069, 0.0653830469077961, 0.22712917802290936, -0.06666841988470594, 0.16505384343591603, -0.3971286446345274, -0.15598809557280155, 0.03785579464388917, 0.07976406586892677, 0.18783982898663693, -0.051016234969155805, -0.21930088451357954, 0.08877433532604365, -0.2101049575051575, -0.14327199096765575, -0.16332116108764, 0.048873788310271324, -0.029223448135937104, -0.2874924571751946, 0.142917322876541, 0.09838694834498445, 0.13025937586872263, -0.1269244231104926, -0.16995909635090467, -0.008509969089481265, 0.07837615131560449, 0.08176085437798515, 0.046514830984777274, 0.10344296276117816, -0.07213038420351693, -0.09647366645830599, 0.3506727503857227, -0.11548680084936246, -0.1536393380733301, 0.10971546742707641, -0.23464196524817985, -0.0663071246065124, 0.11079687242292696, 0.08882893147793683, 0.13499827371590367, -0.1369966571078156, 0.06776302184373366, 0.013372480361299082, 0.14110416602907758, 0.00939742301948218, 0.056453947890361754, 0.2884603909997627, 0.10078785593875429, 0.035812150884532566, 0.15155747324943242, -0.10034033336272144, -0.040987166340905004, -0.2660936520463138, -0.18692377616999425, -0.2769258456078894, 0.08983161529488486, -0.09200853652425459, -0.1811655132344576, 0.3623956735575139, 0.19907851608098495, 0.13911776441252893, 0.015499865596248495, 0.29179503107819743, 0.17341748107638624, 0.07426459984759791, 0.045206874717177464, 0.2622275518070003, 0.22416869938524084, 0.13265212491093523, -0.32719364224208725, 0.09030040383639962, 0.07623293634146602] |
1,803.00218 | Interval-based Prediction Uncertainty Bound Computation in Learning with
Missing Values | The problem of machine learning with missing values is common in many areas.
A simple approach is to first construct a dataset without missing values simply
by discarding instances with missing entries or by imputing a fixed value for
each missing entry, and then train a prediction model with the new dataset. A
drawback of this naive approach is that the uncertainty in the missing entries
is not properly incorporated in the prediction. In order to evaluate prediction
uncertainty, the multiple imputation (MI) approach has been studied, but the
performance of MI is sensitive to the choice of the probabilistic model of the
true values in the missing entries, and the computational cost of MI is high
because multiple models must be trained. In this paper, we propose an
alternative approach called the Interval-based Prediction Uncertainty Bounding
(IPUB) method. The IPUB method represents the uncertainties due to missing
entries as intervals, and efficiently computes the lower and upper bounds of
the prediction results when all possible training sets constructed by imputing
arbitrary values in the intervals are considered. The IPUB method can be
applied to a wide class of convex learning algorithms including penalized
least-squares regression, support vector machine (SVM), and logistic
regression. We demonstrate the advantages of the IPUB method by comparing it
with an existing method in numerical experiment with benchmark datasets.
| stat.ML cs.LG | the problem of machine learning with missing values is common in many areas a simple approach is to first construct a dataset without missing values simply by discarding instances with missing entries or by imputing a fixed value for each missing entry and then train a prediction model with the new dataset a drawback of this naive approach is that the uncertainty in the missing entries is not properly incorporated in the prediction in order to evaluate prediction uncertainty the multiple imputation mi approach has been studied but the performance of mi is sensitive to the choice of the probabilistic model of the true values in the missing entries and the computational cost of mi is high because multiple models must be trained in this paper we propose an alternative approach called the intervalbased prediction uncertainty bounding ipub method the ipub method represents the uncertainties due to missing entries as intervals and efficiently computes the lower and upper bounds of the prediction results when all possible training sets constructed by imputing arbitrary values in the intervals are considered the ipub method can be applied to a wide class of convex learning algorithms including penalized leastsquares regression support vector machine svm and logistic regression we demonstrate the advantages of the ipub method by comparing it with an existing method in numerical experiment with benchmark datasets | [['the', 'problem', 'of', 'machine', 'learning', 'with', 'missing', 'values', 'is', 'common', 'in', 'many', 'areas', 'a', 'simple', 'approach', 'is', 'to', 'first', 'construct', 'a', 'dataset', 'without', 'missing', 'values', 'simply', 'by', 'discarding', 'instances', 'with', 'missing', 'entries', 'or', 'by', 'imputing', 'a', 'fixed', 'value', 'for', 'each', 'missing', 'entry', 'and', 'then', 'train', 'a', 'prediction', 'model', 'with', 'the', 'new', 'dataset', 'a', 'drawback', 'of', 'this', 'naive', 'approach', 'is', 'that', 'the', 'uncertainty', 'in', 'the', 'missing', 'entries', 'is', 'not', 'properly', 'incorporated', 'in', 'the', 'prediction', 'in', 'order', 'to', 'evaluate', 'prediction', 'uncertainty', 'the', 'multiple', 'imputation', 'mi', 'approach', 'has', 'been', 'studied', 'but', 'the', 'performance', 'of', 'mi', 'is', 'sensitive', 'to', 'the', 'choice', 'of', 'the', 'probabilistic', 'model', 'of', 'the', 'true', 'values', 'in', 'the', 'missing', 'entries', 'and', 'the', 'computational', 'cost', 'of', 'mi', 'is', 'high', 'because', 'multiple', 'models', 'must', 'be', 'trained', 'in', 'this', 'paper', 'we', 'propose', 'an', 'alternative', 'approach', 'called', 'the', 'intervalbased', 'prediction', 'uncertainty', 'bounding', 'ipub', 'method', 'the', 'ipub', 'method', 'represents', 'the', 'uncertainties', 'due', 'to', 'missing', 'entries', 'as', 'intervals', 'and', 'efficiently', 'computes', 'the', 'lower', 'and', 'upper', 'bounds', 'of', 'the', 'prediction', 'results', 'when', 'all', 'possible', 'training', 'sets', 'constructed', 'by', 'imputing', 'arbitrary', 'values', 'in', 'the', 'intervals', 'are', 'considered', 'the', 'ipub', 'method', 'can', 'be', 'applied', 'to', 'a', 'wide', 'class', 'of', 'convex', 'learning', 'algorithms', 'including', 'penalized', 'leastsquares', 'regression', 'support', 'vector', 'machine', 'svm', 'and', 'logistic', 'regression', 'we', 'demonstrate', 'the', 'advantages', 'of', 'the', 'ipub', 'method', 'by', 'comparing', 'it', 'with', 'an', 'existing', 'method', 'in', 'numerical', 'experiment', 'with', 'benchmark', 'datasets']] | [-0.044632434629810244, 0.027279978675323946, -0.06309017703512966, 0.09376472130575816, -0.10107322031087408, -0.1693336677562911, 0.057213557726624585, 0.38964237887246, -0.2694296175177442, -0.34149209424296195, 0.12171969638750722, -0.2664121851557866, -0.13123113898057323, 0.18285662368309982, -0.12434334565270026, 0.11819472963465419, 0.1285524196698264, 0.05420476383629388, -0.06413113505134659, -0.2978745234675963, 0.2893693399876481, 0.02510432884238461, 0.2961825360211411, 0.009224521748754861, 0.12097155537672474, -0.0008288106847820538, -0.042214392069061954, 0.02901768934680149, -0.05465623846472616, 0.17287753552799195, 0.2904392279999521, 0.15875672185731154, 0.36145578856563326, -0.33678376681304406, -0.21070542031416803, 0.1496264382803929, 0.11719706897981398, 0.10921607806247786, -0.0004942558942795065, -0.2769195268920157, 0.10674867805625711, -0.17662741061004844, -0.04201704816452028, -0.11818547309563396, -0.040231486602611506, -0.03366477537617486, -0.3541616453668602, 0.08951039715819727, 0.027876577331751053, 0.036771396551167915, -0.05789547635712162, -0.18434030718552613, 0.030692875211700863, 0.10977564164789198, 0.08340543153930671, 0.05069917245158909, 0.06889797693085191, -0.13405610088450107, -0.1583424376377869, 0.35543920268537477, -0.05099291448641452, -0.26552193042282723, 0.13764372646359593, -0.07978533483193521, -0.1270113474721646, 0.11577236796750055, 0.2084917279826186, 0.09183815713497877, -0.16383812054255031, 0.04473472556050443, -0.05092932056010925, 0.14805012243284313, 0.0049538671784310805, -0.06416516821315911, 0.1586821720343973, 0.2103087550879406, 0.021848437380218196, 0.12614567775952829, -0.13855660862152167, -0.06108175150984607, -0.27382354095139555, -0.105368805803924, -0.23766057823637052, -0.05687936052702623, -0.1167421840901365, -0.1829213206224917, 0.38064772232662236, 0.22766337112469565, 0.2523128433115614, 0.09291424819717317, 0.3620482608010726, 0.09867587544587357, 0.09320112049629513, 0.08621824065838675, 0.17171677707795294, 0.07441281431030282, 0.05185117851630951, -0.14952672843693499, 0.1357576888757259, 0.0666750652162591] |
1,803.00219 | Tongue image constitution recognition based on Complexity Perception
method | Background and Object: In China, body constitution is highly related to
physiological and pathological functions of human body and determines the
tendency of the disease, which is of great importance for treatment in clinical
medicine. Tongue diagnosis, as a key part of Traditional Chinese Medicine
inspection, is an important way to recognize the type of constitution.In order
to deploy tongue image constitution recognition system on non-invasive mobile
device to achieve fast, efficient and accurate constitution recognition, an
efficient method is required to deal with the challenge of this kind of complex
environment. Methods: In this work, we perform the tongue area detection,
tongue area calibration and constitution classification using methods which are
based on deep convolutional neural network. Subject to the variation of
inconstant environmental condition, the distribution of the picture is uneven,
which has a bad effect on classification performance. To solve this problem, we
propose a method based on the complexity of individual instances to divide
dataset into two subsets and classify them separately, which is capable of
improving classification accuracy. To evaluate the performance of our proposed
method, we conduct experiments on three sizes of tongue datasets, in which deep
convolutional neural network method and traditional digital image analysis
method are respectively applied to extract features for tongue images. The
proposed method is combined with the base classifier Softmax, SVM, and
DecisionTree respectively. Results: As the experiments results shown, our
proposed method improves the classification accuracy by 1.135% on average and
achieves 59.99% constitution classification accuracy. Conclusions: Experimental
results on three datasets show that our proposed method can effectively improve
the classification accuracy of tongue constitution recognition.
| cs.CV cs.AI | background and object in china body constitution is highly related to physiological and pathological functions of human body and determines the tendency of the disease which is of great importance for treatment in clinical medicine tongue diagnosis as a key part of traditional chinese medicine inspection is an important way to recognize the type of constitutionin order to deploy tongue image constitution recognition system on noninvasive mobile device to achieve fast efficient and accurate constitution recognition an efficient method is required to deal with the challenge of this kind of complex environment methods in this work we perform the tongue area detection tongue area calibration and constitution classification using methods which are based on deep convolutional neural network subject to the variation of inconstant environmental condition the distribution of the picture is uneven which has a bad effect on classification performance to solve this problem we propose a method based on the complexity of individual instances to divide dataset into two subsets and classify them separately which is capable of improving classification accuracy to evaluate the performance of our proposed method we conduct experiments on three sizes of tongue datasets in which deep convolutional neural network method and traditional digital image analysis method are respectively applied to extract features for tongue images the proposed method is combined with the base classifier softmax svm and decisiontree respectively results as the experiments results shown our proposed method improves the classification accuracy by 1135 on average and achieves 5999 constitution classification accuracy conclusions experimental results on three datasets show that our proposed method can effectively improve the classification accuracy of tongue constitution recognition | [['background', 'and', 'object', 'in', 'china', 'body', 'constitution', 'is', 'highly', 'related', 'to', 'physiological', 'and', 'pathological', 'functions', 'of', 'human', 'body', 'and', 'determines', 'the', 'tendency', 'of', 'the', 'disease', 'which', 'is', 'of', 'great', 'importance', 'for', 'treatment', 'in', 'clinical', 'medicine', 'tongue', 'diagnosis', 'as', 'a', 'key', 'part', 'of', 'traditional', 'chinese', 'medicine', 'inspection', 'is', 'an', 'important', 'way', 'to', 'recognize', 'the', 'type', 'of', 'constitutionin', 'order', 'to', 'deploy', 'tongue', 'image', 'constitution', 'recognition', 'system', 'on', 'noninvasive', 'mobile', 'device', 'to', 'achieve', 'fast', 'efficient', 'and', 'accurate', 'constitution', 'recognition', 'an', 'efficient', 'method', 'is', 'required', 'to', 'deal', 'with', 'the', 'challenge', 'of', 'this', 'kind', 'of', 'complex', 'environment', 'methods', 'in', 'this', 'work', 'we', 'perform', 'the', 'tongue', 'area', 'detection', 'tongue', 'area', 'calibration', 'and', 'constitution', 'classification', 'using', 'methods', 'which', 'are', 'based', 'on', 'deep', 'convolutional', 'neural', 'network', 'subject', 'to', 'the', 'variation', 'of', 'inconstant', 'environmental', 'condition', 'the', 'distribution', 'of', 'the', 'picture', 'is', 'uneven', 'which', 'has', 'a', 'bad', 'effect', 'on', 'classification', 'performance', 'to', 'solve', 'this', 'problem', 'we', 'propose', 'a', 'method', 'based', 'on', 'the', 'complexity', 'of', 'individual', 'instances', 'to', 'divide', 'dataset', 'into', 'two', 'subsets', 'and', 'classify', 'them', 'separately', 'which', 'is', 'capable', 'of', 'improving', 'classification', 'accuracy', 'to', 'evaluate', 'the', 'performance', 'of', 'our', 'proposed', 'method', 'we', 'conduct', 'experiments', 'on', 'three', 'sizes', 'of', 'tongue', 'datasets', 'in', 'which', 'deep', 'convolutional', 'neural', 'network', 'method', 'and', 'traditional', 'digital', 'image', 'analysis', 'method', 'are', 'respectively', 'applied', 'to', 'extract', 'features', 'for', 'tongue', 'images', 'the', 'proposed', 'method', 'is', 'combined', 'with', 'the', 'base', 'classifier', 'softmax', 'svm', 'and', 'decisiontree', 'respectively', 'results', 'as', 'the', 'experiments', 'results', 'shown', 'our', 'proposed', 'method', 'improves', 'the', 'classification', 'accuracy', 'by', '1135', 'on', 'average', 'and', 'achieves', '5999', 'constitution', 'classification', 'accuracy', 'conclusions', 'experimental', 'results', 'on', 'three', 'datasets', 'show', 'that', 'our', 'proposed', 'method', 'can', 'effectively', 'improve', 'the', 'classification', 'accuracy', 'of', 'tongue', 'constitution', 'recognition']] | [-0.022717147983232388, -0.05986390755584093, -0.06765072789652529, 0.035761176019069155, -0.10332887732254196, -0.14983263634124486, 0.041212657766873675, 0.4103465765493067, -0.2017498750492349, -0.3451748668085472, 0.08535935659546641, -0.2775941898069971, -0.20491738925379835, 0.25471191001348636, -0.17240323150551232, 0.08038799449469076, 0.1474869170310114, 0.06633502492234526, -0.0245254507502991, -0.3162658833985158, 0.26742654032901375, 0.03573511506246444, 0.4173017213256081, 0.051760179098854775, 0.13587661059815645, -0.0385857000955654, -0.046045952642745025, -0.011849350675663107, -0.049757747341525785, 0.1923129653837705, 0.28630193865418324, 0.20232604150608405, 0.30485642896653553, -0.380866948979107, -0.22977406575541848, 0.06306161002003238, 0.13373146299445884, 0.08417846160375195, -0.01930385612974421, -0.35018131544737346, 0.09313330857289201, -0.15552478700488473, -0.04226897638243516, -0.15347472430322817, -0.00307786328065448, -0.011179651758204245, -0.2857404572709176, 0.08864503449649588, 0.0582788734875107, 0.08077142906866856, -0.0935892605960203, -0.10614620752720903, 0.03874933540035164, 0.20921314392605844, 0.02668522415443784, 0.06866945270414301, 0.16617573039531777, -0.16706798819984206, -0.10857602000084175, 0.3606322333251289, -0.03246714405284426, -0.21380115486941123, 0.2245326962747843, -0.06027008824181989, -0.12606122693718588, 0.10161642687824524, 0.26103896107593877, 0.10512597678570236, -0.1510959479812408, -0.037831641581527485, -0.011879436869077302, 0.1888592343337723, 0.04462737808190979, -0.05843928326734906, 0.14976487885623976, 0.2945214644849965, 0.01460927897946542, 0.13354040939468184, -0.18399003431381447, -0.025048658790129158, -0.1927184660946708, -0.1086354195853833, -0.18483060332479087, -0.03182065128184315, -0.08675037648784799, -0.15702865349999146, 0.41517688952330983, 0.22354516662054844, 0.16268492365501766, 0.05959156243222312, 0.3558762139549001, -0.013841467067343096, 0.10946369477825545, 0.024069404272798824, 0.1943260940189082, 0.037772542605744364, 0.1017035376165862, -0.22108327012100573, 0.07620222606526543, 0.0946235482625968] |
1,803.0022 | Interstellar Scintillation observations for PSR B0355+54 | In this paper, we report our investigation of pulsar scintillation phenomena
by monitoring PSR B0355$+$54 at 2.25 GHz for three successive months using
\emph{Kunming 40-m radio telescope}. We have measured the dynamic spectrum, the
two-dimensional correlation function, and the secondary spectrum. In those
observations with high signal-to-noise ratio ($S/N\ge100$), we have detected
the scintillation arcs, which are rarely observable using such a small
telescope. The sub-microsecond scale width of the scintillation arc indicates
that the transverse scale of structures on scattering screen is as compact as
AU size. Our monitoring has also shown that both the scintillation bandwidth,
timescale, and arc curvature of PSR B0355$+$54 were varying temporally. The
plausible explanation would need to invoke multiple-scattering-screen or
multiple-scattering-structure scenario that different screens or ray paths
dominate the scintillation process at different epochs.
| astro-ph.GA astro-ph.HE | in this paper we report our investigation of pulsar scintillation phenomena by monitoring psr b035554 at 225 ghz for three successive months using emphkunming 40m radio telescope we have measured the dynamic spectrum the twodimensional correlation function and the secondary spectrum in those observations with high signaltonoise ratio snge100 we have detected the scintillation arcs which are rarely observable using such a small telescope the submicrosecond scale width of the scintillation arc indicates that the transverse scale of structures on scattering screen is as compact as au size our monitoring has also shown that both the scintillation bandwidth timescale and arc curvature of psr b035554 were varying temporally the plausible explanation would need to invoke multiplescatteringscreen or multiplescatteringstructure scenario that different screens or ray paths dominate the scintillation process at different epochs | [['in', 'this', 'paper', 'we', 'report', 'our', 'investigation', 'of', 'pulsar', 'scintillation', 'phenomena', 'by', 'monitoring', 'psr', 'b035554', 'at', '225', 'ghz', 'for', 'three', 'successive', 'months', 'using', 'emphkunming', '40m', 'radio', 'telescope', 'we', 'have', 'measured', 'the', 'dynamic', 'spectrum', 'the', 'twodimensional', 'correlation', 'function', 'and', 'the', 'secondary', 'spectrum', 'in', 'those', 'observations', 'with', 'high', 'signaltonoise', 'ratio', 'snge100', 'we', 'have', 'detected', 'the', 'scintillation', 'arcs', 'which', 'are', 'rarely', 'observable', 'using', 'such', 'a', 'small', 'telescope', 'the', 'submicrosecond', 'scale', 'width', 'of', 'the', 'scintillation', 'arc', 'indicates', 'that', 'the', 'transverse', 'scale', 'of', 'structures', 'on', 'scattering', 'screen', 'is', 'as', 'compact', 'as', 'au', 'size', 'our', 'monitoring', 'has', 'also', 'shown', 'that', 'both', 'the', 'scintillation', 'bandwidth', 'timescale', 'and', 'arc', 'curvature', 'of', 'psr', 'b035554', 'were', 'varying', 'temporally', 'the', 'plausible', 'explanation', 'would', 'need', 'to', 'invoke', 'multiplescatteringscreen', 'or', 'multiplescatteringstructure', 'scenario', 'that', 'different', 'screens', 'or', 'ray', 'paths', 'dominate', 'the', 'scintillation', 'process', 'at', 'different', 'epochs']] | [-0.1395478321774135, 0.19524546171123802, -0.08066188331576996, 0.05757464843425453, -0.08618028362980112, -0.12713748771420796, 0.012911542730762449, 0.46309690292400774, -0.20598636137947324, -0.3557442723613349, 0.10973769258453103, -0.2906038001383422, -0.08498007846355904, 0.22052158606493322, -0.0026161087553191464, 0.015087802243215265, 0.07620392686658306, -0.07098165936986334, -0.027453153665192076, -0.1721804973047938, 0.25881031207342176, 0.13365938196147908, 0.24035412663943134, 0.05423327213793527, 0.11789071667953976, -0.019550668641386437, -0.06123728277088958, -0.0015176520173554309, -0.06435556430272982, 0.0029337235218918067, 0.23101861465147522, 0.09396564052804024, 0.15566271832358325, -0.41188655704900157, -0.25813707926135976, 0.08332770978449844, 0.11134719700658025, -0.016049158200075908, -0.014099132907176681, -0.28639493675473204, 0.08917127703534788, -0.17097690729860915, -0.149216270042416, 0.05580808454033104, 0.03108332872216124, 0.05231212491344195, -0.18262397306898492, 0.07654219539631413, -0.020158221195742954, 0.06962032936462492, -0.10683518894529698, -0.0976401108855498, 0.045078029952492216, 0.08545424424846715, 0.05249024258932877, 0.03254851714518736, 0.1360414065202349, -0.06744308249290043, -0.0898636904507839, 0.3433531038972433, -0.0736309055791935, -0.03773949667447596, 0.19643911126968305, -0.23740801719759475, -0.15955237519665388, 0.2162123776433873, 0.18029348579148063, 0.11261707813537214, -0.14348352773231454, -0.013666859723343805, -0.029667297982086893, 0.24245690009411192, 0.10076552017926588, 0.11032342281396268, 0.2667437392519787, 0.15823163175127775, 0.043734414506616304, 0.1100506332322766, -0.29049382906487153, 0.016774130148405675, -0.26199543366510625, -0.09651964019212755, -0.15086430885912705, 0.09757832546711143, -0.10271513049133318, -0.11095730526790248, 0.3953649113100255, 0.10214039280981524, 0.17488919080642518, 0.04207111927189544, 0.3184049063565908, 0.09366672294618184, 0.10028674583736574, 0.05877187482678892, 0.2925189643865451, 0.07445300802100974, 0.1282060869707493, -0.2095498067974404, 0.0928260943346686, -0.034868607221142156] |
1,803.00221 | The inverses of tails of the Riemann zeta function | We present some bounds of the inverses of tails of the Riemann zeta function
on $0 < s < 1$ and compute the integer parts of the inverses of tails of the
Riemann zeta function for $s=\frac{1}{2}, \frac{1}{3}$ and $\frac{1}{4}$.
| math.NT | we present some bounds of the inverses of tails of the riemann zeta function on 0 s 1 and compute the integer parts of the inverses of tails of the riemann zeta function for sfrac12 frac13 and frac14 | [['we', 'present', 'some', 'bounds', 'of', 'the', 'inverses', 'of', 'tails', 'of', 'the', 'riemann', 'zeta', 'function', 'on', '0', 's', '1', 'and', 'compute', 'the', 'integer', 'parts', 'of', 'the', 'inverses', 'of', 'tails', 'of', 'the', 'riemann', 'zeta', 'function', 'for', 'sfrac12', 'frac13', 'and', 'frac14']] | [-0.2584468838023512, 0.08978268349739282, -0.09334505496448592, 0.13091462313834773, -0.025722871240424484, -0.13452993362749877, 0.029471345362253487, 0.2728921423028958, -0.29406073777691316, -0.23397361354804352, 0.11222730418912281, -0.3261715870742735, -0.12867425588008605, 0.15777987485604458, 0.04899963192445667, 0.08324997029022167, -0.05188971045917194, 0.04297690493005671, -0.15165772154241017, -0.26308451852712195, 0.3796695066910041, -0.07653286080121209, 0.030743432892976624, 0.12684730234506883, 0.054571834784981454, -0.01664249298750962, 0.013654986420940412, -0.1256170155186402, -0.23158783681298556, 0.0985701377258489, 0.17812790554997168, 0.06692640555679406, 0.26512425272774537, -0.3941928284046681, -0.11882006411293619, 0.13908357072719618, 0.15790543788553854, -0.1686817169385521, 0.042044575850013644, -0.2316359735559672, 0.14309278017792262, -0.10601375658849352, -0.18371577646681353, -0.026796873217742694, 0.14747265642999033, 0.11220064386725426, -0.30682690686693315, 0.12654699336149192, 0.09697626428188462, 0.03244819001931893, -0.09722497475970733, -0.31503931197680923, 0.028492359027854706, 0.07712174561119785, 0.12996425315443622, 0.041850842743817916, 0.05254782438523283, -0.17597090658780776, -0.0610174628856935, 0.2744097910380285, -0.07449970325749171, -0.22484611342415997, 0.07876827660948038, -0.24955871039511343, -0.13843965667643046, 0.08068472994981628, 0.08717580879793356, 0.23839695085036128, 0.029885211616362397, 0.2134215144753015, -0.056526243147489275, 0.0874651848877731, 0.14049159483003773, -0.016648131667783384, 0.15051991301343629, -0.03091153517169388, 0.05926081489183401, 0.18386442330665886, -0.10888607493038044, -0.010244564496372876, -0.3711317240407592, -0.25500095468994816, -0.24806493726608, 0.08502184493026059, -0.18987198883443948, -0.26026112698692533, 0.4285208412299031, 0.10538412527622361, 0.17670651135574045, 0.24633709054538294, 0.1954560810209889, 0.17435040525895984, 0.012132722345229826, 0.07314880096696709, 0.059128577089531495, 0.1741462772540552, -0.03708525147828225, -0.16809192035151155, 0.06832473783900864, 0.17372831163045607] |
1,803.00222 | Extreme learning machine for reduced order modeling of turbulent
geophysical flows | We investigate the application of artificial neural networks to stabilize
proper orthogonal decomposition based reduced order models for quasi-stationary
geophysical turbulent flows. An extreme learning machine concept is introduced
for computing an eddy-viscosity closure dynamically to incorporate the effects
of the truncated modes. We consider a four-gyre wind-driven ocean circulation
problem as our prototype setting to assess the performance of the proposed
data-driven approach. Our framework provides a significant reduction in
computational time and effectively retains the dynamics of the full-order model
during the forward simulation period beyond the training data set. Furthermore,
we show that the method is robust for larger choices of time steps and can be
used as an efficient and reliable tool for long time integration of general
circulation models.
| physics.flu-dyn physics.comp-ph | we investigate the application of artificial neural networks to stabilize proper orthogonal decomposition based reduced order models for quasistationary geophysical turbulent flows an extreme learning machine concept is introduced for computing an eddyviscosity closure dynamically to incorporate the effects of the truncated modes we consider a fourgyre winddriven ocean circulation problem as our prototype setting to assess the performance of the proposed datadriven approach our framework provides a significant reduction in computational time and effectively retains the dynamics of the fullorder model during the forward simulation period beyond the training data set furthermore we show that the method is robust for larger choices of time steps and can be used as an efficient and reliable tool for long time integration of general circulation models | [['we', 'investigate', 'the', 'application', 'of', 'artificial', 'neural', 'networks', 'to', 'stabilize', 'proper', 'orthogonal', 'decomposition', 'based', 'reduced', 'order', 'models', 'for', 'quasistationary', 'geophysical', 'turbulent', 'flows', 'an', 'extreme', 'learning', 'machine', 'concept', 'is', 'introduced', 'for', 'computing', 'an', 'eddyviscosity', 'closure', 'dynamically', 'to', 'incorporate', 'the', 'effects', 'of', 'the', 'truncated', 'modes', 'we', 'consider', 'a', 'fourgyre', 'winddriven', 'ocean', 'circulation', 'problem', 'as', 'our', 'prototype', 'setting', 'to', 'assess', 'the', 'performance', 'of', 'the', 'proposed', 'datadriven', 'approach', 'our', 'framework', 'provides', 'a', 'significant', 'reduction', 'in', 'computational', 'time', 'and', 'effectively', 'retains', 'the', 'dynamics', 'of', 'the', 'fullorder', 'model', 'during', 'the', 'forward', 'simulation', 'period', 'beyond', 'the', 'training', 'data', 'set', 'furthermore', 'we', 'show', 'that', 'the', 'method', 'is', 'robust', 'for', 'larger', 'choices', 'of', 'time', 'steps', 'and', 'can', 'be', 'used', 'as', 'an', 'efficient', 'and', 'reliable', 'tool', 'for', 'long', 'time', 'integration', 'of', 'general', 'circulation', 'models']] | [-0.08670536982977102, 0.06431912008854616, -0.10419398832375244, 0.08336410927398491, -0.07501112508978094, -0.09150251870854728, 0.015441715642209015, 0.3519927375919877, -0.3009902799592143, -0.29401598612387336, 0.11135416010473555, -0.17620943612306408, -0.1629271432259796, 0.23520822317767587, -0.07447509733854883, 0.0993453141737489, 0.10348432206439846, -0.026827743817721645, -0.031302229407423686, -0.223976572797138, 0.26307676080238795, 0.09712547826160106, 0.31438873462649364, -0.0024879236795729205, 0.13728636588935078, -0.026018467624746865, -0.02959095868737354, -0.002482382120609644, -0.11605364033951651, 0.11142376097831724, 0.24876964734492854, 0.14807511119532488, 0.32860410949891256, -0.47979382792067143, -0.2653481303639109, 0.09347661923158974, 0.14321865403513995, 0.1277749822475016, -0.015212915606811763, -0.2494905513275655, 0.0832885280814803, -0.20533241049176262, -0.13026094882215764, -0.15488994211022322, 0.013209985651736778, -0.03770028197182147, -0.32979166698304097, 0.0509898413128535, 0.06567782080627137, 0.06071180573874904, -0.07378725350774344, -0.08986476564267275, -0.0012332081227683493, 0.13492810026547242, 0.032754661727062005, 0.00786216155956349, 0.11112178879744944, -0.1103432598268433, -0.13017615235988952, 0.38244296964107743, -0.09571780609023277, -0.2199182100293617, 0.1801908709382969, -0.041241672280575, -0.12046518003673203, 0.10639200680288335, 0.25492006565834724, 0.1098826372650482, -0.12745387159896293, 0.02062359393899134, -0.029472272174673214, 0.15021239114444582, -0.008519166320066659, -0.029665971886002337, 0.16769107663252902, 0.27433095553949954, 0.08206876815154007, 0.13799030381356245, -0.13014814883823536, -0.12927956711087796, -0.25682985967385674, -0.14192732431054597, -0.14780116559291678, -0.025890637485821162, -0.11268949561206447, -0.16113648459976238, 0.40625533354919285, 0.20960119967123553, 0.13789173991573345, 0.08455464824803657, 0.3454732340403772, 0.11762825573802524, 0.06909412422347457, 0.1183359804413011, 0.2037200140616586, 0.09903328892804923, 0.11607476899911079, -0.23784370043863273, 0.07773853353465975, 0.054550333031182806] |
1,803.00223 | High-energy transients: thermonuclear (type-I) X-ray bursts | Many distinct classes of high-energy variability have been observed in
astrophysical sources, on a range of timescales. The widest range (spanning
microseconds-decades) is found in accreting, stellar-mass compact objects,
including neutron stars and black holes. Neutron stars are of particular
observational interest, as they exhibit surface effects giving rise to
phenomena (thermonuclear bursts and pulsations) not seen in black holes. Here
we briefly review the present understanding of thermonuclear (type-I) X-ray
bursts. These events are powered by an extensive chain of nuclear reactions,
which are in many cases unique to these environments. Thermonuclear bursts have
been exploited over the last few years as an avenue to measure the neutron star
mass and radius, although the contribution of systematic errors to these
measurements remains contentious. We describe recent efforts to better match
burst models to observations, with a view to resolving some of the
astrophysical uncertainties related to these events. These efforts have good
prospects for providing complementary information to nuclear experiments.
| astro-ph.HE | many distinct classes of highenergy variability have been observed in astrophysical sources on a range of timescales the widest range spanning microsecondsdecades is found in accreting stellarmass compact objects including neutron stars and black holes neutron stars are of particular observational interest as they exhibit surface effects giving rise to phenomena thermonuclear bursts and pulsations not seen in black holes here we briefly review the present understanding of thermonuclear typei xray bursts these events are powered by an extensive chain of nuclear reactions which are in many cases unique to these environments thermonuclear bursts have been exploited over the last few years as an avenue to measure the neutron star mass and radius although the contribution of systematic errors to these measurements remains contentious we describe recent efforts to better match burst models to observations with a view to resolving some of the astrophysical uncertainties related to these events these efforts have good prospects for providing complementary information to nuclear experiments | [['many', 'distinct', 'classes', 'of', 'highenergy', 'variability', 'have', 'been', 'observed', 'in', 'astrophysical', 'sources', 'on', 'a', 'range', 'of', 'timescales', 'the', 'widest', 'range', 'spanning', 'microsecondsdecades', 'is', 'found', 'in', 'accreting', 'stellarmass', 'compact', 'objects', 'including', 'neutron', 'stars', 'and', 'black', 'holes', 'neutron', 'stars', 'are', 'of', 'particular', 'observational', 'interest', 'as', 'they', 'exhibit', 'surface', 'effects', 'giving', 'rise', 'to', 'phenomena', 'thermonuclear', 'bursts', 'and', 'pulsations', 'not', 'seen', 'in', 'black', 'holes', 'here', 'we', 'briefly', 'review', 'the', 'present', 'understanding', 'of', 'thermonuclear', 'typei', 'xray', 'bursts', 'these', 'events', 'are', 'powered', 'by', 'an', 'extensive', 'chain', 'of', 'nuclear', 'reactions', 'which', 'are', 'in', 'many', 'cases', 'unique', 'to', 'these', 'environments', 'thermonuclear', 'bursts', 'have', 'been', 'exploited', 'over', 'the', 'last', 'few', 'years', 'as', 'an', 'avenue', 'to', 'measure', 'the', 'neutron', 'star', 'mass', 'and', 'radius', 'although', 'the', 'contribution', 'of', 'systematic', 'errors', 'to', 'these', 'measurements', 'remains', 'contentious', 'we', 'describe', 'recent', 'efforts', 'to', 'better', 'match', 'burst', 'models', 'to', 'observations', 'with', 'a', 'view', 'to', 'resolving', 'some', 'of', 'the', 'astrophysical', 'uncertainties', 'related', 'to', 'these', 'events', 'these', 'efforts', 'have', 'good', 'prospects', 'for', 'providing', 'complementary', 'information', 'to', 'nuclear', 'experiments']] | [-0.06961392803059425, 0.1578431828836983, -0.037806509074289354, 0.1513515143575205, -0.1371461360482499, -0.0660082461195998, 0.04961097476043506, 0.43131188267143444, -0.19450333607237552, -0.36994165153009817, 0.09303944423991198, -0.334396782758995, -0.04334294336149469, 0.3110030502488371, -0.06510498113639188, 0.04355007059930358, 0.09507548676028818, -0.03470013361875317, -0.08129420160330483, -0.24003216781566153, 0.3117388975151698, 0.10457833364343969, 0.17157288717025948, 0.019724138459423557, 0.040807304671761815, -0.1184873854770558, -0.07675555146706756, -0.0178640420380475, -0.16687417845241725, 0.05559375296579674, 0.34303157659262523, 0.14058101380360313, 0.19736901283613406, -0.44551656717667354, -0.3177312637330033, 0.12643347308330705, 0.15728332635189873, 0.0808902302167553, -0.12079590289868065, -0.25974396312376485, 0.067420472480444, -0.23378105819538178, -0.10601226349535864, -0.056562833014322675, 0.10372262158780358, 0.07081893814829528, -0.16268067677738146, 0.07104776302003302, 0.051517231835168785, 0.009730442852014676, -0.09758368649563635, -0.09800591812690981, 0.0552383269648999, 0.12496158100839239, 0.13758794824680082, 0.026244193265301873, 0.1527953430166235, -0.1324863990332233, -0.13545904284110294, 0.37926874910481273, 0.011597626710135955, -0.0216230301593896, 0.25735265864641405, -0.21632585824409034, -0.21138035891053733, 0.1581038424395956, 0.186514084556984, 0.14692620761634317, -0.19300312669947745, -0.03106910236638214, 0.010334209303982789, 0.15517442753189242, 0.045315071038203314, 0.13615649597486482, 0.3740551185212098, 0.19393260029100928, -0.03902159683202626, 0.046865119264111854, -0.17433941763156327, -0.03409750833816361, -0.2518511674439651, -0.04187420896196272, -0.07658459245431004, 0.1113241120053317, -0.02913231437532886, -0.14960263482316805, 0.35145991162130485, 0.1074651445253096, 0.17919513120723424, -0.04336801627723617, 0.21209853191635375, 0.05171901284084015, 0.06199391186892171, 0.06945272619777824, 0.32799640579996775, 0.18053194276144496, 0.09154412551943096, -0.18429748102498705, 0.07635572469807812, -0.028305776522029192] |
1,803.00224 | Measure density and Embeddings of Haj{\l}asz-Besov and
Haj{\l}asz-Triebel-Lizorkin spaces | In this paper, we investigate the relation between Sobolev-type embeddings of
Haj{\l}asz-Besov spaces (and also Haj{\l}asz-Triebel-Lizorkin spaces) defined
on a metric measure space $(X,d,\mu)$ and lower bound for the measure $\mu.$ We
prove that if the measure $\mu$ satisfies $\mu(B(x,r))\geq cr^Q$ for some $Q>0$
and for any ball $B(x,r)\subset X,$ then the Sobolev-type embeddings hold on
balls for both these spaces. On the other hand, if the Sobolev-type embeddings
hold in a domain $\Omega\subset X,$ then we prove that the domain $\Omega$
satisfies the so-called measure density condition, i.e.,
$\mu(B(x,r)\cap\Omega)\geq cr^Q$ holds for any ball $B(x,r)\subset X,$ where
$X=(X,d,\mu)$ is an Ahlfors $Q$-regular and geodesic metric measure space.
| math.FA | in this paper we investigate the relation between sobolevtype embeddings of hajlaszbesov spaces and also hajlasztriebellizorkin spaces defined on a metric measure space xdmu and lower bound for the measure mu we prove that if the measure mu satisfies mubxrgeq crq for some q0 and for any ball bxrsubset x then the sobolevtype embeddings hold on balls for both these spaces on the other hand if the sobolevtype embeddings hold in a domain omegasubset x then we prove that the domain omega satisfies the socalled measure density condition ie mubxrcapomegageq crq holds for any ball bxrsubset x where xxdmu is an ahlfors qregular and geodesic metric measure space | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'relation', 'between', 'sobolevtype', 'embeddings', 'of', 'hajlaszbesov', 'spaces', 'and', 'also', 'hajlasztriebellizorkin', 'spaces', 'defined', 'on', 'a', 'metric', 'measure', 'space', 'xdmu', 'and', 'lower', 'bound', 'for', 'the', 'measure', 'mu', 'we', 'prove', 'that', 'if', 'the', 'measure', 'mu', 'satisfies', 'mubxrgeq', 'crq', 'for', 'some', 'q0', 'and', 'for', 'any', 'ball', 'bxrsubset', 'x', 'then', 'the', 'sobolevtype', 'embeddings', 'hold', 'on', 'balls', 'for', 'both', 'these', 'spaces', 'on', 'the', 'other', 'hand', 'if', 'the', 'sobolevtype', 'embeddings', 'hold', 'in', 'a', 'domain', 'omegasubset', 'x', 'then', 'we', 'prove', 'that', 'the', 'domain', 'omega', 'satisfies', 'the', 'socalled', 'measure', 'density', 'condition', 'ie', 'mubxrcapomegageq', 'crq', 'holds', 'for', 'any', 'ball', 'bxrsubset', 'x', 'where', 'xxdmu', 'is', 'an', 'ahlfors', 'qregular', 'and', 'geodesic', 'metric', 'measure', 'space']] | [-0.12057948606532244, 0.09666977947081683, -0.09277028866289627, 0.13950056256061152, -0.07620211191741484, -0.11474468484520912, 0.04036745139109414, 0.398211592732973, -0.2836641607273902, -0.13630476923038562, 0.13367345949767956, -0.3168343602369229, -0.08160674701489154, 0.20056532680700045, -0.14137426699799974, 0.01976097084448806, 0.03207608097277227, 0.11577788496035196, -0.11733278479161006, -0.2319662127022942, 0.4557550575761568, -0.12101198846385593, 0.2690307833609127, 0.09955165833234787, 0.15010056124467935, 0.003180573650059246, 0.04313225294241593, 0.018779562426442725, -0.2931455332837123, 0.123931248244896, 0.17240548421229634, 0.14446915842237926, 0.24580070293907608, -0.3084814738304842, -0.1973629267642363, 0.2665579952565687, 0.08116680682370706, -0.12396582161918993, -0.019229421787895263, -0.33473465861309143, 0.1325401368462259, -0.0401736587640785, -0.12673202328650016, -0.09250900360001695, 0.10181401308093752, 0.03328780106135777, -0.3092634736427239, 0.008047036646721175, 0.15821557009503956, -0.013593894296458789, -0.1381275484737541, -0.07067358169172491, -0.009192188909011228, 0.08674817823339254, -0.019030550470398297, 0.1834947373895418, 0.06229495552058021, -0.021788286220371014, -0.046295191245597035, 0.3519515841312352, -0.11005079628500555, -0.33598251027010734, 0.0985276826668442, -0.25914158534613396, -0.16403312164225747, -0.026688001806005127, 0.15236384533789185, 0.14682359443533988, -0.057840150435056005, 0.22093135468617436, -0.08278557793569884, 0.12866238550327364, 0.15537965743846838, 0.08518941681832075, 0.06663814297478114, 0.0895297928136729, 0.21045832389167377, 0.12432291500680592, -0.03697630762610407, 0.015020944607732374, -0.3568594993491258, -0.23309226923766324, -0.19779953994300395, 0.07979064302385917, -0.17872998847881155, -0.16356839514559224, 0.2335185379055994, 0.047768585091190675, 0.20802437333124024, 0.15870284750902405, 0.18382096833416395, 0.06041996416946252, -0.02573595550133004, 0.1219343393952364, 0.13228301969717168, 0.1270831585639999, 0.022298698510885947, -0.10975706534282792, 0.020370299803713958, 0.1647610788034009] |
1,803.00225 | Global Convergence of Block Coordinate Descent in Deep Learning | Deep learning has aroused extensive attention due to its great empirical
success. The efficiency of the block coordinate descent (BCD) methods has been
recently demonstrated in deep neural network (DNN) training. However,
theoretical studies on their convergence properties are limited due to the
highly nonconvex nature of DNN training. In this paper, we aim at providing a
general methodology for provable convergence guarantees for this type of
methods. In particular, for most of the commonly used DNN training models
involving both two- and three-splitting schemes, we establish the global
convergence to a critical point at a rate of ${\cal O}(1/k)$, where $k$ is the
number of iterations. The results extend to general loss functions which have
Lipschitz continuous gradients and deep residual networks (ResNets). Our key
development adds several new elements to the Kurdyka-{\L}ojasiewicz inequality
framework that enables us to carry out the global convergence analysis of BCD
in the general scenario of deep learning.
| math.OC cs.LG stat.ML | deep learning has aroused extensive attention due to its great empirical success the efficiency of the block coordinate descent bcd methods has been recently demonstrated in deep neural network dnn training however theoretical studies on their convergence properties are limited due to the highly nonconvex nature of dnn training in this paper we aim at providing a general methodology for provable convergence guarantees for this type of methods in particular for most of the commonly used dnn training models involving both two and threesplitting schemes we establish the global convergence to a critical point at a rate of cal o1k where k is the number of iterations the results extend to general loss functions which have lipschitz continuous gradients and deep residual networks resnets our key development adds several new elements to the kurdykalojasiewicz inequality framework that enables us to carry out the global convergence analysis of bcd in the general scenario of deep learning | [['deep', 'learning', 'has', 'aroused', 'extensive', 'attention', 'due', 'to', 'its', 'great', 'empirical', 'success', 'the', 'efficiency', 'of', 'the', 'block', 'coordinate', 'descent', 'bcd', 'methods', 'has', 'been', 'recently', 'demonstrated', 'in', 'deep', 'neural', 'network', 'dnn', 'training', 'however', 'theoretical', 'studies', 'on', 'their', 'convergence', 'properties', 'are', 'limited', 'due', 'to', 'the', 'highly', 'nonconvex', 'nature', 'of', 'dnn', 'training', 'in', 'this', 'paper', 'we', 'aim', 'at', 'providing', 'a', 'general', 'methodology', 'for', 'provable', 'convergence', 'guarantees', 'for', 'this', 'type', 'of', 'methods', 'in', 'particular', 'for', 'most', 'of', 'the', 'commonly', 'used', 'dnn', 'training', 'models', 'involving', 'both', 'two', 'and', 'threesplitting', 'schemes', 'we', 'establish', 'the', 'global', 'convergence', 'to', 'a', 'critical', 'point', 'at', 'a', 'rate', 'of', 'cal', 'o1k', 'where', 'k', 'is', 'the', 'number', 'of', 'iterations', 'the', 'results', 'extend', 'to', 'general', 'loss', 'functions', 'which', 'have', 'lipschitz', 'continuous', 'gradients', 'and', 'deep', 'residual', 'networks', 'resnets', 'our', 'key', 'development', 'adds', 'several', 'new', 'elements', 'to', 'the', 'kurdykalojasiewicz', 'inequality', 'framework', 'that', 'enables', 'us', 'to', 'carry', 'out', 'the', 'global', 'convergence', 'analysis', 'of', 'bcd', 'in', 'the', 'general', 'scenario', 'of', 'deep', 'learning']] | [-0.06692059770492571, -0.05927427516730091, -0.08592965513129126, 0.06358402182707902, -0.07389842181363712, -0.15721232116875516, 0.05781958287342923, 0.42029327601678185, -0.268565177709596, -0.2610490150423116, 0.09762790501223538, -0.2305069805618811, -0.19293399968006128, 0.19687116744946204, -0.12487896005078764, 0.1397102863452996, 0.08451079851917487, 0.004673880667806688, -0.10575487468899651, -0.3356486543492934, 0.2813764725246334, 0.07151637498407273, 0.34036478867252395, 0.03699556249949791, 0.11077628373591737, -0.06221199811545092, -0.00665941790302659, -0.0209367522378694, -0.0835923660207217, 0.19592441963304028, 0.2738996101009658, 0.19857899146910465, 0.40923979319632053, -0.4279179083812353, -0.2349868991242891, 0.1615225126688647, 0.1742837914188586, 0.101915073432119, -0.07905405316299263, -0.25627135897210995, 0.12540437354760656, -0.14190358189599855, -0.05529958142312365, -0.16508599700007057, -0.026612112540509793, 0.04601067676762264, -0.3134757150539088, 0.025267329274120367, 0.09847592238893176, 0.07484691342121208, -0.01944002478123437, -0.12426811620342097, 0.038513839757372326, 0.11087016298665435, 0.09680530933932364, 0.07143028391307438, 0.09883372961882163, -0.1438677582145947, -0.09063865574887144, 0.3151151863434775, -0.03214646011512339, -0.16955920597901206, 0.23807102185522824, -0.05544444079686246, -0.20562403461315318, 0.12668026303993418, 0.26486327402655024, 0.14663588535040617, -0.16404147582225403, 0.0817284994122161, -0.01908624072426132, 0.1120011131984088, 0.005320811311581305, 0.03196640621966005, 0.11790028061451656, 0.24482925689333027, 0.0937555172169194, 0.13184631885749035, -0.09692291398275668, -0.12899872871393991, -0.2489205348885969, -0.11178576917986252, -0.17731922109877424, 0.0009595344951315843, -0.11293407727630851, -0.12632609073483905, 0.40240113080975104, 0.1728407957745329, 0.19182308073845003, 0.12991354959886883, 0.3082786280806963, 0.07624832046438952, 0.12006361895186415, 0.10323214788268043, 0.2790338811041279, 0.14959643585244556, 0.1299816351686302, -0.19733138927167837, 0.10073665930139651, 0.09020616434206098] |
1,803.00226 | Simulating the cloudy atmospheres of HD 209458 b and HD 189733 b with
the 3D Met Office Unified Model | To understand and compare the 3D atmospheric structure of HD 209458 b and HD
189733 b, focusing on the formation and distribution of cloud particles, as
well as their feedback on the dynamics and thermal profile. We couple the 3D
Met Office Unified Model (UM), including detailed treatments of atmospheric
radiative transfer and dynamics, to a kinetic cloud formation scheme. The
resulting model self--consistently solves for the formation of condensation
seeds, surface growth and evaporation, gravitational settling and advection,
cloud radiative feedback via absorption and, crucially, scattering. Fluxes
directly obtained from the UM are used to produce synthetic SEDs and phase
curves. Our simulations show extensive cloud formation in both planets,
however, cooler temperatures in the HD 189733 b result in higher cloud particle
number densities. Sub-micron particles are suspended by vertical flows leading
to extensive upper-atmosphere cloud cover. A combination of meridional
advection and efficient cloud formation in cooler high latitude regions, result
in enhanced cloud coverage for latitudes > 30 degrees and leads to a zonally
banded structure for all our simulations. The cloud bands extend around the
entire planet(s), as the temperatures, even on the day side, remain below the
condensation temperature of silicates and oxides. Therefore, our simulated
optical phase curve for HD 209458 b shows no `offset', in contrast to
observations. Efficient scattering by cloud results an atmospheric cooling of
up to 250K, and an advection-driven fluctuating cloud opacity causes temporal
variability in the thermal emission. The inclusion of this fundamental
cloud-atmosphere radiative feedback leads to significant differences with
approaches neglecting these physical elements and suggests both a note of
caution of interpretations neglecting such cloud feedback and scattering, and
merits further study.
| astro-ph.EP | to understand and compare the 3d atmospheric structure of hd 209458 b and hd 189733 b focusing on the formation and distribution of cloud particles as well as their feedback on the dynamics and thermal profile we couple the 3d met office unified model um including detailed treatments of atmospheric radiative transfer and dynamics to a kinetic cloud formation scheme the resulting model selfconsistently solves for the formation of condensation seeds surface growth and evaporation gravitational settling and advection cloud radiative feedback via absorption and crucially scattering fluxes directly obtained from the um are used to produce synthetic seds and phase curves our simulations show extensive cloud formation in both planets however cooler temperatures in the hd 189733 b result in higher cloud particle number densities submicron particles are suspended by vertical flows leading to extensive upperatmosphere cloud cover a combination of meridional advection and efficient cloud formation in cooler high latitude regions result in enhanced cloud coverage for latitudes 30 degrees and leads to a zonally banded structure for all our simulations the cloud bands extend around the entire planets as the temperatures even on the day side remain below the condensation temperature of silicates and oxides therefore our simulated optical phase curve for hd 209458 b shows no offset in contrast to observations efficient scattering by cloud results an atmospheric cooling of up to 250k and an advectiondriven fluctuating cloud opacity causes temporal variability in the thermal emission the inclusion of this fundamental cloudatmosphere radiative feedback leads to significant differences with approaches neglecting these physical elements and suggests both a note of caution of interpretations neglecting such cloud feedback and scattering and merits further study | [['to', 'understand', 'and', 'compare', 'the', '3d', 'atmospheric', 'structure', 'of', 'hd', '209458', 'b', 'and', 'hd', '189733', 'b', 'focusing', 'on', 'the', 'formation', 'and', 'distribution', 'of', 'cloud', 'particles', 'as', 'well', 'as', 'their', 'feedback', 'on', 'the', 'dynamics', 'and', 'thermal', 'profile', 'we', 'couple', 'the', '3d', 'met', 'office', 'unified', 'model', 'um', 'including', 'detailed', 'treatments', 'of', 'atmospheric', 'radiative', 'transfer', 'and', 'dynamics', 'to', 'a', 'kinetic', 'cloud', 'formation', 'scheme', 'the', 'resulting', 'model', 'selfconsistently', 'solves', 'for', 'the', 'formation', 'of', 'condensation', 'seeds', 'surface', 'growth', 'and', 'evaporation', 'gravitational', 'settling', 'and', 'advection', 'cloud', 'radiative', 'feedback', 'via', 'absorption', 'and', 'crucially', 'scattering', 'fluxes', 'directly', 'obtained', 'from', 'the', 'um', 'are', 'used', 'to', 'produce', 'synthetic', 'seds', 'and', 'phase', 'curves', 'our', 'simulations', 'show', 'extensive', 'cloud', 'formation', 'in', 'both', 'planets', 'however', 'cooler', 'temperatures', 'in', 'the', 'hd', '189733', 'b', 'result', 'in', 'higher', 'cloud', 'particle', 'number', 'densities', 'submicron', 'particles', 'are', 'suspended', 'by', 'vertical', 'flows', 'leading', 'to', 'extensive', 'upperatmosphere', 'cloud', 'cover', 'a', 'combination', 'of', 'meridional', 'advection', 'and', 'efficient', 'cloud', 'formation', 'in', 'cooler', 'high', 'latitude', 'regions', 'result', 'in', 'enhanced', 'cloud', 'coverage', 'for', 'latitudes', '30', 'degrees', 'and', 'leads', 'to', 'a', 'zonally', 'banded', 'structure', 'for', 'all', 'our', 'simulations', 'the', 'cloud', 'bands', 'extend', 'around', 'the', 'entire', 'planets', 'as', 'the', 'temperatures', 'even', 'on', 'the', 'day', 'side', 'remain', 'below', 'the', 'condensation', 'temperature', 'of', 'silicates', 'and', 'oxides', 'therefore', 'our', 'simulated', 'optical', 'phase', 'curve', 'for', 'hd', '209458', 'b', 'shows', 'no', 'offset', 'in', 'contrast', 'to', 'observations', 'efficient', 'scattering', 'by', 'cloud', 'results', 'an', 'atmospheric', 'cooling', 'of', 'up', 'to', '250k', 'and', 'an', 'advectiondriven', 'fluctuating', 'cloud', 'opacity', 'causes', 'temporal', 'variability', 'in', 'the', 'thermal', 'emission', 'the', 'inclusion', 'of', 'this', 'fundamental', 'cloudatmosphere', 'radiative', 'feedback', 'leads', 'to', 'significant', 'differences', 'with', 'approaches', 'neglecting', 'these', 'physical', 'elements', 'and', 'suggests', 'both', 'a', 'note', 'of', 'caution', 'of', 'interpretations', 'neglecting', 'such', 'cloud', 'feedback', 'and', 'scattering', 'and', 'merits', 'further', 'study']] | [-0.09761458612745627, 0.13747839360974137, -0.04039061506956138, 0.05327705413314768, -0.02886423703198406, -0.08099826621569016, 0.07370434158989651, 0.3926034374044023, -0.231885593555529, -0.3520535131374543, 0.07515411894472146, -0.2676925587925044, -0.06015365210319446, 0.17468559965321964, -0.0237693638371473, 0.009976651396771724, 0.07106112167916515, -0.11026098148177632, 0.005194275739433413, -0.20071452093522318, 0.2869681983690878, 0.10634873242286796, 0.19993414268574933, 0.08538437941280956, 0.0177771338917823, -0.08397347853434357, -0.06159863117743622, -0.03804542840204456, -0.14430301118557426, 0.040724619345062156, 0.1814465546099977, 0.07951700303364884, 0.1503543707118793, -0.440750573545017, -0.2920661528950388, 0.03203284711407667, 0.17556750611148098, 0.05870656841349873, -0.07269173726100814, -0.2091816670820117, 0.024415863122452388, -0.17541961830998348, -0.13981631594456054, -0.025188248193907466, 0.04385222296992486, -0.00685548136293867, -0.29706291977527804, 0.08928688014984469, 0.026071974303234706, 0.11411836876957254, -0.1351035484485328, -0.12165356439792296, -0.104222072488205, 0.10748761793513867, -0.010919750140641223, 0.021153462736613372, 0.20411941381298343, -0.14911384259181268, -0.02813765331023288, 0.4379861520095305, -0.10316629773005843, -0.07289389540187337, 0.2726865588399497, -0.17907157102853738, -0.08654939868572083, 0.2102398868430067, 0.1896790655604987, 0.11765132424823771, -0.12562545533588326, -0.001259014507840303, -0.012575783832845362, 0.1644471722028472, 0.06017722244289788, 0.03941224907482551, 0.3082107605361803, 0.14258088084530424, 0.013933476356958801, 0.1101628989027813, -0.18433729160661724, -0.13423563627526164, -0.20375723990019073, -0.13416168344969098, -0.09800695761657235, 0.03808524364944209, -0.11306813884103163, -0.14192587255330927, 0.32074446493213393, 0.17499439883045853, 0.19795728352852165, 0.022726081892509353, 0.3734871473078701, 0.06121151710310104, 0.07324129676888168, 0.12369489758698778, 0.24320605160668493, 0.1536200150788169, 0.14552790338173507, -0.30239806953224946, 0.055985968490025365, -0.009781699702990325] |
1,803.00227 | WRPN & Apprentice: Methods for Training and Inference using
Low-Precision Numerics | Today's high performance deep learning architectures involve large models
with numerous parameters. Low precision numerics has emerged as a popular
technique to reduce both the compute and memory requirements of these large
models. However, lowering precision often leads to accuracy degradation. We
describe three schemes whereby one can both train and do efficient inference
using low precision numerics without hurting accuracy. Finally, we describe an
efficient hardware accelerator that can take advantage of the proposed low
precision numerics.
| cs.CV cs.LG cs.NE | todays high performance deep learning architectures involve large models with numerous parameters low precision numerics has emerged as a popular technique to reduce both the compute and memory requirements of these large models however lowering precision often leads to accuracy degradation we describe three schemes whereby one can both train and do efficient inference using low precision numerics without hurting accuracy finally we describe an efficient hardware accelerator that can take advantage of the proposed low precision numerics | [['todays', 'high', 'performance', 'deep', 'learning', 'architectures', 'involve', 'large', 'models', 'with', 'numerous', 'parameters', 'low', 'precision', 'numerics', 'has', 'emerged', 'as', 'a', 'popular', 'technique', 'to', 'reduce', 'both', 'the', 'compute', 'and', 'memory', 'requirements', 'of', 'these', 'large', 'models', 'however', 'lowering', 'precision', 'often', 'leads', 'to', 'accuracy', 'degradation', 'we', 'describe', 'three', 'schemes', 'whereby', 'one', 'can', 'both', 'train', 'and', 'do', 'efficient', 'inference', 'using', 'low', 'precision', 'numerics', 'without', 'hurting', 'accuracy', 'finally', 'we', 'describe', 'an', 'efficient', 'hardware', 'accelerator', 'that', 'can', 'take', 'advantage', 'of', 'the', 'proposed', 'low', 'precision', 'numerics']] | [-0.08508111599785013, 0.053819515797770764, -0.036656833573196754, 0.08307278582838197, -0.11290560996768853, -0.22249781460357973, 0.02172116422577976, 0.4342872952379716, -0.2356317930210095, -0.42737310379743576, 0.1336022235142688, -0.20928598448144606, -0.11547752448286001, 0.24370014006182408, -0.1091230432711876, 0.13018019820969456, 0.15254748900994086, -0.008622403899817773, -0.12844426745775706, -0.2917082710699059, 0.187979044046444, 0.14342456509751708, 0.37719831198979265, 0.05633762891953572, 0.15081642826016134, -0.05355682569102217, -0.004647877676269183, -0.016994153638967335, -0.046424003160213126, 0.1467811921492028, 0.2981926080639637, 0.1577834349889786, 0.3283351902396251, -0.48524073105400956, -0.2208894089771769, 0.1019301988506833, 0.1901280652397336, 0.14792268656385252, -0.06900924884785826, -0.2092523904493413, 0.09981616084368373, -0.2318616526034207, -0.08451813734614123, -0.27273487262666607, -0.06785591136968623, 0.013739568615654627, -0.24663779163995805, 0.025327009375756368, 0.0015818068506912543, 0.04243560431477351, 0.026115928913872592, -0.16282492751578012, 0.057365171557578906, 0.16368516658743223, -0.003163832060706157, 0.006030672068636005, 0.11417888428490514, -0.1905788958001022, -0.14971668896480247, 0.34367096625889343, -0.08150452607421754, -0.1974964325841612, 0.2783111678197598, -0.05404873742745855, -0.15426992017250413, 0.13201034114433405, 0.25441346169473267, 0.04879059416886706, -0.09888478550009239, 0.07306273139152043, 0.09553220564833818, 0.20247300987681136, 0.024514331980847206, 0.04620308933469156, 0.162802264562999, 0.24377576493395445, 0.004325698458183653, 0.06382604774374229, -0.1294814106494857, -0.07919528072652145, -0.17702297960670713, -0.1040007093658623, -0.15219369091881582, -0.012404016905631393, -0.14516345267027367, -0.12230088025068817, 0.3321012631775095, 0.24378984702679402, 0.20754282427832293, 0.11320011269372816, 0.39101012411694497, 0.10883904908013602, 0.13387387407680926, 0.08130765054374933, 0.23866857797241744, 0.02997513102272, 0.11473770100527848, -0.20189221870775023, 0.07074845273596927, -0.01621230164518914] |
1,803.00228 | Multilinear representations of Free PROs | We describe a structure of PRO on hypermatrices. This structure allows us to
define multilinear representations of PROs and in particular of free Pros. As
an example of applications, we investigate the relations of the representations
of Pros with the theory of automata.
| math.RT math.CO math.CT | we describe a structure of pro on hypermatrices this structure allows us to define multilinear representations of pros and in particular of free pros as an example of applications we investigate the relations of the representations of pros with the theory of automata | [['we', 'describe', 'a', 'structure', 'of', 'pro', 'on', 'hypermatrices', 'this', 'structure', 'allows', 'us', 'to', 'define', 'multilinear', 'representations', 'of', 'pros', 'and', 'in', 'particular', 'of', 'free', 'pros', 'as', 'an', 'example', 'of', 'applications', 'we', 'investigate', 'the', 'relations', 'of', 'the', 'representations', 'of', 'pros', 'with', 'the', 'theory', 'of', 'automata']] | [-0.09222531490850934, 0.04499613583868987, -0.10891228603459029, 0.07561464970227504, -0.11707347406204356, -0.03222070483837363, 0.046326267259563646, 0.40502408636344034, -0.33272051022842875, -0.2223461253438578, 0.07849720595566946, -0.2595548717752451, -0.1981439833897491, 0.1800318245104579, -0.08910823182397803, -0.01929488041719725, -0.0008572686550229095, 0.09454161002365656, -0.15698776781818893, -0.22119363526228902, 0.3905487923536363, 0.04539802222144465, 0.2636361313160769, 0.04836329479896745, 0.14791637548613687, 0.05144319788357893, -0.06934501559928406, -0.0032372932101404944, -0.17369875968109036, 0.2427366252468769, 0.2600535934054574, 0.18739051520174674, 0.2734517845823321, -0.43497928231954575, -0.156989676184779, 0.08513397186301476, 0.09113319358940042, 0.057950013122239775, -0.020183270334179493, -0.2693003854216185, 0.12410842053332301, -0.2482811621455259, -0.1226568391741535, -0.1477120407142265, 0.028564545975694824, 0.04147747425405785, -0.2048560292920271, -0.015986504845407812, 0.05541079712295255, 0.08544113889856395, -0.08998102183740717, -0.09735916628567286, 0.04452331747513178, 0.17758893781493224, -0.006179575288538323, -0.11613709131948823, 0.05689136820390474, -0.17270323080227298, -0.21179367424270443, 0.38945377479458965, -0.020643707191528277, -0.18989578669154367, 0.21644881166257832, -0.07090543201842973, -0.1671053787130256, -0.022378230120900067, 0.1819561378553856, 0.10308549827138005, -0.07789281820932534, 0.16073930625083618, -0.05250892944114153, 0.13076881164966456, 0.048971949356369844, 0.052450823662585994, 0.15480089947841194, 0.16514806739097937, 0.0466395336918013, 0.21898439699827238, -0.052243898422348986, -0.06697804977857442, -0.3015754161792439, -0.2209594810034993, -0.06592708696654542, 0.023964836673681125, -0.0845947635226726, -0.21477090905225554, 0.47686112804208386, 0.22190042071824156, 0.20476255778136643, 0.06446870368753754, 0.21316877734674097, 0.08128300937011751, 0.029340517837121043, -0.012108923250072918, 0.0761814558293757, 0.23697145533379774, 0.027372329246772582, -0.18642415223253328, 0.006213842317202064, 0.1144636326014649] |
1,803.00229 | Magnetic moments of the spin-$1\over 2$ singly charmed baryons in chiral
perturbation theory | We systematically derive the analytical expressions of the magnetic moments
of the spin-$1\over 2$ singly charmed baryons to the next-to-next-to-leading
order in the heavy baryon chiral perturbation theory (HBChPT). We discuss the
analytical relations between the magnetic moments. We estimate the-low energy
constants (LECs) in two scenarios. In the first scenario, we use the quark
model and Lattice QCD simulation results as input. In the second scenario, the
heavy quark symmetry is adopted to reduce the number of the independent LECs,
which are then fitted using the data from the Lattice QCD simulations. We give
the numerical results to the next-to-leading order for the antitriplet charmed
baryons and to the next-to-next-to-leading order for the sextet states.
| hep-ph hep-ex hep-lat | we systematically derive the analytical expressions of the magnetic moments of the spin1over 2 singly charmed baryons to the nexttonexttoleading order in the heavy baryon chiral perturbation theory hbchpt we discuss the analytical relations between the magnetic moments we estimate thelow energy constants lecs in two scenarios in the first scenario we use the quark model and lattice qcd simulation results as input in the second scenario the heavy quark symmetry is adopted to reduce the number of the independent lecs which are then fitted using the data from the lattice qcd simulations we give the numerical results to the nexttoleading order for the antitriplet charmed baryons and to the nexttonexttoleading order for the sextet states | [['we', 'systematically', 'derive', 'the', 'analytical', 'expressions', 'of', 'the', 'magnetic', 'moments', 'of', 'the', 'spin1over', '2', 'singly', 'charmed', 'baryons', 'to', 'the', 'nexttonexttoleading', 'order', 'in', 'the', 'heavy', 'baryon', 'chiral', 'perturbation', 'theory', 'hbchpt', 'we', 'discuss', 'the', 'analytical', 'relations', 'between', 'the', 'magnetic', 'moments', 'we', 'estimate', 'thelow', 'energy', 'constants', 'lecs', 'in', 'two', 'scenarios', 'in', 'the', 'first', 'scenario', 'we', 'use', 'the', 'quark', 'model', 'and', 'lattice', 'qcd', 'simulation', 'results', 'as', 'input', 'in', 'the', 'second', 'scenario', 'the', 'heavy', 'quark', 'symmetry', 'is', 'adopted', 'to', 'reduce', 'the', 'number', 'of', 'the', 'independent', 'lecs', 'which', 'are', 'then', 'fitted', 'using', 'the', 'data', 'from', 'the', 'lattice', 'qcd', 'simulations', 'we', 'give', 'the', 'numerical', 'results', 'to', 'the', 'nexttoleading', 'order', 'for', 'the', 'antitriplet', 'charmed', 'baryons', 'and', 'to', 'the', 'nexttonexttoleading', 'order', 'for', 'the', 'sextet', 'states']] | [-0.10141032044370861, 0.18647780858952065, -0.06788800868570156, 0.12487530730684976, -0.0500212088960562, -0.026670804846545923, 0.080054803276637, 0.32658829066254524, -0.1853543432166233, -0.27238451150934334, 5.598812485518663e-05, -0.35324661769782717, -0.017329789056827354, 0.0483590068012152, 0.11827217282160468, 0.11350428122298226, -0.017570381275499643, 0.061170539146532185, -0.07313137351251815, -0.26088769677216594, 0.3251507639358549, -0.0030532291159033774, 0.19545533415739952, 0.14934104529168943, 0.007286669703645875, -0.020303235079526253, -0.01673345515585464, -0.08741743924177212, -0.17751054825747142, 0.11093422618805958, 0.20049512145494153, 0.005743844352052648, 0.1180326526782111, -0.4440272729843855, -0.126606456886815, 0.08480045272280341, 0.1536753634152853, 0.22901805671154643, -0.04515533844899872, -0.2818902119062841, 0.13547634280732143, -0.22631676237544288, -0.18116750051469907, -0.17736512258162965, -0.06981626124647648, 0.0013430920793958332, -0.3596257849191518, 0.09511742721433225, -0.06548127671298773, 0.010883762954693774, -0.053307679182161456, -0.19705874666612108, -0.03991720349244449, 0.09992088538736267, 0.1332005646535317, 0.041887760271682686, 0.07510263048537562, -0.1724796838218184, -0.1721831282803222, 0.4489454292246829, -0.06418408488186643, -0.16966090135114348, 0.0638242863483079, -0.183098667220253, -0.16742122164805945, 0.06734941696505184, 0.22419954995908167, 0.10702056134848491, -0.15839526867089065, 0.09481520416194816, -0.02672067577748195, 0.1787115120642778, 0.03618969917702286, 0.03332896170044399, 0.1774124852422139, 0.1362577623181531, -0.07642503293717037, 0.10713432007266775, -0.07278553405979081, -0.11605030365450227, -0.4133442706549945, -0.07445530181993609, -0.15173527009623206, -0.017889736038025305, -0.14438237876646504, -0.10157963410019874, 0.41040568917017917, 0.1721504314114218, 0.2260245962311392, 0.04042637654802884, 0.35388514739663707, 0.12585970355987386, 0.0393080012994292, 0.09415803892618936, 0.2759042792427151, 0.2453064033113744, 0.11225373904605436, -0.3035537562214101, -0.042397048338518845, 0.1428895817340716] |
1,803.0023 | Eigen-Inference Precoding for Coarsely Quantized Massive MU-MIMO System
with Imperfect CSI | This work considers the precoding problem in massive multiuser multiple-input
multiple-output (MU-MIMO) systems equipped with low-resolution
digital-to-analog converters (DACs). In previous literature on this topic, it
is commonly assumed that the channel state information (CSI) is perfectly
known. However, in practical applications the CSI is inevitably contaminated by
noise. In this paper, we propose, for the first time, an eigen-inference (EI)
precoding scheme to improve the error performance of the coarsely quantized
massive MU-MIMO systems under imperfect CSI, which is mathematically modeled by
a sum of two rectangular random matrices (RRMs). Instead of performing analysis
based on the RRM, using Girko's Hermitization trick, the proposed method
leverages the block random matrix theory by augmenting the RRM into a block
symmetric channel matrix (BSCA). Specially, we derive the empirical
distribution of the eigenvalues of the BSCA and establish the limiting spectra
distribution connection between the true BSCA and its noisy observation. Then,
based on these theoretical results, we propose an EI-based moments matching
method for CSI-related noise level estimation and a rotation invariant
estimation method for CSI reconstruction. Based on the cleaned CSI, the
quantized precoding problem is tackled via the Bussgang theorem and the
Lagrangian multiplier method. The prosed methods are lastly verified by
numerical simulations and the results demonstrate the effectiveness of the
proposed precoder.
| eess.SP | this work considers the precoding problem in massive multiuser multipleinput multipleoutput mumimo systems equipped with lowresolution digitaltoanalog converters dacs in previous literature on this topic it is commonly assumed that the channel state information csi is perfectly known however in practical applications the csi is inevitably contaminated by noise in this paper we propose for the first time an eigeninference ei precoding scheme to improve the error performance of the coarsely quantized massive mumimo systems under imperfect csi which is mathematically modeled by a sum of two rectangular random matrices rrms instead of performing analysis based on the rrm using girkos hermitization trick the proposed method leverages the block random matrix theory by augmenting the rrm into a block symmetric channel matrix bsca specially we derive the empirical distribution of the eigenvalues of the bsca and establish the limiting spectra distribution connection between the true bsca and its noisy observation then based on these theoretical results we propose an eibased moments matching method for csirelated noise level estimation and a rotation invariant estimation method for csi reconstruction based on the cleaned csi the quantized precoding problem is tackled via the bussgang theorem and the lagrangian multiplier method the prosed methods are lastly verified by numerical simulations and the results demonstrate the effectiveness of the proposed precoder | [['this', 'work', 'considers', 'the', 'precoding', 'problem', 'in', 'massive', 'multiuser', 'multipleinput', 'multipleoutput', 'mumimo', 'systems', 'equipped', 'with', 'lowresolution', 'digitaltoanalog', 'converters', 'dacs', 'in', 'previous', 'literature', 'on', 'this', 'topic', 'it', 'is', 'commonly', 'assumed', 'that', 'the', 'channel', 'state', 'information', 'csi', 'is', 'perfectly', 'known', 'however', 'in', 'practical', 'applications', 'the', 'csi', 'is', 'inevitably', 'contaminated', 'by', 'noise', 'in', 'this', 'paper', 'we', 'propose', 'for', 'the', 'first', 'time', 'an', 'eigeninference', 'ei', 'precoding', 'scheme', 'to', 'improve', 'the', 'error', 'performance', 'of', 'the', 'coarsely', 'quantized', 'massive', 'mumimo', 'systems', 'under', 'imperfect', 'csi', 'which', 'is', 'mathematically', 'modeled', 'by', 'a', 'sum', 'of', 'two', 'rectangular', 'random', 'matrices', 'rrms', 'instead', 'of', 'performing', 'analysis', 'based', 'on', 'the', 'rrm', 'using', 'girkos', 'hermitization', 'trick', 'the', 'proposed', 'method', 'leverages', 'the', 'block', 'random', 'matrix', 'theory', 'by', 'augmenting', 'the', 'rrm', 'into', 'a', 'block', 'symmetric', 'channel', 'matrix', 'bsca', 'specially', 'we', 'derive', 'the', 'empirical', 'distribution', 'of', 'the', 'eigenvalues', 'of', 'the', 'bsca', 'and', 'establish', 'the', 'limiting', 'spectra', 'distribution', 'connection', 'between', 'the', 'true', 'bsca', 'and', 'its', 'noisy', 'observation', 'then', 'based', 'on', 'these', 'theoretical', 'results', 'we', 'propose', 'an', 'eibased', 'moments', 'matching', 'method', 'for', 'csirelated', 'noise', 'level', 'estimation', 'and', 'a', 'rotation', 'invariant', 'estimation', 'method', 'for', 'csi', 'reconstruction', 'based', 'on', 'the', 'cleaned', 'csi', 'the', 'quantized', 'precoding', 'problem', 'is', 'tackled', 'via', 'the', 'bussgang', 'theorem', 'and', 'the', 'lagrangian', 'multiplier', 'method', 'the', 'prosed', 'methods', 'are', 'lastly', 'verified', 'by', 'numerical', 'simulations', 'and', 'the', 'results', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'precoder']] | [-0.16681815538268152, 0.005224007633476623, -0.052816816299901315, 0.011096641189031408, -0.05073126046874813, -0.18916414754582725, 0.053925027348379666, 0.3828709126824391, -0.24333885054715482, -0.24979568205917446, 0.13888319345434832, -0.24337470177865683, -0.21255910328086727, 0.1309814836588366, -0.12818667150720536, 0.09171635500741818, 0.0813492249129514, 0.02141527103469054, -0.0993886978515624, -0.25664622754959615, 0.3218779771030602, 0.08996232056328765, 0.3752857317901042, -0.047596697564178066, 0.12224074938360636, 0.039658469363402955, -0.069205085394434, -0.048615811240345794, -0.08993854957854264, 0.09622948428302586, 0.2765991591715698, 0.16437437056256982, 0.26040694957041993, -0.4010777660758696, -0.2271709859242802, 0.06683924167458334, 0.15829418104786042, 0.07790355000995257, -0.07787633685408178, -0.30969366427754685, 0.1351314647923981, -0.2009742919521006, -0.016092510619766524, -0.014287171475197598, -0.12897889327179535, -0.006660514946909465, -0.3494680019173876, 0.08687678506711027, 0.04411432982822793, 0.024682771872563687, -0.052367408640212686, -0.1747392853417338, 0.05523579279461301, 0.09396921702911946, 0.008316420779180513, -0.04256081052989999, 0.07094317061443613, -0.06719857910849267, -0.08936597988192779, 0.33521270605944375, -0.03699256589246705, -0.2832442341485522, 0.11068225699143971, -0.0850468176356125, -0.09900969906930951, 0.13927315425771836, 0.20260042387765842, 0.11349530382273353, -0.17914938899551336, 0.0728969730425378, -0.04340494117725675, 0.18536408344298932, 0.021732215337111466, 0.061894861293388705, 0.13841734354157942, 0.17998897677687842, 0.08856696024032257, 0.1297962802095626, -0.13828909735205674, -0.10348175090485226, -0.2294781527516789, -0.12094029129801588, -0.26393388366875037, 0.014636346973504907, -0.09556849511462932, -0.108493621704804, 0.33477351905959407, 0.16082228752175154, 0.1252056205575572, 0.09530778573749796, 0.42499172071726105, 0.14137750676023625, 0.016659511401748858, 0.10135752327901215, 0.2040230000650545, 0.211083351086094, 0.0921914627564479, -0.2284467218500327, 0.035631914576297954, 0.05698210154398928] |
1,803.00231 | Pseudo-differential operators on $\mathbb{Z}^n$ with applications to
discrete fractional integral operators | In this manuscript we provide necessary and sufficient conditions for the
$\textnormal{weak}(1,p)$ boundedness, $1< p<\infty,$ of discrete Fourier
multipliers (Fourier multipliers on $\mathbb{Z}^n$). Our main goal is to apply
the results obtained to discrete fractional integral operators. Discrete
versions of the Calder\'on-Vaillancourt Theorem and the Gohberg Lemma also are
proved.
| math.FA | in this manuscript we provide necessary and sufficient conditions for the textnormalweak1p boundedness 1 pinfty of discrete fourier multipliers fourier multipliers on mathbbzn our main goal is to apply the results obtained to discrete fractional integral operators discrete versions of the calderonvaillancourt theorem and the gohberg lemma also are proved | [['in', 'this', 'manuscript', 'we', 'provide', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'the', 'textnormalweak1p', 'boundedness', '1', 'pinfty', 'of', 'discrete', 'fourier', 'multipliers', 'fourier', 'multipliers', 'on', 'mathbbzn', 'our', 'main', 'goal', 'is', 'to', 'apply', 'the', 'results', 'obtained', 'to', 'discrete', 'fractional', 'integral', 'operators', 'discrete', 'versions', 'of', 'the', 'calderonvaillancourt', 'theorem', 'and', 'the', 'gohberg', 'lemma', 'also', 'are', 'proved']] | [-0.08857051096856594, 0.035199259987519105, -0.13699006787216178, 0.1302203517027047, -0.10502561193187626, -0.09466905481353098, -0.009559097124871855, 0.35931619963779743, -0.29835684772352783, -0.16724211552503462, 0.2154906376013152, -0.2018036738522731, -0.11167822879791374, 0.23515131213341137, -0.19779364487194284, 0.10946012668701231, 0.031601673182176084, -0.005370465472544905, -0.08325656784736381, -0.2999920050936694, 0.30004753677972723, -0.05484966241887638, 0.19931878529641092, 0.077569255149182, 0.05342232952920758, 0.05447187715647172, -0.11396981634636771, -0.13224128265009852, -0.2020159345690389, 0.13789899132157468, 0.2570828409979538, 0.0607177956428911, 0.2999222100693352, -0.4346200414762205, -0.10989096901398532, 0.15905743201586361, 0.1289449633700222, -0.04667419966842447, -0.04409380450284071, -0.3233335708572092, 0.1389695221976358, -0.0537243284171029, -0.16757912656330332, -0.11863244807689774, -0.0039441459717191, 0.09904152588272581, -0.3438628813898077, 0.0980454862767555, 0.20068051977729312, 0.03170647588083331, -0.1809910882112323, -0.14567138931276846, 0.02099355361994584, 0.06303139901434889, -0.009468149883216438, -0.00452329298215253, 0.01973928176626867, 0.04093616402099783, -0.12697183265711884, 0.3256820889607984, -0.029058387617067416, -0.2728616494485842, 0.14360966746296203, -0.161867194105776, -0.2100956667955889, 0.047528546284504085, 0.0951876624734426, 0.1683362123689481, -0.1174986465567989, 0.14841565853507466, -0.10792086523368347, 0.09838747149523423, 0.10563669172210657, 0.07902897529456081, -0.017550515353071446, 0.02993733240576575, 0.20017719308712653, 0.18387266022405035, -0.015993516695001448, -0.039140671358576844, -0.39310302250847523, -0.18877104392313226, -0.23907902597316674, 0.04690952473605166, -0.08247732033665596, -0.11140888317355088, 0.41122071064856586, 0.15924106744517172, 0.06976463697014415, 0.11369169467337886, 0.23198797907775306, 0.18336213154513958, 0.011585632054021164, 0.05352870442391354, 0.12843431759274052, 0.26189704535871133, 0.14831251729925982, -0.132309303438405, -0.08771855070502782, 0.2704022762517692] |
1,803.00232 | DRUNET: A Dilated-Residual U-Net Deep Learning Network to Digitally
Stain Optic Nerve Head Tissues in Optical Coherence Tomography Images | Given that the neural and connective tissues of the optic nerve head (ONH)
exhibit complex morphological changes with the development and progression of
glaucoma, their simultaneous isolation from optical coherence tomography (OCT)
images may be of great interest for the clinical diagnosis and management of
this pathology. A deep learning algorithm was designed and trained to digitally
stain (i.e. highlight) 6 ONH tissue layers by capturing both the local (tissue
texture) and contextual information (spatial arrangement of tissues). The
overall dice coefficient (mean of all tissues) was $0.91 \pm 0.05$ when
assessed against manual segmentations performed by an expert observer. We offer
here a robust segmentation framework that could be extended for the automated
parametric study of the ONH tissues.
| cs.CV cs.LG | given that the neural and connective tissues of the optic nerve head onh exhibit complex morphological changes with the development and progression of glaucoma their simultaneous isolation from optical coherence tomography oct images may be of great interest for the clinical diagnosis and management of this pathology a deep learning algorithm was designed and trained to digitally stain ie highlight 6 onh tissue layers by capturing both the local tissue texture and contextual information spatial arrangement of tissues the overall dice coefficient mean of all tissues was 091 pm 005 when assessed against manual segmentations performed by an expert observer we offer here a robust segmentation framework that could be extended for the automated parametric study of the onh tissues | [['given', 'that', 'the', 'neural', 'and', 'connective', 'tissues', 'of', 'the', 'optic', 'nerve', 'head', 'onh', 'exhibit', 'complex', 'morphological', 'changes', 'with', 'the', 'development', 'and', 'progression', 'of', 'glaucoma', 'their', 'simultaneous', 'isolation', 'from', 'optical', 'coherence', 'tomography', 'oct', 'images', 'may', 'be', 'of', 'great', 'interest', 'for', 'the', 'clinical', 'diagnosis', 'and', 'management', 'of', 'this', 'pathology', 'a', 'deep', 'learning', 'algorithm', 'was', 'designed', 'and', 'trained', 'to', 'digitally', 'stain', 'ie', 'highlight', '6', 'onh', 'tissue', 'layers', 'by', 'capturing', 'both', 'the', 'local', 'tissue', 'texture', 'and', 'contextual', 'information', 'spatial', 'arrangement', 'of', 'tissues', 'the', 'overall', 'dice', 'coefficient', 'mean', 'of', 'all', 'tissues', 'was', '091', 'pm', '005', 'when', 'assessed', 'against', 'manual', 'segmentations', 'performed', 'by', 'an', 'expert', 'observer', 'we', 'offer', 'here', 'a', 'robust', 'segmentation', 'framework', 'that', 'could', 'be', 'extended', 'for', 'the', 'automated', 'parametric', 'study', 'of', 'the', 'onh', 'tissues']] | [-0.01331001421106824, 0.06670991503354647, -0.0513518516808593, 0.01077893408073578, -0.046376527174531175, -0.16778240681936343, 0.009390205123539393, 0.46810037046670916, -0.24479202049939583, -0.2877407975805302, 0.1085819501808146, -0.2584054314220945, -0.22156961916480214, 0.17035946684579054, -0.18794306381314527, 0.07739128512960937, 0.09486173914726047, 0.019802424296115836, 0.00803975803234304, -0.21455836490980193, 0.19217925846072223, 0.021857349975956217, 0.36201726937433704, 0.011046261718729512, 0.13448035390514027, 0.03347730113309808, -0.04509025676331172, 0.004973331668103735, -0.08060593076576576, 0.1842148531030034, 0.33575434956389166, 0.17568466553057077, 0.3114865666255355, -0.44058461785316466, -0.2448480375499154, 0.09174102974745134, 0.15491534807157828, 0.057486996011963734, 0.021644657933696482, -0.345338938680167, 0.06942383268518218, -0.10559300623523692, -0.04437605447601527, -0.10167622188649451, 0.0009054513114582127, -0.03612203268761126, -0.25875448022658626, 0.13938013149502998, 0.039525233139041424, 0.19414116142434068, -0.11797220823549044, -0.0728483297144218, -0.02618420615714664, 0.21474416023047524, -0.017244706198107453, 0.08107401285572753, 0.21230502986581995, -0.22029865501487317, -0.10358717255003284, 0.3285889661943656, 0.04720109742872106, -0.15384108191547058, 0.14401060430488238, -0.1031425399472937, -0.06063309453505402, 0.17850627332615357, 0.17106946657101313, 0.07181868994715236, -0.177845965883292, -0.07602213494877409, 0.030984855939944586, 0.23230405394763995, 0.10878172801652303, -0.03126601843590227, 0.16536053395539058, 0.2301129742350895, -0.06616680801574451, 0.1291493121010717, -0.19995865191643436, 0.04110422972977782, -0.20771240101506314, -0.16860209881851915, -0.11944033213755272, 0.01385636901250109, -0.1665651190593053, -0.19061451499680213, 0.40921266252795857, 0.1475535795063479, 0.15487757740193048, 0.04595912512353, 0.31089700406494863, -0.02630842649183857, 0.12603665290710828, -0.03087901712860912, 0.22882537625167362, 0.06207309603147829, 0.10916278939306115, -0.22709608129807748, 0.1486104729042078, 0.02487255340286841] |
1,803.00233 | Scalable Dense Non-rigid Structure-from-Motion: A Grassmannian
Perspective | This paper addresses the task of dense non-rigid structure-from-motion
(NRSfM) using multiple images. State-of-the-art methods to this problem are
often hurdled by scalability, expensive computations, and noisy measurements.
Further, recent methods to NRSfM usually either assume a small number of sparse
feature points or ignore local non-linearities of shape deformations, and thus
cannot reliably model complex non-rigid deformations. To address these issues,
in this paper, we propose a new approach for dense NRSfM by modeling the
problem on a Grassmann manifold. Specifically, we assume the complex non-rigid
deformations lie on a union of local linear subspaces both spatially and
temporally. This naturally allows for a compact representation of the complex
non-rigid deformation over frames. We provide experimental results on several
synthetic and real benchmark datasets. The procured results clearly demonstrate
that our method, apart from being scalable and more accurate than
state-of-the-art methods, is also more robust to noise and generalizes to
highly non-linear deformations.
| cs.CV | this paper addresses the task of dense nonrigid structurefrommotion nrsfm using multiple images stateoftheart methods to this problem are often hurdled by scalability expensive computations and noisy measurements further recent methods to nrsfm usually either assume a small number of sparse feature points or ignore local nonlinearities of shape deformations and thus cannot reliably model complex nonrigid deformations to address these issues in this paper we propose a new approach for dense nrsfm by modeling the problem on a grassmann manifold specifically we assume the complex nonrigid deformations lie on a union of local linear subspaces both spatially and temporally this naturally allows for a compact representation of the complex nonrigid deformation over frames we provide experimental results on several synthetic and real benchmark datasets the procured results clearly demonstrate that our method apart from being scalable and more accurate than stateoftheart methods is also more robust to noise and generalizes to highly nonlinear deformations | [['this', 'paper', 'addresses', 'the', 'task', 'of', 'dense', 'nonrigid', 'structurefrommotion', 'nrsfm', 'using', 'multiple', 'images', 'stateoftheart', 'methods', 'to', 'this', 'problem', 'are', 'often', 'hurdled', 'by', 'scalability', 'expensive', 'computations', 'and', 'noisy', 'measurements', 'further', 'recent', 'methods', 'to', 'nrsfm', 'usually', 'either', 'assume', 'a', 'small', 'number', 'of', 'sparse', 'feature', 'points', 'or', 'ignore', 'local', 'nonlinearities', 'of', 'shape', 'deformations', 'and', 'thus', 'can', 'not', 'reliably', 'model', 'complex', 'nonrigid', 'deformations', 'to', 'address', 'these', 'issues', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'approach', 'for', 'dense', 'nrsfm', 'by', 'modeling', 'the', 'problem', 'on', 'a', 'grassmann', 'manifold', 'specifically', 'we', 'assume', 'the', 'complex', 'nonrigid', 'deformations', 'lie', 'on', 'a', 'union', 'of', 'local', 'linear', 'subspaces', 'both', 'spatially', 'and', 'temporally', 'this', 'naturally', 'allows', 'for', 'a', 'compact', 'representation', 'of', 'the', 'complex', 'nonrigid', 'deformation', 'over', 'frames', 'we', 'provide', 'experimental', 'results', 'on', 'several', 'synthetic', 'and', 'real', 'benchmark', 'datasets', 'the', 'procured', 'results', 'clearly', 'demonstrate', 'that', 'our', 'method', 'apart', 'from', 'being', 'scalable', 'and', 'more', 'accurate', 'than', 'stateoftheart', 'methods', 'is', 'also', 'more', 'robust', 'to', 'noise', 'and', 'generalizes', 'to', 'highly', 'nonlinear', 'deformations']] | [-0.07983308233876503, 0.0072830859466546, -0.0413611686953734, 0.032719682736111984, -0.11535571492427299, -0.13524881125157398, -0.014556192187592387, 0.4408561757690604, -0.2970124962679561, -0.283410249217864, 0.11079008422957193, -0.2320990355220631, -0.22481682480335416, 0.22644110602897502, -0.18180323154740635, 0.07634304468670199, 0.16168971363560206, -0.0075080294776031925, -0.11486435526110712, -0.25659807786465655, 0.3432580419275309, -0.007602745763236477, 0.2813771825343851, 0.00943045711234933, 0.11481360830967464, -0.013155506814139024, -0.05572336971226539, 0.05660469510232008, -0.03808972589815253, 0.20458330563269556, 0.2905559342039088, 0.12124367652220591, 0.2601486326585854, -0.4590455654287531, -0.25343144379796523, 0.11562818742447323, 0.14732660373462544, 0.1431795261778696, -0.015161330009728009, -0.33816193527872523, 0.0936262562855958, -0.12909060580685974, -0.03788809837142546, -0.20326695702369174, -0.003223799700067649, -0.02541893455049684, -0.27868541741984026, 0.09049227432058674, 0.05940971416571448, 0.044820962888338874, -0.07556098548717977, -0.06858630796083279, 0.05331903869781884, 0.09428457008043845, -0.00934614489430509, 0.025191356453503812, 0.11859533457506087, -0.14682333202011164, -0.10924298473138122, 0.4087099084390267, -0.012229693914301723, -0.2816319238484627, 0.25584054192708383, -0.06756263606009945, -0.17280568492959344, 0.14887503096533397, 0.2134050057329718, 0.19458094821461747, -0.12372636326378392, 0.04718722309992318, -0.059063124395306074, 0.1619637001343372, 0.02736022838000809, -0.019416660497025135, 0.16975158648264985, 0.18897798029826052, 0.08898527310079625, 0.10335061981252605, -0.1120067341148012, -0.060505350890959944, -0.23244184299800244, -0.06674853581099606, -0.16566391785238538, 0.0022917229307612644, -0.0910444859830257, -0.17049647314894584, 0.3936355738630218, 0.17639497406480292, 0.2616580120167665, 0.07870498172818653, 0.38008398952022676, -0.015571466194946438, 0.060570512507711685, 0.06328862977266732, 0.15808812472068012, 0.06087863011165492, 0.057579765804562595, -0.16018728129115076, -0.0014374771944036888, 0.04392690837323185] |
1,803.00234 | Searching for Metastable Particles with Sub-Millimeter Displaced
Vertices at Hadron Colliders | A variety of new-physics models predict metastable particles whose decay
length is $\lesssim 1$ mm. Conventional displaced-vertex searches are less
sensitive to this sub-millimeter decay range, and thus such metastable
particles have been looked for only in usual prompt decay searches. In this
paper, we show that an additional event-selection cut based on the vertex
reconstruction using charged tracks considerably improves the sensitivity of
ordinary searches which rely only on kinematic selection criteria, for
particles with a decay length of $\gtrsim 100$ $\mu \text{m}$. To that end, we
consider a metastable gluino as an example, and study the impact of this new
event-selection cut on gluino searches at the LHC by simulating both the signal
and Standard Model background processes. Uncertainty of the displaced-vertex
reconstruction due to the limited resolution of track reconstruction is taken
into account. We also discuss possibilities for optimization of the kinematic
selection criteria, which takes advantage of significant reduction of
background through the requirement of displaced vertices. In addition, we
demonstrate that using the method discussed in this paper it is possible to
measure the lifetime of metastable particles with an ${\cal O}(1)$ accuracy at
the high-luminosity LHC. Implications for a future 100 TeV collider are also
studied, where produced particles tend to be more boosted and thus it is easier
to detect the longevity of metastable particles.
| hep-ph hep-ex | a variety of newphysics models predict metastable particles whose decay length is lesssim 1 mm conventional displacedvertex searches are less sensitive to this submillimeter decay range and thus such metastable particles have been looked for only in usual prompt decay searches in this paper we show that an additional eventselection cut based on the vertex reconstruction using charged tracks considerably improves the sensitivity of ordinary searches which rely only on kinematic selection criteria for particles with a decay length of gtrsim 100 mu textm to that end we consider a metastable gluino as an example and study the impact of this new eventselection cut on gluino searches at the lhc by simulating both the signal and standard model background processes uncertainty of the displacedvertex reconstruction due to the limited resolution of track reconstruction is taken into account we also discuss possibilities for optimization of the kinematic selection criteria which takes advantage of significant reduction of background through the requirement of displaced vertices in addition we demonstrate that using the method discussed in this paper it is possible to measure the lifetime of metastable particles with an cal o1 accuracy at the highluminosity lhc implications for a future 100 tev collider are also studied where produced particles tend to be more boosted and thus it is easier to detect the longevity of metastable particles | [['a', 'variety', 'of', 'newphysics', 'models', 'predict', 'metastable', 'particles', 'whose', 'decay', 'length', 'is', 'lesssim', '1', 'mm', 'conventional', 'displacedvertex', 'searches', 'are', 'less', 'sensitive', 'to', 'this', 'submillimeter', 'decay', 'range', 'and', 'thus', 'such', 'metastable', 'particles', 'have', 'been', 'looked', 'for', 'only', 'in', 'usual', 'prompt', 'decay', 'searches', 'in', 'this', 'paper', 'we', 'show', 'that', 'an', 'additional', 'eventselection', 'cut', 'based', 'on', 'the', 'vertex', 'reconstruction', 'using', 'charged', 'tracks', 'considerably', 'improves', 'the', 'sensitivity', 'of', 'ordinary', 'searches', 'which', 'rely', 'only', 'on', 'kinematic', 'selection', 'criteria', 'for', 'particles', 'with', 'a', 'decay', 'length', 'of', 'gtrsim', '100', 'mu', 'textm', 'to', 'that', 'end', 'we', 'consider', 'a', 'metastable', 'gluino', 'as', 'an', 'example', 'and', 'study', 'the', 'impact', 'of', 'this', 'new', 'eventselection', 'cut', 'on', 'gluino', 'searches', 'at', 'the', 'lhc', 'by', 'simulating', 'both', 'the', 'signal', 'and', 'standard', 'model', 'background', 'processes', 'uncertainty', 'of', 'the', 'displacedvertex', 'reconstruction', 'due', 'to', 'the', 'limited', 'resolution', 'of', 'track', 'reconstruction', 'is', 'taken', 'into', 'account', 'we', 'also', 'discuss', 'possibilities', 'for', 'optimization', 'of', 'the', 'kinematic', 'selection', 'criteria', 'which', 'takes', 'advantage', 'of', 'significant', 'reduction', 'of', 'background', 'through', 'the', 'requirement', 'of', 'displaced', 'vertices', 'in', 'addition', 'we', 'demonstrate', 'that', 'using', 'the', 'method', 'discussed', 'in', 'this', 'paper', 'it', 'is', 'possible', 'to', 'measure', 'the', 'lifetime', 'of', 'metastable', 'particles', 'with', 'an', 'cal', 'o1', 'accuracy', 'at', 'the', 'highluminosity', 'lhc', 'implications', 'for', 'a', 'future', '100', 'tev', 'collider', 'are', 'also', 'studied', 'where', 'produced', 'particles', 'tend', 'to', 'be', 'more', 'boosted', 'and', 'thus', 'it', 'is', 'easier', 'to', 'detect', 'the', 'longevity', 'of', 'metastable', 'particles']] | [-0.03891844554418476, 0.19461800120821832, -0.0662427325795651, 0.10275752788133953, -0.06372869398962756, -0.15293308220711857, 0.02780283037249433, 0.355860806780245, -0.22453073593850495, -0.3301065084148583, 0.08240002021819955, -0.2822312995678674, -0.018793746431237046, 0.16447362617480948, 0.015651410665872587, 0.04620930242180958, 0.10277554787269422, -0.004732866939094603, -0.04191239162023501, -0.22806765156956765, 0.2456359717527179, 0.096447831591917, 0.22010199902286845, 0.08948259117215404, 0.08441806056185922, 0.008840251577216213, -0.04407095674878496, -0.0033939164591276594, -0.14434926573018364, 0.06351437376636694, 0.20418477635444657, 0.12918580212680447, 0.19157506804913282, -0.38867319462144323, -0.1688275509618323, 0.18578860951762963, 0.19015491923375782, 0.09126022405976705, -0.07482821946827153, -0.2987034200239643, 0.1329488176630597, -0.1615238529924959, -0.10055027127207461, -0.03631056557229883, 0.02329960153041399, -0.04416779646829539, -0.28203970082354785, 0.04590365770058873, 0.018767643016460247, 0.002673282701471996, -0.020116236482667547, -0.14721576096500466, -0.008475173407781351, 0.03229381708060746, 0.09076652594950602, 0.02389315661823903, 0.16867166974857417, -0.16519253766540054, -0.1490581170467852, 0.37374742840721603, -0.05812833330754792, -0.1731841041886085, 0.22232454609973648, -0.1515667421994898, -0.16098615245250442, 0.18965259156265032, 0.22871323404055832, 0.13401784247722928, -0.16489136887864614, 0.08823366035005671, 0.019435586141539327, 0.18426539904684364, 0.07514683396770565, 0.08504732286206743, 0.2096177520211619, 0.2424607340897947, 0.07430489562272256, 0.12043421564314664, -0.14675662368682169, -0.047904018864229805, -0.3415047435941918, -0.1459885645749657, -0.11414508142763323, 0.035998757754769926, -0.06259510701030467, -0.1030096571867442, 0.3754332427566061, 0.16617721406601457, 0.2452704691424164, 0.041666554641020336, 0.2917640861040274, 0.08595798645667614, 0.07558431846674739, 0.026134528014211154, 0.3075524562167948, 0.06964778141932972, 0.07831897788301044, -0.19414191375091888, 0.031647466296421976, 0.01146400116505143] |
1,803.00235 | Calculating the Magnetic Anisotropy of Rare-Earth-Transition-Metal
Ferrimagnets | Magnetocrystalline anisotropy, the microscopic origin of permanent magnetism,
is often explained in terms of ferromagnets. However, the best performing
permanent magnets based on rare earths and transition metals (RE-TM) are in
fact ferrimagnets, consisting of a number of magnetic sublattices. Here we show
how a naive calculation of the magnetocrystalline anisotropy of the classic
RE-TM ferrimagnet GdCo$_5$ gives numbers which are too large at 0 K and exhibit
the wrong temperature dependence. We solve this problem by introducing a
first-principles approach to calculate temperature-dependent magnetization vs.
field (FPMVB) curves, mirroring the experiments actually used to determine the
anisotropy. We pair our calculations with measurements on a recently-grown
single crystal of GdCo$_5$, and find excellent agreement. The FPMVB approach
demonstrates a new level of sophistication in the use of first-principles
calculations to understand RE-TM magnets.
| cond-mat.mtrl-sci | magnetocrystalline anisotropy the microscopic origin of permanent magnetism is often explained in terms of ferromagnets however the best performing permanent magnets based on rare earths and transition metals retm are in fact ferrimagnets consisting of a number of magnetic sublattices here we show how a naive calculation of the magnetocrystalline anisotropy of the classic retm ferrimagnet gdco_5 gives numbers which are too large at 0 k and exhibit the wrong temperature dependence we solve this problem by introducing a firstprinciples approach to calculate temperaturedependent magnetization vs field fpmvb curves mirroring the experiments actually used to determine the anisotropy we pair our calculations with measurements on a recentlygrown single crystal of gdco_5 and find excellent agreement the fpmvb approach demonstrates a new level of sophistication in the use of firstprinciples calculations to understand retm magnets | [['magnetocrystalline', 'anisotropy', 'the', 'microscopic', 'origin', 'of', 'permanent', 'magnetism', 'is', 'often', 'explained', 'in', 'terms', 'of', 'ferromagnets', 'however', 'the', 'best', 'performing', 'permanent', 'magnets', 'based', 'on', 'rare', 'earths', 'and', 'transition', 'metals', 'retm', 'are', 'in', 'fact', 'ferrimagnets', 'consisting', 'of', 'a', 'number', 'of', 'magnetic', 'sublattices', 'here', 'we', 'show', 'how', 'a', 'naive', 'calculation', 'of', 'the', 'magnetocrystalline', 'anisotropy', 'of', 'the', 'classic', 'retm', 'ferrimagnet', 'gdco_5', 'gives', 'numbers', 'which', 'are', 'too', 'large', 'at', '0', 'k', 'and', 'exhibit', 'the', 'wrong', 'temperature', 'dependence', 'we', 'solve', 'this', 'problem', 'by', 'introducing', 'a', 'firstprinciples', 'approach', 'to', 'calculate', 'temperaturedependent', 'magnetization', 'vs', 'field', 'fpmvb', 'curves', 'mirroring', 'the', 'experiments', 'actually', 'used', 'to', 'determine', 'the', 'anisotropy', 'we', 'pair', 'our', 'calculations', 'with', 'measurements', 'on', 'a', 'recentlygrown', 'single', 'crystal', 'of', 'gdco_5', 'and', 'find', 'excellent', 'agreement', 'the', 'fpmvb', 'approach', 'demonstrates', 'a', 'new', 'level', 'of', 'sophistication', 'in', 'the', 'use', 'of', 'firstprinciples', 'calculations', 'to', 'understand', 'retm', 'magnets']] | [-0.15730105146040557, 0.1491844004254703, -0.04778059024918284, 0.053567910271888695, -0.07698938619693783, -0.09525227490883634, 0.09065372169191971, 0.3718428629386516, -0.2357147234769268, -0.3457274788507182, -0.023556742215536195, -0.31335158542310465, -0.13104729374998625, 0.20042645943685228, 0.05101349473155978, -0.026713999617446697, 0.007658365747770508, -0.01810854021459818, -0.0929931468545381, -0.20023590130447091, 0.24257923622494776, 0.04692450732362407, 0.3043776683985675, 0.09040114129289188, 0.06559060335073545, -0.006045115432694896, 0.1044681672938168, 0.06186633366817708, -0.15674425279614979, 0.10438856648953049, 0.21814487634923393, -0.04384670319846113, 0.17493232217340068, -0.47195738865389625, -0.16324474973753378, 0.03646035301001416, 0.11818070461589644, 0.15020723115094717, -0.05838399082742177, -0.19915798609678187, 0.061442363225207984, -0.12015830411909874, -0.1458262653358437, -0.16659616430481997, -0.04571781289241213, 0.02350146128482897, -0.2622787493728954, 0.08112402272567096, 0.056466754600547876, 0.15437129794925233, -0.06933863583653596, -0.1624583958182484, -0.02063566393339793, 0.02983902013711347, 0.08508762054479475, 0.06640044991962278, 0.13256116625177497, -0.09034197826030885, -0.13716310981433583, 0.4014994491190287, -0.054855336181869205, -0.10295461609298434, 0.13051603860861644, -0.19223554144108682, -0.13203232888246083, 0.1350485241993238, 0.1316399723198087, 0.11774780040692168, -0.11606909644981946, 0.08703583760323884, -0.003624618748817877, 0.18071914905013928, -0.0026809261998033706, -0.0024276276102724115, 0.23800747734956615, 0.19000220792154773, -0.03094722448940609, 0.1338683185052084, -0.09657257898819085, -0.06146516103141067, -0.22917172219604254, -0.13594967977655695, -0.24754152519855904, 0.07677278085789493, -0.08625825521154488, -0.2066555319154877, 0.3736719831456395, 0.18873418983825632, 0.18353406037026235, -0.028941708957271665, 0.25761788864157925, 0.06637388488583494, 0.04934201772610892, 0.025264301323083067, 0.26264368935367305, 0.17386120928670032, 0.10619414262900143, -0.29228702329013867, 0.11709668727250386, 0.017494349775992277] |
1,803.00236 | Characterisation of slip and twinning in high rate deformed zirconium
with electron backscatter diffraction | Zirconium alloys are used in the nuclear industry as structural materials,
and can be subject to high strain rate loading conditions during forming and in
the case of a reactor accident. In this context, the relationship between
strain rate dependent mechanical properties, crystallographic texture and
deformation modes, such as slip and deformation twinning, are explored in this
work. Commercially pure zirconium is deformed to 10 % engineering strain under
quasi-static and high strain rate loading, and post-mortem analysis of the
samples is performed using electron backscatter diffraction (EBSD) to observe
different twin and slip systems activated. Twin types are identified from local
intergranular misorientation maps, and active slip systems are identified from
long range intragranular misorientation maps. We link characterisation of the
mechanical responses, twin types and morphologies, and relative slip system
activation as a function of loading mode. We find that variations in strength
and hardening can be related to the relative propensity of twinning and the
number of active slip systems.
| cond-mat.mtrl-sci | zirconium alloys are used in the nuclear industry as structural materials and can be subject to high strain rate loading conditions during forming and in the case of a reactor accident in this context the relationship between strain rate dependent mechanical properties crystallographic texture and deformation modes such as slip and deformation twinning are explored in this work commercially pure zirconium is deformed to 10 engineering strain under quasistatic and high strain rate loading and postmortem analysis of the samples is performed using electron backscatter diffraction ebsd to observe different twin and slip systems activated twin types are identified from local intergranular misorientation maps and active slip systems are identified from long range intragranular misorientation maps we link characterisation of the mechanical responses twin types and morphologies and relative slip system activation as a function of loading mode we find that variations in strength and hardening can be related to the relative propensity of twinning and the number of active slip systems | [['zirconium', 'alloys', 'are', 'used', 'in', 'the', 'nuclear', 'industry', 'as', 'structural', 'materials', 'and', 'can', 'be', 'subject', 'to', 'high', 'strain', 'rate', 'loading', 'conditions', 'during', 'forming', 'and', 'in', 'the', 'case', 'of', 'a', 'reactor', 'accident', 'in', 'this', 'context', 'the', 'relationship', 'between', 'strain', 'rate', 'dependent', 'mechanical', 'properties', 'crystallographic', 'texture', 'and', 'deformation', 'modes', 'such', 'as', 'slip', 'and', 'deformation', 'twinning', 'are', 'explored', 'in', 'this', 'work', 'commercially', 'pure', 'zirconium', 'is', 'deformed', 'to', '10', 'engineering', 'strain', 'under', 'quasistatic', 'and', 'high', 'strain', 'rate', 'loading', 'and', 'postmortem', 'analysis', 'of', 'the', 'samples', 'is', 'performed', 'using', 'electron', 'backscatter', 'diffraction', 'ebsd', 'to', 'observe', 'different', 'twin', 'and', 'slip', 'systems', 'activated', 'twin', 'types', 'are', 'identified', 'from', 'local', 'intergranular', 'misorientation', 'maps', 'and', 'active', 'slip', 'systems', 'are', 'identified', 'from', 'long', 'range', 'intragranular', 'misorientation', 'maps', 'we', 'link', 'characterisation', 'of', 'the', 'mechanical', 'responses', 'twin', 'types', 'and', 'morphologies', 'and', 'relative', 'slip', 'system', 'activation', 'as', 'a', 'function', 'of', 'loading', 'mode', 'we', 'find', 'that', 'variations', 'in', 'strength', 'and', 'hardening', 'can', 'be', 'related', 'to', 'the', 'relative', 'propensity', 'of', 'twinning', 'and', 'the', 'number', 'of', 'active', 'slip', 'systems']] | [-0.13579093285744298, 0.21006046914363302, -0.04357417070387322, -0.0156676480180101, -0.03251069581659258, -0.12825811792877906, 0.033975330953210314, 0.4455183413523583, -0.3121948891727507, -0.3115833938728305, 0.10348819641979917, -0.2509759501496583, -0.14958505632562769, 0.1944817569930348, -0.047968351218941406, 0.06947168537967459, 0.0060044057483290445, -0.03945159713915883, -0.08111638807616899, -0.19476727508928304, 0.23968791521160093, 0.05076843729806075, 0.38977669100104656, 0.022527374960640216, 0.0460799906724765, 0.00028532464632097585, 0.04361785066681972, 0.05336727799249836, -0.1650231443160953, 0.04098019730242222, 0.2644987320570551, -0.006417002870965703, 0.17453343801510832, -0.4453948761485977, -0.23370432853411285, 0.05991649645794597, 0.08815820698545855, 0.09586897354435038, -0.030566479448792466, -0.21586661222879489, 0.08006322525303673, -0.14333577488008656, -0.06833457396607157, -0.05358869801447899, 0.02720081705864473, 0.07197899066981066, -0.2640237107694747, 0.16231103341402717, 0.018578307873179222, 0.15361490970575192, -0.15758930796895315, -0.07590021658904368, -0.07991076132029663, 0.1144267149973103, 0.08967079521432796, -0.009863853221040587, 0.2676770565283979, -0.11826753522410276, -0.042490067748053945, 0.3891081180837419, 0.03158305799567002, -0.13543958695358194, 0.23206044895068548, -0.12951807220133, -0.08357752670453471, 0.17024933870732326, 0.1893960354378286, 0.07016882129059529, -0.16285397181356395, -0.051286707078911545, 0.06828022588412334, 0.1649398002694476, 0.143089368318518, 0.0055408158632754174, 0.22377344453994782, 0.19293520496985703, 0.02111507628549948, 0.15956356658034004, -0.15237662318036144, -0.0038444251569424884, -0.26798673786429894, -0.14515909114507614, -0.14071775194926528, 0.02657181993601154, -0.08433842260489689, -0.15289779646641197, 0.3526601311463265, 0.07836149393740387, 0.15599728374092345, -0.04263280955700917, 0.1923006431387887, 0.04335657476208943, 0.11191676924562795, -0.03838706355151019, 0.2872488324380951, 0.17934689407645046, 0.1168357098667687, -0.25932556353107, 0.1280218046747815, 0.0122819812019804] |
1,803.00237 | Monomial-type Toeplitz operators on some weakly pseudoconvex domains | In this paper, we completely characterize the finite rank commutator and
semi-commutator of two monomial-type Toeplitz operators on the Bergman space of
certain weakly pseudoconvex domains. Somewhat surprisingly, there are not only
plenty of commuting monomial-type Toeplitz operators but also non-trivial
semi-commuting monomial-type Toeplitz operators. Our results are new even for
the unit ball.%The situation is different from the case of unit disk. %Our
results extend several known results using completely different arguments. Some
interesting higher-dimensional phenomena appear on the unit polydisk.
| math.FA | in this paper we completely characterize the finite rank commutator and semicommutator of two monomialtype toeplitz operators on the bergman space of certain weakly pseudoconvex domains somewhat surprisingly there are not only plenty of commuting monomialtype toeplitz operators but also nontrivial semicommuting monomialtype toeplitz operators our results are new even for the unit ballthe situation is different from the case of unit disk our results extend several known results using completely different arguments some interesting higherdimensional phenomena appear on the unit polydisk | [['in', 'this', 'paper', 'we', 'completely', 'characterize', 'the', 'finite', 'rank', 'commutator', 'and', 'semicommutator', 'of', 'two', 'monomialtype', 'toeplitz', 'operators', 'on', 'the', 'bergman', 'space', 'of', 'certain', 'weakly', 'pseudoconvex', 'domains', 'somewhat', 'surprisingly', 'there', 'are', 'not', 'only', 'plenty', 'of', 'commuting', 'monomialtype', 'toeplitz', 'operators', 'but', 'also', 'nontrivial', 'semicommuting', 'monomialtype', 'toeplitz', 'operators', 'our', 'results', 'are', 'new', 'even', 'for', 'the', 'unit', 'ballthe', 'situation', 'is', 'different', 'from', 'the', 'case', 'of', 'unit', 'disk', 'our', 'results', 'extend', 'several', 'known', 'results', 'using', 'completely', 'different', 'arguments', 'some', 'interesting', 'higherdimensional', 'phenomena', 'appear', 'on', 'the', 'unit', 'polydisk']] | [-0.1475571873281611, 0.14069469758872816, 0.003084162089191837, 0.10752421511728087, -0.09245167915525351, -0.14060044903768065, -0.0015113542508908811, 0.37785174497575674, -0.2710693115943376, -0.13011302546034625, 0.19576953182911017, -0.30264952310855375, -0.19903827203368699, 0.2518265323920382, -0.13323451571718412, 0.027439892728939468, 0.06539519922232923, 0.060278109918681926, -0.14629244350506293, -0.29508190392804, 0.45448657129833725, -0.05126161243260643, 0.17696894049920417, 0.09786312324627314, 0.01283195912608026, -0.036054462694597465, -0.036899554218384034, -0.03683036411171032, -0.11561272366052884, 0.12331866177465813, 0.2638319192517457, 0.08774987195422988, 0.22357377778439794, -0.4121748711683868, -0.16527696959904314, 0.1558527414827826, 0.16979056350702856, -0.0007489583581502055, -0.06599394415281024, -0.2744766844660734, 0.03491604345402232, -0.15241442387348708, -0.09582450040213672, -0.11741473242916443, -0.026110169643041803, -0.01854624107974455, -0.2359674011707812, 0.044781181227953326, 0.17615000747236204, 0.058641327614033664, -0.1125120285281877, -0.15892135480096864, 0.0018001011411808892, 0.1227654267884331, -0.0010556139908501027, -0.00023301036950821677, 0.07892744305071472, 0.006066763204418951, -0.09982742238674819, 0.30831285851237217, -0.006359958595791717, -0.2808463216736269, 0.22696651705759174, -0.27696196968310777, -0.17211270669797135, 0.05089038435260501, 0.09522045827988121, 0.1953425917283626, -0.10539736535492135, 0.1766881317375975, -0.16302435945167584, 0.1108740461461338, 0.0881045789193408, 0.08639035150006322, 0.10223233408904002, 0.043159608780923814, 0.12391316265810604, 0.1297441428774439, 0.058362077432972045, -0.11083191883876736, -0.31451517699953213, -0.106961035112172, -0.1832035411908119, 0.059044291233869534, -0.12935676596994816, -0.19396764699967556, 0.392849576573267, 0.0949254266495161, 0.22928053855229122, 0.1040887060161266, 0.20501429730175455, 0.06696387842573502, 0.10471910716574868, 0.07220644961444685, 0.1380097786741429, 0.17001391544271213, 0.10040160798594172, -0.1295410369977033, -0.022746461823749366, 0.15750409846113603] |
1,803.00238 | Shape model of the asteroid (2501) Lohja from long-term photometric
observations | We present lightcurves, shapes, and a 3D convex spin-axis model for the
main-belt asteroid (2501) Lohja. The models were obtained with the lightcurve
inversion process using combined dense photometric data from the apparitions
between years 2006 and 2017. The analysis found a sidereal period of
3.80835\,hours, and a possible ecliptic pole solution (J2000.0), the prograde
sense of rotation and main ratios of the ellipsoidal model.
| astro-ph.EP | we present lightcurves shapes and a 3d convex spinaxis model for the mainbelt asteroid 2501 lohja the models were obtained with the lightcurve inversion process using combined dense photometric data from the apparitions between years 2006 and 2017 the analysis found a sidereal period of 380835hours and a possible ecliptic pole solution j20000 the prograde sense of rotation and main ratios of the ellipsoidal model | [['we', 'present', 'lightcurves', 'shapes', 'and', 'a', '3d', 'convex', 'spinaxis', 'model', 'for', 'the', 'mainbelt', 'asteroid', '2501', 'lohja', 'the', 'models', 'were', 'obtained', 'with', 'the', 'lightcurve', 'inversion', 'process', 'using', 'combined', 'dense', 'photometric', 'data', 'from', 'the', 'apparitions', 'between', 'years', '2006', 'and', '2017', 'the', 'analysis', 'found', 'a', 'sidereal', 'period', 'of', '380835hours', 'and', 'a', 'possible', 'ecliptic', 'pole', 'solution', 'j20000', 'the', 'prograde', 'sense', 'of', 'rotation', 'and', 'main', 'ratios', 'of', 'the', 'ellipsoidal', 'model']] | [-0.07073686757524099, 0.05815337301187572, -0.1250427100836994, 0.06134517002026278, -0.06962336388246584, -0.05617168117758064, 0.05282596101806987, 0.38369192088407184, -0.19682460854251294, -0.3521086074530132, 0.12287498268091844, -0.28046907587272546, -0.14294020488621698, 0.19115300770730725, -0.11045791851800113, 0.07819582518589284, 0.17821721568526255, -0.08702997855901246, -0.057974948933059794, -0.22377384040090773, 0.20267420491233232, 0.05398535088355106, 0.15362602218409024, -0.10725902987732774, 0.11131730604924202, -0.002441735827319679, -0.07246826614838996, -0.05218735465868598, -0.18375084892890992, 0.0981958783601248, 0.15893283733130953, 0.14652564576161758, 0.09730086836313444, -0.34074513685135616, -0.14900662666251366, 0.0565904577647055, 0.09205573795747662, 0.07403443366407401, -0.024498735998003257, -0.3230646901897022, -0.006616683898582345, -0.17336078909122282, -0.19493477413105587, 0.010250588093647763, 0.12095910845886147, 0.025452780040232315, -0.26738285013134516, 0.13510716543163334, 0.07904166008700572, 0.17653898814959185, -0.18139986006454342, -0.16222143285567797, -0.10489195217156694, 0.08028083805379177, 0.11606161338822281, 0.07482361423945616, 0.06929711781124333, -0.006932664448247542, -0.0884605345172098, 0.42650331890890525, -0.06488570652066893, -0.03039349222348796, 0.1643101529011296, -0.19329230222732774, -0.12022245245882207, 0.17625197332115874, 0.23776303287891168, 0.11836787242634547, -0.16168738600529087, 0.04128036380649382, -0.04806913164192959, 0.2112294120625371, 0.09519797913907539, -0.07003528725296732, 0.2981877319278225, 0.10863757643493868, 0.02159391604142175, 0.08964811074030068, -0.30438644746466287, -0.06780957746308386, -0.2326290701175966, -0.04207321024307656, -0.11968893262128981, -0.004640049561636434, -0.1187156195574928, -0.10036882759618854, 0.4169501450415405, 0.09144042350632685, 0.20868299876354515, 0.061635936891275736, 0.2897689612434497, 0.03624311989978961, 0.042323334681448554, 0.12345016474229475, 0.32820616109621903, 0.10594001379869288, 0.1240456141014066, -0.19159655167632514, 0.08055604987644724, 0.028144232381785674] |
1,803.00239 | Dual skew codes from annihilators: Transpose Hamming ring extensions | In this paper a framework to study the dual of skew cyclic codes is proposed.
The transposed Hamming ring extensions are based in the existence of an
anti-isomorphism of algebras between skew polynomial rings. Our construction is
applied to left ideal convolutional codes, skew constacyclic codes and skew
Reed-Solomon code, showing that the dual of these codes belong to the same
class.
| cs.IT math.IT math.RA | in this paper a framework to study the dual of skew cyclic codes is proposed the transposed hamming ring extensions are based in the existence of an antiisomorphism of algebras between skew polynomial rings our construction is applied to left ideal convolutional codes skew constacyclic codes and skew reedsolomon code showing that the dual of these codes belong to the same class | [['in', 'this', 'paper', 'a', 'framework', 'to', 'study', 'the', 'dual', 'of', 'skew', 'cyclic', 'codes', 'is', 'proposed', 'the', 'transposed', 'hamming', 'ring', 'extensions', 'are', 'based', 'in', 'the', 'existence', 'of', 'an', 'antiisomorphism', 'of', 'algebras', 'between', 'skew', 'polynomial', 'rings', 'our', 'construction', 'is', 'applied', 'to', 'left', 'ideal', 'convolutional', 'codes', 'skew', 'constacyclic', 'codes', 'and', 'skew', 'reedsolomon', 'code', 'showing', 'that', 'the', 'dual', 'of', 'these', 'codes', 'belong', 'to', 'the', 'same', 'class']] | [-0.18887899463034927, 0.03278569091743257, -0.06210158005236618, 0.09409052157031011, -0.02608867012144577, -0.23392960024366696, -0.10724406429348633, 0.3808900595852925, -0.4400226230162286, -0.13345464489482825, 0.13028889322923798, -0.21338279869767926, -0.18739070594611187, 0.190551420493472, -0.16641956389010434, 0.023736297828896392, 0.035543971402089924, 0.04091552954407469, -0.20907624021187546, -0.3637989586249234, 0.3620912119025184, 0.17278452248748152, 0.240480461368157, -0.0056372028475086535, 0.05123528774316993, -0.015682116334867335, -0.06862401360675933, -0.019536584765920715, -0.19301391159047676, 0.14803961454139603, 0.3032214235995085, 0.14106654919563763, 0.14882470841609663, -0.3284463121165191, -0.12673579804897833, 0.17916716546601347, 0.1345505741980648, 0.11365424320402165, -0.05534302652813494, -0.19913853359438718, 0.16701229394980585, -0.26863087918008527, -0.044752286942375284, 0.018708796480730656, 0.04366424249582774, 0.0493206821735047, -0.29483740902956457, -0.049166798786891085, 0.12699435810528456, 0.1174224030767237, -0.03959298225480222, -0.11423561260885289, 0.052720749716935376, 0.07510337376246048, -0.05864920877971717, 0.016476383271266618, 0.02743183229599268, -0.02161743003319228, -0.19975657256380205, 0.34056424737096797, -0.01128987146301135, -0.22575044409642298, 0.09187686119243622, -0.11013621311154097, -0.08640857364591811, 0.11553368696026624, 0.1655681614103096, 0.15212477664012583, -0.08219447632830951, 0.16229945059110892, -0.2049346039251935, 0.09013209257635378, 0.09910073838076525, 0.10418827055893358, 0.19786258650222613, 0.02309195930889297, -0.006985691548306344, 0.2681720010455578, -0.015870500596300248, -0.09264205792738546, -0.31037389390891595, -0.15301204243376326, -0.1343137600849713, 0.033668846030899834, -0.12802460091540613, -0.23598255036819366, 0.4403514859657134, 0.1413166835423439, 0.09308989015698899, 0.1135400700187611, 0.1947539111358985, -0.05478033308322812, 0.20509525166163523, 0.16430158208635065, 0.08757612047596805, 0.2726961159252472, -0.0844775439360209, -0.2048467217659157, 0.031066328692700592, 0.2215695300650212] |
1,803.0024 | On a new generalization of metric spaces | In this paper, we introduce the $\mathcal{F}$-metric space concept, which
generalizes the metric space notion. We define a natural topology
$\tau_{\mathcal{F}}$ in such spaces and we study their topological properties.
Moreover, we establish a new version of the Banach contraction principle in the
setting of $\mathcal{F}$-metric spaces. Several examples are presented to
illustrate our study.
| math.GN | in this paper we introduce the mathcalfmetric space concept which generalizes the metric space notion we define a natural topology tau_mathcalf in such spaces and we study their topological properties moreover we establish a new version of the banach contraction principle in the setting of mathcalfmetric spaces several examples are presented to illustrate our study | [['in', 'this', 'paper', 'we', 'introduce', 'the', 'mathcalfmetric', 'space', 'concept', 'which', 'generalizes', 'the', 'metric', 'space', 'notion', 'we', 'define', 'a', 'natural', 'topology', 'tau_mathcalf', 'in', 'such', 'spaces', 'and', 'we', 'study', 'their', 'topological', 'properties', 'moreover', 'we', 'establish', 'a', 'new', 'version', 'of', 'the', 'banach', 'contraction', 'principle', 'in', 'the', 'setting', 'of', 'mathcalfmetric', 'spaces', 'several', 'examples', 'are', 'presented', 'to', 'illustrate', 'our', 'study']] | [-0.12466450054543438, 0.08585637398667771, -0.09130523903985266, 0.1398527746463919, -0.10212024491004369, -0.0005184540145651057, 0.03183595436254378, 0.3822893176779703, -0.33508972074250104, -0.2077160501093776, 0.11163695344779019, -0.2061458720860106, -0.26149467120154035, 0.19988165951023498, -0.19452334425619078, -0.00019113019246745993, 0.030687925940448488, 0.02056135670971815, -0.13304659077483746, -0.2483921948328821, 0.45927745531554576, -0.021337144490745332, 0.25285223016032465, 0.04902143865237357, 0.11109380952634469, 0.017788122494325594, -0.056840419907260825, 0.06333871466793223, -0.2520785114934875, 0.19231565348390076, 0.22946397815313604, 0.14147151487931195, 0.3138080984698953, -0.32149666975493785, -0.21072456642502435, 0.16711614774195133, 0.043352120840508074, 0.06309820701480257, -0.053569849459799354, -0.32729278932566996, 0.09886776636078677, -0.18314026165063735, -0.11917402925125013, -0.16974715492041367, -0.05473594132948805, -0.0012844448512489045, -0.22766553670926779, -0.05793719743033526, 0.12877934624406476, 0.06186909144054408, -0.10867318873190218, -0.008493360442419847, 0.03534441731042332, 0.05210285011196026, 0.0029029402088511873, 0.01734744142568498, 0.0569280038708476, -0.0004358798463794368, -0.16875997871263987, 0.36459663424089, -0.04978845116716844, -0.24644459915105943, 0.19309421351041506, -0.14695215706403056, -0.21383756812213472, -0.03302355521117096, 0.19875081456093877, 0.17281046275187423, -0.09892185834339923, 0.14888347047100844, -0.11056640885632348, 0.05288684002503201, 0.043061692948901546, 0.12553635108526107, 0.07522523817304452, 0.18654139683133475, 0.12998984199603675, 0.24918071280612988, -0.013929683896195557, -0.11117213316632572, -0.37187723629176617, -0.2635026940972441, -0.14121233016097298, 0.01981816166597936, -0.08880205558482514, -0.17819623304186044, 0.39935044080225957, 0.15994300803652517, 0.2218366284268322, 0.11438311272757817, 0.21186873042110907, 0.0552902205575568, -0.014575513463501853, 0.04879395477473736, 0.20118459689223933, 0.16584113354070318, 0.090097970061901, -0.10481346238628719, -0.015087653779321246, 0.19140109163708985] |
1,803.00241 | Radial extensions in fractional Sobolev spaces | Given $f:\partial (-1,1)^n\to{\mathbb R}$, consider its radial extension
$Tf(X):=f(X/\|X\|_{\infty})$, $\forall\, X\in [-1,1]^n\setminus\{0\}$. In "On
some questions of topology for $S^1$-valued fractional Sobolev spaces" (RACSAM
2001), the first two authors (HB and PM) stated the following auxiliary result
(Lemma D.1). If $0<s<1$, $1< p<\infty$ and $n\ge 2$ are such that $1<sp<n$,
then $f\mapsto Tf$ is a bounded linear operator from $W^{s,p}(\partial
(-1,1)^n)$ into $W^{s,p}((-1,1)^n)$. The proof of this result contained a flaw
detected by the third author (IS). We present a correct proof. We also
establish a variant of this result involving higher order derivatives and more
general radial extension operators. More specifically, let $B$ be the unit ball
for the standard Euclidean norm $|\ |$ in ${\mathbb R}^n$, and set
$U_af(X):=|X|^a\, f(X/|X|)$, $\forall\, X\in \overline B\setminus\{0\}$,
${\forall\,} f:\partial B\to{\mathbb R}$. Let $a\in{\mathbb R}$, $s>0$, $1\le
p<\infty$ and $n\ge 2$ be such that $(s-a)p<n$. Then $f\mapsto U_af$ is a
bounded linear operator from $W^{s,p}(\partial B)$ into $W^{s,p}(B)$.
| math.FA | given fpartial 11ntomathbb r consider its radial extension tfxfxx_infty forall xin 11nsetminus0 in on some questions of topology for s1valued fractional sobolev spaces racsam 2001 the first two authors hb and pm stated the following auxiliary result lemma d1 if 0s1 1 pinfty and nge 2 are such that 1spn then fmapsto tf is a bounded linear operator from wsppartial 11n into wsp11n the proof of this result contained a flaw detected by the third author is we present a correct proof we also establish a variant of this result involving higher order derivatives and more general radial extension operators more specifically let b be the unit ball for the standard euclidean norm in mathbb rn and set u_afxxa fxx forall xin overline bsetminus0 forall fpartial btomathbb r let ainmathbb r s0 1le pinfty and nge 2 be such that sapn then fmapsto u_af is a bounded linear operator from wsppartial b into wspb | [['given', 'fpartial', '11ntomathbb', 'r', 'consider', 'its', 'radial', 'extension', 'tfxfxx_infty', 'forall', 'xin', '11nsetminus0', 'in', 'on', 'some', 'questions', 'of', 'topology', 'for', 's1valued', 'fractional', 'sobolev', 'spaces', 'racsam', '2001', 'the', 'first', 'two', 'authors', 'hb', 'and', 'pm', 'stated', 'the', 'following', 'auxiliary', 'result', 'lemma', 'd1', 'if', '0s1', '1', 'pinfty', 'and', 'nge', '2', 'are', 'such', 'that', '1spn', 'then', 'fmapsto', 'tf', 'is', 'a', 'bounded', 'linear', 'operator', 'from', 'wsppartial', '11n', 'into', 'wsp11n', 'the', 'proof', 'of', 'this', 'result', 'contained', 'a', 'flaw', 'detected', 'by', 'the', 'third', 'author', 'is', 'we', 'present', 'a', 'correct', 'proof', 'we', 'also', 'establish', 'a', 'variant', 'of', 'this', 'result', 'involving', 'higher', 'order', 'derivatives', 'and', 'more', 'general', 'radial', 'extension', 'operators', 'more', 'specifically', 'let', 'b', 'be', 'the', 'unit', 'ball', 'for', 'the', 'standard', 'euclidean', 'norm', 'in', 'mathbb', 'rn', 'and', 'set', 'u_afxxa', 'fxx', 'forall', 'xin', 'overline', 'bsetminus0', 'forall', 'fpartial', 'btomathbb', 'r', 'let', 'ainmathbb', 'r', 's0', '1le', 'pinfty', 'and', 'nge', '2', 'be', 'such', 'that', 'sapn', 'then', 'fmapsto', 'u_af', 'is', 'a', 'bounded', 'linear', 'operator', 'from', 'wsppartial', 'b', 'into', 'wspb']] | [-0.1381798608238402, 0.06707698092828701, -0.016711710235899197, 0.048893756066731006, -0.07355032492802858, -0.19952560719233794, -0.018710878410402844, 0.32083687014405576, -0.31144097772374435, -0.12783937776009519, 0.12807815930884803, -0.3610565580516188, -0.0962622106291721, 0.146701355061402, -0.11641065943428695, 0.015804671131084268, 0.00018811629901469592, 0.06695080554427606, -0.0661381557616602, -0.2541086426755728, 0.3181512331209657, -0.15357269664929563, 0.09803433386563049, 0.06244319765894136, 0.07228945844526351, 0.027220367494983678, 0.0234614612672373, -0.041257970025238226, -0.2505818017612705, 0.08086442739479768, 0.2563907683656459, 0.1424530601689697, 0.34069009220332536, -0.347260323366229, -0.15883324955898323, 0.23224085630048855, 0.16819756180638265, -0.08474162754169862, 1.956183036205582e-05, -0.30904605179618466, 0.14914896256047708, -0.1173330998625344, -0.14194663629119456, -0.04491235706036989, 0.13220680307295227, 0.00490869050943883, -0.37701773354914825, 0.09379682152898504, 0.2076429502225258, 0.07372929858909526, -0.10412563891051678, -0.1773871330004907, -0.042004723572434566, 0.004430739135271542, -0.05414487948414909, 0.21080379782270797, 0.03494186695455245, 0.021981808274958124, -0.0684196366026709, 0.3374920616346136, -0.09212569774105542, -0.25827086303697927, 0.043251662606924354, -0.2042897348324965, -0.16508726371635854, 0.011030287327717098, 0.09640385110823202, 0.1793373771221705, -0.07099028197149942, 0.24456332774601655, -0.09590444168154623, 0.15811383842892737, 0.15224713863949227, 0.014762266250868315, 0.03345175529830158, 0.04238492330785473, 0.13088481679794864, 0.09848175726955573, -0.0019010233473111416, 0.02584015596764569, -0.4025758280628689, -0.17190375175281153, -0.19284774137916647, 0.16141037530803554, -0.128777745592512, -0.08614712647936294, 0.29452450552456816, 0.05000230973638909, 0.17045179500841393, 0.11803735776568278, 0.20352415555865097, 0.10570105175337259, -0.006565245479988066, 0.12968907915186925, 0.07686068846218609, 0.14902704983825046, 0.060012792043624, -0.11117672994503305, -0.011818270038314899, 0.2051053729675248] |
1,803.00242 | Inorbit Performance of the Hard X-ray Telescope (HXT) on board the
Hitomi (ASTRO-H) satellite | Hitomi (ASTRO-H) carries two Hard X-ray Telescopes (HXTs) that can focus
X-rays up to 80 keV. Combined with the Hard X-ray Imagers (HXIs) that detect
the focused X-rays, imaging spectroscopy in the high-energy band from 5 keV to
80 keV is made possible. We studied characteristics of HXTs after the launch
such as the encircled energy function (EEF) and the effective area using the
data of a Crab observation. The half power diameters (HPDs) in the 5--80 keV
band evaluated from the EEFs are 1.59 arcmin for HXT-1 and 1.65 arcmin for
HXT-2. Those are consistent with the HPDs measured with ground experiments when
uncertainties are taken into account. We can conclude that there is no
significant change in the characteristics of the HXTs before and after the
launch. The off-axis angle of the aim point from the optical axis is evaluated
to be less than 0.5 arcmin for both HXT-1 and HXT-2. The best-fit parameters
for the Crab spectrum obtained with the HXT-HXI system are consistent with the
canonical values.
| astro-ph.IM astro-ph.HE | hitomi astroh carries two hard xray telescopes hxts that can focus xrays up to 80 kev combined with the hard xray imagers hxis that detect the focused xrays imaging spectroscopy in the highenergy band from 5 kev to 80 kev is made possible we studied characteristics of hxts after the launch such as the encircled energy function eef and the effective area using the data of a crab observation the half power diameters hpds in the 580 kev band evaluated from the eefs are 159 arcmin for hxt1 and 165 arcmin for hxt2 those are consistent with the hpds measured with ground experiments when uncertainties are taken into account we can conclude that there is no significant change in the characteristics of the hxts before and after the launch the offaxis angle of the aim point from the optical axis is evaluated to be less than 05 arcmin for both hxt1 and hxt2 the bestfit parameters for the crab spectrum obtained with the hxthxi system are consistent with the canonical values | [['hitomi', 'astroh', 'carries', 'two', 'hard', 'xray', 'telescopes', 'hxts', 'that', 'can', 'focus', 'xrays', 'up', 'to', '80', 'kev', 'combined', 'with', 'the', 'hard', 'xray', 'imagers', 'hxis', 'that', 'detect', 'the', 'focused', 'xrays', 'imaging', 'spectroscopy', 'in', 'the', 'highenergy', 'band', 'from', '5', 'kev', 'to', '80', 'kev', 'is', 'made', 'possible', 'we', 'studied', 'characteristics', 'of', 'hxts', 'after', 'the', 'launch', 'such', 'as', 'the', 'encircled', 'energy', 'function', 'eef', 'and', 'the', 'effective', 'area', 'using', 'the', 'data', 'of', 'a', 'crab', 'observation', 'the', 'half', 'power', 'diameters', 'hpds', 'in', 'the', '580', 'kev', 'band', 'evaluated', 'from', 'the', 'eefs', 'are', '159', 'arcmin', 'for', 'hxt1', 'and', '165', 'arcmin', 'for', 'hxt2', 'those', 'are', 'consistent', 'with', 'the', 'hpds', 'measured', 'with', 'ground', 'experiments', 'when', 'uncertainties', 'are', 'taken', 'into', 'account', 'we', 'can', 'conclude', 'that', 'there', 'is', 'no', 'significant', 'change', 'in', 'the', 'characteristics', 'of', 'the', 'hxts', 'before', 'and', 'after', 'the', 'launch', 'the', 'offaxis', 'angle', 'of', 'the', 'aim', 'point', 'from', 'the', 'optical', 'axis', 'is', 'evaluated', 'to', 'be', 'less', 'than', '05', 'arcmin', 'for', 'both', 'hxt1', 'and', 'hxt2', 'the', 'bestfit', 'parameters', 'for', 'the', 'crab', 'spectrum', 'obtained', 'with', 'the', 'hxthxi', 'system', 'are', 'consistent', 'with', 'the', 'canonical', 'values']] | [-0.04455171277758626, 0.14189219155360194, -0.0321100177101382, 0.08786916900241588, -0.04951849898959442, -0.10737231911994835, 0.028586090718418722, 0.4589398650497925, -0.19718456524140315, -0.40090112411417067, 0.11525821236385282, -0.3629112602552263, 0.0021907244326274207, 0.26437618159802584, -0.009502534345700973, 0.02436401065740317, 0.083351898699908, -0.04064975551289802, -0.08766100768293765, -0.20541911804906615, 0.23255593900883956, 0.1350682397875594, 0.20053822605688942, 0.038476744144246344, 0.08805856079703606, 0.008870866362618782, -0.027383246214878632, 0.0012833439750687741, -0.09138109404007193, 0.048165292277500577, 0.2306677992895768, 0.0773914166301682, 0.19363722237531186, -0.3657016394526425, -0.1929092431872538, 0.06195374816179094, 0.10423117253656794, -0.049117920820873864, 0.012137715689122404, -0.27036134854367955, 0.08642492785887643, -0.1647621486094644, -0.16257911618435528, 0.04102411327270291, -0.0010757738747066113, 0.016463703595147264, -0.1748838848107858, 0.05922563016282788, -0.03733167184300993, 0.07022604683879763, -0.14494921133580912, -0.15538361548125268, -0.018939182857937383, 0.08120851602533792, 0.04954911804638758, 0.0765317027945435, 0.14002242312048244, -0.10098426011334197, -0.07016156713205685, 0.3954114538515214, -0.022290724883776685, -0.022995108079801246, 0.1228062704875611, -0.20009164505058946, -0.11769198364771266, 0.24104736046297703, 0.09162839388325043, 0.05973157399935966, -0.1341119340906472, 0.027940727881065046, 0.00517433420925333, 0.2596538867668331, 0.061545897921172495, 0.045704263193595294, 0.24914965611632642, 0.11906354427522207, 0.025261944415411207, 0.13494082630992435, -0.27989880938264655, -0.021478627368640268, -0.24869115477024645, -0.06758340327076262, -0.14385665083451696, 0.0824900522441944, -0.07636966858954998, -0.0617750884607298, 0.39881565125954405, 0.1341921220556265, 0.20914761287092073, 0.007993410534520701, 0.3254315300004148, 0.09336752894479304, 0.0901583125353837, 0.07987549629207223, 0.36621458026603226, 0.09607803769176826, 0.11346625354674804, -0.16296045556692862, 0.013500099374185793, -0.05591976731339833] |
1,803.00243 | Fundamental parameters of massive stars in multiple systems: The cases
of HD17505A and HD206267A | Many massive stars are part of binary or higher multiplicity systems. The
present work focusses on two higher multiplicity systems: HD17505A and
HD206267A. Determining the fundamental parameters of the components of the
inner binary of these systems is mandatory to quantify the impact of binary or
triple interactions on their evolution. We analysed high-resolution optical
spectra to determine new orbital solutions of the inner binary systems. After
subtracting the spectrum of the tertiary component, a spectral disentangling
code was applied to reconstruct the individual spectra of the primary and
secondary. We then analysed these spectra with the non-LTE model atmosphere
code CMFGEN to establish the stellar parameters and the CNO abundances of these
stars. The inner binaries of these systems have eccentric orbits with e ~ 0.13
despite their relatively short orbital periods of 8.6 and 3.7 days for
HD17505Aa and HD206267Aa, respectively. Slight modifications of the CNO
abundances are found in both components of each system. The components of
HD17505Aa are both well inside their Roche lobe, whilst the primary of
HD206267Aa nearly fills its Roche lobe around periastron passage. Whilst the
rotation of the primary of HD206267Aa is in pseudo-synchronization with the
orbital motion, the secondary displays a rotation rate that is higher. The CNO
abundances and properties of HD17505Aa can be explained by single star
evolutionary models accounting for the effects of rotation, suggesting that
this system has not yet experienced binary interaction. The properties of
HD206267Aa suggest that some intermittent binary interaction might have taken
place during periastron passages, but is apparently not operating anymore.
| astro-ph.SR | many massive stars are part of binary or higher multiplicity systems the present work focusses on two higher multiplicity systems hd17505a and hd206267a determining the fundamental parameters of the components of the inner binary of these systems is mandatory to quantify the impact of binary or triple interactions on their evolution we analysed highresolution optical spectra to determine new orbital solutions of the inner binary systems after subtracting the spectrum of the tertiary component a spectral disentangling code was applied to reconstruct the individual spectra of the primary and secondary we then analysed these spectra with the nonlte model atmosphere code cmfgen to establish the stellar parameters and the cno abundances of these stars the inner binaries of these systems have eccentric orbits with e 013 despite their relatively short orbital periods of 86 and 37 days for hd17505aa and hd206267aa respectively slight modifications of the cno abundances are found in both components of each system the components of hd17505aa are both well inside their roche lobe whilst the primary of hd206267aa nearly fills its roche lobe around periastron passage whilst the rotation of the primary of hd206267aa is in pseudosynchronization with the orbital motion the secondary displays a rotation rate that is higher the cno abundances and properties of hd17505aa can be explained by single star evolutionary models accounting for the effects of rotation suggesting that this system has not yet experienced binary interaction the properties of hd206267aa suggest that some intermittent binary interaction might have taken place during periastron passages but is apparently not operating anymore | [['many', 'massive', 'stars', 'are', 'part', 'of', 'binary', 'or', 'higher', 'multiplicity', 'systems', 'the', 'present', 'work', 'focusses', 'on', 'two', 'higher', 'multiplicity', 'systems', 'hd17505a', 'and', 'hd206267a', 'determining', 'the', 'fundamental', 'parameters', 'of', 'the', 'components', 'of', 'the', 'inner', 'binary', 'of', 'these', 'systems', 'is', 'mandatory', 'to', 'quantify', 'the', 'impact', 'of', 'binary', 'or', 'triple', 'interactions', 'on', 'their', 'evolution', 'we', 'analysed', 'highresolution', 'optical', 'spectra', 'to', 'determine', 'new', 'orbital', 'solutions', 'of', 'the', 'inner', 'binary', 'systems', 'after', 'subtracting', 'the', 'spectrum', 'of', 'the', 'tertiary', 'component', 'a', 'spectral', 'disentangling', 'code', 'was', 'applied', 'to', 'reconstruct', 'the', 'individual', 'spectra', 'of', 'the', 'primary', 'and', 'secondary', 'we', 'then', 'analysed', 'these', 'spectra', 'with', 'the', 'nonlte', 'model', 'atmosphere', 'code', 'cmfgen', 'to', 'establish', 'the', 'stellar', 'parameters', 'and', 'the', 'cno', 'abundances', 'of', 'these', 'stars', 'the', 'inner', 'binaries', 'of', 'these', 'systems', 'have', 'eccentric', 'orbits', 'with', 'e', '013', 'despite', 'their', 'relatively', 'short', 'orbital', 'periods', 'of', '86', 'and', '37', 'days', 'for', 'hd17505aa', 'and', 'hd206267aa', 'respectively', 'slight', 'modifications', 'of', 'the', 'cno', 'abundances', 'are', 'found', 'in', 'both', 'components', 'of', 'each', 'system', 'the', 'components', 'of', 'hd17505aa', 'are', 'both', 'well', 'inside', 'their', 'roche', 'lobe', 'whilst', 'the', 'primary', 'of', 'hd206267aa', 'nearly', 'fills', 'its', 'roche', 'lobe', 'around', 'periastron', 'passage', 'whilst', 'the', 'rotation', 'of', 'the', 'primary', 'of', 'hd206267aa', 'is', 'in', 'pseudosynchronization', 'with', 'the', 'orbital', 'motion', 'the', 'secondary', 'displays', 'a', 'rotation', 'rate', 'that', 'is', 'higher', 'the', 'cno', 'abundances', 'and', 'properties', 'of', 'hd17505aa', 'can', 'be', 'explained', 'by', 'single', 'star', 'evolutionary', 'models', 'accounting', 'for', 'the', 'effects', 'of', 'rotation', 'suggesting', 'that', 'this', 'system', 'has', 'not', 'yet', 'experienced', 'binary', 'interaction', 'the', 'properties', 'of', 'hd206267aa', 'suggest', 'that', 'some', 'intermittent', 'binary', 'interaction', 'might', 'have', 'taken', 'place', 'during', 'periastron', 'passages', 'but', 'is', 'apparently', 'not', 'operating', 'anymore']] | [-0.15693694918172696, 0.13367640788374047, -0.08376363469983517, 0.06583970249857884, -0.03901386454526801, -0.09064390594903671, 0.03565004664494609, 0.3870009290840244, -0.2196143357341498, -0.3390708650513261, 0.0886024143328541, -0.27151829301010366, -0.05897529112371558, 0.19141213984585193, -0.06952700619149255, -0.00713324785988334, 0.1441399344067662, 0.025609338230879075, -0.08003750049965674, -0.24426093820329697, 0.3184290513199812, 0.08999243087600917, 0.0977178427592662, -0.0105614506501297, 0.03356361001988262, -0.027996105814054317, -0.04876852397319453, -0.05885820170806255, -0.09491775051307627, 0.08475286708380736, 0.1961458049128879, 0.12928804188936738, 0.1703798169910442, -0.3695178419002332, -0.2169106327000918, 0.05171237822469266, 0.17018386691597698, 0.054695165720659134, -0.031166324207333673, -0.21154079875668685, 0.0920929193749771, -0.22261464716939372, -0.1480461516239302, 0.009132624487847352, 0.07005001453762816, 0.05658975964797719, -0.1976768130120945, 0.08567586952813144, 0.10449774186895411, 0.10023305743379751, -0.1473488724109302, -0.14666050029882172, -0.1041215484501663, 0.16029077675739245, 0.05574811067663177, -0.010142242623260245, 0.1301826191629516, -0.0855234001419376, -0.03973259734812018, 0.42203723961574724, -0.05756430168275983, -0.06653171711695904, 0.23786143704546703, -0.20690596185522736, -0.14309854453495063, 0.16674161141236254, 0.17739226117134876, 0.11981675988499774, -0.17404113976999724, -0.006753757719252462, 0.046074273551425904, 0.20225713923173316, 0.058803513027669396, 0.044784391388020595, 0.3432248243734648, 0.1076534224794159, -0.028972538365081846, 0.0809436103832013, -0.18314895412549959, -0.08387135856901295, -0.18371082662633853, -0.09450833642313228, -0.10206467496027471, 0.03410635456350519, -0.09869069395756469, -0.13251696035513305, 0.3787336433370001, 0.09018831264438631, 0.2111884001733415, 9.218680497724563e-05, 0.2987474176188698, 0.11936313837122725, 0.06687299868190166, 0.10389328829205624, 0.32862415935653644, 0.1859121965471786, 0.07836480761079656, -0.27487720623503265, 0.1135908723645116, 0.019677771094393393] |
1,803.00244 | Minimal time control of exact synchronization for parabolic systems | This paper studies a kind of minimal time control problems related to the
exact synchronization for a controlled linear system of parabolic equations.
Each problem depends on two parameters: the bound of controls and the initial
state. The purpose of such a problem is to find a control (from a constraint
set) synchronizing components of the corresponding solution vector for the
controlled system in the shortest time. In this paper, we build up a necessary
and sufficient condition for the optimal time and the optimal control; we also
obtain how the existence of optimal controls depends on the above mentioned two
parameters.
| math.OC | this paper studies a kind of minimal time control problems related to the exact synchronization for a controlled linear system of parabolic equations each problem depends on two parameters the bound of controls and the initial state the purpose of such a problem is to find a control from a constraint set synchronizing components of the corresponding solution vector for the controlled system in the shortest time in this paper we build up a necessary and sufficient condition for the optimal time and the optimal control we also obtain how the existence of optimal controls depends on the above mentioned two parameters | [['this', 'paper', 'studies', 'a', 'kind', 'of', 'minimal', 'time', 'control', 'problems', 'related', 'to', 'the', 'exact', 'synchronization', 'for', 'a', 'controlled', 'linear', 'system', 'of', 'parabolic', 'equations', 'each', 'problem', 'depends', 'on', 'two', 'parameters', 'the', 'bound', 'of', 'controls', 'and', 'the', 'initial', 'state', 'the', 'purpose', 'of', 'such', 'a', 'problem', 'is', 'to', 'find', 'a', 'control', 'from', 'a', 'constraint', 'set', 'synchronizing', 'components', 'of', 'the', 'corresponding', 'solution', 'vector', 'for', 'the', 'controlled', 'system', 'in', 'the', 'shortest', 'time', 'in', 'this', 'paper', 'we', 'build', 'up', 'a', 'necessary', 'and', 'sufficient', 'condition', 'for', 'the', 'optimal', 'time', 'and', 'the', 'optimal', 'control', 'we', 'also', 'obtain', 'how', 'the', 'existence', 'of', 'optimal', 'controls', 'depends', 'on', 'the', 'above', 'mentioned', 'two', 'parameters']] | [-0.18385679294884788, 0.09827445022757257, -0.04611718446454581, 0.04279758763275858, -0.07375536252306227, -0.13006605034438418, 0.10233080795710432, 0.3047985846185874, -0.31649747945587425, -0.3016117212965208, 0.16835272925969796, -0.20720685946791634, -0.14583373857735127, 0.23136439642814152, -0.05570131317968024, 0.12601458914486655, 0.058603267034734875, 0.08341840020947013, -0.08777849925864561, -0.2260748272232127, 0.35354283023351696, 0.002019320532460423, 0.2662545379945168, 0.04819844600313124, 0.18489584814318838, -0.006019559095376262, 0.009428138714557624, 0.000961581199411668, -0.1799750850380709, 0.11134664676672615, 0.21629093394742585, 0.12797879178405686, 0.3161852214503668, -0.4000782136823617, -0.13721550101706503, 0.1453123884549474, 0.1181765753209737, 0.12694277098475426, -0.021695026678179262, -0.20931094287730315, 0.10726574258125551, -0.09217520536599207, -0.14536196192927367, 0.00647019955566993, 0.011904228515192574, 0.05700499288208198, -0.32467997386394176, 0.03867588557192243, 0.06154868931865648, 0.0016907611816171922, -0.1626838150972902, -0.037817047532264364, 0.0257089362712577, 0.1668486897559727, 0.011417756975610174, 0.0022931009184057804, 0.08327548741362989, -0.11729805403863829, -0.10769877035864721, 0.35611872753931906, -0.054721747821781276, -0.2579914533040103, 0.14940465844291098, -0.06833353263152507, -0.12540952925451612, 0.08204879925481282, 0.21522986322787463, 0.15824239195196652, -0.17462585233699748, 0.07991624477276049, -0.07295616767277904, 0.20853506843559444, 0.04391550263572557, 0.02316375100053847, 0.11812364904429107, 0.18248422048511168, 0.18052503915539858, 0.17051925318881722, -0.0053772701808781015, -0.0900037845998418, -0.35078348445833896, -0.14414474595618873, -0.14518848250108754, 0.01829423809506218, -0.07701359105746686, -0.1577948447152534, 0.45628042130128427, 0.16833353586558836, 0.20283100505669913, 0.0635885169693068, 0.2630995410293633, 0.16800439350980942, -0.016363043863070654, 0.08650189418403897, 0.2267493746179503, 0.09773164287017767, 0.07917199593137804, -0.28880532309823836, 0.08794093426937859, 0.0691639907731145] |
1,803.00245 | Vertex types in threshold and chain graphs | A graph is called a chain graph if it is bipartite and the neighborhoods of
the vertices in each color class form a chain with respect to inclusion. A
threshold graph can be obtained from a chain graph by making adjacent all pairs
of vertices in one color class. Given a graph $G$, let $\lambda$ be an
eigenvalue (of the adjacency matrix) of $G$ with multiplicity $k \geq 1$. A
vertex $v$ of $G$ is a downer, or neutral, or Parter depending whether the
multiplicity of $\lambda$ in $G-v$ is $k-1$, or $k$, or $k+1$, respectively. We
consider vertex types in the above sense in threshold and chain graphs. In
particular, we show that chain graphs can have neutral vertices, disproving a
conjecture by Alazemi {\em et al.}
| math.CO | a graph is called a chain graph if it is bipartite and the neighborhoods of the vertices in each color class form a chain with respect to inclusion a threshold graph can be obtained from a chain graph by making adjacent all pairs of vertices in one color class given a graph g let lambda be an eigenvalue of the adjacency matrix of g with multiplicity k geq 1 a vertex v of g is a downer or neutral or parter depending whether the multiplicity of lambda in gv is k1 or k or k1 respectively we consider vertex types in the above sense in threshold and chain graphs in particular we show that chain graphs can have neutral vertices disproving a conjecture by alazemi em et al | [['a', 'graph', 'is', 'called', 'a', 'chain', 'graph', 'if', 'it', 'is', 'bipartite', 'and', 'the', 'neighborhoods', 'of', 'the', 'vertices', 'in', 'each', 'color', 'class', 'form', 'a', 'chain', 'with', 'respect', 'to', 'inclusion', 'a', 'threshold', 'graph', 'can', 'be', 'obtained', 'from', 'a', 'chain', 'graph', 'by', 'making', 'adjacent', 'all', 'pairs', 'of', 'vertices', 'in', 'one', 'color', 'class', 'given', 'a', 'graph', 'g', 'let', 'lambda', 'be', 'an', 'eigenvalue', 'of', 'the', 'adjacency', 'matrix', 'of', 'g', 'with', 'multiplicity', 'k', 'geq', '1', 'a', 'vertex', 'v', 'of', 'g', 'is', 'a', 'downer', 'or', 'neutral', 'or', 'parter', 'depending', 'whether', 'the', 'multiplicity', 'of', 'lambda', 'in', 'gv', 'is', 'k1', 'or', 'k', 'or', 'k1', 'respectively', 'we', 'consider', 'vertex', 'types', 'in', 'the', 'above', 'sense', 'in', 'threshold', 'and', 'chain', 'graphs', 'in', 'particular', 'we', 'show', 'that', 'chain', 'graphs', 'can', 'have', 'neutral', 'vertices', 'disproving', 'a', 'conjecture', 'by', 'alazemi', 'em', 'et', 'al']] | [-0.16811138624325395, 0.1625284910663299, -0.020416908705281834, -0.009575174541197835, -0.09630343639883139, -0.17864232335520525, 0.03322303094088085, 0.4104436942568374, -0.26882461119177087, -0.30489901175199535, 0.04757437794949741, -0.34903691448677804, -0.10099062476942819, 0.05122915276193193, -0.0491726930208859, -0.04035701775657279, 0.1355448998492359, 0.16921191394240373, 0.02677037102902042, -0.2291517617656306, 0.3219625751953572, -0.04691621368484838, 0.1435928490966381, 0.06091361827335306, 0.06698717800752511, 0.05370424250288615, 0.0424736738944101, 0.11017578080229994, -0.1658978188756991, 0.05971940486998637, 0.24632598595723273, 0.14010046721096076, 0.24436198908185203, -0.3369269685834528, -0.1657706959605483, 0.26101250916955965, 0.10522705624027857, 0.05408502743017697, 0.0395119747013918, -0.22983153960076236, 0.17414856603598253, -0.1327785644606347, -0.09854960820031544, 0.05433341322858478, 0.11683584774829565, 0.019052491005924013, -0.32309350508102586, -0.005653210449963808, 0.120599672139164, 0.03408988197851512, 0.10710645563501332, -0.17613068194912065, -0.07902840187861807, 0.05818147528990512, -0.0855872590761883, 0.0841051451492286, 0.05171736961393247, -0.13590889767972783, -0.167382946623201, 0.35415236925381044, -0.06503064087074664, -0.1633910399322058, 0.11686790909984016, -0.1405664864624481, -0.15896546170632872, 0.10774054261486209, 0.09333110011241857, 0.15998097899044672, -0.11936433840956953, 0.16458081356009527, -0.09844180508258028, 0.1358911250717938, 0.1074328023038568, -0.026741690959574446, 0.1618673519216596, 0.11495301320350595, 0.15667303438512756, 0.17570057030700678, 0.0006333844133815359, 0.03825730912614658, -0.2867312474575426, -0.12449370001050984, -0.2374764792334717, 0.10341679953253044, -0.1486187476832475, -0.16969103430442156, 0.4074819449035983, 0.059489751674246936, 0.26777704493031795, 0.060575571628139604, 0.16724363115749188, 0.08436518919373316, 0.034928143283145294, 0.1718684740601078, 0.09340861900931313, 0.1823022400642494, -0.05844982484326003, -0.15262983952804157, 0.04776005565728401, 0.16170252219492953] |
1,803.00246 | Cographs: Eigenvalues and Dilworth Number | A cograph is a simple graph which contains no path on 4 vertices as an
induced subgraph. The vicinal preorder on the vertex set of a graph is defined
in terms of inclusions among the neighborhoods of vertices. The minimum number
of chains with respect to the vicinal preorder required to cover the vertex set
of a graph $G$ is called the Dilworth number of $G$. We prove that for any
cograph $G$, the multiplicity of any eigenvalue $\lambda\ne0,-1$, does not
exceed the Dilworth number of $G$ and show that this bound is tight. G. F.
Royle [The rank of a cograph, Electron. J. Combin. 10 (2003), Note 11] proved
that if a cograph $G$ has no pair of vertices with the same neighborhood, then
$G$ has no 0 eigenvalue, and asked if beside cographs, there are any other
natural classes of graphs for which this property holds. We give a partial
answer to this question by showing that an $H$-free family of graphs has this
property if and only if it is a subclass of the family of cographs. A similar
result is also shown to hold for the $-1$ eigenvalue.
| math.CO | a cograph is a simple graph which contains no path on 4 vertices as an induced subgraph the vicinal preorder on the vertex set of a graph is defined in terms of inclusions among the neighborhoods of vertices the minimum number of chains with respect to the vicinal preorder required to cover the vertex set of a graph g is called the dilworth number of g we prove that for any cograph g the multiplicity of any eigenvalue lambdane01 does not exceed the dilworth number of g and show that this bound is tight g f royle the rank of a cograph electron j combin 10 2003 note 11 proved that if a cograph g has no pair of vertices with the same neighborhood then g has no 0 eigenvalue and asked if beside cographs there are any other natural classes of graphs for which this property holds we give a partial answer to this question by showing that an hfree family of graphs has this property if and only if it is a subclass of the family of cographs a similar result is also shown to hold for the 1 eigenvalue | [['a', 'cograph', 'is', 'a', 'simple', 'graph', 'which', 'contains', 'no', 'path', 'on', '4', 'vertices', 'as', 'an', 'induced', 'subgraph', 'the', 'vicinal', 'preorder', 'on', 'the', 'vertex', 'set', 'of', 'a', 'graph', 'is', 'defined', 'in', 'terms', 'of', 'inclusions', 'among', 'the', 'neighborhoods', 'of', 'vertices', 'the', 'minimum', 'number', 'of', 'chains', 'with', 'respect', 'to', 'the', 'vicinal', 'preorder', 'required', 'to', 'cover', 'the', 'vertex', 'set', 'of', 'a', 'graph', 'g', 'is', 'called', 'the', 'dilworth', 'number', 'of', 'g', 'we', 'prove', 'that', 'for', 'any', 'cograph', 'g', 'the', 'multiplicity', 'of', 'any', 'eigenvalue', 'lambdane01', 'does', 'not', 'exceed', 'the', 'dilworth', 'number', 'of', 'g', 'and', 'show', 'that', 'this', 'bound', 'is', 'tight', 'g', 'f', 'royle', 'the', 'rank', 'of', 'a', 'cograph', 'electron', 'j', 'combin', '10', '2003', 'note', '11', 'proved', 'that', 'if', 'a', 'cograph', 'g', 'has', 'no', 'pair', 'of', 'vertices', 'with', 'the', 'same', 'neighborhood', 'then', 'g', 'has', 'no', '0', 'eigenvalue', 'and', 'asked', 'if', 'beside', 'cographs', 'there', 'are', 'any', 'other', 'natural', 'classes', 'of', 'graphs', 'for', 'which', 'this', 'property', 'holds', 'we', 'give', 'a', 'partial', 'answer', 'to', 'this', 'question', 'by', 'showing', 'that', 'an', 'hfree', 'family', 'of', 'graphs', 'has', 'this', 'property', 'if', 'and', 'only', 'if', 'it', 'is', 'a', 'subclass', 'of', 'the', 'family', 'of', 'cographs', 'a', 'similar', 'result', 'is', 'also', 'shown', 'to', 'hold', 'for', 'the', '1', 'eigenvalue']] | [-0.16860581813709255, 0.09730600433272349, -0.0346001274298623, 0.02739210156309394, -0.11692624837428292, -0.13287489177386097, 0.04124390331452898, 0.3876115390336073, -0.2647030227208091, -0.32413270947534384, 0.05888049616673425, -0.3145672234009308, -0.13806387549997623, 0.13652040742225555, -0.11969248548513327, -0.012447654429935309, 0.14610663112691794, 0.14808207837357648, 0.028517147293314338, -0.27661440486355965, 0.31755850014779036, -0.05550041482101209, 0.15490076062406646, 0.11392748509704365, 0.11625604566518237, 0.02763907332491393, 0.047272949642867476, 0.1016702351223736, -0.179809654756426, 0.06308608640293732, 0.2486767387944054, 0.15779619584962024, 0.28666781597522073, -0.34552147984992304, -0.14768663372756688, 0.2486589420684345, 0.07870138071340885, 0.018057231489612833, -0.0026443264427648476, -0.19035022649962788, 0.17061144511912663, -0.11845981385266281, -0.09262875695981046, 0.02832924157133599, 0.1552413888671801, -0.016360599279442695, -0.29409564138970373, -0.024045961868921197, 0.17757116099185657, 0.03554370672276234, 0.07754378597903021, -0.14558103127424551, -0.08013848876288034, 0.07987897425855836, -0.04383855306095748, 0.09524963422695477, 0.015485344174274131, -0.09327646812496594, -0.1443583659074362, 0.378764590240542, -0.018391240639270758, -0.16611049354261676, 0.13416527250095353, -0.14845179292953609, -0.18862693897979968, 0.11513047582830707, 0.06114723727214321, 0.15965504406269332, -0.10737898698974406, 0.1661762514249763, -0.1760809461132706, 0.15383288648749913, 0.13452158339506903, 0.0021622109900994216, 0.09302843330143518, 0.1138362011601612, 0.20427084179029492, 0.13868055697646314, 0.02614171131811451, 0.06685803593648354, -0.31390940987977994, -0.13862052821848025, -0.2464103441665934, 0.09564718067731662, -0.1278572483493365, -0.2248671931506888, 0.4077114451540078, 0.08018089831896316, 0.196676243091714, 0.11207896399223953, 0.16266354604950906, 0.09796211339063401, 0.05332655719291243, 0.1831579205326502, 0.1456627806219521, 0.18389214227751327, -0.0659705538458693, -0.17358289430824875, 0.06939374921594732, 0.1651857515482515] |
1,803.00247 | Terminal Iterative Learning Control for Autonomous Aerial Refueling
under Aerodynamic Disturbances | This paper studies the model of the probe-drogue aerial refueling system
under aerodynamic disturbances, and proposes a docking control method based on
terminal iterative learning control to compensate for the docking errors caused
by aerodynamic disturbances. The designed controller works as an additional
unit for the trajectory generation function of the original autopilot system.
Simulations based on our previously published simulation environment show that
the proposed control method has a fast learning speed to achieve a successful
docking control under aerodynamic disturbances including the bow wave effect.
| cs.SY | this paper studies the model of the probedrogue aerial refueling system under aerodynamic disturbances and proposes a docking control method based on terminal iterative learning control to compensate for the docking errors caused by aerodynamic disturbances the designed controller works as an additional unit for the trajectory generation function of the original autopilot system simulations based on our previously published simulation environment show that the proposed control method has a fast learning speed to achieve a successful docking control under aerodynamic disturbances including the bow wave effect | [['this', 'paper', 'studies', 'the', 'model', 'of', 'the', 'probedrogue', 'aerial', 'refueling', 'system', 'under', 'aerodynamic', 'disturbances', 'and', 'proposes', 'a', 'docking', 'control', 'method', 'based', 'on', 'terminal', 'iterative', 'learning', 'control', 'to', 'compensate', 'for', 'the', 'docking', 'errors', 'caused', 'by', 'aerodynamic', 'disturbances', 'the', 'designed', 'controller', 'works', 'as', 'an', 'additional', 'unit', 'for', 'the', 'trajectory', 'generation', 'function', 'of', 'the', 'original', 'autopilot', 'system', 'simulations', 'based', 'on', 'our', 'previously', 'published', 'simulation', 'environment', 'show', 'that', 'the', 'proposed', 'control', 'method', 'has', 'a', 'fast', 'learning', 'speed', 'to', 'achieve', 'a', 'successful', 'docking', 'control', 'under', 'aerodynamic', 'disturbances', 'including', 'the', 'bow', 'wave', 'effect']] | [-0.15847414992154077, 0.020171263612716102, -0.06943318898637973, -0.021019058407630856, -0.05944474397746976, -0.14555189745002534, 0.031717114574221765, 0.3978613208719464, -0.2741112292765878, -0.34091883653038463, 0.13100025784440858, -0.1660411146924246, -0.19790470052705428, 0.260743883695605, -0.14659538043684564, 0.18041203054599464, 0.12199230258201443, -0.030900382377250596, 0.005703944937585918, -0.19911130609905867, 0.2519704369763129, 0.12385570921740213, 0.3077091855852496, -0.019819452813122595, 0.21696426961462684, -0.002187785248510366, 0.021341924501453027, -0.01373414576140254, -0.08659154053029217, 0.11286692757722597, 0.1752549990047809, 0.11221944818511433, 0.3659623813555511, -0.46446304014602374, -0.280363374812052, 0.0474621607640455, 0.11827309058199442, 0.08752808902889143, -0.09616895963513661, -0.3318360359299668, 0.07319842745701588, -0.21269317859307277, -0.09433030959781866, -0.0630997153849146, -0.019640193125882815, 0.06696238491933273, -0.3231481949387248, -0.01923208048047368, 0.021265200891553662, 0.06661286865777964, -0.12193347701564604, -0.06994034639873736, 0.00331577570123468, 0.15669360172766975, 0.05018370756527495, 0.05929142497967235, 0.24696694172547892, -0.105219159548734, -0.14743220388921802, 0.40793992158805215, 0.005651003448292613, -0.25366818638475136, 0.19057643999952043, -0.03439102222774784, -0.07770023158708111, 0.17657387579336417, 0.27127803961724734, 0.09143980873510414, -0.17603530488951608, -0.018432796332405795, -0.005560881891226948, 0.18857202382195135, 0.011709524740919817, -0.07238419998577948, 0.12507245397238537, 0.2338441346987248, 0.1493521537855105, 0.13935766761126214, -0.14284541485776994, -0.10270198813617923, -0.2350709076461837, -0.08412303111710867, -0.13932939391409935, -0.07756285123519605, -0.019814890619674643, -0.13712701902096702, 0.37737706983678565, 0.24088079646922822, 0.10265819125180674, 0.08854119631808338, 0.4675074257822924, 0.07952746083461788, 0.056797003104800875, 0.1001754506859322, 0.26065931959770794, 0.042570938188366075, 0.12094414798369588, -0.3197141091859098, 0.16211623098798703, 0.07523595479988428] |
1,803.00248 | Reducing detrimental electrostatic effects in Casimir-force measurements
and Casimir-force-based microdevices | It is well known that residual electrostatic forces create significant
difficulties to precise measurements of the Casimir force and to wide use of
Casimir-operated microdevices. We experimentally demonstrate that with the help
of Ar-ion cleaning of the surfaces it is possible to make electrostatic effects
negligibly small as compared to the Casimir interaction. Our experimental setup
consists of the dynamic atomic force microscope supplemented with an Ar-ion gun
and argon reservoir. The residual potential difference between the Au-coated
surfaces of a sphere and a plate was measured both before and after the in situ
Ar-ion cleaning. It is shown that this cleaning decreases the magnitude of the
residual potential by up to an order of magnitude and makes it almost
independent on separation. The gradient of the Casimir force was measured using
ordinary samples subjected to the Ar-ion cleaning. The obtained results are
shown to be in good agreement with both previous precision measurements using
the specially selected samples and with theoretical predictions of the Lifshitz
theory. The conclusion is made that the suggested method of in situ Ar-ion
cleaning is effective in reducing the electrostatic effects and therefore is a
great resource for experiments on measuring the Casimir interaction and for
Casimir-operated microdevices.
| quant-ph | it is well known that residual electrostatic forces create significant difficulties to precise measurements of the casimir force and to wide use of casimiroperated microdevices we experimentally demonstrate that with the help of arion cleaning of the surfaces it is possible to make electrostatic effects negligibly small as compared to the casimir interaction our experimental setup consists of the dynamic atomic force microscope supplemented with an arion gun and argon reservoir the residual potential difference between the aucoated surfaces of a sphere and a plate was measured both before and after the in situ arion cleaning it is shown that this cleaning decreases the magnitude of the residual potential by up to an order of magnitude and makes it almost independent on separation the gradient of the casimir force was measured using ordinary samples subjected to the arion cleaning the obtained results are shown to be in good agreement with both previous precision measurements using the specially selected samples and with theoretical predictions of the lifshitz theory the conclusion is made that the suggested method of in situ arion cleaning is effective in reducing the electrostatic effects and therefore is a great resource for experiments on measuring the casimir interaction and for casimiroperated microdevices | [['it', 'is', 'well', 'known', 'that', 'residual', 'electrostatic', 'forces', 'create', 'significant', 'difficulties', 'to', 'precise', 'measurements', 'of', 'the', 'casimir', 'force', 'and', 'to', 'wide', 'use', 'of', 'casimiroperated', 'microdevices', 'we', 'experimentally', 'demonstrate', 'that', 'with', 'the', 'help', 'of', 'arion', 'cleaning', 'of', 'the', 'surfaces', 'it', 'is', 'possible', 'to', 'make', 'electrostatic', 'effects', 'negligibly', 'small', 'as', 'compared', 'to', 'the', 'casimir', 'interaction', 'our', 'experimental', 'setup', 'consists', 'of', 'the', 'dynamic', 'atomic', 'force', 'microscope', 'supplemented', 'with', 'an', 'arion', 'gun', 'and', 'argon', 'reservoir', 'the', 'residual', 'potential', 'difference', 'between', 'the', 'aucoated', 'surfaces', 'of', 'a', 'sphere', 'and', 'a', 'plate', 'was', 'measured', 'both', 'before', 'and', 'after', 'the', 'in', 'situ', 'arion', 'cleaning', 'it', 'is', 'shown', 'that', 'this', 'cleaning', 'decreases', 'the', 'magnitude', 'of', 'the', 'residual', 'potential', 'by', 'up', 'to', 'an', 'order', 'of', 'magnitude', 'and', 'makes', 'it', 'almost', 'independent', 'on', 'separation', 'the', 'gradient', 'of', 'the', 'casimir', 'force', 'was', 'measured', 'using', 'ordinary', 'samples', 'subjected', 'to', 'the', 'arion', 'cleaning', 'the', 'obtained', 'results', 'are', 'shown', 'to', 'be', 'in', 'good', 'agreement', 'with', 'both', 'previous', 'precision', 'measurements', 'using', 'the', 'specially', 'selected', 'samples', 'and', 'with', 'theoretical', 'predictions', 'of', 'the', 'lifshitz', 'theory', 'the', 'conclusion', 'is', 'made', 'that', 'the', 'suggested', 'method', 'of', 'in', 'situ', 'arion', 'cleaning', 'is', 'effective', 'in', 'reducing', 'the', 'electrostatic', 'effects', 'and', 'therefore', 'is', 'a', 'great', 'resource', 'for', 'experiments', 'on', 'measuring', 'the', 'casimir', 'interaction', 'and', 'for', 'casimiroperated', 'microdevices']] | [-0.06645575500673172, 0.13187604796704444, -0.10127467678463327, 0.0036687595420517027, -0.01898823756872132, -0.11095743395139158, 0.023243697477149602, 0.39900943250994725, -0.22907697154660847, -0.35326455000529783, 0.050364078844938945, -0.3196404522543054, -0.11119377699514649, 0.244125436880801, -0.031048960684070197, 0.09092930072254621, 0.0521604155171847, -0.015199358081721728, -0.05946033139105674, -0.24698132819249433, 0.27716856915273214, 0.12196341374575502, 0.30567191706251096, 0.10094487936798446, 0.10955542511683324, 0.0012213079106652795, -0.030532755681525657, 0.0573762957108124, -0.09503738062602057, 0.08899364814549537, 0.19424508002717486, -0.016987752022734892, 0.22024397647911959, -0.4545632650278103, -0.21866861324397718, 0.06156682586908285, 0.07715421900848195, 0.1292783895445213, -0.11185004419329032, -0.26318784577237203, 0.061863112201139624, -0.1338517997727388, -0.12748013604616765, -0.08922031878794562, 0.024978678997393956, 0.007088108572620198, -0.27898168445410354, 0.07601026582141467, 0.012587734895163575, 0.05592264086100282, -0.083919863167016, -0.09953395388605497, -0.00622721986457853, 0.13692547146018852, 0.06646431463604591, 0.07477532616484504, 0.17653426065543057, -0.1048626674000303, -0.04452008395086937, 0.3808560463424661, -0.07993838310271667, -0.1611566626741136, 0.22637784932647823, -0.12177307915984478, -0.021715357634561634, 0.1185497780846856, 0.09140340776855846, 0.08762617681479763, -0.17547992596605627, 0.042142038203609906, 0.044960251377116296, 0.18091172416980314, 0.10273248421623012, -0.05525596056507104, 0.17657294857435593, 0.18135463194760246, 0.04579123305986718, 0.1524182917489117, -0.11576375104763573, -0.02860487726923899, -0.2919301531222271, -0.16075992709634326, -0.18088864723893602, 0.014892559995330722, -0.04117421715204503, -0.15489741938164467, 0.3283816137118265, 0.1621620388065308, 0.18035104695366383, -0.02725888365455488, 0.34653887370518305, 0.07414410155788663, 0.1323200852776149, -0.024347581802682934, 0.32618651083396233, 0.1378657329092171, 0.07406217669192149, -0.2641501874584557, 0.06039177749097338, -0.0023888674931194964] |
1,803.00249 | Topological Bands for Ultracold Atoms | There have been significant recent advances in realizing bandstructures with
geometrical and topological features in experiments on cold atomic gases. We
provide an overview of these developments, beginning with a summary of the key
concepts of geometry and topology for Bloch bands. We describe the different
methods that have been used to generate these novel bandstructures for cold
atoms, as well as the physical observables that have allowed their
characterization. We focus on the physical principles that underlie the
different experimental approaches, providing a conceptual framework within
which to view these developments. However, we also describe how specific
experimental implementations can influence physical properties. Moving beyond
single-particle effects, we describe the forms of inter-particle interactions
that emerge when atoms are subjected to these energy bands, and some of the
many-body phases that may be sought in future experiments.
| cond-mat.quant-gas | there have been significant recent advances in realizing bandstructures with geometrical and topological features in experiments on cold atomic gases we provide an overview of these developments beginning with a summary of the key concepts of geometry and topology for bloch bands we describe the different methods that have been used to generate these novel bandstructures for cold atoms as well as the physical observables that have allowed their characterization we focus on the physical principles that underlie the different experimental approaches providing a conceptual framework within which to view these developments however we also describe how specific experimental implementations can influence physical properties moving beyond singleparticle effects we describe the forms of interparticle interactions that emerge when atoms are subjected to these energy bands and some of the manybody phases that may be sought in future experiments | [['there', 'have', 'been', 'significant', 'recent', 'advances', 'in', 'realizing', 'bandstructures', 'with', 'geometrical', 'and', 'topological', 'features', 'in', 'experiments', 'on', 'cold', 'atomic', 'gases', 'we', 'provide', 'an', 'overview', 'of', 'these', 'developments', 'beginning', 'with', 'a', 'summary', 'of', 'the', 'key', 'concepts', 'of', 'geometry', 'and', 'topology', 'for', 'bloch', 'bands', 'we', 'describe', 'the', 'different', 'methods', 'that', 'have', 'been', 'used', 'to', 'generate', 'these', 'novel', 'bandstructures', 'for', 'cold', 'atoms', 'as', 'well', 'as', 'the', 'physical', 'observables', 'that', 'have', 'allowed', 'their', 'characterization', 'we', 'focus', 'on', 'the', 'physical', 'principles', 'that', 'underlie', 'the', 'different', 'experimental', 'approaches', 'providing', 'a', 'conceptual', 'framework', 'within', 'which', 'to', 'view', 'these', 'developments', 'however', 'we', 'also', 'describe', 'how', 'specific', 'experimental', 'implementations', 'can', 'influence', 'physical', 'properties', 'moving', 'beyond', 'singleparticle', 'effects', 'we', 'describe', 'the', 'forms', 'of', 'interparticle', 'interactions', 'that', 'emerge', 'when', 'atoms', 'are', 'subjected', 'to', 'these', 'energy', 'bands', 'and', 'some', 'of', 'the', 'manybody', 'phases', 'that', 'may', 'be', 'sought', 'in', 'future', 'experiments']] | [-0.07966020521100449, 0.15567253708117726, -0.09953273744263308, 0.04953765811776553, -0.055794856551548706, -0.12352446228454726, 0.015157820984840973, 0.4234517132188531, -0.24227081633348396, -0.30127672174527054, 0.06502789842298902, -0.2734742251670231, -0.18423041485357974, 0.2186847883951513, -0.014391228042043529, 0.0693175565397394, 0.043798859987873584, -0.04077945135519469, -0.10268880208056635, -0.23379693036237598, 0.3156026625614343, 0.05442676402331478, 0.27340592356209736, 0.11653222658576956, 0.045561900828033686, -0.030790292295168383, 0.0001265287460030421, 0.04380202261339603, -0.18367935865182147, 0.14557475184994764, 0.29104730091395153, 0.10227043281370045, 0.24701559850001248, -0.5453295995737764, -0.25375658713713073, 0.058127560507695096, 0.11961778204388701, 0.15761905109789898, -0.09504204437953244, -0.29301369960244367, 0.017056685181898134, -0.1457902202585145, -0.11356090838629482, -0.18325816491868455, 0.014888262777737733, 0.05649642505812918, -0.16382801652450682, 0.008457886218557309, 0.04068451799432059, 0.07234186416093692, -0.06842706776122846, -0.13320533769961068, 0.03485852652026907, 0.15134719460869403, 0.023620103731366766, -0.014808465687868496, 0.13874943247672333, -0.11514964193043271, -0.16083534347379339, 0.41620306172610627, -0.027548263257747327, -0.1744381992848239, 0.26470024017887056, -0.09921193097060482, -0.17537487746702266, 0.06842718241007431, 0.18897154436453475, 0.04424332869171664, -0.13162308763529165, 0.057786768955681335, -0.04531363496367914, 0.11036899776292453, 0.02100486278304479, 0.1571655750470371, 0.27574707578658464, 0.1612651236962689, -0.00397829645468543, 0.09278300210776186, -0.08498867522533712, -0.12332984805781988, -0.3023797973207589, -0.1238436464159547, -0.1555726607212041, 0.019668809119758553, -0.008927366841079134, -0.13425422304620346, 0.42673543733342184, 0.21496107170800763, 0.21217836591286882, -0.05668914418218765, 0.26613283551136113, 0.07516544418699661, 0.06878254741963431, 0.007143618534757769, 0.27608081479527335, 0.09904957138697036, 0.0714247755004444, -0.17298394886513604, 0.04097296106139792, 0.014345722178510134] |
1,803.0025 | Distance Measure Machines | This paper presents a distance-based discriminative framework for learning
with probability distributions. Instead of using kernel mean embeddings or
generalized radial basis kernels, we introduce embeddings based on
dissimilarity of distributions to some reference distributions denoted as
templates. Our framework extends the theory of similarity of Balcan et al.
(2008) to the population distribution case and we show that, for some learning
problems, some dissimilarity on distribution achieves low-error linear decision
functions with high probability. Our key result is to prove that the theory
also holds for empirical distributions. Algorithmically, the proposed approach
consists in computing a mapping based on pairwise dissimilarity where learning
a linear decision function is amenable. Our experimental results show that the
Wasserstein distance embedding performs better than kernel mean embeddings and
computing Wasserstein distance is far more tractable than estimating pairwise
Kullback-Leibler divergence of empirical distributions.
| cs.LG stat.ML | this paper presents a distancebased discriminative framework for learning with probability distributions instead of using kernel mean embeddings or generalized radial basis kernels we introduce embeddings based on dissimilarity of distributions to some reference distributions denoted as templates our framework extends the theory of similarity of balcan et al 2008 to the population distribution case and we show that for some learning problems some dissimilarity on distribution achieves lowerror linear decision functions with high probability our key result is to prove that the theory also holds for empirical distributions algorithmically the proposed approach consists in computing a mapping based on pairwise dissimilarity where learning a linear decision function is amenable our experimental results show that the wasserstein distance embedding performs better than kernel mean embeddings and computing wasserstein distance is far more tractable than estimating pairwise kullbackleibler divergence of empirical distributions | [['this', 'paper', 'presents', 'a', 'distancebased', 'discriminative', 'framework', 'for', 'learning', 'with', 'probability', 'distributions', 'instead', 'of', 'using', 'kernel', 'mean', 'embeddings', 'or', 'generalized', 'radial', 'basis', 'kernels', 'we', 'introduce', 'embeddings', 'based', 'on', 'dissimilarity', 'of', 'distributions', 'to', 'some', 'reference', 'distributions', 'denoted', 'as', 'templates', 'our', 'framework', 'extends', 'the', 'theory', 'of', 'similarity', 'of', 'balcan', 'et', 'al', '2008', 'to', 'the', 'population', 'distribution', 'case', 'and', 'we', 'show', 'that', 'for', 'some', 'learning', 'problems', 'some', 'dissimilarity', 'on', 'distribution', 'achieves', 'lowerror', 'linear', 'decision', 'functions', 'with', 'high', 'probability', 'our', 'key', 'result', 'is', 'to', 'prove', 'that', 'the', 'theory', 'also', 'holds', 'for', 'empirical', 'distributions', 'algorithmically', 'the', 'proposed', 'approach', 'consists', 'in', 'computing', 'a', 'mapping', 'based', 'on', 'pairwise', 'dissimilarity', 'where', 'learning', 'a', 'linear', 'decision', 'function', 'is', 'amenable', 'our', 'experimental', 'results', 'show', 'that', 'the', 'wasserstein', 'distance', 'embedding', 'performs', 'better', 'than', 'kernel', 'mean', 'embeddings', 'and', 'computing', 'wasserstein', 'distance', 'is', 'far', 'more', 'tractable', 'than', 'estimating', 'pairwise', 'kullbackleibler', 'divergence', 'of', 'empirical', 'distributions']] | [-0.010709684367740778, 0.004283990192471455, -0.14359639937401558, 0.13548221364980628, -0.08663651582467904, -0.1260430548333477, 0.04615599183441661, 0.44501366659153435, -0.2681940769750281, -0.28122836078603003, -0.009922070399831636, -0.3143303123243312, -0.19532411518599177, 0.18342642261686318, -0.13929714370149035, 0.1294286155723141, 0.09376501384792281, 0.014294019916775168, -0.1156696789115271, -0.25255094504178704, 0.3492909211678602, 0.05800636669749672, 0.33102371840215955, 0.004291537143488197, 0.1405465517569571, 0.03944920584334866, -0.033772003820416986, 0.020937279923587827, -0.13267124176981276, 0.22547373936737802, 0.25380323786480047, 0.2455764421879426, 0.33429592587912443, -0.30771806359073106, -0.243790086801329, 0.15077789098433886, 0.10596882202167143, 0.031143595304353334, -0.03377505099858696, -0.2875333196658588, 0.07568986344659794, -0.16071199432860875, -0.032803940978099376, -0.13104361831375683, 0.0247794016898471, 0.04619201091002567, -0.3399865178470599, 0.09600797247662579, 0.08503745156769635, 0.05533821727248266, -0.04467385905259784, -0.1796269675829045, 0.06220433513092287, 0.07858634412665158, 0.008100365336442776, 0.08630592540461332, 0.10580327597790207, -0.06023424124206476, -0.14764181838753956, 0.3180889437265747, -0.07236317429936769, -0.25691730950724545, 0.171088481645582, -0.08247683064496898, -0.1476266522848886, 0.02108608576607831, 0.19972560515772578, 0.1548943687362451, -0.14712758520816235, 0.06784856729523167, -0.07824112225244655, 0.12814146663385925, 0.05359796757961736, 0.0019296170014174694, 0.09661216817875491, 0.1793010749140794, 0.1165543073616552, 0.13683370509554785, -0.09432200581522275, -0.14052130312515185, -0.2642764929246078, -0.12099217824928515, -0.26241955885016327, -0.00930156102172819, -0.17748351410301302, -0.18526240323293716, 0.3486095952623068, 0.1563283204652554, 0.24067525423118674, 0.2227275636681217, 0.2948013832066076, 0.09162263415839708, 0.02106755747994844, 0.16105196106161737, 0.15963198589173422, 0.11113346090824311, -0.002361098284162713, -0.12943196089621237, 0.13743342782357537, 0.12108315507954] |
1,803.00251 | A Lagrangian probability-density-function model for collisional
turbulent fluid-particle flows. I. Model derivation | Inertial particles in turbulent flows are characterised by preferential
concentration and segregation and, at sufficient mass loading, dense particle
clusters may spontaneously arise due to momentum coupling between the phases.
These clusters, in turn, can generate and sustain turbulence in the fluid
phase, which we refer to as cluster-induced turbulence. In the present
theoretical work, we tackle the problem of developing a framework for the
stochastic modelling of moderately dense particle-laden flows, based on a
Lagrangian formalism, which naturally includes the Eulerian one. A rigorous
formalism and a general model have been put forward focusing, in particular, on
the two ingredients that are key in moderately dense flows, namely, two-way
coupling in the carrier phase, and the decomposition of the particle-phase
velocity into its spatially correlated and uncorrelated components.
Specifically, this last contribution allows to identify in the stochastic model
the contributions due to the correlated fluctuating energy and to the granular
temperature of the particle phase, which determines the time scale for
particle-particle collisions. Applications of the Lagrangian
probability-density-function model developed in this work to moderately dense
particle-laden flows are discussed in a companion paper.
| physics.flu-dyn | inertial particles in turbulent flows are characterised by preferential concentration and segregation and at sufficient mass loading dense particle clusters may spontaneously arise due to momentum coupling between the phases these clusters in turn can generate and sustain turbulence in the fluid phase which we refer to as clusterinduced turbulence in the present theoretical work we tackle the problem of developing a framework for the stochastic modelling of moderately dense particleladen flows based on a lagrangian formalism which naturally includes the eulerian one a rigorous formalism and a general model have been put forward focusing in particular on the two ingredients that are key in moderately dense flows namely twoway coupling in the carrier phase and the decomposition of the particlephase velocity into its spatially correlated and uncorrelated components specifically this last contribution allows to identify in the stochastic model the contributions due to the correlated fluctuating energy and to the granular temperature of the particle phase which determines the time scale for particleparticle collisions applications of the lagrangian probabilitydensityfunction model developed in this work to moderately dense particleladen flows are discussed in a companion paper | [['inertial', 'particles', 'in', 'turbulent', 'flows', 'are', 'characterised', 'by', 'preferential', 'concentration', 'and', 'segregation', 'and', 'at', 'sufficient', 'mass', 'loading', 'dense', 'particle', 'clusters', 'may', 'spontaneously', 'arise', 'due', 'to', 'momentum', 'coupling', 'between', 'the', 'phases', 'these', 'clusters', 'in', 'turn', 'can', 'generate', 'and', 'sustain', 'turbulence', 'in', 'the', 'fluid', 'phase', 'which', 'we', 'refer', 'to', 'as', 'clusterinduced', 'turbulence', 'in', 'the', 'present', 'theoretical', 'work', 'we', 'tackle', 'the', 'problem', 'of', 'developing', 'a', 'framework', 'for', 'the', 'stochastic', 'modelling', 'of', 'moderately', 'dense', 'particleladen', 'flows', 'based', 'on', 'a', 'lagrangian', 'formalism', 'which', 'naturally', 'includes', 'the', 'eulerian', 'one', 'a', 'rigorous', 'formalism', 'and', 'a', 'general', 'model', 'have', 'been', 'put', 'forward', 'focusing', 'in', 'particular', 'on', 'the', 'two', 'ingredients', 'that', 'are', 'key', 'in', 'moderately', 'dense', 'flows', 'namely', 'twoway', 'coupling', 'in', 'the', 'carrier', 'phase', 'and', 'the', 'decomposition', 'of', 'the', 'particlephase', 'velocity', 'into', 'its', 'spatially', 'correlated', 'and', 'uncorrelated', 'components', 'specifically', 'this', 'last', 'contribution', 'allows', 'to', 'identify', 'in', 'the', 'stochastic', 'model', 'the', 'contributions', 'due', 'to', 'the', 'correlated', 'fluctuating', 'energy', 'and', 'to', 'the', 'granular', 'temperature', 'of', 'the', 'particle', 'phase', 'which', 'determines', 'the', 'time', 'scale', 'for', 'particleparticle', 'collisions', 'applications', 'of', 'the', 'lagrangian', 'probabilitydensityfunction', 'model', 'developed', 'in', 'this', 'work', 'to', 'moderately', 'dense', 'particleladen', 'flows', 'are', 'discussed', 'in', 'a', 'companion', 'paper']] | [-0.13111147245702645, 0.20871726672856078, -0.09900163001911615, 0.047765332388050696, -0.012052019249387485, -0.09745296003342035, -0.012796315179902418, 0.324773625306715, -0.2662457911077366, -0.28615550128042055, 0.051461731599423514, -0.224591827072702, -0.11358246439567177, 0.13905210545917432, -0.029917480178072206, 0.0331042243955752, 0.025463544499499582, -0.040174262312751625, -0.025737051871215288, -0.17228159377218716, 0.3199954815033663, 0.05243944857514874, 0.2725921810406851, 0.07182031182662374, 0.09662017568079655, -0.036098335741928986, -0.06579383887395623, 0.055076564041276775, -0.14056205190237023, 0.08199584549834316, 0.22996140178918878, 0.018003370671067387, 0.24780151306060694, -0.46617209717070546, -0.25877777680314035, 0.08186391277879637, 0.1728851294657591, 0.11402308444995733, -0.07035038772512288, -0.23832723055215133, 0.044733857838637245, -0.1909883933151842, -0.11346847317131456, -0.05585712731830896, 0.010054675121140737, 0.03948736747304949, -0.2746064145736376, 0.12962325073287934, 0.07375660093854211, 0.013381721798620958, -0.0534438548577694, -0.04044089884865248, -0.01990921018765338, 0.09105417918421622, 0.044623930669409693, 0.022463534683269518, 0.13172937298984697, -0.14597331212178843, -0.02906581073040543, 0.4367946868249771, -0.042483622593785166, -0.2102032516211752, 0.24431444117824436, -0.10632799208417387, -0.15187874746568983, 0.1396189325301963, 0.25831138281532195, 0.11124108321554783, -0.16854534713271005, 0.04454967574377905, -0.04032026003715732, 0.12844959996460426, 0.028975728541232086, 0.007422641492060696, 0.22746136303620554, 0.16480587683718212, 0.047493335768830476, 0.12677190329357532, -0.11170340734483894, -0.17106514520472496, -0.2620868275282524, -0.1244959513033175, -0.1390972486546924, -0.021023573719405678, -0.07120671125965365, -0.1521009049054125, 0.380472707672305, 0.16574059641839917, 0.20533817848040453, 0.00832687875804221, 0.2960866094536839, 0.09690171910539991, 0.028135063345118436, 0.1033912630318614, 0.26332352766066147, 0.19312963358462057, 0.1318397363284803, -0.20910413379991247, 0.04587058735537588, 0.08097634133532323] |
1,803.00252 | Self-gravitating envelope solitons in astrophysical compact objects | The propagation of ion-acoustic waves (IAWs) in a collisionless unmagnetized
self-gravitating degenerate quantum plasma system (SG-DQPS) has been studied
theoretically for the first time. A nonlinear Schr\"{o}dinger equation is
derived by using the reductive perturbation method to study the nonlinear
dynamics of the IAWs in the SG-DQPS. It is found that for $k_c > k$ ($k_c < k$)
(where $k_c$ is critical value of the propagation constant $k$ which determines
the stable and unstable region of IAWs) the IAWs are modulationally unstable
(stable), and that $k_c$ depends only on the ratio of the electron number
density to light ion number density. It is also observed that the
self-gravitating bright envelope solitons are modulationally stable. The
results obtained from our present investigation are useful for understanding
the nonlinear propagation of the IAWs in astrophysical compact objects like
white dwarfs and neutron stars.
| physics.plasm-ph | the propagation of ionacoustic waves iaws in a collisionless unmagnetized selfgravitating degenerate quantum plasma system sgdqps has been studied theoretically for the first time a nonlinear schrodinger equation is derived by using the reductive perturbation method to study the nonlinear dynamics of the iaws in the sgdqps it is found that for k_c k k_c k where k_c is critical value of the propagation constant k which determines the stable and unstable region of iaws the iaws are modulationally unstable stable and that k_c depends only on the ratio of the electron number density to light ion number density it is also observed that the selfgravitating bright envelope solitons are modulationally stable the results obtained from our present investigation are useful for understanding the nonlinear propagation of the iaws in astrophysical compact objects like white dwarfs and neutron stars | [['the', 'propagation', 'of', 'ionacoustic', 'waves', 'iaws', 'in', 'a', 'collisionless', 'unmagnetized', 'selfgravitating', 'degenerate', 'quantum', 'plasma', 'system', 'sgdqps', 'has', 'been', 'studied', 'theoretically', 'for', 'the', 'first', 'time', 'a', 'nonlinear', 'schrodinger', 'equation', 'is', 'derived', 'by', 'using', 'the', 'reductive', 'perturbation', 'method', 'to', 'study', 'the', 'nonlinear', 'dynamics', 'of', 'the', 'iaws', 'in', 'the', 'sgdqps', 'it', 'is', 'found', 'that', 'for', 'k_c', 'k', 'k_c', 'k', 'where', 'k_c', 'is', 'critical', 'value', 'of', 'the', 'propagation', 'constant', 'k', 'which', 'determines', 'the', 'stable', 'and', 'unstable', 'region', 'of', 'iaws', 'the', 'iaws', 'are', 'modulationally', 'unstable', 'stable', 'and', 'that', 'k_c', 'depends', 'only', 'on', 'the', 'ratio', 'of', 'the', 'electron', 'number', 'density', 'to', 'light', 'ion', 'number', 'density', 'it', 'is', 'also', 'observed', 'that', 'the', 'selfgravitating', 'bright', 'envelope', 'solitons', 'are', 'modulationally', 'stable', 'the', 'results', 'obtained', 'from', 'our', 'present', 'investigation', 'are', 'useful', 'for', 'understanding', 'the', 'nonlinear', 'propagation', 'of', 'the', 'iaws', 'in', 'astrophysical', 'compact', 'objects', 'like', 'white', 'dwarfs', 'and', 'neutron', 'stars']] | [-0.19846182504313722, 0.22387532244952354, -0.09010864451876004, 0.07525232889716306, -0.06712059487367598, -0.11364189021476953, -0.04332630014341834, 0.29861978777824977, -0.2086705293023972, -0.22033597364110483, 0.05841972322869885, -0.27173432844134865, -0.1072100507624769, 0.2285916412319559, 0.08691011876577223, 0.07431753631681204, 0.048872521436913945, 0.046929642686657204, 0.021684788423757866, -0.19852501102438425, 0.338746785055578, 0.0607386339253163, 0.235759180682383, -0.0033052209898722256, 0.050713796352820216, -0.054949167481013875, 0.05139035031722068, -0.0007547067860208398, -0.19388515817566998, 0.0021140850450602367, 0.2482853378437245, 0.050485103159955295, 0.2509844662628318, -0.392047028626791, -0.2953412223995911, 0.06087412509611614, 0.19804020877257525, 0.10243606227935835, -0.03988972468018572, -0.28685028525404366, 0.11740715016791825, -0.09275985383361632, -0.1810899246886051, -0.0327442293155858, 0.11104080046145179, 0.060791327304829904, -0.2484977525933612, 0.11550803227319127, 0.07720571573741614, -0.022504608796762048, -0.09130055797051825, -0.08857366137404209, -0.0705799867362186, 0.003428706771982231, 0.04101431237118278, 0.0304954252490546, 0.13640070771262477, -0.13212759258131757, 0.011852749472604595, 0.40474449268001195, -0.10913247001196573, -0.13617670020547515, 0.16945366731596936, -0.17294915580955375, -0.04591732476871434, 0.21066702995449305, 0.1742044655545849, 0.19215438166036933, -0.07047091394984464, 0.07012476516668115, -0.06964990285747825, 0.14679213304365438, 0.11274164073209432, 0.02359250367438193, 0.22419927488315664, 0.18157715997792673, 0.041495182357138866, 0.0884114041985825, -0.0905841852474636, -0.11836356128961277, -0.261794268076556, -0.10699462833338612, -0.14521047063490122, 0.04686825712070727, -0.06730623836279429, -0.17686444772206408, 0.3584795974918621, 0.11785653554633421, 0.13451516370979144, -0.019259486140569392, 0.2933426608177398, 0.18623550202640565, -0.03066804455492726, 0.15853229367505867, 0.3082805509350712, 0.23102427970303102, 0.08989614031525503, -0.3035222220237923, 0.014687694723067952, 0.05957310501211356] |
1,803.00253 | Nonlinear coupling of flow harmonics: Hexagonal flow and beyond | Higher Fourier harmonics of anisotropic flow ($v_4$ and beyond) get large
contributions induced by elliptic and triangular flow through nonlinear
response. We present a general framework of nonlinear hydrodynamic response
which encompasses the existing one, and allows to take into account the mutual
correlation between the nonlinear couplings affecting Fourier harmonics of any
order. Using Large Hadron Collider data on Pb+Pb collisions at
~$\sqrt[]{s}=2.76$ TeV, we perform an application of our formalism to hexagonal
flow, $v_6$, a coefficient affected by several nonlinear contributions which
are of the same order of magnitude. We obtain the first experimental measure of
the coefficient $\chi_{624}$, which couples $v_6$ to $v_2$ and $v_4$. This is
achieved by putting together the information from several analyses: event-plane
correlations, symmetric cumulants, as well as new higher-order moments recently
analyzed by the ALICE collaboration. The value of $\chi_{624}$ extracted from
data is in fair agreement with hydrodynamic calculations, although with large
error bars, which would be dramatically reduced by a dedicated analysis. We
argue that within our formalism the nonlinear structure of a given higher
harmonic can be determined more accurately than the harmonic itself, and we
emphasize potential applications to future measurements of $v_7$ and $v_8$.
| nucl-th hep-ph nucl-ex | higher fourier harmonics of anisotropic flow v_4 and beyond get large contributions induced by elliptic and triangular flow through nonlinear response we present a general framework of nonlinear hydrodynamic response which encompasses the existing one and allows to take into account the mutual correlation between the nonlinear couplings affecting fourier harmonics of any order using large hadron collider data on pbpb collisions at sqrts276 tev we perform an application of our formalism to hexagonal flow v_6 a coefficient affected by several nonlinear contributions which are of the same order of magnitude we obtain the first experimental measure of the coefficient chi_624 which couples v_6 to v_2 and v_4 this is achieved by putting together the information from several analyses eventplane correlations symmetric cumulants as well as new higherorder moments recently analyzed by the alice collaboration the value of chi_624 extracted from data is in fair agreement with hydrodynamic calculations although with large error bars which would be dramatically reduced by a dedicated analysis we argue that within our formalism the nonlinear structure of a given higher harmonic can be determined more accurately than the harmonic itself and we emphasize potential applications to future measurements of v_7 and v_8 | [['higher', 'fourier', 'harmonics', 'of', 'anisotropic', 'flow', 'v_4', 'and', 'beyond', 'get', 'large', 'contributions', 'induced', 'by', 'elliptic', 'and', 'triangular', 'flow', 'through', 'nonlinear', 'response', 'we', 'present', 'a', 'general', 'framework', 'of', 'nonlinear', 'hydrodynamic', 'response', 'which', 'encompasses', 'the', 'existing', 'one', 'and', 'allows', 'to', 'take', 'into', 'account', 'the', 'mutual', 'correlation', 'between', 'the', 'nonlinear', 'couplings', 'affecting', 'fourier', 'harmonics', 'of', 'any', 'order', 'using', 'large', 'hadron', 'collider', 'data', 'on', 'pbpb', 'collisions', 'at', 'sqrts276', 'tev', 'we', 'perform', 'an', 'application', 'of', 'our', 'formalism', 'to', 'hexagonal', 'flow', 'v_6', 'a', 'coefficient', 'affected', 'by', 'several', 'nonlinear', 'contributions', 'which', 'are', 'of', 'the', 'same', 'order', 'of', 'magnitude', 'we', 'obtain', 'the', 'first', 'experimental', 'measure', 'of', 'the', 'coefficient', 'chi_624', 'which', 'couples', 'v_6', 'to', 'v_2', 'and', 'v_4', 'this', 'is', 'achieved', 'by', 'putting', 'together', 'the', 'information', 'from', 'several', 'analyses', 'eventplane', 'correlations', 'symmetric', 'cumulants', 'as', 'well', 'as', 'new', 'higherorder', 'moments', 'recently', 'analyzed', 'by', 'the', 'alice', 'collaboration', 'the', 'value', 'of', 'chi_624', 'extracted', 'from', 'data', 'is', 'in', 'fair', 'agreement', 'with', 'hydrodynamic', 'calculations', 'although', 'with', 'large', 'error', 'bars', 'which', 'would', 'be', 'dramatically', 'reduced', 'by', 'a', 'dedicated', 'analysis', 'we', 'argue', 'that', 'within', 'our', 'formalism', 'the', 'nonlinear', 'structure', 'of', 'a', 'given', 'higher', 'harmonic', 'can', 'be', 'determined', 'more', 'accurately', 'than', 'the', 'harmonic', 'itself', 'and', 'we', 'emphasize', 'potential', 'applications', 'to', 'future', 'measurements', 'of', 'v_7', 'and', 'v_8']] | [-0.07671412891572893, 0.1332082469890171, -0.12059539706417721, 0.06003723299898188, -0.05924945430621049, -0.09896811426674225, -0.06909526236550122, 0.327156720141291, -0.25180739333986174, -0.2903661586947701, 0.046231578516997204, -0.34937594879404654, -0.08177366487596337, 0.2085432052809498, 0.04270961006737447, 0.08180055244438521, 0.07029701108635612, 0.003938815038537188, -0.07086469918698529, -0.20566389802249377, 0.2892131386989994, 0.07407264325593133, 0.24176828158373126, 0.0921980755805152, 0.07775286157325632, 0.04431135870031632, -0.06303427769203804, 0.07366074654701336, -0.1498416712667157, 0.13994467029438892, 0.26169962536101704, 0.007992847305865084, 0.2062490372170162, -0.42244902522569255, -0.17576150030220802, 0.08127750911540826, 0.12039250982877779, 0.11871609743922112, -0.041643186223860096, -0.2766448053844957, 0.07604193685152236, -0.20947322326032825, -0.1129238989194665, -0.133910996237133, -0.023766891833641852, 0.04021245597063431, -0.3168241444690633, 0.1422309782243172, 0.046293533654831236, 0.0721467123850595, 0.0021715842087026115, -0.13486335019293547, -0.05146442599741894, 0.10600617717552398, 0.054462268936972855, 0.03412199585297031, 0.10631403303348783, -0.11606447423341427, -0.11522610104442052, 0.4083999496010341, -0.08059693588223368, -0.18424576804400017, 0.12780359753660564, -0.20255824049331286, -0.1110416203238336, 0.12411069717823661, 0.24608045897674652, 0.08348368448638879, -0.15684610106911015, 0.02527288032270379, -0.008754659356188257, 0.19587709861439273, 0.058741596422861427, 0.018597405447768063, 0.16356608663728384, 0.14241914073485235, 0.03912774171639823, 0.12728896699441902, -0.06427989011910763, -0.08275582810878107, -0.3257161115144132, -0.07909133790120422, -0.16465516970968064, 0.02530638859559763, -0.10763972323273228, -0.06282334975608415, 0.40616457152408453, 0.1320024827514224, 0.2421661959272068, 0.011510112890688588, 0.305948238881609, 0.13040194838552507, 0.1085125707894414, 0.05628562373563835, 0.29033284823942396, 0.14017672763675734, 0.12984749529040324, -0.2293486187581391, 0.027285345549676186, 0.06702807585219378] |
1,803.00254 | 45-year CPU evolution: one law and two equations | Moore's law and two equations allow to explain the main trends of CPU
evolution since MOS technologies have been used to implement microprocessors.
| cs.AR | moores law and two equations allow to explain the main trends of cpu evolution since mos technologies have been used to implement microprocessors | [['moores', 'law', 'and', 'two', 'equations', 'allow', 'to', 'explain', 'the', 'main', 'trends', 'of', 'cpu', 'evolution', 'since', 'mos', 'technologies', 'have', 'been', 'used', 'to', 'implement', 'microprocessors']] | [-0.05120338248493879, -0.008000186846955963, -0.166189215267482, 0.09299827192950508, -0.12824226053350646, -0.24347104338686104, -0.018741091105925, 0.40222588359661726, -0.22061759541216103, -0.42914447058802063, 0.1152224994603666, -0.23190061901898487, -0.10941419790944328, 0.26413971444834833, -0.09850634172882723, 0.13927102518146453, -0.004342025631795759, -0.07890879570344544, -0.03243771126574796, -0.3215079359386278, 0.2069280813448131, 0.04105459761036479, 0.3484581276450468, 0.053266256602238056, 0.08223079841421999, -0.16566604560079135, -0.03917764977592489, -0.039296121862919434, -0.08873344650087149, 0.13014461926144102, 0.27537557952429936, 0.12531785637585688, 0.31032873123236326, -0.5916619287884753, -0.16629713304016902, 0.03324295060061242, 0.17089604084258495, 0.030413856709618933, -0.012706656940281391, -0.17206004812665607, 0.0748833452310899, -0.2902420693603547, -0.16074850928524267, -0.09421569845922616, 0.06778142439282459, 0.1114832682778006, -0.13968858129911774, -0.02637506707611939, -0.01005827267046856, 0.006737553636017053, -0.030522013811961464, -0.1328251264665438, 0.0566644798964262, 0.20564793422818184, 0.010106155638704482, -0.035979055394621, 0.15690477483946344, -0.012325955716812092, -0.21552218197156553, 0.3773083613132653, -0.030832116745169395, -0.09462953852894514, 0.17663413318602936, -0.14369905355345944, -0.20301993903906448, 0.049325107475337776, 0.17750937013846377, -0.01769973241829101, -0.213290773332119, 0.0555374905765664, 0.1620913925378219, 0.20889551046749819, 0.04538114342595572, 0.050679582454588104, 0.23127726465463638, 0.16832759239427422, 0.0010577684126632369, 0.05850521167335303, -0.02499002833729205, -0.16851648299590402, -0.16002588540963505, -0.20762083922391353, -0.12514004014108493, 0.06215677430610294, 0.017519547422441818, -0.125614404577114, 0.33318927398194437, 0.22941661136143882, 0.07811556683610314, 0.06312351139343303, 0.33218228486973955, 0.13408811179840047, 0.2679584447456443, 0.08064170619067938, 0.24295501491945723, 0.16706693302030148, 0.29631063585048134, -0.1766916677436751, 0.10982052971730413, -0.006364735730407436] |
1,803.00255 | Ultrafast jamming of electrons into an amorphous entangled state | New emergent states of matter in quantum systems may be created under
non-equilibrium conditions if - through many body interactions - its
constituents order on a timescale which is shorter than the time required for
the system to reach thermal equilibrium. Conventionally non-equilibrium
ordering is discussed in terms of symmetry breaking, nonthermal order-disorder,
and more recently quenched topological transitions. Here we report a
fundamentally new and unusual metastable form of amorphous
correlation-localized fermionic matter, which is formed in a new type of
quantum transition at low temperature either by short pulse photoexcitation or
by electrical charge injection in the transition metal dichalcogenide 1T-TaS2.
Scanning tunnelling microscopy (STM) reveals a pseudo-amorphous packing of
localized electrons within the crystal lattice that is significantly denser
than its hexagonally ordered low-temperature ground state, or any other ordered
states of the system. Remarkably, the arrangement is not random, but displays a
hyperuniform spatial density distribution commonly encountered in classical
jammed systems, showing no signs of aggregation or phase separation.
Unexpectedly for a localized electron system, tunnelling spectroscopy and
multi- STM-tip surface resistance measurements reveal that the overall state is
gapless and conducting, which implies that localized and itinerant carriers are
resonantly entangled. The amorphous localized electron subsystem can be
understood theoretically to arise from strong correlations between polarons
sparsely dispersed on a 2D hexagonal atomic lattice, while itinerant carriers
act as a resonantly coupled reservoir distinct in momentum space.
| cond-mat.str-el | new emergent states of matter in quantum systems may be created under nonequilibrium conditions if through many body interactions its constituents order on a timescale which is shorter than the time required for the system to reach thermal equilibrium conventionally nonequilibrium ordering is discussed in terms of symmetry breaking nonthermal orderdisorder and more recently quenched topological transitions here we report a fundamentally new and unusual metastable form of amorphous correlationlocalized fermionic matter which is formed in a new type of quantum transition at low temperature either by short pulse photoexcitation or by electrical charge injection in the transition metal dichalcogenide 1ttas2 scanning tunnelling microscopy stm reveals a pseudoamorphous packing of localized electrons within the crystal lattice that is significantly denser than its hexagonally ordered lowtemperature ground state or any other ordered states of the system remarkably the arrangement is not random but displays a hyperuniform spatial density distribution commonly encountered in classical jammed systems showing no signs of aggregation or phase separation unexpectedly for a localized electron system tunnelling spectroscopy and multi stmtip surface resistance measurements reveal that the overall state is gapless and conducting which implies that localized and itinerant carriers are resonantly entangled the amorphous localized electron subsystem can be understood theoretically to arise from strong correlations between polarons sparsely dispersed on a 2d hexagonal atomic lattice while itinerant carriers act as a resonantly coupled reservoir distinct in momentum space | [['new', 'emergent', 'states', 'of', 'matter', 'in', 'quantum', 'systems', 'may', 'be', 'created', 'under', 'nonequilibrium', 'conditions', 'if', 'through', 'many', 'body', 'interactions', 'its', 'constituents', 'order', 'on', 'a', 'timescale', 'which', 'is', 'shorter', 'than', 'the', 'time', 'required', 'for', 'the', 'system', 'to', 'reach', 'thermal', 'equilibrium', 'conventionally', 'nonequilibrium', 'ordering', 'is', 'discussed', 'in', 'terms', 'of', 'symmetry', 'breaking', 'nonthermal', 'orderdisorder', 'and', 'more', 'recently', 'quenched', 'topological', 'transitions', 'here', 'we', 'report', 'a', 'fundamentally', 'new', 'and', 'unusual', 'metastable', 'form', 'of', 'amorphous', 'correlationlocalized', 'fermionic', 'matter', 'which', 'is', 'formed', 'in', 'a', 'new', 'type', 'of', 'quantum', 'transition', 'at', 'low', 'temperature', 'either', 'by', 'short', 'pulse', 'photoexcitation', 'or', 'by', 'electrical', 'charge', 'injection', 'in', 'the', 'transition', 'metal', 'dichalcogenide', '1ttas2', 'scanning', 'tunnelling', 'microscopy', 'stm', 'reveals', 'a', 'pseudoamorphous', 'packing', 'of', 'localized', 'electrons', 'within', 'the', 'crystal', 'lattice', 'that', 'is', 'significantly', 'denser', 'than', 'its', 'hexagonally', 'ordered', 'lowtemperature', 'ground', 'state', 'or', 'any', 'other', 'ordered', 'states', 'of', 'the', 'system', 'remarkably', 'the', 'arrangement', 'is', 'not', 'random', 'but', 'displays', 'a', 'hyperuniform', 'spatial', 'density', 'distribution', 'commonly', 'encountered', 'in', 'classical', 'jammed', 'systems', 'showing', 'no', 'signs', 'of', 'aggregation', 'or', 'phase', 'separation', 'unexpectedly', 'for', 'a', 'localized', 'electron', 'system', 'tunnelling', 'spectroscopy', 'and', 'multi', 'stmtip', 'surface', 'resistance', 'measurements', 'reveal', 'that', 'the', 'overall', 'state', 'is', 'gapless', 'and', 'conducting', 'which', 'implies', 'that', 'localized', 'and', 'itinerant', 'carriers', 'are', 'resonantly', 'entangled', 'the', 'amorphous', 'localized', 'electron', 'subsystem', 'can', 'be', 'understood', 'theoretically', 'to', 'arise', 'from', 'strong', 'correlations', 'between', 'polarons', 'sparsely', 'dispersed', 'on', 'a', '2d', 'hexagonal', 'atomic', 'lattice', 'while', 'itinerant', 'carriers', 'act', 'as', 'a', 'resonantly', 'coupled', 'reservoir', 'distinct', 'in', 'momentum', 'space']] | [-0.17323020856230237, 0.31541957528856784, -0.08944248623827109, 0.047299396525056145, 0.006380761271018697, -0.1886098268462102, 0.07829099597039875, 0.3859531417043637, -0.26020341132888974, -0.26088417210899617, 0.015941574437665227, -0.31258527728951657, -0.12092850232071689, 0.1304356468464349, 0.04216158502917413, 0.011709746127978534, -0.008559178673338308, -0.04227108547069213, -0.08264376005643735, -0.18224831689917861, 0.27918127764259343, -0.0017257048950895019, 0.31097548980994716, 0.053958013332600745, 0.04566597084960212, 0.008999595561307734, 0.12456261874986407, 0.0395479251649585, -0.10342101450834257, 0.04740484502500571, 0.25151418931579783, -0.06251704768814227, 0.1900926772383568, -0.4939894173294306, -0.2502553864645407, 0.03609047097194454, 0.18182111669675974, 0.13564542256569004, -0.0874162883926107, -0.30448026598188216, 0.013173090176575858, -0.13882317279526235, -0.12017487487755715, -0.09401879055329355, 0.0033901572267970312, -0.004779767498384108, -0.22232076681684704, 0.15798392885101392, 0.05624583026333509, 0.06439963574318783, -0.08898970617624202, -0.05621179199686436, -0.09172795004130381, 0.04454948681852092, -0.016246374520604782, 0.0380641409180775, 0.21136825511120666, -0.1282092070389215, -0.10630601252044511, 0.3798142005203535, -0.027664359071185692, -0.09710179798952912, 0.24497673810338197, -0.18904046448777714, -0.07792844062509097, 0.22400953076253444, 0.09974710953335844, 0.10149190981629426, -0.1436316256287366, 0.027293139998674516, -0.029803617540038314, 0.22259157772692245, 0.05774076358521479, 0.13742108420296775, 0.30041929416601426, 0.18352652489329163, 0.0728612926887328, 0.148594161609704, -0.07785936598743518, -0.11501306917761331, -0.2006269247068659, -0.16866210710014337, -0.27726385703148404, 0.0890221537142086, -0.032065198513484335, -0.2050485689992733, 0.36864377296347495, 0.10041978910246499, 0.16216923126827248, -0.08503425861961897, 0.2489696629522571, 0.0932361094797354, 0.03815577387222615, 0.03261695221805459, 0.22803656146152998, 0.13423216657956008, 0.09586389436001849, -0.256002463707093, 0.0869559678598307, 0.018905269137948103] |
1,803.00256 | How does pressure fluctuate in equilibrium? | We study fluctuations of pressure in equilibrium for classical particle
systems. In equilibrium statistical mechanics, pressure for a microscopic state
is defined by the derivative of a thermodynamic function or, more mechanically,
through the momentum current. We show that although the two expectation values
converge to the same equilibrium value in the thermodynamic limit, the variance
of the mechanical pressure is in general greater than that of the pressure
defined through the thermodynamic relation. We also present a condition for
experimentally detecting the difference between them in an idealized
measurement of momentum transfer.
| cond-mat.stat-mech | we study fluctuations of pressure in equilibrium for classical particle systems in equilibrium statistical mechanics pressure for a microscopic state is defined by the derivative of a thermodynamic function or more mechanically through the momentum current we show that although the two expectation values converge to the same equilibrium value in the thermodynamic limit the variance of the mechanical pressure is in general greater than that of the pressure defined through the thermodynamic relation we also present a condition for experimentally detecting the difference between them in an idealized measurement of momentum transfer | [['we', 'study', 'fluctuations', 'of', 'pressure', 'in', 'equilibrium', 'for', 'classical', 'particle', 'systems', 'in', 'equilibrium', 'statistical', 'mechanics', 'pressure', 'for', 'a', 'microscopic', 'state', 'is', 'defined', 'by', 'the', 'derivative', 'of', 'a', 'thermodynamic', 'function', 'or', 'more', 'mechanically', 'through', 'the', 'momentum', 'current', 'we', 'show', 'that', 'although', 'the', 'two', 'expectation', 'values', 'converge', 'to', 'the', 'same', 'equilibrium', 'value', 'in', 'the', 'thermodynamic', 'limit', 'the', 'variance', 'of', 'the', 'mechanical', 'pressure', 'is', 'in', 'general', 'greater', 'than', 'that', 'of', 'the', 'pressure', 'defined', 'through', 'the', 'thermodynamic', 'relation', 'we', 'also', 'present', 'a', 'condition', 'for', 'experimentally', 'detecting', 'the', 'difference', 'between', 'them', 'in', 'an', 'idealized', 'measurement', 'of', 'momentum', 'transfer']] | [-0.13457459956032014, 0.17441274483718844, -0.14004696818364043, 0.058946200068138783, 0.020912686362862587, -0.07053650553608613, 0.06934964947868139, 0.32161920331418514, -0.2708569225036509, -0.2784765539390425, 0.05020099293480637, -0.27586835602759036, -0.0853260538881264, 0.16653412128222847, 0.002872840065749422, 0.07040501929589883, 0.004602071764047748, 0.052474746720925454, -0.11312352911874612, -0.14577111405550794, 0.343109685339294, 0.07714551192037361, 0.28137362431935087, 0.04073458301874819, 0.10474373087266921, -0.016966137569397688, 0.0655868683430937, 0.09215144208201798, -0.16931494785631102, 0.04720694566726364, 0.2002494724527482, 0.0720819428973701, 0.2814004134526977, -0.4091017348591679, -0.2132972315734913, 0.13513247823963562, 0.0884522023080017, 0.10065371933723649, -0.032296743217175974, -0.19558092046488998, 0.045032091173393435, -0.15939921134411889, -0.14243094074810225, -0.09270022528105847, 0.03551792220202505, 0.018882861438517768, -0.2373171290883454, 0.16052795715989315, 0.04517275043913434, 0.09211025626388608, -0.11881725878645015, -0.10855580874223021, -0.057334731653412824, 0.09696012985471997, 0.033141737994087, -0.008054835624837628, 0.181740360624928, -0.16661982304386555, -0.06651240477078063, 0.37495898287142476, -0.08992918204564365, -0.2399618467441209, 0.15940335104542394, -0.1816365563771337, -0.08978849975892933, 0.08916704026050475, 0.10244767770411507, 0.1163886209589339, -0.17969596563207527, 0.029859329433611, -0.011307830912291362, 0.14535861663139796, 0.054704070797250155, 0.004845706844246716, 0.2183930899507256, 0.1375781515417921, 0.07543569532853941, 0.17274029260521295, -0.04737173959954582, -0.18933273994073432, -0.3178147646969044, -0.217598596898218, -0.2069955901893717, 0.0873276261432517, -0.09485370934670491, -0.1696326796325945, 0.34149805294169533, 0.21319841553634833, 0.1816255775110055, 0.06453765046742735, 0.31586031577680057, 0.1725651945077604, 0.0035924194881352045, 0.0813332043252685, 0.32771760717995707, 0.129356843824949, 0.10197729226802627, -0.2637070050633322, 0.07253137294463413, 0.037084472335634694] |
1,803.00257 | Modeling Data Containing Outliers using ARIMA Additive Outlier
(ARIMA-AO) | The aim this study is discussed on the detection and correction of data
containing the additive outlier (AO) on the model ARIMA (p, d, q). The process
of detection and correction of data using an iterative procedure popularized by
Box, Jenkins, and Reinsel (1994). By using this method we obtained an ARIMA
models were fit to the data containing AO, this model is added to the original
model of ARIMA coefficients obtained from the iteration process using
regression methods. This shows that there is an improvement of forecasting
error rate data.
| stat.ME | the aim this study is discussed on the detection and correction of data containing the additive outlier ao on the model arima p d q the process of detection and correction of data using an iterative procedure popularized by box jenkins and reinsel 1994 by using this method we obtained an arima models were fit to the data containing ao this model is added to the original model of arima coefficients obtained from the iteration process using regression methods this shows that there is an improvement of forecasting error rate data | [['the', 'aim', 'this', 'study', 'is', 'discussed', 'on', 'the', 'detection', 'and', 'correction', 'of', 'data', 'containing', 'the', 'additive', 'outlier', 'ao', 'on', 'the', 'model', 'arima', 'p', 'd', 'q', 'the', 'process', 'of', 'detection', 'and', 'correction', 'of', 'data', 'using', 'an', 'iterative', 'procedure', 'popularized', 'by', 'box', 'jenkins', 'and', 'reinsel', '1994', 'by', 'using', 'this', 'method', 'we', 'obtained', 'an', 'arima', 'models', 'were', 'fit', 'to', 'the', 'data', 'containing', 'ao', 'this', 'model', 'is', 'added', 'to', 'the', 'original', 'model', 'of', 'arima', 'coefficients', 'obtained', 'from', 'the', 'iteration', 'process', 'using', 'regression', 'methods', 'this', 'shows', 'that', 'there', 'is', 'an', 'improvement', 'of', 'forecasting', 'error', 'rate', 'data']] | [-0.026234544042704835, -0.0448282495976956, -0.09562073859075705, 0.03865557476484456, 0.00039747379616730745, -0.16250248909410503, 0.0612410763071643, 0.373189505106873, -0.26025734507582254, -0.3296325740507907, 0.1377686303212411, -0.3156153163458738, -0.13207008629623387, 0.210819964372139, -0.11913137578715881, 0.1078992785161568, 0.10522708076298133, 0.04016642374917865, -0.017318854892315962, -0.312953942331175, 0.24637443892554275, 0.13211043102459774, 0.24796032953179545, -0.048143731368084745, 0.12021122586706447, 0.035278914108251534, -0.12640477197451724, -0.02344752181217902, -0.11728389447129707, 0.13503610218564668, 0.18953214634857432, 0.14106121202930808, 0.2627025171700451, -0.34891121549945736, -0.21585108169044057, 0.07375486854256855, 0.09053552058628864, 0.08548371825470692, -0.030122920935456123, -0.2914716616065966, 0.06498577949565111, -0.19626483221331403, -0.0786523925221344, -0.07550489380955697, 0.02008315266834365, -0.029749720965305135, -0.3479254288805856, 0.09980462391136422, 0.08835900334460246, 0.10189483349935877, -0.05675599355405817, -0.158743562321696, 0.014767301346485814, 0.07324141962453723, 0.05076975898830117, 0.06885845753390135, 0.07949948460381064, -0.11292816694411967, -0.15156607850092566, 0.3448390542012122, -0.11277764094993473, -0.18717621235797802, 0.13058481777293815, -0.05702350921928882, -0.11820117790872851, 0.13683610800653695, 0.19387427103841523, 0.09303959710523486, -0.18761440702817506, 0.08507105696027994, -0.010834955869035589, 0.1788177959000071, 0.011527902508775393, -0.12443664435607692, 0.0927122917233242, 0.1956125233910926, -0.020882454462763336, 0.1272267474870508, -0.1954424491359128, -0.055112085429330666, -0.2771952108169595, -0.1039897182231976, -0.20214149952193516, -0.014174326271232631, -0.10488261225998738, -0.14448515102267265, 0.3674532152505385, 0.19597286629594035, 0.20552960104929904, 0.046436564293172625, 0.3237485670588083, 0.15302697444955507, 0.07214463116898616, 0.06895173038356006, 0.2063340463158157, 0.07963637041911069, 0.08257658847918113, -0.20069149018834448, 0.07533419692578415, 0.08818808327584217] |
1,803.00258 | The existence phase transition for scale invariant Poisson random
fractal models | In this paper we study the existence phase transition of scale invariant
random fractal models. We determine the exact value of the critical point of
this phase transition for all models satisfying some weak assumptions. In
addition, we show that for a large subclass, the fractal model is in the empty
phase at the critical point. This subclass of models includes the scale
invariant Poisson Boolean model and the Brownian loop soup. In contrast to
earlier results in the literature, we do not need to restrict our attention to
random fractal models generated by open sets.
| math.PR | in this paper we study the existence phase transition of scale invariant random fractal models we determine the exact value of the critical point of this phase transition for all models satisfying some weak assumptions in addition we show that for a large subclass the fractal model is in the empty phase at the critical point this subclass of models includes the scale invariant poisson boolean model and the brownian loop soup in contrast to earlier results in the literature we do not need to restrict our attention to random fractal models generated by open sets | [['in', 'this', 'paper', 'we', 'study', 'the', 'existence', 'phase', 'transition', 'of', 'scale', 'invariant', 'random', 'fractal', 'models', 'we', 'determine', 'the', 'exact', 'value', 'of', 'the', 'critical', 'point', 'of', 'this', 'phase', 'transition', 'for', 'all', 'models', 'satisfying', 'some', 'weak', 'assumptions', 'in', 'addition', 'we', 'show', 'that', 'for', 'a', 'large', 'subclass', 'the', 'fractal', 'model', 'is', 'in', 'the', 'empty', 'phase', 'at', 'the', 'critical', 'point', 'this', 'subclass', 'of', 'models', 'includes', 'the', 'scale', 'invariant', 'poisson', 'boolean', 'model', 'and', 'the', 'brownian', 'loop', 'soup', 'in', 'contrast', 'to', 'earlier', 'results', 'in', 'the', 'literature', 'we', 'do', 'not', 'need', 'to', 'restrict', 'our', 'attention', 'to', 'random', 'fractal', 'models', 'generated', 'by', 'open', 'sets']] | [-0.11038196873657095, 0.14907745602734698, -0.051664597194758244, 0.09192929752316559, -0.04703603082937965, -0.10679821102530695, 0.08004648288018264, 0.3704165585222654, -0.26069776961230673, -0.24219449743880736, 0.10228954823954457, -0.26304870944780606, -0.18675920824171044, 0.1442895162726927, -0.047576357261277735, 0.09429114070856788, 0.007097326442211245, 0.04630552377784625, -0.06680387394832603, -0.21806457987986505, 0.39580156572628766, 0.01569334677575777, 0.2736817311379127, 0.019318144050582003, 0.04973202618324043, -0.056434082667692564, -0.0249157493187037, 0.04358478483724563, -0.18442576560278212, 0.06785863841772273, 0.19154769139231576, 0.05767884571105242, 0.22922277223551646, -0.37605544104008004, -0.23518219092511572, 0.1951633255763833, 0.11589291561782981, 0.12191728521186936, -0.028503660743202392, -0.2555945974891074, 0.12020283900104307, -0.12233845246616208, -0.1675505630846601, -0.05355327733559534, 0.014048796365386806, 0.009136962226572601, -0.26042019708741765, 0.06720058243020806, 0.1216202433667301, 0.03421387721512777, -0.07169437604413058, -0.06813404316199012, 0.020416164477258764, 0.1270541412620029, 0.013860032073959397, 0.03430623117552992, 0.09139647738387187, -0.13353167487609122, -0.1118694352529322, 0.36930892769790563, -0.0663547868510553, -0.21665670584964877, 0.18732921535047353, -0.20146407944654735, -0.2386670625031305, 0.11450609650152425, 0.16815164105112976, 0.0909737620386295, -0.13838425844248073, 0.15397235123418795, -0.07483885345088008, 0.1341063183905741, 0.025550410985791434, 0.0023789851281132237, 0.18091395133524202, 0.15460161195369437, 0.03903883951958657, 0.18212080089870142, -0.05228298592070738, -0.1856954180257162, -0.3355911436180274, -0.11300432297260461, -0.15856480446260926, 0.05451842118797382, -0.10852555801087267, -0.23465745436260477, 0.3864733035831402, 0.2421050824195845, 0.23183647182304412, 0.08989405103299457, 0.22329998826414035, 0.11360926912190432, 0.03916194421860079, 0.07473146394962289, 0.19908821679473476, 0.07227596728140877, 0.09376695147754315, -0.14000148454700442, 0.04552241662167944, 0.10137543750655216] |
1,803.00259 | Deep Reinforcement Learning for Sponsored Search Real-time Bidding | Bidding optimization is one of the most critical problems in online
advertising. Sponsored search (SS) auction, due to the randomness of user query
behavior and platform nature, usually adopts keyword-level bidding strategies.
In contrast, the display advertising (DA), as a relatively simpler scenario for
auction, has taken advantage of real-time bidding (RTB) to boost the
performance for advertisers. In this paper, we consider the RTB problem in
sponsored search auction, named SS-RTB. SS-RTB has a much more complex dynamic
environment, due to stochastic user query behavior and more complex bidding
policies based on multiple keywords of an ad. Most previous methods for DA
cannot be applied. We propose a reinforcement learning (RL) solution for
handling the complex dynamic environment. Although some RL methods have been
proposed for online advertising, they all fail to address the "environment
changing" problem: the state transition probabilities vary between two days.
Motivated by the observation that auction sequences of two days share similar
transition patterns at a proper aggregation level, we formulate a robust MDP
model at hour-aggregation level of the auction data and propose a
control-by-model framework for SS-RTB. Rather than generating bid prices
directly, we decide a bidding model for impressions of each hour and perform
real-time bidding accordingly. We also extend the method to handle the
multi-agent problem. We deployed the SS-RTB system in the e-commerce search
auction platform of Alibaba. Empirical experiments of offline evaluation and
online A/B test demonstrate the effectiveness of our method.
| cs.AI | bidding optimization is one of the most critical problems in online advertising sponsored search ss auction due to the randomness of user query behavior and platform nature usually adopts keywordlevel bidding strategies in contrast the display advertising da as a relatively simpler scenario for auction has taken advantage of realtime bidding rtb to boost the performance for advertisers in this paper we consider the rtb problem in sponsored search auction named ssrtb ssrtb has a much more complex dynamic environment due to stochastic user query behavior and more complex bidding policies based on multiple keywords of an ad most previous methods for da cannot be applied we propose a reinforcement learning rl solution for handling the complex dynamic environment although some rl methods have been proposed for online advertising they all fail to address the environment changing problem the state transition probabilities vary between two days motivated by the observation that auction sequences of two days share similar transition patterns at a proper aggregation level we formulate a robust mdp model at houraggregation level of the auction data and propose a controlbymodel framework for ssrtb rather than generating bid prices directly we decide a bidding model for impressions of each hour and perform realtime bidding accordingly we also extend the method to handle the multiagent problem we deployed the ssrtb system in the ecommerce search auction platform of alibaba empirical experiments of offline evaluation and online ab test demonstrate the effectiveness of our method | [['bidding', 'optimization', 'is', 'one', 'of', 'the', 'most', 'critical', 'problems', 'in', 'online', 'advertising', 'sponsored', 'search', 'ss', 'auction', 'due', 'to', 'the', 'randomness', 'of', 'user', 'query', 'behavior', 'and', 'platform', 'nature', 'usually', 'adopts', 'keywordlevel', 'bidding', 'strategies', 'in', 'contrast', 'the', 'display', 'advertising', 'da', 'as', 'a', 'relatively', 'simpler', 'scenario', 'for', 'auction', 'has', 'taken', 'advantage', 'of', 'realtime', 'bidding', 'rtb', 'to', 'boost', 'the', 'performance', 'for', 'advertisers', 'in', 'this', 'paper', 'we', 'consider', 'the', 'rtb', 'problem', 'in', 'sponsored', 'search', 'auction', 'named', 'ssrtb', 'ssrtb', 'has', 'a', 'much', 'more', 'complex', 'dynamic', 'environment', 'due', 'to', 'stochastic', 'user', 'query', 'behavior', 'and', 'more', 'complex', 'bidding', 'policies', 'based', 'on', 'multiple', 'keywords', 'of', 'an', 'ad', 'most', 'previous', 'methods', 'for', 'da', 'can', 'not', 'be', 'applied', 'we', 'propose', 'a', 'reinforcement', 'learning', 'rl', 'solution', 'for', 'handling', 'the', 'complex', 'dynamic', 'environment', 'although', 'some', 'rl', 'methods', 'have', 'been', 'proposed', 'for', 'online', 'advertising', 'they', 'all', 'fail', 'to', 'address', 'the', 'environment', 'changing', 'problem', 'the', 'state', 'transition', 'probabilities', 'vary', 'between', 'two', 'days', 'motivated', 'by', 'the', 'observation', 'that', 'auction', 'sequences', 'of', 'two', 'days', 'share', 'similar', 'transition', 'patterns', 'at', 'a', 'proper', 'aggregation', 'level', 'we', 'formulate', 'a', 'robust', 'mdp', 'model', 'at', 'houraggregation', 'level', 'of', 'the', 'auction', 'data', 'and', 'propose', 'a', 'controlbymodel', 'framework', 'for', 'ssrtb', 'rather', 'than', 'generating', 'bid', 'prices', 'directly', 'we', 'decide', 'a', 'bidding', 'model', 'for', 'impressions', 'of', 'each', 'hour', 'and', 'perform', 'realtime', 'bidding', 'accordingly', 'we', 'also', 'extend', 'the', 'method', 'to', 'handle', 'the', 'multiagent', 'problem', 'we', 'deployed', 'the', 'ssrtb', 'system', 'in', 'the', 'ecommerce', 'search', 'auction', 'platform', 'of', 'alibaba', 'empirical', 'experiments', 'of', 'offline', 'evaluation', 'and', 'online', 'ab', 'test', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'method']] | [-0.0987307669831563, -0.017120095306066008, -0.09204630156082279, 0.09963132908485045, -0.15990082214563345, -0.2113371251635869, 0.14605201213006777, 0.46909485612649565, -0.2664039380560256, -0.3153529389191819, 0.11319053759134552, -0.28183269414527357, -0.16863105449275198, 0.1694522947948503, -0.10191952812247033, 0.053611954974543595, 0.0512686027921082, 0.03296447463414424, 0.026117233038506632, -0.2853165615959986, 0.26928151838918224, 0.04911213977385528, 0.30764333405031646, 0.0015914111784447662, 0.06615134971533818, 0.029679520459737905, 0.00038310535413728765, -0.017749288796701214, -0.08720778509573882, 0.12149244905805431, 0.34794287846331323, 0.19941492548283604, 0.3673038603165495, -0.3921944812971575, -0.15047225765768468, 0.1305283264714978, 0.11614868723946596, 0.028344077108166187, -0.08379627964981304, -0.27701598421231777, 0.07349184822687525, -0.23125023457937496, 0.010971298181521129, -0.09178953975331315, -0.029193016973685874, -0.031174505124164916, -0.3469675210841416, -0.030815631220351004, 0.008708150575345398, 0.03628688439542104, -0.09933144667124268, -0.08407488682505497, 0.06716118957597209, 0.1457224570018478, 0.058429576572962105, -0.016272585865731683, 0.15302021684671543, -0.15352631150456222, -0.23903018214825486, 0.4510504985420603, 0.0006271740976670057, -0.13148407207143856, 0.15849767478513876, -0.043295757743060465, -0.1540444056611231, 0.1356177273906829, 0.2575696195732641, 0.16799351917906888, -0.18836181009311445, 0.0375820342853015, -0.05853191695333851, 0.1863112827601327, 0.03411551165367546, -0.0089730335532881, 0.15028630018480554, 0.24905074002848523, 0.11341564344292245, 0.11724880648885608, -0.015531800672881428, -0.1677615514817871, -0.15858259417086817, -0.13295514368156763, -0.15458559173530675, -0.0005052319336620021, -0.09849561070069654, -0.145486253853464, 0.3742615098041321, 0.20419733813475077, 0.1452659609427383, 0.08797538705787829, 0.32037900402480046, 0.07762658139015476, 0.02195458815188709, 0.11754601674677789, 0.1807694877677045, -0.09351281846742615, 0.22514513727038915, -0.18594646075363308, 0.1642798773428687, 0.03820426540337657] |
1,803.0026 | Five-point Fundamental Matrix Estimation for Uncalibrated Cameras | We aim at estimating the fundamental matrix in two views from five
correspondences of rotation invariant features obtained by e.g.\ the SIFT
detector. The proposed minimal solver first estimates a homography from three
correspondences assuming that they are co-planar and exploiting their
rotational components. Then the fundamental matrix is obtained from the
homography and two additional point pairs in general position. The proposed
approach, combined with robust estimators like Graph-Cut RANSAC, is superior to
other state-of-the-art algorithms both in terms of accuracy and number of
iterations required. This is validated on synthesized data and $561$ real image
pairs. Moreover, the tests show that requiring three points on a plane is not
too restrictive in urban environment and locally optimized robust estimators
lead to accurate estimates even if the points are not entirely co-planar. As a
potential application, we show that using the proposed method makes two-view
multi-motion estimation more accurate.
| cs.CV eess.IV | we aim at estimating the fundamental matrix in two views from five correspondences of rotation invariant features obtained by eg the sift detector the proposed minimal solver first estimates a homography from three correspondences assuming that they are coplanar and exploiting their rotational components then the fundamental matrix is obtained from the homography and two additional point pairs in general position the proposed approach combined with robust estimators like graphcut ransac is superior to other stateoftheart algorithms both in terms of accuracy and number of iterations required this is validated on synthesized data and 561 real image pairs moreover the tests show that requiring three points on a plane is not too restrictive in urban environment and locally optimized robust estimators lead to accurate estimates even if the points are not entirely coplanar as a potential application we show that using the proposed method makes twoview multimotion estimation more accurate | [['we', 'aim', 'at', 'estimating', 'the', 'fundamental', 'matrix', 'in', 'two', 'views', 'from', 'five', 'correspondences', 'of', 'rotation', 'invariant', 'features', 'obtained', 'by', 'eg', 'the', 'sift', 'detector', 'the', 'proposed', 'minimal', 'solver', 'first', 'estimates', 'a', 'homography', 'from', 'three', 'correspondences', 'assuming', 'that', 'they', 'are', 'coplanar', 'and', 'exploiting', 'their', 'rotational', 'components', 'then', 'the', 'fundamental', 'matrix', 'is', 'obtained', 'from', 'the', 'homography', 'and', 'two', 'additional', 'point', 'pairs', 'in', 'general', 'position', 'the', 'proposed', 'approach', 'combined', 'with', 'robust', 'estimators', 'like', 'graphcut', 'ransac', 'is', 'superior', 'to', 'other', 'stateoftheart', 'algorithms', 'both', 'in', 'terms', 'of', 'accuracy', 'and', 'number', 'of', 'iterations', 'required', 'this', 'is', 'validated', 'on', 'synthesized', 'data', 'and', '561', 'real', 'image', 'pairs', 'moreover', 'the', 'tests', 'show', 'that', 'requiring', 'three', 'points', 'on', 'a', 'plane', 'is', 'not', 'too', 'restrictive', 'in', 'urban', 'environment', 'and', 'locally', 'optimized', 'robust', 'estimators', 'lead', 'to', 'accurate', 'estimates', 'even', 'if', 'the', 'points', 'are', 'not', 'entirely', 'coplanar', 'as', 'a', 'potential', 'application', 'we', 'show', 'that', 'using', 'the', 'proposed', 'method', 'makes', 'twoview', 'multimotion', 'estimation', 'more', 'accurate']] | [-0.08830182849282661, 0.005324653206055597, -0.0893284613215802, 0.07024165800844488, -0.047516480394507815, -0.16288015414216875, 0.03700544108517918, 0.4242212463251546, -0.2193611796207776, -0.3312844628231419, 0.13502511595791494, -0.28675222314031634, -0.1726920060288386, 0.23731758498317942, -0.10330709143097969, 0.10486898794707736, 0.11921132989415287, 0.026233773519153764, -0.13072325832338616, -0.267682642057138, 0.29492773784905824, 0.00010775578452036684, 0.30179376568295213, -0.026613956220423014, 0.13113164165660413, -0.007896159925566824, -0.05449649526705597, 0.03940158669255524, -0.052615944845334314, 0.1532031828381321, 0.2459238660787451, 0.13495092521477867, 0.2225603427231662, -0.3899655249641721, -0.17006999956468907, 0.10955781046451138, 0.1322406109616015, 0.09456991617436578, -0.05178223623499202, -0.30753622932872116, 0.11824761589382769, -0.10695143753581449, -0.06916371265726301, -0.11312714098146398, -0.04091333724783371, 0.0013594095292032366, -0.30766093744052536, 0.05798481043503188, 0.03989885170512751, 0.06009388875041232, -0.051253764186954535, -0.1336270591358173, -0.02379681874104094, 0.11901229139786189, 0.019426152775776667, 0.026133007616829754, 0.13274883919383004, -0.10816473006770864, -0.08652662861804734, 0.3846187920578374, -0.0476772787550233, -0.25540090174626734, 0.22647074503111558, -0.1004299012453439, -0.11348379539613355, 0.14783944668023277, 0.1594855716958292, 0.13334957905576234, -0.15674491092287654, 0.03328778886747228, -0.033467602596505726, 0.1564827711024906, 0.05729554770451864, -0.008530142602601383, 0.1806545982953011, 0.1362680847781078, 0.09280954336159786, 0.08721972696034663, -0.13120959910107838, -0.052408261055864346, -0.26059546734787675, -0.09174497394753, -0.21672784643569623, -0.04156484145607843, -0.12861942838916116, -0.13085184385062465, 0.396740951731601, 0.20738724548519658, 0.21626311760620784, 0.050029039137602954, 0.3634727001440205, 0.04898662160028822, 0.06426650115551315, 0.11384668972205696, 0.23913165379859408, 0.07294244794393796, 0.01806343988134157, -0.1701978579829228, 0.06444294539423998, 0.08144817118151676] |
1,803.00261 | Credit Risk Meets Random Matrices: Coping with Non-Stationary Asset
Correlations | We review recent progress in modeling credit risk for correlated assets. We
start from the Merton model which default events and losses are derived from
the asset values at maturity. To estimate the time development of the asset
values, the stock prices are used whose correlations have a strong impact on
the loss distribution, particularly on its tails. These correlations are
non-stationary which also influences the tails. We account for the asset
fluctuations by averaging over an ensemble of random matrices that models the
truly existing set of measured correlation matrices. As a most welcome side
effect, this approach drastically reduces the parameter dependence of the loss
distribution, allowing us to obtain very explicit results which show
quantitatively that the heavy tails prevail over diversification benefits even
for small correlations. We calibrate our random matrix model with market data
and show how it is capable of grasping different market situations.
Furthermore, we present numerical simulations for concurrent portfolio risks,
i.e., for the joint probability densities of losses for two portfolios. For the
convenience of the reader, we give an introduction to the Wishart random matrix
model.
| q-fin.RM q-fin.ST | we review recent progress in modeling credit risk for correlated assets we start from the merton model which default events and losses are derived from the asset values at maturity to estimate the time development of the asset values the stock prices are used whose correlations have a strong impact on the loss distribution particularly on its tails these correlations are nonstationary which also influences the tails we account for the asset fluctuations by averaging over an ensemble of random matrices that models the truly existing set of measured correlation matrices as a most welcome side effect this approach drastically reduces the parameter dependence of the loss distribution allowing us to obtain very explicit results which show quantitatively that the heavy tails prevail over diversification benefits even for small correlations we calibrate our random matrix model with market data and show how it is capable of grasping different market situations furthermore we present numerical simulations for concurrent portfolio risks ie for the joint probability densities of losses for two portfolios for the convenience of the reader we give an introduction to the wishart random matrix model | [['we', 'review', 'recent', 'progress', 'in', 'modeling', 'credit', 'risk', 'for', 'correlated', 'assets', 'we', 'start', 'from', 'the', 'merton', 'model', 'which', 'default', 'events', 'and', 'losses', 'are', 'derived', 'from', 'the', 'asset', 'values', 'at', 'maturity', 'to', 'estimate', 'the', 'time', 'development', 'of', 'the', 'asset', 'values', 'the', 'stock', 'prices', 'are', 'used', 'whose', 'correlations', 'have', 'a', 'strong', 'impact', 'on', 'the', 'loss', 'distribution', 'particularly', 'on', 'its', 'tails', 'these', 'correlations', 'are', 'nonstationary', 'which', 'also', 'influences', 'the', 'tails', 'we', 'account', 'for', 'the', 'asset', 'fluctuations', 'by', 'averaging', 'over', 'an', 'ensemble', 'of', 'random', 'matrices', 'that', 'models', 'the', 'truly', 'existing', 'set', 'of', 'measured', 'correlation', 'matrices', 'as', 'a', 'most', 'welcome', 'side', 'effect', 'this', 'approach', 'drastically', 'reduces', 'the', 'parameter', 'dependence', 'of', 'the', 'loss', 'distribution', 'allowing', 'us', 'to', 'obtain', 'very', 'explicit', 'results', 'which', 'show', 'quantitatively', 'that', 'the', 'heavy', 'tails', 'prevail', 'over', 'diversification', 'benefits', 'even', 'for', 'small', 'correlations', 'we', 'calibrate', 'our', 'random', 'matrix', 'model', 'with', 'market', 'data', 'and', 'show', 'how', 'it', 'is', 'capable', 'of', 'grasping', 'different', 'market', 'situations', 'furthermore', 'we', 'present', 'numerical', 'simulations', 'for', 'concurrent', 'portfolio', 'risks', 'ie', 'for', 'the', 'joint', 'probability', 'densities', 'of', 'losses', 'for', 'two', 'portfolios', 'for', 'the', 'convenience', 'of', 'the', 'reader', 'we', 'give', 'an', 'introduction', 'to', 'the', 'wishart', 'random', 'matrix', 'model']] | [-0.06007242344084486, 0.08302125157378439, -0.11527905198595216, 0.14648947483980126, -0.045670549650626474, -0.11991151529664715, 0.062452239578374494, 0.416893317264014, -0.2630703937373705, -0.26350485477396235, 0.11788271474138763, -0.3140365518178911, -0.12553707482599935, 0.18141109863000732, -0.07395912512513478, 0.049858665613736704, 0.06802441234455034, -0.0276926854294875, -0.02368074192719344, -0.28651133163767034, 0.30893612139788207, 0.08760634630728233, 0.29775009614851083, 0.044285288591298363, 0.10561963637617307, 0.029327820868842225, -0.045197147390334515, 0.005960093006261334, -0.10298187171789049, 0.13593942328025738, 0.24459427377917964, 0.10718688811926592, 0.32644053260164874, -0.44412918095426857, -0.20769594028662208, 0.12464755477123363, 0.0650255808369532, 0.0792201914910918, -0.016674842098377326, -0.2662991546958144, 0.015629544879199677, -0.25980149994614304, -0.11067760795272226, -0.10260337098972291, 0.03740407023153278, 0.03957802727217636, -0.3365041447743293, 0.0757771008762203, 0.034558194013492714, 0.02357645164073635, -0.029371922440302397, -0.16345824751131718, 0.021967315432986103, 0.1519632924088998, 0.12350218429828504, -0.08126917111897661, 0.1479346005443824, -0.13781970978328978, -0.1187210200196107, 0.337355971655568, -0.06784468168212522, -0.1887601021494496, 0.12378455288532961, -0.1590740866007744, -0.11167867299574878, 0.12344488021617214, 0.2118312117758818, 0.04909174454208183, -0.17299805048813102, 0.03153468394258951, -0.024010414098669844, 0.14891281403020346, 0.017764010454117452, 0.03375240545769933, 0.1855570286792773, 0.1331001495944351, 0.0713542573647173, 0.11051058481129447, -0.0901950110496092, -0.16354893875979287, -0.2925591416837227, -0.09193925061782632, -0.16325067844547292, 0.039551182657540325, -0.1648050756167097, -0.1809701211099583, 0.40230573124692887, 0.2320643308189427, 0.1899739474002447, 0.14065169822862772, 0.2589941744752709, 0.12141331935419403, 0.01637637068771617, 0.07626694975350733, 0.1684373139118355, 0.052273670392942125, 0.10913844325865109, -0.1819593757491118, 0.19971165247073758, -0.016382068613423936] |
1,803.00262 | Entanglement-assisted quantum MDS codes constructed from constacyclic
codes | Recently, entanglement-assisted quantum error correcting codes (EAQECCs) have
been constructed by cyclic codes and negacyclic codes. In this paper, by
analyzing the cyclotomic cosets in the defining set of constacyclic codes, we
constructed three classes of new EAQECCs which satisfy the
entanglement-assisted quantum Singleton bound. Besides, three classes of
EAQECCs with maximal entanglement from constacyclic codes are constructed in
the meanwhile.
| cs.IT math.IT | recently entanglementassisted quantum error correcting codes eaqeccs have been constructed by cyclic codes and negacyclic codes in this paper by analyzing the cyclotomic cosets in the defining set of constacyclic codes we constructed three classes of new eaqeccs which satisfy the entanglementassisted quantum singleton bound besides three classes of eaqeccs with maximal entanglement from constacyclic codes are constructed in the meanwhile | [['recently', 'entanglementassisted', 'quantum', 'error', 'correcting', 'codes', 'eaqeccs', 'have', 'been', 'constructed', 'by', 'cyclic', 'codes', 'and', 'negacyclic', 'codes', 'in', 'this', 'paper', 'by', 'analyzing', 'the', 'cyclotomic', 'cosets', 'in', 'the', 'defining', 'set', 'of', 'constacyclic', 'codes', 'we', 'constructed', 'three', 'classes', 'of', 'new', 'eaqeccs', 'which', 'satisfy', 'the', 'entanglementassisted', 'quantum', 'singleton', 'bound', 'besides', 'three', 'classes', 'of', 'eaqeccs', 'with', 'maximal', 'entanglement', 'from', 'constacyclic', 'codes', 'are', 'constructed', 'in', 'the', 'meanwhile']] | [-0.22993693222887204, 0.13979465245712, -0.040921020775758585, 0.10150683807690063, 0.0919847240763121, -0.3095985665978467, -0.021134380585147588, 0.3070431730297745, -0.33163297958061344, -0.26458572049732093, 0.11022770521040151, -0.2360766712026518, -0.15018692148513482, 0.26333223435966696, -0.17718169955750468, 0.19192038068822662, 0.06078541133797071, 0.030060737836556356, -0.21234270766927082, -0.418702029852105, 0.401453683000119, 0.15342423734713162, 0.2512163897884674, -0.03980784702923943, 0.06199809261521355, -0.03126802812254087, -0.055943099278040594, -0.046493323122868774, -0.2610132006439762, 0.12272054699562551, 0.316548190278108, 0.20832246382812375, 0.15125867132036414, -0.31375304240061613, -0.24096094326833722, 0.16400179708162782, 0.14294577430414615, 0.22248605435492746, -0.07826408177431, -0.23561528196833173, 0.13830853633765802, -0.2732176310764473, 0.051990657182196615, -0.00549131553986522, -0.00877912704390092, 0.02435700503391687, -0.24479825977907807, -0.07471467871371595, 0.06733070221561634, 0.1762965400359731, 0.014279041210281068, -0.1746992548225356, 0.07326497547099459, 0.13979793214773545, -0.08414605696548204, -0.015844598473584066, -0.02241295192879243, -0.015822171046566524, -0.22246459317317263, 0.28484656490751953, 0.009908352215148386, -0.1956209216942461, 0.02704223938530586, -0.04043894110736056, -0.13320553372995775, 0.09664997816482773, 0.15046443297054435, 0.10103168445410299, -0.13462376420493008, 0.1642305017821109, -0.11764941659191104, 0.0771475058110034, 0.1680833223184235, 0.23726274231906797, 0.16925712219882208, -0.06233622842147702, -0.03466546009905392, 0.2792083749578136, -0.0015797136870564007, -0.09434191711613389, -0.3150955159522471, -0.13598473836977004, -0.17483244050431568, 0.06554480443601726, -0.12078875986468925, -0.18107418393807823, 0.4325780065150046, 0.0722834339334828, 0.03286119782533802, 0.16726235579126744, 0.16175159321884153, -0.03492496839173894, 0.19981222521880124, 0.2514700650802401, 0.16950388045096007, 0.2546761047140863, -0.15333051927631997, -0.20379448546092865, 0.006402924374417692, 0.24432673070915653] |
1,803.00263 | EvoCut : A new Generalization of Albert-Barab\'asi Model for Evolution
of Complex Networks | With the evolution of social networks, the network structure shows dynamic
nature in which nodes and edges appear as well as disappear for various
reasons. The role of a node in the network is presented as the number of
interactions it has with the other nodes. For this purpose a network is modeled
as a graph where nodes represent network members and edges represent a
relationship among them. Several models for evolution of social networks has
been proposed till date, most widely accepted being the Barab\'asi-Albert
\cite{Network science} model that is based on \emph{preferential attachment} of
nodes according to the degree distribution. This model leads to generation of
graphs that are called \emph{Scale Free} and the degree distribution of such
graphs follow the \emph{power law}. Several generalizations of this model has
also been proposed. In this paper we present a new generalization of the model
and attempt to bring out its implications in real life.
| cs.SI physics.soc-ph | with the evolution of social networks the network structure shows dynamic nature in which nodes and edges appear as well as disappear for various reasons the role of a node in the network is presented as the number of interactions it has with the other nodes for this purpose a network is modeled as a graph where nodes represent network members and edges represent a relationship among them several models for evolution of social networks has been proposed till date most widely accepted being the barabasialbert citenetwork science model that is based on emphpreferential attachment of nodes according to the degree distribution this model leads to generation of graphs that are called emphscale free and the degree distribution of such graphs follow the emphpower law several generalizations of this model has also been proposed in this paper we present a new generalization of the model and attempt to bring out its implications in real life | [['with', 'the', 'evolution', 'of', 'social', 'networks', 'the', 'network', 'structure', 'shows', 'dynamic', 'nature', 'in', 'which', 'nodes', 'and', 'edges', 'appear', 'as', 'well', 'as', 'disappear', 'for', 'various', 'reasons', 'the', 'role', 'of', 'a', 'node', 'in', 'the', 'network', 'is', 'presented', 'as', 'the', 'number', 'of', 'interactions', 'it', 'has', 'with', 'the', 'other', 'nodes', 'for', 'this', 'purpose', 'a', 'network', 'is', 'modeled', 'as', 'a', 'graph', 'where', 'nodes', 'represent', 'network', 'members', 'and', 'edges', 'represent', 'a', 'relationship', 'among', 'them', 'several', 'models', 'for', 'evolution', 'of', 'social', 'networks', 'has', 'been', 'proposed', 'till', 'date', 'most', 'widely', 'accepted', 'being', 'the', 'barabasialbert', 'citenetwork', 'science', 'model', 'that', 'is', 'based', 'on', 'emphpreferential', 'attachment', 'of', 'nodes', 'according', 'to', 'the', 'degree', 'distribution', 'this', 'model', 'leads', 'to', 'generation', 'of', 'graphs', 'that', 'are', 'called', 'emphscale', 'free', 'and', 'the', 'degree', 'distribution', 'of', 'such', 'graphs', 'follow', 'the', 'emphpower', 'law', 'several', 'generalizations', 'of', 'this', 'model', 'has', 'also', 'been', 'proposed', 'in', 'this', 'paper', 'we', 'present', 'a', 'new', 'generalization', 'of', 'the', 'model', 'and', 'attempt', 'to', 'bring', 'out', 'its', 'implications', 'in', 'real', 'life']] | [-0.11227699306703383, 0.05644184974502892, -0.06651085327236703, 0.04496103173887898, -0.08777203423782222, -0.12604886163026094, 0.032793078697737184, 0.3770768069812367, -0.26088042911517645, -0.3405660230666399, 0.07031722225609326, -0.2953682671391195, -0.2334803039868993, 0.12386369644851995, -0.03359811462371821, 0.03167186977544559, 0.03565464754018091, 0.09464836606695767, 0.054173293520486165, -0.2420046071981966, 0.32519949491946926, 0.07093196325604954, 0.2852412900031214, 0.05993760043544875, 0.07578956064197324, -0.02561820571971757, -0.019517732685386775, 0.04425333060672499, -0.07826865598185724, 0.11354460163462547, 0.24582834229609768, 0.15740331562175866, 0.2923367365608893, -0.41418537469881195, -0.27217055213817903, 0.1456449950414319, 0.1301328483638504, 0.09415742088890364, -0.01616717816495727, -0.2384373264252058, 0.09904400331358756, -0.20042639206963472, -0.09817859860467575, -0.037395593674192505, 0.05053793058520363, 0.0584578093261488, -0.21495949231996953, 0.027842195585723064, 0.047023904132806965, 0.03885263163613291, -0.0032135229843157915, -0.12019850683789099, -0.0409976989323754, 0.17998244524482757, 0.026061150967894544, 0.007472259070604078, 0.06008539312451537, -0.13281074052736644, -0.17399543133834677, 0.41931833963721027, -0.0022384622765164223, -0.16430531127919112, 0.1888616510636864, -0.0697379027763682, -0.18618411475101546, 0.041978441286952266, 0.20785296425043095, 0.09319240217854742, -0.16576564519913986, 0.044625256182025036, -0.05975039166909072, 0.11458098244958467, 0.03740070365789917, 0.029908350067994287, 0.184443095759038, 0.23319986027124667, 0.06715612727209866, 0.14587375780965592, -0.0723243567042969, -0.13037131143914116, -0.24292532315237386, -0.14189451624068522, -0.21555027863942086, 0.021133638016368833, -0.09738352004881767, -0.18102108304418862, 0.4507581301754521, 0.1660682934366407, 0.2343612379544685, 0.06835204549208884, 0.23904702922990245, 0.0649938725986548, 0.10672064998878106, 0.10418476201593876, 0.2078056177665149, 0.13943350831527382, 0.12287105370553271, -0.12029039220538952, 0.15033635284503802, 0.03275884742878618] |
1,803.00264 | Penalization of non-smooth dynamical systems with noise : ergodicity and
asymptotic formulae for threshold crossings probabilities | The purpose of this paper is to prove ergodicity and provide asymptotic
formulae for probabilities of threshold crossing related to smooth
approximations of three fundamental nonlinear mechanical models: (a) an
elasto-plastic oscillator, (b) an oscillator with dry friction, (c) an
oscillator constrained by an obstacle (one sided or two sided) and subject to
impacts, all three in presence of white or colored noise. Relying on a
groundbreaking result on density estimates for degenerate diffusions by Delarue
and Menozzi (2010), we identify Lyapunov functions that satisfy appropriate
conditions leading to ergodicity (invariant measure and Poisson equation) and a
functional central limit theorem. These conditions appear in the very
fundamental works of Down, Meyn and Tweedie (1995) and Glynn and Meyn (1996).
From an applied mathematics perspective, an important consequence is the access
to asymptotic formulae for quantities of interest in engineering and science.
| math.PR | the purpose of this paper is to prove ergodicity and provide asymptotic formulae for probabilities of threshold crossing related to smooth approximations of three fundamental nonlinear mechanical models a an elastoplastic oscillator b an oscillator with dry friction c an oscillator constrained by an obstacle one sided or two sided and subject to impacts all three in presence of white or colored noise relying on a groundbreaking result on density estimates for degenerate diffusions by delarue and menozzi 2010 we identify lyapunov functions that satisfy appropriate conditions leading to ergodicity invariant measure and poisson equation and a functional central limit theorem these conditions appear in the very fundamental works of down meyn and tweedie 1995 and glynn and meyn 1996 from an applied mathematics perspective an important consequence is the access to asymptotic formulae for quantities of interest in engineering and science | [['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'prove', 'ergodicity', 'and', 'provide', 'asymptotic', 'formulae', 'for', 'probabilities', 'of', 'threshold', 'crossing', 'related', 'to', 'smooth', 'approximations', 'of', 'three', 'fundamental', 'nonlinear', 'mechanical', 'models', 'a', 'an', 'elastoplastic', 'oscillator', 'b', 'an', 'oscillator', 'with', 'dry', 'friction', 'c', 'an', 'oscillator', 'constrained', 'by', 'an', 'obstacle', 'one', 'sided', 'or', 'two', 'sided', 'and', 'subject', 'to', 'impacts', 'all', 'three', 'in', 'presence', 'of', 'white', 'or', 'colored', 'noise', 'relying', 'on', 'a', 'groundbreaking', 'result', 'on', 'density', 'estimates', 'for', 'degenerate', 'diffusions', 'by', 'delarue', 'and', 'menozzi', '2010', 'we', 'identify', 'lyapunov', 'functions', 'that', 'satisfy', 'appropriate', 'conditions', 'leading', 'to', 'ergodicity', 'invariant', 'measure', 'and', 'poisson', 'equation', 'and', 'a', 'functional', 'central', 'limit', 'theorem', 'these', 'conditions', 'appear', 'in', 'the', 'very', 'fundamental', 'works', 'of', 'down', 'meyn', 'and', 'tweedie', '1995', 'and', 'glynn', 'and', 'meyn', '1996', 'from', 'an', 'applied', 'mathematics', 'perspective', 'an', 'important', 'consequence', 'is', 'the', 'access', 'to', 'asymptotic', 'formulae', 'for', 'quantities', 'of', 'interest', 'in', 'engineering', 'and', 'science']] | [-0.0950874185278146, 0.08655903057609668, -0.1108364257567995, 0.06394918118587131, -0.05125784281392018, -0.16732928123731744, 0.045105235084635535, 0.30582410843491975, -0.24665649843887544, -0.27126721364878853, 0.1332672049781688, -0.2411533562387799, -0.16393612264688323, 0.2257160676649811, -0.12175174947159076, 0.08718123298768006, 0.029002185342390692, 0.0020068907816353267, -0.024116863845847547, -0.21812968689441667, 0.3063111954735933, 0.027055188626523168, 0.25021664593631116, 0.042818881643437584, 0.11491543456623463, 0.018030157935818737, -0.0349628395978099, -0.039295697020707836, -0.19644397331433883, 0.10062675260402537, 0.2354448226580618, 0.05421307589694805, 0.29062732144481906, -0.40872331446981136, -0.16260527662644295, 0.10920640584581505, 0.09530139799905338, 0.0613212670973489, -0.006264898558737526, -0.27604660370820006, 0.028136234828861247, -0.157303810647597, -0.17381394939156067, -0.07447246973022399, 0.046065216087145915, 0.04745697803323118, -0.29001334034116333, 0.09374324370562558, 0.13720018368109432, 0.06094467817005557, -0.06787889454723664, -0.11251595339239379, -0.004306013882816048, 0.11110031950405576, 0.04457324038548264, -0.025070298427033802, 0.1080535485263271, -0.12730260809365346, -0.11823695907320067, 0.3518119643964562, -0.06852002518700803, -0.21130304098617889, 0.21915925859512997, -0.09661843406502157, -0.1592506350339456, 0.09081590994799012, 0.1662700743525958, 0.08994543201800002, -0.1824727653670059, 0.10133827303193549, -0.00627226061204081, 0.09479889506146207, 0.12608556289383224, -0.003779899155143911, 0.16114404393215728, 0.09530106961192615, 0.11414985175729847, 0.12665263217099956, -0.029995897624143203, -0.10411257591938049, -0.31447713625368096, -0.13882781375645542, -0.1689354048108905, 0.10465370142638919, -0.07617199165952757, -0.18422496840226607, 0.3422393619318978, 0.1099688522484888, 0.1626410656543055, 0.0494609760238566, 0.22708416713441026, 0.17473582971618104, -0.017695221408437545, 0.05986135091032492, 0.20275885780656736, 0.22624263807829523, 0.07874597385619983, -0.14632067746404087, 0.027523651023470784, 0.090810010009642] |
1,803.00265 | Again anti-plane shear | We reconsider anti-plane shear deformations of the form
$\varphi(x)=(x_1,\,x_2,\,x_3+u(x_1,x_2))$ based on prior work of Knowles and
relate the existence of anti-plane shear deformations to fundamental
constitutive concepts of elasticity theory like polyconvexity, rank-one
convexity and tension-compression symmetry. In addition, we provide
finite-element simulations to visualize our theoretical findings.
| math.AP | we reconsider antiplane shear deformations of the form varphixx_1x_2x_3ux_1x_2 based on prior work of knowles and relate the existence of antiplane shear deformations to fundamental constitutive concepts of elasticity theory like polyconvexity rankone convexity and tensioncompression symmetry in addition we provide finiteelement simulations to visualize our theoretical findings | [['we', 'reconsider', 'antiplane', 'shear', 'deformations', 'of', 'the', 'form', 'varphixx_1x_2x_3ux_1x_2', 'based', 'on', 'prior', 'work', 'of', 'knowles', 'and', 'relate', 'the', 'existence', 'of', 'antiplane', 'shear', 'deformations', 'to', 'fundamental', 'constitutive', 'concepts', 'of', 'elasticity', 'theory', 'like', 'polyconvexity', 'rankone', 'convexity', 'and', 'tensioncompression', 'symmetry', 'in', 'addition', 'we', 'provide', 'finiteelement', 'simulations', 'to', 'visualize', 'our', 'theoretical', 'findings']] | [-0.12623973691122645, 0.06639081220875712, -0.11938345840478197, -0.02027422530536956, -0.17023638830064458, -0.07159568523948497, -0.027633216046292257, 0.3331394050904411, -0.3043671007704069, -0.20143590094719796, 0.09738806907355071, -0.23679481514115283, -0.26069567061247345, 0.11192468055424855, -0.06018283224585367, 0.11378059143874239, -0.022883479532964053, -0.07015591832509442, -0.11152243149526259, -0.17911614374594487, 0.2975095835950305, 0.023529542887464484, 0.3643941722334699, 0.0738029061492156, 0.050185253734680565, 0.05022993513402787, -0.047364141395751465, 0.05178730322563268, -0.30242402465181784, 0.16997618208381723, 0.24003801025212446, 0.03639730239445542, 0.20653518523149034, -0.5278053352648907, -0.2385535137529703, 0.02102491027735015, 0.04596879069713202, 0.11572303256376627, -0.01870718666976516, -0.2348098704353609, 0.05672515171797986, -0.12572632583373405, -0.1662731346020356, -0.182292016223073, -0.01762755721450803, 0.043387915296331445, -0.2330933759543807, 0.19471931352498048, 0.084381986052749, 0.09577607587376173, -0.1940523975707115, -0.06509041413664818, -0.022763667207092365, 0.021792754543291284, 0.14174171846280706, -0.022905354744734915, 0.16344326589642924, -0.11850531387360806, -0.07821958095944942, 0.43576890531372514, -0.0003021643893357287, -0.259627200781982, 0.16977283143081723, -0.09186931145674687, -0.176897517068589, 0.04837750983820792, 0.23650808644263036, 0.0837980511727089, -0.09571201524677429, 0.06388156105853379, -0.04535230796070809, 0.11022315658827095, 0.1281215353730194, -0.05735786787254062, 0.15311265094800197, 0.1411266953070113, 0.02412824967796815, 0.16082665777983182, -0.023822330230688478, -0.0865493662893138, -0.3977958001493615, -0.13996739668692362, -0.13609846108692122, 0.07016324457970072, -0.11557209358904807, -0.21834347533815085, 0.3417946393254827, 0.1548229730985266, 0.11083991484260781, 0.12063015236499462, 0.20869058829811502, 0.0010763814405320173, 0.004605423540193984, -0.0041972337627506, 0.3248524810088442, 0.2763741618378999, 0.057366132326894734, -0.2383325409461209, 0.012082490554832398, 0.12424305688213319] |
1,803.00266 | Measuring and engineering the atomic mass density wave of a Gaussian
mass-polariton pulse in optical fibers | Conventional theories of electromagnetic waves in a medium assume that only
the energy of the field propagates inside the medium. Consequently, they
neglect the transport of mass density by the medium atoms. We have recently
presented foundations of a covariant theory of light propagation in a
nondispersive medium by considering a light wave simultaneously with the
dynamics of the medium atoms driven by optoelastic forces [Phys. Rev. A 95,
063850 (2017)]. In particular, we have shown that the mass is transferred by an
atomic mass density wave (MDW), which gives rise to mass-polariton (MP)
quasiparticles, i.e., covariant coupled states of the field and matter having a
nonzero rest mass. Another key observation of the mass-polariton theory of
light is that, in common semiconductors, most of the momentum of light is
transferred by moving atoms, e.g., 92% in the case of silicon. In this work, we
generalize the MP theory of light for dispersive media and consider
experimental measurement of the mass transferred by the MDW atoms when an
intense light pulse propagates in a silicon fiber. In particular, we consider
optimal intensity and time dependence of a Gaussian pulse and account for the
breakdown threshold irradiance of the material. The optical shock wave property
of the MDW, which propagates with the velocity of light instead of the velocity
of sound, prompts for engineering of novel device concepts like very high
frequency mechanical oscillators not limited by the acoustic cutoff frequency.
| physics.optics | conventional theories of electromagnetic waves in a medium assume that only the energy of the field propagates inside the medium consequently they neglect the transport of mass density by the medium atoms we have recently presented foundations of a covariant theory of light propagation in a nondispersive medium by considering a light wave simultaneously with the dynamics of the medium atoms driven by optoelastic forces phys rev a 95 063850 2017 in particular we have shown that the mass is transferred by an atomic mass density wave mdw which gives rise to masspolariton mp quasiparticles ie covariant coupled states of the field and matter having a nonzero rest mass another key observation of the masspolariton theory of light is that in common semiconductors most of the momentum of light is transferred by moving atoms eg 92 in the case of silicon in this work we generalize the mp theory of light for dispersive media and consider experimental measurement of the mass transferred by the mdw atoms when an intense light pulse propagates in a silicon fiber in particular we consider optimal intensity and time dependence of a gaussian pulse and account for the breakdown threshold irradiance of the material the optical shock wave property of the mdw which propagates with the velocity of light instead of the velocity of sound prompts for engineering of novel device concepts like very high frequency mechanical oscillators not limited by the acoustic cutoff frequency | [['conventional', 'theories', 'of', 'electromagnetic', 'waves', 'in', 'a', 'medium', 'assume', 'that', 'only', 'the', 'energy', 'of', 'the', 'field', 'propagates', 'inside', 'the', 'medium', 'consequently', 'they', 'neglect', 'the', 'transport', 'of', 'mass', 'density', 'by', 'the', 'medium', 'atoms', 'we', 'have', 'recently', 'presented', 'foundations', 'of', 'a', 'covariant', 'theory', 'of', 'light', 'propagation', 'in', 'a', 'nondispersive', 'medium', 'by', 'considering', 'a', 'light', 'wave', 'simultaneously', 'with', 'the', 'dynamics', 'of', 'the', 'medium', 'atoms', 'driven', 'by', 'optoelastic', 'forces', 'phys', 'rev', 'a', '95', '063850', '2017', 'in', 'particular', 'we', 'have', 'shown', 'that', 'the', 'mass', 'is', 'transferred', 'by', 'an', 'atomic', 'mass', 'density', 'wave', 'mdw', 'which', 'gives', 'rise', 'to', 'masspolariton', 'mp', 'quasiparticles', 'ie', 'covariant', 'coupled', 'states', 'of', 'the', 'field', 'and', 'matter', 'having', 'a', 'nonzero', 'rest', 'mass', 'another', 'key', 'observation', 'of', 'the', 'masspolariton', 'theory', 'of', 'light', 'is', 'that', 'in', 'common', 'semiconductors', 'most', 'of', 'the', 'momentum', 'of', 'light', 'is', 'transferred', 'by', 'moving', 'atoms', 'eg', '92', 'in', 'the', 'case', 'of', 'silicon', 'in', 'this', 'work', 'we', 'generalize', 'the', 'mp', 'theory', 'of', 'light', 'for', 'dispersive', 'media', 'and', 'consider', 'experimental', 'measurement', 'of', 'the', 'mass', 'transferred', 'by', 'the', 'mdw', 'atoms', 'when', 'an', 'intense', 'light', 'pulse', 'propagates', 'in', 'a', 'silicon', 'fiber', 'in', 'particular', 'we', 'consider', 'optimal', 'intensity', 'and', 'time', 'dependence', 'of', 'a', 'gaussian', 'pulse', 'and', 'account', 'for', 'the', 'breakdown', 'threshold', 'irradiance', 'of', 'the', 'material', 'the', 'optical', 'shock', 'wave', 'property', 'of', 'the', 'mdw', 'which', 'propagates', 'with', 'the', 'velocity', 'of', 'light', 'instead', 'of', 'the', 'velocity', 'of', 'sound', 'prompts', 'for', 'engineering', 'of', 'novel', 'device', 'concepts', 'like', 'very', 'high', 'frequency', 'mechanical', 'oscillators', 'not', 'limited', 'by', 'the', 'acoustic', 'cutoff', 'frequency']] | [-0.14021720755602776, 0.2368629904125555, -0.07146511362419308, -0.010172395251962977, -0.0344756305081925, -0.10089606442100679, 0.03900370530015304, 0.3648800887477895, -0.2274450328477542, -0.2805626416928135, 0.003439357379102148, -0.2765374261691856, -0.09670505397953093, 0.16990838713148454, -0.015077368753554764, 0.03160981037314438, 0.015281111067937066, 0.022048636223189533, -0.03803795684119298, -0.15269352623484642, 0.30815215427185955, 0.06364601311894755, 0.2932376974883179, 0.06314583814334279, 0.12406002804970437, 0.05056250776106026, -0.007237407494297562, -0.016282209412020167, -0.08692177998160938, 0.09085293465832364, 0.1814530694799032, 0.05380803031390921, 0.2586197415308561, -0.4714339164473737, -0.2903148782749971, 0.04048975009160737, 0.12843728490715875, 0.1333146766148275, -0.08008391139834808, -0.2757030190541021, -0.009239270422646466, -0.15113929052604363, -0.17559317210737693, 0.0034716105408733712, 0.04308486175626361, 0.0541205287949803, -0.2203131421119906, 0.11231728852435481, 0.0352904075931292, 0.016123026134543274, -0.0568868001253577, -0.04731166715112825, -0.04350084148269768, 0.027458461379501385, 0.03142043836802865, 0.04763559925777372, 0.15728631298309967, -0.14695233806463268, -0.04001938240980962, 0.424778648163192, -0.10449897531410292, -0.1429963091465955, 0.15781008381745779, -0.16301732873774502, -0.03611894324809934, 0.15894426906403775, 0.19500360478001919, 0.10252825198937596, -0.1529019664588001, 0.0650659020631186, -0.05240324613872265, 0.18099094365607016, 0.11466498785302974, 0.09499004277943944, 0.22873567934536065, 0.154666068864996, 0.010234982910333201, 0.08854798774797625, -0.09472860427146466, -0.04398315061892693, -0.2832514878449729, -0.15503744500286606, -0.19006434300681577, 0.051944844187164566, -0.048135343339708925, -0.1430684827465787, 0.420337327158389, 0.13854262631114883, 0.16894035129225812, -0.02634128032720279, 0.29150357261532917, 0.15108014752622695, 0.048054354589779295, 0.08875021421505759, 0.32922127056711664, 0.20891466728935484, 0.12025118767487583, -0.2305566625475573, -0.008970782773879667, 0.0007444562409849217] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.