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.05467
|
The phase-separation mechanism of a binary mixture in a ring trimer
|
We show that, depending on the ratio between the inter- and the intra-species
interactions, a binary mixture trapped in a three-well potential with periodic
boundary conditions exhibits three macroscopic ground-state configurations
which differ in the degree of mixing. Accordingly, the corresponding quantum
states feature either delocalization or a Schr\"odinger cat-like structure. The
two-step phase separation occurring in the system, which is smoothed by the
activation of tunnelling processes, is confirmed by the analysis of the energy
spectrum that collapses and rearranges at the two critical points. In such
points, we show that also Entanglement Entropy, a quantity borrowed from
quantum-information theory, features singularities, thus demonstrating its
ability to witness the double mixining-demixing phase transition. The developed
analysis, which is of interest to both the experimental and theoretical
communities, opens the door to the study of the demixing mechanism in complex
lattice geometries.
|
cond-mat.quant-gas
|
we show that depending on the ratio between the inter and the intraspecies interactions a binary mixture trapped in a threewell potential with periodic boundary conditions exhibits three macroscopic groundstate configurations which differ in the degree of mixing accordingly the corresponding quantum states feature either delocalization or a schrodinger catlike structure the twostep phase separation occurring in the system which is smoothed by the activation of tunnelling processes is confirmed by the analysis of the energy spectrum that collapses and rearranges at the two critical points in such points we show that also entanglement entropy a quantity borrowed from quantuminformation theory features singularities thus demonstrating its ability to witness the double mixiningdemixing phase transition the developed analysis which is of interest to both the experimental and theoretical communities opens the door to the study of the demixing mechanism in complex lattice geometries
|
[['we', 'show', 'that', 'depending', 'on', 'the', 'ratio', 'between', 'the', 'inter', 'and', 'the', 'intraspecies', 'interactions', 'a', 'binary', 'mixture', 'trapped', 'in', 'a', 'threewell', 'potential', 'with', 'periodic', 'boundary', 'conditions', 'exhibits', 'three', 'macroscopic', 'groundstate', 'configurations', 'which', 'differ', 'in', 'the', 'degree', 'of', 'mixing', 'accordingly', 'the', 'corresponding', 'quantum', 'states', 'feature', 'either', 'delocalization', 'or', 'a', 'schrodinger', 'catlike', 'structure', 'the', 'twostep', 'phase', 'separation', 'occurring', 'in', 'the', 'system', 'which', 'is', 'smoothed', 'by', 'the', 'activation', 'of', 'tunnelling', 'processes', 'is', 'confirmed', 'by', 'the', 'analysis', 'of', 'the', 'energy', 'spectrum', 'that', 'collapses', 'and', 'rearranges', 'at', 'the', 'two', 'critical', 'points', 'in', 'such', 'points', 'we', 'show', 'that', 'also', 'entanglement', 'entropy', 'a', 'quantity', 'borrowed', 'from', 'quantuminformation', 'theory', 'features', 'singularities', 'thus', 'demonstrating', 'its', 'ability', 'to', 'witness', 'the', 'double', 'mixiningdemixing', 'phase', 'transition', 'the', 'developed', 'analysis', 'which', 'is', 'of', 'interest', 'to', 'both', 'the', 'experimental', 'and', 'theoretical', 'communities', 'opens', 'the', 'door', 'to', 'the', 'study', 'of', 'the', 'demixing', 'mechanism', 'in', 'complex', 'lattice', 'geometries']]
|
[-0.14612332229495895, 0.1784538831784727, -0.10800843135369545, 0.0428298585115212, 0.011613006635853056, -0.14586915718901372, 0.07582817599094796, 0.3285313251598388, -0.28534027656659167, -0.25374900847211057, 0.05061352136132063, -0.29138547163836476, -0.17390050120397424, 0.14769737281859688, 0.03487592780919653, 0.05938447116839481, 0.045136885347624195, 0.03562456170090388, -0.08468300673585544, -0.17526515242346424, 0.34672382533144047, 0.02915216536436177, 0.3009731695468782, 0.09605833118391745, 0.0564497943739704, -0.009118450462078372, 0.04898290577879612, 0.004474565358700376, -0.12373231825535805, 0.09165231305701288, 0.21333958134583547, 0.07367262147459472, 0.2301011697293411, -0.3964555934401797, -0.23684000054123341, 0.09491504497944991, 0.13306370874245962, 0.13478871785411414, -0.04601135804790158, -0.3010386963753056, 0.018198618011430225, -0.12384336237749828, -0.13512451151808633, -0.07852609072653378, 0.0014128605769088505, 0.015829812244888632, -0.25440077595817295, 0.10170092159062327, 0.07522744433591076, 0.037857211016594096, -0.06595910753780672, -0.058521597931022816, -0.045811249663168234, 0.10884821149586628, 0.012028817382991209, -0.004523139237261093, 0.13320562533756836, -0.14415819203177244, -0.1272210031384536, 0.3746268370367111, -0.04157552979589301, -0.17128884619769, 0.23095361774800516, -0.15727210739059438, -0.0937411481415909, 0.14850717289406304, 0.13419582697865057, 0.09876463415946626, -0.11043113975410832, 0.0625713242482929, 0.015252862106645414, 0.17771586804842274, 0.06407398349896126, 0.03775382883424032, 0.22851803287507055, 0.1555218867997223, 0.04973426554021789, 0.17690813263543015, -0.09697326454697243, -0.17726956405148492, -0.27325144825595704, -0.1515567430711173, -0.21841446396726322, 0.03813543107446468, -0.08336815147312665, -0.18476753985073338, 0.4302907752480807, 0.1320328769531656, 0.2381431420683755, -0.017686835329167226, 0.24405857183514756, 0.10600121171339184, 0.04087661226537633, 0.024414803162349244, 0.24855722944212563, 0.12375036942283787, 0.07096706185133216, -0.2893031415750821, 0.03668186055654858, 0.06442604907491106]
|
1,803.05468
|
Hardware Implementation of a Fast Algorithm for the Reconstruction of
Muon Tracks in ATLAS Muon Drift-Tube Chambers for the First-Level Muon
Trigger at the HL-LHC
|
The High-Luminosity LHC will provide the unique opportunity to explore the
nature of physics beyond the Standard Model of strong and electroweak
interactions. Highly selective first level triggers are essential for the
physics programme of the ATLAS experiment at the HL-LHC where the instantaneous
luminosity will exceed the LHC Run 1 instantaneous luminosity by almost an
order of magnitude. The ATLAS first level muon trigger rate is dominated by low
momentum muons, selected due to the moderate momentum resolution of the
resistive plate and thin gap trigger chambers. This limitation can be overcome
by including the data of the precision muon drift tube (MDT) chambers in the
first level trigger decision. This requires the fast continuous transfer of the
MDT hits to the off-detector trigger logic and a fast track reconstruction
algorithm performed in the trigger logic.
In order to demonstrate the feasibility of reconstructing tracks in MDT
chambers within the short available first-level trigger latency of about
3~$\mu$s we implemented a seeded Hough transform on the ARM Cortex A9
microprocessor of a Xilinx Zynq FPGA and studied its performance with test-beam
data recorded in CERN's Gamma Irradiation Facility. We could show that by using
the ARM processor's Neon Single Instruction Multiple Data Engine to carry out 4
floating point operations in parallel the challenging latency requirement can
be matched.
|
physics.ins-det hep-ex
|
the highluminosity lhc will provide the unique opportunity to explore the nature of physics beyond the standard model of strong and electroweak interactions highly selective first level triggers are essential for the physics programme of the atlas experiment at the hllhc where the instantaneous luminosity will exceed the lhc run 1 instantaneous luminosity by almost an order of magnitude the atlas first level muon trigger rate is dominated by low momentum muons selected due to the moderate momentum resolution of the resistive plate and thin gap trigger chambers this limitation can be overcome by including the data of the precision muon drift tube mdt chambers in the first level trigger decision this requires the fast continuous transfer of the mdt hits to the offdetector trigger logic and a fast track reconstruction algorithm performed in the trigger logic in order to demonstrate the feasibility of reconstructing tracks in mdt chambers within the short available firstlevel trigger latency of about 3mus we implemented a seeded hough transform on the arm cortex a9 microprocessor of a xilinx zynq fpga and studied its performance with testbeam data recorded in cerns gamma irradiation facility we could show that by using the arm processors neon single instruction multiple data engine to carry out 4 floating point operations in parallel the challenging latency requirement can be matched
|
[['the', 'highluminosity', 'lhc', 'will', 'provide', 'the', 'unique', 'opportunity', 'to', 'explore', 'the', 'nature', 'of', 'physics', 'beyond', 'the', 'standard', 'model', 'of', 'strong', 'and', 'electroweak', 'interactions', 'highly', 'selective', 'first', 'level', 'triggers', 'are', 'essential', 'for', 'the', 'physics', 'programme', 'of', 'the', 'atlas', 'experiment', 'at', 'the', 'hllhc', 'where', 'the', 'instantaneous', 'luminosity', 'will', 'exceed', 'the', 'lhc', 'run', '1', 'instantaneous', 'luminosity', 'by', 'almost', 'an', 'order', 'of', 'magnitude', 'the', 'atlas', 'first', 'level', 'muon', 'trigger', 'rate', 'is', 'dominated', 'by', 'low', 'momentum', 'muons', 'selected', 'due', 'to', 'the', 'moderate', 'momentum', 'resolution', 'of', 'the', 'resistive', 'plate', 'and', 'thin', 'gap', 'trigger', 'chambers', 'this', 'limitation', 'can', 'be', 'overcome', 'by', 'including', 'the', 'data', 'of', 'the', 'precision', 'muon', 'drift', 'tube', 'mdt', 'chambers', 'in', 'the', 'first', 'level', 'trigger', 'decision', 'this', 'requires', 'the', 'fast', 'continuous', 'transfer', 'of', 'the', 'mdt', 'hits', 'to', 'the', 'offdetector', 'trigger', 'logic', 'and', 'a', 'fast', 'track', 'reconstruction', 'algorithm', 'performed', 'in', 'the', 'trigger', 'logic', 'in', 'order', 'to', 'demonstrate', 'the', 'feasibility', 'of', 'reconstructing', 'tracks', 'in', 'mdt', 'chambers', 'within', 'the', 'short', 'available', 'firstlevel', 'trigger', 'latency', 'of', 'about', '3mus', 'we', 'implemented', 'a', 'seeded', 'hough', 'transform', 'on', 'the', 'arm', 'cortex', 'a9', 'microprocessor', 'of', 'a', 'xilinx', 'zynq', 'fpga', 'and', 'studied', 'its', 'performance', 'with', 'testbeam', 'data', 'recorded', 'in', 'cerns', 'gamma', 'irradiation', 'facility', 'we', 'could', 'show', 'that', 'by', 'using', 'the', 'arm', 'processors', 'neon', 'single', 'instruction', 'multiple', 'data', 'engine', 'to', 'carry', 'out', '4', 'floating', 'point', 'operations', 'in', 'parallel', 'the', 'challenging', 'latency', 'requirement', 'can', 'be', 'matched']]
|
[-0.09999311585085127, 0.1392425942013109, -0.036866189642354254, 0.058663745408094575, -0.044004152093971655, -0.14859371880487413, 0.03601964089744301, 0.3876348890194839, -0.24475869189693847, -0.3698379986496134, 0.11885703961015678, -0.2627693075919524, 0.01570331731663001, 0.20013581019064242, -0.03801232430427758, 0.10132121900493406, 0.11462311836102428, -0.00486702972861663, -0.06468331197512188, -0.2368147350715431, 0.1819882058168084, 0.17752382368780673, 0.2637991104005116, 0.032428562187124046, 0.14179210819526236, -0.01506976668315474, -0.054663860332749954, -0.057259667927229946, -0.0662613802358299, 0.0370768614822406, 0.27637903106144884, 0.13250547360671175, 0.22887718964960765, -0.4896164956735447, -0.07237001193570905, 0.06596820988078517, 0.11125942938167348, 0.010394347640050745, -0.07653214442384937, -0.28794753103813325, 0.11895700329808857, -0.2049011807465418, -0.11237065647728742, -0.016196752585132014, -0.03026876924559474, 0.020856322693130508, -0.2488873610307399, 0.014724753296468407, 0.016614089800383557, 0.041832017617046156, -0.0024910677653017708, -0.08603505075231872, 0.0033410960639064964, 0.08564972541379658, -0.004657131713148291, 0.09417554680403555, 0.2114982111289547, -0.1607900815105743, -0.17042410189328208, 0.29470372772563924, -0.010437189564320513, -0.12896334002619947, 0.19865167799977246, -0.20400260205444118, -0.09501307987057689, 0.197931777482683, 0.230412655914287, 0.04869863874998621, -0.19235217622904616, 0.06842682579841824, 0.05685035084289583, 0.2199908377715143, 0.07197406179356304, 0.018150223191002044, 0.21717825805112212, 0.2896713150580498, 0.05378400538413024, 0.13795071676087736, -0.19117215450863692, -0.02568157569939186, -0.35650597843156323, -0.140808487997856, -0.14047489478252828, -0.008410047663545066, -0.014307205191950991, -0.08681033625352112, 0.4015556681118059, 0.14998331767591563, 0.181295443699293, -0.0002156587629790672, 0.33808516285128215, 0.0637618555941365, 0.14284159149657089, 0.05906242238759825, 0.2641303132182326, 0.05530952119522474, 0.18572936070201898, -0.2501326105663214, 0.06202095973157239, 0.04909244149457663]
|
1,803.05469
|
The energy scale of Dirac electrons in Cd3As2
|
Cadmium arsenide (Cd3As2) has recently became conspicuous in solid-state
physics due to several reports proposing that it hosts a pair of
symmetry-protected 3D Dirac cones. Despite vast investigations, a solid
experimental insight into the band structure of this material is still missing.
Here we fill one of the existing gaps in our understanding of Cd3As2, and based
on our Landau level spectroscopy study, we provide an estimate for the energy
scale of 3D Dirac electrons in this system. We find that the appearance of such
charge carriers is limited - contrary to a widespread belief in the solid-state
community - to a relatively small energy scale (below 40 meV).
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
cadmium arsenide cd3as2 has recently became conspicuous in solidstate physics due to several reports proposing that it hosts a pair of symmetryprotected 3d dirac cones despite vast investigations a solid experimental insight into the band structure of this material is still missing here we fill one of the existing gaps in our understanding of cd3as2 and based on our landau level spectroscopy study we provide an estimate for the energy scale of 3d dirac electrons in this system we find that the appearance of such charge carriers is limited contrary to a widespread belief in the solidstate community to a relatively small energy scale below 40 mev
|
[['cadmium', 'arsenide', 'cd3as2', 'has', 'recently', 'became', 'conspicuous', 'in', 'solidstate', 'physics', 'due', 'to', 'several', 'reports', 'proposing', 'that', 'it', 'hosts', 'a', 'pair', 'of', 'symmetryprotected', '3d', 'dirac', 'cones', 'despite', 'vast', 'investigations', 'a', 'solid', 'experimental', 'insight', 'into', 'the', 'band', 'structure', 'of', 'this', 'material', 'is', 'still', 'missing', 'here', 'we', 'fill', 'one', 'of', 'the', 'existing', 'gaps', 'in', 'our', 'understanding', 'of', 'cd3as2', 'and', 'based', 'on', 'our', 'landau', 'level', 'spectroscopy', 'study', 'we', 'provide', 'an', 'estimate', 'for', 'the', 'energy', 'scale', 'of', '3d', 'dirac', 'electrons', 'in', 'this', 'system', 'we', 'find', 'that', 'the', 'appearance', 'of', 'such', 'charge', 'carriers', 'is', 'limited', 'contrary', 'to', 'a', 'widespread', 'belief', 'in', 'the', 'solidstate', 'community', 'to', 'a', 'relatively', 'small', 'energy', 'scale', 'below', '40', 'mev']]
|
[-0.11764939993219538, 0.1532068153437734, -0.03880787265102426, 0.062233436134617744, -0.07678630895543817, -0.11065962697514202, 0.10167931764882719, 0.382116752123965, -0.23167641220666538, -0.3606473980558531, 0.024100054830103836, -0.3243175738351855, -0.14203399413528583, 0.1791946888231089, -0.03157245096202209, 0.03702357127635836, 0.04975924723581455, -0.05172238671237159, -0.09976578894654446, -0.17227957833114418, 0.30705588734621686, 0.08454679556748021, 0.31150425290340716, 0.12677744193716306, 0.05969786974296809, -0.05064585720728561, 0.03394503579431466, -0.02701090210091288, -0.11266825747718082, 0.12744770050525506, 0.2802292064232665, -0.01212081753213076, 0.2909936548632822, -0.44582036417848037, -0.24541348656508896, 0.03527286986898735, 0.14826191652122292, 0.1440106359501935, -0.16301421030472407, -0.2761486238129785, 0.09754022520697006, -0.150077476975656, -0.14698858010347618, -0.06295542166977425, -0.007543111907614169, -0.07855928249474371, -0.15397148277168815, 0.06958520697934606, 0.05277949511117049, 0.058393197835893064, -0.09688593525979146, -0.13140904968147488, -0.019739943708806672, 0.06775089933441203, 0.0447954556591391, 0.03193717498564005, 0.11659983590367103, -0.14500539387776473, -0.10235893717644928, 0.42151890188307617, -0.0063020563183926815, -0.1007104075522484, 0.2081115746840173, -0.1920484153153462, -0.12230510755537827, 0.17648758041176282, 0.13560116802348765, 0.08050361585968704, -0.14407843344455376, 0.0769285578862764, -0.09097179574630807, 0.18447724609661884, 0.0024554869899891803, 0.11166101595317231, 0.26439076590691213, 0.26024617801342054, 0.03947592815645387, 0.06926177756068792, -0.13541715049019484, -0.05862141721316169, -0.20602125181842632, -0.2212471103760257, -0.2372437938569096, 0.08150708719448264, 0.009837712352865846, -0.20786756730560108, 0.44016925554513653, 0.1815167042082959, 0.2067875849087418, -0.06896382400539712, 0.25701383283257345, 0.0565361631446666, 0.1060073045822226, 0.04287373961306343, 0.28275882865075963, 0.09620575002768886, 0.10819907361537079, -0.18780075815271272, 0.03075363902183615, -0.02484631639356925]
|
1,803.0547
|
Cake-Cutting with Different Entitlements: How Many Cuts are Needed?
|
A cake has to be divided fairly among $n$ agents. When all agents have equal
entitlements, it is known that such a division can be implemented with $n-1$
cuts. When agents may have different entitlements, the paper shows that at
least $2 n -2$ cuts may be necessary, and $O(n \log(n))$ cuts are always
sufficient.
|
math.CO cs.GT
|
a cake has to be divided fairly among n agents when all agents have equal entitlements it is known that such a division can be implemented with n1 cuts when agents may have different entitlements the paper shows that at least 2 n 2 cuts may be necessary and on logn cuts are always sufficient
|
[['a', 'cake', 'has', 'to', 'be', 'divided', 'fairly', 'among', 'n', 'agents', 'when', 'all', 'agents', 'have', 'equal', 'entitlements', 'it', 'is', 'known', 'that', 'such', 'a', 'division', 'can', 'be', 'implemented', 'with', 'n1', 'cuts', 'when', 'agents', 'may', 'have', 'different', 'entitlements', 'the', 'paper', 'shows', 'that', 'at', 'least', '2', 'n', '2', 'cuts', 'may', 'be', 'necessary', 'and', 'on', 'logn', 'cuts', 'are', 'always', 'sufficient']]
|
[-0.1334124039519917, 0.1743117251687429, -0.12932398245585236, 0.048799465996721254, -0.07120678254657171, -0.26950392636724496, 0.02337945776525885, 0.43448173303834414, -0.21432738700373608, -0.3282962390644984, 0.13350012202916497, -0.2703034172003919, -0.09794442996552044, 0.12722704153169284, -0.08904548758979548, -0.043992212469774215, 0.039344896088269625, 0.06995931745252826, 0.048278094253989615, -0.4197523334825581, 0.2641349435953254, -0.04012258743697947, 0.2024591104550795, 0.019738080107014288, 0.056722234845669434, -0.008895250375975262, 0.026602368509735574, 0.11167216043580662, -0.07941443263685373, -0.011935094879432158, 0.34061929807066915, 0.16642727001400834, 0.3119931278580969, -0.4315976916050369, -0.11983176879769995, 0.2103807424300943, 0.24513523383066058, 0.05299486511132934, 0.0771885952658274, -0.14659549790349874, 0.18566921099343084, -0.13853395936841315, -0.04740152714604681, -0.05724535721608184, 0.04565386480059136, 0.020631111988967114, -0.3313718411563472, -0.042949817956171255, 0.043941172584891316, 0.025849515572190285, 0.0021307080222124405, -0.18623313331468538, -0.03531546721404249, 0.16039289019007066, 0.0013420934407887134, 0.03385081180286678, 0.08252105709503997, -0.08462181739847768, -0.1422486487776041, 0.383664456280795, 0.05914246404374188, -0.24245315891775218, 0.20318821563639425, -0.14999524922194807, -0.1469431362204804, 0.13770488578487527, 0.14640559823336927, 0.10078464385799386, -0.14667660763582469, 0.06547207180304791, -0.10286193635653365, 0.1831981146708131, 0.12731455717743798, 0.0238212613388896, 0.1603182320483029, 0.09498504665256902, 0.17564960696988485, 0.08568066772793166, 0.017954913700338113, -0.051507430836897, -0.30162598575380717, -0.1013894442384216, -0.17829643253194677, 0.0741007347675887, -0.11366169104029805, -0.04211937339807099, 0.2827115080573342, 0.05232471271248704, 0.20906825546513905, 0.08134721639481458, 0.2748373803428628, 0.12402646683304655, 0.11873923855071718, 0.16158463061702522, 0.1800573184070262, 0.01046490898271176, -0.01626631935042414, -0.13279468107291242, 0.11270047416063872, -0.019976133353669535]
|
1,803.05471
|
Computer-aided diagnosis of lung carcinoma using deep learning - a pilot
study
|
Aim: Early detection and correct diagnosis of lung cancer are the most
important steps in improving patient outcome. This study aims to assess which
deep learning models perform best in lung cancer diagnosis. Methods: Non-small
cell lung carcinoma and small cell lung carcinoma biopsy specimens were
consecutively obtained and stained. The specimen slides were diagnosed by two
experienced pathologists (over 20 years). Several deep learning models were
trained to discriminate cancer and non-cancer biopsies. Result: Deep learning
models give reasonable AUC from 0.8810 to 0.9119. Conclusion: The deep learning
analysis could help to speed up the detection process for the whole-slide image
(WSI) and keep the comparable detection rate with human observer.
|
cs.CV
|
aim early detection and correct diagnosis of lung cancer are the most important steps in improving patient outcome this study aims to assess which deep learning models perform best in lung cancer diagnosis methods nonsmall cell lung carcinoma and small cell lung carcinoma biopsy specimens were consecutively obtained and stained the specimen slides were diagnosed by two experienced pathologists over 20 years several deep learning models were trained to discriminate cancer and noncancer biopsies result deep learning models give reasonable auc from 08810 to 09119 conclusion the deep learning analysis could help to speed up the detection process for the wholeslide image wsi and keep the comparable detection rate with human observer
|
[['aim', 'early', 'detection', 'and', 'correct', 'diagnosis', 'of', 'lung', 'cancer', 'are', 'the', 'most', 'important', 'steps', 'in', 'improving', 'patient', 'outcome', 'this', 'study', 'aims', 'to', 'assess', 'which', 'deep', 'learning', 'models', 'perform', 'best', 'in', 'lung', 'cancer', 'diagnosis', 'methods', 'nonsmall', 'cell', 'lung', 'carcinoma', 'and', 'small', 'cell', 'lung', 'carcinoma', 'biopsy', 'specimens', 'were', 'consecutively', 'obtained', 'and', 'stained', 'the', 'specimen', 'slides', 'were', 'diagnosed', 'by', 'two', 'experienced', 'pathologists', 'over', '20', 'years', 'several', 'deep', 'learning', 'models', 'were', 'trained', 'to', 'discriminate', 'cancer', 'and', 'noncancer', 'biopsies', 'result', 'deep', 'learning', 'models', 'give', 'reasonable', 'auc', 'from', '08810', 'to', '09119', 'conclusion', 'the', 'deep', 'learning', 'analysis', 'could', 'help', 'to', 'speed', 'up', 'the', 'detection', 'process', 'for', 'the', 'wholeslide', 'image', 'wsi', 'and', 'keep', 'the', 'comparable', 'detection', 'rate', 'with', 'human', 'observer']]
|
[0.06940217749903571, 0.008657723779536107, -0.01775532570582899, 0.06031499709254356, -0.054133903933689, -0.24385167091068896, 0.032319405023008584, 0.4128056284844537, -0.13971797133139757, -0.32513372816822744, 0.10952459374569695, -0.32214929419146343, -0.16362239738651127, 0.21837767635006458, -0.21026629052886908, 0.10409299128964035, 0.1952590126787651, 0.03944861466192048, 0.06394469865851782, -0.3700768811077895, 0.17346357765226542, 0.06524746352700855, 0.4003757309676571, 0.004268148219720884, 0.1074660134840418, -0.03330237047577446, -0.08161143060265617, -0.05388207337395711, -0.09393306145846675, 0.14065386271527544, 0.44350019291659093, 0.25630449399521404, 0.36214913827028467, -0.4550065935335376, -0.2578964737222784, 0.10135895355435258, 0.15575190536381509, 0.10101628473176706, 0.016237414111806587, -0.3306706106798215, 0.07153253081593323, -0.09577329351556149, -0.030282442123544487, -0.09607904252956029, -0.06066015495664694, -0.07463259378829125, -0.2690432605756955, 0.12661211308599873, -0.023632725954733112, 0.1688492044933479, -0.16639933283229105, -0.13705061949704858, 0.04445541949667545, 0.2234493027017875, 0.07001703478030818, 0.11927771023686298, 0.23218576510182837, -0.24259869313523683, -0.124846084960948, 0.2791777707467025, 0.01813040343324908, -0.1020655875496397, 0.23516062346964398, -0.0821449997623197, -0.0864493642595004, 0.18002394582568246, 0.2374240132239224, 0.1289834177460183, -0.23083269562868572, -0.13587867394354278, 0.08361720774925992, 0.1586122454313392, 0.14087220512076534, -0.18277546597475355, 0.1419611846065064, 0.29634125515056603, -0.1277045020918277, 0.08431421692737125, -0.2492765105583451, 0.025860181929204952, -0.17056470473127608, -0.18485783230598, -0.03375305408950557, 0.00363359291381626, -0.10689798710293623, -0.167872052366676, 0.37859050775243136, 0.1926982674578374, 0.14762346707072788, 0.06190078495260836, 0.2933963326991282, -0.0838091562290422, 0.16087880984626032, -0.056540098987435075, 0.2266976954881102, 0.028011748888953164, 0.0874669560263018, -0.24145173410758036, 0.17646538947539572, 0.04122152272188528]
|
1,803.05472
|
NMR close to Mega-Bar Pressures
|
The past 15 years have seen an astonishing increase in Nuclear Magnetic
Resonance (NMR) sensitivity and accessible pressure range in high-pressure NMR
experiments, owing to a series of new developments of NMR spectroscopy applied
to the diamond anvil cell (DAC). Recently, with the application of
electro-magnetic lenses, so-called Lenz lenses, in toroidal diamond indenter
cells, pressures of up to 72 GPa with NMR spin sensitivities of about 10^12
spins/(Hz^1/2) has been achieved. Here, we describe the implementation of a
refined NMR resonator structure using a pair of double stage Lenz lenses driven
by a Helmholtz coil within a standard DAC, allowing to measure sample volumes
as small as 100 pl prior to compression. With this set-up, pressures close to
the mega-bar regime (1 Mbar = 100 GPa) could be realised repeatedly, with
enhanced spin sensitivities of about 5x10^11 spin/(Hz^1/2). The manufacturing
and handling of these new NMR-DACs is relatively easy and straightforward,
which will allow for further applications in physics, chemistry, or
biochemistry.
|
physics.app-ph
|
the past 15 years have seen an astonishing increase in nuclear magnetic resonance nmr sensitivity and accessible pressure range in highpressure nmr experiments owing to a series of new developments of nmr spectroscopy applied to the diamond anvil cell dac recently with the application of electromagnetic lenses socalled lenz lenses in toroidal diamond indenter cells pressures of up to 72 gpa with nmr spin sensitivities of about 1012 spinshz12 has been achieved here we describe the implementation of a refined nmr resonator structure using a pair of double stage lenz lenses driven by a helmholtz coil within a standard dac allowing to measure sample volumes as small as 100 pl prior to compression with this setup pressures close to the megabar regime 1 mbar 100 gpa could be realised repeatedly with enhanced spin sensitivities of about 5x1011 spinhz12 the manufacturing and handling of these new nmrdacs is relatively easy and straightforward which will allow for further applications in physics chemistry or biochemistry
|
[['the', 'past', '15', 'years', 'have', 'seen', 'an', 'astonishing', 'increase', 'in', 'nuclear', 'magnetic', 'resonance', 'nmr', 'sensitivity', 'and', 'accessible', 'pressure', 'range', 'in', 'highpressure', 'nmr', 'experiments', 'owing', 'to', 'a', 'series', 'of', 'new', 'developments', 'of', 'nmr', 'spectroscopy', 'applied', 'to', 'the', 'diamond', 'anvil', 'cell', 'dac', 'recently', 'with', 'the', 'application', 'of', 'electromagnetic', 'lenses', 'socalled', 'lenz', 'lenses', 'in', 'toroidal', 'diamond', 'indenter', 'cells', 'pressures', 'of', 'up', 'to', '72', 'gpa', 'with', 'nmr', 'spin', 'sensitivities', 'of', 'about', '1012', 'spinshz12', 'has', 'been', 'achieved', 'here', 'we', 'describe', 'the', 'implementation', 'of', 'a', 'refined', 'nmr', 'resonator', 'structure', 'using', 'a', 'pair', 'of', 'double', 'stage', 'lenz', 'lenses', 'driven', 'by', 'a', 'helmholtz', 'coil', 'within', 'a', 'standard', 'dac', 'allowing', 'to', 'measure', 'sample', 'volumes', 'as', 'small', 'as', '100', 'pl', 'prior', 'to', 'compression', 'with', 'this', 'setup', 'pressures', 'close', 'to', 'the', 'megabar', 'regime', '1', 'mbar', '100', 'gpa', 'could', 'be', 'realised', 'repeatedly', 'with', 'enhanced', 'spin', 'sensitivities', 'of', 'about', '5x1011', 'spinhz12', 'the', 'manufacturing', 'and', 'handling', 'of', 'these', 'new', 'nmrdacs', 'is', 'relatively', 'easy', 'and', 'straightforward', 'which', 'will', 'allow', 'for', 'further', 'applications', 'in', 'physics', 'chemistry', 'or', 'biochemistry']]
|
[-0.048501350688484476, 0.17084172960459007, -0.03567816680385116, -0.04048743854868431, -0.06888965586545942, -0.1369713253060461, 0.07822723551682613, 0.42205572595714397, -0.25512982409377144, -0.35428690012989555, 0.09640110203844009, -0.24138665022972808, -0.061539387085867474, 0.2401769036974805, -0.022939232317877218, 0.07098413442126797, 0.009589718722843758, -0.0013331010331452456, -0.09283802313320104, -0.2286098354786002, 0.19507059033479798, 0.10261319372685826, 0.27337576366621275, 0.06217900795844507, 0.09673085398005568, -0.0519980453921236, 0.07041203687494656, 0.02656656740608174, -0.1559007059132575, 0.10538762599213705, 0.30407095341298895, 0.031880994567518715, 0.22725610860400838, -0.43238015875267705, -0.21053936151269992, 0.04956299039306787, 0.12113461225973032, 0.11961045171318681, -0.09976833696849058, -0.25163029034405293, 0.0968663090306961, -0.1748919095097215, -0.15311096531028548, -0.1218040963640706, -0.010595835658938348, 0.008016928113739259, -0.24260377921874243, 0.08664667056492711, 0.020627906114015285, 0.1500048513248114, -0.07461320798340365, -0.14566701751073483, 0.08446095356682562, 0.012983562698611204, -0.01588487149063943, 0.08594479972976933, 0.23264077656357637, -0.0841541108572797, -0.1315132275739181, 0.3607700255892749, -0.027079411709107132, -0.051765216953771294, 0.18933696643912099, -0.21335493210035394, -0.08522071405284622, 0.18757963940829225, 0.14508941137589187, 0.07251612205825653, -0.15312973886718037, 0.04445755335029344, 0.046129362015917594, 0.21877926041565413, 0.15583846705040233, -0.00942028371570339, 0.20681101384385248, 0.21284870334326894, 0.0206651299351346, 0.13884637137192576, -0.1520639198360695, -0.018352085636612378, -0.20035891262257952, -0.16691880905122128, -0.13373157742972128, 0.09753930309799107, -0.06320579434377463, -0.12101507732211231, 0.3301249228757601, 0.10291493474945144, 0.15699610726778987, -0.06764067901677669, 0.2610812602702341, 0.026487043407107204, 0.14134499988205285, -0.021256276535209995, 0.2796558881589979, 0.2509749787815688, 0.15089030252218996, -0.21418026695613684, 0.0008548412489581782, -0.07432241904338435]
|
1,803.05473
|
SUSTain: Scalable Unsupervised Scoring for Tensors and its Application
to Phenotyping
|
This paper presents a new method, which we call SUSTain, that extends
real-valued matrix and tensor factorizations to data where values are integers.
Such data are common when the values correspond to event counts or ordinal
measures. The conventional approach is to treat integer data as real, and then
apply real-valued factorizations. However, doing so fails to preserve important
characteristics of the original data, thereby making it hard to interpret the
results. Instead, our approach extracts factor values from integer datasets as
scores that are constrained to take values from a small integer set. These
scores are easy to interpret: a score of zero indicates no feature contribution
and higher scores indicate distinct levels of feature importance.
At its core, SUSTain relies on: a) a problem partitioning into
integer-constrained subproblems, so that they can be optimally solved in an
efficient manner; and b) organizing the order of the subproblems' solution, to
promote reuse of shared intermediate results. We propose two variants,
SUSTain_M and SUSTain_T, to handle both matrix and tensor inputs, respectively.
We evaluate SUSTain against several state-of-the-art baselines on both
synthetic and real Electronic Health Record (EHR) datasets. Comparing to those
baselines, SUSTain shows either significantly better fit or orders of magnitude
speedups that achieve a comparable fit (up to 425X faster). We apply SUSTain to
EHR datasets to extract patient phenotypes (i.e., clinically meaningful patient
clusters). Furthermore, 87% of them were validated as clinically meaningful
phenotypes related to heart failure by a cardiologist.
|
cs.LG
|
this paper presents a new method which we call sustain that extends realvalued matrix and tensor factorizations to data where values are integers such data are common when the values correspond to event counts or ordinal measures the conventional approach is to treat integer data as real and then apply realvalued factorizations however doing so fails to preserve important characteristics of the original data thereby making it hard to interpret the results instead our approach extracts factor values from integer datasets as scores that are constrained to take values from a small integer set these scores are easy to interpret a score of zero indicates no feature contribution and higher scores indicate distinct levels of feature importance at its core sustain relies on a a problem partitioning into integerconstrained subproblems so that they can be optimally solved in an efficient manner and b organizing the order of the subproblems solution to promote reuse of shared intermediate results we propose two variants sustain_m and sustain_t to handle both matrix and tensor inputs respectively we evaluate sustain against several stateoftheart baselines on both synthetic and real electronic health record ehr datasets comparing to those baselines sustain shows either significantly better fit or orders of magnitude speedups that achieve a comparable fit up to 425x faster we apply sustain to ehr datasets to extract patient phenotypes ie clinically meaningful patient clusters furthermore 87 of them were validated as clinically meaningful phenotypes related to heart failure by a cardiologist
|
[['this', 'paper', 'presents', 'a', 'new', 'method', 'which', 'we', 'call', 'sustain', 'that', 'extends', 'realvalued', 'matrix', 'and', 'tensor', 'factorizations', 'to', 'data', 'where', 'values', 'are', 'integers', 'such', 'data', 'are', 'common', 'when', 'the', 'values', 'correspond', 'to', 'event', 'counts', 'or', 'ordinal', 'measures', 'the', 'conventional', 'approach', 'is', 'to', 'treat', 'integer', 'data', 'as', 'real', 'and', 'then', 'apply', 'realvalued', 'factorizations', 'however', 'doing', 'so', 'fails', 'to', 'preserve', 'important', 'characteristics', 'of', 'the', 'original', 'data', 'thereby', 'making', 'it', 'hard', 'to', 'interpret', 'the', 'results', 'instead', 'our', 'approach', 'extracts', 'factor', 'values', 'from', 'integer', 'datasets', 'as', 'scores', 'that', 'are', 'constrained', 'to', 'take', 'values', 'from', 'a', 'small', 'integer', 'set', 'these', 'scores', 'are', 'easy', 'to', 'interpret', 'a', 'score', 'of', 'zero', 'indicates', 'no', 'feature', 'contribution', 'and', 'higher', 'scores', 'indicate', 'distinct', 'levels', 'of', 'feature', 'importance', 'at', 'its', 'core', 'sustain', 'relies', 'on', 'a', 'a', 'problem', 'partitioning', 'into', 'integerconstrained', 'subproblems', 'so', 'that', 'they', 'can', 'be', 'optimally', 'solved', 'in', 'an', 'efficient', 'manner', 'and', 'b', 'organizing', 'the', 'order', 'of', 'the', 'subproblems', 'solution', 'to', 'promote', 'reuse', 'of', 'shared', 'intermediate', 'results', 'we', 'propose', 'two', 'variants', 'sustain_m', 'and', 'sustain_t', 'to', 'handle', 'both', 'matrix', 'and', 'tensor', 'inputs', 'respectively', 'we', 'evaluate', 'sustain', 'against', 'several', 'stateoftheart', 'baselines', 'on', 'both', 'synthetic', 'and', 'real', 'electronic', 'health', 'record', 'ehr', 'datasets', 'comparing', 'to', 'those', 'baselines', 'sustain', 'shows', 'either', 'significantly', 'better', 'fit', 'or', 'orders', 'of', 'magnitude', 'speedups', 'that', 'achieve', 'a', 'comparable', 'fit', 'up', 'to', '425x', 'faster', 'we', 'apply', 'sustain', 'to', 'ehr', 'datasets', 'to', 'extract', 'patient', 'phenotypes', 'ie', 'clinically', 'meaningful', 'patient', 'clusters', 'furthermore', '87', 'of', 'them', 'were', 'validated', 'as', 'clinically', 'meaningful', 'phenotypes', 'related', 'to', 'heart', 'failure', 'by', 'a', 'cardiologist']]
|
[-0.04695351463396195, 0.05033899282932922, -0.0666114314666599, 0.10198575702292868, -0.12471990852543607, -0.1670503304801758, 0.06191556160059211, 0.4117592792296089, -0.27454540415951784, -0.32465082776063114, 0.10509854267218559, -0.31078492412978614, -0.1339027853769227, 0.2019068812624328, -0.07859885761435413, 0.024180349419547692, 0.11307097185395412, 0.037290077785430246, -0.0528605226028041, -0.29412841823429237, 0.27372353372052466, 0.013736951289975569, 0.3192179491309293, 0.029565457687597753, 0.10722087953078045, -0.06373404883510195, -0.035119679767647106, 0.03820705958372675, -0.049234421753102324, 0.13104972114458427, 0.35389694818180084, 0.1849865640305783, 0.2929485649724822, -0.42692814919903244, -0.16344164746374754, 0.10147304526022212, 0.1271325403349166, 0.09341496291763028, 0.03632304764329648, -0.2644099312707443, 0.13845570059589396, -0.15563780293907692, -0.049839236058702704, -0.20291741375526615, 0.0025335003060003945, -0.02615165732866384, -0.3380427628501572, 0.08892671633049969, 0.003645096430728166, 0.037667504994752854, -0.08660029954794594, -0.1707553563808853, 0.007119760380996283, 0.1628625329507155, 0.0606115789783826, 0.042785252898562054, 0.13309971958255465, -0.09121647608547144, -0.14522232877596644, 0.3726282715066221, -0.02914026841205691, -0.20146259168439068, 0.20038190376290604, -0.08926167871710683, -0.11409968534407056, 0.1341844371179396, 0.20089763005491162, 0.0877318521980812, -0.12387187892797429, -0.02943955821034206, -0.01099698977835461, 0.20137912953611126, 0.06485013270746794, 0.00623483956533615, 0.1728947768911473, 0.1336697664884908, 0.05374151792027025, 0.13381608645070905, -0.06605860794625487, -0.07779452915799857, -0.19285931029407047, -0.1174681193410796, -0.1664963468345467, 0.021255087676989144, -0.09937025276682587, -0.1592502754911865, 0.3962949349752758, 0.22308019971790577, 0.2505683833603316, 0.10459948990595996, 0.3023099763134171, 0.05062366624956629, 0.129388798974947, 0.06401487859543259, 0.153751616194952, 0.05262789321189731, 0.04476435175877495, -0.16392972028798863, 0.09483682924365887, 0.017751189764619858]
|
1,803.05474
|
Two more proofs that the Kinoshita graph is knotted
|
The Kinoshita graph is a particular embedding in the 3-sphere of a graph with
three edges, two vertices and no loops. It has the remarkable property that
although the removal of any edge results in an unknotted loop, the Kinoshita
graph is itself knotted. We use two classical theorems from knot theory to give
two particularly simple proofs that the Kinoshita graph is knotted.
Apart from appealing to the two classical theorems, the exposition is
elementary and is aimed at those with only a passing familiarity with knot
theory.
|
math.GT
|
the kinoshita graph is a particular embedding in the 3sphere of a graph with three edges two vertices and no loops it has the remarkable property that although the removal of any edge results in an unknotted loop the kinoshita graph is itself knotted we use two classical theorems from knot theory to give two particularly simple proofs that the kinoshita graph is knotted apart from appealing to the two classical theorems the exposition is elementary and is aimed at those with only a passing familiarity with knot theory
|
[['the', 'kinoshita', 'graph', 'is', 'a', 'particular', 'embedding', 'in', 'the', '3sphere', 'of', 'a', 'graph', 'with', 'three', 'edges', 'two', 'vertices', 'and', 'no', 'loops', 'it', 'has', 'the', 'remarkable', 'property', 'that', 'although', 'the', 'removal', 'of', 'any', 'edge', 'results', 'in', 'an', 'unknotted', 'loop', 'the', 'kinoshita', 'graph', 'is', 'itself', 'knotted', 'we', 'use', 'two', 'classical', 'theorems', 'from', 'knot', 'theory', 'to', 'give', 'two', 'particularly', 'simple', 'proofs', 'that', 'the', 'kinoshita', 'graph', 'is', 'knotted', 'apart', 'from', 'appealing', 'to', 'the', 'two', 'classical', 'theorems', 'the', 'exposition', 'is', 'elementary', 'and', 'is', 'aimed', 'at', 'those', 'with', 'only', 'a', 'passing', 'familiarity', 'with', 'knot', 'theory']]
|
[-0.1578443066937734, 0.12380664301215373, -0.14906673235923387, 0.06903034627693967, -0.1458561499760057, -0.195733764726836, 0.007935516277244418, 0.376121293418528, -0.2496826573735459, -0.2945454917806253, 0.09824935495958068, -0.3344721545758291, -0.19792816968009483, 0.145928806007913, -0.10109819923108967, -0.025215668603777885, 0.10014212510307853, 0.11350484910222251, -0.010141996951941191, -0.20916626655386783, 0.2970326192561914, -0.041654842228136875, 0.17474617052488448, 0.0990878178717129, 0.07860497388402733, 0.014225366614298539, -0.026292620582526988, 0.06075696036052168, -0.13968041344114784, 0.13100096265120914, 0.2410855021568413, 0.10086434124707339, 0.19710860135598798, -0.44642711068723306, -0.17191378117716882, 0.12131709551041046, 0.10712314658180884, 0.08786947878203198, -0.026621450073598476, -0.2206916513988811, 0.11621330457666282, -0.09301719647110178, -0.10867228888477502, -0.0011106995143666026, 0.04089725923755865, -0.02975242618429527, -0.15652083205791673, -0.04524083560060584, 0.1465278109221646, 0.06069727903859836, 0.07607662906933031, -0.09916009108295266, -0.031489068215838474, 0.11565098666136017, 0.01619801906544422, 0.10498580916292882, 0.07704034597832668, -0.1531848305773534, -0.20560773130992868, 0.35996883405435287, -0.01455166738145472, -0.17616998714530904, 0.21726323792376043, -0.09375371155590656, -0.20998523026453644, 0.17275256856103963, 0.00014876130068402612, 0.09304690365208669, -0.12930717797468552, 0.12837653787508396, -0.11672888392729036, 0.1114974579763379, 0.0971246152341868, -0.01166125598986204, 0.15213305959373377, 0.09878067221241386, 0.07201081370474414, 0.18355059943140975, -0.005727342738026983, -0.11009142216127575, -0.3044013825213809, -0.17538683110419032, -0.2063974943953786, 0.0548941625198454, -0.1569914185952819, -0.19637634619819314, 0.42759882587562786, 0.07825573030833072, 0.1732092257065887, 0.0739777460694313, 0.30161194395525065, 0.05427138148440739, 0.05633252302414916, 0.11873913971246795, 0.19588285757312446, 0.19616132883585236, 0.0067790043697263415, -0.09301770678878332, -0.0036398766096681356, 0.18098381178432635]
|
1,803.05475
|
Breathers and the dynamics of solutions to the KdV type equations
|
In this paper our first aim is to identify a large class of non-linear
functions $\,f(\cdot)\,$ for which the IVP for the generalized Korteweg-de
Vries equation does not have breathers or "small" breathers solutions. Also we
prove that all small, uniformly in time $L^1\cap H^1$ bounded solutions to KdV
and related perturbations must converge to zero, as time goes to infinity,
locally in an increasing-in-time region of space of order $t^{1/2}$ around any
compact set in space. This set is included in the linearly dominated dispersive
region $x\ll t$. Moreover, we prove this result independently of the well-known
supercritical character of KdV scattering. In particular, no standing
breather-like nor solitary wave structures exists in this particular regime.
|
math.AP
|
in this paper our first aim is to identify a large class of nonlinear functions fcdot for which the ivp for the generalized kortewegde vries equation does not have breathers or small breathers solutions also we prove that all small uniformly in time l1cap h1 bounded solutions to kdv and related perturbations must converge to zero as time goes to infinity locally in an increasingintime region of space of order t12 around any compact set in space this set is included in the linearly dominated dispersive region xll t moreover we prove this result independently of the wellknown supercritical character of kdv scattering in particular no standing breatherlike nor solitary wave structures exists in this particular regime
|
[['in', 'this', 'paper', 'our', 'first', 'aim', 'is', 'to', 'identify', 'a', 'large', 'class', 'of', 'nonlinear', 'functions', 'fcdot', 'for', 'which', 'the', 'ivp', 'for', 'the', 'generalized', 'kortewegde', 'vries', 'equation', 'does', 'not', 'have', 'breathers', 'or', 'small', 'breathers', 'solutions', 'also', 'we', 'prove', 'that', 'all', 'small', 'uniformly', 'in', 'time', 'l1cap', 'h1', 'bounded', 'solutions', 'to', 'kdv', 'and', 'related', 'perturbations', 'must', 'converge', 'to', 'zero', 'as', 'time', 'goes', 'to', 'infinity', 'locally', 'in', 'an', 'increasingintime', 'region', 'of', 'space', 'of', 'order', 't12', 'around', 'any', 'compact', 'set', 'in', 'space', 'this', 'set', 'is', 'included', 'in', 'the', 'linearly', 'dominated', 'dispersive', 'region', 'xll', 't', 'moreover', 'we', 'prove', 'this', 'result', 'independently', 'of', 'the', 'wellknown', 'supercritical', 'character', 'of', 'kdv', 'scattering', 'in', 'particular', 'no', 'standing', 'breatherlike', 'nor', 'solitary', 'wave', 'structures', 'exists', 'in', 'this', 'particular', 'regime']]
|
[-0.1741845696233213, 0.1405963150450432, -0.055975631082125395, 0.07849315358004694, -0.0948686181439151, -0.1111441890283584, -0.023333056965353097, 0.31642186055602184, -0.3010421600353358, -0.1615321148560254, 0.13535671338643718, -0.2894035107937866, -0.13368547501058542, 0.16116669414974427, -0.03737503049768716, 0.06546861528226271, 0.04399765186525624, 0.049296550749768984, -0.019847440282444888, -0.23520578985937454, 0.3717681095766803, -0.03591983973205186, 0.21544770520292864, 0.027121386245888626, 0.08985340439138437, -0.0396626321980248, 0.041428002123399796, -0.009425719301236375, -0.17962544266735897, -0.004585624479785048, 0.2910316706084845, 0.04854169546963711, 0.30332686525673186, -0.4113994663067419, -0.22380427238210265, 0.18831627626887298, 0.22705232496132496, 0.13498519637906956, -0.016554533287176286, -0.2896645202959791, 0.12387004980399947, -0.10741620291433908, -0.2366829834605471, -0.06370991226365982, 0.06993402684797886, 0.07902195130410636, -0.2414387561629751, 0.10653510000652047, 0.10365230583682142, -0.06724434989857776, -0.134203132462752, -0.04236976889861298, -0.04832695236485773, 0.04283079791790003, 0.07133376109012371, 0.06216305025034295, -0.0045893136612621364, -0.08688204186960477, -0.03255153707893975, 0.36193582084800663, -0.12199337123431554, -0.24750527310795312, 0.1899063020767965, -0.20698567873653795, -0.13351135238089823, 0.15634363194815173, 0.17551447256018632, 0.1728581245908321, -0.09247906033174488, 0.14253258060890747, -0.07413814625698283, 0.2113367656149484, 0.1592565170842512, 0.028939036518969605, 0.09038476917314632, 0.12925142226821004, 0.1452681055826392, 0.12030411332219454, -0.018284892691459893, -0.08165815597849674, -0.3638922482887524, -0.10568101729009428, -0.16412267574522613, 0.06154780460427242, -0.07875858161762529, -0.22067568290593295, 0.3445476805871545, 0.08975434863883681, 0.18461294452948818, 0.10258333002927648, 0.1849410524421195, 0.17705223000842218, 0.014935372662248796, 0.13125524122733623, 0.21025947284692065, 0.10493966850355782, 0.14561930480653998, -0.19619695926566832, -0.02051877651508127, 0.11177104424546244]
|
1,803.05476
|
On the role of the Kerr-Newman black hole in the GeV emission of long
gamma-ray bursts
|
X-ray Flashes (XRFs), binary-driven hypernovae (BdHNe) are long GRB
subclasses with progenitor a CO$_{\rm core}$, undergoing a supernova (SN)
explosion and hypercritically accreting in a tight binary system onto a
companion neutron star (NS) or black hole (BH). In XRFs the NS does not reach
by accretion the critical mass and no BH is formed. In BdHNe I, with shorter
binary periods, the NS gravitationally collapses and leads to a new born BH. In
BdHNe II the accretion on an already formed BH leads to a more massive BH. We
assume that the GeV emission observed by \textit{Fermi}-LAT originates from the
rotational energy of the BH. Consequently, we verify that, as expected, in XRFs
no GeV emission is observed. In $16$ BdHNe I and $5$ BdHNe II, within the
boresight angle of LAT, the integrated GeV emission allows to estimate the
initial mass and spin of the BH. In the remaining $27$ sources in the plane of
the binary system no GeV emission occurs, hampered by the presence of the HN
ejecta. From the ratio, $21/48$, we infer a new asymmetric morphology for the
BdHNe reminiscent of the one observed in active galactic nuclei (AGN): the GeV
emission occurs within a cone of half-opening angle $\approx 60^{\circ}$ from
the normal to the orbital plane of the binary progenitor. The transparency
condition requires a Lorentz factor $\Gamma \sim 1500$ on the source of GeV
emission. The GeV luminosity in the rest-frame of the source follows a
universal power-law with index of $-1.20 \pm 0.04$, allowing to estimate the
spin-down rate of the BH
|
astro-ph.HE
|
xray flashes xrfs binarydriven hypernovae bdhne are long grb subclasses with progenitor a co_rm core undergoing a supernova sn explosion and hypercritically accreting in a tight binary system onto a companion neutron star ns or black hole bh in xrfs the ns does not reach by accretion the critical mass and no bh is formed in bdhne i with shorter binary periods the ns gravitationally collapses and leads to a new born bh in bdhne ii the accretion on an already formed bh leads to a more massive bh we assume that the gev emission observed by textitfermilat originates from the rotational energy of the bh consequently we verify that as expected in xrfs no gev emission is observed in 16 bdhne i and 5 bdhne ii within the boresight angle of lat the integrated gev emission allows to estimate the initial mass and spin of the bh in the remaining 27 sources in the plane of the binary system no gev emission occurs hampered by the presence of the hn ejecta from the ratio 2148 we infer a new asymmetric morphology for the bdhne reminiscent of the one observed in active galactic nuclei agn the gev emission occurs within a cone of halfopening angle approx 60circ from the normal to the orbital plane of the binary progenitor the transparency condition requires a lorentz factor gamma sim 1500 on the source of gev emission the gev luminosity in the restframe of the source follows a universal powerlaw with index of 120 pm 004 allowing to estimate the spindown rate of the bh
|
[['xray', 'flashes', 'xrfs', 'binarydriven', 'hypernovae', 'bdhne', 'are', 'long', 'grb', 'subclasses', 'with', 'progenitor', 'a', 'co_rm', 'core', 'undergoing', 'a', 'supernova', 'sn', 'explosion', 'and', 'hypercritically', 'accreting', 'in', 'a', 'tight', 'binary', 'system', 'onto', 'a', 'companion', 'neutron', 'star', 'ns', 'or', 'black', 'hole', 'bh', 'in', 'xrfs', 'the', 'ns', 'does', 'not', 'reach', 'by', 'accretion', 'the', 'critical', 'mass', 'and', 'no', 'bh', 'is', 'formed', 'in', 'bdhne', 'i', 'with', 'shorter', 'binary', 'periods', 'the', 'ns', 'gravitationally', 'collapses', 'and', 'leads', 'to', 'a', 'new', 'born', 'bh', 'in', 'bdhne', 'ii', 'the', 'accretion', 'on', 'an', 'already', 'formed', 'bh', 'leads', 'to', 'a', 'more', 'massive', 'bh', 'we', 'assume', 'that', 'the', 'gev', 'emission', 'observed', 'by', 'textitfermilat', 'originates', 'from', 'the', 'rotational', 'energy', 'of', 'the', 'bh', 'consequently', 'we', 'verify', 'that', 'as', 'expected', 'in', 'xrfs', 'no', 'gev', 'emission', 'is', 'observed', 'in', '16', 'bdhne', 'i', 'and', '5', 'bdhne', 'ii', 'within', 'the', 'boresight', 'angle', 'of', 'lat', 'the', 'integrated', 'gev', 'emission', 'allows', 'to', 'estimate', 'the', 'initial', 'mass', 'and', 'spin', 'of', 'the', 'bh', 'in', 'the', 'remaining', '27', 'sources', 'in', 'the', 'plane', 'of', 'the', 'binary', 'system', 'no', 'gev', 'emission', 'occurs', 'hampered', 'by', 'the', 'presence', 'of', 'the', 'hn', 'ejecta', 'from', 'the', 'ratio', '2148', 'we', 'infer', 'a', 'new', 'asymmetric', 'morphology', 'for', 'the', 'bdhne', 'reminiscent', 'of', 'the', 'one', 'observed', 'in', 'active', 'galactic', 'nuclei', 'agn', 'the', 'gev', 'emission', 'occurs', 'within', 'a', 'cone', 'of', 'halfopening', 'angle', 'approx', '60circ', 'from', 'the', 'normal', 'to', 'the', 'orbital', 'plane', 'of', 'the', 'binary', 'progenitor', 'the', 'transparency', 'condition', 'requires', 'a', 'lorentz', 'factor', 'gamma', 'sim', '1500', 'on', 'the', 'source', 'of', 'gev', 'emission', 'the', 'gev', 'luminosity', 'in', 'the', 'restframe', 'of', 'the', 'source', 'follows', 'a', 'universal', 'powerlaw', 'with', 'index', 'of', '120', 'pm', '004', 'allowing', 'to', 'estimate', 'the', 'spindown', 'rate', 'of', 'the', 'bh']]
|
[-0.09941902262617217, 0.16842393997136257, -0.014731859608100178, 0.1711069484218113, -0.09473208488514683, -0.11038851391317116, 0.08004302709627455, 0.4054515898955622, -0.1599356055338207, -0.3242609438211416, 0.03694795789928586, -0.30168805639963137, 0.06343837797158251, 0.22680900736455004, -0.02286348683345649, -0.053883794081393786, 0.0776372040743258, -0.030104852778840653, -0.125677848276254, -0.17460266155702814, 0.29394420642598434, 0.09031700633775792, 0.12363051925462464, -0.0063803770376005394, 0.08267309680647775, -0.05342074159454283, 0.011266922259746098, -0.08936486296601936, -0.14800831413221452, 0.021512364153304205, 0.17719688635548958, 0.14342541445766008, 0.16425054186555446, -0.3287651924366467, -0.18908226607417353, 0.10407787130813746, 0.1658641253241206, -0.000722536469285173, -0.07495553391902855, -0.25752682318746817, 0.06444889692753782, -0.27991148438732855, -0.16768614720852895, 0.16157416753395965, 0.07372260305645137, 0.023547520675478766, -0.21072939031541532, 0.1723428796865296, 0.07951862121159675, -0.020949667721087563, -0.09722296066044284, -0.03897735363066953, -0.07753901054611666, -0.018706170558818826, 0.09893539859431572, 0.08560095401079362, 0.15437466600676553, -0.10443291668619575, -0.0722803980164708, 0.4045578263257541, -0.024031646116154975, 0.026867736565391622, 0.1875126546701966, -0.23851657941066784, -0.1349449574383568, 0.23455097737019145, 0.14829801348411795, 0.11934609606619424, -0.1501792248778252, 0.0012428088635973403, -0.008775142838168618, 0.25302443335516783, 0.05642692647496117, 0.03547313961395445, 0.35275328319548305, 0.13545134201355036, -0.01202023078212907, 0.10127253159059932, -0.247956495444822, -0.025634891560508147, -0.2632543220366726, -0.07525925901076146, -0.13254189900777363, 0.18869840287184386, -0.15252681137962487, -0.10353232099084983, 0.33438736431022315, 0.043810027566295956, 0.24670782376266304, 0.012120009198342361, 0.21947817259643876, 0.09947906904613021, 0.08566098258441664, 0.1674723482897712, 0.3775141504860815, 0.17937096594154864, 0.11251672087067745, -0.24254138815801918, 0.06191297938692173, 0.024419095392617256]
|
1,803.05477
|
Higher-order condensate corrections to $\Upsilon$ masses, leptonic decay
rates and sum rules
|
With the recent completion of NNNLO results, the perturbative description of
the $\Upsilon$ system has reached a very high level of sophistication. We
consider the non-perturbative corrections as an expansion in terms of local
condensates, following the approach pioneered by Voloshin and Leutwyler. The
leading order corrections up to dimension eight and the potential NLO
corrections at dimension four are computed and given in analytical form. We
then study the convergence of the expansion for the masses, the leptonic decay
rates and the non-relativistic moments of the $\Upsilon$ system. We demonstrate
that the condensate corrections to the $\Upsilon(1S)$ mass exhibit a region
with good convergence, which allows us to extract
$\overline{m}_b(\overline{m}_b) =
4214\pm37\,(\text{pert.})\,_{-22}^{+20}\,(\text{non-pert.})\text{ MeV}$, and
show that non-perturbative contributions to the moments with $n\approx10$ are
negligible.
|
hep-ph
|
with the recent completion of nnnlo results the perturbative description of the upsilon system has reached a very high level of sophistication we consider the nonperturbative corrections as an expansion in terms of local condensates following the approach pioneered by voloshin and leutwyler the leading order corrections up to dimension eight and the potential nlo corrections at dimension four are computed and given in analytical form we then study the convergence of the expansion for the masses the leptonic decay rates and the nonrelativistic moments of the upsilon system we demonstrate that the condensate corrections to the upsilon1s mass exhibit a region with good convergence which allows us to extract overlinem_boverlinem_b 4214pm37textpert_2220textnonperttext mev and show that nonperturbative contributions to the moments with napprox10 are negligible
|
[['with', 'the', 'recent', 'completion', 'of', 'nnnlo', 'results', 'the', 'perturbative', 'description', 'of', 'the', 'upsilon', 'system', 'has', 'reached', 'a', 'very', 'high', 'level', 'of', 'sophistication', 'we', 'consider', 'the', 'nonperturbative', 'corrections', 'as', 'an', 'expansion', 'in', 'terms', 'of', 'local', 'condensates', 'following', 'the', 'approach', 'pioneered', 'by', 'voloshin', 'and', 'leutwyler', 'the', 'leading', 'order', 'corrections', 'up', 'to', 'dimension', 'eight', 'and', 'the', 'potential', 'nlo', 'corrections', 'at', 'dimension', 'four', 'are', 'computed', 'and', 'given', 'in', 'analytical', 'form', 'we', 'then', 'study', 'the', 'convergence', 'of', 'the', 'expansion', 'for', 'the', 'masses', 'the', 'leptonic', 'decay', 'rates', 'and', 'the', 'nonrelativistic', 'moments', 'of', 'the', 'upsilon', 'system', 'we', 'demonstrate', 'that', 'the', 'condensate', 'corrections', 'to', 'the', 'upsilon1s', 'mass', 'exhibit', 'a', 'region', 'with', 'good', 'convergence', 'which', 'allows', 'us', 'to', 'extract', 'overlinem_boverlinem_b', '4214pm37textpert_2220textnonperttext', 'mev', 'and', 'show', 'that', 'nonperturbative', 'contributions', 'to', 'the', 'moments', 'with', 'napprox10', 'are', 'negligible']]
|
[-0.07491919832799825, 0.11516855912897529, -0.10221175276749436, 0.08167188029150449, 0.013532193318232818, -0.06180266437361077, 0.02775582948309039, 0.30846080319174835, -0.1839948961146987, -0.27401440122705556, 0.03460433651813336, -0.31879192350571695, -0.0319166791197213, 0.1468344363834589, 0.04301400127564369, 0.07689695880417863, 0.055607413987614096, 0.03865142553038294, -0.10216659940652467, -0.25401568992040874, 0.32367497211652657, 0.05112506691817074, 0.21607824932453373, 0.1440394440508117, 0.0631187958267307, -0.04638971192311616, -0.019237862744639934, -0.007770522253497714, -0.16314203744707723, 0.11165049069771363, 0.17839260099666013, 0.03405666758396452, 0.20461457904668584, -0.3603419734976224, -0.11975725289366598, 0.0692911478690803, 0.1567891270988771, 0.14730372114178364, -0.014101433817432412, -0.2813462602263767, 0.09535912424889242, -0.23390758431877098, -0.16901427013574227, -0.1766326735096593, 0.006231442979168928, -0.022466186991697477, -0.32339782174066417, 0.07082894704710212, -0.0013660127071723823, -0.014343600307080534, -0.028767218791237552, -0.14278710859024055, -0.005884977031288849, 0.12842360942346615, 0.09995236533464893, 0.06347581178946007, 0.09566585733855684, -0.17351562890032637, -0.14483470922606367, 0.406787941179749, -0.10640018618376475, -0.12884075061282924, 0.15145765849944925, -0.22037150637216626, -0.13074882052868844, 0.16779177336983622, 0.18615250112376205, 0.1015576553432883, -0.1353599242039866, 0.11313585176709064, 0.03913958161889065, 0.13811622867398266, 0.0739615041567313, 0.07040546022378089, 0.15144388956363283, 0.12374793572141038, -0.022077289323562815, 0.09667270403212658, -0.06680019257304769, -0.09920761870941328, -0.36352017225562444, -0.10619778503032942, -0.11270301606536152, 0.0613508929457185, -0.11073187141500379, -0.1387845282142441, 0.3821742817845887, 0.1452048829598953, 0.2362666630877122, 0.08349677760082658, 0.29635692248120904, 0.16696108026606513, 0.06747713347431272, 0.0840144508863652, 0.29719062161917287, 0.1659982593269125, 0.08030463912479219, -0.28528409168469687, -0.005108120275713924, 0.11063165415544063]
|
1,803.05478
|
Schur complement solver for Quantum Monte-Carlo simulations of strongly
interacting fermions
|
We present a non-iterative solver based on the Schur complement method for
sparse linear systems of special form which appear in Quantum Monte-Carlo (QMC)
simulations of strongly interacting fermions on the lattice. While the number
of floating-point operations for this solver scales as the cube of the number
of lattice sites, for practically relevant lattice sizes it is still
significantly faster than iterative solvers such as the Conjugate Gradient
method in the regime of strong inter-fermion interactions, for example, in the
vicinity of quantum phase transitions. The speed-up is even more dramatic for
the solution of multiple linear systems with different right-hand sides. We
present benchmark results for QMC simulations of the tight-binding models on
the hexagonal graphene lattice with on-site (Hubbard) and non-local (Coulomb)
interactions, and demonstrate the potential for further speed-up using GPU.
|
cond-mat.str-el hep-lat math.NA
|
we present a noniterative solver based on the schur complement method for sparse linear systems of special form which appear in quantum montecarlo qmc simulations of strongly interacting fermions on the lattice while the number of floatingpoint operations for this solver scales as the cube of the number of lattice sites for practically relevant lattice sizes it is still significantly faster than iterative solvers such as the conjugate gradient method in the regime of strong interfermion interactions for example in the vicinity of quantum phase transitions the speedup is even more dramatic for the solution of multiple linear systems with different righthand sides we present benchmark results for qmc simulations of the tightbinding models on the hexagonal graphene lattice with onsite hubbard and nonlocal coulomb interactions and demonstrate the potential for further speedup using gpu
|
[['we', 'present', 'a', 'noniterative', 'solver', 'based', 'on', 'the', 'schur', 'complement', 'method', 'for', 'sparse', 'linear', 'systems', 'of', 'special', 'form', 'which', 'appear', 'in', 'quantum', 'montecarlo', 'qmc', 'simulations', 'of', 'strongly', 'interacting', 'fermions', 'on', 'the', 'lattice', 'while', 'the', 'number', 'of', 'floatingpoint', 'operations', 'for', 'this', 'solver', 'scales', 'as', 'the', 'cube', 'of', 'the', 'number', 'of', 'lattice', 'sites', 'for', 'practically', 'relevant', 'lattice', 'sizes', 'it', 'is', 'still', 'significantly', 'faster', 'than', 'iterative', 'solvers', 'such', 'as', 'the', 'conjugate', 'gradient', 'method', 'in', 'the', 'regime', 'of', 'strong', 'interfermion', 'interactions', 'for', 'example', 'in', 'the', 'vicinity', 'of', 'quantum', 'phase', 'transitions', 'the', 'speedup', 'is', 'even', 'more', 'dramatic', 'for', 'the', 'solution', 'of', 'multiple', 'linear', 'systems', 'with', 'different', 'righthand', 'sides', 'we', 'present', 'benchmark', 'results', 'for', 'qmc', 'simulations', 'of', 'the', 'tightbinding', 'models', 'on', 'the', 'hexagonal', 'graphene', 'lattice', 'with', 'onsite', 'hubbard', 'and', 'nonlocal', 'coulomb', 'interactions', 'and', 'demonstrate', 'the', 'potential', 'for', 'further', 'speedup', 'using', 'gpu']]
|
[-0.14443114336010895, 0.0771695572020555, -0.03513625092994146, 0.0337425957787437, -0.01961759980078097, -0.17301095389519577, 0.058400070439610215, 0.3939425952180668, -0.261514349806088, -0.2817379362881184, 0.08605415012290771, -0.2870905537382458, -0.14758793718560978, 0.24176641023993767, 0.07434342034781972, 0.09095916644566589, 0.11096219824523562, -0.01654996906441671, -0.11889231917448342, -0.2956088758918836, 0.2616485285676188, 0.04615376489409418, 0.23397508413634366, 0.059112619614245854, 0.04691109219910922, 0.024972677789628507, 0.06097448511152632, 0.023931193510415377, -0.06893432137763335, 0.08307476207146128, 0.2028173232514948, -0.001511186206092437, 0.2523698815730987, -0.4772496292988459, -0.18761587820567743, 0.04829955915403035, 0.1660848830309179, 0.1498181180416227, -0.0696651668646761, -0.24782933978087923, 0.03140591789312937, -0.15671570691176587, -0.08697951900669271, -0.12447540014637289, -0.030590701310171022, 0.04326520403459047, -0.2907600361853838, 0.09711654375272769, 0.02148136485505987, 0.07322009847740885, -0.01708840609493631, -0.16933545460579572, 0.02004270971649223, 0.04435796630568802, -0.013480696715931925, 0.031140138974620236, 0.09272982001615067, -0.15320310099912737, -0.14668291224235738, 0.45093927945493273, -0.045580985513192396, -0.20537622485447812, 0.21007898861231902, -0.11554612043762097, -0.13188382857306688, 0.1256260916692015, 0.18083140202625483, 0.12614208095948454, -0.08708431120677333, 0.10681440463306865, -0.055478924399034846, 0.1720156467485207, 0.00966496236829294, 0.03899133966338855, 0.16988964309157045, 0.19412957159457384, 0.09891142336030802, 0.15380462262675995, -0.06306483977198325, -0.1827967064248191, -0.2531854665014651, -0.14227343839248296, -0.23646576597734734, 0.005165210518020171, -0.147472676534542, -0.22568874233229844, 0.3703198595155738, 0.19259944308411192, 0.1312558762298, 0.06307678406419992, 0.28773606582372274, 0.1137717326844318, 0.10040653283897512, 0.05843396165787622, 0.19199063485505544, 0.10890002063544536, 0.056207438811866774, -0.2867859828044419, -0.02155306843687194, 0.11688564254177941]
|
1,803.05479
|
Development of effective stochastic potential method using random matrix
theory for efficient conformational sampling of semiconductor nanoparticles
at non-zero temperatures
|
In this work, the development and implementation of the effective stochastic
potential (ESP) method is presented to perform efficient conformational
sampling of molecules. The overarching goal of this work is to alleviate the
computational bottleneck associated with performing a large number of
electronic structure calculations required for conformational sampling. We
introduce the concept of a deformation potential and demonstrate its existence
by the proof-by-construction approach. A statistical description of the
fluctuations in the deformation potential due to non-zero temperature was
obtained using infinite-order moment expansion of the distribution. The formal
mathematical definition of the ESP was derived using functional minimization
approach to match the infinite-order moment expansion for the deformation
potential. Practical implementation of the ESP was obtained using the
random-matrix theory method. The developed method was applied to two
proof-of-concept calculations of the distribution of HOMO-LUMO gap in the water
molecule and solvated CdSe clusters at 300K. The need for large sample size to
obtain statistically meaningful results was demonstrated by performing $10^5 $
ESP calculations. The results from these prototype calculations demonstrated
the efficacy of the ESP method for performing efficient conformational
sampling. We envision that the fundamental nature of this work will not only
extend our knowledge of chemical systems at non-zero temperatures but will also
generate new insights for innovative technological applications.
|
physics.chem-ph
|
in this work the development and implementation of the effective stochastic potential esp method is presented to perform efficient conformational sampling of molecules the overarching goal of this work is to alleviate the computational bottleneck associated with performing a large number of electronic structure calculations required for conformational sampling we introduce the concept of a deformation potential and demonstrate its existence by the proofbyconstruction approach a statistical description of the fluctuations in the deformation potential due to nonzero temperature was obtained using infiniteorder moment expansion of the distribution the formal mathematical definition of the esp was derived using functional minimization approach to match the infiniteorder moment expansion for the deformation potential practical implementation of the esp was obtained using the randommatrix theory method the developed method was applied to two proofofconcept calculations of the distribution of homolumo gap in the water molecule and solvated cdse clusters at 300k the need for large sample size to obtain statistically meaningful results was demonstrated by performing 105 esp calculations the results from these prototype calculations demonstrated the efficacy of the esp method for performing efficient conformational sampling we envision that the fundamental nature of this work will not only extend our knowledge of chemical systems at nonzero temperatures but will also generate new insights for innovative technological applications
|
[['in', 'this', 'work', 'the', 'development', 'and', 'implementation', 'of', 'the', 'effective', 'stochastic', 'potential', 'esp', 'method', 'is', 'presented', 'to', 'perform', 'efficient', 'conformational', 'sampling', 'of', 'molecules', 'the', 'overarching', 'goal', 'of', 'this', 'work', 'is', 'to', 'alleviate', 'the', 'computational', 'bottleneck', 'associated', 'with', 'performing', 'a', 'large', 'number', 'of', 'electronic', 'structure', 'calculations', 'required', 'for', 'conformational', 'sampling', 'we', 'introduce', 'the', 'concept', 'of', 'a', 'deformation', 'potential', 'and', 'demonstrate', 'its', 'existence', 'by', 'the', 'proofbyconstruction', 'approach', 'a', 'statistical', 'description', 'of', 'the', 'fluctuations', 'in', 'the', 'deformation', 'potential', 'due', 'to', 'nonzero', 'temperature', 'was', 'obtained', 'using', 'infiniteorder', 'moment', 'expansion', 'of', 'the', 'distribution', 'the', 'formal', 'mathematical', 'definition', 'of', 'the', 'esp', 'was', 'derived', 'using', 'functional', 'minimization', 'approach', 'to', 'match', 'the', 'infiniteorder', 'moment', 'expansion', 'for', 'the', 'deformation', 'potential', 'practical', 'implementation', 'of', 'the', 'esp', 'was', 'obtained', 'using', 'the', 'randommatrix', 'theory', 'method', 'the', 'developed', 'method', 'was', 'applied', 'to', 'two', 'proofofconcept', 'calculations', 'of', 'the', 'distribution', 'of', 'homolumo', 'gap', 'in', 'the', 'water', 'molecule', 'and', 'solvated', 'cdse', 'clusters', 'at', '300k', 'the', 'need', 'for', 'large', 'sample', 'size', 'to', 'obtain', 'statistically', 'meaningful', 'results', 'was', 'demonstrated', 'by', 'performing', '105', 'esp', 'calculations', 'the', 'results', 'from', 'these', 'prototype', 'calculations', 'demonstrated', 'the', 'efficacy', 'of', 'the', 'esp', 'method', 'for', 'performing', 'efficient', 'conformational', 'sampling', 'we', 'envision', 'that', 'the', 'fundamental', 'nature', 'of', 'this', 'work', 'will', 'not', 'only', 'extend', 'our', 'knowledge', 'of', 'chemical', 'systems', 'at', 'nonzero', 'temperatures', 'but', 'will', 'also', 'generate', 'new', 'insights', 'for', 'innovative', 'technological', 'applications']]
|
[-0.08431250681756848, 0.07361826351811135, -0.10896198460658159, 0.044064688802561855, -0.040733757488664556, -0.08000325237696763, 0.07241503619719471, 0.37089839731299573, -0.24220164786049417, -0.3458204935087222, 0.05655798974020459, -0.22946417995589288, -0.17220870968472282, 0.1843852151368057, -0.02538718550822863, 0.07186595062376, 0.08309849859411159, -0.011776573499327387, -0.07237837420043179, -0.21493598902554503, 0.26034577896548694, 0.10752166403353075, 0.3076766141109325, 0.08243820419704768, 0.07933888536721259, -0.020186623588865884, -0.03076019194564634, 0.01121525973555954, -0.15451045086619986, 0.18060345188894084, 0.25046905286927823, 0.10268000560316527, 0.2907279902823252, -0.41520206679390265, -0.21037052102630663, 0.050373822862987416, 0.10006586808010079, 0.16638529168389668, -0.08781987291788758, -0.2477261463243288, 0.08950784888170729, -0.17897897383424444, -0.16372967366603525, -0.16745965061850723, -0.01789104164508389, 0.005480152598057795, -0.2535537855156206, 0.06380912168392103, 0.0113166366414402, 0.06131700270852209, -0.07845098627720325, -0.14860374354727449, 0.012002970332445177, 0.11632154842133625, 0.021965318149995826, 0.023738675600648903, 0.16103988904375408, -0.07836353517040637, -0.09660941533413585, 0.3795575463108579, -0.0468083813037967, -0.14967465233144778, 0.17000364347537283, -0.11968368528167082, -0.1502182749535227, 0.16950864330038568, 0.13239919658637145, 0.1103356413273402, -0.1747349206274963, 0.07853003561624029, 0.043769651331947504, 0.16107213668412068, 0.03359416289315951, -0.015651617893322468, 0.1702659443656209, 0.21487310709797333, 0.029114175074359525, 0.15126264206716947, -0.10643195969277827, -0.1172232840767252, -0.2772545834620283, -0.15571573431708058, -0.2468675084419714, 0.021756594121593777, -0.05933404787397067, -0.16461498105559044, 0.39167129103242304, 0.1986387411619876, 0.14533489010792888, 0.043606451080424415, 0.30614467542270357, 0.08415037464779132, 0.06433030749262075, 0.011722663431602451, 0.21676979775792946, 0.13727285161779793, 0.09171994471765846, -0.26350644859376526, 0.07069862139722437, 0.047889177688554135]
|
1,803.0548
|
Electronically Mediated Magnetic Anisotropy in Vibrating Magnetic
Molecules
|
We address the electronically induced anisotropy field acting on a spin
moment comprised in a vibrating magnetic molecule located in the junction
between ferromagnetic metals. Under weak coupling between the electrons and
molecular vibrations, the nature of the anisotropy can be changed from favoring
a high spin (easy axis) magnetic moment to a low spin (easy plane) by applying
a temperature difference or a voltage bias across the junction. For unequal
spin-polarizations in the ferromagnetic metals it is shown that the character
of the anisotropy is essentially determined by the properties of the weaker
ferromagnet. By increasing the temperature in this metal, or introducing a
voltage bias, its influence can be suppressed such that the dominant
contribution to the anisotropy is interchanged to the stronger ferromagnet.
With increasing coupling strength between the molecular vibrations and the
electrons, the nature of the anisotropy is locked into favoring easy plane
magnetism.
|
cond-mat.mes-hall
|
we address the electronically induced anisotropy field acting on a spin moment comprised in a vibrating magnetic molecule located in the junction between ferromagnetic metals under weak coupling between the electrons and molecular vibrations the nature of the anisotropy can be changed from favoring a high spin easy axis magnetic moment to a low spin easy plane by applying a temperature difference or a voltage bias across the junction for unequal spinpolarizations in the ferromagnetic metals it is shown that the character of the anisotropy is essentially determined by the properties of the weaker ferromagnet by increasing the temperature in this metal or introducing a voltage bias its influence can be suppressed such that the dominant contribution to the anisotropy is interchanged to the stronger ferromagnet with increasing coupling strength between the molecular vibrations and the electrons the nature of the anisotropy is locked into favoring easy plane magnetism
|
[['we', 'address', 'the', 'electronically', 'induced', 'anisotropy', 'field', 'acting', 'on', 'a', 'spin', 'moment', 'comprised', 'in', 'a', 'vibrating', 'magnetic', 'molecule', 'located', 'in', 'the', 'junction', 'between', 'ferromagnetic', 'metals', 'under', 'weak', 'coupling', 'between', 'the', 'electrons', 'and', 'molecular', 'vibrations', 'the', 'nature', 'of', 'the', 'anisotropy', 'can', 'be', 'changed', 'from', 'favoring', 'a', 'high', 'spin', 'easy', 'axis', 'magnetic', 'moment', 'to', 'a', 'low', 'spin', 'easy', 'plane', 'by', 'applying', 'a', 'temperature', 'difference', 'or', 'a', 'voltage', 'bias', 'across', 'the', 'junction', 'for', 'unequal', 'spinpolarizations', 'in', 'the', 'ferromagnetic', 'metals', 'it', 'is', 'shown', 'that', 'the', 'character', 'of', 'the', 'anisotropy', 'is', 'essentially', 'determined', 'by', 'the', 'properties', 'of', 'the', 'weaker', 'ferromagnet', 'by', 'increasing', 'the', 'temperature', 'in', 'this', 'metal', 'or', 'introducing', 'a', 'voltage', 'bias', 'its', 'influence', 'can', 'be', 'suppressed', 'such', 'that', 'the', 'dominant', 'contribution', 'to', 'the', 'anisotropy', 'is', 'interchanged', 'to', 'the', 'stronger', 'ferromagnet', 'with', 'increasing', 'coupling', 'strength', 'between', 'the', 'molecular', 'vibrations', 'and', 'the', 'electrons', 'the', 'nature', 'of', 'the', 'anisotropy', 'is', 'locked', 'into', 'favoring', 'easy', 'plane', 'magnetism']]
|
[-0.22514655901628527, 0.23585475176641554, -0.013393265535842452, 0.045860496370728136, -0.08418135395767355, -0.11640838770064582, 0.06478701327417996, 0.39192279550753184, -0.30632676790474644, -0.3060500332460607, -0.015781784855179337, -0.27675066930523157, -0.042262313915604116, 0.1847663140643213, 0.08821532852485175, -0.10100461001040714, -0.04468827310210444, -0.0366691007066343, -0.08486683554822366, -0.15895070334358904, 0.2763217612163433, 0.03545141721381837, 0.33047217467718526, 0.09704302939947307, 0.06707846250653816, 0.012617999294010186, 0.14971477606477554, 0.0651219329302943, -0.08561218905955281, 0.050468498364328436, 0.19510480422751617, -0.12573768387879902, 0.19403175156463512, -0.4400157151281234, -0.1418578075120013, 0.05498658676925522, 0.12191849762117553, 0.14867387371975305, -0.07083807035023894, -0.28037493549062303, 0.040573724201761634, -0.11748475971125416, -0.14636042806313643, -0.03245460455487138, 0.0056157181384791964, 0.029225024594706578, -0.26679992828293136, 0.11045708090391936, 0.12308949763392842, 0.09759474560718408, -0.04479380780534081, -0.09510765182113763, -0.1149553577196878, 0.08054629091412492, 0.09799733142768527, 0.12304964728790942, 0.19007726560890575, -0.10722058806287112, -0.041363660274261, 0.35386351365971086, -0.07659355898531492, -0.16895261269133857, 0.17140343291809995, -0.18630393751703153, -0.04436607871067104, 0.152133611459035, 0.11053379582578704, 0.05293403694956195, -0.1306526474045252, 0.08173703061726925, 0.05426807082789456, 0.18758105155355578, 0.03872141087015203, -0.0006750410753958578, 0.30727902188547107, 0.15930503452409234, 0.0661903923008616, 0.1895223700491424, -0.11330388123075784, -0.03660512783708388, -0.18673805012398917, -0.13228723067390238, -0.2472303888038576, 0.08391130356283721, -0.07726307155469889, -0.1684929371392276, 0.40817514201938704, 0.16675005507211657, 0.18450276069823596, -0.10012857209529334, 0.3118653718457126, 0.11110278298951773, 0.09084930801576616, 0.03422138934213049, 0.2815248904837258, 0.22715768429150668, 0.09770104427659422, -0.3176229662221275, 0.1343921682884879, -0.027921592472933684]
|
1,803.05481
|
As a matter of force - Systematic biases in idealized turbulence
simulations
|
Many astrophysical systems encompass very large dynamical ranges in space and
time, which are not accessible by direct numerical simulations. Thus, idealized
subvolumes are often used to study small-scale effects including the dynamics
of turbulence. These turbulent boxes require an artificial driving in order to
mimic energy injection from large-scale processes. In this Letter, we show and
quantify how the autocorrelation time of the driving and its normalization
systematically change properties of an isothermal compressible
magnetohydrodynamic flow in the sub- and supersonic regime and affect
astrophysical observations such as Faraday rotation. For example, we find that
$\delta$-in-time forcing with a constant energy injection leads to a steeper
slope in kinetic energy spectrum and less efficient small-scale dynamo action.
In general, we show that shorter autocorrelation times require more power in
the acceleration field, which results in more power in compressive modes that
weaken the anticorrelation between density and magnetic field strength. Thus,
derived observables, such as the line-of-sight magnetic field from rotation
measures, are systematically biased by the driving mechanism. We argue that
$\delta$-in-time forcing is unrealistic and numerically unresolved, and
conclude that special care needs to be taken in interpreting observational
results based on the use of idealized simulations.
|
physics.flu-dyn astro-ph.GA astro-ph.SR physics.plasm-ph
|
many astrophysical systems encompass very large dynamical ranges in space and time which are not accessible by direct numerical simulations thus idealized subvolumes are often used to study smallscale effects including the dynamics of turbulence these turbulent boxes require an artificial driving in order to mimic energy injection from largescale processes in this letter we show and quantify how the autocorrelation time of the driving and its normalization systematically change properties of an isothermal compressible magnetohydrodynamic flow in the sub and supersonic regime and affect astrophysical observations such as faraday rotation for example we find that deltaintime forcing with a constant energy injection leads to a steeper slope in kinetic energy spectrum and less efficient smallscale dynamo action in general we show that shorter autocorrelation times require more power in the acceleration field which results in more power in compressive modes that weaken the anticorrelation between density and magnetic field strength thus derived observables such as the lineofsight magnetic field from rotation measures are systematically biased by the driving mechanism we argue that deltaintime forcing is unrealistic and numerically unresolved and conclude that special care needs to be taken in interpreting observational results based on the use of idealized simulations
|
[['many', 'astrophysical', 'systems', 'encompass', 'very', 'large', 'dynamical', 'ranges', 'in', 'space', 'and', 'time', 'which', 'are', 'not', 'accessible', 'by', 'direct', 'numerical', 'simulations', 'thus', 'idealized', 'subvolumes', 'are', 'often', 'used', 'to', 'study', 'smallscale', 'effects', 'including', 'the', 'dynamics', 'of', 'turbulence', 'these', 'turbulent', 'boxes', 'require', 'an', 'artificial', 'driving', 'in', 'order', 'to', 'mimic', 'energy', 'injection', 'from', 'largescale', 'processes', 'in', 'this', 'letter', 'we', 'show', 'and', 'quantify', 'how', 'the', 'autocorrelation', 'time', 'of', 'the', 'driving', 'and', 'its', 'normalization', 'systematically', 'change', 'properties', 'of', 'an', 'isothermal', 'compressible', 'magnetohydrodynamic', 'flow', 'in', 'the', 'sub', 'and', 'supersonic', 'regime', 'and', 'affect', 'astrophysical', 'observations', 'such', 'as', 'faraday', 'rotation', 'for', 'example', 'we', 'find', 'that', 'deltaintime', 'forcing', 'with', 'a', 'constant', 'energy', 'injection', 'leads', 'to', 'a', 'steeper', 'slope', 'in', 'kinetic', 'energy', 'spectrum', 'and', 'less', 'efficient', 'smallscale', 'dynamo', 'action', 'in', 'general', 'we', 'show', 'that', 'shorter', 'autocorrelation', 'times', 'require', 'more', 'power', 'in', 'the', 'acceleration', 'field', 'which', 'results', 'in', 'more', 'power', 'in', 'compressive', 'modes', 'that', 'weaken', 'the', 'anticorrelation', 'between', 'density', 'and', 'magnetic', 'field', 'strength', 'thus', 'derived', 'observables', 'such', 'as', 'the', 'lineofsight', 'magnetic', 'field', 'from', 'rotation', 'measures', 'are', 'systematically', 'biased', 'by', 'the', 'driving', 'mechanism', 'we', 'argue', 'that', 'deltaintime', 'forcing', 'is', 'unrealistic', 'and', 'numerically', 'unresolved', 'and', 'conclude', 'that', 'special', 'care', 'needs', 'to', 'be', 'taken', 'in', 'interpreting', 'observational', 'results', 'based', 'on', 'the', 'use', 'of', 'idealized', 'simulations']]
|
[-0.1263716515292404, 0.1755060800035176, -0.07197430996327764, 0.11450972780820472, -0.055515099189836874, -0.07741596131183376, -0.01934869841124505, 0.38823686429120674, -0.26486543284239944, -0.3398295711123883, 0.08869750093847438, -0.1968004742888334, -0.11395992600444864, 0.26018707290987925, -0.000285355837526496, 0.027742228569225362, 0.038891018869242434, -0.03542713232978125, -0.01656775329040947, -0.1579890540110728, 0.3147865040815727, 0.11126657344654879, 0.25822160098463004, 0.0013821175702050273, 0.038549603428691626, -0.06927258900314984, -0.055391719799977965, 0.075530110077428, -0.15097900964246946, 0.010234301213664239, 0.21195705372115803, 0.06945992404657451, 0.25333435516428165, -0.4882194186758363, -0.26825209532045957, 0.08378865866395033, 0.16011298657159764, 0.10281136201934493, -0.06509961928267413, -0.22818646189460362, 0.05928834596404223, -0.16635873621433145, -0.10432948429146875, -0.0970910052543111, 0.0387566347313678, 0.052783852765592984, -0.2928609163335741, 0.13604699594210928, 0.05178147231888924, 0.08148452378056868, -0.08914526326598299, -0.054929007681420616, -0.02727688238085859, 0.10668386159596419, 0.09428484078068662, 0.018204264224017736, 0.17248861538246274, -0.16464794315327186, -0.06243590657150072, 0.396709258395313, -0.07557741989677941, -0.19548880007832942, 0.20876487616844702, -0.18040873245877034, -0.1388419999510539, 0.13709767579337384, 0.19067357333301746, 0.07592174649765396, -0.09115374334523398, 0.020649784647640914, -0.013283237863115666, 0.18305647225975238, 0.03248979283656662, 0.02829189151155085, 0.22831844858533581, 0.11592759167942492, 0.06099942324164493, 0.09785319463705004, -0.13151014199000644, -0.09493610161742327, -0.260384399575567, -0.09746957420503174, -0.14433644813099744, 0.0981022571849271, -0.09058449016697294, -0.13311961981717196, 0.35825564439944696, 0.23898893681524153, 0.18282237885087127, 0.034193097670783636, 0.33847526570010666, 0.13086887843309516, 0.048185029072978655, 0.10871894801866894, 0.2869440965340332, 0.128009083419756, 0.11726733133187424, -0.2368891018235849, 0.03603815893416829, -0.014450761883500775]
|
1,803.05482
|
Targeted change detection in remote sensing images
|
Recent developments in the remote sensing systems and image processing made
it possible to propose a new method of the object classification and detection
of the specific changes in the series of satellite Earth images (so called
targeted change detection). In this paper we propose a formal problem statement
that allows to use effectively the deep learning approach to analyze
time-dependent series of remote sensing images. We also introduce a new
framework for the development of deep learning models for targeted change
detection and demonstrate some cases of business applications it can be used
for.
|
cs.CV cs.CE eess.IV
|
recent developments in the remote sensing systems and image processing made it possible to propose a new method of the object classification and detection of the specific changes in the series of satellite earth images so called targeted change detection in this paper we propose a formal problem statement that allows to use effectively the deep learning approach to analyze timedependent series of remote sensing images we also introduce a new framework for the development of deep learning models for targeted change detection and demonstrate some cases of business applications it can be used for
|
[['recent', 'developments', 'in', 'the', 'remote', 'sensing', 'systems', 'and', 'image', 'processing', 'made', 'it', 'possible', 'to', 'propose', 'a', 'new', 'method', 'of', 'the', 'object', 'classification', 'and', 'detection', 'of', 'the', 'specific', 'changes', 'in', 'the', 'series', 'of', 'satellite', 'earth', 'images', 'so', 'called', 'targeted', 'change', 'detection', 'in', 'this', 'paper', 'we', 'propose', 'a', 'formal', 'problem', 'statement', 'that', 'allows', 'to', 'use', 'effectively', 'the', 'deep', 'learning', 'approach', 'to', 'analyze', 'timedependent', 'series', 'of', 'remote', 'sensing', 'images', 'we', 'also', 'introduce', 'a', 'new', 'framework', 'for', 'the', 'development', 'of', 'deep', 'learning', 'models', 'for', 'targeted', 'change', 'detection', 'and', 'demonstrate', 'some', 'cases', 'of', 'business', 'applications', 'it', 'can', 'be', 'used', 'for']]
|
[-0.06856632010128937, -0.0017625677742456134, -0.07830880307837536, 0.030974588239271388, -0.10501176540396716, -0.1467088862126203, 0.04125151818887772, 0.4120763140289407, -0.3028933644686875, -0.33887402658399784, 0.12572632134083267, -0.22412006251382224, -0.23637839961600932, 0.20584021842009143, -0.15151550401688407, 0.09405255847071346, 0.10107905272590487, 0.033687984149314856, -0.07474381372540895, -0.24704687337293044, 0.27521805331895227, 0.0393210608653087, 0.3281923957561192, 0.03723749239978037, 0.10615850652715093, 0.0379234506013362, -0.06048298564886576, -0.024360391381062645, -0.08124792790568838, 0.221802340951016, 0.3198550238242253, 0.23501041711945284, 0.31682049947251617, -0.4262698409588713, -0.26320864334702493, 0.10059135610874938, 0.15285274694232565, 0.12331513981334866, -0.10641863158854999, -0.32674104189010045, 0.06205208782890909, -0.21342052223258898, -0.04963631454708153, -0.1527458648148336, 0.01855555783810192, -0.042572831347780796, -0.26046889050814664, 0.014958175930721488, 0.03501262309912004, 0.06031313875543052, -0.06845285170037593, -0.036763313505798575, 0.11016481028453104, 0.16978103734160724, 0.014505690022518761, 0.010110679984484849, 0.1598900462549768, -0.17112002517096697, -0.1252375900353256, 0.37579096696878733, -0.06440697437838504, -0.14614507513807007, 0.21446036522668835, -0.06206731310261315, -0.2312446167790576, 0.06749368618781629, 0.2573907783549083, 0.17406118113155428, -0.1645932549218598, 0.013609930552468685, -0.0007295521858491395, 0.12846145957316224, 0.02527080051797001, -0.0024721168912947176, 0.2253962805690734, 0.21602979796497446, 0.07355177945972077, 0.16594514655022832, -0.18483946565538645, -0.002994997828193989, -0.23201630379465457, -0.18304496515591287, -0.16021115304412026, -0.024630066115213067, -0.02412047980209249, -0.15442603718685477, 0.4069695611337298, 0.2655581427470009, 0.1892360614490156, 0.030602659875723092, 0.3406792846949477, 0.06280931101033563, 0.09799367153134785, 0.03134897419888722, 0.21788447932248298, 0.050512649591914136, 0.15968838735042434, -0.14774814410821388, 0.048736039285646064, 0.01785828919198952]
|
1,803.05483
|
Inter- and intra-layer excitons in MoS$_2$/WS$_2$ and MoSe$_2$/WSe$_2$
heterobilayers
|
Accurately described excitonic properties of transition metal dichalcogenide
heterobilayers (HBLs) are crucial to comprehend the optical response and the
charge carrier dynamics of them. Excitons in multilayer systems posses inter or
intralayer character whose spectral positions depend on their binding energy
and the band alignment of the constituent single-layers. In this study, we
report the electronic structure and the absorption spectra of MoS$_2$/WS$_2$
and MoSe$_2$/WSe$_2$ HBLs from first-principles calculations. We explore the
spectral positions, binding energies and the origins of inter and intralayer
excitons and compare our results with experimental observations. The absorption
spectra of the systems are obtained by solving the Bethe-Salpeter equation on
top of a G$_0$W$_0$ calculation which corrects the independent particle
eigenvalues obtained from density functional theory calculations. Our
calculations reveal that the lowest energy exciton in both HBLs possesses
interlayer character which is decisive regarding their possible device
applications. Due to the spatially separated nature of the charge carriers, the
binding energy of inter-layer excitons might be expected to be considerably
smaller than that of intra-layer ones. However, according to our calculations
the binding energy of lowest energy interlayer excitons is only $\sim$ 20\%
lower due to the weaker screening of the Coulomb interaction between layers of
the HBLs. Therefore, it can be deduced that the spectral positions of the
interlayer excitons with respect to intralayer ones are mostly determined by
the band offset of the constituent single-layers. By comparing oscillator
strengths and thermal occupation factors, we show that in luminescence at low
temperature, the interlayer exciton peak becomes dominant, while in absorption
it is almost invisible.
|
cond-mat.mtrl-sci
|
accurately described excitonic properties of transition metal dichalcogenide heterobilayers hbls are crucial to comprehend the optical response and the charge carrier dynamics of them excitons in multilayer systems posses inter or intralayer character whose spectral positions depend on their binding energy and the band alignment of the constituent singlelayers in this study we report the electronic structure and the absorption spectra of mos_2ws_2 and mose_2wse_2 hbls from firstprinciples calculations we explore the spectral positions binding energies and the origins of inter and intralayer excitons and compare our results with experimental observations the absorption spectra of the systems are obtained by solving the bethesalpeter equation on top of a g_0w_0 calculation which corrects the independent particle eigenvalues obtained from density functional theory calculations our calculations reveal that the lowest energy exciton in both hbls possesses interlayer character which is decisive regarding their possible device applications due to the spatially separated nature of the charge carriers the binding energy of interlayer excitons might be expected to be considerably smaller than that of intralayer ones however according to our calculations the binding energy of lowest energy interlayer excitons is only sim 20 lower due to the weaker screening of the coulomb interaction between layers of the hbls therefore it can be deduced that the spectral positions of the interlayer excitons with respect to intralayer ones are mostly determined by the band offset of the constituent singlelayers by comparing oscillator strengths and thermal occupation factors we show that in luminescence at low temperature the interlayer exciton peak becomes dominant while in absorption it is almost invisible
|
[['accurately', 'described', 'excitonic', 'properties', 'of', 'transition', 'metal', 'dichalcogenide', 'heterobilayers', 'hbls', 'are', 'crucial', 'to', 'comprehend', 'the', 'optical', 'response', 'and', 'the', 'charge', 'carrier', 'dynamics', 'of', 'them', 'excitons', 'in', 'multilayer', 'systems', 'posses', 'inter', 'or', 'intralayer', 'character', 'whose', 'spectral', 'positions', 'depend', 'on', 'their', 'binding', 'energy', 'and', 'the', 'band', 'alignment', 'of', 'the', 'constituent', 'singlelayers', 'in', 'this', 'study', 'we', 'report', 'the', 'electronic', 'structure', 'and', 'the', 'absorption', 'spectra', 'of', 'mos_2ws_2', 'and', 'mose_2wse_2', 'hbls', 'from', 'firstprinciples', 'calculations', 'we', 'explore', 'the', 'spectral', 'positions', 'binding', 'energies', 'and', 'the', 'origins', 'of', 'inter', 'and', 'intralayer', 'excitons', 'and', 'compare', 'our', 'results', 'with', 'experimental', 'observations', 'the', 'absorption', 'spectra', 'of', 'the', 'systems', 'are', 'obtained', 'by', 'solving', 'the', 'bethesalpeter', 'equation', 'on', 'top', 'of', 'a', 'g_0w_0', 'calculation', 'which', 'corrects', 'the', 'independent', 'particle', 'eigenvalues', 'obtained', 'from', 'density', 'functional', 'theory', 'calculations', 'our', 'calculations', 'reveal', 'that', 'the', 'lowest', 'energy', 'exciton', 'in', 'both', 'hbls', 'possesses', 'interlayer', 'character', 'which', 'is', 'decisive', 'regarding', 'their', 'possible', 'device', 'applications', 'due', 'to', 'the', 'spatially', 'separated', 'nature', 'of', 'the', 'charge', 'carriers', 'the', 'binding', 'energy', 'of', 'interlayer', 'excitons', 'might', 'be', 'expected', 'to', 'be', 'considerably', 'smaller', 'than', 'that', 'of', 'intralayer', 'ones', 'however', 'according', 'to', 'our', 'calculations', 'the', 'binding', 'energy', 'of', 'lowest', 'energy', 'interlayer', 'excitons', 'is', 'only', 'sim', '20', 'lower', 'due', 'to', 'the', 'weaker', 'screening', 'of', 'the', 'coulomb', 'interaction', 'between', 'layers', 'of', 'the', 'hbls', 'therefore', 'it', 'can', 'be', 'deduced', 'that', 'the', 'spectral', 'positions', 'of', 'the', 'interlayer', 'excitons', 'with', 'respect', 'to', 'intralayer', 'ones', 'are', 'mostly', 'determined', 'by', 'the', 'band', 'offset', 'of', 'the', 'constituent', 'singlelayers', 'by', 'comparing', 'oscillator', 'strengths', 'and', 'thermal', 'occupation', 'factors', 'we', 'show', 'that', 'in', 'luminescence', 'at', 'low', 'temperature', 'the', 'interlayer', 'exciton', 'peak', 'becomes', 'dominant', 'while', 'in', 'absorption', 'it', 'is', 'almost', 'invisible']]
|
[-0.11065207656209876, 0.16169686075757642, -0.03657903980804991, 0.08499718987016817, -0.010509258075723893, -0.13727283045358046, 0.08490218561878499, 0.43672132091454535, -0.24272870643327424, -0.3282627865046935, -0.059132397838224805, -0.32474322313307746, -0.10999127501845786, 0.14493054909167727, 0.09190178125606181, -0.039541873359299116, 0.03980849650892863, -0.06016873806281342, -0.06359637706502312, -0.16903767226768088, 0.3059201082992296, 0.09213343391173612, 0.2896707792231415, 0.1462113886337571, 0.0027045203863380065, 0.010513618397384256, 0.047230461599902455, -0.015657468575644103, -0.1454782934495264, 0.13920637640483563, 0.2360372054606111, -0.09273847550550189, 0.2121960789432664, -0.4114794588153684, -0.1900148610015691, 0.019673747274463017, 0.1554558799608312, 0.13899802185509724, -0.005449840719882712, -0.2890850596151222, 0.06086049761751112, -0.13198154101162465, -0.07821886950058735, -0.08136984919204966, 0.0061818044472713276, 0.06542362289646292, -0.19402568007220394, 0.14034948873472264, 0.0039184294807198565, 0.01839482828960061, -0.16225867338286612, -0.16989986258821085, -0.1178879694353775, 0.09523819468449801, 0.058888029282688666, -0.012965310091252317, 0.18688586135288232, -0.1370390127670688, -0.0844400598563588, 0.4152670682386588, -0.0521432264339297, -0.09641755818629741, 0.18684325569828275, -0.15943490022985365, -0.04764665685459005, 0.19325160987511675, 0.09138095418865728, 0.10604743792440828, -0.11326459289429787, 0.05750528144493423, 0.03045854649143489, 0.20849232999732334, 0.0585492501150415, 0.15562968484689446, 0.2104613101678609, 0.13707374431990899, 0.010453807796575556, 0.07739997654397908, -0.11456453282741975, -0.06699031843374598, -0.20251761231827373, -0.12627562574281548, -0.2489821054165799, 0.07408067349607537, -0.06807316816012013, -0.16091798394225282, 0.44493139101308327, 0.1300062760106423, 0.20281833885610814, -0.0018638654706203414, 0.24982824948090235, 0.1588825863060015, 0.10350129331856653, 0.03557461772810753, 0.312338944025096, 0.17362764691631843, 0.08672150726455001, -0.2898773770958882, 0.06809411370479822, 0.00498257863658786]
|
1,803.05484
|
Removing Skill Bias from Gaming Statistics
|
"The chance to win given a certain move" is an easily obtainable quantity
from data and often quoted in gaming statistics. It is also the fundamental
quantity that reinforcement learning AI bases on. Unfortunately, this
conditional probability can be misleading. Unless all players are equally
skilled, this number does not tell us the intrinsic value of such move. That is
because conditioning on one good move also inevitably selects a subset of
better players. They tend to make other good moves, which also contribute to
the extra winning chance. We present a simple toy model to quantify this "skill
bias" effect, and then propose a general method to remove it. Our method is
modular, generalizable, and also only requires easily obtainable quantities
from data. In particular, it gets the same answer independent of whether the
data comes from a group of good or bad players. This may help us to eventually
break free from the conventional wisdom of "learning from the experts" and
avoid the Group Thinking pitfall.
|
physics.soc-ph stat.AP stat.ME
|
the chance to win given a certain move is an easily obtainable quantity from data and often quoted in gaming statistics it is also the fundamental quantity that reinforcement learning ai bases on unfortunately this conditional probability can be misleading unless all players are equally skilled this number does not tell us the intrinsic value of such move that is because conditioning on one good move also inevitably selects a subset of better players they tend to make other good moves which also contribute to the extra winning chance we present a simple toy model to quantify this skill bias effect and then propose a general method to remove it our method is modular generalizable and also only requires easily obtainable quantities from data in particular it gets the same answer independent of whether the data comes from a group of good or bad players this may help us to eventually break free from the conventional wisdom of learning from the experts and avoid the group thinking pitfall
|
[['the', 'chance', 'to', 'win', 'given', 'a', 'certain', 'move', 'is', 'an', 'easily', 'obtainable', 'quantity', 'from', 'data', 'and', 'often', 'quoted', 'in', 'gaming', 'statistics', 'it', 'is', 'also', 'the', 'fundamental', 'quantity', 'that', 'reinforcement', 'learning', 'ai', 'bases', 'on', 'unfortunately', 'this', 'conditional', 'probability', 'can', 'be', 'misleading', 'unless', 'all', 'players', 'are', 'equally', 'skilled', 'this', 'number', 'does', 'not', 'tell', 'us', 'the', 'intrinsic', 'value', 'of', 'such', 'move', 'that', 'is', 'because', 'conditioning', 'on', 'one', 'good', 'move', 'also', 'inevitably', 'selects', 'a', 'subset', 'of', 'better', 'players', 'they', 'tend', 'to', 'make', 'other', 'good', 'moves', 'which', 'also', 'contribute', 'to', 'the', 'extra', 'winning', 'chance', 'we', 'present', 'a', 'simple', 'toy', 'model', 'to', 'quantify', 'this', 'skill', 'bias', 'effect', 'and', 'then', 'propose', 'a', 'general', 'method', 'to', 'remove', 'it', 'our', 'method', 'is', 'modular', 'generalizable', 'and', 'also', 'only', 'requires', 'easily', 'obtainable', 'quantities', 'from', 'data', 'in', 'particular', 'it', 'gets', 'the', 'same', 'answer', 'independent', 'of', 'whether', 'the', 'data', 'comes', 'from', 'a', 'group', 'of', 'good', 'or', 'bad', 'players', 'this', 'may', 'help', 'us', 'to', 'eventually', 'break', 'free', 'from', 'the', 'conventional', 'wisdom', 'of', 'learning', 'from', 'the', 'experts', 'and', 'avoid', 'the', 'group', 'thinking', 'pitfall']]
|
[-0.0236510054895743, 0.09157096101825161, -0.15211291878118313, 0.12192464281716162, -0.17759695029096856, -0.20701533944867107, 0.12221652647851788, 0.37502852825647487, -0.2967363430264716, -0.3386751703765185, 0.06703314818913073, -0.2879912416129151, -0.12950893524698803, 0.16802270546863188, -0.17070202777228718, -0.017348431741646936, 0.08934087732008525, 0.0914783281179899, -0.0017416455042881093, -0.29795489185822327, 0.2920714306223783, 0.05389488182984115, 0.28435895630225005, 0.009286462363975477, 0.07014900189893697, -0.017081493567231865, -0.00895303469761053, 0.04051805576489728, -0.0732614847231508, 0.11327410539213036, 0.2802792675793171, 0.18772735322684075, 0.3424188179917456, -0.4167532821108277, -0.14457627873967535, 0.17608333078013466, 0.13789451721822843, 0.14292899525788103, -0.004138299583462954, -0.2654165422954109, 0.052193101129259525, -0.180250244587937, -0.09888039174118257, -0.10508885392863747, -0.031228753646636114, -0.03319603944865299, -0.2946183849576517, 0.023468426491793554, 0.051438012334983796, 0.01403175261969279, 0.014314470704578395, -0.10485456037055146, -0.002225267075811557, 0.20113642883093452, 0.0669360201665194, 0.061951295320232885, 0.13902253569436393, -0.1401026046784994, -0.08848389690475804, 0.3927004052370432, 0.00972711484480117, -0.2205426213941315, 0.21172543335705996, -0.14149921071449562, -0.14501245371675828, 0.12571069708376723, 0.14306949657024925, 0.08470095770012233, -0.13107013356749944, 0.01476205759016531, -0.06359525324244585, 0.2087786430936484, 0.04498736089070527, -0.011443616840032129, 0.22040946921818735, 0.09991942235640072, 0.11339816118457488, 0.06558854984350979, 0.005566514677151905, -0.0968914814570564, -0.2787092685556716, -0.14133064281694324, -0.17398077629331965, 0.07403265945261712, -0.062349412717421296, -0.15653054329561114, 0.34413165623776704, 0.24742129549919073, 0.19523496803317575, 0.05545385596633423, 0.31134517974264564, 0.08393149953571126, 0.0912446099710429, 0.06610095206858768, 0.22207746358167024, 0.009858081918320664, 0.06000770191063306, -0.14699799379117653, 0.12181560132081531, -0.0049975138924007]
|
1,803.05485
|
Evidence for associated production of a Higgs boson with a top quark
pair in final states with electrons, muons, and hadronically decaying $\tau$
leptons at $\sqrt{s} =$ 13 TeV
|
Results of a search for the standard model Higgs boson produced in
association with a top quark pair ($\mathrm{t\overline{t}}$H) in final states
with electrons, muons, and hadronically decaying $\tau$ leptons are presented.
The analyzed data set corresponds to an integrated luminosity of 35.9 fb$^{-1}$
recorded in proton-proton collisions at $\sqrt{s} =$ 13 TeV by the CMS
experiment in 2016. The sensitivity of the search is improved by using matrix
element and machine learning methods to separate the signal from backgrounds.
The measured signal rate amounts to 1.23 $^{+0.45}_{-0.43}$ times the
production rate expected in the standard model, with an observed (expected)
significance of 3.2$\sigma$ (2.8$\sigma$), which represents evidence for
$\mathrm{t\overline{t}}$H production in those final states. An upper limit on
the signal rate of 2.1 times the standard model production rate is set at 95%
confidence level.
|
hep-ex
|
results of a search for the standard model higgs boson produced in association with a top quark pair mathrmtoverlineth in final states with electrons muons and hadronically decaying tau leptons are presented the analyzed data set corresponds to an integrated luminosity of 359 fb1 recorded in protonproton collisions at sqrts 13 tev by the cms experiment in 2016 the sensitivity of the search is improved by using matrix element and machine learning methods to separate the signal from backgrounds the measured signal rate amounts to 123 045_043 times the production rate expected in the standard model with an observed expected significance of 32sigma 28sigma which represents evidence for mathrmtoverlineth production in those final states an upper limit on the signal rate of 21 times the standard model production rate is set at 95 confidence level
|
[['results', 'of', 'a', 'search', 'for', 'the', 'standard', 'model', 'higgs', 'boson', 'produced', 'in', 'association', 'with', 'a', 'top', 'quark', 'pair', 'mathrmtoverlineth', 'in', 'final', 'states', 'with', 'electrons', 'muons', 'and', 'hadronically', 'decaying', 'tau', 'leptons', 'are', 'presented', 'the', 'analyzed', 'data', 'set', 'corresponds', 'to', 'an', 'integrated', 'luminosity', 'of', '359', 'fb1', 'recorded', 'in', 'protonproton', 'collisions', 'at', 'sqrts', '13', 'tev', 'by', 'the', 'cms', 'experiment', 'in', '2016', 'the', 'sensitivity', 'of', 'the', 'search', 'is', 'improved', 'by', 'using', 'matrix', 'element', 'and', 'machine', 'learning', 'methods', 'to', 'separate', 'the', 'signal', 'from', 'backgrounds', 'the', 'measured', 'signal', 'rate', 'amounts', 'to', '123', '045_043', 'times', 'the', 'production', 'rate', 'expected', 'in', 'the', 'standard', 'model', 'with', 'an', 'observed', 'expected', 'significance', 'of', '32sigma', '28sigma', 'which', 'represents', 'evidence', 'for', 'mathrmtoverlineth', 'production', 'in', 'those', 'final', 'states', 'an', 'upper', 'limit', 'on', 'the', 'signal', 'rate', 'of', '21', 'times', 'the', 'standard', 'model', 'production', 'rate', 'is', 'set', 'at', '95', 'confidence', 'level']]
|
[-0.02628244727384299, 0.16928343170740792, -0.04483387409014377, 0.1301685991269578, 0.03087509031157329, -0.1056927929027701, 0.06649346061662506, 0.31097442317587226, -0.19446059608651298, -0.35994116433743223, 0.03052268850915968, -0.38632259766724125, 0.0934169485803638, 0.17597423736944295, 0.0648396061073099, 0.10386811292325425, 0.15972272647238933, 0.047203371530648935, -0.01226547420191676, -0.2546575692058332, 0.21344870851555867, 0.13443131234719238, 0.2876100746372631, 0.02917359645631331, 0.08127650687272953, -0.003933571991441187, -0.07096255337167878, -0.11495510436969796, -0.061132012258297695, 0.0807194552002492, 0.22619786159719216, 0.12692597518160717, 0.13152865722163845, -0.33640518375853107, -0.06650643481928577, 0.18206077291101996, 0.11989284766952632, 0.04676831598956583, -0.0883129379519178, -0.3521904443779877, 0.1419404469857882, -0.20614784677971654, -0.08171076171878558, 0.06940125644471107, 0.028421442093911457, -0.0997761464469246, -0.35792198303197303, 0.1439931784763432, -0.05289572963635298, 0.07609083711273044, -0.022010977842163906, -0.19716121617065213, -0.07490097464117874, -0.030832847663715704, 0.08595612269231993, 0.10678935448709466, 0.175124759292369, -0.1671386775291358, -0.2559955738304155, 0.32227008553472025, -0.12378636967050217, -0.15133798051514288, 0.2291976503138222, -0.17200463659255139, -0.09316561017324453, 0.20575147853302422, 0.293454020395319, 0.02866480577695392, -0.24820722006400353, 0.09213885303444243, 0.008549826685339212, 0.23284070698523532, 0.04040123779090372, 0.027490857423894774, 0.21367373475075158, 0.2424864770015771, -0.011593229206862734, 0.07608956601053699, -0.17136074097152912, -0.03899631496699555, -0.40146372261554447, -0.11711641493142207, -0.0918233805655766, 0.043510209941895986, -0.06770498640448681, -0.039347538191985006, 0.37635674504146205, 0.11399107322499935, 0.30071574467609624, 0.024546026075849617, 0.2560636617378818, 0.1562513044634365, 0.04562487576414011, 0.08073507847286997, 0.3299976044661129, 0.1179832902410304, 0.12098234913263248, -0.16274686269427358, 0.022290546575616767, 0.06276354887314252]
|
1,803.05486
|
Quantum Entanglement In Inhomogeneous 1D Systems
|
The entanglement entropy of the ground state of a quantum lattice model with
local interactions usually satisfies an area law. However, in 1D systems some
violations may appear in inhomogeneous systems or in random systems. In our
inhomogeneous system, the inhomogeneity parameter, $h$, allows us to tune
different regimes where a volumetric violation of the area law appears. We
apply the strong disorder renormalization group to describe the maximally
entangled state of the system in a strong inhomogeneity regime. Moreover, in a
weak inhomogeneity regime, we use a continuum approximation to describe the
state as a thermo-field double in a conformal field theory with an effective
temperature which is proportional to the inhomogeneity parameter of the system.
The latter description also shows that the universal scaling features of this
model are captured by a massless Dirac fermion in a curved space-time with
constant negative curvature $R=-h^2$, providing another example of the relation
between quantum entanglement and space-time geometry. The results we discuss
here were already published before, but here we present a more didactic
exposure of basic concepts of the rainbow system for the students attending the
Latin American School of Physics Marcos Moshinsky 2017.
|
quant-ph cond-mat.str-el
|
the entanglement entropy of the ground state of a quantum lattice model with local interactions usually satisfies an area law however in 1d systems some violations may appear in inhomogeneous systems or in random systems in our inhomogeneous system the inhomogeneity parameter h allows us to tune different regimes where a volumetric violation of the area law appears we apply the strong disorder renormalization group to describe the maximally entangled state of the system in a strong inhomogeneity regime moreover in a weak inhomogeneity regime we use a continuum approximation to describe the state as a thermofield double in a conformal field theory with an effective temperature which is proportional to the inhomogeneity parameter of the system the latter description also shows that the universal scaling features of this model are captured by a massless dirac fermion in a curved spacetime with constant negative curvature rh2 providing another example of the relation between quantum entanglement and spacetime geometry the results we discuss here were already published before but here we present a more didactic exposure of basic concepts of the rainbow system for the students attending the latin american school of physics marcos moshinsky 2017
|
[['the', 'entanglement', 'entropy', 'of', 'the', 'ground', 'state', 'of', 'a', 'quantum', 'lattice', 'model', 'with', 'local', 'interactions', 'usually', 'satisfies', 'an', 'area', 'law', 'however', 'in', '1d', 'systems', 'some', 'violations', 'may', 'appear', 'in', 'inhomogeneous', 'systems', 'or', 'in', 'random', 'systems', 'in', 'our', 'inhomogeneous', 'system', 'the', 'inhomogeneity', 'parameter', 'h', 'allows', 'us', 'to', 'tune', 'different', 'regimes', 'where', 'a', 'volumetric', 'violation', 'of', 'the', 'area', 'law', 'appears', 'we', 'apply', 'the', 'strong', 'disorder', 'renormalization', 'group', 'to', 'describe', 'the', 'maximally', 'entangled', 'state', 'of', 'the', 'system', 'in', 'a', 'strong', 'inhomogeneity', 'regime', 'moreover', 'in', 'a', 'weak', 'inhomogeneity', 'regime', 'we', 'use', 'a', 'continuum', 'approximation', 'to', 'describe', 'the', 'state', 'as', 'a', 'thermofield', 'double', 'in', 'a', 'conformal', 'field', 'theory', 'with', 'an', 'effective', 'temperature', 'which', 'is', 'proportional', 'to', 'the', 'inhomogeneity', 'parameter', 'of', 'the', 'system', 'the', 'latter', 'description', 'also', 'shows', 'that', 'the', 'universal', 'scaling', 'features', 'of', 'this', 'model', 'are', 'captured', 'by', 'a', 'massless', 'dirac', 'fermion', 'in', 'a', 'curved', 'spacetime', 'with', 'constant', 'negative', 'curvature', 'rh2', 'providing', 'another', 'example', 'of', 'the', 'relation', 'between', 'quantum', 'entanglement', 'and', 'spacetime', 'geometry', 'the', 'results', 'we', 'discuss', 'here', 'were', 'already', 'published', 'before', 'but', 'here', 'we', 'present', 'a', 'more', 'didactic', 'exposure', 'of', 'basic', 'concepts', 'of', 'the', 'rainbow', 'system', 'for', 'the', 'students', 'attending', 'the', 'latin', 'american', 'school', 'of', 'physics', 'marcos', 'moshinsky', '2017']]
|
[-0.14738269798660603, 0.17575766882659175, -0.11259859174830265, 0.08480607000394509, -0.05260535084332029, -0.16849152838381437, 0.04551124037661327, 0.31053916792242, -0.235119460346416, -0.2870186474723503, 0.0520416845424244, -0.2831559415967114, -0.1424403233226771, 0.144952741653348, -0.0490320683337557, 0.03180956126739964, 0.0030169423257645506, 0.040320760150177354, -0.07184979752159845, -0.2303858783525916, 0.3330120019877377, 0.06159453654828935, 0.2972282907853906, 0.05112856390575568, 0.08986853796164863, 0.0028549234132067515, 0.030649651169108276, 0.06606578347631371, -0.1356806962342279, 0.08232826663372227, 0.22023227755159427, 0.05427852573081439, 0.25341220349551014, -0.40477357694926935, -0.23768134865050133, 0.05590336531735002, 0.11459917606642613, 0.16415369386220566, -0.03233349583005735, -0.30016745140787976, -0.009255105756127681, -0.1830742150807801, -0.1783719435835687, -0.06230692122204719, 0.024374088034248696, -0.032055884218201616, -0.23934726396766612, 0.11381731576984748, 0.06677879728854466, 0.047120838545453854, -0.0467481264931102, -0.03967497313681703, 0.007532316017657136, 0.1161176821066198, 0.019387504352608886, 0.009485649493021461, 0.10851802112868963, -0.16324788885644803, -0.10329388924038563, 0.3682188499766665, -0.06419235453582726, -0.18127535845344075, 0.16813731026620818, -0.1736992746639328, -0.12222076861354976, 0.07968355843510766, 0.14983854055858384, 0.09073685962409796, -0.1464044714418168, 0.12504411628439974, -0.043313474531691425, 0.18732852715616807, 0.03194051823841456, 0.048409950144541185, 0.20728242012122886, 0.12408127587360258, 0.05031714592105112, 0.16686635594576216, -0.05176156347927948, -0.13223744206823027, -0.34250659052139293, -0.17422681003808976, -0.17648665614258977, 0.08036575708657694, -0.10185787542835056, -0.18333792732073328, 0.3853462682081721, 0.14219293537309383, 0.15596878082037735, -0.007690534224279989, 0.22166723963947824, 0.10837175189159237, 0.04151368769339453, 0.057687325180412675, 0.24399183893595666, 0.15271647033305505, 0.12481937863780425, -0.22978867115214086, 0.00870969671344098, 0.06396261065338667]
|
1,803.05487
|
Rectangular metric like type spaces and fixed points
|
In this paper we introduce the concept of the rectangular metric like spaces,
along with its topology and we prove some fixed point theorems under different
contraction principles. We introduce the concept of modified metric-like space
as well and prove some topological and convergence properties under the
symmetric convergence. Some examples are given to illustrate the proven results
and enrich the new introduced metric type spaces.
|
math.GN
|
in this paper we introduce the concept of the rectangular metric like spaces along with its topology and we prove some fixed point theorems under different contraction principles we introduce the concept of modified metriclike space as well and prove some topological and convergence properties under the symmetric convergence some examples are given to illustrate the proven results and enrich the new introduced metric type spaces
|
[['in', 'this', 'paper', 'we', 'introduce', 'the', 'concept', 'of', 'the', 'rectangular', 'metric', 'like', 'spaces', 'along', 'with', 'its', 'topology', 'and', 'we', 'prove', 'some', 'fixed', 'point', 'theorems', 'under', 'different', 'contraction', 'principles', 'we', 'introduce', 'the', 'concept', 'of', 'modified', 'metriclike', 'space', 'as', 'well', 'and', 'prove', 'some', 'topological', 'and', 'convergence', 'properties', 'under', 'the', 'symmetric', 'convergence', 'some', 'examples', 'are', 'given', 'to', 'illustrate', 'the', 'proven', 'results', 'and', 'enrich', 'the', 'new', 'introduced', 'metric', 'type', 'spaces']]
|
[-0.09381629441949454, 0.09788394593774821, -0.08210803653028878, 0.1134012629133367, -0.09199143274842451, -0.09038635898579025, 0.019801775362187374, 0.378764850877677, -0.32426361186839076, -0.2007130951705304, 0.14193072574826973, -0.23236681333263265, -0.24421608984244592, 0.18407432885777036, -0.15705482989098085, 0.05998555009136908, 0.006292919081522886, 0.05011684408721825, -0.16056672012376966, -0.2679919342750288, 0.43694228512432537, -0.016455622093582697, 0.2862987438195639, 0.07626309323258641, 0.12426904010388887, 0.004568617282943292, -0.0505062999260245, 0.0667840924434131, -0.22603785056112843, 0.12695948659287146, 0.17863117206390156, 0.13630821698020693, 0.28378776929369476, -0.385322210350723, -0.18554183987505507, 0.11117897140370174, 0.061138454690632046, 0.05687270348073181, -0.09425078989288797, -0.33926823258287075, 0.1428414099200657, -0.14061458393310508, -0.18537918010472573, -0.1626818691218046, -0.07024621047700445, 0.0865770002093279, -0.212145685105387, -0.05006688616633641, 0.13087266343681028, 0.06112576154709765, -0.10341958160632092, -0.08165761595591903, 0.015154467631046746, 0.091319128751021, 0.05724855397376373, 0.0026764463717964563, 0.07422335129090105, -0.039523951592855155, -0.12986315633029197, 0.38140516674541164, -0.05062717824440562, -0.27324710470257385, 0.19372839597759373, -0.10640545989471403, -0.18802298865789038, 0.002732189421570211, 0.1357991326120541, 0.15228714994648754, -0.09646627143956721, 0.14104887790568738, -0.0378156958260771, 0.02404038371759904, 0.09507527608057541, 0.11517849970947612, 0.09195657478200948, 0.11372333040432722, 0.13417991768625198, 0.2216831015909768, -0.03551007272449858, -0.12295166798690899, -0.36574421062444645, -0.1816489655863155, -0.13715904890418504, 0.03573043064468286, -0.14868671671314532, -0.18468548974135157, 0.3938239297166354, 0.12359699961080244, 0.18282938387357828, 0.12706462767991153, 0.21027035417500883, 0.08217804756008484, -0.015640259561636907, 0.09405229985713959, 0.20069608045697818, 0.18251953496964593, 0.09587566634273213, -0.11242712241470475, 0.027975548580853327, 0.17315997765399516]
|
1,803.05488
|
Braess paradox in a network with stochastic dynamics and fixed
strategies
|
The Braess paradox can be observed in road networks used by selfish users. It
describes the counterintuitive situation in which adding a new, per se faster,
origin-destination connection to a road network results in increased travel
times for all network users. We study the network as originally proposed by
Braess but introduce microscopic particle dynamics based on the totally
asymmetric exclusion processes. In contrast to our previous work
[10.1103/PhysRevE.94.062312], where routes were chosen randomly according to
turning rates, here we study the case of drivers with fixed route choices. We
find that travel time reduction due to the new road only happens at really low
densities and Braess' paradox dominates the largest part of the phase diagram.
Furthermore, the domain wall phase observed in [10.1103/PhysRevE.94.062312]
vanishes. In the present model gridlock states are observed in a large part of
phase space. We conclude that the construcion of a new road can often be very
critical and should be considered carefully.
|
physics.soc-ph cond-mat.stat-mech nlin.CG
|
the braess paradox can be observed in road networks used by selfish users it describes the counterintuitive situation in which adding a new per se faster origindestination connection to a road network results in increased travel times for all network users we study the network as originally proposed by braess but introduce microscopic particle dynamics based on the totally asymmetric exclusion processes in contrast to our previous work 101103physreve94062312 where routes were chosen randomly according to turning rates here we study the case of drivers with fixed route choices we find that travel time reduction due to the new road only happens at really low densities and braess paradox dominates the largest part of the phase diagram furthermore the domain wall phase observed in 101103physreve94062312 vanishes in the present model gridlock states are observed in a large part of phase space we conclude that the construcion of a new road can often be very critical and should be considered carefully
|
[['the', 'braess', 'paradox', 'can', 'be', 'observed', 'in', 'road', 'networks', 'used', 'by', 'selfish', 'users', 'it', 'describes', 'the', 'counterintuitive', 'situation', 'in', 'which', 'adding', 'a', 'new', 'per', 'se', 'faster', 'origindestination', 'connection', 'to', 'a', 'road', 'network', 'results', 'in', 'increased', 'travel', 'times', 'for', 'all', 'network', 'users', 'we', 'study', 'the', 'network', 'as', 'originally', 'proposed', 'by', 'braess', 'but', 'introduce', 'microscopic', 'particle', 'dynamics', 'based', 'on', 'the', 'totally', 'asymmetric', 'exclusion', 'processes', 'in', 'contrast', 'to', 'our', 'previous', 'work', '101103physreve94062312', 'where', 'routes', 'were', 'chosen', 'randomly', 'according', 'to', 'turning', 'rates', 'here', 'we', 'study', 'the', 'case', 'of', 'drivers', 'with', 'fixed', 'route', 'choices', 'we', 'find', 'that', 'travel', 'time', 'reduction', 'due', 'to', 'the', 'new', 'road', 'only', 'happens', 'at', 'really', 'low', 'densities', 'and', 'braess', 'paradox', 'dominates', 'the', 'largest', 'part', 'of', 'the', 'phase', 'diagram', 'furthermore', 'the', 'domain', 'wall', 'phase', 'observed', 'in', '101103physreve94062312', 'vanishes', 'in', 'the', 'present', 'model', 'gridlock', 'states', 'are', 'observed', 'in', 'a', 'large', 'part', 'of', 'phase', 'space', 'we', 'conclude', 'that', 'the', 'construcion', 'of', 'a', 'new', 'road', 'can', 'often', 'be', 'very', 'critical', 'and', 'should', 'be', 'considered', 'carefully']]
|
[-0.13467189020500964, 0.1451374969480761, -0.07479593084508161, 0.06844702416698739, -0.06922022835499826, -0.15322471647908922, 0.11627861234036149, 0.37365655575517065, -0.25106715119390444, -0.30957770484031005, 0.08634992221824137, -0.28126013577933523, -0.19634333392901784, 0.1483075524862725, -0.10572418576747084, -0.0009029267245872468, 0.05314533642024561, 0.037424066436186336, 0.00828244918247831, -0.24417005970652933, 0.31122243515316655, 0.054045416418445194, 0.3103301050645673, 0.0696163277058702, 0.06320076011073818, -0.022271622322309927, -0.015423354075088574, 0.049180752611235244, -0.11113653055629115, 0.053944395117648536, 0.25244758225559216, 0.08937583394069817, 0.24731073600008704, -0.46011047523207727, -0.2493308899319096, 0.13461078491334796, 0.15482810302489217, 0.13357403106575202, -0.020179068688399627, -0.2960814794845832, 0.06330419660069102, -0.17425589723168475, -0.13184420825100865, -0.008055492766960791, 0.017989813151419353, 0.003022917059908627, -0.21628675289499533, 0.06043614823649975, 0.022246174917669052, 0.010911485865774452, -0.017886360947066433, -0.07569724911598454, -0.02362573098622642, 0.1454159025648597, 0.05075295990152035, 0.0253499441092039, 0.12280775171372399, -0.11257077212842881, -0.13408678041097774, 0.40004463093414616, -0.050198302681373944, -0.17111936777497933, 0.18101223649391845, -0.13790236599150169, -0.11797692997464139, 0.12234788856344522, 0.19071128160491063, 0.10987167176938835, -0.15938268559925542, -0.02065714948367962, -0.047676316106537726, 0.11580463825164446, 0.06769620533142785, 0.0007820740211636397, 0.18914688364039087, 0.19870606187848183, 0.10609062204647596, 0.13306048438308915, -0.0961993818414534, -0.1488674140541227, -0.26834106283962345, -0.13971379597428119, -0.1942552182546099, 0.027101573707820598, -0.07196189676226816, -0.0871214729193954, 0.37753387704301794, 0.1777957569671332, 0.2320385973509045, 0.04221496851981327, 0.26509569452446735, 0.10295539755955528, 0.06532754546185587, 0.09403891318958181, 0.21487254523642504, 0.025302268111645272, 0.1626521558026267, -0.18606071132175908, 0.1174230568680414, 0.023388279996408967]
|
1,803.05489
|
Quantum Effects in Galileon Black Holes
|
Using the Wentzel-Kramers-Brillouin (WKB) approximation we study the
formation and propagation of quantum bound states in the vicinity of a Galileon
black hole. We show that for given ranges of black hole horizon radii and of
the derivative coupling which appears in the metric of the Galileon black hole,
a Regge-Wheeler potential containing a local well is formed. Varying the
strength of the derivative coupling we investigate the behaviour of the bound
states trapped in the potential well or penetrating the horizon of the Galileon
black hole.
|
gr-qc hep-th
|
using the wentzelkramersbrillouin wkb approximation we study the formation and propagation of quantum bound states in the vicinity of a galileon black hole we show that for given ranges of black hole horizon radii and of the derivative coupling which appears in the metric of the galileon black hole a reggewheeler potential containing a local well is formed varying the strength of the derivative coupling we investigate the behaviour of the bound states trapped in the potential well or penetrating the horizon of the galileon black hole
|
[['using', 'the', 'wentzelkramersbrillouin', 'wkb', 'approximation', 'we', 'study', 'the', 'formation', 'and', 'propagation', 'of', 'quantum', 'bound', 'states', 'in', 'the', 'vicinity', 'of', 'a', 'galileon', 'black', 'hole', 'we', 'show', 'that', 'for', 'given', 'ranges', 'of', 'black', 'hole', 'horizon', 'radii', 'and', 'of', 'the', 'derivative', 'coupling', 'which', 'appears', 'in', 'the', 'metric', 'of', 'the', 'galileon', 'black', 'hole', 'a', 'reggewheeler', 'potential', 'containing', 'a', 'local', 'well', 'is', 'formed', 'varying', 'the', 'strength', 'of', 'the', 'derivative', 'coupling', 'we', 'investigate', 'the', 'behaviour', 'of', 'the', 'bound', 'states', 'trapped', 'in', 'the', 'potential', 'well', 'or', 'penetrating', 'the', 'horizon', 'of', 'the', 'galileon', 'black', 'hole']]
|
[-0.20614932963474727, 0.08596523359535668, -0.06512212668459905, 0.13290929737174348, -0.05800417752069389, -0.10498599539478791, 0.025120102615770083, 0.26724910742506897, -0.17909589921520358, -0.2949845719889834, 0.06356725603711375, -0.3216394020951, -0.11658331432015817, 0.14283806123856413, 0.01842270967491699, 0.04376578670872868, -0.033741618356742394, 0.10085757147392323, -0.1096925903620177, -0.23584340324882289, 0.37576300418004394, 0.0817794074804854, 0.20907420654320855, 0.05343630129301482, 0.1033716953156152, 0.023004761190506918, 0.10144059865296572, 0.05248670185776962, -0.17799847639186225, 0.06770173780721794, 0.15263115645429098, 0.08789956567865186, 0.2378186713261851, -0.4082354100570939, -0.253248800384416, 0.050434289051851405, 0.1517902160941184, 0.2013536971851905, -0.10726923204091346, -0.32235355865900756, 0.025202634316151856, -0.22716277379317787, -0.18832758099011992, -0.01004855902601253, 0.034634290209532466, -0.0037567245522406936, -0.23089476267475334, 0.1579925766771381, 0.048140607541427016, -0.10779934544544453, -0.14829297229947372, 0.0050395126722153575, -0.06664065069829424, 0.06986647352694009, 0.11851753688139048, 0.012386785688992033, 0.184217918889019, -0.14347634997068978, -0.0897605388168374, 0.3519790579468526, -0.12011579081587408, -0.1428725261631925, 0.14604008367991653, -0.26699537937040974, -0.043968758802732516, 0.06180241476186925, 0.1630722156802096, 0.2354882133766024, -0.10700849632079575, 0.16794910011465136, 0.05352285940430245, 0.1489187920487475, 0.1518278406269249, 0.08057265665553424, 0.35723111433801297, 0.11950249490381658, 0.025981797949121945, 0.1870851455920044, -0.1069526912312655, -0.13421821804588724, -0.33927005229667684, -0.1431990211853629, -0.17868089809714036, 0.06788401516561193, -0.17270841308696805, -0.22578705962875795, 0.3858494367664573, 0.07181860069776404, 0.18098437095639006, 0.016780348967000758, 0.21135445773044878, 0.1404960021890443, 0.03841668734562465, 0.10601795538283092, 0.3759667683050208, 0.14169812744119387, 0.06437119139336991, -0.2923487305437782, -0.05071550763972189, 0.0951491093113162]
|
1,803.0549
|
Neutral pion and $\eta$ meson production at mid-rapidity in Pb-Pb
collisions at $\sqrt{s_{NN}}$ = 2.76 TeV
|
Neutral pion and $\eta$ meson production in the transverse momentum range 1 <
$p_{T}$ < 20 GeV/$c$ have been measured at mid-rapidity by the ALICE experiment
at the Large Hadron Collider (LHC) in central and semi-central Pb-Pb collisions
at $\sqrt{s_{NN}}$ = 2.76 TeV. These results were obtained using the photon
conversion method as well as the PHOS and EMCal detectors. The results extend
the upper $p_{T}$ reach of the previous ALICE $\pi^{0}$ measurements from 12
GeV/$c$ to 20 GeV/$c$ and present the first measurement of $\eta$ meson
production in heavy-ion collisions at the LHC. The $\eta/\pi^{0}$ ratio is
similar for the two centralities and reaches at high $p_{T}$ a plateau value of
0.457 $\pm$ 0.013$^{stat}$ $\pm$ 0.018$^{syst}$. A suppression of similar
magnitude for $\pi^{0}$ and $\eta$ meson production is observed in Pb-Pb
collisions with respect to their production in pp collisions scaled by the
number of binary nucleon-nucleon collisions. We discuss the results in terms of
NLO pQCD predictions and hydrodynamic models. The measurements show a stronger
suppression with respect to what was observed at lower center-of-mass energies
in the $p_{T}$ range 6 < $p_{T}$ < 10 GeV/$c$. At $p_{T}$ < 3 GeV/$c$,
hadronization models describe the $\pi^{0}$ results while for the $\eta$ some
tension is observed.
|
nucl-ex
|
neutral pion and eta meson production in the transverse momentum range 1 p_t 20 gevc have been measured at midrapidity by the alice experiment at the large hadron collider lhc in central and semicentral pbpb collisions at sqrts_nn 276 tev these results were obtained using the photon conversion method as well as the phos and emcal detectors the results extend the upper p_t reach of the previous alice pi0 measurements from 12 gevc to 20 gevc and present the first measurement of eta meson production in heavyion collisions at the lhc the etapi0 ratio is similar for the two centralities and reaches at high p_t a plateau value of 0457 pm 0013stat pm 0018syst a suppression of similar magnitude for pi0 and eta meson production is observed in pbpb collisions with respect to their production in pp collisions scaled by the number of binary nucleonnucleon collisions we discuss the results in terms of nlo pqcd predictions and hydrodynamic models the measurements show a stronger suppression with respect to what was observed at lower centerofmass energies in the p_t range 6 p_t 10 gevc at p_t 3 gevc hadronization models describe the pi0 results while for the eta some tension is observed
|
[['neutral', 'pion', 'and', 'eta', 'meson', 'production', 'in', 'the', 'transverse', 'momentum', 'range', '1', 'p_t', '20', 'gevc', 'have', 'been', 'measured', 'at', 'midrapidity', 'by', 'the', 'alice', 'experiment', 'at', 'the', 'large', 'hadron', 'collider', 'lhc', 'in', 'central', 'and', 'semicentral', 'pbpb', 'collisions', 'at', 'sqrts_nn', '276', 'tev', 'these', 'results', 'were', 'obtained', 'using', 'the', 'photon', 'conversion', 'method', 'as', 'well', 'as', 'the', 'phos', 'and', 'emcal', 'detectors', 'the', 'results', 'extend', 'the', 'upper', 'p_t', 'reach', 'of', 'the', 'previous', 'alice', 'pi0', 'measurements', 'from', '12', 'gevc', 'to', '20', 'gevc', 'and', 'present', 'the', 'first', 'measurement', 'of', 'eta', 'meson', 'production', 'in', 'heavyion', 'collisions', 'at', 'the', 'lhc', 'the', 'etapi0', 'ratio', 'is', 'similar', 'for', 'the', 'two', 'centralities', 'and', 'reaches', 'at', 'high', 'p_t', 'a', 'plateau', 'value', 'of', '0457', 'pm', '0013stat', 'pm', '0018syst', 'a', 'suppression', 'of', 'similar', 'magnitude', 'for', 'pi0', 'and', 'eta', 'meson', 'production', 'is', 'observed', 'in', 'pbpb', 'collisions', 'with', 'respect', 'to', 'their', 'production', 'in', 'pp', 'collisions', 'scaled', 'by', 'the', 'number', 'of', 'binary', 'nucleonnucleon', 'collisions', 'we', 'discuss', 'the', 'results', 'in', 'terms', 'of', 'nlo', 'pqcd', 'predictions', 'and', 'hydrodynamic', 'models', 'the', 'measurements', 'show', 'a', 'stronger', 'suppression', 'with', 'respect', 'to', 'what', 'was', 'observed', 'at', 'lower', 'centerofmass', 'energies', 'in', 'the', 'p_t', 'range', '6', 'p_t', '10', 'gevc', 'at', 'p_t', '3', 'gevc', 'hadronization', 'models', 'describe', 'the', 'pi0', 'results', 'while', 'for', 'the', 'eta', 'some', 'tension', 'is', 'observed']]
|
[-0.024164669830352068, 0.291784979258664, -0.14699971344321966, 0.10428567443334032, 0.07683463469380512, -0.11347483229124919, -0.07787407454918138, 0.3316758842149284, -0.15397005940554664, -0.31548612538550513, -0.1192811515944777, -0.43845416940981524, 0.18634887534659356, 0.15304681834299116, 0.08844780391082167, 0.14384285505861044, 0.16009578051045537, 0.018086712097283453, -0.04232208654051647, -0.1817852979642339, 0.24428539622575043, 0.14295219680760055, 0.1905931005696766, 0.20891629953403026, 0.05904277374560479, 0.0574726563540753, -0.011156870304839686, -0.02397760480409488, -0.1802454368933104, -0.0038152958992577622, 0.3386805799468493, 0.0014632429264020174, 0.10323380050598643, -0.25554945816518737, -0.057661140244454144, 0.12639945298666133, 0.1491990526812151, 0.04487805338460021, -0.05116671791765839, -0.2609842758212471, 0.18818270426767414, -0.2792474615981337, -0.11852753915358334, -0.016819170843809843, 0.01378273006528616, -0.0009307449127663859, -0.3213333356194198, 0.1650576049438678, -0.04210990515945014, 0.12716930002949084, -0.0220258721569553, -0.26397888174513356, -0.07285957635496743, -0.03637574886670336, 0.11015072239330038, 0.18222137907985597, 0.19803521933266893, -0.1657611557963537, -0.21100926612969487, 0.3773772860877216, 0.043617019113153216, -0.09568870988674462, 0.17264238523319364, -0.2954852010589093, -0.1310990081168711, 0.20760545908240602, 0.2905771621596068, 0.06482801676145755, -0.18581796225742436, 0.022860986674495508, 0.004239295639563352, 0.2011886278819293, 0.1616635382839013, 0.07165665407606867, 0.11680562995490618, 0.20795250750088598, -0.04744588968111202, 0.046364635897334666, -0.1534074027230963, -0.05233397141098976, -0.4361400220543146, -0.07639445841079578, -0.059076464049867355, 0.07751758270140272, -0.12546966969450296, 0.07749178021214903, 0.321496136165224, 0.081833553766337, 0.37427211816757333, 0.028371779097942636, 0.31176233661768493, 0.09370950668351724, 0.042966741945856486, 0.13028630535489355, 0.34124141905762373, 0.1809262188943103, 0.30953296898980626, -0.23705529774422757, 0.02385523488763283, 0.03915636533638463]
|
1,803.05491
|
CLT for supercritical branching processes with heavy-tailed branching
law
|
Consider a branching system with particles moving according to an
Ornstein-Uhlenbeck process with drift $\mu>0$ and branching according to a law
in the domain of attraction of the $(1+\beta)$-stable distribution. The mean of
the branching law is strictly larger than $1$ implying that the system is
supercritical and the total number of particles grows exponentially at some
rate $\lambda>0$.
It is known that the system obeys a law of large numbers. In the paper we
study its rate of convergence.
We discover an interesting interplay between the branching rate $\lambda$ and
the drift parameter $\mu$. There are three regimes of the second order
behavior:
$\cdot$ small branching, $\lambda <(1+1/\beta) \mu$, then the speed of
convergence is the same as in the stable central limit theorem but the limit is
affected by the dependence between particles.
$\cdot$ critical branching, $\lambda =(1+1/\beta) \mu$, then the dependence
becomes strong enough to make the rate of convergence slightly smaller, yet the
qualitative behaviour still resembles the stable central limit theorem
$\cdot$ large branching, $\lambda > (1+1/\beta) \mu$, then the dependence
manifests much more profoundly, the rate of convergence is substantially
smaller and strangely the limit holds a.s.
|
math.PR
|
consider a branching system with particles moving according to an ornsteinuhlenbeck process with drift mu0 and branching according to a law in the domain of attraction of the 1betastable distribution the mean of the branching law is strictly larger than 1 implying that the system is supercritical and the total number of particles grows exponentially at some rate lambda0 it is known that the system obeys a law of large numbers in the paper we study its rate of convergence we discover an interesting interplay between the branching rate lambda and the drift parameter mu there are three regimes of the second order behavior cdot small branching lambda 11beta mu then the speed of convergence is the same as in the stable central limit theorem but the limit is affected by the dependence between particles cdot critical branching lambda 11beta mu then the dependence becomes strong enough to make the rate of convergence slightly smaller yet the qualitative behaviour still resembles the stable central limit theorem cdot large branching lambda 11beta mu then the dependence manifests much more profoundly the rate of convergence is substantially smaller and strangely the limit holds as
|
[['consider', 'a', 'branching', 'system', 'with', 'particles', 'moving', 'according', 'to', 'an', 'ornsteinuhlenbeck', 'process', 'with', 'drift', 'mu0', 'and', 'branching', 'according', 'to', 'a', 'law', 'in', 'the', 'domain', 'of', 'attraction', 'of', 'the', '1betastable', 'distribution', 'the', 'mean', 'of', 'the', 'branching', 'law', 'is', 'strictly', 'larger', 'than', '1', 'implying', 'that', 'the', 'system', 'is', 'supercritical', 'and', 'the', 'total', 'number', 'of', 'particles', 'grows', 'exponentially', 'at', 'some', 'rate', 'lambda0', 'it', 'is', 'known', 'that', 'the', 'system', 'obeys', 'a', 'law', 'of', 'large', 'numbers', 'in', 'the', 'paper', 'we', 'study', 'its', 'rate', 'of', 'convergence', 'we', 'discover', 'an', 'interesting', 'interplay', 'between', 'the', 'branching', 'rate', 'lambda', 'and', 'the', 'drift', 'parameter', 'mu', 'there', 'are', 'three', 'regimes', 'of', 'the', 'second', 'order', 'behavior', 'cdot', 'small', 'branching', 'lambda', '11beta', 'mu', 'then', 'the', 'speed', 'of', 'convergence', 'is', 'the', 'same', 'as', 'in', 'the', 'stable', 'central', 'limit', 'theorem', 'but', 'the', 'limit', 'is', 'affected', 'by', 'the', 'dependence', 'between', 'particles', 'cdot', 'critical', 'branching', 'lambda', '11beta', 'mu', 'then', 'the', 'dependence', 'becomes', 'strong', 'enough', 'to', 'make', 'the', 'rate', 'of', 'convergence', 'slightly', 'smaller', 'yet', 'the', 'qualitative', 'behaviour', 'still', 'resembles', 'the', 'stable', 'central', 'limit', 'theorem', 'cdot', 'large', 'branching', 'lambda', '11beta', 'mu', 'then', 'the', 'dependence', 'manifests', 'much', 'more', 'profoundly', 'the', 'rate', 'of', 'convergence', 'is', 'substantially', 'smaller', 'and', 'strangely', 'the', 'limit', 'holds', 'as']]
|
[-0.14197472303597655, 0.1906610132878086, -0.08467718160197062, 0.06657352056668249, -0.023648549225375366, -0.13208038846884543, 0.07540358542716301, 0.2809707746103716, -0.272654393545281, -0.24542920755629893, 0.08705266530099227, -0.2955242977744395, -0.057402986522599043, 0.17423509301928183, -0.014311953520518728, 0.02427257011944069, 0.012268109535701418, 0.08157430212910792, -0.0020106384326936677, -0.20075475086438624, 0.2745941680980953, 0.05144755879397659, 0.2671098010966186, 0.04813438431847317, 0.08181810960619866, -0.03012884056928063, 0.027314731021760963, 0.009398018504043648, -0.18890907015437128, 0.046484553424306796, 0.12131470368694863, 0.06629012607906286, 0.269059336145195, -0.31472780774735537, -0.09511341378553577, 0.19552200353367274, 0.19062569284263495, 0.038770568246642746, 0.018370828884978135, -0.25069876294825616, 0.12574743051300175, -0.1359774445857814, -0.17313634859419835, -0.011971624075764945, 0.12788489005955248, 0.04846885491133435, -0.30617141245359863, 0.13883370604404868, 0.11542637482246694, 0.0006143579206157787, -0.017633332887271536, -0.1326682102523288, -0.022382244901867427, 0.10168339421215933, 0.12616202092658568, 0.03476665558143092, 0.17260095614862317, -0.14669081540584253, -0.04193430783683046, 0.39328802811602753, -0.10783361718472406, -0.20261304744053632, 0.18407853304233868, -0.24972135076192595, -0.11537028289118705, 0.17710105258811382, 0.15008641173820556, 0.12872644356195906, -0.10077305859401046, 0.13984293346948107, -0.022217671711890336, 0.20318222612938067, 0.07877674709258524, 0.04684470339513306, 0.1412898772071761, 0.21847352321492508, 0.12099537402779485, 0.13772198938628813, -0.05453966882851091, -0.14622165334003512, -0.3159856106018803, -0.14260245456777434, -0.1534165995180956, 0.09624515278240627, -0.1665281079667693, -0.11732932015729602, 0.2778023010978359, 0.11306398444382164, 0.26547118298670586, 0.14281820261385292, 0.22640667677721163, 0.20204559890529103, 0.023349037412420632, 0.06339787592393502, 0.23316934781253926, 0.15847383871854012, 0.12229468832083512, -0.22697580235899295, 0.10141609137402459, 0.03947104291485933]
|
1,803.05492
|
A representing system generated by the Szeg\"{o} kernel for the Hardy
space
|
In this paper we give an explicit construction of a representing system
generated by the Szeg\"{o} kernel for the Hardy space. Thus we answer an open
question posed by Fricain, Khoi and Lef\`evre. We use frame theory to prove the
main result.
|
math.FA
|
in this paper we give an explicit construction of a representing system generated by the szego kernel for the hardy space thus we answer an open question posed by fricain khoi and lefevre we use frame theory to prove the main result
|
[['in', 'this', 'paper', 'we', 'give', 'an', 'explicit', 'construction', 'of', 'a', 'representing', 'system', 'generated', 'by', 'the', 'szego', 'kernel', 'for', 'the', 'hardy', 'space', 'thus', 'we', 'answer', 'an', 'open', 'question', 'posed', 'by', 'fricain', 'khoi', 'and', 'lefevre', 'we', 'use', 'frame', 'theory', 'to', 'prove', 'the', 'main', 'result']]
|
[-0.10786270591197536, 0.022911908064997988, -0.03472547030978603, 0.08149655536690262, -0.06600790501106531, -0.06952309691114351, 0.047566117468522864, 0.3337446455378085, -0.32215358447283504, -0.25161522687412796, 0.10641561986121814, -0.21804773051990195, -0.18649410309735687, 0.22951749227941037, -0.153608398581855, 0.023328882385976614, 0.0595347986498382, 0.000658775185002014, -0.03504066867753863, -0.31269266409799457, 0.44752591197611763, 0.05789912609616295, 0.151583734434098, 0.10146786193363369, 0.1237141930963844, 0.03388140349998139, -0.07468393484596163, -0.06224326070005191, -0.2161604240303859, 0.19525594669394195, 0.2647295374423265, 0.17307670029695146, 0.31047058845870196, -0.39621423846110704, -0.15744303761093761, 0.10056917562615127, 0.14838323584990576, 0.09473592291469686, -0.05825910185230896, -0.32708964180201294, 0.04470357046229765, -0.1361765969952103, -0.18792756259208546, -0.1047055116854608, 0.023624773416668177, -0.07209519618190825, -0.25840505664236846, 0.006336368783377111, 0.19161078613251448, 0.05510565189179033, -0.14742457079701127, -0.034713689048658125, 0.12562316949479282, 0.11018199300160632, 0.0010642216025871676, 0.11604756937595084, 0.001542254292871803, -0.07612684619962237, -0.12749415206490083, 0.3167203649645671, -0.08900172633002512, -0.2346793470904231, 0.12238219855353236, -0.08993749425280839, -0.12537984056398271, 0.004787268722429872, 0.13686970812268556, 0.1071376328356564, -0.12441688566468656, 0.16318869800161337, -0.14432559716515242, 0.1270509738562396, 0.13218465561512857, -0.015306712803430855, 0.09731118129566312, 0.10709852011641488, 0.10721309776417912, 0.19800876970402898, 0.03742733988947293, -0.03655689418665133, -0.33424379406496885, -0.2211929056858935, -0.18680226881988346, 0.11090823896229267, -0.02611525822394469, -0.18063398664817215, 0.37662514796247704, 0.18730288260849193, 0.24812262446212116, 0.07846997948363424, 0.2297453777398914, 0.13956767322961242, -0.05637204863596708, 0.10420330038759858, 0.10878892033360898, 0.1521587520488538, 0.0807688529836014, -0.15045457249507307, -0.033738197688944635, 0.22065507678780705]
|
1,803.05493
|
Quasi-isometry classification of RAAGs that split over cyclic subgroups
|
For a one-ended right-angled Artin group, we give an explicit description of
its JSJ tree of cylinders over infinite cyclic subgroups in terms of its
defining graph. This is then used to classify certain right-angled Artin groups
up to quasi-isometry. In particular, we show that if two right-angled Artin
groups are quasi-isometric, then their JSJ trees of cylinders are weakly
equivalent. Although the converse to this is not generally true, we define
quasi-isometry invariants known as stretch factors that can distinguish
quasi-isometry classes of RAAGs with weakly equivalence JSJ trees of cylinders.
We then show that for many right-angled Artin groups, being weakly equivalent
and having matching stretch factors is a complete quasi-isometry invariant.
|
math.GR
|
for a oneended rightangled artin group we give an explicit description of its jsj tree of cylinders over infinite cyclic subgroups in terms of its defining graph this is then used to classify certain rightangled artin groups up to quasiisometry in particular we show that if two rightangled artin groups are quasiisometric then their jsj trees of cylinders are weakly equivalent although the converse to this is not generally true we define quasiisometry invariants known as stretch factors that can distinguish quasiisometry classes of raags with weakly equivalence jsj trees of cylinders we then show that for many rightangled artin groups being weakly equivalent and having matching stretch factors is a complete quasiisometry invariant
|
[['for', 'a', 'oneended', 'rightangled', 'artin', 'group', 'we', 'give', 'an', 'explicit', 'description', 'of', 'its', 'jsj', 'tree', 'of', 'cylinders', 'over', 'infinite', 'cyclic', 'subgroups', 'in', 'terms', 'of', 'its', 'defining', 'graph', 'this', 'is', 'then', 'used', 'to', 'classify', 'certain', 'rightangled', 'artin', 'groups', 'up', 'to', 'quasiisometry', 'in', 'particular', 'we', 'show', 'that', 'if', 'two', 'rightangled', 'artin', 'groups', 'are', 'quasiisometric', 'then', 'their', 'jsj', 'trees', 'of', 'cylinders', 'are', 'weakly', 'equivalent', 'although', 'the', 'converse', 'to', 'this', 'is', 'not', 'generally', 'true', 'we', 'define', 'quasiisometry', 'invariants', 'known', 'as', 'stretch', 'factors', 'that', 'can', 'distinguish', 'quasiisometry', 'classes', 'of', 'raags', 'with', 'weakly', 'equivalence', 'jsj', 'trees', 'of', 'cylinders', 'we', 'then', 'show', 'that', 'for', 'many', 'rightangled', 'artin', 'groups', 'being', 'weakly', 'equivalent', 'and', 'having', 'matching', 'stretch', 'factors', 'is', 'a', 'complete', 'quasiisometry', 'invariant']]
|
[-0.17998303573480562, 0.16169652857181, -0.11006265714470494, 0.1167209866311679, -0.13768081568802396, -0.1740568365652539, -0.009941642434058482, 0.4809369127870652, -0.3907988156118479, -0.22631452168877186, 0.09544344425912162, -0.26251346629782857, -0.13854609445358315, 0.19278020156433054, -0.20407347456274325, -0.03868664187285232, 0.07614292115741, 0.11065499087501514, -0.07569541690846611, -0.3314559121604441, 0.41738367208949567, -0.11946017600661307, 0.24626007492719382, 0.058038189443514535, 0.08556364017555065, -0.010444336047951589, -0.010420424907096546, 0.04704254671620826, -0.21428687332024166, 0.08590188170701527, 0.353105025733576, 0.027630959130954324, 0.13000219138420857, -0.324439048423971, -0.08724243935211505, 0.2546114203808094, 0.17074343641370274, 0.018395499465170138, -0.04029528926874168, -0.2718398825984383, 0.14874369146204308, -0.16398785957707124, -0.1288424254795373, -0.06955476491221864, 0.09295247574826997, -0.03440097818281828, -0.1506952718390446, 0.0036040691397430605, 0.15629869273030444, 0.0911765565376794, -0.013308868484097746, -0.06100043688345243, -0.03841051085353747, 0.2149151887810021, 0.01002480192702231, -0.015133361679322103, 0.11492728091073795, -0.06712102223383754, -0.12166412769032545, 0.4561242128215861, -0.02582362667543062, -0.2358279333596951, 0.19393730462577782, -0.14414043851164088, -0.2194929976872038, 0.13798216886393594, 0.10550254433040034, 0.10581321590334962, -0.05937218554971511, 0.15202363219730997, -0.2063359692447672, 0.11328009102113643, 0.1687264885649232, -0.06610275642423515, 0.08537705344344049, 0.08235057815909386, 0.17419890240764066, 0.18861576048820689, 0.13859123994776032, 0.11103452412562706, -0.31625381094125804, -0.17969419030685044, -0.035835964356042575, 0.07972930629317457, -0.17385972298979413, -0.28396047804333074, 0.38164521969462695, 0.022904244696786792, 0.10428377403469201, 0.2402380517430669, 0.1983005547254722, -0.04582705630067115, 0.08497455937730704, 0.10811539566993975, 0.12083335318643469, 0.24773903218048968, -0.2390555643870724, -0.05939354554733686, 0.003034779166786425, 0.2608096687809417]
|
1,803.05494
|
Improving Object Counting with Heatmap Regulation
|
In this paper, we propose a simple and effective way to improve one-look
regression models for object counting from images. We use class activation map
visualizations to illustrate the drawbacks of learning a pure one-look
regression model for a counting task. Based on these insights, we enhance
one-look regression counting models by regulating activation maps from the
final convolution layer of the network with coarse ground-truth activation maps
generated from simple dot annotations. We call this strategy heatmap regulation
(HR). We show that this simple enhancement effectively suppresses false
detections generated by the corresponding one-look baseline model and also
improves the performance in terms of false negatives. Evaluations are performed
on four different counting datasets --- two for car counting (CARPK, PUCPR+),
one for crowd counting (WorldExpo) and another for biological cell counting
(VGG-Cells). Adding HR to a simple VGG front-end improves performance on all
these benchmarks compared to a simple one-look baseline model and results in
state-of-the-art performance for car counting.
|
cs.CV
|
in this paper we propose a simple and effective way to improve onelook regression models for object counting from images we use class activation map visualizations to illustrate the drawbacks of learning a pure onelook regression model for a counting task based on these insights we enhance onelook regression counting models by regulating activation maps from the final convolution layer of the network with coarse groundtruth activation maps generated from simple dot annotations we call this strategy heatmap regulation hr we show that this simple enhancement effectively suppresses false detections generated by the corresponding onelook baseline model and also improves the performance in terms of false negatives evaluations are performed on four different counting datasets two for car counting carpk pucpr one for crowd counting worldexpo and another for biological cell counting vggcells adding hr to a simple vgg frontend improves performance on all these benchmarks compared to a simple onelook baseline model and results in stateoftheart performance for car counting
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'simple', 'and', 'effective', 'way', 'to', 'improve', 'onelook', 'regression', 'models', 'for', 'object', 'counting', 'from', 'images', 'we', 'use', 'class', 'activation', 'map', 'visualizations', 'to', 'illustrate', 'the', 'drawbacks', 'of', 'learning', 'a', 'pure', 'onelook', 'regression', 'model', 'for', 'a', 'counting', 'task', 'based', 'on', 'these', 'insights', 'we', 'enhance', 'onelook', 'regression', 'counting', 'models', 'by', 'regulating', 'activation', 'maps', 'from', 'the', 'final', 'convolution', 'layer', 'of', 'the', 'network', 'with', 'coarse', 'groundtruth', 'activation', 'maps', 'generated', 'from', 'simple', 'dot', 'annotations', 'we', 'call', 'this', 'strategy', 'heatmap', 'regulation', 'hr', 'we', 'show', 'that', 'this', 'simple', 'enhancement', 'effectively', 'suppresses', 'false', 'detections', 'generated', 'by', 'the', 'corresponding', 'onelook', 'baseline', 'model', 'and', 'also', 'improves', 'the', 'performance', 'in', 'terms', 'of', 'false', 'negatives', 'evaluations', 'are', 'performed', 'on', 'four', 'different', 'counting', 'datasets', 'two', 'for', 'car', 'counting', 'carpk', 'pucpr', 'one', 'for', 'crowd', 'counting', 'worldexpo', 'and', 'another', 'for', 'biological', 'cell', 'counting', 'vggcells', 'adding', 'hr', 'to', 'a', 'simple', 'vgg', 'frontend', 'improves', 'performance', 'on', 'all', 'these', 'benchmarks', 'compared', 'to', 'a', 'simple', 'onelook', 'baseline', 'model', 'and', 'results', 'in', 'stateoftheart', 'performance', 'for', 'car', 'counting']]
|
[-0.005823181871816797, -0.001685914414372506, -0.037655779043411684, 0.0757661318104808, -0.09011472040002451, -0.19830505491626807, 0.09210047974037416, 0.41802300330040587, -0.2306818032238937, -0.33797499518724355, 0.04904438295099978, -0.2901144302860137, -0.19348798337562373, 0.24626881389808403, -0.1694397153215682, 0.07911768228506798, 0.14838195379249425, 0.01614450175115991, -0.04515460152735453, -0.28337101957104727, 0.28632650982185426, 0.03825272159041755, 0.31134035571847324, 0.03304850069641973, 0.13994372285223045, -0.007724878293280519, -0.0525889743936582, 0.004321158428236391, -0.08064038752975951, 0.15289461018470754, 0.2597053592236886, 0.15997835640274222, 0.24296369600408482, -0.36318971487582197, -0.2086127057858983, 0.09758899548916884, 0.146076194441192, 0.07595327760192856, -0.03617926538151648, -0.29188543586236126, 0.09980233498158354, -0.2057801857239233, 0.021986352629760432, -0.14397859673525365, -0.050854850556765856, 0.013702919823117554, -0.32824124012189276, 0.05744990498836463, 0.05204069994554018, 0.06388185342990518, -0.043812785750114415, -0.13056375396748385, 0.041412191995589424, 0.16678962423964022, -0.00919720888029456, 0.026829133398901178, 0.16088378783491142, -0.21512414233571608, -0.18196829179823165, 0.3064286363949566, -0.08721026136252866, -0.23608732280913014, 0.2022018840070814, -0.048402935225493125, -0.16934995288644336, 0.12163891320837275, 0.19234149193730932, 0.11103708330401273, -0.13606254973173518, -0.011727990127174454, -0.05111347709975715, 0.16833796162369116, 0.11070045758823648, -0.048264705767831616, 0.15538358134393282, 0.24205437688883277, 0.027191869277542212, 0.17327671039574224, -0.1586335282084538, -0.04769779946186445, -0.24576534681701623, -0.09738031857348275, -0.14894573026814106, 0.0041578290281149574, -0.11205859770434587, -0.1436817113269097, 0.43424036423529283, 0.21656560212514311, 0.22952889743020888, 0.16975617276375773, 0.3472355329812323, 0.07024051222083329, 0.07687357218157055, 0.032228881911646995, 0.13404887439624505, 0.010919951160186491, 0.05961374149206768, -0.18161570694467416, 0.047605793234165875, 0.09662710237697517]
|
1,803.05495
|
Challenges in Discriminating Profanity from Hate Speech
|
In this study we approach the problem of distinguishing general profanity
from hate speech in social media, something which has not been widely
considered. Using a new dataset annotated specifically for this task, we employ
supervised classification along with a set of features that includes n-grams,
skip-grams and clustering-based word representations. We apply approaches based
on single classifiers as well as more advanced ensemble classifiers and stacked
generalization, achieving the best result of 80% accuracy for this 3-class
classification task. Analysis of the results reveals that discriminating hate
speech and profanity is not a simple task, which may require features that
capture a deeper understanding of the text not always possible with surface
n-grams. The variability of gold labels in the annotated data, due to
differences in the subjective adjudications of the annotators, is also an
issue. Other directions for future work are discussed.
|
cs.CL
|
in this study we approach the problem of distinguishing general profanity from hate speech in social media something which has not been widely considered using a new dataset annotated specifically for this task we employ supervised classification along with a set of features that includes ngrams skipgrams and clusteringbased word representations we apply approaches based on single classifiers as well as more advanced ensemble classifiers and stacked generalization achieving the best result of 80 accuracy for this 3class classification task analysis of the results reveals that discriminating hate speech and profanity is not a simple task which may require features that capture a deeper understanding of the text not always possible with surface ngrams the variability of gold labels in the annotated data due to differences in the subjective adjudications of the annotators is also an issue other directions for future work are discussed
|
[['in', 'this', 'study', 'we', 'approach', 'the', 'problem', 'of', 'distinguishing', 'general', 'profanity', 'from', 'hate', 'speech', 'in', 'social', 'media', 'something', 'which', 'has', 'not', 'been', 'widely', 'considered', 'using', 'a', 'new', 'dataset', 'annotated', 'specifically', 'for', 'this', 'task', 'we', 'employ', 'supervised', 'classification', 'along', 'with', 'a', 'set', 'of', 'features', 'that', 'includes', 'ngrams', 'skipgrams', 'and', 'clusteringbased', 'word', 'representations', 'we', 'apply', 'approaches', 'based', 'on', 'single', 'classifiers', 'as', 'well', 'as', 'more', 'advanced', 'ensemble', 'classifiers', 'and', 'stacked', 'generalization', 'achieving', 'the', 'best', 'result', 'of', '80', 'accuracy', 'for', 'this', '3class', 'classification', 'task', 'analysis', 'of', 'the', 'results', 'reveals', 'that', 'discriminating', 'hate', 'speech', 'and', 'profanity', 'is', 'not', 'a', 'simple', 'task', 'which', 'may', 'require', 'features', 'that', 'capture', 'a', 'deeper', 'understanding', 'of', 'the', 'text', 'not', 'always', 'possible', 'with', 'surface', 'ngrams', 'the', 'variability', 'of', 'gold', 'labels', 'in', 'the', 'annotated', 'data', 'due', 'to', 'differences', 'in', 'the', 'subjective', 'adjudications', 'of', 'the', 'annotators', 'is', 'also', 'an', 'issue', 'other', 'directions', 'for', 'future', 'work', 'are', 'discussed']]
|
[-0.016298424682931623, 0.007116107026809482, -0.06960910862845766, 0.10079459826725737, -0.13994127693683742, -0.16438135478671614, 0.0541998474839163, 0.43093664863413866, -0.22535233797140783, -0.32974557587437303, 0.04898547867990353, -0.33507474154637723, -0.18822964216693194, 0.21993915168763875, -0.12848720392147145, 0.03773893330610924, 0.13979433351391732, 0.09442261644188067, -0.04127193924236613, -0.2772307079415638, 0.32931487158696343, 0.029583808112811374, 0.3502984629956992, 0.045376068078815106, 0.08058716432302149, -0.023219027102214993, -0.07190737899366792, -0.011334355893688133, -0.04027640267853891, 0.17331854811254108, 0.34695723940540185, 0.19313096271508692, 0.31364657564928844, -0.33937782057442123, -0.22841857070220517, 0.10564102904734339, 0.15786245799056822, 0.1374847478594735, -0.022948247766943642, -0.33884834025993005, 0.09482395173648007, -0.15284948613107127, 0.023852523745174384, -0.1161981259401028, 0.01531189026871136, -0.03271956246027111, -0.24479483031884317, 0.08448679177102737, 0.13372502783663454, 0.12149969599801165, -0.06409748476991833, -0.11902747818812649, 0.044750950773005616, 0.1786838452807152, 0.07951436432443194, 0.0504472518023885, 0.09816111094225524, -0.19878995325579146, -0.16324903375804556, 0.4089933395177334, -0.07187300916741622, -0.23156294177963652, 0.21373514652128456, -0.03323082311951614, -0.18218562698603927, 0.06986167791814028, 0.21808443199582658, 0.12219163736041921, -0.17874143771514608, -0.0374352800691585, -0.07239591567353769, 0.2205889631002503, 0.07052653741703688, 0.007214001544760996, 0.19044003951187422, 0.2640871273685846, -0.012034340387119072, 0.12430843991150924, -0.11454283682323367, 0.002437782383904877, -0.2285404426495095, -0.12476443531401976, -0.17835193813674255, -0.022769407714880723, -0.0685353630766398, -0.17717814481315705, 0.40838256002879225, 0.21658109642737838, 0.1966555824542379, 0.08774872399847043, 0.28939526225277384, 0.008396694922784727, 0.09748607259113472, 0.05316799543545601, 0.18586439296759508, 0.0058002299726843, 0.09544145326305936, -0.12789038237032865, 0.0922178303630749, 0.03750838871582873]
|
1,803.05496
|
Logical Gates via Gliders Collisions
|
An elementary cellular automaton with memory is a chain of finite state
machines (cells) updating their state simultaneously and by the same rule. Each
cell updates its current state depending on current states of its immediate
neighbours and a certain number of its own past states. Some cell-state
transition rules support gliders, compact patterns of non-quiescent states
translating along the chain. We present designs of logical gates, including
reversible Fredkin gate and controlled NOT gate, implemented via collisions
between gliders.
|
nlin.CG cs.ET
|
an elementary cellular automaton with memory is a chain of finite state machines cells updating their state simultaneously and by the same rule each cell updates its current state depending on current states of its immediate neighbours and a certain number of its own past states some cellstate transition rules support gliders compact patterns of nonquiescent states translating along the chain we present designs of logical gates including reversible fredkin gate and controlled not gate implemented via collisions between gliders
|
[['an', 'elementary', 'cellular', 'automaton', 'with', 'memory', 'is', 'a', 'chain', 'of', 'finite', 'state', 'machines', 'cells', 'updating', 'their', 'state', 'simultaneously', 'and', 'by', 'the', 'same', 'rule', 'each', 'cell', 'updates', 'its', 'current', 'state', 'depending', 'on', 'current', 'states', 'of', 'its', 'immediate', 'neighbours', 'and', 'a', 'certain', 'number', 'of', 'its', 'own', 'past', 'states', 'some', 'cellstate', 'transition', 'rules', 'support', 'gliders', 'compact', 'patterns', 'of', 'nonquiescent', 'states', 'translating', 'along', 'the', 'chain', 'we', 'present', 'designs', 'of', 'logical', 'gates', 'including', 'reversible', 'fredkin', 'gate', 'and', 'controlled', 'not', 'gate', 'implemented', 'via', 'collisions', 'between', 'gliders']]
|
[-0.181961132577635, 0.22254565081839245, -0.02018268628999067, 0.005601874501735438, -0.04298573166888673, -0.22145282383426093, 0.2291104881413048, 0.425151675241068, -0.2876044993288815, -0.2091271990677342, 0.1047263145504985, -0.2211344806710258, -0.07040005519011175, 0.13784025853965431, -0.025711162093648453, 0.054639658166706795, 0.07679360400070437, 0.08532057341653854, -0.02774676759036083, -0.2549251598087722, 0.2354028474073857, 0.023073726883740164, 0.28900433928647545, -0.012414337112568318, 0.13986152197467164, 0.011830566648859531, 0.052959247143007815, -0.027437508571892977, -0.04440331196819898, 0.09067078775078699, 0.22424840161111206, 0.18133055142243393, 0.24197427241597325, -0.5392365913139656, -0.14313186724903063, 0.09614952809351962, 0.11981994754169137, 0.15194237169343977, -0.017100803910579998, -0.3257583800703287, 0.06647243949701079, -0.22882904069847426, -0.08315219265059567, -0.08408009943923389, 0.046564535368815996, 0.0898396085947752, -0.1920744281320367, -0.020449218110297807, 0.10763394027890172, 0.08577668567886576, -0.0517049819114618, -0.1104473373212386, -0.08388300171354786, 0.1557880556676537, -0.09016349354351405, -0.0052759114420041445, 0.2342537120275665, -0.12259199215477565, -0.24746134648448787, 0.2765001682535512, 0.018221023003570737, -0.19737094483571127, 0.21244352880166845, -0.07991897451574914, -0.056050780788064004, 0.0913884696085006, 0.11181338852329645, 0.08077626671292819, -0.12833654747228138, 0.06152882931419299, -0.008111786149675027, 0.1829329029424116, 0.05513147738529369, 0.06049195888917893, 0.22044143781531603, 0.16911000972613693, 0.06621936354786158, 0.16086603948206174, -0.011972354850149714, -0.16359212719835342, -0.3011942266020924, -0.18381777475588024, -0.18603726595174522, 0.022530408651982727, -0.03147712286390743, -0.19607687292736956, 0.43681954802013934, 0.06823470618912779, 0.19261616660551226, 0.07841191014740616, 0.2552289816143457, 0.0759660722251283, 0.086650366653339, 0.07287047728314064, 0.10544997410797805, 0.1767774988693418, 0.06111093110521324, -0.26599145846557803, 0.11393254527647514, 0.059775110543705524]
|
1,803.05497
|
Lost in Normalization
|
The consequences of the gauge-coupling dependent normalization-factor of
$1/g^{\alpha}$ in the transfer-matrix of 2d U(1) lattice gauge theory are
explored. It is seen by the $\alpha=1$ choice that the lowest energy develops a
minimum at coupling $g_*=1.125$, leading to a \textit{multi-valued} Gibbs
energy similar to the systems with the first-order phase transition. It is
argued how the $1/g$ normalization may be regarded as a lost normalization in
the commonly used change of variable to the dimensionless angle-variables.
Based on the continuum limit at the next-leading order and the Ostrogradsky
formulation of higher-order time-derivatives theories, it is argued that the
spectrum at continuum is compatible only with the $\alpha=1$ choice.
|
hep-lat hep-th
|
the consequences of the gaugecoupling dependent normalizationfactor of 1galpha in the transfermatrix of 2d u1 lattice gauge theory are explored it is seen by the alpha1 choice that the lowest energy develops a minimum at coupling g_1125 leading to a textitmultivalued gibbs energy similar to the systems with the firstorder phase transition it is argued how the 1g normalization may be regarded as a lost normalization in the commonly used change of variable to the dimensionless anglevariables based on the continuum limit at the nextleading order and the ostrogradsky formulation of higherorder timederivatives theories it is argued that the spectrum at continuum is compatible only with the alpha1 choice
|
[['the', 'consequences', 'of', 'the', 'gaugecoupling', 'dependent', 'normalizationfactor', 'of', '1galpha', 'in', 'the', 'transfermatrix', 'of', '2d', 'u1', 'lattice', 'gauge', 'theory', 'are', 'explored', 'it', 'is', 'seen', 'by', 'the', 'alpha1', 'choice', 'that', 'the', 'lowest', 'energy', 'develops', 'a', 'minimum', 'at', 'coupling', 'g_1125', 'leading', 'to', 'a', 'textitmultivalued', 'gibbs', 'energy', 'similar', 'to', 'the', 'systems', 'with', 'the', 'firstorder', 'phase', 'transition', 'it', 'is', 'argued', 'how', 'the', '1g', 'normalization', 'may', 'be', 'regarded', 'as', 'a', 'lost', 'normalization', 'in', 'the', 'commonly', 'used', 'change', 'of', 'variable', 'to', 'the', 'dimensionless', 'anglevariables', 'based', 'on', 'the', 'continuum', 'limit', 'at', 'the', 'nextleading', 'order', 'and', 'the', 'ostrogradsky', 'formulation', 'of', 'higherorder', 'timederivatives', 'theories', 'it', 'is', 'argued', 'that', 'the', 'spectrum', 'at', 'continuum', 'is', 'compatible', 'only', 'with', 'the', 'alpha1', 'choice']]
|
[-0.1168187991850293, 0.16732940512100378, -0.10322040592123252, 0.1018352957505088, -0.05194544262037827, -0.12246608159666021, 0.02059212522223019, 0.3211587509565736, -0.24948600244421798, -0.27336840958406144, 0.08664243338101257, -0.25925430128923976, -0.11501070408401294, 0.12208576758320515, -0.00710317994414184, 0.04390222260441918, -0.023186872525212284, 0.08125324533522452, -0.08061931584961712, -0.20023384236712724, 0.30998615021011433, 0.07476870951583035, 0.28809110342095107, 0.04690740871368549, 0.08994744004359326, -0.020596255955751985, 0.020909681818850983, 0.023372487373238143, -0.12236790862810337, 0.0593412927342937, 0.2070155949690021, 0.019060247698619675, 0.2385445891234737, -0.35706261515196486, -0.2319158559324793, 0.08384901714788821, 0.12420884448622999, 0.10072039499377403, 0.03668258657405833, -0.22257249930407852, 0.06861715536349668, -0.1646106148389383, -0.1640678407778838, -0.062218976753334015, 0.0016304424498230219, -0.021804793549773212, -0.263071319885337, 0.11431245370365034, 0.0436047163227788, -0.001350775513296517, -0.029424883268522814, -0.104822096571577, -0.08148564104116164, 0.0734272711891278, 0.09600627002565978, 0.06847329586386107, 0.10726157213167216, -0.14075818441163462, -0.07769571128749074, 0.43626123352441937, -0.08358457445081932, -0.20001996473337597, 0.16830672860333623, -0.1388413961288349, -0.17294856620719656, 0.14795942685137, 0.05381257472953831, 0.10876050274852717, -0.09786523596491091, 0.11933485293131806, 0.020786267500415515, 0.20407460881576228, 0.052615711448967116, 0.043450928114068046, 0.211401511162806, 0.12922840046947107, 0.04407637036190583, 0.11340430653721202, -0.043521130562742025, -0.13475571416067675, -0.3571735023086568, -0.11336290900810407, -0.21679604248716855, 0.050177439115941525, -0.09702456016706353, -0.17111523819263452, 0.3549112686350082, 0.1610547352656095, 0.1856038468854072, 0.014591187111084135, 0.22446567331028816, 0.23249147199161457, 0.11261153298143584, 0.037869270640210465, 0.2967188549496663, 0.1383144654391799, 0.10968540199638273, -0.251945573294786, 0.03328895602428999, 0.09167214845253441]
|
1,803.05498
|
Computational complexity of the avalanche problem on one dimensional
Kadanoff sandpiles
|
In this paper we prove that the general avalanche problem AP is in NC, for
the Kadanoff sandpile model in one dimension, answering an open problem of
Formenti, Goles and Martin in 2010. Thus adding one more item to the (slowly)
growing list of dimension sensitive problems since in higher dimensions the
problem is P-complete (for monotone sandpiles).
|
cs.CC cond-mat.stat-mech
|
in this paper we prove that the general avalanche problem ap is in nc for the kadanoff sandpile model in one dimension answering an open problem of formenti goles and martin in 2010 thus adding one more item to the slowly growing list of dimension sensitive problems since in higher dimensions the problem is pcomplete for monotone sandpiles
|
[['in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'general', 'avalanche', 'problem', 'ap', 'is', 'in', 'nc', 'for', 'the', 'kadanoff', 'sandpile', 'model', 'in', 'one', 'dimension', 'answering', 'an', 'open', 'problem', 'of', 'formenti', 'goles', 'and', 'martin', 'in', '2010', 'thus', 'adding', 'one', 'more', 'item', 'to', 'the', 'slowly', 'growing', 'list', 'of', 'dimension', 'sensitive', 'problems', 'since', 'in', 'higher', 'dimensions', 'the', 'problem', 'is', 'pcomplete', 'for', 'monotone', 'sandpiles']]
|
[-0.05004797932046482, 0.12260435379683163, -0.001903455998552473, 0.08248028580891785, -0.06910319042212346, -0.2119927365463554, 0.05201599942806193, 0.30678988194548557, -0.2688267211217368, -0.27092290460540536, 0.0958241689953419, -0.27161216379649805, -0.16934199510305598, 0.1735507510234847, -0.15963035246782137, 0.06352576603622813, 0.018371375549274187, 0.029101681094943432, 0.03694890917017402, -0.3504575624931277, 0.35540051694567265, 0.01794890719751844, 0.233723556263405, 0.06701856635903057, 0.055575734347497165, 0.03221003271704703, -0.05371561440590181, 0.04337043679531729, -0.1338355419591831, 0.11015578955125979, 0.26922484722576645, 0.1148258183159653, 0.28978987342857737, -0.38645418622253236, -0.21415625458272794, 0.12797644079393267, 0.1382467149381052, 0.0984456079048023, 0.0005335652648793991, -0.21356485431131564, 0.12293379766899243, -0.161761409737856, -0.17514192069504866, 0.03376434187878642, 0.1484661831340769, -0.07673639098280355, -0.2856467297594798, 0.03635131122479052, 0.13941131635127882, 0.033100370914070754, -0.03660491732022676, -0.0811766851836358, 0.05508063091046847, 0.07371672722020824, 0.04019541272754667, 0.07968420537368379, 0.016325757258751412, -0.16447582289886972, -0.15654873995012358, 0.3604575243794866, 0.001779121044500355, -0.2209517628346619, 0.17602359385866867, -0.127800482047493, -0.21938740524152914, 0.09577297906211593, 0.16473670378980929, 0.1420744938710541, -0.11213873053712999, 0.16942315832854724, -0.13301437156961152, 0.14145124784319482, 0.11092585242729176, -0.03109007027600647, 0.10446993773803115, 0.19649069625557514, 0.16374515086869923, 0.1856426688139899, 0.01711252138116642, -0.0875076335069025, -0.20687983185052872, -0.14855933030086912, -0.16180294050361244, 0.04892916532984951, -0.09692722543427647, -0.17869128437157264, 0.37487154493206426, 0.17330196673017845, 0.13769513038763156, 0.0755188651628008, 0.22559527152528366, 0.1248463467580446, 0.009151549025422387, 0.143630194396042, 0.1376038753313192, 0.10613131353206802, 0.138060346646071, -0.1499910015089993, 0.034444298154037246, 0.15225421794151006]
|
1,803.05499
|
A Distributed Architecture for Edge Service Orchestration with
Guarantees
|
The Network Function Virtualization paradigm is attracting the interest of
service providers, that may greatly benefit from its flexibility and
scalability properties. However, the diversity of possible orchestrated
services, rises the necessity of adopting specific orchestration strategies for
each service request that are unknown a priori. This paper presents Senate, a
distributed architecture that enables precise orchestration of heterogeneous
services over a common edge infrastructure. To assign shared resources to
service orchestrators, Senate uses the Distributed Orchestration Resource
Assignment (DORA), an approximation algorithm that we designed to guarantee
both a bound on convergence time and an optimal (1-1/e)-approximation with
respect to the Pareto optimal resource assignment. We evaluate advantages of
service orchestration with Senate and performance of DORA through a prototype
implementation.
|
cs.NI cs.DS
|
the network function virtualization paradigm is attracting the interest of service providers that may greatly benefit from its flexibility and scalability properties however the diversity of possible orchestrated services rises the necessity of adopting specific orchestration strategies for each service request that are unknown a priori this paper presents senate a distributed architecture that enables precise orchestration of heterogeneous services over a common edge infrastructure to assign shared resources to service orchestrators senate uses the distributed orchestration resource assignment dora an approximation algorithm that we designed to guarantee both a bound on convergence time and an optimal 11eapproximation with respect to the pareto optimal resource assignment we evaluate advantages of service orchestration with senate and performance of dora through a prototype implementation
|
[['the', 'network', 'function', 'virtualization', 'paradigm', 'is', 'attracting', 'the', 'interest', 'of', 'service', 'providers', 'that', 'may', 'greatly', 'benefit', 'from', 'its', 'flexibility', 'and', 'scalability', 'properties', 'however', 'the', 'diversity', 'of', 'possible', 'orchestrated', 'services', 'rises', 'the', 'necessity', 'of', 'adopting', 'specific', 'orchestration', 'strategies', 'for', 'each', 'service', 'request', 'that', 'are', 'unknown', 'a', 'priori', 'this', 'paper', 'presents', 'senate', 'a', 'distributed', 'architecture', 'that', 'enables', 'precise', 'orchestration', 'of', 'heterogeneous', 'services', 'over', 'a', 'common', 'edge', 'infrastructure', 'to', 'assign', 'shared', 'resources', 'to', 'service', 'orchestrators', 'senate', 'uses', 'the', 'distributed', 'orchestration', 'resource', 'assignment', 'dora', 'an', 'approximation', 'algorithm', 'that', 'we', 'designed', 'to', 'guarantee', 'both', 'a', 'bound', 'on', 'convergence', 'time', 'and', 'an', 'optimal', '11eapproximation', 'with', 'respect', 'to', 'the', 'pareto', 'optimal', 'resource', 'assignment', 'we', 'evaluate', 'advantages', 'of', 'service', 'orchestration', 'with', 'senate', 'and', 'performance', 'of', 'dora', 'through', 'a', 'prototype', 'implementation']]
|
[-0.19954519415251362, -0.02792689120411285, -0.0828053558657526, -0.00784774442569765, -0.15250990000843515, -0.2181807055489206, 0.19935549611176104, 0.4168775004113368, -0.28975672912631245, -0.3205603922046454, 0.06552382669846726, -0.2257843340792861, -0.12294614235641527, 0.13861035335747923, -0.1578092477608808, 0.0999189863285836, 0.06335524425576594, 0.0009370043751646261, -0.006850868784612594, -0.2746645876046148, 0.26230650129117317, 0.09138469356799224, 0.41599194631629366, 0.07152357494428022, 0.0751415837182068, 0.014319284521348652, -0.01338262672795624, -0.07167789480242436, -0.08088021113305376, 0.16803233970536804, 0.33291145991013943, 0.3038822722079263, 0.39297061532995375, -0.41096012961485834, -0.12498976325723113, 0.06526429724085649, 0.17514953048915038, -0.0175641036332875, -0.0385392978300768, -0.2683173272621314, 0.08414522649292819, -0.2840736857710834, -0.11368182295605113, -0.08905780570367809, -0.02434458332441625, 0.07741656966152463, -0.31948486292643136, -0.078916476650133, -0.03723060003039046, 0.0010153879793208154, -0.07741078248411631, -0.08117073175848508, -0.02443396224121212, 0.18803035614050193, 0.0050363308143206555, 0.015442808040371929, 0.17501741244465296, -0.1155117828332505, -0.1791334102907386, 0.38567295030797605, 0.02603257645959737, -0.16359416921680306, 0.17545869395510888, 0.041235687096649015, -0.18825404102471274, 0.10824661992574264, 0.22700910019062337, 0.04521561989352702, -0.23424540192163626, 0.03596032036470295, -0.016054764397625553, 0.18059248507946546, 0.04223880658811722, 0.09731520390229635, 0.1597117309126484, 0.2709364702421256, 0.18080729266035095, 0.1282046099048352, 0.009271501676087862, -0.14456505404802453, -0.1987445844665597, -0.15360893898492786, -0.19067136428822748, -0.008347412884296452, -0.11071875461982658, -0.15861602116864723, 0.40093482453681406, 0.1912479765025458, 0.0804774748566026, 0.15484251533100596, 0.39207591397351904, 0.025841499781846754, 0.08477754976417197, 0.18000970898791538, 0.09415650436154674, -0.040870879667994305, 0.19741550900927576, -0.1921440358273685, 0.1722680379552614, -0.016618077627948074]
|
1,803.055
|
A Technique Based on Chaos for Brain Computer Interfacing
|
A user of Brain Computer Interface (BCI) system must be able to control
external computer devices with brain activity. Although the proof-of-concept
was given decades ago, the reliable translation of user intent into device
control commands is still a major challenge. There are problems associated with
classification of different BCI tasks. In this paper we propose the use of
chaotic indices of the BCI. We use largest Lyapunov exponent, mutual
information, correlation dimension and minimum embedding dimension as the
features for the classification of EEG signals which have been released by BCI
Competition IV. A multi-layer Perceptron classifier and a KM- SVM(support
vector machine classifier based on k-means clustering) is used for
classification process, which lead us to an accuracy of 95.5%, for
discrimination between two motor imagery tasks.
|
eess.SP
|
a user of brain computer interface bci system must be able to control external computer devices with brain activity although the proofofconcept was given decades ago the reliable translation of user intent into device control commands is still a major challenge there are problems associated with classification of different bci tasks in this paper we propose the use of chaotic indices of the bci we use largest lyapunov exponent mutual information correlation dimension and minimum embedding dimension as the features for the classification of eeg signals which have been released by bci competition iv a multilayer perceptron classifier and a km svmsupport vector machine classifier based on kmeans clustering is used for classification process which lead us to an accuracy of 955 for discrimination between two motor imagery tasks
|
[['a', 'user', 'of', 'brain', 'computer', 'interface', 'bci', 'system', 'must', 'be', 'able', 'to', 'control', 'external', 'computer', 'devices', 'with', 'brain', 'activity', 'although', 'the', 'proofofconcept', 'was', 'given', 'decades', 'ago', 'the', 'reliable', 'translation', 'of', 'user', 'intent', 'into', 'device', 'control', 'commands', 'is', 'still', 'a', 'major', 'challenge', 'there', 'are', 'problems', 'associated', 'with', 'classification', 'of', 'different', 'bci', 'tasks', 'in', 'this', 'paper', 'we', 'propose', 'the', 'use', 'of', 'chaotic', 'indices', 'of', 'the', 'bci', 'we', 'use', 'largest', 'lyapunov', 'exponent', 'mutual', 'information', 'correlation', 'dimension', 'and', 'minimum', 'embedding', 'dimension', 'as', 'the', 'features', 'for', 'the', 'classification', 'of', 'eeg', 'signals', 'which', 'have', 'been', 'released', 'by', 'bci', 'competition', 'iv', 'a', 'multilayer', 'perceptron', 'classifier', 'and', 'a', 'km', 'svmsupport', 'vector', 'machine', 'classifier', 'based', 'on', 'kmeans', 'clustering', 'is', 'used', 'for', 'classification', 'process', 'which', 'lead', 'us', 'to', 'an', 'accuracy', 'of', '955', 'for', 'discrimination', 'between', 'two', 'motor', 'imagery', 'tasks']]
|
[-0.09316402483091224, 0.015420311622733607, -0.08791959939480876, 0.031118323749595334, -0.1144585473762163, -0.27368169647525065, 0.022442603095441882, 0.40638410687643045, -0.2642873465374578, -0.33811021856672596, 0.09196581919422897, -0.2821908328551217, -0.21898496634094045, 0.2366012464974574, -0.12588954014063347, 0.10797126034196936, 0.0942751019856587, 0.09817003144962655, -0.01017963112462894, -0.27927118667867035, 0.26768044598429697, 0.018367005926847924, 0.3346153561869869, 0.024839636011165567, 0.11430944918538444, -0.005982094384307857, 6.323915840766858e-05, -0.019718878080311697, -0.07865285240404774, 0.16600881910426324, 0.35034091592387995, 0.19605228740510938, 0.3411541028035572, -0.3839736046975304, -0.20961693221397582, 0.09917796325680683, 0.13535399410829996, 0.07131145166022179, -0.04522640825325652, -0.3467638247238938, 0.11180182227144542, -0.18805799629535613, 0.008979794551237319, -0.07548005333956098, 0.03279784526966978, -0.03776162578287767, -0.26449074964330066, 0.07783788159076721, 0.044276126922341064, 0.17542392964242026, -0.06827896204924855, -0.052134607564767066, 0.025211289401340764, 0.21386102538599516, 0.01443159844143338, 0.05742154475865391, 0.18279846718542103, -0.15230461246210325, -0.2037505028306441, 0.32172946650825907, 0.023026792702324883, -0.18804675368301105, 0.2378373823230504, -0.031403134133142885, -0.11915862327441573, 0.07860596560931299, 0.28300649202719796, 0.03767876166239148, -0.18984130573517177, -0.020442982891836436, 0.00967301817581756, 0.23360297807812458, 0.05337016010162188, -0.052742508458322845, 0.19270164625777397, 0.24648441874342097, 0.050409439928444044, 0.141052258797572, -0.12830023570904814, -0.015428452818014193, -0.22256447923564338, -0.13990909893618664, -0.1905445722368313, -0.012014210805318726, -0.09340307579600449, -0.13384659638541052, 0.43879532043865765, 0.17663884717330802, 0.15826783223474195, 0.06680562451401784, 0.3245788194035413, 0.06480059066871036, 0.11195117396346177, 0.07365409804333467, 0.2035539972494007, 0.07746961015254783, 0.14690947394774412, -0.17598179868946318, 0.11370622725189605, 0.05142425149824703]
|
1,803.05501
|
Max-Min Greedy Matching
|
A bipartite graph $G(U,V;E)$ that admits a perfect matching is given. One
player imposes a permutation $\pi$ over $V$, the other player imposes a
permutation $\sigma$ over $U$. In the greedy matching algorithm, vertices of
$U$ arrive in order $\sigma$ and each vertex is matched to the lowest (under
$\pi$) yet unmatched neighbor in $V$ (or left unmatched, if all its neighbors
are already matched). The obtained matching is maximal, thus matches at least a
half of the vertices. The max-min greedy matching problem asks: suppose the
first (max) player reveals $\pi$, and the second (min) player responds with the
worst possible $\sigma$ for $\pi$, does there exist a permutation $\pi$
ensuring to match strictly more than a half of the vertices? Can such a
permutation be computed in polynomial time?
The main result of this paper is an affirmative answer for this question: we
show that there exists a polytime algorithm to compute $\pi$ for which for
every $\sigma$ at least $\rho > 0.51$ fraction of the vertices of $V$ are
matched. We provide additional lower and upper bounds for special families of
graphs, including regular and Hamiltonian. Interestingly, even for regular
graphs with arbitrarily large degree (implying a large number of disjoint
perfect matchings), there is no $\pi$ ensuring to match more than a fraction
$8/9$ of the vertices.
The max-min greedy matching problem solves an open problem regarding the
welfare guarantees attainable by pricing in sequential markets with binary
unit-demand valuations. In addition, it has implications for the size of the
unique stable matching in markets with global preferences, subject to the graph
structure.
|
cs.GT cs.DS
|
a bipartite graph guve that admits a perfect matching is given one player imposes a permutation pi over v the other player imposes a permutation sigma over u in the greedy matching algorithm vertices of u arrive in order sigma and each vertex is matched to the lowest under pi yet unmatched neighbor in v or left unmatched if all its neighbors are already matched the obtained matching is maximal thus matches at least a half of the vertices the maxmin greedy matching problem asks suppose the first max player reveals pi and the second min player responds with the worst possible sigma for pi does there exist a permutation pi ensuring to match strictly more than a half of the vertices can such a permutation be computed in polynomial time the main result of this paper is an affirmative answer for this question we show that there exists a polytime algorithm to compute pi for which for every sigma at least rho 051 fraction of the vertices of v are matched we provide additional lower and upper bounds for special families of graphs including regular and hamiltonian interestingly even for regular graphs with arbitrarily large degree implying a large number of disjoint perfect matchings there is no pi ensuring to match more than a fraction 89 of the vertices the maxmin greedy matching problem solves an open problem regarding the welfare guarantees attainable by pricing in sequential markets with binary unitdemand valuations in addition it has implications for the size of the unique stable matching in markets with global preferences subject to the graph structure
|
[['a', 'bipartite', 'graph', 'guve', 'that', 'admits', 'a', 'perfect', 'matching', 'is', 'given', 'one', 'player', 'imposes', 'a', 'permutation', 'pi', 'over', 'v', 'the', 'other', 'player', 'imposes', 'a', 'permutation', 'sigma', 'over', 'u', 'in', 'the', 'greedy', 'matching', 'algorithm', 'vertices', 'of', 'u', 'arrive', 'in', 'order', 'sigma', 'and', 'each', 'vertex', 'is', 'matched', 'to', 'the', 'lowest', 'under', 'pi', 'yet', 'unmatched', 'neighbor', 'in', 'v', 'or', 'left', 'unmatched', 'if', 'all', 'its', 'neighbors', 'are', 'already', 'matched', 'the', 'obtained', 'matching', 'is', 'maximal', 'thus', 'matches', 'at', 'least', 'a', 'half', 'of', 'the', 'vertices', 'the', 'maxmin', 'greedy', 'matching', 'problem', 'asks', 'suppose', 'the', 'first', 'max', 'player', 'reveals', 'pi', 'and', 'the', 'second', 'min', 'player', 'responds', 'with', 'the', 'worst', 'possible', 'sigma', 'for', 'pi', 'does', 'there', 'exist', 'a', 'permutation', 'pi', 'ensuring', 'to', 'match', 'strictly', 'more', 'than', 'a', 'half', 'of', 'the', 'vertices', 'can', 'such', 'a', 'permutation', 'be', 'computed', 'in', 'polynomial', 'time', 'the', 'main', 'result', 'of', 'this', 'paper', 'is', 'an', 'affirmative', 'answer', 'for', 'this', 'question', 'we', 'show', 'that', 'there', 'exists', 'a', 'polytime', 'algorithm', 'to', 'compute', 'pi', 'for', 'which', 'for', 'every', 'sigma', 'at', 'least', 'rho', '051', 'fraction', 'of', 'the', 'vertices', 'of', 'v', 'are', 'matched', 'we', 'provide', 'additional', 'lower', 'and', 'upper', 'bounds', 'for', 'special', 'families', 'of', 'graphs', 'including', 'regular', 'and', 'hamiltonian', 'interestingly', 'even', 'for', 'regular', 'graphs', 'with', 'arbitrarily', 'large', 'degree', 'implying', 'a', 'large', 'number', 'of', 'disjoint', 'perfect', 'matchings', 'there', 'is', 'no', 'pi', 'ensuring', 'to', 'match', 'more', 'than', 'a', 'fraction', '89', 'of', 'the', 'vertices', 'the', 'maxmin', 'greedy', 'matching', 'problem', 'solves', 'an', 'open', 'problem', 'regarding', 'the', 'welfare', 'guarantees', 'attainable', 'by', 'pricing', 'in', 'sequential', 'markets', 'with', 'binary', 'unitdemand', 'valuations', 'in', 'addition', 'it', 'has', 'implications', 'for', 'the', 'size', 'of', 'the', 'unique', 'stable', 'matching', 'in', 'markets', 'with', 'global', 'preferences', 'subject', 'to', 'the', 'graph', 'structure']]
|
[-0.1600203406997025, 0.07431029499067725, -0.05003186466725529, 0.05763466817044996, -0.09221426919767899, -0.2040053082079035, 0.11199229155164703, 0.3912025731673142, -0.2729456156450219, -0.28636569123456074, 0.06629284888814918, -0.3366730574989355, -0.10726398036725945, 0.10682885082879741, -0.08496930740385919, 0.026162035307887226, 0.08577370490787789, 0.14165189050768653, -0.010157049011440836, -0.307106048888238, 0.2598979516835407, -0.027766497797836878, 0.18632202892287641, 0.040936205104383803, 0.1079911277340585, 0.039934046991008394, -0.0012528265903430774, 0.05132567526289451, -0.15546093512217285, 0.06263627329205786, 0.2738618490074348, 0.15953573068595447, 0.29007677213617955, -0.3654538016319686, -0.09659727212020609, 0.22266106174810602, 0.1088750588889689, 0.057765160264934, -0.007066031441655311, -0.1971985459169268, 0.16171755275296928, -0.11220573017745028, -0.08543855705494552, 0.01613984092075686, 0.07510937226207968, -0.04836794020278953, -0.3400010033924206, -0.0022577895691856405, 0.07880032106558267, 0.02842368631563727, 0.006388977425141414, -0.18243183192811885, -0.03317820158160355, 0.12342137100850757, -0.010477795837929915, 0.10421342229036461, 0.01987039288694102, -0.13813876292162358, -0.16708906912559965, 0.4152414851639896, -0.036080365457079246, -0.1779697529631982, 0.11694335767428594, -0.1436315624256591, -0.14464588042460663, 0.1570719077082918, 0.11140651206391394, 0.12344479286006856, -0.10428988539698687, 0.10820010264099512, -0.1583295325412506, 0.1783325102856852, 0.16149036394418181, 0.028310450427216666, 0.15318167106427, 0.14556011687999212, 0.21572232503562996, 0.13573833445767186, 0.02505186057970789, -0.059252619271777586, -0.28012569132479803, -0.09015702328091502, -0.16737199147954876, 0.04234969630466312, -0.14855918612071187, -0.16755667735281563, 0.384860249267737, 0.06869147462451733, 0.21077004380181039, 0.12205813408529918, 0.25276836451568424, 0.11687685700599104, 0.009444060894025838, 0.18759750071877992, 0.16572319091948912, 0.09694387368364189, -0.014488171651273182, -0.18318099488538805, 0.10786207304121681, 0.07430148790713008]
|
1,803.05502
|
Long-time asymptotic expansions for Navier-Stokes equations with
power-decaying forces
|
The Navier-Stokes equations for viscous, incompressible fluids are studied in
the three-dimensional periodic domains, with the body force having an
asymptotic expansion, when time goes to infinity, in terms of power-decaying
functions in a Sobolev-Gevrey space. Any Leray-Hopf weak solution is proved to
have an asymptotic expansion of the same type in the same space, which is
uniquely determined by the force, and independent of the individual solutions.
In case the expansion is convergent, we show that the next asymptotic
approximation for the solution must be an exponential decay. Furthermore, the
convergence of the expansion and the range of its coefficients, as the force
varies, are investigated.
|
math.AP
|
the navierstokes equations for viscous incompressible fluids are studied in the threedimensional periodic domains with the body force having an asymptotic expansion when time goes to infinity in terms of powerdecaying functions in a sobolevgevrey space any lerayhopf weak solution is proved to have an asymptotic expansion of the same type in the same space which is uniquely determined by the force and independent of the individual solutions in case the expansion is convergent we show that the next asymptotic approximation for the solution must be an exponential decay furthermore the convergence of the expansion and the range of its coefficients as the force varies are investigated
|
[['the', 'navierstokes', 'equations', 'for', 'viscous', 'incompressible', 'fluids', 'are', 'studied', 'in', 'the', 'threedimensional', 'periodic', 'domains', 'with', 'the', 'body', 'force', 'having', 'an', 'asymptotic', 'expansion', 'when', 'time', 'goes', 'to', 'infinity', 'in', 'terms', 'of', 'powerdecaying', 'functions', 'in', 'a', 'sobolevgevrey', 'space', 'any', 'lerayhopf', 'weak', 'solution', 'is', 'proved', 'to', 'have', 'an', 'asymptotic', 'expansion', 'of', 'the', 'same', 'type', 'in', 'the', 'same', 'space', 'which', 'is', 'uniquely', 'determined', 'by', 'the', 'force', 'and', 'independent', 'of', 'the', 'individual', 'solutions', 'in', 'case', 'the', 'expansion', 'is', 'convergent', 'we', 'show', 'that', 'the', 'next', 'asymptotic', 'approximation', 'for', 'the', 'solution', 'must', 'be', 'an', 'exponential', 'decay', 'furthermore', 'the', 'convergence', 'of', 'the', 'expansion', 'and', 'the', 'range', 'of', 'its', 'coefficients', 'as', 'the', 'force', 'varies', 'are', 'investigated']]
|
[-0.16546209325205605, 0.10704777706872984, -0.11331184756643367, 0.0241776220401626, -0.02793577599848779, -0.05881434197555173, -0.040581285990038796, 0.29626136332890896, -0.31021727640884666, -0.21049133448351948, 0.14649697900244543, -0.27878442890766375, -0.08687049133773402, 0.16574415743772714, -0.00863987842645004, 0.06161453150034847, 0.027168267564672343, 0.07746662479333298, -0.07046104996807803, -0.258958645085892, 0.3200141117943205, 0.01165863260943091, 0.2528114876081675, 0.007884964311741433, 0.11390750309867556, -0.03771323160233222, 0.006259209087628098, 0.04608017264125113, -0.18155515319833868, 0.042539271396444235, 0.19147293357494868, 0.04220887207482966, 0.27717566729154225, -0.41696113968303183, -0.20172441077752495, 0.09323882195606546, 0.21124255685531096, 0.08960708323317, 0.0014442302866505001, -0.24582413733137315, 0.09835924824286815, -0.1434855022915762, -0.2129566092483418, -0.08436678066181968, 0.057046123644126194, 0.10862277256641185, -0.3135482890812575, 0.0885224745011414, 0.06453722027648803, 0.025815326952757664, -0.1466880215096885, -0.045091470953885396, 0.018582084624729347, 0.14594486041158167, 0.12994566684553646, 0.03380487475298204, 0.054671021784603036, -0.14809317676842493, -0.0483643269113634, 0.3724900075972502, -0.10829885340436309, -0.26205729172682557, 0.18757470297398712, -0.1888554878313235, -0.06647700117900968, 0.14124965591725172, 0.12358153204187611, 0.1578828769160505, -0.1474422022711567, 0.16466951744964803, -0.03368044404734699, 0.1221099521191615, 0.11763990169637045, -0.014067934426250603, 0.10942894237924297, 0.1256740111484245, 0.09213071802569518, 0.14232013287475193, -0.031172953638438146, -0.10357856357751309, -0.3378414220334786, -0.18555501124927037, -0.2177343805505068, 0.04895032242924537, -0.16954312384768855, -0.21648064479319695, 0.349879235938578, 0.06097922117871074, 0.15708114892543065, 0.06401478013414715, 0.26972029347166, 0.19924477617726397, 0.016418131683373225, 0.09358014993912943, 0.29524902220736343, 0.11647745983604833, 0.1055066696816247, -0.2271527934134147, 0.07119491159694076, 0.14339371468819115]
|
1,803.05503
|
A New Parareal Algorithm for Problems with Discontinuous Sources
|
The Parareal algorithm allows to solve evolution problems exploiting
parallelization in time. Its convergence and stability have been proved under
the assumption of regular (smooth) inputs. We present and analyze here a new
Parareal algorithm for ordinary differential equations which involve
discontinuous right-hand sides. Such situations occur in various applications,
e.g., when an electric device is supplied with a pulse-width-modulated signal.
Our new Parareal algorithm uses a smooth input for the coarse problem with
reduced dynamics. We derive error estimates that show how the input reduction
influences the overall convergence rate of the algorithm. We support our
theoretical results by numerical experiments, and also test our new Parareal
algorithm in an eddy current simulation of an induction machine.
|
math.NA cs.NA
|
the parareal algorithm allows to solve evolution problems exploiting parallelization in time its convergence and stability have been proved under the assumption of regular smooth inputs we present and analyze here a new parareal algorithm for ordinary differential equations which involve discontinuous righthand sides such situations occur in various applications eg when an electric device is supplied with a pulsewidthmodulated signal our new parareal algorithm uses a smooth input for the coarse problem with reduced dynamics we derive error estimates that show how the input reduction influences the overall convergence rate of the algorithm we support our theoretical results by numerical experiments and also test our new parareal algorithm in an eddy current simulation of an induction machine
|
[['the', 'parareal', 'algorithm', 'allows', 'to', 'solve', 'evolution', 'problems', 'exploiting', 'parallelization', 'in', 'time', 'its', 'convergence', 'and', 'stability', 'have', 'been', 'proved', 'under', 'the', 'assumption', 'of', 'regular', 'smooth', 'inputs', 'we', 'present', 'and', 'analyze', 'here', 'a', 'new', 'parareal', 'algorithm', 'for', 'ordinary', 'differential', 'equations', 'which', 'involve', 'discontinuous', 'righthand', 'sides', 'such', 'situations', 'occur', 'in', 'various', 'applications', 'eg', 'when', 'an', 'electric', 'device', 'is', 'supplied', 'with', 'a', 'pulsewidthmodulated', 'signal', 'our', 'new', 'parareal', 'algorithm', 'uses', 'a', 'smooth', 'input', 'for', 'the', 'coarse', 'problem', 'with', 'reduced', 'dynamics', 'we', 'derive', 'error', 'estimates', 'that', 'show', 'how', 'the', 'input', 'reduction', 'influences', 'the', 'overall', 'convergence', 'rate', 'of', 'the', 'algorithm', 'we', 'support', 'our', 'theoretical', 'results', 'by', 'numerical', 'experiments', 'and', 'also', 'test', 'our', 'new', 'parareal', 'algorithm', 'in', 'an', 'eddy', 'current', 'simulation', 'of', 'an', 'induction', 'machine']]
|
[-0.10601697929808472, 0.007287895708304082, -0.12784123283802953, 0.040839747244165815, -0.09057008107312214, -0.14591155471041417, 0.014866881894393481, 0.36812410943019086, -0.32483280035985523, -0.3105944852448172, 0.125498160167645, -0.19685493378004987, -0.1813094618045685, 0.25402888492681086, -0.08597743890694, 0.12126248450820437, 0.1262991494921028, -0.012362314654816674, -0.07852144939596088, -0.2927820621870267, 0.2673733815646324, 0.022822039396876197, 0.293247027977113, 0.04187785278215734, 0.1584905588513829, -0.03852768914185019, -0.03025190636682778, 0.020659836160385203, -0.11533596936214574, 0.08188425391239838, 0.21850902937117836, 0.1477562041583065, 0.32002298447948235, -0.46921438788278746, -0.18061136728964555, 0.06100659610496627, 0.1451577438029379, 0.13537722082438472, -0.10885456335953732, -0.26437203884602356, 0.11003725027912256, -0.1262600963266614, -0.10144416201843792, -0.13133233112211412, -0.02592344593622873, 0.08206552832236147, -0.34229904453023374, 0.04590761843391169, 0.06526165412197638, 0.04446340275880618, -0.06676553658351031, -0.10055229221032853, 0.05475781960751161, 0.09483332577699788, 0.03410649235941406, 0.0033236503855794924, 0.11018508614407072, -0.10186612442072131, -0.15319245177894258, 0.33979599378429926, -0.07531490726555642, -0.2675100242734974, 0.16893291983626083, -0.060687381571206525, -0.1387252979195462, 0.13545325649384823, 0.21714520021381542, 0.1614124688735773, -0.09899052068689125, 0.09648996392816193, -0.04109882425246203, 0.17896339959568447, 0.0320516498779289, -0.02880353123172481, 0.0680386123374805, 0.21578041188872588, 0.12009664280459476, 0.14805136525677118, -0.06607092288322747, -0.11055397184000501, -0.30468278468992466, -0.1622670776027645, -0.15002885485529646, -0.006355507749045252, -0.12393532846579189, -0.1573993612287773, 0.37774303160671496, 0.20984638314375764, 0.15305810218873936, 0.10295201302406529, 0.3590954776582682, 0.15985480642431757, -0.00613500363080022, 0.13243881322077325, 0.192179464838571, 0.11346158514428152, 0.1344402116906439, -0.2740261290365687, 0.07242109604840541, 0.10333554262920228]
|
1,803.05504
|
q-Bernoulli Inequality
|
In this work, the q-analogue of Bernoulli inequality is proved. Some other
related results are presented.
|
math.CA
|
in this work the qanalogue of bernoulli inequality is proved some other related results are presented
|
[['in', 'this', 'work', 'the', 'qanalogue', 'of', 'bernoulli', 'inequality', 'is', 'proved', 'some', 'other', 'related', 'results', 'are', 'presented']]
|
[-0.1480004225159064, 0.0874611658800859, -0.06320614623837173, 0.06021790119120851, -0.09929270553402603, -0.20837430842220783, -0.04518103692680597, 0.2787297647446394, -0.29532177906366996, -0.21077761554624885, 0.0889161114973831, -0.3025822639465332, -0.2519549906719476, 0.33701477106660604, -0.21222249150741845, 0.10418675158871338, 0.04450029617873952, 0.09535652468912303, -0.009588362227077596, -0.3780920607969165, 0.34241307293996215, -0.030547890171874315, 0.2519913821015507, 0.12496676063165069, -0.03169358515879139, -0.07915044840774499, -0.16304740676423535, -0.047259805200155824, -0.20333521743305027, 0.14925356715684757, 0.27344764256849885, 0.10516725474735722, 0.30427248898195103, -0.2928600776940584, -0.11583180050365627, 0.10128388099838048, 0.11119822165346704, 0.03987538325600326, -0.08568450954044238, -0.30624176282435656, 0.047395251924172044, -0.16194392327452078, -0.2069500448415056, -0.06725232396274805, -0.04180990974418819, 0.1500129266642034, -0.2639418577309698, 0.1392656800453551, 0.1517545828828588, 0.028600364341400564, -0.055308441806118935, -0.2326939580962062, 0.10701805853750557, -0.009925319551257417, 0.1277010857447749, 0.05535314537701197, 0.008098237332887948, -0.04198270272172522, -0.16357322945259511, 0.3602660386823118, 0.08107397623825818, -0.2503252635942772, 0.11922584264539182, -0.16688290814636275, -0.3056020268413704, -0.011087019345723093, 0.07839981507277116, 0.1331194209633395, -0.15413550357334316, 0.04944861092371866, -0.19793547975132242, 0.021727369545260444, 0.17292460825410672, 0.02237641392275691, -0.013849924085661769, 0.031647647731006145, 0.05471826298162341, 0.24478251744949375, 0.022448119008913636, -0.09896626090630889, -0.335631025955081, -0.19735226855846122, -0.2705442602164112, 0.04954707977594808, -0.07952917274087667, -0.07641473936382681, 0.2915440462529659, 0.13499645749107003, 0.1398032510187477, 0.08159366971813142, 0.17831943096825853, 0.17182351974770427, -0.03423350537195802, -0.02738974176463671, 0.1725334516759176, 0.25762375339400023, 0.1443311672192067, -0.07263657919247635, 0.10956905971397646, 0.2004227918223478]
|
1,803.05505
|
Bearing Rigidity Theory and its Applications for Control and Estimation
of Network Systems: Life Beyond Distance Rigidity
|
The problem of distributed control and estimation for multi-agent systems
with limited sensing capabilities is a practical challenge motivated by
incomplete and imperfect sensing. This article addresses an important case
where each agent in a network can only sense the relative bearings to their
nearest neighbors. The study of this topic is motivated mainly by the rapid
development of bearing-only sensors such as optical cameras or sensor arrays.
This article provides a tutorial review on this topic focusing on the problems
of formation control and network localization. A key component of this review
is a presentation of the recently developed bearing rigidity theory, which
defines a necessary architectural feature of multi-agent systems aiming to
solve these two problems. This article presents a high-level summary of
recently developed algorithms solving these problems, various simulation
examples, and discussions pointing to the relevant literature and important
remaining challenges in this area.
|
cs.SY
|
the problem of distributed control and estimation for multiagent systems with limited sensing capabilities is a practical challenge motivated by incomplete and imperfect sensing this article addresses an important case where each agent in a network can only sense the relative bearings to their nearest neighbors the study of this topic is motivated mainly by the rapid development of bearingonly sensors such as optical cameras or sensor arrays this article provides a tutorial review on this topic focusing on the problems of formation control and network localization a key component of this review is a presentation of the recently developed bearing rigidity theory which defines a necessary architectural feature of multiagent systems aiming to solve these two problems this article presents a highlevel summary of recently developed algorithms solving these problems various simulation examples and discussions pointing to the relevant literature and important remaining challenges in this area
|
[['the', 'problem', 'of', 'distributed', 'control', 'and', 'estimation', 'for', 'multiagent', 'systems', 'with', 'limited', 'sensing', 'capabilities', 'is', 'a', 'practical', 'challenge', 'motivated', 'by', 'incomplete', 'and', 'imperfect', 'sensing', 'this', 'article', 'addresses', 'an', 'important', 'case', 'where', 'each', 'agent', 'in', 'a', 'network', 'can', 'only', 'sense', 'the', 'relative', 'bearings', 'to', 'their', 'nearest', 'neighbors', 'the', 'study', 'of', 'this', 'topic', 'is', 'motivated', 'mainly', 'by', 'the', 'rapid', 'development', 'of', 'bearingonly', 'sensors', 'such', 'as', 'optical', 'cameras', 'or', 'sensor', 'arrays', 'this', 'article', 'provides', 'a', 'tutorial', 'review', 'on', 'this', 'topic', 'focusing', 'on', 'the', 'problems', 'of', 'formation', 'control', 'and', 'network', 'localization', 'a', 'key', 'component', 'of', 'this', 'review', 'is', 'a', 'presentation', 'of', 'the', 'recently', 'developed', 'bearing', 'rigidity', 'theory', 'which', 'defines', 'a', 'necessary', 'architectural', 'feature', 'of', 'multiagent', 'systems', 'aiming', 'to', 'solve', 'these', 'two', 'problems', 'this', 'article', 'presents', 'a', 'highlevel', 'summary', 'of', 'recently', 'developed', 'algorithms', 'solving', 'these', 'problems', 'various', 'simulation', 'examples', 'and', 'discussions', 'pointing', 'to', 'the', 'relevant', 'literature', 'and', 'important', 'remaining', 'challenges', 'in', 'this', 'area']]
|
[-0.14874881500617373, 0.027899573170961468, -0.018290021245971927, -0.007476899937279774, -0.10500937623815057, -0.16473956195939635, 0.017173989321186987, 0.3729026835424373, -0.28777741542010493, -0.31556154773696454, 0.1645261444060157, -0.23412810008960297, -0.21866736056305142, 0.17450701740941638, -0.15537722704214724, 0.09869734132214059, 0.08516709393242726, 0.020513889549702808, -0.0294732847801611, -0.24467518669867738, 0.309157636166846, 0.08724395221892141, 0.29763304048872274, 0.06461480148199543, 0.13241787603741662, 0.03932798235689768, -0.07695671997498721, 0.032809308848054324, -0.12206200691336463, 0.23244617064404804, 0.3423520835569581, 0.15210781722467998, 0.369633382582735, -0.4278036486294523, -0.23899376095977384, 0.08836227164893234, 0.15492148527000854, 0.11049733073309038, -0.09127287496655323, -0.29089130479307546, 0.05784938346305107, -0.18050338039048822, -0.08136075955337367, -0.03134904920541983, 0.01724448927829193, 0.024439692426460317, -0.2232562137257962, -0.008051556044233006, 0.0727178106933295, 0.08669842417490341, -0.05032639424206462, -0.10257793619372957, 0.11626830591577911, 0.14460366987465956, 0.042257363525316796, 0.02505700184642715, 0.1425499414263696, -0.14861098303289683, -0.14034404545924878, 0.4041072849838718, 0.058686468706189376, -0.16435149894961207, 0.20387834891664317, -0.031267589533928074, -0.19376212111800103, 0.05808808152387674, 0.21856474059254774, 0.13197897290936797, -0.2148980325901239, 0.059188733373318696, -0.01118764524171884, 0.1551807142819303, -0.010328808640494841, 0.02836284491963483, 0.22013586234125132, 0.26169733973094134, 0.1024878595930499, 0.13996722678515455, -0.045981618429446036, -0.1136062878476632, -0.25720601947348865, -0.12126349730769524, -0.1645912629476673, -0.0008850559164342043, -0.008696790705446777, -0.13633894127938342, 0.40611684246844537, 0.20037215749333562, 0.17189208488923977, 0.005319244307749024, 0.3565538547480026, 0.04315003801870311, 0.013139118966284662, 0.03420792709771745, 0.20044616869386486, 0.13131504562664525, 0.15550339890241222, -0.16422562098218682, 0.07368300988093472, 0.03621923939696186]
|
1,803.05506
|
ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 - JCT3V-C0032: A human
visual system based 3D video quality metric
|
This contribution proposes a full-reference Human-Visual-System based 3D
video quality metric. In this report, the presented metric is used to evaluate
the quality of compressed stereo pair formed from a decoded view and a
synthesized view. The performance of the proposed metric is verified through a
series of subjective tests and compared with that of PSNR, SSIM, MS-SSIM, VIFp,
and VQM metrics. The experimental results show that HV3D has the highest
correlation with Mean Opinion Scores (MOS) compared to other tested metrics.
|
eess.IV
|
this contribution proposes a fullreference humanvisualsystem based 3d video quality metric in this report the presented metric is used to evaluate the quality of compressed stereo pair formed from a decoded view and a synthesized view the performance of the proposed metric is verified through a series of subjective tests and compared with that of psnr ssim msssim vifp and vqm metrics the experimental results show that hv3d has the highest correlation with mean opinion scores mos compared to other tested metrics
|
[['this', 'contribution', 'proposes', 'a', 'fullreference', 'humanvisualsystem', 'based', '3d', 'video', 'quality', 'metric', 'in', 'this', 'report', 'the', 'presented', 'metric', 'is', 'used', 'to', 'evaluate', 'the', 'quality', 'of', 'compressed', 'stereo', 'pair', 'formed', 'from', 'a', 'decoded', 'view', 'and', 'a', 'synthesized', 'view', 'the', 'performance', 'of', 'the', 'proposed', 'metric', 'is', 'verified', 'through', 'a', 'series', 'of', 'subjective', 'tests', 'and', 'compared', 'with', 'that', 'of', 'psnr', 'ssim', 'msssim', 'vifp', 'and', 'vqm', 'metrics', 'the', 'experimental', 'results', 'show', 'that', 'hv3d', 'has', 'the', 'highest', 'correlation', 'with', 'mean', 'opinion', 'scores', 'mos', 'compared', 'to', 'other', 'tested', 'metrics']]
|
[-0.08063363945818966, -0.0522960222391058, -0.11378117378423863, 0.04196408346201046, -0.028393208113708237, -0.12685705684832757, 0.03022534706735913, 0.4434392649350287, -0.18023292198290908, -0.3196463330259806, 0.035584179134862615, -0.3239138610071585, -0.18535098919344334, 0.1925648261993369, -0.1371358237406121, 0.10273366387568036, 0.1392122251747907, 0.10704239717201341, -0.13575328930127847, -0.30380230043319206, 0.2725231389108385, 0.11201829908863653, 0.4149817644229418, 0.04864570602208753, 0.14594528192206274, -0.06352228794506268, -0.06918033204171099, 0.09425729897486258, -0.08719904464466904, 0.16245238383925414, 0.2386702403921304, 0.19815340835035225, 0.26917529337202445, -0.3256107333906089, -0.20161134278095222, 0.004315858780512515, 0.08853442626828446, -0.022570958458287996, -0.10727292199949204, -0.3802187035826943, 0.15358575249585923, -0.15937400794340462, 0.03330434266996535, -0.07191100341704072, -0.06521304920787298, -0.0034742826077191137, -0.2866364153502863, 0.05319798651115992, -0.030697148643976338, 0.07637869045609914, -0.0734304308278274, -0.14345409378079296, 0.017893454743714274, 0.16491825579771702, 0.07397634836055245, 0.1129052212367518, 0.13762608116280428, -0.1182026313801106, -0.16902593519653583, 0.43706733318446556, -0.12417459229517233, -0.2236464838261563, 0.15746764051492174, -0.0885315822508139, -0.06203876029629307, 0.1097047610114081, 0.17199360512644996, 0.11057397631244568, -0.12859248347533278, -0.03161002933327698, -0.002722959209504667, 0.2227107515776695, 0.07913987063861723, 0.014025100813353364, 0.13863016806743284, 0.19240750808598875, -0.042710090433306334, 0.181266545003451, -0.12572543374911138, -0.017913889329986575, -0.20854566891565682, -0.16603721183712913, -0.20495286906326685, -0.014833751441085641, -0.13317443720964697, -0.1560686694552438, 0.41892846140869056, 0.20105215325904421, 0.20393458308204065, 0.10818023788683777, 0.3441732429628131, 0.04144311235271559, 0.04235739387642545, 0.039771130202408835, 0.27664727821380275, 0.0337936616697219, 0.09948667289123317, -0.1460566835542787, 0.09348532814485362, 0.07199936582930858]
|
1,803.05507
|
ISO/IEC JTC1/SC29/WG11 MPEG2014/ m34661: Quality Assessment of High
Dynamic Range (HDR) Video Content Using Existing Full-Reference Metrics
|
The main focus of this document is to evaluate the performance of the
existing LDR and HDR metrics on HDR video content which in turn will allow for
a better understanding of how well each of these metrics work and if they can
be applied in capturing, compressing, transmitting process of HDR data. To this
end a series of subjective tests is performed to evaluate the quality of
DML-HDR video database [1], when several different representing types of
artifacts are present using a HDR display. Then, the correlation between the
results from the existing LDR and HDR quality metrics and those from subjective
tests is measured to determine the most effective exiting quality metric for
HDR.
|
eess.IV
|
the main focus of this document is to evaluate the performance of the existing ldr and hdr metrics on hdr video content which in turn will allow for a better understanding of how well each of these metrics work and if they can be applied in capturing compressing transmitting process of hdr data to this end a series of subjective tests is performed to evaluate the quality of dmlhdr video database 1 when several different representing types of artifacts are present using a hdr display then the correlation between the results from the existing ldr and hdr quality metrics and those from subjective tests is measured to determine the most effective exiting quality metric for hdr
|
[['the', 'main', 'focus', 'of', 'this', 'document', 'is', 'to', 'evaluate', 'the', 'performance', 'of', 'the', 'existing', 'ldr', 'and', 'hdr', 'metrics', 'on', 'hdr', 'video', 'content', 'which', 'in', 'turn', 'will', 'allow', 'for', 'a', 'better', 'understanding', 'of', 'how', 'well', 'each', 'of', 'these', 'metrics', 'work', 'and', 'if', 'they', 'can', 'be', 'applied', 'in', 'capturing', 'compressing', 'transmitting', 'process', 'of', 'hdr', 'data', 'to', 'this', 'end', 'a', 'series', 'of', 'subjective', 'tests', 'is', 'performed', 'to', 'evaluate', 'the', 'quality', 'of', 'dmlhdr', 'video', 'database', '1', 'when', 'several', 'different', 'representing', 'types', 'of', 'artifacts', 'are', 'present', 'using', 'a', 'hdr', 'display', 'then', 'the', 'correlation', 'between', 'the', 'results', 'from', 'the', 'existing', 'ldr', 'and', 'hdr', 'quality', 'metrics', 'and', 'those', 'from', 'subjective', 'tests', 'is', 'measured', 'to', 'determine', 'the', 'most', 'effective', 'exiting', 'quality', 'metric', 'for', 'hdr']]
|
[-0.03906984911502703, 0.0005066531042203955, -0.0970500398710694, 0.059075776981167706, -0.050835655791604, -0.1211728736312817, 0.0008251650481606307, 0.43825049319345016, -0.21462232959001204, -0.33520230853363225, 0.10524542139154737, -0.28177883549512406, -0.14444679049370082, 0.21285192972939948, -0.16223392007459947, 0.0757930932900585, 0.07306305404104617, 0.07778834095427199, -0.07540682068438796, -0.2935517895156923, 0.34295998418339246, 0.06729766331289126, 0.34957888545063526, 0.05290602478806091, 0.08143155395114066, -0.02310696221564127, -0.0970753313244685, 0.038482185598948726, -0.09511280930803521, 0.149044406555755, 0.33591159053106345, 0.22906625276512427, 0.26686883946151835, -0.377294555614176, -0.19323474358281365, 0.03415620367893058, 0.11607792638647167, 0.05988182717549574, -0.02948392494075486, -0.3005332991845258, 0.13978606849989814, -0.12917969224812545, 0.02224602495603587, -0.0875528599338039, -0.029145037544810255, 0.0614702528251497, -0.2983961849372186, 0.030589449825524556, 0.004613536022320066, 0.04725933438166976, -0.07830107127235311, -0.09369392796703006, 0.025651013351086042, 0.24159552565821366, 0.07223241335039189, 0.06381804687578393, 0.13699678165190246, -0.1906715310982216, -0.08044424551417646, 0.45026528197138205, -0.056587035082402114, -0.2197692934281962, 0.19901143050874057, -0.09972206112402289, -0.08409156929296643, 0.1162859810759192, 0.2238523631559118, 0.12594061229863893, -0.17165208743017107, -0.008112748333698381, 0.027647214050850143, 0.1975845736613416, 0.1008699972632989, 0.03486092581373194, 0.1702229223922705, 0.19274004333875264, -0.013022384241871212, 0.1520522149765621, -0.10888580354942899, -0.010725627240279447, -0.22674349850934486, -0.15544930760870163, -0.1666149762540084, 0.0023643393251720976, -0.11439949915815226, -0.15483714768906, 0.44730070921713894, 0.24319301195361692, 0.20390071139225494, 0.07115848634857684, 0.37826005737094776, 0.01972823531731315, 0.05167823173308178, 0.014352189182587292, 0.17867666328244883, -0.018036299522804177, 0.13994679125835713, -0.11702334054381303, 0.06100223308186168, 0.028606556015818015]
|
1,803.05508
|
Dark matter constraints from dwarf galaxies: a data-driven analysis
|
Dwarf galaxies represent a powerful probe of annihilating dark matter
particle models, with gamma-ray data setting some of the best bounds available.
A major issue in improving over existing constraints consists in the limited
knowledge of the astrophysical background (mostly diffuse photons, but also
unresolved sources). Perhaps more worrisome, several approaches in the
literature suffer of the difficulty of assessing the systematic error due to
background mis-modelling. Here we propose a data-driven method to estimate the
background at the dwarf position and its uncertainty, relying on an appropriate
use of the whole-sky data, via an optimisation procedure of the interpolation
weights. While this article is mostly methodologically oriented, we also report
the bounds based on latest Fermi-LAT data and updated information for J-factors
for both isolated and stacked dwarfs. Our results are very competitive with the
Fermi-LAT ones, while being derived with a more general and flexible method. We
discuss the impact of profiling over the J-factor as well as over the
background probability distribution function, with the latter resulting for
instance crucial in drawing conclusions of compatibility with DM
interpretations of the so-called Galactic Centre Excess.
|
astro-ph.HE astro-ph.IM hep-ph
|
dwarf galaxies represent a powerful probe of annihilating dark matter particle models with gammaray data setting some of the best bounds available a major issue in improving over existing constraints consists in the limited knowledge of the astrophysical background mostly diffuse photons but also unresolved sources perhaps more worrisome several approaches in the literature suffer of the difficulty of assessing the systematic error due to background mismodelling here we propose a datadriven method to estimate the background at the dwarf position and its uncertainty relying on an appropriate use of the wholesky data via an optimisation procedure of the interpolation weights while this article is mostly methodologically oriented we also report the bounds based on latest fermilat data and updated information for jfactors for both isolated and stacked dwarfs our results are very competitive with the fermilat ones while being derived with a more general and flexible method we discuss the impact of profiling over the jfactor as well as over the background probability distribution function with the latter resulting for instance crucial in drawing conclusions of compatibility with dm interpretations of the socalled galactic centre excess
|
[['dwarf', 'galaxies', 'represent', 'a', 'powerful', 'probe', 'of', 'annihilating', 'dark', 'matter', 'particle', 'models', 'with', 'gammaray', 'data', 'setting', 'some', 'of', 'the', 'best', 'bounds', 'available', 'a', 'major', 'issue', 'in', 'improving', 'over', 'existing', 'constraints', 'consists', 'in', 'the', 'limited', 'knowledge', 'of', 'the', 'astrophysical', 'background', 'mostly', 'diffuse', 'photons', 'but', 'also', 'unresolved', 'sources', 'perhaps', 'more', 'worrisome', 'several', 'approaches', 'in', 'the', 'literature', 'suffer', 'of', 'the', 'difficulty', 'of', 'assessing', 'the', 'systematic', 'error', 'due', 'to', 'background', 'mismodelling', 'here', 'we', 'propose', 'a', 'datadriven', 'method', 'to', 'estimate', 'the', 'background', 'at', 'the', 'dwarf', 'position', 'and', 'its', 'uncertainty', 'relying', 'on', 'an', 'appropriate', 'use', 'of', 'the', 'wholesky', 'data', 'via', 'an', 'optimisation', 'procedure', 'of', 'the', 'interpolation', 'weights', 'while', 'this', 'article', 'is', 'mostly', 'methodologically', 'oriented', 'we', 'also', 'report', 'the', 'bounds', 'based', 'on', 'latest', 'fermilat', 'data', 'and', 'updated', 'information', 'for', 'jfactors', 'for', 'both', 'isolated', 'and', 'stacked', 'dwarfs', 'our', 'results', 'are', 'very', 'competitive', 'with', 'the', 'fermilat', 'ones', 'while', 'being', 'derived', 'with', 'a', 'more', 'general', 'and', 'flexible', 'method', 'we', 'discuss', 'the', 'impact', 'of', 'profiling', 'over', 'the', 'jfactor', 'as', 'well', 'as', 'over', 'the', 'background', 'probability', 'distribution', 'function', 'with', 'the', 'latter', 'resulting', 'for', 'instance', 'crucial', 'in', 'drawing', 'conclusions', 'of', 'compatibility', 'with', 'dm', 'interpretations', 'of', 'the', 'socalled', 'galactic', 'centre', 'excess']]
|
[-0.03458098961503549, 0.040336194561631296, -0.07537473200690897, 0.11877053465076627, -0.12551374068573357, -0.08953056061653766, 0.06922255648439501, 0.38176716371055913, -0.20698601635979777, -0.3806135094510441, 0.087556330843226, -0.2944070814341745, -0.05767853735768072, 0.2436312584506527, -0.05755568180889399, 0.03832781832275494, 0.07193849977967454, -0.011390088519509782, -0.05766338780696658, -0.2577120720957939, 0.32732405737951337, 0.12181600550299182, 0.24722151364010564, 0.012700105611394273, 0.0926674324737421, -0.01029289880877032, -0.13044081428891327, -0.027374819028166367, -0.12145146522060893, 0.14755332281154376, 0.23994317516413494, 0.13644320418794245, 0.219367127941503, -0.3922417313258916, -0.2205641327823019, 0.1360069436642446, 0.15442554036623493, 0.0921967000785199, -0.09275366507989186, -0.30641859714290437, 0.047049890187653626, -0.1663111748801355, -0.10553640035792866, -0.015079115792600946, -0.015829311787115937, 0.0256644836658074, -0.22389663853539393, 0.0898405033880272, 0.06032619263975567, 0.04243287275281341, -0.07325513403860225, -0.15857001276933314, 0.0244771439113958, 0.08611218144066313, 0.07804843127842057, 0.03811444102395525, 0.14585268270737306, -0.16653018778209938, -0.09855813237049064, 0.39549283268438146, -0.07598785738545386, -0.15992923618672805, 0.18246883603639621, -0.11433721004542023, -0.20121938909060336, 0.11037683718399528, 0.16348505935184707, 0.10205675820148623, -0.1779403776368674, 0.07378561149181967, -0.006956486484623529, 0.1565266135652963, 0.009748034266366518, 0.05108828519571842, 0.24143300029912337, 0.18250204248348859, 0.08743714442835214, 0.08684697859661585, -0.1730748986810406, -0.055635827618407054, -0.28121962925210037, -0.08649195191160312, -0.1607717686459761, 0.011028291319526812, -0.10139803437423957, -0.1445419476893581, 0.3573556738273106, 0.1628898665468323, 0.23019971026582045, 0.06733402932675327, 0.3682823460300099, 0.06450314351350049, 0.03904408706043334, 0.07684874498561761, 0.27239859745452394, 0.11662091989129941, 0.0701024359712168, -0.14771727641392624, 0.08980864095302388, -0.03032226138250195]
|
1,803.05509
|
Geometric momentum and angular momentum for charge-monopole system
|
For a charge-monopole pair, though the definition of the orbital angular
momentum is different from the usual one, and the transverse part of the
momentum that includes the vector potential as an additive term turns out to be
the so-called geometric momentum that is under intensive study recently. For
the charge is constrained on the spherical surface with monopole at the origin,
the commutation relations between all components of geometric momentum and the
orbital angular momentum satisfy the $so(3,1)$ algebra. With construction of
the geometrically infinitesimal displacement operator based on the geometric
momentum, the $so(3,1)$ algebra implies the Aharonov-Bohm phase shift. The
related problems such as charge and flux quantization are also addressed.
|
quant-ph hep-th
|
for a chargemonopole pair though the definition of the orbital angular momentum is different from the usual one and the transverse part of the momentum that includes the vector potential as an additive term turns out to be the socalled geometric momentum that is under intensive study recently for the charge is constrained on the spherical surface with monopole at the origin the commutation relations between all components of geometric momentum and the orbital angular momentum satisfy the so31 algebra with construction of the geometrically infinitesimal displacement operator based on the geometric momentum the so31 algebra implies the aharonovbohm phase shift the related problems such as charge and flux quantization are also addressed
|
[['for', 'a', 'chargemonopole', 'pair', 'though', 'the', 'definition', 'of', 'the', 'orbital', 'angular', 'momentum', 'is', 'different', 'from', 'the', 'usual', 'one', 'and', 'the', 'transverse', 'part', 'of', 'the', 'momentum', 'that', 'includes', 'the', 'vector', 'potential', 'as', 'an', 'additive', 'term', 'turns', 'out', 'to', 'be', 'the', 'socalled', 'geometric', 'momentum', 'that', 'is', 'under', 'intensive', 'study', 'recently', 'for', 'the', 'charge', 'is', 'constrained', 'on', 'the', 'spherical', 'surface', 'with', 'monopole', 'at', 'the', 'origin', 'the', 'commutation', 'relations', 'between', 'all', 'components', 'of', 'geometric', 'momentum', 'and', 'the', 'orbital', 'angular', 'momentum', 'satisfy', 'the', 'so31', 'algebra', 'with', 'construction', 'of', 'the', 'geometrically', 'infinitesimal', 'displacement', 'operator', 'based', 'on', 'the', 'geometric', 'momentum', 'the', 'so31', 'algebra', 'implies', 'the', 'aharonovbohm', 'phase', 'shift', 'the', 'related', 'problems', 'such', 'as', 'charge', 'and', 'flux', 'quantization', 'are', 'also', 'addressed']]
|
[-0.16864609874092637, 0.17195154103953741, -0.09568186847707338, 0.07802547334149414, -0.11677389042822858, -0.05719138248782374, -0.034426807912181966, 0.32396325267917286, -0.2909200864934684, -0.2677995760850938, 0.06310109734798955, -0.2462729986559237, -0.09522178071031792, 0.18373023095515978, -0.05493961554072154, 0.013108278278558127, 0.01992766063792252, 0.07028258976576009, -0.1462869430517168, -0.1571343402023864, 0.3931098133325577, 0.06126812123075391, 0.2604815972499154, 0.0445739462795519, 0.1617670442488671, 0.0678084187654663, -0.0295438785888914, 0.008713359524190953, -0.10453677650160399, 0.04854968786898967, 0.16487272288979946, 0.0029232607828865273, 0.17824206075968996, -0.3868988970772619, -0.13975670295576895, 0.10435199587342156, 0.11126001572763894, 0.06971981326546685, -0.012650870683034304, -0.23751603492197737, 0.03009887054908724, -0.16468054010013564, -0.147059906125728, -0.09876456815106548, 0.05414917798037023, 0.008535076590024133, -0.23298262427272523, 0.10826924982026376, 0.10352877672530908, 0.051219840072491, -0.0939325032739249, -0.13090219647021947, -0.1329026825734274, 0.06016547457867228, 0.08925747080392872, 0.08114586977506534, 0.12109435901078766, -0.08025483449558372, -0.10408292485728646, 0.3874291158652147, 0.02777592144469706, -0.28571228816511884, 0.10597798498234078, -0.1500545551493533, -0.10663859680525761, 0.1143676922326924, 0.1000389957108197, 0.09065866796068014, -0.1228698320373629, 0.1337528280750024, -0.04028410308755341, 0.09754424014713912, 0.058915322454877, 0.10684733756197683, 0.2661294291636585, 0.0685017781777192, 0.08111265491001644, 0.11314342919205506, -0.11036823944608985, -0.15615775758004954, -0.347709637124965, -0.1645762640099449, -0.20359377570726406, 0.07241957874111501, -0.08891582695431946, -0.13221417300699823, 0.3920510815604862, 0.08231159974614867, 0.22432328297074605, 0.00033923806446198524, 0.2920597107932631, 0.15849496246793562, 0.12663573181602808, 0.0573858841141043, 0.2555406446552184, 0.19350519905740446, 0.11872173746042283, -0.2890000664402393, -0.03052901392967432, 0.12535203983430313]
|
1,803.0551
|
On the Approximation of Constrained Linear Quadratic Regulator Problems
and their Application to Model Predictive Control - Supplementary Notes
|
By parametrizing input and state trajectories with basis functions different
approximations to the constrained linear quadratic regulator problem are
obtained. These notes present and discuss technical results that are intended
to supplement a corresponding journal article. The results can be applied in a
model predictive control context.
|
cs.SY
|
by parametrizing input and state trajectories with basis functions different approximations to the constrained linear quadratic regulator problem are obtained these notes present and discuss technical results that are intended to supplement a corresponding journal article the results can be applied in a model predictive control context
|
[['by', 'parametrizing', 'input', 'and', 'state', 'trajectories', 'with', 'basis', 'functions', 'different', 'approximations', 'to', 'the', 'constrained', 'linear', 'quadratic', 'regulator', 'problem', 'are', 'obtained', 'these', 'notes', 'present', 'and', 'discuss', 'technical', 'results', 'that', 'are', 'intended', 'to', 'supplement', 'a', 'corresponding', 'journal', 'article', 'the', 'results', 'can', 'be', 'applied', 'in', 'a', 'model', 'predictive', 'control', 'context']]
|
[-0.068851503186879, 0.0561786661236646, -0.09389058709085146, 0.08284192548153248, -0.09342474140662779, -0.14628007415523556, -0.0001187416219568633, 0.3396466266601644, -0.2864065068337987, -0.32175913191539174, 0.14365468571424495, -0.23237955624713225, -0.17988741354263843, 0.24354264764808753, -0.11472412848726232, 0.09343377350175634, 0.0954114744697321, -0.022271081250398717, -0.07578707374929589, -0.2912296302656227, 0.31257373452226217, 0.05143541587080727, 0.24498839670435546, 0.004213310728602587, 0.08606563754221226, -0.011280813492200475, -0.08616037612305359, 0.044914628052093244, -0.14178758465385863, 0.17034596044748546, 0.3591461443203561, 0.11853237957396406, 0.28785598793245376, -0.43843691138193963, -0.1821154303293913, 0.054782287357622715, 0.10048738643130724, 0.12284328396174501, -0.0037831234884388902, -0.26107486147195735, 0.07831328203951186, -0.15670370310544968, -0.13480899470085475, -0.13302825583501698, -0.06340551379315079, 0.0689769127465626, -0.27892753555181815, 0.03374791919610443, -6.95914099428882e-05, 0.05216259798629487, -0.10911827827704713, -0.18145473307355287, -0.0063086821638206215, 0.1044398719603394, 0.029183650267944533, 0.06030874528941956, 0.12907056533236136, -0.09872198486304347, -0.1614258028195299, 0.3834594511724216, -0.06680604086277332, -0.27171058362310235, 0.15646498103408105, -0.06507642599853113, -0.11430759247927431, 0.05795344801500757, 0.24995310497569276, 0.0779287817471839, -0.19585287071605947, 0.0978743506352754, -0.039242645595879096, 0.13984285241508104, 0.017251177690923214, 0.008642998048441207, 0.1498352980954533, 0.06998728425737391, 0.003694453732447421, 0.14988569425607218, 0.04012586350770707, -0.12604067678702005, -0.3779007254287283, -0.05337210376053415, -0.12640504808501996, 0.006425015675399373, -0.018619989579360178, -0.099886762156607, 0.4196458576207465, 0.14447600072487554, 0.19034383759061071, 0.08013905905821223, 0.25498168059486026, 0.1785269707758376, -0.00804838347942271, 0.035784267602448766, 0.18615156412124634, 0.10614951145637067, 0.05218090941297247, -0.14034726403336575, 0.034691388342291754, 0.09958155474506636]
|
1,803.05511
|
Thermal Behavior of a Single Magnetic Vortex Studied with
Magnetotransport
|
Spin textures such as skyrmions and magnetic vortices are good candidates for
a variety of applications, such as magnetic memories, oscillators and
neuromorphic computing. Understanding the magnetic process of these systems is
important, as it determines the system's response in field and frequency. In
this work, we investigated the magnetization process of single microdisks by
measuring their magnetotransport properties as a function of temperature. The
strong dependence of resistance on the disks magnetic state helped us
understand the magnetization configurations of a single microdisk for different
temperatures and fields. We determined the thermal barriers for the nucleation
and annihilation processes by fitting the nucleation and annihilation fields to
an exponential model. Moreover, we observed and characterized the domain wall
depinning effect for temperatures below 100 K. This effect prevents the
formation of a magnetic vortex during the nucleation process.
|
cond-mat.mes-hall
|
spin textures such as skyrmions and magnetic vortices are good candidates for a variety of applications such as magnetic memories oscillators and neuromorphic computing understanding the magnetic process of these systems is important as it determines the systems response in field and frequency in this work we investigated the magnetization process of single microdisks by measuring their magnetotransport properties as a function of temperature the strong dependence of resistance on the disks magnetic state helped us understand the magnetization configurations of a single microdisk for different temperatures and fields we determined the thermal barriers for the nucleation and annihilation processes by fitting the nucleation and annihilation fields to an exponential model moreover we observed and characterized the domain wall depinning effect for temperatures below 100 k this effect prevents the formation of a magnetic vortex during the nucleation process
|
[['spin', 'textures', 'such', 'as', 'skyrmions', 'and', 'magnetic', 'vortices', 'are', 'good', 'candidates', 'for', 'a', 'variety', 'of', 'applications', 'such', 'as', 'magnetic', 'memories', 'oscillators', 'and', 'neuromorphic', 'computing', 'understanding', 'the', 'magnetic', 'process', 'of', 'these', 'systems', 'is', 'important', 'as', 'it', 'determines', 'the', 'systems', 'response', 'in', 'field', 'and', 'frequency', 'in', 'this', 'work', 'we', 'investigated', 'the', 'magnetization', 'process', 'of', 'single', 'microdisks', 'by', 'measuring', 'their', 'magnetotransport', 'properties', 'as', 'a', 'function', 'of', 'temperature', 'the', 'strong', 'dependence', 'of', 'resistance', 'on', 'the', 'disks', 'magnetic', 'state', 'helped', 'us', 'understand', 'the', 'magnetization', 'configurations', 'of', 'a', 'single', 'microdisk', 'for', 'different', 'temperatures', 'and', 'fields', 'we', 'determined', 'the', 'thermal', 'barriers', 'for', 'the', 'nucleation', 'and', 'annihilation', 'processes', 'by', 'fitting', 'the', 'nucleation', 'and', 'annihilation', 'fields', 'to', 'an', 'exponential', 'model', 'moreover', 'we', 'observed', 'and', 'characterized', 'the', 'domain', 'wall', 'depinning', 'effect', 'for', 'temperatures', 'below', '100', 'k', 'this', 'effect', 'prevents', 'the', 'formation', 'of', 'a', 'magnetic', 'vortex', 'during', 'the', 'nucleation', 'process']]
|
[-0.15556556468816113, 0.19764312433521514, -0.045574520391298175, 0.0388059240433662, -0.058033209763092106, -0.06941403762819312, 0.06707863699102092, 0.3984628345736926, -0.27460725942841, -0.3350740657422504, 0.05585892428308993, -0.23516251096877155, -0.10104873075598864, 0.23496093031977094, 0.061639676691307654, 0.041071242803587114, -0.03769308792279779, -0.0024560167053848396, -0.015942297296317146, -0.19398883796839728, 0.2930520935982412, 0.03485674582582583, 0.329861811033899, 0.0820444059732417, 0.08383926324187878, -0.01965360702249965, 0.08126552087395526, 0.030806052176911625, -0.17802152377318778, 0.02378633069276488, 0.18884929752131427, -0.02865089815471777, 0.19192305793516712, -0.4678612122808, -0.22424658249206036, 0.08319526768738417, 0.15579040031109623, 0.13858527386068575, -0.0759943415588371, -0.2582796586128019, 0.057526383776780515, -0.10723033331823703, -0.12591979180645552, -0.10494087651211152, 0.048988641344392736, 0.02877153748338171, -0.2744123428430167, 0.07723963713581614, 0.09473579787153402, 0.09438258478846803, -0.12162099867094335, -0.08353064008887938, -0.0490403184432724, 0.09845870040464315, 0.03905937858549845, 0.027125978895978963, 0.24966623862910506, -0.19919048538833534, -0.16289790569663906, 0.3389606095662863, -0.039400849085997974, -0.09239615798528346, 0.18911585137717052, -0.1692298855163532, -0.06445931313934622, 0.14446957568510724, 0.1600663500281868, 0.13021150237726545, -0.14521726844882551, 0.040481917714623054, 0.05560675682835013, 0.11017130327280343, 0.07183853432656728, 0.056858136975239934, 0.3080927158786292, 0.23272767143739428, -0.00786848175557156, 0.15644681788377945, -0.14120172157970745, -0.07163722139093087, -0.23959328589974332, -0.17115096357590753, -0.20270120818837942, 0.07439828028051491, -0.0875178992895036, -0.18998948824692438, 0.3825517151062544, 0.1440736491755723, 0.20402649233579173, -0.04033424622017435, 0.27055648947469624, 0.10746655594926033, 0.09282768660278576, 0.03519931573875327, 0.22011918182277102, 0.20851750741377742, 0.16926321445582368, -0.28703594584647807, 0.07246675394247655, -0.03905467947831096]
|
1,803.05512
|
$\Lambda\Lambda$ pairing in multi-strange hypernuclei
|
Multi-strange Ca, Sn and Pb hypernuclei with $\Lambda\Lambda$ pairing
interaction are investigated within the Hartree-Fock-Bogoliubov approach. The
unknown $\Lambda\Lambda$ pairing strength is calibrated to match with the
maximal value for the prediction of the $\Lambda$ pairing gap in uniform matter
for densities and isospin asymmetries equivalent to those existing in
multi-$\Lambda$ hypernuclei. In this way, we provide an upper bound for the
prediction of the $\Lambda$ pairing gap and its effects in hypernuclei. The
condensation energy is predicted to be about 3~MeV as a maximum value, yielding
small corrections on density distributions and shell structure. In addition,
conditions on both Fermi energies and orbital angular momenta are expected to
quench the nucleon-$\Lambda$ pairing for most of hypernuclei.
|
nucl-th
|
multistrange ca sn and pb hypernuclei with lambdalambda pairing interaction are investigated within the hartreefockbogoliubov approach the unknown lambdalambda pairing strength is calibrated to match with the maximal value for the prediction of the lambda pairing gap in uniform matter for densities and isospin asymmetries equivalent to those existing in multilambda hypernuclei in this way we provide an upper bound for the prediction of the lambda pairing gap and its effects in hypernuclei the condensation energy is predicted to be about 3mev as a maximum value yielding small corrections on density distributions and shell structure in addition conditions on both fermi energies and orbital angular momenta are expected to quench the nucleonlambda pairing for most of hypernuclei
|
[['multistrange', 'ca', 'sn', 'and', 'pb', 'hypernuclei', 'with', 'lambdalambda', 'pairing', 'interaction', 'are', 'investigated', 'within', 'the', 'hartreefockbogoliubov', 'approach', 'the', 'unknown', 'lambdalambda', 'pairing', 'strength', 'is', 'calibrated', 'to', 'match', 'with', 'the', 'maximal', 'value', 'for', 'the', 'prediction', 'of', 'the', 'lambda', 'pairing', 'gap', 'in', 'uniform', 'matter', 'for', 'densities', 'and', 'isospin', 'asymmetries', 'equivalent', 'to', 'those', 'existing', 'in', 'multilambda', 'hypernuclei', 'in', 'this', 'way', 'we', 'provide', 'an', 'upper', 'bound', 'for', 'the', 'prediction', 'of', 'the', 'lambda', 'pairing', 'gap', 'and', 'its', 'effects', 'in', 'hypernuclei', 'the', 'condensation', 'energy', 'is', 'predicted', 'to', 'be', 'about', '3mev', 'as', 'a', 'maximum', 'value', 'yielding', 'small', 'corrections', 'on', 'density', 'distributions', 'and', 'shell', 'structure', 'in', 'addition', 'conditions', 'on', 'both', 'fermi', 'energies', 'and', 'orbital', 'angular', 'momenta', 'are', 'expected', 'to', 'quench', 'the', 'nucleonlambda', 'pairing', 'for', 'most', 'of', 'hypernuclei']]
|
[-0.09897503627734816, 0.1800223591422282, -0.09197052208006255, 0.18890049361572084, -0.028643031761798467, -0.13237528051607883, 0.049724622772863276, 0.3883163996725383, -0.18879350751706073, -0.29372559821145594, -0.06694729522797956, -0.3138880904636577, 0.051984339681828126, 0.12220864882692695, 0.05495080698687488, 0.02763357465244973, 0.032058770426063456, 0.06293801629530768, -0.10564861534975278, -0.20057243621175808, 0.3527395385516505, 0.0816155438665619, 0.23290748737203196, 0.14132252366194487, -0.04097899796270057, 0.006477396017831997, 0.08202040304119389, -0.013609384425366536, -0.21011539073024169, 0.10477894059935601, 0.2597266226160165, 0.031554343905717805, 0.1600974587421132, -0.3519428695878412, -0.17203184639891753, 0.09739078294772369, 0.14074916024911258, 0.14133496350473446, -0.00896813129632073, -0.302700341018474, 0.06457081854216054, -0.22639897386503652, -0.15704048220386618, -0.07592516750670396, 0.06536736781509896, 0.05779097454510947, -0.2781832835136547, 0.07963720475060818, -0.01891226667520773, 0.06300676537008008, -0.1257761740951568, -0.22784813341976176, -0.056761793688767485, 0.012617662079377562, 0.08216449746893895, 0.03865729280524593, 0.10530152360900727, -0.16169981637762654, -0.01489667726569196, 0.39357514224118656, -0.05925582269103163, -0.1338883220640003, 0.10814002697539125, -0.12216554746095441, -0.08330233636984809, 0.14536124383075497, 0.09967316994314185, 0.06872425604070354, -0.10651249940453383, 0.0876647745926753, -0.026202294011361513, 0.2007992010499932, 0.04335454423338748, 0.1200996659314021, 0.18303149645654565, 0.19063782930358225, 0.05550120550438634, 0.017492417692859523, -0.1567040314225273, -0.11499763424229673, -0.3307638731267717, -0.0919116761870722, -0.14972956832020712, 0.022901684290562302, -0.056592959034406885, -0.11040013813827601, 0.3282987440450706, 0.08822564613750666, 0.233812267283121, 0.013531606524991684, 0.22792276241378778, 0.1173764802943358, 0.065659130203068, 0.06438540382326668, 0.2902073232918723, 0.20760947642609096, 0.06139056067356569, -0.3165899760718656, 0.06067604724413309, 0.05320345252776184]
|
1,803.05513
|
Limitations of P-Values and $R^2$ for Stepwise Regression Building: A
Fairness Demonstration in Health Policy Risk Adjustment
|
Stepwise regression building procedures are commonly used applied statistical
tools, despite their well-known drawbacks. While many of their limitations have
been widely discussed in the literature, other aspects of the use of individual
statistical fit measures, especially in high-dimensional stepwise regression
settings, have not. Giving primacy to individual fit, as is done with p-values
and $R^2$, when group fit may be the larger concern, can lead to misguided
decision making. One of the most consequential uses of stepwise regression is
in health care, where these tools allocate hundreds of billions of dollars to
health plans enrolling individuals with different predicted health care costs.
The main goal of this "risk adjustment" system is to convey incentives to
health plans such that they provide health care services fairly, a component of
which is not to discriminate in access or care for persons or groups likely to
be expensive. We address some specific limitations of p-values and $R^2$ for
high-dimensional stepwise regression in this policy problem through an
illustrated example by additionally considering a group-level fairness metric.
|
econ.EM cs.CY
|
stepwise regression building procedures are commonly used applied statistical tools despite their wellknown drawbacks while many of their limitations have been widely discussed in the literature other aspects of the use of individual statistical fit measures especially in highdimensional stepwise regression settings have not giving primacy to individual fit as is done with pvalues and r2 when group fit may be the larger concern can lead to misguided decision making one of the most consequential uses of stepwise regression is in health care where these tools allocate hundreds of billions of dollars to health plans enrolling individuals with different predicted health care costs the main goal of this risk adjustment system is to convey incentives to health plans such that they provide health care services fairly a component of which is not to discriminate in access or care for persons or groups likely to be expensive we address some specific limitations of pvalues and r2 for highdimensional stepwise regression in this policy problem through an illustrated example by additionally considering a grouplevel fairness metric
|
[['stepwise', 'regression', 'building', 'procedures', 'are', 'commonly', 'used', 'applied', 'statistical', 'tools', 'despite', 'their', 'wellknown', 'drawbacks', 'while', 'many', 'of', 'their', 'limitations', 'have', 'been', 'widely', 'discussed', 'in', 'the', 'literature', 'other', 'aspects', 'of', 'the', 'use', 'of', 'individual', 'statistical', 'fit', 'measures', 'especially', 'in', 'highdimensional', 'stepwise', 'regression', 'settings', 'have', 'not', 'giving', 'primacy', 'to', 'individual', 'fit', 'as', 'is', 'done', 'with', 'pvalues', 'and', 'r2', 'when', 'group', 'fit', 'may', 'be', 'the', 'larger', 'concern', 'can', 'lead', 'to', 'misguided', 'decision', 'making', 'one', 'of', 'the', 'most', 'consequential', 'uses', 'of', 'stepwise', 'regression', 'is', 'in', 'health', 'care', 'where', 'these', 'tools', 'allocate', 'hundreds', 'of', 'billions', 'of', 'dollars', 'to', 'health', 'plans', 'enrolling', 'individuals', 'with', 'different', 'predicted', 'health', 'care', 'costs', 'the', 'main', 'goal', 'of', 'this', 'risk', 'adjustment', 'system', 'is', 'to', 'convey', 'incentives', 'to', 'health', 'plans', 'such', 'that', 'they', 'provide', 'health', 'care', 'services', 'fairly', 'a', 'component', 'of', 'which', 'is', 'not', 'to', 'discriminate', 'in', 'access', 'or', 'care', 'for', 'persons', 'or', 'groups', 'likely', 'to', 'be', 'expensive', 'we', 'address', 'some', 'specific', 'limitations', 'of', 'pvalues', 'and', 'r2', 'for', 'highdimensional', 'stepwise', 'regression', 'in', 'this', 'policy', 'problem', 'through', 'an', 'illustrated', 'example', 'by', 'additionally', 'considering', 'a', 'grouplevel', 'fairness', 'metric']]
|
[-0.03516792408832959, 0.02275968089389639, -0.07982887877365467, 0.13824764472812456, -0.13876543339507805, -0.20243361658127657, 0.0765315580112196, 0.43522118849829694, -0.26061498751427614, -0.3166564970127382, 0.16851783272657736, -0.2834198156200435, -0.10917892940502999, 0.21261669793460602, -0.194182657323585, 0.08987252410279116, 0.06301889794439762, 0.04425690843922423, 0.010802857605231947, -0.32410721102964946, 0.26472617932541787, 0.05164408052993146, 0.3025995773108055, 0.017259591596265292, 0.022241901691960192, 0.024282986308908325, -0.06639063513794935, 0.015432763475410897, -0.05221012006093107, 0.13891119028685142, 0.40227262810910996, 0.21023319865410997, 0.4237085757616522, -0.43726793280267423, -0.2162125788972112, 0.13954425737898712, 0.12465977202766393, 0.05271813224789676, 0.0025104076986939743, -0.2615086817043437, 0.03478213502950538, -0.19983970069282303, -0.11513186913353643, -0.1316765290845571, -0.03871184097597611, -0.0016264172980759892, -0.2849494189655558, 0.06688917738160696, 0.002192028118404506, 0.1118599131168803, -0.03120696980736336, -0.1614789502372719, -0.007993636808047691, 0.1890329094464829, 0.15369289233509836, -0.007676187172082478, 0.16401766207679336, -0.11001590623094797, -0.14444886820508573, 0.4155067935232715, 0.05684757391499334, -0.21494026883002157, 0.18260395855324385, -0.08786932084356146, -0.1961661604468593, 0.07260629166608099, 0.2211644721335207, 0.04648482581418564, -0.22284472664597715, -0.010659574470134858, 0.03327887632680693, 0.1342612072014539, 0.04793621845350697, -0.0010286452136291512, 0.18835937023302005, 0.16845845932478148, 0.05288072593808549, 0.07863974152567754, -0.033860302171616376, -0.08754349652485087, -0.21350534508826383, -0.12314897847071493, -0.131042420112089, 0.01619270968136522, -0.10326094237599795, -0.16724413128746352, 0.3571530744197896, 0.19240868227476396, 0.15369605875457637, 0.03867910144617781, 0.30166091531215383, 0.05546509195988912, 0.11732644693465667, 0.04052282932439241, 0.18336248606655495, 0.045113497516729106, 0.05819313700348353, -0.15288702961212644, 0.17940498017384832, -0.03999016370126528]
|
1,803.05514
|
Dynamical screening function and plasmons in the wide HgTe quantum wells
at high temperatures
|
Dynamical screening function of the two-dimensional electron gas in wide HgTe
quantum well (QW) has been numerically modelled in this work. Calculations were
provided in the Random Phase Approximation (RPA) framework and were based on
Lindhard equation. Our simulations directly incorporated non-parabolicity of
bulk 2D carriers spectrum, which was obtained by full 8-band k.p method. In the
literature exists data that transport properties of HgTe QWs are explained by
graphene-like screening. We provide the comparison of the screening function
for the Schrodinger fermions in the inverted bands HgTe QW with the appropriate
screening function for graphene monolayer with the Dirac fermions. In addition,
the dependencies of HgTe-specific screening function on temperature, scattering
wave-vector and frequency are studied with the purpose to study the transport
properties under high-frequency radiation the QWs structures to be used as THz
detectors. Plasmon frequencies of 2DEG in HgTe quantum well under study were
calculated in the long-wavelength limit for T=77K.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
dynamical screening function of the twodimensional electron gas in wide hgte quantum well qw has been numerically modelled in this work calculations were provided in the random phase approximation rpa framework and were based on lindhard equation our simulations directly incorporated nonparabolicity of bulk 2d carriers spectrum which was obtained by full 8band kp method in the literature exists data that transport properties of hgte qws are explained by graphenelike screening we provide the comparison of the screening function for the schrodinger fermions in the inverted bands hgte qw with the appropriate screening function for graphene monolayer with the dirac fermions in addition the dependencies of hgtespecific screening function on temperature scattering wavevector and frequency are studied with the purpose to study the transport properties under highfrequency radiation the qws structures to be used as thz detectors plasmon frequencies of 2deg in hgte quantum well under study were calculated in the longwavelength limit for t77k
|
[['dynamical', 'screening', 'function', 'of', 'the', 'twodimensional', 'electron', 'gas', 'in', 'wide', 'hgte', 'quantum', 'well', 'qw', 'has', 'been', 'numerically', 'modelled', 'in', 'this', 'work', 'calculations', 'were', 'provided', 'in', 'the', 'random', 'phase', 'approximation', 'rpa', 'framework', 'and', 'were', 'based', 'on', 'lindhard', 'equation', 'our', 'simulations', 'directly', 'incorporated', 'nonparabolicity', 'of', 'bulk', '2d', 'carriers', 'spectrum', 'which', 'was', 'obtained', 'by', 'full', '8band', 'kp', 'method', 'in', 'the', 'literature', 'exists', 'data', 'that', 'transport', 'properties', 'of', 'hgte', 'qws', 'are', 'explained', 'by', 'graphenelike', 'screening', 'we', 'provide', 'the', 'comparison', 'of', 'the', 'screening', 'function', 'for', 'the', 'schrodinger', 'fermions', 'in', 'the', 'inverted', 'bands', 'hgte', 'qw', 'with', 'the', 'appropriate', 'screening', 'function', 'for', 'graphene', 'monolayer', 'with', 'the', 'dirac', 'fermions', 'in', 'addition', 'the', 'dependencies', 'of', 'hgtespecific', 'screening', 'function', 'on', 'temperature', 'scattering', 'wavevector', 'and', 'frequency', 'are', 'studied', 'with', 'the', 'purpose', 'to', 'study', 'the', 'transport', 'properties', 'under', 'highfrequency', 'radiation', 'the', 'qws', 'structures', 'to', 'be', 'used', 'as', 'thz', 'detectors', 'plasmon', 'frequencies', 'of', '2deg', 'in', 'hgte', 'quantum', 'well', 'under', 'study', 'were', 'calculated', 'in', 'the', 'longwavelength', 'limit', 'for', 't77k']]
|
[-0.10120885417677232, 0.15385294758621, -0.06126542795863753, 0.0714407262729493, 0.016507837525266526, -0.1546286723444952, 0.030020244466443243, 0.4302681465088934, -0.2271136442110904, -0.2908532403185722, -0.012672049610258697, -0.30783967129499107, -0.15856105287244857, 0.2003360413522883, 0.053051664339009576, 0.12569410827422103, -0.01565982237028853, -0.10736955172369445, -0.08859361267449069, -0.18825864897853417, 0.27630268005106534, 0.045772506929510695, 0.3147408552830676, 0.0884114999918255, 0.012049839939988618, 0.04684206910692942, 0.08623993455117883, 0.021068669810238017, -0.16756538729140477, 0.013507747200208826, 0.2505850151495694, -0.12006092127624222, 0.18514146113304447, -0.437865979413127, -0.2814284950168199, -0.05391328938474709, 0.14145602815476088, 0.1368907336379982, -0.0891020913115497, -0.30162178481287966, 0.06067189778724395, -0.13802268217898325, -0.10470236799613174, -0.04954457086550265, -0.043626954972550466, -0.0007338993434262063, -0.23261644358008907, 0.11695460752506934, -0.014588791604324655, 0.05307835792360469, -0.1254263072026676, -0.1481852576835081, -0.04469396469225599, 0.0887612628080737, 0.03187276176842196, -0.010042521096433379, 0.1659064781549689, -0.09454118089399652, -0.1194201190819867, 0.4199922101499585, -0.10704174925279863, -0.16751514929165315, 0.1430998238532308, -0.21138171934335215, -0.012498467498422637, 0.11555500707722136, 0.13373011516032185, 0.10216422346964865, -0.18536576798545534, 0.16134284134552052, -0.0623873630992149, 0.12827213357547418, 0.05998113591151385, 0.10891847861567874, 0.21901400219165273, 0.1724942574011428, -0.014676202998750588, 0.13033692945057962, -0.11780408365264922, -0.06163902639550484, -0.230702250600224, -0.14727468441872457, -0.2534026728561995, 0.06849026206923141, -0.042072476259570314, -0.2367363780836708, 0.4495159452418228, 0.1386325142434012, 0.14306164113199943, -0.015116316930832365, 0.23781144196491133, 0.19347263929772784, 0.0910708053255236, 0.006606448550599736, 0.26999776686130506, 0.2039369190559275, 0.09448692046238907, -0.26647418162894326, 0.025634337490267278, 0.039898595727327]
|
1,803.05515
|
Sphericality and Smoothness of Schubert Varieties
|
We consider the action of the Levi subgroup of a parabolic subgroup that
stabilizes a Schubert variety. We show that a smooth Schubert variety is a
homogeneous space for a parabolic subgroup, or it has a smooth Schubert
divisor. Further, we show that all smooth Schubert varieties in a (partial)
flag variety of a rank two simple algebraic group are spherical.
|
math.AG math.RT
|
we consider the action of the levi subgroup of a parabolic subgroup that stabilizes a schubert variety we show that a smooth schubert variety is a homogeneous space for a parabolic subgroup or it has a smooth schubert divisor further we show that all smooth schubert varieties in a partial flag variety of a rank two simple algebraic group are spherical
|
[['we', 'consider', 'the', 'action', 'of', 'the', 'levi', 'subgroup', 'of', 'a', 'parabolic', 'subgroup', 'that', 'stabilizes', 'a', 'schubert', 'variety', 'we', 'show', 'that', 'a', 'smooth', 'schubert', 'variety', 'is', 'a', 'homogeneous', 'space', 'for', 'a', 'parabolic', 'subgroup', 'or', 'it', 'has', 'a', 'smooth', 'schubert', 'divisor', 'further', 'we', 'show', 'that', 'all', 'smooth', 'schubert', 'varieties', 'in', 'a', 'partial', 'flag', 'variety', 'of', 'a', 'rank', 'two', 'simple', 'algebraic', 'group', 'are', 'spherical']]
|
[-0.24713515078068757, -0.026301817174573413, -0.10726089393872706, -0.0064105850503184516, -0.1983057478992421, -0.16981356340597886, 0.008109959544705564, 0.3795767104039427, -0.37787422163747864, -0.1058280570279868, 0.1255581910267747, -0.14728296268731356, -0.18285845912092166, 0.22963173508445625, -0.21719119718515878, -0.03070433866843337, 0.0876204188546685, 0.06213521244019636, -0.14009702570934887, -0.2864507878328994, 0.4782449473611644, -0.22085594207995007, 0.2525342468508199, -0.0015501547910150935, 0.1420023961023229, -0.07266234336268218, 0.06914943224582516, 0.03160530485195627, -0.06780260217890857, 0.1370194163326113, 0.3445407263171233, 0.04967558893878929, 0.2624264508791146, -0.35487930775910126, -0.1840354472276617, 0.27592843940451006, 0.13187883308035184, 0.07453685015684268, -0.07727456093597852, -0.21188343087302858, 0.10243257259201931, -0.23250931443371733, -0.22715099186438029, -0.08407465803635414, 0.09573849098428656, 0.003659613552640696, -0.27028732725464905, -0.055401623142180875, 0.07183771640001262, 0.16864654330582526, -0.0360754582740855, -0.12209596306077952, -0.05528423370274364, 0.02252483302651004, -0.06606754716905597, 0.05094071004356517, 0.1084093944566538, -0.0877883659797858, -0.1036177517724086, 0.4492696441832136, -0.07191707972498214, -0.29331161069576855, 0.11656929300639962, -0.2064154277723588, -0.15672787192628765, 0.19752718697561591, 0.1403011584226958, 0.17204330695962886, 0.04076896688794015, 0.1858505357942376, -0.2548251254636733, -0.011364304117064496, 0.07981801355929403, -0.13233138299470798, 0.08109173131915817, 0.13138102885091402, 0.05376423376261211, 0.07847395817153767, -0.004753801506012678, -0.0023327283026864294, -0.38580849901085995, -0.2507946763080774, -0.047785518173754336, 0.20997293040797602, -0.14647596737715324, -0.21831036224717, 0.4439812229839383, -0.05956332052706695, 0.1875077357103468, 0.12693188333364783, 0.16574118952037858, -0.021370699018484256, 0.013895187221589635, 0.05487911876760515, 0.10153221635178464, 0.21139145657786582, -0.1455559469225099, -0.17345991139452843, -0.017363047295967576, 0.20136261983301307]
|
1,803.05516
|
Translation operator with exceptional Laguerre polynomials
|
We extend the notion of general translation operator to exceptional Laguerre
polynomials. To this we investigate the associated singular hyperbolic Cauchy
problem. We derive a maximum principle with respect to this Cauchy problem and
applying it we determine the norm of the translation operator. As an
application we give Nikol'skii inequalities with respect to exceptional
Laguerre polynomials.
|
math.CA
|
we extend the notion of general translation operator to exceptional laguerre polynomials to this we investigate the associated singular hyperbolic cauchy problem we derive a maximum principle with respect to this cauchy problem and applying it we determine the norm of the translation operator as an application we give nikolskii inequalities with respect to exceptional laguerre polynomials
|
[['we', 'extend', 'the', 'notion', 'of', 'general', 'translation', 'operator', 'to', 'exceptional', 'laguerre', 'polynomials', 'to', 'this', 'we', 'investigate', 'the', 'associated', 'singular', 'hyperbolic', 'cauchy', 'problem', 'we', 'derive', 'a', 'maximum', 'principle', 'with', 'respect', 'to', 'this', 'cauchy', 'problem', 'and', 'applying', 'it', 'we', 'determine', 'the', 'norm', 'of', 'the', 'translation', 'operator', 'as', 'an', 'application', 'we', 'give', 'nikolskii', 'inequalities', 'with', 'respect', 'to', 'exceptional', 'laguerre', 'polynomials']]
|
[-0.12400702911576159, 0.032593351619557086, -0.058827516153605916, 0.10481332184076962, -0.13796726800501347, -0.11948886468777792, -0.0072805657329266535, 0.3403306933152571, -0.3735335305815138, -0.16355718276259212, 0.14463611874369936, -0.30328275331933247, -0.17915763271351656, 0.15457254227071085, -0.17447492869146036, 0.12439135166309905, 0.046861170684886086, 0.05444199037166279, -0.18801696034834572, -0.2289234417768424, 0.410223656186932, 0.02104691553272699, 0.2296423239126932, 0.04401520934576789, 0.12926591323329167, 0.007865801249352987, -0.009899890491444813, -0.06974537468008828, -0.2117496369520954, 0.1924910231599617, 0.2588376878973162, 0.1347718809388186, 0.25471926511167303, -0.34988354943823397, -0.0869661825709045, 0.2507513483103953, 0.14501149581312284, 0.04385797694537854, 0.012472552083955523, -0.281828152636687, 0.05504493124521615, -0.13824646067070334, -0.29349770782548085, -0.10531482865151606, -0.057904406303637905, 0.06143296665201584, -0.27987463880134256, 0.05985913040083751, 0.10129539457787025, 0.10962321748344325, -0.10906322123972993, -0.058444606554857864, 0.10283482987678756, 0.01667076985662182, 0.06509467902217518, 0.014884460880829576, 0.00829894550700198, -0.019231250305382305, -0.12026536000663773, 0.37455486063845456, -0.027087410830222723, -0.31113636356435326, 0.08806310399647868, -0.1551265075492362, -0.17485223908238767, 0.02587034814713294, 0.18316057425711238, 0.1502782520756387, -0.09439717032211392, 0.1325868277783963, -0.09934885012345356, 0.04752257000654936, 0.1617133816410052, 0.00634753521584922, 0.05983320774363452, 0.030540620883632647, 0.14929340420323506, 0.2608754010054103, 0.008499710321254832, -0.09862389264366868, -0.3280528382512561, -0.21052526786776357, -0.16071593053965716, 0.11826544162702926, -0.1580116839406975, -0.23509976601130084, 0.40138197088973565, 0.15063292533159256, 0.1715968589608868, 0.1409423872011534, 0.15883801524576388, 0.22365115759710438, 0.03326487518324141, 0.03839797939157538, 0.16156778589152454, 0.24420532335837683, 0.08520889816511619, -0.2106344437128619, -0.03121527833373923, 0.20412979225971198]
|
1,803.05517
|
Plaquette order in classical spin liquid stabilized by strong
off-diagonal exchange
|
We report a new classical spin liquid in which the collective flux degrees of
freedom break the translation symmetry of the honeycomb lattice. This exotic
phase exists in frustrated spin-orbit magnets where a dominant off-diagonal
exchange, the so-called $\Gamma$ term, results in a macroscopic ground-state
degeneracy at the classical level. We demonstrate that the system undergoes a
phase transition driven by thermal order-by-disorder at a critical temperature
$T_c \approx 0.04 |\Gamma|$. At first sight, this transition reduces an
emergent spherical spin-symmetry to a cubic one: spins point predominantly
toward the cubic axes at $T < T_c$. However, this seems to simply restore the
cubic symmetry of the $\Gamma$ model, and the non-coplanar spins remain
disordered below $T_c$. We show that the phase transition actually corresponds
to plaquette ordering of hexagonal fluxes and the cubic symmetry is indeed
broken, a scenario that is further confirmed by our extensive Monte Carlo
simulations.
|
cond-mat.str-el
|
we report a new classical spin liquid in which the collective flux degrees of freedom break the translation symmetry of the honeycomb lattice this exotic phase exists in frustrated spinorbit magnets where a dominant offdiagonal exchange the socalled gamma term results in a macroscopic groundstate degeneracy at the classical level we demonstrate that the system undergoes a phase transition driven by thermal orderbydisorder at a critical temperature t_c approx 004 gamma at first sight this transition reduces an emergent spherical spinsymmetry to a cubic one spins point predominantly toward the cubic axes at t t_c however this seems to simply restore the cubic symmetry of the gamma model and the noncoplanar spins remain disordered below t_c we show that the phase transition actually corresponds to plaquette ordering of hexagonal fluxes and the cubic symmetry is indeed broken a scenario that is further confirmed by our extensive monte carlo simulations
|
[['we', 'report', 'a', 'new', 'classical', 'spin', 'liquid', 'in', 'which', 'the', 'collective', 'flux', 'degrees', 'of', 'freedom', 'break', 'the', 'translation', 'symmetry', 'of', 'the', 'honeycomb', 'lattice', 'this', 'exotic', 'phase', 'exists', 'in', 'frustrated', 'spinorbit', 'magnets', 'where', 'a', 'dominant', 'offdiagonal', 'exchange', 'the', 'socalled', 'gamma', 'term', 'results', 'in', 'a', 'macroscopic', 'groundstate', 'degeneracy', 'at', 'the', 'classical', 'level', 'we', 'demonstrate', 'that', 'the', 'system', 'undergoes', 'a', 'phase', 'transition', 'driven', 'by', 'thermal', 'orderbydisorder', 'at', 'a', 'critical', 'temperature', 't_c', 'approx', '004', 'gamma', 'at', 'first', 'sight', 'this', 'transition', 'reduces', 'an', 'emergent', 'spherical', 'spinsymmetry', 'to', 'a', 'cubic', 'one', 'spins', 'point', 'predominantly', 'toward', 'the', 'cubic', 'axes', 'at', 't', 't_c', 'however', 'this', 'seems', 'to', 'simply', 'restore', 'the', 'cubic', 'symmetry', 'of', 'the', 'gamma', 'model', 'and', 'the', 'noncoplanar', 'spins', 'remain', 'disordered', 'below', 't_c', 'we', 'show', 'that', 'the', 'phase', 'transition', 'actually', 'corresponds', 'to', 'plaquette', 'ordering', 'of', 'hexagonal', 'fluxes', 'and', 'the', 'cubic', 'symmetry', 'is', 'indeed', 'broken', 'a', 'scenario', 'that', 'is', 'further', 'confirmed', 'by', 'our', 'extensive', 'monte', 'carlo', 'simulations']]
|
[-0.20730538433417678, 0.2768145964971014, -0.04025159305861632, 0.023258796376613714, -0.05075346878823518, -0.1398650033480719, 0.1156220102007657, 0.3731235300984559, -0.2648022282937379, -0.2634076722241288, 0.03207570591069533, -0.32782730863948395, -0.0992768933315255, 0.07888791367455367, 0.08358366314545211, -0.025776450889460092, -0.044337367335796955, 0.0038372939710361546, -0.16147155861132748, -0.19430128951875755, 0.2579602225112882, 0.024299054497215374, 0.2923248686058909, 0.05313000873343757, 0.07755886396040028, -0.022620273103412858, 0.16497733735248146, -0.034418105488430537, -0.17173660694907267, -0.0077892486287293415, 0.194628842228136, -0.10478028461052692, 0.14899904527013885, -0.3776047289208978, -0.2069558408845766, 0.09169959428957694, 0.14427513992351373, 0.156513182942493, -0.061419688315199526, -0.2732946341107256, 0.0035625767781580454, -0.14841651307862727, -0.20640160057743723, -0.09198821547141162, -0.0416850456905445, -0.07816104178770833, -0.2486005960994919, 0.1423492398544296, 0.1121661431849903, 0.10170529082717511, -0.0046942840805339735, -0.09727834136578435, -0.09190335530231412, 0.0237329853034497, 0.05608391809127225, 0.11428087333239921, 0.11306988522519776, -0.11016673748631456, -0.12711931934233306, 0.42575344545829213, -0.02309179077614036, -0.08069617079802158, 0.14299478019968975, -0.17837538803035344, -0.18933724416044834, 0.22857332758405466, 0.10434001392916145, 0.06971922698086941, -0.10822346232536142, 0.08931255367375135, -0.0009923500544860358, 0.21161011286996362, -0.01267572307190389, -0.01907379737736395, 0.28736584081045735, 0.1731499052300249, 0.04310868743919586, 0.17531098565750836, -0.10092594015533918, -0.14429836484584832, -0.28878577922989657, -0.12933010304184167, -0.24908974959246263, 0.07678234783640356, -0.11356023699416304, -0.15209606123288105, 0.35762540144758337, 0.14816039961906488, 0.17953224674601487, -0.021110614312456408, 0.22613122035052327, 0.08952753718914276, 0.06863854132317657, 0.04748905998312449, 0.2724789813029636, 0.1248927714979751, 0.0718617374483721, -0.3099763605449874, 0.001376202573762244, 0.05024214339873835]
|
1,803.05518
|
Bad Smells in Software Analytics Papers
|
CONTEXT: There has been a rapid growth in the use of data analytics to
underpin evidence-based software engineering. However the combination of
complex techniques, diverse reporting standards and poorly understood
underlying phenomena are causing some concern as to the reliability of studies.
OBJECTIVE: Our goal is to provide guidance for producers and consumers of
software analytics studies (computational experiments and correlation studies).
METHOD: We propose using "bad smells", i.e., surface indications of deeper
problems and popular in the agile software community and consider how they may
be manifest in software analytics studies.
RESULTS: We list 12 "bad smells" in software analytics papers (and show their
impact by examples).
CONCLUSIONS: We believe the metaphor of bad smell is a useful device.
Therefore we encourage more debate on what contributes to the validty of
software analytics studies (so we expect our list will mature over time).
|
cs.SE
|
context there has been a rapid growth in the use of data analytics to underpin evidencebased software engineering however the combination of complex techniques diverse reporting standards and poorly understood underlying phenomena are causing some concern as to the reliability of studies objective our goal is to provide guidance for producers and consumers of software analytics studies computational experiments and correlation studies method we propose using bad smells ie surface indications of deeper problems and popular in the agile software community and consider how they may be manifest in software analytics studies results we list 12 bad smells in software analytics papers and show their impact by examples conclusions we believe the metaphor of bad smell is a useful device therefore we encourage more debate on what contributes to the validty of software analytics studies so we expect our list will mature over time
|
[['context', 'there', 'has', 'been', 'a', 'rapid', 'growth', 'in', 'the', 'use', 'of', 'data', 'analytics', 'to', 'underpin', 'evidencebased', 'software', 'engineering', 'however', 'the', 'combination', 'of', 'complex', 'techniques', 'diverse', 'reporting', 'standards', 'and', 'poorly', 'understood', 'underlying', 'phenomena', 'are', 'causing', 'some', 'concern', 'as', 'to', 'the', 'reliability', 'of', 'studies', 'objective', 'our', 'goal', 'is', 'to', 'provide', 'guidance', 'for', 'producers', 'and', 'consumers', 'of', 'software', 'analytics', 'studies', 'computational', 'experiments', 'and', 'correlation', 'studies', 'method', 'we', 'propose', 'using', 'bad', 'smells', 'ie', 'surface', 'indications', 'of', 'deeper', 'problems', 'and', 'popular', 'in', 'the', 'agile', 'software', 'community', 'and', 'consider', 'how', 'they', 'may', 'be', 'manifest', 'in', 'software', 'analytics', 'studies', 'results', 'we', 'list', '12', 'bad', 'smells', 'in', 'software', 'analytics', 'papers', 'and', 'show', 'their', 'impact', 'by', 'examples', 'conclusions', 'we', 'believe', 'the', 'metaphor', 'of', 'bad', 'smell', 'is', 'a', 'useful', 'device', 'therefore', 'we', 'encourage', 'more', 'debate', 'on', 'what', 'contributes', 'to', 'the', 'validty', 'of', 'software', 'analytics', 'studies', 'so', 'we', 'expect', 'our', 'list', 'will', 'mature', 'over', 'time']]
|
[-0.07921881220178105, 0.01610993400177026, -0.10503374729175251, 0.10671427638361139, -0.14879975059733994, -0.14315339227343774, 0.07013942555921686, 0.4574881769241309, -0.21255905692420013, -0.34530453011393547, 0.14228138061471518, -0.3089526062440518, -0.2032448022326754, 0.24584848033728313, -0.14101051840966997, 0.0680429298769344, 0.12639647035149637, -0.018878320966142236, -0.0316365416030647, -0.2970458760847813, 0.27101028207331324, 0.08414107387546789, 0.3296991229949558, 0.11504518024141451, -0.03179231116391875, -0.034482734903067976, -0.11723254959691655, 0.004257238217445507, -0.14126477835673865, 0.1423216780608559, 0.39268875941862125, 0.2671272418953452, 0.39456376272182053, -0.44604167381262444, -0.20263953071243904, 0.06185871431558439, 0.15040413950573184, 0.07609781942988088, -0.06974662601969357, -0.2552105256753576, 0.06704171646021671, -0.18864550489046567, -0.12319919669193093, -0.13013146926121383, -0.019720034289558035, 0.017196768938752632, -0.19689938228030304, -0.01507272716071066, 0.038057904966888705, 0.13131093597886237, -0.0019547805398494214, -0.11862612943575307, 0.013691605088281465, 0.19092842416473096, 0.09725315986653803, 0.005494417616579734, 0.1499164150018323, -0.15151504926070883, -0.15021711370746532, 0.40551194820513986, -0.00823067161222021, -0.13198824412744228, 0.23739021050359507, -0.07480859228611722, -0.21567916848950766, 0.0737238268113949, 0.2238469035755452, 0.038669075175364324, -0.16036809049872355, 0.031268078870452624, 0.03392108043304065, 0.1864856381759058, -0.0008237635451401552, 0.025481927338857333, 0.2278502526842839, 0.2331123473969373, 0.019632785509412106, 0.086775647760434, 0.0070308529319228616, -0.0524998741791017, -0.21986230195115705, -0.14724799608030206, -0.11165299448770816, 0.022788978045011735, -0.03557164390946713, -0.16669569376830037, 0.37425171383949635, 0.23699524621332677, 0.0962658177188539, -0.03193945093308347, 0.31883047922299457, 0.011897449745549137, 0.10629776913275409, 0.0898185915776066, 0.19540180278786498, 0.0013206293171441014, 0.15408703864477183, -0.12945401219087752, 0.1180629362873212, -0.054394117491384904]
|
1,803.05519
|
How Physics Textbooks Embed Meaning in the Equals Sign
|
Physics as a discipline embeds conceptual meaning about the physical world in
mathematical formalism. The meaning associated with mathematical symbols
depends on context, and physicists can shift conceptual meaning by manipulating
those symbols. We present an analysis of the different physical meanings
associated with the equal sign "=" that can be inferred from introductory and
upper--level physics textbooks. Five distinct meanings/categories are
identified: causality, balancing, definitional, assignment, and calculation,
each with operational definitions that help identify their presence. The
different uses can be seen to link mathematical equations to intuitive
conceptual ideas, and significant differences in the frequency with which these
are used exist between textbooks of different levels.
|
physics.ed-ph
|
physics as a discipline embeds conceptual meaning about the physical world in mathematical formalism the meaning associated with mathematical symbols depends on context and physicists can shift conceptual meaning by manipulating those symbols we present an analysis of the different physical meanings associated with the equal sign that can be inferred from introductory and upperlevel physics textbooks five distinct meaningscategories are identified causality balancing definitional assignment and calculation each with operational definitions that help identify their presence the different uses can be seen to link mathematical equations to intuitive conceptual ideas and significant differences in the frequency with which these are used exist between textbooks of different levels
|
[['physics', 'as', 'a', 'discipline', 'embeds', 'conceptual', 'meaning', 'about', 'the', 'physical', 'world', 'in', 'mathematical', 'formalism', 'the', 'meaning', 'associated', 'with', 'mathematical', 'symbols', 'depends', 'on', 'context', 'and', 'physicists', 'can', 'shift', 'conceptual', 'meaning', 'by', 'manipulating', 'those', 'symbols', 'we', 'present', 'an', 'analysis', 'of', 'the', 'different', 'physical', 'meanings', 'associated', 'with', 'the', 'equal', 'sign', 'that', 'can', 'be', 'inferred', 'from', 'introductory', 'and', 'upperlevel', 'physics', 'textbooks', 'five', 'distinct', 'meaningscategories', 'are', 'identified', 'causality', 'balancing', 'definitional', 'assignment', 'and', 'calculation', 'each', 'with', 'operational', 'definitions', 'that', 'help', 'identify', 'their', 'presence', 'the', 'different', 'uses', 'can', 'be', 'seen', 'to', 'link', 'mathematical', 'equations', 'to', 'intuitive', 'conceptual', 'ideas', 'and', 'significant', 'differences', 'in', 'the', 'frequency', 'with', 'which', 'these', 'are', 'used', 'exist', 'between', 'textbooks', 'of', 'different', 'levels']]
|
[-0.06350988274191019, 0.1336150050184213, -0.11934608264573823, 0.1303167975797083, -0.1874048690459578, -0.1778591319474731, 0.03807927201780552, 0.34696265687800454, -0.276053860095965, -0.39801798372694824, 0.04781185548151974, -0.2680273738463418, -0.16973357558006716, 0.16983676591896774, -0.11524627624932572, -0.011862738388721074, 0.030107301222508615, 0.043485103088004566, -0.10768006284608045, -0.17064831470722489, 0.30993366558061236, 0.0241378303617239, 0.2832410976238479, 0.02645923407034618, 0.08005595012572289, -0.03201689519788896, -0.08459027844076436, 0.032373567802666155, -0.09249934313939036, 0.14736811484636686, 0.3494829056331905, 0.20449338294565678, 0.29509719890307323, -0.4575790171032754, -0.19186106930861127, 0.05030012184388992, 0.11974149579225787, 0.0903788133922564, 0.006908676944995107, -0.2841419894422326, 0.02686366071994199, -0.1553294153929749, -0.08265801377716327, -0.06528146430049266, 0.0047439500715618374, -0.0090572248065026, -0.13306124416119028, 0.037579881949959516, 0.037308086710764424, 0.12794754047068618, -0.05603476800459707, -0.17562778040801533, -0.0023776916830548058, 0.20625461589666866, 0.053992622649453786, -0.018538219989146863, 0.13312309659216728, -0.07113076977118432, -0.181797126229748, 0.4140527806827955, 0.014777295213088255, -0.24165144924805543, 0.2432789185691503, -0.09377688513067768, -0.13677591860520644, 0.062033444005456344, 0.13458196794239927, 0.005622136937541382, -0.1521927043915265, 0.04255092743932156, -0.011610330069420215, 0.16246966081976055, 0.11410052758406534, 0.10300622150197486, 0.2711328159948097, 0.09012780591810697, -0.06142365274446033, 0.07533137849967265, 0.030225945015385676, -0.1722617861618958, -0.3677053053136567, -0.13082012413132846, -0.11932759022391314, 0.035027718559891056, -0.05909760684704095, -0.12307553838451053, 0.39166937722545986, 0.18945541661493828, 0.14201342287499494, -0.004817547997955894, 0.26865798499539634, 0.14243912321589364, 0.06334275477478786, 0.04774271015721922, 0.17936264070525557, 0.10391913647067115, 0.12100468974160118, -0.14930994064649392, 0.11995165102253451, 0.04808754882792655]
|
1,803.0552
|
Probing the non-Debye low frequency excitations in glasses through
random pinning
|
We investigate the properties of the low-frequency spectrum in the density of
states $D(\omega)$ of a three-dimensional model glass former. To magnify the
Non-Debye sector of the spectrum, we introduce a random pinning field that
freezes a finite particle fraction in order to break the translational
invariance and shifts all the vibrational frequencies of the extended modes
towards higher frequencies. We show that Non-Debye soft localized modes
progressively emerge as the fraction $p$ of pinned particles increases.
Moreover, the low-frequency tail of $D(\omega)$ goes to zero as a power law
$\omega^{\delta(p)}$, with $2 \!\leq \! \delta(p) \!\leq\!4$ and $\delta\!=\!4$
above a threshold fraction $p_{th}$.
|
cond-mat.dis-nn cond-mat.stat-mech
|
we investigate the properties of the lowfrequency spectrum in the density of states domega of a threedimensional model glass former to magnify the nondebye sector of the spectrum we introduce a random pinning field that freezes a finite particle fraction in order to break the translational invariance and shifts all the vibrational frequencies of the extended modes towards higher frequencies we show that nondebye soft localized modes progressively emerge as the fraction p of pinned particles increases moreover the lowfrequency tail of domega goes to zero as a power law omegadeltap with 2 leq deltap leq4 and delta4 above a threshold fraction p_th
|
[['we', 'investigate', 'the', 'properties', 'of', 'the', 'lowfrequency', 'spectrum', 'in', 'the', 'density', 'of', 'states', 'domega', 'of', 'a', 'threedimensional', 'model', 'glass', 'former', 'to', 'magnify', 'the', 'nondebye', 'sector', 'of', 'the', 'spectrum', 'we', 'introduce', 'a', 'random', 'pinning', 'field', 'that', 'freezes', 'a', 'finite', 'particle', 'fraction', 'in', 'order', 'to', 'break', 'the', 'translational', 'invariance', 'and', 'shifts', 'all', 'the', 'vibrational', 'frequencies', 'of', 'the', 'extended', 'modes', 'towards', 'higher', 'frequencies', 'we', 'show', 'that', 'nondebye', 'soft', 'localized', 'modes', 'progressively', 'emerge', 'as', 'the', 'fraction', 'p', 'of', 'pinned', 'particles', 'increases', 'moreover', 'the', 'lowfrequency', 'tail', 'of', 'domega', 'goes', 'to', 'zero', 'as', 'a', 'power', 'law', 'omegadeltap', 'with', '2', 'leq', 'deltap', 'leq4', 'and', 'delta4', 'above', 'a', 'threshold', 'fraction', 'p_th']]
|
[-0.16884878681351742, 0.2874578108518001, -0.07723189333417252, 0.045316026299534476, -0.03395217122491814, -0.10589526259961228, 0.0874236520087602, 0.31748159700895057, -0.26073879452750964, -0.23552007633535302, 0.041642665678142184, -0.32318895708258244, -0.08772254977192656, 0.0827251819234031, 0.04463126136088962, 0.012259977696207808, -0.06162097395110108, 0.03366339815707475, -0.027830204319245384, -0.12010269587192976, 0.24134779440732124, 0.051600356750628525, 0.2877267754326264, 0.05030182087063497, 0.056587813796439006, -0.007989910871758326, 0.06921489982792706, 0.029907911303727067, -0.1606531911582387, 0.027487315588480082, 0.19357097970650478, 0.0007700227456642132, 0.24327232727927028, -0.38134397794583846, -0.21343086488709292, 0.1201794213482964, 0.1765121197437539, 0.08880932771317734, 0.021277214555690687, -0.2298163769803211, 0.09158060222170224, -0.18249578473121658, -0.23097104585829975, -0.04764407221227884, 0.034500068603722636, 0.015121645084125739, -0.23973331611840895, 0.16659856054420566, 0.11166278665940113, 0.030811474622026377, -0.06955785740522996, -0.1197851526587471, -0.0747092194928258, 0.08792053962436815, 0.088758619062776, 0.0074659024739601445, 0.16576751547422736, -0.16702936499324791, -0.049702735905371165, 0.3667788732997781, -0.1028882401513721, -0.11170375586816055, 0.164954923600068, -0.24059037359285296, -0.134087634630394, 0.19710438633702843, 0.15169416991400295, 0.08787022210241298, -0.03945739299010979, 0.08239117533986584, 0.0032741565282420055, 0.2190574211269325, 0.08823883323473673, 0.05893342723777773, 0.19825011464840203, 0.11451701342365612, 0.08598571972848446, 0.1977623782700439, -0.1362770626985687, -0.028686954002991757, -0.3170502777850511, -0.12254679737973265, -0.19565525851965718, 0.07029630255077363, -0.09147340811157882, -0.16509969632840926, 0.39894849940330956, 0.07852666156238639, 0.23715186209016131, 0.11960433377866067, 0.22138268893639393, 0.1586397950818269, 0.060198874002797345, 0.05087400029536665, 0.2400017311321754, 0.14704292711308775, 0.10667324225605447, -0.25135077230230557, -0.04843901537413545, 0.008806403651011778]
|
1,803.05521
|
Sequential and exact formulae for the subdifferential of nonconvex
integral functionals
|
This work concerns the study of the subdifferential of the integral
functional
$$
E_f(x)=\int_{T} f(t,x)d\mu(t),
$$ where $f$ is a (not necessarily convex) normal integrand,
$({T},\mathcal{A},\mu)$ is a $\sigma$-finite measure space, while the decision
variables vary in a separable Asplund space.
First, using techniques of variational analysis we establish sequential
approximate formulae for the Fr\'echet subdifferential of $E_f$. Secondly, we
introduce a Lipschitz-like condition, which allows us to give an
upper-estimation for the limiting subdifferential of $E_{f}$ even when this
functional is non-Lipschitz.
|
math.OC
|
this work concerns the study of the subdifferential of the integral functional e_fxint_t ftxdmut where f is a not necessarily convex normal integrand tmathcalamu is a sigmafinite measure space while the decision variables vary in a separable asplund space first using techniques of variational analysis we establish sequential approximate formulae for the frechet subdifferential of e_f secondly we introduce a lipschitzlike condition which allows us to give an upperestimation for the limiting subdifferential of e_f even when this functional is nonlipschitz
|
[['this', 'work', 'concerns', 'the', 'study', 'of', 'the', 'subdifferential', 'of', 'the', 'integral', 'functional', 'e_fxint_t', 'ftxdmut', 'where', 'f', 'is', 'a', 'not', 'necessarily', 'convex', 'normal', 'integrand', 'tmathcalamu', 'is', 'a', 'sigmafinite', 'measure', 'space', 'while', 'the', 'decision', 'variables', 'vary', 'in', 'a', 'separable', 'asplund', 'space', 'first', 'using', 'techniques', 'of', 'variational', 'analysis', 'we', 'establish', 'sequential', 'approximate', 'formulae', 'for', 'the', 'frechet', 'subdifferential', 'of', 'e_f', 'secondly', 'we', 'introduce', 'a', 'lipschitzlike', 'condition', 'which', 'allows', 'us', 'to', 'give', 'an', 'upperestimation', 'for', 'the', 'limiting', 'subdifferential', 'of', 'e_f', 'even', 'when', 'this', 'functional', 'is', 'nonlipschitz']]
|
[-0.12302211531159746, 0.040498763405133566, -0.14210566904928004, 0.12286512970519192, -0.1356697794497497, -0.10235878924367489, 0.10776859797634088, 0.3621468283719831, -0.318801688072695, -0.18500700687336458, 0.09513034387763783, -0.23193066954546965, -0.15020379801613412, 0.1634823634144064, -0.1430033293443841, 0.07773491797073707, 0.045075342131706025, 0.0427093706033253, -0.16521081398241222, -0.23781588582576, 0.39543860483092147, -0.06550412113451726, 0.2034736236121941, 0.06108803004510217, 0.12683867728458598, 0.05542799771775479, -0.007637144659053196, 0.013386326393735437, -0.19922620912578393, 0.17947119156309924, 0.30303217766673435, 0.1166519146962938, 0.38593564990472484, -0.3784239731438748, -0.17257244783973733, 0.1545437262030681, 0.06836102464441936, -0.021795303405069008, 0.05464128769069378, -0.26435844464735553, 0.022716736832222383, -0.1202662301358658, -0.12912411213997607, -0.12039003988074792, 0.004574225368824872, 0.014537628690935913, -0.3482625879190088, 0.07996558018827013, 0.11035972355272282, 0.06045786257494579, -0.11921090388431685, -0.08902768417285731, -0.0023251035864549604, 0.05383582797102546, 0.03159362914996197, 0.09510233359979828, 0.09990735552931361, -0.0673818190388575, -0.0633290006609803, 0.3152330422217583, -0.05554627634996137, -0.2472511056278433, 0.11700498436686474, -0.19670967833900993, -0.1701523240824992, 0.11155148870735006, 0.13234670571499058, 0.19062483762451388, -0.214858367504868, 0.2012621293134697, -0.06898321924948847, 0.08716056174780061, 0.06544347747241135, 0.005670215656327737, 0.0680528943239433, 0.13701978537205656, 0.22188353239764252, 0.16107754016222506, -0.03790845213965936, -0.06043089137642414, -0.36467130301979844, -0.2237123044800352, -0.1937128807623665, 0.05055564989554303, -0.09806799120572093, -0.24636489994727173, 0.35160595905519537, 0.09173248468160436, 0.1744888002633468, 0.15234152203601145, 0.24652451359630598, 0.21864705501341974, 0.008622355530848847, 0.07413423180507568, 0.17556791513849823, 0.16734911021836973, 0.037243617552464116, -0.1679304782981537, 0.10010041262011056, 0.12587097258149804]
|
1,803.05522
|
Observational constraints on the tilted flat-XCDM and the untilted
nonflat XCDM dynamical dark energy inflation parameterizations
|
We constrain tilted spatially-flat and untilted nonflat XCDM dynamical dark
energy inflation parameterizations using Planck 2015 cosmic microwave
background (CMB) anisotropy data and recent baryonic acoustic oscillations
distance measurements, Type Ia supernovae data, Hubble parameter observations,
and growth rate measurements. Inclusion of the four non-CMB data sets results
in a significant strengthening of the evidence for nonflatness in the nonflat
XCDM model from 1.1$\sigma$ for the CMB data alone to 3.4$\sigma$ for the full
data combination. In this untilted nonflat XCDM case the data favor a
spatially-closed model in which spatial curvature contributes a little less
than a percent of the current cosmological energy budget; they also mildly
favor dynamical dark energy over a cosmological constant at 1.2$\sigma$. These
data are also better fit by the flat-XCDM parameterization than by the standard
$\Lambda$CDM model, but only at 0.3$\sigma$ significance. Current data is
unable to rule out dark energy dynamics. The nonflat XCDM parameterization is
compatible with the Dark Energy Survey limits on the present value of the rms
mass fluctuations amplitude ($\sigma_8$) as a function of the present value of
the nonrelativistic matter density parameter ($\Omega_m$), however it does not
provide as good a fit to the higher multipole CMB temperature anisotropy data
as does the standard tilted flat-$\Lambda$CDM model. A number of measured
cosmological parameter values differ significantly when determined using the
tilted flat-XCDM and the nonflat XCDM parameterizations, including the baryonic
matter density parameter and the reionization optical depth.
|
astro-ph.CO gr-qc hep-ph hep-th
|
we constrain tilted spatiallyflat and untilted nonflat xcdm dynamical dark energy inflation parameterizations using planck 2015 cosmic microwave background cmb anisotropy data and recent baryonic acoustic oscillations distance measurements type ia supernovae data hubble parameter observations and growth rate measurements inclusion of the four noncmb data sets results in a significant strengthening of the evidence for nonflatness in the nonflat xcdm model from 11sigma for the cmb data alone to 34sigma for the full data combination in this untilted nonflat xcdm case the data favor a spatiallyclosed model in which spatial curvature contributes a little less than a percent of the current cosmological energy budget they also mildly favor dynamical dark energy over a cosmological constant at 12sigma these data are also better fit by the flatxcdm parameterization than by the standard lambdacdm model but only at 03sigma significance current data is unable to rule out dark energy dynamics the nonflat xcdm parameterization is compatible with the dark energy survey limits on the present value of the rms mass fluctuations amplitude sigma_8 as a function of the present value of the nonrelativistic matter density parameter omega_m however it does not provide as good a fit to the higher multipole cmb temperature anisotropy data as does the standard tilted flatlambdacdm model a number of measured cosmological parameter values differ significantly when determined using the tilted flatxcdm and the nonflat xcdm parameterizations including the baryonic matter density parameter and the reionization optical depth
|
[['we', 'constrain', 'tilted', 'spatiallyflat', 'and', 'untilted', 'nonflat', 'xcdm', 'dynamical', 'dark', 'energy', 'inflation', 'parameterizations', 'using', 'planck', '2015', 'cosmic', 'microwave', 'background', 'cmb', 'anisotropy', 'data', 'and', 'recent', 'baryonic', 'acoustic', 'oscillations', 'distance', 'measurements', 'type', 'ia', 'supernovae', 'data', 'hubble', 'parameter', 'observations', 'and', 'growth', 'rate', 'measurements', 'inclusion', 'of', 'the', 'four', 'noncmb', 'data', 'sets', 'results', 'in', 'a', 'significant', 'strengthening', 'of', 'the', 'evidence', 'for', 'nonflatness', 'in', 'the', 'nonflat', 'xcdm', 'model', 'from', '11sigma', 'for', 'the', 'cmb', 'data', 'alone', 'to', '34sigma', 'for', 'the', 'full', 'data', 'combination', 'in', 'this', 'untilted', 'nonflat', 'xcdm', 'case', 'the', 'data', 'favor', 'a', 'spatiallyclosed', 'model', 'in', 'which', 'spatial', 'curvature', 'contributes', 'a', 'little', 'less', 'than', 'a', 'percent', 'of', 'the', 'current', 'cosmological', 'energy', 'budget', 'they', 'also', 'mildly', 'favor', 'dynamical', 'dark', 'energy', 'over', 'a', 'cosmological', 'constant', 'at', '12sigma', 'these', 'data', 'are', 'also', 'better', 'fit', 'by', 'the', 'flatxcdm', 'parameterization', 'than', 'by', 'the', 'standard', 'lambdacdm', 'model', 'but', 'only', 'at', '03sigma', 'significance', 'current', 'data', 'is', 'unable', 'to', 'rule', 'out', 'dark', 'energy', 'dynamics', 'the', 'nonflat', 'xcdm', 'parameterization', 'is', 'compatible', 'with', 'the', 'dark', 'energy', 'survey', 'limits', 'on', 'the', 'present', 'value', 'of', 'the', 'rms', 'mass', 'fluctuations', 'amplitude', 'sigma_8', 'as', 'a', 'function', 'of', 'the', 'present', 'value', 'of', 'the', 'nonrelativistic', 'matter', 'density', 'parameter', 'omega_m', 'however', 'it', 'does', 'not', 'provide', 'as', 'good', 'a', 'fit', 'to', 'the', 'higher', 'multipole', 'cmb', 'temperature', 'anisotropy', 'data', 'as', 'does', 'the', 'standard', 'tilted', 'flatlambdacdm', 'model', 'a', 'number', 'of', 'measured', 'cosmological', 'parameter', 'values', 'differ', 'significantly', 'when', 'determined', 'using', 'the', 'tilted', 'flatxcdm', 'and', 'the', 'nonflat', 'xcdm', 'parameterizations', 'including', 'the', 'baryonic', 'matter', 'density', 'parameter', 'and', 'the', 'reionization', 'optical', 'depth']]
|
[-0.1000433932918233, 0.10429854841345618, -0.06902873257825845, 0.13287738533193735, -0.1497676185834919, -0.12643061214415005, 0.000637808524337149, 0.314888166464382, -0.20250898733380482, -0.3569407147028051, 0.035256117731371744, -0.30101895692395864, 0.029033605371714885, 0.20184777526449896, 0.03643414066715636, 0.0019695268928440614, 0.05325308927553063, -0.01719334575522469, -0.052570927227656335, -0.2725650148273097, 0.29940615704664997, 0.17475164734279136, 0.28247330930068404, -0.01685883585464942, 0.06474900336119747, -0.07412959972496834, -0.06992817389735928, 0.031081502476344704, -0.25471046488790794, 0.02657482087189355, 0.1864084495157471, 0.10483654653682728, 0.15016079292278037, -0.37215549790760244, -0.293500708706412, 0.20065450843688584, 0.12456585207533201, 0.13110070216915645, -0.028838039764055055, -0.25702030727518993, -0.008883921034603913, -0.1730610460869064, -0.12701439307457046, -0.04987504908709814, -0.036294567283285804, -0.03955673887155693, -0.24668281400287875, 0.25075997083294926, -0.03139409545548923, 0.016849700751164966, -0.12277451412709406, -0.13209151285291343, -0.09180686645264344, -0.05014392168387268, 0.06562353528852898, 0.07446794883712393, 0.13802472989086575, -0.17428023056283, -0.02921078371874809, 0.3952284002029746, -0.15717842289167222, -0.1397566325707063, 0.09659677825597306, -0.17790982572782676, -0.13796639514923345, 0.08336760667610571, 0.12062193684973539, -0.024224208415559955, -0.11907356331315112, 0.1482878890983024, 0.020990550895046176, 0.226213589727598, 0.05643137241811121, -0.01941968305971645, 0.3012059348144385, 0.13893377319393313, 0.05064521858977177, -0.007133985909041033, -0.12771674624846852, -0.039675984003631766, -0.3311321626351094, -0.042784161092206896, -0.15887142796747417, 0.05816150743181371, -0.20471538631721628, -0.14012179695041538, 0.37470862459517146, 0.11524230021998973, 0.25807748156868576, 0.07820541451372903, 0.3591285834720195, 0.03681014047007205, 0.04804742815086002, 0.07302667095158327, 0.342139292843484, 0.10720694904745591, 0.11649068091142627, -0.19342676671850204, 0.004058296085436629, -0.06721801818718659]
|
1,803.05523
|
A note on series with recursively defined terms
|
In this note we study the convergence of recursively defined infinite series.
We explore the role of the derivative of the defining function at the origin
(if it exists), and develop a comparison test for such series which can be used
even if the defining function of the series is not differentiable.
|
math.CA
|
in this note we study the convergence of recursively defined infinite series we explore the role of the derivative of the defining function at the origin if it exists and develop a comparison test for such series which can be used even if the defining function of the series is not differentiable
|
[['in', 'this', 'note', 'we', 'study', 'the', 'convergence', 'of', 'recursively', 'defined', 'infinite', 'series', 'we', 'explore', 'the', 'role', 'of', 'the', 'derivative', 'of', 'the', 'defining', 'function', 'at', 'the', 'origin', 'if', 'it', 'exists', 'and', 'develop', 'a', 'comparison', 'test', 'for', 'such', 'series', 'which', 'can', 'be', 'used', 'even', 'if', 'the', 'defining', 'function', 'of', 'the', 'series', 'is', 'not', 'differentiable']]
|
[-0.10646693284909886, 0.05404534350292614, -0.1221596739823536, 0.09608962257894185, -0.0594852682417975, -0.047834235055443756, -0.002810086813182212, 0.3513356870613419, -0.3335578076254863, -0.24402832010617623, 0.1379185153704244, -0.2273445269831707, -0.19220535743695039, 0.18115242584966695, -0.009797267803850655, 0.012689728621178521, 0.009220821344150374, 0.055010573660883196, -0.09678472330023606, -0.274272273402088, 0.34503788710571826, 0.0034467439668682907, 0.20785458663550133, 0.05377452049511843, 0.14889747452420685, 0.026513775440085176, -0.02942270499904855, 0.0304691014596476, -0.14634532116962454, 0.08738820704344946, 0.24950023246212646, 0.14662869335958162, 0.3327777937341195, -0.38833620460130847, -0.14868527124277675, 0.19228240989076978, 0.1588421302775924, 0.0367491303186398, -0.009251942661089392, -0.1859694909877502, 0.12400992377885044, -0.176551859628839, -0.13959459849418357, -0.09962697774888231, 0.012268386100633787, 0.04678196534783078, -0.2802650728889813, 0.030830595262859087, 0.06361586614870109, 0.0766494911020765, -0.0376053353270086, -0.037774408307786174, 0.018097131074262925, 0.14628216789927906, 0.0625937556122573, 0.07421658093629119, 0.06595776337557115, -0.07817160174734174, -0.045461960369721055, 0.36071612505027306, -0.11519052921077953, -0.24315749796537253, 0.16291628462763932, -0.19778239094795516, -0.17697717958631423, 0.03827651440738359, 0.12602856018258116, 0.15453818784310266, -0.10683487269740838, 0.1048378794657765, -0.050199891556985676, 0.12808009911364374, 0.08866335772640574, 0.010909458893225886, 0.21206568654340047, 0.1645140117750718, 0.06918752723588394, 0.1788239856765498, -0.027573716289435442, -0.03198419210429375, -0.3904053824774634, -0.21832428636172643, -0.21168076189664695, 0.04640880691434946, -0.06813938732123531, -0.21651095578160423, 0.4232697446042529, 0.1439300995060386, 0.20822083016929144, 0.06892438376402985, 0.22075577662998022, 0.24663974745915487, 0.04610669054986479, 0.0836791729536624, 0.18596034754927343, 0.06735992334030855, 0.03445929711541304, -0.17872702499600843, 0.12801166337270004, 0.10201719856391159]
|
1,803.05524
|
Positivity Cones under Deformations of Complex Structures
|
We investigate connections between the sGG property of compact complex
manifolds, defined in earlier work by the second author and L. Ugarte by the
requirement that every Gauduchon metric be strongly Gauduchon, and a possible
degeneration of the Fr\"olicher spectral sequence. In the first approach that
we propose, we prove a partial degeneration at $E_2$ and we introduce a
positivity cone in the $E_2$-cohomology of bidegree $(n-2,\,n)$ of the manifold
that we then prove to behave lower semicontinuously under deformations of the
complex structure. In the second approach that we propose, we introduce an
analogue of the $\partial\bar\partial$-lemma property of compact complex
manifolds for any real non-zero constant $h$ using the partial twisting $d_h$,
introduced recently by the second author, of the standard Poincar\'e
differential $d$. We then show, among other things, that this
$h$-$\partial\bar\partial$-property is deformation open.
|
math.AG math.CV math.DG
|
we investigate connections between the sgg property of compact complex manifolds defined in earlier work by the second author and l ugarte by the requirement that every gauduchon metric be strongly gauduchon and a possible degeneration of the frolicher spectral sequence in the first approach that we propose we prove a partial degeneration at e_2 and we introduce a positivity cone in the e_2cohomology of bidegree n2n of the manifold that we then prove to behave lower semicontinuously under deformations of the complex structure in the second approach that we propose we introduce an analogue of the partialbarpartiallemma property of compact complex manifolds for any real nonzero constant h using the partial twisting d_h introduced recently by the second author of the standard poincare differential d we then show among other things that this hpartialbarpartialproperty is deformation open
|
[['we', 'investigate', 'connections', 'between', 'the', 'sgg', 'property', 'of', 'compact', 'complex', 'manifolds', 'defined', 'in', 'earlier', 'work', 'by', 'the', 'second', 'author', 'and', 'l', 'ugarte', 'by', 'the', 'requirement', 'that', 'every', 'gauduchon', 'metric', 'be', 'strongly', 'gauduchon', 'and', 'a', 'possible', 'degeneration', 'of', 'the', 'frolicher', 'spectral', 'sequence', 'in', 'the', 'first', 'approach', 'that', 'we', 'propose', 'we', 'prove', 'a', 'partial', 'degeneration', 'at', 'e_2', 'and', 'we', 'introduce', 'a', 'positivity', 'cone', 'in', 'the', 'e_2cohomology', 'of', 'bidegree', 'n2n', 'of', 'the', 'manifold', 'that', 'we', 'then', 'prove', 'to', 'behave', 'lower', 'semicontinuously', 'under', 'deformations', 'of', 'the', 'complex', 'structure', 'in', 'the', 'second', 'approach', 'that', 'we', 'propose', 'we', 'introduce', 'an', 'analogue', 'of', 'the', 'partialbarpartiallemma', 'property', 'of', 'compact', 'complex', 'manifolds', 'for', 'any', 'real', 'nonzero', 'constant', 'h', 'using', 'the', 'partial', 'twisting', 'd_h', 'introduced', 'recently', 'by', 'the', 'second', 'author', 'of', 'the', 'standard', 'poincare', 'differential', 'd', 'we', 'then', 'show', 'among', 'other', 'things', 'that', 'this', 'hpartialbarpartialproperty', 'is', 'deformation', 'open']]
|
[-0.18553847976385013, 0.08345261686885994, -0.0730446835000561, 0.05372314702938585, -0.0937940894612385, -0.1196927373222185, -0.013583399833912742, 0.3575945106567815, -0.29924866371883957, -0.21627566742929905, 0.0833485897661269, -0.23522247567512644, -0.2481992147068548, 0.14482551159830215, -0.12788860774462057, 0.0037734311404432554, 0.04322209149284069, 0.06988717218593914, -0.09682051954758422, -0.271256174229647, 0.4720568137024255, -0.024289392044439036, 0.21289201286237905, 0.07033578703398877, 0.1267670439736, 0.00017539568002308335, -0.005862511417944916, 0.01689447865989196, -0.1704751937646399, 0.1684340487494517, 0.20851564056989874, 0.10158480562249143, 0.21658495715168744, -0.35434094622199636, -0.1761293429110939, 0.15130027630777262, 0.07527226298706784, 0.0199754403797937, -0.014013938054524581, -0.2799857079578086, 0.15052311324089876, -0.14578682422100375, -0.1684108242586851, -0.08279825959299855, 0.051696062224971896, 0.006010018056258559, -0.21341147796149873, 0.040701406328213015, 0.133595318218474, 0.0512046788524672, -0.056236721828634685, -0.06219642892863382, -0.056281018601593506, 0.0718504134017755, -0.009297499311608537, 0.048238962950349296, 0.04589870119739584, -0.05093751857844729, -0.11602297647657585, 0.33834465112372797, -0.12022134315852515, -0.24074808112345636, 0.11676189558827044, -0.1697939158672371, -0.2096370182801312, 0.08636198604739655, 0.12295172494315706, 0.19591722580576865, -0.06355941351819852, 0.15152971414029118, -0.07034573093166246, 0.09633869128832456, 0.11591470127271297, -0.01218826639780994, 0.0849484795197735, 0.11045415865801796, 0.12800018472925706, 0.14402450138646494, -0.03282684155890499, -0.039823554973682965, -0.34188370340887236, -0.2401107174981221, -0.14357311427182354, 0.13676848284461918, -0.08919532819548776, -0.1478574355475276, 0.36904695927275016, 0.06999205334303792, 0.25305666636182544, 0.09126370468669955, 0.2395375874629655, 0.08304710941293332, 0.03744082862463342, 0.08338583387461874, 0.185642187952694, 0.15977110614938497, 0.04173050874926369, -0.16609378964601682, -0.012675427003106213, 0.15546996826442944]
|
1,803.05525
|
Metric-affine f(R,T) theories of gravity and their applications
|
We study f(R,T) theories of gravity, where T is the trace of the
energy-momentum tensor T_{\mu\nu}, with independent metric and affine
connection (metric-affine theories). We find that the resulting field equations
share a close resemblance with their metric-affine f(R) relatives once an
effective energy-momentum tensor is introduced. As a result, the metric field
equations are second-order and no new propagating degrees of freedom arise as
compared to GR, which contrasts with the metric formulation of these theories,
where a dynamical scalar degree of freedom is present. Analogously to its
metric counterpart, the field equations impose the non-conservation of the
energy-momentum tensor, which implies non-geodesic motion and consequently
leads to the appearance of an extra force. The weak field limit leads to a
modified Poisson equation formally identical to that found in
Eddington-inspired Born-Infeld gravity. Furthermore, the coupling of these
gravity theories to perfect fluids, electromagnetic, and scalar fields, and
their potential applications are discussed.
|
gr-qc
|
we study frt theories of gravity where t is the trace of the energymomentum tensor t_munu with independent metric and affine connection metricaffine theories we find that the resulting field equations share a close resemblance with their metricaffine fr relatives once an effective energymomentum tensor is introduced as a result the metric field equations are secondorder and no new propagating degrees of freedom arise as compared to gr which contrasts with the metric formulation of these theories where a dynamical scalar degree of freedom is present analogously to its metric counterpart the field equations impose the nonconservation of the energymomentum tensor which implies nongeodesic motion and consequently leads to the appearance of an extra force the weak field limit leads to a modified poisson equation formally identical to that found in eddingtoninspired borninfeld gravity furthermore the coupling of these gravity theories to perfect fluids electromagnetic and scalar fields and their potential applications are discussed
|
[['we', 'study', 'frt', 'theories', 'of', 'gravity', 'where', 't', 'is', 'the', 'trace', 'of', 'the', 'energymomentum', 'tensor', 't_munu', 'with', 'independent', 'metric', 'and', 'affine', 'connection', 'metricaffine', 'theories', 'we', 'find', 'that', 'the', 'resulting', 'field', 'equations', 'share', 'a', 'close', 'resemblance', 'with', 'their', 'metricaffine', 'fr', 'relatives', 'once', 'an', 'effective', 'energymomentum', 'tensor', 'is', 'introduced', 'as', 'a', 'result', 'the', 'metric', 'field', 'equations', 'are', 'secondorder', 'and', 'no', 'new', 'propagating', 'degrees', 'of', 'freedom', 'arise', 'as', 'compared', 'to', 'gr', 'which', 'contrasts', 'with', 'the', 'metric', 'formulation', 'of', 'these', 'theories', 'where', 'a', 'dynamical', 'scalar', 'degree', 'of', 'freedom', 'is', 'present', 'analogously', 'to', 'its', 'metric', 'counterpart', 'the', 'field', 'equations', 'impose', 'the', 'nonconservation', 'of', 'the', 'energymomentum', 'tensor', 'which', 'implies', 'nongeodesic', 'motion', 'and', 'consequently', 'leads', 'to', 'the', 'appearance', 'of', 'an', 'extra', 'force', 'the', 'weak', 'field', 'limit', 'leads', 'to', 'a', 'modified', 'poisson', 'equation', 'formally', 'identical', 'to', 'that', 'found', 'in', 'eddingtoninspired', 'borninfeld', 'gravity', 'furthermore', 'the', 'coupling', 'of', 'these', 'gravity', 'theories', 'to', 'perfect', 'fluids', 'electromagnetic', 'and', 'scalar', 'fields', 'and', 'their', 'potential', 'applications', 'are', 'discussed']]
|
[-0.20307743696907124, 0.14503753515033735, -0.10391832523064945, 0.06207139415639247, -0.15705286675773852, -0.15775347887251115, -0.09564885154499539, 0.27536211476068606, -0.22882692928292922, -0.2857009981904034, 0.004490269982262042, -0.266400780646711, -0.193281898566812, 0.07205271885379569, -0.04674204787566, -0.008069830802617015, -0.027936776449855465, 0.10143123028872462, -0.09603838776480164, -0.22662130918946455, 0.3844106851792713, 0.06418072707443075, 0.2567708329615099, 0.014809670932167633, 0.15048872738955285, -0.031086233565462876, 0.004870590100718009, 0.11552867231068092, -0.11492664008690483, 0.07186586495228837, 0.19120713115016652, 0.08123299343910789, 0.1918193365435128, -0.4210787044003509, -0.24799716993319718, 0.09378536910350833, 0.08250137332935709, 0.13031020831746085, -0.025900817210120813, -0.2878557452932, 0.03161868070820709, -0.1774367296293585, -0.1702132912249873, -0.08542324459125808, 0.02376429099202543, -0.04188906622887287, -0.2507177782184505, 0.1092176176295782, 0.04374794573080877, 0.0012077575658339184, -0.09640636895677414, -0.07882232302436967, -0.04028891863047399, 0.039080745718961994, 0.15428340820861713, 0.08254832725566752, 0.10501582973164977, -0.20225996717314731, -0.08569861890282482, 0.4342424181447207, -0.1284405731485685, -0.27014175735341456, 0.18523943130918719, -0.11760202052628065, -0.09061468361465672, 0.0644099246468637, 0.12820203966376456, 0.1714240323295575, -0.16420434298925102, 0.17106374459115897, 0.005425314833228658, 0.09915649166630049, 0.09498648156182139, 0.08335289200268951, 0.26377972733689015, 0.007100075536238199, 0.03851683166894046, 0.1306118907394831, 0.003977254888816894, -0.15799367275125312, -0.38127792472406835, -0.18768441963293772, -0.10985823089934209, 0.0975792716233084, -0.1790782506640036, -0.20036565203086606, 0.3391319124161133, 0.1479132505067225, 0.0931528747976038, 0.07930233451846212, 0.22745360472306078, 0.14551908849563158, 0.07735488646022685, 0.08714215772214358, 0.32269947382306996, 0.2706160107748462, 0.09418430803237822, -0.2323386897000351, -0.08157427388231282, 0.087837357145081]
|
1,803.05526
|
Unpaired Image Captioning by Language Pivoting
|
Image captioning is a multimodal task involving computer vision and natural
language processing, where the goal is to learn a mapping from the image to its
natural language description. In general, the mapping function is learned from
a training set of image-caption pairs. However, for some language, large scale
image-caption paired corpus might not be available. We present an approach to
this unpaired image captioning problem by language pivoting. Our method can
effectively capture the characteristics of an image captioner from the pivot
language (Chinese) and align it to the target language (English) using another
pivot-target (Chinese-English) sentence parallel corpus. We evaluate our method
on two image-to-English benchmark datasets: MSCOCO and Flickr30K. Quantitative
comparisons against several baseline approaches demonstrate the effectiveness
of our method.
|
cs.CV
|
image captioning is a multimodal task involving computer vision and natural language processing where the goal is to learn a mapping from the image to its natural language description in general the mapping function is learned from a training set of imagecaption pairs however for some language large scale imagecaption paired corpus might not be available we present an approach to this unpaired image captioning problem by language pivoting our method can effectively capture the characteristics of an image captioner from the pivot language chinese and align it to the target language english using another pivottarget chineseenglish sentence parallel corpus we evaluate our method on two imagetoenglish benchmark datasets mscoco and flickr30k quantitative comparisons against several baseline approaches demonstrate the effectiveness of our method
|
[['image', 'captioning', 'is', 'a', 'multimodal', 'task', 'involving', 'computer', 'vision', 'and', 'natural', 'language', 'processing', 'where', 'the', 'goal', 'is', 'to', 'learn', 'a', 'mapping', 'from', 'the', 'image', 'to', 'its', 'natural', 'language', 'description', 'in', 'general', 'the', 'mapping', 'function', 'is', 'learned', 'from', 'a', 'training', 'set', 'of', 'imagecaption', 'pairs', 'however', 'for', 'some', 'language', 'large', 'scale', 'imagecaption', 'paired', 'corpus', 'might', 'not', 'be', 'available', 'we', 'present', 'an', 'approach', 'to', 'this', 'unpaired', 'image', 'captioning', 'problem', 'by', 'language', 'pivoting', 'our', 'method', 'can', 'effectively', 'capture', 'the', 'characteristics', 'of', 'an', 'image', 'captioner', 'from', 'the', 'pivot', 'language', 'chinese', 'and', 'align', 'it', 'to', 'the', 'target', 'language', 'english', 'using', 'another', 'pivottarget', 'chineseenglish', 'sentence', 'parallel', 'corpus', 'we', 'evaluate', 'our', 'method', 'on', 'two', 'imagetoenglish', 'benchmark', 'datasets', 'mscoco', 'and', 'flickr30k', 'quantitative', 'comparisons', 'against', 'several', 'baseline', 'approaches', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'method']]
|
[0.005582026255576581, -0.04934696058268453, -0.07500104639931109, 0.1240147278113596, -0.16321559336616612, -0.1401345572132831, 0.00994980560241603, 0.4705048756460186, -0.30724487243388154, -0.35916936211287975, 0.024922106215600533, -0.3146801718861842, -0.14305437406616622, 0.24678567737401996, -0.1495057177867313, 0.07121081565474313, 0.19533330581597524, 0.07497512983906342, -0.03573224288945804, -0.2869758888712672, 0.29605936739960165, -0.015199320631284938, 0.37504024863754565, 0.02694786836194699, 0.12948283478694006, -0.0715509289532106, -0.03056641910072477, -0.07243985861356629, -0.009337480492950951, 0.1947854825163825, 0.3625452766694953, 0.2815510542322805, 0.3033292645390039, -0.3696199276591422, -0.150173109688903, 0.035450145749176744, 0.10479780977456372, 0.14058172566251786, -0.04348922619828954, -0.40060365557304173, 0.09307884183315346, -0.1644419047019643, 0.1291277400966062, -0.15454615615441877, -0.0023756723991236422, -0.056635347798993416, -0.28334717364546647, 0.0058138860049886535, 0.13599806682008211, 0.11700623743541416, -0.038746676773222195, -0.09864338277362013, 0.041531772684825004, 0.18408451507776427, 0.05085570893544307, 0.15130770526307283, 0.14048127597961269, -0.17643507589822488, -0.16721343265876906, 0.4259071516666989, -0.09284576139275412, -0.2645744397686642, 0.23580685754489825, -0.015273349384441361, -0.16229644388563502, 0.04455281115963876, 0.21409445872805158, 0.12980404875592375, -0.15621915684829726, 0.02480318556686665, -0.12425938476884707, 0.26569409653178006, 0.08928267721117275, -0.07885540711653388, 0.21841414301793594, 0.2862733902913503, -0.03514472993289228, 0.1754934857360881, -0.12363990599510917, -0.05212713973634861, -0.21138011880951826, -0.12588638321212187, -0.2245188712363788, -0.06960154707878961, -0.0883371451194255, -0.1290049678890548, 0.40292629828584975, 0.2727092239914126, 0.17751825562693546, 0.12123428543907452, 0.3603741252493327, -0.02732212039378193, 0.11704611491037868, 0.03732547951722899, 0.06367641982510801, -0.048824562112892385, 0.11893635987090405, -0.18449524898257594, 0.03983176105128998, 0.07317787666850892]
|
1,803.05527
|
Motion control and optical interrogation of a levitating single NV in
vacuum
|
Levitation optomechanics exploits the unique mechanical properties of trapped
nano-objects in vacuum in order to address some of the limitations of clamped
nanomechanical resonators. In particular, its performance is foreseen to
contribute to a better understanding of quantum decoherence at the mesoscopic
scale as well as to lead to novel ultra-sensitive sensing schemes. While most
efforts have so far focused on optical trapping of low absorbing silica
particles, further opportunities arise from levitating objects with internal
degrees of freedom like color centers. Nevertheless, inefficient heat
dissipation at low pressures poses a challenge, as most nano-objects, even with
low absorbing materials, experience photo-damage in an optical trap. Here, by
using a Paul trap, we demonstrate levitation in vacuum and center-of-mass
feedback cooling of a nanodiamond hosting a single nitrogen-vacancy center. The
achieved level of motion control enables us to optically interrogate and
characterize the emitter response. The developed platform is applicable to a
wide range of other nano-objects and represents a promising step towards
coupling internal and external degrees of freedom.
|
physics.optics cond-mat.mes-hall quant-ph
|
levitation optomechanics exploits the unique mechanical properties of trapped nanoobjects in vacuum in order to address some of the limitations of clamped nanomechanical resonators in particular its performance is foreseen to contribute to a better understanding of quantum decoherence at the mesoscopic scale as well as to lead to novel ultrasensitive sensing schemes while most efforts have so far focused on optical trapping of low absorbing silica particles further opportunities arise from levitating objects with internal degrees of freedom like color centers nevertheless inefficient heat dissipation at low pressures poses a challenge as most nanoobjects even with low absorbing materials experience photodamage in an optical trap here by using a paul trap we demonstrate levitation in vacuum and centerofmass feedback cooling of a nanodiamond hosting a single nitrogenvacancy center the achieved level of motion control enables us to optically interrogate and characterize the emitter response the developed platform is applicable to a wide range of other nanoobjects and represents a promising step towards coupling internal and external degrees of freedom
|
[['levitation', 'optomechanics', 'exploits', 'the', 'unique', 'mechanical', 'properties', 'of', 'trapped', 'nanoobjects', 'in', 'vacuum', 'in', 'order', 'to', 'address', 'some', 'of', 'the', 'limitations', 'of', 'clamped', 'nanomechanical', 'resonators', 'in', 'particular', 'its', 'performance', 'is', 'foreseen', 'to', 'contribute', 'to', 'a', 'better', 'understanding', 'of', 'quantum', 'decoherence', 'at', 'the', 'mesoscopic', 'scale', 'as', 'well', 'as', 'to', 'lead', 'to', 'novel', 'ultrasensitive', 'sensing', 'schemes', 'while', 'most', 'efforts', 'have', 'so', 'far', 'focused', 'on', 'optical', 'trapping', 'of', 'low', 'absorbing', 'silica', 'particles', 'further', 'opportunities', 'arise', 'from', 'levitating', 'objects', 'with', 'internal', 'degrees', 'of', 'freedom', 'like', 'color', 'centers', 'nevertheless', 'inefficient', 'heat', 'dissipation', 'at', 'low', 'pressures', 'poses', 'a', 'challenge', 'as', 'most', 'nanoobjects', 'even', 'with', 'low', 'absorbing', 'materials', 'experience', 'photodamage', 'in', 'an', 'optical', 'trap', 'here', 'by', 'using', 'a', 'paul', 'trap', 'we', 'demonstrate', 'levitation', 'in', 'vacuum', 'and', 'centerofmass', 'feedback', 'cooling', 'of', 'a', 'nanodiamond', 'hosting', 'a', 'single', 'nitrogenvacancy', 'center', 'the', 'achieved', 'level', 'of', 'motion', 'control', 'enables', 'us', 'to', 'optically', 'interrogate', 'and', 'characterize', 'the', 'emitter', 'response', 'the', 'developed', 'platform', 'is', 'applicable', 'to', 'a', 'wide', 'range', 'of', 'other', 'nanoobjects', 'and', 'represents', 'a', 'promising', 'step', 'towards', 'coupling', 'internal', 'and', 'external', 'degrees', 'of', 'freedom']]
|
[-0.0965115947963889, 0.181344245432496, -0.02267995603136061, -0.05491910630183103, -0.059585192135316045, -0.18885707415996447, 0.06193979400593568, 0.4214527453569805, -0.24056612309753236, -0.33087969301816295, 0.04634503027704982, -0.26987241440288284, -0.06121620219611727, 0.21352591972031137, -0.06753405389023528, 0.08533095416770427, 0.018405280464931447, -0.03776120012763011, 0.002798966919619809, -0.1437615649719887, 0.23123074829961884, 0.0954020738677012, 0.3106065935222432, 0.08150075993719785, 0.16902064452057375, -0.027187170180053833, 0.08558223854257342, -0.015842988615280346, -0.08829183356137946, 0.1392163884743829, 0.2689761671018513, 0.008142138339805089, 0.30828023307463703, -0.4722388362511992, -0.23784558371065515, 0.07190723030293798, 0.16606703740818535, 0.18463079050484607, -0.11619414357153479, -0.25704813273623583, 0.016514710708767835, -0.14732860105303938, -0.19892347160562435, -0.09654680961222552, 0.0013168222065467168, 0.017146082544454926, -0.21232704321309404, 0.033859434871770004, 0.04185317651135847, 0.08114975633592729, -0.06798766404458814, -0.06510159172501195, 0.022964701793320916, 0.12114896352971247, -0.04604605278274154, -0.001635003777268781, 0.2712355285170762, -0.18603531181784894, -0.11828241366071297, 0.4270888262318776, -0.043849417280323585, -0.13419476232820135, 0.2544834635261556, -0.15505896511158962, -0.060710942009737826, 0.15851900523377802, 0.20403961322770234, 0.12008292386286913, -0.1646797366823782, 0.029813023150371223, 0.05537929126773687, 0.1662014498758842, 0.09971612550777055, 0.15614049032138771, 0.284662367988323, 0.23109442766358637, 0.0774670713375706, 0.1915251836718252, -0.0976978488608866, -0.043578901780111826, -0.22195614771095706, -0.14803731411503737, -0.1854674414950697, 0.07047797243987375, -0.0392584193877958, -0.13333022309576764, 0.3405032511006164, 0.16162187869246256, 0.16091951346572708, -0.06459352735923056, 0.305772041781422, 0.034689653354614755, 0.11706767084131785, 0.016895604971796273, 0.3102283909651519, 0.16659932163242688, 0.0988678213345873, -0.29288615445359883, -0.00010003256611526012, -0.04538218234597212]
|
1,803.05528
|
Robust Distributed Control Beyond Quadratic Invariance
|
The problem of robust distributed control arises in several large-scale
systems, such as transportation networks and power grid systems. In many
practical scenarios controllers might not have enough information to make
globally optimal decisions in a tractable way. We propose a novel class of
tractable optimization problems whose solution is a controller complying with
any specified information structure. The approach we suggest is based on
decomposing intractable information constraints into two subspace constraints
in the disturbance feedback domain. We discuss how to perform the decomposition
in an optimized way. The resulting control policy is globally optimal when a
condition known as Quadratic Invariance (QI) holds, whereas it is feasible and
it provides a provable upper bound on the minimum cost when QI does not hold.
Finally, we show that our method can lead to improved performance guarantees
with respect to previous approaches, by applying the developed techniques to
the platooning of autonomous vehicles.
|
cs.SY math.OC
|
the problem of robust distributed control arises in several largescale systems such as transportation networks and power grid systems in many practical scenarios controllers might not have enough information to make globally optimal decisions in a tractable way we propose a novel class of tractable optimization problems whose solution is a controller complying with any specified information structure the approach we suggest is based on decomposing intractable information constraints into two subspace constraints in the disturbance feedback domain we discuss how to perform the decomposition in an optimized way the resulting control policy is globally optimal when a condition known as quadratic invariance qi holds whereas it is feasible and it provides a provable upper bound on the minimum cost when qi does not hold finally we show that our method can lead to improved performance guarantees with respect to previous approaches by applying the developed techniques to the platooning of autonomous vehicles
|
[['the', 'problem', 'of', 'robust', 'distributed', 'control', 'arises', 'in', 'several', 'largescale', 'systems', 'such', 'as', 'transportation', 'networks', 'and', 'power', 'grid', 'systems', 'in', 'many', 'practical', 'scenarios', 'controllers', 'might', 'not', 'have', 'enough', 'information', 'to', 'make', 'globally', 'optimal', 'decisions', 'in', 'a', 'tractable', 'way', 'we', 'propose', 'a', 'novel', 'class', 'of', 'tractable', 'optimization', 'problems', 'whose', 'solution', 'is', 'a', 'controller', 'complying', 'with', 'any', 'specified', 'information', 'structure', 'the', 'approach', 'we', 'suggest', 'is', 'based', 'on', 'decomposing', 'intractable', 'information', 'constraints', 'into', 'two', 'subspace', 'constraints', 'in', 'the', 'disturbance', 'feedback', 'domain', 'we', 'discuss', 'how', 'to', 'perform', 'the', 'decomposition', 'in', 'an', 'optimized', 'way', 'the', 'resulting', 'control', 'policy', 'is', 'globally', 'optimal', 'when', 'a', 'condition', 'known', 'as', 'quadratic', 'invariance', 'qi', 'holds', 'whereas', 'it', 'is', 'feasible', 'and', 'it', 'provides', 'a', 'provable', 'upper', 'bound', 'on', 'the', 'minimum', 'cost', 'when', 'qi', 'does', 'not', 'hold', 'finally', 'we', 'show', 'that', 'our', 'method', 'can', 'lead', 'to', 'improved', 'performance', 'guarantees', 'with', 'respect', 'to', 'previous', 'approaches', 'by', 'applying', 'the', 'developed', 'techniques', 'to', 'the', 'platooning', 'of', 'autonomous', 'vehicles']]
|
[-0.1661609894005594, 0.009570699788609464, -0.09872300467253023, 0.056308375062798365, -0.12305712922068399, -0.20238643997574066, 0.07573098653784399, 0.40583824610879365, -0.2972580806711336, -0.3210228732501741, 0.15780999314030816, -0.20931309589536348, -0.1921503130594585, 0.23213523079289636, -0.15143738216964003, 0.12261249402346198, 0.06397141472914324, 0.024781617666199025, -0.054150105973331294, -0.2497660400927237, 0.28052320107711126, 0.03342211443103022, 0.30606245464687937, 0.039546152759416434, 0.12557133620458782, -0.013180971195848257, 0.020347574564439603, 0.06289161707113308, -0.10079297258959379, 0.13882834182898485, 0.2872919896587096, 0.2191889735008742, 0.32618779641442197, -0.43732291116726163, -0.21341445398048248, 0.13203182158872998, 0.15455980466228295, 0.13151286966532616, -0.03913342615123838, -0.23796887065777006, 0.10287812846945599, -0.15594611618533924, -0.09191564166480128, -0.11480680696386235, -0.03870063177096883, -0.0034189763529890245, -0.3406019606859594, 0.00561966415299894, 0.07565292547870842, -0.010896502253089673, -0.0746522544893844, -0.08524793501809434, 0.01242128210720527, 0.13102571184182346, 0.009837596744201541, 0.01907989714261193, 0.14355171061565283, -0.11533333642067375, -0.14938962833462832, 0.3987465573146063, -0.014429672588092074, -0.26419760415854016, 0.15910288934433053, -0.05319746224258363, -0.15484565192076652, 0.10384686904186322, 0.20565939873603045, 0.11576982321570707, -0.17775392987262428, 0.08103213564179278, -0.04453829906156494, 0.1784773012471014, -0.001561254585539204, 0.04732614553235228, 0.14409151160480832, 0.1720940171043979, 0.23130235575204958, 0.13457896103291145, -0.0071745343944605655, -0.11870385492768358, -0.2417222383018169, -0.09266655924281081, -0.16196349279626326, 0.009904196412261465, -0.0723148098889224, -0.13017864663494763, 0.335065786020672, 0.17942323072606492, 0.17193397114455117, 0.09767105385624603, 0.3474069940279317, 0.13421777340817856, 0.05220523149420331, 0.13969977500732816, 0.231138726301473, 0.07703842303496511, 0.0900856921558871, -0.208557918794861, 0.10222341794538878, 0.022362807782342523]
|
1,803.05529
|
Machine learning-assisted virtual patching of web applications
|
Web applications are permanently being exposed to attacks that exploit their
vulnerabilities. In this work we investigate the application of machine
learning techniques to leverage Web Application Firewall (WAF), a technology
that is used to detect and prevent attacks. We propose a combined approach of
machine learning models, based on one-class classification and n-gram analysis,
to enhance the detection and accuracy capabilities of MODSECURITY, an open
source and widely used WAF. The results are promising and outperform
MODSECURITY when configured with the OWASP Core Rule Set, the baseline
configuration setting of a widely deployed, rule-based WAF technology. The
proposed solution, combining both approaches, allow us to deploy a WAF when no
training data for the application is available (using one-class
classification), and an improved one using n-grams when training data is
available.
|
cs.CR
|
web applications are permanently being exposed to attacks that exploit their vulnerabilities in this work we investigate the application of machine learning techniques to leverage web application firewall waf a technology that is used to detect and prevent attacks we propose a combined approach of machine learning models based on oneclass classification and ngram analysis to enhance the detection and accuracy capabilities of modsecurity an open source and widely used waf the results are promising and outperform modsecurity when configured with the owasp core rule set the baseline configuration setting of a widely deployed rulebased waf technology the proposed solution combining both approaches allow us to deploy a waf when no training data for the application is available using oneclass classification and an improved one using ngrams when training data is available
|
[['web', 'applications', 'are', 'permanently', 'being', 'exposed', 'to', 'attacks', 'that', 'exploit', 'their', 'vulnerabilities', 'in', 'this', 'work', 'we', 'investigate', 'the', 'application', 'of', 'machine', 'learning', 'techniques', 'to', 'leverage', 'web', 'application', 'firewall', 'waf', 'a', 'technology', 'that', 'is', 'used', 'to', 'detect', 'and', 'prevent', 'attacks', 'we', 'propose', 'a', 'combined', 'approach', 'of', 'machine', 'learning', 'models', 'based', 'on', 'oneclass', 'classification', 'and', 'ngram', 'analysis', 'to', 'enhance', 'the', 'detection', 'and', 'accuracy', 'capabilities', 'of', 'modsecurity', 'an', 'open', 'source', 'and', 'widely', 'used', 'waf', 'the', 'results', 'are', 'promising', 'and', 'outperform', 'modsecurity', 'when', 'configured', 'with', 'the', 'owasp', 'core', 'rule', 'set', 'the', 'baseline', 'configuration', 'setting', 'of', 'a', 'widely', 'deployed', 'rulebased', 'waf', 'technology', 'the', 'proposed', 'solution', 'combining', 'both', 'approaches', 'allow', 'us', 'to', 'deploy', 'a', 'waf', 'when', 'no', 'training', 'data', 'for', 'the', 'application', 'is', 'available', 'using', 'oneclass', 'classification', 'and', 'an', 'improved', 'one', 'using', 'ngrams', 'when', 'training', 'data', 'is', 'available']]
|
[-0.02477120733524454, -0.054198573414671984, -0.06388207846038947, 0.0797309146441738, -0.14948892989195883, -0.22553339908887265, 0.07028050406193925, 0.4078887633513659, -0.2360682621365413, -0.3049458659000017, 0.15629637651198375, -0.30584458615913085, -0.1379062713716518, 0.23701412614547845, -0.11425818453161893, 0.08667637276547877, 0.11941222996084076, 0.044991416375110435, -0.035604751400762434, -0.3139857871142202, 0.29555301953488117, 0.0703843053991229, 0.40530571310470503, 0.063972882404359, 0.0979457120181795, -0.007190353092455277, -0.0382614804217486, -0.014315930591141241, -0.05679159271092045, 0.18765535561198537, 0.34586312188397034, 0.25360061848804244, 0.29613967338016, -0.40106802470417635, -0.2012713317156092, 0.09189769848263964, 0.13792024446990003, 0.10942419783466241, -0.04377175182470995, -0.33981549212088186, 0.12554458623300446, -0.24748038487847557, -0.06038925538164084, -0.16192951213540227, -0.04852902292182217, 0.012012868960896, -0.26004577254890604, -0.03275004561168537, 0.04358909710903059, 0.05611306110001875, -0.032055104659362274, -0.0807939859452855, 0.06583939473123544, 0.1630094652608739, 0.026715857197290683, 0.056700807100049024, 0.1599042274165461, -0.1250705845220981, -0.19795060485149873, 0.33979836703546235, -0.07602737158418732, -0.1847133512474653, 0.24396208561004393, 0.06721536938284496, -0.1511848756521376, 0.06584752868917404, 0.24334619293751364, 0.10118990829285009, -0.17590696119452442, 0.028925130211670574, 0.026504136692506796, 0.20238384843987384, 0.04470367561743566, -0.028598550923175713, 0.17555862763071095, 0.2508335451019582, 0.03156197485231766, 0.13504753975289394, -0.1546986926272935, -0.04105157699880444, -0.17651385135920436, -0.11461115275001661, -0.18973325806401783, -0.030042450443778016, -0.03767106155304866, -0.15656474355791666, 0.33291225472578045, 0.2695806333019088, 0.13639597241435145, 0.05815635143186559, 0.3620748635325016, 0.0037587572826878663, 0.15649075335188006, 0.13271729233251375, 0.18904901768352525, 0.034677843379816324, 0.14162295828502852, -0.1352482044356734, 0.07532849193243733, 0.0007448409768668088]
|
1,803.0553
|
Self-Supervised Monocular Image Depth Learning and Confidence Estimation
|
Convolutional Neural Networks (CNNs) need large amounts of data with ground
truth annotation, which is a challenging problem that has limited the
development and fast deployment of CNNs for many computer vision tasks. We
propose a novel framework for depth estimation from monocular images with
corresponding confidence in a self-supervised manner. A fully differential
patch-based cost function is proposed by using the Zero-Mean Normalized Cross
Correlation (ZNCC) that takes multi-scale patches as a matching strategy. This
approach greatly increases the accuracy and robustness of the depth learning.
In addition, the proposed patch-based cost function can provide a 0 to 1
confidence, which is then used to supervise the training of a parallel network
for confidence map learning and estimation. Evaluation on KITTI dataset shows
that our method outperforms the state-of-the-art results.
|
cs.CV
|
convolutional neural networks cnns need large amounts of data with ground truth annotation which is a challenging problem that has limited the development and fast deployment of cnns for many computer vision tasks we propose a novel framework for depth estimation from monocular images with corresponding confidence in a selfsupervised manner a fully differential patchbased cost function is proposed by using the zeromean normalized cross correlation zncc that takes multiscale patches as a matching strategy this approach greatly increases the accuracy and robustness of the depth learning in addition the proposed patchbased cost function can provide a 0 to 1 confidence which is then used to supervise the training of a parallel network for confidence map learning and estimation evaluation on kitti dataset shows that our method outperforms the stateoftheart results
|
[['convolutional', 'neural', 'networks', 'cnns', 'need', 'large', 'amounts', 'of', 'data', 'with', 'ground', 'truth', 'annotation', 'which', 'is', 'a', 'challenging', 'problem', 'that', 'has', 'limited', 'the', 'development', 'and', 'fast', 'deployment', 'of', 'cnns', 'for', 'many', 'computer', 'vision', 'tasks', 'we', 'propose', 'a', 'novel', 'framework', 'for', 'depth', 'estimation', 'from', 'monocular', 'images', 'with', 'corresponding', 'confidence', 'in', 'a', 'selfsupervised', 'manner', 'a', 'fully', 'differential', 'patchbased', 'cost', 'function', 'is', 'proposed', 'by', 'using', 'the', 'zeromean', 'normalized', 'cross', 'correlation', 'zncc', 'that', 'takes', 'multiscale', 'patches', 'as', 'a', 'matching', 'strategy', 'this', 'approach', 'greatly', 'increases', 'the', 'accuracy', 'and', 'robustness', 'of', 'the', 'depth', 'learning', 'in', 'addition', 'the', 'proposed', 'patchbased', 'cost', 'function', 'can', 'provide', 'a', '0', 'to', '1', 'confidence', 'which', 'is', 'then', 'used', 'to', 'supervise', 'the', 'training', 'of', 'a', 'parallel', 'network', 'for', 'confidence', 'map', 'learning', 'and', 'estimation', 'evaluation', 'on', 'kitti', 'dataset', 'shows', 'that', 'our', 'method', 'outperforms', 'the', 'stateoftheart', 'results']]
|
[-0.04745996709053333, -0.037128571758512405, -0.0644357591545066, 0.031725848527052083, -0.07958042740893478, -0.16106866689291424, 0.023143493205022354, 0.4483050518346807, -0.24228420108556747, -0.3490890481007787, 0.06565918254200369, -0.2564333773576296, -0.20048260521143674, 0.19108172964949446, -0.16756159985223068, 0.1521589919190424, 0.20279344809778893, 0.021559186922968366, -0.0795965571126614, -0.2740544620847616, 0.27320172710415835, 0.04271443294217953, 0.38301871231255624, 0.03801214233972132, 0.17121795116153618, -0.023074680616935857, -0.0011775150001854995, 0.001955952798911872, -0.03432185594434626, 0.19924776240054948, 0.32183130792377945, 0.2162496477813245, 0.36542460231755214, -0.3761184560135007, -0.22019289281541624, 0.09349228033366111, 0.168476423742966, 0.10595269312616437, -0.035104674907723586, -0.36716807985033556, 0.09335365560299788, -0.18075287216701186, 0.04872937281616032, -0.15527792760314277, -0.018490636716775883, -0.04609106241797025, -0.34776223994648225, 0.06331831402360247, 0.04028863335171571, 0.06272187068198735, -0.03849670166830317, -0.12041852510390946, 0.01841798524121539, 0.15640339326614944, -0.011764141596638812, 0.11159328105859459, 0.13870361995740005, -0.21354598440050793, -0.12856630048526524, 0.3233982251885419, -0.08619619645536519, -0.24363877192282907, 0.16777820870405635, -0.013383861333848193, -0.15584799343509637, 0.15651752463756846, 0.2371332103453684, 0.11930331584925835, -0.15946845108499894, 0.03686223106252817, -0.05083485078066587, 0.2046898379133871, 0.01745178969576955, -0.05049624079435419, 0.14644664691474577, 0.29656697490180917, 0.09147863705741027, 0.13186009695681816, -0.2145048956798676, -0.03783096396006071, -0.22292415050503153, -0.10032798790444548, -0.236018592866066, -0.050849452836868855, -0.12396753665312785, -0.15456134885406264, 0.3987828379568572, 0.25597716986130065, 0.21976467850976267, 0.1866297988812081, 0.39878074798661356, 0.06465196018286336, 0.12464647215003004, 0.10512561203034308, 0.17060206500598443, 0.010324843663077515, 0.12998011803182846, -0.14711425003882211, 0.08498383907851978, 0.07407176804442245]
|
1,803.05531
|
Low coherence unit norm tight frames
|
Equiangular tight frames (ETFs) have found significant applications in signal
processing and coding theory due to their robustness to noise and transmission
losses. ETFs are characterized by the fact that the coherence between any two
distinct vectors is equal to the Welch bound. This guarantees that the maximum
coherence between pairs of vectors is minimized. Despite their usefulness and
widespread applications, ETFs of a given size $N$ are only guaranteed to exist
in $\mathbb{R}^{d}$ or $\mathbb{C}^{d}$ if $N = d + 1$. This leads to the
problem of finding approximations of ETFs of $N$ vectors in $\mathbb{R}^{d}$ or
$\mathbb{C}^{d}$ where $N > d+1.$ To be more precise, one wishes to construct a
unit norm tight frame (UNTF) such that the maximum coherence between distinct
vectors of this frame is as close to the Welch bound as possible. In this paper
low coherence UNTFs in $\mathbb{R}^d$ are constructed by adding a strategically
chosen set of vectors called an "optimal" set to an existing ETF of $d+1$
vectors. In order to do so, combinatorial objects called block designs are
used. Estimates are provided on the maximum coherence between distinct vectors
of this low coherence UNTF. It is shown that for certain block designs, the
constructed UNTF attains the smallest possible maximum coherence between pairs
of vectors among all UNTFs containing the starting ETF of $d+1$ vectors. This
is particularly desirable if there does not exist a set of the same size for
which the Welch bound is attained.
|
cs.IT math.FA math.IT
|
equiangular tight frames etfs have found significant applications in signal processing and coding theory due to their robustness to noise and transmission losses etfs are characterized by the fact that the coherence between any two distinct vectors is equal to the welch bound this guarantees that the maximum coherence between pairs of vectors is minimized despite their usefulness and widespread applications etfs of a given size n are only guaranteed to exist in mathbbrd or mathbbcd if n d 1 this leads to the problem of finding approximations of etfs of n vectors in mathbbrd or mathbbcd where n d1 to be more precise one wishes to construct a unit norm tight frame untf such that the maximum coherence between distinct vectors of this frame is as close to the welch bound as possible in this paper low coherence untfs in mathbbrd are constructed by adding a strategically chosen set of vectors called an optimal set to an existing etf of d1 vectors in order to do so combinatorial objects called block designs are used estimates are provided on the maximum coherence between distinct vectors of this low coherence untf it is shown that for certain block designs the constructed untf attains the smallest possible maximum coherence between pairs of vectors among all untfs containing the starting etf of d1 vectors this is particularly desirable if there does not exist a set of the same size for which the welch bound is attained
|
[['equiangular', 'tight', 'frames', 'etfs', 'have', 'found', 'significant', 'applications', 'in', 'signal', 'processing', 'and', 'coding', 'theory', 'due', 'to', 'their', 'robustness', 'to', 'noise', 'and', 'transmission', 'losses', 'etfs', 'are', 'characterized', 'by', 'the', 'fact', 'that', 'the', 'coherence', 'between', 'any', 'two', 'distinct', 'vectors', 'is', 'equal', 'to', 'the', 'welch', 'bound', 'this', 'guarantees', 'that', 'the', 'maximum', 'coherence', 'between', 'pairs', 'of', 'vectors', 'is', 'minimized', 'despite', 'their', 'usefulness', 'and', 'widespread', 'applications', 'etfs', 'of', 'a', 'given', 'size', 'n', 'are', 'only', 'guaranteed', 'to', 'exist', 'in', 'mathbbrd', 'or', 'mathbbcd', 'if', 'n', 'd', '1', 'this', 'leads', 'to', 'the', 'problem', 'of', 'finding', 'approximations', 'of', 'etfs', 'of', 'n', 'vectors', 'in', 'mathbbrd', 'or', 'mathbbcd', 'where', 'n', 'd1', 'to', 'be', 'more', 'precise', 'one', 'wishes', 'to', 'construct', 'a', 'unit', 'norm', 'tight', 'frame', 'untf', 'such', 'that', 'the', 'maximum', 'coherence', 'between', 'distinct', 'vectors', 'of', 'this', 'frame', 'is', 'as', 'close', 'to', 'the', 'welch', 'bound', 'as', 'possible', 'in', 'this', 'paper', 'low', 'coherence', 'untfs', 'in', 'mathbbrd', 'are', 'constructed', 'by', 'adding', 'a', 'strategically', 'chosen', 'set', 'of', 'vectors', 'called', 'an', 'optimal', 'set', 'to', 'an', 'existing', 'etf', 'of', 'd1', 'vectors', 'in', 'order', 'to', 'do', 'so', 'combinatorial', 'objects', 'called', 'block', 'designs', 'are', 'used', 'estimates', 'are', 'provided', 'on', 'the', 'maximum', 'coherence', 'between', 'distinct', 'vectors', 'of', 'this', 'low', 'coherence', 'untf', 'it', 'is', 'shown', 'that', 'for', 'certain', 'block', 'designs', 'the', 'constructed', 'untf', 'attains', 'the', 'smallest', 'possible', 'maximum', 'coherence', 'between', 'pairs', 'of', 'vectors', 'among', 'all', 'untfs', 'containing', 'the', 'starting', 'etf', 'of', 'd1', 'vectors', 'this', 'is', 'particularly', 'desirable', 'if', 'there', 'does', 'not', 'exist', 'a', 'set', 'of', 'the', 'same', 'size', 'for', 'which', 'the', 'welch', 'bound', 'is', 'attained']]
|
[-0.16856419330142067, 0.13764408135246117, -0.014013767020831935, 0.07043311356845083, -0.02236409825311502, -0.16505141273798823, 0.05614327522201456, 0.39748414242601493, -0.28211687417716347, -0.25896648065422767, 0.09289070107216688, -0.3014234463448532, -0.13425734164763273, 0.15857344924779493, -0.11628196433889854, 0.06117041174059587, 0.024471497470397053, 0.10219610369613556, -0.07986197659367945, -0.3098013808745968, 0.2678032681902415, 0.031048222800477164, 0.3047126303523532, -0.000611911705575296, 0.11759958351977726, -0.008982859785703332, 0.027321736662575195, 0.0066229654896301044, -0.10739254133731872, 0.17609635277900504, 0.2856032428363313, 0.2098544719706278, 0.28566763048056376, -0.3680644479591817, -0.14503447632440578, 0.19472527481964305, 0.1521275776875093, 0.0815309316390368, 0.008602313457925889, -0.21126138937130137, 0.10901829240750908, -0.09215922720046305, -0.06811096754187865, -0.04992190358316897, 0.11146056086657746, 0.017657065374730347, -0.3124222354229184, 0.025635019384316823, 0.1103584685679757, 0.007871652300241578, -0.021444503330003424, -0.13676700620676285, -0.0014545476031238484, 0.13082813042413088, 0.018427649518683614, 0.04991486756695257, 0.03492680838895784, -0.03922157049907518, -0.10931568065101736, 0.3744600403404706, -0.029620712152991398, -0.25217232824191144, 0.1723753172808609, -0.14413684319136702, -0.07607342337385685, 0.12270913672386147, 0.1599083553798713, 0.09652399326021555, -0.12337222967018602, 0.06369922629265787, -0.10892777637621055, 0.17048363438884717, 0.15790661918076676, 0.13783595667035162, 0.17403518702618437, 0.07707936948945908, 0.125455420178311, 0.13571244287275597, -0.031171919143260205, -0.052235991104590006, -0.3085313388822732, -0.11496545287009514, -0.2745899510791108, 0.03660627273332832, -0.13423917895257598, -0.15886876382418189, 0.31024391611040997, 0.13109178455349413, 0.23549955198541284, 0.0688467947655083, 0.24530264890184664, 0.078122086693227, 0.0714376379689395, 0.12539422736576608, 0.21836284924244423, 0.12701609224289717, -0.021590641209434457, -0.15662806208488914, 0.06288882794198715, 0.06041681448855588]
|
1,803.05532
|
Thermal transport in semiconductor nanostructures, graphene and related
two-dimensional materials
|
We review experimental and theoretical results on thermal transport in
semiconductor nanostructures (multilayer thin films, core/shell and segmented
nanowires), single- and few-layer graphene, hexagonal boron nitride, molybdenum
disulfide and black phosphorus. Different possibilities of phonon engineering
for optimization of electrical and heat conductions are discussed. The role of
the phonon energy spectra modification on the thermal conductivity in
semiconductor nanostructures is revealed. The dependence of thermal
conductivity in graphene and related two-dimensional (2D) materials on
temperature, flake size, defect concentration, edge roughness and strain is
analyzed.
|
cond-mat.mes-hall
|
we review experimental and theoretical results on thermal transport in semiconductor nanostructures multilayer thin films coreshell and segmented nanowires single and fewlayer graphene hexagonal boron nitride molybdenum disulfide and black phosphorus different possibilities of phonon engineering for optimization of electrical and heat conductions are discussed the role of the phonon energy spectra modification on the thermal conductivity in semiconductor nanostructures is revealed the dependence of thermal conductivity in graphene and related twodimensional 2d materials on temperature flake size defect concentration edge roughness and strain is analyzed
|
[['we', 'review', 'experimental', 'and', 'theoretical', 'results', 'on', 'thermal', 'transport', 'in', 'semiconductor', 'nanostructures', 'multilayer', 'thin', 'films', 'coreshell', 'and', 'segmented', 'nanowires', 'single', 'and', 'fewlayer', 'graphene', 'hexagonal', 'boron', 'nitride', 'molybdenum', 'disulfide', 'and', 'black', 'phosphorus', 'different', 'possibilities', 'of', 'phonon', 'engineering', 'for', 'optimization', 'of', 'electrical', 'and', 'heat', 'conductions', 'are', 'discussed', 'the', 'role', 'of', 'the', 'phonon', 'energy', 'spectra', 'modification', 'on', 'the', 'thermal', 'conductivity', 'in', 'semiconductor', 'nanostructures', 'is', 'revealed', 'the', 'dependence', 'of', 'thermal', 'conductivity', 'in', 'graphene', 'and', 'related', 'twodimensional', '2d', 'materials', 'on', 'temperature', 'flake', 'size', 'defect', 'concentration', 'edge', 'roughness', 'and', 'strain', 'is', 'analyzed']]
|
[-0.10084259741787993, 0.17475792739085508, 0.02338180050448796, -0.1000042260857299, 0.010784529496070951, -0.2010202655178863, 0.06983050901096227, 0.519852317241562, -0.25689438505228174, -0.25817861624581867, -0.028428492865925872, -0.4022840311599159, -0.15495665249046545, 0.24664134658916398, 0.031947548964147476, 0.14092905894679905, 0.011198119119589412, -0.21097105959982632, -0.030543515025529752, -0.16348706657976605, 0.2167859333540248, 0.07315103796332381, 0.45089334972895856, 0.1842985587292026, -0.027712825328371552, -0.0033808834715421464, 0.14607051747504535, 0.05346594663434337, -0.25172392712082975, 0.08648955717217177, 0.23994785607900732, -0.2758920717128921, 0.16516157783308003, -0.5485671849618124, -0.26046423334628344, -0.11010598605715258, 0.11110296171310163, 0.14647792051221395, -0.15081805808247653, -0.1953283917337526, 0.0619110819602082, -0.07790998734945301, -0.04174033107187296, -0.04965315975227155, -0.015750351118270393, -0.04137669414888288, -0.1489729541550163, 0.10143916411758509, 0.02630843426274179, 0.05770203104069413, -0.1679995212010866, -0.2165671848627024, -0.16589799120502416, 0.005304442382915769, 0.018906501831140284, -0.06974091849744667, 0.36530638893871287, -0.11520009229046314, -0.10962622549904641, 0.3791422838085266, -0.02768798577490934, -0.06601191776653015, 0.13062873581251086, -0.16301158397610105, -0.03073175726350137, 0.13020868061738478, 0.15523117502371586, 0.09503327695338792, -0.1794441029189837, 0.09047150037719781, 0.013469578221786854, 0.15720161546270775, 0.13557299197824715, 0.15929812693773487, 0.28606973785831225, 0.3080384583932586, -0.02668788670670501, 0.17933242684934114, -0.11910898827806894, 0.06747632105509903, -0.12320792499583127, -0.2540265814601552, -0.27765674403933593, 0.13820071449113447, -0.14934248668239805, -0.29913877782433534, 0.4557923986468204, 0.07816636277535974, 0.0978405935754783, -0.12033131362350527, 0.20665093004530252, 0.0774768398923063, 0.06056865231610488, -0.026460673752089225, 0.2704717444234289, 0.25089887780852094, 0.1541096952361079, -0.29685748648710636, 0.0499566089995422, -0.026526786313868712]
|
1,803.05533
|
An algorithm for the word entropy
|
For any infinite word $w$ on a finite alphabet $A$, the complexity function
$p_w$ of $w$ is the sequence counting, for each non-negative $n$, the number
$p_w(n)$ of words of length $n$ on the alphabet $A$ that are factors of the
infinite word $w$ and the the entropy of $w$ is the quantity
$E(w)=\lim\limits_{n\to\infty}\frac 1n\log p_w(n)$. For any given function $f$
with exponential growth, Mauduit and Moreira introduced in [MM17] the notion of
word entropy $E_W(f) = \sup \{E(w), w \in A^{{\mathbb N}}, p_w \le f \}$ and
showed its links with fractal dimensions of sets of infinite sequences with
complexity function bounded by $f$. The goal of this work is to give an
algorithm to estimate with arbitrary precision $E_W(f)$ from finitely many
values of $f$.
|
math.DS
|
for any infinite word w on a finite alphabet a the complexity function p_w of w is the sequence counting for each nonnegative n the number p_wn of words of length n on the alphabet a that are factors of the infinite word w and the the entropy of w is the quantity ewlimlimits_ntoinftyfrac 1nlog p_wn for any given function f with exponential growth mauduit and moreira introduced in mm17 the notion of word entropy e_wf sup ew w in amathbb n p_w le f and showed its links with fractal dimensions of sets of infinite sequences with complexity function bounded by f the goal of this work is to give an algorithm to estimate with arbitrary precision e_wf from finitely many values of f
|
[['for', 'any', 'infinite', 'word', 'w', 'on', 'a', 'finite', 'alphabet', 'a', 'the', 'complexity', 'function', 'p_w', 'of', 'w', 'is', 'the', 'sequence', 'counting', 'for', 'each', 'nonnegative', 'n', 'the', 'number', 'p_wn', 'of', 'words', 'of', 'length', 'n', 'on', 'the', 'alphabet', 'a', 'that', 'are', 'factors', 'of', 'the', 'infinite', 'word', 'w', 'and', 'the', 'the', 'entropy', 'of', 'w', 'is', 'the', 'quantity', 'ewlimlimits_ntoinftyfrac', '1nlog', 'p_wn', 'for', 'any', 'given', 'function', 'f', 'with', 'exponential', 'growth', 'mauduit', 'and', 'moreira', 'introduced', 'in', 'mm17', 'the', 'notion', 'of', 'word', 'entropy', 'e_wf', 'sup', 'ew', 'w', 'in', 'amathbb', 'n', 'p_w', 'le', 'f', 'and', 'showed', 'its', 'links', 'with', 'fractal', 'dimensions', 'of', 'sets', 'of', 'infinite', 'sequences', 'with', 'complexity', 'function', 'bounded', 'by', 'f', 'the', 'goal', 'of', 'this', 'work', 'is', 'to', 'give', 'an', 'algorithm', 'to', 'estimate', 'with', 'arbitrary', 'precision', 'e_wf', 'from', 'finitely', 'many', 'values', 'of', 'f']]
|
[-0.15106740305352895, 0.1861469504228062, -0.04580011897621157, 0.025072818081902308, -0.016323594594007878, -0.13964819352020372, 0.0709977269136408, 0.31758481866802224, -0.3119443809254797, -0.2565328902564943, 0.04547784934068465, -0.30580570527398193, -0.06304318301396857, 0.19025530424169418, -0.0818759215934599, 0.0956692796914512, 0.024929328149825822, 0.15173617548874166, -0.049020748991961974, -0.3234498122951291, 0.3252673802943137, -0.03140248622378854, 0.20399337339970727, 0.01828898742153752, 0.12636882877053662, 0.02156104055637891, -0.04318314362469999, -0.024927368708199164, -0.18652503721285507, 0.11333307350382636, 0.2452371817876081, 0.15958600751597618, 0.29859433165888805, -0.2630038856238615, -0.15136424400920018, 0.18913887405279475, 0.12489064916162981, 0.012085439957922599, 0.014793600831715176, -0.23123140517835977, 0.1553565357338454, -0.16567424684285842, -0.08047704076867734, 0.04427944916132532, 0.15647950324947474, 0.06144530114147156, -0.30878256913847063, 0.017711572448310793, 0.12019706742654813, 0.058443763633029625, -0.005139038864652947, -0.15657790702172233, -0.03368211300761179, 0.08078454148604489, 0.02369758769842132, 0.12750111528687547, 0.04511706766550292, -0.08579525553628986, -0.12596435496797326, 0.31333939412791956, -0.1057989979315488, -0.2802855121582502, 0.12781088680914435, -0.17301739170216024, -0.12996250210085608, 0.13052555897318927, 0.11169460721191812, 0.09735625096001342, -0.019269649376405677, 0.23923023603093185, -0.09847467372071791, 0.20399435227126128, 0.13683545189054652, 0.04406050593042594, 0.07898037526069483, 0.09440237544782337, 0.06034238379902863, 0.16086577685916278, 0.01327239223908572, 0.0425122804237438, -0.3329361923130565, -0.1935716112922938, -0.22491408153971443, 0.10241456835942923, -0.16675772269499262, -0.2278169540260903, 0.3251786425892935, 0.04852553754739585, 0.23639278448202083, 0.1631038224431457, 0.1871179544813473, 0.11945629400033199, 0.017194453333924355, 0.08073201642263649, 0.02897252556562546, 0.15240495145553723, -0.00185778829055365, -0.1981177340112779, 0.0857465718147635, 0.18133848429632232]
|
1,803.05534
|
Las antenas de espacio profundo en la Argentina
|
Since December 2012, the Deep Space Antenna DS3 of the European Space Agency
was inaugurated in the province of Mendoza. The possibility of using this
equipment for space and scientific activities was promoted by our country.
Several scientific institutions in the country are working together so that
part of the observation time assigned to Argentina can be used by the
astronomical community. Some results have already been presented at meetings of
the AAA. Now the Deep Space antenna that China has installed in the province of
Neuquen as part of its Lunar Exploration Program is added to the Argentine
observational capabilities. This paper describes the characteristics of the new
station and the role that Argentina has in this project through its space
agency, CONAE.
|
astro-ph.IM
|
since december 2012 the deep space antenna ds3 of the european space agency was inaugurated in the province of mendoza the possibility of using this equipment for space and scientific activities was promoted by our country several scientific institutions in the country are working together so that part of the observation time assigned to argentina can be used by the astronomical community some results have already been presented at meetings of the aaa now the deep space antenna that china has installed in the province of neuquen as part of its lunar exploration program is added to the argentine observational capabilities this paper describes the characteristics of the new station and the role that argentina has in this project through its space agency conae
|
[['since', 'december', '2012', 'the', 'deep', 'space', 'antenna', 'ds3', 'of', 'the', 'european', 'space', 'agency', 'was', 'inaugurated', 'in', 'the', 'province', 'of', 'mendoza', 'the', 'possibility', 'of', 'using', 'this', 'equipment', 'for', 'space', 'and', 'scientific', 'activities', 'was', 'promoted', 'by', 'our', 'country', 'several', 'scientific', 'institutions', 'in', 'the', 'country', 'are', 'working', 'together', 'so', 'that', 'part', 'of', 'the', 'observation', 'time', 'assigned', 'to', 'argentina', 'can', 'be', 'used', 'by', 'the', 'astronomical', 'community', 'some', 'results', 'have', 'already', 'been', 'presented', 'at', 'meetings', 'of', 'the', 'aaa', 'now', 'the', 'deep', 'space', 'antenna', 'that', 'china', 'has', 'installed', 'in', 'the', 'province', 'of', 'neuquen', 'as', 'part', 'of', 'its', 'lunar', 'exploration', 'program', 'is', 'added', 'to', 'the', 'argentine', 'observational', 'capabilities', 'this', 'paper', 'describes', 'the', 'characteristics', 'of', 'the', 'new', 'station', 'and', 'the', 'role', 'that', 'argentina', 'has', 'in', 'this', 'project', 'through', 'its', 'space', 'agency', 'conae']]
|
[-0.09355876487908793, 0.10278813657350838, -0.09882222639480759, 0.0336810926597596, -0.11500249419849916, -0.028494443138488798, 0.046966707552439674, 0.3520255193579942, -0.19500215760752804, -0.34004588168664057, 0.1662917865524221, -0.30752823340561486, -0.15344463096269345, 0.19450159259064154, -0.09930746765715666, -0.008593771607637956, 0.08297156334137086, 0.015106364519747555, 0.0505629015578812, -0.3061561803486137, 0.2874794070309288, 0.1979943321303075, 0.29343901963982744, 0.02162465181766597, 0.10476558525344265, -0.0240316461756459, -0.09008057246015208, -0.026677896519865244, -0.07735014223911348, 0.13192259562278136, 0.377674426171608, 0.2262202705994137, 0.3382917834888594, -0.41938283827277967, -0.18533231028485433, 0.04825985454572517, 0.06631044318067429, -0.024944020809269832, -0.011497848974464491, -0.36984704332578866, -0.0007468924369113367, -0.2491246501945692, -0.14810164486531352, 0.005542573067106757, 0.03541297201433631, 0.005380102284405319, -0.16410142689710483, -0.08705761460358369, -0.0378642058842429, 0.09580636411508331, -0.05592992410567574, -0.14385265711939238, -0.036523077478555994, 0.22482452023636978, 0.06910678395642669, 0.0670451499716394, 0.07601071909054748, -0.07682727684136137, -0.10473961815176928, 0.3769009491566141, -0.03238850512892985, -0.06796366913763226, 0.1409392265133468, -0.20362517636910568, -0.1983883321537163, 0.07936766607015104, 0.21174545155563315, 0.04268703316567374, -0.1786738672278455, 0.14777653153936118, -0.04903751269715731, 0.10198872573826401, 0.08350579863124084, -0.03501582627383168, 0.21257835466483394, 0.22387813619857075, 0.0642783519235577, 0.10270993474424343, -0.15586734928770876, -0.06375222699144154, -0.2564247329948378, -0.17010131750692858, -0.1925470049370874, -0.049082794955733124, 0.01838454261033788, -0.06799089020026512, 0.40775779083172686, 0.11264396137863275, 0.054475795546332834, -0.041233685122159705, 0.26252753700541914, -0.005461280304770611, 0.11975609049674307, 0.0593539346811041, 0.2861691762010479, 0.002419304753439959, 0.23084068360173557, -0.14682471376202513, 0.11014906324629413, 0.019591254506596042]
|
1,803.05535
|
An Assertion-Based Program Logic for Probabilistic Programs
|
Research on deductive verification of probabilistic programs has considered
expectation-based logics, where pre- and post-conditions are real-valued
functions on states, and assertion-based logics, where pre- and post-conditions
are boolean predicates on state distributions. Both approaches have developed
over nearly four decades, but they have different standings today.
Expectation-based systems have managed to formalize many sophisticated case
studies, while assertion-based systems today have more limited expressivity and
have targeted simpler examples.
We present Ellora, a sound and relatively complete assertion-based program
logic, and demonstrate its expressivity by verifying several classical examples
of randomized algorithms using an implementation in the EasyCrypt proof
assistant. Ellora features new proof rules for loops and adversarial code, and
supports richer assertions than existing program logics. We also show that
Ellora allows convenient reasoning about complex probabilistic concepts by
developing a new program logic for probabilistic independence and distribution
law, and then smoothly embedding it into Ellora. Our work demonstrates that the
assertion-based approach is not fundamentally limited and suggests that some
notions are potentially easier to reason about in assertion-based systems.
|
cs.LO cs.PL
|
research on deductive verification of probabilistic programs has considered expectationbased logics where pre and postconditions are realvalued functions on states and assertionbased logics where pre and postconditions are boolean predicates on state distributions both approaches have developed over nearly four decades but they have different standings today expectationbased systems have managed to formalize many sophisticated case studies while assertionbased systems today have more limited expressivity and have targeted simpler examples we present ellora a sound and relatively complete assertionbased program logic and demonstrate its expressivity by verifying several classical examples of randomized algorithms using an implementation in the easycrypt proof assistant ellora features new proof rules for loops and adversarial code and supports richer assertions than existing program logics we also show that ellora allows convenient reasoning about complex probabilistic concepts by developing a new program logic for probabilistic independence and distribution law and then smoothly embedding it into ellora our work demonstrates that the assertionbased approach is not fundamentally limited and suggests that some notions are potentially easier to reason about in assertionbased systems
|
[['research', 'on', 'deductive', 'verification', 'of', 'probabilistic', 'programs', 'has', 'considered', 'expectationbased', 'logics', 'where', 'pre', 'and', 'postconditions', 'are', 'realvalued', 'functions', 'on', 'states', 'and', 'assertionbased', 'logics', 'where', 'pre', 'and', 'postconditions', 'are', 'boolean', 'predicates', 'on', 'state', 'distributions', 'both', 'approaches', 'have', 'developed', 'over', 'nearly', 'four', 'decades', 'but', 'they', 'have', 'different', 'standings', 'today', 'expectationbased', 'systems', 'have', 'managed', 'to', 'formalize', 'many', 'sophisticated', 'case', 'studies', 'while', 'assertionbased', 'systems', 'today', 'have', 'more', 'limited', 'expressivity', 'and', 'have', 'targeted', 'simpler', 'examples', 'we', 'present', 'ellora', 'a', 'sound', 'and', 'relatively', 'complete', 'assertionbased', 'program', 'logic', 'and', 'demonstrate', 'its', 'expressivity', 'by', 'verifying', 'several', 'classical', 'examples', 'of', 'randomized', 'algorithms', 'using', 'an', 'implementation', 'in', 'the', 'easycrypt', 'proof', 'assistant', 'ellora', 'features', 'new', 'proof', 'rules', 'for', 'loops', 'and', 'adversarial', 'code', 'and', 'supports', 'richer', 'assertions', 'than', 'existing', 'program', 'logics', 'we', 'also', 'show', 'that', 'ellora', 'allows', 'convenient', 'reasoning', 'about', 'complex', 'probabilistic', 'concepts', 'by', 'developing', 'a', 'new', 'program', 'logic', 'for', 'probabilistic', 'independence', 'and', 'distribution', 'law', 'and', 'then', 'smoothly', 'embedding', 'it', 'into', 'ellora', 'our', 'work', 'demonstrates', 'that', 'the', 'assertionbased', 'approach', 'is', 'not', 'fundamentally', 'limited', 'and', 'suggests', 'that', 'some', 'notions', 'are', 'potentially', 'easier', 'to', 'reason', 'about', 'in', 'assertionbased', 'systems']]
|
[-0.06340373438982559, 0.02338884848777005, -0.11840529009167637, 0.1340816772150408, -0.15073853832802603, -0.21236378057992883, 0.06632033228109191, 0.40902995811509235, -0.22934143197356857, -0.32492662856089216, 0.10925691278318742, -0.23596601444304854, -0.1305969764159194, 0.24788597403626356, -0.11072064756282739, 0.10586690724128857, 0.060058024560234374, -0.02196252166825746, -0.04168485512624362, -0.25947333021089436, 0.3064588122961244, -0.015022963367934739, 0.2437571790907532, 0.037314397016806264, 0.06621371966387544, 0.029021823486047132, -0.03393400721251964, 0.029597688564099372, -0.08046842809429758, 0.12533002700224252, 0.34220125451817046, 0.29700415563636595, 0.33092940981632896, -0.4477866814498391, -0.17296246846871716, 0.05253653984849474, 0.11982121610348778, 0.09978178191797009, -0.0017206851909369496, -0.31829757256566416, 0.0894335821803127, -0.20915606444967644, -0.019519616833754947, -0.19819098879716227, 0.046241576549197944, 0.004118611375867789, -0.19337169858760067, -0.053599395607099205, 0.16925745165241615, 0.13405871707946063, -0.008266750193267529, -0.1360862957074174, 0.010172347009980253, 0.06761244581746204, -0.017744358235837095, -0.018347134454441923, 0.10834316068994147, -0.08033201248251966, -0.2149145890798952, 0.3072770025368248, 0.029789803299437544, -0.18088306489799705, 0.23278130018285342, -0.05897362817278398, -0.20306734395080378, 0.06800925281697086, 0.13047261743074548, 0.15676140520276802, -0.14355091579258442, 0.07838331076083704, -0.024708247796765396, 0.21755758684328091, 0.06771893751674465, 0.07268279837444425, 0.18650002059127604, 0.1627198672081743, 0.003533897722871708, 0.13302629345495787, 0.07730327613518706, -0.15205060156062244, -0.24876387387514115, -0.14730790506033892, -0.08531860990183694, -0.043480790702409906, -0.05008558433145351, -0.15054996913298965, 0.3512737645953894, 0.1916569311807065, 0.09323545474309607, 0.17894366219772825, 0.3226167955568859, 0.056749677751878544, 0.10289583844531859, 0.09723862236099584, 0.17647102814084584, 0.11441831762769393, 0.14285818468047573, -0.07961005772197885, 0.13441723090197358, 0.013348116893321276]
|
1,803.05536
|
Evaluation of Dense 3D Reconstruction from 2D Face Images in the Wild
|
This paper investigates the evaluation of dense 3D face reconstruction from a
single 2D image in the wild. To this end, we organise a competition that
provides a new benchmark dataset that contains 2000 2D facial images of 135
subjects as well as their 3D ground truth face scans. In contrast to previous
competitions or challenges, the aim of this new benchmark dataset is to
evaluate the accuracy of a 3D dense face reconstruction algorithm using real,
accurate and high-resolution 3D ground truth face scans. In addition to the
dataset, we provide a standard protocol as well as a Python script for the
evaluation. Last, we report the results obtained by three state-of-the-art 3D
face reconstruction systems on the new benchmark dataset. The competition is
organised along with the 2018 13th IEEE Conference on Automatic Face & Gesture
Recognition.
|
cs.CV
|
this paper investigates the evaluation of dense 3d face reconstruction from a single 2d image in the wild to this end we organise a competition that provides a new benchmark dataset that contains 2000 2d facial images of 135 subjects as well as their 3d ground truth face scans in contrast to previous competitions or challenges the aim of this new benchmark dataset is to evaluate the accuracy of a 3d dense face reconstruction algorithm using real accurate and highresolution 3d ground truth face scans in addition to the dataset we provide a standard protocol as well as a python script for the evaluation last we report the results obtained by three stateoftheart 3d face reconstruction systems on the new benchmark dataset the competition is organised along with the 2018 13th ieee conference on automatic face gesture recognition
|
[['this', 'paper', 'investigates', 'the', 'evaluation', 'of', 'dense', '3d', 'face', 'reconstruction', 'from', 'a', 'single', '2d', 'image', 'in', 'the', 'wild', 'to', 'this', 'end', 'we', 'organise', 'a', 'competition', 'that', 'provides', 'a', 'new', 'benchmark', 'dataset', 'that', 'contains', '2000', '2d', 'facial', 'images', 'of', '135', 'subjects', 'as', 'well', 'as', 'their', '3d', 'ground', 'truth', 'face', 'scans', 'in', 'contrast', 'to', 'previous', 'competitions', 'or', 'challenges', 'the', 'aim', 'of', 'this', 'new', 'benchmark', 'dataset', 'is', 'to', 'evaluate', 'the', 'accuracy', 'of', 'a', '3d', 'dense', 'face', 'reconstruction', 'algorithm', 'using', 'real', 'accurate', 'and', 'highresolution', '3d', 'ground', 'truth', 'face', 'scans', 'in', 'addition', 'to', 'the', 'dataset', 'we', 'provide', 'a', 'standard', 'protocol', 'as', 'well', 'as', 'a', 'python', 'script', 'for', 'the', 'evaluation', 'last', 'we', 'report', 'the', 'results', 'obtained', 'by', 'three', 'stateoftheart', '3d', 'face', 'reconstruction', 'systems', 'on', 'the', 'new', 'benchmark', 'dataset', 'the', 'competition', 'is', 'organised', 'along', 'with', 'the', '2018', '13th', 'ieee', 'conference', 'on', 'automatic', 'face', 'gesture', 'recognition']]
|
[-0.0571450325390459, -0.06615056409508975, -0.011928584411456857, 0.015131809137106968, -0.060632991466158324, -0.13018073625457677, -0.0018370851622961893, 0.40612881088062475, -0.20289067529897759, -0.37947538214317267, 0.13938320904339163, -0.3163432753442422, -0.16021524994141437, 0.21376232488883956, -0.16002254223154075, 0.10255613211758327, 0.20469081219609664, 0.038430936791659064, -0.06553179158916042, -0.28158349225945445, 0.28306024136743846, 0.014788161163501765, 0.3321088941268407, 0.04852786427026318, 0.10353128221965786, -0.02776456913283176, -0.029060305573680587, -0.006945165211631768, -0.07375038878376801, 0.17534042517587112, 0.263706126376865, 0.19710378392694006, 0.24901864740008867, -0.39372651272898784, -0.1479480964894258, 0.009301416521918947, 0.12194030428899155, 0.14391635706398528, -0.08723763839267465, -0.3934512284273903, 0.08606861309954843, -0.16733658032329835, -0.006060931119608922, -0.09302025787748289, -0.005811462518792815, -0.060243995738742145, -0.2863534053828081, 0.06908274715617839, 0.011729199329620578, 0.1768118881256036, -0.08459606565589058, -0.10986453678418437, 0.015225080927611207, 0.22971912599303693, -0.012033344987962071, 0.11792815560002581, 0.10427750728390031, -0.21528284387439245, -0.16706055115260507, 0.4474226239245331, -0.05921393574849851, -0.15059250094455437, 0.2434814726744873, -0.07181496837216875, -0.13657928969832542, 0.11208532975338724, 0.25625245997925167, 0.1295904901985457, -0.14797504471304515, 0.021528183441673256, -0.11871512212952517, 0.18445839077585202, 0.04135953706513713, -0.07903140905377307, 0.17823046981694474, 0.2585545531676515, -0.002754082336373951, 0.1665449842491754, -0.22048885301594873, -0.030007885492312304, -0.220076870335185, -0.1551456322337364, -0.20023705275472847, -0.05591230282047088, -0.040258177701089415, -0.19421411406221814, 0.46361418158166867, 0.24999275491100506, 0.19844568829875495, 0.051731708559099636, 0.37509626150806097, -0.0459230778404795, 0.05740258069472738, 0.00248462176186613, 0.17398291158041093, -0.06414905201771931, 0.14548157980881524, -0.13751250654425257, 0.017062883938838175, 0.09069749626223052]
|
1,803.05537
|
Stochastic oscillations produce dragon king avalanches in self-organized
quasi-critical systems
|
In the last decade, several models with network adaptive mechanisms (link
deletion-creation, dynamic synapses, dynamic gains) have been proposed as
examples of self-organized criticality (SOC) to explain neuronal avalanches.
However, all these systems present stochastic oscillations hovering around the
critical region that are incompatible with standard SOC. This phenomenology has
been called self-organized quasi-criticality (SOqC). Here we make a linear
stability analysis of the mean field fixed points of two SOqC systems: a fully
connected network of discrete time stochastic spiking neurons with firing rate
adaptation produced by dynamic neuronal gains and an excitable cellular
automata with depressing synapses. We find that the fixed point corresponds to
a stable focus that loses stability at criticality. We argue that when this
focus is close to become indifferent, demographic noise can elicit stochastic
oscillations that frequently fall into the absorbing state. This mechanism
interrupts the oscillations, producing both power law avalanches and dragon
king events, which appear as bands of synchronized firings in raster plots. Our
approach differs from standard SOC models in that it predicts the coexistence
of these different types of neuronal activity.
|
nlin.AO
|
in the last decade several models with network adaptive mechanisms link deletioncreation dynamic synapses dynamic gains have been proposed as examples of selforganized criticality soc to explain neuronal avalanches however all these systems present stochastic oscillations hovering around the critical region that are incompatible with standard soc this phenomenology has been called selforganized quasicriticality soqc here we make a linear stability analysis of the mean field fixed points of two soqc systems a fully connected network of discrete time stochastic spiking neurons with firing rate adaptation produced by dynamic neuronal gains and an excitable cellular automata with depressing synapses we find that the fixed point corresponds to a stable focus that loses stability at criticality we argue that when this focus is close to become indifferent demographic noise can elicit stochastic oscillations that frequently fall into the absorbing state this mechanism interrupts the oscillations producing both power law avalanches and dragon king events which appear as bands of synchronized firings in raster plots our approach differs from standard soc models in that it predicts the coexistence of these different types of neuronal activity
|
[['in', 'the', 'last', 'decade', 'several', 'models', 'with', 'network', 'adaptive', 'mechanisms', 'link', 'deletioncreation', 'dynamic', 'synapses', 'dynamic', 'gains', 'have', 'been', 'proposed', 'as', 'examples', 'of', 'selforganized', 'criticality', 'soc', 'to', 'explain', 'neuronal', 'avalanches', 'however', 'all', 'these', 'systems', 'present', 'stochastic', 'oscillations', 'hovering', 'around', 'the', 'critical', 'region', 'that', 'are', 'incompatible', 'with', 'standard', 'soc', 'this', 'phenomenology', 'has', 'been', 'called', 'selforganized', 'quasicriticality', 'soqc', 'here', 'we', 'make', 'a', 'linear', 'stability', 'analysis', 'of', 'the', 'mean', 'field', 'fixed', 'points', 'of', 'two', 'soqc', 'systems', 'a', 'fully', 'connected', 'network', 'of', 'discrete', 'time', 'stochastic', 'spiking', 'neurons', 'with', 'firing', 'rate', 'adaptation', 'produced', 'by', 'dynamic', 'neuronal', 'gains', 'and', 'an', 'excitable', 'cellular', 'automata', 'with', 'depressing', 'synapses', 'we', 'find', 'that', 'the', 'fixed', 'point', 'corresponds', 'to', 'a', 'stable', 'focus', 'that', 'loses', 'stability', 'at', 'criticality', 'we', 'argue', 'that', 'when', 'this', 'focus', 'is', 'close', 'to', 'become', 'indifferent', 'demographic', 'noise', 'can', 'elicit', 'stochastic', 'oscillations', 'that', 'frequently', 'fall', 'into', 'the', 'absorbing', 'state', 'this', 'mechanism', 'interrupts', 'the', 'oscillations', 'producing', 'both', 'power', 'law', 'avalanches', 'and', 'dragon', 'king', 'events', 'which', 'appear', 'as', 'bands', 'of', 'synchronized', 'firings', 'in', 'raster', 'plots', 'our', 'approach', 'differs', 'from', 'standard', 'soc', 'models', 'in', 'that', 'it', 'predicts', 'the', 'coexistence', 'of', 'these', 'different', 'types', 'of', 'neuronal', 'activity']]
|
[-0.16073590322592102, 0.15303109029116388, -0.046855371053954896, 0.07592422522701692, -0.025872585977744927, -0.21209722919553353, 0.07561637223621441, 0.36453561394751727, -0.26014148920856334, -0.2541861405268639, 0.0764698182945242, -0.2579874964328585, -0.25540840802304854, 0.15258137788111856, -0.07766640172829303, 0.03024528543516011, 0.03532486109211427, 0.0015499165926415187, 0.012192855555830258, -0.21687364622638408, 0.2601810084492132, 0.05652491501174294, 0.31649979555232266, -0.046650477997820496, 0.09506773795922296, -0.08034323038185363, 0.027339788322633767, 0.038316001231618387, -0.07727443985848888, 0.05448412948165212, 0.27434250354373624, 0.08472827959685474, 0.30018491176004036, -0.48372896611792865, -0.2869751740165137, 0.1284590213365116, 0.1527783050949258, 0.11049349045132768, -0.014918502266672287, -0.2730272856674024, 0.0958417878507964, -0.1689528371508049, -0.08605425680634453, -0.07384502629629223, 0.04282124561147641, 0.08662033923274766, -0.25001216016244143, 0.07372646144614299, 0.0940759095525149, 0.10583553696690885, -0.054535680712793334, -0.05119525934416023, -0.04629752959590405, 0.13374773428246384, 0.03150622720784088, -0.015745264396792955, 0.18228338500177796, -0.10596135683270724, -0.17382194267094628, 0.2993080248969228, -0.027774785395684794, -0.13560689514845733, 0.2221743536928853, -0.12828690999515027, -0.1444852872442065, 0.1561181337961538, 0.1951749705930834, 0.013654295642481884, -0.1591462284409867, 0.014529474316917073, -0.023843596455293124, 0.19316658059376227, 0.04394573525648441, 0.016978191321838525, 0.23835365039777462, 0.24495757438861612, 0.04987912767715138, 0.10627254834500971, -0.08818841047884364, -0.1783378406959985, -0.2389198769111657, -0.03712135291873263, -0.1214240141400676, 0.03844256253125003, -0.08042390388036838, -0.17153182144757811, 0.42266636539844205, 0.15792540371530578, 0.20650390863858656, 0.09161071340709535, 0.2269451354098107, 0.1077999587875668, 0.07423081568948883, 0.1012420972203452, 0.24310238498191422, 0.08631885376666765, 0.16954288300853426, -0.22004828219440162, 0.08772668454272846, 0.022063161427897764]
|
1,803.05538
|
Optimally band-limited spectroscopy of control noise using a qubit
sensor
|
Classical control noise is ubiquitous in qubit devices, making its accurate
spectral characterization essential for designing optimized error suppression
strategies at the physical level. Here, we focus on multiplicative Gaussian
amplitude control noise on a driven qubit sensor and show that sensing
protocols using optimally band-limited Slepian modulation offer substantial
benefit in realistic scenarios. Special emphasis is given to laying out the
theoretical framework necessary for extending non-parametric multitaper
spectral estimation to the quantum setting by highlighting key points of
contact and differences with respect to the classical formulation. In
particular, we introduce and analyze two approaches (adaptive vs.
single-setting) to quantum multitaper estimation, and show how they provide a
practical means to both identify fine spectral features not otherwise
detectable by existing protocols and to obtain reliable prior estimates for use
in subsequent parametric estimation, including high-resolution Bayesian
techniques. We quantitatively characterize the performance of both single- and
multitaper Slepian estimation protocols by numerically reconstructing
representative spectral densities, and demonstrate their advantage over
dynamical-decoupling noise spectroscopy approaches in reducing bias from
spectral leakage as well as in compensating for aliasing effects while
maintaining a desired sampling resolution.
|
quant-ph
|
classical control noise is ubiquitous in qubit devices making its accurate spectral characterization essential for designing optimized error suppression strategies at the physical level here we focus on multiplicative gaussian amplitude control noise on a driven qubit sensor and show that sensing protocols using optimally bandlimited slepian modulation offer substantial benefit in realistic scenarios special emphasis is given to laying out the theoretical framework necessary for extending nonparametric multitaper spectral estimation to the quantum setting by highlighting key points of contact and differences with respect to the classical formulation in particular we introduce and analyze two approaches adaptive vs singlesetting to quantum multitaper estimation and show how they provide a practical means to both identify fine spectral features not otherwise detectable by existing protocols and to obtain reliable prior estimates for use in subsequent parametric estimation including highresolution bayesian techniques we quantitatively characterize the performance of both single and multitaper slepian estimation protocols by numerically reconstructing representative spectral densities and demonstrate their advantage over dynamicaldecoupling noise spectroscopy approaches in reducing bias from spectral leakage as well as in compensating for aliasing effects while maintaining a desired sampling resolution
|
[['classical', 'control', 'noise', 'is', 'ubiquitous', 'in', 'qubit', 'devices', 'making', 'its', 'accurate', 'spectral', 'characterization', 'essential', 'for', 'designing', 'optimized', 'error', 'suppression', 'strategies', 'at', 'the', 'physical', 'level', 'here', 'we', 'focus', 'on', 'multiplicative', 'gaussian', 'amplitude', 'control', 'noise', 'on', 'a', 'driven', 'qubit', 'sensor', 'and', 'show', 'that', 'sensing', 'protocols', 'using', 'optimally', 'bandlimited', 'slepian', 'modulation', 'offer', 'substantial', 'benefit', 'in', 'realistic', 'scenarios', 'special', 'emphasis', 'is', 'given', 'to', 'laying', 'out', 'the', 'theoretical', 'framework', 'necessary', 'for', 'extending', 'nonparametric', 'multitaper', 'spectral', 'estimation', 'to', 'the', 'quantum', 'setting', 'by', 'highlighting', 'key', 'points', 'of', 'contact', 'and', 'differences', 'with', 'respect', 'to', 'the', 'classical', 'formulation', 'in', 'particular', 'we', 'introduce', 'and', 'analyze', 'two', 'approaches', 'adaptive', 'vs', 'singlesetting', 'to', 'quantum', 'multitaper', 'estimation', 'and', 'show', 'how', 'they', 'provide', 'a', 'practical', 'means', 'to', 'both', 'identify', 'fine', 'spectral', 'features', 'not', 'otherwise', 'detectable', 'by', 'existing', 'protocols', 'and', 'to', 'obtain', 'reliable', 'prior', 'estimates', 'for', 'use', 'in', 'subsequent', 'parametric', 'estimation', 'including', 'highresolution', 'bayesian', 'techniques', 'we', 'quantitatively', 'characterize', 'the', 'performance', 'of', 'both', 'single', 'and', 'multitaper', 'slepian', 'estimation', 'protocols', 'by', 'numerically', 'reconstructing', 'representative', 'spectral', 'densities', 'and', 'demonstrate', 'their', 'advantage', 'over', 'dynamicaldecoupling', 'noise', 'spectroscopy', 'approaches', 'in', 'reducing', 'bias', 'from', 'spectral', 'leakage', 'as', 'well', 'as', 'in', 'compensating', 'for', 'aliasing', 'effects', 'while', 'maintaining', 'a', 'desired', 'sampling', 'resolution']]
|
[-0.06793923676963323, 0.03736147356473587, -0.06770189774825293, 0.08491769315610156, -0.04150329263168661, -0.20609437613025866, 0.08331899868976823, 0.4420588815218724, -0.2573174427656885, -0.3170386377493552, 0.11600383116121599, -0.20370654348921488, -0.15293941666735686, 0.23205600780021537, -0.14602095658148834, 0.11913935105001335, 0.055685691379837414, -0.03962849214642538, -0.09496500099234702, -0.2046639314836469, 0.26404827124723057, 0.10001649572090669, 0.32055856927825926, 0.0002561619475404209, 0.09521936483419423, 0.05606635179665415, -0.09668070502967678, -0.016829871184088012, -0.13972608243722381, 0.11136802562069208, 0.29924461612213943, 0.11342443110929294, 0.31329155298955935, -0.39411223211131474, -0.27373119210513097, 0.08929573907143372, 0.16732923573948802, 0.12135057137123642, -0.059666079258605995, -0.2827961165059537, 0.07962513123614026, -0.12850182274677716, -0.05966650210512381, -0.15650929564505536, -0.06021716621490245, 0.019948873434522073, -0.30057124292756865, 0.06970572108801275, 0.03692799353446652, 0.06552121078316621, -0.026582750764860334, -0.11836255181775016, 0.04958435938068551, 0.1455962733330733, -0.04832778351984041, -0.03501699545796099, 0.15057763350314465, -0.1300058336393101, -0.13121554424567894, 0.3307557304107763, -0.05712144672347701, -0.22090541133109262, 0.143568956283205, -0.09631950492948234, -0.11371829102991178, 0.11641265045995276, 0.1665015398440036, 0.07528770117607107, -0.14006891539432406, 0.052007417477490527, 0.09050943237545098, 0.17045386307399701, 0.06311934158445041, 0.12280837815992016, 0.16714752318442147, 0.16845710115771204, 0.10908436637750284, 0.1315175188819873, -0.13972929503798565, -0.10558714332397688, -0.24359071864821216, -0.08835976807340509, -0.1867292572390587, 0.023692816356523833, -0.09672672833313849, -0.15524533133142016, 0.39696036229398163, 0.20345776593549186, 0.1682532393326236, 0.045949145937388275, 0.3840271861835278, 0.10942055506975375, 0.014896225062183997, 0.0583466748223904, 0.21975574103609863, 0.15519054047452077, 0.06966335225892677, -0.22149926183787597, 0.06311312540095639, -0.015031548802128291]
|
1,803.05539
|
Tutte Invariants for Alternating Dimaps
|
An alternating dimap is an orientably embedded Eulerian directed graph where
the edges incident with each vertex are directed inwards and outwards
alternately. Three reduction operations for alternating dimaps were
investigated by Farr. A minor of an alternating dimap can be obtained by
reducing some of its edges using the reduction operations. Unlike classical
minor operations, these reduction operations do not commute in general. A Tutte
invariant for alternating dimaps is a function $ P $ defined on every
alternating dimap and taking values in a field such that $ P $ is invariant
under isomorphism and obeys a linear recurrence relation involving reduction
operations. It is well known that if a graph $ G $ is planar, then the Tutte
polynomial $ T $ satisfies $ T(G;x,y)=T(G^{*};y,x) $. We note an analogous
relation for the extended Tutte invariants for alternating dimaps introduced by
Farr. We then characterise the Tutte invariant for alternating dimaps of genus
zero under several conditions. As a result of the non-commutativity of the
reduction operations, the recursions based on them cannot always be satisfied.
We investigate the properties of alternating dimaps of genus zero that are
required in order to obtain a well defined Tutte invariant. Some excluded minor
characterisations for these alternating dimaps are also given.
|
math.CO cs.DM
|
an alternating dimap is an orientably embedded eulerian directed graph where the edges incident with each vertex are directed inwards and outwards alternately three reduction operations for alternating dimaps were investigated by farr a minor of an alternating dimap can be obtained by reducing some of its edges using the reduction operations unlike classical minor operations these reduction operations do not commute in general a tutte invariant for alternating dimaps is a function p defined on every alternating dimap and taking values in a field such that p is invariant under isomorphism and obeys a linear recurrence relation involving reduction operations it is well known that if a graph g is planar then the tutte polynomial t satisfies tgxytgyx we note an analogous relation for the extended tutte invariants for alternating dimaps introduced by farr we then characterise the tutte invariant for alternating dimaps of genus zero under several conditions as a result of the noncommutativity of the reduction operations the recursions based on them cannot always be satisfied we investigate the properties of alternating dimaps of genus zero that are required in order to obtain a well defined tutte invariant some excluded minor characterisations for these alternating dimaps are also given
|
[['an', 'alternating', 'dimap', 'is', 'an', 'orientably', 'embedded', 'eulerian', 'directed', 'graph', 'where', 'the', 'edges', 'incident', 'with', 'each', 'vertex', 'are', 'directed', 'inwards', 'and', 'outwards', 'alternately', 'three', 'reduction', 'operations', 'for', 'alternating', 'dimaps', 'were', 'investigated', 'by', 'farr', 'a', 'minor', 'of', 'an', 'alternating', 'dimap', 'can', 'be', 'obtained', 'by', 'reducing', 'some', 'of', 'its', 'edges', 'using', 'the', 'reduction', 'operations', 'unlike', 'classical', 'minor', 'operations', 'these', 'reduction', 'operations', 'do', 'not', 'commute', 'in', 'general', 'a', 'tutte', 'invariant', 'for', 'alternating', 'dimaps', 'is', 'a', 'function', 'p', 'defined', 'on', 'every', 'alternating', 'dimap', 'and', 'taking', 'values', 'in', 'a', 'field', 'such', 'that', 'p', 'is', 'invariant', 'under', 'isomorphism', 'and', 'obeys', 'a', 'linear', 'recurrence', 'relation', 'involving', 'reduction', 'operations', 'it', 'is', 'well', 'known', 'that', 'if', 'a', 'graph', 'g', 'is', 'planar', 'then', 'the', 'tutte', 'polynomial', 't', 'satisfies', 'tgxytgyx', 'we', 'note', 'an', 'analogous', 'relation', 'for', 'the', 'extended', 'tutte', 'invariants', 'for', 'alternating', 'dimaps', 'introduced', 'by', 'farr', 'we', 'then', 'characterise', 'the', 'tutte', 'invariant', 'for', 'alternating', 'dimaps', 'of', 'genus', 'zero', 'under', 'several', 'conditions', 'as', 'a', 'result', 'of', 'the', 'noncommutativity', 'of', 'the', 'reduction', 'operations', 'the', 'recursions', 'based', 'on', 'them', 'can', 'not', 'always', 'be', 'satisfied', 'we', 'investigate', 'the', 'properties', 'of', 'alternating', 'dimaps', 'of', 'genus', 'zero', 'that', 'are', 'required', 'in', 'order', 'to', 'obtain', 'a', 'well', 'defined', 'tutte', 'invariant', 'some', 'excluded', 'minor', 'characterisations', 'for', 'these', 'alternating', 'dimaps', 'are', 'also', 'given']]
|
[-0.2085389228685215, 0.1677544390264608, -0.07801512515836276, 0.06585323894546266, -0.10702174269976925, -0.15076116881204196, 0.009346053453789341, 0.38026888625544153, -0.33217322191979626, -0.282174415068037, 0.11112190365599985, -0.23887047106123502, -0.17381255011452307, 0.17729097054545112, -0.08651452775039517, 0.02833013255115988, 0.04539939858674044, 0.06753129897279536, -0.12163200041067114, -0.3059733232871127, 0.2554395138193844, -0.03727732189137968, 0.17383678666763192, 0.04024673113541788, 0.10234074431729714, 0.06745683247371033, -0.01558878791223437, 0.08665208983820595, -0.13258412788966573, 0.06199811364865244, 0.24551476705427475, 0.08733062592155236, 0.1727437234799479, -0.4221323484819703, -0.10535273410721065, 0.16333703681109657, 0.1323628210863744, 0.02191604396309888, -0.015310850989426219, -0.2082208013715278, 0.11784332737990535, -0.14571111416732338, -0.10225700590722632, -0.04950154994586759, 0.04845518843411459, 0.05293879877271057, -0.2633960236781415, 0.005029925804943686, 0.153534563314769, 0.11032285530691838, 0.022298852516001662, -0.14113165841767528, -0.05073676143754458, 0.07582006924304091, -0.026145665219404025, 0.07642234792923647, 0.0872808351814816, -0.09955100431383615, -0.17499339455591129, 0.3435143102190946, -0.04172653508877455, -0.22704846671976076, 0.13382721815078455, -0.08398902409774538, -0.20428318037803625, 0.11017269451870804, 0.0718498645041433, 0.14169702263051034, -0.11471388057694945, 0.12548559489527414, -0.12385077828237105, 0.08000733413373923, 0.14569293220970078, -0.06447254811583022, 0.13184229743270443, 0.04579863091584959, 0.15647281562370055, 0.21342247511873408, 0.013207396574054458, -0.03763448170243329, -0.28673794623095505, -0.17681806635441222, -0.1668537977718665, 0.060565908059234605, -0.11568658819428176, -0.16369263358220532, 0.3880528888231752, 0.04344008732581336, 0.18020493939454382, 0.11478777023926746, 0.2583609442445588, 0.15093926148947864, 0.10674693165946346, 0.11557920875332069, 0.14340239448506284, 0.20815525901167295, -0.011977692738654885, -0.16295841213149748, 0.08164881999687393, 0.18792043502516306]
|
1,803.0554
|
Generation of quasi continuous-wave electron beams in an L-band normal
conducting pulsed RF injector for laboratory astrophysics experiments
|
We report on an approach to produce quasi continuous-wave (cw) electron beams
with an average beam current of milliamperes and a mean beam energy of a few
MeV in a pulsed RF injector. Potential applications are in the planned
laboratory astrophysics programs at DESY. The beam generation is based on field
emission from a specially designed metallic field emitter. A quasi cw beam
profile is formed over subsequent RF cycles at the resonance frequency of the
gun cavity. This is realized by debunching in a cut disk structure accelerating
cavity (booster) downstream of the gun. The peak and average beam currents can
be tuned in beam dynamics simulations by adjusting operation conditions of the
booster cavity. Optimization of the transverse beam size at specific positions
(e.g., entrance of the plasma experiment) is performed by applying magnetic
focusing fields provided by solenoids along the beam line. In this paper, the
design of a microtip field emitter is introduced and characterized in
electromagnetic field simulations in the gun cavity. A series of particle
tracking simulations are conducted for multi-parametric optimization of the
parameters of the produced quasi cw electron beams. The obtained results will
be presented and discussed. In addition, measurements of the parasitic field
emission (PFE) current (dark current) in the PITZ gun will be exemplarily shown
to distinguish its order of magnitude from the produced beam current by the
designed field emitter.
|
physics.acc-ph
|
we report on an approach to produce quasi continuouswave cw electron beams with an average beam current of milliamperes and a mean beam energy of a few mev in a pulsed rf injector potential applications are in the planned laboratory astrophysics programs at desy the beam generation is based on field emission from a specially designed metallic field emitter a quasi cw beam profile is formed over subsequent rf cycles at the resonance frequency of the gun cavity this is realized by debunching in a cut disk structure accelerating cavity booster downstream of the gun the peak and average beam currents can be tuned in beam dynamics simulations by adjusting operation conditions of the booster cavity optimization of the transverse beam size at specific positions eg entrance of the plasma experiment is performed by applying magnetic focusing fields provided by solenoids along the beam line in this paper the design of a microtip field emitter is introduced and characterized in electromagnetic field simulations in the gun cavity a series of particle tracking simulations are conducted for multiparametric optimization of the parameters of the produced quasi cw electron beams the obtained results will be presented and discussed in addition measurements of the parasitic field emission pfe current dark current in the pitz gun will be exemplarily shown to distinguish its order of magnitude from the produced beam current by the designed field emitter
|
[['we', 'report', 'on', 'an', 'approach', 'to', 'produce', 'quasi', 'continuouswave', 'cw', 'electron', 'beams', 'with', 'an', 'average', 'beam', 'current', 'of', 'milliamperes', 'and', 'a', 'mean', 'beam', 'energy', 'of', 'a', 'few', 'mev', 'in', 'a', 'pulsed', 'rf', 'injector', 'potential', 'applications', 'are', 'in', 'the', 'planned', 'laboratory', 'astrophysics', 'programs', 'at', 'desy', 'the', 'beam', 'generation', 'is', 'based', 'on', 'field', 'emission', 'from', 'a', 'specially', 'designed', 'metallic', 'field', 'emitter', 'a', 'quasi', 'cw', 'beam', 'profile', 'is', 'formed', 'over', 'subsequent', 'rf', 'cycles', 'at', 'the', 'resonance', 'frequency', 'of', 'the', 'gun', 'cavity', 'this', 'is', 'realized', 'by', 'debunching', 'in', 'a', 'cut', 'disk', 'structure', 'accelerating', 'cavity', 'booster', 'downstream', 'of', 'the', 'gun', 'the', 'peak', 'and', 'average', 'beam', 'currents', 'can', 'be', 'tuned', 'in', 'beam', 'dynamics', 'simulations', 'by', 'adjusting', 'operation', 'conditions', 'of', 'the', 'booster', 'cavity', 'optimization', 'of', 'the', 'transverse', 'beam', 'size', 'at', 'specific', 'positions', 'eg', 'entrance', 'of', 'the', 'plasma', 'experiment', 'is', 'performed', 'by', 'applying', 'magnetic', 'focusing', 'fields', 'provided', 'by', 'solenoids', 'along', 'the', 'beam', 'line', 'in', 'this', 'paper', 'the', 'design', 'of', 'a', 'microtip', 'field', 'emitter', 'is', 'introduced', 'and', 'characterized', 'in', 'electromagnetic', 'field', 'simulations', 'in', 'the', 'gun', 'cavity', 'a', 'series', 'of', 'particle', 'tracking', 'simulations', 'are', 'conducted', 'for', 'multiparametric', 'optimization', 'of', 'the', 'parameters', 'of', 'the', 'produced', 'quasi', 'cw', 'electron', 'beams', 'the', 'obtained', 'results', 'will', 'be', 'presented', 'and', 'discussed', 'in', 'addition', 'measurements', 'of', 'the', 'parasitic', 'field', 'emission', 'pfe', 'current', 'dark', 'current', 'in', 'the', 'pitz', 'gun', 'will', 'be', 'exemplarily', 'shown', 'to', 'distinguish', 'its', 'order', 'of', 'magnitude', 'from', 'the', 'produced', 'beam', 'current', 'by', 'the', 'designed', 'field', 'emitter']]
|
[-0.14492616412034298, 0.17131409121894486, -0.05368204825271518, 0.017999480058664852, -0.014205999822215706, -0.15632377502617317, -0.011397659271104801, 0.44657093860628283, -0.21250711592696445, -0.31772454057162974, 0.06245041223347703, -0.22868772854552769, 0.017784178410193106, 0.27551719747121883, 0.02883840427488024, 0.05997483079383796, 0.05969834870364501, -0.019933799144638564, -0.015280650310254619, -0.1519748848284397, 0.2629698089463032, 0.16914279588338924, 0.3163661484483597, 0.050631891947654904, 0.12767321584359198, -0.0064574358753005275, 0.01738456834623695, -0.012330862574553464, -0.10027725727908925, 0.046827369690086544, 0.22199724871439463, 0.07463587525812708, 0.22920554750336908, -0.45196960193157454, -0.20048398184499328, 0.05469965214339121, 0.13249651352728534, 0.08421050859763876, -0.1197992725856199, -0.284723295617518, 0.0363411730139222, -0.1468216400004891, -0.163238583731332, 0.02534361094139613, -0.07575398968891503, 0.1045645599543758, -0.28273740366178873, -0.016114468220621347, 0.018146765817488943, 0.08878082165180089, -0.018616615579407098, -0.08368058356121827, 0.012283755956193456, 0.0068639534121395385, 0.012175530105530893, 0.07865023323298469, 0.22708163234819476, -0.1437336612584521, -0.13702487732783702, 0.34240635426400545, -0.0782948347111938, -0.12355928553985956, 0.11517462273354107, -0.2201156855562855, 0.008188843735175215, 0.19065727521282383, 0.1941239837399841, 0.08984863483024463, -0.133729878871236, 0.02300541069322302, 0.013321470283022255, 0.16868636960736214, 0.1317661493498574, -0.03303591825029696, 0.26843184938460785, 0.19087694345034045, 0.051521175689652594, 0.1689894212126627, -0.15561188050461086, -0.011674744867239937, -0.3015668744713197, -0.10640267834462451, -0.15777349222886872, 0.03496296627313963, 0.03518087772867447, -0.08912061834826288, 0.4753837672211391, 0.09710238625914579, 0.12234296377554729, -0.09115079650050634, 0.3361661934477249, 0.11631185642002126, 0.07138864972928007, 0.013369361251124959, 0.29402194624500616, 0.15985218741229507, 0.15064949047342507, -0.25185239891364397, -0.02948990050759731, -0.016702933014205203]
|
1,803.05541
|
Context-Aware Mixed Reality: A Framework for Ubiquitous Interaction
|
Mixed Reality (MR) is a powerful interactive technology that yields new types
of user experience. We present a semantic based interactive MR framework that
exceeds the current geometry level approaches, a step change in generating
high-level context-aware interactions. Our key insight is to build semantic
understanding in MR that not only can greatly enhance user experience through
object-specific behaviours, but also pave the way for solving complex
interaction design challenges. The framework generates semantic properties of
the real world environment through dense scene reconstruction and deep image
understanding. We demonstrate our approach with a material-aware prototype
system for generating context-aware physical interactions between the real and
the virtual objects. Quantitative and qualitative evaluations are carried out
and the results show that the framework delivers accurate and fast semantic
information in interactive MR environment, providing effective semantic level
interactions.
|
cs.CV
|
mixed reality mr is a powerful interactive technology that yields new types of user experience we present a semantic based interactive mr framework that exceeds the current geometry level approaches a step change in generating highlevel contextaware interactions our key insight is to build semantic understanding in mr that not only can greatly enhance user experience through objectspecific behaviours but also pave the way for solving complex interaction design challenges the framework generates semantic properties of the real world environment through dense scene reconstruction and deep image understanding we demonstrate our approach with a materialaware prototype system for generating contextaware physical interactions between the real and the virtual objects quantitative and qualitative evaluations are carried out and the results show that the framework delivers accurate and fast semantic information in interactive mr environment providing effective semantic level interactions
|
[['mixed', 'reality', 'mr', 'is', 'a', 'powerful', 'interactive', 'technology', 'that', 'yields', 'new', 'types', 'of', 'user', 'experience', 'we', 'present', 'a', 'semantic', 'based', 'interactive', 'mr', 'framework', 'that', 'exceeds', 'the', 'current', 'geometry', 'level', 'approaches', 'a', 'step', 'change', 'in', 'generating', 'highlevel', 'contextaware', 'interactions', 'our', 'key', 'insight', 'is', 'to', 'build', 'semantic', 'understanding', 'in', 'mr', 'that', 'not', 'only', 'can', 'greatly', 'enhance', 'user', 'experience', 'through', 'objectspecific', 'behaviours', 'but', 'also', 'pave', 'the', 'way', 'for', 'solving', 'complex', 'interaction', 'design', 'challenges', 'the', 'framework', 'generates', 'semantic', 'properties', 'of', 'the', 'real', 'world', 'environment', 'through', 'dense', 'scene', 'reconstruction', 'and', 'deep', 'image', 'understanding', 'we', 'demonstrate', 'our', 'approach', 'with', 'a', 'materialaware', 'prototype', 'system', 'for', 'generating', 'contextaware', 'physical', 'interactions', 'between', 'the', 'real', 'and', 'the', 'virtual', 'objects', 'quantitative', 'and', 'qualitative', 'evaluations', 'are', 'carried', 'out', 'and', 'the', 'results', 'show', 'that', 'the', 'framework', 'delivers', 'accurate', 'and', 'fast', 'semantic', 'information', 'in', 'interactive', 'mr', 'environment', 'providing', 'effective', 'semantic', 'level', 'interactions']]
|
[-0.10671132708981253, 0.019170672811200693, -0.11284132354109323, 0.08200958704603088, -0.1476996299423223, -0.1509200552627988, 0.037231787697609216, 0.42797431042145967, -0.2443268048801344, -0.3772594974695766, -0.013157304205564633, -0.24276710990952313, -0.24228712114723006, 0.22804898190835532, -0.06007559780867593, 0.01895252435321981, 0.14835526563743823, 0.019605477814678186, -0.05203695538841242, -0.21026222656283827, 0.30502980696201787, 0.0408174087219943, 0.3481507382430408, 0.0978352779711182, 0.11332456923232678, 0.030145764804655945, -0.0433319064467316, 0.014530709450431407, -0.03284432412397939, 0.18462715715333058, 0.3307888370052313, 0.22195960997338712, 0.29078282655155574, -0.4426604342667291, -0.2176080739472306, -0.005816321789429788, 0.1506725035545783, 0.08037772022840316, -0.1345131313904141, -0.3832923207758334, 0.0942856374818723, -0.15988836411631455, -0.04741928130252301, -0.1693946719373556, -0.030747319292956894, -0.024789192927933305, -0.28749458787854026, 0.017537346965018116, 0.07618910775785029, 0.08366844874133703, -0.06866768603960909, -0.0653914062936797, 0.03192656962744837, 0.23658177911229158, -0.04934087635976446, 0.052363914921522876, 0.18596959959063, -0.21020057436969322, -0.1161403394283822, 0.3656391327126618, -0.013629769440740347, -0.1986825381589197, 0.2512844108099485, -0.07285788041763823, -0.12114911454722938, 0.11533635974875277, 0.2208872319974114, 0.08519669547405122, -0.17873268881064913, 0.02920731240127195, -0.012462741270471011, 0.20715090447873638, -0.028566550727709313, 0.037909864631556246, 0.24827672190366, 0.27417236450978005, 0.02583691686473406, 0.10327427135185631, -0.05330427222456919, -0.10778983665526552, -0.24360821721055648, -0.19420537641210342, -0.12826446121062296, -0.029463055565588713, -0.1115238344577017, -0.12582259335942622, 0.3813674452163986, 0.27464698991452746, 0.1866740199421145, 0.056868420009684825, 0.37747333167515096, 0.04068754218299074, 0.07913871862021458, 0.050803323439492364, 0.17182606478378068, 0.003164445977984336, 0.17729542573003004, -0.16600830652700044, 0.10741736347120881, 0.0670122034137348]
|
1,803.05542
|
A Game-Theoretic Framework for the Virtual Machines Migration Timing
Problem
|
In a multi-tenant cloud, a number of Virtual Machines (VMs) are collocated on
the same physical machine to optimize performance, power consumption and
maximize profit. This, however, increases the risk of a malicious VM performing
side-channel attacks and leaking sensitive information from neighboring VMs. To
this end, this paper develops and analyzes a game-theoretic framework for the
VM migration timing problem in which the cloud provider decides \emph{when} to
migrate a VM to a different physical machine to reduce the risk of being
compromised by a collocated malicious VM. The adversary decides the rate at
which she launches new VMs to collocate with the victim VMs. Our formulation
captures a data leakage model in which the cost incurred by the cloud provider
depends on the duration of collocation with malicious VMs. It also captures
costs incurred by the adversary in launching new VMs and by the defender in
migrating VMs. We establish sufficient conditions for the existence of Nash
equilibria for general cost functions, as well as for specific instantiations,
and characterize the best response for both players. Furthermore, we extend our
model to characterize its impact on the attacker's payoff when the cloud
utilizes intrusion detection systems that detect side-channel attacks. Our
theoretical findings are corroborated with extensive numerical results in
various settings.
|
cs.CR cs.GT
|
in a multitenant cloud a number of virtual machines vms are collocated on the same physical machine to optimize performance power consumption and maximize profit this however increases the risk of a malicious vm performing sidechannel attacks and leaking sensitive information from neighboring vms to this end this paper develops and analyzes a gametheoretic framework for the vm migration timing problem in which the cloud provider decides emphwhen to migrate a vm to a different physical machine to reduce the risk of being compromised by a collocated malicious vm the adversary decides the rate at which she launches new vms to collocate with the victim vms our formulation captures a data leakage model in which the cost incurred by the cloud provider depends on the duration of collocation with malicious vms it also captures costs incurred by the adversary in launching new vms and by the defender in migrating vms we establish sufficient conditions for the existence of nash equilibria for general cost functions as well as for specific instantiations and characterize the best response for both players furthermore we extend our model to characterize its impact on the attackers payoff when the cloud utilizes intrusion detection systems that detect sidechannel attacks our theoretical findings are corroborated with extensive numerical results in various settings
|
[['in', 'a', 'multitenant', 'cloud', 'a', 'number', 'of', 'virtual', 'machines', 'vms', 'are', 'collocated', 'on', 'the', 'same', 'physical', 'machine', 'to', 'optimize', 'performance', 'power', 'consumption', 'and', 'maximize', 'profit', 'this', 'however', 'increases', 'the', 'risk', 'of', 'a', 'malicious', 'vm', 'performing', 'sidechannel', 'attacks', 'and', 'leaking', 'sensitive', 'information', 'from', 'neighboring', 'vms', 'to', 'this', 'end', 'this', 'paper', 'develops', 'and', 'analyzes', 'a', 'gametheoretic', 'framework', 'for', 'the', 'vm', 'migration', 'timing', 'problem', 'in', 'which', 'the', 'cloud', 'provider', 'decides', 'emphwhen', 'to', 'migrate', 'a', 'vm', 'to', 'a', 'different', 'physical', 'machine', 'to', 'reduce', 'the', 'risk', 'of', 'being', 'compromised', 'by', 'a', 'collocated', 'malicious', 'vm', 'the', 'adversary', 'decides', 'the', 'rate', 'at', 'which', 'she', 'launches', 'new', 'vms', 'to', 'collocate', 'with', 'the', 'victim', 'vms', 'our', 'formulation', 'captures', 'a', 'data', 'leakage', 'model', 'in', 'which', 'the', 'cost', 'incurred', 'by', 'the', 'cloud', 'provider', 'depends', 'on', 'the', 'duration', 'of', 'collocation', 'with', 'malicious', 'vms', 'it', 'also', 'captures', 'costs', 'incurred', 'by', 'the', 'adversary', 'in', 'launching', 'new', 'vms', 'and', 'by', 'the', 'defender', 'in', 'migrating', 'vms', 'we', 'establish', 'sufficient', 'conditions', 'for', 'the', 'existence', 'of', 'nash', 'equilibria', 'for', 'general', 'cost', 'functions', 'as', 'well', 'as', 'for', 'specific', 'instantiations', 'and', 'characterize', 'the', 'best', 'response', 'for', 'both', 'players', 'furthermore', 'we', 'extend', 'our', 'model', 'to', 'characterize', 'its', 'impact', 'on', 'the', 'attackers', 'payoff', 'when', 'the', 'cloud', 'utilizes', 'intrusion', 'detection', 'systems', 'that', 'detect', 'sidechannel', 'attacks', 'our', 'theoretical', 'findings', 'are', 'corroborated', 'with', 'extensive', 'numerical', 'results', 'in', 'various', 'settings']]
|
[-0.16622767369298233, 0.018086496170470926, -0.06420919892517414, 0.06524078584130348, -0.08951101773179128, -0.20460764548271268, 0.20913710820904247, 0.33255890588424053, -0.28664713057201946, -0.3342974495194922, 0.09111934454097613, -0.28115443793282124, -0.10003418073593422, 0.1462505910160438, -0.15675060260849438, 0.06056454243050305, 0.060163740313472665, 0.010286598660543596, 0.03263231934261482, -0.2966810564954426, 0.3268424758946558, 0.08278350956848426, 0.2875999699044259, 0.07680459353402605, 0.05612246634788968, -0.005175141695991298, -0.001204761053341937, -0.026030825917765708, -0.053810744276701385, 0.08932581617198797, 0.28469752433718504, 0.23056871356294603, 0.368713019102394, -0.4685385835435346, -0.1911214836046239, 0.08666218169007416, 0.11093690583512848, 0.05589243119079881, -0.030070129072045575, -0.283248069931135, 0.1408586211298009, -0.2628044155099925, -0.09941982793258329, -0.053618229565506575, -0.018047200071964864, 0.06229208046001944, -0.29971111058823274, -0.03384259813282939, -0.019638317931447803, 0.043189807029584616, -0.07517216888432626, -0.06651351418483253, -0.010716055906660612, 0.18715542833510923, 0.04794473066125239, -0.01782954846145411, 0.22850103136674266, -0.13755250526222218, -0.1500985652244232, 0.38490504263377984, -0.009620212628854282, -0.16145224413708306, 0.2028832152229081, -0.009372407235243253, -0.12528443831102334, 0.09712318771096626, 0.27980187091384534, 0.11340729432902952, -0.16095513908692177, -0.003149141312988092, -0.02675612174653422, 0.17009867694083097, 0.04966318414537845, 0.030855424784039034, 0.16372464970733414, 0.18212813490274946, 0.12433588866712351, 0.15245457164775666, -0.06763582633455745, -0.12382966525870089, -0.23535707287020355, -0.1593417697129162, -0.19517828728220313, -0.0061947579613112124, -0.06761135385886094, -0.1076843843133859, 0.3665966066498109, 0.20365103210490382, 0.13500891795526607, 0.11328076312338028, 0.41052516471272527, 0.06792642331652769, 0.08124604527664449, 0.2008367265774825, 0.22055747440611403, -0.028983726216508424, 0.15029274829593706, -0.24531055705199697, 0.16937069997023335, -0.004890539129068814]
|
1,803.05543
|
Active matter invasion of a viscous fluid: unstable sheets and a no-flow
theorem
|
We investigate the dynamics of a dilute suspension of hydrodynamically
interacting motile or immotile stress-generating swimmers or particles as they
invade a surrounding viscous fluid. Colonies of aligned pusher particles are
shown to elongate in the direction of particle orientation and undergo a
cascade of transverse concentration instabilities, governed at small times by
an equation which also describes the Saffman-Taylor instability in a Hele-Shaw
cell, or Rayleigh-Taylor instability in two-dimensional flow through a porous
medium. Thin sheets of aligned pusher particles are always unstable, while
sheets of aligned puller particles can either be stable (immotile particles),
or unstable (motile particles) with a growth rate which is non-monotonic in the
force dipole strength. We also prove a surprising "no-flow theorem": a
distribution initially isotropic in orientation loses isotropy immediately but
in such a way that results in no fluid flow everywhere and for all time.
|
cond-mat.soft physics.bio-ph physics.flu-dyn q-bio.CB
|
we investigate the dynamics of a dilute suspension of hydrodynamically interacting motile or immotile stressgenerating swimmers or particles as they invade a surrounding viscous fluid colonies of aligned pusher particles are shown to elongate in the direction of particle orientation and undergo a cascade of transverse concentration instabilities governed at small times by an equation which also describes the saffmantaylor instability in a heleshaw cell or rayleightaylor instability in twodimensional flow through a porous medium thin sheets of aligned pusher particles are always unstable while sheets of aligned puller particles can either be stable immotile particles or unstable motile particles with a growth rate which is nonmonotonic in the force dipole strength we also prove a surprising noflow theorem a distribution initially isotropic in orientation loses isotropy immediately but in such a way that results in no fluid flow everywhere and for all time
|
[['we', 'investigate', 'the', 'dynamics', 'of', 'a', 'dilute', 'suspension', 'of', 'hydrodynamically', 'interacting', 'motile', 'or', 'immotile', 'stressgenerating', 'swimmers', 'or', 'particles', 'as', 'they', 'invade', 'a', 'surrounding', 'viscous', 'fluid', 'colonies', 'of', 'aligned', 'pusher', 'particles', 'are', 'shown', 'to', 'elongate', 'in', 'the', 'direction', 'of', 'particle', 'orientation', 'and', 'undergo', 'a', 'cascade', 'of', 'transverse', 'concentration', 'instabilities', 'governed', 'at', 'small', 'times', 'by', 'an', 'equation', 'which', 'also', 'describes', 'the', 'saffmantaylor', 'instability', 'in', 'a', 'heleshaw', 'cell', 'or', 'rayleightaylor', 'instability', 'in', 'twodimensional', 'flow', 'through', 'a', 'porous', 'medium', 'thin', 'sheets', 'of', 'aligned', 'pusher', 'particles', 'are', 'always', 'unstable', 'while', 'sheets', 'of', 'aligned', 'puller', 'particles', 'can', 'either', 'be', 'stable', 'immotile', 'particles', 'or', 'unstable', 'motile', 'particles', 'with', 'a', 'growth', 'rate', 'which', 'is', 'nonmonotonic', 'in', 'the', 'force', 'dipole', 'strength', 'we', 'also', 'prove', 'a', 'surprising', 'noflow', 'theorem', 'a', 'distribution', 'initially', 'isotropic', 'in', 'orientation', 'loses', 'isotropy', 'immediately', 'but', 'in', 'such', 'a', 'way', 'that', 'results', 'in', 'no', 'fluid', 'flow', 'everywhere', 'and', 'for', 'all', 'time']]
|
[-0.18257754461471146, 0.3100913990647314, -0.08796375690791239, 0.003971603405564868, -0.015601946794453802, -0.15685419296884598, -0.06459633444319479, 0.36089161746915327, -0.2850243226081754, -0.21438634237306864, 0.03297028551605763, -0.2701301784642662, -0.10630754606164475, 0.11458331656710168, -0.0064799951505847275, -0.00864186432510097, 0.04813990411477991, -0.0044695374090224504, 0.05416208204001628, -0.1456845829056369, 0.22472109293287051, 0.03483737338198504, 0.2833956781024527, 0.0052224723945578765, 0.11961455827177916, -0.044898932304931805, 0.07463500572743618, 0.11325349681363958, -0.19110261169837234, -0.011626508371490572, 0.15701729440156165, -0.044441487663587194, 0.2329836921837543, -0.5153860832279962, -0.21421070244266754, 0.09227825629770653, 0.24279253500248565, 0.12579999374186931, -0.09849340874118045, -0.23772460833748077, 0.041883889391707875, -0.14532906015261282, -0.22468355435477053, 0.000726982233269761, 0.049697983397183836, 0.10025262594798631, -0.25585294071748244, 0.17057248886380372, 0.14070535654253843, 0.040920006096712314, -0.11769801820466658, 0.00444314561092243, -0.101118163396475, 0.05315094538834981, 0.11954990308570107, 0.01493731165666961, 0.2773104151452167, -0.19411728270804612, -0.03160116470988012, 0.42933326278418665, -0.05630744445807068, -0.256071204806277, 0.2512327198831675, -0.168032783277239, -0.031647341600748606, 0.21788534046047264, 0.21555223255482917, 0.12747748021502048, -0.09129421528713363, -0.0019053635195531468, -0.08390782691357243, 0.14168919793802262, 0.1403968986770552, -0.08738057711889269, 0.29389511516395334, 0.18885094242998296, 0.06671789558216308, 0.13265199522801494, -0.03549513679182484, -0.12920571717161997, -0.21824623170606275, -0.1885308195261233, -0.14827058190146797, 0.05952145284067632, -0.08602356362886592, -0.2184472171977379, 0.3009509762131428, 0.04841809477269029, 0.19648567730716118, 0.0060462967505575055, 0.2822049087780114, 0.005531932208719404, 0.03426227636130837, 0.11219605941247816, 0.28501178382430226, 0.1297372616746644, 0.12717254178531018, -0.18681299821279632, 0.07142889059064651, 0.06384923091779153]
|
1,803.05544
|
Testing the homogeneity of risk differences with sparse count data
|
In this paper, we consider testing the homogeneity of risk differences in
independent binomial distributions especially when data are sparse. We point
out some drawback of existing tests in either controlling a nominal size or
obtaining powers through theoretical and numerical studies. The proposed test
is designed to avoid such drawback of existing tests. We present the asymptotic
null distributions and asymptotic powers for our proposed test. We also provide
numerical studies including simulations and real data examples showing the
proposed test has reliable results compared to existing testing procedures.
|
stat.ME
|
in this paper we consider testing the homogeneity of risk differences in independent binomial distributions especially when data are sparse we point out some drawback of existing tests in either controlling a nominal size or obtaining powers through theoretical and numerical studies the proposed test is designed to avoid such drawback of existing tests we present the asymptotic null distributions and asymptotic powers for our proposed test we also provide numerical studies including simulations and real data examples showing the proposed test has reliable results compared to existing testing procedures
|
[['in', 'this', 'paper', 'we', 'consider', 'testing', 'the', 'homogeneity', 'of', 'risk', 'differences', 'in', 'independent', 'binomial', 'distributions', 'especially', 'when', 'data', 'are', 'sparse', 'we', 'point', 'out', 'some', 'drawback', 'of', 'existing', 'tests', 'in', 'either', 'controlling', 'a', 'nominal', 'size', 'or', 'obtaining', 'powers', 'through', 'theoretical', 'and', 'numerical', 'studies', 'the', 'proposed', 'test', 'is', 'designed', 'to', 'avoid', 'such', 'drawback', 'of', 'existing', 'tests', 'we', 'present', 'the', 'asymptotic', 'null', 'distributions', 'and', 'asymptotic', 'powers', 'for', 'our', 'proposed', 'test', 'we', 'also', 'provide', 'numerical', 'studies', 'including', 'simulations', 'and', 'real', 'data', 'examples', 'showing', 'the', 'proposed', 'test', 'has', 'reliable', 'results', 'compared', 'to', 'existing', 'testing', 'procedures']]
|
[-0.05825189829338342, -0.022290729829627605, -0.08555320033596622, 0.08300514809994233, -0.07027632054200189, -0.12764204028062523, 0.061636405742158076, 0.393146588984463, -0.18221704471442435, -0.29554454750484893, 0.156752273607223, -0.2918856498474876, -0.12162608169277923, 0.24491639522990832, -0.08793850183590418, 0.14882598064011998, 0.10465689801817966, -0.028863223861683055, -0.09050693607164753, -0.28772977036294634, 0.2885357490507886, 0.11027968662480513, 0.34133178506874373, 0.015929676002512376, 0.06140874084731978, -0.025600536829895444, -0.1201446684025642, 0.05038155552206768, -0.14253684436488484, 0.08151960311871435, 0.2881619998771283, 0.1856311353834624, 0.3213578532398161, -0.422934743658536, -0.19820229643955828, 0.14041677004554207, 0.1254924144751082, 0.07661243377046453, -0.12036024699918926, -0.25098132533797374, 0.1375496788545408, -0.13394404717126032, -0.14329936741366206, -0.14198243445199396, -0.06639560997072193, 0.05173694487247202, -0.34997157984309724, 0.0504324328953064, 0.056832724804472594, 0.08706177814553182, -0.006025758463268479, -0.1642611111100349, 0.07782674878059576, 0.09963368169943958, 0.13309609657024138, -0.10071072708815336, 0.088387313278185, -0.07690097907195903, -0.15077952559416494, 0.3560085507006281, -0.022364643258818737, -0.26024585244142345, 0.2271291449277972, -0.1303258441802528, -0.16864572424545057, 0.05849964079550571, 0.17305152219616704, 0.1112276117110418, -0.11790628449606529, 0.049467560165794566, -0.022385293452276123, 0.12217509054688788, 0.061327221560188466, -0.010964159889974527, 0.13720760080549452, 0.18898029677932046, -0.015965800048757552, 0.1621833317162883, -0.1333095610426325, -0.09372901450842619, -0.3223575461448895, -0.13770334850996732, -0.18505263453763393, -0.004269405004257957, -0.14094213024768074, -0.14149945252057577, 0.37382747506101927, 0.23446988242018657, 0.1586888281434464, 0.0996774791015519, 0.3487329231368171, 0.0790084632178251, 0.025715639649166, 0.08074652356768233, 0.23540934777152467, 0.0695142402106689, 0.0067231542430818084, -0.171702377901723, 0.08917766876208286, -0.0286956533168753]
|
1,803.05545
|
Synthetic antiferromagnetic coupling between ultra-thin insulating
garnets
|
The use of magnetic insulators is attracting a lot of interest due to a rich
variety of spin-dependent phenomena with potential applications to spintronic
devices. Here we report ultra-thin yttrium iron garnet (YIG) / gadolinium iron
garnet (GdIG) insulating bilayers on gadolinium iron garnet (GGG). From spin
Hall magnetoresistance (SMR) and X-ray magnetic circular dichroism
measurements, we show that the YIG and GdIG magnetically couple antiparallel
even in moderate in-plane magnetic fields. The results demonstrate an
all-insulating equivalent of a synthetic antiferromagnet in a garnet-based thin
film heterostructure and could open new venues for insulators in magnetic
devices. As an example, we demonstrate a memory element with orthogonal
magnetization switching that can be read by SMR.
|
cond-mat.mtrl-sci cond-mat.mes-hall
|
the use of magnetic insulators is attracting a lot of interest due to a rich variety of spindependent phenomena with potential applications to spintronic devices here we report ultrathin yttrium iron garnet yig gadolinium iron garnet gdig insulating bilayers on gadolinium iron garnet ggg from spin hall magnetoresistance smr and xray magnetic circular dichroism measurements we show that the yig and gdig magnetically couple antiparallel even in moderate inplane magnetic fields the results demonstrate an allinsulating equivalent of a synthetic antiferromagnet in a garnetbased thin film heterostructure and could open new venues for insulators in magnetic devices as an example we demonstrate a memory element with orthogonal magnetization switching that can be read by smr
|
[['the', 'use', 'of', 'magnetic', 'insulators', 'is', 'attracting', 'a', 'lot', 'of', 'interest', 'due', 'to', 'a', 'rich', 'variety', 'of', 'spindependent', 'phenomena', 'with', 'potential', 'applications', 'to', 'spintronic', 'devices', 'here', 'we', 'report', 'ultrathin', 'yttrium', 'iron', 'garnet', 'yig', 'gadolinium', 'iron', 'garnet', 'gdig', 'insulating', 'bilayers', 'on', 'gadolinium', 'iron', 'garnet', 'ggg', 'from', 'spin', 'hall', 'magnetoresistance', 'smr', 'and', 'xray', 'magnetic', 'circular', 'dichroism', 'measurements', 'we', 'show', 'that', 'the', 'yig', 'and', 'gdig', 'magnetically', 'couple', 'antiparallel', 'even', 'in', 'moderate', 'inplane', 'magnetic', 'fields', 'the', 'results', 'demonstrate', 'an', 'allinsulating', 'equivalent', 'of', 'a', 'synthetic', 'antiferromagnet', 'in', 'a', 'garnetbased', 'thin', 'film', 'heterostructure', 'and', 'could', 'open', 'new', 'venues', 'for', 'insulators', 'in', 'magnetic', 'devices', 'as', 'an', 'example', 'we', 'demonstrate', 'a', 'memory', 'element', 'with', 'orthogonal', 'magnetization', 'switching', 'that', 'can', 'be', 'read', 'by', 'smr']]
|
[-0.1833946969013958, 0.22995342087413728, 0.056803594640068775, -0.05748346482045058, -0.12143842975271091, -0.16239197932562865, 0.03124033956401116, 0.5023336839755025, -0.2360915536868625, -0.327224731185696, 0.005550295467884074, -0.3728988142436848, -0.09097220343578838, 0.30567748857810434, 0.03662518367369091, 0.007042090783505577, -0.0475696646082998, -0.11378007576248683, -0.07624257186353536, -0.1711612175573158, 0.19270045636015723, -0.07769780394732458, 0.3527405617008629, 0.09118373546980124, 0.05270168824797183, -0.03399811690442462, 0.22892695020851309, 0.061970066931304746, -0.12755194934874678, 0.037246027095985096, 0.3019748714513483, -0.2053105678054941, 0.14669472948994192, -0.5115410452955855, -0.1638898590530178, -0.03248286173077284, 0.13047351313969202, 0.1842991247591851, -0.18913758273413653, -0.300257548739293, 0.06685170895560125, -0.18645957772479912, -0.06588245042062991, -0.1312715724044669, -0.01134684267742312, -0.02805854584115137, -0.2624835739869303, -0.019764714037785226, 0.13205301248266535, 0.1748486711289239, -0.10716400456545767, -0.15980078505797196, -0.07962592084175057, -0.027604363285895207, 0.08140841168269053, 0.05287952019330279, 0.22644706636634285, -0.08228405698952554, -0.2001701061679792, 0.29927788986371157, -0.08190636223066697, -0.06435079033593688, 0.11138868860620181, -0.2123843921447354, -0.03235912034123213, 0.13387856675328408, 0.17594018658886837, 0.16451991023495793, -0.1427536285523556, 0.099006143619566, -0.07731206639282472, 0.23381942918058485, 0.01484538600738861, 0.06716405222011088, 0.34811757624446027, 0.23515115832431918, 0.02735120103801642, 0.19429068458658041, -0.16599196318611173, 0.0991447897137563, -0.11378885787474897, -0.23173060793990055, -0.23276974369186612, 0.14776688987240855, -0.07952173163383412, -0.26609978046416577, 0.3632600458495451, 0.2004240794659518, 0.11006906809928142, -0.17020396544985408, 0.28834022167839307, 0.027215898908526364, 0.07288554871240549, -0.02950248446941903, 0.2462211359844469, 0.25577129347175687, 0.2015715475356159, -0.2819847145707107, 0.1216858744258638, -0.03354714814144953]
|
1,803.05546
|
Geometric duality and parametric duality for multiple objective linear
programs are equivalent
|
In 2011, Luc introduced parametric duality for multiple objective linear
programs. He showed that geometric duality, introduced in 2008 by Heyde and
L\"ohne, is a consequence of parametric duality. We show the converse
statement: parametric duality can be derived from geometric duality. We point
out that an easy geometric transformation embodies the relationship between
both duality theories. The advantages of each theory are discussed.
|
math.OC
|
in 2011 luc introduced parametric duality for multiple objective linear programs he showed that geometric duality introduced in 2008 by heyde and lohne is a consequence of parametric duality we show the converse statement parametric duality can be derived from geometric duality we point out that an easy geometric transformation embodies the relationship between both duality theories the advantages of each theory are discussed
|
[['in', '2011', 'luc', 'introduced', 'parametric', 'duality', 'for', 'multiple', 'objective', 'linear', 'programs', 'he', 'showed', 'that', 'geometric', 'duality', 'introduced', 'in', '2008', 'by', 'heyde', 'and', 'lohne', 'is', 'a', 'consequence', 'of', 'parametric', 'duality', 'we', 'show', 'the', 'converse', 'statement', 'parametric', 'duality', 'can', 'be', 'derived', 'from', 'geometric', 'duality', 'we', 'point', 'out', 'that', 'an', 'easy', 'geometric', 'transformation', 'embodies', 'the', 'relationship', 'between', 'both', 'duality', 'theories', 'the', 'advantages', 'of', 'each', 'theory', 'are', 'discussed']]
|
[-0.10124917302891845, 0.06178921125524539, -0.17104035824013408, 0.151067973647514, -0.117451983387582, -0.1820840994696482, 0.0434085110664455, 0.35384971818348276, -0.3165317903039977, -0.22889646826661192, 0.05611780558319879, -0.18496201663219836, -0.25668603790109046, 0.18076364637818187, -0.17096467888040934, 0.02982747962232679, -0.02402892639292986, -0.06814833694079425, -0.08997887965961127, -0.25060813317031716, 0.2676796749510686, -0.004754633002448827, 0.3440791150787845, 0.07723014955081453, 0.1469471473374142, 0.11221067728911294, -0.03866255002503749, 0.02753336996829603, -0.13497932797440626, 0.11298488519969396, 0.29246812040219083, 0.19427247670682846, 0.21826689771842211, -0.393845929618692, -0.16467680047207978, 0.0422999211732531, 0.0360774647379003, 0.060405971758882515, -0.0517094378155889, -0.2812088289647363, 0.04257074997440213, -0.16567604188458063, -0.10541871847090079, -0.07475377939408645, -0.0015099857118912041, -0.013411997820185206, -0.2700873010617215, 0.03316896510312972, 0.14132646193320397, 0.12125848213327117, -0.006274116713029798, -0.04324250806530472, -0.03859970104531385, 0.0413973706527031, 0.04369681699790817, 0.034570857729704585, 0.020302074579831242, -0.07295758142572595, -0.1707066098751966, 0.29108869783249247, -0.02128067625744734, -0.16976936682476662, 0.19899497319420334, -0.07758051776181674, -0.1807462974138616, 0.04576755681773648, 0.07296108784066746, 0.10409366315798252, -0.15045832250325475, 0.16587270733634796, -0.1324072775169043, 0.09219728320249487, 0.14568390450585866, 0.006257146851567086, 0.1814395996480016, 0.02313258103094995, 0.041871676861774176, 0.19971962398085452, -0.0028833293545176275, -0.16421103663742542, -0.3667132741475143, -0.14951947560280132, -0.13598274876130745, 0.06224341872803052, -0.08706341695483388, -0.0628431629302213, 0.2871614965988556, 0.08263568407710409, 0.15146936901146546, 0.07448263654441689, 0.20631756846705684, 0.1718465428421041, 0.025457034702412784, 0.018141792046662886, 0.28042748461302835, 0.23353198531913222, 0.04278504252579296, -0.18692912634651293, -0.012471146394091193, 0.1925610072175914]
|
1,803.05547
|
A Simple and Effective Approach to the Story Cloze Test
|
In the Story Cloze Test, a system is presented with a 4-sentence prompt to a
story, and must determine which one of two potential endings is the 'right'
ending to the story. Previous work has shown that ignoring the training set and
training a model on the validation set can achieve high accuracy on this task
due to stylistic differences between the story endings in the training set and
validation and test sets. Following this approach, we present a simpler
fully-neural approach to the Story Cloze Test using skip-thought embeddings of
the stories in a feed-forward network that achieves close to state-of-the-art
performance on this task without any feature engineering. We also find that
considering just the last sentence of the prompt instead of the whole prompt
yields higher accuracy with our approach.
|
cs.CL
|
in the story cloze test a system is presented with a 4sentence prompt to a story and must determine which one of two potential endings is the right ending to the story previous work has shown that ignoring the training set and training a model on the validation set can achieve high accuracy on this task due to stylistic differences between the story endings in the training set and validation and test sets following this approach we present a simpler fullyneural approach to the story cloze test using skipthought embeddings of the stories in a feedforward network that achieves close to stateoftheart performance on this task without any feature engineering we also find that considering just the last sentence of the prompt instead of the whole prompt yields higher accuracy with our approach
|
[['in', 'the', 'story', 'cloze', 'test', 'a', 'system', 'is', 'presented', 'with', 'a', '4sentence', 'prompt', 'to', 'a', 'story', 'and', 'must', 'determine', 'which', 'one', 'of', 'two', 'potential', 'endings', 'is', 'the', 'right', 'ending', 'to', 'the', 'story', 'previous', 'work', 'has', 'shown', 'that', 'ignoring', 'the', 'training', 'set', 'and', 'training', 'a', 'model', 'on', 'the', 'validation', 'set', 'can', 'achieve', 'high', 'accuracy', 'on', 'this', 'task', 'due', 'to', 'stylistic', 'differences', 'between', 'the', 'story', 'endings', 'in', 'the', 'training', 'set', 'and', 'validation', 'and', 'test', 'sets', 'following', 'this', 'approach', 'we', 'present', 'a', 'simpler', 'fullyneural', 'approach', 'to', 'the', 'story', 'cloze', 'test', 'using', 'skipthought', 'embeddings', 'of', 'the', 'stories', 'in', 'a', 'feedforward', 'network', 'that', 'achieves', 'close', 'to', 'stateoftheart', 'performance', 'on', 'this', 'task', 'without', 'any', 'feature', 'engineering', 'we', 'also', 'find', 'that', 'considering', 'just', 'the', 'last', 'sentence', 'of', 'the', 'prompt', 'instead', 'of', 'the', 'whole', 'prompt', 'yields', 'higher', 'accuracy', 'with', 'our', 'approach']]
|
[-0.03736330397366653, -0.015054368890310062, -0.08636190655698132, 0.06699254011063488, -0.1017634452441494, -0.12685993555506678, 0.07808703774380149, 0.413684516206725, -0.20846999811634193, -0.3374759018357189, 0.03294491404329803, -0.2866494584160338, -0.1277960647636925, 0.22199561712260976, -0.11999098346604191, 0.03155556804578723, 0.17550219439737896, 0.09228980196248882, -0.0739249620388461, -0.33766178083463877, 0.3188280234706965, 0.05575724348838206, 0.31054307938418313, 0.05894095705864766, 0.1341359636005199, -0.0517045185449782, -0.020255817640714973, -0.0467654611312834, -0.03869129648650525, 0.1527617257826016, 0.242915932151297, 0.21146584965132234, 0.3060778163814249, -0.359518371038992, -0.17950446501317371, 0.10750821257322912, 0.1027405662604302, 0.11350525597391209, 0.00686853006570991, -0.31372256683654914, 0.11815937563247325, -0.15826956859971078, -0.008432439347117683, -0.09708756420277913, -0.009301776407670428, -0.052740028064043924, -0.24784907596612363, 0.02051533271451054, 0.10440680582630839, 0.03664878534352165, -0.021584591899379973, -0.07597476492355087, -0.007652882785173773, 0.16200941685899978, 0.054227938835565995, 0.10358509346345113, 0.08081226874825381, -0.16666109661770742, -0.14942000598739122, 0.4050348313482663, -0.0566499327631127, -0.19999263476836318, 0.19580324407922858, -0.10352691569728137, -0.1217432577333605, 0.08354916163357615, 0.19425052362991824, 0.10039539292867061, -0.15193179201420026, -0.016787456356536397, -0.04634089467208122, 0.19420935795464703, 0.08135288067958282, -0.05076977846973384, 0.19220196657799868, 0.26811195303550883, -0.017682906808971447, 0.13602209792877654, -0.08697014982556171, -0.059883940062051964, -0.2974911066952325, -0.13328755339820877, -0.16117900903230065, 0.020064378505726416, -0.07093247462673653, -0.14802145532875335, 0.4484589850416279, 0.22244475881092762, 0.23098967001126466, 0.11143705004360527, 0.3191185125810954, 0.01732597265688912, 0.06310262220541997, 0.05471017204121978, 0.22454879261581726, -0.0054866150732486305, 0.12169548476742267, -0.17112359956248116, 0.09547245646080443, 0.05866578308054964]
|
1,803.05548
|
Resonant-state expansion of three-dimensional open optical systems:
Light scattering
|
A rigorous method of calculating the electromagnetic field, the scattering
matrix, and scattering cross-sections of an arbitrary finite three-dimensional
optical system described by its permittivity distribution is presented. The
method is based on the expansion of the Green's function into the resonant
states of the system. These can be calculated by any means, including the
popular finite element and finite-difference time-domain methods. However,
using the resonant-state expansion with a spherically-symmetric analytical
basis, such as that of a homogeneous sphere, allows to determine a complete set
of the resonant states of the system within a given frequency range.
Furthermore, it enables to take full advantage of the expansion of the field
outside the system into vector spherical harmonics, resulting in simple
analytic expressions. We verify and illustrate the developed approach on an
example of a dielectric sphere in vacuum, which has an exact analytic solution
known as Mie scattering.
|
physics.optics
|
a rigorous method of calculating the electromagnetic field the scattering matrix and scattering crosssections of an arbitrary finite threedimensional optical system described by its permittivity distribution is presented the method is based on the expansion of the greens function into the resonant states of the system these can be calculated by any means including the popular finite element and finitedifference timedomain methods however using the resonantstate expansion with a sphericallysymmetric analytical basis such as that of a homogeneous sphere allows to determine a complete set of the resonant states of the system within a given frequency range furthermore it enables to take full advantage of the expansion of the field outside the system into vector spherical harmonics resulting in simple analytic expressions we verify and illustrate the developed approach on an example of a dielectric sphere in vacuum which has an exact analytic solution known as mie scattering
|
[['a', 'rigorous', 'method', 'of', 'calculating', 'the', 'electromagnetic', 'field', 'the', 'scattering', 'matrix', 'and', 'scattering', 'crosssections', 'of', 'an', 'arbitrary', 'finite', 'threedimensional', 'optical', 'system', 'described', 'by', 'its', 'permittivity', 'distribution', 'is', 'presented', 'the', 'method', 'is', 'based', 'on', 'the', 'expansion', 'of', 'the', 'greens', 'function', 'into', 'the', 'resonant', 'states', 'of', 'the', 'system', 'these', 'can', 'be', 'calculated', 'by', 'any', 'means', 'including', 'the', 'popular', 'finite', 'element', 'and', 'finitedifference', 'timedomain', 'methods', 'however', 'using', 'the', 'resonantstate', 'expansion', 'with', 'a', 'sphericallysymmetric', 'analytical', 'basis', 'such', 'as', 'that', 'of', 'a', 'homogeneous', 'sphere', 'allows', 'to', 'determine', 'a', 'complete', 'set', 'of', 'the', 'resonant', 'states', 'of', 'the', 'system', 'within', 'a', 'given', 'frequency', 'range', 'furthermore', 'it', 'enables', 'to', 'take', 'full', 'advantage', 'of', 'the', 'expansion', 'of', 'the', 'field', 'outside', 'the', 'system', 'into', 'vector', 'spherical', 'harmonics', 'resulting', 'in', 'simple', 'analytic', 'expressions', 'we', 'verify', 'and', 'illustrate', 'the', 'developed', 'approach', 'on', 'an', 'example', 'of', 'a', 'dielectric', 'sphere', 'in', 'vacuum', 'which', 'has', 'an', 'exact', 'analytic', 'solution', 'known', 'as', 'mie', 'scattering']]
|
[-0.10910407862113947, 0.06030957952621188, -0.12199696794001234, 0.02109905082741878, -0.05803169688914676, -0.053521273994340084, 0.011056353323904143, 0.356029150176894, -0.21597679927819283, -0.23965443583910126, 0.08434201633350018, -0.23908469463532203, -0.14455753040021738, 0.23674550251028426, 0.05910264745762106, 0.08600350066892035, 0.02402765746857669, 0.05075908165796333, -0.07235129589900828, -0.16824084190680091, 0.3267176358557835, 0.03133354038692306, 0.26276919828583106, 0.06728101893944817, 0.1322297585555478, 0.07695183463747034, -0.0032085683826055074, 0.03437580567834949, -0.10224778840431001, 0.11918902496423421, 0.2096168817496053, 0.09582871062574103, 0.2303268009721226, -0.45091130790879597, -0.2095426428698104, 0.034827598629399784, 0.17212674132315442, 0.13738643677946105, -0.04509159441993295, -0.28123117317571433, 0.05069821735378355, -0.19051866749823848, -0.18990491336287074, -0.11558222151959215, 0.011428109444111484, 0.022170392502999136, -0.3034135665794885, 0.026980873867491813, 0.028125789156498236, 0.030551892598285467, -0.10079133029629136, -0.09537322979068032, 0.01801831121210361, 0.11037949497522032, -0.010314057395491447, -0.005654484857930927, 0.10141570362061061, -0.08274029150945009, -0.07569537444726086, 0.39999491620865474, -0.09560373107701339, -0.22542943615298025, 0.14493833007794377, -0.16365506735982727, 0.005484295172012738, 0.17859613406471908, 0.16344709074670588, 0.15551376746766069, -0.16334111226732037, 0.13607213968247675, -0.03734948989507314, 0.16266753008735454, 0.06297916108176012, -0.011838330415304046, 0.18333544417534564, 0.1453109445802339, -0.0027294427367254488, 0.15535579023904772, -0.06212572955740364, -0.0707093765770362, -0.31838664140652967, -0.15855809615380634, -0.23895644916322184, 0.03316007734817528, -0.12200221716940743, -0.24671190219453057, 0.4008615052679906, 0.09664848111601346, 0.16331853706867913, 0.028002315604385944, 0.33633709279820323, 0.1917525071540031, 0.053808231671290424, 0.04360194458796114, 0.24021787246739543, 0.1753290505415911, 0.04383875634143683, -0.24308562302187942, -0.009490947213930052, 0.08893479377257864]
|
1,803.05549
|
Object Detection in Video with Spatiotemporal Sampling Networks
|
We propose a Spatiotemporal Sampling Network (STSN) that uses deformable
convolutions across time for object detection in videos. Our STSN performs
object detection in a video frame by learning to spatially sample features from
the adjacent frames. This naturally renders the approach robust to occlusion or
motion blur in individual frames. Our framework does not require additional
supervision, as it optimizes sampling locations directly with respect to object
detection performance. Our STSN outperforms the state-of-the-art on the
ImageNet VID dataset and compared to prior video object detection methods it
uses a simpler design, and does not require optical flow data for training.
|
cs.CV
|
we propose a spatiotemporal sampling network stsn that uses deformable convolutions across time for object detection in videos our stsn performs object detection in a video frame by learning to spatially sample features from the adjacent frames this naturally renders the approach robust to occlusion or motion blur in individual frames our framework does not require additional supervision as it optimizes sampling locations directly with respect to object detection performance our stsn outperforms the stateoftheart on the imagenet vid dataset and compared to prior video object detection methods it uses a simpler design and does not require optical flow data for training
|
[['we', 'propose', 'a', 'spatiotemporal', 'sampling', 'network', 'stsn', 'that', 'uses', 'deformable', 'convolutions', 'across', 'time', 'for', 'object', 'detection', 'in', 'videos', 'our', 'stsn', 'performs', 'object', 'detection', 'in', 'a', 'video', 'frame', 'by', 'learning', 'to', 'spatially', 'sample', 'features', 'from', 'the', 'adjacent', 'frames', 'this', 'naturally', 'renders', 'the', 'approach', 'robust', 'to', 'occlusion', 'or', 'motion', 'blur', 'in', 'individual', 'frames', 'our', 'framework', 'does', 'not', 'require', 'additional', 'supervision', 'as', 'it', 'optimizes', 'sampling', 'locations', 'directly', 'with', 'respect', 'to', 'object', 'detection', 'performance', 'our', 'stsn', 'outperforms', 'the', 'stateoftheart', 'on', 'the', 'imagenet', 'vid', 'dataset', 'and', 'compared', 'to', 'prior', 'video', 'object', 'detection', 'methods', 'it', 'uses', 'a', 'simpler', 'design', 'and', 'does', 'not', 'require', 'optical', 'flow', 'data', 'for', 'training']]
|
[-0.044039571027764506, -0.02709810760821782, -0.09364541861235492, 0.006722290665778678, -0.14150211879727886, -0.19240143418074676, 0.007782477291994819, 0.5334132456097423, -0.22138102584536754, -0.36517765356385257, 0.0621982516102292, -0.2519336812855566, -0.13903169417251632, 0.17229104742143012, -0.2570407678482725, 0.08524876343561154, 0.21120110425559402, 0.07829120623714783, -0.06085848250336758, -0.2487247471706759, 0.2507374294207194, 0.038225611329407376, 0.34704513196815173, -0.04575589545043733, 0.17842471136314356, 0.026468973572585073, -0.08043333086271898, -0.03490413308677757, 0.003387586160790627, 0.14721150285400011, 0.3115689016047719, 0.2036726741695448, 0.2755104428084165, -0.3740676353024587, -0.24750976322912702, 0.06690683311727993, 0.14643639707755224, 0.12963888412524088, -0.037948112094811366, -0.40006824279678804, 0.0630545976010206, -0.14090933192831775, 0.0772244741948431, -0.1443216195466983, -0.020850041470326045, -0.03155118960763931, -0.344428278131447, 0.09504663057661816, 0.10040228529239767, 0.004744343126338779, -0.0614651021748489, -0.06519867288514826, 0.05247802738164205, 0.15387887772236603, 0.001323673869574479, 0.07291661834289484, 0.19806865948325425, -0.19213686241339162, -0.1305834860997457, 0.3976567794441008, -0.07577395528627962, -0.24867622105076032, 0.2462470172995738, -0.03344672032193664, -0.12904033442393092, 0.1842085730430542, 0.21033125977698422, 0.18192729539256178, -0.129139255316855, -0.041279517115303775, -0.05824720830452291, 0.23284830063964954, 0.06843489206021688, 0.011014769145963239, 0.1836794763369778, 0.2460711592735321, 0.09804304026742923, 0.11778675499098266, -0.25138587158346803, -0.04312814153073465, -0.24286231320743978, -0.06750888900840472, -0.22248306327074877, -0.0617267329838725, -0.10023283637921993, -0.13918787809134478, 0.38251491071765914, 0.2820870590524054, 0.20370667198599846, 0.13702427114413676, 0.39273818125765697, -0.07001485995373086, 0.16940506323076346, 0.11714644728264972, 0.1766625548365946, -0.06751732894119021, 0.13454893568768075, -0.14776658005875482, 0.0681860808323893, 0.08085427661517672]
|
1,803.0555
|
Modeling and characterization of a rectangular waveguide grating
structure using transmission line theory for planar Cerenkov masers
|
A modeling approach is proposed based on transmission line theory for the
characterization of the periodic rectangular waveguide grating (RWG) structure.
Using an equivalent circuit (EC) model the dispersion equation of the structure
is derived with largely reduced workloads as compared to the conventional
field-theory method. An EC based analysis of the RWG structure is performed.
Numerical results show a good consistency between the two methods as varying
structural parameters of significance. The proposed approach is also used for
the taper design with the objective of minimizing wave reflection of the
structure. A resulting multistage taper can deliver a low cumulative reflection
coefficient on the order of 10^{-3}. Furthermore, the coherence performance of
an RWG based planar Cerenkov maser (PCM) is studied on the driving electron
beam interacting with the traveling harmonic wave. This includes the impacts of
the grating height uniformity, due to practical machining uncertainty, on the
net wave reflection as well as on the growth rate of the wave in the maser. The
obtained results show, that a non-uniformity on the order of 50 micrometers in
the grating height can increase the reflection level by at least one order of
magnitude. The PCM coherence can be considerably degraded, in terms of a
significant reduction in the wave growth rate of more than 30% with respect to
its theoretical value.
|
physics.app-ph
|
a modeling approach is proposed based on transmission line theory for the characterization of the periodic rectangular waveguide grating rwg structure using an equivalent circuit ec model the dispersion equation of the structure is derived with largely reduced workloads as compared to the conventional fieldtheory method an ec based analysis of the rwg structure is performed numerical results show a good consistency between the two methods as varying structural parameters of significance the proposed approach is also used for the taper design with the objective of minimizing wave reflection of the structure a resulting multistage taper can deliver a low cumulative reflection coefficient on the order of 103 furthermore the coherence performance of an rwg based planar cerenkov maser pcm is studied on the driving electron beam interacting with the traveling harmonic wave this includes the impacts of the grating height uniformity due to practical machining uncertainty on the net wave reflection as well as on the growth rate of the wave in the maser the obtained results show that a nonuniformity on the order of 50 micrometers in the grating height can increase the reflection level by at least one order of magnitude the pcm coherence can be considerably degraded in terms of a significant reduction in the wave growth rate of more than 30 with respect to its theoretical value
|
[['a', 'modeling', 'approach', 'is', 'proposed', 'based', 'on', 'transmission', 'line', 'theory', 'for', 'the', 'characterization', 'of', 'the', 'periodic', 'rectangular', 'waveguide', 'grating', 'rwg', 'structure', 'using', 'an', 'equivalent', 'circuit', 'ec', 'model', 'the', 'dispersion', 'equation', 'of', 'the', 'structure', 'is', 'derived', 'with', 'largely', 'reduced', 'workloads', 'as', 'compared', 'to', 'the', 'conventional', 'fieldtheory', 'method', 'an', 'ec', 'based', 'analysis', 'of', 'the', 'rwg', 'structure', 'is', 'performed', 'numerical', 'results', 'show', 'a', 'good', 'consistency', 'between', 'the', 'two', 'methods', 'as', 'varying', 'structural', 'parameters', 'of', 'significance', 'the', 'proposed', 'approach', 'is', 'also', 'used', 'for', 'the', 'taper', 'design', 'with', 'the', 'objective', 'of', 'minimizing', 'wave', 'reflection', 'of', 'the', 'structure', 'a', 'resulting', 'multistage', 'taper', 'can', 'deliver', 'a', 'low', 'cumulative', 'reflection', 'coefficient', 'on', 'the', 'order', 'of', '103', 'furthermore', 'the', 'coherence', 'performance', 'of', 'an', 'rwg', 'based', 'planar', 'cerenkov', 'maser', 'pcm', 'is', 'studied', 'on', 'the', 'driving', 'electron', 'beam', 'interacting', 'with', 'the', 'traveling', 'harmonic', 'wave', 'this', 'includes', 'the', 'impacts', 'of', 'the', 'grating', 'height', 'uniformity', 'due', 'to', 'practical', 'machining', 'uncertainty', 'on', 'the', 'net', 'wave', 'reflection', 'as', 'well', 'as', 'on', 'the', 'growth', 'rate', 'of', 'the', 'wave', 'in', 'the', 'maser', 'the', 'obtained', 'results', 'show', 'that', 'a', 'nonuniformity', 'on', 'the', 'order', 'of', '50', 'micrometers', 'in', 'the', 'grating', 'height', 'can', 'increase', 'the', 'reflection', 'level', 'by', 'at', 'least', 'one', 'order', 'of', 'magnitude', 'the', 'pcm', 'coherence', 'can', 'be', 'considerably', 'degraded', 'in', 'terms', 'of', 'a', 'significant', 'reduction', 'in', 'the', 'wave', 'growth', 'rate', 'of', 'more', 'than', '30', 'with', 'respect', 'to', 'its', 'theoretical', 'value']]
|
[-0.11487431842613512, 0.06351842165279342, -0.06427688752552746, 0.007855308667949593, -0.04130572188322575, -0.08197777315781259, 0.023643964302184916, 0.3979973104732061, -0.23706324242353272, -0.3031022974621895, 0.0940508746991966, -0.2506430586799979, -0.12142807241478884, 0.2435675660968414, -0.023750708328333456, 0.09121183127239305, 0.030089236579852196, 0.03384077817260346, -0.08135455799381341, -0.20421266398258373, 0.27779781564688394, 0.11311104630543808, 0.33053942052081126, 0.05108661218839991, 0.09825474204787112, 0.00903413661227033, 0.0022324386749181663, 0.01718519656155426, -0.10306714050727293, 0.13856496366563145, 0.1943160136102338, 0.05727098900447222, 0.2379360681542338, -0.41902055384104586, -0.23958900870298044, 0.0002789913492092678, 0.1163450738798978, 0.06859187396591412, -0.025799207636671716, -0.26044039721894374, 0.06489336793101183, -0.1617839913490136, -0.14070797393513793, 0.0114543972293603, -0.026263454087867257, 0.04116786423040688, -0.2667980019332472, 0.06392926984319258, 0.03841736712671296, 0.039582027625795956, -0.05486441302157284, -0.10682155008308238, -0.036068448414061184, 0.06217878307887093, 0.035447732753619586, 0.021002158695262403, 0.11859002657998186, -0.113706598053099, -0.11656121155330995, 0.40499900212628887, -0.0962985742044439, -0.1785368105639947, 0.15072108585458785, -0.14853592603026913, -0.0160956362971348, 0.20383410621749087, 0.17759500125104244, 0.08581079166122452, -0.11382635480982277, 0.02360641205201433, -0.017654014652401424, 0.23350239134402023, 0.11971877026476536, 0.033167460945913115, 0.1559575861519169, 0.21638715488894902, 0.08060066535626328, 0.15657565282890573, -0.14296090415351698, -0.054284355799281585, -0.28736906373707644, -0.1376781403851383, -0.17485250372792016, 0.026440431612901924, -0.12001949416469312, -0.15347326644287268, 0.413481966343809, 0.126222319549646, 0.17151125285434662, 0.033268205203778774, 0.31723599281185094, 0.17744894772306555, 0.08050624326108494, 0.0192536134335741, 0.260150123476722, 0.15783423524735882, 0.06342935252951475, -0.2766290928283287, 0.0816739182122186, 0.017808538765084366]
|
1,803.05551
|
Classification of cubic homogeneous polynomial maps with Jacobian
matrices of rank two
|
Let $K$ be any field with $\textup{char}K\neq 2,3$. We classify all cubic
homogeneous polynomial maps $H$ over $K$ with $\textup{rk} JH\leq 2$. In
particular, we show that, for such an $H$, if $F=x+H$ is a Keller map then $F$
is invertible, and furthermore $F$ is tame if the dimension $n\neq 4$.
|
math.AG
|
let k be any field with textupcharkneq 23 we classify all cubic homogeneous polynomial maps h over k with textuprk jhleq 2 in particular we show that for such an h if fxh is a keller map then f is invertible and furthermore f is tame if the dimension nneq 4
|
[['let', 'k', 'be', 'any', 'field', 'with', 'textupcharkneq', '23', 'we', 'classify', 'all', 'cubic', 'homogeneous', 'polynomial', 'maps', 'h', 'over', 'k', 'with', 'textuprk', 'jhleq', '2', 'in', 'particular', 'we', 'show', 'that', 'for', 'such', 'an', 'h', 'if', 'fxh', 'is', 'a', 'keller', 'map', 'then', 'f', 'is', 'invertible', 'and', 'furthermore', 'f', 'is', 'tame', 'if', 'the', 'dimension', 'nneq', '4']]
|
[-0.1447101974238952, 0.148472031649059, -0.006307460833340883, -0.04754879001848167, -0.038872758217621595, -0.20547599603499597, -0.07436219717298324, 0.39415366807952523, -0.3302626588313918, -0.19926520141113238, 0.09443694813671755, -0.29149899433832616, -0.16478813133047274, 0.1759515524657521, -0.0369186565609804, -0.1078653574125686, 0.0009978228675511975, 0.15068012262539318, -0.07894777046264305, -0.37770796506326104, 0.33908908598823473, -0.10170850811603789, 0.08197432385592644, 0.05217570823151618, 0.08920813297542433, 0.006278328112481783, 0.028832965850597247, 0.056137410395119026, -0.19303300465086673, 0.023506688749572884, 0.27274937256394577, 0.13039773442142177, 0.24200627657895288, -0.29159905889537185, -0.18245404031525445, 0.3002992782470149, 0.13721589513200647, -0.018528275288796674, 0.02273862900134797, -0.19839272003931305, 0.23314435374535, -0.086449913525333, -0.11749191975104623, -0.07567828334382891, 0.17032853546212814, -0.005612566174628834, -0.3766768571222201, -0.02581450089928694, 0.13687039904956086, 0.15196593242459736, -0.03615124373754952, -0.10454908748700593, -0.08048051250322412, 0.05006160684812736, -0.1184303023571071, 0.16593256816850044, 0.027030863081260275, -0.06833457344328053, -0.05970830440249605, 0.3554042804656395, -0.15606216127829006, -0.20773496583569795, 0.12416263095413645, -0.2208452795360548, -0.1506288773768271, 0.15284710846996555, 0.05414109221116329, 0.12682785384822637, -0.02756644929468166, 0.27623612689664395, -0.1446133774588816, 0.18251988617703319, 0.09804996848106384, -0.09752770156774204, 0.06768973923559922, 0.028131219281931408, 0.1501719991598899, 0.11117370028659934, -0.05723383460038652, 0.12230224537779577, -0.3346063100422422, -0.1981107391960298, -0.13769244534826916, 0.18478854258622354, -0.13368624968734366, -0.11377292842371389, 0.3205287737461428, 0.06820954291591382, 0.2071749849904639, 0.10130021822017928, 0.17070011084433645, 0.10755104521134247, 0.03352083441374513, 0.18558033880738853, 0.07711135134256135, 0.16957213000083962, -0.05793032691629681, -0.1039236450548439, -0.04064614684709037, 0.12348278216086328]
|
1,803.05552
|
Fine structure in holographic entanglement and entanglement contour
|
We explore the fine structure of the holographic entanglement entropy
proposal (the Ryu-Takayanagi formula) in AdS$_3$/CFT$_{2}$. With the guidance
from the boundary and bulk modular flows we find a natural slicing of the
entanglement wedge with the modular planes, which are co-dimension one bulk
surfaces tangent to the modular flow everywhere. This gives an one-to-one
correspondence between the points on the boundary interval $\mathcal{A}$ and
the points on the Ryu-Takayanagi (RT) surface $\mathcal{E}_{\mathcal{A}}$. In
the same sense an arbitrary subinterval $\mathcal{A}_2$ of $\mathcal{A}$ will
correspond to a subinterval $\mathcal{E}_2$ of $\mathcal{E}_{\mathcal{A}}$.
This fine correspondence indicates that the length of $\mathcal{E}_2$ captures
the contribution $s_{\mathcal{A}}(\mathcal{A}_2)$ from $\mathcal{A}_2$ to the
entanglement entropy $S_{\mathcal{A}}$, hence gives the contour function for
entanglement entropy. Furthermore we propose that
$s_{\mathcal{A}}(\mathcal{A}_2)$ in general can be written as a simple linear
combination of entanglement entropies of single intervals inside $\mathcal{A}$.
This proposal passes several non-trivial tests.
|
hep-th
|
we explore the fine structure of the holographic entanglement entropy proposal the ryutakayanagi formula in ads_3cft_2 with the guidance from the boundary and bulk modular flows we find a natural slicing of the entanglement wedge with the modular planes which are codimension one bulk surfaces tangent to the modular flow everywhere this gives an onetoone correspondence between the points on the boundary interval mathcala and the points on the ryutakayanagi rt surface mathcale_mathcala in the same sense an arbitrary subinterval mathcala_2 of mathcala will correspond to a subinterval mathcale_2 of mathcale_mathcala this fine correspondence indicates that the length of mathcale_2 captures the contribution s_mathcalamathcala_2 from mathcala_2 to the entanglement entropy s_mathcala hence gives the contour function for entanglement entropy furthermore we propose that s_mathcalamathcala_2 in general can be written as a simple linear combination of entanglement entropies of single intervals inside mathcala this proposal passes several nontrivial tests
|
[['we', 'explore', 'the', 'fine', 'structure', 'of', 'the', 'holographic', 'entanglement', 'entropy', 'proposal', 'the', 'ryutakayanagi', 'formula', 'in', 'ads_3cft_2', 'with', 'the', 'guidance', 'from', 'the', 'boundary', 'and', 'bulk', 'modular', 'flows', 'we', 'find', 'a', 'natural', 'slicing', 'of', 'the', 'entanglement', 'wedge', 'with', 'the', 'modular', 'planes', 'which', 'are', 'codimension', 'one', 'bulk', 'surfaces', 'tangent', 'to', 'the', 'modular', 'flow', 'everywhere', 'this', 'gives', 'an', 'onetoone', 'correspondence', 'between', 'the', 'points', 'on', 'the', 'boundary', 'interval', 'mathcala', 'and', 'the', 'points', 'on', 'the', 'ryutakayanagi', 'rt', 'surface', 'mathcale_mathcala', 'in', 'the', 'same', 'sense', 'an', 'arbitrary', 'subinterval', 'mathcala_2', 'of', 'mathcala', 'will', 'correspond', 'to', 'a', 'subinterval', 'mathcale_2', 'of', 'mathcale_mathcala', 'this', 'fine', 'correspondence', 'indicates', 'that', 'the', 'length', 'of', 'mathcale_2', 'captures', 'the', 'contribution', 's_mathcalamathcala_2', 'from', 'mathcala_2', 'to', 'the', 'entanglement', 'entropy', 's_mathcala', 'hence', 'gives', 'the', 'contour', 'function', 'for', 'entanglement', 'entropy', 'furthermore', 'we', 'propose', 'that', 's_mathcalamathcala_2', 'in', 'general', 'can', 'be', 'written', 'as', 'a', 'simple', 'linear', 'combination', 'of', 'entanglement', 'entropies', 'of', 'single', 'intervals', 'inside', 'mathcala', 'this', 'proposal', 'passes', 'several', 'nontrivial', 'tests']]
|
[-0.18312559197078804, 0.10594227319193346, -0.12976742523455329, 0.04897747031279508, -0.04623903996486972, -0.1541130585478736, 0.008966855997857931, 0.32032326046195064, -0.2935960085841117, -0.19320255083559484, 0.04347283799295685, -0.27308687436804696, -0.1046651741489768, 0.17879686997942887, -0.10743473741792507, 0.06748485904499575, 0.031205752115514313, 0.09929043559644085, -0.11691608481512933, -0.21044481352746644, 0.35921114407010846, 0.010589012149981893, 0.30477396106360466, 0.10751867306034465, 0.10226005365603141, -0.005918717536085344, 0.031934587761167095, 0.027199943901619294, -0.20092479013595682, 0.15058467970913522, 0.26731019754653107, 0.11153644387540244, 0.18927599596660716, -0.40464514739472757, -0.18739196738892502, 0.10000832960778079, 0.10744839870221132, 0.07164922376387993, 0.032857276263184375, -0.2527440941234777, 0.024948347731122186, -0.1391128811991767, -0.12543690380138847, -0.057429969890394825, 0.013714344631489758, -0.07575854290459123, -0.2456385676193025, 0.07445858613998219, 0.05720746907946113, 0.06194528857558653, -0.031202154139616897, -0.00025867701302953325, -0.08256365690002596, 0.1319904983649356, 0.025328086510014076, 0.04854316365338497, 0.10604945030975176, -0.06688477145996388, -0.10025169881519869, 0.29884752990039704, -0.045398324909147816, -0.22471107524279113, 0.15677104585550047, -0.1658151246138386, -0.11451570078294229, 0.09306094329967, 0.07345807918923797, 0.15259729259992605, -0.08102749431077587, 0.12396565951012935, -0.09618519590288349, 0.15613762268444875, 0.12016269862993743, 0.030433038892338404, 0.24750299779112106, 0.050568229467542906, 0.07918284400984958, 0.2204193420100866, -0.05275311233098065, -0.0974228508588109, -0.41511348268941983, -0.23776698990568676, -0.1784171265308986, 0.07044247679015088, -0.1658499736883889, -0.21579209155683127, 0.39848223148838624, 0.09642240777286096, 0.2434543633827015, 0.08918519567134887, 0.22643677963243497, 0.10806687170976668, 0.08637992655728143, 0.098373928472035, 0.1834929348881376, 0.10681084582461631, 0.035415614023804665, -0.22885026696131572, -0.0004498479575231359, 0.16703049054408406]
|
1,803.05553
|
The Noether inequality for algebraic threefolds (With an Appendix by
J\'{a}nos Koll\'{a}r)
|
We establish the Noether inequality for projective $3$-folds. More precisely,
we prove that the inequality $${\rm vol}(X)\geq
\tfrac{4}{3}p_g(X)-{\tfrac{10}{3}}$$ holds for all projective $3$-folds $X$ of
general type with either $p_g(X)\leq 4$ or $p_g(X)\geq 21$, where $p_g(X)$ is
the geometric genus and ${\rm vol}(X)$ is the canonical volume. This inequality
is optimal due to known examples found by M. Kobayashi in 1992.
|
math.AG
|
we establish the noether inequality for projective 3folds more precisely we prove that the inequality rm volxgeq tfrac43p_gxtfrac103 holds for all projective 3folds x of general type with either p_gxleq 4 or p_gxgeq 21 where p_gx is the geometric genus and rm volx is the canonical volume this inequality is optimal due to known examples found by m kobayashi in 1992
|
[['we', 'establish', 'the', 'noether', 'inequality', 'for', 'projective', '3folds', 'more', 'precisely', 'we', 'prove', 'that', 'the', 'inequality', 'rm', 'volxgeq', 'tfrac43p_gxtfrac103', 'holds', 'for', 'all', 'projective', '3folds', 'x', 'of', 'general', 'type', 'with', 'either', 'p_gxleq', '4', 'or', 'p_gxgeq', '21', 'where', 'p_gx', 'is', 'the', 'geometric', 'genus', 'and', 'rm', 'volx', 'is', 'the', 'canonical', 'volume', 'this', 'inequality', 'is', 'optimal', 'due', 'to', 'known', 'examples', 'found', 'by', 'm', 'kobayashi', 'in', '1992']]
|
[-0.16315569459632234, 0.056037018010229395, -0.017149553062361583, 0.132353770272937, -0.05335417885758113, -0.2341108534223678, -0.015187530173805723, 0.2815457372027531, -0.2445034562005547, -0.2614801872783063, 0.12611161380507901, -0.2689632015270099, -0.13604945453749806, 0.22890212125014187, -0.19223928435199095, -0.010695535344431144, -0.02411061209185343, 0.0505339762322572, -0.13676914380732597, -0.3352765506868692, 0.3994227698432249, -0.09891068370065145, 0.22386952687112058, 0.07585878159009378, 0.10426280961224907, -0.0006814140074870043, 0.024500160527072455, 0.005367938200371307, -0.2068972123768681, 0.13612903247019603, 0.29757907228511676, 0.11340923422310305, 0.14327897088961644, -0.33021304279304386, -0.1568838937326514, 0.2547491814046608, 0.08627680285523336, 0.04284681718420695, -0.00194866579611124, -0.24593728502983586, 0.11995345437792007, -0.06585795608790297, -0.20236949572797147, -0.0633559292672496, 0.10381415604793451, 0.002562077144128189, -0.2790874154061863, 0.11276130185446195, 0.11211172629376515, 0.09405381248839069, 0.024771966816236574, -0.08776111501930772, -0.09276394983916952, -0.029846225060489878, -0.011589367592119072, 0.10582969144084736, 0.061021090481070836, -0.029982064326759428, -0.10608022515825405, 0.32791943923292455, -0.008682203103314367, -0.2089204098702523, 0.09125861897247664, -0.18492066898595608, -0.18696253581724145, 0.08484180559191787, 0.03811505287395496, 0.20434646789605418, -0.07638099990180579, 0.18547439455818548, -0.1206702705015216, 0.11368857441764128, 0.13399488163556447, -0.0310165265425958, 0.05154737655334828, 0.05523969111310547, 0.14235195881899512, 0.10800438043314212, -0.05881278824649359, -0.005025449772610476, -0.3621068106016569, -0.24532542894839457, -0.12695028563642777, 0.25851827042928915, -0.148379576400386, -0.03992764620731274, 0.26652867812663317, -0.010043303024742687, 0.15183713156403156, 0.13790717352949605, 0.18530535018234923, 0.043866155374991264, -0.001336099383862395, 0.12250157551055676, 0.21330762868583725, 0.20967173625780433, 0.025447591551040347, -0.09871425354657204, -0.020642281305698448, 0.1864332019008304]
|
1,803.05554
|
Minimal I-MAP MCMC for Scalable Structure Discovery in Causal DAG Models
|
Learning a Bayesian network (BN) from data can be useful for decision-making
or discovering causal relationships. However, traditional methods often fail in
modern applications, which exhibit a larger number of observed variables than
data points. The resulting uncertainty about the underlying network as well as
the desire to incorporate prior information recommend a Bayesian approach to
learning the BN, but the highly combinatorial structure of BNs poses a striking
challenge for inference. The current state-of-the-art methods such as order
MCMC are faster than previous methods but prevent the use of many natural
structural priors and still have running time exponential in the maximum
indegree of the true directed acyclic graph (DAG) of the BN. We here propose an
alternative posterior approximation based on the observation that, if we
incorporate empirical conditional independence tests, we can focus on a
high-probability DAG associated with each order of the vertices. We show that
our method allows the desired flexibility in prior specification, removes
timing dependence on the maximum indegree and yields provably good posterior
approximations; in addition, we show that it achieves superior accuracy,
scalability, and sampler mixing on several datasets.
|
stat.CO cs.LG stat.ME stat.ML
|
learning a bayesian network bn from data can be useful for decisionmaking or discovering causal relationships however traditional methods often fail in modern applications which exhibit a larger number of observed variables than data points the resulting uncertainty about the underlying network as well as the desire to incorporate prior information recommend a bayesian approach to learning the bn but the highly combinatorial structure of bns poses a striking challenge for inference the current stateoftheart methods such as order mcmc are faster than previous methods but prevent the use of many natural structural priors and still have running time exponential in the maximum indegree of the true directed acyclic graph dag of the bn we here propose an alternative posterior approximation based on the observation that if we incorporate empirical conditional independence tests we can focus on a highprobability dag associated with each order of the vertices we show that our method allows the desired flexibility in prior specification removes timing dependence on the maximum indegree and yields provably good posterior approximations in addition we show that it achieves superior accuracy scalability and sampler mixing on several datasets
|
[['learning', 'a', 'bayesian', 'network', 'bn', 'from', 'data', 'can', 'be', 'useful', 'for', 'decisionmaking', 'or', 'discovering', 'causal', 'relationships', 'however', 'traditional', 'methods', 'often', 'fail', 'in', 'modern', 'applications', 'which', 'exhibit', 'a', 'larger', 'number', 'of', 'observed', 'variables', 'than', 'data', 'points', 'the', 'resulting', 'uncertainty', 'about', 'the', 'underlying', 'network', 'as', 'well', 'as', 'the', 'desire', 'to', 'incorporate', 'prior', 'information', 'recommend', 'a', 'bayesian', 'approach', 'to', 'learning', 'the', 'bn', 'but', 'the', 'highly', 'combinatorial', 'structure', 'of', 'bns', 'poses', 'a', 'striking', 'challenge', 'for', 'inference', 'the', 'current', 'stateoftheart', 'methods', 'such', 'as', 'order', 'mcmc', 'are', 'faster', 'than', 'previous', 'methods', 'but', 'prevent', 'the', 'use', 'of', 'many', 'natural', 'structural', 'priors', 'and', 'still', 'have', 'running', 'time', 'exponential', 'in', 'the', 'maximum', 'indegree', 'of', 'the', 'true', 'directed', 'acyclic', 'graph', 'dag', 'of', 'the', 'bn', 'we', 'here', 'propose', 'an', 'alternative', 'posterior', 'approximation', 'based', 'on', 'the', 'observation', 'that', 'if', 'we', 'incorporate', 'empirical', 'conditional', 'independence', 'tests', 'we', 'can', 'focus', 'on', 'a', 'highprobability', 'dag', 'associated', 'with', 'each', 'order', 'of', 'the', 'vertices', 'we', 'show', 'that', 'our', 'method', 'allows', 'the', 'desired', 'flexibility', 'in', 'prior', 'specification', 'removes', 'timing', 'dependence', 'on', 'the', 'maximum', 'indegree', 'and', 'yields', 'provably', 'good', 'posterior', 'approximations', 'in', 'addition', 'we', 'show', 'that', 'it', 'achieves', 'superior', 'accuracy', 'scalability', 'and', 'sampler', 'mixing', 'on', 'several', 'datasets']]
|
[-0.046581057351122196, -0.0004358975472333692, -0.0895240824530892, 0.11137779180624305, -0.14814290345369024, -0.13904808977608907, 0.08327545604001027, 0.45823855337468866, -0.28238716765623934, -0.3631376512066902, 0.0854349347460579, -0.25355104430452635, -0.16110166797954392, 0.16459484830835558, -0.10492834255614496, 0.10285401632613007, 0.13444775331052058, 0.06309757655501326, -0.06883231171172581, -0.2548868471548826, 0.2572685469312227, 0.0484966908735124, 0.3191161576418226, -0.012187537891998333, 0.10985827224593525, 0.0006752402946307135, -0.020388275076526196, 0.0375448517350262, -0.12462453806736139, 0.1588637463248736, 0.26448512453204415, 0.21869281618397662, 0.32250827279541283, -0.43158332607213484, -0.23163909603782157, 0.13900373691842802, 0.13873357122313193, 0.09966855965304855, -0.012397390011291792, -0.25975053375983176, 0.0759615254467056, -0.1644124410343059, -0.023904176435725604, -0.13784185295399437, -0.03159738196545538, 0.024941268847001954, -0.3100649806354418, 0.07798603174098312, 0.09706597120601416, 0.029876894394351924, 0.02443787814805314, -0.17865666842950073, -0.008961616207825695, 0.10772314964808484, 0.05477190902704333, 0.03045492043577511, 0.11283257614296088, -0.140705333070884, -0.16400268099870177, 0.3481235408491673, -0.02786344630836306, -0.18578715508238988, 0.1857880208857402, -0.08009017702251514, -0.19841603373927857, 0.1052642696613862, 0.18625676205401567, 0.11971050938789515, -0.14289194275160627, 0.058327584759334715, -0.03260109945760168, 0.1807711206208122, 0.037737729595701625, 0.02816641636123445, 0.15468667130768696, 0.2183687032678442, 0.11026898528135906, 0.09550951008450864, -0.10815588524719909, -0.10877986669916898, -0.2264219460819422, -0.11640116750300451, -0.20329419308976132, 0.011897048677634844, -0.1964386167458136, -0.18180581798004183, 0.3766387610775518, 0.2505459200102895, 0.2144239934364413, 0.13241662134037432, 0.31390779425744264, 0.06195950532515355, 0.0712371262860425, 0.12681185658425903, 0.18190599395893514, 0.08352348245085871, 0.03305370003471716, -0.14892211499713123, 0.19974080211250111, -0.011833779820974203]
|
1,803.05555
|
Emanuel Parzen: A Memorial, and a Model With the Two Kernels That He
Championed
|
Manny Parzen passed away in February 2016, and this article is written partly
as a memorial and appreciation. Manny made important contributions to several
areas, but the two that influenced me most were his contributions to kernel
density estimation and to Reproducing Kernel Hilbert Spaces, the two kernels of
the title. Some fond memories of Manny as a PhD advisor begin this memorial,
followed by a discussion of Manny's influence on density estimation and RKHS
methods. A picture gallery of trips comes next, followed by the technical part
of the article. Here our goal is to show how risk models can be built using
RKHS penalized likelihood methods where subjects have personal (sample)
densities which can be used as {\it attributes} in such models.
|
stat.OT
|
manny parzen passed away in february 2016 and this article is written partly as a memorial and appreciation manny made important contributions to several areas but the two that influenced me most were his contributions to kernel density estimation and to reproducing kernel hilbert spaces the two kernels of the title some fond memories of manny as a phd advisor begin this memorial followed by a discussion of mannys influence on density estimation and rkhs methods a picture gallery of trips comes next followed by the technical part of the article here our goal is to show how risk models can be built using rkhs penalized likelihood methods where subjects have personal sample densities which can be used as it attributes in such models
|
[['manny', 'parzen', 'passed', 'away', 'in', 'february', '2016', 'and', 'this', 'article', 'is', 'written', 'partly', 'as', 'a', 'memorial', 'and', 'appreciation', 'manny', 'made', 'important', 'contributions', 'to', 'several', 'areas', 'but', 'the', 'two', 'that', 'influenced', 'me', 'most', 'were', 'his', 'contributions', 'to', 'kernel', 'density', 'estimation', 'and', 'to', 'reproducing', 'kernel', 'hilbert', 'spaces', 'the', 'two', 'kernels', 'of', 'the', 'title', 'some', 'fond', 'memories', 'of', 'manny', 'as', 'a', 'phd', 'advisor', 'begin', 'this', 'memorial', 'followed', 'by', 'a', 'discussion', 'of', 'mannys', 'influence', 'on', 'density', 'estimation', 'and', 'rkhs', 'methods', 'a', 'picture', 'gallery', 'of', 'trips', 'comes', 'next', 'followed', 'by', 'the', 'technical', 'part', 'of', 'the', 'article', 'here', 'our', 'goal', 'is', 'to', 'show', 'how', 'risk', 'models', 'can', 'be', 'built', 'using', 'rkhs', 'penalized', 'likelihood', 'methods', 'where', 'subjects', 'have', 'personal', 'sample', 'densities', 'which', 'can', 'be', 'used', 'as', 'it', 'attributes', 'in', 'such', 'models']]
|
[-0.020181387657208776, 0.07809314019675177, -0.1317940493212725, 0.0859818635650388, -0.10346443974980857, -0.1191303970337641, 0.04111391863581247, 0.3683759022534378, -0.24202703981853385, -0.3023336603480384, 0.15799051753957036, -0.30085237845172724, -0.16171330411926033, 0.16479606251043033, -0.14169090885547844, 0.027555939337291672, 0.07286678754906284, 0.00890652729743501, -0.040300113071377076, -0.33878969764564093, 0.3008343040625133, 0.09545987261444087, 0.24004222772167466, 0.0357662733436971, 0.09309279087673479, -0.017478650420661865, -0.07387509133015585, 0.0006538287138308936, -0.0977714949733378, 0.15659047493794404, 0.33169849355577546, 0.15640274799103296, 0.401121988286817, -0.40620055303091845, -0.17537160337016713, 0.06439875970723305, 0.1040124231712832, 0.036381947103796934, 0.020240958726101713, -0.32090884574302814, -0.0187045728893784, -0.19023807559586395, -0.0711829410279094, -0.06333454275064594, -0.0034770334548339613, -0.021760696132584075, -0.2201526799746524, 0.030254940320624084, 0.06504637824098874, 0.06221564518802655, -0.020538656858772767, -0.1886468326854633, 0.020350374790605127, 0.12750489733795203, 0.07893361718719447, 0.06855426484537197, 0.14550321119552576, -0.1253720074475599, -0.11627530822212376, 0.3294280054108278, -0.05315104422748195, -0.15939122497868852, 0.15998992481367375, -0.09989971037560362, -0.12814779767512943, 0.06850910170109777, 0.1945618753571336, 0.0847288847610362, -0.18831479292347786, 0.05579074145658169, -0.019571508419116944, 0.12839181762097812, 0.06854976500134642, -0.006136663224002937, 0.17291915691003384, 0.1365523164262768, -0.006638379953044459, 0.10503623504768982, -0.0550520892455659, -0.07005196744036611, -0.296477807458581, -0.16254780483924278, -0.22100772208163166, 0.02760879214610753, 0.005168903914821614, -0.13746346027678594, 0.4002339475432305, 0.16022014499422374, 0.1929428962672629, 0.01258652956448344, 0.2666220014415136, 0.07284231260381033, 0.06380219688654189, 0.07743627452329407, 0.19266396048180645, 0.10406104895301406, 0.12556583078093525, -0.11108987471770222, 0.11154403667366965, 0.0968374194335041]
|
1,803.05556
|
Electron and Proton Acceleration in Trans-Relativistic Magnetic
Reconnection: Dependence on Plasma Beta and Magnetization
|
Non-thermal electron acceleration via magnetic reconnection is thought to
play an important role in powering the variable X-ray emission from radiatively
inefficient accretion flows around black holes. The trans-relativistic regime
of magnetic reconnection, where the magnetization $\sigma$, defined as the
ratio of magnetic energy density to enthalpy density, is $\sim 1$, is
frequently encountered in such flows. By means of a large suite of
two-dimensional particle-in-cell simulations, we investigate electron and
proton acceleration in the trans-relativistic regime. We focus on the
dependence of the electron energy spectrum on $\sigma$ and the proton $\beta$
(i.e., the ratio of proton thermal pressure to magnetic pressure). We find that
the electron spectrum in the reconnection region is non-thermal and can be
generally modeled as a power law. At $\beta \lesssim 3 \times 10^{-3}$, the
slope, $p$, is independent of $\beta$ and it hardens with increasing $\sigma$
as $p\simeq 1.8 +0.7/\sqrt{\sigma}$. Electrons are primarily accelerated by the
non-ideal electric field at X-points, either in the initial current layer or in
current sheets generated in between merging magnetic islands. At higher values
of $\beta$, the electron power law steepens for all values of $\sigma$. At
values of $\beta$ near $\beta_{\rm max}\approx1/4\sigma$, when both electrons
and protons are relativistically hot prior to reconnection, the spectra of both
species display an additional component at high energies, containing a few
percent of particles. These particles are accelerated via a Fermi-like process
by bouncing in between the reconnection outflow and a stationary magnetic
island. We provide an empirical prescription for the dependence of the
power-law slope and the acceleration efficiency on $\beta$ and $\sigma$, which
can be used in global simulations of collisionless accretion disks.
|
astro-ph.HE
|
nonthermal electron acceleration via magnetic reconnection is thought to play an important role in powering the variable xray emission from radiatively inefficient accretion flows around black holes the transrelativistic regime of magnetic reconnection where the magnetization sigma defined as the ratio of magnetic energy density to enthalpy density is sim 1 is frequently encountered in such flows by means of a large suite of twodimensional particleincell simulations we investigate electron and proton acceleration in the transrelativistic regime we focus on the dependence of the electron energy spectrum on sigma and the proton beta ie the ratio of proton thermal pressure to magnetic pressure we find that the electron spectrum in the reconnection region is nonthermal and can be generally modeled as a power law at beta lesssim 3 times 103 the slope p is independent of beta and it hardens with increasing sigma as psimeq 18 07sqrtsigma electrons are primarily accelerated by the nonideal electric field at xpoints either in the initial current layer or in current sheets generated in between merging magnetic islands at higher values of beta the electron power law steepens for all values of sigma at values of beta near beta_rm maxapprox14sigma when both electrons and protons are relativistically hot prior to reconnection the spectra of both species display an additional component at high energies containing a few percent of particles these particles are accelerated via a fermilike process by bouncing in between the reconnection outflow and a stationary magnetic island we provide an empirical prescription for the dependence of the powerlaw slope and the acceleration efficiency on beta and sigma which can be used in global simulations of collisionless accretion disks
|
[['nonthermal', 'electron', 'acceleration', 'via', 'magnetic', 'reconnection', 'is', 'thought', 'to', 'play', 'an', 'important', 'role', 'in', 'powering', 'the', 'variable', 'xray', 'emission', 'from', 'radiatively', 'inefficient', 'accretion', 'flows', 'around', 'black', 'holes', 'the', 'transrelativistic', 'regime', 'of', 'magnetic', 'reconnection', 'where', 'the', 'magnetization', 'sigma', 'defined', 'as', 'the', 'ratio', 'of', 'magnetic', 'energy', 'density', 'to', 'enthalpy', 'density', 'is', 'sim', '1', 'is', 'frequently', 'encountered', 'in', 'such', 'flows', 'by', 'means', 'of', 'a', 'large', 'suite', 'of', 'twodimensional', 'particleincell', 'simulations', 'we', 'investigate', 'electron', 'and', 'proton', 'acceleration', 'in', 'the', 'transrelativistic', 'regime', 'we', 'focus', 'on', 'the', 'dependence', 'of', 'the', 'electron', 'energy', 'spectrum', 'on', 'sigma', 'and', 'the', 'proton', 'beta', 'ie', 'the', 'ratio', 'of', 'proton', 'thermal', 'pressure', 'to', 'magnetic', 'pressure', 'we', 'find', 'that', 'the', 'electron', 'spectrum', 'in', 'the', 'reconnection', 'region', 'is', 'nonthermal', 'and', 'can', 'be', 'generally', 'modeled', 'as', 'a', 'power', 'law', 'at', 'beta', 'lesssim', '3', 'times', '103', 'the', 'slope', 'p', 'is', 'independent', 'of', 'beta', 'and', 'it', 'hardens', 'with', 'increasing', 'sigma', 'as', 'psimeq', '18', '07sqrtsigma', 'electrons', 'are', 'primarily', 'accelerated', 'by', 'the', 'nonideal', 'electric', 'field', 'at', 'xpoints', 'either', 'in', 'the', 'initial', 'current', 'layer', 'or', 'in', 'current', 'sheets', 'generated', 'in', 'between', 'merging', 'magnetic', 'islands', 'at', 'higher', 'values', 'of', 'beta', 'the', 'electron', 'power', 'law', 'steepens', 'for', 'all', 'values', 'of', 'sigma', 'at', 'values', 'of', 'beta', 'near', 'beta_rm', 'maxapprox14sigma', 'when', 'both', 'electrons', 'and', 'protons', 'are', 'relativistically', 'hot', 'prior', 'to', 'reconnection', 'the', 'spectra', 'of', 'both', 'species', 'display', 'an', 'additional', 'component', 'at', 'high', 'energies', 'containing', 'a', 'few', 'percent', 'of', 'particles', 'these', 'particles', 'are', 'accelerated', 'via', 'a', 'fermilike', 'process', 'by', 'bouncing', 'in', 'between', 'the', 'reconnection', 'outflow', 'and', 'a', 'stationary', 'magnetic', 'island', 'we', 'provide', 'an', 'empirical', 'prescription', 'for', 'the', 'dependence', 'of', 'the', 'powerlaw', 'slope', 'and', 'the', 'acceleration', 'efficiency', 'on', 'beta', 'and', 'sigma', 'which', 'can', 'be', 'used', 'in', 'global', 'simulations', 'of', 'collisionless', 'accretion', 'disks']]
|
[-0.1084728150805467, 0.24497491479943714, -0.012151655271975663, 0.10094034623924773, 0.003162182108065739, -0.09978816867062489, -0.0007087757114582716, 0.3829446052996455, -0.23394154753798557, -0.3401832796572062, 0.016410378269752637, -0.29385172523877645, 0.01821292181291964, 0.2233186500838679, 0.06474182855264142, -0.00895739126684744, -0.0182617366123591, -0.01997334408702543, -0.03053077072819464, -0.14338224394464472, 0.2983367590090926, 0.15467459936184388, 0.23067990048231055, 0.05139673314308816, 0.06285278159992456, -0.06952498263482304, 0.02494377316524662, 0.02737290170859464, -0.1464048056532325, -0.0002993829548358917, 0.17819340604384612, 0.018104674887050403, 0.23328632265193402, -0.45099290450363605, -0.2241546409578491, 0.049320110437684576, 0.19048315278138883, 0.005639978363705513, -0.06547233917075719, -0.18197580043185693, 0.06124466435004869, -0.18136825023327757, -0.13639155023218894, 0.0043873771239942225, 0.03716822796081444, 0.05344822771684097, -0.31856835980807857, 0.16128275626386604, 0.044383826320158165, 0.04190616635605693, -0.09241982811066002, -0.07971588919962327, -0.050796742486447964, 0.04023152258364827, 0.1307510127997269, 0.07543286311280417, 0.23777223887078355, -0.16457964279255524, -0.05525174315332224, 0.36155451083705376, -0.05200225334651904, -0.10666403883344147, 0.17266495586168973, -0.24616520068213943, -0.10768615936411775, 0.21655804433955056, 0.15099560813876345, 0.09052409347509804, -0.08411915403440039, 0.06006493975568128, 0.0015249783734036407, 0.1492041366108537, 0.07338471430775295, -0.023060846003962097, 0.3118059527397455, 0.13872158352878747, 0.019794855960627786, 0.09243103798502635, -0.1790985638918576, -0.04111573922135153, -0.28348085560910674, -0.12906693669892574, -0.15278901415239735, 0.10590898756154075, -0.11677021617418237, -0.15339771868303304, 0.3461943872580577, 0.0923807734020656, 0.20186238169642914, -0.038777827242317944, 0.29077535641048946, 0.1645424307546679, 0.016038124064615772, 0.16033151620458538, 0.26011756961879723, 0.1497708417527908, 0.13092287829873173, -0.25476019892817786, 0.03180913762257428, 0.03473627728828141]
|
1,803.05557
|
Discovery of Emergent Photon and Monopoles in a Quantum Spin Liquid
|
Quantum spin liquid (QSL) is an exotic quantum phase of matter whose ground
state is quantum-mechanically entangled without any magnetic ordering. A
central issue concerns emergent excitations that characterize QSLs, which are
hypothetically associated with quasiparticle fractionalization and topological
order. Here we report highly unusual heat conduction generated by the spin
degrees of freedom in a QSL state of the pyrochlore magnet Pr$_2$Zr$_2$O$_7$,
which hosts spin-ice correlations with strong quantum fluctuations. The thermal
conductivity in high temperature regime exhibits a two-gap behavior, which is
consistent with the gapped excitations of magnetic ($M$-) and electric
monopoles ($E$-particles). At very low temperatures below 200\,mK, the thermal
conductivity unexpectedly shows a dramatic enhancement, which well exceeds
purely phononic conductivity, demonstrating the presence of highly mobile spin
excitations. This new type of excitations can be attributed to emergent photons
($\nu$-particle), coherent gapless spin excitations in a spin-ice manifold.
|
cond-mat.str-el
|
quantum spin liquid qsl is an exotic quantum phase of matter whose ground state is quantummechanically entangled without any magnetic ordering a central issue concerns emergent excitations that characterize qsls which are hypothetically associated with quasiparticle fractionalization and topological order here we report highly unusual heat conduction generated by the spin degrees of freedom in a qsl state of the pyrochlore magnet pr_2zr_2o_7 which hosts spinice correlations with strong quantum fluctuations the thermal conductivity in high temperature regime exhibits a twogap behavior which is consistent with the gapped excitations of magnetic m and electric monopoles eparticles at very low temperatures below 200mk the thermal conductivity unexpectedly shows a dramatic enhancement which well exceeds purely phononic conductivity demonstrating the presence of highly mobile spin excitations this new type of excitations can be attributed to emergent photons nuparticle coherent gapless spin excitations in a spinice manifold
|
[['quantum', 'spin', 'liquid', 'qsl', 'is', 'an', 'exotic', 'quantum', 'phase', 'of', 'matter', 'whose', 'ground', 'state', 'is', 'quantummechanically', 'entangled', 'without', 'any', 'magnetic', 'ordering', 'a', 'central', 'issue', 'concerns', 'emergent', 'excitations', 'that', 'characterize', 'qsls', 'which', 'are', 'hypothetically', 'associated', 'with', 'quasiparticle', 'fractionalization', 'and', 'topological', 'order', 'here', 'we', 'report', 'highly', 'unusual', 'heat', 'conduction', 'generated', 'by', 'the', 'spin', 'degrees', 'of', 'freedom', 'in', 'a', 'qsl', 'state', 'of', 'the', 'pyrochlore', 'magnet', 'pr_2zr_2o_7', 'which', 'hosts', 'spinice', 'correlations', 'with', 'strong', 'quantum', 'fluctuations', 'the', 'thermal', 'conductivity', 'in', 'high', 'temperature', 'regime', 'exhibits', 'a', 'twogap', 'behavior', 'which', 'is', 'consistent', 'with', 'the', 'gapped', 'excitations', 'of', 'magnetic', 'm', 'and', 'electric', 'monopoles', 'eparticles', 'at', 'very', 'low', 'temperatures', 'below', '200mk', 'the', 'thermal', 'conductivity', 'unexpectedly', 'shows', 'a', 'dramatic', 'enhancement', 'which', 'well', 'exceeds', 'purely', 'phononic', 'conductivity', 'demonstrating', 'the', 'presence', 'of', 'highly', 'mobile', 'spin', 'excitations', 'this', 'new', 'type', 'of', 'excitations', 'can', 'be', 'attributed', 'to', 'emergent', 'photons', 'nuparticle', 'coherent', 'gapless', 'spin', 'excitations', 'in', 'a', 'spinice', 'manifold']]
|
[-0.24487251891020004, 0.35872169753996097, -0.05768386738597822, 0.03531206549558474, -0.0627106057011037, -0.18501480473008688, 0.060087564868629505, 0.3211348134447152, -0.2307098672674431, -0.2831163618346335, 0.0047842982121821965, -0.35033184888733315, -0.09066956840262053, 0.12812791165771145, 0.044579340997611135, -0.012538659301074877, -0.04476492412217801, 0.010683392306943883, -0.08650090573699883, -0.154717467682646, 0.24853017094215496, 0.01934107466740257, 0.336524355031786, 0.09670083089993978, 0.07906377507360574, -0.031493908279693464, 0.19522349808929146, 0.035683806965940854, -0.09934575040614631, 0.014145481080459562, 0.269765306382217, -0.15516749934726198, 0.1081804160297599, -0.4250822281891244, -0.24983083604979264, 0.040284039688781956, 0.16379523091366627, 0.17539868437239087, -0.06161407126494172, -0.3139574997009001, 0.010127655302607258, -0.18156762077459987, -0.1755357935703294, -0.1767622221057946, -0.03983448925887195, -0.07261137516605898, -0.18618392835790948, 0.15931026640505544, 0.10385613033669332, 0.11080755599000504, -0.08420318079797524, -0.09853480393263761, -0.08682489744387567, 0.014808771105378236, 0.037821537751087944, 0.04632678499419085, 0.17734286035935748, -0.20559752172410067, -0.1828819875290591, 0.33964506937453237, -0.04396001587484137, -0.08709746830388379, 0.18789588234020055, -0.1884888827728606, -0.08968240908071609, 0.23121227057729388, 0.0706965498848405, 0.07898566774486131, -0.1217125787032427, 0.05664805652886058, -0.02502093933076716, 0.20048124768810582, -0.04668609563320298, 0.19054805792369683, 0.37945226815358646, 0.1848178761289783, 0.03828649301226185, 0.18446499373498176, -0.10455398053024292, -0.07768648029567385, -0.24210945693251323, -0.17167824627110131, -0.28258771896132756, 0.14547029824461788, -0.05069531653134618, -0.21381023494710386, 0.4053938689733475, 0.1368681132804904, 0.13146297398318085, -0.09605533985460413, 0.21655702323679038, 0.10886920818035871, 0.03906372708963676, 0.11035201846028377, 0.24399839992910413, 0.21082769839821094, 0.1176606549186186, -0.34601299594235146, 0.03861978008661052, 0.0008415734053312303]
|
1,803.05558
|
Index of Equivariant Callias-Type Operators and Invariant Metrics of
Positive Scalar Curvature
|
We formulate, for any Lie group G acting isometrically on a manifold M, the
general notion of a G-equivariant elliptic operator that is invertible outside
of a G-cocompact subset of M. We prove a version of the Rellich lemma for this
setting and use this to define the equivariant index of such operators. We show
that G-equivariant Callias-type operators are self-adjoint, regular, and hence
equivariantly invertible at infinity. Such operators explicitly arise from a
pairing of the Dirac operator with the equivariant Higson corona. We apply the
theory developed herein to obtain an obstruction to positive scalar curvature
metrics on non-cocompact manifolds.
|
math.DG math.KT math.OA
|
we formulate for any lie group g acting isometrically on a manifold m the general notion of a gequivariant elliptic operator that is invertible outside of a gcocompact subset of m we prove a version of the rellich lemma for this setting and use this to define the equivariant index of such operators we show that gequivariant calliastype operators are selfadjoint regular and hence equivariantly invertible at infinity such operators explicitly arise from a pairing of the dirac operator with the equivariant higson corona we apply the theory developed herein to obtain an obstruction to positive scalar curvature metrics on noncocompact manifolds
|
[['we', 'formulate', 'for', 'any', 'lie', 'group', 'g', 'acting', 'isometrically', 'on', 'a', 'manifold', 'm', 'the', 'general', 'notion', 'of', 'a', 'gequivariant', 'elliptic', 'operator', 'that', 'is', 'invertible', 'outside', 'of', 'a', 'gcocompact', 'subset', 'of', 'm', 'we', 'prove', 'a', 'version', 'of', 'the', 'rellich', 'lemma', 'for', 'this', 'setting', 'and', 'use', 'this', 'to', 'define', 'the', 'equivariant', 'index', 'of', 'such', 'operators', 'we', 'show', 'that', 'gequivariant', 'calliastype', 'operators', 'are', 'selfadjoint', 'regular', 'and', 'hence', 'equivariantly', 'invertible', 'at', 'infinity', 'such', 'operators', 'explicitly', 'arise', 'from', 'a', 'pairing', 'of', 'the', 'dirac', 'operator', 'with', 'the', 'equivariant', 'higson', 'corona', 'we', 'apply', 'the', 'theory', 'developed', 'herein', 'to', 'obtain', 'an', 'obstruction', 'to', 'positive', 'scalar', 'curvature', 'metrics', 'on', 'noncocompact', 'manifolds']]
|
[-0.17513783268320063, 0.07309220396749808, -0.09000206693057336, 0.112879242705793, -0.1332218004459077, -0.15107250136469363, -0.007674920875989997, 0.35216506417183313, -0.30270098914921867, -0.17570404863605896, 0.11667943294799211, -0.2762528401502755, -0.18696375764157697, 0.1567339793751564, -0.1810501122975028, -0.009656812201308854, 0.04986724038334454, 0.12233960597465436, -0.11984720711559788, -0.19601952065154454, 0.5016328910155696, -0.05230546985552007, 0.16750715770667382, 0.09099897433656688, 0.1161222303835173, 0.0011767441482173607, -0.0050665596545692165, -0.017573862521470907, -0.14080842493136764, 0.1383444940130336, 0.2965330661950158, 0.049524538855835354, 0.22527567651488034, -0.362558344506896, -0.18232372341056666, 0.20664761560585568, 0.09901839086566777, -0.01960172074591266, -0.014360413703994424, -0.31245580731945877, 0.11699769164746006, -0.1695845354092764, -0.1699544034405228, -0.09686343593285511, 0.03643335194746945, -0.0526870632471115, -0.3016635431981116, -0.006789169844933877, 0.11568378910705374, 0.08865654742911312, -0.09988090901763416, -0.054874397247034475, -0.07024843315365632, 0.08458381101909075, -0.029858356704661512, 0.0473677063869842, 0.1397686968694496, 0.026361862912559517, -0.10304155395373099, 0.34747919422008244, -0.11360514290886474, -0.27744062016626786, 0.07341264074156974, -0.13898917909382896, -0.17862882578343736, 0.05365686802485702, 0.1228587966339261, 0.2195684533022965, -0.007146544676894943, 0.2389328565491893, -0.1407914516041238, 0.08166227826230027, 0.0684494695890987, 0.017954562010595063, 0.09221474813667181, 0.034392770569241955, 0.19183806928933836, 0.1149855131721672, 0.056646928556409536, 0.0004425835727220949, -0.38088125288121255, -0.2144293873205635, -0.12108742863204622, 0.1975991639819946, -0.12265372898072396, -0.2329744129332111, 0.38199858880583565, 0.08684281750089105, 0.19741553553909647, 0.13754657244620225, 0.21173666293622112, 0.11173171339118305, 0.0637492556353191, 0.10414990885114736, 0.1388517532031983, 0.24677237944777908, 0.03428245922002722, -0.1302656493464704, -0.12223041709170074, 0.283169898852779]
|
1,803.05559
|
The Euler characteristic of the regular spherical polygon spaces
|
Let $a$ be a real number satisfying $0<a<\pi$. We denote by $M_n(a)$ the
configuration space of regular spherical $n$-gons with side-lengths $a$. The
purpose of this paper is to determine $\chi (M_n(a))$ for all $a$ and odd $n$.
To do so, we construct a manifold $X_n$ and a function $\mu: X_n \to
\mathbf{R}$ such that $\mu^{-1}(a)=M_n(a)$. In fact, the function $\mu$ is
different from the well-known "wall-crossing" function. We determine the index
of each critical point of $\mu$. Since a level set is obtained by successive
Morse surgeries, we can determine $\chi (M_n(a))$.
|
math.GT
|
let a be a real number satisfying 0api we denote by m_na the configuration space of regular spherical ngons with sidelengths a the purpose of this paper is to determine chi m_na for all a and odd n to do so we construct a manifold x_n and a function mu x_n to mathbfr such that mu1am_na in fact the function mu is different from the wellknown wallcrossing function we determine the index of each critical point of mu since a level set is obtained by successive morse surgeries we can determine chi m_na
|
[['let', 'a', 'be', 'a', 'real', 'number', 'satisfying', '0api', 'we', 'denote', 'by', 'm_na', 'the', 'configuration', 'space', 'of', 'regular', 'spherical', 'ngons', 'with', 'sidelengths', 'a', 'the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'determine', 'chi', 'm_na', 'for', 'all', 'a', 'and', 'odd', 'n', 'to', 'do', 'so', 'we', 'construct', 'a', 'manifold', 'x_n', 'and', 'a', 'function', 'mu', 'x_n', 'to', 'mathbfr', 'such', 'that', 'mu1am_na', 'in', 'fact', 'the', 'function', 'mu', 'is', 'different', 'from', 'the', 'wellknown', 'wallcrossing', 'function', 'we', 'determine', 'the', 'index', 'of', 'each', 'critical', 'point', 'of', 'mu', 'since', 'a', 'level', 'set', 'is', 'obtained', 'by', 'successive', 'morse', 'surgeries', 'we', 'can', 'determine', 'chi', 'm_na']]
|
[-0.193084438259785, 0.14003086979449778, -0.08296673052053857, 0.039936858631035944, -0.07046179964135472, -0.13534685490898543, 0.03504590210530416, 0.32753739104821133, -0.3001270960187437, -0.2572591889977128, 0.06579882696470511, -0.2720571068105298, -0.1702604586140836, 0.15587322601848946, -0.0873334963945416, 0.010327468410321092, 0.00927501129866629, 0.11904695083817038, -0.0762632517016155, -0.22736513070828682, 0.35399072839313056, -0.05113411570929891, 0.17677240708208347, 0.018769371425630628, 0.09800479498661153, 0.029929234385285733, 0.021748145576566458, 0.027115393290232232, -0.19890934190302537, 0.07418814993842127, 0.23304975255146868, 0.12284843771012274, 0.23285821059739198, -0.3326293471381887, -0.13444813418427257, 0.27087579334953, 0.14547718012869193, -0.029037765004661875, 0.028825245163106656, -0.23378116226048914, 0.19216033638772237, -0.11636228333124993, -0.1745095258312566, -0.04339948434710175, 0.07436262631973067, 0.044450129760981914, -0.35347373939661697, -0.04883343022787473, 0.03157845146667499, 0.06480795510143943, -0.02559506184431714, -0.14821301446715882, -0.04394257146670678, 0.11841745087160514, 0.0012594733955236255, 0.10010869303049141, 0.07642530165305668, -0.04386894199434299, -0.07423596611185061, 0.36643424484326126, -0.06124905880238697, -0.2733529451006389, 0.09955863268523998, -0.2130237856117374, -0.13547697534866548, 0.1102809168521192, 0.11025908931700902, 0.16153829456767538, -0.07452303105658227, 0.18263872283904886, -0.09841112614926564, 0.14966854643605004, 0.09970897831186488, -0.050114357398802434, 0.17996708596391336, 0.09025713277387094, 0.10040438023989427, 0.1757257891765151, -0.05284318957314059, 0.00853037022074664, -0.34709876624657515, -0.1996653343776016, -0.22742526555896972, 0.15932312212208963, -0.11231487839460977, -0.16704495391388843, 0.3713835192240447, 0.06595959683757398, 0.24435119741662806, 0.11137007734134466, 0.22836748297469547, 0.12912572814797046, 0.02048155096753572, 0.052380373082916855, 0.07336561697545452, 0.11089629599323067, -0.005473581618619162, -0.15570501072567652, -0.022025142520011125, 0.14499109976280194]
|
1,803.0556
|
Gradient estimates for Stokes systems with Dini mean oscillation
coefficients
|
We study the stationary Stokes system in divergence form. The coefficients
are assumed to be merely measurable in one direction and have Dini mean
oscillations in the other directions. We prove that if $(u,p)$ is a weak
solution of the system, then $(Du,p)$ is bounded and its certain linear
combinations are continuous. We also prove a weak type-$(1,1)$ estimate for
$(Du,p)$ under a stronger assumption on the $L^1$-mean oscillation of the
coefficients. The corresponding results up to the boundary on a half ball are
also established. These results are new even for elliptic equations and
systems.
|
math.AP
|
we study the stationary stokes system in divergence form the coefficients are assumed to be merely measurable in one direction and have dini mean oscillations in the other directions we prove that if up is a weak solution of the system then dup is bounded and its certain linear combinations are continuous we also prove a weak type11 estimate for dup under a stronger assumption on the l1mean oscillation of the coefficients the corresponding results up to the boundary on a half ball are also established these results are new even for elliptic equations and systems
|
[['we', 'study', 'the', 'stationary', 'stokes', 'system', 'in', 'divergence', 'form', 'the', 'coefficients', 'are', 'assumed', 'to', 'be', 'merely', 'measurable', 'in', 'one', 'direction', 'and', 'have', 'dini', 'mean', 'oscillations', 'in', 'the', 'other', 'directions', 'we', 'prove', 'that', 'if', 'up', 'is', 'a', 'weak', 'solution', 'of', 'the', 'system', 'then', 'dup', 'is', 'bounded', 'and', 'its', 'certain', 'linear', 'combinations', 'are', 'continuous', 'we', 'also', 'prove', 'a', 'weak', 'type11', 'estimate', 'for', 'dup', 'under', 'a', 'stronger', 'assumption', 'on', 'the', 'l1mean', 'oscillation', 'of', 'the', 'coefficients', 'the', 'corresponding', 'results', 'up', 'to', 'the', 'boundary', 'on', 'a', 'half', 'ball', 'are', 'also', 'established', 'these', 'results', 'are', 'new', 'even', 'for', 'elliptic', 'equations', 'and', 'systems']]
|
[-0.15496033845273288, 0.11895506222560806, -0.06982243139983008, 0.06471329005190024, -0.07087364284517733, -0.12552624801173806, -0.005985364925704504, 0.36403644994685525, -0.312485154144662, -0.1919534657052473, 0.17859569824864402, -0.3055866444924552, -0.11252802287681812, 0.24793658102617452, -0.048342510665717875, 0.07711560754534347, 0.06379534478887523, 0.09801321082111251, -0.08746106626073781, -0.2458806915992969, 0.3513277856731101, -0.06471750689180274, 0.22883724292593174, 0.04666261380893717, 0.10454120778135563, -0.05059248123219923, 0.005407054860782075, 0.031380092298710034, -0.15017940872279914, 0.09289789899301372, 0.15831712019678792, 0.04574573508120681, 0.27307521858908185, -0.3876253067270706, -0.17528124936415176, 0.11997903601119393, 0.08427584902628472, 0.09348990426545864, -0.016130036809236595, -0.26218483461753317, 0.14424181902585062, -0.0862082680270664, -0.16292472192527432, -0.07695089926403996, 0.00642642533945802, 0.08545354473110485, -0.3199064382008816, 0.10212372972715744, 0.10131325969766629, 0.039933159084696516, -0.11770081880477894, -0.10424203448928893, -0.009753216258985432, 0.08648158975533748, 0.06505727690252426, 0.02594431781602141, 0.06176539057571637, -0.10220615448626248, -0.04187982731596812, 0.34496360557447925, -0.11793537670133733, -0.2743073223746921, 0.17754294065464485, -0.20243614515975902, -0.11792322844511977, 0.09700828171090076, 0.18229323695168684, 0.1315464749834255, -0.14742052981777018, 0.08895554072284875, -0.10259214160155113, 0.14269188937829122, 0.10039271384869751, 0.01464686402560849, 0.14654324956630405, 0.05849406980958424, 0.15910327928876014, 0.12096025171309807, -0.03721114811977665, -0.07521806970318339, -0.3551410635541144, -0.14781706035137177, -0.13414083790818326, 0.04850483772982108, -0.07090056131204811, -0.14474055403353353, 0.3635796607202409, 0.11943411148692432, 0.18795904449009532, 0.07233077960431968, 0.22807560310159858, 0.20030270409035056, 0.03747496703933728, 0.07987308268876452, 0.26885860560363845, 0.14393528667768757, 0.08187724370509386, -0.1825281102602419, 0.07518759556114674, 0.08466544495451289]
|
1,803.05561
|
On the exact continuous mapping of fermions
|
We derive a rigorous, quantum mechanical map of fermionic creation and
annihilation operators to continuous Cartesian variables that exactly
reproduces the matrix structure of the many-fermion problem. We show how our
scheme can be used to map a general many-fermion Hamiltonian and then consider
two specific models that encode the fundamental physics of many fermionic
systems, the Anderson impurity and Hubbard models. We use these models to
demonstrate how efficient mappings of these Hamiltonians can be constructed
using a judicious choice of index ordering of the fermions. This development
provides an alternative exact route to calculate the static and dynamical
properties of fermionic systems and sets the stage to exploit the
quantum-classical and semiclassical hierarchies to systematically derive
methods offering a range of accuracies, thus enabling the study of problems
where the fermionic degrees of freedom are coupled to complex anharmonic
nuclear motion and spins which lie beyond the reach of most currently available
methods.
|
physics.chem-ph cond-mat.stat-mech quant-ph
|
we derive a rigorous quantum mechanical map of fermionic creation and annihilation operators to continuous cartesian variables that exactly reproduces the matrix structure of the manyfermion problem we show how our scheme can be used to map a general manyfermion hamiltonian and then consider two specific models that encode the fundamental physics of many fermionic systems the anderson impurity and hubbard models we use these models to demonstrate how efficient mappings of these hamiltonians can be constructed using a judicious choice of index ordering of the fermions this development provides an alternative exact route to calculate the static and dynamical properties of fermionic systems and sets the stage to exploit the quantumclassical and semiclassical hierarchies to systematically derive methods offering a range of accuracies thus enabling the study of problems where the fermionic degrees of freedom are coupled to complex anharmonic nuclear motion and spins which lie beyond the reach of most currently available methods
|
[['we', 'derive', 'a', 'rigorous', 'quantum', 'mechanical', 'map', 'of', 'fermionic', 'creation', 'and', 'annihilation', 'operators', 'to', 'continuous', 'cartesian', 'variables', 'that', 'exactly', 'reproduces', 'the', 'matrix', 'structure', 'of', 'the', 'manyfermion', 'problem', 'we', 'show', 'how', 'our', 'scheme', 'can', 'be', 'used', 'to', 'map', 'a', 'general', 'manyfermion', 'hamiltonian', 'and', 'then', 'consider', 'two', 'specific', 'models', 'that', 'encode', 'the', 'fundamental', 'physics', 'of', 'many', 'fermionic', 'systems', 'the', 'anderson', 'impurity', 'and', 'hubbard', 'models', 'we', 'use', 'these', 'models', 'to', 'demonstrate', 'how', 'efficient', 'mappings', 'of', 'these', 'hamiltonians', 'can', 'be', 'constructed', 'using', 'a', 'judicious', 'choice', 'of', 'index', 'ordering', 'of', 'the', 'fermions', 'this', 'development', 'provides', 'an', 'alternative', 'exact', 'route', 'to', 'calculate', 'the', 'static', 'and', 'dynamical', 'properties', 'of', 'fermionic', 'systems', 'and', 'sets', 'the', 'stage', 'to', 'exploit', 'the', 'quantumclassical', 'and', 'semiclassical', 'hierarchies', 'to', 'systematically', 'derive', 'methods', 'offering', 'a', 'range', 'of', 'accuracies', 'thus', 'enabling', 'the', 'study', 'of', 'problems', 'where', 'the', 'fermionic', 'degrees', 'of', 'freedom', 'are', 'coupled', 'to', 'complex', 'anharmonic', 'nuclear', 'motion', 'and', 'spins', 'which', 'lie', 'beyond', 'the', 'reach', 'of', 'most', 'currently', 'available', 'methods']]
|
[-0.10266843854389604, 0.12311442625462904, -0.07708619846511752, 0.08295426212416421, -0.07523880380866749, -0.1499269952554436, 0.03995549978628274, 0.3517077449889433, -0.2827578928929964, -0.2842132481025352, 0.058932270106649205, -0.250720809742568, -0.14890999813834505, 0.17660081243262657, 0.014680467870446943, 0.06477818905691346, 0.0503454877243888, 0.014509712168646436, -0.12915027527769488, -0.24156848836329675, 0.3071996098909069, 0.009658199046257763, 0.23571895740085072, 0.03520152289420366, 0.10722553969751443, 0.030913643620067065, 0.03456945288025083, -0.021514078602194786, -0.12589389461199677, 0.17896027421436062, 0.2643511393875205, 0.09438897484853383, 0.2115449278570351, -0.43709485660036723, -0.23598945132276464, 0.09744400997616111, 0.16045376767794933, 0.16635857948117078, 0.0009185118240214163, -0.2866402255010701, 0.02244304228543995, -0.2004891446506184, -0.14404755403257666, -0.16444508158301394, -0.029781552752660166, -0.0017884003253833903, -0.2680514115889016, 0.0735502875980831, 0.038348894234889394, 0.02948355956994478, -0.04200627676421596, -0.09088578525434939, -0.008002310375412625, 0.12987692975889772, -0.02382640626634501, -0.015422423696896483, 0.12964678593130122, -0.12180166577679977, -0.15553440740332009, 0.423199146775709, -0.034388686726320415, -0.23342690378908187, 0.23601676768533164, -0.0927276014140056, -0.12965250468302159, 0.05643370962221055, 0.16074522825018053, 0.12841114960010014, -0.19725891414826976, 0.11822364394921028, -0.017682504031671993, 0.1658245741855353, -0.0021732275794831015, 0.07933473660978639, 0.2296246523217809, 0.12413010904265027, 0.06613534103680943, 0.14528783038183446, -0.03340615214058949, -0.16051337866623316, -0.2663608982798553, -0.13669075237271647, -0.1688528406163377, 0.04124785156980638, -0.08257996486734615, -0.18470422032349293, 0.43161999951499314, 0.21313319321986543, 0.1676960836194696, 0.0243215469140259, 0.23948112318006856, 0.1459303432271906, 0.038079338833209006, 0.05220917048864067, 0.20949694608007707, 0.159516151117221, 0.03274043682932613, -0.2588378117723961, -0.051463912832250276, 0.10024007040286256]
|
1,803.05562
|
Granular-composite-like electrical transport properties of
polycrystalline cubic TaN$_{x}$ thin films prepared by rf sputtering method
|
We have systematically investigated the electrical transport properties of
polycrystalline TaN$_x$ ($0.83$$\lesssim$$x$$\lesssim$1.32) films with rocksalt
structure from 300 down to 2 K. It is found that the conductivity varies
linearly with $\ln T$ from $\sim$6 K to $\sim$30 K, which does not originate
from the conventional two dimensional weak-localization or electron-electron
interaction effects, but can be well explained by the intergrain Coulomb effect
which was theoretically proposed in the granular metals. While the
fluctuation-induced tunneling conduction process dominates the temperature
behaviors of the conductivities (resistivities) above $\sim$60 K. Normal state
to superconductive state transition is observed in the $x$$\gtrsim$1.04 films
in low temperature regime. The superconductivity can still be retained at a
field of 9 T. The upper critical field increases linearly with decreasing
temperature in the vicinity of the superconductive transition temperature,
which is the typical feature of granular superconductors or dirty type-II
superconductors. The granular-composite-like electrical transport properties of
the polycrystalline TaN$_x$ films are related to their microstructure, in which
the TaN$_x$ grains with high conductivity are separated by the poorly
conductive amorphous transition layers (grain boundaries).
|
cond-mat.mes-hall
|
we have systematically investigated the electrical transport properties of polycrystalline tan_x 083lesssimxlesssim132 films with rocksalt structure from 300 down to 2 k it is found that the conductivity varies linearly with ln t from sim6 k to sim30 k which does not originate from the conventional two dimensional weaklocalization or electronelectron interaction effects but can be well explained by the intergrain coulomb effect which was theoretically proposed in the granular metals while the fluctuationinduced tunneling conduction process dominates the temperature behaviors of the conductivities resistivities above sim60 k normal state to superconductive state transition is observed in the xgtrsim104 films in low temperature regime the superconductivity can still be retained at a field of 9 t the upper critical field increases linearly with decreasing temperature in the vicinity of the superconductive transition temperature which is the typical feature of granular superconductors or dirty typeii superconductors the granularcompositelike electrical transport properties of the polycrystalline tan_x films are related to their microstructure in which the tan_x grains with high conductivity are separated by the poorly conductive amorphous transition layers grain boundaries
|
[['we', 'have', 'systematically', 'investigated', 'the', 'electrical', 'transport', 'properties', 'of', 'polycrystalline', 'tan_x', '083lesssimxlesssim132', 'films', 'with', 'rocksalt', 'structure', 'from', '300', 'down', 'to', '2', 'k', 'it', 'is', 'found', 'that', 'the', 'conductivity', 'varies', 'linearly', 'with', 'ln', 't', 'from', 'sim6', 'k', 'to', 'sim30', 'k', 'which', 'does', 'not', 'originate', 'from', 'the', 'conventional', 'two', 'dimensional', 'weaklocalization', 'or', 'electronelectron', 'interaction', 'effects', 'but', 'can', 'be', 'well', 'explained', 'by', 'the', 'intergrain', 'coulomb', 'effect', 'which', 'was', 'theoretically', 'proposed', 'in', 'the', 'granular', 'metals', 'while', 'the', 'fluctuationinduced', 'tunneling', 'conduction', 'process', 'dominates', 'the', 'temperature', 'behaviors', 'of', 'the', 'conductivities', 'resistivities', 'above', 'sim60', 'k', 'normal', 'state', 'to', 'superconductive', 'state', 'transition', 'is', 'observed', 'in', 'the', 'xgtrsim104', 'films', 'in', 'low', 'temperature', 'regime', 'the', 'superconductivity', 'can', 'still', 'be', 'retained', 'at', 'a', 'field', 'of', '9', 't', 'the', 'upper', 'critical', 'field', 'increases', 'linearly', 'with', 'decreasing', 'temperature', 'in', 'the', 'vicinity', 'of', 'the', 'superconductive', 'transition', 'temperature', 'which', 'is', 'the', 'typical', 'feature', 'of', 'granular', 'superconductors', 'or', 'dirty', 'typeii', 'superconductors', 'the', 'granularcompositelike', 'electrical', 'transport', 'properties', 'of', 'the', 'polycrystalline', 'tan_x', 'films', 'are', 'related', 'to', 'their', 'microstructure', 'in', 'which', 'the', 'tan_x', 'grains', 'with', 'high', 'conductivity', 'are', 'separated', 'by', 'the', 'poorly', 'conductive', 'amorphous', 'transition', 'layers', 'grain', 'boundaries']]
|
[-0.13656585214696612, 0.2946356568559581, -0.02618359215160705, -0.02683280153487224, -0.026064515093987047, -0.14830663423212667, 0.09374054677160033, 0.386812741196164, -0.3004297583035871, -0.29435165456379764, 0.023382616659959735, -0.35590733428464527, -0.06642858989653178, 0.15129668067675084, 0.04171669700669802, 0.01271721443944526, -0.1050365744542267, -0.03127368582169187, -0.11453966759092343, -0.2421849419095617, 0.2711675591232382, 0.02565438467585905, 0.3630751687583556, 0.0982899438709782, -0.0009628415017769756, -0.0794217710645791, 0.143159876270643, 0.08314775847776962, -0.15565296342500998, -0.031945685757818865, 0.2789120087773798, -0.14402811886446382, 0.14472103937110992, -0.43907416142015293, -0.2681935205156068, 0.001831117071560584, 0.13021164066264068, 0.07598772496682861, -0.021919063407536174, -0.22069413124435497, 0.07835600515880453, -0.09098781540259634, -0.09471583309641574, -0.03856192144237205, -0.006952579426896674, -0.023849455518674487, -0.21815275424325425, 0.15580455953022465, 0.08605308075890537, 0.08503332931203741, -0.08717455075053625, -0.1729140499413585, -0.0894539200036723, 0.03902012210296975, 0.06580468625559827, 0.04546700433076529, 0.21942340933492233, -0.14593192796403606, -0.03612515867412598, 0.3464010759172114, -0.06826817591619064, -0.01996881615328179, 0.19918426078617235, -0.22515323309264865, -0.0031350305634987308, 0.23096309309634802, 0.09197693729550917, 0.11165458341234956, -0.16688467087806202, 0.0801394301486818, 0.0093390134120868, 0.17716053711377422, 0.03988178794018247, 0.050724878175639206, 0.2397627095765942, 0.22520211210940033, -0.02411307278949111, 0.1496801425528247, -0.1301894062648485, -0.013756444762376223, -0.2087652045750226, -0.15213288945696232, -0.2087933227250522, 0.09358473444519239, -0.10719436773086438, -0.19991056315219877, 0.32723492328874604, 0.1531460376715007, 0.21868399061151483, -0.04365482585457026, 0.22581363530546447, 0.11890295983440327, 0.10435841593446392, 0.09044420019464186, 0.27287445533808996, 0.19268497337576596, 0.14837352485847077, -0.28298407843712164, 0.13396929371414112, -0.013533298031440856]
|
1,803.05563
|
Advancing Connectionist Temporal Classification With Attention Modeling
|
In this study, we propose advancing all-neural speech recognition by directly
incorporating attention modeling within the Connectionist Temporal
Classification (CTC) framework. In particular, we derive new context vectors
using time convolution features to model attention as part of the CTC network.
To further improve attention modeling, we utilize content information extracted
from a network representing an implicit language model. Finally, we introduce
vector based attention weights that are applied on context vectors across both
time and their individual components. We evaluate our system on a 3400 hours
Microsoft Cortana voice assistant task and demonstrate that our proposed model
consistently outperforms the baseline model achieving about 20% relative
reduction in word error rates.
|
cs.CL
|
in this study we propose advancing allneural speech recognition by directly incorporating attention modeling within the connectionist temporal classification ctc framework in particular we derive new context vectors using time convolution features to model attention as part of the ctc network to further improve attention modeling we utilize content information extracted from a network representing an implicit language model finally we introduce vector based attention weights that are applied on context vectors across both time and their individual components we evaluate our system on a 3400 hours microsoft cortana voice assistant task and demonstrate that our proposed model consistently outperforms the baseline model achieving about 20 relative reduction in word error rates
|
[['in', 'this', 'study', 'we', 'propose', 'advancing', 'allneural', 'speech', 'recognition', 'by', 'directly', 'incorporating', 'attention', 'modeling', 'within', 'the', 'connectionist', 'temporal', 'classification', 'ctc', 'framework', 'in', 'particular', 'we', 'derive', 'new', 'context', 'vectors', 'using', 'time', 'convolution', 'features', 'to', 'model', 'attention', 'as', 'part', 'of', 'the', 'ctc', 'network', 'to', 'further', 'improve', 'attention', 'modeling', 'we', 'utilize', 'content', 'information', 'extracted', 'from', 'a', 'network', 'representing', 'an', 'implicit', 'language', 'model', 'finally', 'we', 'introduce', 'vector', 'based', 'attention', 'weights', 'that', 'are', 'applied', 'on', 'context', 'vectors', 'across', 'both', 'time', 'and', 'their', 'individual', 'components', 'we', 'evaluate', 'our', 'system', 'on', 'a', '3400', 'hours', 'microsoft', 'cortana', 'voice', 'assistant', 'task', 'and', 'demonstrate', 'that', 'our', 'proposed', 'model', 'consistently', 'outperforms', 'the', 'baseline', 'model', 'achieving', 'about', '20', 'relative', 'reduction', 'in', 'word', 'error', 'rates']]
|
[-0.03336585717209216, -0.039641644787869676, -0.04379603156952986, 0.0659639223418448, -0.11488205706700683, -0.16073588693585147, 0.065034606286125, 0.4787036790512502, -0.26448449994495604, -0.2973870274628488, 0.05608616967531686, -0.255915955997937, -0.2006194741697982, 0.19258462084897993, -0.1299030931591655, 0.04706399577324711, 0.13268252122881158, 0.08149097678168411, -0.06937441591123518, -0.2595503379436975, 0.280544965403221, 0.04137064451684377, 0.3843388761202472, 0.03137936872995591, 0.15383572249863522, 0.02623811632552783, -0.07114318512425857, -0.06641265255789872, -0.04782446256298759, 0.18471027554811112, 0.2692300188417513, 0.202079618757125, 0.31402066739143003, -0.41596454814394485, -0.27803427837456446, 0.05817736475728452, 0.14210205223727307, 0.1222007302712882, -0.02517357814940624, -0.37088582324005465, 0.09843548024946358, -0.24218307075040815, 0.05439940994879829, -0.13050976669183, 0.0019200245608642166, -0.016782865775374894, -0.24088048705328088, 0.04390483836427198, 0.11225316736746598, 0.08706652962635937, -0.08867489816579369, -0.10260745839851941, 0.03054082428986606, 0.18639458101409087, 0.025976562498336925, 0.08584115305919633, 0.13018121838259894, -0.14665555316131368, -0.15087688056415313, 0.3496256867240715, -0.13280495603612508, -0.23897970303161337, 0.16604005956365395, -0.015977235066072484, -0.1332606839964033, 0.04835119402767824, 0.30915813869796693, 0.09668110004193815, -0.1672139634611085, -0.015416713948070537, -0.044499532444336055, 0.2529240550772686, 0.055634724888867435, 0.014094420800185097, 0.18304981654676208, 0.27579681231665226, -0.06840029019446904, 0.16142893373034894, -0.15517644931346045, -0.0964337933650573, -0.20399633590464614, -0.10617036008625291, -0.13547963166651503, -0.059334801179440025, -0.08158236095888631, -0.0770211791532347, 0.45538443172284004, 0.2793473706447652, 0.21089989028821168, 0.15723503609037184, 0.31901825328324257, 0.0548442917092221, 0.11489788374456111, 0.08691037473233466, 0.15691423593982887, 0.017649937290116213, 0.15803741399785004, -0.16510634819236916, 0.08028100299582418, 0.09500138327296424]
|
1,803.05564
|
Relationship between Bondi-Sachs quantities and source of gravitational
radiation in asymptotically de Sitter spacetime
|
Gravitational radiation plays an important role in astrophysics. Based on the
fact that our universe is expanding, the gravitational radiation when a
positive cosmological constant is presented has been studied along with two
different ways recently, one is the Bondi-Sachs (BS) framework in which the
result is shown by BS quantities in the asymptotic null structure, the other is
the perturbation approach in which the result is presented by the quadrupoles
of source. Therefore, it is worth to interpret the quantities in asymptotic
null structure in terms of the information of the source. In this paper, we
investigate this problem and find the explicit expressions of BS quantities in
terms of the quadrupoles of source in asymptotically de Sitter spacetime. We
also estimate how far away the source is, the cosmological constant may affect
the detection of the gravitational wave.
|
gr-qc
|
gravitational radiation plays an important role in astrophysics based on the fact that our universe is expanding the gravitational radiation when a positive cosmological constant is presented has been studied along with two different ways recently one is the bondisachs bs framework in which the result is shown by bs quantities in the asymptotic null structure the other is the perturbation approach in which the result is presented by the quadrupoles of source therefore it is worth to interpret the quantities in asymptotic null structure in terms of the information of the source in this paper we investigate this problem and find the explicit expressions of bs quantities in terms of the quadrupoles of source in asymptotically de sitter spacetime we also estimate how far away the source is the cosmological constant may affect the detection of the gravitational wave
|
[['gravitational', 'radiation', 'plays', 'an', 'important', 'role', 'in', 'astrophysics', 'based', 'on', 'the', 'fact', 'that', 'our', 'universe', 'is', 'expanding', 'the', 'gravitational', 'radiation', 'when', 'a', 'positive', 'cosmological', 'constant', 'is', 'presented', 'has', 'been', 'studied', 'along', 'with', 'two', 'different', 'ways', 'recently', 'one', 'is', 'the', 'bondisachs', 'bs', 'framework', 'in', 'which', 'the', 'result', 'is', 'shown', 'by', 'bs', 'quantities', 'in', 'the', 'asymptotic', 'null', 'structure', 'the', 'other', 'is', 'the', 'perturbation', 'approach', 'in', 'which', 'the', 'result', 'is', 'presented', 'by', 'the', 'quadrupoles', 'of', 'source', 'therefore', 'it', 'is', 'worth', 'to', 'interpret', 'the', 'quantities', 'in', 'asymptotic', 'null', 'structure', 'in', 'terms', 'of', 'the', 'information', 'of', 'the', 'source', 'in', 'this', 'paper', 'we', 'investigate', 'this', 'problem', 'and', 'find', 'the', 'explicit', 'expressions', 'of', 'bs', 'quantities', 'in', 'terms', 'of', 'the', 'quadrupoles', 'of', 'source', 'in', 'asymptotically', 'de', 'sitter', 'spacetime', 'we', 'also', 'estimate', 'how', 'far', 'away', 'the', 'source', 'is', 'the', 'cosmological', 'constant', 'may', 'affect', 'the', 'detection', 'of', 'the', 'gravitational', 'wave']]
|
[-0.1568388373183552, 0.09392229400203048, -0.10440824824119253, 0.08509986405427168, -0.07481929746323399, -0.058709790843671984, -0.03305836414968196, 0.317837069030585, -0.22620454323810657, -0.279384749901614, 0.08776376119598613, -0.2705425257960867, -0.15249601942196023, 0.19101627636700869, -0.022958022272879523, 0.011801402057920183, 0.01643958185034405, 0.09644703447951802, -0.042542081577370744, -0.225506634015723, 0.3691961879309799, 0.1381456927878649, 0.2722949091877256, 0.0562067657409768, 0.10244852229952812, -0.03691971558478794, -0.06682943875701831, 0.007054365847891729, -0.13388514719330746, 0.06275302756694146, 0.23957542651332914, 0.16205704505721638, 0.24856298771088145, -0.3900101244183523, -0.2452176839778466, 0.08327550473290363, 0.16332788090886816, 0.1478738241260414, -0.052426976405383484, -0.2704478581835117, 0.0787209046073258, -0.16134382969300662, -0.15654196074631596, 0.0044393608878765785, 0.0368852358710553, 0.0019161650777927467, -0.23172234064383831, 0.07822843827120128, 0.04486312183351921, -0.03609517104923725, -0.07345031917627369, -0.07798036817527776, 0.008946878448062178, 0.12627085854702663, 0.14146239458849388, 0.06212320477269324, 0.10878787566242473, -0.12022575200202741, -0.06746211316702622, 0.39543521257915665, -0.08192996987407761, -0.24973667522094078, 0.12505540489385436, -0.17990325189062528, -0.1347799260767975, 0.09561911815544591, 0.1282035855642919, 0.14119742590867515, -0.17480409844813818, 0.1407313410288355, -0.013288996947293137, 0.12298060261777469, 0.09103062519404505, 0.04808544120668168, 0.2591870565898716, 0.11445854295494168, 0.0626781481584268, 0.15582083128434274, -0.07641261118697003, -0.09088192634683634, -0.3429110949992069, -0.1475489651152332, -0.19085001274943353, 0.02325100582124183, -0.11473435696669705, -0.14870255658050674, 0.36348024560803815, 0.14176353459479288, 0.14265736862185543, -0.010481688830934997, 0.3131859593359487, 0.12223474538685487, 0.018125142962006586, 0.08991933845183146, 0.33893264396434203, 0.11217410186571734, 0.1153430819478152, -0.2309763892320916, 0.06605161984916777, 0.05717494279545333]
|
1,803.05565
|
Detection of Exoplanets Using the Transit Method
|
I conducted differential photometry on a star GSC 3281-0800, a known host to
exoplanet HAT-P-32b, using analysis software AstroImageJ. I plotted the
measurements from a series of images taken during the transit, via ADU count
given from an earth-based digital CCD camera. I was able to establish a
definite light curve and learn more about the properties of this exoplanet.
|
physics.gen-ph
|
i conducted differential photometry on a star gsc 32810800 a known host to exoplanet hatp32b using analysis software astroimagej i plotted the measurements from a series of images taken during the transit via adu count given from an earthbased digital ccd camera i was able to establish a definite light curve and learn more about the properties of this exoplanet
|
[['i', 'conducted', 'differential', 'photometry', 'on', 'a', 'star', 'gsc', '32810800', 'a', 'known', 'host', 'to', 'exoplanet', 'hatp32b', 'using', 'analysis', 'software', 'astroimagej', 'i', 'plotted', 'the', 'measurements', 'from', 'a', 'series', 'of', 'images', 'taken', 'during', 'the', 'transit', 'via', 'adu', 'count', 'given', 'from', 'an', 'earthbased', 'digital', 'ccd', 'camera', 'i', 'was', 'able', 'to', 'establish', 'a', 'definite', 'light', 'curve', 'and', 'learn', 'more', 'about', 'the', 'properties', 'of', 'this', 'exoplanet']]
|
[-0.04016955010395623, 0.011629237716680124, -0.16846582546072492, 0.03003533196564511, -0.1633735612445211, -0.1639451255264171, 0.07625755045752404, 0.3742697024244373, -0.21139023651889824, -0.33395556489921224, 0.13679738131241273, -0.3461750496447213, -0.1382761677190409, 0.26823235940882717, -0.1599527786533206, 0.040866108832217876, 0.13811788474943615, -0.006996596232056618, -0.054596621795731076, -0.31314342942530826, 0.22063129295010941, 0.008816576326044939, 0.10815122131637092, -0.08193276667872727, 0.11099292270807644, 0.05187014260692364, -0.14784884373894183, -0.03921003137730946, -0.20031977759800473, 0.06585594721264758, 0.25489777248842105, 0.20470243308030195, 0.16684639998474868, -0.3448051499139707, -0.15543415424240342, 0.041410069500285564, 0.10044440813362598, -0.008789076548764261, -0.07877179764638363, -0.35039792235119865, 0.04296119976394131, -0.15813539061947898, -0.11013034221290027, 0.02077761349284043, 0.05754335474230791, 0.03149693689735259, -0.2546262135097789, -0.021452569939448673, -0.025205845486814694, 0.19978253054037942, -0.11615674778566522, -0.1002083595100222, -0.0565769540114423, 0.13449710171859144, -0.027445916212716345, 0.06301039885098146, 0.08956689982659231, -0.10670826694201994, -0.03072588919993427, 0.37038390887743333, -0.11173950831832016, -0.03054349605878026, 0.13758391950090051, -0.17348511142151082, -0.1130382829124771, 0.16409054124664704, 0.17385805658680403, 0.13691598819016274, -0.21188812653960312, -0.024882503541510045, -0.006347888780726215, 0.25688278768211603, 0.0375238542081946, -0.0074524199905789505, 0.30441738882938685, 0.12405604237722138, 0.013394634278838411, 0.11179067585933006, -0.25758125368995055, 0.007934319549950502, -0.25168995906488373, -0.13612564751025985, -0.18107705087385187, 0.09492064731282387, -0.031679528717778356, -0.10613347085166162, 0.402697354302568, 0.13553419814965986, 0.16302453109331555, 0.016673212302690844, 0.335317908139047, 0.046870451260721153, 0.09203340738254079, 0.03627745380972402, 0.24314337053288848, 0.15197138745590286, 0.16895314703016714, -0.19688579227806904, 0.060906717506379396, -0.008808163831294593]
|
1,803.05566
|
Advancing Acoustic-to-Word CTC Model
|
The acoustic-to-word model based on the connectionist temporal classification
(CTC) criterion was shown as a natural end-to-end (E2E) model directly
targeting words as output units. However, the word-based CTC model suffers from
the out-of-vocabulary (OOV) issue as it can only model limited number of words
in the output layer and maps all the remaining words into an OOV output node.
Hence, such a word-based CTC model can only recognize the frequent words
modeled by the network output nodes. Our first attempt to improve the
acoustic-to-word model is a hybrid CTC model which consults a letter-based CTC
when the word-based CTC model emits OOV tokens during testing time. Then, we
propose a much better solution by training a mixed-unit CTC model which
decomposes all the OOV words into sequences of frequent words and multi-letter
units. Evaluated on a 3400 hours Microsoft Cortana voice assistant task, the
final acoustic-to-word solution improves the baseline word-based CTC by
relative 12.09% word error rate (WER) reduction when combined with our proposed
attention CTC. Such an E2E model without using any language model (LM) or
complex decoder outperforms the traditional context-dependent phoneme CTC which
has strong LM and decoder by relative 6.79%.
|
cs.CL
|
the acoustictoword model based on the connectionist temporal classification ctc criterion was shown as a natural endtoend e2e model directly targeting words as output units however the wordbased ctc model suffers from the outofvocabulary oov issue as it can only model limited number of words in the output layer and maps all the remaining words into an oov output node hence such a wordbased ctc model can only recognize the frequent words modeled by the network output nodes our first attempt to improve the acoustictoword model is a hybrid ctc model which consults a letterbased ctc when the wordbased ctc model emits oov tokens during testing time then we propose a much better solution by training a mixedunit ctc model which decomposes all the oov words into sequences of frequent words and multiletter units evaluated on a 3400 hours microsoft cortana voice assistant task the final acoustictoword solution improves the baseline wordbased ctc by relative 1209 word error rate wer reduction when combined with our proposed attention ctc such an e2e model without using any language model lm or complex decoder outperforms the traditional contextdependent phoneme ctc which has strong lm and decoder by relative 679
|
[['the', 'acoustictoword', 'model', 'based', 'on', 'the', 'connectionist', 'temporal', 'classification', 'ctc', 'criterion', 'was', 'shown', 'as', 'a', 'natural', 'endtoend', 'e2e', 'model', 'directly', 'targeting', 'words', 'as', 'output', 'units', 'however', 'the', 'wordbased', 'ctc', 'model', 'suffers', 'from', 'the', 'outofvocabulary', 'oov', 'issue', 'as', 'it', 'can', 'only', 'model', 'limited', 'number', 'of', 'words', 'in', 'the', 'output', 'layer', 'and', 'maps', 'all', 'the', 'remaining', 'words', 'into', 'an', 'oov', 'output', 'node', 'hence', 'such', 'a', 'wordbased', 'ctc', 'model', 'can', 'only', 'recognize', 'the', 'frequent', 'words', 'modeled', 'by', 'the', 'network', 'output', 'nodes', 'our', 'first', 'attempt', 'to', 'improve', 'the', 'acoustictoword', 'model', 'is', 'a', 'hybrid', 'ctc', 'model', 'which', 'consults', 'a', 'letterbased', 'ctc', 'when', 'the', 'wordbased', 'ctc', 'model', 'emits', 'oov', 'tokens', 'during', 'testing', 'time', 'then', 'we', 'propose', 'a', 'much', 'better', 'solution', 'by', 'training', 'a', 'mixedunit', 'ctc', 'model', 'which', 'decomposes', 'all', 'the', 'oov', 'words', 'into', 'sequences', 'of', 'frequent', 'words', 'and', 'multiletter', 'units', 'evaluated', 'on', 'a', '3400', 'hours', 'microsoft', 'cortana', 'voice', 'assistant', 'task', 'the', 'final', 'acoustictoword', 'solution', 'improves', 'the', 'baseline', 'wordbased', 'ctc', 'by', 'relative', '1209', 'word', 'error', 'rate', 'wer', 'reduction', 'when', 'combined', 'with', 'our', 'proposed', 'attention', 'ctc', 'such', 'an', 'e2e', 'model', 'without', 'using', 'any', 'language', 'model', 'lm', 'or', 'complex', 'decoder', 'outperforms', 'the', 'traditional', 'contextdependent', 'phoneme', 'ctc', 'which', 'has', 'strong', 'lm', 'and', 'decoder', 'by', 'relative', '679']]
|
[-0.04796960493728805, 0.014179597693668583, -0.005603120308847, 0.11517125125034139, -0.1373688139881079, -0.26016083601384593, 0.1164337908473009, 0.41213653804017947, -0.2985254008800555, -0.2863558293105318, 0.024333280042554133, -0.29142655917944815, -0.1266502982100997, 0.1588464001307073, -0.16155880309927922, 0.07919875209768995, 0.1756806498620277, 0.15409674741423282, -0.04045857257233598, -0.30772097348414645, 0.22137990589014803, 0.059233867495249094, 0.35848361536478385, -0.026571153981897692, 0.17818858107930283, -0.004453136810125448, 0.025560185268449668, -0.08480810566076961, 0.007630028098057478, 0.10857166476452197, 0.2700214830931658, 0.22510188669921496, 0.29127424373888433, -0.3788295250147199, -0.28608894563542725, 0.0976087731309235, 0.14596738972438453, 0.12475903756552352, 0.04957618801257549, -0.35132805086576785, 0.12285251961543392, -0.23588600678560442, 0.12802098290755962, -0.028437049629596565, -0.015229197278714333, -0.00024840734027421627, -0.25972490253535885, 0.055942150262685925, 0.19530985707645485, 0.051328272066819364, -0.058239075944808205, -0.08033225397125651, -0.01820132956147576, 0.14993060616662918, 0.030756051656312476, 0.15141232563660312, 0.09259972931423154, -0.14327362808518304, -0.15088606116433556, 0.36032742980198984, -0.10572679254871148, -0.25012851698467364, 0.18176402945955022, 0.019177684839814902, -0.07329897243911639, 0.09467780647847132, 0.19203007710017025, 0.07487348940892097, -0.1596830152197538, -0.004588318263025333, -0.05947432696628265, 0.31461603155073065, 0.1252053603100089, -0.017565116729252997, 0.1971299041253634, 0.2765521707586371, -0.07798736638699968, 0.14173506198850913, -0.11718525599437551, -0.04489187593213641, -0.19293038725661926, -0.12540439567409264, -0.14271648244354695, -0.04679053689544208, -0.10318500069067037, -0.14338104868567406, 0.41419950894390545, 0.18747352210339158, 0.20800327435613442, 0.17883702052028802, 0.3544070117175579, 0.05149843547529039, 0.14415457341999102, 0.10519181921427401, 0.12115081514542302, -0.02925946099970203, 0.09812897865075428, -0.18265268059614567, 0.13727129701142893, 0.12827722636075356]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.