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.06167
|
Semantic Segmentation of Pathological Lung Tissue with Dilated Fully
Convolutional Networks
|
Early and accurate diagnosis of interstitial lung diseases (ILDs) is crucial
for making treatment decisions, but can be challenging even for experienced
radiologists. The diagnostic procedure is based on the detection and
recognition of the different ILD pathologies in thoracic CT scans, yet their
manifestation often appears similar. In this study, we propose the use of a
deep purely convolutional neural network for the semantic segmentation of ILD
patterns, as the basic component of a computer aided diagnosis (CAD) system for
ILDs. The proposed CNN, which consists of convolutional layers with dilated
filters, takes as input a lung CT image of arbitrary size and outputs the
corresponding label map. We trained and tested the network on a dataset of 172
sparsely annotated CT scans, within a cross-validation scheme. The training was
performed in an end-to-end and semi-supervised fashion, utilizing both labeled
and non-labeled image regions. The experimental results show significant
performance improvement with respect to the state of the art.
|
cs.CV
|
early and accurate diagnosis of interstitial lung diseases ilds is crucial for making treatment decisions but can be challenging even for experienced radiologists the diagnostic procedure is based on the detection and recognition of the different ild pathologies in thoracic ct scans yet their manifestation often appears similar in this study we propose the use of a deep purely convolutional neural network for the semantic segmentation of ild patterns as the basic component of a computer aided diagnosis cad system for ilds the proposed cnn which consists of convolutional layers with dilated filters takes as input a lung ct image of arbitrary size and outputs the corresponding label map we trained and tested the network on a dataset of 172 sparsely annotated ct scans within a crossvalidation scheme the training was performed in an endtoend and semisupervised fashion utilizing both labeled and nonlabeled image regions the experimental results show significant performance improvement with respect to the state of the art
|
[['early', 'and', 'accurate', 'diagnosis', 'of', 'interstitial', 'lung', 'diseases', 'ilds', 'is', 'crucial', 'for', 'making', 'treatment', 'decisions', 'but', 'can', 'be', 'challenging', 'even', 'for', 'experienced', 'radiologists', 'the', 'diagnostic', 'procedure', 'is', 'based', 'on', 'the', 'detection', 'and', 'recognition', 'of', 'the', 'different', 'ild', 'pathologies', 'in', 'thoracic', 'ct', 'scans', 'yet', 'their', 'manifestation', 'often', 'appears', 'similar', 'in', 'this', 'study', 'we', 'propose', 'the', 'use', 'of', 'a', 'deep', 'purely', 'convolutional', 'neural', 'network', 'for', 'the', 'semantic', 'segmentation', 'of', 'ild', 'patterns', 'as', 'the', 'basic', 'component', 'of', 'a', 'computer', 'aided', 'diagnosis', 'cad', 'system', 'for', 'ilds', 'the', 'proposed', 'cnn', 'which', 'consists', 'of', 'convolutional', 'layers', 'with', 'dilated', 'filters', 'takes', 'as', 'input', 'a', 'lung', 'ct', 'image', 'of', 'arbitrary', 'size', 'and', 'outputs', 'the', 'corresponding', 'label', 'map', 'we', 'trained', 'and', 'tested', 'the', 'network', 'on', 'a', 'dataset', 'of', '172', 'sparsely', 'annotated', 'ct', 'scans', 'within', 'a', 'crossvalidation', 'scheme', 'the', 'training', 'was', 'performed', 'in', 'an', 'endtoend', 'and', 'semisupervised', 'fashion', 'utilizing', 'both', 'labeled', 'and', 'nonlabeled', 'image', 'regions', 'the', 'experimental', 'results', 'show', 'significant', 'performance', 'improvement', 'with', 'respect', 'to', 'the', 'state', 'of', 'the', 'art']]
|
[-0.032307757523085456, -0.0017527464671729831, -0.03023095357348211, 0.057278610009962, -0.05634358235110994, -0.17333767311356496, 0.0129187565013126, 0.4336847061640583, -0.1895934846281307, -0.316499792038303, 0.10021121852114448, -0.2634319351054728, -0.17777013075246942, 0.1925658838241361, -0.1472585852709017, 0.08665517954505049, 0.17978311625483911, 0.07163206612312933, -0.046374504036066355, -0.26780241250016845, 0.2624803961109137, 0.05099985583055968, 0.3657871384755708, 0.012870747369015589, 0.1605363828362897, -0.0072894679455203, -0.047768538736272605, 0.023536587998387405, -0.031375767014105806, 0.14824544812145177, 0.35123567457776517, 0.19241806519275997, 0.30415331419790165, -0.4206042571206126, -0.23179382349626393, 0.08127866075665224, 0.16406587804376613, 0.09852866179116973, -0.009317601560906042, -0.36670143610608646, 0.08194748053574585, -0.14819691993179732, 0.04380621855380014, -0.10110825559504519, -0.03249439704886754, -0.07616489324864233, -0.31885852722080016, 0.10242291485774331, 0.0223030759851099, 0.11868968159687938, -0.10120169464353239, -0.11238066562291352, -0.013035395473707467, 0.1881570328696398, -0.004178710497944849, 0.10879214659362332, 0.163918379318784, -0.25071133207384266, -0.12680731496366207, 0.335102401394397, 0.016232062560811757, -0.1832828203769168, 0.1847792950706207, -0.02683057804533746, -0.11015646597952582, 0.14036866147071123, 0.22800570467370562, 0.12439468734228284, -0.1540086083870847, -0.035889901397604264, -0.016619220731081442, 0.20070515480474568, 0.04663123034551973, -0.0580912615172565, 0.15418261172526398, 0.31543345406535084, -0.04055106211344537, 0.1672298419587605, -0.2193497783417115, -0.009412924964999547, -0.2348989965619694, -0.1483918025877756, -0.16573988315358293, -0.03169181462144479, -0.10776907661002041, -0.19617195281171007, 0.43476524364020863, 0.19070305888890288, 0.20462875966186403, 0.051017760515242115, 0.3375338071025908, -0.004673588085279334, 0.14298448903791722, 0.035351695796998685, 0.1804188785572478, 0.02438697460165713, 0.10488919259223621, -0.18548882234026678, 0.12216749985382194, 0.07415528129149607]
|
1,803.06168
|
Regular and First Order List Functions
|
We define two classes of functions, called regular (respectively,
first-order) list functions, which manipulate objects such as lists, lists of
lists, pairs of lists, lists of pairs of lists, etc. The definition is in the
style of regular expressions: the functions are constructed by starting with
some basic functions (e.g. projections from pairs, or head and tail operations
on lists) and putting them together using four combinators (most importantly,
composition of functions). Our main results are that first-order list functions
are exactly the same as first-order transductions, under a suitable encoding of
the inputs; and the regular list functions are exactly the same as
MSO-transductions.
|
cs.FL
|
we define two classes of functions called regular respectively firstorder list functions which manipulate objects such as lists lists of lists pairs of lists lists of pairs of lists etc the definition is in the style of regular expressions the functions are constructed by starting with some basic functions eg projections from pairs or head and tail operations on lists and putting them together using four combinators most importantly composition of functions our main results are that firstorder list functions are exactly the same as firstorder transductions under a suitable encoding of the inputs and the regular list functions are exactly the same as msotransductions
|
[['we', 'define', 'two', 'classes', 'of', 'functions', 'called', 'regular', 'respectively', 'firstorder', 'list', 'functions', 'which', 'manipulate', 'objects', 'such', 'as', 'lists', 'lists', 'of', 'lists', 'pairs', 'of', 'lists', 'lists', 'of', 'pairs', 'of', 'lists', 'etc', 'the', 'definition', 'is', 'in', 'the', 'style', 'of', 'regular', 'expressions', 'the', 'functions', 'are', 'constructed', 'by', 'starting', 'with', 'some', 'basic', 'functions', 'eg', 'projections', 'from', 'pairs', 'or', 'head', 'and', 'tail', 'operations', 'on', 'lists', 'and', 'putting', 'them', 'together', 'using', 'four', 'combinators', 'most', 'importantly', 'composition', 'of', 'functions', 'our', 'main', 'results', 'are', 'that', 'firstorder', 'list', 'functions', 'are', 'exactly', 'the', 'same', 'as', 'firstorder', 'transductions', 'under', 'a', 'suitable', 'encoding', 'of', 'the', 'inputs', 'and', 'the', 'regular', 'list', 'functions', 'are', 'exactly', 'the', 'same', 'as', 'msotransductions']]
|
[-0.10546667580381923, 0.08298414811225874, -0.021950275202592216, 0.12352053879294544, -0.07641491377282711, -0.13248249604144977, 0.0686867903740633, 0.4121623112687043, -0.27689889262408196, -0.30534429956404935, 0.1073330233128564, -0.34480287735128684, -0.09628467120984126, 0.2008361735314663, -0.0063597708186578185, 0.03189715840299392, 0.04466554614759627, 0.0677905951127676, -0.11425481058568472, -0.24642757204849094, 0.3774180768501191, -0.02986237109150915, 0.20637468997405709, 0.00165704170469239, 0.06889378963304417, 0.0510524484417623, -0.07464395463438926, 0.020718647798501133, -0.05853818249258135, 0.10903968068638019, 0.25073932936814214, 0.22592250396541896, 0.21431794724915, -0.3690666207422813, -0.10869832312289093, 0.0795730574499993, 0.07427049491906516, 0.11393962327274494, 0.012455384833516464, -0.27056191550301656, 0.11003627043461338, -0.12356396324577786, -0.054007726504156986, -0.09087924082719144, 0.045250459104066804, 0.17913875358977488, -0.22647800249535413, -0.06566573473669234, 0.09459794908761979, 0.06216033667636414, -0.04576107423442106, -0.18445850709187134, -0.056326225384448966, 0.17194764705685278, -0.03468899615774197, 0.008482666803701293, 0.10561892186690654, -0.11312725060575066, -0.16419311882262783, 0.40806542195911916, -0.03300682289977669, -0.2197477931955031, 0.2103196265708123, -0.09213117400760806, -0.16838267320057465, 0.11090051252616658, 0.10584552431745188, 0.17140510619473864, -0.1783017461409881, 0.014370693639475143, -0.08847628564662521, 0.13031698458251498, 0.1622329877512086, 0.07089633764033872, 0.21830457168675604, 0.02129408193840867, 0.02371051880930151, 0.19248716779541047, 0.008701216597719828, -0.07569296709927065, -0.34907506124249527, -0.1139697647520474, -0.14198224980251065, -0.058128895787965686, -0.08934832950125426, -0.24259604604116508, 0.41053394175888525, 0.06233276212144466, 0.2081689480159964, 0.11986510496520038, 0.2453019998679381, 0.11063771145196542, 0.12009645778730157, 0.06621904080024078, 0.06113047703707014, 0.07893579676082092, 0.0005155375049937339, -0.0738133221936767, 0.1040571602327483, 0.14105758169843327]
|
1,803.06169
|
Inverse spectral theory for a class of non-compact Hankel operators
|
We characterize all bounded Hankel operators $\Gamma $ such that
$\Gamma^*\Gamma$ has finite spectrum. We identify spectral data corresponding
to such operators and construct inverse spectral theory including the
characterization of these spectral data.
|
math.SP math.CV
|
we characterize all bounded hankel operators gamma such that gammagamma has finite spectrum we identify spectral data corresponding to such operators and construct inverse spectral theory including the characterization of these spectral data
|
[['we', 'characterize', 'all', 'bounded', 'hankel', 'operators', 'gamma', 'such', 'that', 'gammagamma', 'has', 'finite', 'spectrum', 'we', 'identify', 'spectral', 'data', 'corresponding', 'to', 'such', 'operators', 'and', 'construct', 'inverse', 'spectral', 'theory', 'including', 'the', 'characterization', 'of', 'these', 'spectral', 'data']]
|
[-0.05035366274585778, 0.10812119536708589, -0.051839074515032044, 0.1340408767432426, -0.09990214044228196, -0.09100722363500884, -0.036788519066194014, 0.42534666107685276, -0.31815786343632324, -0.23827815496108748, 0.1673613903253819, -0.34979535012759944, -0.12554720896437313, 0.1667803626676852, -0.01796425808446877, 0.1175722112371163, 0.035547898560197966, 0.03977158180240429, -0.11879963774205834, -0.10151474880915361, 0.4178458337220504, -0.009951927896701929, 0.18363136871520316, 0.09906768279545235, 0.02698509553870694, 0.01841996907905647, -0.15003670311786912, -0.06682837456746986, -0.1891588740075928, 0.1357217813757333, 0.32317428889148164, 0.19200563430786133, 0.15877338634295898, -0.32907092198729515, -0.22021741846181225, 0.2769373618066311, 0.13405245632836313, -0.02626624670952107, -0.0017662891892321181, -0.2510573644416802, 0.14935930382291024, -0.17852304012260653, -0.12269232752309604, -0.16334294471325297, -0.01927954257663452, 0.026375531162502186, -0.3031251524772608, 0.0161471821537072, 0.07711393362136953, 0.05358502711874969, -0.11057610277467492, -0.12047613859458854, -0.021336257838728754, 0.12922579392960126, -0.003937272298516649, -0.10461589689789848, 0.04748630103175387, -0.03715800273119274, -0.1284754846922376, 0.30835307654783584, -0.10455453488975763, -0.1359638863694713, 0.1524929910841765, -0.21066116270693866, -0.15231338973072442, 0.13218079247709477, 0.1691767196594314, 0.10687578092752532, -0.13572457139239166, 0.2032978985102311, -0.03917096608854605, 0.12528083713330102, 0.07367678954632896, 0.15892906575887042, 0.054587890365810104, 0.049376432755679794, 0.09165012748968421, 0.13478250869295813, -0.0938894389564115, 0.022304819036049372, -0.3326371214211439, -0.09030503937692354, -0.20133961235158937, 0.10272085057063536, -0.14389214677353404, -0.2657403656366197, 0.44423769205582864, 0.10183732523441766, 0.23018087006428026, 0.06558331560033064, 0.18513913514713445, 0.24324840104038065, 0.08264717149237792, 0.0628333840180527, 0.1320482569774895, 0.1956338853095517, 0.054254027930173004, -0.20597243656150319, -0.10258616155690768, 0.08717728735108253]
|
1,803.0617
|
Existence and smoothness of the density for the stochastic continuity
equation
|
We consider the stochastic continuity equation driven by Brownian motion. We
use the techniques of the Malliavin calculus to show that the law of the
solution has a density with respect to the Lebesgue measure. We also prove that
the density is Holder continuous and satisfies some Gaussian-type estimates.
|
math.PR math.AP
|
we consider the stochastic continuity equation driven by brownian motion we use the techniques of the malliavin calculus to show that the law of the solution has a density with respect to the lebesgue measure we also prove that the density is holder continuous and satisfies some gaussiantype estimates
|
[['we', 'consider', 'the', 'stochastic', 'continuity', 'equation', 'driven', 'by', 'brownian', 'motion', 'we', 'use', 'the', 'techniques', 'of', 'the', 'malliavin', 'calculus', 'to', 'show', 'that', 'the', 'law', 'of', 'the', 'solution', 'has', 'a', 'density', 'with', 'respect', 'to', 'the', 'lebesgue', 'measure', 'we', 'also', 'prove', 'that', 'the', 'density', 'is', 'holder', 'continuous', 'and', 'satisfies', 'some', 'gaussiantype', 'estimates']]
|
[-0.08607748662102588, 0.06639158225865388, -0.15988965095876126, 0.07061938741196859, -0.08100007274853331, -0.08130365050378807, 0.02284723569696047, 0.36264398357146704, -0.3478574302731728, -0.17853609989135888, 0.13257953122600305, -0.31632055380210583, -0.13924727554680133, 0.1599968803894459, -0.1325216000823646, 0.10725777227507562, 0.01506519184580871, 0.05064971224233812, -0.0808773166309966, -0.16716014855655328, 0.36336809723657004, -0.054859328691904644, 0.22252604730275213, 0.0026896162984930737, 0.18190061652614753, -0.02350574984614338, -0.05084224034823021, 0.009281621770743204, -0.23748141450347732, 0.14877024163701097, 0.11653682551517779, 0.08590642850827046, 0.3545154710205234, -0.4070222422252504, -0.21138694553578996, 0.14402910780009567, 0.058312782446963106, 0.021709448467864066, -0.06213700834528676, -0.3205042191762097, 0.09016995390934147, -0.133329839198565, -0.23101755529071907, -0.12979522717603464, 0.0233840071881304, 0.1507853027433157, -0.2991958419051097, 0.11004391456514653, 0.0781870976052418, -0.02949280692834635, -0.1554714034748625, -0.040917975637985736, -0.0288680659188908, 0.038659605710786214, 0.06196722356193908, 0.05006499358509876, 0.12806358430724668, -0.06707377541734248, -0.1070974977420909, 0.3261231096005257, -0.16594555312577558, -0.3118695545637486, 0.14337313334856713, -0.22091807809905434, -0.16223137206112853, 0.08508381416679037, 0.09381796067998725, 0.1146778087923125, -0.1650151271297007, 0.17987275480801163, -0.02948223975277981, 0.15081362247619093, 0.06979366587665008, 0.00730370044024015, 0.05289251980732898, 0.11307229850517243, 0.20882354408730658, 0.13629307618782838, -0.08671695205896181, -0.13417118650918103, -0.343753208843421, -0.19694723650737075, -0.19895641872545286, 0.08998111196394477, -0.12481272546544775, -0.18514445716781275, 0.3073576286563422, 0.20371025327441036, 0.1412183343603903, 0.14880454694206008, 0.2465542278119496, 0.2894523214662866, -0.018901900214865347, 0.08256137054603623, 0.1805677957392098, 0.20077031637941087, 0.13655130101405843, -0.19388598741307778, 0.08673576546870933, 0.14282600156848832]
|
1,803.06171
|
Ultrafast spin initialization in a gated InSb nanowire quantum dots
|
We propose a fast and accurate spin initialization method for a single
electron trapped in an electrostatic quantum dot. The dot is created in a
nanodevice composed of a catalytically grown indium antimonide (InSb) nanowire
and nearby gates to which control voltages are applied. Initially we insert a
single electron of arbitrary spin into the wire. Operations on spin are
performed using the Rashba spin-orbit interaction induced by an electric field.
First, a single pulse of voltages applied to lateral gates is used to split the
electron wavepacket into two parts with opposite spin orientations. Next,
another voltage pulse applied to the remaining gates rotates spins of both
parts in opposite directions by $\pi/2$. This way, initially opposite spin
parts eventually point in the same direction, along the axis of the quantum
wire. We thus set spin in a predefined direction regardless of its initial
orientation. This is achieved in time less than $60\,\mathrm{ps}$ without the
use of microwaves, photons or external magnetic fields.
|
cond-mat.mes-hall
|
we propose a fast and accurate spin initialization method for a single electron trapped in an electrostatic quantum dot the dot is created in a nanodevice composed of a catalytically grown indium antimonide insb nanowire and nearby gates to which control voltages are applied initially we insert a single electron of arbitrary spin into the wire operations on spin are performed using the rashba spinorbit interaction induced by an electric field first a single pulse of voltages applied to lateral gates is used to split the electron wavepacket into two parts with opposite spin orientations next another voltage pulse applied to the remaining gates rotates spins of both parts in opposite directions by pi2 this way initially opposite spin parts eventually point in the same direction along the axis of the quantum wire we thus set spin in a predefined direction regardless of its initial orientation this is achieved in time less than 60mathrmps without the use of microwaves photons or external magnetic fields
|
[['we', 'propose', 'a', 'fast', 'and', 'accurate', 'spin', 'initialization', 'method', 'for', 'a', 'single', 'electron', 'trapped', 'in', 'an', 'electrostatic', 'quantum', 'dot', 'the', 'dot', 'is', 'created', 'in', 'a', 'nanodevice', 'composed', 'of', 'a', 'catalytically', 'grown', 'indium', 'antimonide', 'insb', 'nanowire', 'and', 'nearby', 'gates', 'to', 'which', 'control', 'voltages', 'are', 'applied', 'initially', 'we', 'insert', 'a', 'single', 'electron', 'of', 'arbitrary', 'spin', 'into', 'the', 'wire', 'operations', 'on', 'spin', 'are', 'performed', 'using', 'the', 'rashba', 'spinorbit', 'interaction', 'induced', 'by', 'an', 'electric', 'field', 'first', 'a', 'single', 'pulse', 'of', 'voltages', 'applied', 'to', 'lateral', 'gates', 'is', 'used', 'to', 'split', 'the', 'electron', 'wavepacket', 'into', 'two', 'parts', 'with', 'opposite', 'spin', 'orientations', 'next', 'another', 'voltage', 'pulse', 'applied', 'to', 'the', 'remaining', 'gates', 'rotates', 'spins', 'of', 'both', 'parts', 'in', 'opposite', 'directions', 'by', 'pi2', 'this', 'way', 'initially', 'opposite', 'spin', 'parts', 'eventually', 'point', 'in', 'the', 'same', 'direction', 'along', 'the', 'axis', 'of', 'the', 'quantum', 'wire', 'we', 'thus', 'set', 'spin', 'in', 'a', 'predefined', 'direction', 'regardless', 'of', 'its', 'initial', 'orientation', 'this', 'is', 'achieved', 'in', 'time', 'less', 'than', '60mathrmps', 'without', 'the', 'use', 'of', 'microwaves', 'photons', 'or', 'external', 'magnetic', 'fields']]
|
[-0.21290175880139772, 0.22244115559076405, -0.009422082893916068, -0.025799902790923104, -0.001069832970302529, -0.21212564114955443, 0.0396609049707514, 0.4735376238822937, -0.2567775893979277, -0.29213274556477814, -0.027860739204084124, -0.24627724762554595, -0.007615341254984217, 0.23923747827573194, 0.018244388612541455, 0.011956627274637734, 0.015985164408532024, -0.007165954711109948, -0.08887520092796602, -0.206911436490646, 0.23443987987143847, -0.01198838261653172, 0.2917327186866932, 0.005090181992897775, 0.11474000739984991, 0.055990724475837195, 0.11929938144856161, 0.008104790842012028, -0.052336719011362255, 0.0672413833050823, 0.20106986852861267, -0.08605270659939551, 0.24127354316036304, -0.5392805764257359, -0.12845221960465739, 0.013696314207066787, 0.1692227156364296, 0.19878757700675448, -0.08187664332628204, -0.30414776907422425, 0.029499120395373484, -0.1412755150756473, -0.13122906248182334, -0.0023876374953089316, 0.022405331855085593, 0.0032436494241280056, -0.2491735036204929, 0.03260461417558186, 0.08810888046464466, 0.0317580734716694, -0.02947633512792366, -0.059761533767921975, -0.04031351030849926, 0.10516813002327496, 0.003214612284652386, 0.11030115483134437, 0.261833927834098, -0.09340857601427456, -0.15565940532390532, 0.29737896399938163, -0.040518827573985484, -0.21534461713041766, 0.1019809461467288, -0.17493058899217542, -0.024625691916633604, 0.12448555135533808, 0.14961869243326728, 0.12221468093182229, -0.14975302966105883, 0.03975354543775663, 0.02650487874177473, 0.18632425542687284, 0.10404818141661538, 0.015167394298717288, 0.2987309237542145, 0.14625580229173682, 0.10612412615239254, 0.19040285662799342, -0.16910235180366057, -0.041946148495561233, -0.22669951719991818, -0.16909955532718207, -0.22666905874077894, 0.09927740520254874, -0.040868145339240956, -0.1683134826105888, 0.483837342298264, 0.13343640598054243, 0.16786686376278556, -0.08440855748171523, 0.34319227932241, 0.1007464673560994, 0.10218149349179141, 0.03941961231857875, 0.2166840969395618, 0.19533420307561755, 0.07958620596974174, -0.2701894260565836, 0.04093765589105754, -0.013444233102941074]
|
1,803.06172
|
Downlink coverage probability in cellular networks with Poisson-Poisson
cluster deployed base stations
|
Poisson-Poisson cluster processes (PPCPs) are a class of point processes
exhibiting attractive point patterns. Recently, PPCPs are actively studied for
modeling and analysis of heterogeneous cellular networks or device-to-device
networks. However, surprisingly, to the best knowledge of the author, there is
no exact derivation of downlink coverage probability in a numerically
computable form for a cellular network with base stations (BSs) deployed
according to a PPCP within the most fundamental setup such as single-tier,
Rayleigh fading and nearest BS association. In this paper, we consider this
fundamental model and derive a numerically computable form of coverage
probability. To validate the analysis, we compare the results of numerical
computations with those by Monte Carlo simulations and confirm the good
agreement.
|
cs.IT math.IT math.PR
|
poissonpoisson cluster processes ppcps are a class of point processes exhibiting attractive point patterns recently ppcps are actively studied for modeling and analysis of heterogeneous cellular networks or devicetodevice networks however surprisingly to the best knowledge of the author there is no exact derivation of downlink coverage probability in a numerically computable form for a cellular network with base stations bss deployed according to a ppcp within the most fundamental setup such as singletier rayleigh fading and nearest bs association in this paper we consider this fundamental model and derive a numerically computable form of coverage probability to validate the analysis we compare the results of numerical computations with those by monte carlo simulations and confirm the good agreement
|
[['poissonpoisson', 'cluster', 'processes', 'ppcps', 'are', 'a', 'class', 'of', 'point', 'processes', 'exhibiting', 'attractive', 'point', 'patterns', 'recently', 'ppcps', 'are', 'actively', 'studied', 'for', 'modeling', 'and', 'analysis', 'of', 'heterogeneous', 'cellular', 'networks', 'or', 'devicetodevice', 'networks', 'however', 'surprisingly', 'to', 'the', 'best', 'knowledge', 'of', 'the', 'author', 'there', 'is', 'no', 'exact', 'derivation', 'of', 'downlink', 'coverage', 'probability', 'in', 'a', 'numerically', 'computable', 'form', 'for', 'a', 'cellular', 'network', 'with', 'base', 'stations', 'bss', 'deployed', 'according', 'to', 'a', 'ppcp', 'within', 'the', 'most', 'fundamental', 'setup', 'such', 'as', 'singletier', 'rayleigh', 'fading', 'and', 'nearest', 'bs', 'association', 'in', 'this', 'paper', 'we', 'consider', 'this', 'fundamental', 'model', 'and', 'derive', 'a', 'numerically', 'computable', 'form', 'of', 'coverage', 'probability', 'to', 'validate', 'the', 'analysis', 'we', 'compare', 'the', 'results', 'of', 'numerical', 'computations', 'with', 'those', 'by', 'monte', 'carlo', 'simulations', 'and', 'confirm', 'the', 'good', 'agreement']]
|
[-0.1681035648370719, 0.01001788915381727, -0.026910201765787907, 0.09206376516391547, -0.026075428359719932, -0.17044261236014402, 0.16091271824776554, 0.39845507527486634, -0.21322501039542416, -0.25918496209077346, 0.07551032920073494, -0.26051898639744675, -0.20884539371030006, 0.16241686584021992, -0.02909739094818186, 0.05135211458083433, 0.08727355755499414, 0.02293121624483257, -0.024455894962844685, -0.19920662029757777, 0.2912441105303219, 0.11108004118904917, 0.31289715508524424, -0.00994625062140453, 0.05055627143647299, -0.01079756872027985, -0.09675303717744815, 0.007156088885004954, -0.14638497170785236, 0.10750332331627162, 0.3151283092343081, 0.1199851674027741, 0.2564487588068502, -0.4226754492578598, -0.2717448132048942, 0.1163209329207993, 0.17948064810604367, 0.06281593285548763, -0.05506865137742243, -0.2646799387776444, 0.13847902637277532, -0.22138335991205058, -0.11614470169521295, -0.050163355505722776, -0.009997427758052308, 0.09388601921924637, -0.31570807486497915, 0.02807540063642793, -0.015601977785555726, 0.06828115042697033, -0.03547003583258225, -0.11193684856287944, 0.012642283828403706, 0.16136245954777792, 0.027839406673001964, 0.0020974311722904188, 0.07349115708627953, -0.11204650501808168, -0.12387963739406858, 0.38606686163375264, -0.005090851201397232, -0.20813379608468813, 0.22357619968521544, -0.11989505351003674, -0.14344399283902767, 0.13198509606986475, 0.19002437408472228, 0.09478574480192783, -0.22222844482614443, 0.0558059647356948, -0.06717060271722193, 0.13706425342432216, 0.06513666107844657, 0.03216827753477314, 0.17405871109256887, 0.22841625429021242, 0.04580205164722398, 0.11077324969845259, -0.09920986330646098, -0.19724229825103384, -0.23647069010055727, -0.12721316470131755, -0.20066113295590776, 0.023785589682734292, -0.09191533622210526, -0.12426740688104661, 0.3214425792495728, 0.13498244182262412, 0.14920770562389213, 0.14526125430487669, 0.30975356086507505, 0.10545969883708331, 0.018611946099429812, 0.10643594963157661, 0.17509203858294975, 0.14892517413315165, 0.09254910271519269, -0.1563010252176378, 0.06374030859153877, 0.023229149799061637]
|
1,803.06173
|
Energy Sustainable Mobile Networks via Energy Routing, Learning and
Foresighted Optimization
|
The design of self-sustainable base station (BS) deployments is addressed in
this paper: BSs have energy harvesting and storage capabilities, they can use
ambient energy to serve the local traffic or store it for later use. A
dedicated power packet grid allows energy transfer across BSs, compensating for
imbalance in the harvested energy or in the traffic load. Some BSs are offgrid,
i.e., they can only use the locally harvested energy and that transferred from
other BSs, whereas others are ongrid, i.e., they can also purchase energy from
the power grid. Within this setup, an optimization problem is formulated where:
energy harvested and traffic processes are estimated at the BSs through
Gaussian Processes (GPs), and a Model Predictive Control (MPC) framework is
devised for the computation of energy allocation and transfer schedules.
Numerical results, obtained using real energy harvesting and traffic profiles,
show substantial improvements in terms of energy self-sustainability of the
system, outage probability (zero in most cases), and in the amount of energy
purchased from the power grid, which is of more than halved with respect to the
case where the optimization does not consider GP forecasting and MPC.
|
cs.NI
|
the design of selfsustainable base station bs deployments is addressed in this paper bss have energy harvesting and storage capabilities they can use ambient energy to serve the local traffic or store it for later use a dedicated power packet grid allows energy transfer across bss compensating for imbalance in the harvested energy or in the traffic load some bss are offgrid ie they can only use the locally harvested energy and that transferred from other bss whereas others are ongrid ie they can also purchase energy from the power grid within this setup an optimization problem is formulated where energy harvested and traffic processes are estimated at the bss through gaussian processes gps and a model predictive control mpc framework is devised for the computation of energy allocation and transfer schedules numerical results obtained using real energy harvesting and traffic profiles show substantial improvements in terms of energy selfsustainability of the system outage probability zero in most cases and in the amount of energy purchased from the power grid which is of more than halved with respect to the case where the optimization does not consider gp forecasting and mpc
|
[['the', 'design', 'of', 'selfsustainable', 'base', 'station', 'bs', 'deployments', 'is', 'addressed', 'in', 'this', 'paper', 'bss', 'have', 'energy', 'harvesting', 'and', 'storage', 'capabilities', 'they', 'can', 'use', 'ambient', 'energy', 'to', 'serve', 'the', 'local', 'traffic', 'or', 'store', 'it', 'for', 'later', 'use', 'a', 'dedicated', 'power', 'packet', 'grid', 'allows', 'energy', 'transfer', 'across', 'bss', 'compensating', 'for', 'imbalance', 'in', 'the', 'harvested', 'energy', 'or', 'in', 'the', 'traffic', 'load', 'some', 'bss', 'are', 'offgrid', 'ie', 'they', 'can', 'only', 'use', 'the', 'locally', 'harvested', 'energy', 'and', 'that', 'transferred', 'from', 'other', 'bss', 'whereas', 'others', 'are', 'ongrid', 'ie', 'they', 'can', 'also', 'purchase', 'energy', 'from', 'the', 'power', 'grid', 'within', 'this', 'setup', 'an', 'optimization', 'problem', 'is', 'formulated', 'where', 'energy', 'harvested', 'and', 'traffic', 'processes', 'are', 'estimated', 'at', 'the', 'bss', 'through', 'gaussian', 'processes', 'gps', 'and', 'a', 'model', 'predictive', 'control', 'mpc', 'framework', 'is', 'devised', 'for', 'the', 'computation', 'of', 'energy', 'allocation', 'and', 'transfer', 'schedules', 'numerical', 'results', 'obtained', 'using', 'real', 'energy', 'harvesting', 'and', 'traffic', 'profiles', 'show', 'substantial', 'improvements', 'in', 'terms', 'of', 'energy', 'selfsustainability', 'of', 'the', 'system', 'outage', 'probability', 'zero', 'in', 'most', 'cases', 'and', 'in', 'the', 'amount', 'of', 'energy', 'purchased', 'from', 'the', 'power', 'grid', 'which', 'is', 'of', 'more', 'than', 'halved', 'with', 'respect', 'to', 'the', 'case', 'where', 'the', 'optimization', 'does', 'not', 'consider', 'gp', 'forecasting', 'and', 'mpc']]
|
[-0.16473500543396533, 0.05994486711324736, -0.04182425171078344, 0.0625942191633235, -0.046381544516816815, -0.1814988353167763, 0.12488875073241801, 0.3840264574190631, -0.2831216678517037, -0.345674383657904, 0.09588884374320919, -0.2861593399741303, -0.06675840595417719, 0.17935085319639646, -0.11076469066493697, 0.03171027741085309, 0.08175332552182893, 0.06377688237631703, 0.019001314977881212, -0.22639964931859044, 0.2729177794160799, 0.14396920797649126, 0.3604507963538794, 0.037836155091066165, 0.07324233116869722, -0.006379618102206766, -0.024216743607893196, -0.013524508362700959, -0.05632311854462282, 0.10435631824840172, 0.3403943275401359, 0.16829724989329217, 0.27779508553718396, -0.4740043577021329, -0.28265890097781937, 0.16092035935762586, 0.1463154439560835, 0.024691061586682828, -0.035079775239521986, -0.1898179151768752, 0.11277307030813115, -0.23735244556559318, -0.04231836018762039, -0.030890357095494633, -0.06795212678630783, 0.1181693111463445, -0.30851478791303194, 0.039178044564933005, -0.037598718284429365, 0.004929187000577986, -0.10528715352158438, -0.12449250515508929, -0.0706338562310249, 0.1433941322227657, 0.03656637030702416, -0.048118212084768644, 0.14491646704007993, -0.10077020176320645, -0.06760585264190641, 0.4027789305329947, 0.02894079685660691, -0.22230027900418725, 0.13996446668048493, -0.06753307914956234, -0.07048843364738396, 0.13822193119518889, 0.25012453212963504, 0.07126944070847714, -0.17823925834022344, 0.04314939447322675, 0.039297635562191305, 0.16980896252987623, 0.08060080145305286, 0.03981983976643435, 0.17888407020327388, 0.17163936482956973, 0.18151804501939253, 0.0892707728850899, -0.11683162347857319, -0.1430185647201066, -0.2411893439139069, -0.10928502187610686, -0.22762122371292512, 0.055897830540624555, -0.06870636312444621, -0.043133135533925754, 0.3813889341389868, 0.10675432360322698, 0.13842987511989646, 0.08019400171521705, 0.39742078019686394, 0.1534501233562359, 0.060058051773897954, 0.1852523452353649, 0.17064058160750958, 0.03893703016944209, 0.2108133680782042, -0.1990303276630889, 0.028689009934683277, -0.03583913600359951]
|
1,803.06174
|
Some HCI Priorities for GDPR-Compliant Machine Learning
|
In this short paper, we consider the roles of HCI in enabling the better
governance of consequential machine learning systems using the rights and
obligations laid out in the recent 2016 EU General Data Protection Regulation
(GDPR)---a law which involves heavy interaction with people and systems.
Focussing on those areas that relate to algorithmic systems in society, we
propose roles for HCI in legal contexts in relation to fairness, bias and
discrimination; data protection by design; data protection impact assessments;
transparency and explanations; the mitigation and understanding of automation
bias; and the communication of envisaged consequences of processing.
|
cs.HC cs.AI cs.LG
|
in this short paper we consider the roles of hci in enabling the better governance of consequential machine learning systems using the rights and obligations laid out in the recent 2016 eu general data protection regulation gdpra law which involves heavy interaction with people and systems focussing on those areas that relate to algorithmic systems in society we propose roles for hci in legal contexts in relation to fairness bias and discrimination data protection by design data protection impact assessments transparency and explanations the mitigation and understanding of automation bias and the communication of envisaged consequences of processing
|
[['in', 'this', 'short', 'paper', 'we', 'consider', 'the', 'roles', 'of', 'hci', 'in', 'enabling', 'the', 'better', 'governance', 'of', 'consequential', 'machine', 'learning', 'systems', 'using', 'the', 'rights', 'and', 'obligations', 'laid', 'out', 'in', 'the', 'recent', '2016', 'eu', 'general', 'data', 'protection', 'regulation', 'gdpra', 'law', 'which', 'involves', 'heavy', 'interaction', 'with', 'people', 'and', 'systems', 'focussing', 'on', 'those', 'areas', 'that', 'relate', 'to', 'algorithmic', 'systems', 'in', 'society', 'we', 'propose', 'roles', 'for', 'hci', 'in', 'legal', 'contexts', 'in', 'relation', 'to', 'fairness', 'bias', 'and', 'discrimination', 'data', 'protection', 'by', 'design', 'data', 'protection', 'impact', 'assessments', 'transparency', 'and', 'explanations', 'the', 'mitigation', 'and', 'understanding', 'of', 'automation', 'bias', 'and', 'the', 'communication', 'of', 'envisaged', 'consequences', 'of', 'processing']]
|
[-0.1310075790688549, 0.04814646727304675, -0.06060173822394044, 0.09451471879170996, -0.08666286914916613, -0.16351528665454118, 0.1074633887145649, 0.3265117596278025, -0.23407087840869562, -0.33883295039233474, 0.08533542674543701, -0.28783317750377446, -0.1376766751606747, 0.19393448552750436, -0.17336457337915284, 0.043266763224160856, 0.023919616729865985, -0.03635624025170643, 0.012149902034224462, -0.25233760489794166, 0.32037020945134237, 0.08714402230821319, 0.39274004643264504, 0.09768190522937431, 0.026479423184130227, 0.05739207613790773, -0.0664668456488049, -0.026405850079717096, -0.11203435363679147, 0.17096332984870857, 0.353139306618424, 0.22725999215137713, 0.374490488973475, -0.4596494034931217, -0.17375301148204766, 0.0754580556069376, 0.10576285434329939, 0.08497892552506678, -0.1021076906400435, -0.3058133163518205, 0.0048562730518505745, -0.22664726045481937, -0.0863404781173569, -0.0998528132061522, 0.046333756701079844, 0.020162154880793978, -0.2420191944663211, 0.019648405746676836, 0.07990140892738073, 0.16101570447100347, -0.043282894364836594, -0.11325599123440568, 0.014530168903857162, 0.1904289357594608, 0.09107445661799464, -0.04647319190223346, 0.16284546438009315, -0.19093759909041763, -0.19814552056612736, 0.4155434344309507, 0.03247371080725156, -0.1455081918555283, 0.20536632038240044, -0.0887068611420883, -0.188356164842844, -0.016282946927492152, 0.2570379806154998, 0.004469924814385223, -0.19977990874406143, 0.03357305298151314, 0.0910914445130308, 0.14299541544745265, 0.05544771525538383, 0.0727364663448732, 0.2174681687881191, 0.23402492391886479, 0.0570206381752607, 0.0798664775955462, -0.005152734594189168, -0.11214753783778432, -0.23595712098686658, -0.13532547388686655, -0.058160578059128575, 0.002958441878064084, -0.03249419681618672, -0.084424007232733, 0.3734308354377737, 0.23904899770835625, 0.09745043240602791, -0.0012790769993894033, 0.32851090639368774, 0.024176289375448964, 0.089522407745424, 0.043031744699752364, 0.22022780952087037, 0.0439662613075457, 0.18683835166535273, -0.19263199348237903, 0.13045912369072782, -0.01795132097202478]
|
1,803.06175
|
Dynamically enhanced magnetic incommensurability: Effects of local
dynamics on non-local spin-correlations in a strongly correlated metal
|
We compute the spin susceptibility of the two-dimensional Hubbard model away
from half-filling, and analyze the impact of frequency dependent vertex
corrections as obtained from the dynamical mean field theory (DMFT). We find
that the local dynamics captured by the DMFT vertex strongly affects non-local
spin correlations, and thus the momentum dependence of the spin susceptibility.
While the widely used random phase approximation yields commensurate
N\'eel-type antiferromagnetism as the dominant instability over a wide doping
range, the vertex corrections favor incommensurate ordering wave vectors away
from $(\pi,\pi)$. Our results indicate that the connection between the magnetic
ordering wave vector and the Fermi surface geometry, familiar for weakly
interacting systems, can hold in a strongly correlated metal, too.
|
cond-mat.str-el
|
we compute the spin susceptibility of the twodimensional hubbard model away from halffilling and analyze the impact of frequency dependent vertex corrections as obtained from the dynamical mean field theory dmft we find that the local dynamics captured by the dmft vertex strongly affects nonlocal spin correlations and thus the momentum dependence of the spin susceptibility while the widely used random phase approximation yields commensurate neeltype antiferromagnetism as the dominant instability over a wide doping range the vertex corrections favor incommensurate ordering wave vectors away from pipi our results indicate that the connection between the magnetic ordering wave vector and the fermi surface geometry familiar for weakly interacting systems can hold in a strongly correlated metal too
|
[['we', 'compute', 'the', 'spin', 'susceptibility', 'of', 'the', 'twodimensional', 'hubbard', 'model', 'away', 'from', 'halffilling', 'and', 'analyze', 'the', 'impact', 'of', 'frequency', 'dependent', 'vertex', 'corrections', 'as', 'obtained', 'from', 'the', 'dynamical', 'mean', 'field', 'theory', 'dmft', 'we', 'find', 'that', 'the', 'local', 'dynamics', 'captured', 'by', 'the', 'dmft', 'vertex', 'strongly', 'affects', 'nonlocal', 'spin', 'correlations', 'and', 'thus', 'the', 'momentum', 'dependence', 'of', 'the', 'spin', 'susceptibility', 'while', 'the', 'widely', 'used', 'random', 'phase', 'approximation', 'yields', 'commensurate', 'neeltype', 'antiferromagnetism', 'as', 'the', 'dominant', 'instability', 'over', 'a', 'wide', 'doping', 'range', 'the', 'vertex', 'corrections', 'favor', 'incommensurate', 'ordering', 'wave', 'vectors', 'away', 'from', 'pipi', 'our', 'results', 'indicate', 'that', 'the', 'connection', 'between', 'the', 'magnetic', 'ordering', 'wave', 'vector', 'and', 'the', 'fermi', 'surface', 'geometry', 'familiar', 'for', 'weakly', 'interacting', 'systems', 'can', 'hold', 'in', 'a', 'strongly', 'correlated', 'metal', 'too']]
|
[-0.16909677281768787, 0.22561557187587342, -0.06107153357444411, 0.110109229454707, -0.053781705709476754, -0.12762929591634828, 0.06729422991351089, 0.3256359047646451, -0.29180558858455247, -0.22954776261447588, -0.0017158360684163168, -0.35150164630041164, -0.15639942823551023, 0.13191262046551794, 0.11687723617268424, -0.006039188019573116, -0.005765483897720647, 0.018074807623385362, -0.16467457763357168, -0.19323335794938934, 0.3192044164165536, 0.0038475596791722327, 0.2794872123079422, 0.08788697116582407, 0.04544512236204285, 0.11764892385317346, 0.08247038701342212, 0.0745656470187072, -0.13467638601380316, 0.009978314670614706, 0.238282907817863, -0.0579209460868922, 0.19124465235150778, -0.42548253723921686, -0.24804656287161714, -0.0008067438283409828, 0.151703462157892, 0.14954725009564343, -0.032833210092125475, -0.2953850801946579, 0.002123749369166346, -0.19228909510729086, -0.1633485852786475, -0.10092576762709098, -0.0263939000836287, 0.03939289429262838, -0.2607957052751484, 0.15384701972142753, 0.06800676249718875, 0.05995522784148781, -0.09098995762924926, -0.1435862296523574, -0.12203654469563983, 0.07082470656426337, 0.05198457994887359, 0.13476609614872748, 0.15711845388301673, -0.15473106360206237, -0.11173502298501822, 0.36183863040855807, -0.0730996964385924, -0.1419484303949767, 0.16958120954272726, -0.24063980388733694, -0.053991712339254275, 0.1776016856281039, 0.1442776828343606, 0.0700360448537474, -0.12073222168374997, 0.10607026915641056, -0.018955299320071537, 0.18399596924527398, -0.00489922365348818, 0.09472240297856112, 0.2745175455720761, 0.12090517577325177, 0.07611738082467236, 0.11846270634888266, -0.11473338688429222, -0.1494566317444715, -0.24519116459334764, -0.04026032559191569, -0.21387285110341686, 0.039447881660223186, -0.11557840267915187, -0.20208521855511985, 0.414882239798068, 0.2091440683366078, 0.1721821850579646, 0.005900866956983367, 0.21655602909178814, 0.13203860034979084, 0.06135644625203732, 0.07012018052717814, 0.24052464860913336, 0.20814963531457525, 0.09298463225161704, -0.3228259137413727, 0.05364707177484997, 0.059596983212171696]
|
1,803.06176
|
The impact of classical control electronics on qubit fidelity
|
Quantum processors rely on classical electronic controllers to manipulate and
read out the quantum state. As the performance of the quantum processor
improves, non-idealities in the classical controller can become the performance
bottleneck for the whole quantum computer. To prevent such limitation, this
paper presents a systematic study of the impact of the classical electrical
signals on the qubit fidelity. All operations, i.e. single-qubit rotations,
two-qubit gates and read-out, are considered, in the presence of errors in the
control electronics, such as static, dynamic, systematic and random errors.
Although the presented study could be extended to any qubit technology, it
currently focuses on single-electron spin qubits, because of several
advantages, such as purely electrical control and long coherence times, and for
their potential for large-scale integration. As a result of this study,
detailed electrical specifications for the classical control electronics for a
given qubit fidelity can be derived, as demonstrated with specific case
studies. We also discuss the effect on qubit fidelity of the performance of the
general-purpose room-temperature equipment that is typically employed to
control the few qubits available today. Ultimately, we show that tailor-made
electronic controllers can achieve significantly lower power, cost and size, as
required to support the scaling up of quantum computers.
|
quant-ph
|
quantum processors rely on classical electronic controllers to manipulate and read out the quantum state as the performance of the quantum processor improves nonidealities in the classical controller can become the performance bottleneck for the whole quantum computer to prevent such limitation this paper presents a systematic study of the impact of the classical electrical signals on the qubit fidelity all operations ie singlequbit rotations twoqubit gates and readout are considered in the presence of errors in the control electronics such as static dynamic systematic and random errors although the presented study could be extended to any qubit technology it currently focuses on singleelectron spin qubits because of several advantages such as purely electrical control and long coherence times and for their potential for largescale integration as a result of this study detailed electrical specifications for the classical control electronics for a given qubit fidelity can be derived as demonstrated with specific case studies we also discuss the effect on qubit fidelity of the performance of the generalpurpose roomtemperature equipment that is typically employed to control the few qubits available today ultimately we show that tailormade electronic controllers can achieve significantly lower power cost and size as required to support the scaling up of quantum computers
|
[['quantum', 'processors', 'rely', 'on', 'classical', 'electronic', 'controllers', 'to', 'manipulate', 'and', 'read', 'out', 'the', 'quantum', 'state', 'as', 'the', 'performance', 'of', 'the', 'quantum', 'processor', 'improves', 'nonidealities', 'in', 'the', 'classical', 'controller', 'can', 'become', 'the', 'performance', 'bottleneck', 'for', 'the', 'whole', 'quantum', 'computer', 'to', 'prevent', 'such', 'limitation', 'this', 'paper', 'presents', 'a', 'systematic', 'study', 'of', 'the', 'impact', 'of', 'the', 'classical', 'electrical', 'signals', 'on', 'the', 'qubit', 'fidelity', 'all', 'operations', 'ie', 'singlequbit', 'rotations', 'twoqubit', 'gates', 'and', 'readout', 'are', 'considered', 'in', 'the', 'presence', 'of', 'errors', 'in', 'the', 'control', 'electronics', 'such', 'as', 'static', 'dynamic', 'systematic', 'and', 'random', 'errors', 'although', 'the', 'presented', 'study', 'could', 'be', 'extended', 'to', 'any', 'qubit', 'technology', 'it', 'currently', 'focuses', 'on', 'singleelectron', 'spin', 'qubits', 'because', 'of', 'several', 'advantages', 'such', 'as', 'purely', 'electrical', 'control', 'and', 'long', 'coherence', 'times', 'and', 'for', 'their', 'potential', 'for', 'largescale', 'integration', 'as', 'a', 'result', 'of', 'this', 'study', 'detailed', 'electrical', 'specifications', 'for', 'the', 'classical', 'control', 'electronics', 'for', 'a', 'given', 'qubit', 'fidelity', 'can', 'be', 'derived', 'as', 'demonstrated', 'with', 'specific', 'case', 'studies', 'we', 'also', 'discuss', 'the', 'effect', 'on', 'qubit', 'fidelity', 'of', 'the', 'performance', 'of', 'the', 'generalpurpose', 'roomtemperature', 'equipment', 'that', 'is', 'typically', 'employed', 'to', 'control', 'the', 'few', 'qubits', 'available', 'today', 'ultimately', 'we', 'show', 'that', 'tailormade', 'electronic', 'controllers', 'can', 'achieve', 'significantly', 'lower', 'power', 'cost', 'and', 'size', 'as', 'required', 'to', 'support', 'the', 'scaling', 'up', 'of', 'quantum', 'computers']]
|
[-0.15195324393305748, 0.10553450456219138, -0.009857062798544982, 0.011402196631183649, -0.03272416832002368, -0.18482913774196894, 0.08693512974169051, 0.38177485167256836, -0.25836444375765266, -0.3269592528841775, 0.12043851918486644, -0.2355055828582726, -0.11167569140320445, 0.3053110654972204, -0.09329020077062011, 0.15485825644381054, 0.06538342329666688, 0.025546252767067148, -0.07932633169993387, -0.251337540679548, 0.2186987129084142, 0.06178980237223407, 0.30515504223565815, 0.038602795818079155, 0.09701360649772857, -0.0007194190815054965, 0.0337868394259221, -0.01570851791613889, -0.06350998998456013, 0.08795775269221479, 0.3029322973853746, 0.10230137236660473, 0.2673365436064857, -0.4955692109244975, -0.20586660258286604, 0.06969999624597072, 0.1158691294495812, 0.15949968874535875, -0.041220799563181344, -0.2836591501051144, 0.0861276532817198, -0.1986156186830361, -0.06002190475831333, -0.13143989223607103, -0.017196548822363024, 0.02327977752344665, -0.2182397550216071, 0.030185981404270243, 0.06679270649215803, 0.05662495701447202, 0.01924585289258546, -0.08370216811545989, 0.04480330311259237, 0.17355092696944993, -0.05780943960304037, 0.005840343381368637, 0.22992059932479147, -0.12337384289311408, -0.19435190397441315, 0.3586738349110322, 0.001452506415871451, -0.20249571323166465, 0.16505063468707926, -0.09657598949417255, -0.0995917164435773, 0.039001733123424275, 0.1736303643290704, 0.05799048899862807, -0.166998948282517, 0.059088061333665606, 0.07114657749946329, 0.2286568756567911, 0.021233283514518617, 0.15280682895811798, 0.17095825590930191, 0.17724680882376773, 0.1177858519819972, 0.17688542137767901, -0.07770686024727608, -0.1278584562829759, -0.2674337829905675, -0.18598742806522212, -0.21272838628202115, 0.11131971935714477, -0.039571992815183976, -0.15236834560077891, 0.41476996407563826, 0.18234740492094645, 0.12237660384745998, 0.024064479373142267, 0.3679647575996057, 0.10052995430418625, 0.1051233185046054, 0.05652182834738305, 0.2348930615778036, 0.12279480708835339, 0.09703506945240485, -0.28717938989730896, 0.0699045467303469, -0.03981253317584401]
|
1,803.06177
|
Deconstructing Little Strings with $\mathcal{N}=1$ Gauge Theories on
Ellipsoids
|
A formula was recently proposed for the perturbative partition function of
certain $\mathcal N=1$ gauge theories on the round four-sphere, using an
analytic-continuation argument in the number of dimensions. These partition
functions are not currently accessible via the usual
supersymmetric-localisation technique. We provide a natural refinement of this
result to the case of the ellipsoid. We then use it to write down the
perturbative partition function of an $\mathcal N=1$ toroidal-quiver theory (a
double orbifold of $\mathcal N=4$ super Yang-Mills) and show that, in the
deconstruction limit, it reproduces the zero-winding contributions to the BPS
partition function of (1,1) Little String Theory wrapping an emergent torus. We
therefore successfully test both the expressions for the $\mathcal N=1$
partition functions, as well as the relationship between the toroidal-quiver
theory and Little String Theory through dimensional deconstruction.
|
hep-th
|
a formula was recently proposed for the perturbative partition function of certain mathcal n1 gauge theories on the round foursphere using an analyticcontinuation argument in the number of dimensions these partition functions are not currently accessible via the usual supersymmetriclocalisation technique we provide a natural refinement of this result to the case of the ellipsoid we then use it to write down the perturbative partition function of an mathcal n1 toroidalquiver theory a double orbifold of mathcal n4 super yangmills and show that in the deconstruction limit it reproduces the zerowinding contributions to the bps partition function of 11 little string theory wrapping an emergent torus we therefore successfully test both the expressions for the mathcal n1 partition functions as well as the relationship between the toroidalquiver theory and little string theory through dimensional deconstruction
|
[['a', 'formula', 'was', 'recently', 'proposed', 'for', 'the', 'perturbative', 'partition', 'function', 'of', 'certain', 'mathcal', 'n1', 'gauge', 'theories', 'on', 'the', 'round', 'foursphere', 'using', 'an', 'analyticcontinuation', 'argument', 'in', 'the', 'number', 'of', 'dimensions', 'these', 'partition', 'functions', 'are', 'not', 'currently', 'accessible', 'via', 'the', 'usual', 'supersymmetriclocalisation', 'technique', 'we', 'provide', 'a', 'natural', 'refinement', 'of', 'this', 'result', 'to', 'the', 'case', 'of', 'the', 'ellipsoid', 'we', 'then', 'use', 'it', 'to', 'write', 'down', 'the', 'perturbative', 'partition', 'function', 'of', 'an', 'mathcal', 'n1', 'toroidalquiver', 'theory', 'a', 'double', 'orbifold', 'of', 'mathcal', 'n4', 'super', 'yangmills', 'and', 'show', 'that', 'in', 'the', 'deconstruction', 'limit', 'it', 'reproduces', 'the', 'zerowinding', 'contributions', 'to', 'the', 'bps', 'partition', 'function', 'of', '11', 'little', 'string', 'theory', 'wrapping', 'an', 'emergent', 'torus', 'we', 'therefore', 'successfully', 'test', 'both', 'the', 'expressions', 'for', 'the', 'mathcal', 'n1', 'partition', 'functions', 'as', 'well', 'as', 'the', 'relationship', 'between', 'the', 'toroidalquiver', 'theory', 'and', 'little', 'string', 'theory', 'through', 'dimensional', 'deconstruction']]
|
[-0.08550950875399164, 0.10496855913854705, -0.1016034244787204, 0.1281009626722333, -0.03825395256423086, -0.11485725359365571, 0.017734421118525148, 0.2864479766829821, -0.21516793553952043, -0.2781730867168717, 0.07838001529657716, -0.2701299409310952, -0.21025232455465687, 0.12433245640162749, -0.051375482028762576, 0.05530962007802748, -0.04206395637108909, 0.07095424013895708, -0.10670648670030175, -0.2698680600915673, 0.31664274806398474, 0.018006660890203852, 0.2777000084832197, 0.08333200892390868, 0.0942966471575485, 0.049238930360808654, 0.02855271769275192, 0.002960249886471238, -0.1524576444967178, 0.10846819449216127, 0.2184514635302951, 0.14298651044484484, 0.16923179147580197, -0.45460600763530906, -0.16797726708002217, 0.0780511150307214, 0.18518882535952536, 0.0874039364600099, 0.023038593621192257, -0.1996304869228789, 0.07043445878484436, -0.21023044437312216, -0.17503872121780228, -0.0774503066346675, 0.02609280124484412, -0.08224234623365274, -0.2643490164817972, 6.986172151758926e-05, 0.026812564742481265, 0.02328681261882982, -0.019063557555920353, -0.06672482509237096, -0.07508594750156555, 0.11996202025107527, 0.0757552842282555, 0.12992694310289415, 0.08143249430999387, -0.17558747393378804, -0.1380241583243638, 0.33058433051270836, -0.05327660829817009, -0.2553469506874396, 0.14026160128699003, -0.15411338812177502, -0.19495654910561125, 0.07065218207888475, 0.05938249204009203, 0.207824361286853, -0.08215692976333258, 0.21081338133147512, -0.10349988675754489, 0.13924436968793907, 0.08985064292099071, 0.024325518058399664, 0.19810445227070164, 0.09665144131454917, 0.022689092555972002, 0.1961279106788508, -0.014612025885224228, -0.12201954713375628, -0.4029583676739503, -0.1506969480569126, -0.1463687915091922, 0.12258643816940162, -0.15961805068446103, -0.2107759462687265, 0.3337504953138872, 0.08997811151460482, 0.19850802620698482, 0.11828668604099249, 0.23448506404311603, 0.15688246877984863, 0.08350855147622468, 0.013500854600476855, 0.1816761955505109, 0.15957421678445438, 0.009477141156849516, -0.19871353496217972, -0.10986871894392121, 0.22141851680993124]
|
1,803.06178
|
Fair non-monetary scheduling in federated clouds
|
In a hybrid cloud, individual cloud service providers (CSPs) often have
incentive to use each other's resources to off-load peak loads or place load
closer to the end user. However, CSPs have to keep track of contributions and
gains in order to disincentivize long-term free-riding. We show CloudShare, a
distributed version of a load balancing algorithm DirectCloud based on the
Shapley value---a powerful fairness concept from game theory. CloudShare
coordinates CSPs by a ZooKeeper-based coordination layer; each CSP runs a
broker that interacts with local resources (such as Kubernetes-managed
clusters). We quantitatively evaluate our implementation by simulation. The
results confirm that CloudShare generates on the average more fair schedules
than the popular FairShare algorithm. We believe our results show an viable
alternative to monetary methods based on, e.g., spot markets.
|
cs.DC
|
in a hybrid cloud individual cloud service providers csps often have incentive to use each others resources to offload peak loads or place load closer to the end user however csps have to keep track of contributions and gains in order to disincentivize longterm freeriding we show cloudshare a distributed version of a load balancing algorithm directcloud based on the shapley valuea powerful fairness concept from game theory cloudshare coordinates csps by a zookeeperbased coordination layer each csp runs a broker that interacts with local resources such as kubernetesmanaged clusters we quantitatively evaluate our implementation by simulation the results confirm that cloudshare generates on the average more fair schedules than the popular fairshare algorithm we believe our results show an viable alternative to monetary methods based on eg spot markets
|
[['in', 'a', 'hybrid', 'cloud', 'individual', 'cloud', 'service', 'providers', 'csps', 'often', 'have', 'incentive', 'to', 'use', 'each', 'others', 'resources', 'to', 'offload', 'peak', 'loads', 'or', 'place', 'load', 'closer', 'to', 'the', 'end', 'user', 'however', 'csps', 'have', 'to', 'keep', 'track', 'of', 'contributions', 'and', 'gains', 'in', 'order', 'to', 'disincentivize', 'longterm', 'freeriding', 'we', 'show', 'cloudshare', 'a', 'distributed', 'version', 'of', 'a', 'load', 'balancing', 'algorithm', 'directcloud', 'based', 'on', 'the', 'shapley', 'valuea', 'powerful', 'fairness', 'concept', 'from', 'game', 'theory', 'cloudshare', 'coordinates', 'csps', 'by', 'a', 'zookeeperbased', 'coordination', 'layer', 'each', 'csp', 'runs', 'a', 'broker', 'that', 'interacts', 'with', 'local', 'resources', 'such', 'as', 'kubernetesmanaged', 'clusters', 'we', 'quantitatively', 'evaluate', 'our', 'implementation', 'by', 'simulation', 'the', 'results', 'confirm', 'that', 'cloudshare', 'generates', 'on', 'the', 'average', 'more', 'fair', 'schedules', 'than', 'the', 'popular', 'fairshare', 'algorithm', 'we', 'believe', 'our', 'results', 'show', 'an', 'viable', 'alternative', 'to', 'monetary', 'methods', 'based', 'on', 'eg', 'spot', 'markets']]
|
[-0.12427947264601015, -0.013235488732681815, -0.1094379664846058, 0.08323480317843014, -0.12034161553688817, -0.18260357101029884, 0.1803526965063432, 0.42010261741738153, -0.26867930016179725, -0.33498247937247977, 0.054898425221707174, -0.2815468530738946, -0.10655113162406844, 0.14685146769831384, -0.127248600713806, 0.018849577270741536, 0.06479480521300603, 0.022924530659490596, 0.0428615877804471, -0.3080451513427918, 0.25580521587623417, 0.09550311906981891, 0.337333708495547, 0.03854249487814354, 0.052728184077184735, -0.02346979667923934, -0.009736817733450668, 0.021013200649712967, -0.07854436376046364, 0.11643132376420406, 0.269177348096305, 0.18187703243933442, 0.36366313788306526, -0.4753153482818697, -0.16891635700741298, 0.09897447880504169, 0.10643850008654133, 0.035427690688960664, -0.06173496822403528, -0.24142440833796666, 0.10755855492389518, -0.2568994727293689, -0.07176090884260745, -0.06671207957244735, -0.028121955208773686, 0.07630685967206222, -0.3051622552929197, -0.024922020817688836, -0.032352605907935796, 0.015518410131335258, -0.058155934935010326, -0.11380236383204854, -0.0047169320695982205, 0.11250331343195628, 0.025681918334787873, -0.0008647533818368074, 0.18215241281345018, -0.11796897814528215, -0.18805312362910198, 0.4283888090665885, -0.008554227638821939, -0.13826510442354842, 0.17721057999659123, -0.010285866597124676, -0.1775254025234012, 0.0723858263827567, 0.21714434378934422, 0.0908617718371207, -0.15874831017664098, -0.0029938374027265163, -0.06075893380627857, 0.19723449449428893, 0.05722248928958741, 0.016755513454545436, 0.17699511401267268, 0.17224226132819914, 0.17508079419389191, 0.13118847291348282, 0.0057027338065324335, -0.16149038932924195, -0.17325283282969925, -0.11375438981858177, -0.14830864881766653, -0.019129075879949754, -0.09557976846857726, -0.11558055652188153, 0.34946617751756287, 0.2073711839863869, 0.12478431400028973, 0.14493616693607334, 0.3829151625180338, 0.060822117172628934, 0.10908613397967158, 0.16677333037258954, 0.14184625696860195, -0.013542405890638199, 0.1724641086482333, -0.19323551232970548, 0.11725495113463207, 0.028752240993991846]
|
1,803.06179
|
Observation of rotational Brownian motion of single diamond
nanoparticles
|
Capturing the rotational motion of single nanoparticles has been hindered
owing to the difficulty of acquiring directional information under the optical
diffraction limit. Here, we demonstrate that electron spins of single nitrogen
vacancy (NV) centers can sense the rotational Brownian motion of their host
nanodiamonds. When nanodiamonds are gradually detached from the substrates that
they were fixed to, their optically detected spin resonance peaks are broadened
by 1.8 MHz, which corresponds to the rotational diffusion constant of
nanoparticles with a diameter of 11.4 nm from the Einstein-Smoluchowski
relation.
|
cond-mat.mes-hall physics.app-ph quant-ph
|
capturing the rotational motion of single nanoparticles has been hindered owing to the difficulty of acquiring directional information under the optical diffraction limit here we demonstrate that electron spins of single nitrogen vacancy nv centers can sense the rotational brownian motion of their host nanodiamonds when nanodiamonds are gradually detached from the substrates that they were fixed to their optically detected spin resonance peaks are broadened by 18 mhz which corresponds to the rotational diffusion constant of nanoparticles with a diameter of 114 nm from the einsteinsmoluchowski relation
|
[['capturing', 'the', 'rotational', 'motion', 'of', 'single', 'nanoparticles', 'has', 'been', 'hindered', 'owing', 'to', 'the', 'difficulty', 'of', 'acquiring', 'directional', 'information', 'under', 'the', 'optical', 'diffraction', 'limit', 'here', 'we', 'demonstrate', 'that', 'electron', 'spins', 'of', 'single', 'nitrogen', 'vacancy', 'nv', 'centers', 'can', 'sense', 'the', 'rotational', 'brownian', 'motion', 'of', 'their', 'host', 'nanodiamonds', 'when', 'nanodiamonds', 'are', 'gradually', 'detached', 'from', 'the', 'substrates', 'that', 'they', 'were', 'fixed', 'to', 'their', 'optically', 'detected', 'spin', 'resonance', 'peaks', 'are', 'broadened', 'by', '18', 'mhz', 'which', 'corresponds', 'to', 'the', 'rotational', 'diffusion', 'constant', 'of', 'nanoparticles', 'with', 'a', 'diameter', 'of', '114', 'nm', 'from', 'the', 'einsteinsmoluchowski', 'relation']]
|
[-0.04401993729565716, 0.2290941436288201, -0.002608744258230383, -0.0556741672784979, -0.029364888221545534, -0.1464031218836846, 0.06621833913959563, 0.5115446919067339, -0.2615329163011417, -0.3434597213159908, 0.046318029233423826, -0.338483641770753, -0.022502255520190705, 0.13348401169588958, -0.041036128264915366, 0.034999184289269826, 0.034550163079984486, -0.02384309844240885, -0.009865970701370812, -0.1581400596981191, 0.22535382811259874, 0.022917366480793466, 0.2850153476835906, 0.030853266517541753, 0.13232573423407634, -0.019487979784819552, 0.06698467972984706, -0.016886280563829296, -0.11560496855715675, 0.12838623879096386, 0.21144855747909538, -0.03526158877701329, 0.21202642472714864, -0.4279752037784254, -0.1972452983768149, 0.05999036886813966, 0.21946248311591757, 0.18956485691623212, -0.05357593563398537, -0.31937411667207594, 0.05712044558789454, -0.07245265429479662, -0.16219876551556148, -0.025260655918497254, 0.04999446203212508, 0.0474894338932989, -0.17862413171678782, 0.12671638602941213, 0.09179719953416762, 0.1083649855317245, -0.10673443573548204, -0.09142982160185718, -0.10630114307754081, 0.09066016780145053, 0.03498840801925822, 0.0018169631088808687, 0.286073138080114, -0.07258361196727492, -0.11761614823295861, 0.38841400491285394, -0.043562766347101635, -0.08225825486376627, 0.1836391051606783, -0.2338154245728881, -0.04903985684822229, 0.24859268192879178, 0.09782462705731053, 0.16049676146675748, -0.19181018015611204, 0.032198511423881755, 0.020653106075769756, 0.226956335213882, 0.14118932646868582, 0.09631899798246608, 0.280273438277866, 0.14152602407689716, 0.019603346596175634, 0.12723752347202125, -0.23446644183290613, -0.03751493939092721, -0.13424685987411067, -0.13644812839960319, -0.2143380588597872, 0.10242944544138895, -0.11663826598404822, -0.10720682701900262, 0.30776846394027496, 0.09503920905990526, 0.17409688965099948, -0.020823473196783612, 0.22776484775716777, 0.09320369741710072, 0.10237577316531149, 0.0037353486808239145, 0.2912466593446549, 0.20267591703767804, 0.09710841333832253, -0.28815962333464995, 0.041585067493460054, -0.05828780475183686]
|
1,803.0618
|
Heterogeneity of Synaptic Input Connectivity Regulates Spike-based
Neuronal Avalanches
|
Our mysterious brain is believed to operate near a non-equilibrium point and
generate critical self-organized avalanches in neuronal activity. Recent
experimental evidence has revealed significant heterogeneity in both synaptic
input and output connectivity, but whether the structural heterogeneity
participates in the regulation of neuronal avalanches remains poorly
understood. By computational modelling, we predict that different types of
structural heterogeneity contribute distinct effects on avalanche
neurodynamics. In particular, neuronal avalanches can be triggered at an
intermediate level of input heterogeneity, but heterogeneous output
connectivity cannot evoke avalanche dynamics. In the criticality region, the
co-emergence of multi-scale cortical activities is observed, and both the
avalanche dynamics and neuronal oscillations are modulated by the input
heterogeneity. Remarkably, we show similar results can be reproduced in
networks with various types of in- and out-degree distributions. Overall, these
findings not only provide details on the underlying circuitry mechanisms of
nonrandom synaptic connectivity in the regulation of neuronal avalanches, but
also inspire testable hypotheses for future experimental studies.
|
q-bio.NC
|
our mysterious brain is believed to operate near a nonequilibrium point and generate critical selforganized avalanches in neuronal activity recent experimental evidence has revealed significant heterogeneity in both synaptic input and output connectivity but whether the structural heterogeneity participates in the regulation of neuronal avalanches remains poorly understood by computational modelling we predict that different types of structural heterogeneity contribute distinct effects on avalanche neurodynamics in particular neuronal avalanches can be triggered at an intermediate level of input heterogeneity but heterogeneous output connectivity cannot evoke avalanche dynamics in the criticality region the coemergence of multiscale cortical activities is observed and both the avalanche dynamics and neuronal oscillations are modulated by the input heterogeneity remarkably we show similar results can be reproduced in networks with various types of in and outdegree distributions overall these findings not only provide details on the underlying circuitry mechanisms of nonrandom synaptic connectivity in the regulation of neuronal avalanches but also inspire testable hypotheses for future experimental studies
|
[['our', 'mysterious', 'brain', 'is', 'believed', 'to', 'operate', 'near', 'a', 'nonequilibrium', 'point', 'and', 'generate', 'critical', 'selforganized', 'avalanches', 'in', 'neuronal', 'activity', 'recent', 'experimental', 'evidence', 'has', 'revealed', 'significant', 'heterogeneity', 'in', 'both', 'synaptic', 'input', 'and', 'output', 'connectivity', 'but', 'whether', 'the', 'structural', 'heterogeneity', 'participates', 'in', 'the', 'regulation', 'of', 'neuronal', 'avalanches', 'remains', 'poorly', 'understood', 'by', 'computational', 'modelling', 'we', 'predict', 'that', 'different', 'types', 'of', 'structural', 'heterogeneity', 'contribute', 'distinct', 'effects', 'on', 'avalanche', 'neurodynamics', 'in', 'particular', 'neuronal', 'avalanches', 'can', 'be', 'triggered', 'at', 'an', 'intermediate', 'level', 'of', 'input', 'heterogeneity', 'but', 'heterogeneous', 'output', 'connectivity', 'can', 'not', 'evoke', 'avalanche', 'dynamics', 'in', 'the', 'criticality', 'region', 'the', 'coemergence', 'of', 'multiscale', 'cortical', 'activities', 'is', 'observed', 'and', 'both', 'the', 'avalanche', 'dynamics', 'and', 'neuronal', 'oscillations', 'are', 'modulated', 'by', 'the', 'input', 'heterogeneity', 'remarkably', 'we', 'show', 'similar', 'results', 'can', 'be', 'reproduced', 'in', 'networks', 'with', 'various', 'types', 'of', 'in', 'and', 'outdegree', 'distributions', 'overall', 'these', 'findings', 'not', 'only', 'provide', 'details', 'on', 'the', 'underlying', 'circuitry', 'mechanisms', 'of', 'nonrandom', 'synaptic', 'connectivity', 'in', 'the', 'regulation', 'of', 'neuronal', 'avalanches', 'but', 'also', 'inspire', 'testable', 'hypotheses', 'for', 'future', 'experimental', 'studies']]
|
[-0.13220042792396092, 0.20127433274068113, -0.034356665076044055, 0.12492857805171545, -0.02906972215867337, -0.16187458151173892, 0.0340836102237787, 0.4227405429162361, -0.2627727737776751, -0.29103431706661703, 0.04799689506870453, -0.22381549365071143, -0.3156755259030579, 0.14596166866680574, -0.07990173973235802, 0.02605868011848127, 0.0277464122419464, 0.00271223888342286, 0.06945413497799754, -0.19201573942799444, 0.2277700033751719, 0.07437454622790769, 0.3516499499393696, 0.05344672461491607, 0.04924328908048294, -0.09081694476283443, -0.022877314691374332, 0.03570305555196548, -0.09565357070926966, 0.07902586943883863, 0.30516478911122696, 0.11899005714085321, 0.25821316742278416, -0.5585264526192605, -0.3077031673653695, 0.09556847690449406, 0.1699093285039711, 0.08744161965736522, -0.02177092983002234, -0.27006696024334725, 0.08713467630743119, -0.10034833244266517, -0.07309231448510409, -0.09192754066100826, 0.021119762206289135, 0.08074730043214048, -0.24844296696239415, 0.11957253620476192, 0.07837134174266715, 0.11356851565766574, -0.07236974728782374, -0.05651105542733322, -0.03841217428109505, 0.20993127529566855, 0.014979512556484774, -0.001575159186886819, 0.23339284636241234, -0.18326969523044637, -0.15792495868870138, 0.2752547363238984, 0.050691253057232606, -0.15094852069806722, 0.2303853576577464, -0.20181670299167803, -0.20114447250904768, 0.13296100246306095, 0.18937644407291104, -0.03587882301948367, -0.15632653834059673, -0.019808013639254725, 0.02022252045571804, 0.22547734202906908, 0.031143735913145874, 0.056923365585482964, 0.22633558691962175, 0.2750613680612411, -0.009395873112270586, 0.11572305402462658, -0.07454845234485814, -0.10391791847701196, -0.27088981629406783, -0.02294846221425191, -0.17051226721881071, 0.0492461709078203, -0.12302082626931987, -0.14119549500102027, 0.45681569451627174, 0.1543462116682304, 0.2122644727566728, 0.05544509804796106, 0.1959258849164155, 0.06278570363640118, 0.10344952804806792, 0.05005003602738366, 0.19227030745385515, 0.079162089984841, 0.12393697955714608, -0.2525083360622959, 0.23906875901099547, -0.045143543719601484]
|
1,803.06181
|
Products of Lindel\"of spaces with points $G_\delta$
|
We show that if CH holds and either (i) there exists an $\omega_1$-Kurepa
tree, or (ii) $\square(\omega_2)$ holds, then there are regular $T_1$
Lindel\"of spaces $X_0$ and $X_1$ with points $G_\delta$ such that $e(X_0
\times X_1)>2^\omega$.
|
math.LO math.GN
|
we show that if ch holds and either i there exists an omega_1kurepa tree or ii squareomega_2 holds then there are regular t_1 lindelof spaces x_0 and x_1 with points g_delta such that ex_0 times x_12omega
|
[['we', 'show', 'that', 'if', 'ch', 'holds', 'and', 'either', 'i', 'there', 'exists', 'an', 'omega_1kurepa', 'tree', 'or', 'ii', 'squareomega_2', 'holds', 'then', 'there', 'are', 'regular', 't_1', 'lindelof', 'spaces', 'x_0', 'and', 'x_1', 'with', 'points', 'g_delta', 'such', 'that', 'ex_0', 'times', 'x_12omega']]
|
[-0.1825914638060512, 0.22692043048190305, -0.010244063525037332, 0.061742677691985264, 0.015808818410291817, -0.2380123698914593, 0.04102682130354823, 0.4953526710018967, -0.30255585637959564, -0.03538366065671047, 0.1389836998952722, -0.33745630062890775, -0.09340399665278241, 0.1525849389744866, -0.09038020985088113, -0.07458656605079093, 0.11107609048485756, 0.10994965300867052, -0.07285020256302122, -0.2827030166870717, 0.3863397432547627, -0.2069834222396215, 0.17460755270087358, 0.038683381961715044, 0.18615148687791644, 0.014424997297200289, 0.0890572546473281, 0.07140669189957959, -0.20787957532438944, -0.010258873455423975, 0.28794587143894396, 0.27717179263179953, 0.23458835516463628, -0.3792283535003662, -0.09866743357005445, 0.33160880557966954, 0.12462737114930694, -0.08374574958262118, -0.07240328922246893, -0.24518012616670493, 0.19107481456277045, -0.029155350826454884, -0.11950472530654886, -0.07653094280624029, 0.1787184029112034, 0.024269985204393215, -0.3434189571011247, 0.03337976127637155, 0.18839202358415633, 0.06719595580502893, -0.002736987348533038, -0.1393048744825082, -0.1310467172526952, 0.05969583813919488, 0.06038377975875681, 0.16904671676456928, 0.0019476467348409421, 0.00253932759391539, -0.06943722516580512, 0.36930853410652187, -0.07185848734595558, -0.1653326234187592, 0.21502085713048777, -0.2108921524786362, -0.21150455056605014, 0.043006030757996166, -0.04826890720957608, 0.10189651538420355, 0.01654351003129374, 0.21945519191847945, -0.12988214584236796, 0.177917214562044, 0.14929071168951463, 0.04763340743992365, 0.13185363666464886, 0.11063448610630902, 0.1886105178996469, 0.010799656311670939, -0.05129718605541822, 0.04590193387720677, -0.3439619598740881, -0.12193975992726558, -0.15458009496444103, 0.16810812580991874, -0.15017711777490508, -0.17667928837578406, 0.18359685065506987, 0.0717303200384997, 0.2047976444926903, 0.11453286925274314, 0.14859189408999748, 0.11053936417341571, -0.016375876568032032, 0.2337718318696275, 0.08732672614242995, 0.05579774928363887, -0.061271313718999874, -0.061182252851060846, 0.04392610275835702, 0.09307442193455769]
|
1,803.06182
|
Thick turbulent gas disks with magnetocentrifugal winds in active
galactic nuclei - Model infrared emission and optical polarization
|
(Abridged) Infrared high-resolution imaging and interferometry have shown
that the dust distribution is frequently elongated along the polar direction of
an AGN. To explain these findings, we developed a model scenario for the inner
~30 pc of an AGN. We assume a rotating thick gas disk between about one and ten
parsec. External gas accretion adds mass and injects energy via gas compression
into this gas disk and drives turbulence. Our disks are assumed to be strongly
magnetized via equipartition between the turbulent gas pressure and the energy
density of the magnetic field. In a second step, we built three dimensional
density cubes based on the analytical model, illuminated them with a central
source, and made radiative transfer calculations. In a third step, we
calculated MIR visibility amplitudes and compared them to available
interferometric observations. We show that magnetocentrifugal winds starting
from a thin and thick gas disk are viable in active galaxy centers. Once the
wind is launched, it is responsible for the transport of angular momentum and
the gas disk can become thin. The outflow scenario can account for the
elongated dust structures, outer edges of the thin maser disks, and molecular
outflows observed in local AGN. The models reproduce the observed terminal wind
velocities, the scatter of the MIR/intrinsic X-ray correlation, and point
source fractions. An application of the model to the Circinus Galaxy and NGC
1068 shows that the IR SED, available MIR interferometric observations, and
optical polarization can be reproduced in a satisfactory way, provided that (i)
a puff-up at the inner edge of the thin disk is present and (ii) a local screen
with an optical depth of tau_V 20 in form of a local gas filament and/or a warp
of the thick disk hide a significant fraction of both nuclei.
|
astro-ph.GA
|
abridged infrared highresolution imaging and interferometry have shown that the dust distribution is frequently elongated along the polar direction of an agn to explain these findings we developed a model scenario for the inner 30 pc of an agn we assume a rotating thick gas disk between about one and ten parsec external gas accretion adds mass and injects energy via gas compression into this gas disk and drives turbulence our disks are assumed to be strongly magnetized via equipartition between the turbulent gas pressure and the energy density of the magnetic field in a second step we built three dimensional density cubes based on the analytical model illuminated them with a central source and made radiative transfer calculations in a third step we calculated mir visibility amplitudes and compared them to available interferometric observations we show that magnetocentrifugal winds starting from a thin and thick gas disk are viable in active galaxy centers once the wind is launched it is responsible for the transport of angular momentum and the gas disk can become thin the outflow scenario can account for the elongated dust structures outer edges of the thin maser disks and molecular outflows observed in local agn the models reproduce the observed terminal wind velocities the scatter of the mirintrinsic xray correlation and point source fractions an application of the model to the circinus galaxy and ngc 1068 shows that the ir sed available mir interferometric observations and optical polarization can be reproduced in a satisfactory way provided that i a puffup at the inner edge of the thin disk is present and ii a local screen with an optical depth of tau_v 20 in form of a local gas filament andor a warp of the thick disk hide a significant fraction of both nuclei
|
[['abridged', 'infrared', 'highresolution', 'imaging', 'and', 'interferometry', 'have', 'shown', 'that', 'the', 'dust', 'distribution', 'is', 'frequently', 'elongated', 'along', 'the', 'polar', 'direction', 'of', 'an', 'agn', 'to', 'explain', 'these', 'findings', 'we', 'developed', 'a', 'model', 'scenario', 'for', 'the', 'inner', '30', 'pc', 'of', 'an', 'agn', 'we', 'assume', 'a', 'rotating', 'thick', 'gas', 'disk', 'between', 'about', 'one', 'and', 'ten', 'parsec', 'external', 'gas', 'accretion', 'adds', 'mass', 'and', 'injects', 'energy', 'via', 'gas', 'compression', 'into', 'this', 'gas', 'disk', 'and', 'drives', 'turbulence', 'our', 'disks', 'are', 'assumed', 'to', 'be', 'strongly', 'magnetized', 'via', 'equipartition', 'between', 'the', 'turbulent', 'gas', 'pressure', 'and', 'the', 'energy', 'density', 'of', 'the', 'magnetic', 'field', 'in', 'a', 'second', 'step', 'we', 'built', 'three', 'dimensional', 'density', 'cubes', 'based', 'on', 'the', 'analytical', 'model', 'illuminated', 'them', 'with', 'a', 'central', 'source', 'and', 'made', 'radiative', 'transfer', 'calculations', 'in', 'a', 'third', 'step', 'we', 'calculated', 'mir', 'visibility', 'amplitudes', 'and', 'compared', 'them', 'to', 'available', 'interferometric', 'observations', 'we', 'show', 'that', 'magnetocentrifugal', 'winds', 'starting', 'from', 'a', 'thin', 'and', 'thick', 'gas', 'disk', 'are', 'viable', 'in', 'active', 'galaxy', 'centers', 'once', 'the', 'wind', 'is', 'launched', 'it', 'is', 'responsible', 'for', 'the', 'transport', 'of', 'angular', 'momentum', 'and', 'the', 'gas', 'disk', 'can', 'become', 'thin', 'the', 'outflow', 'scenario', 'can', 'account', 'for', 'the', 'elongated', 'dust', 'structures', 'outer', 'edges', 'of', 'the', 'thin', 'maser', 'disks', 'and', 'molecular', 'outflows', 'observed', 'in', 'local', 'agn', 'the', 'models', 'reproduce', 'the', 'observed', 'terminal', 'wind', 'velocities', 'the', 'scatter', 'of', 'the', 'mirintrinsic', 'xray', 'correlation', 'and', 'point', 'source', 'fractions', 'an', 'application', 'of', 'the', 'model', 'to', 'the', 'circinus', 'galaxy', 'and', 'ngc', '1068', 'shows', 'that', 'the', 'ir', 'sed', 'available', 'mir', 'interferometric', 'observations', 'and', 'optical', 'polarization', 'can', 'be', 'reproduced', 'in', 'a', 'satisfactory', 'way', 'provided', 'that', 'i', 'a', 'puffup', 'at', 'the', 'inner', 'edge', 'of', 'the', 'thin', 'disk', 'is', 'present', 'and', 'ii', 'a', 'local', 'screen', 'with', 'an', 'optical', 'depth', 'of', 'tau_v', '20', 'in', 'form', 'of', 'a', 'local', 'gas', 'filament', 'andor', 'a', 'warp', 'of', 'the', 'thick', 'disk', 'hide', 'a', 'significant', 'fraction', 'of', 'both', 'nuclei']]
|
[-0.09262540815674337, 0.08994603530697177, -0.07121229848777086, 0.07462137860632738, -0.05783464439386912, -0.08017951024980363, -0.0014515135034729363, 0.4687890435679484, -0.22490532109356026, -0.30114188945962717, 0.06248798316612966, -0.2531066613461254, 0.0025266311684637175, 0.18566081237118945, 0.010375489779921658, -0.010011446709602566, 0.012587744707115373, -0.12641868946237206, -0.020991342037055893, -0.19503848405270757, 0.3077460648334127, 0.09353010217438183, 0.16982639996745325, 0.00270707486513055, 0.08616664533708561, -0.11476610757615734, -0.0548894354371133, 0.005464282909692344, -0.1362154664539819, 0.098402201729211, 0.19994757097680368, 0.04719959547332788, 0.2029110053076677, -0.4512387793818962, -0.2438986190235621, 0.020311157179649098, 0.1910046062874213, 0.06314663307630788, -0.08311062681180882, -0.2138454533103159, 0.026335100103485384, -0.21446412570411497, -0.18045220093454345, 0.046247932484562874, 0.03333348169946506, 0.00801133363353783, -0.2600688304523227, 0.10698846743000134, 0.05569968405811084, 0.06721160089914288, -0.12546928290088297, -0.06299341784837513, -0.09213886224601607, 0.07020816536051995, 0.020187581114676164, 0.09669555886806447, 0.24466816418235965, -0.14822520622936713, -0.00867484724247765, 0.38328098003689387, -0.05906095915193812, -0.05601573239427881, 0.22981080886813166, -0.2236525344378236, -0.11015932306378953, 0.17467980465646518, 0.15146432696383888, 0.09292909130769766, -0.11580626645551648, 0.0015497922340913092, -0.08909064004024081, 0.22608314309776287, 0.041294553457617254, 0.027568974838517134, 0.35085717809733824, 0.11217134903319244, 0.006917661862542569, 0.15159184064921308, -0.2365234911877867, -0.06780632880153292, -0.24992980792550212, -0.13238719008326277, -0.14481456577541085, 0.06894277279912416, -0.12374324917692643, -0.1112406118318115, 0.30623412807156347, 0.09824868422179182, 0.2461028974156006, -0.018985081885909756, 0.3669092476194314, 0.07139962530602165, 0.10349484488873159, 0.18243435404778427, 0.3061926471543009, 0.1574207194788792, 0.09818196338818456, -0.24559303534392787, 0.060290073989338035, 0.005334485489559376]
|
1,803.06183
|
GASP. X: APEX detection of molecular gas in the tails and in the disks
of ram-pressure stripped galaxies
|
Jellyfish galaxies in clusters are key tools to understand environmental
processes at work in dense environments. The advent of Integral Field
Spectroscopy has recently allowed to study a significant sample of stripped
galaxies in the cluster environment at z$\sim 0.05$, through the GAs Stripping
Phenomena in galaxies with MUSE (GASP) survey. However, optical spectroscopy
can only trace the ionized gas component through the H$_{\alpha}$ emission that
can be spatially resolved on kpc scale at this redshift. The complex interplay
between the various gas phases (ionized, neutral, molecular) is however yet to
be understood. We report here the detection of large amounts of molecular gas
both in the tails and in the disks of 4 jellyfish galaxies from the GASP sample
with stellar masses $\sim 3.5\times 10^{10}-3\times 10^{11} M_{\odot}$, showing
strong stripping. The mass of molecular gas that we measure in the tails
amounts to several $10^9 M_{\odot}$ and the total mass of molecular gas ranges
between 15 and 100 \% of the galaxy stellar mass. The molecular gas content
within the galaxies is compatible with the one of normal spiral galaxies,
suggesting that the molecular gas in the tails has been formed in-situ. We find
a clear correlation between the ionized gas emission $\rm H\alpha$ and the
amount of molecular gas. The CO velocities measured from APEX data are not
always coincident with the underlying $\rm H\alpha$ emitting knots, and the
derived Star Formation Efficiencies appear to be very low.
|
astro-ph.GA
|
jellyfish galaxies in clusters are key tools to understand environmental processes at work in dense environments the advent of integral field spectroscopy has recently allowed to study a significant sample of stripped galaxies in the cluster environment at zsim 005 through the gas stripping phenomena in galaxies with muse gasp survey however optical spectroscopy can only trace the ionized gas component through the h_alpha emission that can be spatially resolved on kpc scale at this redshift the complex interplay between the various gas phases ionized neutral molecular is however yet to be understood we report here the detection of large amounts of molecular gas both in the tails and in the disks of 4 jellyfish galaxies from the gasp sample with stellar masses sim 35times 10103times 1011 m_odot showing strong stripping the mass of molecular gas that we measure in the tails amounts to several 109 m_odot and the total mass of molecular gas ranges between 15 and 100 of the galaxy stellar mass the molecular gas content within the galaxies is compatible with the one of normal spiral galaxies suggesting that the molecular gas in the tails has been formed insitu we find a clear correlation between the ionized gas emission rm halpha and the amount of molecular gas the co velocities measured from apex data are not always coincident with the underlying rm halpha emitting knots and the derived star formation efficiencies appear to be very low
|
[['jellyfish', 'galaxies', 'in', 'clusters', 'are', 'key', 'tools', 'to', 'understand', 'environmental', 'processes', 'at', 'work', 'in', 'dense', 'environments', 'the', 'advent', 'of', 'integral', 'field', 'spectroscopy', 'has', 'recently', 'allowed', 'to', 'study', 'a', 'significant', 'sample', 'of', 'stripped', 'galaxies', 'in', 'the', 'cluster', 'environment', 'at', 'zsim', '005', 'through', 'the', 'gas', 'stripping', 'phenomena', 'in', 'galaxies', 'with', 'muse', 'gasp', 'survey', 'however', 'optical', 'spectroscopy', 'can', 'only', 'trace', 'the', 'ionized', 'gas', 'component', 'through', 'the', 'h_alpha', 'emission', 'that', 'can', 'be', 'spatially', 'resolved', 'on', 'kpc', 'scale', 'at', 'this', 'redshift', 'the', 'complex', 'interplay', 'between', 'the', 'various', 'gas', 'phases', 'ionized', 'neutral', 'molecular', 'is', 'however', 'yet', 'to', 'be', 'understood', 'we', 'report', 'here', 'the', 'detection', 'of', 'large', 'amounts', 'of', 'molecular', 'gas', 'both', 'in', 'the', 'tails', 'and', 'in', 'the', 'disks', 'of', '4', 'jellyfish', 'galaxies', 'from', 'the', 'gasp', 'sample', 'with', 'stellar', 'masses', 'sim', '35times', '10103times', '1011', 'm_odot', 'showing', 'strong', 'stripping', 'the', 'mass', 'of', 'molecular', 'gas', 'that', 'we', 'measure', 'in', 'the', 'tails', 'amounts', 'to', 'several', '109', 'm_odot', 'and', 'the', 'total', 'mass', 'of', 'molecular', 'gas', 'ranges', 'between', '15', 'and', '100', 'of', 'the', 'galaxy', 'stellar', 'mass', 'the', 'molecular', 'gas', 'content', 'within', 'the', 'galaxies', 'is', 'compatible', 'with', 'the', 'one', 'of', 'normal', 'spiral', 'galaxies', 'suggesting', 'that', 'the', 'molecular', 'gas', 'in', 'the', 'tails', 'has', 'been', 'formed', 'insitu', 'we', 'find', 'a', 'clear', 'correlation', 'between', 'the', 'ionized', 'gas', 'emission', 'rm', 'halpha', 'and', 'the', 'amount', 'of', 'molecular', 'gas', 'the', 'co', 'velocities', 'measured', 'from', 'apex', 'data', 'are', 'not', 'always', 'coincident', 'with', 'the', 'underlying', 'rm', 'halpha', 'emitting', 'knots', 'and', 'the', 'derived', 'star', 'formation', 'efficiencies', 'appear', 'to', 'be', 'very', 'low']]
|
[-0.06686868633881227, 0.11751688865674738, -0.054448339784862236, 0.08514231423839551, -0.027520226752933336, -0.016778428092825877, 0.022312016398528544, 0.4640915259296278, -0.17429303991920883, -0.3365662332757243, 0.04062688907710131, -0.2827923266811907, 0.009161004430747457, 0.17562280794284738, 0.036853147180508354, -0.03430280859480385, 0.02018726340048954, -0.12593045196801173, -0.05440727901147794, -0.2562746727069206, 0.3136843447221302, 0.06529984991027027, 0.15257538242819288, 0.024818472420535552, 0.0820214270849853, -0.1506939618319993, -0.07166757301266986, -0.04380023053714207, -0.1584692571400907, 0.032846645891574454, 0.2320331700494466, 0.08709642868352067, 0.23608588533742086, -0.3987714229618124, -0.20575794819820703, 0.06516317660262917, 0.23370916610524967, 0.04108517336612176, -0.10472489416035784, -0.27957746176393466, 0.03913365837437015, -0.19324484001991862, -0.18987962628613, 0.06622909932855141, 0.035676146319875604, 0.03937077351078829, -0.2008538580354804, 0.19904355530944035, -0.025836231364054652, 0.10325628430474972, -0.06864754097759254, -0.05332915538123676, -0.07559129329713281, 0.06857294789045862, -0.007927877755596951, 0.08359518091433032, 0.28385407845487237, -0.16509252830756782, 0.03207975511166204, 0.4230967461074773, -0.08124071574171207, 0.0017582248796728691, 0.3120365738937193, -0.2727474798752262, -0.19349470719922052, 0.20974348364212012, 0.15110836832484761, 0.06857713139733347, -0.17635847963275342, 0.012994621911535173, -0.06942085992151621, 0.22666976444751902, 0.041909846716889125, 0.08302651203542942, 0.3298172601479098, 0.08413666287122075, 0.009150393867029753, 0.06945440164735901, -0.22296656274624138, -0.04353098163553396, -0.18002162914820496, -0.13927668995936127, -0.1432248232592711, 0.08687584069778824, -0.10374772229530024, -0.07232630005920258, 0.27452872348059076, 0.09422071913928341, 0.25198869287631154, 0.024748276402594662, 0.33059404162737, 0.06398750142049545, 0.14600629800932577, 0.1085259606905219, 0.27060033707339476, 0.20098595519964935, 0.06370640133347112, -0.26376303095965326, 0.0765770739509368, -0.03422507658471674]
|
1,803.06184
|
The ApolloScape Open Dataset for Autonomous Driving and its Application
|
Autonomous driving has attracted tremendous attention especially in the past
few years. The key techniques for a self-driving car include solving tasks like
3D map construction, self-localization, parsing the driving road and
understanding objects, which enable vehicles to reason and act. However, large
scale data set for training and system evaluation is still a bottleneck for
developing robust perception models. In this paper, we present the ApolloScape
dataset [1] and its applications for autonomous driving. Compared with existing
public datasets from real scenes, e.g. KITTI [2] or Cityscapes [3], ApolloScape
contains much large and richer labelling including holistic semantic dense
point cloud for each site, stereo, per-pixel semantic labelling, lanemark
labelling, instance segmentation, 3D car instance, high accurate location for
every frame in various driving videos from multiple sites, cities and daytimes.
For each task, it contains at lease 15x larger amount of images than SOTA
datasets. To label such a complete dataset, we develop various tools and
algorithms specified for each task to accelerate the labelling process, such as
3D-2D segment labeling tools, active labelling in videos etc. Depend on
ApolloScape, we are able to develop algorithms jointly consider the learning
and inference of multiple tasks. In this paper, we provide a sensor fusion
scheme integrating camera videos, consumer-grade motion sensors (GPS/IMU), and
a 3D semantic map in order to achieve robust self-localization and semantic
segmentation for autonomous driving. We show that practically, sensor fusion
and joint learning of multiple tasks are beneficial to achieve a more robust
and accurate system. We expect our dataset and proposed relevant algorithms can
support and motivate researchers for further development of multi-sensor fusion
and multi-task learning in the field of computer vision.
|
cs.CV
|
autonomous driving has attracted tremendous attention especially in the past few years the key techniques for a selfdriving car include solving tasks like 3d map construction selflocalization parsing the driving road and understanding objects which enable vehicles to reason and act however large scale data set for training and system evaluation is still a bottleneck for developing robust perception models in this paper we present the apolloscape dataset 1 and its applications for autonomous driving compared with existing public datasets from real scenes eg kitti 2 or cityscapes 3 apolloscape contains much large and richer labelling including holistic semantic dense point cloud for each site stereo perpixel semantic labelling lanemark labelling instance segmentation 3d car instance high accurate location for every frame in various driving videos from multiple sites cities and daytimes for each task it contains at lease 15x larger amount of images than sota datasets to label such a complete dataset we develop various tools and algorithms specified for each task to accelerate the labelling process such as 3d2d segment labeling tools active labelling in videos etc depend on apolloscape we are able to develop algorithms jointly consider the learning and inference of multiple tasks in this paper we provide a sensor fusion scheme integrating camera videos consumergrade motion sensors gpsimu and a 3d semantic map in order to achieve robust selflocalization and semantic segmentation for autonomous driving we show that practically sensor fusion and joint learning of multiple tasks are beneficial to achieve a more robust and accurate system we expect our dataset and proposed relevant algorithms can support and motivate researchers for further development of multisensor fusion and multitask learning in the field of computer vision
|
[['autonomous', 'driving', 'has', 'attracted', 'tremendous', 'attention', 'especially', 'in', 'the', 'past', 'few', 'years', 'the', 'key', 'techniques', 'for', 'a', 'selfdriving', 'car', 'include', 'solving', 'tasks', 'like', '3d', 'map', 'construction', 'selflocalization', 'parsing', 'the', 'driving', 'road', 'and', 'understanding', 'objects', 'which', 'enable', 'vehicles', 'to', 'reason', 'and', 'act', 'however', 'large', 'scale', 'data', 'set', 'for', 'training', 'and', 'system', 'evaluation', 'is', 'still', 'a', 'bottleneck', 'for', 'developing', 'robust', 'perception', 'models', 'in', 'this', 'paper', 'we', 'present', 'the', 'apolloscape', 'dataset', '1', 'and', 'its', 'applications', 'for', 'autonomous', 'driving', 'compared', 'with', 'existing', 'public', 'datasets', 'from', 'real', 'scenes', 'eg', 'kitti', '2', 'or', 'cityscapes', '3', 'apolloscape', 'contains', 'much', 'large', 'and', 'richer', 'labelling', 'including', 'holistic', 'semantic', 'dense', 'point', 'cloud', 'for', 'each', 'site', 'stereo', 'perpixel', 'semantic', 'labelling', 'lanemark', 'labelling', 'instance', 'segmentation', '3d', 'car', 'instance', 'high', 'accurate', 'location', 'for', 'every', 'frame', 'in', 'various', 'driving', 'videos', 'from', 'multiple', 'sites', 'cities', 'and', 'daytimes', 'for', 'each', 'task', 'it', 'contains', 'at', 'lease', '15x', 'larger', 'amount', 'of', 'images', 'than', 'sota', 'datasets', 'to', 'label', 'such', 'a', 'complete', 'dataset', 'we', 'develop', 'various', 'tools', 'and', 'algorithms', 'specified', 'for', 'each', 'task', 'to', 'accelerate', 'the', 'labelling', 'process', 'such', 'as', '3d2d', 'segment', 'labeling', 'tools', 'active', 'labelling', 'in', 'videos', 'etc', 'depend', 'on', 'apolloscape', 'we', 'are', 'able', 'to', 'develop', 'algorithms', 'jointly', 'consider', 'the', 'learning', 'and', 'inference', 'of', 'multiple', 'tasks', 'in', 'this', 'paper', 'we', 'provide', 'a', 'sensor', 'fusion', 'scheme', 'integrating', 'camera', 'videos', 'consumergrade', 'motion', 'sensors', 'gpsimu', 'and', 'a', '3d', 'semantic', 'map', 'in', 'order', 'to', 'achieve', 'robust', 'selflocalization', 'and', 'semantic', 'segmentation', 'for', 'autonomous', 'driving', 'we', 'show', 'that', 'practically', 'sensor', 'fusion', 'and', 'joint', 'learning', 'of', 'multiple', 'tasks', 'are', 'beneficial', 'to', 'achieve', 'a', 'more', 'robust', 'and', 'accurate', 'system', 'we', 'expect', 'our', 'dataset', 'and', 'proposed', 'relevant', 'algorithms', 'can', 'support', 'and', 'motivate', 'researchers', 'for', 'further', 'development', 'of', 'multisensor', 'fusion', 'and', 'multitask', 'learning', 'in', 'the', 'field', 'of', 'computer', 'vision']]
|
[-0.06372456608479173, 0.01670090031597375, -0.01546428064424578, 0.041234815298744676, -0.1173377756587156, -0.20032100758277444, 0.020829054850267526, 0.4708329967102505, -0.2382827087627094, -0.37417844843065784, 0.094205044772352, -0.26400143520323655, -0.15646722224346704, 0.23898715690605798, -0.1853722689200943, 0.1002056942115749, 0.19495953109555897, 0.06258460360827517, -0.012330876208553694, -0.23999106934547035, 0.27327362298228436, 0.00589315812337956, 0.34109397023906196, 0.0279955650920973, 0.1580705094915855, 0.008182040815201434, -0.05788377762048525, -0.01045011150442975, -0.041370998599560026, 0.1857748731445557, 0.3599794092083128, 0.20529291659707485, 0.31802333878493944, -0.422313163708037, -0.22956527881782834, 0.11451208771025534, 0.16002209508964724, 0.10684391346782289, -0.05865172266679784, -0.37582816811037256, 0.09110073359057005, -0.18306751960298892, 0.027074233131636462, -0.1454885665904362, 0.0531043865284112, -0.02988840633937955, -0.30876466048305196, -0.0005047215490514855, 0.03940689965509709, 0.11616911292210114, -0.07965632390001413, -0.08121179793743591, 0.03805144704633774, 0.25308703603943233, -0.008549929054712763, 0.08054935579563377, 0.17515104491679875, -0.24645112063413277, -0.1409921861788017, 0.4189104056153312, 0.014452239902337875, -0.18309237678675985, 0.24064206011868047, -0.03318169638648522, -0.18672379182497537, 0.10486980998074542, 0.24701021104320722, 0.12834358924376718, -0.14872556792575492, -0.015374218002958358, -0.020267748334210554, 0.1482599051691225, 0.05705986862915079, -0.0052215315706411495, 0.19176465068883497, 0.2822726853945621, 0.09480232038374374, 0.10676908951668108, -0.16729369652775794, -0.05993461159389573, -0.18619871911950403, -0.13909985626990767, -0.16463500530527664, -0.046795833221027, -0.1077178289281835, -0.12492963972605309, 0.3595483590402738, 0.29202896915376186, 0.1865274454282744, 0.07006436192452331, 0.3618749387280868, 0.00686515369516397, 0.10347842085451597, 0.10946741667718513, 0.1228480625323107, -0.04542867382385319, 0.1676924277813904, -0.12465988622857727, 0.028800028507771948, 0.05857002739493045]
|
1,803.06185
|
The ARM Scalable Vector Extension
|
This article describes the ARM Scalable Vector Extension (SVE). Several goals
guided the design of the architecture. First was the need to extend the vector
processing capability associated with the ARM AArch64 execution state to better
address the computational requirements in domains such as high-performance
computing, data analytics, computer vision, and machine learning. Second was
the desire to introduce an extension that can scale across multiple
implementations, both now and into the future, allowing CPU designers to choose
the vector length most suitable for their power, performance, and area targets.
Finally, the architecture should avoid imposing a software development cost as
the vector length changes and where possible reduce it by improving the reach
of compiler auto-vectorization technologies. SVE achieves these goals. It
allows implementations to choose a vector register length between 128 and 2,048
bits. It supports a vector-length agnostic programming model that lets code run
and scale automatically across all vector lengths without recompilation.
Finally, it introduces several innovative features that begin to overcome some
of the traditional barriers to autovectorization.
|
cs.AR cs.PF
|
this article describes the arm scalable vector extension sve several goals guided the design of the architecture first was the need to extend the vector processing capability associated with the arm aarch64 execution state to better address the computational requirements in domains such as highperformance computing data analytics computer vision and machine learning second was the desire to introduce an extension that can scale across multiple implementations both now and into the future allowing cpu designers to choose the vector length most suitable for their power performance and area targets finally the architecture should avoid imposing a software development cost as the vector length changes and where possible reduce it by improving the reach of compiler autovectorization technologies sve achieves these goals it allows implementations to choose a vector register length between 128 and 2048 bits it supports a vectorlength agnostic programming model that lets code run and scale automatically across all vector lengths without recompilation finally it introduces several innovative features that begin to overcome some of the traditional barriers to autovectorization
|
[['this', 'article', 'describes', 'the', 'arm', 'scalable', 'vector', 'extension', 'sve', 'several', 'goals', 'guided', 'the', 'design', 'of', 'the', 'architecture', 'first', 'was', 'the', 'need', 'to', 'extend', 'the', 'vector', 'processing', 'capability', 'associated', 'with', 'the', 'arm', 'aarch64', 'execution', 'state', 'to', 'better', 'address', 'the', 'computational', 'requirements', 'in', 'domains', 'such', 'as', 'highperformance', 'computing', 'data', 'analytics', 'computer', 'vision', 'and', 'machine', 'learning', 'second', 'was', 'the', 'desire', 'to', 'introduce', 'an', 'extension', 'that', 'can', 'scale', 'across', 'multiple', 'implementations', 'both', 'now', 'and', 'into', 'the', 'future', 'allowing', 'cpu', 'designers', 'to', 'choose', 'the', 'vector', 'length', 'most', 'suitable', 'for', 'their', 'power', 'performance', 'and', 'area', 'targets', 'finally', 'the', 'architecture', 'should', 'avoid', 'imposing', 'a', 'software', 'development', 'cost', 'as', 'the', 'vector', 'length', 'changes', 'and', 'where', 'possible', 'reduce', 'it', 'by', 'improving', 'the', 'reach', 'of', 'compiler', 'autovectorization', 'technologies', 'sve', 'achieves', 'these', 'goals', 'it', 'allows', 'implementations', 'to', 'choose', 'a', 'vector', 'register', 'length', 'between', '128', 'and', '2048', 'bits', 'it', 'supports', 'a', 'vectorlength', 'agnostic', 'programming', 'model', 'that', 'lets', 'code', 'run', 'and', 'scale', 'automatically', 'across', 'all', 'vector', 'lengths', 'without', 'recompilation', 'finally', 'it', 'introduces', 'several', 'innovative', 'features', 'that', 'begin', 'to', 'overcome', 'some', 'of', 'the', 'traditional', 'barriers', 'to', 'autovectorization']]
|
[-0.1112067545493415, 0.06253975475158578, -0.033207066985237045, 0.03562057325393124, -0.17304758673403844, -0.19416468874226475, 0.037193055108980126, 0.4027515562511114, -0.31018224349150675, -0.35627550498831495, 0.0990894423374029, -0.22202484770875958, -0.11877819721628965, 0.21570040406198998, -0.08223120998158011, 0.11558216008111337, 0.06231246099991421, 0.016203533901378166, -0.059979297391945754, -0.27681038645096123, 0.23945942816126897, 0.10019889367178494, 0.3141155796840267, 0.027396336793466362, 0.09574011701083374, 0.007114319252608301, -0.015315397417844209, -0.038173413356267956, -0.07038442739927674, 0.15823718005231058, 0.32020350261916253, 0.24090196141908163, 0.3553273782410204, -0.4446586122801311, -0.1665901478033426, 0.07203544388649726, 0.13881760624746337, 0.07112104215978667, -0.005032968921261991, -0.24557898957607185, 0.1136390234849302, -0.1701509793787155, -0.10445380303196522, -0.10300198003925859, -0.008108109409032865, -0.009221802693710467, -0.24835484851487413, -0.0750073751408964, 0.042660274577386637, 0.024765053697655973, -0.017629312066060793, -0.10839367603076362, 0.041774653948756846, 0.1530576049658838, 0.003505113268633871, 0.08626130800071541, 0.16361207032554545, -0.1189982189301423, -0.17649873808502806, 0.36898603453300893, -0.025736233892276625, -0.2057868372784321, 0.18232847855028392, -0.011955679777392382, -0.1318546879635907, 0.08233726961364926, 0.20448490415786413, 0.03154154440799598, -0.15096728446850077, 0.07315293025444695, 0.053004013452960484, 0.2211523513190535, 0.06540668147567356, 0.03356855284411807, 0.18423036218696642, 0.20740729171666317, 0.06676284320717461, 0.13862484904157735, -0.09044184021382365, -0.11347625088142935, -0.2601519943851853, -0.18477844220564463, -0.13079606098742874, -0.040531928223276205, -0.0855401591582259, -0.11387419801876815, 0.37674093669886854, 0.24209115535378195, 0.17432289123860037, 0.1082594125977647, 0.36639354443976246, 0.004407706690768083, 0.16922336458201456, 0.14032179395516597, 0.14092382080775148, 0.03729369296613799, 0.15464341866027098, -0.19344935185688164, 0.05791280148510258, -0.000505040459291533]
|
1,803.06186
|
How robust are Structural Equation Models to model miss-specification? A
simulation study
|
Structural Equation Models (SEMs) are routinely used in the analysis of
empirical data by researchers from different scientific fields such as
psychologists or economists. In some fields, such as in ecology, SEMs have only
started recently to attract attention and thanks to dedicated software packages
the use of SEMs has steadily increased. Yet, common analysis practices in such
fields that might be transposed from other statistical techniques such as model
acceptance or rejection based on p-value screening might be poorly fitted for
SEMs especially when these models are used to confirm or reject hypotheses.
In this simulation study, SEMs were fitted via two commonly used R packages:
lavaan and piecewiseSEM. Five different data-generation scenarios were
explored: (i) random, (ii) exact, (iii) shuffled, (iv) underspecified and (v)
overspecified. In addition, sample size and model complexity were also varied
to explore their impact on various global and local model fitness indices.
The results showed that not one single model index should be used to decide
on model fitness but rather a combination of different model fitness indices is
needed. The global chi-square test for lavaan or the Fisher's C statistic for
piecewiseSEM were, in isolation, poor indicators of model fitness. In addition,
the simulations showed that to achieve sufficient power to detect individual
effects, adequate sample sizes are required. Finally, BIC showed good capacity
to select models closer to the truth especially for more complex models.
I provide, based on these results, a flowchart indicating how information
from different metrics may be combined to reveal model strength and weaknesses.
Researchers in scientific fields with little experience in SEMs, such as in
ecology, should consider and accept these limitations.
|
stat.AP
|
structural equation models sems are routinely used in the analysis of empirical data by researchers from different scientific fields such as psychologists or economists in some fields such as in ecology sems have only started recently to attract attention and thanks to dedicated software packages the use of sems has steadily increased yet common analysis practices in such fields that might be transposed from other statistical techniques such as model acceptance or rejection based on pvalue screening might be poorly fitted for sems especially when these models are used to confirm or reject hypotheses in this simulation study sems were fitted via two commonly used r packages lavaan and piecewisesem five different datageneration scenarios were explored i random ii exact iii shuffled iv underspecified and v overspecified in addition sample size and model complexity were also varied to explore their impact on various global and local model fitness indices the results showed that not one single model index should be used to decide on model fitness but rather a combination of different model fitness indices is needed the global chisquare test for lavaan or the fishers c statistic for piecewisesem were in isolation poor indicators of model fitness in addition the simulations showed that to achieve sufficient power to detect individual effects adequate sample sizes are required finally bic showed good capacity to select models closer to the truth especially for more complex models i provide based on these results a flowchart indicating how information from different metrics may be combined to reveal model strength and weaknesses researchers in scientific fields with little experience in sems such as in ecology should consider and accept these limitations
|
[['structural', 'equation', 'models', 'sems', 'are', 'routinely', 'used', 'in', 'the', 'analysis', 'of', 'empirical', 'data', 'by', 'researchers', 'from', 'different', 'scientific', 'fields', 'such', 'as', 'psychologists', 'or', 'economists', 'in', 'some', 'fields', 'such', 'as', 'in', 'ecology', 'sems', 'have', 'only', 'started', 'recently', 'to', 'attract', 'attention', 'and', 'thanks', 'to', 'dedicated', 'software', 'packages', 'the', 'use', 'of', 'sems', 'has', 'steadily', 'increased', 'yet', 'common', 'analysis', 'practices', 'in', 'such', 'fields', 'that', 'might', 'be', 'transposed', 'from', 'other', 'statistical', 'techniques', 'such', 'as', 'model', 'acceptance', 'or', 'rejection', 'based', 'on', 'pvalue', 'screening', 'might', 'be', 'poorly', 'fitted', 'for', 'sems', 'especially', 'when', 'these', 'models', 'are', 'used', 'to', 'confirm', 'or', 'reject', 'hypotheses', 'in', 'this', 'simulation', 'study', 'sems', 'were', 'fitted', 'via', 'two', 'commonly', 'used', 'r', 'packages', 'lavaan', 'and', 'piecewisesem', 'five', 'different', 'datageneration', 'scenarios', 'were', 'explored', 'i', 'random', 'ii', 'exact', 'iii', 'shuffled', 'iv', 'underspecified', 'and', 'v', 'overspecified', 'in', 'addition', 'sample', 'size', 'and', 'model', 'complexity', 'were', 'also', 'varied', 'to', 'explore', 'their', 'impact', 'on', 'various', 'global', 'and', 'local', 'model', 'fitness', 'indices', 'the', 'results', 'showed', 'that', 'not', 'one', 'single', 'model', 'index', 'should', 'be', 'used', 'to', 'decide', 'on', 'model', 'fitness', 'but', 'rather', 'a', 'combination', 'of', 'different', 'model', 'fitness', 'indices', 'is', 'needed', 'the', 'global', 'chisquare', 'test', 'for', 'lavaan', 'or', 'the', 'fishers', 'c', 'statistic', 'for', 'piecewisesem', 'were', 'in', 'isolation', 'poor', 'indicators', 'of', 'model', 'fitness', 'in', 'addition', 'the', 'simulations', 'showed', 'that', 'to', 'achieve', 'sufficient', 'power', 'to', 'detect', 'individual', 'effects', 'adequate', 'sample', 'sizes', 'are', 'required', 'finally', 'bic', 'showed', 'good', 'capacity', 'to', 'select', 'models', 'closer', 'to', 'the', 'truth', 'especially', 'for', 'more', 'complex', 'models', 'i', 'provide', 'based', 'on', 'these', 'results', 'a', 'flowchart', 'indicating', 'how', 'information', 'from', 'different', 'metrics', 'may', 'be', 'combined', 'to', 'reveal', 'model', 'strength', 'and', 'weaknesses', 'researchers', 'in', 'scientific', 'fields', 'with', 'little', 'experience', 'in', 'sems', 'such', 'as', 'in', 'ecology', 'should', 'consider', 'and', 'accept', 'these', 'limitations']]
|
[0.012282332022142076, 0.04764038753405591, -0.08594993622028742, 0.1443513453743198, -0.09356252568671851, -0.21748457111391253, 0.0526714375342978, 0.43304654191656416, -0.24194740231378356, -0.3688135618323703, 0.12292400699959177, -0.27167737953182636, -0.1278085906853211, 0.19289006172313247, -0.08207139514590803, 0.06002757287469517, 0.04699875553985518, 0.024702764474014934, -0.0031042873734554305, -0.2679886838680998, 0.2541659368342126, 0.06985606571686441, 0.30592816359484976, -0.011941974348240141, 0.010374591488853448, -0.039244614141669285, -0.08727476150776003, 0.06912694686510856, -0.11241823263873707, 0.0817356195429043, 0.2659127801930151, 0.20563149541292502, 0.3006107707885836, -0.4494060272807184, -0.24341370468998016, 0.1197401911730581, 0.14084476877790134, 0.08468455486202045, -0.015571575183550021, -0.25579711151110224, 0.07785276562440296, -0.1696269759516893, -0.08275085613696728, -0.11360110502046418, -0.006826660155480647, 0.07346142989315896, -0.270350300961687, 0.059079391535424686, 0.005255408509992117, 0.11599969749247817, -0.03453057065717471, -0.18498102844814243, -0.04124476563099407, 0.1436156278925963, 0.07711878128095018, -0.0027006109640764857, 0.11235213487120548, -0.13471108673294782, -0.12106080945628439, 0.362842788896186, -0.03393928965311531, -0.21110508335582184, 0.2511212224110394, -0.09801388664704248, -0.1582765348991244, 0.06749899908807466, 0.20714502613670935, 0.05773473016755736, -0.1714515432400019, 0.03430979069599888, 0.01918158887665545, 0.18256988430706164, 0.04418206979850462, -0.002259672552969752, 0.20440255791333545, 0.12693872108998155, -0.02377295353959409, 0.0959676835296652, -0.05732351602890286, -0.0849547868440994, -0.211766089834914, -0.11002967039509541, -0.13340261129854733, 0.01938472024298592, -0.08133937126626405, -0.1564503744315437, 0.37042208079609723, 0.20601550733503562, 0.14777097347583892, 0.02593705976429139, 0.2543015086081088, 0.05967875334591963, 0.09995409653925309, 0.042397287366338125, 0.22730038161956845, 0.08356554541648581, 0.0838541262867469, -0.13482499938560277, 0.14012558397708758, -0.014674548514396545]
|
1,803.06187
|
Pre-discovery transits of the exoplanets WASP-18 b and WASP-33 b from
Hipparcos
|
We recover transits of WASP-18 b and WASP-33 b from Hipparcos (1989-1993)
photometry. Marginal detections of HAT-P-56 b and HAT-P-2 b may be also present
in the data. New ephemerides are fitted to WASP-18 b and WASP-33 b. A tentative
(~1.3 sigma) orbital decay is measured for WASP-18 b, but the implied tidal
quality factor (Q' ~ 5 x 10^5) is small and survival time (<10^6 years) is too
short to be likely. No orbital decay is measured for WASP-33 b, and a limit of
Q' > 2 x 10^5 is placed. For both planets, the uncertainties in published
ephemerides appear underestimated: the uncertainty in the period derivative of
WASP-18 b would be greatly reduced if its current ephemeris could be better
determined.
|
astro-ph.EP astro-ph.SR
|
we recover transits of wasp18 b and wasp33 b from hipparcos 19891993 photometry marginal detections of hatp56 b and hatp2 b may be also present in the data new ephemerides are fitted to wasp18 b and wasp33 b a tentative 13 sigma orbital decay is measured for wasp18 b but the implied tidal quality factor q 5 x 105 is small and survival time 106 years is too short to be likely no orbital decay is measured for wasp33 b and a limit of q 2 x 105 is placed for both planets the uncertainties in published ephemerides appear underestimated the uncertainty in the period derivative of wasp18 b would be greatly reduced if its current ephemeris could be better determined
|
[['we', 'recover', 'transits', 'of', 'wasp18', 'b', 'and', 'wasp33', 'b', 'from', 'hipparcos', '19891993', 'photometry', 'marginal', 'detections', 'of', 'hatp56', 'b', 'and', 'hatp2', 'b', 'may', 'be', 'also', 'present', 'in', 'the', 'data', 'new', 'ephemerides', 'are', 'fitted', 'to', 'wasp18', 'b', 'and', 'wasp33', 'b', 'a', 'tentative', '13', 'sigma', 'orbital', 'decay', 'is', 'measured', 'for', 'wasp18', 'b', 'but', 'the', 'implied', 'tidal', 'quality', 'factor', 'q', '5', 'x', '105', 'is', 'small', 'and', 'survival', 'time', '106', 'years', 'is', 'too', 'short', 'to', 'be', 'likely', 'no', 'orbital', 'decay', 'is', 'measured', 'for', 'wasp33', 'b', 'and', 'a', 'limit', 'of', 'q', '2', 'x', '105', 'is', 'placed', 'for', 'both', 'planets', 'the', 'uncertainties', 'in', 'published', 'ephemerides', 'appear', 'underestimated', 'the', 'uncertainty', 'in', 'the', 'period', 'derivative', 'of', 'wasp18', 'b', 'would', 'be', 'greatly', 'reduced', 'if', 'its', 'current', 'ephemeris', 'could', 'be', 'better', 'determined']]
|
[-0.15147260573985102, 0.1676381948011473, -0.05325125719224341, 0.07070816482113258, -0.09718412288641634, -0.16838113362477583, 0.1313771107368756, 0.3282932686804186, -0.18535828440688734, -0.35803974926286986, 0.10601864517223829, -0.29941508361746455, 0.00745072009134268, 0.20250851099864264, -0.113172727987201, 0.026808239095786602, 0.1472534054749807, -0.0025276901192716823, -0.059020716088924036, -0.2745868907433219, 0.1245054255435936, 0.019744617085180376, 0.03559679745250066, -0.029678462735138647, -0.020577413429244427, -0.05339217926798896, -0.09428367232408351, -0.04268256173091979, -0.17210261593765216, 0.0369979307009292, 0.18585475983698507, 0.16234365806814807, 0.1542706934789057, -0.29938861666139494, -0.11612645023856466, 0.08575107404492673, 0.1550850904477406, -0.004362703601190867, 0.0441085248127241, -0.29824995007827754, 0.1076616694889039, -0.2421790096708689, -0.14238901622593403, -0.03375997838144737, 0.2181849005085624, -0.03328451769876733, -0.33969209494053826, 0.1425051288696079, 0.01627343890357239, 0.11421034518967975, -0.116922995517192, -0.21476294436349633, -0.07539265292642777, 0.05545936341297405, 0.04678909224842883, 0.17763739546052804, 0.11400739622710288, -0.027665917717366796, -0.044608304931297284, 0.4035408543191912, -0.14446484231320786, -0.08186793583324987, 0.16535591244820722, -0.2634433957301696, -0.13403545085279164, 0.17568264007529574, 0.15364810122053854, 0.08952572809393741, -0.17578320053583088, 0.05601802362996915, 0.012085298520766875, 0.2099876945976876, 0.08686802379136582, 0.03613734564239791, 0.2801567877927595, 0.09302003052151062, -0.010438088941472497, -0.012082615049463535, -0.22010413895953784, 0.039737524643678926, -0.23613947790793396, -0.09898658411592738, -0.12046014212171956, 0.11041128375444345, -0.0779479804966158, -0.04802183897719403, 0.3005289143722982, 0.10044391753348283, 0.22154940009763666, 0.01100924139850088, 0.24941009421224805, 0.12559263561736822, 0.0796170919799979, 0.09100959795211588, 0.33025523952462454, 0.13551228963346643, 0.06997471033356899, -0.18304802010062898, 0.12296910458080824, -0.03278405205846941]
|
1,803.06188
|
Search for heavy BSM particles coupling to third generation quarks at
CMS
|
Many models of physics beyond the Standard Model (SM) contain enhanced
couplings to third generation particles. The predicted signatures include
vector-like quarks and $t\bar{t}$ resonances. We present a review of non-SUSY
based searches for new physics beyond the SM in final states with
third-generation quarks using proton-proton collision data collected with the
CMS detector at the CERN LHC. We analyze a wide range of final states, from
multi-leptonic to entirely hadronic, and many results use novel analysis
techniques to identify and reconstruct highly boosted final states that are
created in these topologies. These techniques provide increased sensitivity to
new high-mass particles over traditional search methods.
|
hep-ex
|
many models of physics beyond the standard model sm contain enhanced couplings to third generation particles the predicted signatures include vectorlike quarks and tbart resonances we present a review of nonsusy based searches for new physics beyond the sm in final states with thirdgeneration quarks using protonproton collision data collected with the cms detector at the cern lhc we analyze a wide range of final states from multileptonic to entirely hadronic and many results use novel analysis techniques to identify and reconstruct highly boosted final states that are created in these topologies these techniques provide increased sensitivity to new highmass particles over traditional search methods
|
[['many', 'models', 'of', 'physics', 'beyond', 'the', 'standard', 'model', 'sm', 'contain', 'enhanced', 'couplings', 'to', 'third', 'generation', 'particles', 'the', 'predicted', 'signatures', 'include', 'vectorlike', 'quarks', 'and', 'tbart', 'resonances', 'we', 'present', 'a', 'review', 'of', 'nonsusy', 'based', 'searches', 'for', 'new', 'physics', 'beyond', 'the', 'sm', 'in', 'final', 'states', 'with', 'thirdgeneration', 'quarks', 'using', 'protonproton', 'collision', 'data', 'collected', 'with', 'the', 'cms', 'detector', 'at', 'the', 'cern', 'lhc', 'we', 'analyze', 'a', 'wide', 'range', 'of', 'final', 'states', 'from', 'multileptonic', 'to', 'entirely', 'hadronic', 'and', 'many', 'results', 'use', 'novel', 'analysis', 'techniques', 'to', 'identify', 'and', 'reconstruct', 'highly', 'boosted', 'final', 'states', 'that', 'are', 'created', 'in', 'these', 'topologies', 'these', 'techniques', 'provide', 'increased', 'sensitivity', 'to', 'new', 'highmass', 'particles', 'over', 'traditional', 'search', 'methods']]
|
[-0.0031538493487806548, 0.23719783596073588, -0.08229108949058822, 0.14128656979827653, -0.05847454699909403, -0.17323817265929564, 0.015167236015466707, 0.2914808303827331, -0.21260982494623887, -0.35063413122580167, 0.006787833232166512, -0.3367920705161634, -0.0009869055778142953, 0.16172215417692704, 0.05351000856608153, 0.0940269677012804, 0.16402489559813624, -0.051755891476170206, -0.06803460904130978, -0.2376732357910701, 0.26145484178726164, 0.04425455984615144, 0.22631162783751885, 0.07848457802264464, 0.04894919029126565, 0.036876545715633605, -0.06856172638280052, -0.08078476525843144, -0.10871634335025668, 0.11231187699151979, 0.25848319933994346, 0.13558634926032806, 0.12917882751762158, -0.3896721397659608, -0.14956017726411422, 0.13836137394731243, 0.163811845132815, 0.1365192591079644, -0.1128609506502038, -0.3711965119554883, 0.13375942556497952, -0.23806866984814407, -0.10779797770082951, -0.10130763200244733, -0.07938094291658629, -0.05691853130147571, -0.29798678198740597, 0.033552603312723694, -0.04880282035363572, 0.04349591694328757, 0.0016553742411945548, -0.20882316909375645, -0.04065223580581092, 0.015641123599683244, 0.08994646676195164, 0.0008478435188797968, 0.18988562939367035, -0.2092296444500486, -0.26694080788819563, 0.3438500429015784, -0.08343617196771361, -0.15246175058806935, 0.2993815368684452, -0.16983014522563844, -0.17141062549642463, 0.1418084797826374, 0.3221951167764408, 0.08706805807139192, -0.2186007464348915, 0.09627048552668255, 0.026734534553473903, 0.1743999916882742, 0.03459223835185791, 0.09902729308454408, 0.24971722256880077, 0.23953563459217547, -0.00332567047527326, 0.07761143947330613, -0.1182940992277595, -0.09341713030423437, -0.3799195446074009, -0.08319622415694453, -0.08756861351430416, -0.02664227980920779, 0.001210445041873581, -0.12441557693694319, 0.41509307282311575, 0.18934980689858397, 0.2508280295878649, -0.015270274518323796, 0.26961003577868853, 0.017395542832534937, 0.10181121508635226, 0.044255830618065026, 0.3394830701059185, 0.1061891569090741, 0.17103658827199114, -0.13529732614933027, -0.02172876060718582, 0.05139915381913029]
|
1,803.06189
|
Triplet-Center Loss for Multi-View 3D Object Retrieval
|
Most existing 3D object recognition algorithms focus on leveraging the strong
discriminative power of deep learning models with softmax loss for the
classification of 3D data, while learning discriminative features with deep
metric learning for 3D object retrieval is more or less neglected. In the
paper, we study variants of deep metric learning losses for 3D object
retrieval, which did not receive enough attention from this area. First , two
kinds of representative losses, triplet loss and center loss, are introduced
which could learn more discriminative features than traditional classification
loss. Then, we propose a novel loss named triplet-center loss, which can
further enhance the discriminative power of the features. The proposed
triplet-center loss learns a center for each class and requires that the
distances between samples and centers from the same class are closer than those
from different classes. Extensive experimental results on two popular 3D object
retrieval benchmarks and two widely-adopted sketch-based 3D shape retrieval
benchmarks consistently demonstrate the effectiveness of our proposed loss, and
significant improvements have been achieved compared with the
state-of-the-arts.
|
cs.CV
|
most existing 3d object recognition algorithms focus on leveraging the strong discriminative power of deep learning models with softmax loss for the classification of 3d data while learning discriminative features with deep metric learning for 3d object retrieval is more or less neglected in the paper we study variants of deep metric learning losses for 3d object retrieval which did not receive enough attention from this area first two kinds of representative losses triplet loss and center loss are introduced which could learn more discriminative features than traditional classification loss then we propose a novel loss named tripletcenter loss which can further enhance the discriminative power of the features the proposed tripletcenter loss learns a center for each class and requires that the distances between samples and centers from the same class are closer than those from different classes extensive experimental results on two popular 3d object retrieval benchmarks and two widelyadopted sketchbased 3d shape retrieval benchmarks consistently demonstrate the effectiveness of our proposed loss and significant improvements have been achieved compared with the stateofthearts
|
[['most', 'existing', '3d', 'object', 'recognition', 'algorithms', 'focus', 'on', 'leveraging', 'the', 'strong', 'discriminative', 'power', 'of', 'deep', 'learning', 'models', 'with', 'softmax', 'loss', 'for', 'the', 'classification', 'of', '3d', 'data', 'while', 'learning', 'discriminative', 'features', 'with', 'deep', 'metric', 'learning', 'for', '3d', 'object', 'retrieval', 'is', 'more', 'or', 'less', 'neglected', 'in', 'the', 'paper', 'we', 'study', 'variants', 'of', 'deep', 'metric', 'learning', 'losses', 'for', '3d', 'object', 'retrieval', 'which', 'did', 'not', 'receive', 'enough', 'attention', 'from', 'this', 'area', 'first', 'two', 'kinds', 'of', 'representative', 'losses', 'triplet', 'loss', 'and', 'center', 'loss', 'are', 'introduced', 'which', 'could', 'learn', 'more', 'discriminative', 'features', 'than', 'traditional', 'classification', 'loss', 'then', 'we', 'propose', 'a', 'novel', 'loss', 'named', 'tripletcenter', 'loss', 'which', 'can', 'further', 'enhance', 'the', 'discriminative', 'power', 'of', 'the', 'features', 'the', 'proposed', 'tripletcenter', 'loss', 'learns', 'a', 'center', 'for', 'each', 'class', 'and', 'requires', 'that', 'the', 'distances', 'between', 'samples', 'and', 'centers', 'from', 'the', 'same', 'class', 'are', 'closer', 'than', 'those', 'from', 'different', 'classes', 'extensive', 'experimental', 'results', 'on', 'two', 'popular', '3d', 'object', 'retrieval', 'benchmarks', 'and', 'two', 'widelyadopted', 'sketchbased', '3d', 'shape', 'retrieval', 'benchmarks', 'consistently', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'proposed', 'loss', 'and', 'significant', 'improvements', 'have', 'been', 'achieved', 'compared', 'with', 'the', 'stateofthearts']]
|
[0.02335936237917944, -0.037458484421747956, -0.04495572925658326, 0.07358093993372225, -0.11538051792576565, -0.1943046148338845, -0.023069017619901266, 0.48762092974058463, -0.24285197968398237, -0.34213388510952797, 0.043484337309596124, -0.32907087144285785, -0.18233442310421497, 0.20410361128988422, -0.15052365346117258, 0.1139818386671354, 0.1546007301537266, 0.05470451357642544, -0.15524656532703754, -0.28417020250311004, 0.347734758732006, 0.033142166347626456, 0.37449570485213074, 0.017207602027876336, 0.11344232737568524, -0.033716093517323104, -0.026303604900610844, 0.007860430530433926, -0.02107855571707949, 0.2456513992349235, 0.2727276231898468, 0.19196708162982729, 0.31787697385156777, -0.3720487154740302, -0.31288757101455006, 0.10995804239535499, 0.13606976855524702, 0.094581331551005, -0.09274860806954954, -0.31834100922731134, 0.10247064009039647, -0.18749726808635314, 0.0810795072143133, -0.14411680894564685, -0.022459688635456856, -0.02695796423560719, -0.2974037489304696, 0.02291549147090557, 0.11160750803941419, 0.05141949031308207, -0.0734611508649144, -0.14834462883047803, -0.0026387263366703896, 0.16678740963948127, 0.0206624333910924, 0.04912438407685672, 0.12248838582813654, -0.23699796650521027, -0.1399922591009624, 0.3797501158399906, -0.04786088615686181, -0.1971774505575139, 0.24152708138107737, -0.0361794385563776, -0.10683760175352237, 0.12998465326280909, 0.26699218143186815, 0.17375963294846303, -0.13346033570534319, -0.03800159877582017, -0.025865081067848412, 0.17181205102700114, 0.04904701114319954, 0.038499132695074885, 0.1981819873471136, 0.2414846218142637, 0.028421577185963016, 0.17194964021385103, -0.20660895540115204, -0.07704014835523905, -0.18869134603940338, -0.07279929185469199, -0.1849936174411822, -0.04514510589481851, -0.11872832690770374, -0.09607007645309103, 0.4031983335405545, 0.2158150315591581, 0.24560075719986177, 0.11231160742793275, 0.3652785637219453, 0.002845905196982183, 0.15436069321188794, 0.12202651899932437, 0.23946693332965427, -0.026122237057721168, 0.10104776004926877, -0.18504559687295702, 0.07993381732611815, 0.0720308614340261]
|
1,803.0619
|
NS5-Branes and Line Bundles in Heterotic/F-Theory Duality
|
We study F-theory duals of heterotic line bundle models on elliptically
fibered Calabi-Yau threefolds. These models necessarily contain NS5-branes
which are geometrised in the dual F-theory compactifications. We initiate a
systematic study of the correspondence between various configurations of
NS5-branes and the dual geometries in F-theory and perform several checks of
the duality. Furthermore, we discuss the singular transitions between different
configurations of NS5-branes.
|
hep-th
|
we study ftheory duals of heterotic line bundle models on elliptically fibered calabiyau threefolds these models necessarily contain ns5branes which are geometrised in the dual ftheory compactifications we initiate a systematic study of the correspondence between various configurations of ns5branes and the dual geometries in ftheory and perform several checks of the duality furthermore we discuss the singular transitions between different configurations of ns5branes
|
[['we', 'study', 'ftheory', 'duals', 'of', 'heterotic', 'line', 'bundle', 'models', 'on', 'elliptically', 'fibered', 'calabiyau', 'threefolds', 'these', 'models', 'necessarily', 'contain', 'ns5branes', 'which', 'are', 'geometrised', 'in', 'the', 'dual', 'ftheory', 'compactifications', 'we', 'initiate', 'a', 'systematic', 'study', 'of', 'the', 'correspondence', 'between', 'various', 'configurations', 'of', 'ns5branes', 'and', 'the', 'dual', 'geometries', 'in', 'ftheory', 'and', 'perform', 'several', 'checks', 'of', 'the', 'duality', 'furthermore', 'we', 'discuss', 'the', 'singular', 'transitions', 'between', 'different', 'configurations', 'of', 'ns5branes']]
|
[-0.21615721374040558, 0.06391756693344741, -0.05238328172662665, 0.1806254391041067, -0.09186891117502773, -0.17919606027296847, -0.0032564905224486238, 0.39412055909633636, -0.11890272320144707, -0.24513683116270435, 0.10266556788516777, -0.27210697574570536, -0.1870966519983042, 0.1030745045947177, -0.14801525160492884, -0.029280298116010805, -0.017538503145000765, -0.04973287073274454, -0.18950627430061262, -0.30694110285202486, 0.4429764164582131, -0.04324297553726605, 0.35002793844730135, 0.08309970775412188, 0.07859351830039588, -0.08333945063696731, -0.009169493062746904, -0.035553443289938425, -0.2102342882888421, 0.17134966651746442, 0.3292355797054211, 0.06512909757328175, -0.023439409920857066, -0.5232936365027276, -0.18956607784188928, 0.1980057100041045, 0.1362438892653685, 0.13171214803070244, 0.02012907587257879, -0.24799097831257516, 0.040294662424703205, -0.13299120765083308, -0.10159967153052253, -0.08991164334177498, -0.04396725064587025, 0.030985614307047354, -0.16449920681586105, -0.07774783218545574, 0.0023099765447633608, 0.12994455447095254, -0.04267583989227811, -0.012164629644729079, -0.11372680393128937, 0.046396450324368385, 0.1483187417366675, -0.0034782300363220865, 0.11606758241615599, -0.19772102716304954, -0.19938493184449654, 0.293239290593192, -0.0017341296262447796, -0.23822287193662117, 0.12012612320009679, -0.06870422846016784, -0.22256968805329905, 0.10995951065024923, 0.14690388721369563, 0.2991100006869861, -0.010361143801775243, 0.20038210186139044, -0.102530003628797, 0.06289377909094568, 0.1073747728138216, 0.06202344055331889, 0.33709820821171715, 0.10260021704293433, 0.03882190060343534, 0.15996049536717316, -0.05433311406892562, -0.15157852562824412, -0.5000777772908646, -0.07555395721029194, 0.018598197752402887, 0.19921707840902464, -0.14881670500090832, -0.17940829586355933, 0.4049297707776229, 0.04275978956785467, 0.2604396776370113, 0.03260638869537543, 0.14386976504373172, -0.04972188578297695, 0.015138753941134802, -0.02415954871361868, 0.24731336146711358, 0.1773729416733933, -0.014881976717521273, -0.21536192599506604, -0.2403494487073095, 0.22378544861243832]
|
1,803.06191
|
Photon echoes in strongly scattering media: a diagrammatic approach
|
We study photon echo generation in disordered media with the help of multiple
scattering theory based on diagrammatic approach and numerical simulations. We
show that a strong correlation exists between the driving fields at the origin
of the echo and the echo beam. Opening the way to a better understanding of
non-linear wave propagation in complex materials, this work supports recent
experimental results with applications to the measurement of the optical dipole
lifetime $T_2$ in powders.
|
physics.optics
|
we study photon echo generation in disordered media with the help of multiple scattering theory based on diagrammatic approach and numerical simulations we show that a strong correlation exists between the driving fields at the origin of the echo and the echo beam opening the way to a better understanding of nonlinear wave propagation in complex materials this work supports recent experimental results with applications to the measurement of the optical dipole lifetime t_2 in powders
|
[['we', 'study', 'photon', 'echo', 'generation', 'in', 'disordered', 'media', 'with', 'the', 'help', 'of', 'multiple', 'scattering', 'theory', 'based', 'on', 'diagrammatic', 'approach', 'and', 'numerical', 'simulations', 'we', 'show', 'that', 'a', 'strong', 'correlation', 'exists', 'between', 'the', 'driving', 'fields', 'at', 'the', 'origin', 'of', 'the', 'echo', 'and', 'the', 'echo', 'beam', 'opening', 'the', 'way', 'to', 'a', 'better', 'understanding', 'of', 'nonlinear', 'wave', 'propagation', 'in', 'complex', 'materials', 'this', 'work', 'supports', 'recent', 'experimental', 'results', 'with', 'applications', 'to', 'the', 'measurement', 'of', 'the', 'optical', 'dipole', 'lifetime', 't_2', 'in', 'powders']]
|
[-0.132837297309092, 0.15564831451047212, -0.09369827334548493, 0.016019864401498222, -0.04200936206861546, -0.06613462078875225, 0.03089691038506939, 0.44011940368402164, -0.26019335963983875, -0.2592265832017323, 0.03600628744032675, -0.29578654185599207, -0.17648010802038602, 0.23799179700252257, 0.06613687313112773, 0.07523688998097848, 0.056481211029581334, -0.03275292704960233, -0.07344149378753316, -0.14851736552755987, 0.2998958288348819, 0.04501140465474332, 0.32815059769506516, 0.10952991008219358, 0.07025962740820098, 0.07111210699536298, -0.00970643311493883, -0.02675331545699584, -0.09389178178284247, 0.1491568054832322, 0.2162672313616464, 0.07157552740414087, 0.22395507851615548, -0.47308005603324427, -0.26251890697810604, 0.07081535007608564, 0.12419389797325589, 0.1441801976577967, -0.09792092585427638, -0.2892890011058434, 0.02794210180505424, -0.13220160933269653, -0.1450556617744855, -0.06983273160815436, 0.003299426943014719, 0.045703429197218565, -0.2585541871743963, 0.07486895357846822, 0.03230564163440201, 0.04258389884949123, -0.06358424445467167, -0.03736365388613194, 0.06715664741166524, 0.08559796133378864, 0.040822837183153944, 0.0502524805947599, 0.10446817824834541, -0.163365597021766, -0.1529434797802854, 0.36256545208590596, -0.10454115505011655, -0.10623501271536377, 0.22048693863785288, -0.20574368958133213, -0.08085395965578132, 0.12821871204007612, 0.18446353869512677, 0.10772585942360915, -0.09823689222531884, -0.0042406590303136526, -0.03546723139477667, 0.18088827481321795, 0.04173296782813084, 0.09155054117773513, 0.20215666847989747, 0.23154455575307734, -0.0124854231988521, 0.1203447007420963, -0.10358076928318233, -0.08672336944820065, -0.2611713857875561, -0.1649373409975516, -0.1866251135269474, 0.0867853073935916, -0.06886924161096288, -0.13882158981868997, 0.4139619821278182, 0.21696221402319343, 0.16696207693434859, 0.003108074496451177, 0.33283665513246025, 0.0959922841284424, 0.052835335709938876, 0.012156883481350777, 0.2713956725783646, 0.16208328294420712, 0.14211263682840294, -0.27862707578184964, 0.03210414691344149, 0.002124532162652988]
|
1,803.06192
|
Monocular Fisheye Camera Depth Estimation Using Sparse LiDAR Supervision
|
Near field depth estimation around a self driving car is an important
function that can be achieved by four wide angle fisheye cameras having a field
of view of over 180. Depth estimation based on convolutional neural networks
(CNNs) produce state of the art results, but progress is hindered because depth
annotation cannot be obtained manually. Synthetic datasets are commonly used
but they have limitations. For instance, they do not capture the extensive
variability in the appearance of objects like vehicles present in real
datasets. There is also a domain shift while performing inference on natural
images illustrated by many attempts to handle the domain adaptation explicitly.
In this work, we explore an alternate approach of training using sparse LiDAR
data as ground truth for depth estimation for fisheye camera. We built our own
dataset using our self driving car setup which has a 64 beam Velodyne LiDAR and
four wide angle fisheye cameras. To handle the difference in view points of
LiDAR and fisheye camera, an occlusion resolution mechanism was implemented. We
started with Eigen's multiscale convolutional network architecture and improved
by modifying activation function and optimizer. We obtained promising results
on our dataset with RMSE errors comparable to the state of the art results
obtained on KITTI.
|
cs.CV
|
near field depth estimation around a self driving car is an important function that can be achieved by four wide angle fisheye cameras having a field of view of over 180 depth estimation based on convolutional neural networks cnns produce state of the art results but progress is hindered because depth annotation cannot be obtained manually synthetic datasets are commonly used but they have limitations for instance they do not capture the extensive variability in the appearance of objects like vehicles present in real datasets there is also a domain shift while performing inference on natural images illustrated by many attempts to handle the domain adaptation explicitly in this work we explore an alternate approach of training using sparse lidar data as ground truth for depth estimation for fisheye camera we built our own dataset using our self driving car setup which has a 64 beam velodyne lidar and four wide angle fisheye cameras to handle the difference in view points of lidar and fisheye camera an occlusion resolution mechanism was implemented we started with eigens multiscale convolutional network architecture and improved by modifying activation function and optimizer we obtained promising results on our dataset with rmse errors comparable to the state of the art results obtained on kitti
|
[['near', 'field', 'depth', 'estimation', 'around', 'a', 'self', 'driving', 'car', 'is', 'an', 'important', 'function', 'that', 'can', 'be', 'achieved', 'by', 'four', 'wide', 'angle', 'fisheye', 'cameras', 'having', 'a', 'field', 'of', 'view', 'of', 'over', '180', 'depth', 'estimation', 'based', 'on', 'convolutional', 'neural', 'networks', 'cnns', 'produce', 'state', 'of', 'the', 'art', 'results', 'but', 'progress', 'is', 'hindered', 'because', 'depth', 'annotation', 'can', 'not', 'be', 'obtained', 'manually', 'synthetic', 'datasets', 'are', 'commonly', 'used', 'but', 'they', 'have', 'limitations', 'for', 'instance', 'they', 'do', 'not', 'capture', 'the', 'extensive', 'variability', 'in', 'the', 'appearance', 'of', 'objects', 'like', 'vehicles', 'present', 'in', 'real', 'datasets', 'there', 'is', 'also', 'a', 'domain', 'shift', 'while', 'performing', 'inference', 'on', 'natural', 'images', 'illustrated', 'by', 'many', 'attempts', 'to', 'handle', 'the', 'domain', 'adaptation', 'explicitly', 'in', 'this', 'work', 'we', 'explore', 'an', 'alternate', 'approach', 'of', 'training', 'using', 'sparse', 'lidar', 'data', 'as', 'ground', 'truth', 'for', 'depth', 'estimation', 'for', 'fisheye', 'camera', 'we', 'built', 'our', 'own', 'dataset', 'using', 'our', 'self', 'driving', 'car', 'setup', 'which', 'has', 'a', '64', 'beam', 'velodyne', 'lidar', 'and', 'four', 'wide', 'angle', 'fisheye', 'cameras', 'to', 'handle', 'the', 'difference', 'in', 'view', 'points', 'of', 'lidar', 'and', 'fisheye', 'camera', 'an', 'occlusion', 'resolution', 'mechanism', 'was', 'implemented', 'we', 'started', 'with', 'eigens', 'multiscale', 'convolutional', 'network', 'architecture', 'and', 'improved', 'by', 'modifying', 'activation', 'function', 'and', 'optimizer', 'we', 'obtained', 'promising', 'results', 'on', 'our', 'dataset', 'with', 'rmse', 'errors', 'comparable', 'to', 'the', 'state', 'of', 'the', 'art', 'results', 'obtained', 'on', 'kitti']]
|
[-0.07426610898913905, 0.02190400075265816, -0.07573775824845966, 0.01670570813058432, -0.08733852642277877, -0.17458438193425535, 0.02130817831604786, 0.4869842820046913, -0.22360391236531238, -0.3791738129531344, 0.11647643717449335, -0.2603783962826821, -0.15561415552649469, 0.24860055740545725, -0.17452837159812806, 0.0958255215814071, 0.16911407816889032, 0.005415159441708099, -0.05861988751497674, -0.251462853921666, 0.280087744451261, 0.027018793038136903, 0.32770425799258407, 0.01519469256911959, 0.17047435693121293, 0.010638410889077932, -0.02906064571746226, 0.03489924978597888, -0.04799681256010358, 0.12189811068265477, 0.2556443494500681, 0.16487915652777746, 0.23904703430432295, -0.4217228190360835, -0.24163598247493306, 0.07356517932355582, 0.15516900173166678, 0.08508560206655169, -0.04123072104772464, -0.4007165607375403, 0.06263392368103572, -0.1485200750264561, -0.0478019828176392, -0.11408399414448511, -0.0011057475099473127, -0.010162336973839307, -0.271620082273148, 0.007204537722143522, 0.0003283477144404536, 0.11845732229072989, -0.07663901218745325, -0.1276610820044187, 0.02182274002337917, 0.17197311283976194, -0.0011970362637103314, 0.1124532878188239, 0.14860029430350377, -0.2154524216882973, -0.11564641586931733, 0.34903682083157556, -0.05819657765317797, -0.21703626573130133, 0.1764596387799386, -0.050320860561693, -0.0913350533317065, 0.151354371963091, 0.18676664542373536, 0.12443988723347761, -0.14764195791046533, 0.004152783666116496, -0.05597490484138862, 0.1991531083715104, 0.07813830718265048, -0.018512188301039196, 0.18118088662713056, 0.22830075393209145, 0.04611935447652026, 0.11598498975037641, -0.21800271107238672, -0.07182899961868922, -0.2110163934883617, -0.07577582164667547, -0.224841098994061, -0.010907075194769451, -0.08962487190534982, -0.1379221404126535, 0.3756429503361384, 0.24793917875559557, 0.1852926222784888, 0.057527585268308895, 0.3739297898109293, 0.03385194619186223, 0.1285388054226392, 0.05269414161864136, 0.21029289701698525, 0.008844306635936456, 0.15129989774820085, -0.13178847938155133, 0.05609498726913617, 0.028152817525690245]
|
1,803.06193
|
Ultra-Violet Imaging Telescope view of ram-pressure stripping in action:
Star formation in the stripped gas of the GASP jellyfish galaxy JO201 in
Abell 85
|
Jellyfish are cluster galaxies that experience strong ram-pressure effects
that strip their gas. Their H$\alpha$ images reveal ionized gas tails up to 100
kpc, which could be hosting ongoing star formation. Here we report the
ultraviolet (UV) imaging observation of the jellyfish galaxy JO201 obtained at
a spatial resolution $\sim$ 1.3 kpc. The intense burst of star formation
happening in the tentacles is the focus of the present study. JO201 is the
"UV-brightest cluster galaxy" in Abell 85 ($z \sim$ 0.056) with knots and
streams of star formation in the ultraviolet. We identify star forming knots
both in the stripped gas and in the galaxy disk and compare the UV features
with the ones traced by H$\alpha$ emission. Overall, the two emissions
remarkably correlate, both in the main body and along the tentacles. Similarly,
also the star formation rates of individual knots derived from the
extinction-corrected FUV emission agree with those derived from the H$\alpha$
emission and range from $\sim$ 0.01 -to- 2.07 $M_{\odot} \, yr^{-1}$. The
integrated star formation rate from FUV flux is $\sim$ 15 $M_{\odot} \,
yr^{-1}$. The unprecedented deep UV imaging study of the jellyfish galaxy JO201
shows clear signs of extraplanar star-formation activity due to a
recent/ongoing gas stripping event.
|
astro-ph.GA
|
jellyfish are cluster galaxies that experience strong rampressure effects that strip their gas their halpha images reveal ionized gas tails up to 100 kpc which could be hosting ongoing star formation here we report the ultraviolet uv imaging observation of the jellyfish galaxy jo201 obtained at a spatial resolution sim 13 kpc the intense burst of star formation happening in the tentacles is the focus of the present study jo201 is the uvbrightest cluster galaxy in abell 85 z sim 0056 with knots and streams of star formation in the ultraviolet we identify star forming knots both in the stripped gas and in the galaxy disk and compare the uv features with the ones traced by halpha emission overall the two emissions remarkably correlate both in the main body and along the tentacles similarly also the star formation rates of individual knots derived from the extinctioncorrected fuv emission agree with those derived from the halpha emission and range from sim 001 to 207 m_odot yr1 the integrated star formation rate from fuv flux is sim 15 m_odot yr1 the unprecedented deep uv imaging study of the jellyfish galaxy jo201 shows clear signs of extraplanar starformation activity due to a recentongoing gas stripping event
|
[['jellyfish', 'are', 'cluster', 'galaxies', 'that', 'experience', 'strong', 'rampressure', 'effects', 'that', 'strip', 'their', 'gas', 'their', 'halpha', 'images', 'reveal', 'ionized', 'gas', 'tails', 'up', 'to', '100', 'kpc', 'which', 'could', 'be', 'hosting', 'ongoing', 'star', 'formation', 'here', 'we', 'report', 'the', 'ultraviolet', 'uv', 'imaging', 'observation', 'of', 'the', 'jellyfish', 'galaxy', 'jo201', 'obtained', 'at', 'a', 'spatial', 'resolution', 'sim', '13', 'kpc', 'the', 'intense', 'burst', 'of', 'star', 'formation', 'happening', 'in', 'the', 'tentacles', 'is', 'the', 'focus', 'of', 'the', 'present', 'study', 'jo201', 'is', 'the', 'uvbrightest', 'cluster', 'galaxy', 'in', 'abell', '85', 'z', 'sim', '0056', 'with', 'knots', 'and', 'streams', 'of', 'star', 'formation', 'in', 'the', 'ultraviolet', 'we', 'identify', 'star', 'forming', 'knots', 'both', 'in', 'the', 'stripped', 'gas', 'and', 'in', 'the', 'galaxy', 'disk', 'and', 'compare', 'the', 'uv', 'features', 'with', 'the', 'ones', 'traced', 'by', 'halpha', 'emission', 'overall', 'the', 'two', 'emissions', 'remarkably', 'correlate', 'both', 'in', 'the', 'main', 'body', 'and', 'along', 'the', 'tentacles', 'similarly', 'also', 'the', 'star', 'formation', 'rates', 'of', 'individual', 'knots', 'derived', 'from', 'the', 'extinctioncorrected', 'fuv', 'emission', 'agree', 'with', 'those', 'derived', 'from', 'the', 'halpha', 'emission', 'and', 'range', 'from', 'sim', '001', 'to', '207', 'm_odot', 'yr1', 'the', 'integrated', 'star', 'formation', 'rate', 'from', 'fuv', 'flux', 'is', 'sim', '15', 'm_odot', 'yr1', 'the', 'unprecedented', 'deep', 'uv', 'imaging', 'study', 'of', 'the', 'jellyfish', 'galaxy', 'jo201', 'shows', 'clear', 'signs', 'of', 'extraplanar', 'starformation', 'activity', 'due', 'to', 'a', 'recentongoing', 'gas', 'stripping', 'event']]
|
[-0.05141223268698112, 0.07753052128240319, -0.04423634800371792, 0.10866435926942054, -0.0634986966655686, -0.021648131746780402, 0.0033983492872819965, 0.4988469120133393, -0.13571422216192855, -0.33488685237197896, 0.04460750107327705, -0.31519415036183346, -0.0045215008835413776, 0.17189166282666068, -0.010168808019201597, -0.08989820770289648, 0.06114022481757597, -0.1208311868567717, -0.029157819442010572, -0.2714100953007935, 0.2718594122621841, 0.06167120843528761, 0.14197932929029972, 0.006831636698228385, 0.040870020913850204, -0.14431070076448504, -0.11627989672147325, -0.0920516135276575, -0.2213974068555069, 0.006398244573117642, 0.19680550524717189, 0.10970223297392537, 0.20966540249936247, -0.35951497844819513, -0.1908918894893889, -0.004391639870752035, 0.24937606027941656, -0.022623581588274013, -0.10230778555472937, -0.2966888587924152, 0.04113780116786254, -0.2209681647971933, -0.16797380972185671, 0.1611744671947612, 0.03705489129720375, 0.04007357592910088, -0.19237045784612194, 0.21159820273169316, -0.010272208620161002, 0.10944847485711201, -0.10542656391115832, -0.016893243563953293, -0.10401784614178128, 0.05692689971346867, 0.018747437849705076, 0.15574638843433153, 0.2735567098171473, -0.19228109866701837, -0.008239817819351633, 0.39920061706620374, -0.07062639238707391, 0.11200658302625706, 0.290941735305204, -0.28394077706100246, -0.1649812343576235, 0.21837184258869716, 0.1218628517680072, 0.08132893703373269, -0.16237811827130347, -0.037117087194212056, -0.027711593326906044, 0.2081349885063659, 0.07274639502074799, 0.10285352603469292, 0.35008834582280934, 0.08351030155702086, 0.0030601887592100743, 0.10063339526801751, -0.280073936409294, -0.01134056406006162, -0.2064223280803041, -0.06027479621775567, -0.07680609745886452, 0.11698115556592609, -0.14963810747508544, -0.07168611187173576, 0.2986806083420117, 0.09692347826885767, 0.24933542902787845, 0.06817135995361734, 0.2839409316536681, 0.05362471399525997, 0.14668038977640382, 0.12557220220418985, 0.2957072909692018, 0.19949438026188665, 0.05963159667034381, -0.27853918265266886, 0.046623894749805696, -0.013813763753662408]
|
1,803.06194
|
Factorization Results for Left Polynomials in Some Associative Real
Algebras: State of the Art, Applications, and Open Questions
|
We discuss existence of factorizations with linear factors for (left)
polynomials over certain associative real involutive algebras, most notably
over Clifford algebras. Because of their relevance to kinematics and mechanism
science, we put particular emphasis on factorization results for quaternion,
dual quaternion and split quaternion polynomials. A general algorithm ensures
existence of a factorization for generic polynomials over division rings but we
also consider factorizations for non-division rings. We explain the current
state of the art, present some new results and provide examples and counter
examples.
|
math.RA math.MG
|
we discuss existence of factorizations with linear factors for left polynomials over certain associative real involutive algebras most notably over clifford algebras because of their relevance to kinematics and mechanism science we put particular emphasis on factorization results for quaternion dual quaternion and split quaternion polynomials a general algorithm ensures existence of a factorization for generic polynomials over division rings but we also consider factorizations for nondivision rings we explain the current state of the art present some new results and provide examples and counter examples
|
[['we', 'discuss', 'existence', 'of', 'factorizations', 'with', 'linear', 'factors', 'for', 'left', 'polynomials', 'over', 'certain', 'associative', 'real', 'involutive', 'algebras', 'most', 'notably', 'over', 'clifford', 'algebras', 'because', 'of', 'their', 'relevance', 'to', 'kinematics', 'and', 'mechanism', 'science', 'we', 'put', 'particular', 'emphasis', 'on', 'factorization', 'results', 'for', 'quaternion', 'dual', 'quaternion', 'and', 'split', 'quaternion', 'polynomials', 'a', 'general', 'algorithm', 'ensures', 'existence', 'of', 'a', 'factorization', 'for', 'generic', 'polynomials', 'over', 'division', 'rings', 'but', 'we', 'also', 'consider', 'factorizations', 'for', 'nondivision', 'rings', 'we', 'explain', 'the', 'current', 'state', 'of', 'the', 'art', 'present', 'some', 'new', 'results', 'and', 'provide', 'examples', 'and', 'counter', 'examples']]
|
[-0.1575800447784321, 0.025685162694994792, -0.0653773959033018, 0.08040548281116021, -0.14823010787476115, -0.15919803036376834, -0.04553768018444697, 0.3824536085648592, -0.3223170365577802, -0.17640980577832738, 0.14636217946251637, -0.19515019123507446, -0.1900754811155588, 0.22222455229263666, -0.09754041092860144, -0.014306526158687247, 0.05552448176908805, 0.06704156499032506, -0.15243596157605954, -0.32849597357224325, 0.38747981704533274, 0.003990430828876967, 0.2106671974301165, 0.04094105473243047, 0.1504694068111306, 0.032411789110060346, -0.08279331138920645, -0.044109496385465526, -0.13719403574806313, 0.10928833426171264, 0.31463792294177206, 0.14790706492440645, 0.19912972863828546, -0.4139932295372493, -0.07385067187986055, 0.16440474159669044, 0.15752360412883465, 0.04898073452221619, -0.10390938579803333, -0.23865950538581887, 0.09978775259616329, -0.22479420010173737, -0.1318410441690926, -0.16810079575191403, 0.05948973331752038, 0.034022477704511826, -0.2697455096166841, 0.0003047992152481362, 0.09583461446265235, 0.1378639690350568, -0.10109972605633355, -0.19431805149733283, 0.0872902130534829, 0.029200056085882838, -0.028043420309861473, -0.0796095178243271, 0.0898059720205966, -0.11022252794138568, -0.21195444996945215, 0.34740976538769036, 0.020559028180879214, -0.2478014399449146, 0.1433875782328636, -0.1619996186190144, -0.18655776570085436, 0.06994337362215616, 0.13695151749375645, 0.10525084897702516, -0.02432475272067931, 0.14368929517682816, -0.14737687844696434, 0.05686065519288139, 0.12114533248119229, 0.07004654028965296, 0.16350358828555706, 0.06262842176731157, 0.03993055097173986, 0.12587237731705225, 0.03907266613041852, -0.1271653137288901, -0.3331560546878812, -0.19045799008982126, -0.05727913619430606, 0.07063317184098238, -0.1144594659989559, -0.15914315498585618, 0.4740635864653213, 0.1281695647360107, 0.1791914678287021, 0.1051845824383849, 0.24025536571672662, 0.05115846311673522, 0.08393590466043543, 0.03831624064247969, 0.12177967229962273, 0.2723711304973031, 0.028615496420507255, -0.13296371687550185, -0.021223485892162074, 0.14113921488717815]
|
1,803.06195
|
Analysis in the multi-dimensional ball
|
We study the heat semigroup maximal operator associated with a well-known
orthonormal system in the d-dimensional ball. The corresponding heat kernel is
shown to satisfy Gaussian bounds. As a consequence, we can prove weighted $L^p$
estimates, as well as some weighted inequalities in mixed norm spaces, for this
maximal operator.
|
math.CA
|
we study the heat semigroup maximal operator associated with a wellknown orthonormal system in the ddimensional ball the corresponding heat kernel is shown to satisfy gaussian bounds as a consequence we can prove weighted lp estimates as well as some weighted inequalities in mixed norm spaces for this maximal operator
|
[['we', 'study', 'the', 'heat', 'semigroup', 'maximal', 'operator', 'associated', 'with', 'a', 'wellknown', 'orthonormal', 'system', 'in', 'the', 'ddimensional', 'ball', 'the', 'corresponding', 'heat', 'kernel', 'is', 'shown', 'to', 'satisfy', 'gaussian', 'bounds', 'as', 'a', 'consequence', 'we', 'can', 'prove', 'weighted', 'lp', 'estimates', 'as', 'well', 'as', 'some', 'weighted', 'inequalities', 'in', 'mixed', 'norm', 'spaces', 'for', 'this', 'maximal', 'operator']]
|
[-0.05880259500583634, 0.09560883813304827, -0.03013029147463385, 0.16940897937864066, -0.09838520522229373, -0.11716223133727909, -0.0019182751001790167, 0.342817352199927, -0.36392336640506984, -0.15675865579396486, 0.20958251632284372, -0.33922375924885273, -0.1417640382796526, 0.24092146158218383, -0.14640841830521822, 0.1529489855840802, 0.06907100486569107, 0.14449500364717097, -0.15544471269473434, -0.1768089927174151, 0.3648252677172422, 0.007401909381151199, 0.21299401539377869, 0.0737456656433642, 0.0975360650755465, -0.007689701863564551, -0.015820333724841474, -0.008116445550695062, -0.18740783063694835, 0.1115987625066191, 0.25896463479846715, 0.09785184679087251, 0.3070030369050801, -0.3788015340641141, -0.20824617892503738, 0.28164287090301515, 0.1309548973478377, -0.02877777108922601, 0.011875312416814268, -0.2518328456580639, 0.04274389401078224, -0.11394178799819202, -0.1957819709647447, -0.12221148035489023, -0.031044021733105182, 0.06469266721745953, -0.39148530814796684, 0.09721575940027832, 0.14970167806604878, -0.0015985934599302709, -0.1566390904597938, -0.13494937130948528, 0.0014764560526236892, 0.0073325071111321445, -0.030340186287648976, 0.05157303635496646, 0.07030024491250515, -0.005960988416336477, -0.12566966354846953, 0.29170162476599215, -0.13909788108896465, -0.30497057892382146, 0.07140002369880677, -0.1847271199338138, -0.08202804939821362, -0.021952724335715174, 0.14057839388027787, 0.1368304168060422, -0.13945339512079954, 0.14015435215085745, -0.1491224157065153, 0.04316235397476703, 0.08150043953210115, 0.1411972625553608, 0.02553977683186531, 0.07468925919383765, 0.23892342932522298, 0.255739081799984, 0.021147019107593222, -0.09960176736465655, -0.37204448972595855, -0.19264938635285944, -0.23996766934636982, 0.09511356271803378, -0.17298233491368592, -0.19937182951660362, 0.3061395591311157, 0.018734324779361485, 0.2072277431935072, 0.10663686402142047, 0.18756174642592668, 0.19962824871065096, 0.05804537368938327, 0.13665847149677574, 0.11788823961571325, 0.24236422024667262, 0.08404582418501377, -0.1892283930350095, 0.028009907081723212, 0.2578323404118419]
|
1,803.06196
|
Baxter operator and Baxter equation for $q$-Toda and Toda$_2$ chains
|
We construct the Baxter operator $\boldsymbol{ \texttt{Q} }(\lambda)$ for the
$q$-Toda chain and the Toda$_2$ chain (the Toda chain in the second Hamiltonian
structure). Our construction builds on the relation between the Baxter operator
and B\"acklund transformations that were unravelled in {\cite{GaPa92}}. We
construct a number of quantum intertwiners ensuring the commutativity of
$\boldsymbol{ \texttt{Q} }(\lambda)$ with the transfer matrix of the models and
the one of $\boldsymbol{ \texttt{Q} }$'s between each other. Most importantly,
$\boldsymbol{ \texttt{Q} }(\lambda)$ is modular invariant in the sense of
Faddeev. We derive the Baxter equation for the eigenvalues $q(\lambda)$ of
$\boldsymbol{ \texttt{Q} }(\lambda)$ and show that these are entire functions
of $\lambda$. This last property will ultimately lead to the quantisation of
the spectrum for the considered Toda chains, in a subsequent publication.
|
math-ph math.MP nlin.SI
|
we construct the baxter operator boldsymbol textttq lambda for the qtoda chain and the toda_2 chain the toda chain in the second hamiltonian structure our construction builds on the relation between the baxter operator and backlund transformations that were unravelled in citegapa92 we construct a number of quantum intertwiners ensuring the commutativity of boldsymbol textttq lambda with the transfer matrix of the models and the one of boldsymbol textttq s between each other most importantly boldsymbol textttq lambda is modular invariant in the sense of faddeev we derive the baxter equation for the eigenvalues qlambda of boldsymbol textttq lambda and show that these are entire functions of lambda this last property will ultimately lead to the quantisation of the spectrum for the considered toda chains in a subsequent publication
|
[['we', 'construct', 'the', 'baxter', 'operator', 'boldsymbol', 'textttq', 'lambda', 'for', 'the', 'qtoda', 'chain', 'and', 'the', 'toda_2', 'chain', 'the', 'toda', 'chain', 'in', 'the', 'second', 'hamiltonian', 'structure', 'our', 'construction', 'builds', 'on', 'the', 'relation', 'between', 'the', 'baxter', 'operator', 'and', 'backlund', 'transformations', 'that', 'were', 'unravelled', 'in', 'citegapa92', 'we', 'construct', 'a', 'number', 'of', 'quantum', 'intertwiners', 'ensuring', 'the', 'commutativity', 'of', 'boldsymbol', 'textttq', 'lambda', 'with', 'the', 'transfer', 'matrix', 'of', 'the', 'models', 'and', 'the', 'one', 'of', 'boldsymbol', 'textttq', 's', 'between', 'each', 'other', 'most', 'importantly', 'boldsymbol', 'textttq', 'lambda', 'is', 'modular', 'invariant', 'in', 'the', 'sense', 'of', 'faddeev', 'we', 'derive', 'the', 'baxter', 'equation', 'for', 'the', 'eigenvalues', 'qlambda', 'of', 'boldsymbol', 'textttq', 'lambda', 'and', 'show', 'that', 'these', 'are', 'entire', 'functions', 'of', 'lambda', 'this', 'last', 'property', 'will', 'ultimately', 'lead', 'to', 'the', 'quantisation', 'of', 'the', 'spectrum', 'for', 'the', 'considered', 'toda', 'chains', 'in', 'a', 'subsequent', 'publication']]
|
[-0.18369489561539054, 0.1404620144171567, -0.0476085269827337, 0.027761514518615298, -0.08084696099184102, -0.12021838873922715, -0.04866865496371147, 0.3114872376971207, -0.31634174580924124, -0.19401753455488466, 0.04184214234000116, -0.2996852108328713, -0.13437101626255382, 0.14734974969911763, 0.019196926652798502, 0.05354661617783727, 0.07391758383038374, 0.10005037375454476, -0.1183591190226904, -0.19296408483325908, 0.3519227716587777, -0.005645739681850092, 0.22739471828631, -0.0005278753512722301, 0.14645143746816386, 0.060704078448305686, 0.015795572985359652, -0.1200703616349364, -0.17911461457359426, 0.12679856842224244, 0.24143963399670096, 0.11448961879882052, 0.17916470905949222, -0.3652704755196304, -0.10120367784374834, 0.1317235296958779, 0.15317965126926386, 0.08208516999844491, 0.05402139095703184, -0.2938439503429443, 0.06958191702417355, -0.15913250889101133, -0.15145737902255818, -0.06398562284545811, 0.06245976323115192, 0.058792156200327975, -0.27840200406691706, 0.06676171603795933, 0.10208873375223612, 0.031034760301800694, -0.06669493119863015, -0.1372062353321945, -0.0729228596360694, 0.09321029357773465, 0.0074365006147436505, 0.023559485763810048, 0.03882495996974936, -0.08432949827360649, -0.07780623988717736, 0.3416311740655247, -0.050735745533171485, -0.26521754580161233, 0.07719708094465011, -0.1392422853419044, -0.1768083526041564, 0.05108837494039981, 0.048973186924232276, 0.10260210633571223, -0.12277846412566366, 0.187337208207418, -0.08738253829821094, 0.11780237891219968, 0.08015719562490273, -0.013405871944223333, 0.12801591241658908, 0.061024576337553385, 0.05822238800900541, 0.1380055821541968, -0.0004561219940064695, -0.14856331591589714, -0.3502363612963341, -0.19722765190439762, -0.15520025454608238, 0.09184797228071985, -0.10810386097951477, -0.18425671902199195, 0.39822464398159757, 0.14866110903632915, 0.22803307034984582, 0.09330665457839747, 0.12578531339999258, 0.13424744635662725, 0.09486342310964123, 0.055510405762722405, 0.14501766678620512, 0.20526495906084366, 0.06998206793117946, -0.2708982870491005, -0.028210770071110152, 0.18013993416377527]
|
1,803.06197
|
Model-independent cosmic acceleration and type Ia supernovae intrinsic
luminosity redshift dependence
|
The $\Lambda$CDM model is the current standard model in cosmology thanks to
its ability to reproduce the observations. Its first observational evidence
appeared from the type Ia supernovae (SNIa) Hubble diagram. However, there has
been some debate in the literature concerning the statistical treatment of
SNIa. In this paper we relax the standard assumption that SNIa intrinsic
luminosity is independent of the redshift, and we examine whether it may have
an impact on the accelerated nature of the expansion of the Universe. In order
to be as general as possible, we reconstruct the expansion rate of the Universe
through a cubic spline interpolation fitting observations of different probes:
SNIa, baryon acoustic oscillations (BAO), and the high-redshift information
from the cosmic microwave background (CMB). We show that when SNIa intrinsic
luminosity is not allowed to vary as a function of the redshift, cosmic
acceleration is definitely proven in a model-independent approach. However,
allowing for a redshift dependence, a non-accelerated reconstruction of the
expansion rate is able to fit, as well as $\Lambda$CDM, the combination of SNIa
and BAO data, both treating the BAO standard ruler $r_d$ as a free parameter,
or adding the recently published prior from CMB observations. We further extend
the analysis by including the CMB data, and we show that a non-accelerated
reconstruction is able to nicely fit this combination of low and high-redshift
data. In this work we present a model-independent reconstruction of a
non-accelerated expansion rate of the Universe that is able to nicely fit all
the main background cosmological probes. However, the predicted value of $H_0$
is in tension with recent direct measurements. Our analysis points out that a
final, reliable, and consensual value for $H_0$ would be critical to
definitively prove the cosmic acceleration in a model-independent way.
[Abridged]
|
astro-ph.CO
|
the lambdacdm model is the current standard model in cosmology thanks to its ability to reproduce the observations its first observational evidence appeared from the type ia supernovae snia hubble diagram however there has been some debate in the literature concerning the statistical treatment of snia in this paper we relax the standard assumption that snia intrinsic luminosity is independent of the redshift and we examine whether it may have an impact on the accelerated nature of the expansion of the universe in order to be as general as possible we reconstruct the expansion rate of the universe through a cubic spline interpolation fitting observations of different probes snia baryon acoustic oscillations bao and the highredshift information from the cosmic microwave background cmb we show that when snia intrinsic luminosity is not allowed to vary as a function of the redshift cosmic acceleration is definitely proven in a modelindependent approach however allowing for a redshift dependence a nonaccelerated reconstruction of the expansion rate is able to fit as well as lambdacdm the combination of snia and bao data both treating the bao standard ruler r_d as a free parameter or adding the recently published prior from cmb observations we further extend the analysis by including the cmb data and we show that a nonaccelerated reconstruction is able to nicely fit this combination of low and highredshift data in this work we present a modelindependent reconstruction of a nonaccelerated expansion rate of the universe that is able to nicely fit all the main background cosmological probes however the predicted value of h_0 is in tension with recent direct measurements our analysis points out that a final reliable and consensual value for h_0 would be critical to definitively prove the cosmic acceleration in a modelindependent way abridged
|
[['the', 'lambdacdm', 'model', 'is', 'the', 'current', 'standard', 'model', 'in', 'cosmology', 'thanks', 'to', 'its', 'ability', 'to', 'reproduce', 'the', 'observations', 'its', 'first', 'observational', 'evidence', 'appeared', 'from', 'the', 'type', 'ia', 'supernovae', 'snia', 'hubble', 'diagram', 'however', 'there', 'has', 'been', 'some', 'debate', 'in', 'the', 'literature', 'concerning', 'the', 'statistical', 'treatment', 'of', 'snia', 'in', 'this', 'paper', 'we', 'relax', 'the', 'standard', 'assumption', 'that', 'snia', 'intrinsic', 'luminosity', 'is', 'independent', 'of', 'the', 'redshift', 'and', 'we', 'examine', 'whether', 'it', 'may', 'have', 'an', 'impact', 'on', 'the', 'accelerated', 'nature', 'of', 'the', 'expansion', 'of', 'the', 'universe', 'in', 'order', 'to', 'be', 'as', 'general', 'as', 'possible', 'we', 'reconstruct', 'the', 'expansion', 'rate', 'of', 'the', 'universe', 'through', 'a', 'cubic', 'spline', 'interpolation', 'fitting', 'observations', 'of', 'different', 'probes', 'snia', 'baryon', 'acoustic', 'oscillations', 'bao', 'and', 'the', 'highredshift', 'information', 'from', 'the', 'cosmic', 'microwave', 'background', 'cmb', 'we', 'show', 'that', 'when', 'snia', 'intrinsic', 'luminosity', 'is', 'not', 'allowed', 'to', 'vary', 'as', 'a', 'function', 'of', 'the', 'redshift', 'cosmic', 'acceleration', 'is', 'definitely', 'proven', 'in', 'a', 'modelindependent', 'approach', 'however', 'allowing', 'for', 'a', 'redshift', 'dependence', 'a', 'nonaccelerated', 'reconstruction', 'of', 'the', 'expansion', 'rate', 'is', 'able', 'to', 'fit', 'as', 'well', 'as', 'lambdacdm', 'the', 'combination', 'of', 'snia', 'and', 'bao', 'data', 'both', 'treating', 'the', 'bao', 'standard', 'ruler', 'r_d', 'as', 'a', 'free', 'parameter', 'or', 'adding', 'the', 'recently', 'published', 'prior', 'from', 'cmb', 'observations', 'we', 'further', 'extend', 'the', 'analysis', 'by', 'including', 'the', 'cmb', 'data', 'and', 'we', 'show', 'that', 'a', 'nonaccelerated', 'reconstruction', 'is', 'able', 'to', 'nicely', 'fit', 'this', 'combination', 'of', 'low', 'and', 'highredshift', 'data', 'in', 'this', 'work', 'we', 'present', 'a', 'modelindependent', 'reconstruction', 'of', 'a', 'nonaccelerated', 'expansion', 'rate', 'of', 'the', 'universe', 'that', 'is', 'able', 'to', 'nicely', 'fit', 'all', 'the', 'main', 'background', 'cosmological', 'probes', 'however', 'the', 'predicted', 'value', 'of', 'h_0', 'is', 'in', 'tension', 'with', 'recent', 'direct', 'measurements', 'our', 'analysis', 'points', 'out', 'that', 'a', 'final', 'reliable', 'and', 'consensual', 'value', 'for', 'h_0', 'would', 'be', 'critical', 'to', 'definitively', 'prove', 'the', 'cosmic', 'acceleration', 'in', 'a', 'modelindependent', 'way', 'abridged']]
|
[-0.03377762016390403, 0.06408541745755829, -0.10543814327851948, 0.11934665411245078, -0.14588760036769938, -0.07994189611715027, 0.046469058566411044, 0.35080982838141717, -0.23604553192538225, -0.2889579866649741, 0.07969035168999206, -0.29713532848883484, -0.03920453072644443, 0.2161449863030812, -0.010316258530804328, 0.02763050046820446, 0.05900220880324368, -0.02743872636139898, -0.06682803447686839, -0.2982224100081929, 0.2895806790960921, 0.15354144653873675, 0.2741971364665098, -0.020126580127309692, 0.06980864349871053, -0.08735203065877875, -0.11091677760863203, 0.031281070668897515, -0.20173290252823173, 0.0652897842023206, 0.21451916036322333, 0.19742465315451274, 0.20021013662345327, -0.36474942255575776, -0.2637984057099132, 0.16555831738100465, 0.19354743248017472, 0.1585700633860651, -0.04181532203574996, -0.24438248928636314, 0.026267527159050865, -0.15433281351095934, -0.10570873695907136, -0.04280964066195538, -0.03549017177073885, -0.010546743122750293, -0.26331244363652745, 0.18200371247337405, -0.0017175551979423706, -0.009214531437699068, -0.08071155210530732, -0.06335464681033046, 0.006733967793189873, 0.051180674834275554, 0.07725584495662696, 0.09776885524447376, 0.08587274158499757, -0.12168858834242417, -0.060823280907283395, 0.4101630491346626, -0.11987099934298293, -0.08627510132204931, 0.15697046249741847, -0.19117212847064613, -0.15615232488203604, 0.033877383569508035, 0.13860496154668647, 0.027745622920288735, -0.17707529674719238, 0.10752828374191313, 0.010256193134681148, 0.18824887511130992, 0.05216929604954449, -0.001815803951812687, 0.25908452447353847, 0.1502336485019364, 0.05073701970484423, 0.044457639483498186, -0.13275099397415957, 0.023054903125098385, -0.3412889422359482, -0.09449532978804939, -0.19364123748954765, 0.09442943530477844, -0.15235615469815242, -0.17409347997567917, 0.37984912816940225, 0.17175683557111138, 0.2679260275567392, 0.046993815160151255, 0.34230746996068095, 0.04121928547067031, 0.06886013058582478, 0.03244539943555275, 0.33803635998441584, 0.13001262136750807, 0.08704482365312781, -0.20982875393750935, 0.08449181503955654, 0.007885688181840262]
|
1,803.06198
|
Larmor Frequency in Heterogeneous Media
|
The Larmor frequency shift is found in porous media consisting of
NMR-reporting fluid filling a connected pore within an NMR-invisible matrix for
the case of fast diffusion in the fluid. The matrix material has a distinct
location-independent anisotropic magnetic susceptibility tensor that induces a
heterogeneous microscopic magnetic field when exposed to the strong main field
of an NMR device. Aside from the connectivity of the pore, the matrix geometry
is arbitrary.
|
cond-mat.soft
|
the larmor frequency shift is found in porous media consisting of nmrreporting fluid filling a connected pore within an nmrinvisible matrix for the case of fast diffusion in the fluid the matrix material has a distinct locationindependent anisotropic magnetic susceptibility tensor that induces a heterogeneous microscopic magnetic field when exposed to the strong main field of an nmr device aside from the connectivity of the pore the matrix geometry is arbitrary
|
[['the', 'larmor', 'frequency', 'shift', 'is', 'found', 'in', 'porous', 'media', 'consisting', 'of', 'nmrreporting', 'fluid', 'filling', 'a', 'connected', 'pore', 'within', 'an', 'nmrinvisible', 'matrix', 'for', 'the', 'case', 'of', 'fast', 'diffusion', 'in', 'the', 'fluid', 'the', 'matrix', 'material', 'has', 'a', 'distinct', 'locationindependent', 'anisotropic', 'magnetic', 'susceptibility', 'tensor', 'that', 'induces', 'a', 'heterogeneous', 'microscopic', 'magnetic', 'field', 'when', 'exposed', 'to', 'the', 'strong', 'main', 'field', 'of', 'an', 'nmr', 'device', 'aside', 'from', 'the', 'connectivity', 'of', 'the', 'pore', 'the', 'matrix', 'geometry', 'is', 'arbitrary']]
|
[-0.19124139061845516, 0.2176179496636378, -0.018464739785354206, -0.05421885160520079, -0.055870255995271866, -0.12815369814769298, -0.0384627678870237, 0.3670665844195131, -0.30090935827921267, -0.22965031377701223, 0.04558926219781996, -0.2585604015359844, -0.14434135730202863, 0.1338652294884989, 0.005892507262878876, -0.03030791149839111, -0.022908412513957508, 0.08329031178626516, -0.04399447700352934, -0.11530821015585915, 0.32348916658024857, 0.03267583502051623, 0.3012500473608573, 0.07460136959275258, 0.10053541808915527, 0.0034499156855694628, 0.04738375898180665, 0.1062232688933179, -0.09670529713353523, 0.07742404450149531, 0.22528985990346342, -0.007331188336230706, 0.2272693374990553, -0.493312179070452, -0.23753156229529693, 0.020348830047346975, 0.11603977991119567, 0.12871555368537488, -0.06717981711245966, -0.2642099410261743, 0.0364579142111799, -0.14164461223813501, -0.133698422063574, -0.019382772167496707, 0.0569596580006992, 0.006258914598088333, -0.28294478508346865, 0.11429584876674673, 0.05820270135080901, 0.07478849544777008, -0.10429351137060186, -0.1020317674897935, 0.036215017421468015, 0.12321417815046912, 0.03521530283614993, 0.028982933047160073, 0.2123776201185757, -0.1534904072844032, -0.017664526416806242, 0.3790611501958599, -0.04227923094362453, -0.16254692030665668, 0.1424727150630476, -0.1770581839930104, -0.004351831965850315, 0.20796095951041882, 0.17988743691070788, 0.0618609181213854, -0.15254412900822648, 0.1058978811868102, -0.07528149006564332, 0.20922529858037614, 0.03526292686296654, -0.03687356090497063, 0.18055354759259068, 0.20282989522725667, 0.06388267523784569, 0.1707876113553842, -0.0948755162079697, -0.08604895088659681, -0.24195665455814722, -0.18439233165396296, -0.25022912905484007, 0.10315264204004104, -0.19871785599009498, -0.25482395330470975, 0.3979232528624867, 0.08271819423290266, 0.15057979863005408, -0.060142087588167706, 0.28162126582574804, 0.06821986166355402, 0.07562757736962775, 0.08445101487787737, 0.2062560968047035, 0.2725812520669854, 0.16167415265479815, -0.2682613242937225, 0.06224152961394925, 0.024612743603200583]
|
1,803.06199
|
Complex-YOLO: Real-time 3D Object Detection on Point Clouds
|
Lidar based 3D object detection is inevitable for autonomous driving, because
it directly links to environmental understanding and therefore builds the base
for prediction and motion planning. The capacity of inferencing highly sparse
3D data in real-time is an ill-posed problem for lots of other application
areas besides automated vehicles, e.g. augmented reality, personal robotics or
industrial automation. We introduce Complex-YOLO, a state of the art real-time
3D object detection network on point clouds only. In this work, we describe a
network that expands YOLOv2, a fast 2D standard object detector for RGB images,
by a specific complex regression strategy to estimate multi-class 3D boxes in
Cartesian space. Thus, we propose a specific Euler-Region-Proposal Network
(E-RPN) to estimate the pose of the object by adding an imaginary and a real
fraction to the regression network. This ends up in a closed complex space and
avoids singularities, which occur by single angle estimations. The E-RPN
supports to generalize well during training. Our experiments on the KITTI
benchmark suite show that we outperform current leading methods for 3D object
detection specifically in terms of efficiency. We achieve state of the art
results for cars, pedestrians and cyclists by being more than five times faster
than the fastest competitor. Further, our model is capable of estimating all
eight KITTI-classes, including Vans, Trucks or sitting pedestrians
simultaneously with high accuracy.
|
cs.CV
|
lidar based 3d object detection is inevitable for autonomous driving because it directly links to environmental understanding and therefore builds the base for prediction and motion planning the capacity of inferencing highly sparse 3d data in realtime is an illposed problem for lots of other application areas besides automated vehicles eg augmented reality personal robotics or industrial automation we introduce complexyolo a state of the art realtime 3d object detection network on point clouds only in this work we describe a network that expands yolov2 a fast 2d standard object detector for rgb images by a specific complex regression strategy to estimate multiclass 3d boxes in cartesian space thus we propose a specific eulerregionproposal network erpn to estimate the pose of the object by adding an imaginary and a real fraction to the regression network this ends up in a closed complex space and avoids singularities which occur by single angle estimations the erpn supports to generalize well during training our experiments on the kitti benchmark suite show that we outperform current leading methods for 3d object detection specifically in terms of efficiency we achieve state of the art results for cars pedestrians and cyclists by being more than five times faster than the fastest competitor further our model is capable of estimating all eight kitticlasses including vans trucks or sitting pedestrians simultaneously with high accuracy
|
[['lidar', 'based', '3d', 'object', 'detection', 'is', 'inevitable', 'for', 'autonomous', 'driving', 'because', 'it', 'directly', 'links', 'to', 'environmental', 'understanding', 'and', 'therefore', 'builds', 'the', 'base', 'for', 'prediction', 'and', 'motion', 'planning', 'the', 'capacity', 'of', 'inferencing', 'highly', 'sparse', '3d', 'data', 'in', 'realtime', 'is', 'an', 'illposed', 'problem', 'for', 'lots', 'of', 'other', 'application', 'areas', 'besides', 'automated', 'vehicles', 'eg', 'augmented', 'reality', 'personal', 'robotics', 'or', 'industrial', 'automation', 'we', 'introduce', 'complexyolo', 'a', 'state', 'of', 'the', 'art', 'realtime', '3d', 'object', 'detection', 'network', 'on', 'point', 'clouds', 'only', 'in', 'this', 'work', 'we', 'describe', 'a', 'network', 'that', 'expands', 'yolov2', 'a', 'fast', '2d', 'standard', 'object', 'detector', 'for', 'rgb', 'images', 'by', 'a', 'specific', 'complex', 'regression', 'strategy', 'to', 'estimate', 'multiclass', '3d', 'boxes', 'in', 'cartesian', 'space', 'thus', 'we', 'propose', 'a', 'specific', 'eulerregionproposal', 'network', 'erpn', 'to', 'estimate', 'the', 'pose', 'of', 'the', 'object', 'by', 'adding', 'an', 'imaginary', 'and', 'a', 'real', 'fraction', 'to', 'the', 'regression', 'network', 'this', 'ends', 'up', 'in', 'a', 'closed', 'complex', 'space', 'and', 'avoids', 'singularities', 'which', 'occur', 'by', 'single', 'angle', 'estimations', 'the', 'erpn', 'supports', 'to', 'generalize', 'well', 'during', 'training', 'our', 'experiments', 'on', 'the', 'kitti', 'benchmark', 'suite', 'show', 'that', 'we', 'outperform', 'current', 'leading', 'methods', 'for', '3d', 'object', 'detection', 'specifically', 'in', 'terms', 'of', 'efficiency', 'we', 'achieve', 'state', 'of', 'the', 'art', 'results', 'for', 'cars', 'pedestrians', 'and', 'cyclists', 'by', 'being', 'more', 'than', 'five', 'times', 'faster', 'than', 'the', 'fastest', 'competitor', 'further', 'our', 'model', 'is', 'capable', 'of', 'estimating', 'all', 'eight', 'kitticlasses', 'including', 'vans', 'trucks', 'or', 'sitting', 'pedestrians', 'simultaneously', 'with', 'high', 'accuracy']]
|
[-0.08425066042933782, 0.03032014373496567, -0.01539469688574518, 0.032042086751271896, -0.09856552312259112, -0.15802481944348276, 0.040305681529821516, 0.41424639110887485, -0.20232599376115054, -0.3431027064171548, 0.12489302311755288, -0.26465299135765136, -0.15559317604733455, 0.2371358704917571, -0.14839433676381997, 0.08911826890973348, 0.16226140835335082, 0.03772891574324323, -0.054155920391451416, -0.23619584321113918, 0.2952249481540797, 0.013757585202305835, 0.3086433607107239, 0.006820723541371727, 0.13833367621486087, 0.023890685311168836, -0.03549885517855415, -6.366547379364593e-05, -0.02988793446011557, 0.15528879262695544, 0.27586018817490854, 0.16118808354438616, 0.2687927028438186, -0.4470903969473075, -0.24890374416712993, 0.08572891735248173, 0.14308872491844807, 0.08671784628344893, -0.030382139009133304, -0.3571902158126505, 0.08862576380817691, -0.1894204922007793, -0.0775979280448624, -0.10072888881368436, 0.017045044034537205, -0.023432131281978033, -0.27045867486743097, 0.032076546844364694, 0.031503123480919326, 0.0596480683172838, -0.06865835247394877, -0.07266340348279585, 0.022668498857958217, 0.17098497697131126, -0.0039665547528249375, 0.07211168444551089, 0.17457391142980005, -0.24596750368369422, -0.13371522212243003, 0.39420666781620745, -0.033064720025565264, -0.21534050802165028, 0.22700173126815973, -0.07706338215653039, -0.11630263876030854, 0.14810288694952678, 0.22200159448998605, 0.15235699799277386, -0.12436930372535643, -0.00897070311975973, -0.03377004508013369, 0.14896690603190235, 0.04435338881443575, -0.043725325241347784, 0.1924980691459232, 0.25415797613358876, 0.11440074697613076, 0.12025034147429563, -0.16886345493476584, -0.09095757619090108, -0.20949504317871687, -0.1670906445258023, -0.16540021224450993, -0.01573122238605473, -0.1004556308252757, -0.15629970351638633, 0.3849112128720901, 0.23093921828362354, 0.21219415528324698, 0.07942998989188108, 0.39798933231773287, 0.02928505351027364, 0.07757363825977455, 0.1023665081469418, 0.19225532315224747, -0.02854348974074848, 0.12307569185720664, -0.16383776836923208, 0.07235783081906279, 0.06850955178629295]
|
1,803.062
|
Quantile correlation coefficient: a new tail dependence measure
|
We propose a new measure related with tail dependence in terms of
correlation: quantile correlation coefficient of random variables X, Y. The
quantile correlation is defined by the geometric mean of two quantile
regression slopes of X on Y and Y on X in the same way that the Pearson
correlation is related with the regression coefficients of Y on X and X on Y.
The degree of tail dependent association in X, Y, if any, is well reflected in
the quantile correlation. The quantile correlation makes it possible to measure
sensitivity of a conditional quantile of a random variable with respect to
change of the other variable. The properties of the quantile correlation are
similar to those of the correlation. This enables us to interpret it from the
perspective of correlation, on which tail dependence is reflected. We construct
measures for tail dependent correlation and tail asymmetry and develop
statistical tests for them. We prove asymptotic normality of the estimated
quantile correlation and limiting null distributions of the proposed tests,
which is well supported in finite samples by a Monte-Carlo study. The proposed
quantile correlation methods are well illustrated by analyzing birth weight
data set and stock return data set.
|
stat.ME
|
we propose a new measure related with tail dependence in terms of correlation quantile correlation coefficient of random variables x y the quantile correlation is defined by the geometric mean of two quantile regression slopes of x on y and y on x in the same way that the pearson correlation is related with the regression coefficients of y on x and x on y the degree of tail dependent association in x y if any is well reflected in the quantile correlation the quantile correlation makes it possible to measure sensitivity of a conditional quantile of a random variable with respect to change of the other variable the properties of the quantile correlation are similar to those of the correlation this enables us to interpret it from the perspective of correlation on which tail dependence is reflected we construct measures for tail dependent correlation and tail asymmetry and develop statistical tests for them we prove asymptotic normality of the estimated quantile correlation and limiting null distributions of the proposed tests which is well supported in finite samples by a montecarlo study the proposed quantile correlation methods are well illustrated by analyzing birth weight data set and stock return data set
|
[['we', 'propose', 'a', 'new', 'measure', 'related', 'with', 'tail', 'dependence', 'in', 'terms', 'of', 'correlation', 'quantile', 'correlation', 'coefficient', 'of', 'random', 'variables', 'x', 'y', 'the', 'quantile', 'correlation', 'is', 'defined', 'by', 'the', 'geometric', 'mean', 'of', 'two', 'quantile', 'regression', 'slopes', 'of', 'x', 'on', 'y', 'and', 'y', 'on', 'x', 'in', 'the', 'same', 'way', 'that', 'the', 'pearson', 'correlation', 'is', 'related', 'with', 'the', 'regression', 'coefficients', 'of', 'y', 'on', 'x', 'and', 'x', 'on', 'y', 'the', 'degree', 'of', 'tail', 'dependent', 'association', 'in', 'x', 'y', 'if', 'any', 'is', 'well', 'reflected', 'in', 'the', 'quantile', 'correlation', 'the', 'quantile', 'correlation', 'makes', 'it', 'possible', 'to', 'measure', 'sensitivity', 'of', 'a', 'conditional', 'quantile', 'of', 'a', 'random', 'variable', 'with', 'respect', 'to', 'change', 'of', 'the', 'other', 'variable', 'the', 'properties', 'of', 'the', 'quantile', 'correlation', 'are', 'similar', 'to', 'those', 'of', 'the', 'correlation', 'this', 'enables', 'us', 'to', 'interpret', 'it', 'from', 'the', 'perspective', 'of', 'correlation', 'on', 'which', 'tail', 'dependence', 'is', 'reflected', 'we', 'construct', 'measures', 'for', 'tail', 'dependent', 'correlation', 'and', 'tail', 'asymmetry', 'and', 'develop', 'statistical', 'tests', 'for', 'them', 'we', 'prove', 'asymptotic', 'normality', 'of', 'the', 'estimated', 'quantile', 'correlation', 'and', 'limiting', 'null', 'distributions', 'of', 'the', 'proposed', 'tests', 'which', 'is', 'well', 'supported', 'in', 'finite', 'samples', 'by', 'a', 'montecarlo', 'study', 'the', 'proposed', 'quantile', 'correlation', 'methods', 'are', 'well', 'illustrated', 'by', 'analyzing', 'birth', 'weight', 'data', 'set', 'and', 'stock', 'return', 'data', 'set']]
|
[-0.07295941914876562, 0.05438788312566073, -0.15538146354220994, 0.1461761116874937, -0.03506887010970519, -0.1372900958362948, 0.06640087896309312, 0.42886093310752316, -0.27783759252460144, -0.2553797337352252, 0.07120764654289598, -0.34090679474360314, -0.10317855034561003, 0.14555147204858562, -0.06427069809473124, 0.10024726625290972, -0.027450472982924672, 0.03363161707593508, -0.11212620509479111, -0.25988245894437406, 0.3242028026901816, 0.04251130637643275, 0.2943327105974788, -0.00010071727285041145, 0.14415973564146542, 0.0897373183102194, -0.10512292507424284, 0.027195720951911525, -0.10177536578565884, 0.1365676844974433, 0.2126804320558683, 0.10344451186200836, 0.27852633600795074, -0.2825778482959082, -0.18739284159828776, 0.10205769206197997, 0.0828595890556995, -0.06274006420408204, 0.011119033185074763, -0.2536427610790107, 0.017930160100520842, -0.13886519326124425, -0.0875930224478115, -0.08711121501447401, 0.050942122783345076, 0.09305574015982968, -0.3554098251187683, 0.14485729463741331, 0.045597677591108526, 0.08253663368013442, 0.01294600547277438, -0.15613448146593975, -0.045057139259795494, 0.08339121912731164, 0.12954826083437387, 0.048581270995637894, 0.09821186559413796, -0.08279914098930202, -0.07727847652004763, 0.28993835187498573, -0.1097765085652276, -0.22193926134823233, 0.15701171526898497, -0.24272028156394018, -0.13639839791428687, 0.0987136007346843, 0.19633941630837484, 0.10435690224837901, -0.1560386724362326, 0.08161478535334732, -0.043388757894084376, 0.14219819714514473, 0.045170973898351785, 0.029247000191444113, 0.17095582601405793, 0.12369160529223748, 0.07072862706886168, 0.13485977215610156, -0.14928052717120738, -0.05268968732834131, -0.3227117386326861, -0.1539217776686083, -0.20948368503679685, 0.04442409732707994, -0.15942577739893135, -0.20806608401848217, 0.4029138605782197, 0.16174701260158383, 0.23455221218460087, 0.1205635372160086, 0.20832730008553324, 0.15246829369573955, -0.0055194142499280655, 0.041806875766296665, 0.14031892817349298, 0.16835773954357933, 0.02509950250109185, -0.18164092341938348, 0.20549697577631892, 0.03086346813676814]
|
1,803.06201
|
Mobius disjointness conjecture for local dendrite maps
|
We prove that the M\"obius disjointness conjecture holds for graph maps and
for all monotone local dendrite maps. We further show that this also hold for
continuous map on certain class of dendrites. Moreover, we see that there is a
transitive dendrite map with zero entropy for which M\"obius disjointness
holds.
|
math.DS
|
we prove that the mobius disjointness conjecture holds for graph maps and for all monotone local dendrite maps we further show that this also hold for continuous map on certain class of dendrites moreover we see that there is a transitive dendrite map with zero entropy for which mobius disjointness holds
|
[['we', 'prove', 'that', 'the', 'mobius', 'disjointness', 'conjecture', 'holds', 'for', 'graph', 'maps', 'and', 'for', 'all', 'monotone', 'local', 'dendrite', 'maps', 'we', 'further', 'show', 'that', 'this', 'also', 'hold', 'for', 'continuous', 'map', 'on', 'certain', 'class', 'of', 'dendrites', 'moreover', 'we', 'see', 'that', 'there', 'is', 'a', 'transitive', 'dendrite', 'map', 'with', 'zero', 'entropy', 'for', 'which', 'mobius', 'disjointness', 'holds']]
|
[-0.13723415019465426, 0.10410601979888537, -0.059779370541446934, 0.08874337654560804, -0.02885797572340451, -0.18961299984149782, 0.08030505693864588, 0.4243055590811898, -0.31827790976739395, -0.10875568690472374, 0.07837045417788129, -0.2655387884325476, -0.23992966743660907, 0.23070691073057698, -0.11268847539801807, 0.08858753100959767, 0.0642343534558427, 0.026852875327070553, -0.1012222089612966, -0.2815373620074288, 0.3917840172847112, -0.15465768843012698, 0.23187813003930977, 0.1580567092032117, 0.1460934741166877, 0.03376720265677089, 0.006729681875702797, 0.08130852114774433, -0.21204030106295535, 0.05849102861932753, 0.2187748364008525, 0.1616395762345443, 0.20924973232196828, -0.3663092013448477, -0.2148234633153633, 0.2333958534633412, 0.05795381472026016, 0.03820929700718718, -0.09973722128608428, -0.22700684450055456, 0.194911948149549, -0.062405462869826483, -0.11212215669380099, -0.09116094963004191, 0.08534036138478447, 0.029514557408059344, -0.31272958843585325, 0.04266133321410356, 0.2474011602062805, 0.08724781277352105, -0.04477115043018963, -0.021435673796005694, -0.11240424343622198, 0.15524035886697032, -0.05986289569067166, 0.08947918369599125, 0.1018757880756668, -0.051192801550724636, -0.07461924892028465, 0.31586650318886134, -0.07167385522203118, -0.2443805201134334, 0.15519019469787715, -0.18509918500614517, -0.2818811486347341, 0.05261789319817634, 0.07305380428100333, 0.06975897240872476, -0.05951012840823216, 0.16711265003815404, -0.2208511299800639, 0.1323079250424224, 0.14608122911486848, 0.009159915249648631, 0.11292344408438486, 0.05134835966187073, 0.27825689606149406, 0.19562179226355225, 0.017327884901497587, -0.009484205769338444, -0.32516538804652645, -0.21066355224990962, -0.15850236068032317, 0.0950512970551191, -0.1043458744017841, -0.21038225013762712, 0.35626610182225704, 0.13884763764765332, 0.16535648729140853, 0.29144845943322734, 0.16341867089709816, 0.10413313114686924, 0.07868720309845373, 0.10213421530765938, 0.12282850169668011, 0.13681005151467582, -0.01022251863397804, -0.13645658502355218, 0.021917774200475977, 0.18147091030636253]
|
1,803.06202
|
Thermodynamics of the kagome-lattice Heisenberg antiferromagnet with
arbitrary spin $S$
|
We use a second-order rotational invariant Green's function method (RGM) and
the high-temperature expansion (HTE) to calculate the thermodynamic properties,
of the kagome-lattice spin-$S$ Heisenberg antiferromagnet with nearest-neighbor
exchange $J$. While the HTE yields accurate results down to temperatures of
about $T/S(S+1) \sim J$, the RGM provides data for arbitrary $T \ge 0$. For the
ground state we use the RGM data to analyze the $S$-dependence of the
excitation spectrum, the excitation velocity, the uniform susceptibility, the
spin-spin correlation functions, the correlation length, and the structure
factor. We found that the so-called $\sqrt{3}\times\sqrt{3}$ ordering is more
pronounced than the $q=0$ ordering for all values of $S$. In the extreme
quantum case $S=1/2$ the zero-temperature correlation length is only of the
order of the nearest-neighbor separation. Then we study the temperature
dependence of several physical quantities for spin quantum numbers
$S=1/2,1,\dots,7/2$. As increasing $S$ the typical maximum in the specific heat
and in the uniform susceptibility are shifted towards lower values of
$T/S(S+1)$ and the height of the maximum is growing. The structure factor
${\cal S}(\mathbf{q})$ exhibits two maxima at magnetic wave vectors
$\mathbf{q}={\mathbf{Q}_i}, i=0,1,$ corresponding to the $q=0$ and
$\sqrt{3}\times\sqrt{3}$ state. We find that the $\sqrt{3}\times \sqrt{3}$
short-range order is more pronounced than the $q=0$ short-range order for all
temperatures $T \ge 0$. For the spin-spin correlation functions, the
correlation lengths and the structure factors, we find a finite low-temperature
region $0 \le T < T^*\approx a/S(S+1)$, $a \approx 0.2$, where these quantities
are almost independent of $T$.
|
cond-mat.str-el
|
we use a secondorder rotational invariant greens function method rgm and the hightemperature expansion hte to calculate the thermodynamic properties of the kagomelattice spins heisenberg antiferromagnet with nearestneighbor exchange j while the hte yields accurate results down to temperatures of about tss1 sim j the rgm provides data for arbitrary t ge 0 for the ground state we use the rgm data to analyze the sdependence of the excitation spectrum the excitation velocity the uniform susceptibility the spinspin correlation functions the correlation length and the structure factor we found that the socalled sqrt3timessqrt3 ordering is more pronounced than the q0 ordering for all values of s in the extreme quantum case s12 the zerotemperature correlation length is only of the order of the nearestneighbor separation then we study the temperature dependence of several physical quantities for spin quantum numbers s121dots72 as increasing s the typical maximum in the specific heat and in the uniform susceptibility are shifted towards lower values of tss1 and the height of the maximum is growing the structure factor cal smathbfq exhibits two maxima at magnetic wave vectors mathbfqmathbfq_i i01 corresponding to the q0 and sqrt3timessqrt3 state we find that the sqrt3times sqrt3 shortrange order is more pronounced than the q0 shortrange order for all temperatures t ge 0 for the spinspin correlation functions the correlation lengths and the structure factors we find a finite lowtemperature region 0 le t tapprox ass1 a approx 02 where these quantities are almost independent of t
|
[['we', 'use', 'a', 'secondorder', 'rotational', 'invariant', 'greens', 'function', 'method', 'rgm', 'and', 'the', 'hightemperature', 'expansion', 'hte', 'to', 'calculate', 'the', 'thermodynamic', 'properties', 'of', 'the', 'kagomelattice', 'spins', 'heisenberg', 'antiferromagnet', 'with', 'nearestneighbor', 'exchange', 'j', 'while', 'the', 'hte', 'yields', 'accurate', 'results', 'down', 'to', 'temperatures', 'of', 'about', 'tss1', 'sim', 'j', 'the', 'rgm', 'provides', 'data', 'for', 'arbitrary', 't', 'ge', '0', 'for', 'the', 'ground', 'state', 'we', 'use', 'the', 'rgm', 'data', 'to', 'analyze', 'the', 'sdependence', 'of', 'the', 'excitation', 'spectrum', 'the', 'excitation', 'velocity', 'the', 'uniform', 'susceptibility', 'the', 'spinspin', 'correlation', 'functions', 'the', 'correlation', 'length', 'and', 'the', 'structure', 'factor', 'we', 'found', 'that', 'the', 'socalled', 'sqrt3timessqrt3', 'ordering', 'is', 'more', 'pronounced', 'than', 'the', 'q0', 'ordering', 'for', 'all', 'values', 'of', 's', 'in', 'the', 'extreme', 'quantum', 'case', 's12', 'the', 'zerotemperature', 'correlation', 'length', 'is', 'only', 'of', 'the', 'order', 'of', 'the', 'nearestneighbor', 'separation', 'then', 'we', 'study', 'the', 'temperature', 'dependence', 'of', 'several', 'physical', 'quantities', 'for', 'spin', 'quantum', 'numbers', 's121dots72', 'as', 'increasing', 's', 'the', 'typical', 'maximum', 'in', 'the', 'specific', 'heat', 'and', 'in', 'the', 'uniform', 'susceptibility', 'are', 'shifted', 'towards', 'lower', 'values', 'of', 'tss1', 'and', 'the', 'height', 'of', 'the', 'maximum', 'is', 'growing', 'the', 'structure', 'factor', 'cal', 'smathbfq', 'exhibits', 'two', 'maxima', 'at', 'magnetic', 'wave', 'vectors', 'mathbfqmathbfq_i', 'i01', 'corresponding', 'to', 'the', 'q0', 'and', 'sqrt3timessqrt3', 'state', 'we', 'find', 'that', 'the', 'sqrt3times', 'sqrt3', 'shortrange', 'order', 'is', 'more', 'pronounced', 'than', 'the', 'q0', 'shortrange', 'order', 'for', 'all', 'temperatures', 't', 'ge', '0', 'for', 'the', 'spinspin', 'correlation', 'functions', 'the', 'correlation', 'lengths', 'and', 'the', 'structure', 'factors', 'we', 'find', 'a', 'finite', 'lowtemperature', 'region', '0', 'le', 't', 'tapprox', 'ass1', 'a', 'approx', '02', 'where', 'these', 'quantities', 'are', 'almost', 'independent', 'of', 't']]
|
[-0.1830032658504529, 0.21440872936289174, -0.032453610530169104, 0.07817039968457395, -0.017632922178724544, -0.09793647294198143, 0.03937460941458006, 0.36544870758137415, -0.23798839079882997, -0.2423463717252476, 0.035529753508969926, -0.36126532769712155, -0.043790889988220276, 0.1467801916792437, 0.14165995653192534, 0.025742452391523892, -0.057961246801670564, 0.08468413545315082, -0.16576645070775087, -0.20161442566804832, 0.27332078392607584, 0.016987882128153994, 0.2643263773418246, 0.07689321798429567, 0.05289468335714996, 0.033260422199198, 0.09904943894663895, -0.007172981741811329, -0.21450371793482056, 0.04473750051417591, 0.21169403219909824, -0.013061312675734056, 0.1925668243439523, -0.3419244103766058, -0.17724612913929969, 0.07952679736049148, 0.12554253112915673, 0.08848595098638332, 0.033863664884862796, -0.2217476288682624, 0.06819921238309562, -0.1514718201961905, -0.1439742678704522, -0.10673490862281602, 0.06312006541720395, 0.009923619730541781, -0.31028440804100965, 0.17162000059644567, 0.08404080259494882, 0.08183716026751837, -0.053795613858220265, -0.19277543516890933, -0.05344051982797376, 0.10378748626417553, 0.03267858774926314, 0.0937132700566785, 0.08987844090644316, -0.13089507693279182, -0.06527673768779309, 0.3275319612489193, -0.0667458957003922, -0.10814923410583671, 0.1337416475148174, -0.23139072285482176, -0.10647992156551377, 0.14272069871241663, 0.08482716234262895, 0.12323552847805398, -0.10517591727133879, 0.09819099226623482, 0.007049662050076783, 0.1928692371565312, 0.05969644828369925, 0.05196654131164613, 0.15976808841125617, 0.10460167838099563, 0.06504317676363927, 0.14951393585326342, -0.1283446699706646, -0.09884642034485445, -0.2720971947359573, -0.14731687689126985, -0.21516103187380473, 0.07976314264517076, -0.1648078800650714, -0.14751419887989145, 0.37863821002804204, 0.14898264452479942, 0.22063042381740033, 0.05043936475973438, 0.2094830837093079, 0.14211828667438617, 0.05143344994833685, 0.10312356091527951, 0.1854762280543829, 0.17685455985946022, 0.08501090166166639, -0.28036877008752875, 0.04997460407572856, 0.05183077318097538]
|
1,803.06203
|
Numerical computation of H-bases
|
This paper gives a numerically stable method to compute H-basis which is
based on the computing a minimal basis for the module of syzygies using
singular value decomposition. We illustrate the performance of this method by
means of various examples.
|
math.AC
|
this paper gives a numerically stable method to compute hbasis which is based on the computing a minimal basis for the module of syzygies using singular value decomposition we illustrate the performance of this method by means of various examples
|
[['this', 'paper', 'gives', 'a', 'numerically', 'stable', 'method', 'to', 'compute', 'hbasis', 'which', 'is', 'based', 'on', 'the', 'computing', 'a', 'minimal', 'basis', 'for', 'the', 'module', 'of', 'syzygies', 'using', 'singular', 'value', 'decomposition', 'we', 'illustrate', 'the', 'performance', 'of', 'this', 'method', 'by', 'means', 'of', 'various', 'examples']]
|
[-0.09341678370037698, -0.016493076900951566, -0.12819782313890754, 0.007001395893166773, -0.05636815582402051, -0.08982560529839248, 0.030943882503197528, 0.32233066005865113, -0.2802576011512429, -0.2368228857871145, 0.15173830412095413, -0.2050634547136724, -0.231156525015831, 0.269930185796693, -0.07573580220341683, 0.0706078375922516, 0.08862876240746118, 0.05185040645301342, -0.09877189830876887, -0.27170331100933254, 0.3966040190309286, 0.057857206021435556, 0.2819027006626129, 0.07040577864972875, 0.1665446504484862, -0.014590726606547833, -0.022646610462106764, 0.029471451323479413, -0.16635837798239664, 0.2436040961474646, 0.22732847298611886, 0.13477139942115174, 0.281740095326677, -0.35879341303370893, -0.10201958727557212, 0.14232121966779232, 0.13048872289364227, 0.11181139197142329, -0.05711459109152202, -0.2146199242095463, 0.16914193214615808, -0.213011432235362, -0.16513267291011288, -0.16929014446213841, -0.006226456351578235, -0.006109838630072773, -0.3132530075497925, -0.008161529270000755, 0.007783935707993806, 0.08697463741991669, -0.04312526483554393, -0.10832007767166943, 0.02890675734670367, 0.05323011091677472, -0.007723373064072803, -0.040339644788764416, 0.08043005790095777, -0.07209007189376279, -0.12629697307711468, 0.3530274633609224, -0.06960976752452552, -0.25547965453006327, 0.12281089744647034, -0.05176655808463693, -0.07503086356446147, 0.12412021282361821, 0.14084484081249685, 0.1984535758383572, -0.11553089956287295, 0.12301752541679889, -0.08475677052047104, 0.0864875061903149, 0.07118062234949321, -0.026290143933147193, 0.12754769933526405, 0.19839269127696751, 0.0783275511697866, 0.1975148887373507, -0.05378870578133501, -0.06435654610395432, -0.31321628401055934, -0.2179733401397243, -0.21443883900064975, 0.03191092561464757, -0.11039767549082172, -0.1900259947171435, 0.5044855929911136, 0.18237056736106752, 0.1958394510205835, 0.09545128806785215, 0.3401614150963724, 0.15121122079435736, 0.003974468680098653, 0.07285434162477031, 0.18218811658443884, 0.13414480309584179, 0.011625452165026218, -0.20514788491418584, 0.02167028560070321, 0.19674582034349442]
|
1,803.06204
|
Characterization of Exoplanets: Secondary Eclipses
|
When an exoplanet passes behind its host star, we can measure the time of the
occultation, its depth, and its color. In this chapter we describe how these
observables can be used to deduce physical characteristics of the planet such
as its averaged dayside emission, departures from uniform disk illumination, or
a precise measurement of the orbital eccentricity. This technique became a
reality in 2005; in this chapter we describe the basics of the technique, its
main results in the last 12 years, and the prospects for the years to come.
This chapter includes a Table with references to all published detections of
secondary eclipses until December 2017.
|
astro-ph.EP
|
when an exoplanet passes behind its host star we can measure the time of the occultation its depth and its color in this chapter we describe how these observables can be used to deduce physical characteristics of the planet such as its averaged dayside emission departures from uniform disk illumination or a precise measurement of the orbital eccentricity this technique became a reality in 2005 in this chapter we describe the basics of the technique its main results in the last 12 years and the prospects for the years to come this chapter includes a table with references to all published detections of secondary eclipses until december 2017
|
[['when', 'an', 'exoplanet', 'passes', 'behind', 'its', 'host', 'star', 'we', 'can', 'measure', 'the', 'time', 'of', 'the', 'occultation', 'its', 'depth', 'and', 'its', 'color', 'in', 'this', 'chapter', 'we', 'describe', 'how', 'these', 'observables', 'can', 'be', 'used', 'to', 'deduce', 'physical', 'characteristics', 'of', 'the', 'planet', 'such', 'as', 'its', 'averaged', 'dayside', 'emission', 'departures', 'from', 'uniform', 'disk', 'illumination', 'or', 'a', 'precise', 'measurement', 'of', 'the', 'orbital', 'eccentricity', 'this', 'technique', 'became', 'a', 'reality', 'in', '2005', 'in', 'this', 'chapter', 'we', 'describe', 'the', 'basics', 'of', 'the', 'technique', 'its', 'main', 'results', 'in', 'the', 'last', '12', 'years', 'and', 'the', 'prospects', 'for', 'the', 'years', 'to', 'come', 'this', 'chapter', 'includes', 'a', 'table', 'with', 'references', 'to', 'all', 'published', 'detections', 'of', 'secondary', 'eclipses', 'until', 'december', '2017']]
|
[-0.06506739429163712, 0.10234212047860772, -0.11632649424589342, 0.037881431208613016, -0.08885995715563358, -0.05842222153700681, 0.05554704687178687, 0.37001188692671283, -0.2638873505725146, -0.34985850722296163, 0.12927687007295727, -0.2773961312378998, -0.12815309248873274, 0.18560577403641892, -0.13950689698793683, 0.021681709695258178, 0.10999164226706382, 0.0027838877350505856, -0.07591979559381595, -0.2981956196146914, 0.25531506235711277, 0.08884892365205344, 0.11391938606458199, 0.05147341440358475, 0.05453942475530008, 0.0228188423551964, -0.09537688028865011, -0.05797500278438545, -0.17548877192247245, 0.09844483126437774, 0.22291372688589575, 0.18529147063209503, 0.19124797411280237, -0.4003697194986873, -0.1881529428280407, 0.04510044112059943, 0.10006980443183609, 0.09905126495114355, -0.01374695831785815, -0.2678104260487965, 0.03979545245615386, -0.21286706506550587, -0.19006481053549107, 0.01632740109279338, 0.10700169500584404, 0.0002424764291693767, -0.20913713916929233, 0.04930409031092293, 0.09983801851544909, 0.11244356171745393, -0.06515899671918575, -0.10972128637755911, -0.015318580717710709, 0.15638901568497574, 0.06144418170744622, 0.043973716993436766, 0.11893843819766685, -0.09494634277049314, -0.10211304068151447, 0.3965038215327594, -0.07194137008843461, -0.02136871173839878, 0.2036529391469365, -0.19050559724025704, -0.1497421080496645, 0.10993651188133906, 0.193726214631978, 0.10823669608820367, -0.16350352284522765, 0.030682104485566488, -0.0267489326134738, 0.17690027236110634, 0.07885160731772582, 0.041953966888185174, 0.30355011785609853, 0.14032591044626855, 0.04498405028910687, 0.10740481791651325, -0.20849972457142063, -0.04943169998781135, -0.27589033802764285, -0.16181741105133873, -0.14127376520924304, 0.06485883014587064, -0.022149570661120513, -0.1155133267381677, 0.4478227351964624, 0.190596634849768, 0.18570666367843472, -0.006261315942672944, 0.339832800699191, 0.1000677206417701, 0.03323359890621052, 0.06671158838327285, 0.31127212033607066, 0.14545231779023501, 0.17615246132050674, -0.14032581955285017, 0.07275897502054081, -0.002183552141542788]
|
1,803.06205
|
Random local complex dynamics
|
The study of the dynamics of an holomorphic map near a fixed point is a
central topic in complex dynamical systems. In this paper we will consider the
corresponding random setting: given a probability measure $\nu$ with compact
support on the space of germs of holomorphic maps fixing the origin, we study
the compositions $f_n\circ\cdots\circ f_1$, where each $f_i$ is chosen
independently with probability $\nu$. As in the deterministic case, the
stability of the family of the random iterates is mostly determined by the
linear part of the germs in the support of the measure. A particularly
interesting case occurs when all Lyapunov indices vanish, in which case
stability implies simultaneous linearizability of all germs in $supp(\nu)$.
|
math.CV math.DS
|
the study of the dynamics of an holomorphic map near a fixed point is a central topic in complex dynamical systems in this paper we will consider the corresponding random setting given a probability measure nu with compact support on the space of germs of holomorphic maps fixing the origin we study the compositions f_ncirccdotscirc f_1 where each f_i is chosen independently with probability nu as in the deterministic case the stability of the family of the random iterates is mostly determined by the linear part of the germs in the support of the measure a particularly interesting case occurs when all lyapunov indices vanish in which case stability implies simultaneous linearizability of all germs in suppnu
|
[['the', 'study', 'of', 'the', 'dynamics', 'of', 'an', 'holomorphic', 'map', 'near', 'a', 'fixed', 'point', 'is', 'a', 'central', 'topic', 'in', 'complex', 'dynamical', 'systems', 'in', 'this', 'paper', 'we', 'will', 'consider', 'the', 'corresponding', 'random', 'setting', 'given', 'a', 'probability', 'measure', 'nu', 'with', 'compact', 'support', 'on', 'the', 'space', 'of', 'germs', 'of', 'holomorphic', 'maps', 'fixing', 'the', 'origin', 'we', 'study', 'the', 'compositions', 'f_ncirccdotscirc', 'f_1', 'where', 'each', 'f_i', 'is', 'chosen', 'independently', 'with', 'probability', 'nu', 'as', 'in', 'the', 'deterministic', 'case', 'the', 'stability', 'of', 'the', 'family', 'of', 'the', 'random', 'iterates', 'is', 'mostly', 'determined', 'by', 'the', 'linear', 'part', 'of', 'the', 'germs', 'in', 'the', 'support', 'of', 'the', 'measure', 'a', 'particularly', 'interesting', 'case', 'occurs', 'when', 'all', 'lyapunov', 'indices', 'vanish', 'in', 'which', 'case', 'stability', 'implies', 'simultaneous', 'linearizability', 'of', 'all', 'germs', 'in', 'suppnu']]
|
[-0.20991966053843497, 0.08713371397373165, -0.05643019203258597, 0.028653891443315406, -0.005219591718733959, -0.0854547618088596, 0.04382283918498813, 0.31392533043804377, -0.27976453705974247, -0.14754162239639657, 0.11014938860038376, -0.26155497594938976, -0.15915618120571193, 0.16849842728368694, -0.0517862562171143, 0.06219221734158371, 0.002932784621320341, 0.0973400802432519, -0.06940579470651953, -0.2180451184986969, 0.41831158203599245, 0.009213655563476293, 0.22125812016184562, -0.01250665503675523, 0.0744685300666353, 0.02405609049145942, -0.04621304879369943, -0.008907741448163742, -0.13814028313626414, 0.08106657567069582, 0.24253251761521982, 0.08914225306766836, 0.2967874990411751, -0.32740639333167804, -0.1664621347885417, 0.20595428435050922, 0.10549615719153181, 0.006070646407771046, -0.010183548308787463, -0.2621053007087144, 0.1102216987931372, -0.09191310784334074, -0.18963786202341157, -0.038289481587707994, 0.03264352506755487, 0.06380380543920657, -0.2756072373088935, 0.010853162971223988, 0.10552821888072092, 0.10167434141849695, -0.07749451820779106, -0.07045320165546044, -0.061099369694357336, 0.12890637608816968, 0.043543184590121, 0.07729774341392129, 0.12460065675170526, -0.10687810166172035, -0.09747495172221375, 0.3863295990422004, -0.09521785798664813, -0.24656242389388827, 0.1816776509558701, -0.22494001293392932, -0.20284149172796828, 0.1239890161699251, 0.16661647625834397, 0.15658200151975388, -0.11222960055949996, 0.1647904238542137, -0.08195644255079652, 0.10939323500573189, 0.07059039174903022, 0.012546141463858278, 0.19440268185799536, 0.13025197618559975, 0.106554456545121, 0.15431956081529674, -0.040479914655746976, -0.09022213472458332, -0.34856121282538644, -0.17094394802925703, -0.16185165602592347, 0.07875019260884628, -0.0998106886572002, -0.1752782244073308, 0.42338757789896236, 0.09769310289487729, 0.2670159544957721, 0.10328303055696027, 0.2412531344462996, 0.15519189341904838, 0.004053070074271249, 0.06755244304304538, 0.18533118516206742, 0.1321873724480848, 0.02506978287483039, -0.17283946119208374, 0.059608171414583924, 0.09753705782248923]
|
1,803.06206
|
Big Data and Reliability Applications: The Complexity Dimension
|
Big data features not only large volumes of data but also data with
complicated structures. Complexity imposes unique challenges in big data
analytics. Meeker and Hong (2014, Quality Engineering, pp. 102-116) provided an
extensive discussion of the opportunities and challenges in big data and
reliability, and described engineering systems that can generate big data that
can be used in reliability analysis. Meeker and Hong (2014) focused on large
scale system operating and environment data (i.e., high-frequency multivariate
time series data), and provided examples on how to link such data as covariates
to traditional reliability responses such as time to failure, time to
recurrence of events, and degradation measurements. This paper intends to
extend that discussion by focusing on how to use data with complicated
structures to do reliability analysis. Such data types include high-dimensional
sensor data, functional curve data, and image streams. We first provide a
review of recent development in those directions, and then we provide a
discussion on how analytical methods can be developed to tackle the challenging
aspects that arise from the complexity feature of big data in reliability
applications. The use of modern statistical methods such as variable selection,
functional data analysis, scalar-on-image regression, spatio-temporal data
models, and machine learning techniques will also be discussed.
|
stat.AP
|
big data features not only large volumes of data but also data with complicated structures complexity imposes unique challenges in big data analytics meeker and hong 2014 quality engineering pp 102116 provided an extensive discussion of the opportunities and challenges in big data and reliability and described engineering systems that can generate big data that can be used in reliability analysis meeker and hong 2014 focused on large scale system operating and environment data ie highfrequency multivariate time series data and provided examples on how to link such data as covariates to traditional reliability responses such as time to failure time to recurrence of events and degradation measurements this paper intends to extend that discussion by focusing on how to use data with complicated structures to do reliability analysis such data types include highdimensional sensor data functional curve data and image streams we first provide a review of recent development in those directions and then we provide a discussion on how analytical methods can be developed to tackle the challenging aspects that arise from the complexity feature of big data in reliability applications the use of modern statistical methods such as variable selection functional data analysis scalaronimage regression spatiotemporal data models and machine learning techniques will also be discussed
|
[['big', 'data', 'features', 'not', 'only', 'large', 'volumes', 'of', 'data', 'but', 'also', 'data', 'with', 'complicated', 'structures', 'complexity', 'imposes', 'unique', 'challenges', 'in', 'big', 'data', 'analytics', 'meeker', 'and', 'hong', '2014', 'quality', 'engineering', 'pp', '102116', 'provided', 'an', 'extensive', 'discussion', 'of', 'the', 'opportunities', 'and', 'challenges', 'in', 'big', 'data', 'and', 'reliability', 'and', 'described', 'engineering', 'systems', 'that', 'can', 'generate', 'big', 'data', 'that', 'can', 'be', 'used', 'in', 'reliability', 'analysis', 'meeker', 'and', 'hong', '2014', 'focused', 'on', 'large', 'scale', 'system', 'operating', 'and', 'environment', 'data', 'ie', 'highfrequency', 'multivariate', 'time', 'series', 'data', 'and', 'provided', 'examples', 'on', 'how', 'to', 'link', 'such', 'data', 'as', 'covariates', 'to', 'traditional', 'reliability', 'responses', 'such', 'as', 'time', 'to', 'failure', 'time', 'to', 'recurrence', 'of', 'events', 'and', 'degradation', 'measurements', 'this', 'paper', 'intends', 'to', 'extend', 'that', 'discussion', 'by', 'focusing', 'on', 'how', 'to', 'use', 'data', 'with', 'complicated', 'structures', 'to', 'do', 'reliability', 'analysis', 'such', 'data', 'types', 'include', 'highdimensional', 'sensor', 'data', 'functional', 'curve', 'data', 'and', 'image', 'streams', 'we', 'first', 'provide', 'a', 'review', 'of', 'recent', 'development', 'in', 'those', 'directions', 'and', 'then', 'we', 'provide', 'a', 'discussion', 'on', 'how', 'analytical', 'methods', 'can', 'be', 'developed', 'to', 'tackle', 'the', 'challenging', 'aspects', 'that', 'arise', 'from', 'the', 'complexity', 'feature', 'of', 'big', 'data', 'in', 'reliability', 'applications', 'the', 'use', 'of', 'modern', 'statistical', 'methods', 'such', 'as', 'variable', 'selection', 'functional', 'data', 'analysis', 'scalaronimage', 'regression', 'spatiotemporal', 'data', 'models', 'and', 'machine', 'learning', 'techniques', 'will', 'also', 'be', 'discussed']]
|
[-0.07374062235668624, 0.0017150029044877067, -0.08880309987804279, 0.09834359721123921, -0.1322423218113657, -0.13237267654375712, 0.052706257129172554, 0.372917602715181, -0.2873054302091567, -0.34331132444472484, 0.20090493434383042, -0.31118710615555756, -0.16002227368657118, 0.2465217245184109, -0.1260718782342827, 0.10872205827035941, 0.1449739711186759, -0.038040752301290365, -0.024374209116033923, -0.2863575099148035, 0.3152646026182293, 0.08805598564056429, 0.3572414624571908, 0.03401461145348059, 0.04630836079167448, 0.020413137154089503, -0.08249772256329799, 0.01685587997557237, -0.12332818605290623, 0.14307785280218993, 0.35643417962856244, 0.25070927847096197, 0.2812443161808635, -0.4753840644452094, -0.226329456295039, 0.07992349480851911, 0.11740121900892028, 0.06776016318830304, -0.0643866156578252, -0.2874121176920688, 0.048984812392378584, -0.13212052265995367, -0.08550936265517241, -0.18041241626689533, 0.014666653603154164, 0.03707558969500287, -0.25829177069961307, 0.05283376772618235, 0.017730359470498606, 0.10030795389768453, -0.009082323400294766, -0.08877385192933546, 0.016555879721776225, 0.13669546946766786, 0.07685045284093715, 0.002102724549611314, 0.10385521105938376, -0.11070603824219478, -0.14667093181588614, 0.3678884752981293, -0.04210632721906922, -0.16491605111290342, 0.2251464090468989, -0.09034102469405088, -0.21422724323481537, 0.07343947259001792, 0.28165042961560316, 0.01334635602520743, -0.17511325030444333, 0.05300437696331965, 0.04657871549044593, 0.18332747387019202, 0.013707945593453657, 0.02479855881280785, 0.13593913864147347, 0.21281112494985932, 0.001914405327764913, 0.06523834034081889, -0.10900805666348717, -0.05452526930737524, -0.24655157529140034, -0.11027122390805744, -0.1757516429777472, 0.0009719743489208318, -0.0840065120890778, -0.13070106349186972, 0.3626062121296015, 0.2064154298971586, 0.22117994256013146, 0.0016220112447626889, 0.33384313884352407, 0.05056474749177981, 0.07588254553803171, 0.0706110434738758, 0.13607144488140385, 0.0442160178958707, 0.1703929834273787, -0.12078925496238159, 0.04789711828869678, -0.057420932611141604]
|
1,803.06207
|
ALMA detection of a tentative nearly edge-on rotating disk around the
nearby AGB star R~Doradus
|
A spectral scan of the circumstellar environment of the asymptotic giant
branch (AGB) star R~Doradus was taken with ALMA in cycle 2 at frequencies
between 335 and 362 GHz and with a spatial resolution of $\sim$150
milliarcseconds. Many molecular lines show a spatial offset between the blue
and red shifted emission in the innermost regions of the wind. The
position-velocity diagrams of this feature, in combination with previous SPHERE
data and theoretical work point towards the presence of a compact
differentially rotating disk, orientated nearly edge-on. We model the $^{\rm
28}$SiO ($v=1,~J=8\to7$) emission with a disk model. We estimate the disk mass
and angular momentum to be $3 \times 10^{-6}$ Solar masses and $5 \times
10^{40}\ {\rm m^2 kg/s}$. The latter presents an `angular momentum problem'
that may be solved by assuming that the disk is the result of wind-companion
interactions with a companion of at least 2.5 earth masses, located at 6 AU,
the tentatively determined location of the disk's inner rim. An isolated clump
of emission is detected to the south-east with a velocity that is high compared
to the previously determined terminal velocity of the wind. Its position and
mean velocity suggest that it may be associated with a companion planet,
located at the disk's inner rim.
|
astro-ph.SR
|
a spectral scan of the circumstellar environment of the asymptotic giant branch agb star rdoradus was taken with alma in cycle 2 at frequencies between 335 and 362 ghz and with a spatial resolution of sim150 milliarcseconds many molecular lines show a spatial offset between the blue and red shifted emission in the innermost regions of the wind the positionvelocity diagrams of this feature in combination with previous sphere data and theoretical work point towards the presence of a compact differentially rotating disk orientated nearly edgeon we model the rm 28sio v1j8to7 emission with a disk model we estimate the disk mass and angular momentum to be 3 times 106 solar masses and 5 times 1040 rm m2 kgs the latter presents an angular momentum problem that may be solved by assuming that the disk is the result of windcompanion interactions with a companion of at least 25 earth masses located at 6 au the tentatively determined location of the disks inner rim an isolated clump of emission is detected to the southeast with a velocity that is high compared to the previously determined terminal velocity of the wind its position and mean velocity suggest that it may be associated with a companion planet located at the disks inner rim
|
[['a', 'spectral', 'scan', 'of', 'the', 'circumstellar', 'environment', 'of', 'the', 'asymptotic', 'giant', 'branch', 'agb', 'star', 'rdoradus', 'was', 'taken', 'with', 'alma', 'in', 'cycle', '2', 'at', 'frequencies', 'between', '335', 'and', '362', 'ghz', 'and', 'with', 'a', 'spatial', 'resolution', 'of', 'sim150', 'milliarcseconds', 'many', 'molecular', 'lines', 'show', 'a', 'spatial', 'offset', 'between', 'the', 'blue', 'and', 'red', 'shifted', 'emission', 'in', 'the', 'innermost', 'regions', 'of', 'the', 'wind', 'the', 'positionvelocity', 'diagrams', 'of', 'this', 'feature', 'in', 'combination', 'with', 'previous', 'sphere', 'data', 'and', 'theoretical', 'work', 'point', 'towards', 'the', 'presence', 'of', 'a', 'compact', 'differentially', 'rotating', 'disk', 'orientated', 'nearly', 'edgeon', 'we', 'model', 'the', 'rm', '28sio', 'v1j8to7', 'emission', 'with', 'a', 'disk', 'model', 'we', 'estimate', 'the', 'disk', 'mass', 'and', 'angular', 'momentum', 'to', 'be', '3', 'times', '106', 'solar', 'masses', 'and', '5', 'times', '1040', 'rm', 'm2', 'kgs', 'the', 'latter', 'presents', 'an', 'angular', 'momentum', 'problem', 'that', 'may', 'be', 'solved', 'by', 'assuming', 'that', 'the', 'disk', 'is', 'the', 'result', 'of', 'windcompanion', 'interactions', 'with', 'a', 'companion', 'of', 'at', 'least', '25', 'earth', 'masses', 'located', 'at', '6', 'au', 'the', 'tentatively', 'determined', 'location', 'of', 'the', 'disks', 'inner', 'rim', 'an', 'isolated', 'clump', 'of', 'emission', 'is', 'detected', 'to', 'the', 'southeast', 'with', 'a', 'velocity', 'that', 'is', 'high', 'compared', 'to', 'the', 'previously', 'determined', 'terminal', 'velocity', 'of', 'the', 'wind', 'its', 'position', 'and', 'mean', 'velocity', 'suggest', 'that', 'it', 'may', 'be', 'associated', 'with', 'a', 'companion', 'planet', 'located', 'at', 'the', 'disks', 'inner', 'rim']]
|
[-0.10838373643059311, 0.09828626284511323, -0.044103533390893686, 0.012892566311425093, -0.05301378023302281, -0.0669069058837702, 0.016547242044538692, 0.42991208112326224, -0.19797507200276498, -0.34758555294792864, 0.08502302504007385, -0.2645953056011079, 0.006823325002732448, 0.15499531649781959, -0.03242819399569148, -0.06556886873755757, 0.07815742396225406, -0.04338689125030513, -0.0646128952615683, -0.17328846671254092, 0.27382520745240674, 0.07955146097051709, 0.10032911754240269, -0.002014021230029203, 0.07655414566453907, -0.12900903491879215, -0.0117826406283817, -0.0303263611673121, -0.14353749767164609, 0.08547858202409288, 0.2066860954425689, 0.08370680934164655, 0.20150282936269678, -0.3462058213957842, -0.17248290197941776, 0.039703662574723145, 0.19007765050473566, 0.0028427792105661788, -0.008445492610425332, -0.26268924810757166, 0.09900377545666607, -0.17529300671148285, -0.23645787226972012, 0.12671164411642016, 0.06588747055474489, -0.014633390824153011, -0.24161872464335626, 0.13155766894392992, 0.05268345368803357, 0.11780771112872584, -0.08743072691506251, -0.13361446944387081, -0.11323262971335492, 0.06412187606323475, 0.02733976292482393, 0.1215591671233232, 0.194291142962765, -0.09810510952000907, -0.03629396750888639, 0.37253668149685765, -0.0926807733817287, -0.06871674862911853, 0.2271076993125936, -0.25679879009966616, -0.11935257498407736, 0.21656589376051788, 0.14381995829551117, 0.1330761584939192, -0.12186946233190092, -0.006928386600577871, -0.045021501577859696, 0.21963995217600418, 0.10695098536224037, 0.03308407900346542, 0.34722479600639305, 0.1027968235714316, 0.04915327696295023, 0.11312175932557407, -0.283295840173701, -0.06178227506335015, -0.2388479057918775, -0.10808535227507064, -0.1450752055886593, 0.05186368314918256, -0.15492718746180698, -0.08355820990855926, 0.3307339224856401, 0.06954944306413152, 0.2784999815103483, 0.01949503962940352, 0.3202503773446784, 0.09760137335346687, 0.097950416055265, 0.17818653714226712, 0.30731592069330493, 0.17442303355715738, 0.10781663868369327, -0.23739794123263191, 0.026870829980046564, -0.005023644733184202]
|
1,803.06208
|
3$\times$3 transfer matrix modelling of integrated optical devices
|
Unlike common devices based on ring resonators, the structure in Fig. 1.a
involves not only 2$\times$2 couplers but also a 3$\times$3 coupler, which
means that a 3$\times$3 transfer matrix approach is required to model the
system. To the best of our knowledge, no such a model has been developed
before. The only model available in the literature is based on a clever
recursive 2$\times$2 transfer matrix model [1], which requires lengthy
calculations that depend on the chosen boundary conditions and on the
particular geometry chosen. The scope of this document is instead to show how
to generalize the standard 2$\times$2 transfer matrix approach to cover any
system with 3$\times$3 couplers, and calculate the transfer matrix of any
complicated system just as a product of simple 3$\times$3 matrices.
|
physics.optics physics.app-ph
|
unlike common devices based on ring resonators the structure in fig 1a involves not only 2times2 couplers but also a 3times3 coupler which means that a 3times3 transfer matrix approach is required to model the system to the best of our knowledge no such a model has been developed before the only model available in the literature is based on a clever recursive 2times2 transfer matrix model 1 which requires lengthy calculations that depend on the chosen boundary conditions and on the particular geometry chosen the scope of this document is instead to show how to generalize the standard 2times2 transfer matrix approach to cover any system with 3times3 couplers and calculate the transfer matrix of any complicated system just as a product of simple 3times3 matrices
|
[['unlike', 'common', 'devices', 'based', 'on', 'ring', 'resonators', 'the', 'structure', 'in', 'fig', '1a', 'involves', 'not', 'only', '2times2', 'couplers', 'but', 'also', 'a', '3times3', 'coupler', 'which', 'means', 'that', 'a', '3times3', 'transfer', 'matrix', 'approach', 'is', 'required', 'to', 'model', 'the', 'system', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'no', 'such', 'a', 'model', 'has', 'been', 'developed', 'before', 'the', 'only', 'model', 'available', 'in', 'the', 'literature', 'is', 'based', 'on', 'a', 'clever', 'recursive', '2times2', 'transfer', 'matrix', 'model', '1', 'which', 'requires', 'lengthy', 'calculations', 'that', 'depend', 'on', 'the', 'chosen', 'boundary', 'conditions', 'and', 'on', 'the', 'particular', 'geometry', 'chosen', 'the', 'scope', 'of', 'this', 'document', 'is', 'instead', 'to', 'show', 'how', 'to', 'generalize', 'the', 'standard', '2times2', 'transfer', 'matrix', 'approach', 'to', 'cover', 'any', 'system', 'with', '3times3', 'couplers', 'and', 'calculate', 'the', 'transfer', 'matrix', 'of', 'any', 'complicated', 'system', 'just', 'as', 'a', 'product', 'of', 'simple', '3times3', 'matrices']]
|
[-0.09188487821952514, 0.043077664904472394, -0.04250512756113931, 0.005437840144773286, -0.09547732193132966, -0.18941339161467013, 0.029654430973482884, 0.41185881256118534, -0.22680506271522816, -0.27494096178488114, 0.13124139556444916, -0.25456845041687093, -0.20682035588226685, 0.18210694401920957, -0.022137035480077106, 0.05008657312929982, 0.08264090223824531, 0.06272725460090213, -0.1410701287210017, -0.2030401319232366, 0.3428224821714318, 0.04684552634098223, 0.28219454185157195, 0.03451093946084908, 0.12627876074306343, 0.028156281043738712, 0.0024097810176707157, -0.05958232617988361, -0.06740426620173792, 0.12058173725381494, 0.19231973057906107, 0.11759657420650653, 0.21740144927707303, -0.44449725282180497, -0.20591661199106007, 0.08053243857639747, 0.12814476611606013, 0.11241667656645941, -0.030008777715705745, -0.20789463749507398, 0.07384402380420232, -0.21566028147935867, -0.0747339541337033, -0.06349210295180871, -0.004298966946300324, -0.01521448032769162, -0.3075088966866097, -0.0069688342341614196, 0.06124587599224755, -0.014265742092945625, 0.004612570577534832, -0.16999093608245047, -8.985177452463334e-05, 0.11429752022995958, -0.05319568312609583, -0.01793133406569873, 0.12086498057543058, -0.04551752201853481, -0.07142620224608329, 0.3812398881776126, -0.04107787957741314, -0.2584523403720094, 0.1447018814093514, -0.11883985662950187, -0.07112589766322745, 0.10979181814088126, 0.13628985327265158, 0.13260923271749434, -0.15591583765473027, 0.08742177854548758, -0.08705139499227334, 0.26438411886943136, 0.04582923179213691, -0.03220913771954255, 0.14030321172665894, 0.17380467872502003, 0.053047781142151335, 0.09828301646754029, 7.988070137798786e-05, -0.10577776957684615, -0.29245798791370053, -0.11265230581428357, -0.27531844318118387, 0.04293632894714535, -0.07554905084177199, -0.1984359739040296, 0.4162203485923489, 0.13897629920393229, 0.21475057035141926, -0.014645080765943945, 0.3033491644319, 0.08808686019207432, 0.1458394369990455, 0.035466609058872334, 0.20320997014641762, 0.14389511813064965, 0.09875780153344935, -0.19096010124886512, 0.06633078615643143, 0.0748463618939405]
|
1,803.06209
|
Highly sensitive NO2 sensors by pulsed laser deposition on graphene
|
Graphene as a single-atomic-layer material is fully exposed to environment
and has therefore a great potential for creating of sensitive gas sensors.
However, in order to realize this potential for different polluting gases,
graphene has to be functionalized - adsorption centers of different type and
with high affinity to target gases have to be created at its surface. In this
present work, modification of graphene by small amounts of laser ablated
materials is introduced for this purpose as a versatile and precise tool. The
approach was demonstrated with two very different materials chosen for pulsed
laser deposition (PLD), a metal (Ag) and a dielectric oxide (ZrO2). It was
shown that the gas response and its recovery rate can be significantly enhanced
by choosing the PLD target material and deposition conditions. The response to
NO2 gas in air was amplified up to 40 times in case of PLD-modified graphene in
comparison with pristine graphene and reached 7-8% at 40 ppb of NO2 and 20-30%
at 1 ppm of N2. These results were obtained after PLD in gas environment (5 x
10-2 mbar oxygen or nitrogen) and atomic areal densities of deposited materials
of were about 10 15 cm-2. The ultimate level of NO2 detection in air, as
extrapolated from the experimental data obtained at room temperature under mild
UV-excitation, was below 1 ppb.
|
cond-mat.mtrl-sci
|
graphene as a singleatomiclayer material is fully exposed to environment and has therefore a great potential for creating of sensitive gas sensors however in order to realize this potential for different polluting gases graphene has to be functionalized adsorption centers of different type and with high affinity to target gases have to be created at its surface in this present work modification of graphene by small amounts of laser ablated materials is introduced for this purpose as a versatile and precise tool the approach was demonstrated with two very different materials chosen for pulsed laser deposition pld a metal ag and a dielectric oxide zro2 it was shown that the gas response and its recovery rate can be significantly enhanced by choosing the pld target material and deposition conditions the response to no2 gas in air was amplified up to 40 times in case of pldmodified graphene in comparison with pristine graphene and reached 78 at 40 ppb of no2 and 2030 at 1 ppm of n2 these results were obtained after pld in gas environment 5 x 102 mbar oxygen or nitrogen and atomic areal densities of deposited materials of were about 10 15 cm2 the ultimate level of no2 detection in air as extrapolated from the experimental data obtained at room temperature under mild uvexcitation was below 1 ppb
|
[['graphene', 'as', 'a', 'singleatomiclayer', 'material', 'is', 'fully', 'exposed', 'to', 'environment', 'and', 'has', 'therefore', 'a', 'great', 'potential', 'for', 'creating', 'of', 'sensitive', 'gas', 'sensors', 'however', 'in', 'order', 'to', 'realize', 'this', 'potential', 'for', 'different', 'polluting', 'gases', 'graphene', 'has', 'to', 'be', 'functionalized', 'adsorption', 'centers', 'of', 'different', 'type', 'and', 'with', 'high', 'affinity', 'to', 'target', 'gases', 'have', 'to', 'be', 'created', 'at', 'its', 'surface', 'in', 'this', 'present', 'work', 'modification', 'of', 'graphene', 'by', 'small', 'amounts', 'of', 'laser', 'ablated', 'materials', 'is', 'introduced', 'for', 'this', 'purpose', 'as', 'a', 'versatile', 'and', 'precise', 'tool', 'the', 'approach', 'was', 'demonstrated', 'with', 'two', 'very', 'different', 'materials', 'chosen', 'for', 'pulsed', 'laser', 'deposition', 'pld', 'a', 'metal', 'ag', 'and', 'a', 'dielectric', 'oxide', 'zro2', 'it', 'was', 'shown', 'that', 'the', 'gas', 'response', 'and', 'its', 'recovery', 'rate', 'can', 'be', 'significantly', 'enhanced', 'by', 'choosing', 'the', 'pld', 'target', 'material', 'and', 'deposition', 'conditions', 'the', 'response', 'to', 'no2', 'gas', 'in', 'air', 'was', 'amplified', 'up', 'to', '40', 'times', 'in', 'case', 'of', 'pldmodified', 'graphene', 'in', 'comparison', 'with', 'pristine', 'graphene', 'and', 'reached', '78', 'at', '40', 'ppb', 'of', 'no2', 'and', '2030', 'at', '1', 'ppm', 'of', 'n2', 'these', 'results', 'were', 'obtained', 'after', 'pld', 'in', 'gas', 'environment', '5', 'x', '102', 'mbar', 'oxygen', 'or', 'nitrogen', 'and', 'atomic', 'areal', 'densities', 'of', 'deposited', 'materials', 'of', 'were', 'about', '10', '15', 'cm2', 'the', 'ultimate', 'level', 'of', 'no2', 'detection', 'in', 'air', 'as', 'extrapolated', 'from', 'the', 'experimental', 'data', 'obtained', 'at', 'room', 'temperature', 'under', 'mild', 'uvexcitation', 'was', 'below', '1', 'ppb']]
|
[-0.03401600736348579, 0.1943879274600377, -0.024620862192895315, -0.036230542750701686, 0.07940929800327272, -0.16031265620633398, 0.06987744519597591, 0.44621459455931023, -0.2126671873547613, -0.37690186226680944, 0.07074973053303144, -0.3143916524729806, -0.04334584444859086, 0.19253021072847215, -0.03703796423197677, 0.0559502665201185, 0.012782083115153458, -0.07019802114445733, -0.06553641469090259, -0.2627532087015541, 0.21919045945603963, 0.12035791035826619, 0.28656886253701563, 0.13549070440091354, 0.08711039609558557, -0.0676865244874854, 0.07035040945988404, -0.019877593700676204, -0.11383413614989732, 0.0864607480686311, 0.27839225733567124, -0.044972343424007674, 0.24354318966110955, -0.4643083896624035, -0.23722501209996572, 0.005748499306046391, 0.0811436745650709, 0.09964734904314433, -0.12519613742726307, -0.25024328480865893, 0.10447442324961786, -0.15981428712376788, -0.14378560593534584, -0.027043591855204406, 0.026243116447200242, 0.0006072565059488019, -0.25208670134415856, 0.059094747701993626, 0.0010018607624912778, 0.1006114319122086, -0.10057727941184318, -0.1438248937664613, -0.07600006275623186, 0.054982921295718516, 0.012361269774867996, 0.08362406281529518, 0.2732725526827077, -0.10229179317016818, 0.0025198375806212425, 0.41870073036856303, -0.10018415611607265, -0.08115754498075269, 0.2562029591015196, -0.18316066124025715, -0.0729356681264963, 0.2220627256184306, 0.13590036419785867, 0.09475260959368319, -0.189696460924022, 0.009426118761086283, 0.016665730662335596, 0.18761864468693462, 0.16416667895625478, 0.02410914210738725, 0.1980606239909927, 0.22746409460493963, 0.03918387790074462, 0.1283836269716107, -0.1289285185316969, 0.054243774916636484, -0.1594200661473963, -0.1885314813419564, -0.17675378564192348, 0.08472593936252676, -0.058121266480804776, -0.09359528168174226, 0.35503854896005704, 0.13547103993007786, 0.16544632571239076, -0.0756027756394929, 0.24987629368225087, 0.0684231474414068, 0.0741816863670656, -0.0112116209424811, 0.2591898705933634, 0.13561178005160127, 0.12986549248835966, -0.16768018114508118, 0.09954807727111793, -0.03354764577388321]
|
1,803.0621
|
On the dimension datum of a subgroup. II
|
This paper studies three aspects around dimension datum: (1), a
generalization of the dimension datum, which we call the tau-dimension datum;
(2), dimension data of disconnected subgroups; (3), compactness of isospectral
sets of normal homogeneous spaces.
|
math.GR math.DG math.RT
|
this paper studies three aspects around dimension datum 1 a generalization of the dimension datum which we call the taudimension datum 2 dimension data of disconnected subgroups 3 compactness of isospectral sets of normal homogeneous spaces
|
[['this', 'paper', 'studies', 'three', 'aspects', 'around', 'dimension', 'datum', '1', 'a', 'generalization', 'of', 'the', 'dimension', 'datum', 'which', 'we', 'call', 'the', 'taudimension', 'datum', '2', 'dimension', 'data', 'of', 'disconnected', 'subgroups', '3', 'compactness', 'of', 'isospectral', 'sets', 'of', 'normal', 'homogeneous', 'spaces']]
|
[-0.14635951473776784, 0.1098774606095893, -0.06881146162216152, 0.10262343392241746, -0.081588260683098, -0.12302341297534959, -0.01681942117200898, 0.2697006274546896, -0.28926582166126796, -0.17295671199847545, 0.17119720332058413, -0.31051143381212437, -0.08264104766505105, 0.16209481305309703, -0.14036222933126347, -0.03191319749291454, 0.1239628221307482, 0.12051361410745552, -0.11551746922944273, -0.30577269904315474, 0.580002354165273, -0.1077441604807973, 0.28313878625631334, 0.012032623322946684, 0.11563881206924893, -0.05293848767344441, -0.018218613056732075, -0.005919583168412958, -0.21696572118837917, 0.1624052066888128, 0.24936426989734173, 0.12557893416046031, 0.28576871284416744, -0.295835353327649, -0.16450663192995957, 0.21889610407607896, 0.11940195730754308, -0.000615180965646037, 0.02515935312424387, -0.27918378142639994, 0.09467451415423836, -0.1522756808038269, -0.3205021884159318, -0.059539976636213916, 0.0956068392843008, -0.04288539796003273, -0.2554993192532233, 0.0469126481828945, 0.15897282361984252, 0.13074128526869963, -0.13936002472681658, -0.10085049686687333, -0.031157702500266688, 0.059239664251383925, 0.015215063467621803, 0.033247105218470095, 0.06072229129910868, -0.06741274661118431, -0.11474277129662888, 0.32938579870387913, 0.023428193133856568, -0.2503184625080654, 0.17658763165984834, -0.18932674825191498, -0.19535445017474037, 0.09461553022265434, 0.18210516635860716, 0.10303627380302974, -0.05553347042628697, 0.16204758734841432, -0.11900754872310375, 0.13527333108442172, 0.13469718920865228, -0.008923585712909698, 0.003387211316398212, 0.1712146715394088, 0.10456379401896682, 0.10817493138435696, -0.04289561382361821, 0.007678408383591366, -0.37083462423511915, -0.1403248659734215, -0.16424038487353496, 0.11616800890437194, -0.1908767255289214, -0.17794893181749752, 0.41016744407159944, 0.04809499819363867, 0.19374950911317554, 0.07497958700904357, 0.22498191094824246, -0.029352885617741516, 0.037973269607339585, 0.10572755363370691, 0.047284912371209686, 0.16724144885582584, 0.032918443690453256, -0.0720210590033925, -0.0862024397190128, 0.1567866380725588]
|
1,803.06211
|
A Numerical Model for the Construction of Finite Blaschke Products with
Preassigned Distinct Critical Points
|
We present a numerical model for determining a finite Blaschke product of
degree $n+1$ having $n$ preassigned distinct critical points $z_1,\dots,z_n$ in
the complex (open) unit disk $\mathbb{D}$. The Blaschke product is uniquely
determined up to postcomposition with conformal automorphisms of $\mathbb{D}$.
The proposed method is based on the construction of a sparse nonlinear system
where the data dependency is isolated to two vectors and on a certain
transformation of the critical points. The efficiency and accuracy of the
method is illustrated in several examples.
|
math.NA math.CV
|
we present a numerical model for determining a finite blaschke product of degree n1 having n preassigned distinct critical points z_1dotsz_n in the complex open unit disk mathbbd the blaschke product is uniquely determined up to postcomposition with conformal automorphisms of mathbbd the proposed method is based on the construction of a sparse nonlinear system where the data dependency is isolated to two vectors and on a certain transformation of the critical points the efficiency and accuracy of the method is illustrated in several examples
|
[['we', 'present', 'a', 'numerical', 'model', 'for', 'determining', 'a', 'finite', 'blaschke', 'product', 'of', 'degree', 'n1', 'having', 'n', 'preassigned', 'distinct', 'critical', 'points', 'z_1dotsz_n', 'in', 'the', 'complex', 'open', 'unit', 'disk', 'mathbbd', 'the', 'blaschke', 'product', 'is', 'uniquely', 'determined', 'up', 'to', 'postcomposition', 'with', 'conformal', 'automorphisms', 'of', 'mathbbd', 'the', 'proposed', 'method', 'is', 'based', 'on', 'the', 'construction', 'of', 'a', 'sparse', 'nonlinear', 'system', 'where', 'the', 'data', 'dependency', 'is', 'isolated', 'to', 'two', 'vectors', 'and', 'on', 'a', 'certain', 'transformation', 'of', 'the', 'critical', 'points', 'the', 'efficiency', 'and', 'accuracy', 'of', 'the', 'method', 'is', 'illustrated', 'in', 'several', 'examples']]
|
[-0.192466872666652, 0.04588029563560018, -0.03172656562223676, -0.010535151470408198, -0.046426092978522536, -0.10427187198642753, 0.04075258382363245, 0.34927324059286285, -0.29418802438747316, -0.23589983289795263, 0.13193228127091147, -0.29173241857261883, -0.15262137376564733, 0.20222309045216424, -0.03413775027175212, 0.10094555270015484, 0.024876465731592492, 0.09866082342618722, -0.0997960294674461, -0.28232212823682595, 0.4001036621962807, 0.002425368531562743, 0.22912202880806512, 0.03803720126216788, 0.13255617932909877, -0.037508632973878686, -0.02124835648629371, -0.024930775980465114, -0.13371983296903117, 0.1308665048951904, 0.23112400028011984, 0.12024718034081161, 0.25762161142414525, -0.3375255646450179, -0.15856951299099906, 0.11952568799079884, 0.14822703245140256, -0.014372347554724132, -0.035003653184200324, -0.23359641565808228, 0.09236663903686262, -0.1148572116911791, -0.15667805510262647, -0.07149039795400486, 0.030962704902603513, 0.002823968271037475, -0.3105664142917487, 0.03530793454389086, 0.07368201001857717, 0.11031622784433975, -0.05486724822826329, -0.08447481999922145, -0.046179686983426414, 0.11949636999495505, -0.015470115020261369, 0.07477153676639621, 0.10872091508714393, -0.06477577327418008, -0.09502209176398105, 0.37717780989727806, -0.02991562494952675, -0.2673132300243153, 0.16264501526962877, -0.18167646269180945, -0.1354564700186962, 0.12551170511038176, 0.15643470896230566, 0.162068460713185, -0.08560299912157159, 0.13793574737445896, -0.07627147036449362, 0.10822541849172142, 0.07980908333723034, -0.05637303191802597, 0.1521142838589315, 0.16140312957577407, 0.06274592633902405, 0.17089392207673795, -0.01940440071103651, -0.08461730654484459, -0.3255840928648554, -0.15294842480528, -0.21345547060731665, 0.06123063935609978, -0.17279984459933725, -0.20373740863232387, 0.43617034925236586, 0.084379347913498, 0.22845656400369035, 0.04073159553531912, 0.2711145393993883, 0.10219267679245345, 0.0697015826257744, 0.07396093260363809, 0.1385033411483857, 0.15306693829950832, -0.009522200879430221, -0.19266631875541948, 0.0012875368452763983, 0.1452222900864269]
|
1,803.06212
|
Hurwitz Stacks of Groups Extensions and Irreducibility
|
We study the irreducible components of special loci of curves whose group of
symmetries is given as certain group extension. We introduce some relative
Hurwitz data, which we show by using mixed \'etale cohomology theory,
identifies some irreducible components for rational and normal non-abelian
special loci and Hurwitz spaces. A heuristic, that is supported by three
classes of examples, provides an additional context for building further
irreducible loci.
|
math.AG
|
we study the irreducible components of special loci of curves whose group of symmetries is given as certain group extension we introduce some relative hurwitz data which we show by using mixed etale cohomology theory identifies some irreducible components for rational and normal nonabelian special loci and hurwitz spaces a heuristic that is supported by three classes of examples provides an additional context for building further irreducible loci
|
[['we', 'study', 'the', 'irreducible', 'components', 'of', 'special', 'loci', 'of', 'curves', 'whose', 'group', 'of', 'symmetries', 'is', 'given', 'as', 'certain', 'group', 'extension', 'we', 'introduce', 'some', 'relative', 'hurwitz', 'data', 'which', 'we', 'show', 'by', 'using', 'mixed', 'etale', 'cohomology', 'theory', 'identifies', 'some', 'irreducible', 'components', 'for', 'rational', 'and', 'normal', 'nonabelian', 'special', 'loci', 'and', 'hurwitz', 'spaces', 'a', 'heuristic', 'that', 'is', 'supported', 'by', 'three', 'classes', 'of', 'examples', 'provides', 'an', 'additional', 'context', 'for', 'building', 'further', 'irreducible', 'loci']]
|
[-0.2139901864575222, 0.08265242678552408, -0.11820042535991353, 0.08724960731684833, -0.12845254826414235, -0.1449495984501589, 0.03359381855903741, 0.3356749327469836, -0.2850592211984536, -0.20076983756221392, 0.12113592470311285, -0.2039161616908934, -0.22497742379303365, 0.2326513023923754, -0.15430462836657705, -0.044934965670108795, 0.023601528640617344, 0.058889656587887335, -0.09513703374164727, -0.30520236852017285, 0.47075808132478203, -0.07418665465186625, 0.2212334301404874, 0.00026971125728724636, 0.14799804054371848, 0.039436340153984284, -0.06443259563050507, -0.03298496691208771, -0.12144313322824019, 0.16676384166759603, 0.3686818306108334, 0.09994946096969001, 0.17743964909630663, -0.3465518957853098, -0.16014521656667485, 0.25043222962823863, 0.14067725183935287, 0.03155968443880899, -0.024455373517840225, -0.25952231705955725, 0.08041868206825764, -0.16002051819882848, -0.19114075078259168, -0.17088245251215994, 0.025929899064495283, 0.05700817194370115, -0.18771579553482726, -0.020238836720476255, 0.046235637352925976, 0.18681973231244176, -0.07725993750671692, -0.1512808543835383, -0.08433166094233885, 0.08099822833045277, 0.038229985320118856, -0.011444919369430007, 0.09077912218558862, -0.10037017471211798, -0.14614529268103926, 0.35678169914685626, -0.04810920868561987, -0.24583930848166347, 0.14639206307337566, -0.10618629820151802, -0.23950094729661942, 0.11931510283680194, 0.08015397217069917, 0.1422892913208617, -0.038944211487165266, 0.1429577380990582, -0.1251416632987778, 0.060417269325732964, 0.06167144888262127, -0.02666522567297387, 0.1619163735988824, 0.0901645939961514, 0.034245876901610135, 0.14979575843009277, -0.002115491921465625, -0.060094407214338015, -0.4045740536359303, -0.22139064064386355, -0.08928693631006514, 0.04349634182118975, -0.1281035334613989, -0.17632068452589653, 0.44488882204955993, 0.03238143907476436, 0.1805098002009532, 0.13885920108741096, 0.197984239387819, 0.05302091519286692, 0.040208768483032196, 0.023923392202157306, 0.0655509298093795, 0.22424481694778317, -0.1419508332550964, -0.14259679478538387, -0.017346360665910384, 0.20477485864916267]
|
1,803.06213
|
Smartphone based Driving Style Classification Using Features Made by
Discrete Wavelet Transform
|
Smartphones consist of different sensors, which provide a platform for data
acquisition in many scientific researches such as driving style identification
systems. In the present paper, smartphone data are used to evaluate the driving
styles based on maneuvers analysis. The data obtained for each maneuver is the
speed of the vehicle steering and the vehicle's direct and lateral
acceleration. To classify the drivers based on their driving style,
machine-learning algorithms can be used on these data. However, these data
usually contains more information than it is needed and cause a bad effect on
the learning accuracy. In addition, they may transfer some wrong information to
the learning algorithm. Thus, we used Haar discrete wavelet transformation to
remove noise effects. Then, we get the discrete wavelet transformation with
four levels from smartphone sensors data, which include low-to-high
frequencies, respectively. The obtained features vector for each maneuver
includes the raw signal variance as well as the variance of the wavelet
transform components. On these vectors, we use the k-nearest neighbors
algorithm for features selection. Then, we use SVM, RBF and MLP neural networks
on these features to separate braking and dangerous speed maneuvers from the
safe ones as well as dangerous turning, U-turn and lane-changing maneuvers. The
results are very interesting.
|
cs.HC
|
smartphones consist of different sensors which provide a platform for data acquisition in many scientific researches such as driving style identification systems in the present paper smartphone data are used to evaluate the driving styles based on maneuvers analysis the data obtained for each maneuver is the speed of the vehicle steering and the vehicles direct and lateral acceleration to classify the drivers based on their driving style machinelearning algorithms can be used on these data however these data usually contains more information than it is needed and cause a bad effect on the learning accuracy in addition they may transfer some wrong information to the learning algorithm thus we used haar discrete wavelet transformation to remove noise effects then we get the discrete wavelet transformation with four levels from smartphone sensors data which include lowtohigh frequencies respectively the obtained features vector for each maneuver includes the raw signal variance as well as the variance of the wavelet transform components on these vectors we use the knearest neighbors algorithm for features selection then we use svm rbf and mlp neural networks on these features to separate braking and dangerous speed maneuvers from the safe ones as well as dangerous turning uturn and lanechanging maneuvers the results are very interesting
|
[['smartphones', 'consist', 'of', 'different', 'sensors', 'which', 'provide', 'a', 'platform', 'for', 'data', 'acquisition', 'in', 'many', 'scientific', 'researches', 'such', 'as', 'driving', 'style', 'identification', 'systems', 'in', 'the', 'present', 'paper', 'smartphone', 'data', 'are', 'used', 'to', 'evaluate', 'the', 'driving', 'styles', 'based', 'on', 'maneuvers', 'analysis', 'the', 'data', 'obtained', 'for', 'each', 'maneuver', 'is', 'the', 'speed', 'of', 'the', 'vehicle', 'steering', 'and', 'the', 'vehicles', 'direct', 'and', 'lateral', 'acceleration', 'to', 'classify', 'the', 'drivers', 'based', 'on', 'their', 'driving', 'style', 'machinelearning', 'algorithms', 'can', 'be', 'used', 'on', 'these', 'data', 'however', 'these', 'data', 'usually', 'contains', 'more', 'information', 'than', 'it', 'is', 'needed', 'and', 'cause', 'a', 'bad', 'effect', 'on', 'the', 'learning', 'accuracy', 'in', 'addition', 'they', 'may', 'transfer', 'some', 'wrong', 'information', 'to', 'the', 'learning', 'algorithm', 'thus', 'we', 'used', 'haar', 'discrete', 'wavelet', 'transformation', 'to', 'remove', 'noise', 'effects', 'then', 'we', 'get', 'the', 'discrete', 'wavelet', 'transformation', 'with', 'four', 'levels', 'from', 'smartphone', 'sensors', 'data', 'which', 'include', 'lowtohigh', 'frequencies', 'respectively', 'the', 'obtained', 'features', 'vector', 'for', 'each', 'maneuver', 'includes', 'the', 'raw', 'signal', 'variance', 'as', 'well', 'as', 'the', 'variance', 'of', 'the', 'wavelet', 'transform', 'components', 'on', 'these', 'vectors', 'we', 'use', 'the', 'knearest', 'neighbors', 'algorithm', 'for', 'features', 'selection', 'then', 'we', 'use', 'svm', 'rbf', 'and', 'mlp', 'neural', 'networks', 'on', 'these', 'features', 'to', 'separate', 'braking', 'and', 'dangerous', 'speed', 'maneuvers', 'from', 'the', 'safe', 'ones', 'as', 'well', 'as', 'dangerous', 'turning', 'uturn', 'and', 'lanechanging', 'maneuvers', 'the', 'results', 'are', 'very', 'interesting']]
|
[-0.06669728555237545, 0.058889239702015025, -0.09885795659644074, 0.08457921278266388, -0.131706917096981, -0.16586733317814775, 0.043572601523589, 0.4241519373213275, -0.27836764047287726, -0.3151409168322192, 0.15316580468398835, -0.30614422435056793, -0.16215689817185036, 0.2477910936655227, -0.11557436463730543, 0.09212678319743375, 0.08038285429952621, 0.06452284079018877, -0.01231038633847618, -0.2371755721377271, 0.26486775990014083, 0.03172526327318302, 0.3127061837891999, -0.026945863950676753, 0.11540362799905561, 0.012170174390826214, -0.05324384903214408, -0.036867237302283064, -0.05200506849927409, 0.1207234815902714, 0.283735641603621, 0.18300590003978764, 0.2806708656327184, -0.44993596849294654, -0.19179149685008673, 0.0989907592240917, 0.13520124366280786, 0.10164604126475751, -0.032371370877213354, -0.34191144463933704, 0.05354469198216662, -0.1368168745876143, -0.04925014524225983, -0.15192119114804994, -0.0037085380846340406, 0.059801892142934486, -0.28193442398708973, 0.021688883222184763, 0.033444108083870924, 0.08762650591049469, -0.07117485781991185, -0.1209692109875274, -0.014417478438181598, 0.19748365462915837, 0.06959351466447293, 0.015032282303550847, 0.1855441477924249, -0.1171673588967104, -0.13497280734190137, 0.3894656860585988, -0.035687166767801454, -0.23350676855419955, 0.21205965994990794, -0.04071618615021332, -0.12564120910455737, 0.0827676486123674, 0.25386743739015605, 0.07034892003323757, -0.1490459661205571, -0.047152621082796685, 0.04409658857598972, 0.15105821599885286, 0.07038941403458777, 0.024196304429910685, 0.1620353413790322, 0.1711976736222514, 0.06967972139668463, 0.0919851466754906, -0.1526212544285171, -0.04170131006915318, -0.24667175700353308, -0.10042126099111147, -0.1924899726344103, -0.03151657508906761, -0.11552437628802073, -0.131751097195657, 0.394758558631585, 0.22230756395378343, 0.19311204506752735, 0.05871187849638707, 0.3698774358284388, 0.07445560403571477, 0.12454893280145975, 0.10468058971661415, 0.19936102621035057, 0.031083762117674905, 0.1425381866294855, -0.16184763109498618, 0.08324330164961802, 0.04545913036672051]
|
1,803.06214
|
How sure are we? Two approaches to statistical inference
|
Suppose you are told that taking a statin will reduce your risk of a heart
attack or stroke by 3% in the next ten years, or that women have better
emotional intelligence than men. You may wonder how accurate the 3% is, or how
confident we should be about the assertion about women's emotional
intelligence, bearing in mind that these conclusions are only based on samples
of data? My aim here is to present two statistical approaches to questions like
these. Approach 1 is often called null hypothesis testing but I prefer the
phrase "baseline hypothesis": this is the standard approach in many areas of
inquiry but is fraught with problems. Approach 2 can be viewed as a
generalisation of the idea of confidence intervals, or as the application of
Bayes' theorem. Unlike Approach 1, Approach 2 provides a tentative estimate of
the probability of hypotheses of interest. For both approaches, I explain, from
first principles, building only on "common sense" statistical concepts like
averages and randomness, both how to derive answers, and the rationale behind
the answers. This is achieved by using computer simulation methods (resampling
and bootstrapping using a spreadsheet available on the web) which avoid the use
of probability distributions (t, normal, etc). Such a minimalist, but
reasonably rigorous, analysis is particularly useful in a discipline like
statistics which is widely used by people who are not specialists. My intended
audience includes both statisticians, and users of statistical methods who are
not statistical experts.
|
stat.OT
|
suppose you are told that taking a statin will reduce your risk of a heart attack or stroke by 3 in the next ten years or that women have better emotional intelligence than men you may wonder how accurate the 3 is or how confident we should be about the assertion about womens emotional intelligence bearing in mind that these conclusions are only based on samples of data my aim here is to present two statistical approaches to questions like these approach 1 is often called null hypothesis testing but i prefer the phrase baseline hypothesis this is the standard approach in many areas of inquiry but is fraught with problems approach 2 can be viewed as a generalisation of the idea of confidence intervals or as the application of bayes theorem unlike approach 1 approach 2 provides a tentative estimate of the probability of hypotheses of interest for both approaches i explain from first principles building only on common sense statistical concepts like averages and randomness both how to derive answers and the rationale behind the answers this is achieved by using computer simulation methods resampling and bootstrapping using a spreadsheet available on the web which avoid the use of probability distributions t normal etc such a minimalist but reasonably rigorous analysis is particularly useful in a discipline like statistics which is widely used by people who are not specialists my intended audience includes both statisticians and users of statistical methods who are not statistical experts
|
[['suppose', 'you', 'are', 'told', 'that', 'taking', 'a', 'statin', 'will', 'reduce', 'your', 'risk', 'of', 'a', 'heart', 'attack', 'or', 'stroke', 'by', '3', 'in', 'the', 'next', 'ten', 'years', 'or', 'that', 'women', 'have', 'better', 'emotional', 'intelligence', 'than', 'men', 'you', 'may', 'wonder', 'how', 'accurate', 'the', '3', 'is', 'or', 'how', 'confident', 'we', 'should', 'be', 'about', 'the', 'assertion', 'about', 'womens', 'emotional', 'intelligence', 'bearing', 'in', 'mind', 'that', 'these', 'conclusions', 'are', 'only', 'based', 'on', 'samples', 'of', 'data', 'my', 'aim', 'here', 'is', 'to', 'present', 'two', 'statistical', 'approaches', 'to', 'questions', 'like', 'these', 'approach', '1', 'is', 'often', 'called', 'null', 'hypothesis', 'testing', 'but', 'i', 'prefer', 'the', 'phrase', 'baseline', 'hypothesis', 'this', 'is', 'the', 'standard', 'approach', 'in', 'many', 'areas', 'of', 'inquiry', 'but', 'is', 'fraught', 'with', 'problems', 'approach', '2', 'can', 'be', 'viewed', 'as', 'a', 'generalisation', 'of', 'the', 'idea', 'of', 'confidence', 'intervals', 'or', 'as', 'the', 'application', 'of', 'bayes', 'theorem', 'unlike', 'approach', '1', 'approach', '2', 'provides', 'a', 'tentative', 'estimate', 'of', 'the', 'probability', 'of', 'hypotheses', 'of', 'interest', 'for', 'both', 'approaches', 'i', 'explain', 'from', 'first', 'principles', 'building', 'only', 'on', 'common', 'sense', 'statistical', 'concepts', 'like', 'averages', 'and', 'randomness', 'both', 'how', 'to', 'derive', 'answers', 'and', 'the', 'rationale', 'behind', 'the', 'answers', 'this', 'is', 'achieved', 'by', 'using', 'computer', 'simulation', 'methods', 'resampling', 'and', 'bootstrapping', 'using', 'a', 'spreadsheet', 'available', 'on', 'the', 'web', 'which', 'avoid', 'the', 'use', 'of', 'probability', 'distributions', 't', 'normal', 'etc', 'such', 'a', 'minimalist', 'but', 'reasonably', 'rigorous', 'analysis', 'is', 'particularly', 'useful', 'in', 'a', 'discipline', 'like', 'statistics', 'which', 'is', 'widely', 'used', 'by', 'people', 'who', 'are', 'not', 'specialists', 'my', 'intended', 'audience', 'includes', 'both', 'statisticians', 'and', 'users', 'of', 'statistical', 'methods', 'who', 'are', 'not', 'statistical', 'experts']]
|
[-0.013773454669938396, 0.0731973012528469, -0.12409564791066263, 0.15625978851604166, -0.13339217111981108, -0.20333077816805437, 0.09469677629382896, 0.38283113495782317, -0.2073432055145487, -0.32919809287828716, 0.12667814729384597, -0.2897658460992219, -0.15753265611590772, 0.20443241289620728, -0.15384699665160798, 0.01857896617082087, 0.07494903768899168, 0.07393866714263554, -0.003077078036594427, -0.298438991458619, 0.2925971292509784, 0.05128629267336386, 0.2952355041624865, 0.025245261027926374, 0.05566257746326492, -0.009883783003579267, -0.06496147628541779, 0.014704178879697343, -0.0922051123687175, 0.16563777153301035, 0.3191921603884774, 0.25208786657449567, 0.3885684908435563, -0.42106301645533395, -0.18071216728674014, 0.06943746336249386, 0.13697378547590694, 0.10203026773347727, 0.009775082064653004, -0.29580868389608284, 0.08485808910666268, -0.1706664022510713, -0.09740646524158747, -0.0863301670617096, -0.005741184028732752, -0.006146912649650926, -0.22699395898231853, 0.048973112319961855, 0.10044293788988483, 0.1174242343076765, 0.005677411297849014, -0.15222951053615344, 0.05728742229018873, 0.1572409760412432, 0.09852232074417808, 0.03135635668359064, 0.14631751629461248, -0.12481314837291596, -0.15284573279654887, 0.3919078495526905, -0.00019664355010022352, -0.20472188937941543, 0.19744243550204826, -0.10325954435275385, -0.16456903455880761, 0.05876470675460074, 0.16169513411243042, 0.08928512624155745, -0.1587607900202953, 0.023237904289601603, -0.02547015861687269, 0.1887193979103465, 0.062398192557592984, -0.0429506761084126, 0.22544209127171108, 0.15246929185510225, 0.020579325196169212, 0.03171537251415312, -0.047288156480260704, -0.0742901408034358, -0.2728642375370571, -0.15885187039732215, -0.16836803057702326, 0.057046168799222696, -0.02301298111449995, -0.13108125229616865, 0.3433801691964088, 0.22514550444582357, 0.13878010150972708, 0.06628596854324524, 0.29123421438860325, 0.04011203264365131, 0.04789294414825526, 0.06616446472372603, 0.1837254910171786, 0.0430160840249315, 0.09921365265493179, -0.06921665211064884, 0.1455265083876349, 0.020581087434046002]
|
1,803.06215
|
Inverse limits of Macaulay's inverse systems
|
Generalizing a result of Masuti and the second author, we describe inverse
limits of Macaulay's inverse systems for Cohen-Macaulay factor algebras of
formal power series or polynomial rings over an infinite field. On the way we
find a strictness result for filtrations defined by regular sequences. It
generalizes both a lemma of Uli Walther and the Rees isomorphism.
|
math.AC
|
generalizing a result of masuti and the second author we describe inverse limits of macaulays inverse systems for cohenmacaulay factor algebras of formal power series or polynomial rings over an infinite field on the way we find a strictness result for filtrations defined by regular sequences it generalizes both a lemma of uli walther and the rees isomorphism
|
[['generalizing', 'a', 'result', 'of', 'masuti', 'and', 'the', 'second', 'author', 'we', 'describe', 'inverse', 'limits', 'of', 'macaulays', 'inverse', 'systems', 'for', 'cohenmacaulay', 'factor', 'algebras', 'of', 'formal', 'power', 'series', 'or', 'polynomial', 'rings', 'over', 'an', 'infinite', 'field', 'on', 'the', 'way', 'we', 'find', 'a', 'strictness', 'result', 'for', 'filtrations', 'defined', 'by', 'regular', 'sequences', 'it', 'generalizes', 'both', 'a', 'lemma', 'of', 'uli', 'walther', 'and', 'the', 'rees', 'isomorphism']]
|
[-0.16171641341121545, -0.013019113421815463, -0.08790120676737921, 0.07863515660423658, -0.08232345997259535, -0.11167519766805244, -0.01789957348353647, 0.29565238989568476, -0.38038160670388105, -0.21788218106014717, 0.11753537504259369, -0.2227747228823538, -0.13214922903892423, 0.2520323459757492, -0.1367659436635159, 0.007596102714285672, 0.017399718214211792, 0.029544141408505625, -0.05760528877827114, -0.3099985331264806, 0.3885325907151504, 0.037963953266594685, 0.21731791298451095, 0.04209357834067838, 0.12848902811649546, 0.06704997850967379, -0.07875727927954547, 0.00983509029550799, -0.18453384076791077, 0.12429461323913059, 0.2939484526788623, 0.08158698932524643, 0.21855559493896776, -0.3335870129120504, -0.09095343738665869, 0.16838107342382186, 0.11845580429834282, 0.04174419190606166, -0.0015941396664731718, -0.2537628580687632, 0.09569454499006529, -0.24725459079290257, -0.1333569414223191, -0.07975378361177342, 0.0870980466174058, 0.03592441632444489, -0.28972998213279866, 0.04214091568478737, 0.22516422410463466, 0.17351176926930403, -0.056968479200491105, -0.06664069114124467, 0.038466593449341197, 0.027305344693715972, -0.0382897626319579, -0.027977204552434128, 0.08650769180907257, -0.09464647121133347, -0.20173699100469722, 0.3040054700144663, -0.049600665152458284, -0.1271842202043225, 0.10460948886285568, -0.12878382857086074, -0.14454322205535297, 0.08197336207176077, 0.02962213415845201, 0.1644520818111326, -0.03435521152177585, 0.19040553449805633, -0.1406479336096552, 0.06751296325618851, 0.19342685376438473, -0.032261119799182655, 0.11716276461836593, 0.10046645793421514, 0.10317483517855149, 0.17035432702636924, 0.08504674993535696, -0.023194259939843725, -0.28216421388988866, -0.19624121174023584, -0.13282508895419345, 0.11256059907890599, -0.1227423630986997, -0.17853750826405554, 0.41096157741186945, 0.08006565838024535, 0.18062106181128784, 0.16690760192156223, 0.21666421720372706, 0.11443571494249948, 0.07225284157200428, 0.04246761259654987, 0.11450405800634803, 0.24537220297397339, 0.0396833758066601, -0.10722178966258572, -0.0064431636329290685, 0.2293025989663498]
|
1,803.06216
|
Approximating Dominating Set on Intersection Graphs of Rectangles and
L-frames
|
We consider the Minimum Dominating Set (MDS) problem on the intersection
graphs of geometric objects. Even for simple and widely-used geometric objects
such as rectangles, no sub-logarithmic approximation is known for the problem
and (perhaps surprisingly) the problem is NP-hard even when all the rectangles
are "anchored" at a diagonal line with slope -1 (Pandit, CCCG 2017). In this
paper, we first show that for any $\epsilon>0$, there exists a
$(2+\epsilon)$-approximation algorithm for the MDS problem on
"diagonal-anchored" rectangles, providing the first $O(1)$-approximation for
the problem on a non-trivial subclass of rectangles. It is not hard to see that
the MDS problem on "diagonal-anchored" rectangles is the same as the MDS
problem on "diagonal-anchored" L-frames: the union of a vertical and a
horizontal line segment that share an endpoint. As such, we also obtain a
$(2+\epsilon)$-approximation for the problem with "diagonal-anchored" L-frames.
On the other hand, we show that the problem is APX-hard in case the input
L-frames intersect the diagonal, or the horizontal segments of the L-frames
intersect a vertical line. However, as we show, the problem is linear-time
solvable in case the L-frames intersect a vertical as well as a horizontal
line. Finally, we consider the MDS problem in the so-called "edge intersection
model" and obtain a number of results, answering two questions posed by Mehrabi
(WAOA 2017).
|
cs.CG
|
we consider the minimum dominating set mds problem on the intersection graphs of geometric objects even for simple and widelyused geometric objects such as rectangles no sublogarithmic approximation is known for the problem and perhaps surprisingly the problem is nphard even when all the rectangles are anchored at a diagonal line with slope 1 pandit cccg 2017 in this paper we first show that for any epsilon0 there exists a 2epsilonapproximation algorithm for the mds problem on diagonalanchored rectangles providing the first o1approximation for the problem on a nontrivial subclass of rectangles it is not hard to see that the mds problem on diagonalanchored rectangles is the same as the mds problem on diagonalanchored lframes the union of a vertical and a horizontal line segment that share an endpoint as such we also obtain a 2epsilonapproximation for the problem with diagonalanchored lframes on the other hand we show that the problem is apxhard in case the input lframes intersect the diagonal or the horizontal segments of the lframes intersect a vertical line however as we show the problem is lineartime solvable in case the lframes intersect a vertical as well as a horizontal line finally we consider the mds problem in the socalled edge intersection model and obtain a number of results answering two questions posed by mehrabi waoa 2017
|
[['we', 'consider', 'the', 'minimum', 'dominating', 'set', 'mds', 'problem', 'on', 'the', 'intersection', 'graphs', 'of', 'geometric', 'objects', 'even', 'for', 'simple', 'and', 'widelyused', 'geometric', 'objects', 'such', 'as', 'rectangles', 'no', 'sublogarithmic', 'approximation', 'is', 'known', 'for', 'the', 'problem', 'and', 'perhaps', 'surprisingly', 'the', 'problem', 'is', 'nphard', 'even', 'when', 'all', 'the', 'rectangles', 'are', 'anchored', 'at', 'a', 'diagonal', 'line', 'with', 'slope', '1', 'pandit', 'cccg', '2017', 'in', 'this', 'paper', 'we', 'first', 'show', 'that', 'for', 'any', 'epsilon0', 'there', 'exists', 'a', '2epsilonapproximation', 'algorithm', 'for', 'the', 'mds', 'problem', 'on', 'diagonalanchored', 'rectangles', 'providing', 'the', 'first', 'o1approximation', 'for', 'the', 'problem', 'on', 'a', 'nontrivial', 'subclass', 'of', 'rectangles', 'it', 'is', 'not', 'hard', 'to', 'see', 'that', 'the', 'mds', 'problem', 'on', 'diagonalanchored', 'rectangles', 'is', 'the', 'same', 'as', 'the', 'mds', 'problem', 'on', 'diagonalanchored', 'lframes', 'the', 'union', 'of', 'a', 'vertical', 'and', 'a', 'horizontal', 'line', 'segment', 'that', 'share', 'an', 'endpoint', 'as', 'such', 'we', 'also', 'obtain', 'a', '2epsilonapproximation', 'for', 'the', 'problem', 'with', 'diagonalanchored', 'lframes', 'on', 'the', 'other', 'hand', 'we', 'show', 'that', 'the', 'problem', 'is', 'apxhard', 'in', 'case', 'the', 'input', 'lframes', 'intersect', 'the', 'diagonal', 'or', 'the', 'horizontal', 'segments', 'of', 'the', 'lframes', 'intersect', 'a', 'vertical', 'line', 'however', 'as', 'we', 'show', 'the', 'problem', 'is', 'lineartime', 'solvable', 'in', 'case', 'the', 'lframes', 'intersect', 'a', 'vertical', 'as', 'well', 'as', 'a', 'horizontal', 'line', 'finally', 'we', 'consider', 'the', 'mds', 'problem', 'in', 'the', 'socalled', 'edge', 'intersection', 'model', 'and', 'obtain', 'a', 'number', 'of', 'results', 'answering', 'two', 'questions', 'posed', 'by', 'mehrabi', 'waoa', '2017']]
|
[-0.151608226585338, 0.03828425067387889, -0.010051337689518521, 0.08628914970107224, -0.0674389747064986, -0.16048982747528515, 0.0636194363607468, 0.39473823580750556, -0.283329569866464, -0.26999115682798164, 0.1623727165451741, -0.2993178020261194, -0.12835917199141086, 0.18396844510329233, -0.08577170281896376, 0.06269045338698037, 0.09048384696151636, 0.03968376753911308, -0.019368904109921446, -0.2509306415885721, 0.33109417509449196, -0.03242451652403938, 0.21622258759864935, 0.08217669929990111, 0.09103776460521978, 0.03375237056566615, 0.028679934269684838, 0.08746632177448622, -0.1473402706827792, 0.05847935256767235, 0.246108114000699, 0.15775146163983023, 0.24711415818020632, -0.3647017601077959, -0.1572864927908567, 0.15271753081350192, 0.16452447980957013, 0.0885235963316983, 0.007344004535435202, -0.17958519416627342, 0.09149264265489701, -0.07460346624874999, -0.10790734129562361, 0.05399647175513004, 0.06354034042462162, -0.0232084192400458, -0.25437827695684173, 0.01207933948387511, 0.13645514601375908, 0.02926377378346398, -0.04757485479131324, -0.13506614445649157, 0.03496701669875005, 0.11272493544096854, -0.00367072783184629, 0.07700320168028343, 0.019634348535952775, -0.09479337876564801, -0.13441681270338765, 0.4078952828140453, -0.013147652842642391, -0.20934012404762073, 0.11404596562986369, -0.06709962893175343, -0.16629517644210018, 0.08113190756587643, 0.15106632839888334, 0.16105819442288177, -0.060551920040900244, 0.1250376129601593, -0.18922749786004084, 0.12896580574821392, 0.1178246579498699, -0.03243356578096696, 0.17260150769770627, 0.12502027513644315, 0.18063681119347, 0.1855060066211837, -0.0656004165688351, -0.04247808122590661, -0.292117968601383, -0.1352726574115387, -0.18450655996933427, 0.014649935033808667, -0.09941877280101477, -0.2402725911882098, 0.3496887376978483, 0.09470599111739426, 0.24407881555109195, 0.11991599513660078, 0.2794964688848151, 0.07390118190030233, 0.02980575097308039, 0.17617868445388393, 0.18276249578214127, 0.07229676887873543, 0.030016898207332447, -0.1787273765847735, 0.05754223975595342, 0.12666196764774246]
|
1,803.06217
|
Shellability of face posets of electrical networks and the CW poset
property
|
We prove a conjecture of Thomas Lam that the face posets of stratified spaces
of planar resistor networks are shellable. These posets are called uncrossing
partial orders. This shellability result combines with Lam's previous result
that these same posets are Eulerian to imply that they are CW posets, namely
that they are face posets of regular CW complexes. Certain subsets of
uncrossing partial orders are shown to be isomorphic to type A Bruhat order
intervals; our shelling is shown to coincide on these intervals with a Bruhat
order shelling which was constructed by Matthew Dyer using a reflection order.
Our shelling for uncrossing posets also yields an explicit shelling for each
interval in the face posets of the edge product spaces of phylogenetic trees,
namely in the Tuffley posets, by virtue of each interval in a Tuffley poset
being isomorphic to an interval in an uncrossing poset. This yields a more
explicit proof of the result of Gill, Linusson, Moulton and Steel that the CW
decomposition of Moulton and Steel for the edge product space of phylogenetic
trees is a regular CW decomposition.
|
math.CO
|
we prove a conjecture of thomas lam that the face posets of stratified spaces of planar resistor networks are shellable these posets are called uncrossing partial orders this shellability result combines with lams previous result that these same posets are eulerian to imply that they are cw posets namely that they are face posets of regular cw complexes certain subsets of uncrossing partial orders are shown to be isomorphic to type a bruhat order intervals our shelling is shown to coincide on these intervals with a bruhat order shelling which was constructed by matthew dyer using a reflection order our shelling for uncrossing posets also yields an explicit shelling for each interval in the face posets of the edge product spaces of phylogenetic trees namely in the tuffley posets by virtue of each interval in a tuffley poset being isomorphic to an interval in an uncrossing poset this yields a more explicit proof of the result of gill linusson moulton and steel that the cw decomposition of moulton and steel for the edge product space of phylogenetic trees is a regular cw decomposition
|
[['we', 'prove', 'a', 'conjecture', 'of', 'thomas', 'lam', 'that', 'the', 'face', 'posets', 'of', 'stratified', 'spaces', 'of', 'planar', 'resistor', 'networks', 'are', 'shellable', 'these', 'posets', 'are', 'called', 'uncrossing', 'partial', 'orders', 'this', 'shellability', 'result', 'combines', 'with', 'lams', 'previous', 'result', 'that', 'these', 'same', 'posets', 'are', 'eulerian', 'to', 'imply', 'that', 'they', 'are', 'cw', 'posets', 'namely', 'that', 'they', 'are', 'face', 'posets', 'of', 'regular', 'cw', 'complexes', 'certain', 'subsets', 'of', 'uncrossing', 'partial', 'orders', 'are', 'shown', 'to', 'be', 'isomorphic', 'to', 'type', 'a', 'bruhat', 'order', 'intervals', 'our', 'shelling', 'is', 'shown', 'to', 'coincide', 'on', 'these', 'intervals', 'with', 'a', 'bruhat', 'order', 'shelling', 'which', 'was', 'constructed', 'by', 'matthew', 'dyer', 'using', 'a', 'reflection', 'order', 'our', 'shelling', 'for', 'uncrossing', 'posets', 'also', 'yields', 'an', 'explicit', 'shelling', 'for', 'each', 'interval', 'in', 'the', 'face', 'posets', 'of', 'the', 'edge', 'product', 'spaces', 'of', 'phylogenetic', 'trees', 'namely', 'in', 'the', 'tuffley', 'posets', 'by', 'virtue', 'of', 'each', 'interval', 'in', 'a', 'tuffley', 'poset', 'being', 'isomorphic', 'to', 'an', 'interval', 'in', 'an', 'uncrossing', 'poset', 'this', 'yields', 'a', 'more', 'explicit', 'proof', 'of', 'the', 'result', 'of', 'gill', 'linusson', 'moulton', 'and', 'steel', 'that', 'the', 'cw', 'decomposition', 'of', 'moulton', 'and', 'steel', 'for', 'the', 'edge', 'product', 'space', 'of', 'phylogenetic', 'trees', 'is', 'a', 'regular', 'cw', 'decomposition']]
|
[-0.14883059962293835, 0.10300938871043767, -0.05117020949395628, 0.08463466937763138, -0.11944013143904873, -0.10125729998655088, 0.016560898918169933, 0.4198400885136442, -0.3154657290525775, -0.20901925019064888, 0.11850026368463788, -0.2406856306698784, -0.11689038428890168, 0.1589650697344558, -0.17390903382424694, -0.012620904223352183, 0.08789999230098122, 0.0383140311405938, -0.017269936593788896, -0.3174087202915657, 0.34724787770149607, -0.017625188213248884, 0.22055121008408526, 0.04810889604338572, 0.09667582914508024, -0.002629034763807685, -0.019752556422809292, 0.05808842896570991, -0.18804291148687988, 0.14475689923945467, 0.29286119800259464, 0.1064571400435102, 0.19528603249565377, -0.35228128041156004, -0.10769608224579261, 0.14804831095284127, 0.10201863247915197, 0.0585974000077542, 0.0392304532718304, -0.2667794032276817, 0.12964412854231203, -0.18347341549974647, -0.09248168492699907, -0.04828189409088567, 0.060233664022035935, 0.05609783261525826, -0.29122460928689586, -0.04756031916848934, 0.17926453832598005, 0.07714439720510825, 0.016624490145207102, -0.15342181457761328, -0.10098532309419796, 0.05422242583831899, -0.07682293995227563, 0.042841349199129256, 0.021547678992905415, -0.012392522167933524, -0.23821316993301683, 0.33821432155562065, 0.03717800035953135, -0.20385167133979132, 0.13928744072779056, -0.18589912754575127, -0.1848695064268884, 0.17659253052841678, 0.03243041813661105, 0.13844253515946817, -0.050293249307108705, 0.10080122279926951, -0.15903127976169026, 0.08283627609648522, 0.2361557772433986, -0.017634911807457524, 0.12091194305446792, 0.13490227092810667, 0.12015823133371241, 0.17553828721242584, 0.0499871486449319, -0.029264650535973328, -0.2551544695325489, -0.141641245752858, -0.12864560501578728, 0.03365492584473896, -0.15592020277402752, -0.23703660734113602, 0.36983018381460037, 0.09656246946335775, 0.17328432399545454, 0.13112427981359162, 0.20186666409418882, 0.05241847770222427, 0.08029605379032959, 0.005077914085463097, 0.09594605874290557, 0.22399217969498755, -0.02323187985381142, -0.08642034151221122, 0.06626544629676583, 0.25137780989454095]
|
1,803.06218
|
Maximal antipodal sets in irreducible compact symmetric spaces
|
We give an explicit classification of maximal antipodal sets in any
irreducible compact symmetric space except for spin groups and half spin
groups, and some quotient symmetric spaces associated to them.
|
math.GR math.DG
|
we give an explicit classification of maximal antipodal sets in any irreducible compact symmetric space except for spin groups and half spin groups and some quotient symmetric spaces associated to them
|
[['we', 'give', 'an', 'explicit', 'classification', 'of', 'maximal', 'antipodal', 'sets', 'in', 'any', 'irreducible', 'compact', 'symmetric', 'space', 'except', 'for', 'spin', 'groups', 'and', 'half', 'spin', 'groups', 'and', 'some', 'quotient', 'symmetric', 'spaces', 'associated', 'to', 'them']]
|
[-0.2058986501708146, 0.12943296947548422, -0.026599809797781128, 0.1286388262505493, -0.1398161438203627, -0.12657248282865172, -0.003077354192012741, 0.4544448858547595, -0.23558501022747688, -0.14609546086660796, 0.16113621098244743, -0.2614272578559335, -0.09201557219268815, 0.23059262503539363, -0.08950169699927492, -0.07505666344396529, -0.00512437624556403, 0.1563116775885705, -0.2284638139028703, -0.29917703671080453, 0.4462937573271413, -0.10072763156025641, 0.21814301243472484, 0.0011043681372557917, 0.14107089863729574, 0.061666451424600616, -0.0635068385501302, -0.06121536928713472, -0.13621576262577886, 0.12382956648305539, 0.3352340315017969, 0.025393457061821414, 0.11360511048546722, -0.340946186934748, -0.10904861591576089, 0.3389278080374483, 0.12035353933911651, 0.07155711456171927, -0.0656469227565873, -0.31778651037283484, 0.05314041772151306, -0.20291334500295982, -0.20652772085140308, -0.09417857391940009, 0.12118047878386513, -0.0489844266445406, -0.2007241723758559, 0.011449707131231985, 0.13897092123666116, 0.08818674697390487, -0.14562096047185122, -0.13569283790345635, -0.0823017010585435, 0.13456244608988205, -0.06596250771995514, 0.012784277479494772, 0.05254244116405325, -0.03691148181115427, -0.1850493650192455, 0.34302464488052553, 0.02989997462399544, -0.2773064161019941, 0.17746858911648875, -0.20170058898868098, -0.16975104784773243, 0.1818771053616318, 0.12508006333824126, 0.12849302109210722, -0.00978821846506288, 0.11983627008439432, -0.1252502931221839, 0.041249043300687786, 0.1098188973302322, 0.06912610565702762, 0.18617324501035676, 0.05410603980623906, 0.17190803719624395, 0.1628116182231855, 0.0280567588812236, -0.02250420591125505, -0.3551993110487538, -0.18030599817152945, -0.09422020866505561, 0.116654098394417, -0.1735312090125761, -0.17849478030937813, 0.37980734651547765, -0.03555707411179619, 0.128302039758813, 0.11107106832787395, 0.18698194968484103, -0.015849987112526453, 0.04927928787806342, 0.12988447587216093, 0.05035988474734158, 0.24874045880090806, -0.13867634612946741, -0.14418882606250624, -0.06960882827819835, 0.1620099786669016]
|
1,803.06219
|
Experimentally Generated Randomness Certified by the Impossibility of
Superluminal Signals
|
From dice to modern complex circuits, there have been many attempts to build
increasingly better devices to generate random numbers. Today, randomness is
fundamental to security and cryptographic systems, as well as safeguarding
privacy. A key challenge with random number generators is that it is hard to
ensure that their outputs are unpredictable. For a random number generator
based on a physical process, such as a noisy classical system or an elementary
quantum measurement, a detailed model describing the underlying physics is
required to assert unpredictability. Such a model must make a number of
assumptions that may not be valid, thereby compromising the integrity of the
device. However, it is possible to exploit the phenomenon of quantum
nonlocality with a loophole-free Bell test to build a random number generator
that can produce output that is unpredictable to any adversary limited only by
general physical principles. With recent technological developments, it is now
possible to carry out such a loophole-free Bell test. Here we present certified
randomness obtained from a photonic Bell experiment and extract 1024 random
bits uniform to within $10^{-12}$. These random bits could not have been
predicted within any physical theory that prohibits superluminal signaling and
allows one to make independent measurement choices. To certify and quantify the
randomness, we describe a new protocol that is optimized for apparatuses
characterized by a low per-trial violation of Bell inequalities. We thus
enlisted an experimental result that fundamentally challenges the notion of
determinism to build a system that can increase trust in random sources. In the
future, random number generators based on loophole-free Bell tests may play a
role in increasing the security and trust of our cryptographic systems and
infrastructure.
|
quant-ph
|
from dice to modern complex circuits there have been many attempts to build increasingly better devices to generate random numbers today randomness is fundamental to security and cryptographic systems as well as safeguarding privacy a key challenge with random number generators is that it is hard to ensure that their outputs are unpredictable for a random number generator based on a physical process such as a noisy classical system or an elementary quantum measurement a detailed model describing the underlying physics is required to assert unpredictability such a model must make a number of assumptions that may not be valid thereby compromising the integrity of the device however it is possible to exploit the phenomenon of quantum nonlocality with a loopholefree bell test to build a random number generator that can produce output that is unpredictable to any adversary limited only by general physical principles with recent technological developments it is now possible to carry out such a loopholefree bell test here we present certified randomness obtained from a photonic bell experiment and extract 1024 random bits uniform to within 1012 these random bits could not have been predicted within any physical theory that prohibits superluminal signaling and allows one to make independent measurement choices to certify and quantify the randomness we describe a new protocol that is optimized for apparatuses characterized by a low pertrial violation of bell inequalities we thus enlisted an experimental result that fundamentally challenges the notion of determinism to build a system that can increase trust in random sources in the future random number generators based on loopholefree bell tests may play a role in increasing the security and trust of our cryptographic systems and infrastructure
|
[['from', 'dice', 'to', 'modern', 'complex', 'circuits', 'there', 'have', 'been', 'many', 'attempts', 'to', 'build', 'increasingly', 'better', 'devices', 'to', 'generate', 'random', 'numbers', 'today', 'randomness', 'is', 'fundamental', 'to', 'security', 'and', 'cryptographic', 'systems', 'as', 'well', 'as', 'safeguarding', 'privacy', 'a', 'key', 'challenge', 'with', 'random', 'number', 'generators', 'is', 'that', 'it', 'is', 'hard', 'to', 'ensure', 'that', 'their', 'outputs', 'are', 'unpredictable', 'for', 'a', 'random', 'number', 'generator', 'based', 'on', 'a', 'physical', 'process', 'such', 'as', 'a', 'noisy', 'classical', 'system', 'or', 'an', 'elementary', 'quantum', 'measurement', 'a', 'detailed', 'model', 'describing', 'the', 'underlying', 'physics', 'is', 'required', 'to', 'assert', 'unpredictability', 'such', 'a', 'model', 'must', 'make', 'a', 'number', 'of', 'assumptions', 'that', 'may', 'not', 'be', 'valid', 'thereby', 'compromising', 'the', 'integrity', 'of', 'the', 'device', 'however', 'it', 'is', 'possible', 'to', 'exploit', 'the', 'phenomenon', 'of', 'quantum', 'nonlocality', 'with', 'a', 'loopholefree', 'bell', 'test', 'to', 'build', 'a', 'random', 'number', 'generator', 'that', 'can', 'produce', 'output', 'that', 'is', 'unpredictable', 'to', 'any', 'adversary', 'limited', 'only', 'by', 'general', 'physical', 'principles', 'with', 'recent', 'technological', 'developments', 'it', 'is', 'now', 'possible', 'to', 'carry', 'out', 'such', 'a', 'loopholefree', 'bell', 'test', 'here', 'we', 'present', 'certified', 'randomness', 'obtained', 'from', 'a', 'photonic', 'bell', 'experiment', 'and', 'extract', '1024', 'random', 'bits', 'uniform', 'to', 'within', '1012', 'these', 'random', 'bits', 'could', 'not', 'have', 'been', 'predicted', 'within', 'any', 'physical', 'theory', 'that', 'prohibits', 'superluminal', 'signaling', 'and', 'allows', 'one', 'to', 'make', 'independent', 'measurement', 'choices', 'to', 'certify', 'and', 'quantify', 'the', 'randomness', 'we', 'describe', 'a', 'new', 'protocol', 'that', 'is', 'optimized', 'for', 'apparatuses', 'characterized', 'by', 'a', 'low', 'pertrial', 'violation', 'of', 'bell', 'inequalities', 'we', 'thus', 'enlisted', 'an', 'experimental', 'result', 'that', 'fundamentally', 'challenges', 'the', 'notion', 'of', 'determinism', 'to', 'build', 'a', 'system', 'that', 'can', 'increase', 'trust', 'in', 'random', 'sources', 'in', 'the', 'future', 'random', 'number', 'generators', 'based', 'on', 'loopholefree', 'bell', 'tests', 'may', 'play', 'a', 'role', 'in', 'increasing', 'the', 'security', 'and', 'trust', 'of', 'our', 'cryptographic', 'systems', 'and', 'infrastructure']]
|
[-0.1370002109030414, 0.13248683907370434, -0.08195578408828569, 0.07820152776676162, -0.10083553738795964, -0.22416393552141203, 0.08640585972147508, 0.3404650411293494, -0.2535034333692283, -0.3360381206900239, 0.09748647478699114, -0.25381028955373325, -0.1347316759118555, 0.2325994387688281, -0.12185564260843651, 0.14024265640907427, 0.03370166192903412, 0.010310760607421556, -0.0009148487145101048, -0.26476553426326327, 0.26469885674802407, 0.07062951341203871, 0.288048918289381, 0.031287646524316474, 0.09545855220269289, -0.0043941752146598075, -0.00492384506348484, 0.0028764362831424353, -0.05433561530872435, 0.10718257940006426, 0.2786830304193831, 0.1966094935233479, 0.32467699047257575, -0.449657801750822, -0.20069819021956775, 0.1374212093800439, 0.10121807903531951, 0.15787329670253916, -0.05296601916147973, -0.2722877644373641, 0.10222733232297924, -0.1878575369710719, -0.11968642905485208, -0.13153403780167902, 0.007682155045511671, 0.007988065301177167, -0.29029734932164597, 0.0036031478399483757, 0.042183383971575346, 0.046180735859134174, 0.07853293351101352, -0.027043553851826573, 0.025675985807208247, 0.13808143073013482, -0.011014528394518486, 0.025365422754482204, 0.15052278931302374, -0.09943434824977315, -0.19426811280332215, 0.38803926845051323, 0.02982759542553603, -0.21776391058062158, 0.1930739592555314, -0.10161429913333382, -0.1727121562756651, 0.07168092080342228, 0.1751977643239941, 0.01632244703550475, -0.15799633571563215, 0.018156191229831024, -0.05971070301629523, 0.24298414498985185, 0.04697155751854685, 0.12867045508439942, 0.2001163740957229, 0.12815682747437754, 0.0589042178890005, 0.1040232888552579, -0.018177220031840302, -0.11202800210260412, -0.3124960445487388, -0.18045940392922438, -0.24541094953449463, 0.12147992473113056, -0.07784319273061517, -0.1561188649805014, 0.32815084302154934, 0.21857430555363055, 0.1560070537315728, 0.02449996499290849, 0.31071074118214626, 0.05811118456975017, 0.08445406848153769, 0.06377483686528357, 0.2344208424596043, 0.12084670761165961, 0.08877879385281275, -0.12059376850803764, 0.1593166794350331, 0.009254528636595871]
|
1,803.0622
|
Collective motion in prolate {\gamma}-rigid nuclei within minimal length
concept via a quantum perturbation method
|
Based on the minimal length concept, inspired by Heisenberg algebra, a closed
analytical formula is derived for the energy spectrum of the prolate
{\gamma}-rigid Bohr-Mottelson Hamiltonian of nuclei, within a quantum
perturbation method (QPM), by considering a scaled Davidson potential in
\b{eta} shape variable. In the resulting solution, called X(3)-D-ML, the ground
state and the first \b{eta}-band are all studied as a function of the free
parameters. The fact of introducing the minimal length concept with a QPM makes
the model very flexible and a powerful approach to describe nuclear collective
excitations of a variety of vibrational-like nuclei. The introduction of
scaling parameters in the Davidson potential enables us to get a physical
minimum of this latter in comparison with previous works. The analysis of the
corrected wave function, as well as the probability density distribution, shows
that the minimal length parameter has a physical upper bound limit.
|
nucl-th
|
based on the minimal length concept inspired by heisenberg algebra a closed analytical formula is derived for the energy spectrum of the prolate gammarigid bohrmottelson hamiltonian of nuclei within a quantum perturbation method qpm by considering a scaled davidson potential in beta shape variable in the resulting solution called x3dml the ground state and the first betaband are all studied as a function of the free parameters the fact of introducing the minimal length concept with a qpm makes the model very flexible and a powerful approach to describe nuclear collective excitations of a variety of vibrationallike nuclei the introduction of scaling parameters in the davidson potential enables us to get a physical minimum of this latter in comparison with previous works the analysis of the corrected wave function as well as the probability density distribution shows that the minimal length parameter has a physical upper bound limit
|
[['based', 'on', 'the', 'minimal', 'length', 'concept', 'inspired', 'by', 'heisenberg', 'algebra', 'a', 'closed', 'analytical', 'formula', 'is', 'derived', 'for', 'the', 'energy', 'spectrum', 'of', 'the', 'prolate', 'gammarigid', 'bohrmottelson', 'hamiltonian', 'of', 'nuclei', 'within', 'a', 'quantum', 'perturbation', 'method', 'qpm', 'by', 'considering', 'a', 'scaled', 'davidson', 'potential', 'in', 'beta', 'shape', 'variable', 'in', 'the', 'resulting', 'solution', 'called', 'x3dml', 'the', 'ground', 'state', 'and', 'the', 'first', 'betaband', 'are', 'all', 'studied', 'as', 'a', 'function', 'of', 'the', 'free', 'parameters', 'the', 'fact', 'of', 'introducing', 'the', 'minimal', 'length', 'concept', 'with', 'a', 'qpm', 'makes', 'the', 'model', 'very', 'flexible', 'and', 'a', 'powerful', 'approach', 'to', 'describe', 'nuclear', 'collective', 'excitations', 'of', 'a', 'variety', 'of', 'vibrationallike', 'nuclei', 'the', 'introduction', 'of', 'scaling', 'parameters', 'in', 'the', 'davidson', 'potential', 'enables', 'us', 'to', 'get', 'a', 'physical', 'minimum', 'of', 'this', 'latter', 'in', 'comparison', 'with', 'previous', 'works', 'the', 'analysis', 'of', 'the', 'corrected', 'wave', 'function', 'as', 'well', 'as', 'the', 'probability', 'density', 'distribution', 'shows', 'that', 'the', 'minimal', 'length', 'parameter', 'has', 'a', 'physical', 'upper', 'bound', 'limit']]
|
[-0.11239456161729941, 0.12566906750379575, -0.11727476804865664, 0.08626903344870729, -0.05286284648578893, -0.11046550138758457, 0.04555503256321207, 0.2937283247002863, -0.22785938007212211, -0.2939327919735339, 0.03985437704171022, -0.24160414865101074, -0.1230000732244835, 0.19509833254122816, -0.007092467393586729, 0.0737870097553142, 0.012408828990039776, 0.06695582096775372, -0.0800149712987168, -0.14123319671647686, 0.29415484936591113, 0.09036939279698976, 0.26451337614356457, 0.04232531395062906, 0.09629968230986372, 0.07511193140253082, 0.010875591586920478, 0.008352107174384097, -0.16552736951763064, 0.1353916963219855, 0.1947612410758109, 0.09130253936765956, 0.2503016847344179, -0.37591277806208706, -0.23304038866087287, 0.08194045855847447, 0.1399380312187179, 0.12705845496819995, -0.03623482784284849, -0.24744998887307992, 0.045643984825591094, -0.22208100545606543, -0.20951283842223842, -0.06803546759274592, 0.03814085897337012, 0.05565360290169412, -0.25921172997755865, 0.06003255147184404, 0.0453592860131987, 0.02754236189755421, -0.07073793677414363, -0.1182376930908281, -0.007852360009070055, 0.08019132134314551, 0.02761561354245281, 0.048908203181360854, 0.11418723820258869, -0.11110535673131901, -0.07847825386783197, 0.3721358640829012, -0.0764056697731749, -0.20986317390050155, 0.1143385246902907, -0.10541925304981113, -0.09735022637784024, 0.12510274772272528, 0.10240441899577181, 0.110644035326431, -0.14018026648760856, 0.14901630246146982, -0.05241513722106976, 0.17505233022099248, 0.028543554186238114, 0.04328149696812034, 0.14066500728633127, 0.17567097512469784, 0.0423583606777548, 0.142335999709535, -0.07917485866207807, -0.13423143842631355, -0.3091400933204865, -0.1170455636761506, -0.21750825945348132, 0.04372707608765305, -0.09793308132377986, -0.18571684624188814, 0.4292706037637125, 0.0676531745643564, 0.22375464628982758, 0.04603641567004173, 0.2791462446345954, 0.13642077148990187, 0.07270506081499198, 0.03840025987232193, 0.2367486687484799, 0.16528034751655116, 0.024673146662162932, -0.23313704928617646, 0.029273579486322646, 0.1061771544136842]
|
1,803.06221
|
The Climate of the Khagan. Observations on palaeo-environmental Factors
of the History of the Avars (6th-9th century AD)
|
Based on palaeoenvironmental, historical and archaeological data, the paper
proposes possible climatic impacts on the history of the Avar Khaganate, which
comprised the Carpathian Basin between the late 6th and the early 9th century
AD. While the establishment of the Avars in East Central Europe took place
within a period characterised by cold and dry climatic conditions (recently
identified as Late Antique Little Ice Age), more stable climatic parameters may
have favoured the stabilisation of Avar rule after a crisis in the aftermath of
626 AD. Data indicates growth of settlement and agricultural activity up to the
mid-8th century. These developments did not necessarily strengthen central
power, but may have contributed to a greater autonomy of various groups on the
basis of increased resources. The Khaganate quickly disintegrated faced by the
Carolingian advance of the 790s; the last decades of documented Avar presence
were again accompanied by environmental vicissitudes.
|
physics.hist-ph nlin.AO physics.soc-ph
|
based on palaeoenvironmental historical and archaeological data the paper proposes possible climatic impacts on the history of the avar khaganate which comprised the carpathian basin between the late 6th and the early 9th century ad while the establishment of the avars in east central europe took place within a period characterised by cold and dry climatic conditions recently identified as late antique little ice age more stable climatic parameters may have favoured the stabilisation of avar rule after a crisis in the aftermath of 626 ad data indicates growth of settlement and agricultural activity up to the mid8th century these developments did not necessarily strengthen central power but may have contributed to a greater autonomy of various groups on the basis of increased resources the khaganate quickly disintegrated faced by the carolingian advance of the 790s the last decades of documented avar presence were again accompanied by environmental vicissitudes
|
[['based', 'on', 'palaeoenvironmental', 'historical', 'and', 'archaeological', 'data', 'the', 'paper', 'proposes', 'possible', 'climatic', 'impacts', 'on', 'the', 'history', 'of', 'the', 'avar', 'khaganate', 'which', 'comprised', 'the', 'carpathian', 'basin', 'between', 'the', 'late', '6th', 'and', 'the', 'early', '9th', 'century', 'ad', 'while', 'the', 'establishment', 'of', 'the', 'avars', 'in', 'east', 'central', 'europe', 'took', 'place', 'within', 'a', 'period', 'characterised', 'by', 'cold', 'and', 'dry', 'climatic', 'conditions', 'recently', 'identified', 'as', 'late', 'antique', 'little', 'ice', 'age', 'more', 'stable', 'climatic', 'parameters', 'may', 'have', 'favoured', 'the', 'stabilisation', 'of', 'avar', 'rule', 'after', 'a', 'crisis', 'in', 'the', 'aftermath', 'of', '626', 'ad', 'data', 'indicates', 'growth', 'of', 'settlement', 'and', 'agricultural', 'activity', 'up', 'to', 'the', 'mid8th', 'century', 'these', 'developments', 'did', 'not', 'necessarily', 'strengthen', 'central', 'power', 'but', 'may', 'have', 'contributed', 'to', 'a', 'greater', 'autonomy', 'of', 'various', 'groups', 'on', 'the', 'basis', 'of', 'increased', 'resources', 'the', 'khaganate', 'quickly', 'disintegrated', 'faced', 'by', 'the', 'carolingian', 'advance', 'of', 'the', '790s', 'the', 'last', 'decades', 'of', 'documented', 'avar', 'presence', 'were', 'again', 'accompanied', 'by', 'environmental', 'vicissitudes']]
|
[-0.11781620277127933, 0.15357066957857196, -0.08616560414223604, 0.064601716237851, -0.06775269338297067, -0.058448556725355524, 0.07751254730736575, 0.2999266137690349, -0.18460840752682792, -0.3372735757393841, 0.20385653623806077, -0.23185827316139157, -0.12187276641562791, 0.1981518644527274, -0.12729587188994013, -0.028288399744910042, 0.06154355208691157, 0.017532345478121245, -0.015610505825234084, -0.3276864437068301, 0.25735107765854404, 0.14456348483201484, 0.2602899788327935, 0.03558562239336873, 0.06339756526589119, -0.03638689740049377, -0.1301427245496495, -0.05810901698653101, -0.09733156324036314, 0.08870050373723284, 0.24966765645051925, 0.16479857627328642, 0.3510091115366405, -0.49877085914494285, -0.22098489309018346, 0.12401446447261727, 0.10572103220923529, 0.013159880048142825, -0.024777409522716305, -0.2616155600785212, -0.0074905709070022366, -0.2265403498042847, -0.14529980515280713, 0.025400363174463873, 0.09278904478324734, -0.014351868046067235, -0.17107081864337423, 0.11957821933123033, 0.032510961456762126, 0.157691912512413, -0.07547628674928746, -0.1419781927990032, -0.09017936582628389, 0.15817668373224286, 0.11221806259832384, 0.005052681307269024, 0.13571875412213866, -0.09748898668896774, -0.09051584348108777, 0.35521909492221515, -0.042947688292462746, 0.02084297225581036, 0.210949489189325, -0.17974825833373193, -0.14084317288886178, 0.127467199454976, 0.16934725827812938, 0.02633743500152544, -0.16865847903159512, 0.00832056696362741, 0.0179890423724559, 0.12462763039355862, 0.13973704758460936, -0.035840319817177425, 0.2860429517295159, 0.18505522157196744, 0.031277918938914656, 0.06058801127545221, -0.08909598002243052, -0.15876814162294695, -0.19480798567537036, -0.0961354014457164, -0.09669313052157597, 0.03488177989954276, -0.05408123594628398, -0.13185168599585254, 0.39726879742180166, 0.11287503583329274, 0.15903700639585583, -0.04368761281440244, 0.22872429132350053, 0.024666821105326985, 0.11383997223433845, 0.0723211370559383, 0.2747624263849477, 0.06559377843776429, 0.20184801213777767, -0.17575877450011396, 0.18722061807958698, 0.021388913271948695]
|
1,803.06222
|
Quasi-Optimality of an Adaptive Finite Element Method for Cathodic
Protection
|
In this work, we derive a reliable and efficient residual-typed error
estimator for the finite element approximation of a 2d cathodic protection
problem governed by a steady-state diffusion equation with a nonlinear boundary
condition. We propose a standard adaptive finite element method involving the
D\"{o}rfler marking and a minimal refinement without the interior node
property. Furthermore, we establish the contraction property of this adaptive
algorithm in terms of the sum of the energy error and the scaled estimator.
This essentially allows for a quasi-optimal convergence rate in terms of the
number of elements over the underlying triangulation. Numerical experiments are
provided to confirm this quasi-optimality.
|
math.NA
|
in this work we derive a reliable and efficient residualtyped error estimator for the finite element approximation of a 2d cathodic protection problem governed by a steadystate diffusion equation with a nonlinear boundary condition we propose a standard adaptive finite element method involving the dorfler marking and a minimal refinement without the interior node property furthermore we establish the contraction property of this adaptive algorithm in terms of the sum of the energy error and the scaled estimator this essentially allows for a quasioptimal convergence rate in terms of the number of elements over the underlying triangulation numerical experiments are provided to confirm this quasioptimality
|
[['in', 'this', 'work', 'we', 'derive', 'a', 'reliable', 'and', 'efficient', 'residualtyped', 'error', 'estimator', 'for', 'the', 'finite', 'element', 'approximation', 'of', 'a', '2d', 'cathodic', 'protection', 'problem', 'governed', 'by', 'a', 'steadystate', 'diffusion', 'equation', 'with', 'a', 'nonlinear', 'boundary', 'condition', 'we', 'propose', 'a', 'standard', 'adaptive', 'finite', 'element', 'method', 'involving', 'the', 'dorfler', 'marking', 'and', 'a', 'minimal', 'refinement', 'without', 'the', 'interior', 'node', 'property', 'furthermore', 'we', 'establish', 'the', 'contraction', 'property', 'of', 'this', 'adaptive', 'algorithm', 'in', 'terms', 'of', 'the', 'sum', 'of', 'the', 'energy', 'error', 'and', 'the', 'scaled', 'estimator', 'this', 'essentially', 'allows', 'for', 'a', 'quasioptimal', 'convergence', 'rate', 'in', 'terms', 'of', 'the', 'number', 'of', 'elements', 'over', 'the', 'underlying', 'triangulation', 'numerical', 'experiments', 'are', 'provided', 'to', 'confirm', 'this', 'quasioptimality']]
|
[-0.12482158075391243, 0.03307267983193295, -0.09890508676359716, 0.04229996075558189, -0.04056884545403031, -0.11050425848225132, 0.10015744998460062, 0.3368363901480244, -0.30802770653211226, -0.25394791931522864, 0.13773282873108444, -0.21876755373145548, -0.14475341124433236, 0.1628601776879245, -0.09186721645976202, 0.12064064201863053, 0.09136887359468696, 0.027309400839910198, -0.10889907635282725, -0.23291846569134997, 0.28632972862284917, 0.05807268917008584, 0.2792823672688638, 0.0364609919846631, 0.1666847945173056, 0.0011015791835514111, -0.037489416024002895, 0.04248558779587396, -0.18045499239143772, 0.14037353211740713, 0.2149504697881639, 0.08001084884521194, 0.3255102907737287, -0.38691167605933374, -0.2082191597437486, 0.1140453239920764, 0.14162642047113666, 0.10882667104865854, -0.09186400062082192, -0.2123906407191848, 0.13596907139939363, -0.15707496295306975, -0.16649931741994806, -0.04526101050970073, -0.06424739916558163, 0.03822271970924563, -0.39530532346823466, 0.09705268038445726, 0.0782451554774665, 0.07304330482684936, -0.05056366955809958, -0.0753307578046448, 0.03361363241520639, 0.079220083130237, -0.0015480344602390407, -0.005889102812104214, 0.0517756630657599, -0.06315754959359765, -0.07488841055937183, 0.3525205340746862, -0.08031408244278282, -0.271195456564713, 0.1373383501687875, -0.09149736093016915, -0.06359444889508617, 0.1439200570054639, 0.15481239782485107, 0.14213924107697004, -0.1330864438160251, 0.10347355879191757, -0.034928655353724025, 0.1194558318462581, 0.044272812034110896, 0.020995705495946683, 0.08206121137985835, 0.1792386502134972, 0.14505738571572763, 0.13750404137401626, -0.07541371313541625, -0.08335093916572917, -0.3591729540628596, -0.1990363036188333, -0.19508352413182506, 0.022298330553055096, -0.1643464204049591, -0.2194718670171614, 0.3889452782448363, 0.13827504748657632, 0.14890255504668368, 0.10315596114378422, 0.3142637391261255, 0.1402018666670371, 0.014772455472176751, 0.10785757997431435, 0.1890342951765678, 0.13846015788014762, 0.04607229724262232, -0.27821122808381915, 0.10147065226919949, 0.19892716734634283]
|
1,803.06223
|
Efficient construction of threshold networks of stock markets
|
Although the threshold network is one of the most used tools to characterize
the underlying structure of a stock market, the identification of the optimal
threshold to construct a reliable stock network remains challenging. In this
paper, the concept of dynamic consistence between the threshold network and the
stock market is proposed. The optimal threshold is estimated by maximizing the
consistence function. The application of this procedure to stocks belonging to
Standard \& Pool's 500 Index from January 2006 to December 2011 yields the
threshold value 0.28. In analyzing topological characteristics of the generated
network, three globally financial crises can be distinguished well from the
evolutionary perspective.
|
q-fin.ST physics.soc-ph
|
although the threshold network is one of the most used tools to characterize the underlying structure of a stock market the identification of the optimal threshold to construct a reliable stock network remains challenging in this paper the concept of dynamic consistence between the threshold network and the stock market is proposed the optimal threshold is estimated by maximizing the consistence function the application of this procedure to stocks belonging to standard pools 500 index from january 2006 to december 2011 yields the threshold value 028 in analyzing topological characteristics of the generated network three globally financial crises can be distinguished well from the evolutionary perspective
|
[['although', 'the', 'threshold', 'network', 'is', 'one', 'of', 'the', 'most', 'used', 'tools', 'to', 'characterize', 'the', 'underlying', 'structure', 'of', 'a', 'stock', 'market', 'the', 'identification', 'of', 'the', 'optimal', 'threshold', 'to', 'construct', 'a', 'reliable', 'stock', 'network', 'remains', 'challenging', 'in', 'this', 'paper', 'the', 'concept', 'of', 'dynamic', 'consistence', 'between', 'the', 'threshold', 'network', 'and', 'the', 'stock', 'market', 'is', 'proposed', 'the', 'optimal', 'threshold', 'is', 'estimated', 'by', 'maximizing', 'the', 'consistence', 'function', 'the', 'application', 'of', 'this', 'procedure', 'to', 'stocks', 'belonging', 'to', 'standard', 'pools', '500', 'index', 'from', 'january', '2006', 'to', 'december', '2011', 'yields', 'the', 'threshold', 'value', '028', 'in', 'analyzing', 'topological', 'characteristics', 'of', 'the', 'generated', 'network', 'three', 'globally', 'financial', 'crises', 'can', 'be', 'distinguished', 'well', 'from', 'the', 'evolutionary', 'perspective']]
|
[-0.08023970173276469, 0.056916922526346204, -0.11258823306679744, 0.12215230627675136, -0.07092540219145001, -0.11023758426704004, 0.11438871393494203, 0.3576435555686366, -0.29402939088089075, -0.34139259352858337, 0.1537743457043895, -0.2813600420486182, -0.19153399480823077, 0.1686265597928245, -0.08985363474150873, 0.06885517993173122, 0.04443370470478428, 0.02317272027392151, 0.019504843899136724, -0.25041063062908164, 0.29740120157740024, 0.08586251827940908, 0.3660843547011884, 0.022717690508250357, 0.09873723449572078, -0.028384521234569686, -0.040888545024296584, -7.562706563270317e-05, -0.14372089625564669, 0.1532171826001327, 0.28670537357552434, 0.1314991561362063, 0.3037713505657179, -0.3478705000817635, -0.1623760010664931, 0.1313330139261934, 0.031511119883156045, 0.03393389266160018, 0.0701224635199222, -0.2637561164919357, 0.11622997911928117, -0.21553842023340106, -0.11352455860689142, -0.008855774736181253, 0.021448665830078272, -0.02143161200461382, -0.3016695744464534, 0.06503030211216647, -0.003432509655194392, 0.037745270280624334, -0.02658595453578768, -0.09836595736549429, -0.07695443773826689, 0.20722658916394104, 0.09361633365174299, -0.009157821035258612, 0.16821310988996388, -0.11910271809989903, -0.17213223397485772, 0.34964202339145933, -0.04941294547873286, -0.08842646329277107, 0.1392435259537174, -0.10015745451761726, -0.10596304853394065, 0.1364224033500507, 0.19195328805736214, 0.041972522683142915, -0.19717795807755123, 0.026174654748690542, -0.04742852947235389, 0.2037580235035352, 0.06296765943989158, -0.03281827108442502, 0.17490447359049763, 0.21452989299860695, 0.09744666616722308, 0.14980063620704348, -0.10197177816199947, -0.1468962100246605, -0.24708141830205074, -0.0911455506543719, -0.1794629365970152, 0.04311997882850503, -0.12279690379474009, -0.14932444893737445, 0.4605412041979297, 0.15680146534523032, 0.18124295713243796, 0.04935122592339538, 0.24516856227562112, 0.13302094053547336, -0.015896128617965105, 0.10341927077498217, 0.2483547106560952, 0.053517131692782605, 0.15156228724375087, -0.1618685215614947, 0.15053163883759518, 0.06349259874133288]
|
1,803.06224
|
Folding a 3D Euclidean space
|
This paper considers an extension of origami geometry to the case of
"folding" a three dimensional (3D) space along a plane. First, all possible
incidence constraints between given points, lines and planes are analyzed by
using the geometry of reflections. Next, a set of 3D elementary fold operations
is defined, which satisfy specific combinations of constraints with a finite
number of solutions. The set consists of 47 valid fold operations, and
solutions to some of them are explored to determine their number and conditions
of existence.
|
math.HO
|
this paper considers an extension of origami geometry to the case of folding a three dimensional 3d space along a plane first all possible incidence constraints between given points lines and planes are analyzed by using the geometry of reflections next a set of 3d elementary fold operations is defined which satisfy specific combinations of constraints with a finite number of solutions the set consists of 47 valid fold operations and solutions to some of them are explored to determine their number and conditions of existence
|
[['this', 'paper', 'considers', 'an', 'extension', 'of', 'origami', 'geometry', 'to', 'the', 'case', 'of', 'folding', 'a', 'three', 'dimensional', '3d', 'space', 'along', 'a', 'plane', 'first', 'all', 'possible', 'incidence', 'constraints', 'between', 'given', 'points', 'lines', 'and', 'planes', 'are', 'analyzed', 'by', 'using', 'the', 'geometry', 'of', 'reflections', 'next', 'a', 'set', 'of', '3d', 'elementary', 'fold', 'operations', 'is', 'defined', 'which', 'satisfy', 'specific', 'combinations', 'of', 'constraints', 'with', 'a', 'finite', 'number', 'of', 'solutions', 'the', 'set', 'consists', 'of', '47', 'valid', 'fold', 'operations', 'and', 'solutions', 'to', 'some', 'of', 'them', 'are', 'explored', 'to', 'determine', 'their', 'number', 'and', 'conditions', 'of', 'existence']]
|
[-0.20423884597758568, 0.06124257519560308, 0.0037542263392445654, 0.029159943990106154, -0.07963404012031766, -0.09613933543089864, 0.0604362151339152, 0.3372739982076509, -0.27680412983131963, -0.3189168835145443, 0.1115790669979571, -0.25309403152963106, -0.1339596977550807, 0.21133364508534933, -0.042260007648512204, 0.04725842934838215, 0.0228967152882454, 0.022488508579933064, -0.11713711145336653, -0.27408823951791844, 0.3594429560850353, -0.025497190621789803, 0.2290184270633861, -0.027980178832834542, 0.11403095541890104, 0.029683887909794617, -0.026755894940389796, 0.0759294656870838, -0.1547159532539893, 0.15868076522899574, 0.23396242386932203, 0.15179894129247512, 0.19602327844734455, -0.4261130778183944, -0.16475883484709747, 0.1120810825323556, 0.11090403180136237, 0.09269079037124378, -0.004326672152464473, -0.21577209897263538, 0.09547469565688177, -0.09201559209302718, -0.1560461540912213, -0.0498094231345106, 0.024943247756942413, 0.06253490994446152, -0.23268895186917032, -0.019168578348187512, 0.05633875752019501, 0.09503882787688527, -0.07822381111598292, -0.07844247850914333, -0.06399530098167096, 0.13094037571423794, 0.014928111446436581, -0.00906159644296696, 0.07735789119439243, -0.09517431148535337, -0.1278000294317513, 0.4115736716708472, 0.034613501356351516, -0.2496588309836942, 0.2021296734618413, -0.12370755672346541, -0.11451996156815873, 0.16157267019585814, 0.15637952668678967, 0.1311874660706624, -0.1606375484045075, 0.10240626320862861, -0.054876371633348076, 0.12436658678966206, 0.14472278094915456, -0.0031396300060847816, 0.21006842096726042, 0.14977292714337276, 0.09321029462071873, 0.16710333863265142, -0.08607574852033205, -0.06925619706081032, -0.36444031639934277, -0.1514237935784771, -0.13260956859042825, 0.01588578668130605, -0.06441976395818041, -0.1922839670117165, 0.4166077169600528, 0.07939107279610674, 0.2493872447805696, 0.033401793108570804, 0.2586650953216608, 0.07551195744058214, 0.03861868396390576, 0.04215131766639303, 0.1613539219742538, 0.1459435490311968, 0.0018071635561280471, -0.14137679783540757, -0.016888987849639773, 0.09180767555872715]
|
1,803.06225
|
Graphene functionalised by laser ablated V2O5 as highly sensitive NH3
sensor
|
Graphene has been recognized as a promising gas sensing material. The
response of graphene-based sensors can be radically improved by introducing
defects in graphene using, e. g., metal or metal oxide nanoparticles. We have
functionalised CVD grown, single layer graphene by applying pulsed laser
deposition (PLD) of V2O5 which resulted in a thin V2O5 layer on graphene with
average thickness of ~0.6 nm. According to Raman analysis, PLD process also
induced defects in graphene. Compared to unmodified graphene, the obtained
chemiresistive sensor showed considerable improvement of sensing ammonia at
room temperature. In addition, also the response time, sensitivity and
reversibility were essentially enhanced due to graphene functionalisation by
laser deposited V2O5. This can be explained by increased surface density of gas
adsorption sites introduced by high energy atoms in laser ablation plasma and
formation of nanophase boundaries between deposited V2O5 and graphene.
|
cond-mat.mtrl-sci
|
graphene has been recognized as a promising gas sensing material the response of graphenebased sensors can be radically improved by introducing defects in graphene using e g metal or metal oxide nanoparticles we have functionalised cvd grown single layer graphene by applying pulsed laser deposition pld of v2o5 which resulted in a thin v2o5 layer on graphene with average thickness of 06 nm according to raman analysis pld process also induced defects in graphene compared to unmodified graphene the obtained chemiresistive sensor showed considerable improvement of sensing ammonia at room temperature in addition also the response time sensitivity and reversibility were essentially enhanced due to graphene functionalisation by laser deposited v2o5 this can be explained by increased surface density of gas adsorption sites introduced by high energy atoms in laser ablation plasma and formation of nanophase boundaries between deposited v2o5 and graphene
|
[['graphene', 'has', 'been', 'recognized', 'as', 'a', 'promising', 'gas', 'sensing', 'material', 'the', 'response', 'of', 'graphenebased', 'sensors', 'can', 'be', 'radically', 'improved', 'by', 'introducing', 'defects', 'in', 'graphene', 'using', 'e', 'g', 'metal', 'or', 'metal', 'oxide', 'nanoparticles', 'we', 'have', 'functionalised', 'cvd', 'grown', 'single', 'layer', 'graphene', 'by', 'applying', 'pulsed', 'laser', 'deposition', 'pld', 'of', 'v2o5', 'which', 'resulted', 'in', 'a', 'thin', 'v2o5', 'layer', 'on', 'graphene', 'with', 'average', 'thickness', 'of', '06', 'nm', 'according', 'to', 'raman', 'analysis', 'pld', 'process', 'also', 'induced', 'defects', 'in', 'graphene', 'compared', 'to', 'unmodified', 'graphene', 'the', 'obtained', 'chemiresistive', 'sensor', 'showed', 'considerable', 'improvement', 'of', 'sensing', 'ammonia', 'at', 'room', 'temperature', 'in', 'addition', 'also', 'the', 'response', 'time', 'sensitivity', 'and', 'reversibility', 'were', 'essentially', 'enhanced', 'due', 'to', 'graphene', 'functionalisation', 'by', 'laser', 'deposited', 'v2o5', 'this', 'can', 'be', 'explained', 'by', 'increased', 'surface', 'density', 'of', 'gas', 'adsorption', 'sites', 'introduced', 'by', 'high', 'energy', 'atoms', 'in', 'laser', 'ablation', 'plasma', 'and', 'formation', 'of', 'nanophase', 'boundaries', 'between', 'deposited', 'v2o5', 'and', 'graphene']]
|
[-0.06286348579336666, 0.20006746546575196, -0.018091005555183535, -0.12006298401862091, 0.07313646743743038, -0.17668632465795103, 0.11684387882935329, 0.5061134112552858, -0.2521013434202423, -0.3546469200691077, -0.009641499843113912, -0.30038894025582663, -0.09909195624272221, 0.1795493759309978, -0.037772267615803004, 0.06852312487694369, -0.0027860718070936035, -0.17814973912621573, -0.037704156521497896, -0.2211925783555325, 0.20291818931541392, 0.12253223350730685, 0.3645015962776059, 0.13045531788735953, 0.04230016740662059, -0.05005616584012259, 0.1117746584596191, 0.008913060543190894, -0.1509134598640179, 0.07534921811276662, 0.25303797852936605, -0.1710838007176636, 0.21305141364499716, -0.5398987513822568, -0.3007092329306187, -0.03913726220169748, 0.13549000485865792, 0.09761587886240589, -0.16885089951085294, -0.2730242977653381, 0.07019750223557374, -0.1203173358570522, -0.07155212660608681, -0.010737364265647992, -0.029023870547026605, 0.010805167425030343, -0.2106977404135404, 0.04318815746802089, 0.009882741840556264, 0.10186193229279704, -0.09933956419970368, -0.1414467024118443, -0.15255748572051, 0.0010156368420288805, 0.01613021644572629, 0.073499322862325, 0.3487775507645393, -0.0782782831967113, -0.05793590281112775, 0.37332729962457656, -0.10376491696527884, -0.052762421744901845, 0.18861089505150286, -0.16210582857938405, -0.019992510771746158, 0.2256254061964721, 0.09462405039771447, 0.11230233543172059, -0.18956072164804372, 0.047939461064410174, 0.045548700410454585, 0.21253656858289746, 0.24366675265638393, 0.07457472271044922, 0.22079657329718622, 0.2699234529552509, 0.013180765108546426, 0.1850350128493311, -0.11128148444252692, 0.08423482608804347, -0.08607010286248906, -0.20416355455248342, -0.21607090085482514, 0.09754624335065773, -0.08667711865021208, -0.1701141504216677, 0.3648566285502428, 0.11272234485392839, 0.11516939403331826, -0.1365632655576173, 0.24294848398233332, 0.09141366785756168, 0.10703348495971254, -0.061968277608992164, 0.2449723392803694, 0.17392727150253848, 0.13318012286525654, -0.19890014700670267, 0.13022514060139656, -0.013199894677545928]
|
1,803.06226
|
Glyph: Symbolic Regression Tools
|
We present Glyph - a Python package for genetic programming based symbolic
regression. Glyph is designed for usage let by numerical simulations let by
real world experiments. For experimentalists, glyph-remote provides a
separation of tasks: a ZeroMQ interface splits the genetic programming
optimization task from the evaluation of an experimental (or numerical) run.
Glyph can be accessed at http://github.com/ambrosys/glyph . Domain experts are
be able to employ symbolic regression in their experiments with ease, even if
they are not expert programmers. The reuse potential is kept high by a generic
interface design. Glyph is available on PyPI and Github.
|
cs.MS cs.NE math.OC physics.data-an
|
we present glyph a python package for genetic programming based symbolic regression glyph is designed for usage let by numerical simulations let by real world experiments for experimentalists glyphremote provides a separation of tasks a zeromq interface splits the genetic programming optimization task from the evaluation of an experimental or numerical run glyph can be accessed at httpgithubcomambrosysglyph domain experts are be able to employ symbolic regression in their experiments with ease even if they are not expert programmers the reuse potential is kept high by a generic interface design glyph is available on pypi and github
|
[['we', 'present', 'glyph', 'a', 'python', 'package', 'for', 'genetic', 'programming', 'based', 'symbolic', 'regression', 'glyph', 'is', 'designed', 'for', 'usage', 'let', 'by', 'numerical', 'simulations', 'let', 'by', 'real', 'world', 'experiments', 'for', 'experimentalists', 'glyphremote', 'provides', 'a', 'separation', 'of', 'tasks', 'a', 'zeromq', 'interface', 'splits', 'the', 'genetic', 'programming', 'optimization', 'task', 'from', 'the', 'evaluation', 'of', 'an', 'experimental', 'or', 'numerical', 'run', 'glyph', 'can', 'be', 'accessed', 'at', 'httpgithubcomambrosysglyph', 'domain', 'experts', 'are', 'be', 'able', 'to', 'employ', 'symbolic', 'regression', 'in', 'their', 'experiments', 'with', 'ease', 'even', 'if', 'they', 'are', 'not', 'expert', 'programmers', 'the', 'reuse', 'potential', 'is', 'kept', 'high', 'by', 'a', 'generic', 'interface', 'design', 'glyph', 'is', 'available', 'on', 'pypi', 'and', 'github']]
|
[-0.09184880684816131, 0.01917982125106439, -0.09914000100505195, 0.041797517111377885, -0.20353758482164458, -0.2683964970472612, 0.019894146073707625, 0.4441874463405264, -0.2841317462489793, -0.31041258742150507, 0.1345300517767962, -0.2663758388083232, -0.12898085313653082, 0.23951192954800238, -0.04961931117271122, 0.061425336166039894, 0.16014289197291395, -0.0066420710204463254, -0.02302697644642505, -0.27157208551897816, 0.23871082194933765, 0.08623790674793877, 0.2242057164934905, 0.06972678835552774, 0.07421253733091841, 0.0014176212545288236, -0.020427934035021616, -0.017852444696779313, -0.09091609538973947, 0.15548502514628987, 0.4219494640827179, 0.2748948528921526, 0.3467776587625083, -0.4296293938765302, -0.12435818148874923, 0.019518010386903036, 0.15162925955496337, 0.0645772352496064, -0.06649753643738988, -0.32335870701231456, 0.12563034884729668, -0.16213063008004897, -0.01685010193798103, -0.16789141502598987, -0.030593476444482803, -0.007605684127070402, -0.31137438248352783, -0.04143675562288416, -0.03866182758815979, 0.17610399796578444, 0.0019362370728662139, -0.1330294261245351, 0.003584266792198545, 0.13596117626753096, -0.028946721316070147, 0.054195219459698386, 0.15572920104880866, -0.06007083354419784, -0.189822831264648, 0.38387742520947205, -0.03367613219705067, -0.28063873762362884, 0.22232929752882277, -0.022546964616661794, -0.08580888168102033, 0.08832620058551822, 0.24409225496806597, 0.09262603581147759, -0.16576470927776474, 0.12839942530814658, -0.007856964555225875, 0.23897941263490602, 0.029131164315989926, -0.14724191927694177, 0.22368028073963758, 0.21634877114311646, -0.007930002718747251, 0.16363297108021613, -0.02039317622731783, -0.04245025557220766, -0.2534317427167767, -0.13145884481797876, -0.20849609041684553, -0.04329749782750456, -0.08967066066520363, -0.1602333301776334, 0.35727263366509426, 0.16808006754145027, 0.08962715689681078, 0.11044934802737676, 0.3361435333953092, 0.04892750343209819, 0.11754018042579685, 0.1323674598261469, 0.07172314381520999, -0.02888687878179266, 0.1303941911037423, -0.19447312094516267, 0.13476791588197412, 0.0038214690591159618]
|
1,803.06227
|
On the standard $L$-function for $GSp_{2n} \times GL_1$ and algebraicity
of symmetric fourth $L$-values for $GL_2$
|
We prove an explicit integral representation -- involving the pullback of a
suitable Siegel Eisenstein series -- for the twisted standard $L$-function
associated to a holomorphic vector-valued Siegel cusp form of degree $n$ and
arbitrary level. In contrast to all previously proved pullback formulas in this
situation, our formula involves only scalar-valued functions despite being
applicable to $L$-functions of vector-valued Siegel cusp forms. The key new
ingredient in our method is a novel choice of local vectors at the archimedean
place which allows us to exactly compute the archimedean local integral.
By specializing our integral representation to the case $n=2$ we are able to
prove a reciprocity law -- predicted by Deligne's conjecture -- for the
critical special values of the twisted standard $L$-function for vector-valued
Siegel cusp forms of degree 2 and arbitrary level. This arithmetic application
generalizes previously proved critical-value results for the full level case.
By specializing further to the case of Siegel cusp forms obtained via the
Ramakrishnan--Shahidi lift, we obtain a reciprocity law for the critical
special values of the symmetric fourth $L$-function of a classical newform.
|
math.NT
|
we prove an explicit integral representation involving the pullback of a suitable siegel eisenstein series for the twisted standard lfunction associated to a holomorphic vectorvalued siegel cusp form of degree n and arbitrary level in contrast to all previously proved pullback formulas in this situation our formula involves only scalarvalued functions despite being applicable to lfunctions of vectorvalued siegel cusp forms the key new ingredient in our method is a novel choice of local vectors at the archimedean place which allows us to exactly compute the archimedean local integral by specializing our integral representation to the case n2 we are able to prove a reciprocity law predicted by delignes conjecture for the critical special values of the twisted standard lfunction for vectorvalued siegel cusp forms of degree 2 and arbitrary level this arithmetic application generalizes previously proved criticalvalue results for the full level case by specializing further to the case of siegel cusp forms obtained via the ramakrishnanshahidi lift we obtain a reciprocity law for the critical special values of the symmetric fourth lfunction of a classical newform
|
[['we', 'prove', 'an', 'explicit', 'integral', 'representation', 'involving', 'the', 'pullback', 'of', 'a', 'suitable', 'siegel', 'eisenstein', 'series', 'for', 'the', 'twisted', 'standard', 'lfunction', 'associated', 'to', 'a', 'holomorphic', 'vectorvalued', 'siegel', 'cusp', 'form', 'of', 'degree', 'n', 'and', 'arbitrary', 'level', 'in', 'contrast', 'to', 'all', 'previously', 'proved', 'pullback', 'formulas', 'in', 'this', 'situation', 'our', 'formula', 'involves', 'only', 'scalarvalued', 'functions', 'despite', 'being', 'applicable', 'to', 'lfunctions', 'of', 'vectorvalued', 'siegel', 'cusp', 'forms', 'the', 'key', 'new', 'ingredient', 'in', 'our', 'method', 'is', 'a', 'novel', 'choice', 'of', 'local', 'vectors', 'at', 'the', 'archimedean', 'place', 'which', 'allows', 'us', 'to', 'exactly', 'compute', 'the', 'archimedean', 'local', 'integral', 'by', 'specializing', 'our', 'integral', 'representation', 'to', 'the', 'case', 'n2', 'we', 'are', 'able', 'to', 'prove', 'a', 'reciprocity', 'law', 'predicted', 'by', 'delignes', 'conjecture', 'for', 'the', 'critical', 'special', 'values', 'of', 'the', 'twisted', 'standard', 'lfunction', 'for', 'vectorvalued', 'siegel', 'cusp', 'forms', 'of', 'degree', '2', 'and', 'arbitrary', 'level', 'this', 'arithmetic', 'application', 'generalizes', 'previously', 'proved', 'criticalvalue', 'results', 'for', 'the', 'full', 'level', 'case', 'by', 'specializing', 'further', 'to', 'the', 'case', 'of', 'siegel', 'cusp', 'forms', 'obtained', 'via', 'the', 'ramakrishnanshahidi', 'lift', 'we', 'obtain', 'a', 'reciprocity', 'law', 'for', 'the', 'critical', 'special', 'values', 'of', 'the', 'symmetric', 'fourth', 'lfunction', 'of', 'a', 'classical', 'newform']]
|
[-0.17815629826773974, 0.0030478746796440896, -0.1287457601310135, 0.10404002389788564, -0.13311764634140258, -0.12610696723707157, 0.012061071161455899, 0.22627224934033371, -0.27647862302149984, -0.2201165043261426, 0.05876824222584467, -0.20032259808671038, -0.1984537832018263, 0.25829736850838264, -0.06869972349812253, 0.07463196685834687, -0.025487744583436077, 0.11423451306605288, -0.09638288080565292, -0.3282804947600446, 0.42642983804795553, -0.0016845118952915072, 0.22217861315849322, 0.01974447367882187, 0.08581875158018772, 0.05306888265609318, 0.018740436003678373, -0.15885784446039575, -0.13249019788451155, 0.19481938850764313, 0.3020305262815038, -0.022118896050167015, 0.23442354532678358, -0.41746633587701415, -0.13327520769565704, 0.1699459908572449, 0.10369431365556507, -0.006418282672133169, 0.0313762367374941, -0.2529867715956326, 0.05305566789254292, -0.17508475749309582, -0.25730030245772056, -0.13678285135062074, 0.018114659161338666, 0.014354027998210355, -0.343131689412985, 0.06804216601780023, 0.09380179074783386, 0.12604770878732036, -0.10614155140600898, -0.14975857992116784, -0.0053927007472587074, 0.08416896059431812, 0.020796144104679115, 0.07488498107159103, 0.07003364304281687, -0.15412629068702122, -0.076054442400081, 0.3037313633884134, -0.08300475725131533, -0.2149507446209265, 0.09918493163025811, -0.23489398589696397, -0.2110247835887342, 0.11456876776091204, 0.08518663404869255, 0.13492734063145856, -0.034278862813318316, 0.15861187621472214, -0.12539903345400075, 0.06984133183405819, 0.17567647381855006, -0.08490463763221422, 0.14345884906387338, 0.005067418826828626, 0.07031399660495068, 0.20152696083559105, -0.022084893238405293, -0.08754176896929328, -0.3562125844499943, -0.21593761483745766, -0.14061623085515088, 0.11524823547634613, -0.14017453687831055, -0.14608116828921167, 0.3829177859310717, 0.08489988539572964, 0.1908548072493762, 0.1702006565709863, 0.2176718195577533, 0.19322919924888993, 0.12589986539255318, 0.0372796901369425, 0.14079046924863095, 0.19668699385444846, 0.00013903073903003877, -0.09178699820966524, 0.004452716897834431, 0.20048083691720173]
|
1,803.06228
|
Six-vertex model and non-linear differential equations II. Continuous
symmetries
|
This paper is a continuation of our previous work "Six-vertex model and
non-linear differential equations I. Spectral problem" in which we have put
forward a method for studying the spectrum of the six-vertex model based on
non-linear differential equations. Here we intend to elaborate on that approach
and also discuss properties of the spectrum unveiled by the aforementioned
differential formulation of the transfer matrix's eigenvalue problem. In
particular, we intend to demonstrate how this differential approach allows one
to study continuous symmetries of the transfer matrix's spectrum through the
Lie groups method.
|
math-ph hep-th math.MP nlin.SI
|
this paper is a continuation of our previous work sixvertex model and nonlinear differential equations i spectral problem in which we have put forward a method for studying the spectrum of the sixvertex model based on nonlinear differential equations here we intend to elaborate on that approach and also discuss properties of the spectrum unveiled by the aforementioned differential formulation of the transfer matrixs eigenvalue problem in particular we intend to demonstrate how this differential approach allows one to study continuous symmetries of the transfer matrixs spectrum through the lie groups method
|
[['this', 'paper', 'is', 'a', 'continuation', 'of', 'our', 'previous', 'work', 'sixvertex', 'model', 'and', 'nonlinear', 'differential', 'equations', 'i', 'spectral', 'problem', 'in', 'which', 'we', 'have', 'put', 'forward', 'a', 'method', 'for', 'studying', 'the', 'spectrum', 'of', 'the', 'sixvertex', 'model', 'based', 'on', 'nonlinear', 'differential', 'equations', 'here', 'we', 'intend', 'to', 'elaborate', 'on', 'that', 'approach', 'and', 'also', 'discuss', 'properties', 'of', 'the', 'spectrum', 'unveiled', 'by', 'the', 'aforementioned', 'differential', 'formulation', 'of', 'the', 'transfer', 'matrixs', 'eigenvalue', 'problem', 'in', 'particular', 'we', 'intend', 'to', 'demonstrate', 'how', 'this', 'differential', 'approach', 'allows', 'one', 'to', 'study', 'continuous', 'symmetries', 'of', 'the', 'transfer', 'matrixs', 'spectrum', 'through', 'the', 'lie', 'groups', 'method']]
|
[-0.07276273242947039, -0.027875370599086517, -0.12261872283567715, 0.05653727388530767, -0.13220717944204807, -0.10504907560939698, 0.01624232361665117, 0.3644483598435055, -0.30078089214436227, -0.29072348923300917, 0.09627354790142778, -0.25527264601212507, -0.2340484089521772, 0.17460655584506204, -0.0503217389796982, 0.08993604079739231, 0.0459891494727977, 0.002257079592116339, -0.09178454376524314, -0.18651220647354974, 0.42117421197421523, 0.011474505998194218, 0.25794195909680717, 0.04258404152832278, 0.11362930168094032, 0.00130747698004479, -0.05874215874254056, -0.02064914278605062, -0.17502525088204254, 0.19483088905690238, 0.21897044360799633, 0.09232275334753744, 0.257787240345193, -0.41579931142294535, -0.22192848109356736, 0.08904489242147816, 0.1563561283679598, 0.12523717206837, -0.03634456977622746, -0.25236574503714626, 0.059157003425871546, -0.18487925708050962, -0.1391448611241725, -0.07989082448994336, -0.03345856868722678, -0.010730966092998406, -0.23707348343653037, 0.0658627979671861, 0.09141586069017649, 0.015620892432153873, -0.08319705504602651, -0.08317770253684696, -0.009888258203357944, 0.08714207090720859, 0.02186724748057516, -0.0701121855096932, 0.04813500293328062, -0.09356041820011222, -0.13641471578739583, 0.3557810201005929, -0.08171258522602527, -0.2588886037954818, 0.13099104178431648, -0.16980640520278426, -0.17460114976553165, 0.06981346074431001, 0.21131651559034767, 0.18752240186617913, -0.18374479791837867, 0.12316253440044618, -0.08294490240919201, 0.13283309460688464, -0.00852705027132881, -0.03369705475684579, 0.12706952953063275, 0.16275978766371618, 0.07763301168882247, 0.1439096149634165, -0.04031902838640077, -0.11824538711073768, -0.2988479206662463, -0.1501846367786841, -0.1333709605058412, 0.04840663806332842, -0.01906827145285206, -0.13254925757697175, 0.4515503384577839, 0.2271662892713009, 0.20175686875439208, 0.05765644164183987, 0.2899562640358572, 0.21054461256869178, 0.001319708889755218, 0.014385108345026232, 0.2055348116479328, 0.18437375175088402, 0.1413939523804204, -0.2762226329600114, -0.011572077834938207, 0.122831956949085]
|
1,803.06229
|
Further Consequences of the Colorful Helly Hypothesis
|
Let $\mathcal{F}$ be a family of convex sets in ${\mathbb R}^d$, which are
colored with $d+1$ colors. We say that $\mathcal{F}$ satisfies the Colorful
Helly Property if every rainbow selection of $d+1$ sets, one set from each
color class, has a non-empty common intersection. The Colorful Helly Theorem of
Lov\'asz states that for any such colorful family $\mathcal{F}$ there is a
color class $\mathcal{F}_i\subset \mathcal{F}$, for $1\leq i\leq d+1$, whose
sets have a non-empty intersection.
We establish further consequences of the Colorful Helly hypothesis. In
particular, we show that for each dimension $d\geq 2$ there exist numbers
$f(d)$ and $g(d)$ with the following property: either one can find an
additional color class whose sets can be pierced by $f(d)$ points, or all the
sets in $\mathcal{F}$ can be crossed by $g(d)$ lines.
|
math.CO cs.CG
|
let mathcalf be a family of convex sets in mathbb rd which are colored with d1 colors we say that mathcalf satisfies the colorful helly property if every rainbow selection of d1 sets one set from each color class has a nonempty common intersection the colorful helly theorem of lovasz states that for any such colorful family mathcalf there is a color class mathcalf_isubset mathcalf for 1leq ileq d1 whose sets have a nonempty intersection we establish further consequences of the colorful helly hypothesis in particular we show that for each dimension dgeq 2 there exist numbers fd and gd with the following property either one can find an additional color class whose sets can be pierced by fd points or all the sets in mathcalf can be crossed by gd lines
|
[['let', 'mathcalf', 'be', 'a', 'family', 'of', 'convex', 'sets', 'in', 'mathbb', 'rd', 'which', 'are', 'colored', 'with', 'd1', 'colors', 'we', 'say', 'that', 'mathcalf', 'satisfies', 'the', 'colorful', 'helly', 'property', 'if', 'every', 'rainbow', 'selection', 'of', 'd1', 'sets', 'one', 'set', 'from', 'each', 'color', 'class', 'has', 'a', 'nonempty', 'common', 'intersection', 'the', 'colorful', 'helly', 'theorem', 'of', 'lovasz', 'states', 'that', 'for', 'any', 'such', 'colorful', 'family', 'mathcalf', 'there', 'is', 'a', 'color', 'class', 'mathcalf_isubset', 'mathcalf', 'for', '1leq', 'ileq', 'd1', 'whose', 'sets', 'have', 'a', 'nonempty', 'intersection', 'we', 'establish', 'further', 'consequences', 'of', 'the', 'colorful', 'helly', 'hypothesis', 'in', 'particular', 'we', 'show', 'that', 'for', 'each', 'dimension', 'dgeq', '2', 'there', 'exist', 'numbers', 'fd', 'and', 'gd', 'with', 'the', 'following', 'property', 'either', 'one', 'can', 'find', 'an', 'additional', 'color', 'class', 'whose', 'sets', 'can', 'be', 'pierced', 'by', 'fd', 'points', 'or', 'all', 'the', 'sets', 'in', 'mathcalf', 'can', 'be', 'crossed', 'by', 'gd', 'lines']]
|
[-0.15756401445944118, 0.1500461520814872, -0.03492605723156274, 0.030723713563207737, -0.030930633678008582, -0.21044022203174256, 0.014960935298452964, 0.3634224376118678, -0.2763918849803109, -0.18581997674693468, 0.07346843935119145, -0.34979259620868525, -0.08930296612412932, 0.12323821811823046, -0.16862033854615482, -0.008311902236847477, 0.08383974633606164, 0.09783910689093457, 0.013069900593414676, -0.27331225947612003, 0.3554626798314106, -0.22043678592463942, 0.19166436685490926, 0.048232125466732126, 0.0661826707149024, 0.01800841471990784, 0.09283056127561526, 0.13151423043557195, -0.18564904272063762, 0.08377838974866575, 0.26569605844792066, 0.2327806111514028, 0.2798439238917168, -0.34454361214511314, -0.19576312616495914, 0.3232201278202577, 0.10581568589803712, -0.023056638204023414, -0.04391880638769451, -0.2208888183227022, 0.16778894417869453, -0.08355600896263886, -0.1783723765415431, -0.029135625887633736, 0.11508144523223279, 0.03843458547818524, -0.33477590479070446, -0.08099366152900776, 0.1787888975067505, 0.08305784152067117, 0.022754276594331928, -0.1842796779841981, -0.12411300164562089, 0.03241316687745817, -0.08284533223784209, 0.1160809038462871, 0.012718367528522258, -0.028598104973273877, -0.15543349198321635, 0.35830083964232584, -0.005645226800053573, -0.22057939563941864, 0.13505209578940544, -0.17335524794091078, -0.2221311841885211, 0.11041385754374147, 0.054698781879931574, 0.16187716737915656, -0.10304640170243633, 0.17557423610110476, -0.21254587430997487, 0.10645889130399655, 0.1780809193728705, 0.10921118850108834, 0.20415676474386385, 0.0820176805038972, 0.1435563005382579, 0.17408267031414862, -0.05347339726472629, 0.04292447754103719, -0.3606893267084397, -0.11118077540784392, -0.20167731987188023, 0.12129168563437087, -0.15933117767756375, -0.18856512563914515, 0.33151528284927645, 0.06349781765566982, 0.16445277184461252, 0.07537647684456653, 0.18123823682997972, 0.044699403463675326, 0.07938240622774563, 0.16574578499066012, 0.09122778795204545, 0.09547412761208025, -0.10906278738709352, -0.1142989607285246, 0.024215101484806482, 0.1986094466872684]
|
1,803.0623
|
Power Distribution System Synchrophasors with Non-Gaussian Errors:
Real-World Measurements and Analysis
|
This letter studies the synchrophasor measurement error of electric power
distribution systems with on-line and off-line measurements using graphical and
numerical tests. It demonstrates that the synchrophasor measurement error
follows a non-Gaussian distribution instead of the traditionally-assumed
Gaussian distribution. It suggests the need to use non-Gaussian or Gaussian
mixture models to represent the synchrophasor measurement error. These models
are more realistic to accurately represent the error than the traditional
Gaussian model. The measurements and underlying analysis will be helpful for
the understanding of distribution system measurement characteristics, and also
for the modeling and simulation of distribution system applications.
|
eess.SP
|
this letter studies the synchrophasor measurement error of electric power distribution systems with online and offline measurements using graphical and numerical tests it demonstrates that the synchrophasor measurement error follows a nongaussian distribution instead of the traditionallyassumed gaussian distribution it suggests the need to use nongaussian or gaussian mixture models to represent the synchrophasor measurement error these models are more realistic to accurately represent the error than the traditional gaussian model the measurements and underlying analysis will be helpful for the understanding of distribution system measurement characteristics and also for the modeling and simulation of distribution system applications
|
[['this', 'letter', 'studies', 'the', 'synchrophasor', 'measurement', 'error', 'of', 'electric', 'power', 'distribution', 'systems', 'with', 'online', 'and', 'offline', 'measurements', 'using', 'graphical', 'and', 'numerical', 'tests', 'it', 'demonstrates', 'that', 'the', 'synchrophasor', 'measurement', 'error', 'follows', 'a', 'nongaussian', 'distribution', 'instead', 'of', 'the', 'traditionallyassumed', 'gaussian', 'distribution', 'it', 'suggests', 'the', 'need', 'to', 'use', 'nongaussian', 'or', 'gaussian', 'mixture', 'models', 'to', 'represent', 'the', 'synchrophasor', 'measurement', 'error', 'these', 'models', 'are', 'more', 'realistic', 'to', 'accurately', 'represent', 'the', 'error', 'than', 'the', 'traditional', 'gaussian', 'model', 'the', 'measurements', 'and', 'underlying', 'analysis', 'will', 'be', 'helpful', 'for', 'the', 'understanding', 'of', 'distribution', 'system', 'measurement', 'characteristics', 'and', 'also', 'for', 'the', 'modeling', 'and', 'simulation', 'of', 'distribution', 'system', 'applications']]
|
[-0.05777354541681131, 0.043934314406102466, -0.13413640495735346, 0.08591854552493536, -0.02903478290194396, -0.1723218924922811, 0.03822809210066328, 0.36379219269015123, -0.25349807263035135, -0.34810485218449966, 0.11312161000042233, -0.2829199183261809, -0.12927695224781702, 0.2386736130466704, -0.044063468943782075, 0.1521750623168251, 0.10108487302264602, -0.026550399720399957, -0.07279970131804879, -0.1969090798754514, 0.2928605900990978, 0.13143434066363832, 0.3426928281899273, -0.051682853003118916, 0.06001983565691205, 0.035358949242755004, -0.0864962995359578, -0.01598343686152672, -0.09057764333383883, 0.1273927849227774, 0.20785078180801742, 0.14950723827038845, 0.2589167178675686, -0.37712544621419664, -0.2792750590759301, 0.14092873351782867, 0.12994206027060592, 0.12461446578969661, -0.02438705704806819, -0.29416313542763595, 0.05662058700432943, -0.1813658558158684, -0.09647570212957324, -0.1059710289130813, -0.045189982577774325, 0.05886665792636497, -0.35073452260460436, 0.12253544543666967, 0.05576069745206341, 0.05115517184675969, -0.019575843961967022, -0.13784600242002645, 0.0411380662501204, 0.1431299170224745, -0.0018239811833314214, -0.01822493538817333, 0.18304892518010335, -0.11455334191805847, -0.08365015966395281, 0.34039722156432484, -0.04239168262949871, -0.24983999593970702, 0.13091336962522113, -0.141485618216168, -0.12772880291047783, 0.0914496350553386, 0.23659869356407331, 0.04664722371116741, -0.16918459964781693, -0.030498437512037103, 0.014873612307242512, 0.19532952273322135, -0.03559681036288744, 0.02741914535824632, 0.19581179096142656, 0.1728321926118614, 0.016759501338081875, 0.09156890781764325, -0.14190337441371964, -0.10801643963672758, -0.3175800775955479, -0.13359876723537586, -0.21466218168396003, 0.03211103580752868, -0.0902166669057459, -0.15290472012243628, 0.38456621512617034, 0.23222177789652163, 0.15048983384922301, 0.08108237550891552, 0.37219078479737966, 0.125502650681211, 0.010948714080084231, 0.06485597507490479, 0.20229469160021274, 0.1446633266918745, 0.0895091713857405, -0.16818348642861106, 0.15450264647190182, -0.08646894909787117]
|
1,803.06231
|
A Programmable CMOS Transceiver for Structural Health Monitoring
|
We describe a highly-integrated CMOS transceiver for active structural health
monitoring (SHM). The chip actuates piezoelectric transducers and also senses
ultrasound waves received by the same or another transducer. The transmitter
uses an integer-N frequency synthesizer and pulse-width modulation (PWM) to
generate low-distortion, band-limited waveforms up to 12.7 Vpp with center
frequency from 0.1-2.75 MHz. The integrated offset-canceling fully-differential
receiver has programmable gain and bandwidth, and uses quadrature demodulation
to extract both amplitude and phase of the received waveforms for further
signal processing. The transceiver was fabricated in a 0.5 um CMOS process and
has been validated using (2D) damage localization on an SHM test bed.
|
eess.SP
|
we describe a highlyintegrated cmos transceiver for active structural health monitoring shm the chip actuates piezoelectric transducers and also senses ultrasound waves received by the same or another transducer the transmitter uses an integern frequency synthesizer and pulsewidth modulation pwm to generate lowdistortion bandlimited waveforms up to 127 vpp with center frequency from 01275 mhz the integrated offsetcanceling fullydifferential receiver has programmable gain and bandwidth and uses quadrature demodulation to extract both amplitude and phase of the received waveforms for further signal processing the transceiver was fabricated in a 05 um cmos process and has been validated using 2d damage localization on an shm test bed
|
[['we', 'describe', 'a', 'highlyintegrated', 'cmos', 'transceiver', 'for', 'active', 'structural', 'health', 'monitoring', 'shm', 'the', 'chip', 'actuates', 'piezoelectric', 'transducers', 'and', 'also', 'senses', 'ultrasound', 'waves', 'received', 'by', 'the', 'same', 'or', 'another', 'transducer', 'the', 'transmitter', 'uses', 'an', 'integern', 'frequency', 'synthesizer', 'and', 'pulsewidth', 'modulation', 'pwm', 'to', 'generate', 'lowdistortion', 'bandlimited', 'waveforms', 'up', 'to', '127', 'vpp', 'with', 'center', 'frequency', 'from', '01275', 'mhz', 'the', 'integrated', 'offsetcanceling', 'fullydifferential', 'receiver', 'has', 'programmable', 'gain', 'and', 'bandwidth', 'and', 'uses', 'quadrature', 'demodulation', 'to', 'extract', 'both', 'amplitude', 'and', 'phase', 'of', 'the', 'received', 'waveforms', 'for', 'further', 'signal', 'processing', 'the', 'transceiver', 'was', 'fabricated', 'in', 'a', '05', 'um', 'cmos', 'process', 'and', 'has', 'been', 'validated', 'using', '2d', 'damage', 'localization', 'on', 'an', 'shm', 'test', 'bed']]
|
[-0.13412912773828095, 0.08332686216034255, -0.034897896525553036, -0.0747492597767737, -0.11112033757560241, -0.20793703397234473, 0.06031297702037801, 0.4755499545448961, -0.22673913397682974, -0.262848247666485, 0.10159280530709881, -0.27281951452515874, -0.1389928253058595, 0.26700016239863966, -0.08328865124629094, 0.1362172038598846, 0.0025034012326684138, 0.0012167679871289204, -0.02835399584728293, -0.129641467888947, 0.12297569323653498, 0.1179356194781856, 0.38756161796538013, -0.04065639132526345, 0.1851505268132314, 0.006008752478429904, 0.0011629840502372156, -0.1299550493467205, -0.07178680565602218, 0.057355507210489196, 0.33624578653073584, 0.11804702974040993, 0.21846878037411863, -0.40372970804142266, -0.228882726523667, 0.054649979377595276, 0.09745349731047799, 0.08409583215745023, -0.09037655172085998, -0.3212316434991618, 0.1236200387088152, -0.18739011752096793, 0.011269648680284333, 0.014725653450183857, 0.0013733514060731977, 0.042856212655561436, -0.3006272593405671, 0.017006451881640645, 0.004146726864676636, 0.08164190320530906, -0.042176969221775204, -0.10295320874026331, -0.002992480935063213, 0.133402909058182, -0.08966092898789121, 0.06350200878380118, 0.1912285832625527, -0.03290658087028602, -0.1337170994374901, 0.32260368928725186, -0.019122289379503436, -0.16814162075304642, 0.12699644638912735, -0.10950649764093284, 0.007274211185106721, 0.18940676478758597, 0.2501191935376622, -0.019153660486783616, -0.201974225147681, 0.00897439098760235, 0.11417419106202523, 0.33568952799452323, 0.20672366374324505, 0.054830226192000106, 0.1735242210337534, 0.22574351974225676, 0.047373108610582464, 0.18164406284743634, -0.1997406821711383, 0.051736777706537396, -0.1977286408834446, -0.10495193264796399, -0.20438447162786572, -0.008477485922272675, -0.054481754741293395, -0.13023111849682978, 0.41646956972992766, 0.1338159336681621, 0.07520426689342667, 0.08105416751305501, 0.40073857543197494, 0.13477983754889394, 0.1275158101836076, 0.012998519595175121, 0.24922266249464323, 0.16861869154112916, 0.17136476471429118, -0.1867870466779165, -0.012897977081593126, -0.02874918669784585]
|
1,803.06232
|
Free Energies and the Reversed HLS Inequality
|
We prove reversed Hardy-Littlewood-Sobolev inequalities by carefully studying
the natural associated free energies with direct methods of calculus of
variations. Tightness is obtained by a dyadic argument, which quantifies the
relative strength of the entropy functional versus the interaction energy. The
existence of optimizers is shown in the class of $\prob$. With respect to their
regularity, we study conditions for optimizers to be bounded functions. In a
related model, we show the condensation phenomena, which suggests that
optimizers are not in general regular.
|
math.AP
|
we prove reversed hardylittlewoodsobolev inequalities by carefully studying the natural associated free energies with direct methods of calculus of variations tightness is obtained by a dyadic argument which quantifies the relative strength of the entropy functional versus the interaction energy the existence of optimizers is shown in the class of prob with respect to their regularity we study conditions for optimizers to be bounded functions in a related model we show the condensation phenomena which suggests that optimizers are not in general regular
|
[['we', 'prove', 'reversed', 'hardylittlewoodsobolev', 'inequalities', 'by', 'carefully', 'studying', 'the', 'natural', 'associated', 'free', 'energies', 'with', 'direct', 'methods', 'of', 'calculus', 'of', 'variations', 'tightness', 'is', 'obtained', 'by', 'a', 'dyadic', 'argument', 'which', 'quantifies', 'the', 'relative', 'strength', 'of', 'the', 'entropy', 'functional', 'versus', 'the', 'interaction', 'energy', 'the', 'existence', 'of', 'optimizers', 'is', 'shown', 'in', 'the', 'class', 'of', 'prob', 'with', 'respect', 'to', 'their', 'regularity', 'we', 'study', 'conditions', 'for', 'optimizers', 'to', 'be', 'bounded', 'functions', 'in', 'a', 'related', 'model', 'we', 'show', 'the', 'condensation', 'phenomena', 'which', 'suggests', 'that', 'optimizers', 'are', 'not', 'in', 'general', 'regular']]
|
[-0.1053831865660375, 0.0998201258676912, -0.07878836320645838, 0.1478883656981704, -0.02360125134856137, -0.10129027120230427, 0.024196818089449262, 0.34502095275794165, -0.3169440859536001, -0.2859070088289375, 0.09052527133033174, -0.24279055926185775, -0.14219101503244544, 0.21801243639264975, -0.0974426157548126, 0.055499794825642226, 0.03920159864811653, 0.043840235489117634, -0.10805653918990185, -0.2035108610583716, 0.35368598094322234, -0.008451990771993816, 0.2396097359000649, 0.12378628266391804, 0.04882237238876791, -0.016114087722051036, -0.019511576792427217, 0.057733386519353794, -0.1902440647256781, 0.1574168219006654, 0.2105235561415699, 0.11215139734446554, 0.3180141229945493, -0.3762274163000914, -0.20361594274550318, 0.15360407912767077, 0.06031366844145379, 0.05613435914807291, -0.021731182901996625, -0.30349064678941146, 0.08882513730955052, -0.09940592850087188, -0.17160416559417205, -0.08234203193920205, -0.006064281355679394, 0.10758862000082182, -0.29338555478109385, 0.10570511139974177, 0.10179984905935491, 0.053234829142386746, -0.12530305577127868, -0.041934542137714304, -0.04448676069480288, 0.04156301175636879, 0.08222201578066606, 0.023066560673269343, 0.09944067081346748, -0.10995638727894928, -0.14722524938476553, 0.33137906626629904, -0.07694492443094411, -0.2342609160478754, 0.19640005487634474, -0.1416907550722181, -0.13666925079424877, 0.07959102736561592, 0.1210246557834087, 0.1643169492662671, -0.1338737104088068, 0.1299959676991026, -0.04560954309018127, 0.1395397484751351, 0.062223285352474594, 0.06079056166485513, 0.12083185183624905, 0.11851465428831527, 0.11823774917971298, 0.1926366703862504, 0.01020415605772399, -0.12698996796396123, -0.31797183971537885, -0.17357443857668753, -0.17758620963487998, 0.03464379963336697, -0.10431071930019331, -0.16804409821073144, 0.38426008649978294, 0.1305841036724398, 0.1810478612230754, 0.07885280015025602, 0.19339167607207614, 0.17975459658507123, 0.08206490578455289, 0.06026176109640713, 0.24744196906012583, 0.15501653910221824, 0.08864497133048184, -0.20714077124574098, 0.10718750936282148, 0.12801504986278617]
|
1,803.06233
|
Five-dimensional warped product space-time with time-dependent warping
and a scalar field in the bulk
|
We have considered gravity in a five-dimensional warped product space-time,
with a time-dependent warp factor and a time-dependent extra dimension. The
five-dimensional field equations are derived for a spatially flat FRW brane and
the energy conditions and the nature of bulk geometry have been examined. It is
found that the expansion of the four-dimensional universe depends on its
location along the extra dimension and will be different at different locations
in the bulk spacetime. At low energies, the trapping of fields within the brane
implies a specific correlation between the warp factor and the
extra-dimensional scale factor. Generally, the bulk is not conformally flat. At
high energies, the bulk is assumed to be sourced by a scalar field with
self-interaction. The analysis shows that the potential of the scalar field
source of gravity at a given position along the fifth dimension, is related to
the Hubble parameter on the brane at that position in the bulk.
|
gr-qc hep-th
|
we have considered gravity in a fivedimensional warped product spacetime with a timedependent warp factor and a timedependent extra dimension the fivedimensional field equations are derived for a spatially flat frw brane and the energy conditions and the nature of bulk geometry have been examined it is found that the expansion of the fourdimensional universe depends on its location along the extra dimension and will be different at different locations in the bulk spacetime at low energies the trapping of fields within the brane implies a specific correlation between the warp factor and the extradimensional scale factor generally the bulk is not conformally flat at high energies the bulk is assumed to be sourced by a scalar field with selfinteraction the analysis shows that the potential of the scalar field source of gravity at a given position along the fifth dimension is related to the hubble parameter on the brane at that position in the bulk
|
[['we', 'have', 'considered', 'gravity', 'in', 'a', 'fivedimensional', 'warped', 'product', 'spacetime', 'with', 'a', 'timedependent', 'warp', 'factor', 'and', 'a', 'timedependent', 'extra', 'dimension', 'the', 'fivedimensional', 'field', 'equations', 'are', 'derived', 'for', 'a', 'spatially', 'flat', 'frw', 'brane', 'and', 'the', 'energy', 'conditions', 'and', 'the', 'nature', 'of', 'bulk', 'geometry', 'have', 'been', 'examined', 'it', 'is', 'found', 'that', 'the', 'expansion', 'of', 'the', 'fourdimensional', 'universe', 'depends', 'on', 'its', 'location', 'along', 'the', 'extra', 'dimension', 'and', 'will', 'be', 'different', 'at', 'different', 'locations', 'in', 'the', 'bulk', 'spacetime', 'at', 'low', 'energies', 'the', 'trapping', 'of', 'fields', 'within', 'the', 'brane', 'implies', 'a', 'specific', 'correlation', 'between', 'the', 'warp', 'factor', 'and', 'the', 'extradimensional', 'scale', 'factor', 'generally', 'the', 'bulk', 'is', 'not', 'conformally', 'flat', 'at', 'high', 'energies', 'the', 'bulk', 'is', 'assumed', 'to', 'be', 'sourced', 'by', 'a', 'scalar', 'field', 'with', 'selfinteraction', 'the', 'analysis', 'shows', 'that', 'the', 'potential', 'of', 'the', 'scalar', 'field', 'source', 'of', 'gravity', 'at', 'a', 'given', 'position', 'along', 'the', 'fifth', 'dimension', 'is', 'related', 'to', 'the', 'hubble', 'parameter', 'on', 'the', 'brane', 'at', 'that', 'position', 'in', 'the', 'bulk']]
|
[-0.16049145791942301, 0.1476944594954451, -0.06595224011928225, 0.06411043167388879, -0.07682133885995987, -0.13623579137642175, -0.07192340871104254, 0.3325049709648085, -0.19172043500778577, -0.2866297724689596, 0.08306751406351583, -0.23966542202740526, -0.07084791007815884, 0.1441739703146502, -0.012119005674508233, -0.025450971624172196, -0.05521507672099874, 0.08446644395828629, -0.0854756718299774, -0.24180385162337467, 0.41207112264461243, 0.10665522320190436, 0.2799648513423446, 0.054726628238523305, 0.10614870498195672, -0.058696891176693425, -0.0066882852667894885, 0.07400516673731498, -0.13662431727514046, 0.07985176108419322, 0.15865007671527565, 0.0403815764718904, 0.18721677960517505, -0.40064681966144305, -0.2575781633181927, 0.06309519353836106, 0.1476331274868407, 0.13856222569787255, -0.030726489913202107, -0.2791750496372772, 0.04735198773694439, -0.11546100473676163, -0.18453830142374125, -0.0015010017489727873, 0.033239160409907646, -0.09123764097547302, -0.2280255800071292, 0.11781072296435013, -0.04301320925841514, 0.00790753363010784, -0.11661298197876209, -0.06661725957513763, -0.08319555937897605, 0.06455586063869607, 0.11798852060112552, 0.07826508885064425, 0.1625555572249234, -0.14684704838034052, -0.06532738929523382, 0.3777993018321024, -0.12196774436877324, -0.25577531210505045, 0.17063805350335315, -0.1961181376260729, -0.0845315956319563, 0.1445425210881811, 0.1463007690050663, 0.11813735846692744, -0.13442410077326572, 0.19975327694387837, 0.009979631784610832, 0.1581732088025325, 0.1109349278252548, 0.041200513032097846, 0.2809270965413023, 0.11050396684396009, 0.05006740985509868, 0.11024799607604599, -0.08776586103694847, -0.09241353584907185, -0.37916484945573103, -0.1474975788882241, -0.17936550486289585, 0.07132322110994256, -0.21230167942970488, -0.17467846079036975, 0.3892014828176262, 0.060094168282935595, 0.18401477094262075, -0.012650945192525307, 0.23797850883924043, 0.10357260338078515, 0.10454107381594487, 0.12724903880809554, 0.3212412359455648, 0.09180777927394956, 0.1210511730542072, -0.2329699152898497, -0.044673284030674644, 0.050583757676530436]
|
1,803.06234
|
Approximate Method of Variational Bayesian Matrix
Factorization/Completion with Sparse Prior
|
We derive analytical expression of matrix factorization/completion solution
by variational Bayes method, under the assumption that observed matrix is
originally the product of low-rank dense and sparse matrices with additive
noise. We assume the prior of sparse matrix is Laplace distribution by taking
matrix sparsity into consideration. Then we use several approximations for
derivation of matrix factorization/completion solution. By our solution, we
also numerically evaluate the performance of sparse matrix reconstruction in
matrix factorization, and completion of missing matrix element in matrix
completion.
|
eess.SP cond-mat.dis-nn cs.IT cs.LG math.IT
|
we derive analytical expression of matrix factorizationcompletion solution by variational bayes method under the assumption that observed matrix is originally the product of lowrank dense and sparse matrices with additive noise we assume the prior of sparse matrix is laplace distribution by taking matrix sparsity into consideration then we use several approximations for derivation of matrix factorizationcompletion solution by our solution we also numerically evaluate the performance of sparse matrix reconstruction in matrix factorization and completion of missing matrix element in matrix completion
|
[['we', 'derive', 'analytical', 'expression', 'of', 'matrix', 'factorizationcompletion', 'solution', 'by', 'variational', 'bayes', 'method', 'under', 'the', 'assumption', 'that', 'observed', 'matrix', 'is', 'originally', 'the', 'product', 'of', 'lowrank', 'dense', 'and', 'sparse', 'matrices', 'with', 'additive', 'noise', 'we', 'assume', 'the', 'prior', 'of', 'sparse', 'matrix', 'is', 'laplace', 'distribution', 'by', 'taking', 'matrix', 'sparsity', 'into', 'consideration', 'then', 'we', 'use', 'several', 'approximations', 'for', 'derivation', 'of', 'matrix', 'factorizationcompletion', 'solution', 'by', 'our', 'solution', 'we', 'also', 'numerically', 'evaluate', 'the', 'performance', 'of', 'sparse', 'matrix', 'reconstruction', 'in', 'matrix', 'factorization', 'and', 'completion', 'of', 'missing', 'matrix', 'element', 'in', 'matrix', 'completion']]
|
[-0.0281418909629186, 0.0036070294402263782, -0.07393584809737441, 0.045426286150482886, -0.05955995789464609, -0.10531142459791383, 0.02780204825534451, 0.4282816163045757, -0.31288379304007524, -0.22899061673102372, 0.1837551829456869, -0.23588153757521435, -0.27143370721167254, 0.033073382978155104, -0.052292883614607065, 0.15180187286625121, 0.13454329815440247, 0.029422956599313536, -0.19287223727327346, -0.22836806496352324, 0.353955087746367, 0.03375278254625974, 0.2720819392391009, -0.009574499456240669, 0.14358537322784096, 0.064843700645365, -0.08140884843413476, -0.03469398720074951, -0.030208103523038494, 0.12529784098646982, 0.2688848286131282, 0.23889891941238334, 0.24851641354702966, -0.4749332325142107, -0.1802234171119369, 0.11358046862886023, 0.11730985956864408, 0.07837383547383878, -0.06624298590633523, -0.28183474279020304, 0.15038331502611624, -0.23237537420182316, -0.051203124748289953, -0.13515111005198163, -0.04076784327166316, -0.05298264745484899, -0.41506683154974455, 0.10267780830955742, 0.026846648009930862, -0.04477906951473819, -0.062446131106512044, -0.2514021054232194, 0.17048020509249864, 0.06536243025811365, 0.055803312419879215, -0.0932131130952549, 0.10765054537397292, -0.08018811862478478, 0.010348856426131578, 0.3299996731687843, -0.10983515813670776, -0.2981883017691197, 0.05606824497657793, -0.11955317674940567, -0.12726235428802024, 0.15979984272731307, 0.16597378044676633, 0.05092179707400961, -0.1786013378152325, 0.17180082254129014, -0.11371431390490429, 0.13012719943107645, 0.03776102034765997, -0.03538244003200053, 0.04026924021093658, 0.13688118180926936, 0.10350819081527951, 0.11547913812072143, -0.034974617768584945, -0.0870550841001081, -0.2556962422382684, -0.12231372333315696, -0.3184673150276972, 0.06081195975320391, -0.22146148522589987, -0.21366816257805, 0.3886090473352391, 0.1233827471445648, 0.21526096449636015, 0.09619894284283581, 0.32010573497111044, 0.15848775191468267, -0.008241738968839249, 0.09282932386814076, 0.1343658039127879, 0.28543813868833956, -0.0032564645468179756, -0.19331810270137165, 0.10114738276159321, 0.18277600193741145]
|
1,803.06235
|
Identifying Components from Object-Oriented APIs Based on Dynamic
Analysis
|
The reuse at the component level is generally more effective than the one at
the object-oriented class level. This is due to the granularity level where
components expose their functionalities at an abstract level compared to the
fine-grained object-oriented classes. Moreover, components clearly define their
dependencies through their provided and required interfaces in an explicit way
that facilitates the understanding of how to reuse these components. Therefore,
several component identification approaches have been proposed to identify
components based on the analysis object-oriented software applications.
Nevertheless, most of the existing component identification approaches did not
consider co-usage dependencies between API classes to identify classes/methods
that can be reused to implement a specific scenario. In this paper, we propose
an approach to identify reusable software components in object-oriented APIs,
based on the interactions between client applications and the targeted API. As
we are dealing with actual clients using the API, dynamic analysis allows to
better capture the instances of API usage. Approaches using static analysis are
usually limited by the difficulty of handling dynamic features such as
polymorphism and class loading. We evaluate our approach by applying it to
three Java APIs with eight client applications from the DaCapo benchmark.
DaCapo provides a set of pre-defined usage scenarios. The results show that our
component identification approach has a very high precision.
|
cs.SE
|
the reuse at the component level is generally more effective than the one at the objectoriented class level this is due to the granularity level where components expose their functionalities at an abstract level compared to the finegrained objectoriented classes moreover components clearly define their dependencies through their provided and required interfaces in an explicit way that facilitates the understanding of how to reuse these components therefore several component identification approaches have been proposed to identify components based on the analysis objectoriented software applications nevertheless most of the existing component identification approaches did not consider cousage dependencies between api classes to identify classesmethods that can be reused to implement a specific scenario in this paper we propose an approach to identify reusable software components in objectoriented apis based on the interactions between client applications and the targeted api as we are dealing with actual clients using the api dynamic analysis allows to better capture the instances of api usage approaches using static analysis are usually limited by the difficulty of handling dynamic features such as polymorphism and class loading we evaluate our approach by applying it to three java apis with eight client applications from the dacapo benchmark dacapo provides a set of predefined usage scenarios the results show that our component identification approach has a very high precision
|
[['the', 'reuse', 'at', 'the', 'component', 'level', 'is', 'generally', 'more', 'effective', 'than', 'the', 'one', 'at', 'the', 'objectoriented', 'class', 'level', 'this', 'is', 'due', 'to', 'the', 'granularity', 'level', 'where', 'components', 'expose', 'their', 'functionalities', 'at', 'an', 'abstract', 'level', 'compared', 'to', 'the', 'finegrained', 'objectoriented', 'classes', 'moreover', 'components', 'clearly', 'define', 'their', 'dependencies', 'through', 'their', 'provided', 'and', 'required', 'interfaces', 'in', 'an', 'explicit', 'way', 'that', 'facilitates', 'the', 'understanding', 'of', 'how', 'to', 'reuse', 'these', 'components', 'therefore', 'several', 'component', 'identification', 'approaches', 'have', 'been', 'proposed', 'to', 'identify', 'components', 'based', 'on', 'the', 'analysis', 'objectoriented', 'software', 'applications', 'nevertheless', 'most', 'of', 'the', 'existing', 'component', 'identification', 'approaches', 'did', 'not', 'consider', 'cousage', 'dependencies', 'between', 'api', 'classes', 'to', 'identify', 'classesmethods', 'that', 'can', 'be', 'reused', 'to', 'implement', 'a', 'specific', 'scenario', 'in', 'this', 'paper', 'we', 'propose', 'an', 'approach', 'to', 'identify', 'reusable', 'software', 'components', 'in', 'objectoriented', 'apis', 'based', 'on', 'the', 'interactions', 'between', 'client', 'applications', 'and', 'the', 'targeted', 'api', 'as', 'we', 'are', 'dealing', 'with', 'actual', 'clients', 'using', 'the', 'api', 'dynamic', 'analysis', 'allows', 'to', 'better', 'capture', 'the', 'instances', 'of', 'api', 'usage', 'approaches', 'using', 'static', 'analysis', 'are', 'usually', 'limited', 'by', 'the', 'difficulty', 'of', 'handling', 'dynamic', 'features', 'such', 'as', 'polymorphism', 'and', 'class', 'loading', 'we', 'evaluate', 'our', 'approach', 'by', 'applying', 'it', 'to', 'three', 'java', 'apis', 'with', 'eight', 'client', 'applications', 'from', 'the', 'dacapo', 'benchmark', 'dacapo', 'provides', 'a', 'set', 'of', 'predefined', 'usage', 'scenarios', 'the', 'results', 'show', 'that', 'our', 'component', 'identification', 'approach', 'has', 'a', 'very', 'high', 'precision']]
|
[-0.09096121499389666, -0.006775684322888958, -0.07472805257639933, 0.05402245174093736, -0.1365798034367724, -0.16996846062028695, 0.04499386414862024, 0.4073215849663413, -0.26410428115322654, -0.3663327951719045, 0.09025116371836753, -0.26555682514339457, -0.12379230078044903, 0.21595069975805803, -0.04750257447883145, 0.03278853937635335, 0.06583154276643512, 0.013058224628858884, -0.055875582313976775, -0.21400393051236286, 0.3140808644740834, 0.03777515758822219, 0.3176836040417809, 0.06205139088512766, 0.05609268462712612, -0.014100047634752177, -0.051351029369253835, -0.013009972316576083, -0.04131654258483007, 0.17943374900181497, 0.3505149038247935, 0.21065166050358888, 0.2890784848169552, -0.40519927930270555, -0.1826538092589194, 0.02331687059838735, 0.13202639326769347, 0.08279229334871703, -0.0077095518229500426, -0.28589842714147146, 0.14121199800919126, -0.21597576584376463, -0.07992604829225723, -0.13127467121849895, -0.008309021557963222, 0.0014977138526865853, -0.23044273272421587, -0.029331921683779252, 0.04083298204611953, 0.09142190613143078, -0.02441816497620819, -0.09305463055118816, 0.004012313743819213, 0.17178086965310668, 0.05237757735736155, -0.014879644844668208, 0.16757182596644404, -0.0988095027216432, -0.1418999811899293, 0.3903105012525659, -0.01011474527892018, -0.21724269389913956, 0.28656913095726333, -0.012214775731223166, -0.1913830656622357, 0.08909986526683963, 0.19489570159583625, 0.09336732141566761, -0.19404448750813347, 0.05663256107433272, 0.03521420870941782, 0.22964684907752816, 0.04363165988262162, 0.029242702313365603, 0.20257289752945168, 0.2012999298204796, 0.03425811650294895, 0.14577695998895077, -0.05414571613180152, -0.057359402174762354, -0.26024626355208114, -0.1385615825887509, -0.115603473622762, -0.04929231183966269, -0.06716524166410945, -0.16937771753393063, 0.41651228659384704, 0.23974863908563607, 0.16146258097312866, 0.07177901171669022, 0.36773251662983497, 0.05728008691495158, 0.14022602080773358, 0.11169498907872091, 0.13654795901448286, 0.011526726782236487, 0.1257498436169528, -0.16921937472396317, 0.13097813601686764, 0.0034923424815850915]
|
1,803.06236
|
Chemi-net: a graph convolutional network for accurate drug property
prediction
|
Absorption, distribution, metabolism, and excretion (ADME) studies are
critical for drug discovery. Conventionally, these tasks, together with other
chemical property predictions, rely on domain-specific feature descriptors, or
fingerprints. Following the recent success of neural networks, we developed
Chemi-Net, a completely data-driven, domain knowledge-free, deep learning
method for ADME property prediction. To compare the relative performance of
Chemi-Net with Cubist, one of the popular machine learning programs used by
Amgen, a large-scale ADME property prediction study was performed on-site at
Amgen. The results showed that our deep neural network method improved current
methods by a large margin. We foresee that the significantly increased accuracy
of ADME prediction seen with Chemi-Net over Cubist will greatly accelerate drug
discovery.
|
cs.LG q-bio.QM
|
absorption distribution metabolism and excretion adme studies are critical for drug discovery conventionally these tasks together with other chemical property predictions rely on domainspecific feature descriptors or fingerprints following the recent success of neural networks we developed cheminet a completely datadriven domain knowledgefree deep learning method for adme property prediction to compare the relative performance of cheminet with cubist one of the popular machine learning programs used by amgen a largescale adme property prediction study was performed onsite at amgen the results showed that our deep neural network method improved current methods by a large margin we foresee that the significantly increased accuracy of adme prediction seen with cheminet over cubist will greatly accelerate drug discovery
|
[['absorption', 'distribution', 'metabolism', 'and', 'excretion', 'adme', 'studies', 'are', 'critical', 'for', 'drug', 'discovery', 'conventionally', 'these', 'tasks', 'together', 'with', 'other', 'chemical', 'property', 'predictions', 'rely', 'on', 'domainspecific', 'feature', 'descriptors', 'or', 'fingerprints', 'following', 'the', 'recent', 'success', 'of', 'neural', 'networks', 'we', 'developed', 'cheminet', 'a', 'completely', 'datadriven', 'domain', 'knowledgefree', 'deep', 'learning', 'method', 'for', 'adme', 'property', 'prediction', 'to', 'compare', 'the', 'relative', 'performance', 'of', 'cheminet', 'with', 'cubist', 'one', 'of', 'the', 'popular', 'machine', 'learning', 'programs', 'used', 'by', 'amgen', 'a', 'largescale', 'adme', 'property', 'prediction', 'study', 'was', 'performed', 'onsite', 'at', 'amgen', 'the', 'results', 'showed', 'that', 'our', 'deep', 'neural', 'network', 'method', 'improved', 'current', 'methods', 'by', 'a', 'large', 'margin', 'we', 'foresee', 'that', 'the', 'significantly', 'increased', 'accuracy', 'of', 'adme', 'prediction', 'seen', 'with', 'cheminet', 'over', 'cubist', 'will', 'greatly', 'accelerate', 'drug', 'discovery']]
|
[-0.028704068525449225, 0.006432219481977977, -0.06134138107013872, 0.040806777219761885, -0.09266928193698588, -0.1766879962463128, 0.05477004450860254, 0.42583567917494003, -0.2443292023483337, -0.3043277205474544, 0.06882171446290031, -0.2649169698568968, -0.18696850610758065, 0.2226023171280854, -0.08262216752362356, 0.12707892525941133, 0.16694784687276473, 0.010945853425941447, -0.052069393860731734, -0.2913304436012384, 0.26728047332481336, 0.06997888111213238, 0.37161521651177554, 0.06225075718018496, 0.08259993539959715, -0.013853492104987564, -0.05710469617246928, 0.0006106475709218597, -0.0939824664685722, 0.19352574270676104, 0.3011907414255435, 0.176501503961749, 0.33084508670869756, -0.3868141715137059, -0.28066613046419725, 0.09892017479675512, 0.14166444484879703, 0.08573423013276943, -0.05743145114301067, -0.3173340626322387, 0.1019496736300521, -0.1911227480475709, -0.05706757102406731, -0.15422433086981377, -0.03485716879061472, 0.0272885276670486, -0.256294107093198, 0.04038744302580885, 0.05455091731703744, 0.1035087674676457, -0.044107165244783746, -0.16904984617589466, 0.008885296945982989, 0.10139846920011271, 0.04580964238011164, 0.08706402218198045, 0.18505917750135586, -0.19168555281500807, -0.179892841390571, 0.29726857281894536, -0.10383736673056294, -0.13388460131235452, 0.22376896041902927, -0.03511251051902052, -0.18651035817323677, 0.12751257119229545, 0.2208140720756267, 0.09610472964286282, -0.14871369555935657, -0.002954685995702452, 0.016632692265455006, 0.15732878920409762, 0.011004392527403277, -0.029482959549089794, 0.16661710161184728, 0.266995260900442, -0.0009909790875226782, 0.06759802945082795, -0.11230256998086381, -0.05227685882301446, -0.12621355495260408, -0.10838074753420394, -0.14515173292653472, -0.008319354242351102, -0.08930251991216465, -0.12895137885291325, 0.3760783445384157, 0.19973085818632522, 0.16742434571578838, 0.1074016187360445, 0.28273723274469376, 0.01706782285340555, 0.1590574297241115, 0.06281344198801539, 0.23426096603731839, 0.031074029846901174, 0.1457737495156675, -0.19822751656133814, 0.14656175031804627, 0.060780892785834637]
|
1,803.06237
|
Adiabatic absorbers in photonics simulations with the volume integral
equation method
|
This paper describes the implementation and performance of adiabatic
absorbing layers in an FFT-accelerated volume integral equation (VIE) method
for simulating truncated nanophotonics structures. At the truncation sites, we
place absorbing regions in which the conductivity is increased gradually in
order to minimize reflections. In the continuous setting, such adiabatic
absorbers have been shown via coupled-mode theory to produce reflections that
diminish at a rate related to the smoothness of the absorption profile
function. The VIE formulation we employ relies on uniform discretizations of
the geometry over which the continuously varying fields and material properties
are represented by piecewise constant functions. Such a discretization enables
the acceleration of the method via the FFT and, furthermore, the introduction
of varying absorption can be performed in a straightforward manner without
compromising this speedup. We demonstrate that, in spite of the crude discrete
approximation to the smooth absorption profiles, our approach recovers the
theoretically predicted reflection behavior of adiabatic absorbers. We thereby
show that the FFT-accelerated VIE method is an effective and fast simulation
tool for nanophotonics simulations.
|
physics.comp-ph
|
this paper describes the implementation and performance of adiabatic absorbing layers in an fftaccelerated volume integral equation vie method for simulating truncated nanophotonics structures at the truncation sites we place absorbing regions in which the conductivity is increased gradually in order to minimize reflections in the continuous setting such adiabatic absorbers have been shown via coupledmode theory to produce reflections that diminish at a rate related to the smoothness of the absorption profile function the vie formulation we employ relies on uniform discretizations of the geometry over which the continuously varying fields and material properties are represented by piecewise constant functions such a discretization enables the acceleration of the method via the fft and furthermore the introduction of varying absorption can be performed in a straightforward manner without compromising this speedup we demonstrate that in spite of the crude discrete approximation to the smooth absorption profiles our approach recovers the theoretically predicted reflection behavior of adiabatic absorbers we thereby show that the fftaccelerated vie method is an effective and fast simulation tool for nanophotonics simulations
|
[['this', 'paper', 'describes', 'the', 'implementation', 'and', 'performance', 'of', 'adiabatic', 'absorbing', 'layers', 'in', 'an', 'fftaccelerated', 'volume', 'integral', 'equation', 'vie', 'method', 'for', 'simulating', 'truncated', 'nanophotonics', 'structures', 'at', 'the', 'truncation', 'sites', 'we', 'place', 'absorbing', 'regions', 'in', 'which', 'the', 'conductivity', 'is', 'increased', 'gradually', 'in', 'order', 'to', 'minimize', 'reflections', 'in', 'the', 'continuous', 'setting', 'such', 'adiabatic', 'absorbers', 'have', 'been', 'shown', 'via', 'coupledmode', 'theory', 'to', 'produce', 'reflections', 'that', 'diminish', 'at', 'a', 'rate', 'related', 'to', 'the', 'smoothness', 'of', 'the', 'absorption', 'profile', 'function', 'the', 'vie', 'formulation', 'we', 'employ', 'relies', 'on', 'uniform', 'discretizations', 'of', 'the', 'geometry', 'over', 'which', 'the', 'continuously', 'varying', 'fields', 'and', 'material', 'properties', 'are', 'represented', 'by', 'piecewise', 'constant', 'functions', 'such', 'a', 'discretization', 'enables', 'the', 'acceleration', 'of', 'the', 'method', 'via', 'the', 'fft', 'and', 'furthermore', 'the', 'introduction', 'of', 'varying', 'absorption', 'can', 'be', 'performed', 'in', 'a', 'straightforward', 'manner', 'without', 'compromising', 'this', 'speedup', 'we', 'demonstrate', 'that', 'in', 'spite', 'of', 'the', 'crude', 'discrete', 'approximation', 'to', 'the', 'smooth', 'absorption', 'profiles', 'our', 'approach', 'recovers', 'the', 'theoretically', 'predicted', 'reflection', 'behavior', 'of', 'adiabatic', 'absorbers', 'we', 'thereby', 'show', 'that', 'the', 'fftaccelerated', 'vie', 'method', 'is', 'an', 'effective', 'and', 'fast', 'simulation', 'tool', 'for', 'nanophotonics', 'simulations']]
|
[-0.08332369532635701, 0.07413071971004163, -0.1024447328437652, 0.009096126910299063, -0.04977781704557336, -0.07779340943321586, 0.030716880710263336, 0.4313881231737988, -0.28575798946299724, -0.2947676034923643, 0.08397084051876195, -0.236967500073037, -0.1519369130288916, 0.20362645002348082, -0.04128607977181673, 0.06217860542237759, 0.008692744772082994, -0.04971573790269239, -0.0805020435985976, -0.2307236190020506, 0.2725229404886652, 0.062434709971504555, 0.295380147844553, 0.05694592598692647, 0.11748960385631238, 0.009624620761190143, -0.01896621042679596, 0.013869599632785789, -0.10495286688270945, 0.1053890435802584, 0.2254664518231792, 0.04800311024300754, 0.27388074124498024, -0.4406233680674008, -0.25259219117462633, 0.04342074942908117, 0.16683357214521882, 0.10877916405642671, -0.061293385745292264, -0.25866907526339805, 0.04810200857796839, -0.1476675910821983, -0.16638304144676241, -0.08917032676083701, -0.03452869901167495, 0.03320287062254335, -0.27083759963645465, 0.08036047289863096, 0.03254504716090326, 0.029064600902742575, -0.0694572072684033, -0.05083452445587942, 0.006704080933704972, 0.07026084629087044, 0.005971763881721667, -0.006458250408593033, 0.13576208331223044, -0.10581923646187144, -0.06830395220246697, 0.37359440535839117, -0.09984184309308018, -0.18945170943226133, 0.17877421086387976, -0.11009157671327037, -0.07047301335127226, 0.18629908740254386, 0.17823090633236072, 0.13570643949721542, -0.0968854399983372, 0.102190581641293, 0.0071335831111563105, 0.17002815238599267, 0.08087102417701057, 0.014534546480114971, 0.14286785445176065, 0.14102221771542514, 0.06020376170120601, 0.1300412182659576, -0.0699933473240318, -0.08888488305466516, -0.2848124337222959, -0.16591560806546893, -0.1832994022938822, 0.02433255885195519, -0.10758570932350786, -0.2064177055741727, 0.3741452941830669, 0.169405028679009, 0.16181893956980534, 0.045758508695289496, 0.3233634841788028, 0.18853395969540412, 0.05723970889080582, 0.08135563751416547, 0.2257020189985633, 0.14278713501191564, 0.08904257890036596, -0.23741222407402737, 0.0708160250939961, 0.0756682811571019]
|
1,803.06238
|
A Sharp Phase Field Method
|
Phase field modelling offers an extremely general framework to predict
microstructural evolutions in complex systems. However, its computational
implementation requires a discretisation scheme with a grid spacing small
enough to preserve the continuous character of the theory. We present here a
new formulation, which is intrinsically discrete, in which the interfaces are
resolved with essentially one grid point with no pinning on the grid and an
accurate rotational invariance, improving drastically the numerical
capabilities of the method. We show that interfacial kinetic properties are
reproduced with a high accuracy. Finally, we apply the model to a situation
where conserved and non-conserved fields are coupled.
|
physics.comp-ph cond-mat.mes-hall
|
phase field modelling offers an extremely general framework to predict microstructural evolutions in complex systems however its computational implementation requires a discretisation scheme with a grid spacing small enough to preserve the continuous character of the theory we present here a new formulation which is intrinsically discrete in which the interfaces are resolved with essentially one grid point with no pinning on the grid and an accurate rotational invariance improving drastically the numerical capabilities of the method we show that interfacial kinetic properties are reproduced with a high accuracy finally we apply the model to a situation where conserved and nonconserved fields are coupled
|
[['phase', 'field', 'modelling', 'offers', 'an', 'extremely', 'general', 'framework', 'to', 'predict', 'microstructural', 'evolutions', 'in', 'complex', 'systems', 'however', 'its', 'computational', 'implementation', 'requires', 'a', 'discretisation', 'scheme', 'with', 'a', 'grid', 'spacing', 'small', 'enough', 'to', 'preserve', 'the', 'continuous', 'character', 'of', 'the', 'theory', 'we', 'present', 'here', 'a', 'new', 'formulation', 'which', 'is', 'intrinsically', 'discrete', 'in', 'which', 'the', 'interfaces', 'are', 'resolved', 'with', 'essentially', 'one', 'grid', 'point', 'with', 'no', 'pinning', 'on', 'the', 'grid', 'and', 'an', 'accurate', 'rotational', 'invariance', 'improving', 'drastically', 'the', 'numerical', 'capabilities', 'of', 'the', 'method', 'we', 'show', 'that', 'interfacial', 'kinetic', 'properties', 'are', 'reproduced', 'with', 'a', 'high', 'accuracy', 'finally', 'we', 'apply', 'the', 'model', 'to', 'a', 'situation', 'where', 'conserved', 'and', 'nonconserved', 'fields', 'are', 'coupled']]
|
[-0.12592077419573727, 0.10084269899016363, -0.08978884981031744, 0.03160532861343549, -0.06646646153128061, -0.15090929004005516, 0.02469324203803598, 0.40858169275228506, -0.25801642688636023, -0.32165974187396035, 0.09403736015575795, -0.22508698932002658, -0.1367007818681976, 0.16875690934158719, -0.04804073039290065, 0.042548503717206095, 0.06102732051378833, -0.024138240492902696, -0.07969697814909384, -0.1972926935279527, 0.27535810874878036, 0.05862959200525298, 0.28906682910746895, 0.04989903398717825, 0.11527128590163417, -0.04418367751462098, -0.013544994786990663, 0.06276080288136235, -0.10742056145269228, 0.13040632193308108, 0.20095583664414546, 0.03446294393059081, 0.23385127027554867, -0.4539939647791191, -0.24635474571886545, 0.058445155020588294, 0.12692477762511073, 0.16301798875792883, -0.057371843207734995, -0.22378640150866255, 0.07873728232852255, -0.15295009726945025, -0.161651037982665, -0.1507530170179402, -0.015939549541844126, 0.02322666486837149, -0.28379318526724373, 0.07515571084177981, 0.04008745591608413, 0.07981435441447851, -0.0637702231100635, -0.05236508893610265, -0.05409766485592207, 0.11119772594807167, 0.008747757422567632, 0.029868541607776515, 0.09524266410601111, -0.12706842166461194, -0.08527927513261183, 0.43264601587389523, -0.039376830362576026, -0.26627144181671053, 0.22345752025900695, -0.12840743576480934, -0.15484184264474046, 0.15542094430957848, 0.1543833472309276, 0.1289809493598743, -0.11828932625044566, 0.08771396235253913, 0.02775168820964889, 0.20090220516906881, -0.02170659855563337, 0.020905854316459645, 0.19127815390507188, 0.21601748233269275, 0.07056976755400403, 0.10281800084675734, -0.07896615184570412, -0.14552777640458842, -0.3015473512574457, -0.1289097623676543, -0.18964650710292447, 0.016091870094756953, -0.0960020159072883, -0.2011198002862959, 0.37982339783506036, 0.20052911268654638, 0.17349318795794927, 0.06203415715516222, 0.29332870165727887, 0.135662285633421, 0.04750172353725737, 0.07086132812009265, 0.19720684579358652, 0.11940128087567595, 0.11337327879468481, -0.2410916998095882, 0.017012738080946013, 0.05417120189052254]
|
1,803.06239
|
Trianguloids and Triangulations of Root Polytopes
|
Triangulations of a product of two simplices and, more generally, of root
polytopes are closely related to Gelfand-Kapranov-Zelevinsky's theory of
discriminants, to tropical geometry, tropical oriented matroids, and to
generalized permutohedra. We introduce a new approach to these objects,
identifying a triangulation of a root polytope with a certain bijection between
lattice points of two generalized permutohedra. In order to study such
bijections, we define trianguloids as edge-colored graphs satisfying simple
local axioms. We prove that trianguloids are in bijection with triangulations
of root polytopes.
|
math.CO math.MG
|
triangulations of a product of two simplices and more generally of root polytopes are closely related to gelfandkapranovzelevinskys theory of discriminants to tropical geometry tropical oriented matroids and to generalized permutohedra we introduce a new approach to these objects identifying a triangulation of a root polytope with a certain bijection between lattice points of two generalized permutohedra in order to study such bijections we define trianguloids as edgecolored graphs satisfying simple local axioms we prove that trianguloids are in bijection with triangulations of root polytopes
|
[['triangulations', 'of', 'a', 'product', 'of', 'two', 'simplices', 'and', 'more', 'generally', 'of', 'root', 'polytopes', 'are', 'closely', 'related', 'to', 'gelfandkapranovzelevinskys', 'theory', 'of', 'discriminants', 'to', 'tropical', 'geometry', 'tropical', 'oriented', 'matroids', 'and', 'to', 'generalized', 'permutohedra', 'we', 'introduce', 'a', 'new', 'approach', 'to', 'these', 'objects', 'identifying', 'a', 'triangulation', 'of', 'a', 'root', 'polytope', 'with', 'a', 'certain', 'bijection', 'between', 'lattice', 'points', 'of', 'two', 'generalized', 'permutohedra', 'in', 'order', 'to', 'study', 'such', 'bijections', 'we', 'define', 'trianguloids', 'as', 'edgecolored', 'graphs', 'satisfying', 'simple', 'local', 'axioms', 'we', 'prove', 'that', 'trianguloids', 'are', 'in', 'bijection', 'with', 'triangulations', 'of', 'root', 'polytopes']]
|
[-0.18545502520598336, 0.11473369828414128, -0.08371439705310384, 0.10854701885774014, -0.1367749804294253, -0.1322600017077323, 0.02005239577083119, 0.3471275106386607, -0.3962264462452696, -0.2542434920702713, 0.07457019540436387, -0.3119793523058116, -0.25123327180563687, 0.11641207173556449, -0.234051216242229, 0.003636785146095846, 0.06079276727445154, 0.022054917167827308, -0.10679827009731657, -0.309772919826995, 0.3701470536516463, -0.054796139813443445, 0.17235667547996503, 0.04972991703571864, 0.1452911796541997, 0.0010710590496569514, 0.016680066894560336, 0.11367488512208304, -0.20656934224887183, 0.19472077208380384, 0.3297779626852597, 0.14226366078245442, 0.12378147748265281, -0.3948586495615632, -0.05294302188937204, 0.20530824179211296, 0.07760222611881523, 0.03495730216199734, 0.03431395399969784, -0.17941579978957953, 0.07987355672563594, -0.11880607021052435, -0.17236831350285695, -0.07094036565577409, 0.013452879719840116, 0.04185289036516235, -0.25691143157387, -0.03466959128784666, 0.10311407209317906, 0.16430637789104718, 0.011725395003401012, -0.14065672114985175, -0.05145412301981306, 0.0405753545564072, -0.06269691529941845, 0.0639897920948689, 0.009620120541293579, -0.06331609351930759, -0.24539576858528947, 0.4014189602268568, 0.08665215684499322, -0.2602391023306647, 0.1667438042686736, -0.1743453876059278, -0.18805840704590082, 0.08251986109528196, 0.14821473439504584, 0.15055363499615565, -0.09594049425276714, 0.023442236693991148, -0.16802424687824874, -0.0024012185363884433, 0.17025434113590113, -0.006769726981397673, 0.20165205284594054, 0.07829041447468012, 0.13532054079808745, 0.23986317473183194, 0.0411746184319168, -0.11974904540903776, -0.30011539929826936, -0.16603110662201442, -0.1490436425258641, 0.10089506426579263, -0.20892193801217174, -0.27177089291164674, 0.3507957385967946, 0.08829762245786477, 0.19822291264602218, 0.16394116266080774, 0.17856002880080815, -0.004210351092505257, 0.07776850863662829, 0.03579742263957678, 0.06641155982345164, 0.25641659559704455, -0.0824170817497624, -0.07751415094293385, -0.025393816030932118, 0.2929897178244968]
|
1,803.0624
|
Modelling the bow shock Pulsar Wind Nebulae propagating through a
non-uniform ISM
|
Many pulsars propagate through the interstellar medium (ISM) with supersonic
velocities, and their pulsar winds interact with the interstellar medium (ISM),
forming bow shocks and magnetotails (PWN). We model the propagation of pulsars
through the inhomogeneous ISM using non-relativistic axisymmetric
magneto-hydrodynamic (MHD) simulations. We take into account the wind from the
star, and the azimuthal and poloidal components of the magnetic field, and
investigate the PWN at different levels of magnetization (the ratio of magnetic
to matter energy-densities) in the wind. We consider the interaction of PWN
with small-scale and large-scale imhomogeneities in the ISM at different values
of magnetization. We conclude that the inhomogeneities in the ISM can change
the shapes of the bow shocks and magnetotails at different values of the
magnetization.We compare the results of our simulations with the images of the
Guitar Nebula and other PWN that show irregularities in the shapes of their bow
shocks and magnetotails. We conclude that these irregularities may be caused by
the interaction of PWN with the inhomogeneities in the ISM.
|
astro-ph.HE astro-ph.SR
|
many pulsars propagate through the interstellar medium ism with supersonic velocities and their pulsar winds interact with the interstellar medium ism forming bow shocks and magnetotails pwn we model the propagation of pulsars through the inhomogeneous ism using nonrelativistic axisymmetric magnetohydrodynamic mhd simulations we take into account the wind from the star and the azimuthal and poloidal components of the magnetic field and investigate the pwn at different levels of magnetization the ratio of magnetic to matter energydensities in the wind we consider the interaction of pwn with smallscale and largescale imhomogeneities in the ism at different values of magnetization we conclude that the inhomogeneities in the ism can change the shapes of the bow shocks and magnetotails at different values of the magnetizationwe compare the results of our simulations with the images of the guitar nebula and other pwn that show irregularities in the shapes of their bow shocks and magnetotails we conclude that these irregularities may be caused by the interaction of pwn with the inhomogeneities in the ism
|
[['many', 'pulsars', 'propagate', 'through', 'the', 'interstellar', 'medium', 'ism', 'with', 'supersonic', 'velocities', 'and', 'their', 'pulsar', 'winds', 'interact', 'with', 'the', 'interstellar', 'medium', 'ism', 'forming', 'bow', 'shocks', 'and', 'magnetotails', 'pwn', 'we', 'model', 'the', 'propagation', 'of', 'pulsars', 'through', 'the', 'inhomogeneous', 'ism', 'using', 'nonrelativistic', 'axisymmetric', 'magnetohydrodynamic', 'mhd', 'simulations', 'we', 'take', 'into', 'account', 'the', 'wind', 'from', 'the', 'star', 'and', 'the', 'azimuthal', 'and', 'poloidal', 'components', 'of', 'the', 'magnetic', 'field', 'and', 'investigate', 'the', 'pwn', 'at', 'different', 'levels', 'of', 'magnetization', 'the', 'ratio', 'of', 'magnetic', 'to', 'matter', 'energydensities', 'in', 'the', 'wind', 'we', 'consider', 'the', 'interaction', 'of', 'pwn', 'with', 'smallscale', 'and', 'largescale', 'imhomogeneities', 'in', 'the', 'ism', 'at', 'different', 'values', 'of', 'magnetization', 'we', 'conclude', 'that', 'the', 'inhomogeneities', 'in', 'the', 'ism', 'can', 'change', 'the', 'shapes', 'of', 'the', 'bow', 'shocks', 'and', 'magnetotails', 'at', 'different', 'values', 'of', 'the', 'magnetizationwe', 'compare', 'the', 'results', 'of', 'our', 'simulations', 'with', 'the', 'images', 'of', 'the', 'guitar', 'nebula', 'and', 'other', 'pwn', 'that', 'show', 'irregularities', 'in', 'the', 'shapes', 'of', 'their', 'bow', 'shocks', 'and', 'magnetotails', 'we', 'conclude', 'that', 'these', 'irregularities', 'may', 'be', 'caused', 'by', 'the', 'interaction', 'of', 'pwn', 'with', 'the', 'inhomogeneities', 'in', 'the', 'ism']]
|
[-0.1297667764854678, 0.1503197442844907, -0.05300344546606555, 0.08635556106538286, -0.09498680800684457, 0.013560424327365393, -0.040554695321831126, 0.44371535415215607, -0.26632572842772895, -0.3191089954050864, -0.006957337269201302, -0.2581154127993081, -0.006090994706630883, 0.17539956386355385, 0.06371835055457946, -0.06740350718041689, 0.06592026852159458, -0.10877424470264707, -0.008008807499757995, -0.17940743271453988, 0.34626594908293007, 0.07750161068745443, 0.1514180614089472, 0.017194394678009685, 0.09002020524073524, -0.13895465812463997, -0.012002421311549182, 0.02231235609778352, -0.11005367366964729, 0.049017898735628854, 0.12072868597591792, 0.09275616035306242, 0.17665033440860595, -0.5411650320217454, -0.28668182498476463, 0.01488384153809641, 0.2039164964980363, 0.0446536314464312, -0.010892347779852398, -0.31220252569434204, 0.06248157644043704, -0.20851066910810548, -0.1853744448575924, 0.05203584912811687, -0.01345195361556342, 0.11534465522610048, -0.22111172927267983, 0.10765809430217249, 0.023282081392984946, 0.07161178384747731, -0.15245729080847734, -0.0641023213796031, -0.052111931953898814, 0.07016532642893582, 0.13278032897712563, 0.0270195413055725, 0.18708885149043825, -0.21794402017120337, -0.03918563526057633, 0.46394121300803837, -0.044601469286910354, -0.07680313803321688, 0.2308992727676175, -0.26927788167439, -0.1318339148244253, 0.17228472427073757, 0.1793944705387897, 0.04708294223817672, -0.07680292904222681, -0.012322962196260008, -0.05834608500377005, 0.1146137804955729, 0.036132547724716496, 0.011522637536892524, 0.2898842629993103, 0.09049260035018056, -0.018319689625360625, 0.1551853070492283, -0.2232380556851934, -0.00922739532081818, -0.23466277159970894, -0.09835106171888007, -0.11748723457801602, 0.04220663916771493, -0.2046978496828429, -0.14087009151912563, 0.38876383899870887, 0.19173712315955393, 0.15622768585829164, -0.0595853925026821, 0.3470004102182106, 0.09095364918218672, -0.006625980659547818, 0.22309818436507378, 0.3100679230699922, 0.17537476540785613, 0.14992552169615173, -0.26991078571262134, 0.10819487804657169, -0.011273264681049706]
|
1,803.06241
|
"Shadowy" modes in Higher-Order Scalar-Tensor theories
|
We consider Higher-Order Scalar-Tensor theories which appear degenerate when
restricted to the unitary gauge but are not degenerate in an arbitrary gauge.
We dub them U-degenerate theories. We provide a full classification of theories
that are either DHOST or U-degenerate and that are quadratic in second
derivatives of the scalar field, and discuss its extension to cubic and higher
order theories. Working with a simple example of U-degenerate theory, we find
that, for configurations in which the scalar field gradient is time-like, the
apparent extra mode in such a theory can be understood as a generalized
instantaneous, or "shadowy" mode, which does not propagate. Appropriate
boundary conditions, required by the elliptic nature of part of the equations
of motion, lead to the elimination of the apparent instability associated with
this extra mode.
|
hep-th gr-qc
|
we consider higherorder scalartensor theories which appear degenerate when restricted to the unitary gauge but are not degenerate in an arbitrary gauge we dub them udegenerate theories we provide a full classification of theories that are either dhost or udegenerate and that are quadratic in second derivatives of the scalar field and discuss its extension to cubic and higher order theories working with a simple example of udegenerate theory we find that for configurations in which the scalar field gradient is timelike the apparent extra mode in such a theory can be understood as a generalized instantaneous or shadowy mode which does not propagate appropriate boundary conditions required by the elliptic nature of part of the equations of motion lead to the elimination of the apparent instability associated with this extra mode
|
[['we', 'consider', 'higherorder', 'scalartensor', 'theories', 'which', 'appear', 'degenerate', 'when', 'restricted', 'to', 'the', 'unitary', 'gauge', 'but', 'are', 'not', 'degenerate', 'in', 'an', 'arbitrary', 'gauge', 'we', 'dub', 'them', 'udegenerate', 'theories', 'we', 'provide', 'a', 'full', 'classification', 'of', 'theories', 'that', 'are', 'either', 'dhost', 'or', 'udegenerate', 'and', 'that', 'are', 'quadratic', 'in', 'second', 'derivatives', 'of', 'the', 'scalar', 'field', 'and', 'discuss', 'its', 'extension', 'to', 'cubic', 'and', 'higher', 'order', 'theories', 'working', 'with', 'a', 'simple', 'example', 'of', 'udegenerate', 'theory', 'we', 'find', 'that', 'for', 'configurations', 'in', 'which', 'the', 'scalar', 'field', 'gradient', 'is', 'timelike', 'the', 'apparent', 'extra', 'mode', 'in', 'such', 'a', 'theory', 'can', 'be', 'understood', 'as', 'a', 'generalized', 'instantaneous', 'or', 'shadowy', 'mode', 'which', 'does', 'not', 'propagate', 'appropriate', 'boundary', 'conditions', 'required', 'by', 'the', 'elliptic', 'nature', 'of', 'part', 'of', 'the', 'equations', 'of', 'motion', 'lead', 'to', 'the', 'elimination', 'of', 'the', 'apparent', 'instability', 'associated', 'with', 'this', 'extra', 'mode']]
|
[-0.16548152655807577, 0.17394433750263433, -0.08869516323708619, 0.0861599728267527, -0.13771245279878547, -0.16759988325154127, -0.022863404855315544, 0.326903174116248, -0.23358998306547152, -0.2735470920293169, 0.12060710427150215, -0.21616109351761584, -0.15811040578828947, 0.12455728217548423, -0.045903603170617396, 0.005773064438306557, 0.00012653820555318487, 0.09713782673674304, -0.09553613316154841, -0.24600165096908863, 0.3382387517556322, -0.0074178091379122416, 0.21377474903375981, 0.029280034527112024, 0.09365332378850628, 0.0024940021844072776, 0.011611268245332845, 0.047746998808262026, -0.09179656798363739, 0.10895221622195095, 0.2102928483262517, 0.06862067008588577, 0.23319394494562098, -0.4396114008233064, -0.23344191298052797, 0.1197569480652667, 0.1459123823998115, 0.14993903843534293, -0.002777898543034539, -0.2380784454713152, 0.0719427516336454, -0.17061437076578537, -0.18769117635427834, -0.09510248539244816, -0.050526700219382874, -0.028594667818679503, -0.2761145675568982, 0.10996695883064107, 0.08377694268650278, 0.04800390137472388, -0.0709870058265303, -0.04828332362089758, -0.04664579720349249, 0.040911361697935994, 0.07660894585371186, 0.025490957864376745, 0.07249705760499858, -0.17908930383573257, -0.12885150039691132, 0.4077066510746425, -0.10444107139571288, -0.2498893982970692, 0.1815125523593672, -0.1454377439486879, -0.1266273160528561, 0.10538136801033308, 0.14684902920712237, 0.16079250513223198, -0.11014121485696347, 0.12867964118600922, 0.0035760749676476485, 0.1266915640867823, 0.08124113135449024, 0.040140482427721676, 0.23339367980379117, 0.04118987197271605, 0.05260493243324824, 0.1172281532737102, -0.0032134935174712373, -0.12413869525136595, -0.392522910976726, -0.15790995690005014, -0.0837091357902726, 0.05594305851374167, -0.07635328078708192, -0.20109058852363942, 0.35880845881095436, 0.11753658579210892, 0.15330493131962916, 0.033384637152432166, 0.23192593787098303, 0.16145998053164504, 0.11651881751569101, 0.052442411149527426, 0.26587119475571497, 0.13258186814544554, 0.047434050512189664, -0.2112621420160532, -0.039549664227789355, 0.07290423649476108]
|
1,803.06242
|
Maxwell-Higgs vortices with internal structure
|
Vortices are considered in relativistic Maxwell-Higgs systems in interaction
with a neutral scalar field. The gauge field interacts with the neutral field
via the presence of generalized permeability, and the charged and neutral
scalar fields interact in a way dictated by the presence of first order
differential equations that solve the equations of motion. The neutral field
may be seen as the source field of the vortex, and we study some possibilities,
which modify the standard Maxwell-Higgs solution and include internal structure
to the vortex.
|
hep-th hep-ph
|
vortices are considered in relativistic maxwellhiggs systems in interaction with a neutral scalar field the gauge field interacts with the neutral field via the presence of generalized permeability and the charged and neutral scalar fields interact in a way dictated by the presence of first order differential equations that solve the equations of motion the neutral field may be seen as the source field of the vortex and we study some possibilities which modify the standard maxwellhiggs solution and include internal structure to the vortex
|
[['vortices', 'are', 'considered', 'in', 'relativistic', 'maxwellhiggs', 'systems', 'in', 'interaction', 'with', 'a', 'neutral', 'scalar', 'field', 'the', 'gauge', 'field', 'interacts', 'with', 'the', 'neutral', 'field', 'via', 'the', 'presence', 'of', 'generalized', 'permeability', 'and', 'the', 'charged', 'and', 'neutral', 'scalar', 'fields', 'interact', 'in', 'a', 'way', 'dictated', 'by', 'the', 'presence', 'of', 'first', 'order', 'differential', 'equations', 'that', 'solve', 'the', 'equations', 'of', 'motion', 'the', 'neutral', 'field', 'may', 'be', 'seen', 'as', 'the', 'source', 'field', 'of', 'the', 'vortex', 'and', 'we', 'study', 'some', 'possibilities', 'which', 'modify', 'the', 'standard', 'maxwellhiggs', 'solution', 'and', 'include', 'internal', 'structure', 'to', 'the', 'vortex']]
|
[-0.17925818000700983, 0.18910185244372663, -0.002032589737106772, 0.050369070536073514, -0.08547594510018826, -0.1278069388888338, -0.07326893270125284, 0.2930732174831278, -0.2555083147743169, -0.3124240920495461, 0.05037389347904964, -0.24212666987715398, -0.10133669468409875, 0.10287584204445867, 0.0589761392925592, -0.019757150595679004, -0.022168006682220628, 0.06336234213565202, -0.0044789642725578125, -0.19224639040527536, 0.3821133496130214, 0.00412044156315353, 0.22614373790428918, 0.020199564712889053, 0.08871903923504493, 0.008068417778293438, -0.019681201973820433, 0.10139323719503249, -0.0766984739482081, 0.09696617070585489, 0.12383811634978936, 0.02856200620641603, 0.1860168120084221, -0.4793853480149718, -0.21658506268525826, 0.08178317141445245, 0.17234091980601934, 0.16038481764467982, -0.11525141979184221, -0.34085193107671596, 0.015912937827627448, -0.1513877579394509, -0.21023956664481802, -0.0717618934591027, -0.03558988756746711, 0.057542386138811706, -0.2784771298037787, 0.08582794151323683, 0.020112054352648557, 0.017084147545563824, -0.11763593442190219, -0.05224765533417025, -0.049351999536156654, 0.05517020964556757, 0.113705358867917, 0.044825529304387816, 0.18003604980733465, -0.2615761885063394, -0.12070078272646402, 0.4296522462192704, -0.1729863371768528, -0.2554231339517762, 0.17165572913911412, -0.14660972221480573, -0.06709208213998115, 0.1653320162611849, 0.19008365963750026, 0.13045885828049744, -0.15843575753559194, 0.1381339348058271, -0.056651554749730756, 0.12160545733264264, 0.06318979582694524, 0.0212572414373212, 0.27257835782297396, 0.08604742297354867, 0.0008715574465253773, 0.13796557260759393, -0.05446698273915578, -0.159752126016161, -0.33048422804157085, -0.20225586602464318, -0.06717258184490835, 0.04368438987499651, -0.038267990869387765, -0.16098359406323118, 0.3972193229505244, 0.16393935183638378, 0.15605095791123696, -0.06690786060301916, 0.25547731273314533, 0.1368967666550923, 0.10080355510786723, 0.06402746596757103, 0.28691643042222814, 0.2360259095015114, 0.14204555414617062, -0.25667984120492987, -0.05056032011394992, 0.061212266872034356]
|
1,803.06243
|
Gradients on Sets
|
For a locally Lipschitz continuous function $f:X\to\mathbb{R}$ the
generalized gradient $\partial f(x)$ of Clarke is used to develop some
(set-valued) gradient on a set $A\subset X$. Existence, uniqueness and some
approximation are considered for optimal descent directions on set $A$. The
results serve as basis for nonsmooth numerical descent algorithms that can be
found in subsequent papers.
|
math.OC
|
for a locally lipschitz continuous function fxtomathbbr the generalized gradient partial fx of clarke is used to develop some setvalued gradient on a set asubset x existence uniqueness and some approximation are considered for optimal descent directions on set a the results serve as basis for nonsmooth numerical descent algorithms that can be found in subsequent papers
|
[['for', 'a', 'locally', 'lipschitz', 'continuous', 'function', 'fxtomathbbr', 'the', 'generalized', 'gradient', 'partial', 'fx', 'of', 'clarke', 'is', 'used', 'to', 'develop', 'some', 'setvalued', 'gradient', 'on', 'a', 'set', 'asubset', 'x', 'existence', 'uniqueness', 'and', 'some', 'approximation', 'are', 'considered', 'for', 'optimal', 'descent', 'directions', 'on', 'set', 'a', 'the', 'results', 'serve', 'as', 'basis', 'for', 'nonsmooth', 'numerical', 'descent', 'algorithms', 'that', 'can', 'be', 'found', 'in', 'subsequent', 'papers']]
|
[-0.11347208913873162, -0.01016186883575038, -0.0953670791677085, 0.11723643081597657, -0.09320348675624189, -0.13362661181344537, 0.029084013186787303, 0.42958507101917476, -0.34901603886432814, -0.1463356791717703, 0.15920952507172173, -0.23110303385673384, -0.14525299578120834, 0.2616570802699578, -0.10676720040735968, 0.10834020660503914, 0.05344041345412271, 0.013002308314306694, -0.0955084037452348, -0.28995845231570694, 0.2753616712595287, -0.05202356388326734, 0.1937068852089476, 0.022338943359883207, 0.13934258482288242, -0.021588902544687715, 0.007830387863673662, 0.07098477879506454, -0.13003481585563573, 0.0827755879512743, 0.30537107761687876, 0.17430981304986695, 0.39578453431788246, -0.39963596562544507, -0.1835802258564192, 0.163595473116035, 0.10462146516268452, 0.024663178478939493, -0.0994874057155756, -0.2409505664142208, 0.1196049790862098, -0.09566231802301972, -0.13534016151536712, -0.1571653317986873, 0.0021902584029655707, 0.14773088428110145, -0.37973196023519623, 0.04972805050120019, 0.03139114677252477, 0.03134919714852514, -0.09382519693718407, -0.17649463454686237, -0.040343016214472685, 0.02859170580478875, 0.02194032250707479, 0.15941411377698705, 0.11191399840703398, -0.013576030943608075, -0.11231695700502187, 0.32193674284376594, -0.10326983479031346, -0.3088774783046622, 0.14829481626746424, -0.05196767383696217, -0.16724768007304847, 0.09185462219542578, 0.20393552023839825, 0.20184507322285258, -0.1416494631976412, 0.10426037122082912, -0.10803342849146902, 0.07133615369859495, 0.07946033577287667, -0.026722118135933812, 0.08803755433805156, 0.07713605345047095, 0.2284222402234088, 0.12753319655536888, 0.014743861938385587, -0.07259982231220133, -0.3954219748837906, -0.12116773397939508, -0.14494902971037255, 0.06579813955090287, -0.10638702059345394, -0.20752920445642972, 0.35351376635790394, 0.08393476512119696, 0.18076401478365847, 0.10669435416920144, 0.2121759205729815, 0.1158917303051056, -0.03769385536903875, 0.10363482990253128, 0.16264089656148203, 0.1591298775951656, 0.07771131205127428, -0.16171041596272404, 0.12462458340961714, 0.22330813508546143]
|
1,803.06244
|
Induced Saturation of Graphs
|
A graph $G$ is $H$-saturated for a graph $H$, if $G$ does not contain a copy
of $H$ but adding any new edge to $G$ results in such a copy. An $H$-saturated
graph on a given number of vertices always exists and the properties of such
graphs, for example their highest density, have been studied intensively. A
graph $G$ is $H$-induced-saturated if $G$ does not have an induced subgraph
isomorphic to $H$, but adding an edge to $G$ from its complement or deleting an
edge from $G$ results in an induced copy of $H$. It is not immediate anymore
that $H$-induced-saturated graphs exist. In fact, Martin and Smith (2012)
showed that there is no $P_4$-induced-saturated graph. Behrens et.al. (2016)
proved that if $H$ belongs to a few simple classes of graphs such as a class of
odd cycles of length at least $5$, stars of size at least $2$, or matchings of
size at least $2$, then there is an $H$-induced-saturated graph. This paper
addresses the existence question for $H$-induced-saturated graphs. It is shown
that Cartesian products of cliques are $H$-induced-saturated graphs for $H$ in
several infinite families, including large families of trees. A complete
characterization of all connected graphs $H$ for which a Cartesian product of
two cliques is an $H$-induced-saturated graph is given. Finally, several
results on induced saturation for prime graphs and families of graphs are
provided.
|
math.CO
|
a graph g is hsaturated for a graph h if g does not contain a copy of h but adding any new edge to g results in such a copy an hsaturated graph on a given number of vertices always exists and the properties of such graphs for example their highest density have been studied intensively a graph g is hinducedsaturated if g does not have an induced subgraph isomorphic to h but adding an edge to g from its complement or deleting an edge from g results in an induced copy of h it is not immediate anymore that hinducedsaturated graphs exist in fact martin and smith 2012 showed that there is no p_4inducedsaturated graph behrens etal 2016 proved that if h belongs to a few simple classes of graphs such as a class of odd cycles of length at least 5 stars of size at least 2 or matchings of size at least 2 then there is an hinducedsaturated graph this paper addresses the existence question for hinducedsaturated graphs it is shown that cartesian products of cliques are hinducedsaturated graphs for h in several infinite families including large families of trees a complete characterization of all connected graphs h for which a cartesian product of two cliques is an hinducedsaturated graph is given finally several results on induced saturation for prime graphs and families of graphs are provided
|
[['a', 'graph', 'g', 'is', 'hsaturated', 'for', 'a', 'graph', 'h', 'if', 'g', 'does', 'not', 'contain', 'a', 'copy', 'of', 'h', 'but', 'adding', 'any', 'new', 'edge', 'to', 'g', 'results', 'in', 'such', 'a', 'copy', 'an', 'hsaturated', 'graph', 'on', 'a', 'given', 'number', 'of', 'vertices', 'always', 'exists', 'and', 'the', 'properties', 'of', 'such', 'graphs', 'for', 'example', 'their', 'highest', 'density', 'have', 'been', 'studied', 'intensively', 'a', 'graph', 'g', 'is', 'hinducedsaturated', 'if', 'g', 'does', 'not', 'have', 'an', 'induced', 'subgraph', 'isomorphic', 'to', 'h', 'but', 'adding', 'an', 'edge', 'to', 'g', 'from', 'its', 'complement', 'or', 'deleting', 'an', 'edge', 'from', 'g', 'results', 'in', 'an', 'induced', 'copy', 'of', 'h', 'it', 'is', 'not', 'immediate', 'anymore', 'that', 'hinducedsaturated', 'graphs', 'exist', 'in', 'fact', 'martin', 'and', 'smith', '2012', 'showed', 'that', 'there', 'is', 'no', 'p_4inducedsaturated', 'graph', 'behrens', 'etal', '2016', 'proved', 'that', 'if', 'h', 'belongs', 'to', 'a', 'few', 'simple', 'classes', 'of', 'graphs', 'such', 'as', 'a', 'class', 'of', 'odd', 'cycles', 'of', 'length', 'at', 'least', '5', 'stars', 'of', 'size', 'at', 'least', '2', 'or', 'matchings', 'of', 'size', 'at', 'least', '2', 'then', 'there', 'is', 'an', 'hinducedsaturated', 'graph', 'this', 'paper', 'addresses', 'the', 'existence', 'question', 'for', 'hinducedsaturated', 'graphs', 'it', 'is', 'shown', 'that', 'cartesian', 'products', 'of', 'cliques', 'are', 'hinducedsaturated', 'graphs', 'for', 'h', 'in', 'several', 'infinite', 'families', 'including', 'large', 'families', 'of', 'trees', 'a', 'complete', 'characterization', 'of', 'all', 'connected', 'graphs', 'h', 'for', 'which', 'a', 'cartesian', 'product', 'of', 'two', 'cliques', 'is', 'an', 'hinducedsaturated', 'graph', 'is', 'given', 'finally', 'several', 'results', 'on', 'induced', 'saturation', 'for', 'prime', 'graphs', 'and', 'families', 'of', 'graphs', 'are', 'provided']]
|
[-0.16399183841452702, 0.1408979275652617, -0.031467510676052114, 0.006147356399621684, -0.11671519459440784, -0.1154943881678399, 0.018197406218061835, 0.4229667290524624, -0.25168178106076594, -0.32846957596027043, 0.11486943597157026, -0.3273061929539041, -0.13594056499967408, 0.15311037137998698, -0.12081485141605529, -0.03374334810811042, 0.1501330875173439, 0.1402865562193486, 0.05250118195595765, -0.2719259816556142, 0.3050241771044299, -0.0475746218743429, 0.1452887976210662, 0.09430123065287191, 0.06568799142504118, 0.007310726127778403, -0.010627500800310134, 0.1165035030246391, -0.1857791255279312, 0.03319175478922992, 0.2568146975946869, 0.1655583524208223, 0.26126941893601535, -0.36273713691330894, -0.1724437132109705, 0.24825724363367696, 0.10339092274143576, 0.047442368512076435, -0.019161371559445545, -0.19057563063154795, 0.14945010615382587, -0.14257045207935584, -0.07357450337128868, -0.006680469360104945, 0.1574513993945835, -0.02521857112141806, -0.28525096611790846, -0.04236425082839814, 0.15434755173646011, 0.06525112339803811, 0.09052916001030305, -0.1616311858389852, -0.08890072009058499, 0.10248594772168253, -0.0701779488506666, 0.06263313006292459, 0.018412015390659654, -0.1345137582703465, -0.17830863185674278, 0.35978813423962214, -0.033446847246888636, -0.13275203545777103, 0.15828569976035425, -0.12781195275817986, -0.22505808005914676, 0.14263072275804706, 0.08442019727731766, 0.16228199287573908, -0.088884738940892, 0.14970061875494425, -0.13753011737956247, 0.13058590989023056, 0.14143124438708396, -0.0019668529657077645, 0.11346982569254804, 0.11485493104949626, 0.17336055683378765, 0.14258600353857087, 0.030429599393874927, 0.06251309288657518, -0.2999762956085554, -0.10580358460879026, -0.25848418826239355, 0.07483840600289272, -0.1315001533568179, -0.23151492462917964, 0.4007120710150969, 0.048724546755041814, 0.1984874311591576, 0.03861952233931464, 0.1877215722566633, 0.051530321841900886, 0.0771137154223926, 0.20751479200995426, 0.12814264272758533, 0.1890958762838501, -0.07225029855177588, -0.1060790135034596, 0.05853456650544405, 0.11431615178851516]
|
1,803.06245
|
Resonances in the asteroid and trans-Neptunian belts: a brief review
|
Mean motion resonances play a fundamental role in the dynamics of the small
bodies of the Solar System. The last decades of the 20th century gave us a
detailed description of the dynamics as well as the process of capture of small
bodies in coplanar or small inclination resonant orbits. More recently,
semianalytical or numerical methods allowed us to explore the behavior of
resonant motions for arbitrary inclination orbits. The emerging dynamics is
very rich, including large orbital changes due to secular effects inside mean
motion resonances. The process of capture in highly inclined or retrograde
resonant orbits was addressed showing that the capture in retrograde resonances
is more efficient than in direct ones. A new terminology appeared in order to
characterize the properties of the resonances. Numerical explorations in the
transneptunian region showed the relevance and the particular dynamics of the
exterior resonances with Neptune which can account for some of the known high
perihelion orbits in the scattered disk. Moreover, several asteroids evolving
in resonance with planets other than Jupiter or Neptune were found and a large
number of asteroids in three-body resonances were identified.
|
astro-ph.EP
|
mean motion resonances play a fundamental role in the dynamics of the small bodies of the solar system the last decades of the 20th century gave us a detailed description of the dynamics as well as the process of capture of small bodies in coplanar or small inclination resonant orbits more recently semianalytical or numerical methods allowed us to explore the behavior of resonant motions for arbitrary inclination orbits the emerging dynamics is very rich including large orbital changes due to secular effects inside mean motion resonances the process of capture in highly inclined or retrograde resonant orbits was addressed showing that the capture in retrograde resonances is more efficient than in direct ones a new terminology appeared in order to characterize the properties of the resonances numerical explorations in the transneptunian region showed the relevance and the particular dynamics of the exterior resonances with neptune which can account for some of the known high perihelion orbits in the scattered disk moreover several asteroids evolving in resonance with planets other than jupiter or neptune were found and a large number of asteroids in threebody resonances were identified
|
[['mean', 'motion', 'resonances', 'play', 'a', 'fundamental', 'role', 'in', 'the', 'dynamics', 'of', 'the', 'small', 'bodies', 'of', 'the', 'solar', 'system', 'the', 'last', 'decades', 'of', 'the', '20th', 'century', 'gave', 'us', 'a', 'detailed', 'description', 'of', 'the', 'dynamics', 'as', 'well', 'as', 'the', 'process', 'of', 'capture', 'of', 'small', 'bodies', 'in', 'coplanar', 'or', 'small', 'inclination', 'resonant', 'orbits', 'more', 'recently', 'semianalytical', 'or', 'numerical', 'methods', 'allowed', 'us', 'to', 'explore', 'the', 'behavior', 'of', 'resonant', 'motions', 'for', 'arbitrary', 'inclination', 'orbits', 'the', 'emerging', 'dynamics', 'is', 'very', 'rich', 'including', 'large', 'orbital', 'changes', 'due', 'to', 'secular', 'effects', 'inside', 'mean', 'motion', 'resonances', 'the', 'process', 'of', 'capture', 'in', 'highly', 'inclined', 'or', 'retrograde', 'resonant', 'orbits', 'was', 'addressed', 'showing', 'that', 'the', 'capture', 'in', 'retrograde', 'resonances', 'is', 'more', 'efficient', 'than', 'in', 'direct', 'ones', 'a', 'new', 'terminology', 'appeared', 'in', 'order', 'to', 'characterize', 'the', 'properties', 'of', 'the', 'resonances', 'numerical', 'explorations', 'in', 'the', 'transneptunian', 'region', 'showed', 'the', 'relevance', 'and', 'the', 'particular', 'dynamics', 'of', 'the', 'exterior', 'resonances', 'with', 'neptune', 'which', 'can', 'account', 'for', 'some', 'of', 'the', 'known', 'high', 'perihelion', 'orbits', 'in', 'the', 'scattered', 'disk', 'moreover', 'several', 'asteroids', 'evolving', 'in', 'resonance', 'with', 'planets', 'other', 'than', 'jupiter', 'or', 'neptune', 'were', 'found', 'and', 'a', 'large', 'number', 'of', 'asteroids', 'in', 'threebody', 'resonances', 'were', 'identified']]
|
[-0.14808268969714203, 0.15240031812977503, -0.07837885857763935, 0.09226627841683738, -0.08439955009735205, -0.05991084505131538, -0.011449621690257906, 0.30957259885209765, -0.19874532917703697, -0.3432476676373, 0.0566775815330762, -0.2685294340160441, -0.14104695377851473, 0.20895556901845544, -0.08613694894372206, 0.07059360024479422, 0.13355216012401058, 0.01552241711558545, 0.0011746322544401184, -0.20581350981862967, 0.2601339667749138, 0.049687761962812216, 0.07842451687603393, -0.0077716333251247275, 0.04032713563286047, -0.001009557671336965, 0.008528923909652998, -0.04459627227170423, -0.16663577203050706, 0.11449703729539808, 0.21298987199278438, 0.04824634237752799, 0.24462891617082658, -0.4279920845566427, -0.1976677422874911, 0.03457381944284142, 0.18669661537265994, 0.1129501222895538, -0.0392335862312578, -0.3087786033072255, 0.03378048401268667, -0.17341957916132109, -0.2109288267223513, -0.05899724883729602, 0.12074842584633173, 0.010365943736919665, -0.2480948580264607, 0.07714013709626932, 0.1205612298625367, 0.12634836037190042, -0.10039979754324584, -0.12206837944225732, -0.04027725783186681, 0.13107535607532603, 0.07549848371866423, -0.05813607232854328, 0.17210611978291787, -0.09430549830014015, -0.10348045652642607, 0.42884656792832787, -0.0546292330234568, -0.1316406669638015, 0.2538233205855371, -0.27877394161012803, -0.07049561386061384, 0.2134620950627016, 0.2286242147626537, 0.15643651162418612, -0.13492458186455988, 0.04900663991441283, -0.005607351421672392, 0.13864116881909297, 0.12748421674325344, 0.04981381032568587, 0.29891611069918955, 0.15164449466218086, 0.033337473889245066, 0.08896317175573316, -0.14601751762058804, -0.15545428134899408, -0.18254917055707087, -0.09906101849846502, -0.1077563616168252, -0.004595877718333564, -0.04484129808799558, -0.1641587690662849, 0.3734856799473976, 0.109455185349692, 0.2514544035591942, -0.04543549218028286, 0.2817303821205455, 0.06698504289398019, 0.08929769690820878, 0.07570674042541155, 0.35863405934059966, 0.15017335556875816, 0.07275856898868466, -0.24010285494082115, 0.08419468425921497, -0.0003656636609790478]
|
1,803.06246
|
On the use of the KMR unintegrated parton distribution functions
|
We discuss the unintegrated parton distribution functions (UPDFs) introduced
by Kimber, Martin and Ryskin (KMR), which are frequently used in
phenomenological analyses of hard processes with transverse momenta of partons
taken into account. We demonstrate numerically that the commonly used
differential definition of the UPDFs leads to erroneous results for large
transverse momenta. We identify the reason for that, being the use of the
ordinary PDFs instead of the cutoff dependent distribution functions. We show
that in phenomenological applications, the integral definition of the UPDFs
with the ordinary PDFs can be used.
|
hep-ph
|
we discuss the unintegrated parton distribution functions updfs introduced by kimber martin and ryskin kmr which are frequently used in phenomenological analyses of hard processes with transverse momenta of partons taken into account we demonstrate numerically that the commonly used differential definition of the updfs leads to erroneous results for large transverse momenta we identify the reason for that being the use of the ordinary pdfs instead of the cutoff dependent distribution functions we show that in phenomenological applications the integral definition of the updfs with the ordinary pdfs can be used
|
[['we', 'discuss', 'the', 'unintegrated', 'parton', 'distribution', 'functions', 'updfs', 'introduced', 'by', 'kimber', 'martin', 'and', 'ryskin', 'kmr', 'which', 'are', 'frequently', 'used', 'in', 'phenomenological', 'analyses', 'of', 'hard', 'processes', 'with', 'transverse', 'momenta', 'of', 'partons', 'taken', 'into', 'account', 'we', 'demonstrate', 'numerically', 'that', 'the', 'commonly', 'used', 'differential', 'definition', 'of', 'the', 'updfs', 'leads', 'to', 'erroneous', 'results', 'for', 'large', 'transverse', 'momenta', 'we', 'identify', 'the', 'reason', 'for', 'that', 'being', 'the', 'use', 'of', 'the', 'ordinary', 'pdfs', 'instead', 'of', 'the', 'cutoff', 'dependent', 'distribution', 'functions', 'we', 'show', 'that', 'in', 'phenomenological', 'applications', 'the', 'integral', 'definition', 'of', 'the', 'updfs', 'with', 'the', 'ordinary', 'pdfs', 'can', 'be', 'used']]
|
[-0.04082098497968653, 0.1508839315805665, -0.20622625230285135, 0.18741199430888114, -0.07878184331702473, -0.032862555579808744, -0.04768345484120326, 0.3809576024422827, -0.1983158711657819, -0.26495421333643404, 0.0022553074826567395, -0.26335469016845786, -0.06757857659629182, 0.14975241083744628, -0.020200297023858064, 0.12794018981208943, 0.047422910703892776, -0.0677556078273641, -0.06700301014706897, -0.2105849163060117, 0.3816381660239447, 0.018157708944509857, 0.2496838702050888, 0.08438504397180742, 0.11099101731594166, 0.11482908306440906, -0.11518338511498018, -0.008668974866336413, -0.16419110280003224, 0.07916611062018605, 0.25128880701959133, 0.07157584935750651, 0.17937691552746718, -0.4181049705442527, -0.15624549958865036, 0.05192376702578495, 0.1376875220904248, 0.07007231030729599, 0.028214194224742445, -0.24655138982621871, 0.029632397122559665, -0.2284045358487081, -0.19058406896985378, -0.14010595883566723, -0.016873818240128458, 0.08198798846696383, -0.29519963734175847, 0.08599528607547931, 0.010198749470241044, -0.031121833371403423, 0.00428051079886601, -0.20341594536464824, -0.050786800257375704, 0.0545115463439446, 0.08526015818200033, 0.03393446056060898, 0.1096325138477487, -0.14556021588530554, -0.1340732437396503, 0.35129510378465056, -0.03367513181697375, -0.2512421495098945, 0.12041841383071859, -0.17455015893843348, -0.15605542373985215, 0.11537738282071508, 0.17742824917861624, 0.10020807004311001, -0.18837068550815078, 0.07686981765247132, -0.004822372666398144, 0.11417047402811357, 0.06858592577096399, 0.04392422770615667, 0.13094223768996965, 0.07706386573693674, -0.06024076135160968, 0.13724137024837546, -0.08236630906796326, -0.1316759452405993, -0.3718390285199427, -0.09896456250799415, -0.14549448084005195, 0.04251969830416467, -0.08034293133364966, -0.1522181980797778, 0.3619704932814626, 0.18758791419879897, 0.24469132745846012, 0.02978672089343688, 0.28138905145612586, 0.19685644981876502, 0.11347364016768077, 0.07033985228601682, 0.20138299095687334, 0.13806229305666182, 0.10631390841191878, -0.18456201850558104, 0.07113033488554799, 0.07709088872703117]
|
1,803.06247
|
Coordinating users of shared facilities via data-driven predictive
assistants and game theory
|
We study data-driven assistants that provide congestion forecasts to users of
shared facilities (roads, cafeterias, etc.), to support coordination between
them, and increase efficiency of such collective systems. Key questions are:
(1) when and how much can (accurate) predictions help for coordination, and (2)
which assistant algorithms reach optimal predictions?
First we lay conceptual ground for this setting where user preferences are a
priori unknown and predictions influence outcomes. Addressing (1), we establish
conditions under which self-fulfilling prophecies, i.e., "perfect"
(probabilistic) predictions of what will happen, solve the coordination problem
in the game-theoretic sense of selecting a Bayesian Nash equilibrium (BNE).
Next we prove that such prophecies exist even in large-scale settings where
only aggregated statistics about users are available. This entails a new
(nonatomic) BNE existence result. Addressing (2), we propose two assistant
algorithms that sequentially learn from users' reactions, together with
optimality/convergence guarantees. We validate one of them in a large
real-world experiment.
|
cs.GT stat.ML
|
we study datadriven assistants that provide congestion forecasts to users of shared facilities roads cafeterias etc to support coordination between them and increase efficiency of such collective systems key questions are 1 when and how much can accurate predictions help for coordination and 2 which assistant algorithms reach optimal predictions first we lay conceptual ground for this setting where user preferences are a priori unknown and predictions influence outcomes addressing 1 we establish conditions under which selffulfilling prophecies ie perfect probabilistic predictions of what will happen solve the coordination problem in the gametheoretic sense of selecting a bayesian nash equilibrium bne next we prove that such prophecies exist even in largescale settings where only aggregated statistics about users are available this entails a new nonatomic bne existence result addressing 2 we propose two assistant algorithms that sequentially learn from users reactions together with optimalityconvergence guarantees we validate one of them in a large realworld experiment
|
[['we', 'study', 'datadriven', 'assistants', 'that', 'provide', 'congestion', 'forecasts', 'to', 'users', 'of', 'shared', 'facilities', 'roads', 'cafeterias', 'etc', 'to', 'support', 'coordination', 'between', 'them', 'and', 'increase', 'efficiency', 'of', 'such', 'collective', 'systems', 'key', 'questions', 'are', '1', 'when', 'and', 'how', 'much', 'can', 'accurate', 'predictions', 'help', 'for', 'coordination', 'and', '2', 'which', 'assistant', 'algorithms', 'reach', 'optimal', 'predictions', 'first', 'we', 'lay', 'conceptual', 'ground', 'for', 'this', 'setting', 'where', 'user', 'preferences', 'are', 'a', 'priori', 'unknown', 'and', 'predictions', 'influence', 'outcomes', 'addressing', '1', 'we', 'establish', 'conditions', 'under', 'which', 'selffulfilling', 'prophecies', 'ie', 'perfect', 'probabilistic', 'predictions', 'of', 'what', 'will', 'happen', 'solve', 'the', 'coordination', 'problem', 'in', 'the', 'gametheoretic', 'sense', 'of', 'selecting', 'a', 'bayesian', 'nash', 'equilibrium', 'bne', 'next', 'we', 'prove', 'that', 'such', 'prophecies', 'exist', 'even', 'in', 'largescale', 'settings', 'where', 'only', 'aggregated', 'statistics', 'about', 'users', 'are', 'available', 'this', 'entails', 'a', 'new', 'nonatomic', 'bne', 'existence', 'result', 'addressing', '2', 'we', 'propose', 'two', 'assistant', 'algorithms', 'that', 'sequentially', 'learn', 'from', 'users', 'reactions', 'together', 'with', 'optimalityconvergence', 'guarantees', 'we', 'validate', 'one', 'of', 'them', 'in', 'a', 'large', 'realworld', 'experiment']]
|
[-0.11519950336101008, 0.07220831255008485, -0.06893567395475662, 0.14567022471006935, -0.12093225133063551, -0.2378727727100935, 0.13432261861519876, 0.3970686239281706, -0.25833697074086837, -0.3216868770351402, 0.07843654539688716, -0.2762690639451262, -0.1527361438778576, 0.13103881442395884, -0.10857254245966746, 0.04573394587032156, 0.11559524626647627, 0.027002517345667287, -0.008631191185212944, -0.2730755174769929, 0.30835751420057383, 0.024894160370713746, 0.28537639696759726, 0.05839198707029211, 0.08505095531129175, 0.014322393835564844, 0.00427429468121404, 0.030911015721762344, -0.1521401450964238, 0.12798537672999516, 0.3753633773763926, 0.2192612573233573, 0.35930737944965074, -0.4518561544432457, -0.15364984357181719, 0.13199966742194508, 0.1238289221822972, 0.10637553580245307, -0.0399293864771322, -0.2838547146252168, 0.11758673200581612, -0.17605979899492333, -0.09613957670608572, -0.11327512496230162, -0.03352137923459796, 0.05749606660086345, -0.3422866804172206, 0.0078906962721079, 0.05120058318758323, 0.09686162689201583, -0.06704455925139531, -0.10508187871207209, 0.05364547725279931, 0.21011387899132244, 0.03963125797804275, -0.03633920252901423, 0.13347107996506727, -0.12505657751161872, -0.17908892701486478, 0.38294644260572064, 0.007188405613323637, -0.1791295952991479, 0.19524294154389815, -0.08468968312718655, -0.1805716880104121, 0.06434859945347496, 0.2158289082786616, 0.10804699281887974, -0.14505056246517462, -0.009695597079710341, -0.0753748243997251, 0.1767287357813782, 0.0632706748692964, 0.017067997786368614, 0.1637877582517617, 0.18694247105280606, 0.14453933645478068, 0.05624281449754741, 0.0041160430067547545, -0.13625605782080027, -0.2648304223076873, -0.13429398359371322, -0.12901255035212908, 0.039659137728021425, -0.059113128268649937, -0.08662292133422121, 0.31532082329291145, 0.24124660300930925, 0.147259374173492, 0.10241829368492796, 0.3035861539153772, 0.03418391200697074, -0.02153198608597497, 0.1105577693970606, 0.1991270801217563, 0.020406603773605394, 0.13497677825549556, -0.1308329742370642, 0.12632334436323445, -0.004148174603804459]
|
1,803.06248
|
3D Video Quality Metric for Mobile Applications
|
In this paper, we propose a new full-reference quality metric for mobile 3D
content. Our method is modeled around the Human Visual System, fusing the
information of both left and right channels, considering color components, the
cyclopean views of the two videos and disparity. Our method is assessing the
quality of 3D videos displayed on a mobile 3DTV, taking into account the effect
of resolution, distance from the viewers eyes, and dimensions of the mobile
display. Performance evaluations showed that our mobile 3D quality metric
monitors the degradation of quality caused by several representative types of
distortion with 82 percent correlation with results of subjective tests, an
accuracy much better than that of the state of the art mobile 3D quality
metric.
|
eess.IV
|
in this paper we propose a new fullreference quality metric for mobile 3d content our method is modeled around the human visual system fusing the information of both left and right channels considering color components the cyclopean views of the two videos and disparity our method is assessing the quality of 3d videos displayed on a mobile 3dtv taking into account the effect of resolution distance from the viewers eyes and dimensions of the mobile display performance evaluations showed that our mobile 3d quality metric monitors the degradation of quality caused by several representative types of distortion with 82 percent correlation with results of subjective tests an accuracy much better than that of the state of the art mobile 3d quality metric
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'fullreference', 'quality', 'metric', 'for', 'mobile', '3d', 'content', 'our', 'method', 'is', 'modeled', 'around', 'the', 'human', 'visual', 'system', 'fusing', 'the', 'information', 'of', 'both', 'left', 'and', 'right', 'channels', 'considering', 'color', 'components', 'the', 'cyclopean', 'views', 'of', 'the', 'two', 'videos', 'and', 'disparity', 'our', 'method', 'is', 'assessing', 'the', 'quality', 'of', '3d', 'videos', 'displayed', 'on', 'a', 'mobile', '3dtv', 'taking', 'into', 'account', 'the', 'effect', 'of', 'resolution', 'distance', 'from', 'the', 'viewers', 'eyes', 'and', 'dimensions', 'of', 'the', 'mobile', 'display', 'performance', 'evaluations', 'showed', 'that', 'our', 'mobile', '3d', 'quality', 'metric', 'monitors', 'the', 'degradation', 'of', 'quality', 'caused', 'by', 'several', 'representative', 'types', 'of', 'distortion', 'with', '82', 'percent', 'correlation', 'with', 'results', 'of', 'subjective', 'tests', 'an', 'accuracy', 'much', 'better', 'than', 'that', 'of', 'the', 'state', 'of', 'the', 'art', 'mobile', '3d', 'quality', 'metric']]
|
[-0.09618467029153568, 0.005465069674189226, -0.029929086962928536, 0.012430807939142783, -0.03268902256992287, -0.11760393688149873, 0.021132581868231845, 0.43052377667827685, -0.20097166947213185, -0.36776706174809914, 0.04034974300121263, -0.34086359408302386, -0.14992792256840612, 0.1816890639535411, -0.1605267226973932, 0.040839013979449626, 0.10538984134365789, 0.07399603586880582, -0.07777367848673927, -0.2896278096882046, 0.311738104445675, 0.047928855705769643, 0.3748275241432864, 0.04750200931639334, 0.10339991380384222, -0.01741507372505902, -0.05261324454465362, 0.06970027748905179, -0.05445668377236513, 0.1779352509813597, 0.2069515981902292, 0.191871638508317, 0.2764285853224211, -0.40474300765905713, -0.2280760894254705, 0.005566128983818849, 0.12383976333667754, 0.030628323158035514, -0.08297893575957564, -0.4116214002009298, 0.1047626097274364, -0.1609358830209516, -0.02747055259151537, -0.05474880333898253, -0.022734355815060316, -0.022743200128478167, -0.27282819887966714, 0.057037205942982776, 0.023872933776087325, 0.09909353860211177, -0.09437800509870418, -0.09723200438998365, -0.00839880444910988, 0.26198799852434485, 0.06049358668798184, 0.039448805221119806, 0.12347964410952551, -0.2121150825825352, -0.09747430028014084, 0.41550641580194725, -0.010487073877006654, -0.21238558767096247, 0.1830510618546825, -0.11152382939099716, -0.03631961222386873, 0.13584695458717522, 0.21095786986445061, 0.12207408164261428, -0.14389881961139256, -0.026233777452974016, -0.009379320787494911, 0.2155698401021836, 0.06158402646113126, 0.07001037812471146, 0.18885981281036052, 0.2291338500551513, 0.005472672129368131, 0.11802024912799051, -0.15670404172994837, -0.03225477648608875, -0.20098549896301549, -0.16433113024829596, -0.16256874372617755, -3.11224090391541e-05, -0.15274521900824228, -0.13675600718220193, 0.43489269997741353, 0.2036263603892666, 0.18520220821402722, 0.06466229167217236, 0.3916837309990994, 0.016943029432412483, 0.051916900461112137, 0.05540140850667949, 0.1839707397901621, -0.03827047441727253, 0.13473649834068951, -0.19236407662001362, 0.07599226169700384, 0.0608018976858088]
|
1,803.06249
|
Link prediction for interdisciplinary collaboration via co-authorship
network
|
We analyse the Publication and Research (PURE) data set of University of
Bristol collected between $2008$ and $2013$. Using the existing co-authorship
network and academic information thereof, we propose a new link prediction
methodology, with the specific aim of identifying potential interdisciplinary
collaboration in a university-wide collaboration network.
|
cs.DL physics.soc-ph stat.AP
|
we analyse the publication and research pure data set of university of bristol collected between 2008 and 2013 using the existing coauthorship network and academic information thereof we propose a new link prediction methodology with the specific aim of identifying potential interdisciplinary collaboration in a universitywide collaboration network
|
[['we', 'analyse', 'the', 'publication', 'and', 'research', 'pure', 'data', 'set', 'of', 'university', 'of', 'bristol', 'collected', 'between', '2008', 'and', '2013', 'using', 'the', 'existing', 'coauthorship', 'network', 'and', 'academic', 'information', 'thereof', 'we', 'propose', 'a', 'new', 'link', 'prediction', 'methodology', 'with', 'the', 'specific', 'aim', 'of', 'identifying', 'potential', 'interdisciplinary', 'collaboration', 'in', 'a', 'universitywide', 'collaboration', 'network']]
|
[-0.1012884941982462, 0.014361807719824161, -0.07978215697221458, 0.03392152877727603, -0.13462082336240627, -0.11988066408307628, 0.1294897512552586, 0.3586937811701222, -0.17517752160734318, -0.4344612957632288, 0.05832510633503107, -0.3163333155531832, -0.19407534924276332, 0.11654625689373055, -0.07249197999926958, 0.07422877887779093, 0.1407915916630721, -0.0003714012972852017, -0.0008661479273057998, -0.271566075371935, 0.34988659307202125, 0.12912852047605716, 0.40095149567152594, 0.0885965763492153, 0.049252708088309366, 0.02959696487820846, -0.22372171453180464, -0.0018141573255366467, -0.1531184761428294, 0.21412791327593175, 0.33128845380084154, 0.2654092849648379, 0.3294819583918186, -0.4034355908949324, -0.1430952882473456, 0.10682650963637105, 0.0008896632872997446, 0.07000803006218469, -0.042766425966661664, -0.3850486888451145, 0.0006934545458631313, -0.27990330708153704, -0.05853050672746402, -0.05520023348087326, 0.030018657267569228, 0.008454825610239455, -0.21595419363732984, 0.046094329304438325, -0.03622524426417782, 0.19771665806307437, -0.017015477260971006, -0.12690702421551056, -0.010445575982807799, 0.19960617188839835, 0.009445288763480617, 0.08359621949939731, 0.08450878803875853, -0.11357265706867614, -0.19829962305486837, 0.2981159178976049, -0.05154335866880385, -0.05381239625684758, 0.1938524407834964, -0.09805353504030946, -0.18116750086637887, -0.025839835415257417, 0.2976517343616232, 0.009067884190602506, -0.2649377576234017, 0.03470390733514734, -0.029902621558768317, 0.10906210696285075, 0.05187541077983506, -0.07404113079401407, 0.18744646508167398, 0.2480629017933252, -0.015320582186525806, 0.12915167482966122, -0.09001147374510765, -0.09189116201819257, -0.24140744100503148, -0.11878220673571242, -0.1559553451271371, -0.008572036588683407, -0.021649295790182883, -0.06984532664113856, 0.46868855894563044, 0.14596755984468396, 0.14175097340163081, -0.02130531297719225, 0.22911722799069545, -0.037026914988057394, 0.03145080664135674, 0.11650425487970735, 0.19018208691255845, 0.056239631017075575, 0.23057299107313156, -0.12448374011573639, 0.0274306731199489, 0.001065368704656337]
|
1,803.0625
|
On the nonlinear wave equation with time periodic potential
|
It is known that for some time periodic potentials $q(t, x) \geq 0$ having
compact support with respect to $x$ some solutions of the Cauchy problem for
the wave equation $\partial_t^2 u - \Delta_x u + q(t,x)u = 0$ have
exponentially increasing energy as $t \to \infty$. We show that if one adds a
nonlinear defocusing interaction $|u|^ru, 2\leq r < 4,$ then the solution of
the nonlinear wave equation exists for all $t \in {\mathbb R}$ and its energy
is polynomially bounded as $t \to \infty$ for every choice of $q$. Moreover, we
prove that the zero solution of the nonlinear wave equation is instable if the
corresponding linear equation has the property mentioned above.
|
math.AP math-ph math.MP
|
it is known that for some time periodic potentials qt x geq 0 having compact support with respect to x some solutions of the cauchy problem for the wave equation partial_t2 u delta_x u qtxu 0 have exponentially increasing energy as t to infty we show that if one adds a nonlinear defocusing interaction uru 2leq r 4 then the solution of the nonlinear wave equation exists for all t in mathbb r and its energy is polynomially bounded as t to infty for every choice of q moreover we prove that the zero solution of the nonlinear wave equation is instable if the corresponding linear equation has the property mentioned above
|
[['it', 'is', 'known', 'that', 'for', 'some', 'time', 'periodic', 'potentials', 'qt', 'x', 'geq', '0', 'having', 'compact', 'support', 'with', 'respect', 'to', 'x', 'some', 'solutions', 'of', 'the', 'cauchy', 'problem', 'for', 'the', 'wave', 'equation', 'partial_t2', 'u', 'delta_x', 'u', 'qtxu', '0', 'have', 'exponentially', 'increasing', 'energy', 'as', 't', 'to', 'infty', 'we', 'show', 'that', 'if', 'one', 'adds', 'a', 'nonlinear', 'defocusing', 'interaction', 'uru', '2leq', 'r', '4', 'then', 'the', 'solution', 'of', 'the', 'nonlinear', 'wave', 'equation', 'exists', 'for', 'all', 't', 'in', 'mathbb', 'r', 'and', 'its', 'energy', 'is', 'polynomially', 'bounded', 'as', 't', 'to', 'infty', 'for', 'every', 'choice', 'of', 'q', 'moreover', 'we', 'prove', 'that', 'the', 'zero', 'solution', 'of', 'the', 'nonlinear', 'wave', 'equation', 'is', 'instable', 'if', 'the', 'corresponding', 'linear', 'equation', 'has', 'the', 'property', 'mentioned', 'above']]
|
[-0.19605517937793387, 0.134917155809088, -0.034879641028473504, 0.03326519247803099, -0.07015273700728342, -0.21814073828627933, -0.04181284348161572, 0.3262827498418791, -0.33726591772089404, -0.1500619557662028, 0.11730882726706195, -0.3754217660071345, -0.10024526961953253, 0.15871299212580328, 0.04196982710781667, 0.08370866544643282, 0.013531069736927748, 0.12846760944303898, -0.08407548740967638, -0.23186245200702468, 0.33023563464516187, -0.09938219778642461, 0.14876684218515046, 0.05488413209431209, 0.13807555477697034, -0.012350447710838404, 0.09651821764681053, -0.014029148932512815, -0.20640494981627264, -0.030156741995859455, 0.24910660281930505, 0.1109792545919206, 0.3328721710556262, -0.3522379468538618, -0.21323673623437817, 0.1774618375620612, 0.17171387206595223, 0.013682368312131715, -0.02298977228745751, -0.2309201369397678, 0.16498915269668843, -0.10253650837720514, -0.2526377262128098, -0.03865934174239367, 0.17281739860521378, 0.1004317526386732, -0.30901104797449735, 0.09776617976761348, 0.13038505739028994, -0.05487097792226721, -0.12038658801906717, -0.12356889581827966, -0.08904326691602667, 0.022230510893571483, 0.049985556051487454, 0.15387451029298743, -0.024098020185913623, -0.11153655308340718, -0.01134517903938923, 0.34646081909335946, -0.10110823302487801, -0.26227632619709046, 0.12110459366561593, -0.17626981468250355, -0.09017777820285577, 0.13644773956610579, 0.10039920326708271, 0.14744584079462666, -0.05405969916096142, 0.27450093575742784, -0.05855915149548489, 0.17597795320624435, 0.12810599489288554, 0.019339197560691752, 0.050845455317464365, 0.11148910435873109, 0.1523236717697367, 0.09156960702442506, -0.013435792043670878, 0.002848743565951113, -0.3744666702155997, -0.14572310669406377, -0.18715645303333028, 0.16287431173849334, -0.11895950345376502, -0.17067894454927998, 0.31467687395644617, 0.11971537235323004, 0.15394104267932004, 0.10391346668102988, 0.19316521987449042, 0.20164582792350705, -0.01850607046052008, 0.11646417438614744, 0.14478782998651754, 0.1407580138666572, 0.12352980834406775, -0.20918058060310982, -0.012809963292769483, 0.08758822650906131]
|
1,803.06251
|
Tropical integrable systems and Young tableaux: Shape equivalence and
Littlewood-Richardson correspondence
|
We present a new characterization of the shape equivalent class and the
Littlewood-Richardson correspondence of Young tableaux in terms of tropical
(ultradiscrete) integrable systems. As an application, an alternative proof of
the "shape change theorem" is given.
|
math.CO
|
we present a new characterization of the shape equivalent class and the littlewoodrichardson correspondence of young tableaux in terms of tropical ultradiscrete integrable systems as an application an alternative proof of the shape change theorem is given
|
[['we', 'present', 'a', 'new', 'characterization', 'of', 'the', 'shape', 'equivalent', 'class', 'and', 'the', 'littlewoodrichardson', 'correspondence', 'of', 'young', 'tableaux', 'in', 'terms', 'of', 'tropical', 'ultradiscrete', 'integrable', 'systems', 'as', 'an', 'application', 'an', 'alternative', 'proof', 'of', 'the', 'shape', 'change', 'theorem', 'is', 'given']]
|
[-0.09771387192194124, 0.01944755421199433, -0.10570207877537689, 0.10575237959887632, -0.12098238944403224, -0.09858577158553777, -0.0032397891029816222, 0.2936889690321845, -0.3174232316983713, -0.2574289300277628, 0.1066046839082815, -0.189026318742214, -0.23179144573372765, 0.21050702327409307, -0.21017503164507248, -0.0014048722144719716, 0.04833995704413266, 0.011686650595652897, -0.13143851570281628, -0.20583935011480306, 0.33629933752849495, 0.002075047735628244, 0.2311780553411793, 0.06172805707398299, 0.11101419214360617, 0.052551983339661684, -0.026229937032267853, -0.03727481645104047, -0.17312952631933465, 0.17984209760922837, 0.2397869404506039, 0.1635550050115263, 0.14899989444057685, -0.35193870513624437, -0.04647108414084525, 0.1613312375958304, 0.18348260840552078, 0.06022819348082349, -0.06917755653125209, -0.2528085723720692, -0.016102660006868677, -0.199483963837092, -0.27313143971401294, -0.037708560709615015, 0.07066933499850533, 0.06024211310353633, -0.24223953737197695, 0.03081473379672782, 0.18843992686251532, 0.1636406474469884, -0.1065224023485506, -0.1289675433591411, 0.029326381035954564, 0.08041873598169233, -0.046149151481537, 0.02912847454835837, 0.07053225800848088, -0.15973308153853222, -0.16683194725900083, 0.348872373937755, -0.022019195194179948, -0.23031586046154434, 0.15485805693409732, -0.0635699070486668, -0.1629508137702942, 0.13747904197992505, 0.09649220348109265, 0.15775176188027537, -0.11900139929777062, 0.09998913988867472, -0.18197436147444956, 0.09807813635750397, 0.1269890052845349, 0.03243402504941096, 0.25564602753021626, 0.14404438771433323, 0.08266246672468008, 0.25167791052041827, -0.008862018383838035, -0.09985141073529785, -0.3663367131674612, -0.2234722192122324, -0.16158141438043802, 0.07580373957249764, -0.15967642313232835, -0.2845135897624533, 0.3996304903884192, 0.06443334935937782, 0.13217942074343964, 0.11511075876124606, 0.15731764156874772, 0.16239755909978035, 0.020282315706985223, -0.07381038184000834, 0.1454111942517999, 0.23140249149622144, 0.08073028652752573, -0.16655111578517323, 0.04442601912730449, 0.21953621439988147]
|
1,803.06252
|
Joint Recognition of Handwritten Text and Named Entities with a Neural
End-to-end Model
|
When extracting information from handwritten documents, text transcription
and named entity recognition are usually faced as separate subsequent tasks.
This has the disadvantage that errors in the first module affect heavily the
performance of the second module. In this work we propose to do both tasks
jointly, using a single neural network with a common architecture used for
plain text recognition. Experimentally, the work has been tested on a
collection of historical marriage records. Results of experiments are presented
to show the effect on the performance for different configurations: different
ways of encoding the information, doing or not transfer learning and processing
at text line or multi-line region level. The results are comparable to state of
the art reported in the ICDAR 2017 Information Extraction competition, even
though the proposed technique does not use any dictionaries, language modeling
or post processing.
|
cs.CV cs.CL
|
when extracting information from handwritten documents text transcription and named entity recognition are usually faced as separate subsequent tasks this has the disadvantage that errors in the first module affect heavily the performance of the second module in this work we propose to do both tasks jointly using a single neural network with a common architecture used for plain text recognition experimentally the work has been tested on a collection of historical marriage records results of experiments are presented to show the effect on the performance for different configurations different ways of encoding the information doing or not transfer learning and processing at text line or multiline region level the results are comparable to state of the art reported in the icdar 2017 information extraction competition even though the proposed technique does not use any dictionaries language modeling or post processing
|
[['when', 'extracting', 'information', 'from', 'handwritten', 'documents', 'text', 'transcription', 'and', 'named', 'entity', 'recognition', 'are', 'usually', 'faced', 'as', 'separate', 'subsequent', 'tasks', 'this', 'has', 'the', 'disadvantage', 'that', 'errors', 'in', 'the', 'first', 'module', 'affect', 'heavily', 'the', 'performance', 'of', 'the', 'second', 'module', 'in', 'this', 'work', 'we', 'propose', 'to', 'do', 'both', 'tasks', 'jointly', 'using', 'a', 'single', 'neural', 'network', 'with', 'a', 'common', 'architecture', 'used', 'for', 'plain', 'text', 'recognition', 'experimentally', 'the', 'work', 'has', 'been', 'tested', 'on', 'a', 'collection', 'of', 'historical', 'marriage', 'records', 'results', 'of', 'experiments', 'are', 'presented', 'to', 'show', 'the', 'effect', 'on', 'the', 'performance', 'for', 'different', 'configurations', 'different', 'ways', 'of', 'encoding', 'the', 'information', 'doing', 'or', 'not', 'transfer', 'learning', 'and', 'processing', 'at', 'text', 'line', 'or', 'multiline', 'region', 'level', 'the', 'results', 'are', 'comparable', 'to', 'state', 'of', 'the', 'art', 'reported', 'in', 'the', 'icdar', '2017', 'information', 'extraction', 'competition', 'even', 'though', 'the', 'proposed', 'technique', 'does', 'not', 'use', 'any', 'dictionaries', 'language', 'modeling', 'or', 'post', 'processing']]
|
[-0.05483577910526689, 0.005067683696905349, -0.0446716623714339, 0.051595997354279916, -0.11443674208180225, -0.16304323440813956, 0.030387566464537, 0.4262726805831309, -0.2668890688528723, -0.3174359749817679, 0.11587052523234449, -0.2900014900014544, -0.14257061662291118, 0.21194265702498272, -0.1187986229723468, 0.06609584412253494, 0.1636626873493974, 0.10343843416297636, -0.058843888216883154, -0.2813066412622096, 0.3067565274537138, 0.06004739361187668, 0.38873692379986985, 0.038714467118088, 0.11286216788324165, -0.02521378280106166, -0.054772054076406125, -0.04049047254148131, -0.045742464983591836, 0.14882248740128062, 0.33058758832824725, 0.21423094053851796, 0.2991468808130718, -0.4164152046969385, -0.22132737094912916, 0.07665507627505783, 0.1594837473025083, 0.14513531312716346, -0.032888071538867254, -0.32728376828385053, 0.09069480930276691, -0.1583709100340592, 0.07242144675634749, -0.10304677574598092, -0.0037084893977388424, -0.020076358264827347, -0.2374944590809854, 0.026485128154819633, 0.11670591492793714, 0.09477037584395907, -0.018465447985956854, -0.14666060222220337, 0.038354675153415674, 0.20362961611067315, 0.008277935732208879, 0.03587595867145813, 0.15308840511571484, -0.17508626919147288, -0.18043237643197496, 0.39164952374994755, -0.05325501764041259, -0.21320774257579383, 0.19290066997897118, -0.055789616195062265, -0.18444209212952473, 0.09178021777394815, 0.18718301134963408, 0.10375575158837522, -0.16486640219588627, -0.008543878332183346, -0.01915575328765186, 0.24115622903596848, 0.09598832604052591, -0.004181811572812128, 0.18916783335532808, 0.22192289504050838, -0.05021482107480525, 0.12097506178212715, -0.14445826469042095, -0.05793172709069195, -0.19472644339292475, -0.1163172419826956, -0.19793695600452363, -0.047976078600779584, -0.03223790432444562, -0.136061624194502, 0.3994724077985008, 0.2128540925939191, 0.18740026837095936, 0.042113504886085576, 0.34846544858887263, 0.023508120603126254, 0.098587211617764, 0.07546462439304442, 0.17692987841606828, -0.01941879463203727, 0.17530334817496598, -0.1644975092472155, 0.11899873209086821, 0.045081047101172535]
|
1,803.06253
|
Land cover mapping at very high resolution with rotation equivariant
CNNs: towards small yet accurate models
|
In remote sensing images, the absolute orientation of objects is arbitrary.
Depending on an object's orientation and on a sensor's flight path, objects of
the same semantic class can be observed in different orientations in the same
image. Equivariance to rotation, in this context understood as responding with
a rotated semantic label map when subject to a rotation of the input image, is
therefore a very desirable feature, in particular for high capacity models,
such as Convolutional Neural Networks (CNNs). If rotation equivariance is
encoded in the network, the model is confronted with a simpler task and does
not need to learn specific (and redundant) weights to address rotated versions
of the same object class. In this work we propose a CNN architecture called
Rotation Equivariant Vector Field Network (RotEqNet) to encode rotation
equivariance in the network itself. By using rotating convolutions as building
blocks and passing only the the values corresponding to the maximally
activating orientation throughout the network in the form of orientation
encoding vector fields, RotEqNet treats rotated versions of the same object
with the same filter bank and therefore achieves state-of-the-art performances
even when using very small architectures trained from scratch. We test RotEqNet
in two challenging sub-decimeter resolution semantic labeling problems, and
show that we can perform better than a standard CNN while requiring one order
of magnitude less parameters.
|
cs.CV
|
in remote sensing images the absolute orientation of objects is arbitrary depending on an objects orientation and on a sensors flight path objects of the same semantic class can be observed in different orientations in the same image equivariance to rotation in this context understood as responding with a rotated semantic label map when subject to a rotation of the input image is therefore a very desirable feature in particular for high capacity models such as convolutional neural networks cnns if rotation equivariance is encoded in the network the model is confronted with a simpler task and does not need to learn specific and redundant weights to address rotated versions of the same object class in this work we propose a cnn architecture called rotation equivariant vector field network roteqnet to encode rotation equivariance in the network itself by using rotating convolutions as building blocks and passing only the the values corresponding to the maximally activating orientation throughout the network in the form of orientation encoding vector fields roteqnet treats rotated versions of the same object with the same filter bank and therefore achieves stateoftheart performances even when using very small architectures trained from scratch we test roteqnet in two challenging subdecimeter resolution semantic labeling problems and show that we can perform better than a standard cnn while requiring one order of magnitude less parameters
|
[['in', 'remote', 'sensing', 'images', 'the', 'absolute', 'orientation', 'of', 'objects', 'is', 'arbitrary', 'depending', 'on', 'an', 'objects', 'orientation', 'and', 'on', 'a', 'sensors', 'flight', 'path', 'objects', 'of', 'the', 'same', 'semantic', 'class', 'can', 'be', 'observed', 'in', 'different', 'orientations', 'in', 'the', 'same', 'image', 'equivariance', 'to', 'rotation', 'in', 'this', 'context', 'understood', 'as', 'responding', 'with', 'a', 'rotated', 'semantic', 'label', 'map', 'when', 'subject', 'to', 'a', 'rotation', 'of', 'the', 'input', 'image', 'is', 'therefore', 'a', 'very', 'desirable', 'feature', 'in', 'particular', 'for', 'high', 'capacity', 'models', 'such', 'as', 'convolutional', 'neural', 'networks', 'cnns', 'if', 'rotation', 'equivariance', 'is', 'encoded', 'in', 'the', 'network', 'the', 'model', 'is', 'confronted', 'with', 'a', 'simpler', 'task', 'and', 'does', 'not', 'need', 'to', 'learn', 'specific', 'and', 'redundant', 'weights', 'to', 'address', 'rotated', 'versions', 'of', 'the', 'same', 'object', 'class', 'in', 'this', 'work', 'we', 'propose', 'a', 'cnn', 'architecture', 'called', 'rotation', 'equivariant', 'vector', 'field', 'network', 'roteqnet', 'to', 'encode', 'rotation', 'equivariance', 'in', 'the', 'network', 'itself', 'by', 'using', 'rotating', 'convolutions', 'as', 'building', 'blocks', 'and', 'passing', 'only', 'the', 'the', 'values', 'corresponding', 'to', 'the', 'maximally', 'activating', 'orientation', 'throughout', 'the', 'network', 'in', 'the', 'form', 'of', 'orientation', 'encoding', 'vector', 'fields', 'roteqnet', 'treats', 'rotated', 'versions', 'of', 'the', 'same', 'object', 'with', 'the', 'same', 'filter', 'bank', 'and', 'therefore', 'achieves', 'stateoftheart', 'performances', 'even', 'when', 'using', 'very', 'small', 'architectures', 'trained', 'from', 'scratch', 'we', 'test', 'roteqnet', 'in', 'two', 'challenging', 'subdecimeter', 'resolution', 'semantic', 'labeling', 'problems', 'and', 'show', 'that', 'we', 'can', 'perform', 'better', 'than', 'a', 'standard', 'cnn', 'while', 'requiring', 'one', 'order', 'of', 'magnitude', 'less', 'parameters']]
|
[-0.09357381926435564, 0.0646596485107956, -0.024831194467842578, 0.046108595446373024, -0.11337893338667022, -0.1742678033457034, -0.012519758484429783, 0.47645257744524216, -0.294542526685788, -0.3246767348713345, 0.08197513647687932, -0.20113810857964887, -0.1504796543976085, 0.156865144049904, -0.15414479954996044, 0.06177798053204444, 0.10271398485017319, 0.09007993123183648, -0.10550146654558679, -0.25145112955878074, 0.28881109857414333, 0.04121084266031782, 0.30996662489604204, -0.06257978056867917, 0.15036243811029837, -0.011978996872074075, -0.003260556250396702, 0.024355126089519924, -0.01428462298447913, 0.15468177361620797, 0.2593612379588012, 0.13320044785737992, 0.24385056274011732, -0.4260249251789517, -0.2000712834101998, 0.0909098561335769, 0.13601062164797137, 0.11380116802019377, 0.0074598965442015065, -0.31961575707627665, 0.10661206712842815, -0.13411893582902848, -0.03311328580809964, -0.09088951394789749, 0.010338208357700043, -0.00543415919230837, -0.27592452086715236, 0.015409178989939392, 0.0804526608173425, 0.06605932477654683, -0.0768986899478154, -0.07745093115812375, -0.0397801224142313, 0.18416475373967034, 0.010962841692380607, 0.10055162951557173, 0.1494663499047359, -0.21406231021508573, -0.10541308306985431, 0.3861144652341803, -0.05546811185550824, -0.2700526621254782, 0.16971842733677478, -0.10134842524098026, -0.14769966608637736, 0.0871879103490048, 0.20199863380674893, 0.13322576947510242, -0.1270600805158675, 0.00958563620146985, -0.05703391719609499, 0.2115729196742177, 0.09586587159687446, 0.027139302995055913, 0.2069892789520802, 0.1906543081305507, 0.06104613195690844, 0.16186038540003614, -0.1527761061903503, -0.0535122691338054, -0.22439203019926532, -0.10683362723224693, -0.19721402850312492, 0.020408507573689956, -0.10931145022817267, -0.12938215986288723, 0.4129188383070545, 0.18611939346941653, 0.2517334174737334, 0.08245499159623351, 0.33299603402097194, 0.02002380581210471, 0.16779277517563768, 0.09925927903891231, 0.19891232901459766, 0.08130214585767438, 0.09825750271246458, -0.13288501241037415, 0.08947380197441412, 0.07223601368462874]
|
1,803.06254
|
Superfluid liquid crystals: pasta phases in neutron star crusts
|
The pasta phases predicted to occur near the inner boundary of the crust of a
neutron star resemble liquid crystals, a smectic A in the case of sheet-like
nuclei (lasagna) and the columnar phase in the case of rod-like nuclei
(spaghetti). An important difference compared with usual liquid crystals is
that the nucleons are superfluid. We develop the hydrodynamic equations for
this system and use them to study collective oscillations. Nucleon
superfluidity leads to important qualitative differences in the spectra of
these oscillations and also increases their frequencies compared with ordinary
liquid crystals. We discuss a number of directions for future work.
|
nucl-th physics.flu-dyn
|
the pasta phases predicted to occur near the inner boundary of the crust of a neutron star resemble liquid crystals a smectic a in the case of sheetlike nuclei lasagna and the columnar phase in the case of rodlike nuclei spaghetti an important difference compared with usual liquid crystals is that the nucleons are superfluid we develop the hydrodynamic equations for this system and use them to study collective oscillations nucleon superfluidity leads to important qualitative differences in the spectra of these oscillations and also increases their frequencies compared with ordinary liquid crystals we discuss a number of directions for future work
|
[['the', 'pasta', 'phases', 'predicted', 'to', 'occur', 'near', 'the', 'inner', 'boundary', 'of', 'the', 'crust', 'of', 'a', 'neutron', 'star', 'resemble', 'liquid', 'crystals', 'a', 'smectic', 'a', 'in', 'the', 'case', 'of', 'sheetlike', 'nuclei', 'lasagna', 'and', 'the', 'columnar', 'phase', 'in', 'the', 'case', 'of', 'rodlike', 'nuclei', 'spaghetti', 'an', 'important', 'difference', 'compared', 'with', 'usual', 'liquid', 'crystals', 'is', 'that', 'the', 'nucleons', 'are', 'superfluid', 'we', 'develop', 'the', 'hydrodynamic', 'equations', 'for', 'this', 'system', 'and', 'use', 'them', 'to', 'study', 'collective', 'oscillations', 'nucleon', 'superfluidity', 'leads', 'to', 'important', 'qualitative', 'differences', 'in', 'the', 'spectra', 'of', 'these', 'oscillations', 'and', 'also', 'increases', 'their', 'frequencies', 'compared', 'with', 'ordinary', 'liquid', 'crystals', 'we', 'discuss', 'a', 'number', 'of', 'directions', 'for', 'future', 'work']]
|
[-0.1328180767002278, 0.24488670730123904, -0.09565035719424486, 0.08371765174282093, -0.03505919093046995, -0.07375445944604044, 0.042361400132387074, 0.3417666753589669, -0.21651359560315078, -0.2640441510525039, 0.02745168029408281, -0.33766755772133666, -0.0926997170272265, 0.1338572101484911, 0.013451514279272398, 0.021794349731256563, 0.009913220652379096, 0.004814844110560622, -0.12132945062601756, -0.1647784904332594, 0.3082534884303516, 0.03166754530541891, 0.27204640616900194, 0.005598240267193201, 0.028320881349774188, -0.045056625244244204, 0.048819896105366446, 0.02460923611058616, -0.17806038611567654, 0.03743459376068238, 0.2881945176232679, -0.05606929327854339, 0.13762962698534714, -0.5107871209289513, -0.20863484696247706, 0.1002784803254055, 0.16889891118340777, 0.15264619858341985, -0.06664355861835693, -0.24364945329451823, 0.008679214792209677, -0.2031635936068864, -0.19147149047029077, -0.08753533794672466, 0.00580762324891254, 0.0708915342034101, -0.18537922261063666, 0.11361238989247438, 0.06910428371024775, 0.03941403427298235, -0.11587802897317007, -0.13511184595100692, -0.010991132626419558, 0.05915771506032815, 0.0919464550268672, 0.028966127801229993, 0.1700845772455282, -0.16947637335625568, -0.0642334906311304, 0.43637922866379514, -0.006234982017856822, -0.11476676632631935, 0.19322824174099984, -0.2022073850762978, -0.09576955619958621, 0.1845456833366816, 0.1655390322409278, 0.10771048090000655, -0.05673460468795954, -0.03082688146569839, -0.07456417604436294, 0.17946130266486138, 0.07156339548436888, 0.03251645086771425, 0.2852891360080856, 0.2514596766262662, -0.01319052028360174, 0.14472845792496467, -0.13347816841668841, -0.09394044572414428, -0.26351279680909334, -0.1786510634108209, -0.09708391225841992, -0.041414863060173744, -0.0693370836517858, -0.17933749415290853, 0.3653373396407594, 0.07876655212306764, 0.1664324108369685, -0.023729239307417004, 0.21945623895062097, 0.025173315887942034, 0.024230378266770904, 0.031126511306045393, 0.30254327645525336, 0.20414346420005255, 0.11888856782267491, -0.3088449208732402, 0.026487936777080976, 0.029782836290085504]
|
1,803.06255
|
Identification of SDSSJ141324.27+530527.0 as A New "Changing-Look"
Quasar with a "Turn-on" Transition
|
We here report an identification of SDSSJ141324+530527.0 (SBS1411+533) at
$z=0.456344$ as a new "changing-look" quasar with a "turn-on" spectral type
transition from Type-1.9/2 to Type-1 within a rest frame time scale of 1-10 yr
by a comparison of our new spectroscopic observation and the Sloan Digital Sky
Survey (SDSS) archive data base. The SDSS DR7 spectrum taken in 2003 is
dominated by a starlight emission from host galaxies redward of the Balmer
limit, and has non-detectable broad H$\beta$ line. The new spectrum taken by us
on June 1st, 2017 and SDSS DR14 spectrum taken on May 29, 2017 indicate that
the object is of a typical quasar spectrum with a blue continuum and strong
Balmer broad emission lines. In addition, an intermediate spectral type can be
identified in the SDSS DR13 spectrum taken in 2015. The invariability of the
line wing of MgII$\lambda2800$ emission and time scale argument (The
invariability of [OIII]$\lambda$5007 line blue asymmetry) suggests that a
variation of obscuration (an accelerating outflow) is not a favorable scenario.
The time scale argument allows us to believe the type transition is possibly
caused by either a viscous radial inflow or a disk instability around a
$\sim5-9\times10^{7}M_\odot$ black hole.
|
astro-ph.GA astro-ph.CO
|
we here report an identification of sdssj1413245305270 sbs1411533 at z0456344 as a new changinglook quasar with a turnon spectral type transition from type192 to type1 within a rest frame time scale of 110 yr by a comparison of our new spectroscopic observation and the sloan digital sky survey sdss archive data base the sdss dr7 spectrum taken in 2003 is dominated by a starlight emission from host galaxies redward of the balmer limit and has nondetectable broad hbeta line the new spectrum taken by us on june 1st 2017 and sdss dr14 spectrum taken on may 29 2017 indicate that the object is of a typical quasar spectrum with a blue continuum and strong balmer broad emission lines in addition an intermediate spectral type can be identified in the sdss dr13 spectrum taken in 2015 the invariability of the line wing of mgiilambda2800 emission and time scale argument the invariability of oiiilambda5007 line blue asymmetry suggests that a variation of obscuration an accelerating outflow is not a favorable scenario the time scale argument allows us to believe the type transition is possibly caused by either a viscous radial inflow or a disk instability around a sim59times107m_odot black hole
|
[['we', 'here', 'report', 'an', 'identification', 'of', 'sdssj1413245305270', 'sbs1411533', 'at', 'z0456344', 'as', 'a', 'new', 'changinglook', 'quasar', 'with', 'a', 'turnon', 'spectral', 'type', 'transition', 'from', 'type192', 'to', 'type1', 'within', 'a', 'rest', 'frame', 'time', 'scale', 'of', '110', 'yr', 'by', 'a', 'comparison', 'of', 'our', 'new', 'spectroscopic', 'observation', 'and', 'the', 'sloan', 'digital', 'sky', 'survey', 'sdss', 'archive', 'data', 'base', 'the', 'sdss', 'dr7', 'spectrum', 'taken', 'in', '2003', 'is', 'dominated', 'by', 'a', 'starlight', 'emission', 'from', 'host', 'galaxies', 'redward', 'of', 'the', 'balmer', 'limit', 'and', 'has', 'nondetectable', 'broad', 'hbeta', 'line', 'the', 'new', 'spectrum', 'taken', 'by', 'us', 'on', 'june', '1st', '2017', 'and', 'sdss', 'dr14', 'spectrum', 'taken', 'on', 'may', '29', '2017', 'indicate', 'that', 'the', 'object', 'is', 'of', 'a', 'typical', 'quasar', 'spectrum', 'with', 'a', 'blue', 'continuum', 'and', 'strong', 'balmer', 'broad', 'emission', 'lines', 'in', 'addition', 'an', 'intermediate', 'spectral', 'type', 'can', 'be', 'identified', 'in', 'the', 'sdss', 'dr13', 'spectrum', 'taken', 'in', '2015', 'the', 'invariability', 'of', 'the', 'line', 'wing', 'of', 'mgiilambda2800', 'emission', 'and', 'time', 'scale', 'argument', 'the', 'invariability', 'of', 'oiiilambda5007', 'line', 'blue', 'asymmetry', 'suggests', 'that', 'a', 'variation', 'of', 'obscuration', 'an', 'accelerating', 'outflow', 'is', 'not', 'a', 'favorable', 'scenario', 'the', 'time', 'scale', 'argument', 'allows', 'us', 'to', 'believe', 'the', 'type', 'transition', 'is', 'possibly', 'caused', 'by', 'either', 'a', 'viscous', 'radial', 'inflow', 'or', 'a', 'disk', 'instability', 'around', 'a', 'sim59times107m_odot', 'black', 'hole']]
|
[-0.06533680425976247, 0.03986236823000885, -0.07722113349488306, 0.056143588651442165, -0.1325825573100398, -0.09621487936116561, 0.0701460565906018, 0.4258549513760954, -0.15511259548172043, -0.3072586484947048, 0.09000986103941007, -0.3031058090237669, 9.993946271909711e-05, 0.20052515688560865, -0.05482007183430445, -0.07106025937537197, 0.0402247934252955, -0.12425681910341761, 0.0024747781935730018, -0.20510556671918798, 0.3126588617202894, 0.08880987748489133, 0.2194647404491358, -0.018142238979635295, 0.04880388517449319, -0.07682391538977147, -0.11759614405309549, 0.014131956896259604, -0.11599853298722944, 0.03874634246009615, 0.21358303288919464, 0.12339786472087629, 0.24741378630763697, -0.2777769120742353, -0.19330202644050587, 0.06512515687533475, 0.19539855585996216, 0.08057672470507289, -0.04488754494013847, -0.32224223239609273, 0.027969622548577416, -0.189805737187271, -0.15618735319003463, 0.0880723664983331, 0.0716017495712246, 0.0016795284585289967, -0.221390313784165, 0.13730368129381532, 0.050247463888202525, 0.1295229286176133, -0.11644954750742424, -0.03354369862305854, -0.09928709455925855, 0.05964920329158, 0.014770811923275081, 0.055082688426106564, 0.14679669428733177, -0.08091205691744108, -0.06190392951490745, 0.40145349835802335, -0.10048735956661403, 0.08580975694591568, 0.16833255712739023, -0.17558944849467176, -0.16296951097319834, 0.22975521020453016, 0.16775240950664738, 0.12026684855663916, -0.13245481803824077, 0.04298234136482885, -0.038961251177776525, 0.28233854745364323, 0.02637045452744739, 0.04095886307550245, 0.31119290804781485, 0.061802874833423026, 0.026679843831516337, 0.0982801620372508, -0.26787124866442963, -0.011778715760253059, -0.29786981833846465, -0.07131480403919947, -0.15634856082973178, 0.1033617627667051, -0.09979065992918852, -0.13438681035040645, 0.40088786296352436, 0.07352918468980836, 0.27385163652676664, 0.028622717375280143, 0.28842340902095503, 0.1083086079355174, 0.09479792787897168, 0.06846795712893557, 0.3211744703973333, 0.12588836826519886, 0.1836564291297691, -0.20841600467732255, 0.015708743364181526, 0.04763066683684277]
|
1,803.06256
|
Study for material analogs of FeSb$_{2}$: material design for
thermoelectric materials
|
Using the \emph{ab initio} evolutionary algorithm (implemented in USPEX) and
electronic structure calculations we investigate the properties of a new
thermoelectric material FeSbAs, which is a material analog of the enigmatic
thermoelectric FeSb$_{2}$. We utilize the density functional theory and the
Gutzwiller method to check the energetics. We find that FeSbAs can be made
thermodynamically stable above $\sim$30 GPa. We investigate the electronic
structure and thermoelectric properties of FeSbAs based on the density
functional theory and compare with those of FeSb$_{2}$. Above 50 K, FeSbAs has
higher Seebeck coefficients than FeSb$_{2}$. Upon doping, the figure of merit
becomes larger for FeSbAs than for FeSb$_{2}$. Another material analog FeSbP,
was also investigated, and found thermodynamically unstable even at very high
pressure. Regarding FeSb$_{2}$ as a member of a family of compounds
(FeSb$_{2}$, FeSbAs, and FeSbP) we elucidate what are the chemical handles that
control the gaps in this series. We also investigate solubility (As or P for Sb
in FeSb$_{2}$) we found As to be more soluble. Finally, we study a two-band
model for thermoelectric properties and find that the temperature dependent
chemical potential and the presence of the ionized impurities are important to
explain the extremum in the Seebeck coefficient exhibited in experiments for
FeSb$_{2}$.
|
cond-mat.mtrl-sci cond-mat.str-el
|
using the emphab initio evolutionary algorithm implemented in uspex and electronic structure calculations we investigate the properties of a new thermoelectric material fesbas which is a material analog of the enigmatic thermoelectric fesb_2 we utilize the density functional theory and the gutzwiller method to check the energetics we find that fesbas can be made thermodynamically stable above sim30 gpa we investigate the electronic structure and thermoelectric properties of fesbas based on the density functional theory and compare with those of fesb_2 above 50 k fesbas has higher seebeck coefficients than fesb_2 upon doping the figure of merit becomes larger for fesbas than for fesb_2 another material analog fesbp was also investigated and found thermodynamically unstable even at very high pressure regarding fesb_2 as a member of a family of compounds fesb_2 fesbas and fesbp we elucidate what are the chemical handles that control the gaps in this series we also investigate solubility as or p for sb in fesb_2 we found as to be more soluble finally we study a twoband model for thermoelectric properties and find that the temperature dependent chemical potential and the presence of the ionized impurities are important to explain the extremum in the seebeck coefficient exhibited in experiments for fesb_2
|
[['using', 'the', 'emphab', 'initio', 'evolutionary', 'algorithm', 'implemented', 'in', 'uspex', 'and', 'electronic', 'structure', 'calculations', 'we', 'investigate', 'the', 'properties', 'of', 'a', 'new', 'thermoelectric', 'material', 'fesbas', 'which', 'is', 'a', 'material', 'analog', 'of', 'the', 'enigmatic', 'thermoelectric', 'fesb_2', 'we', 'utilize', 'the', 'density', 'functional', 'theory', 'and', 'the', 'gutzwiller', 'method', 'to', 'check', 'the', 'energetics', 'we', 'find', 'that', 'fesbas', 'can', 'be', 'made', 'thermodynamically', 'stable', 'above', 'sim30', 'gpa', 'we', 'investigate', 'the', 'electronic', 'structure', 'and', 'thermoelectric', 'properties', 'of', 'fesbas', 'based', 'on', 'the', 'density', 'functional', 'theory', 'and', 'compare', 'with', 'those', 'of', 'fesb_2', 'above', '50', 'k', 'fesbas', 'has', 'higher', 'seebeck', 'coefficients', 'than', 'fesb_2', 'upon', 'doping', 'the', 'figure', 'of', 'merit', 'becomes', 'larger', 'for', 'fesbas', 'than', 'for', 'fesb_2', 'another', 'material', 'analog', 'fesbp', 'was', 'also', 'investigated', 'and', 'found', 'thermodynamically', 'unstable', 'even', 'at', 'very', 'high', 'pressure', 'regarding', 'fesb_2', 'as', 'a', 'member', 'of', 'a', 'family', 'of', 'compounds', 'fesb_2', 'fesbas', 'and', 'fesbp', 'we', 'elucidate', 'what', 'are', 'the', 'chemical', 'handles', 'that', 'control', 'the', 'gaps', 'in', 'this', 'series', 'we', 'also', 'investigate', 'solubility', 'as', 'or', 'p', 'for', 'sb', 'in', 'fesb_2', 'we', 'found', 'as', 'to', 'be', 'more', 'soluble', 'finally', 'we', 'study', 'a', 'twoband', 'model', 'for', 'thermoelectric', 'properties', 'and', 'find', 'that', 'the', 'temperature', 'dependent', 'chemical', 'potential', 'and', 'the', 'presence', 'of', 'the', 'ionized', 'impurities', 'are', 'important', 'to', 'explain', 'the', 'extremum', 'in', 'the', 'seebeck', 'coefficient', 'exhibited', 'in', 'experiments', 'for', 'fesb_2']]
|
[-0.11484354112602385, 0.1120975394354757, -0.07383664110858966, 0.05474160557493494, -0.045927164821012126, -0.13509767783548812, 0.0953821619672086, 0.3940911178128436, -0.2547630276393347, -0.29042134957911053, 0.022469887492164345, -0.3270183427401548, -0.17622115645967532, 0.2063018536055231, 0.028517534636337254, 0.00807728988561192, -0.0402808102315723, 0.0009539211168885231, -0.14194726944385497, -0.22930845999952607, 0.25008147763859095, 0.09084519587475531, 0.26000271715554113, 0.0883986345455601, 0.020377443711103622, -0.04939903376917607, 0.08729467021087124, 0.07938361450745335, -0.1866740746098657, 0.08438504869668868, 0.2759411065573139, -0.054945589475599785, 0.19653967019311597, -0.3997194479114096, -0.22905903162774194, 0.0021198935453490965, 0.08553341765121873, 0.11713597839273825, -0.09432623687530282, -0.18212782449646409, 0.12949479748254064, -0.183138644951281, -0.1325161641537042, -0.13501898467705903, 0.009913422187946259, -0.007696986328030528, -0.21236132058312684, 0.11899879042906779, 0.014503917186589811, 0.08231604850091576, -0.1280173804493979, -0.20966409615773177, -0.058529810859532704, 0.012159446049355467, 0.014767676424992092, -0.011774393430511867, 0.1803218760582724, -0.1174057513656636, -0.071452832857624, 0.40722230373706275, -0.05859887535472199, -0.07579946979935387, 0.16273522651479053, -0.17620980274161607, -0.13710776480199227, 0.11909532180202785, 0.1147154931820874, 0.103205781712944, -0.15436097331117984, 0.06075271808546899, -0.017845277117078968, 0.17720688218388506, 0.04360113535971, 0.06746250246720288, 0.2064713562123037, 0.19260536095705524, 0.025806392825167314, 0.1557789651959162, -0.0836485897728788, -0.016525732066592413, -0.1774539857160293, -0.2364353739835432, -0.17233819174213252, 0.10045540951343776, -0.08009366072620279, -0.18509243843615916, 0.39824593997574204, 0.1804349275083359, 0.1619307444651102, -0.035458322820308724, 0.20280680274866117, 0.11900160465621173, 0.06638815370044245, 0.05785397258747754, 0.25119061459755077, 0.16215336431515187, 0.07427989035211686, -0.2866161090810439, 0.12457503038664977, 0.023097512092019244]
|
1,803.06257
|
Extreme Khovanov spectra
|
We prove that the spectrum constructed by Gonz\'alez-Meneses, Manch\'on and
the second author is stably homotopy equivalent to the Khovanov spectrum of
Lipshitz and Sarkar at its extreme quantum grading.
|
math.GT
|
we prove that the spectrum constructed by gonzalezmeneses manchon and the second author is stably homotopy equivalent to the khovanov spectrum of lipshitz and sarkar at its extreme quantum grading
|
[['we', 'prove', 'that', 'the', 'spectrum', 'constructed', 'by', 'gonzalezmeneses', 'manchon', 'and', 'the', 'second', 'author', 'is', 'stably', 'homotopy', 'equivalent', 'to', 'the', 'khovanov', 'spectrum', 'of', 'lipshitz', 'and', 'sarkar', 'at', 'its', 'extreme', 'quantum', 'grading']]
|
[-0.12736476349333922, 0.07571003021051487, -0.1292848184860001, 0.09219376813077057, -0.053564801998436454, -0.17832168897924325, -0.03320966258179396, 0.35014736376081906, -0.33095732393364113, -0.25383477957608797, 0.10058768309342364, -0.2439569362749656, -0.15866868142038584, 0.13446011257668336, -0.19007695447653533, -0.016738898836774752, 0.04828209287952632, 0.07142020755757889, -0.022662349068559705, -0.2881306288142999, 0.40159077222148576, 0.10559423150649914, 0.20979824894808796, 0.06157587990164757, 0.10621931863327821, -0.00011654236974815528, -0.015524328531076511, -0.01848611809158077, -0.16918462400911569, 0.13677870904405912, 0.24494326409573355, 0.048509868506031735, 0.1995572067797184, -0.26309477924369273, -0.1128464113920927, 0.11369142973174652, 0.08344866881767908, -0.03235068361585339, 0.02954293255849431, -0.33492850965509813, 0.19706576621780794, -0.209744140257438, -0.10343439335313936, -0.06840976442520817, 0.021603167802095414, -0.013100510587294896, -0.18299570207794508, -0.005274047330021858, 0.10731926746666431, 0.11659451371524483, -0.0476777044008486, -0.030320221123596034, -0.10821217076542476, 0.12792645171284675, -0.012650609489840765, 0.01828493728923301, 0.0676081619070222, -0.067792084099104, -0.12951406619201103, 0.31873291780551277, -0.08791175199051698, -0.09793595807471624, 0.12213091962039471, -0.15925302566029131, -0.19165136329829693, 0.15509728652735552, -0.08646125793457031, 0.1192134310801824, -0.02434029520954937, 0.1959303115766185, -0.05054759448394179, 0.08973377073804538, 0.14070357441281278, -0.08290266119875014, 0.08416917311648528, -0.011750479166706403, 0.10463736588135361, 0.12052618362164745, 0.014806147913138073, -0.013696487806737424, -0.25142669333145024, -0.2041665196418762, -0.19209179785102606, 0.13748198614145318, -0.02539480266374691, -0.1563496396721651, 0.4281054618457953, 0.06435245272393028, 0.11874255236859123, 0.15450933783625562, 0.24249643000463644, 0.12230154560238589, 0.021528263467674454, 0.08236502115614712, 0.21505610851260523, 0.25269368949811905, 0.09505314389243721, -0.1390359687570405, -0.051496613305062056, 0.2832598623509208]
|
1,803.06258
|
Online Controlled Experiments for Personalised e-Commerce Strategies:
Design, Challenges, and Pitfalls
|
Online controlled experiments are the primary tool for measuring the causal
impact of product changes in digital businesses. It is increasingly common for
digital products and services to interact with customers in a personalised way.
Using online controlled experiments to optimise personalised interaction
strategies is challenging because the usual assumption of statistically
equivalent user groups is violated. Additionally, challenges are introduced by
users qualifying for strategies based on dynamic, stochastic attributes.
Traditional A/B tests can salvage statistical equivalence by pre-allocating
users to control and exposed groups, but this dilutes the experimental metrics
and reduces the test power. We present a stacked incrementality test framework
that addresses problems with running online experiments for personalised user
strategies. We derive bounds that show that our framework is superior to the
best simple A/B test given enough users and that this condition is easily met
for large scale online experiments. In addition, we provide a test power
calculator and describe a selection of pitfalls and lessons learnt from our
experience using it.
|
stat.ME cs.DM stat.AP
|
online controlled experiments are the primary tool for measuring the causal impact of product changes in digital businesses it is increasingly common for digital products and services to interact with customers in a personalised way using online controlled experiments to optimise personalised interaction strategies is challenging because the usual assumption of statistically equivalent user groups is violated additionally challenges are introduced by users qualifying for strategies based on dynamic stochastic attributes traditional ab tests can salvage statistical equivalence by preallocating users to control and exposed groups but this dilutes the experimental metrics and reduces the test power we present a stacked incrementality test framework that addresses problems with running online experiments for personalised user strategies we derive bounds that show that our framework is superior to the best simple ab test given enough users and that this condition is easily met for large scale online experiments in addition we provide a test power calculator and describe a selection of pitfalls and lessons learnt from our experience using it
|
[['online', 'controlled', 'experiments', 'are', 'the', 'primary', 'tool', 'for', 'measuring', 'the', 'causal', 'impact', 'of', 'product', 'changes', 'in', 'digital', 'businesses', 'it', 'is', 'increasingly', 'common', 'for', 'digital', 'products', 'and', 'services', 'to', 'interact', 'with', 'customers', 'in', 'a', 'personalised', 'way', 'using', 'online', 'controlled', 'experiments', 'to', 'optimise', 'personalised', 'interaction', 'strategies', 'is', 'challenging', 'because', 'the', 'usual', 'assumption', 'of', 'statistically', 'equivalent', 'user', 'groups', 'is', 'violated', 'additionally', 'challenges', 'are', 'introduced', 'by', 'users', 'qualifying', 'for', 'strategies', 'based', 'on', 'dynamic', 'stochastic', 'attributes', 'traditional', 'ab', 'tests', 'can', 'salvage', 'statistical', 'equivalence', 'by', 'preallocating', 'users', 'to', 'control', 'and', 'exposed', 'groups', 'but', 'this', 'dilutes', 'the', 'experimental', 'metrics', 'and', 'reduces', 'the', 'test', 'power', 'we', 'present', 'a', 'stacked', 'incrementality', 'test', 'framework', 'that', 'addresses', 'problems', 'with', 'running', 'online', 'experiments', 'for', 'personalised', 'user', 'strategies', 'we', 'derive', 'bounds', 'that', 'show', 'that', 'our', 'framework', 'is', 'superior', 'to', 'the', 'best', 'simple', 'ab', 'test', 'given', 'enough', 'users', 'and', 'that', 'this', 'condition', 'is', 'easily', 'met', 'for', 'large', 'scale', 'online', 'experiments', 'in', 'addition', 'we', 'provide', 'a', 'test', 'power', 'calculator', 'and', 'describe', 'a', 'selection', 'of', 'pitfalls', 'and', 'lessons', 'learnt', 'from', 'our', 'experience', 'using', 'it']]
|
[-0.07104119368124798, 0.051610690292104015, -0.08039223697103028, 0.10465541112145209, -0.14607858992115194, -0.2002238129484578, 0.09250229608733207, 0.41761316709397805, -0.23444671330591, -0.33056002561386866, 0.10520514642190565, -0.28794854720278334, -0.16973599033718484, 0.22823676997324496, -0.09241816347154479, 0.04364694738649719, 0.10476100883984361, -0.0007004097859039792, -0.034692666787859275, -0.3048686016949692, 0.29129293609696016, 0.09296273978404879, 0.331432125276132, 0.055711969533669095, 0.09343058458069295, 0.00314926046467874, -0.08490206727236953, 0.04534750823153272, -0.10545411559845282, 0.12733106206728517, 0.32824366170271313, 0.22520226104617386, 0.3205968170853642, -0.4155506730811404, -0.14839372936625123, 0.0956248899733293, 0.11323334062122047, 0.06445125967314068, -0.09246070211866893, -0.3177145587757141, 0.11804118355281562, -0.19462188363502805, -0.07186449889836478, -0.11615737590251402, -0.0340379221791712, 0.03314842351911856, -0.3416430952659409, 0.012782365452342978, -0.008902778469270007, 0.07054035145501118, -0.03762697106728973, -0.07546364304809165, 0.06888992352400064, 0.1879856994852335, 0.059978724794096445, -0.02770206813944415, 0.1803578351862684, -0.1243235861887418, -0.14716812322426231, 0.4114395939756096, -0.03459961005726308, -0.19975189824305875, 0.18936065771101443, -0.033654729275786804, -0.1464771008856284, 0.05108067580260381, 0.22664284330329837, 0.09349973004732635, -0.1990450323625867, 0.04300372205034364, -0.028306748582205426, 0.17670617979906855, 0.030745374350295777, -0.018039967182890644, 0.18069710953637869, 0.18646234200735176, 0.07703912056638815, 0.11819734739228374, -0.00134956255593958, -0.07175014420811619, -0.2488607772836639, -0.13278916515853434, -0.1433098347181277, -0.0025759767630093152, -0.08982204797714421, -0.1063759516047347, 0.36514765161111773, 0.21354569233066978, 0.1099655015443984, 0.08314395167066582, 0.3433898165614145, 0.050498200690656504, 0.08729688662459098, 0.08754715410136019, 0.19102465883562608, 0.0035874428812392232, 0.10677662247603405, -0.16111217401339673, 0.11557007391820662, -0.017757664171291425]
|
1,803.06259
|
Oncilla robot: a versatile open-source quadruped research robot with
compliant pantograph legs
|
We present Oncilla robot, a novel mobile, quadruped legged locomotion
machine. This large-cat sized, 5.1 robot is one of a kind of a recent,
bioinspired legged robot class designed with the capability of model-free
locomotion control. Animal legged locomotion in rough terrain is clearly shaped
by sensor feedback systems. Results with Oncilla robot show that agile and
versatile locomotion is possible without sensory signals to some extend, and
tracking becomes robust when feedback control is added (Ajaoolleian 2015). By
incorporating mechanical and control blueprints inspired from animals, and by
observing the resulting robot locomotion characteristics, we aim to understand
the contribution of individual components. Legged robots have a wide mechanical
and control design parameter space, and a unique potential as research tools to
investigate principles of biomechanics and legged locomotion control. But the
hardware and controller design can be a steep initial hurdle for academic
research. To facilitate the easy start and development of legged robots,
Oncilla-robot's blueprints are available through open-source. [...]
|
cs.RO
|
we present oncilla robot a novel mobile quadruped legged locomotion machine this largecat sized 51 robot is one of a kind of a recent bioinspired legged robot class designed with the capability of modelfree locomotion control animal legged locomotion in rough terrain is clearly shaped by sensor feedback systems results with oncilla robot show that agile and versatile locomotion is possible without sensory signals to some extend and tracking becomes robust when feedback control is added ajaoolleian 2015 by incorporating mechanical and control blueprints inspired from animals and by observing the resulting robot locomotion characteristics we aim to understand the contribution of individual components legged robots have a wide mechanical and control design parameter space and a unique potential as research tools to investigate principles of biomechanics and legged locomotion control but the hardware and controller design can be a steep initial hurdle for academic research to facilitate the easy start and development of legged robots oncillarobots blueprints are available through opensource
|
[['we', 'present', 'oncilla', 'robot', 'a', 'novel', 'mobile', 'quadruped', 'legged', 'locomotion', 'machine', 'this', 'largecat', 'sized', '51', 'robot', 'is', 'one', 'of', 'a', 'kind', 'of', 'a', 'recent', 'bioinspired', 'legged', 'robot', 'class', 'designed', 'with', 'the', 'capability', 'of', 'modelfree', 'locomotion', 'control', 'animal', 'legged', 'locomotion', 'in', 'rough', 'terrain', 'is', 'clearly', 'shaped', 'by', 'sensor', 'feedback', 'systems', 'results', 'with', 'oncilla', 'robot', 'show', 'that', 'agile', 'and', 'versatile', 'locomotion', 'is', 'possible', 'without', 'sensory', 'signals', 'to', 'some', 'extend', 'and', 'tracking', 'becomes', 'robust', 'when', 'feedback', 'control', 'is', 'added', 'ajaoolleian', '2015', 'by', 'incorporating', 'mechanical', 'and', 'control', 'blueprints', 'inspired', 'from', 'animals', 'and', 'by', 'observing', 'the', 'resulting', 'robot', 'locomotion', 'characteristics', 'we', 'aim', 'to', 'understand', 'the', 'contribution', 'of', 'individual', 'components', 'legged', 'robots', 'have', 'a', 'wide', 'mechanical', 'and', 'control', 'design', 'parameter', 'space', 'and', 'a', 'unique', 'potential', 'as', 'research', 'tools', 'to', 'investigate', 'principles', 'of', 'biomechanics', 'and', 'legged', 'locomotion', 'control', 'but', 'the', 'hardware', 'and', 'controller', 'design', 'can', 'be', 'a', 'steep', 'initial', 'hurdle', 'for', 'academic', 'research', 'to', 'facilitate', 'the', 'easy', 'start', 'and', 'development', 'of', 'legged', 'robots', 'oncillarobots', 'blueprints', 'are', 'available', 'through', 'opensource']]
|
[-0.12027085504856459, 0.12600793690675763, -0.09260061023620426, -0.044309582087436725, -0.22296676333922488, -0.23716793097792918, -0.006701093714292737, 0.45870491641627, -0.2571055349970984, -0.371840166675437, 0.08618358694347641, -0.1811105597669342, -0.25981307458607067, 0.26049335429349996, -0.20168411944085246, 0.13657215328970154, 0.11379858068113399, -0.04716117048019152, 0.10406899337499598, -0.14644491849140898, 0.2064386637982242, 0.0043557588230510045, 0.25832502779722877, -0.005086985327730513, 0.18912588796655463, 0.013949768370088593, 0.035448656180149814, 0.008795338200670697, -0.10325088626639302, 0.1554919882339372, 0.3465016771680349, 0.13882932222038982, 0.3378522440162339, -0.44945198392412467, -0.21547387695758585, 0.0824924315841999, 0.1060265070687576, 0.07165781938571744, -0.07220818588486427, -0.3432661805562912, 0.06246655664457139, -0.19240063159566395, -0.15797560319903597, -0.12525046860597505, 0.04866555059524431, 0.027738469857044975, -0.22634462606470296, -0.08773529572875068, 0.01827615325540826, 0.1377265809495358, -0.10925867827757481, -0.05304582322396006, 0.00592188800501216, 0.22299393894878264, 0.004923477525686382, 0.008506033229226377, 0.28146369341215133, -0.19172618842304084, -0.19467294882021988, 0.4068005040442203, 0.10502754199573663, -0.22076771732947675, 0.2502480188954123, -0.055794465480146896, -0.09865621737186696, 0.10885433421120237, 0.2803583166912008, 0.09697278970733854, -0.2069731745621446, 0.011788230501693692, 0.0363435459554575, 0.14452210038004645, 0.007765805013596442, -0.08531359372553741, 0.19236934246720783, 0.29031213359598806, 0.13055081906943294, 0.12183791710209149, -0.029586809028865426, -0.11626867393838466, -0.2178286685571994, -0.12816160029856263, -0.11505283565248606, -0.017481965979762898, -0.052582921436264855, -0.09370489662904648, 0.37983400002418527, 0.1779525453376044, 0.1324390465197907, 0.10713109628380436, 0.37266966132269164, -0.0204607033935245, 0.08788192704331818, 0.07929865267293848, 0.25145726825743114, 0.01407345480309313, 0.17780176177917487, -0.23745258388133234, 0.10148423932756706, -0.03847776593011656]
|
1,803.0626
|
Stability, well-posedness and blow-up criterion for the Incompressible
Slice Model
|
In atmospheric science, slice models are frequently used to study the
behaviour of weather, and specifically the formation of atmospheric fronts,
whose prediction is fundamental in meteorology. In 2013, Cotter and Holm
introduced a new slice model, which they formulated using Hamilton's
variational principle, modified for this purpose. In this paper, we show the
local existence and uniqueness of strong solutions of the related ISM
(Incompressible Slice Model). The ISM is a modified version of the Cotter-Holm
Slice Model (CHSM) that we have obtained by adapting the Lagrangian function in
Hamilton's principle for CHSM to the Euler-Boussinesq Eady incompressible case.
Besides proving local existence and uniqueness, in this paper we also construct
a blow-up criterion for the ISM, and study Arnold's stability around a
restricted class of equilibrium solutions. These results establish the
potential applicability of the ISM equations in physically meaningful
situations.
|
math.AP math-ph math.MP
|
in atmospheric science slice models are frequently used to study the behaviour of weather and specifically the formation of atmospheric fronts whose prediction is fundamental in meteorology in 2013 cotter and holm introduced a new slice model which they formulated using hamiltons variational principle modified for this purpose in this paper we show the local existence and uniqueness of strong solutions of the related ism incompressible slice model the ism is a modified version of the cotterholm slice model chsm that we have obtained by adapting the lagrangian function in hamiltons principle for chsm to the eulerboussinesq eady incompressible case besides proving local existence and uniqueness in this paper we also construct a blowup criterion for the ism and study arnolds stability around a restricted class of equilibrium solutions these results establish the potential applicability of the ism equations in physically meaningful situations
|
[['in', 'atmospheric', 'science', 'slice', 'models', 'are', 'frequently', 'used', 'to', 'study', 'the', 'behaviour', 'of', 'weather', 'and', 'specifically', 'the', 'formation', 'of', 'atmospheric', 'fronts', 'whose', 'prediction', 'is', 'fundamental', 'in', 'meteorology', 'in', '2013', 'cotter', 'and', 'holm', 'introduced', 'a', 'new', 'slice', 'model', 'which', 'they', 'formulated', 'using', 'hamiltons', 'variational', 'principle', 'modified', 'for', 'this', 'purpose', 'in', 'this', 'paper', 'we', 'show', 'the', 'local', 'existence', 'and', 'uniqueness', 'of', 'strong', 'solutions', 'of', 'the', 'related', 'ism', 'incompressible', 'slice', 'model', 'the', 'ism', 'is', 'a', 'modified', 'version', 'of', 'the', 'cotterholm', 'slice', 'model', 'chsm', 'that', 'we', 'have', 'obtained', 'by', 'adapting', 'the', 'lagrangian', 'function', 'in', 'hamiltons', 'principle', 'for', 'chsm', 'to', 'the', 'eulerboussinesq', 'eady', 'incompressible', 'case', 'besides', 'proving', 'local', 'existence', 'and', 'uniqueness', 'in', 'this', 'paper', 'we', 'also', 'construct', 'a', 'blowup', 'criterion', 'for', 'the', 'ism', 'and', 'study', 'arnolds', 'stability', 'around', 'a', 'restricted', 'class', 'of', 'equilibrium', 'solutions', 'these', 'results', 'establish', 'the', 'potential', 'applicability', 'of', 'the', 'ism', 'equations', 'in', 'physically', 'meaningful', 'situations']]
|
[-0.08834119071917874, 0.03886746580912066, -0.1038400512604442, 0.12431989694263652, -0.06054325212857553, -0.08833422913615192, -0.006032936344022996, 0.2925542972316699, -0.27598271653987466, -0.2847627702900874, 0.1266592990931323, -0.18300703682138453, -0.16101889698433558, 0.1680212463069308, -0.09087591768641556, 0.06740368707770748, 0.050899015124222, -0.05134718118435038, -0.04349501219070849, -0.23250740944474405, 0.3384609500278852, 0.024968300686616984, 0.25332647168210576, 0.044854823159403166, 0.10100654893150411, -0.02674936124323202, -0.035523702284055096, 0.042853527409689764, -0.23524788254399026, 0.11571158743712918, 0.23036290342604063, 0.10942355992405542, 0.27536692948612784, -0.4033559416952942, -0.25799376498907806, 0.11109112042800656, 0.12516013651620597, 0.09750604099577426, -0.05044433347814317, -0.2856522034837066, 0.08632946508005261, -0.14785736478432746, -0.21030046223729318, -0.061253539313163075, -0.020377358587990915, 0.04310081294804279, -0.24439491424709558, 0.11422529886622215, 0.09015295818181975, 0.07900232835672796, -0.15101982649565407, -0.04086466130600976, -0.02928439208189957, 0.07444480191583612, 0.051703511200945025, 0.006774850074933576, 0.06399155011084597, -0.1416676443918342, -0.061727351742696814, 0.40306147817256194, -0.08920936632369246, -0.23049374756270222, 0.21575618353672327, -0.09960672591114417, -0.17299958461829062, 0.08171765037113801, 0.16062121549621225, 0.1526131437758782, -0.17083749711580043, 0.08509472323972399, -0.1114799131622671, 0.08832976653772806, 0.08382314157206565, -0.018800188617647758, 0.15904184908182029, 0.12240354196900236, 0.09823306204385257, 0.13965322748325498, -0.05055867056694946, -0.14086874225509485, -0.32677652579067007, -0.1913395755126008, -0.11803290493220889, 0.05749298410623201, -0.07338541164676177, -0.1593580994256107, 0.4087567124823441, 0.1589283212387402, 0.11911543193273247, 0.058730030862248636, 0.24892117403214797, 0.1051978857231526, -0.03419745213219098, 0.09467705410372998, 0.24835362400294148, 0.17128999330702105, 0.14823138402508837, -0.177626921344615, 0.04645698314333069, 0.17872863251083929]
|
1,803.06261
|
Vector-valued higher depth quantum modular forms and higher Mordell
integrals
|
In this paper, we prove vector-valued higher depth quantum modular properties
arising from characters of certain vertex algebras. We then find
two-dimensional Mordell integral representations for their errors of
modularity.
|
math.NT math.QA math.RT
|
in this paper we prove vectorvalued higher depth quantum modular properties arising from characters of certain vertex algebras we then find twodimensional mordell integral representations for their errors of modularity
|
[['in', 'this', 'paper', 'we', 'prove', 'vectorvalued', 'higher', 'depth', 'quantum', 'modular', 'properties', 'arising', 'from', 'characters', 'of', 'certain', 'vertex', 'algebras', 'we', 'then', 'find', 'twodimensional', 'mordell', 'integral', 'representations', 'for', 'their', 'errors', 'of', 'modularity']]
|
[-0.1441448200494051, 0.07661042458057636, -0.08723369675378005, 0.09697340625571087, -0.11862221906582514, -0.0892443890372912, -0.03713655509442712, 0.3679840949674447, -0.43791506364941596, -0.20431954646483064, 0.06664125687675551, -0.25945185165231427, -0.2773322532263895, 0.20124947521835565, -0.14800286622097095, 0.08397023188881576, 0.07644459952910741, 0.09238506791492303, -0.16458997863034408, -0.3419917062545816, 0.447193078075846, -0.055903155694250015, 0.2089546429924667, 0.030314663797616957, 0.10530750753047566, 0.08545480330164233, -0.006510014273226261, -0.04564678060511748, -0.17692695502191783, 0.2210807863312463, 0.3335971397658189, 0.037984791623118026, 0.23029071861067982, -0.41620980923374495, -0.11775806980828445, 0.15917107293692728, 0.11896342945595582, 0.0776846124480168, 0.008385672940251727, -0.26739103297392525, 0.076261082260559, -0.20738517604768275, -0.15654641293610136, -0.09614611314609647, 0.001691600928703944, 0.027688667736947538, -0.2174446062495311, 0.06958301166693369, 0.08064596680924296, 0.16923468168824912, -0.09690475755681595, -0.15417733495123684, -0.006864926653603712, 0.10525470854093631, -0.04737886041402817, -0.028742443770170212, 0.06668549049645663, -0.2341719077822442, -0.15831872195315858, 0.31181250388423604, 0.00434561800211668, -0.18439102685078979, 0.10634839590638875, -0.15419990438967943, -0.24480046695098281, 0.07274549800592164, 0.14980685239036878, 0.09461797488232454, -0.09202913561215004, 0.15599775857602557, -0.09817039392267664, 0.05540532089071348, 0.11554013639688492, 0.08171931312729915, 0.12937703692975144, 0.008357651128123204, 0.05646331288541357, 0.23591490052640438, -0.028813317666451135, 0.00678031388670206, -0.30923006162047384, -0.19692692356184124, -0.10550504333805293, 0.1292166332093378, -0.12575253508985043, -0.21450404323016603, 0.4442938920110464, 0.1714064721018076, 0.18372505887721977, 0.2259337494149804, 0.16320841560761135, 0.16915994907418888, 0.10609424101033559, 0.042666313626493015, 0.09934695167466998, 0.1891740865074098, -0.004395079892128706, -0.12423549093073234, -0.04865748866771658, 0.20001004319638013]
|
1,803.06262
|
Heterogeneous Doppler Spread-based CSI Estimation Planning for TDD
Massive MIMO
|
Massive multi-input multi-output (Massive MIMO) has been recognized as a key
technology to meet the demand for higher data capacity and massive
connectivity. Nevertheless, the number of active users is restricted due to
training overhead and the limited coherence time. Current wireless systems
assume the same coherence slot duration for all users, regardless of their
heterogeneous Doppler spreads. In this paper, we exploit this neglected degree
of freedom in addressing the training overhead bottleneck. We propose a new
uplink training scheme where the periodicity of pilot transmission differs
among users based on their actual channel coherence times. Since the changes in
the wireless channel are, primarily, due to movement, uplink training decisions
are optimized, over long time periods, while considering the evolution of the
users channels and locations. Owing to the different rates of the wireless
channel and location evolution, a two time scale control problem is formulated.
In the fast time scale, an optimal training policy is derived by choosing which
users are requested to send their pilots. In the slow time scale, location
estimation decisions are optimized. Simulation results show that the derived
training policies provide a considerable improvement of the cumulative average
spectral efficiency even with partial location knowledge.
|
cs.IT math.IT
|
massive multiinput multioutput massive mimo has been recognized as a key technology to meet the demand for higher data capacity and massive connectivity nevertheless the number of active users is restricted due to training overhead and the limited coherence time current wireless systems assume the same coherence slot duration for all users regardless of their heterogeneous doppler spreads in this paper we exploit this neglected degree of freedom in addressing the training overhead bottleneck we propose a new uplink training scheme where the periodicity of pilot transmission differs among users based on their actual channel coherence times since the changes in the wireless channel are primarily due to movement uplink training decisions are optimized over long time periods while considering the evolution of the users channels and locations owing to the different rates of the wireless channel and location evolution a two time scale control problem is formulated in the fast time scale an optimal training policy is derived by choosing which users are requested to send their pilots in the slow time scale location estimation decisions are optimized simulation results show that the derived training policies provide a considerable improvement of the cumulative average spectral efficiency even with partial location knowledge
|
[['massive', 'multiinput', 'multioutput', 'massive', 'mimo', 'has', 'been', 'recognized', 'as', 'a', 'key', 'technology', 'to', 'meet', 'the', 'demand', 'for', 'higher', 'data', 'capacity', 'and', 'massive', 'connectivity', 'nevertheless', 'the', 'number', 'of', 'active', 'users', 'is', 'restricted', 'due', 'to', 'training', 'overhead', 'and', 'the', 'limited', 'coherence', 'time', 'current', 'wireless', 'systems', 'assume', 'the', 'same', 'coherence', 'slot', 'duration', 'for', 'all', 'users', 'regardless', 'of', 'their', 'heterogeneous', 'doppler', 'spreads', 'in', 'this', 'paper', 'we', 'exploit', 'this', 'neglected', 'degree', 'of', 'freedom', 'in', 'addressing', 'the', 'training', 'overhead', 'bottleneck', 'we', 'propose', 'a', 'new', 'uplink', 'training', 'scheme', 'where', 'the', 'periodicity', 'of', 'pilot', 'transmission', 'differs', 'among', 'users', 'based', 'on', 'their', 'actual', 'channel', 'coherence', 'times', 'since', 'the', 'changes', 'in', 'the', 'wireless', 'channel', 'are', 'primarily', 'due', 'to', 'movement', 'uplink', 'training', 'decisions', 'are', 'optimized', 'over', 'long', 'time', 'periods', 'while', 'considering', 'the', 'evolution', 'of', 'the', 'users', 'channels', 'and', 'locations', 'owing', 'to', 'the', 'different', 'rates', 'of', 'the', 'wireless', 'channel', 'and', 'location', 'evolution', 'a', 'two', 'time', 'scale', 'control', 'problem', 'is', 'formulated', 'in', 'the', 'fast', 'time', 'scale', 'an', 'optimal', 'training', 'policy', 'is', 'derived', 'by', 'choosing', 'which', 'users', 'are', 'requested', 'to', 'send', 'their', 'pilots', 'in', 'the', 'slow', 'time', 'scale', 'location', 'estimation', 'decisions', 'are', 'optimized', 'simulation', 'results', 'show', 'that', 'the', 'derived', 'training', 'policies', 'provide', 'a', 'considerable', 'improvement', 'of', 'the', 'cumulative', 'average', 'spectral', 'efficiency', 'even', 'with', 'partial', 'location', 'knowledge']]
|
[-0.22974066001519855, 0.08653888627744134, 0.009526418120886134, 0.04875443002559466, -0.09259740446952383, -0.19725482817162934, 0.11487217713637268, 0.4204745334895826, -0.2680929425808758, -0.3202847893243785, 0.11808669512877057, -0.20766800442220076, -0.10997210208921333, 0.14221357800859477, -0.13866875121729577, 0.07694651705609394, 0.08560394163135125, 0.06268613165752192, -0.0421531049653255, -0.31516807738202857, 0.2745948926013166, 0.11952562798921129, 0.3681100246284415, 0.005257562812565282, 0.08307481852030418, 0.008266088754482715, -0.07050847265832495, -0.0732215568284956, -0.06296052876532125, 0.0860414506091594, 0.3270339358800856, 0.19516425254860764, 0.3251891047901262, -0.44573787294586403, -0.2607792527956593, 0.10007117105657143, 0.18686114106152096, 0.08722196491308382, -0.02504383908160547, -0.27662882706874264, 0.10804167241123182, -0.1925576992586081, -0.03090597890169904, 0.026914651643964324, -0.01292793334710716, 0.03971610548542951, -0.31569278169202036, 0.05160917136253383, -0.010637854262817614, 0.05729446654584193, -0.052494814285160146, -0.08083704683703767, 0.022412157677445966, 0.2219346569952472, 0.07719893113359588, -0.020945694379388622, 0.11721978164888863, -0.1301547825142815, -0.0942801920959892, 0.3732543230877433, 0.024927111093581904, -0.1898221164183359, 0.15955903167239308, -0.1042932835442134, -0.06650567022705506, 0.17311156612456693, 0.2658434847371519, 0.08156422878578674, -0.19438282521164948, 0.00863648333130312, 0.017339952596656903, 0.19869538398902162, 0.08953432786153943, 0.13890252313530532, 0.1584184941283017, 0.2151874607834633, 0.10551140726184344, 0.08599383091106827, -0.11977853840862465, -0.13082469896399554, -0.2051545551535443, -0.11235968554611456, -0.21942455945870756, 0.02224550025634431, -0.09827214091630666, -0.06642762865493129, 0.366115310357933, 0.16168803325105036, 0.15872430391402195, 0.1340902488174996, 0.36225796861592496, 0.10843248837492037, 0.10870413611629184, 0.14091536154887538, 0.1859151029332292, 0.05340630677413417, 0.1870578311039089, -0.25248242752617317, 0.11533670331983098, -0.0466583232595764]
|
1,803.06263
|
A brief guide to reversing and extended symmetries of dynamical systems
|
The reversing symmetry group is a well-studied extension of the symmetry
group of a dynamical system, the latter being defined by the action of a single
homeomorphism on a topological space. While it is traditionally considered in
nonlinear dynamics, where the space is simple but the map is complicated, it
has an interesting counterpart in symbolic dynamics, where the map is simple
but the space is not. Moreover, there is an interesting extension to the case
of higher-dimensional shifts, where a similar concept can be introduced via the
centraliser and the normaliser of the acting group in the full automorphism
group of the shift space. We recall the basic notions and review some of the
known results, in a fairly informal manner, to give a first impression of the
phenomena that can show up in the extension from the centraliser to the
normaliser, with some emphasis on recent developments.
|
math.DS
|
the reversing symmetry group is a wellstudied extension of the symmetry group of a dynamical system the latter being defined by the action of a single homeomorphism on a topological space while it is traditionally considered in nonlinear dynamics where the space is simple but the map is complicated it has an interesting counterpart in symbolic dynamics where the map is simple but the space is not moreover there is an interesting extension to the case of higherdimensional shifts where a similar concept can be introduced via the centraliser and the normaliser of the acting group in the full automorphism group of the shift space we recall the basic notions and review some of the known results in a fairly informal manner to give a first impression of the phenomena that can show up in the extension from the centraliser to the normaliser with some emphasis on recent developments
|
[['the', 'reversing', 'symmetry', 'group', 'is', 'a', 'wellstudied', 'extension', 'of', 'the', 'symmetry', 'group', 'of', 'a', 'dynamical', 'system', 'the', 'latter', 'being', 'defined', 'by', 'the', 'action', 'of', 'a', 'single', 'homeomorphism', 'on', 'a', 'topological', 'space', 'while', 'it', 'is', 'traditionally', 'considered', 'in', 'nonlinear', 'dynamics', 'where', 'the', 'space', 'is', 'simple', 'but', 'the', 'map', 'is', 'complicated', 'it', 'has', 'an', 'interesting', 'counterpart', 'in', 'symbolic', 'dynamics', 'where', 'the', 'map', 'is', 'simple', 'but', 'the', 'space', 'is', 'not', 'moreover', 'there', 'is', 'an', 'interesting', 'extension', 'to', 'the', 'case', 'of', 'higherdimensional', 'shifts', 'where', 'a', 'similar', 'concept', 'can', 'be', 'introduced', 'via', 'the', 'centraliser', 'and', 'the', 'normaliser', 'of', 'the', 'acting', 'group', 'in', 'the', 'full', 'automorphism', 'group', 'of', 'the', 'shift', 'space', 'we', 'recall', 'the', 'basic', 'notions', 'and', 'review', 'some', 'of', 'the', 'known', 'results', 'in', 'a', 'fairly', 'informal', 'manner', 'to', 'give', 'a', 'first', 'impression', 'of', 'the', 'phenomena', 'that', 'can', 'show', 'up', 'in', 'the', 'extension', 'from', 'the', 'centraliser', 'to', 'the', 'normaliser', 'with', 'some', 'emphasis', 'on', 'recent', 'developments']]
|
[-0.1380047539792855, 0.10653003888855525, -0.12084943944613305, 0.05183056801957572, -0.12979754120198972, -0.08546904428321368, 0.01475399560701327, 0.3564903604479244, -0.3118462825081492, -0.24243747000426255, 0.14969252839593855, -0.25233057103801093, -0.19646482052118985, 0.20810029688197496, -0.10758081766864247, -0.02441504412024413, 0.0027856796342354494, 0.13401793601810183, -0.09232499158703691, -0.22970963817327314, 0.34086140022681866, 0.03288260152900979, 0.2375110657698156, 0.01857386758838524, 0.10278833289823108, 0.0053843021402198, -0.009484503907112455, 0.02239144898110363, -0.10434506903114399, 0.1075172740200397, 0.21241870867525972, 0.08624972623379139, 0.23829283080870073, -0.35331444452898014, -0.2123258414297582, 0.11800451010181225, 0.11431359023718327, 0.09359223138593331, -0.06812725684468028, -0.3040667065222366, 0.055689484384160916, -0.16611559532157727, -0.10926633237879849, -0.05797704804966839, 0.06001390342056851, -0.02907819382654153, -0.22473177600701982, -0.017840675953400616, 0.10090694994561768, 0.08865255448067148, -0.03167839749284938, -0.03594111128875848, -0.024438057888624253, 0.12454618126991511, 0.028640059816757303, 0.0736090959481045, 0.0950019978683742, -0.11415352876104365, -0.11564021706799883, 0.45894969889781617, -0.06035549130568894, -0.2156705836571703, 0.18611196699495983, -0.16191714006982394, -0.1670382275158577, 0.10310757927121532, 0.09965884469249504, 0.1205188213916333, -0.10112331621348858, 0.15907817238851157, -0.11435454052829203, 0.1304609719202885, 0.003995491335506007, 0.015290544833987951, 0.14462857342468913, 0.17807017213621196, 0.10765253114920334, 0.15091477098934128, 0.02291409835616289, -0.0979435358902802, -0.33308567584261, -0.17107658079612825, -0.14650445283959376, 0.054388224191111265, -0.04521417185244613, -0.14218367538696167, 0.418743204112921, 0.09402745557111382, 0.21798640974928568, 0.02409974240616664, 0.26721842876547985, 0.1205241901537516, 0.09240613917776402, 0.050884668376990565, 0.19917989584918902, 0.1540583118674464, 0.008908826490589137, -0.1907842255153712, 0.034102390771075436, 0.11067423064436689]
|
1,803.06264
|
Characterization of Strict Positive Definiteness on products of complex
spheres
|
In this paper we consider Positive Definite functions on products
$\Omega_{2q}\times\Omega_{2p}$ of complex spheres, and we obtain a condition,
in terms of the coefficients in their disc polynomial expansions, which is
necessary and sufficient for the function to be Strictly Positive Definite. The
result includes also the more delicate cases in which $p$ and/or $q$ can be $1$
or $\infty$.
The condition we obtain states that a suitable set in $\mathbb{Z}^2$,
containing the indexes of the strictly positive coefficients in the expansion,
must intersect every product of arithmetic progressions.
|
math.CA
|
in this paper we consider positive definite functions on products omega_2qtimesomega_2p of complex spheres and we obtain a condition in terms of the coefficients in their disc polynomial expansions which is necessary and sufficient for the function to be strictly positive definite the result includes also the more delicate cases in which p andor q can be 1 or infty the condition we obtain states that a suitable set in mathbbz2 containing the indexes of the strictly positive coefficients in the expansion must intersect every product of arithmetic progressions
|
[['in', 'this', 'paper', 'we', 'consider', 'positive', 'definite', 'functions', 'on', 'products', 'omega_2qtimesomega_2p', 'of', 'complex', 'spheres', 'and', 'we', 'obtain', 'a', 'condition', 'in', 'terms', 'of', 'the', 'coefficients', 'in', 'their', 'disc', 'polynomial', 'expansions', 'which', 'is', 'necessary', 'and', 'sufficient', 'for', 'the', 'function', 'to', 'be', 'strictly', 'positive', 'definite', 'the', 'result', 'includes', 'also', 'the', 'more', 'delicate', 'cases', 'in', 'which', 'p', 'andor', 'q', 'can', 'be', '1', 'or', 'infty', 'the', 'condition', 'we', 'obtain', 'states', 'that', 'a', 'suitable', 'set', 'in', 'mathbbz2', 'containing', 'the', 'indexes', 'of', 'the', 'strictly', 'positive', 'coefficients', 'in', 'the', 'expansion', 'must', 'intersect', 'every', 'product', 'of', 'arithmetic', 'progressions']]
|
[-0.1694643154610689, 0.1288320489587601, -0.08071848460134458, 0.06807776807214726, -0.03282999189369465, -0.12580253019801935, 0.012661048146335153, 0.3437723172828555, -0.26202845390864904, -0.2034889720115726, 0.12218255318690684, -0.26466398648071016, -0.14091967506895095, 0.16941032479040918, -0.05644984744933688, 0.029966967762447894, 0.046214339418590746, 0.08563601356846365, -0.08573289902415127, -0.29175237405632454, 0.37080746950497007, -0.04856909267519685, 0.1499495807167312, 0.10687403285092759, 0.06532201209020885, 0.006774603738449514, -0.013216774871001358, 0.0006384401760897163, -0.175256713846879, 0.10378450959251495, 0.2408660925628448, 0.11129965156909417, 0.2782270470210774, -0.4046601535238468, -0.1205700483829291, 0.20548506068933586, 0.13500281918624585, 0.013455718594328077, 0.016182978294058226, -0.1967536183338697, 0.12634852550532247, -0.12819891354989854, -0.15337431583744052, -0.09738051767503335, 0.052790691933213646, 0.03391815547894856, -0.3698690981519493, 0.074754599163994, 0.12828613089566882, 0.06564158567396755, -0.07631008854844946, -0.12714019169586457, 0.01983659216784872, 0.10990002380144274, 0.016652245255748065, 0.02940013202367647, 0.04719808907181935, -0.08627961162975142, -0.06569423933979124, 0.3692375457189469, -0.062452917601066554, -0.3011154170910066, 0.15555339886552907, -0.22580617993265728, -0.13327508364719423, 0.10164365513165566, 0.15730431940491227, 0.1751382458023727, -0.05511670263314789, 0.13262955747036773, -0.08962455570740117, 0.14216384944632987, 0.14118689954788846, 0.013522104788783261, 0.15788316501262176, -0.005937926635273139, 0.12373341027705465, 0.16461228613942777, 0.04069654325774701, -0.031289664626290854, -0.35343682509846985, -0.19806929982521318, -0.1713584139943123, 0.09946892678271979, -0.12733139262226442, -0.2276185385205529, 0.3749603450044312, 0.04208314847941934, 0.21859629464928398, 0.08442062968441116, 0.24743665172718465, 0.1695466974747846, 0.06347282614760016, 0.050413836862637916, 0.12665624886523635, 0.12200227774817242, 0.049528625820213085, -0.1194656193944287, 0.07842092868998986, 0.09442856060129336]
|
1,803.06265
|
A quantum photonics model for non-classical light generation using
integrated nanoplasmonic cavity-emitter systems
|
The implementation of non-classical light sources is becoming increasingly
important for various quantum applications. A particularly interesting approach
is to integrate such functionalities on a single chip as this could pave the
way towards fully scalable quantum photonic devices. Several approaches using
dielectric systems have been investigated in the past. However, it is still not
understood how on-chip nanoplasmonic antennas, interacting with a single
quantum emitter, affect the quantum statistics of photons reflected or
transmitted in the guided mode of a waveguide. Here we investigate a quantum
photonic platform consisting of an evanescently coupled nanoplasmonic
cavity-emitter system and discuss the requirements for non-classical light
generation. We develop an analytical model that incorporates quenching due to
the nanoplasmonic cavity to predict the quantum statistics of the transmitted
and reflected guided waveguide light under weak coherent pumping. The
analytical predictions match numerical simulations based on a master equation
approach. It is moreover shown that for resonant excitation the degree of
anti-bunching in transmission is maximized for an optimal cavity modal volume
$V_{c}$ and cavity-emitter distance $s$. In reflection, perfectly anti-bunched
light can only be obtained for specific $(V_{c},s)$ combinations. Finally, our
model also applies to dielectric cavities and as such can guide future efforts
in the design and development of on-chip non-classical light sources using
dielectric and nanoplasmonic cavity-emitter systems.
|
physics.optics
|
the implementation of nonclassical light sources is becoming increasingly important for various quantum applications a particularly interesting approach is to integrate such functionalities on a single chip as this could pave the way towards fully scalable quantum photonic devices several approaches using dielectric systems have been investigated in the past however it is still not understood how onchip nanoplasmonic antennas interacting with a single quantum emitter affect the quantum statistics of photons reflected or transmitted in the guided mode of a waveguide here we investigate a quantum photonic platform consisting of an evanescently coupled nanoplasmonic cavityemitter system and discuss the requirements for nonclassical light generation we develop an analytical model that incorporates quenching due to the nanoplasmonic cavity to predict the quantum statistics of the transmitted and reflected guided waveguide light under weak coherent pumping the analytical predictions match numerical simulations based on a master equation approach it is moreover shown that for resonant excitation the degree of antibunching in transmission is maximized for an optimal cavity modal volume v_c and cavityemitter distance s in reflection perfectly antibunched light can only be obtained for specific v_cs combinations finally our model also applies to dielectric cavities and as such can guide future efforts in the design and development of onchip nonclassical light sources using dielectric and nanoplasmonic cavityemitter systems
|
[['the', 'implementation', 'of', 'nonclassical', 'light', 'sources', 'is', 'becoming', 'increasingly', 'important', 'for', 'various', 'quantum', 'applications', 'a', 'particularly', 'interesting', 'approach', 'is', 'to', 'integrate', 'such', 'functionalities', 'on', 'a', 'single', 'chip', 'as', 'this', 'could', 'pave', 'the', 'way', 'towards', 'fully', 'scalable', 'quantum', 'photonic', 'devices', 'several', 'approaches', 'using', 'dielectric', 'systems', 'have', 'been', 'investigated', 'in', 'the', 'past', 'however', 'it', 'is', 'still', 'not', 'understood', 'how', 'onchip', 'nanoplasmonic', 'antennas', 'interacting', 'with', 'a', 'single', 'quantum', 'emitter', 'affect', 'the', 'quantum', 'statistics', 'of', 'photons', 'reflected', 'or', 'transmitted', 'in', 'the', 'guided', 'mode', 'of', 'a', 'waveguide', 'here', 'we', 'investigate', 'a', 'quantum', 'photonic', 'platform', 'consisting', 'of', 'an', 'evanescently', 'coupled', 'nanoplasmonic', 'cavityemitter', 'system', 'and', 'discuss', 'the', 'requirements', 'for', 'nonclassical', 'light', 'generation', 'we', 'develop', 'an', 'analytical', 'model', 'that', 'incorporates', 'quenching', 'due', 'to', 'the', 'nanoplasmonic', 'cavity', 'to', 'predict', 'the', 'quantum', 'statistics', 'of', 'the', 'transmitted', 'and', 'reflected', 'guided', 'waveguide', 'light', 'under', 'weak', 'coherent', 'pumping', 'the', 'analytical', 'predictions', 'match', 'numerical', 'simulations', 'based', 'on', 'a', 'master', 'equation', 'approach', 'it', 'is', 'moreover', 'shown', 'that', 'for', 'resonant', 'excitation', 'the', 'degree', 'of', 'antibunching', 'in', 'transmission', 'is', 'maximized', 'for', 'an', 'optimal', 'cavity', 'modal', 'volume', 'v_c', 'and', 'cavityemitter', 'distance', 's', 'in', 'reflection', 'perfectly', 'antibunched', 'light', 'can', 'only', 'be', 'obtained', 'for', 'specific', 'v_cs', 'combinations', 'finally', 'our', 'model', 'also', 'applies', 'to', 'dielectric', 'cavities', 'and', 'as', 'such', 'can', 'guide', 'future', 'efforts', 'in', 'the', 'design', 'and', 'development', 'of', 'onchip', 'nonclassical', 'light', 'sources', 'using', 'dielectric', 'and', 'nanoplasmonic', 'cavityemitter', 'systems']]
|
[-0.1386721920357684, 0.15327013697796404, -0.06714292572503654, 0.009285615930662686, -0.06798198246322316, -0.23017315917708184, 0.025541482092769935, 0.4597495132672746, -0.23933970100254914, -0.2683819774978841, 0.0350420345704994, -0.28712831251109616, -0.16274498298178414, 0.29877036864684525, -0.010747243146923194, 0.12257053614610063, 0.03736059909415167, -0.021051785290249786, 0.009254535254296085, -0.1581216745052931, 0.24303623684041134, 0.04745925114161138, 0.33910440137703823, 0.07067530459180739, 0.10210745879064459, 0.02452340216371615, 0.029129053166973482, -0.02636643323765367, -0.07264256741606723, 0.13695347858106913, 0.2752257663513098, 0.06310044222088411, 0.2565519824034509, -0.4602687666363536, -0.2502838177350136, 0.04126626198605096, 0.19247485239391424, 0.1686772249485238, -0.09110630154631041, -0.2987331992801313, 0.02337739157032247, -0.14231625949242205, -0.1620049196275548, -0.083446876906337, -0.034399806316771094, 0.0115457047198882, -0.2366278631283705, -0.0032984965616770926, 0.0026018344711751565, 0.023508293369417548, 0.004532039203078149, -0.027754158431096985, 0.01385953727577719, 0.07805696493089455, -0.08493257774928704, -0.02228441110965924, 0.18089867878353882, -0.13622042632537867, -0.152844719007748, 0.3868002222382053, -0.0499025128203457, -0.17658966084634628, 0.15235067880071632, -0.10442992950866528, -0.046947956653931304, 0.10857591141707375, 0.21035857380147802, 0.0943529360004863, -0.152517272432873, 0.023888898285537308, 0.0072830878347671085, 0.22965204388697827, 0.0700292555826776, 0.15974429242500882, 0.26955054066391715, 0.20067543458565215, 0.014724296964106893, 0.16385331912390214, -0.07027862405771851, -0.07480773412827574, -0.2889134824610264, -0.17712716914504048, -0.19766825843437408, 0.0547792643027347, -0.05955974935992395, -0.15537190148935315, 0.3679141180446679, 0.17092890010559514, 0.10785488110385971, -0.006927081626207662, 0.34956024132600616, 0.15159213363162002, 0.07929891237450781, 0.03146490698291519, 0.29101664292702983, 0.16770554593243048, 0.09792467373329292, -0.2567585844379944, 0.019566497845583758, -0.06337075207356808]
|
1,803.06266
|
Compact Binary Mergers and The Event Rate of Fast Radio Bursts
|
Fast radio bursts (FRBs) are usually suggested to be associated with mergers
of compact binaries consisting of white dwarfs (WDs), neutron stars (NSs), or
black holes (BHs). We test these models by fitting the observational
distributions in both redshift and isotropic energy of 22 Parkes FRBs, where,
as usual, the rates of compact binary mergers (CBMs) are connected with cosmic
star formation rates by a power-law distributed time delay. It is found that
the observational distributions can well be produced by the CBM model with a
characteristic delay time from several ten to several hundred Myr and an energy
function index $1.2\lesssim\gamma\lesssim1.7$, where a tentative fixed spectral
index $\beta=0.8$ is adopted for all FRBs. Correspondingly, the local event
rate of FRBs is constrained to $(3-6)\times10^4f_{\rm b}^{-1}(\mathcal T/270\rm
s)^{-1}(\mathcal A/2\pi)^{-1}\rm ~Gpc^{-3}yr^{-1}$ for an adopted minimum FRB
energy of $E_{\min}=3\times10^{39}$ erg, where $f_{\rm b}$ is the beaming
factor of the radiation, $\mathcal T$ is the duration of each pointing
observation, and $\mathcal A $ is the sky area of the survey. This event rate,
about an order of magnitude higher than the rates of NS-NS/NS-BH mergers,
indicates that the most promising origin of FRBs in the CBM scenario could be
mergers of WD-WD binaries. Here a massive WD could be produced since no FRB was
found to be associated with a type Ia supernova. Alternatively, if actually all
FRBs can repeat on a timescale much longer than the period of current
observations, then they could also originate from a young active NS that forms
from relatively rare NS-NS mergers and accretion-induced collapses of WD-WD
binaries.
|
astro-ph.HE
|
fast radio bursts frbs are usually suggested to be associated with mergers of compact binaries consisting of white dwarfs wds neutron stars nss or black holes bhs we test these models by fitting the observational distributions in both redshift and isotropic energy of 22 parkes frbs where as usual the rates of compact binary mergers cbms are connected with cosmic star formation rates by a powerlaw distributed time delay it is found that the observational distributions can well be produced by the cbm model with a characteristic delay time from several ten to several hundred myr and an energy function index 12lesssimgammalesssim17 where a tentative fixed spectral index beta08 is adopted for all frbs correspondingly the local event rate of frbs is constrained to 36times104f_rm b1mathcal t270rm s1mathcal a2pi1rm gpc3yr1 for an adopted minimum frb energy of e_min3times1039 erg where f_rm b is the beaming factor of the radiation mathcal t is the duration of each pointing observation and mathcal a is the sky area of the survey this event rate about an order of magnitude higher than the rates of nsnsnsbh mergers indicates that the most promising origin of frbs in the cbm scenario could be mergers of wdwd binaries here a massive wd could be produced since no frb was found to be associated with a type ia supernova alternatively if actually all frbs can repeat on a timescale much longer than the period of current observations then they could also originate from a young active ns that forms from relatively rare nsns mergers and accretioninduced collapses of wdwd binaries
|
[['fast', 'radio', 'bursts', 'frbs', 'are', 'usually', 'suggested', 'to', 'be', 'associated', 'with', 'mergers', 'of', 'compact', 'binaries', 'consisting', 'of', 'white', 'dwarfs', 'wds', 'neutron', 'stars', 'nss', 'or', 'black', 'holes', 'bhs', 'we', 'test', 'these', 'models', 'by', 'fitting', 'the', 'observational', 'distributions', 'in', 'both', 'redshift', 'and', 'isotropic', 'energy', 'of', '22', 'parkes', 'frbs', 'where', 'as', 'usual', 'the', 'rates', 'of', 'compact', 'binary', 'mergers', 'cbms', 'are', 'connected', 'with', 'cosmic', 'star', 'formation', 'rates', 'by', 'a', 'powerlaw', 'distributed', 'time', 'delay', 'it', 'is', 'found', 'that', 'the', 'observational', 'distributions', 'can', 'well', 'be', 'produced', 'by', 'the', 'cbm', 'model', 'with', 'a', 'characteristic', 'delay', 'time', 'from', 'several', 'ten', 'to', 'several', 'hundred', 'myr', 'and', 'an', 'energy', 'function', 'index', '12lesssimgammalesssim17', 'where', 'a', 'tentative', 'fixed', 'spectral', 'index', 'beta08', 'is', 'adopted', 'for', 'all', 'frbs', 'correspondingly', 'the', 'local', 'event', 'rate', 'of', 'frbs', 'is', 'constrained', 'to', '36times104f_rm', 'b1mathcal', 't270rm', 's1mathcal', 'a2pi1rm', 'gpc3yr1', 'for', 'an', 'adopted', 'minimum', 'frb', 'energy', 'of', 'e_min3times1039', 'erg', 'where', 'f_rm', 'b', 'is', 'the', 'beaming', 'factor', 'of', 'the', 'radiation', 'mathcal', 't', 'is', 'the', 'duration', 'of', 'each', 'pointing', 'observation', 'and', 'mathcal', 'a', 'is', 'the', 'sky', 'area', 'of', 'the', 'survey', 'this', 'event', 'rate', 'about', 'an', 'order', 'of', 'magnitude', 'higher', 'than', 'the', 'rates', 'of', 'nsnsnsbh', 'mergers', 'indicates', 'that', 'the', 'most', 'promising', 'origin', 'of', 'frbs', 'in', 'the', 'cbm', 'scenario', 'could', 'be', 'mergers', 'of', 'wdwd', 'binaries', 'here', 'a', 'massive', 'wd', 'could', 'be', 'produced', 'since', 'no', 'frb', 'was', 'found', 'to', 'be', 'associated', 'with', 'a', 'type', 'ia', 'supernova', 'alternatively', 'if', 'actually', 'all', 'frbs', 'can', 'repeat', 'on', 'a', 'timescale', 'much', 'longer', 'than', 'the', 'period', 'of', 'current', 'observations', 'then', 'they', 'could', 'also', 'originate', 'from', 'a', 'young', 'active', 'ns', 'that', 'forms', 'from', 'relatively', 'rare', 'nsns', 'mergers', 'and', 'accretioninduced', 'collapses', 'of', 'wdwd', 'binaries']]
|
[-0.12537322581070018, 0.19483181736312177, -0.04147175706959531, 0.16751775533056762, -0.13201153150704853, -0.08354725265400667, 0.07280830317816021, 0.39541947604522254, -0.17113082429585869, -0.3013963618827071, 0.09135407954910953, -0.2969405246898532, -0.015281184145486822, 0.27022783803917905, -0.02117277214842319, -0.03854035142142618, 0.10149008387371021, -0.0037540784929696396, -0.0766995352194713, -0.281872008228218, 0.28962005949213954, 0.12687308697997793, 0.13204622486944073, -0.07411510107454423, 0.06727869492389407, -0.10717384761619363, -0.04726090587951773, -0.040385207786297825, -0.12061655305679225, -0.010152894982100263, 0.25895562683206164, 0.17274663894957698, 0.1990116145808761, -0.3868786950686983, -0.2530285609182993, 0.12748951795054417, 0.18160672721398227, 0.031028034386690707, -0.08703808826622644, -0.2527582107152899, 0.12850821436401091, -0.2786383821884645, -0.11969123064522065, 0.10382017814554274, 0.08445052893880262, 0.09274323261069024, -0.2418884465142208, 0.15744339992399511, 0.03309581576408271, -0.033124942896778094, -0.0956374362622406, -0.06636849420291244, -0.021224413895249074, 0.013874306294190532, 0.08558868199687306, 0.10227749410505388, 0.1301258132537352, -0.09386404020730041, -0.09560093736394729, 0.39396599421263945, -0.039513684384291994, -0.036071275117551434, 0.20083441540562347, -0.20637218700904472, -0.15475840111098746, 0.16798482202769568, 0.14749112649656393, 0.14307968948474703, -0.17411938399514731, -0.022610110008869977, 0.04195242403440323, 0.23174723322485008, 0.06568004158690718, 0.06418652843182344, 0.35451316297529084, 0.14273192264212697, 0.024554267486411274, 0.03946398958591196, -0.2107085168156225, -0.007275793622887018, -0.25301013161980673, -0.0912838348435174, -0.15510210503696226, 0.17433823027246284, -0.14221014695118783, -0.10963645298764402, 0.3326965389955862, 0.05164911770627049, 0.18203188117922228, 0.05330795646444255, 0.2521399708253168, 0.13196939771227978, 0.11086789574388496, 0.13826506403731365, 0.2805630046436015, 0.1358331970870495, 0.047184625691642945, -0.17897773549010904, 0.10373802090100213, -0.007961978032892825]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.