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.04867
|
Extreme field-sensitivity of the magnetic tunneling in Fe-doped Li$_3$N
|
The magnetic properties of dilute Li$_2$(Li$_{1-x}$Fe$_x$)N with $x \sim
0.001$ are dominated by the spin of single, isolated Fe atoms. Below $T = 10$ K
the spin-relaxation times become temperature-independent indicating a crossover
from thermal excitations to the quantum tunneling regime. We report on a strong
increase of the spin-flip probability in $\textit{transverse}$ magnetic fields
that proves the resonant character of this tunneling process.
$\textit{Longitudinal}$ fields, on the other hand, lift the ground-state
degeneracy and destroy the tunneling condition. An increase of the relaxation
time by four orders of magnitude in applied fields of only a few milliTesla
reveals exceptionally sharp tunneling resonances. Li$_2$(Li$_{1-x}$Fe$_x$)N
represents a comparatively simple and clean model system that opens the
possibility to study quantum tunneling of the magnetization at liquid helium
temperatures.
|
cond-mat.mtrl-sci cond-mat.mes-hall cond-mat.str-el
|
the magnetic properties of dilute li_2li_1xfe_xn with x sim 0001 are dominated by the spin of single isolated fe atoms below t 10 k the spinrelaxation times become temperatureindependent indicating a crossover from thermal excitations to the quantum tunneling regime we report on a strong increase of the spinflip probability in textittransverse magnetic fields that proves the resonant character of this tunneling process textitlongitudinal fields on the other hand lift the groundstate degeneracy and destroy the tunneling condition an increase of the relaxation time by four orders of magnitude in applied fields of only a few millitesla reveals exceptionally sharp tunneling resonances li_2li_1xfe_xn represents a comparatively simple and clean model system that opens the possibility to study quantum tunneling of the magnetization at liquid helium temperatures
|
[['the', 'magnetic', 'properties', 'of', 'dilute', 'li_2li_1xfe_xn', 'with', 'x', 'sim', '0001', 'are', 'dominated', 'by', 'the', 'spin', 'of', 'single', 'isolated', 'fe', 'atoms', 'below', 't', '10', 'k', 'the', 'spinrelaxation', 'times', 'become', 'temperatureindependent', 'indicating', 'a', 'crossover', 'from', 'thermal', 'excitations', 'to', 'the', 'quantum', 'tunneling', 'regime', 'we', 'report', 'on', 'a', 'strong', 'increase', 'of', 'the', 'spinflip', 'probability', 'in', 'textittransverse', 'magnetic', 'fields', 'that', 'proves', 'the', 'resonant', 'character', 'of', 'this', 'tunneling', 'process', 'textitlongitudinal', 'fields', 'on', 'the', 'other', 'hand', 'lift', 'the', 'groundstate', 'degeneracy', 'and', 'destroy', 'the', 'tunneling', 'condition', 'an', 'increase', 'of', 'the', 'relaxation', 'time', 'by', 'four', 'orders', 'of', 'magnitude', 'in', 'applied', 'fields', 'of', 'only', 'a', 'few', 'millitesla', 'reveals', 'exceptionally', 'sharp', 'tunneling', 'resonances', 'li_2li_1xfe_xn', 'represents', 'a', 'comparatively', 'simple', 'and', 'clean', 'model', 'system', 'that', 'opens', 'the', 'possibility', 'to', 'study', 'quantum', 'tunneling', 'of', 'the', 'magnetization', 'at', 'liquid', 'helium', 'temperatures']]
|
[-0.18775464116595686, 0.2362403809624957, -0.030186237878166138, 0.04453942818714131, 0.020500967346131802, -0.15190264977514745, 0.09795627193525433, 0.33754767513275147, -0.2585339456051588, -0.30154436733108014, -0.019510980738326907, -0.3188247285485268, -0.04361131462920457, 0.2109959675502032, 0.06529513770341873, -0.032018942203372716, 0.0010304397121071816, 0.015562787707429379, -0.07849278655648231, -0.2285018161535263, 0.27025427255779505, 0.010649820236489176, 0.2800662797130644, 0.10269318975508213, 0.07506675381585956, -0.0019940627198666333, 0.11315954228281043, 3.680355101823807e-05, -0.14854082004784142, 0.01741219236701727, 0.19107012375444174, -0.08985845444351434, 0.20178319591656327, -0.43693462151288986, -0.17472217399952933, 0.025768519286066292, 0.15956174393743278, 0.15409061209857464, -0.04936551140062511, -0.25686761824041604, 0.022477812176570296, -0.11289291857928038, -0.12495082321390509, -0.09230245373630896, 0.013900386456400156, -0.03346512171835639, -0.23740068397804862, 0.1440285922959447, 0.08752134399767965, 0.08652536376193166, -0.046416291534900664, -0.07280355743411929, -0.02599886680394411, 0.02601561964303255, 0.05807563520106487, 0.0572628211742267, 0.1973758183158934, -0.12952673344872892, -0.11141573138535023, 0.3214168583797291, -0.11941074898466468, -0.033581645645201205, 0.20494475403800608, -0.22994732987880706, -0.07046208107471466, 0.24252325095981359, 0.07451975533599034, 0.1454759426265955, -0.11921191407740116, 0.09911556387599557, 0.030820222809910775, 0.16398933137767016, 0.06852338628098369, 0.08414632009342313, 0.25718344642966984, 0.18457844000309706, 0.04090103823319077, 0.12715094780968503, -0.1583724257349968, -0.05660890785884112, -0.22943400773778558, -0.15462339055351912, -0.19570734050869942, 0.1401506695728749, -0.0602084468563553, -0.17284686880558728, 0.3800220837257802, 0.14989316450618206, 0.2351945027243346, -0.026986575671471655, 0.27098012796416876, 0.13136811607331036, 0.04769231417030096, 0.015188065949827433, 0.2530963104504626, 0.19727277824655176, 0.09268621536530554, -0.3120084914881736, 0.05695106165111065, -0.009390604317188262]
|
1,803.04868
|
Search-based optimal motion planning for automated driving
|
This paper presents a framework for fast and robust motion planning designed
to facilitate automated driving. The framework allows for real-time computation
even for horizons of several hundred meters and thus enabling automated driving
in urban conditions. This is achieved through several features. Firstly, a
convenient geometrical representation of both the search space and driving
constraints enables the use of classical path planning approach. Thus, a wide
variety of constraints can be tackled simultaneously (other vehicles, traffic
lights, etc.). Secondly, an exact cost-to-go map, obtained by solving a relaxed
problem, is then used by A*-based algorithm with model predictive flavour in
order to compute the optimal motion trajectory. The algorithm takes into
account both distance and time horizons. The approach is validated within a
simulation study with realistic traffic scenarios. We demonstrate the
capability of the algorithm to devise plans both in fast and slow driving
conditions, even when full stop is required.
|
cs.RO
|
this paper presents a framework for fast and robust motion planning designed to facilitate automated driving the framework allows for realtime computation even for horizons of several hundred meters and thus enabling automated driving in urban conditions this is achieved through several features firstly a convenient geometrical representation of both the search space and driving constraints enables the use of classical path planning approach thus a wide variety of constraints can be tackled simultaneously other vehicles traffic lights etc secondly an exact costtogo map obtained by solving a relaxed problem is then used by abased algorithm with model predictive flavour in order to compute the optimal motion trajectory the algorithm takes into account both distance and time horizons the approach is validated within a simulation study with realistic traffic scenarios we demonstrate the capability of the algorithm to devise plans both in fast and slow driving conditions even when full stop is required
|
[['this', 'paper', 'presents', 'a', 'framework', 'for', 'fast', 'and', 'robust', 'motion', 'planning', 'designed', 'to', 'facilitate', 'automated', 'driving', 'the', 'framework', 'allows', 'for', 'realtime', 'computation', 'even', 'for', 'horizons', 'of', 'several', 'hundred', 'meters', 'and', 'thus', 'enabling', 'automated', 'driving', 'in', 'urban', 'conditions', 'this', 'is', 'achieved', 'through', 'several', 'features', 'firstly', 'a', 'convenient', 'geometrical', 'representation', 'of', 'both', 'the', 'search', 'space', 'and', 'driving', 'constraints', 'enables', 'the', 'use', 'of', 'classical', 'path', 'planning', 'approach', 'thus', 'a', 'wide', 'variety', 'of', 'constraints', 'can', 'be', 'tackled', 'simultaneously', 'other', 'vehicles', 'traffic', 'lights', 'etc', 'secondly', 'an', 'exact', 'costtogo', 'map', 'obtained', 'by', 'solving', 'a', 'relaxed', 'problem', 'is', 'then', 'used', 'by', 'abased', 'algorithm', 'with', 'model', 'predictive', 'flavour', 'in', 'order', 'to', 'compute', 'the', 'optimal', 'motion', 'trajectory', 'the', 'algorithm', 'takes', 'into', 'account', 'both', 'distance', 'and', 'time', 'horizons', 'the', 'approach', 'is', 'validated', 'within', 'a', 'simulation', 'study', 'with', 'realistic', 'traffic', 'scenarios', 'we', 'demonstrate', 'the', 'capability', 'of', 'the', 'algorithm', 'to', 'devise', 'plans', 'both', 'in', 'fast', 'and', 'slow', 'driving', 'conditions', 'even', 'when', 'full', 'stop', 'is', 'required']]
|
[-0.12081771585451183, 0.06199396582515499, -0.109314827568406, 0.07857219463524719, -0.09860910118247072, -0.15976904022501281, 0.06796575314450927, 0.410733926061273, -0.2773703540510991, -0.3591955199143758, 0.1354843823440271, -0.16343545281106464, -0.14640976899467847, 0.2657321503726778, -0.08356604038937827, 0.12212534606140228, 0.10769754434552263, 0.0017666125828339383, -0.038935737548931655, -0.1995223151471198, 0.2390858196513423, 0.033692662482411644, 0.3018811728951393, 0.047850995078025496, 0.15974890863754196, 0.037684244217862393, -0.042801571809047576, 0.03866935180773307, -0.08781874395170389, 0.14013672731984164, 0.25956809674115744, 0.18375926941109735, 0.30479153537867115, -0.4659803460528648, -0.2236230703089021, 0.10524820535157631, 0.14941486161737855, 0.11771317952452531, -0.0424969590822953, -0.3145939348557708, 0.08133937678987684, -0.1789875385759313, -0.1294411762672312, -0.12592189232483994, -0.006184951250070061, -0.014653185692926248, -0.32741007936838407, 0.007384118794469662, 0.014085431306263784, 0.008545259226819658, -0.07755940532489844, -0.023306865867507322, 0.05084413449505186, 0.17759430639311105, 0.023237037015135333, 0.0208264861987855, 0.13131786059143838, -0.12486032485274075, -0.1319592287931348, 0.43244729153933675, -0.01425009060215838, -0.19899524575376312, 0.1600561192612243, -0.0579027674264378, -0.0999447357280825, 0.15018859666694576, 0.22286029513986186, 0.15024577458906505, -0.22444337423104455, 0.049021963174287475, 0.025317290052923744, 0.12891000283279402, 0.004617211921749259, -0.0185468484483221, 0.1993345366104668, 0.24036603674042994, 0.14551228909712174, 0.13639451089289245, -0.10431644772909873, -0.1213484203706958, -0.25224541358381897, -0.12238528113507854, -0.10767796890828393, -0.045306369981856325, -0.10453288626864331, -0.08323272052784055, 0.38971317851964654, 0.21603810665269194, 0.16110017935873247, 0.09573460579241072, 0.3744855669199252, 0.0877965187556506, 0.034286294919225614, 0.10139685759801734, 0.18327936447937698, 0.0253228712887838, 0.1272070839654143, -0.21527621502610642, 0.06486229021467414, 0.06567518115256687]
|
1,803.04869
|
Rapidly evolving transients in the Dark Energy Survey
|
We present the results of a search for rapidly evolving transients in the
Dark Energy Survey Supernova Programme. These events are characterized by fast
light curve evolution (rise to peak in $\lesssim 10$ d and exponential decline
in $\lesssim30$ d after peak). We discovered 72 events, including 37 transients
with a spectroscopic redshift from host galaxy spectral features. The 37 events
increase the total number of rapid optical transients by more than factor of
two. They are found at a wide range of redshifts ($0.05<z<1.56$) and peak
brightnesses ($-15.75>M_\mathrm{g}>-22.25$). The multiband photometry is well
fit by a blackbody up to few weeks after peak. The events appear to be hot
($T\approx10000-30000$ K) and large ($R\approx 10^{14}-2\cdot10^{15}$ cm) at
peak, and generally expand and cool in time, though some events show evidence
for a receding photosphere with roughly constant temperature. Spectra taken
around peak are dominated by a blue featureless continuum consistent with hot,
optically thick ejecta. We compare our events with a previously suggested
physical scenario involving shock breakout in an optically thick wind
surrounding a core-collapse supernova (CCSNe), we conclude that current models
for such a scenario might need an additional power source to describe the
exponential decline. We find these transients tend to favor star-forming host
galaxies, which could be consistent with a core-collapse origin. However, more
detailed modeling of the light curves is necessary to determine their physical
origin.
|
astro-ph.HE
|
we present the results of a search for rapidly evolving transients in the dark energy survey supernova programme these events are characterized by fast light curve evolution rise to peak in lesssim 10 d and exponential decline in lesssim30 d after peak we discovered 72 events including 37 transients with a spectroscopic redshift from host galaxy spectral features the 37 events increase the total number of rapid optical transients by more than factor of two they are found at a wide range of redshifts 005z156 and peak brightnesses 1575m_mathrmg2225 the multiband photometry is well fit by a blackbody up to few weeks after peak the events appear to be hot tapprox1000030000 k and large rapprox 10142cdot1015 cm at peak and generally expand and cool in time though some events show evidence for a receding photosphere with roughly constant temperature spectra taken around peak are dominated by a blue featureless continuum consistent with hot optically thick ejecta we compare our events with a previously suggested physical scenario involving shock breakout in an optically thick wind surrounding a corecollapse supernova ccsne we conclude that current models for such a scenario might need an additional power source to describe the exponential decline we find these transients tend to favor starforming host galaxies which could be consistent with a corecollapse origin however more detailed modeling of the light curves is necessary to determine their physical origin
|
[['we', 'present', 'the', 'results', 'of', 'a', 'search', 'for', 'rapidly', 'evolving', 'transients', 'in', 'the', 'dark', 'energy', 'survey', 'supernova', 'programme', 'these', 'events', 'are', 'characterized', 'by', 'fast', 'light', 'curve', 'evolution', 'rise', 'to', 'peak', 'in', 'lesssim', '10', 'd', 'and', 'exponential', 'decline', 'in', 'lesssim30', 'd', 'after', 'peak', 'we', 'discovered', '72', 'events', 'including', '37', 'transients', 'with', 'a', 'spectroscopic', 'redshift', 'from', 'host', 'galaxy', 'spectral', 'features', 'the', '37', 'events', 'increase', 'the', 'total', 'number', 'of', 'rapid', 'optical', 'transients', 'by', 'more', 'than', 'factor', 'of', 'two', 'they', 'are', 'found', 'at', 'a', 'wide', 'range', 'of', 'redshifts', '005z156', 'and', 'peak', 'brightnesses', '1575m_mathrmg2225', 'the', 'multiband', 'photometry', 'is', 'well', 'fit', 'by', 'a', 'blackbody', 'up', 'to', 'few', 'weeks', 'after', 'peak', 'the', 'events', 'appear', 'to', 'be', 'hot', 'tapprox1000030000', 'k', 'and', 'large', 'rapprox', '10142cdot1015', 'cm', 'at', 'peak', 'and', 'generally', 'expand', 'and', 'cool', 'in', 'time', 'though', 'some', 'events', 'show', 'evidence', 'for', 'a', 'receding', 'photosphere', 'with', 'roughly', 'constant', 'temperature', 'spectra', 'taken', 'around', 'peak', 'are', 'dominated', 'by', 'a', 'blue', 'featureless', 'continuum', 'consistent', 'with', 'hot', 'optically', 'thick', 'ejecta', 'we', 'compare', 'our', 'events', 'with', 'a', 'previously', 'suggested', 'physical', 'scenario', 'involving', 'shock', 'breakout', 'in', 'an', 'optically', 'thick', 'wind', 'surrounding', 'a', 'corecollapse', 'supernova', 'ccsne', 'we', 'conclude', 'that', 'current', 'models', 'for', 'such', 'a', 'scenario', 'might', 'need', 'an', 'additional', 'power', 'source', 'to', 'describe', 'the', 'exponential', 'decline', 'we', 'find', 'these', 'transients', 'tend', 'to', 'favor', 'starforming', 'host', 'galaxies', 'which', 'could', 'be', 'consistent', 'with', 'a', 'corecollapse', 'origin', 'however', 'more', 'detailed', 'modeling', 'of', 'the', 'light', 'curves', 'is', 'necessary', 'to', 'determine', 'their', 'physical', 'origin']]
|
[-0.06841491458410594, 0.1554318879841543, -0.06337445728243901, 0.12239774989409438, -0.10022264309717636, -0.11719576396628104, 0.07370798222888097, 0.43475023364615545, -0.1729524531319999, -0.36459021758810994, 0.08405780752563212, -0.32306992039166127, -0.0206415808478548, 0.2378053340209207, -0.02587333273371322, -0.04400774488111206, 0.0667678937224034, -0.08385970531717728, -0.05962322819910345, -0.237972831699217, 0.2555607103215727, 0.08726470889278541, 0.16456494244068795, -0.014552303304969283, 0.03556560168222508, -0.11269604895169962, -0.0753387896905208, -0.02923153583450537, -0.10940349564736064, 3.6424019766089165e-05, 0.23008298567680885, 0.11798228580083926, 0.2100456534944099, -0.394504777294698, -0.26618402005937114, 0.11182280507126595, 0.19607388734482556, 0.054404575161721654, -0.05543399185134739, -0.2431247501772943, 0.06567665392108131, -0.19592420034020683, -0.1918037734116967, 0.036706366760068034, 0.07291379155950588, 0.02750893098479872, -0.21876504087285548, 0.14678813845507407, 0.00673380156155888, 0.08366069907303124, -0.09599128946674203, -0.07813659048508526, -0.023678923297363024, 0.0050787409632711816, 0.043569083062098606, 0.06494696089219743, 0.15805819274586005, -0.13703996075415298, -0.029335671615084272, 0.3878594464295658, -0.0915317933104872, 0.06459105900170184, 0.21794464587991683, -0.1963764614192769, -0.11812023878334449, 0.22805709722339534, 0.1612596697553894, 0.10502422587300667, -0.15073320082732958, -0.0696265514924195, 0.02310648477195125, 0.18739075361232257, 0.02637098425603063, 0.06998363023267941, 0.33917944212117346, 0.13499255113614103, -0.006141378948661058, 0.08837184758515816, -0.19078673164997445, -0.014729343070812001, -0.2839368754515849, -0.06813400024711563, -0.10181978327454999, 0.11929685307723846, -0.11763134629744168, -0.11387607101105938, 0.3781342027295818, 0.08665583172216684, 0.259453103817354, 0.04312744911141252, 0.2519725690465094, 0.09422545929938726, 0.10205927836961978, 0.15064430939105877, 0.2995451430882288, 0.11864540719104473, 0.12560130359212818, -0.17932298865573676, 0.059254453822065616, -0.04255364662783809]
|
1,803.0487
|
Narcissus: Deriving Correct-By-Construction Decoders and Encoders from
Binary Formats
|
It is a neat result from functional programming that libraries of parser
combinators can support rapid construction of decoders for quite a range of
formats. With a little more work, the same combinator program can denote both a
decoder and an encoder. Unfortunately, the real world is full of gnarly
formats, as with the packet formats that make up the standard Internet protocol
stack. Most past parser-combinator approaches cannot handle these formats, and
the few exceptions require redundancy -- one part of the natural grammar needs
to be hand-translated into hints in multiple parts of a parser program. We show
how to recover very natural and nonredundant format specifications, covering
all popular network packet formats and generating both decoders and encoders
automatically. The catch is that we use the Coq proof assistant to derive both
kinds of artifacts using tactics, automatically, in a way that guarantees that
they form inverses of each other. We used our approach to reimplement packet
processing for a full Internet protocol stack, inserting our replacement into
the OCaml-based MirageOS unikernel, resulting in minimal performance
degradation.
|
cs.PL
|
it is a neat result from functional programming that libraries of parser combinators can support rapid construction of decoders for quite a range of formats with a little more work the same combinator program can denote both a decoder and an encoder unfortunately the real world is full of gnarly formats as with the packet formats that make up the standard internet protocol stack most past parsercombinator approaches cannot handle these formats and the few exceptions require redundancy one part of the natural grammar needs to be handtranslated into hints in multiple parts of a parser program we show how to recover very natural and nonredundant format specifications covering all popular network packet formats and generating both decoders and encoders automatically the catch is that we use the coq proof assistant to derive both kinds of artifacts using tactics automatically in a way that guarantees that they form inverses of each other we used our approach to reimplement packet processing for a full internet protocol stack inserting our replacement into the ocamlbased mirageos unikernel resulting in minimal performance degradation
|
[['it', 'is', 'a', 'neat', 'result', 'from', 'functional', 'programming', 'that', 'libraries', 'of', 'parser', 'combinators', 'can', 'support', 'rapid', 'construction', 'of', 'decoders', 'for', 'quite', 'a', 'range', 'of', 'formats', 'with', 'a', 'little', 'more', 'work', 'the', 'same', 'combinator', 'program', 'can', 'denote', 'both', 'a', 'decoder', 'and', 'an', 'encoder', 'unfortunately', 'the', 'real', 'world', 'is', 'full', 'of', 'gnarly', 'formats', 'as', 'with', 'the', 'packet', 'formats', 'that', 'make', 'up', 'the', 'standard', 'internet', 'protocol', 'stack', 'most', 'past', 'parsercombinator', 'approaches', 'can', 'not', 'handle', 'these', 'formats', 'and', 'the', 'few', 'exceptions', 'require', 'redundancy', 'one', 'part', 'of', 'the', 'natural', 'grammar', 'needs', 'to', 'be', 'handtranslated', 'into', 'hints', 'in', 'multiple', 'parts', 'of', 'a', 'parser', 'program', 'we', 'show', 'how', 'to', 'recover', 'very', 'natural', 'and', 'nonredundant', 'format', 'specifications', 'covering', 'all', 'popular', 'network', 'packet', 'formats', 'and', 'generating', 'both', 'decoders', 'and', 'encoders', 'automatically', 'the', 'catch', 'is', 'that', 'we', 'use', 'the', 'coq', 'proof', 'assistant', 'to', 'derive', 'both', 'kinds', 'of', 'artifacts', 'using', 'tactics', 'automatically', 'in', 'a', 'way', 'that', 'guarantees', 'that', 'they', 'form', 'inverses', 'of', 'each', 'other', 'we', 'used', 'our', 'approach', 'to', 'reimplement', 'packet', 'processing', 'for', 'a', 'full', 'internet', 'protocol', 'stack', 'inserting', 'our', 'replacement', 'into', 'the', 'ocamlbased', 'mirageos', 'unikernel', 'resulting', 'in', 'minimal', 'performance', 'degradation']]
|
[-0.10492368905079798, -0.00477238885458524, -0.09987980127669122, 0.08651708902713533, -0.14407395068877216, -0.2001759665830853, 0.07688603655906158, 0.41152642621530283, -0.3120863014375844, -0.3145972190360571, 0.10188630473299551, -0.24764864775619802, -0.14923693691099318, 0.22285758456798677, -0.11269432842603018, 0.0502988110094374, 0.11723704795398611, 0.016831332287783253, -0.0705972077631413, -0.28465688711396236, 0.2717807460991109, 0.031862487582939455, 0.26833783511931963, 0.009867675634550637, 0.09031682929570048, 0.016128595534380227, -0.013061974374925312, -0.033245789636483135, -0.02528513917782586, 0.12068298443263376, 0.33450973859383326, 0.27206420042048923, 0.24986151357893244, -0.4512616667960738, -0.1601700181602808, 0.049500918850816526, 0.12688073719418125, 0.14739852144393598, -0.021635610958572676, -0.26101299037423586, 0.13394181009103684, -0.2203975013435829, -0.00926124694189806, -0.11448472918509024, -0.028279943161526287, 0.015157599889287918, -0.26411123759776955, -0.07939962147609277, 0.08416782547291582, 0.03346673945425314, -0.0006302588635349069, -0.10481730456083971, -0.03171604413715801, 0.16295224471531553, 0.016019230902505417, 0.04611354739935105, 0.10834728979676876, -0.10903873750752631, -0.14317182179315593, 0.3992259054519664, -0.04458303901570282, -0.19666732794701539, 0.17744469684388103, -0.03980934445146771, -0.14736309326146782, 0.12112441369909098, 0.17720768012202762, 0.06532267715123578, -0.17008082586308493, 0.059617739088830654, -0.030482216898737282, 0.2583911135583988, 0.12962925924395008, 0.062375876993585204, 0.16288019545328128, 0.16912663971400424, 0.03068055859071085, 0.13415971167295926, -0.010547689962382803, -0.0649356729024486, -0.2903733950535815, -0.1626597229304694, -0.12780263094062885, -0.030661402862895704, -0.09318489816543933, -0.18447437810433237, 0.3860509587470549, 0.18630004208936388, 0.15289938609629614, 0.13497866805771302, 0.37887180418889416, 0.032963407103470045, 0.16933607955827196, 0.11402500206310216, 0.10289848315925605, 0.0556123235032776, 0.1495469651859382, -0.0830362478412297, 0.11487453918898714, 0.050433789417361735]
|
1,803.04871
|
Anisotropic susceptibilities in the honeycomb Kitaev system
$\alpha$-RuCl$_{3}$
|
The magnetic insulator $\alpha$-RuCl$_{3}$ is a promising candidate to
realize Kitaev interactions on a quasi-2D honeycomb lattice. We perform
extensive susceptibility measurements on single crystals of
$\alpha$-RuCl$_{3}$, including angle-dependence of the in-plane longitudinal
and transverse susceptibilities, which reveal a unidirectional anisotropy
within the honeycomb plane. By comparing the experimental results to a
high-temperature expansion of a Kitaev-Heisenberg-$\Gamma$ spin Hamiltonian
with bond anisotropy, we find excellent agreement with the observed phase shift
and periodicity of the angle-resolved susceptibilities. Within this model, we
show that the pronounced difference between in-plane and out-of-plane
susceptibilities as well as the finite transverse susceptibility are rooted in
strong symmetric off-diagonal $\Gamma$ spin exchange. The $\Gamma$ couplings
and relationships between other terms in the model Hamiltonian are quantified
by extracting relevant Curie-Weiss intercepts from the experimental data.
|
cond-mat.mtrl-sci cond-mat.str-el
|
the magnetic insulator alpharucl_3 is a promising candidate to realize kitaev interactions on a quasi2d honeycomb lattice we perform extensive susceptibility measurements on single crystals of alpharucl_3 including angledependence of the inplane longitudinal and transverse susceptibilities which reveal a unidirectional anisotropy within the honeycomb plane by comparing the experimental results to a hightemperature expansion of a kitaevheisenberggamma spin hamiltonian with bond anisotropy we find excellent agreement with the observed phase shift and periodicity of the angleresolved susceptibilities within this model we show that the pronounced difference between inplane and outofplane susceptibilities as well as the finite transverse susceptibility are rooted in strong symmetric offdiagonal gamma spin exchange the gamma couplings and relationships between other terms in the model hamiltonian are quantified by extracting relevant curieweiss intercepts from the experimental data
|
[['the', 'magnetic', 'insulator', 'alpharucl_3', 'is', 'a', 'promising', 'candidate', 'to', 'realize', 'kitaev', 'interactions', 'on', 'a', 'quasi2d', 'honeycomb', 'lattice', 'we', 'perform', 'extensive', 'susceptibility', 'measurements', 'on', 'single', 'crystals', 'of', 'alpharucl_3', 'including', 'angledependence', 'of', 'the', 'inplane', 'longitudinal', 'and', 'transverse', 'susceptibilities', 'which', 'reveal', 'a', 'unidirectional', 'anisotropy', 'within', 'the', 'honeycomb', 'plane', 'by', 'comparing', 'the', 'experimental', 'results', 'to', 'a', 'hightemperature', 'expansion', 'of', 'a', 'kitaevheisenberggamma', 'spin', 'hamiltonian', 'with', 'bond', 'anisotropy', 'we', 'find', 'excellent', 'agreement', 'with', 'the', 'observed', 'phase', 'shift', 'and', 'periodicity', 'of', 'the', 'angleresolved', 'susceptibilities', 'within', 'this', 'model', 'we', 'show', 'that', 'the', 'pronounced', 'difference', 'between', 'inplane', 'and', 'outofplane', 'susceptibilities', 'as', 'well', 'as', 'the', 'finite', 'transverse', 'susceptibility', 'are', 'rooted', 'in', 'strong', 'symmetric', 'offdiagonal', 'gamma', 'spin', 'exchange', 'the', 'gamma', 'couplings', 'and', 'relationships', 'between', 'other', 'terms', 'in', 'the', 'model', 'hamiltonian', 'are', 'quantified', 'by', 'extracting', 'relevant', 'curieweiss', 'intercepts', 'from', 'the', 'experimental', 'data']]
|
[-0.2014992165545276, 0.2318513108915541, -0.022703723576327772, 0.0353012291480816, -0.09847794897681059, -0.13678187410917508, 0.06326406082145639, 0.4226575071612994, -0.2452237307122916, -0.28411181063153024, -0.012041826322746947, -0.38425763292137044, -0.12405368373115626, 0.18138675516211364, 0.157266009313798, 0.03820480608431868, -0.0038548647633630984, -0.009029429663124299, -0.1194410284876448, -0.16611419607678296, 0.22283370625372081, 0.008638746859577969, 0.3308962017817553, 0.10772073136050572, 0.05112645255181534, 0.06558642031393888, 0.11240200265202412, 0.060960339476145056, -0.16037183415440007, 0.06650085937838222, 0.22202953400249167, -0.14866635030092196, 0.0927357133838904, -0.3871864718854312, -0.20966669300556645, 0.016655607755447544, 0.11603932634588013, 0.14793442724933198, -0.050193516942744626, -0.2872578139424093, -0.005829650201192198, -0.16857580524371113, -0.11090031310612726, -0.16756195536735216, -0.03323409032047719, 0.02050105959552434, -0.28059977495162064, 0.1753286501508235, 0.03302986845247765, 0.14540961316187484, -0.07240503308789213, -0.13165677753962982, -0.10616520572590908, 0.0633975527566937, 0.07735582628438986, 0.08902716154030474, 0.08355442794083162, -0.10688191190787931, -0.16892790975583385, 0.40150987094109375, -0.08188071084937962, -0.11537361854385916, 0.09929409346637107, -0.19648748222565235, -0.10160849819883935, 0.09677243217205007, 0.12022631029894416, 0.04548154762303529, -0.11698073685140342, 0.06961555911459086, -0.06103592091998042, 0.1739641599846253, 0.0030611016076462446, 0.04590254852338649, 0.2713940989464348, 0.165623337172997, -0.008550287177425253, 0.19776982172480748, -0.11664806389387032, -0.09695205080878827, -0.25043676805126575, -0.09382571627443671, -0.23857738258580627, 0.04945171616164708, -0.13574349498980887, -0.18495391655799953, 0.415625252692361, 0.16822414726178864, 0.2146425291448254, -0.04419447387868264, 0.257821468434246, 0.062073624888687694, 0.07338333456928647, 0.0239578213961434, 0.25349255490961464, 0.22120558190729844, 0.10381126537370358, -0.32671194141929205, 0.07068843636372986, 0.011935540826904565]
|
1,803.04872
|
Project Blue: Visible Light Imaging Search for Terrestrial-class
Exoplanets in the Habitable Zones of Alpha Centauri A and B
|
Project Blue is designed to deliver a small coronagraphic space telescope
mission to low-Earth orbit capable of detecting an Earth-like planet in the
habitable zones of the Sun-like stars Alpha Centauri A and B within the next 4
years within a Mission of Opportunity budget envelope. The concept heavily
leverages emerging commercial capabilities -- including the telescope optics,
spacecraft bus and launch vehicle -- and emphasizes a public-private
partnership approach.
|
astro-ph.IM
|
project blue is designed to deliver a small coronagraphic space telescope mission to lowearth orbit capable of detecting an earthlike planet in the habitable zones of the sunlike stars alpha centauri a and b within the next 4 years within a mission of opportunity budget envelope the concept heavily leverages emerging commercial capabilities including the telescope optics spacecraft bus and launch vehicle and emphasizes a publicprivate partnership approach
|
[['project', 'blue', 'is', 'designed', 'to', 'deliver', 'a', 'small', 'coronagraphic', 'space', 'telescope', 'mission', 'to', 'lowearth', 'orbit', 'capable', 'of', 'detecting', 'an', 'earthlike', 'planet', 'in', 'the', 'habitable', 'zones', 'of', 'the', 'sunlike', 'stars', 'alpha', 'centauri', 'a', 'and', 'b', 'within', 'the', 'next', '4', 'years', 'within', 'a', 'mission', 'of', 'opportunity', 'budget', 'envelope', 'the', 'concept', 'heavily', 'leverages', 'emerging', 'commercial', 'capabilities', 'including', 'the', 'telescope', 'optics', 'spacecraft', 'bus', 'and', 'launch', 'vehicle', 'and', 'emphasizes', 'a', 'publicprivate', 'partnership', 'approach']]
|
[-0.15121414233341485, 0.14405210031498641, -0.04748058162958307, -0.0025240554866339904, -0.17419360583538518, -0.0919473655795788, 0.10806706682641935, 0.35659079689203815, -0.1749684214249582, -0.39162726304493845, 0.0946782917547834, -0.29921832290368483, -0.12633079224735197, 0.2482771781814175, -0.15435330749160664, 0.08195689764312085, 0.18881309426882686, -0.08072046752032988, 0.02903629617546411, -0.2448692808547468, 0.22959622409989072, 0.17995511370656245, 0.11157343270743321, -0.08446039589163025, 0.1152759556494215, -0.057453772559871566, -0.04023013949421618, -0.09588653666201828, -0.11134054444675498, 0.0884703823728213, 0.3142352672567701, 0.2371582975200213, 0.3536285710904528, -0.37229319250978093, -0.1934482196948546, 0.038418925706269764, 0.07313452557290849, -0.09240457837415092, -0.05513155458988074, -0.3722468621426207, 0.034913567709736526, -0.27083876770099297, -0.21853373980368762, 0.034182332699214495, 0.0820779502939652, -0.006655363235896563, -0.2531786886564292, -0.1248614504464272, -0.012196941133451593, 0.12903686658041003, -0.1521221315899097, -0.05401629543698886, -0.026968706229715336, 0.15622268406235995, -0.07085619646686074, 0.04657994601738585, 0.15531500834314263, -0.07747570055268144, -0.012247794040697901, 0.455605204025393, -0.07253534081118072, 0.04572682616451536, 0.1613211765549803, -0.22250166435397284, -0.11358392213964287, 0.10174181367106297, 0.22928408582640045, 0.15711948257761404, -0.1697936245267663, 0.06668253258463022, 0.06450644320370082, 0.21336990866043112, 0.06635746835758362, 0.0442663686870433, 0.3794311527984546, 0.26717847117277627, 0.19180908267855343, 0.05248889544814387, -0.3177388261743438, -0.07930234020151307, -0.17794116850778022, -0.18783137240611456, -0.12023042221142746, -0.024392113240216586, -0.044220521422282805, -0.09260687452521832, 0.3589912997729912, 0.15118637707029633, 0.051745190285146236, -0.02649586509420153, 0.38040591123075607, -0.049823609074605084, 0.14065447178932922, 0.09613114187959582, 0.3387161497872405, 0.06225082664476598, 0.1682192551328198, -0.1988203986753326, 0.051960479625610304, 0.011637272183125949]
|
1,803.04873
|
Using Convolutional Neural Networks for Determining Reticulocyte
Percentage in Cats
|
Recent advances in artificial intelligence (AI), specifically in computer
vision (CV) and deep learning (DL), have created opportunities for novel
systems in many fields. In the last few years, deep learning applications have
demonstrated impressive results not only in fields such as autonomous driving
and robotics, but also in the field of medicine, where they have, in some
cases, even exceeded human-level performance. However, despite the huge
potential, adoption of deep learning-based methods is still slow in many areas,
especially in veterinary medicine, where we haven't been able to find any
research papers using modern convolutional neural networks (CNNs) in medical
image processing. We believe that using deep learning-based medical imaging can
enable more accurate, faster and less expensive diagnoses in veterinary
medicine. In order to do so, however, these methods have to be accessible to
everyone in this field, not just to computer scientists. To show the potential
of this technology, we present results on a real-world task in veterinary
medicine that is usually done manually: feline reticulocyte percentage. Using
an open source Keras implementation of the Single-Shot MultiBox Detector (SSD)
model architecture and training it on only 800 labeled images, we achieve an
accuracy of 98.7% at predicting the correct number of aggregate reticulocytes
in microscope images of cat blood smears. The main motivation behind this paper
is to show not only that deep learning can approach or even exceed human-level
performance on a task like this, but also that anyone in the field can
implement it, even without a background in computer science.
|
cs.CV
|
recent advances in artificial intelligence ai specifically in computer vision cv and deep learning dl have created opportunities for novel systems in many fields in the last few years deep learning applications have demonstrated impressive results not only in fields such as autonomous driving and robotics but also in the field of medicine where they have in some cases even exceeded humanlevel performance however despite the huge potential adoption of deep learningbased methods is still slow in many areas especially in veterinary medicine where we havent been able to find any research papers using modern convolutional neural networks cnns in medical image processing we believe that using deep learningbased medical imaging can enable more accurate faster and less expensive diagnoses in veterinary medicine in order to do so however these methods have to be accessible to everyone in this field not just to computer scientists to show the potential of this technology we present results on a realworld task in veterinary medicine that is usually done manually feline reticulocyte percentage using an open source keras implementation of the singleshot multibox detector ssd model architecture and training it on only 800 labeled images we achieve an accuracy of 987 at predicting the correct number of aggregate reticulocytes in microscope images of cat blood smears the main motivation behind this paper is to show not only that deep learning can approach or even exceed humanlevel performance on a task like this but also that anyone in the field can implement it even without a background in computer science
|
[['recent', 'advances', 'in', 'artificial', 'intelligence', 'ai', 'specifically', 'in', 'computer', 'vision', 'cv', 'and', 'deep', 'learning', 'dl', 'have', 'created', 'opportunities', 'for', 'novel', 'systems', 'in', 'many', 'fields', 'in', 'the', 'last', 'few', 'years', 'deep', 'learning', 'applications', 'have', 'demonstrated', 'impressive', 'results', 'not', 'only', 'in', 'fields', 'such', 'as', 'autonomous', 'driving', 'and', 'robotics', 'but', 'also', 'in', 'the', 'field', 'of', 'medicine', 'where', 'they', 'have', 'in', 'some', 'cases', 'even', 'exceeded', 'humanlevel', 'performance', 'however', 'despite', 'the', 'huge', 'potential', 'adoption', 'of', 'deep', 'learningbased', 'methods', 'is', 'still', 'slow', 'in', 'many', 'areas', 'especially', 'in', 'veterinary', 'medicine', 'where', 'we', 'havent', 'been', 'able', 'to', 'find', 'any', 'research', 'papers', 'using', 'modern', 'convolutional', 'neural', 'networks', 'cnns', 'in', 'medical', 'image', 'processing', 'we', 'believe', 'that', 'using', 'deep', 'learningbased', 'medical', 'imaging', 'can', 'enable', 'more', 'accurate', 'faster', 'and', 'less', 'expensive', 'diagnoses', 'in', 'veterinary', 'medicine', 'in', 'order', 'to', 'do', 'so', 'however', 'these', 'methods', 'have', 'to', 'be', 'accessible', 'to', 'everyone', 'in', 'this', 'field', 'not', 'just', 'to', 'computer', 'scientists', 'to', 'show', 'the', 'potential', 'of', 'this', 'technology', 'we', 'present', 'results', 'on', 'a', 'realworld', 'task', 'in', 'veterinary', 'medicine', 'that', 'is', 'usually', 'done', 'manually', 'feline', 'reticulocyte', 'percentage', 'using', 'an', 'open', 'source', 'keras', 'implementation', 'of', 'the', 'singleshot', 'multibox', 'detector', 'ssd', 'model', 'architecture', 'and', 'training', 'it', 'on', 'only', '800', 'labeled', 'images', 'we', 'achieve', 'an', 'accuracy', 'of', '987', 'at', 'predicting', 'the', 'correct', 'number', 'of', 'aggregate', 'reticulocytes', 'in', 'microscope', 'images', 'of', 'cat', 'blood', 'smears', 'the', 'main', 'motivation', 'behind', 'this', 'paper', 'is', 'to', 'show', 'not', 'only', 'that', 'deep', 'learning', 'can', 'approach', 'or', 'even', 'exceed', 'humanlevel', 'performance', 'on', 'a', 'task', 'like', 'this', 'but', 'also', 'that', 'anyone', 'in', 'the', 'field', 'can', 'implement', 'it', 'even', 'without', 'a', 'background', 'in', 'computer', 'science']]
|
[-0.017635664361342056, 0.03438119327213604, -0.05203034864980581, 0.05878906424375486, -0.08886079419877263, -0.1816576565047506, -0.010717601123482252, 0.4718840087646633, -0.24188240746853829, -0.3618272004124716, 0.11484323156214737, -0.26226204092885685, -0.2184488196631776, 0.28063192493126426, -0.1843996893201577, 0.07129401970273397, 0.14122769119507655, 0.07123123190006403, -0.015790742201873608, -0.3163716604934976, 0.22341495681202084, 0.028310091213087595, 0.33242562374716084, 0.06046575333145777, 0.08228953436003746, -0.03269033546020519, 0.012130540890039832, -0.0030251455435020723, -0.03510374557904076, 0.15880514528922274, 0.3867552872155023, 0.2146024370729175, 0.3904087041105019, -0.473346940769748, -0.25148406167565956, 0.11863274800987166, 0.19741570195513153, 0.13304594400481826, -0.07627707907791831, -0.2931613781907427, 0.08749358044840087, -0.18395154097476812, -0.0254268452845281, -0.1478184166444121, 0.007223358097775861, -0.022495548315433322, -0.21053225938624914, 0.011236016407350488, 0.03900218898280135, 0.14644506402262378, -0.017538996157144732, -0.11690016398683015, 0.06758714734217314, 0.17315026565168903, 0.019700480803322987, 0.08911535891591513, 0.15167961882859995, -0.2883922059710438, -0.12789578910680546, 0.3547560947059881, -0.020882368001144555, -0.16375250719747997, 0.22230608935475232, -0.09991454610905397, -0.19142960929949318, 0.10574436930235563, 0.23925004117044174, 0.12019834061076234, -0.1737776711256808, 0.03317777340769709, 0.00951593381895383, 0.19848825805774692, 0.06672829433525802, -0.010801814502017119, 0.18718646365991523, 0.2294031295111388, 0.009929403509600015, 0.06970458014045043, -0.1043220712355661, -0.063978485269912, -0.1739939473950722, -0.1329991794692597, -0.19344256023187043, 0.03410160186118217, -0.004589148817032092, -0.1433342193486169, 0.341164807060859, 0.2805619830005311, 0.1353881619155671, -0.0030212419714382667, 0.3559447691783192, 0.00964450196034869, 0.1578696922501769, 0.08085729486233827, 0.2601737287212906, 0.005749531939999736, 0.19243650712021518, -0.10494419126074732, 0.06059251044644043, -0.0336144709787524]
|
1,803.04874
|
Robust Recursive Filtering and Smoothing
|
Using a perturbation technique, we derive a new approximate filtering and
smoothing methodology generalizing along different directions several existing
approaches to robust filtering based on the score and the Hessian matrix of the
observation density. The main advantages of the methodology can be summarized
as follows: (i) it relaxes the critical assumption of a Gaussian prior
distribution for the latent states underlying such approaches; (ii) can be
applied to a general class of state-space models including univariate and
multivariate location, scale and count data models; (iii) has a very simple
structure based on forward-backward recursions similar to the Kalman filter and
smoother; (iv) allows a straightforward computation of confidence bands around
the state estimates reflecting the combination of parameter and filtering
uncertainty. We show through an extensive Monte Carlo study that the mean
square loss with respect to exact simulation-based methods is small in a wide
range of scenarios. We finally illustrate empirically the application of the
methodology to the estimation of stochastic volatility and correlations in
financial time-series.
|
stat.ME
|
using a perturbation technique we derive a new approximate filtering and smoothing methodology generalizing along different directions several existing approaches to robust filtering based on the score and the hessian matrix of the observation density the main advantages of the methodology can be summarized as follows i it relaxes the critical assumption of a gaussian prior distribution for the latent states underlying such approaches ii can be applied to a general class of statespace models including univariate and multivariate location scale and count data models iii has a very simple structure based on forwardbackward recursions similar to the kalman filter and smoother iv allows a straightforward computation of confidence bands around the state estimates reflecting the combination of parameter and filtering uncertainty we show through an extensive monte carlo study that the mean square loss with respect to exact simulationbased methods is small in a wide range of scenarios we finally illustrate empirically the application of the methodology to the estimation of stochastic volatility and correlations in financial timeseries
|
[['using', 'a', 'perturbation', 'technique', 'we', 'derive', 'a', 'new', 'approximate', 'filtering', 'and', 'smoothing', 'methodology', 'generalizing', 'along', 'different', 'directions', 'several', 'existing', 'approaches', 'to', 'robust', 'filtering', 'based', 'on', 'the', 'score', 'and', 'the', 'hessian', 'matrix', 'of', 'the', 'observation', 'density', 'the', 'main', 'advantages', 'of', 'the', 'methodology', 'can', 'be', 'summarized', 'as', 'follows', 'i', 'it', 'relaxes', 'the', 'critical', 'assumption', 'of', 'a', 'gaussian', 'prior', 'distribution', 'for', 'the', 'latent', 'states', 'underlying', 'such', 'approaches', 'ii', 'can', 'be', 'applied', 'to', 'a', 'general', 'class', 'of', 'statespace', 'models', 'including', 'univariate', 'and', 'multivariate', 'location', 'scale', 'and', 'count', 'data', 'models', 'iii', 'has', 'a', 'very', 'simple', 'structure', 'based', 'on', 'forwardbackward', 'recursions', 'similar', 'to', 'the', 'kalman', 'filter', 'and', 'smoother', 'iv', 'allows', 'a', 'straightforward', 'computation', 'of', 'confidence', 'bands', 'around', 'the', 'state', 'estimates', 'reflecting', 'the', 'combination', 'of', 'parameter', 'and', 'filtering', 'uncertainty', 'we', 'show', 'through', 'an', 'extensive', 'monte', 'carlo', 'study', 'that', 'the', 'mean', 'square', 'loss', 'with', 'respect', 'to', 'exact', 'simulationbased', 'methods', 'is', 'small', 'in', 'a', 'wide', 'range', 'of', 'scenarios', 'we', 'finally', 'illustrate', 'empirically', 'the', 'application', 'of', 'the', 'methodology', 'to', 'the', 'estimation', 'of', 'stochastic', 'volatility', 'and', 'correlations', 'in', 'financial', 'timeseries']]
|
[-0.03525968404388959, 0.005960152965378617, -0.12953319403579866, 0.10063229982889968, -0.08413458053441443, -0.14261166577519485, 0.05035585639226807, 0.41544901824021746, -0.28788879614450125, -0.3018752205445288, 0.1414272060298179, -0.24376524942549918, -0.15168731775101738, 0.19380999511499067, -0.06302875756081497, 0.09626561416500419, 0.05742848043732301, -0.008901784620137566, -0.11698202822583359, -0.213555521175359, 0.29577947195451265, 0.0730765081980657, 0.307424207981235, -0.017103411066456086, 0.12724118468216647, 0.030958356822085892, -0.07994639324630506, 0.025296582101937935, -0.11880772513050356, 0.1350456391286915, 0.22465987560896722, 0.14881806780884493, 0.31662212948303825, -0.3696194908212452, -0.21407460957523106, 0.1004738094155627, 0.13616635544709835, 0.13107253559561965, -0.014727085965173043, -0.3070894801140537, 0.047353493611840804, -0.18333732055020713, -0.10581215311767611, -0.10211329291266914, -0.03146212226738768, 0.059464784932168495, -0.32987094366786585, 0.10677324155532926, 0.034505224912069164, 0.04255677975962881, -0.025346945409494944, -0.16099012129424833, 0.006007400142943718, 0.06200607335980232, 0.05555359659972738, -0.030318768688797203, 0.13080844406821054, -0.10763730189746477, -0.1349038455949424, 0.3088203340289376, -0.10074580361764911, -0.21849815389582303, 0.1780784412661909, -0.08100250048408582, -0.14130015485815306, 0.11546576028888131, 0.21265161716373715, 0.12098399960276114, -0.15353336594427092, 0.07278296441568569, -0.012193350831581247, 0.15199386995952555, -0.01164609254420509, -0.027457976633870215, 0.16222435875159286, 0.18876916235009727, 0.10511186306320748, 0.1176827091368235, -0.16236310921190583, -0.1450895273406334, -0.30055384392458834, -0.13643241525571187, -0.197940437913977, -0.01725199818611145, -0.15215565785209403, -0.1888087682657429, 0.4382164710195812, 0.21841342492613214, 0.20818871287243254, 0.08995080257617158, 0.2997038852059718, 0.1562278236685453, 0.03388130592909702, 0.06436932797835776, 0.16334745251937333, 0.13042888097801197, 0.06226610661533898, -0.17270840368007678, 0.10174415762189737, 0.020640212762825322]
|
1,803.04875
|
Generating B\'ezout trees for Pythagorean pairs
|
Relatively prime pairs of integers can be represented as nodes in three way
branching trees. We construct trees of B\'ezout coefficients which correspond
to the relatively prime pairs in the aforementioned trees. As one application,
we compare the B\'ezout coefficients in these trees to those returned by the
gcd function in Matlab. As another application, we use these trees to decrease
the computation time required to create computer generated hyperbolic wallpaper
designs.
|
math.NT
|
relatively prime pairs of integers can be represented as nodes in three way branching trees we construct trees of bezout coefficients which correspond to the relatively prime pairs in the aforementioned trees as one application we compare the bezout coefficients in these trees to those returned by the gcd function in matlab as another application we use these trees to decrease the computation time required to create computer generated hyperbolic wallpaper designs
|
[['relatively', 'prime', 'pairs', 'of', 'integers', 'can', 'be', 'represented', 'as', 'nodes', 'in', 'three', 'way', 'branching', 'trees', 'we', 'construct', 'trees', 'of', 'bezout', 'coefficients', 'which', 'correspond', 'to', 'the', 'relatively', 'prime', 'pairs', 'in', 'the', 'aforementioned', 'trees', 'as', 'one', 'application', 'we', 'compare', 'the', 'bezout', 'coefficients', 'in', 'these', 'trees', 'to', 'those', 'returned', 'by', 'the', 'gcd', 'function', 'in', 'matlab', 'as', 'another', 'application', 'we', 'use', 'these', 'trees', 'to', 'decrease', 'the', 'computation', 'time', 'required', 'to', 'create', 'computer', 'generated', 'hyperbolic', 'wallpaper', 'designs']]
|
[-0.1517570867929155, 0.09804230709818916, -0.040401720946344234, 0.10048997234035698, -0.111598400088648, -0.13001789561369353, 0.046530160018139415, 0.3651149950714575, -0.35058229478696984, -0.31197292264550924, 0.0925700577386629, -0.2725797252108653, -0.12792422742738077, 0.23500686144042346, -0.0707446843666225, 0.06077873575527014, 0.07271908765606996, 0.05617051208133085, -0.010080540264930783, -0.3528737103010321, 0.280438631772995, 0.004015357466414571, 0.1809787452997019, -0.0495968307627158, 0.05024100108938809, 0.00012970200300009715, -0.03911549014285103, 0.019630494242947962, -0.13994667820063317, 0.10646727818918104, 0.35816199151385164, 0.1460299891186878, 0.19973487581268679, -0.4167690235707495, -0.08856234119998084, 0.19429645943455398, 0.186429061086124, 0.07918005905392217, -0.011833433074773185, -0.1953905908158049, 0.1356863433805605, -0.1892600690997723, -0.13684325175644416, -0.062166739717213204, 0.02762423103882207, 0.0664844190210311, -0.2651088262209669, -0.009471827652305365, 0.0307043406387998, 0.04108435085638323, 0.03793327546575003, -0.17205098513255102, -0.01462098542186949, 0.13560155228090784, -0.02028681994933221, 0.001937092676396585, 0.09704148831466834, -0.059758206696844555, -0.1849860738665383, 0.33353896501163643, -0.05038141420421501, -0.23886109071059358, 0.20664671136182733, -0.11231518589193001, -0.1621696844101987, 0.09089129877530569, 0.20078146897463334, 0.11849369156536543, -0.0858930294893475, 0.04855542190165983, -0.07081994520720197, 0.10402483535775293, 0.20056759796312285, -0.022061535144328244, 0.16773125258300248, 0.08374133228790015, 0.0373714251909405, 0.20457918771555544, 0.018077246101003967, -0.027318551011073094, -0.25261440717925626, -0.1556989636996554, -0.1935431341925222, 0.04201573185208771, -0.12169655554720925, -0.2074995041410956, 0.3646354624070227, 0.14645697387944287, 0.2282973092644372, 0.12802134799130727, 0.2614921532416095, 0.08246962315994703, 0.10863712400249723, 0.07438834980388896, 0.0932617134725054, 0.17008788492401233, 0.02001997580130895, -0.10224607222092648, 0.053428641235869795, 0.1253276071511209]
|
1,803.04876
|
Hypergeometric continuation of divergent perturbation series. I.
Critical exponents of the Bose-Hubbard model
|
We study the connection between the exponent of the order parameter of the
Mott insulator-to-superfluid transition occurring in the two-dimensional
Bose-Hubbard model, and the divergence exponents of its one- and two-particle
correlation functions. We find that at the multicritical points all divergence
exponents are related to each other, allowing us to express the critical
exponent in terms of one single divergence exponent. This approach correctly
reproduces the critical exponent of the three-dimensional $XY$ universality
class. Because divergence exponents can be computed in an efficient manner by
hypergeometric analytic continuation, our strategy is applicable to a wide
class of systems.
|
cond-mat.stat-mech
|
we study the connection between the exponent of the order parameter of the mott insulatortosuperfluid transition occurring in the twodimensional bosehubbard model and the divergence exponents of its one and twoparticle correlation functions we find that at the multicritical points all divergence exponents are related to each other allowing us to express the critical exponent in terms of one single divergence exponent this approach correctly reproduces the critical exponent of the threedimensional xy universality class because divergence exponents can be computed in an efficient manner by hypergeometric analytic continuation our strategy is applicable to a wide class of systems
|
[['we', 'study', 'the', 'connection', 'between', 'the', 'exponent', 'of', 'the', 'order', 'parameter', 'of', 'the', 'mott', 'insulatortosuperfluid', 'transition', 'occurring', 'in', 'the', 'twodimensional', 'bosehubbard', 'model', 'and', 'the', 'divergence', 'exponents', 'of', 'its', 'one', 'and', 'twoparticle', 'correlation', 'functions', 'we', 'find', 'that', 'at', 'the', 'multicritical', 'points', 'all', 'divergence', 'exponents', 'are', 'related', 'to', 'each', 'other', 'allowing', 'us', 'to', 'express', 'the', 'critical', 'exponent', 'in', 'terms', 'of', 'one', 'single', 'divergence', 'exponent', 'this', 'approach', 'correctly', 'reproduces', 'the', 'critical', 'exponent', 'of', 'the', 'threedimensional', 'xy', 'universality', 'class', 'because', 'divergence', 'exponents', 'can', 'be', 'computed', 'in', 'an', 'efficient', 'manner', 'by', 'hypergeometric', 'analytic', 'continuation', 'our', 'strategy', 'is', 'applicable', 'to', 'a', 'wide', 'class', 'of', 'systems']]
|
[-0.15027475408795807, 0.11291272532458844, -0.10123164400416003, 0.0853932207647824, -0.03187870143705772, -0.18963081129083428, 0.04594028404810362, 0.30739061824972697, -0.2743841204227823, -0.22436511157212233, 0.031810791726750935, -0.3206601311085802, -0.19910739597422306, 0.21025426678049067, 0.02484361758700224, 0.12413329966871933, -0.069020884643036, 0.026754615715507305, -0.12815363890364428, -0.21507015886406103, 0.3549805157206426, -0.012567232391147903, 0.2723754030403051, 0.03917266678234393, 0.0336759733271343, -0.003641591887130882, 0.04204186862846131, 0.00516664974316202, -0.21140163150332889, 0.0845247584658515, 0.24985306010101782, 0.015222628798448679, 0.2216241689718733, -0.2803951431667865, -0.22446986464689475, 0.13741460187840415, 0.16037278928126047, 0.060365677025695945, 0.044964700015355845, -0.24241599370960634, 0.0588371296438378, -0.17445554710792924, -0.2023184772515011, -0.09277166991560447, -0.008299082957415117, 0.029330005716400768, -0.304404854078335, 0.14239168915464873, 0.035505613773082846, 0.06920761211464803, -0.042761917015528214, -0.05332088345812276, 0.0069767111427893845, 0.18690380427252615, 0.05884746641433337, 0.08466853390123244, 0.10375365726837907, -0.14243101694790478, -0.12555058803726835, 0.34621828328818083, 0.0028138674003062676, -0.1963793658322156, 0.1855577848042653, -0.21951857886060772, -0.11112572398093162, 0.15130393671793768, 0.1346548022102621, 0.103625230858046, -0.13744466312493037, 0.0966819417415977, -0.008388239871522393, 0.16102664870906133, 0.0004497487521307035, 0.0112635923521311, 0.1749093354011726, 0.0722712767733769, 0.04834522005885539, 0.18706376714140383, -0.051517864571639684, -0.19582047530290003, -0.3287222165840142, -0.1544776148741331, -0.20961047323803403, 0.0372260520516923, -0.15572472484376648, -0.19278567159463736, 0.4326351731639318, 0.17791481189561462, 0.21291280106989421, 0.08188849249431356, 0.17909087257158726, 0.19538643191018226, 0.05350195469259463, 0.06828491554849526, 0.21403443716428797, 0.0933589620369891, 0.08607702928059029, -0.24324538565071468, 0.067886850138129, 0.173564944933686]
|
1,803.04877
|
A machine learning-based approach for estimating and testing
associations with multivariate outcomes
|
We propose a method for summarizing the strength of association between a set
of variables and a multivariate outcome. Classical summary measures are
appropriate when linear relationships exist between covariates and outcomes,
while our approach provides an alternative that is useful in situations where
complex relationships may be present. We utilize ensemble machine learning to
detect nonlinear relationships and covariate interactions and propose a measure
of association that captures these relationships. A hypothesis test about the
proposed associative measure can be used to test the strong null hypothesis of
no association between a set of variables and a multivariate outcome.
Simulations demonstrate that this hypothesis test has greater power than
existing methods against alternatives where covariates have nonlinear
relationships with outcomes. We additionally propose measures of variable
importance for groups of variables, which summarize each groups' association
with the outcome. We demonstrate our methodology using data from a birth cohort
study on childhood health and nutrition in the Philippines.
|
stat.ME
|
we propose a method for summarizing the strength of association between a set of variables and a multivariate outcome classical summary measures are appropriate when linear relationships exist between covariates and outcomes while our approach provides an alternative that is useful in situations where complex relationships may be present we utilize ensemble machine learning to detect nonlinear relationships and covariate interactions and propose a measure of association that captures these relationships a hypothesis test about the proposed associative measure can be used to test the strong null hypothesis of no association between a set of variables and a multivariate outcome simulations demonstrate that this hypothesis test has greater power than existing methods against alternatives where covariates have nonlinear relationships with outcomes we additionally propose measures of variable importance for groups of variables which summarize each groups association with the outcome we demonstrate our methodology using data from a birth cohort study on childhood health and nutrition in the philippines
|
[['we', 'propose', 'a', 'method', 'for', 'summarizing', 'the', 'strength', 'of', 'association', 'between', 'a', 'set', 'of', 'variables', 'and', 'a', 'multivariate', 'outcome', 'classical', 'summary', 'measures', 'are', 'appropriate', 'when', 'linear', 'relationships', 'exist', 'between', 'covariates', 'and', 'outcomes', 'while', 'our', 'approach', 'provides', 'an', 'alternative', 'that', 'is', 'useful', 'in', 'situations', 'where', 'complex', 'relationships', 'may', 'be', 'present', 'we', 'utilize', 'ensemble', 'machine', 'learning', 'to', 'detect', 'nonlinear', 'relationships', 'and', 'covariate', 'interactions', 'and', 'propose', 'a', 'measure', 'of', 'association', 'that', 'captures', 'these', 'relationships', 'a', 'hypothesis', 'test', 'about', 'the', 'proposed', 'associative', 'measure', 'can', 'be', 'used', 'to', 'test', 'the', 'strong', 'null', 'hypothesis', 'of', 'no', 'association', 'between', 'a', 'set', 'of', 'variables', 'and', 'a', 'multivariate', 'outcome', 'simulations', 'demonstrate', 'that', 'this', 'hypothesis', 'test', 'has', 'greater', 'power', 'than', 'existing', 'methods', 'against', 'alternatives', 'where', 'covariates', 'have', 'nonlinear', 'relationships', 'with', 'outcomes', 'we', 'additionally', 'propose', 'measures', 'of', 'variable', 'importance', 'for', 'groups', 'of', 'variables', 'which', 'summarize', 'each', 'groups', 'association', 'with', 'the', 'outcome', 'we', 'demonstrate', 'our', 'methodology', 'using', 'data', 'from', 'a', 'birth', 'cohort', 'study', 'on', 'childhood', 'health', 'and', 'nutrition', 'in', 'the', 'philippines']]
|
[-0.07115248340176882, 0.04955518132860189, -0.1410147910545955, 0.13508919572586534, -0.09797315071073343, -0.16464898290710067, 0.11030639820943042, 0.39711660149056205, -0.23916897468222012, -0.2929148828528775, 0.07886592220916243, -0.2753718994417281, -0.17737353777032602, 0.18279885582672725, -0.0799331750058856, 0.015512787889244047, 0.10348045209176698, 0.04189891942759168, -0.016262635345930972, -0.25526757944088263, 0.34394710013531615, 0.03654149559959066, 0.3029914379365883, -0.035437775069976564, 0.1156964973735465, 0.024355340678736848, -0.08839726826738355, 0.04798088544385168, -0.07764889298620269, 0.1539153010912427, 0.29226694863916336, 0.235875564902646, 0.37231698674413394, -0.37956747643022837, -0.22302296020254586, 0.15444910381305613, 0.0705230295710828, 0.048394998807149626, -0.03937849532534608, -0.27354128128679106, 0.05195234596594559, -0.17707754143238444, -0.05860786307485973, -0.13182678809477333, 0.026325653567793046, 0.03670859304161555, -0.3529010067237014, 0.12347455710500667, 0.002215344847967766, 0.11611333776575823, -0.049297934354124766, -0.11017771114510302, 0.038779221931999584, 0.12948861859651697, 0.0850043325848239, 8.507953874719967e-05, 0.10665653969905099, -0.09849983757894791, -0.1770634024152122, 0.34167684674403576, -0.023453871709746367, -0.2549301982951005, 0.24583949107653316, -0.14201539826510567, -0.1594607813061221, 0.014877255619415697, 0.244926570574958, 0.0917938184490978, -0.19602550069390395, -0.004620859559783536, -0.05901408770982668, 0.1901261716694483, 0.011630572891155691, -0.011028735076206145, 0.2153191910635639, 0.19090547691884233, 0.01538404806681071, 0.1208708779051689, -0.11452223057565777, -0.07671612121879398, -0.2877973042979087, -0.17355749881152743, -0.11941308727628498, 0.0038991088820797093, -0.11603946040722003, -0.1353998140037666, 0.38046441555503496, 0.22245481059045982, 0.1766990921899395, 0.08291063307851858, 0.24626615908840355, 0.04759630447772695, 0.04522655461621969, 0.03594396097890142, 0.17845223285257816, 0.11388605029421782, 0.004248388186272867, -0.17750663833462768, 0.1599334308075127, -0.0063608713131749406]
|
1,803.04878
|
Effect of network clustering on mutually cooperative coinfections
|
The spread of an infectious disease can be promoted by previous infections
with other pathogens. This cooperative effect can give rise to violent
outbreaks, reflecting the presence of an abrupt epidemic transition. As for
other diffusive dynamics, the topology of the interaction pattern of the host
population plays a crucial role. It was conjectured that a discontinuous
transition arises when there are relatively few short loops and many long loops
in the contact network. Here we focus on the role of local clustering in
determining the nature of the transition. We consider two mutually cooperative
pathogens diffusing in the same population: an individual already infected with
one disease has an increased probability of getting infected by the other. We
look at how a disease obeying the susceptible-infected-removed dynamics spreads
on contact networks with tunable clustering. Using numerical simulations we
show that for large cooperativity the epidemic transition is always abrupt,
with the discontinuity decreasing as clustering is increased. For large
clustering strong finite size effects are present and the discontinuous nature
of the transition is manifest only in large networks. We also investigate the
problem of influential spreaders for cooperative infections, revealing that
both cooperativity and clustering strongly enhance the dependence of the
spreading influence on the degree of the initial seed.
|
physics.soc-ph cond-mat.stat-mech
|
the spread of an infectious disease can be promoted by previous infections with other pathogens this cooperative effect can give rise to violent outbreaks reflecting the presence of an abrupt epidemic transition as for other diffusive dynamics the topology of the interaction pattern of the host population plays a crucial role it was conjectured that a discontinuous transition arises when there are relatively few short loops and many long loops in the contact network here we focus on the role of local clustering in determining the nature of the transition we consider two mutually cooperative pathogens diffusing in the same population an individual already infected with one disease has an increased probability of getting infected by the other we look at how a disease obeying the susceptibleinfectedremoved dynamics spreads on contact networks with tunable clustering using numerical simulations we show that for large cooperativity the epidemic transition is always abrupt with the discontinuity decreasing as clustering is increased for large clustering strong finite size effects are present and the discontinuous nature of the transition is manifest only in large networks we also investigate the problem of influential spreaders for cooperative infections revealing that both cooperativity and clustering strongly enhance the dependence of the spreading influence on the degree of the initial seed
|
[['the', 'spread', 'of', 'an', 'infectious', 'disease', 'can', 'be', 'promoted', 'by', 'previous', 'infections', 'with', 'other', 'pathogens', 'this', 'cooperative', 'effect', 'can', 'give', 'rise', 'to', 'violent', 'outbreaks', 'reflecting', 'the', 'presence', 'of', 'an', 'abrupt', 'epidemic', 'transition', 'as', 'for', 'other', 'diffusive', 'dynamics', 'the', 'topology', 'of', 'the', 'interaction', 'pattern', 'of', 'the', 'host', 'population', 'plays', 'a', 'crucial', 'role', 'it', 'was', 'conjectured', 'that', 'a', 'discontinuous', 'transition', 'arises', 'when', 'there', 'are', 'relatively', 'few', 'short', 'loops', 'and', 'many', 'long', 'loops', 'in', 'the', 'contact', 'network', 'here', 'we', 'focus', 'on', 'the', 'role', 'of', 'local', 'clustering', 'in', 'determining', 'the', 'nature', 'of', 'the', 'transition', 'we', 'consider', 'two', 'mutually', 'cooperative', 'pathogens', 'diffusing', 'in', 'the', 'same', 'population', 'an', 'individual', 'already', 'infected', 'with', 'one', 'disease', 'has', 'an', 'increased', 'probability', 'of', 'getting', 'infected', 'by', 'the', 'other', 'we', 'look', 'at', 'how', 'a', 'disease', 'obeying', 'the', 'susceptibleinfectedremoved', 'dynamics', 'spreads', 'on', 'contact', 'networks', 'with', 'tunable', 'clustering', 'using', 'numerical', 'simulations', 'we', 'show', 'that', 'for', 'large', 'cooperativity', 'the', 'epidemic', 'transition', 'is', 'always', 'abrupt', 'with', 'the', 'discontinuity', 'decreasing', 'as', 'clustering', 'is', 'increased', 'for', 'large', 'clustering', 'strong', 'finite', 'size', 'effects', 'are', 'present', 'and', 'the', 'discontinuous', 'nature', 'of', 'the', 'transition', 'is', 'manifest', 'only', 'in', 'large', 'networks', 'we', 'also', 'investigate', 'the', 'problem', 'of', 'influential', 'spreaders', 'for', 'cooperative', 'infections', 'revealing', 'that', 'both', 'cooperativity', 'and', 'clustering', 'strongly', 'enhance', 'the', 'dependence', 'of', 'the', 'spreading', 'influence', 'on', 'the', 'degree', 'of', 'the', 'initial', 'seed']]
|
[-0.16913414097891874, 0.17133986742157745, -0.04737948808151315, 0.07988235826784182, -0.04185987255131861, -0.1766797878882707, 0.050165916097851225, 0.36100466353028027, -0.2584497445913137, -0.26819161929515245, 0.0817893026220911, -0.32247880973659876, -0.2305099991246847, 0.11214973430592953, -0.018516564823001763, -0.03360332323036174, 0.0491976051494793, 0.03885557338510824, 0.04155693500509204, -0.24412115679544238, 0.34203175867068636, 0.06863905316908439, 0.2829066992601169, 0.08262080802551452, 0.07451760252709237, 0.026875959846242865, -0.000181290785615104, 0.03924625328651911, -0.12742169520689064, 0.05478728461938137, 0.26268024275541735, 0.10435367329083883, 0.3297171896534427, -0.43179570148119106, -0.2738589150457696, 0.14253773699176303, 0.2012668021302231, 0.15986500517684826, -0.04292104255522267, -0.2719724181751756, 0.038529254417023005, -0.15794938059150568, -0.13178164468812406, -0.010588869390974068, 0.04185947779025707, 0.04269560445363651, -0.2281899705887794, 0.11715705374534184, 0.028883959872885345, 0.09653096529655159, -0.012374217563774437, -0.06535484085852315, -0.05209086350613397, 0.20099206608382408, 0.06639807020865363, -0.013223435340958805, 0.16612174856462208, -0.16073413633297742, -0.09668261903988302, 0.33547249635163134, -0.03189381630871586, -0.13713020421806196, 0.218298874817402, -0.13799810695532216, -0.13213978501647394, 0.17640980977108175, 0.2029031770268701, 0.0928020552964881, -0.1166641822929482, -0.014721627503415633, 0.0001742431085627034, 0.14420246972920997, 0.02700714709430511, -0.002648694425346857, 0.17098566557155517, 0.24489123323813677, 0.09378643768574858, 0.11618382628114217, -0.09924288073341574, -0.1276062491222478, -0.21263842866316718, -0.09375870587163658, -0.15479275933906156, 0.07495316871736234, -0.14886403544829283, -0.20535063880214574, 0.3890097969901344, 0.14193826079624486, 0.20792990033119424, 0.04317695956747487, 0.210294315308104, 0.09418089923290711, 0.0379852901349055, 0.03959133497325106, 0.2344632407602028, 0.08464647695860926, 0.08250840225878593, -0.2749563637815574, 0.20339698349521057, -0.001424970834670843]
|
1,803.04879
|
Grigorchuk-Gupta-Sidki groups as a source for Beauville surfaces
|
If $G$ is a Grigorchuk-Gupta-Sidki group defined over a $p$-adic tree, where
$p$ is an odd prime, we study the existence of Beauville surfaces associated to
the quotients of $G$ by its level stabilizers $\st_G(n)$. We prove that if $G$
is periodic then the quotients $G/\st_G(n)$ are Beauville groups for every
$n\geq 2$ if $p\geq 5$ and $n\geq 3$ if $p=3$. On the other hand, if $G$ is
non-periodic, then none of the quotients $G/\st_G(n)$ are Beauville groups.
|
math.GR
|
if g is a grigorchukguptasidki group defined over a padic tree where p is an odd prime we study the existence of beauville surfaces associated to the quotients of g by its level stabilizers st_gn we prove that if g is periodic then the quotients gst_gn are beauville groups for every ngeq 2 if pgeq 5 and ngeq 3 if p3 on the other hand if g is nonperiodic then none of the quotients gst_gn are beauville groups
|
[['if', 'g', 'is', 'a', 'grigorchukguptasidki', 'group', 'defined', 'over', 'a', 'padic', 'tree', 'where', 'p', 'is', 'an', 'odd', 'prime', 'we', 'study', 'the', 'existence', 'of', 'beauville', 'surfaces', 'associated', 'to', 'the', 'quotients', 'of', 'g', 'by', 'its', 'level', 'stabilizers', 'st_gn', 'we', 'prove', 'that', 'if', 'g', 'is', 'periodic', 'then', 'the', 'quotients', 'gst_gn', 'are', 'beauville', 'groups', 'for', 'every', 'ngeq', '2', 'if', 'pgeq', '5', 'and', 'ngeq', '3', 'if', 'p3', 'on', 'the', 'other', 'hand', 'if', 'g', 'is', 'nonperiodic', 'then', 'none', 'of', 'the', 'quotients', 'gst_gn', 'are', 'beauville', 'groups']]
|
[-0.2502847883875507, 0.15669576628814055, -0.11316132330260165, 0.0563304624457315, -0.09159010953924342, -0.1838527917421448, -0.03409625467454159, 0.38145895971841104, -0.33098605691732186, -0.20592195051092957, 0.1375750112095596, -0.3045007533620338, -0.15009273414349034, 0.20786755674241766, -0.1295488233539603, -0.11153239999485605, 0.04914204134429629, 0.2018153290704799, -0.04128945169882295, -0.40230872575193644, 0.40147461238745097, -0.12842243220153693, 0.11757785269701099, 0.07526499940384482, 0.06592254718369175, -0.007029466032100892, 0.05167807559356899, -0.026947532289636297, -0.1658937571090654, 0.032009994611144066, 0.31978959587679523, 0.03325480430676426, 0.2625433645034964, -0.34904561730886724, -0.14504110812826232, 0.3056429123531121, 0.12375005318254635, -0.056210163162668816, -0.00658757147549123, -0.2184061963815947, 0.2502947304699872, -0.11782515572535025, -0.17738706836904827, -0.02090297717085058, 0.20144920033478253, 0.018083011313039507, -0.2294912167598267, -0.007325626809049297, 0.10004912728343059, 0.15216253061048887, -0.06420102364830421, -0.1263536144664662, -0.1428284261476349, 0.08640225748909083, -0.049474827706109024, 0.04182439277182975, 0.036932092631153914, -0.06202024601500582, -0.12233154407727558, 0.40574677331322756, -0.04718426149967756, -0.21528435692291809, 0.08821342097016403, -0.2457519345098754, -0.23636443081085343, 0.1444966018300604, 0.048869513705171445, 0.18158426975227288, 0.07132555783499737, 0.2210003137580635, -0.1652440970159463, 0.1248082985812043, 0.14354913490446838, -0.12380073536061556, 0.0851121821717636, 0.09374471057860835, 0.14242322425785903, 0.08223334796855704, 0.018693172287139286, 0.18928166655068462, -0.3708935988110465, -0.1355100643594523, -0.1478505191720418, 0.14954401540091714, -0.09643055536022026, -0.1160073025919799, 0.3526740196991611, 0.018616058209256547, 0.06476812953179753, 0.12106027764998176, 0.18207288885212228, 0.02273503176213519, 0.013867931541156125, 0.15623354992429675, 0.037233196296477436, 0.22952649218810572, -0.21452637424698803, -0.12956913772064285, -0.031067883853825765, 0.20340380462113064]
|
1,803.0488
|
An Efficient Data Protection Architecture Based on Fragmentation and
Encryption
|
In this thesis, a completely revisited data protection scheme based on
selective encryption is presented. First, this new scheme is agnostic in term
of data format, second it has a parallel architecture using GPGPU allowing
performance to be at least comparable to full encryption algorithms.
Bitmap, as a special uncompressed multimedia format, is addressed as a first
use case. Discrete Cosine Transform (DCT) is the first transformation for
splitting fragments, getting data protection, and storing data separately on
local device and cloud servers. This work has largely improved the previous
published ones for bitmap protection by providing new designs and practical
experimentations. General purpose graphic processing unit (GPGPU) is exploited
as an accelerator to guarantee the efficiency of the calculation compared with
traditional full encryption algorithms. Then, an agnostic selective encryption
based on lossless Discrete Wavelet Transform (DWT) is presented. This design,
with practical experimentations on different hardware configurations, provides
strong level of protection and good performance at the same time plus flexible
storage dispersion schemes. Therefore, our agnostic data protection and
transmission solution combining fragmentation, encryption, and dispersion is
made available for a wide range of end-user applications. Also a complete set
of security analysis are deployed to test the level of provided protection.
|
cs.CR
|
in this thesis a completely revisited data protection scheme based on selective encryption is presented first this new scheme is agnostic in term of data format second it has a parallel architecture using gpgpu allowing performance to be at least comparable to full encryption algorithms bitmap as a special uncompressed multimedia format is addressed as a first use case discrete cosine transform dct is the first transformation for splitting fragments getting data protection and storing data separately on local device and cloud servers this work has largely improved the previous published ones for bitmap protection by providing new designs and practical experimentations general purpose graphic processing unit gpgpu is exploited as an accelerator to guarantee the efficiency of the calculation compared with traditional full encryption algorithms then an agnostic selective encryption based on lossless discrete wavelet transform dwt is presented this design with practical experimentations on different hardware configurations provides strong level of protection and good performance at the same time plus flexible storage dispersion schemes therefore our agnostic data protection and transmission solution combining fragmentation encryption and dispersion is made available for a wide range of enduser applications also a complete set of security analysis are deployed to test the level of provided protection
|
[['in', 'this', 'thesis', 'a', 'completely', 'revisited', 'data', 'protection', 'scheme', 'based', 'on', 'selective', 'encryption', 'is', 'presented', 'first', 'this', 'new', 'scheme', 'is', 'agnostic', 'in', 'term', 'of', 'data', 'format', 'second', 'it', 'has', 'a', 'parallel', 'architecture', 'using', 'gpgpu', 'allowing', 'performance', 'to', 'be', 'at', 'least', 'comparable', 'to', 'full', 'encryption', 'algorithms', 'bitmap', 'as', 'a', 'special', 'uncompressed', 'multimedia', 'format', 'is', 'addressed', 'as', 'a', 'first', 'use', 'case', 'discrete', 'cosine', 'transform', 'dct', 'is', 'the', 'first', 'transformation', 'for', 'splitting', 'fragments', 'getting', 'data', 'protection', 'and', 'storing', 'data', 'separately', 'on', 'local', 'device', 'and', 'cloud', 'servers', 'this', 'work', 'has', 'largely', 'improved', 'the', 'previous', 'published', 'ones', 'for', 'bitmap', 'protection', 'by', 'providing', 'new', 'designs', 'and', 'practical', 'experimentations', 'general', 'purpose', 'graphic', 'processing', 'unit', 'gpgpu', 'is', 'exploited', 'as', 'an', 'accelerator', 'to', 'guarantee', 'the', 'efficiency', 'of', 'the', 'calculation', 'compared', 'with', 'traditional', 'full', 'encryption', 'algorithms', 'then', 'an', 'agnostic', 'selective', 'encryption', 'based', 'on', 'lossless', 'discrete', 'wavelet', 'transform', 'dwt', 'is', 'presented', 'this', 'design', 'with', 'practical', 'experimentations', 'on', 'different', 'hardware', 'configurations', 'provides', 'strong', 'level', 'of', 'protection', 'and', 'good', 'performance', 'at', 'the', 'same', 'time', 'plus', 'flexible', 'storage', 'dispersion', 'schemes', 'therefore', 'our', 'agnostic', 'data', 'protection', 'and', 'transmission', 'solution', 'combining', 'fragmentation', 'encryption', 'and', 'dispersion', 'is', 'made', 'available', 'for', 'a', 'wide', 'range', 'of', 'enduser', 'applications', 'also', 'a', 'complete', 'set', 'of', 'security', 'analysis', 'are', 'deployed', 'to', 'test', 'the', 'level', 'of', 'provided', 'protection']]
|
[-0.13263821099407788, -0.031242591950037268, -0.08847069003641969, 0.055640189266173035, -0.09505343418568372, -0.2392753174801062, 0.05674465041289606, 0.397790279839097, -0.27729930378178635, -0.27666370646528354, 0.14220360512618066, -0.22873249516095512, -0.08342889429229061, 0.2344165358646977, -0.1144408045927199, 0.1352816698504839, 0.06118614413355273, -0.01513650632894984, -0.0633462570164716, -0.29528139348698373, 0.24995379707798726, 0.12643215712841327, 0.40241643165397206, 0.025872147960656483, 0.07221866967667621, 0.01952336373534508, -0.07209627106104319, -0.07531965132149664, -0.05927540871155698, 0.14166735892479376, 0.2756284974981099, 0.18202105566813814, 0.27464410693146196, -0.42649241474161786, -0.17660130435464585, 0.02408673848684241, 0.13999657244989422, 0.10633142620961114, -0.13390970798777188, -0.2791801995086688, 0.13317571204928, -0.20244160867409736, -0.04192897487863353, -0.11411837477608948, -0.006475683142680947, -0.015605614959012444, -0.2998168996603387, -0.023155854305727322, 0.01719113972219752, 0.09337348834861342, -0.02094055603417318, -0.10907568439966205, 0.029930940558906736, 0.11070984541552095, -0.021720851768791696, 0.0420261060492499, 0.11268485326024635, -0.052119292015005356, -0.140849969281656, 0.41995432059984744, -0.005710655369046257, -0.20967004659540225, 0.1641142923100965, -0.02290888703314633, -0.15104747720562467, 0.12986139966481616, 0.211687293029731, 0.0500266836910713, -0.16916005087834668, 0.05900712202178178, -0.008342985890624, 0.2240328136581655, 0.08133699226238561, 0.07334819338426403, 0.1257822318933904, 0.2241204881790753, 0.05581427568842361, 0.16025328068233027, -0.0712303440188762, -0.07104152426941365, -0.2616384494050247, -0.15952009942564296, -0.22666698300574975, -0.04804416651349151, -0.06593727651577466, -0.14162488746195578, 0.378485795688672, 0.15442400559351394, 0.11213042847609869, 0.06623167725132278, 0.45289689220669793, 0.06819095948956645, 0.12258913554591921, 0.11051681297717661, 0.14959928632100544, 0.05275587845230248, 0.14932591297731893, -0.11943087989887473, 0.07211998038947946, 0.02712944749197582]
|
1,803.04881
|
Reviewing KLEE's Sonar-Search Strategy in Context of Greybox Fuzzing
|
Automatic test-case generation techniques of symbolic execution and fuzzing
are the most widely used methods to discover vulnerabilities in, both, academia
and industry. However, both these methods suffer from fundamental drawbacks
that stop them from achieving high path coverage that may, consequently, lead
to discovering vulnerabilities at the numerical scale of static analysis. In
this presentation, we examine systems-under-test (SUTs) at the granularity
level of functions and postulate that achieving higher function coverage
(execution of functions in a program at least once) than, both, symbolic
execution and fuzzing may be a necessary condition for discovering more
vulnerabilities than both. We will start this presentation with the design of a
targeted search strategy for KLEE, sonar-search, that prioritizes paths leading
to a target function, rather than maximizing overall path coverage in the
program. Then, we will show that examining SUTs at the level of functions
(compositional analysis) leads to discovering more vulnerabilities than
symbolic execution from a single entry point. Using this finding, we will,
then, demonstrate a greybox fuzzing method that can achieve higher function
coverage than symbolic execution. Finally, we will present a framework to
effectively manage vulnerabilities and assess their severities.
|
cs.SE
|
automatic testcase generation techniques of symbolic execution and fuzzing are the most widely used methods to discover vulnerabilities in both academia and industry however both these methods suffer from fundamental drawbacks that stop them from achieving high path coverage that may consequently lead to discovering vulnerabilities at the numerical scale of static analysis in this presentation we examine systemsundertest suts at the granularity level of functions and postulate that achieving higher function coverage execution of functions in a program at least once than both symbolic execution and fuzzing may be a necessary condition for discovering more vulnerabilities than both we will start this presentation with the design of a targeted search strategy for klee sonarsearch that prioritizes paths leading to a target function rather than maximizing overall path coverage in the program then we will show that examining suts at the level of functions compositional analysis leads to discovering more vulnerabilities than symbolic execution from a single entry point using this finding we will then demonstrate a greybox fuzzing method that can achieve higher function coverage than symbolic execution finally we will present a framework to effectively manage vulnerabilities and assess their severities
|
[['automatic', 'testcase', 'generation', 'techniques', 'of', 'symbolic', 'execution', 'and', 'fuzzing', 'are', 'the', 'most', 'widely', 'used', 'methods', 'to', 'discover', 'vulnerabilities', 'in', 'both', 'academia', 'and', 'industry', 'however', 'both', 'these', 'methods', 'suffer', 'from', 'fundamental', 'drawbacks', 'that', 'stop', 'them', 'from', 'achieving', 'high', 'path', 'coverage', 'that', 'may', 'consequently', 'lead', 'to', 'discovering', 'vulnerabilities', 'at', 'the', 'numerical', 'scale', 'of', 'static', 'analysis', 'in', 'this', 'presentation', 'we', 'examine', 'systemsundertest', 'suts', 'at', 'the', 'granularity', 'level', 'of', 'functions', 'and', 'postulate', 'that', 'achieving', 'higher', 'function', 'coverage', 'execution', 'of', 'functions', 'in', 'a', 'program', 'at', 'least', 'once', 'than', 'both', 'symbolic', 'execution', 'and', 'fuzzing', 'may', 'be', 'a', 'necessary', 'condition', 'for', 'discovering', 'more', 'vulnerabilities', 'than', 'both', 'we', 'will', 'start', 'this', 'presentation', 'with', 'the', 'design', 'of', 'a', 'targeted', 'search', 'strategy', 'for', 'klee', 'sonarsearch', 'that', 'prioritizes', 'paths', 'leading', 'to', 'a', 'target', 'function', 'rather', 'than', 'maximizing', 'overall', 'path', 'coverage', 'in', 'the', 'program', 'then', 'we', 'will', 'show', 'that', 'examining', 'suts', 'at', 'the', 'level', 'of', 'functions', 'compositional', 'analysis', 'leads', 'to', 'discovering', 'more', 'vulnerabilities', 'than', 'symbolic', 'execution', 'from', 'a', 'single', 'entry', 'point', 'using', 'this', 'finding', 'we', 'will', 'then', 'demonstrate', 'a', 'greybox', 'fuzzing', 'method', 'that', 'can', 'achieve', 'higher', 'function', 'coverage', 'than', 'symbolic', 'execution', 'finally', 'we', 'will', 'present', 'a', 'framework', 'to', 'effectively', 'manage', 'vulnerabilities', 'and', 'assess', 'their', 'severities']]
|
[-0.09266279033855755, 0.0326412534048654, -0.10727743879545734, 0.10858405103568104, -0.10368568753014216, -0.1531994593810017, 0.11247390220782852, 0.39562811078357446, -0.26505423149798574, -0.3501481084513883, 0.12564656084783726, -0.2784709475217728, -0.13475131526277329, 0.2139625525362887, -0.08716674839117179, 0.06546189615573655, 0.09308299969598963, -0.02516811834014367, -0.10188700027607811, -0.2664798916810002, 0.2726453003048527, 0.09375037614460938, 0.26482902442444, 0.057676837535779825, 0.05421829287440294, -0.0020205341864630816, -0.05495472404501201, -0.004813426939760827, -0.07163478155839513, 0.14828553499595423, 0.33686756382998645, 0.24800829080796521, 0.347046080603708, -0.4035380104592031, -0.1622036203561614, 0.11087595006202333, 0.14752950161422423, 0.11099169786814697, -0.025165879292717127, -0.24759778763162685, 0.18301730768277227, -0.1978720295759825, -0.08142800930965477, -0.12325982817726609, -0.011354631800399556, 0.001778660536529155, -0.251087245082785, -0.035335812724990215, 0.030265358100518468, 0.07530136465177877, -0.009496484016414479, -0.11462294862420343, -0.03446047763640051, 0.132537229142654, 0.039093804872394854, 0.02852366742445156, 0.1402488812863344, -0.15907935370661863, -0.1679857429750849, 0.35180887406331085, -0.015220816583383014, -0.17066895316174518, 0.20842758618314697, -0.10244290797888296, -0.16770575526267953, 0.13567162379841882, 0.22140779998762952, 0.12260969332754564, -0.18210749334962892, -0.016302567015887184, 0.06301172525763356, 0.19863304815024102, 0.10561122269496438, 0.029898455819963473, 0.2060111819188804, 0.2138328533665355, 0.10944131882714976, 0.1499706758033845, -0.06893571809617466, -0.0809267515228837, -0.2617143498275292, -0.15176584997887269, -0.10698372509887598, -0.01721593401765363, -0.07278730891879918, -0.14055517741054765, 0.3942106731567551, 0.25074515420412014, 0.11125969824366544, 0.15309534752887738, 0.3370027180214983, 0.08637635475734654, 0.10683971102086154, 0.12399093011218607, 0.16669870852931593, -0.05308313096424867, 0.1020543735751063, -0.16536943323017922, 0.12439352940738747, 0.03253548138370221]
|
1,803.04882
|
Hypergeometric continuation of divergent perturbation series. II.
Comparison with Shanks transformation and Pad\'e approximation
|
We explore in detail how analytic continuation of divergent perturbation
series by generalized hypergeometric functions is achieved in practice. Using
the example of strong-coupling perturbation series provided by the
two-dimensional Bose-Hubbard model, we compare hypergeometric continuation to
Shanks and Pad\'e techniques, and demonstrate that the former yields a
powerful, efficient and reliable alternative for computing the phase diagram of
the Mott insulator-to-superfluid transition. In contrast to Shanks
transformations and Pad\'e approximations, hypergeometric continuation also
allows us to determine the exponents which characterize the divergence of
correlation functions at the transition points. Therefore, hypergeometric
continuation constitutes a promising tool for the study of quantum phase
transitions.
|
cond-mat.stat-mech
|
we explore in detail how analytic continuation of divergent perturbation series by generalized hypergeometric functions is achieved in practice using the example of strongcoupling perturbation series provided by the twodimensional bosehubbard model we compare hypergeometric continuation to shanks and pade techniques and demonstrate that the former yields a powerful efficient and reliable alternative for computing the phase diagram of the mott insulatortosuperfluid transition in contrast to shanks transformations and pade approximations hypergeometric continuation also allows us to determine the exponents which characterize the divergence of correlation functions at the transition points therefore hypergeometric continuation constitutes a promising tool for the study of quantum phase transitions
|
[['we', 'explore', 'in', 'detail', 'how', 'analytic', 'continuation', 'of', 'divergent', 'perturbation', 'series', 'by', 'generalized', 'hypergeometric', 'functions', 'is', 'achieved', 'in', 'practice', 'using', 'the', 'example', 'of', 'strongcoupling', 'perturbation', 'series', 'provided', 'by', 'the', 'twodimensional', 'bosehubbard', 'model', 'we', 'compare', 'hypergeometric', 'continuation', 'to', 'shanks', 'and', 'pade', 'techniques', 'and', 'demonstrate', 'that', 'the', 'former', 'yields', 'a', 'powerful', 'efficient', 'and', 'reliable', 'alternative', 'for', 'computing', 'the', 'phase', 'diagram', 'of', 'the', 'mott', 'insulatortosuperfluid', 'transition', 'in', 'contrast', 'to', 'shanks', 'transformations', 'and', 'pade', 'approximations', 'hypergeometric', 'continuation', 'also', 'allows', 'us', 'to', 'determine', 'the', 'exponents', 'which', 'characterize', 'the', 'divergence', 'of', 'correlation', 'functions', 'at', 'the', 'transition', 'points', 'therefore', 'hypergeometric', 'continuation', 'constitutes', 'a', 'promising', 'tool', 'for', 'the', 'study', 'of', 'quantum', 'phase', 'transitions']]
|
[-0.1199362608338041, 0.017493823285968532, -0.1526795406227133, 0.1399359215477792, -0.0661063258225719, -0.13512376295846132, 0.0996513363705682, 0.3324943712214008, -0.23284015104706798, -0.19509581052476452, 0.07346378697991549, -0.27463905811988903, -0.22013406139754113, 0.21394948896153698, 0.01632125445065044, 0.11396306556250368, -0.025821567184868312, -0.05804944918269203, -0.15999798908430551, -0.21250571565968648, 0.3119822669352981, 0.00992563003452406, 0.2606522255000614, 0.025841585360467434, 0.04090719490888573, 0.007255457687590804, -0.02071478057297922, -0.07560640920308374, -0.19494282258376536, 0.08460998527173486, 0.30728531471631004, 0.06059189937520949, 0.24426596614399126, -0.3674724751462539, -0.17536260197826084, 0.06253679108728344, 0.20878222741718802, 0.07836807097995742, -0.022917463115993, -0.2571974985478889, 0.005591181548134911, -0.19571155420548858, -0.21660996663073698, -0.2310551555383773, -0.019294661735849723, 0.039317364030561984, -0.30839307990279935, 0.07736498715239577, -0.014912096858911572, 0.06949439475401527, 0.004939907895112854, -0.07302857103447119, 0.0632291267714685, 0.10109057382103942, 0.034410484601920914, 0.07441629075356537, 0.06198978202550539, -0.10702973724165488, -0.10741390795834983, 0.35022673651221253, -0.07265440228262118, -0.1688670296000228, 0.15276741048409825, -0.18527962013724306, -0.14896203574857542, 0.13049987329702292, 0.08585562368943578, 0.13237016850284167, -0.13858375170356815, 0.09717975059923317, 0.02049638141789252, 0.11771217964234806, 0.09354070926617299, -0.01902100627997979, 0.16383263682503077, 0.09218420910072468, -0.013292240551007646, 0.21045055009779476, 0.008122688035170238, -0.1621306765735859, -0.2926112756044382, -0.161939505434462, -0.1986519507126927, 0.02495652242075829, -0.11851527204770329, -0.21837560916762977, 0.45476644356690704, 0.17118093242780083, 0.14318900313117497, 0.061514144626978254, 0.2591647387803754, 0.1928825505787418, 0.00851386348229079, -0.0038761274179532415, 0.22130224138963966, 0.16509385005615296, 0.08605393370879548, -0.2106012395128519, 0.0013529295323505288, 0.19819673470975388]
|
1,803.04883
|
Melting probe technology for subsurface exploration of extraterrestrial
ice - Critical refreezing length and the role of gravity
|
The 'Ocean Worlds' of our Solar System are covered with ice, hence the water
is not directly accessible. Using melting probe technology is one of the
promising technological approaches to reach those scientifically interesting
water reservoirs. Melting probes basically consist of a heated melting head on
top of an elongated body that contains the scientific payload. The traditional
engineering approach to design such melting probes starts from a global energy
balance around the melting head and quantifies the power necessary to sustain a
specific melting velocity while preventing the probe from refreezing and stall
in the channel. Though this approach is sufficient to design simple melting
probes for terrestrial applications, it is too simplistic to study the probe's
performance for environmental conditions found on some of the Ocean's Worlds,
e.g. a lower value of the gravitational acceleration. This will be important,
however, when designing exploration technologies for extraterrestrial purposes.
We tackle the problem by explicitly modeling the physical processes in the thin
melt film between the probe and the underlying ice. Our model allows to study
melting regimes on bodies of different gravitational acceleration, and we
explicitly compare melting regimes on Europa, Enceladus and Mars. In addition
to that, our model allows to quantify the heat losses due to convective
transport around the melting probe. We discuss to which extent these heat
losses can be utilized to avoid the necessity of a side wall heating system to
prevent stall, and introduce the notion of the 'Critical Refreezing Length'.
Our results allow to draw important conclusions towards the design of melting
probe technology for future missions to icy bodies in our Solar System.
|
physics.flu-dyn
|
the ocean worlds of our solar system are covered with ice hence the water is not directly accessible using melting probe technology is one of the promising technological approaches to reach those scientifically interesting water reservoirs melting probes basically consist of a heated melting head on top of an elongated body that contains the scientific payload the traditional engineering approach to design such melting probes starts from a global energy balance around the melting head and quantifies the power necessary to sustain a specific melting velocity while preventing the probe from refreezing and stall in the channel though this approach is sufficient to design simple melting probes for terrestrial applications it is too simplistic to study the probes performance for environmental conditions found on some of the oceans worlds eg a lower value of the gravitational acceleration this will be important however when designing exploration technologies for extraterrestrial purposes we tackle the problem by explicitly modeling the physical processes in the thin melt film between the probe and the underlying ice our model allows to study melting regimes on bodies of different gravitational acceleration and we explicitly compare melting regimes on europa enceladus and mars in addition to that our model allows to quantify the heat losses due to convective transport around the melting probe we discuss to which extent these heat losses can be utilized to avoid the necessity of a side wall heating system to prevent stall and introduce the notion of the critical refreezing length our results allow to draw important conclusions towards the design of melting probe technology for future missions to icy bodies in our solar system
|
[['the', 'ocean', 'worlds', 'of', 'our', 'solar', 'system', 'are', 'covered', 'with', 'ice', 'hence', 'the', 'water', 'is', 'not', 'directly', 'accessible', 'using', 'melting', 'probe', 'technology', 'is', 'one', 'of', 'the', 'promising', 'technological', 'approaches', 'to', 'reach', 'those', 'scientifically', 'interesting', 'water', 'reservoirs', 'melting', 'probes', 'basically', 'consist', 'of', 'a', 'heated', 'melting', 'head', 'on', 'top', 'of', 'an', 'elongated', 'body', 'that', 'contains', 'the', 'scientific', 'payload', 'the', 'traditional', 'engineering', 'approach', 'to', 'design', 'such', 'melting', 'probes', 'starts', 'from', 'a', 'global', 'energy', 'balance', 'around', 'the', 'melting', 'head', 'and', 'quantifies', 'the', 'power', 'necessary', 'to', 'sustain', 'a', 'specific', 'melting', 'velocity', 'while', 'preventing', 'the', 'probe', 'from', 'refreezing', 'and', 'stall', 'in', 'the', 'channel', 'though', 'this', 'approach', 'is', 'sufficient', 'to', 'design', 'simple', 'melting', 'probes', 'for', 'terrestrial', 'applications', 'it', 'is', 'too', 'simplistic', 'to', 'study', 'the', 'probes', 'performance', 'for', 'environmental', 'conditions', 'found', 'on', 'some', 'of', 'the', 'oceans', 'worlds', 'eg', 'a', 'lower', 'value', 'of', 'the', 'gravitational', 'acceleration', 'this', 'will', 'be', 'important', 'however', 'when', 'designing', 'exploration', 'technologies', 'for', 'extraterrestrial', 'purposes', 'we', 'tackle', 'the', 'problem', 'by', 'explicitly', 'modeling', 'the', 'physical', 'processes', 'in', 'the', 'thin', 'melt', 'film', 'between', 'the', 'probe', 'and', 'the', 'underlying', 'ice', 'our', 'model', 'allows', 'to', 'study', 'melting', 'regimes', 'on', 'bodies', 'of', 'different', 'gravitational', 'acceleration', 'and', 'we', 'explicitly', 'compare', 'melting', 'regimes', 'on', 'europa', 'enceladus', 'and', 'mars', 'in', 'addition', 'to', 'that', 'our', 'model', 'allows', 'to', 'quantify', 'the', 'heat', 'losses', 'due', 'to', 'convective', 'transport', 'around', 'the', 'melting', 'probe', 'we', 'discuss', 'to', 'which', 'extent', 'these', 'heat', 'losses', 'can', 'be', 'utilized', 'to', 'avoid', 'the', 'necessity', 'of', 'a', 'side', 'wall', 'heating', 'system', 'to', 'prevent', 'stall', 'and', 'introduce', 'the', 'notion', 'of', 'the', 'critical', 'refreezing', 'length', 'our', 'results', 'allow', 'to', 'draw', 'important', 'conclusions', 'towards', 'the', 'design', 'of', 'melting', 'probe', 'technology', 'for', 'future', 'missions', 'to', 'icy', 'bodies', 'in', 'our', 'solar', 'system']]
|
[-0.07512858197836014, 0.1496773427397784, -0.0946715105246232, 0.059881884143953144, -0.0809218232470277, -0.11016379737617064, 0.06161243462103063, 0.32757121441296905, -0.26935406592469113, -0.31703988718971443, 0.10635838626972947, -0.2789895466499087, -0.09681189274763657, 0.22370584526909035, -0.060368493996901744, 0.04164289916105404, 0.0572778867704876, -0.024062519619987784, -0.01977666309561327, -0.19073859160605078, 0.2612317542790312, 0.10601222269264433, 0.2652219782056123, 0.12602753379392465, 0.0562270469372914, -0.0736144658885143, 0.01663244220424745, -0.01315474119859145, -0.18620804133276098, 0.0906858211310464, 0.25409875524843195, 0.10947539395248682, 0.2425591385776095, -0.4783393367782564, -0.27212593016926856, 0.06785128242678612, 0.1042906366117356, 0.09424370942895835, -0.025071469158694314, -0.23460126154617789, 0.023966500345362445, -0.1363164493282324, -0.16402952440737006, -0.05431709352534894, 0.008002950943431215, -0.009178374041178305, -0.24324124060619987, 0.04519771435469225, 0.03872773800214739, 0.04120833325192935, -0.09333806391120614, -0.10160967278994469, -0.04041892593993586, 0.13743007156721004, 0.049514438077013063, 0.0058185448549064695, 0.23928493200390435, -0.1326914479080134, -0.0507707404814188, 0.4290472120868371, -0.03302331150317674, -0.13907858393641243, 0.26416716708905263, -0.15627674123457194, -0.08556314073211979, 0.1696378388459219, 0.2002835285715906, 0.08692905014707802, -0.16197904450623088, -0.02418536536339054, 0.02479085279885433, 0.14692622634303168, 0.0873794777880368, 0.007397830517113428, 0.3175539259091773, 0.2440446991848362, 0.07298153366462108, 0.1554236352789945, -0.11438260363052798, -0.09749217737835887, -0.25113060229170303, -0.16380683068007998, -0.14018797212937736, 0.03306076211110314, -0.05471706924832046, -0.1399850979585822, 0.3368845241964343, 0.24152890866480448, 0.14150487196713904, -0.014094186113438541, 0.33994351979302284, 0.011444873543094966, 0.08311275886851088, 0.05158436793991474, 0.2758211492521642, 0.08970312829435845, 0.15765757231742206, -0.2449394849485115, 0.11628263757130994, 0.013888021433719104]
|
1,803.04884
|
IDEL: In-Database Entity Linking with Neural Embeddings
|
We present a novel architecture, In-Database Entity Linking (IDEL), in which
we integrate the analytics-optimized RDBMS MonetDB with neural text mining
abilities. Our system design abstracts core tasks of most neural entity linking
systems for MonetDB. To the best of our knowledge, this is the first defacto
implemented system integrating entity-linking in a database. We leverage the
ability of MonetDB to support in-database-analytics with user defined functions
(UDFs) implemented in Python. These functions call machine learning libraries
for neural text mining, such as TensorFlow. The system achieves zero cost for
data shipping and transformation by utilizing MonetDB's ability to embed Python
processes in the database kernel and exchange data in NumPy arrays. IDEL
represents text and relational data in a joint vector space with neural
embeddings and can compensate errors with ambiguous entity representations. For
detecting matching entities, we propose a novel similarity function based on
joint neural embeddings which are learned via minimizing pairwise contrastive
ranking loss. This function utilizes a high dimensional index structures for
fast retrieval of matching entities. Our first implementation and experiments
using the WebNLG corpus show the effectiveness and the potentials of IDEL.
|
cs.DB cs.CL cs.NE
|
we present a novel architecture indatabase entity linking idel in which we integrate the analyticsoptimized rdbms monetdb with neural text mining abilities our system design abstracts core tasks of most neural entity linking systems for monetdb to the best of our knowledge this is the first defacto implemented system integrating entitylinking in a database we leverage the ability of monetdb to support indatabaseanalytics with user defined functions udfs implemented in python these functions call machine learning libraries for neural text mining such as tensorflow the system achieves zero cost for data shipping and transformation by utilizing monetdbs ability to embed python processes in the database kernel and exchange data in numpy arrays idel represents text and relational data in a joint vector space with neural embeddings and can compensate errors with ambiguous entity representations for detecting matching entities we propose a novel similarity function based on joint neural embeddings which are learned via minimizing pairwise contrastive ranking loss this function utilizes a high dimensional index structures for fast retrieval of matching entities our first implementation and experiments using the webnlg corpus show the effectiveness and the potentials of idel
|
[['we', 'present', 'a', 'novel', 'architecture', 'indatabase', 'entity', 'linking', 'idel', 'in', 'which', 'we', 'integrate', 'the', 'analyticsoptimized', 'rdbms', 'monetdb', 'with', 'neural', 'text', 'mining', 'abilities', 'our', 'system', 'design', 'abstracts', 'core', 'tasks', 'of', 'most', 'neural', 'entity', 'linking', 'systems', 'for', 'monetdb', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'defacto', 'implemented', 'system', 'integrating', 'entitylinking', 'in', 'a', 'database', 'we', 'leverage', 'the', 'ability', 'of', 'monetdb', 'to', 'support', 'indatabaseanalytics', 'with', 'user', 'defined', 'functions', 'udfs', 'implemented', 'in', 'python', 'these', 'functions', 'call', 'machine', 'learning', 'libraries', 'for', 'neural', 'text', 'mining', 'such', 'as', 'tensorflow', 'the', 'system', 'achieves', 'zero', 'cost', 'for', 'data', 'shipping', 'and', 'transformation', 'by', 'utilizing', 'monetdbs', 'ability', 'to', 'embed', 'python', 'processes', 'in', 'the', 'database', 'kernel', 'and', 'exchange', 'data', 'in', 'numpy', 'arrays', 'idel', 'represents', 'text', 'and', 'relational', 'data', 'in', 'a', 'joint', 'vector', 'space', 'with', 'neural', 'embeddings', 'and', 'can', 'compensate', 'errors', 'with', 'ambiguous', 'entity', 'representations', 'for', 'detecting', 'matching', 'entities', 'we', 'propose', 'a', 'novel', 'similarity', 'function', 'based', 'on', 'joint', 'neural', 'embeddings', 'which', 'are', 'learned', 'via', 'minimizing', 'pairwise', 'contrastive', 'ranking', 'loss', 'this', 'function', 'utilizes', 'a', 'high', 'dimensional', 'index', 'structures', 'for', 'fast', 'retrieval', 'of', 'matching', 'entities', 'our', 'first', 'implementation', 'and', 'experiments', 'using', 'the', 'webnlg', 'corpus', 'show', 'the', 'effectiveness', 'and', 'the', 'potentials', 'of', 'idel']]
|
[-0.07130442877375597, -0.034821299946791416, -0.030805948512578334, 0.06568958881071996, -0.16191797801985633, -0.1613215159020714, 0.04475579849393988, 0.44293584382614576, -0.3040921988601268, -0.3207525020213546, 0.043698838309108, -0.31175696409332593, -0.17144292110728251, 0.17989692638149937, -0.08577138372269032, 0.10975933145335247, 0.12404761473220345, 0.04511516386315831, -0.05217267585528158, -0.24808995352705587, 0.3236583976131688, 0.045816525248055524, 0.3380273582111742, 0.005268012663047459, 0.15762995430582982, 0.02425075104283924, -0.046967553295748865, -0.054608317497469534, -0.02598123319346357, 0.22765568833596803, 0.3535306622186122, 0.2807955287094857, 0.2961513310809292, -0.3881309307809617, -0.1908912894012394, 0.0628050384413753, 0.14001032956309517, 0.0769546100076892, -0.04743306627560004, -0.3434506423821723, 0.0869093175134244, -0.21543979944560576, 0.04828348113979037, -0.18221808770998707, -0.0046526230884262835, 0.039879583839226414, -0.28667643466033044, 0.0019983296283179377, 0.07778348585565549, 0.08616656028237697, -0.03992204189684393, -0.1145986845060818, 0.04290394835753014, 0.15715207805907405, -0.029030367350709196, 0.07696892140131141, 0.13057967570132098, -0.13873158368613175, -0.19011253540693607, 0.35974181834608315, -0.08674954430300844, -0.22393730866747932, 0.1700534184199028, 0.01939576947558168, -0.17637355085210624, 0.03852065999211895, 0.2548658704485845, 0.08084454441417915, -0.1946935294951136, 0.03986612536403275, -0.004947819271301095, 0.23518284645019652, 0.0559307179344516, -0.015836014306625804, 0.18069055381709256, 0.26668070411762673, -0.0038688805961125607, 0.16847942098220056, -0.08122940595588975, -0.05636924447277813, -0.20994163648149855, -0.15835579472619135, -0.200644663564005, -0.06947292075114879, -0.11996444361111325, -0.17871221345220062, 0.3732599052877442, 0.199936311997511, 0.18574820649935989, 0.12011290639638901, 0.3385130109416472, 0.015192507951193162, 0.15207740311082957, 0.15721626539236389, 0.08839105151379732, -0.006014309404417872, 0.15521527716443195, -0.12287489497857923, 0.07749606209706414, 0.07431245572059542]
|
1,803.04885
|
First passage upwards for state dependent-killed spectrally negative
L\'evy processes
|
For a spectrally negative L\'evy process (snLp) $X$, killed according to a
rate that is a function $\omega$ of its position, we analyse the exit
probability of the one-sided upwards-passage problem. When $\omega$ is strictly
positive, this problem is related to the determination of the Laplace transform
of the first passage time upwards for $X$ that has been time-changed by the
inverse of the additive functional $\int_0^\cdot \omega(X_u)du$. In particular
our findings thus shed extra light on related results concerning first passage
times upwards (downwards) of spectrally negative positive self-similar Markov
processes (continuous state branching processes).
|
math.PR
|
for a spectrally negative levy process snlp x killed according to a rate that is a function omega of its position we analyse the exit probability of the onesided upwardspassage problem when omega is strictly positive this problem is related to the determination of the laplace transform of the first passage time upwards for x that has been timechanged by the inverse of the additive functional int_0cdot omegax_udu in particular our findings thus shed extra light on related results concerning first passage times upwards downwards of spectrally negative positive selfsimilar markov processes continuous state branching processes
|
[['for', 'a', 'spectrally', 'negative', 'levy', 'process', 'snlp', 'x', 'killed', 'according', 'to', 'a', 'rate', 'that', 'is', 'a', 'function', 'omega', 'of', 'its', 'position', 'we', 'analyse', 'the', 'exit', 'probability', 'of', 'the', 'onesided', 'upwardspassage', 'problem', 'when', 'omega', 'is', 'strictly', 'positive', 'this', 'problem', 'is', 'related', 'to', 'the', 'determination', 'of', 'the', 'laplace', 'transform', 'of', 'the', 'first', 'passage', 'time', 'upwards', 'for', 'x', 'that', 'has', 'been', 'timechanged', 'by', 'the', 'inverse', 'of', 'the', 'additive', 'functional', 'int_0cdot', 'omegax_udu', 'in', 'particular', 'our', 'findings', 'thus', 'shed', 'extra', 'light', 'on', 'related', 'results', 'concerning', 'first', 'passage', 'times', 'upwards', 'downwards', 'of', 'spectrally', 'negative', 'positive', 'selfsimilar', 'markov', 'processes', 'continuous', 'state', 'branching', 'processes']]
|
[-0.08101942382586942, 0.17895112934205284, -0.10257990503723317, 0.06213188775827222, -0.08600418956236953, -0.1267318036605386, 0.1070701360821407, 0.405463354146861, -0.333248249691059, -0.1536325767012115, 0.14610147856341854, -0.2728518801840379, -0.10053847690033628, 0.1837934904132395, -0.05542106929413499, 0.07651897426385017, 0.018452240998777462, 0.046145193268881834, 0.0038594875504520346, -0.1844165707403358, 0.32754994952615274, 0.026466832724102635, 0.1949769456677654, 0.05262327295024582, 0.13077075778942635, -0.02518676096038457, -0.07786528443164648, -0.0629008982084881, -0.1569976516384099, 0.08992487971641203, 0.185208508328713, 0.07523152026337908, 0.3369501086665278, -0.3647578334772682, -0.21481332283447238, 0.15335314357256952, 0.11484667933744161, 0.010332685082833817, -0.041144811643654126, -0.33265043430505914, 0.08964937285302167, -0.06770745784470296, -0.1534195756812164, 0.024434851720295053, 0.11147822657639676, 0.027463085325855882, -0.278843351392115, 0.10578916714269113, 0.12671113983192978, -0.05870709782763523, -0.06879558228327834, -0.13949550857192816, -0.007231804155843689, 0.1173962455510999, 0.09102938652374197, 0.04426246428827537, 0.1312593275017323, -0.06046147968253478, -0.161327685997326, 0.3153306916950548, -0.10866549498639366, -0.21393455201363626, 0.10555667649122312, -0.23199071260070073, -0.12700586839321445, 0.2057806295639974, 0.19095007202370054, 0.1510298173983601, -0.13048953715383022, 0.1276090165372304, -0.03762232668281711, 0.12589150231252325, 0.1021231676828354, -0.048444647450951187, 0.148358965268423, 0.13402425666696371, 0.12679806364541676, 0.14319680184571745, -0.044237063392659925, -0.12768179669906882, -0.3225500712646766, -0.17999475280892976, -0.17218226963218222, 0.12825665853551013, -0.09002501367928183, -0.177395671031418, 0.3426141978459472, 0.09176526863643146, 0.24681770752005755, 0.1119945061175113, 0.23870532046706278, 0.23054748353736593, -0.07065597606050049, 0.02009179685859287, 0.11145670392966651, 0.16909409092957192, 0.11177130372937213, -0.2054256941637698, 0.13580250182743878, 0.04921395680371751]
|
1,803.04886
|
Examples of hypergeometric twistor $\mathcal{D}$-modules
|
We show that certain one-dimensional hypergeometric differential systems
underlie objects of the category of irregular mixed Hodge modules, which was
recently introduced by Sabbah, and compute the irregular Hodge filtration for
them. We also provide a comparison theorem between two different types of
Fourier-Laplace transformation for algebraic integrable twistor
$\mathcal{D}$-modules.
|
math.AG
|
we show that certain onedimensional hypergeometric differential systems underlie objects of the category of irregular mixed hodge modules which was recently introduced by sabbah and compute the irregular hodge filtration for them we also provide a comparison theorem between two different types of fourierlaplace transformation for algebraic integrable twistor mathcaldmodules
|
[['we', 'show', 'that', 'certain', 'onedimensional', 'hypergeometric', 'differential', 'systems', 'underlie', 'objects', 'of', 'the', 'category', 'of', 'irregular', 'mixed', 'hodge', 'modules', 'which', 'was', 'recently', 'introduced', 'by', 'sabbah', 'and', 'compute', 'the', 'irregular', 'hodge', 'filtration', 'for', 'them', 'we', 'also', 'provide', 'a', 'comparison', 'theorem', 'between', 'two', 'different', 'types', 'of', 'fourierlaplace', 'transformation', 'for', 'algebraic', 'integrable', 'twistor', 'mathcaldmodules']]
|
[-0.15715782310813664, 0.012115872874855995, -0.16931897665373982, 0.17609636180102825, -0.12404734667390585, -0.17629108943976463, -0.07760812943801283, 0.333415087852627, -0.3526174784451723, -0.22350639464333655, 0.09651125585660339, -0.15851787827908992, -0.26820858113467694, 0.21548776604235173, -0.1859120018966496, 0.00824798371642828, 0.05950500466860831, 0.0034016090777004137, -0.11096129333134741, -0.2996964001655579, 0.4629984365403652, -0.0840562766417861, 0.24839676364324986, -0.03539046194404363, 0.16246476113796235, 0.03147856918745674, -0.08554810748435557, -0.0731599617190659, -0.14152785091966508, 0.16431161849759518, 0.33679499473422764, 0.018784104268997907, 0.13094871497014537, -0.4289531583711505, -0.11721107993274928, 0.14750573495402933, 0.08711132429540157, 0.04478357906220481, -0.008941027335822582, -0.2958556543663144, 0.0754169068322517, -0.18574621517211198, -0.16535584907047451, -0.13104914408177137, 0.09359788557514548, 0.09352874644100666, -0.18648423353210092, 0.01599741260135488, 0.07298162692692131, 0.1281613565608859, -0.0962240070849657, -0.11506587136304006, -0.08969706032425165, 0.03337407254613936, -0.04646135900169611, -0.054213715465739366, 0.07054720471613109, -0.06346245625056327, -0.1439842671342194, 0.28368408780544996, -0.03787477966398001, -0.22086840270087124, 0.16517107658088206, -0.11622695990838111, -0.22919634893536567, 0.1368575343117118, 0.03971779551357031, 0.1411307828873396, -0.08711930589750409, 0.1365052380959969, -0.12926616424694656, 0.038348120445734823, 0.18492449866607785, 0.03854666673578322, 0.15328362276777624, 0.08807631637901067, 0.003245356325060129, 0.16032093153335153, -0.030360011165612377, -0.1300234608631581, -0.3195860869809985, -0.24360566080547869, -0.07137787301879144, 0.10171690099406988, -0.10502064525120659, -0.1941669893078506, 0.4162457270361483, 0.03360362906940281, 0.15159919349476694, 0.1405363195366226, 0.19339664737228304, 0.12068626921623946, 0.05054694714024663, -0.0248840157315135, 0.09113550081849098, 0.27069045465905217, 0.04455712914932519, -0.14871114753186704, -0.05554339953698218, 0.23070563757792115]
|
1,803.04887
|
Sub-gap optical response across the structural phase transition in van
der Waals layered \alpha-RuCl$_3$
|
We report magnetic, thermodynamic, thermal expansion, and on detailed optical
experiments on the layered compound $\alpha$-RuCl$_3$ focusing on the THz and
sub-gap optical response across the structural phase transition from the
monoclinic high-temperature to the rhombohedral low-temperature structure,
where the stacking sequence of the molecular layers is changed. This type of
phase transition is characteristic for a variety of tri-halides crystallizing
in a layered honeycomb-type structure and so far is unique, as the
low-temperature phase exhibits the higher symmetry. One motivation is to
unravel the microscopic nature of spin-orbital excitations via a study of
temperature and symmetry-induced changes. We document a number of highly
unusual findings: A characteristic two-step hysteresis of the structural phase
transition, accompanied by a dramatic change of the reflectivity. An electronic
excitation, which appears in a narrow temperature range just across the
structural phase transition, and a complex dielectric loss spectrum in the THz
regime, which could indicate remnants of Kitaev physics. Despite significant
symmetry changes across the monoclinic to rhombohedral phase transition, phonon
eigenfrequencies and the majority of spin-orbital excitations are not strongly
influenced. Obviously, the symmetry of the single molecular layers determine
the eigenfrequencies of most of these excitations. Finally, from this combined
terahertz, far- and mid-infrared study we try to shed some light on the so far
unsolved low energy (< 1eV) electronic structure of the ruthenium $4d^5$
electrons in $\alpha$-RuCl$_3$.
|
cond-mat.str-el
|
we report magnetic thermodynamic thermal expansion and on detailed optical experiments on the layered compound alpharucl_3 focusing on the thz and subgap optical response across the structural phase transition from the monoclinic hightemperature to the rhombohedral lowtemperature structure where the stacking sequence of the molecular layers is changed this type of phase transition is characteristic for a variety of trihalides crystallizing in a layered honeycombtype structure and so far is unique as the lowtemperature phase exhibits the higher symmetry one motivation is to unravel the microscopic nature of spinorbital excitations via a study of temperature and symmetryinduced changes we document a number of highly unusual findings a characteristic twostep hysteresis of the structural phase transition accompanied by a dramatic change of the reflectivity an electronic excitation which appears in a narrow temperature range just across the structural phase transition and a complex dielectric loss spectrum in the thz regime which could indicate remnants of kitaev physics despite significant symmetry changes across the monoclinic to rhombohedral phase transition phonon eigenfrequencies and the majority of spinorbital excitations are not strongly influenced obviously the symmetry of the single molecular layers determine the eigenfrequencies of most of these excitations finally from this combined terahertz far and midinfrared study we try to shed some light on the so far unsolved low energy 1ev electronic structure of the ruthenium 4d5 electrons in alpharucl_3
|
[['we', 'report', 'magnetic', 'thermodynamic', 'thermal', 'expansion', 'and', 'on', 'detailed', 'optical', 'experiments', 'on', 'the', 'layered', 'compound', 'alpharucl_3', 'focusing', 'on', 'the', 'thz', 'and', 'subgap', 'optical', 'response', 'across', 'the', 'structural', 'phase', 'transition', 'from', 'the', 'monoclinic', 'hightemperature', 'to', 'the', 'rhombohedral', 'lowtemperature', 'structure', 'where', 'the', 'stacking', 'sequence', 'of', 'the', 'molecular', 'layers', 'is', 'changed', 'this', 'type', 'of', 'phase', 'transition', 'is', 'characteristic', 'for', 'a', 'variety', 'of', 'trihalides', 'crystallizing', 'in', 'a', 'layered', 'honeycombtype', 'structure', 'and', 'so', 'far', 'is', 'unique', 'as', 'the', 'lowtemperature', 'phase', 'exhibits', 'the', 'higher', 'symmetry', 'one', 'motivation', 'is', 'to', 'unravel', 'the', 'microscopic', 'nature', 'of', 'spinorbital', 'excitations', 'via', 'a', 'study', 'of', 'temperature', 'and', 'symmetryinduced', 'changes', 'we', 'document', 'a', 'number', 'of', 'highly', 'unusual', 'findings', 'a', 'characteristic', 'twostep', 'hysteresis', 'of', 'the', 'structural', 'phase', 'transition', 'accompanied', 'by', 'a', 'dramatic', 'change', 'of', 'the', 'reflectivity', 'an', 'electronic', 'excitation', 'which', 'appears', 'in', 'a', 'narrow', 'temperature', 'range', 'just', 'across', 'the', 'structural', 'phase', 'transition', 'and', 'a', 'complex', 'dielectric', 'loss', 'spectrum', 'in', 'the', 'thz', 'regime', 'which', 'could', 'indicate', 'remnants', 'of', 'kitaev', 'physics', 'despite', 'significant', 'symmetry', 'changes', 'across', 'the', 'monoclinic', 'to', 'rhombohedral', 'phase', 'transition', 'phonon', 'eigenfrequencies', 'and', 'the', 'majority', 'of', 'spinorbital', 'excitations', 'are', 'not', 'strongly', 'influenced', 'obviously', 'the', 'symmetry', 'of', 'the', 'single', 'molecular', 'layers', 'determine', 'the', 'eigenfrequencies', 'of', 'most', 'of', 'these', 'excitations', 'finally', 'from', 'this', 'combined', 'terahertz', 'far', 'and', 'midinfrared', 'study', 'we', 'try', 'to', 'shed', 'some', 'light', 'on', 'the', 'so', 'far', 'unsolved', 'low', 'energy', '1ev', 'electronic', 'structure', 'of', 'the', 'ruthenium', '4d5', 'electrons', 'in', 'alpharucl_3']]
|
[-0.16998395164361807, 0.20459430156300504, -0.049651956995990176, -0.004325163416310095, -0.09223017146880635, -0.08930581459767362, 0.11598288767411075, 0.4171351962086913, -0.2863377081255925, -0.2666944855504099, 0.020125907367056377, -0.2967052602451213, -0.16695805862987012, 0.1453726554355104, 0.055614251874198536, -0.0034723621331532754, -0.042807951749565025, -0.02432965646838433, -0.12146926288890944, -0.13821312720940698, 0.2779974337556453, 0.04323806105559027, 0.3189191871490904, 0.08651282475945347, 0.027489251961792093, -0.03836253231149249, 0.11164791166314667, -0.02229144637542674, -0.15332970452302092, 0.04656257306894601, 0.26108342808638474, -0.06456310374842801, 0.17151668602457099, -0.41520368330804264, -0.24149584418597594, 0.029257514748911043, 0.13696142260932942, 0.12961602359569102, -0.07031176904511806, -0.2579353307563574, 0.021227769772645233, -0.12124007034560641, -0.10031251917646516, -0.09929335105833177, -0.051939199600647724, -0.018146426900800743, -0.18318256621104398, 0.08563797312095302, 0.054009567705159474, 0.11747486504730215, -0.10409555310847049, -0.11801775408773334, -0.08160114916049699, 0.06283269229751196, 0.03309741569221397, 0.033648125306007734, 0.15708738119887097, -0.1378383174344165, -0.07191998569811756, 0.4138806865833667, -0.016970429347165437, -0.0100411114730105, 0.1836420725323342, -0.2200487985415179, -0.12661069973591418, 0.22470860820805186, 0.1143796314002786, 0.09722758952163094, -0.11161749305419977, 0.058679099796141915, 0.0009225597789732633, 0.2288901205533615, 0.03240150678800296, 0.11882301424691527, 0.2608192118770948, 0.20945152012623092, -0.016881655996033536, 0.17120183552389695, -0.11408303811272302, -0.07748036299696774, -0.21322302439656224, -0.14600387134251805, -0.21701070196959416, 0.06470735026129865, -0.08084358748143164, -0.23053528811364118, 0.46645930824218734, 0.1209767976209587, 0.193269389029182, -0.09188735142331221, 0.22607734191204762, 0.07821703941555128, 0.06167740770923343, 0.004330371384455572, 0.2900201880055355, 0.16111427159787112, 0.13312744453861194, -0.2997247365360776, 0.08465704633669706, 0.004045990336735606]
|
1,803.04888
|
A look at possible microwave dust emission via AKARI infrared all-sky
surveys
|
The anomalous microwave emission (AME) still lacks a conclusive explanation.
This excess of emission, roughly between 10 and 50 GHz, correlates spatially
with interstellar dust, prompting a "spinning dust" hypothesis: electric dipole
emission by rapidly rotating, small dust grains. The typical peak frequency
range of the AME profile implicates grains on the order of ~1 nm, suggesting
polycyclic aromatic hydrocarbon molecules (PAHs). We compare AKARI/Infrared
Camera (IRC), with its thorough PAH-band coverage, to AME intensity estimates
from the Planck Collaboration, in the {\lambda} Orionis region. We look also at
infrared dust emission from other mid IR and far-IR bands. The results and
discussion contained here apply to an angular scale of approximately 1{\deg}.
In general, our results support an AME-from-dust hypothesis. In {\lambda}
Orionis, we find that certainly dust mass correlates with AME, and that
PAH-related emission in the AKARI/IRC 9 {\mu}m band may correlate slightly more
strongly.
|
astro-ph.GA
|
the anomalous microwave emission ame still lacks a conclusive explanation this excess of emission roughly between 10 and 50 ghz correlates spatially with interstellar dust prompting a spinning dust hypothesis electric dipole emission by rapidly rotating small dust grains the typical peak frequency range of the ame profile implicates grains on the order of 1 nm suggesting polycyclic aromatic hydrocarbon molecules pahs we compare akariinfrared camera irc with its thorough pahband coverage to ame intensity estimates from the planck collaboration in the lambda orionis region we look also at infrared dust emission from other mid ir and farir bands the results and discussion contained here apply to an angular scale of approximately 1deg in general our results support an amefromdust hypothesis in lambda orionis we find that certainly dust mass correlates with ame and that pahrelated emission in the akariirc 9 mum band may correlate slightly more strongly
|
[['the', 'anomalous', 'microwave', 'emission', 'ame', 'still', 'lacks', 'a', 'conclusive', 'explanation', 'this', 'excess', 'of', 'emission', 'roughly', 'between', '10', 'and', '50', 'ghz', 'correlates', 'spatially', 'with', 'interstellar', 'dust', 'prompting', 'a', 'spinning', 'dust', 'hypothesis', 'electric', 'dipole', 'emission', 'by', 'rapidly', 'rotating', 'small', 'dust', 'grains', 'the', 'typical', 'peak', 'frequency', 'range', 'of', 'the', 'ame', 'profile', 'implicates', 'grains', 'on', 'the', 'order', 'of', '1', 'nm', 'suggesting', 'polycyclic', 'aromatic', 'hydrocarbon', 'molecules', 'pahs', 'we', 'compare', 'akariinfrared', 'camera', 'irc', 'with', 'its', 'thorough', 'pahband', 'coverage', 'to', 'ame', 'intensity', 'estimates', 'from', 'the', 'planck', 'collaboration', 'in', 'the', 'lambda', 'orionis', 'region', 'we', 'look', 'also', 'at', 'infrared', 'dust', 'emission', 'from', 'other', 'mid', 'ir', 'and', 'farir', 'bands', 'the', 'results', 'and', 'discussion', 'contained', 'here', 'apply', 'to', 'an', 'angular', 'scale', 'of', 'approximately', '1deg', 'in', 'general', 'our', 'results', 'support', 'an', 'amefromdust', 'hypothesis', 'in', 'lambda', 'orionis', 'we', 'find', 'that', 'certainly', 'dust', 'mass', 'correlates', 'with', 'ame', 'and', 'that', 'pahrelated', 'emission', 'in', 'the', 'akariirc', '9', 'mum', 'band', 'may', 'correlate', 'slightly', 'more', 'strongly']]
|
[-0.03676867102749633, 0.13044735343153238, -0.01888866565203811, 0.0754243438666342, -0.04148189406778204, -0.0982695337598633, 0.03846044381538227, 0.4770270104022467, -0.1641218341912513, -0.3049350675476128, 0.020724031587820244, -0.32683834419521973, -0.014036973313211578, 0.13150744632760394, -0.02746896196195811, -0.06673027719697941, -0.03355809055549437, -0.15185388174124878, 0.05627775059977853, -0.16577382181286301, 0.27287884882638513, 0.13812894062840775, 0.21493212992089405, 0.0875099043306326, 0.00851699773163203, -0.13475176391601626, -0.10576142546121184, -0.04162426645012751, -0.14526262451236358, 0.10079719916533053, 0.23054115331336245, 0.07801350212834571, 0.13587184937843058, -0.33834492776396186, -0.21597620642071028, 0.0832537449063089, 0.15022291495681625, 0.047507940549148274, -0.00975448001155786, -0.255352928842201, 0.017426813400848066, -0.1615153220354592, -0.20278932209356293, 0.07764499043736428, 0.112130075489005, -0.03829676020341887, -0.23172969368528828, 0.10507157612540154, 0.023500498236724725, 0.13459010540239819, -0.1617539933673744, -0.14628902255885992, -0.07310410858010746, 0.01293774706643228, 0.033465028783523365, 0.09442490866018638, 0.23953505495103866, -0.12754633638701618, -0.05294472232703375, 0.3821161731615924, -0.16959692376477592, 6.4349720535213e-05, 0.24037954165825098, -0.2878982854759072, -0.16941709368017643, 0.26695102665012016, 0.06854042891821224, 0.0904685051454716, -0.14371791290524352, 0.023001756780615, -0.06689415919938929, 0.2953834265138801, 0.09781102008148007, 0.14578822541029882, 0.35761359050967223, 0.10072047089558248, 0.02472697272386453, 0.155187247388387, -0.24769061280586693, -0.014176390849234064, -0.26168527998897717, -0.09230560366995633, -0.14961307696768478, 0.1052923258138846, -0.14366594165657673, -0.11144959363346435, 0.2902612043344312, 0.14560680036921028, 0.18093187900336638, 0.07235585339407258, 0.2881125578599382, 0.039518319827038795, 0.10286644499451728, 0.1275071830756656, 0.30142619425258665, 0.12327329549429722, 0.12416671847682191, -0.21842932861859668, 0.02532404149589065, -0.09800509639460696]
|
1,803.04889
|
Planar anti-Ramsey numbers of matchings
|
Given a positive integer $n$ and a planar graph $H$, let $\mathcal{T}_n(H)$
be the family of all plane triangulations $T$ on $n$ vertices such that $T$
contains a subgraph isomorphic to $H$. The planar anti-Ramsey number of $H$,
denoted $ar_{_\mathcal{P}}(n, H)$, is the maximum number of colors in an
edge-coloring of a plane triangulation $T\in \mathcal{T}_n(H)$ such that $T$
contains no rainbow copy of $H$. In this paper we study planar anti-Ramsey
numbers of matchings. For all $t\ge1$, let $M_t$ denote a matching of size $t$.
We prove that for all $t\ge6$ and $n\ge 3t-6$, $2n+3t-15\le
ar_{_{\mathcal{P}}}(n, {M}_t)\le 2n+4t-14$, which significantly improves the
existing lower and upper bounds for $ar_{_\mathcal{P}}(n, M_t)$. It seems that
for each $t\ge6$, the lower bound we obtained is the exact value of
$ar_{_{\mathcal{P}}}(n, {M}_t)$ for sufficiently large $n$. This is indeed the
case for $M_6$. We prove that $ar_{_\mathcal{P}}(n, M_6)=2n+3$ for all
$n\ge30$.
|
math.CO
|
given a positive integer n and a planar graph h let mathcalt_nh be the family of all plane triangulations t on n vertices such that t contains a subgraph isomorphic to h the planar antiramsey number of h denoted ar__mathcalpn h is the maximum number of colors in an edgecoloring of a plane triangulation tin mathcalt_nh such that t contains no rainbow copy of h in this paper we study planar antiramsey numbers of matchings for all tge1 let m_t denote a matching of size t we prove that for all tge6 and nge 3t6 2n3t15le ar__mathcalpn m_tle 2n4t14 which significantly improves the existing lower and upper bounds for ar__mathcalpn m_t it seems that for each tge6 the lower bound we obtained is the exact value of ar__mathcalpn m_t for sufficiently large n this is indeed the case for m_6 we prove that ar__mathcalpn m_62n3 for all nge30
|
[['given', 'a', 'positive', 'integer', 'n', 'and', 'a', 'planar', 'graph', 'h', 'let', 'mathcalt_nh', 'be', 'the', 'family', 'of', 'all', 'plane', 'triangulations', 't', 'on', 'n', 'vertices', 'such', 'that', 't', 'contains', 'a', 'subgraph', 'isomorphic', 'to', 'h', 'the', 'planar', 'antiramsey', 'number', 'of', 'h', 'denoted', 'ar__mathcalpn', 'h', 'is', 'the', 'maximum', 'number', 'of', 'colors', 'in', 'an', 'edgecoloring', 'of', 'a', 'plane', 'triangulation', 'tin', 'mathcalt_nh', 'such', 'that', 't', 'contains', 'no', 'rainbow', 'copy', 'of', 'h', 'in', 'this', 'paper', 'we', 'study', 'planar', 'antiramsey', 'numbers', 'of', 'matchings', 'for', 'all', 'tge1', 'let', 'm_t', 'denote', 'a', 'matching', 'of', 'size', 't', 'we', 'prove', 'that', 'for', 'all', 'tge6', 'and', 'nge', '3t6', '2n3t15le', 'ar__mathcalpn', 'm_tle', '2n4t14', 'which', 'significantly', 'improves', 'the', 'existing', 'lower', 'and', 'upper', 'bounds', 'for', 'ar__mathcalpn', 'm_t', 'it', 'seems', 'that', 'for', 'each', 'tge6', 'the', 'lower', 'bound', 'we', 'obtained', 'is', 'the', 'exact', 'value', 'of', 'ar__mathcalpn', 'm_t', 'for', 'sufficiently', 'large', 'n', 'this', 'is', 'indeed', 'the', 'case', 'for', 'm_6', 'we', 'prove', 'that', 'ar__mathcalpn', 'm_62n3', 'for', 'all', 'nge30']]
|
[-0.21249778042088302, 0.18409161351657632, -0.0034562070545753544, 0.010606378165621337, -0.07826740820142014, -0.14250911888174556, 0.04299376280666788, 0.3309536092311249, -0.21285018444218687, -0.3109290983501664, 0.0695338034789196, -0.3451215733419841, -0.0909773052856982, 0.16263733387754206, -0.09047531886157435, 0.0016240879555534519, 0.08023023565011231, 0.11917734280569663, 0.030702223448725547, -0.2745572397279189, 0.24486224933258507, -0.09424159729453198, 0.1426340798112813, 0.0862772766021933, 0.06701943435883281, 0.0495903049251327, 0.050792792805431176, 0.08244013184071584, -0.26741612291019484, 0.050743720812303286, 0.2364052627989891, 0.14286875004001276, 0.19351576918713145, -0.3008171634381296, -0.1257859514435937, 0.2562281256082507, 0.1640383648369658, -0.007791053173361792, -0.017226314173788358, -0.1519181271871506, 0.18823827623101083, -0.08626329411693494, -0.11031542628557539, 0.03156463879580334, 0.15958884940810605, -0.038318159414494644, -0.3621411328203976, -0.009819289297193393, 0.12685220824344687, 0.028113594263731372, 0.05778170676088669, -0.2292829261482759, -0.09473422749466459, 0.07173635170821258, -0.07315803305442695, 0.10713372249271012, -0.013863656187797306, -0.10770147817797998, -0.10736536334963961, 0.33118497437435124, -0.0865318635675374, -0.1622457553166896, 0.08219990675324496, -0.19822024772743838, -0.18622926175331986, 0.12268305373128871, 0.1171360405057039, 0.21326454860669836, -0.06615309284763857, 0.2083770635486154, -0.17149490744046028, 0.12046386475648574, 0.16059392160067046, 0.01817564728496019, 0.0816265386660439, 0.10076182924250376, 0.18831517773313106, 0.15586212293726956, -0.011767324632440339, 0.04316689508547351, -0.3518571144783161, -0.1579918939580085, -0.23618216531738168, 0.12003756111855028, -0.19533704015851416, -0.18709068145507843, 0.3113442819276956, 0.09374331095596959, 0.22661763418492087, 0.15088402594088798, 0.19658435482374378, 0.08227281046467243, 0.03412501519860726, 0.18985488328387515, 0.10429955740183802, 0.15085244032187045, -0.0544750161934644, -0.18313000632226992, 0.027397621873910472, 0.15803554672485506]
|
1,803.0489
|
Complex symmetric differential operators on Fock space
|
The space of entire functions which are integrable with respect to the
Gaussian weight, known also as the Fock space, is one of the preferred
functional Hilbert spaces for modelling and experimenting harmonic analysis,
quantum mechanics or spectral analysis phenomena. This space of entire
functions carries a three parameter family of canonical isometric involutions.
We characterize the linear differential operators acting on Fock space which
are complex symmetric with respect to these conjugations. In parallel, as a
basis of comparison, we discuss the structure of self-adjoint linear
differential operators. The computation of the point spectrum of some of these
operators is carried out in detail.
|
math-ph math.CV math.MP
|
the space of entire functions which are integrable with respect to the gaussian weight known also as the fock space is one of the preferred functional hilbert spaces for modelling and experimenting harmonic analysis quantum mechanics or spectral analysis phenomena this space of entire functions carries a three parameter family of canonical isometric involutions we characterize the linear differential operators acting on fock space which are complex symmetric with respect to these conjugations in parallel as a basis of comparison we discuss the structure of selfadjoint linear differential operators the computation of the point spectrum of some of these operators is carried out in detail
|
[['the', 'space', 'of', 'entire', 'functions', 'which', 'are', 'integrable', 'with', 'respect', 'to', 'the', 'gaussian', 'weight', 'known', 'also', 'as', 'the', 'fock', 'space', 'is', 'one', 'of', 'the', 'preferred', 'functional', 'hilbert', 'spaces', 'for', 'modelling', 'and', 'experimenting', 'harmonic', 'analysis', 'quantum', 'mechanics', 'or', 'spectral', 'analysis', 'phenomena', 'this', 'space', 'of', 'entire', 'functions', 'carries', 'a', 'three', 'parameter', 'family', 'of', 'canonical', 'isometric', 'involutions', 'we', 'characterize', 'the', 'linear', 'differential', 'operators', 'acting', 'on', 'fock', 'space', 'which', 'are', 'complex', 'symmetric', 'with', 'respect', 'to', 'these', 'conjugations', 'in', 'parallel', 'as', 'a', 'basis', 'of', 'comparison', 'we', 'discuss', 'the', 'structure', 'of', 'selfadjoint', 'linear', 'differential', 'operators', 'the', 'computation', 'of', 'the', 'point', 'spectrum', 'of', 'some', 'of', 'these', 'operators', 'is', 'carried', 'out', 'in', 'detail']]
|
[-0.13552091472028266, 0.12153544896947487, -0.07355852147919081, 0.08408342288208327, -0.08511995305750697, -0.0753291019460275, -0.017703218024135346, 0.37606853179278826, -0.29751039232526505, -0.19523192691683236, 0.12075284339620598, -0.27949762192687816, -0.15349218819866933, 0.19754728913262842, -0.02689158929306792, 0.08970109763599578, 0.04229553220350118, 0.061991713324650415, -0.1700327234653135, -0.22195635845751635, 0.44542779436423663, 0.02635074171259822, 0.20192656514367888, -0.04653859529200764, 0.10856667280729328, 0.02584510466272366, -0.09100371415593794, -0.036100130312843245, -0.0972283636441543, 0.16353669245949104, 0.2794359096991164, 0.08232895573601126, 0.24872327831218996, -0.3742410601959342, -0.2077604737664972, 0.1622688487449306, 0.11128139314906937, 0.010792586746226464, 0.022707651731824235, -0.27389766752631184, 0.0015570030934343646, -0.1429816527913014, -0.16166054794476145, -0.14236965394978013, 0.003338873247793388, 0.03745204181898208, -0.243229183969864, 0.031105436828442006, 0.07196822705722991, 0.07296898860839152, -0.09487220621002572, -0.11011827784546074, -0.09219072503259494, 0.0862668736239097, -0.03369904268710386, 0.0220898501308901, 0.1095085227507211, -0.056070820503823816, -0.12198354252392338, 0.3669967929804919, -0.053972768649968896, -0.2935621673374304, 0.12694211459629948, -0.17447836441653117, -0.13805519389875587, 0.07363392690285331, 0.14262874192957367, 0.1392003584830534, -0.1037761540911604, 0.1812498384637625, -0.0651334334874437, 0.12261613364846978, 0.06635023225985823, 0.0947934894955584, 0.12771109071161066, 0.10473466377173152, 0.10108632637365234, 0.14871150014833326, -0.003286340746230313, -0.182512509265715, -0.372827664062026, -0.20193898489787465, -0.13909776766917537, 0.04978311367199889, -0.1008536198197232, -0.21855118831708317, 0.4355634775367521, 0.05646416716100205, 0.2148306482671095, 0.026247779927438215, 0.23213873862155845, 0.14761880370788277, 0.07641379637200207, 0.011134194622614554, 0.1634260136248832, 0.17800573158477034, 0.04490267302663553, -0.17826877981424333, -0.04239657755935609, 0.10706770363751622]
|
1,803.04891
|
MHDSTS: a new explicit numerical scheme for simulations of partially
ionised solar plasma
|
The interaction of plasma with magnetic field in the partially ionised solar
atmosphere is frequently modelled via a single-fluid approximation, which is
valid for the case of a strongly coupled collisional media, such as solar
photosphere and low chromosphere. Under the single-fluid formalism the main
non-ideal effects are described by a series of extra terms in the generalised
induction equation and in the energy conservation equation. These effects are:
Ohmic diffusion, ambipolar diffusion, the Hall effect, and the Biermann battery
effect. From the point of view of the numerical solution of the single-fluid
equations, when ambipolar diffusion or Hall effects dominate can introduce
severe restrictions on the integration time step and can compromise the
stability of the numerical scheme. In this paper we introduce two numerical
schemes to overcome those limitations. The first of them is known as Super
Time-Stepping (STS) and it is designed to overcome the limitations imposed when
the ambipolar diffusion term is dominant. The second scheme is called the Hall
Diffusion Scheme (HDS) and it is used when the Hall term becomes dominant.
These two numerical techniques can be used together by applying Strang operator
splitting. This paper describes the implementation of the STS and HDS schemes
in the single-fluid code Mancha3D. The validation for each of these schemes is
provided by comparing the analytical solution with the numerical one for a
suite of numerical tests.
|
astro-ph.SR
|
the interaction of plasma with magnetic field in the partially ionised solar atmosphere is frequently modelled via a singlefluid approximation which is valid for the case of a strongly coupled collisional media such as solar photosphere and low chromosphere under the singlefluid formalism the main nonideal effects are described by a series of extra terms in the generalised induction equation and in the energy conservation equation these effects are ohmic diffusion ambipolar diffusion the hall effect and the biermann battery effect from the point of view of the numerical solution of the singlefluid equations when ambipolar diffusion or hall effects dominate can introduce severe restrictions on the integration time step and can compromise the stability of the numerical scheme in this paper we introduce two numerical schemes to overcome those limitations the first of them is known as super timestepping sts and it is designed to overcome the limitations imposed when the ambipolar diffusion term is dominant the second scheme is called the hall diffusion scheme hds and it is used when the hall term becomes dominant these two numerical techniques can be used together by applying strang operator splitting this paper describes the implementation of the sts and hds schemes in the singlefluid code mancha3d the validation for each of these schemes is provided by comparing the analytical solution with the numerical one for a suite of numerical tests
|
[['the', 'interaction', 'of', 'plasma', 'with', 'magnetic', 'field', 'in', 'the', 'partially', 'ionised', 'solar', 'atmosphere', 'is', 'frequently', 'modelled', 'via', 'a', 'singlefluid', 'approximation', 'which', 'is', 'valid', 'for', 'the', 'case', 'of', 'a', 'strongly', 'coupled', 'collisional', 'media', 'such', 'as', 'solar', 'photosphere', 'and', 'low', 'chromosphere', 'under', 'the', 'singlefluid', 'formalism', 'the', 'main', 'nonideal', 'effects', 'are', 'described', 'by', 'a', 'series', 'of', 'extra', 'terms', 'in', 'the', 'generalised', 'induction', 'equation', 'and', 'in', 'the', 'energy', 'conservation', 'equation', 'these', 'effects', 'are', 'ohmic', 'diffusion', 'ambipolar', 'diffusion', 'the', 'hall', 'effect', 'and', 'the', 'biermann', 'battery', 'effect', 'from', 'the', 'point', 'of', 'view', 'of', 'the', 'numerical', 'solution', 'of', 'the', 'singlefluid', 'equations', 'when', 'ambipolar', 'diffusion', 'or', 'hall', 'effects', 'dominate', 'can', 'introduce', 'severe', 'restrictions', 'on', 'the', 'integration', 'time', 'step', 'and', 'can', 'compromise', 'the', 'stability', 'of', 'the', 'numerical', 'scheme', 'in', 'this', 'paper', 'we', 'introduce', 'two', 'numerical', 'schemes', 'to', 'overcome', 'those', 'limitations', 'the', 'first', 'of', 'them', 'is', 'known', 'as', 'super', 'timestepping', 'sts', 'and', 'it', 'is', 'designed', 'to', 'overcome', 'the', 'limitations', 'imposed', 'when', 'the', 'ambipolar', 'diffusion', 'term', 'is', 'dominant', 'the', 'second', 'scheme', 'is', 'called', 'the', 'hall', 'diffusion', 'scheme', 'hds', 'and', 'it', 'is', 'used', 'when', 'the', 'hall', 'term', 'becomes', 'dominant', 'these', 'two', 'numerical', 'techniques', 'can', 'be', 'used', 'together', 'by', 'applying', 'strang', 'operator', 'splitting', 'this', 'paper', 'describes', 'the', 'implementation', 'of', 'the', 'sts', 'and', 'hds', 'schemes', 'in', 'the', 'singlefluid', 'code', 'mancha3d', 'the', 'validation', 'for', 'each', 'of', 'these', 'schemes', 'is', 'provided', 'by', 'comparing', 'the', 'analytical', 'solution', 'with', 'the', 'numerical', 'one', 'for', 'a', 'suite', 'of', 'numerical', 'tests']]
|
[-0.13110374503537167, 0.11770622254914592, -0.047363052980396815, 0.06542013219952193, -0.06969043592653973, -0.13921857527843534, -0.004789040411728959, 0.31440200022214365, -0.2945248734685857, -0.28869867602192417, 0.10936283403916049, -0.2380916541076253, -0.1335064724995653, 0.21422151652140356, -0.02411700422391621, 0.0590919954000716, 0.05430930910640148, -0.05385409606880952, -0.025450237243798232, -0.23640673198710768, 0.35026910135677025, 0.0921818233302522, 0.2569536456439693, 0.04994059604766482, 0.10762558303016957, -0.07394639112758877, -0.04429361987126967, 0.058871274008761326, -0.10923951824100873, 0.04600097015566156, 0.20478398572500006, 0.00399269005710739, 0.28512105190573367, -0.47627667256317807, -0.24313806295069545, -0.00901606471092729, 0.15812890202937624, 0.1381592132292452, -0.04175605542508389, -0.2406755416098917, 0.06542034480135123, -0.19677936734416113, -0.10784649312995398, -0.05368650657242758, -0.04061283542079176, 0.02299527085780707, -0.3054212487168512, 0.09638229247556764, 0.06553055922090031, 0.03624619571410738, -0.07568592093600261, -0.09980505865522737, -0.015997173356128182, 0.09031348425565047, 0.050294316035195144, -0.03202086405759458, 0.12026581566121966, -0.10843335889995619, -0.09821160664928337, 0.4069350858393845, -0.08835136788662352, -0.23967999051956412, 0.18258151405096446, -0.13561497616691426, -0.06904882285032242, 0.14526475739144765, 0.12792222244628423, 0.12449164503746092, -0.13741377332774204, 0.08792365225013289, -0.0035412711270283665, 0.10869970742938938, 0.028547139972545956, -0.004583473602008872, 0.1541557158485836, 0.1699399087287274, 0.03776163978375826, 0.10842201812751998, -0.11569098310606599, -0.09604576338635652, -0.3136658733588639, -0.1757627896186658, -0.15379190969171092, 0.051403697460125235, -0.07260530516582767, -0.16038284232376315, 0.3620300272661044, 0.18014043435712618, 0.11222084744642265, -0.008433149702029555, 0.36978977821222364, 0.20648383247812468, 0.04364847420515517, 0.09275220637718078, 0.23171311733465413, 0.16491633784493603, 0.13738862571701016, -0.2929374527458892, 0.09008329958699676, 0.09824157186466631]
|
1,803.04892
|
Theoretical and empirical analysis of trading activity
|
Understanding the structure of financial markets deals with suitably
determining the functional relation between financial variables. In this
respect, important variables are the trading activity, defined here as the
number of trades $N$, the traded volume $V$, the asset price $P$, the squared
volatility $\sigma^2$, the bid-ask spread $S$ and the cost of trading $C$.
Different reasonings result in simple proportionality relations ("scaling
laws") between these variables. A basic proportionality is established between
the trading activity and the squared volatility, i.e., $N \sim \sigma^2$. More
sophisticated relations are the so called 3/2-law $N^{3/2} \sim \sigma P V /C$
and the intriguing scaling $N \sim (\sigma P/S)^2$. We prove that these
"scaling laws" are the only possible relations for considered sets of variables
by means of a well-known argument from physics: dimensional analysis. Moreover,
we provide empirical evidence based on data from the NASDAQ stock exchange
showing that the sophisticated relations hold with a certain degree of
universality. Finally, we discuss the time scaling of the volatility $\sigma$,
which turns out to be more subtle than one might naively expect.
|
q-fin.TR
|
understanding the structure of financial markets deals with suitably determining the functional relation between financial variables in this respect important variables are the trading activity defined here as the number of trades n the traded volume v the asset price p the squared volatility sigma2 the bidask spread s and the cost of trading c different reasonings result in simple proportionality relations scaling laws between these variables a basic proportionality is established between the trading activity and the squared volatility ie n sim sigma2 more sophisticated relations are the so called 32law n32 sim sigma p v c and the intriguing scaling n sim sigma ps2 we prove that these scaling laws are the only possible relations for considered sets of variables by means of a wellknown argument from physics dimensional analysis moreover we provide empirical evidence based on data from the nasdaq stock exchange showing that the sophisticated relations hold with a certain degree of universality finally we discuss the time scaling of the volatility sigma which turns out to be more subtle than one might naively expect
|
[['understanding', 'the', 'structure', 'of', 'financial', 'markets', 'deals', 'with', 'suitably', 'determining', 'the', 'functional', 'relation', 'between', 'financial', 'variables', 'in', 'this', 'respect', 'important', 'variables', 'are', 'the', 'trading', 'activity', 'defined', 'here', 'as', 'the', 'number', 'of', 'trades', 'n', 'the', 'traded', 'volume', 'v', 'the', 'asset', 'price', 'p', 'the', 'squared', 'volatility', 'sigma2', 'the', 'bidask', 'spread', 's', 'and', 'the', 'cost', 'of', 'trading', 'c', 'different', 'reasonings', 'result', 'in', 'simple', 'proportionality', 'relations', 'scaling', 'laws', 'between', 'these', 'variables', 'a', 'basic', 'proportionality', 'is', 'established', 'between', 'the', 'trading', 'activity', 'and', 'the', 'squared', 'volatility', 'ie', 'n', 'sim', 'sigma2', 'more', 'sophisticated', 'relations', 'are', 'the', 'so', 'called', '32law', 'n32', 'sim', 'sigma', 'p', 'v', 'c', 'and', 'the', 'intriguing', 'scaling', 'n', 'sim', 'sigma', 'ps2', 'we', 'prove', 'that', 'these', 'scaling', 'laws', 'are', 'the', 'only', 'possible', 'relations', 'for', 'considered', 'sets', 'of', 'variables', 'by', 'means', 'of', 'a', 'wellknown', 'argument', 'from', 'physics', 'dimensional', 'analysis', 'moreover', 'we', 'provide', 'empirical', 'evidence', 'based', 'on', 'data', 'from', 'the', 'nasdaq', 'stock', 'exchange', 'showing', 'that', 'the', 'sophisticated', 'relations', 'hold', 'with', 'a', 'certain', 'degree', 'of', 'universality', 'finally', 'we', 'discuss', 'the', 'time', 'scaling', 'of', 'the', 'volatility', 'sigma', 'which', 'turns', 'out', 'to', 'be', 'more', 'subtle', 'than', 'one', 'might', 'naively', 'expect']]
|
[-0.14822811683528048, 0.13367902337876933, -0.10219241329795796, 0.16634162774916444, -0.06564265792781299, -0.1691151681811329, 0.1123423593542591, 0.34734489114724854, -0.27973078987155675, -0.29158333828313054, 0.09376645208927646, -0.335692974118767, -0.14608185255266937, 0.19065495242699562, -0.05249445837087866, 0.012970958774244893, -0.022998200021698067, 0.019061986858115446, -0.02364467466289303, -0.24868780738553764, 0.2834485319104265, 0.005646402266771229, 0.26279778615048344, 0.011982459274089237, 0.09837630838011863, -0.018038710861812145, -0.08131355626294075, 0.03201791949392286, -0.16367119683642425, 0.13815889224211236, 0.24164975136832406, 0.10330166191966639, 0.28773943101071614, -0.393584131666072, -0.1405957335805039, 0.13807108439243493, 0.07163840377300433, -0.025646320158312242, 0.047267790938553586, -0.21301159551471807, 0.019409139198512677, -0.18229483245432787, -0.1452902020452272, -0.09327151508363529, 0.10881554833456372, 0.042296784030001484, -0.26016750615096673, 0.11575674113890763, 0.07480568189456473, 0.0830523164743712, 0.0073822979616482605, -0.15354709458940274, -0.055879996029994966, 0.1068867268380866, 0.12555041500979386, -0.026156110401275787, 0.10841844363263652, -0.10600957959247628, -0.10963281661826657, 0.3595958149866358, -0.03505213485497346, -0.1575160963818919, 0.12659470388944408, -0.18816457825890753, -0.12819772203494742, 0.04992059210911812, 0.1465095730257754, 0.02909600928823432, -0.15418369045089983, 0.09876585155208804, -0.06274338343881825, 0.21867477940395474, 0.07313773010103974, 0.012406867706436621, 0.16946176602374344, 0.15028133874842792, 0.07254685642553514, 0.0744167396977277, -0.0559845769286072, -0.1344171354440538, -0.3546518017714477, -0.1250883164616783, -0.15346294887667375, 0.10317365769911663, -0.23596712006584628, -0.11153373588399773, 0.31715589605292743, 0.11983268686898545, 0.19059478306326638, 0.13243677749970845, 0.2075300986742538, 0.15643767368119063, 0.03846142819711122, 0.11357672707428841, 0.1630769411829206, 0.08404961090372728, 0.08854942129443535, -0.19421445619736097, 0.12772670682530138, 0.05328605500353354]
|
1,803.04893
|
A single population of red globular clusters around the massive compact
galaxy NGC 1277
|
Massive galaxies are thought to form in two phases: an initial, early
collapse of gas and giant burst of central star formation, followed by the
later accretion of material that builds up their stellar and dark matter
haloes. The globular cluster systems of such galaxies are believed to form in a
similar manner. The initial central burst forms metal-rich (red) clusters,
while more metal-poor (blue) clusters are brought in by the later accretion of
less massive satellites. This formation process is thought to lead the creation
of the multimodal optical colour distributions seen in the globular cluster
systems of massive galaxies. Here we report HST/ACS observations of the massive
relic galaxy NGC 1277 and its globular clusters, a nearby unevolved example of
a high redshift "red nugget". The g-z cluster colour distribution shows that
the globular cluster system of the galaxy is unimodal and uniquely red. This is
in strong contrast to normal galaxies of similar and larger stellar mass, whose
cluster systems always exhibit (and are generally dominated by) blue clusters.
We argue that the globular cluster system of NGC 1277 indicates that the galaxy
has undergone little (if any) mass accretion after its initial collapse and use
analytic merger trees to show that the total stellar mass accretion is likely
less than ~ 10 %. These results confirm that NGC 1277 is a genuine relic galaxy
and show that the blue, metal-poor globular clusters constitute an accreted
population in present day massive galaxies.
|
astro-ph.GA
|
massive galaxies are thought to form in two phases an initial early collapse of gas and giant burst of central star formation followed by the later accretion of material that builds up their stellar and dark matter haloes the globular cluster systems of such galaxies are believed to form in a similar manner the initial central burst forms metalrich red clusters while more metalpoor blue clusters are brought in by the later accretion of less massive satellites this formation process is thought to lead the creation of the multimodal optical colour distributions seen in the globular cluster systems of massive galaxies here we report hstacs observations of the massive relic galaxy ngc 1277 and its globular clusters a nearby unevolved example of a high redshift red nugget the gz cluster colour distribution shows that the globular cluster system of the galaxy is unimodal and uniquely red this is in strong contrast to normal galaxies of similar and larger stellar mass whose cluster systems always exhibit and are generally dominated by blue clusters we argue that the globular cluster system of ngc 1277 indicates that the galaxy has undergone little if any mass accretion after its initial collapse and use analytic merger trees to show that the total stellar mass accretion is likely less than 10 these results confirm that ngc 1277 is a genuine relic galaxy and show that the blue metalpoor globular clusters constitute an accreted population in present day massive galaxies
|
[['massive', 'galaxies', 'are', 'thought', 'to', 'form', 'in', 'two', 'phases', 'an', 'initial', 'early', 'collapse', 'of', 'gas', 'and', 'giant', 'burst', 'of', 'central', 'star', 'formation', 'followed', 'by', 'the', 'later', 'accretion', 'of', 'material', 'that', 'builds', 'up', 'their', 'stellar', 'and', 'dark', 'matter', 'haloes', 'the', 'globular', 'cluster', 'systems', 'of', 'such', 'galaxies', 'are', 'believed', 'to', 'form', 'in', 'a', 'similar', 'manner', 'the', 'initial', 'central', 'burst', 'forms', 'metalrich', 'red', 'clusters', 'while', 'more', 'metalpoor', 'blue', 'clusters', 'are', 'brought', 'in', 'by', 'the', 'later', 'accretion', 'of', 'less', 'massive', 'satellites', 'this', 'formation', 'process', 'is', 'thought', 'to', 'lead', 'the', 'creation', 'of', 'the', 'multimodal', 'optical', 'colour', 'distributions', 'seen', 'in', 'the', 'globular', 'cluster', 'systems', 'of', 'massive', 'galaxies', 'here', 'we', 'report', 'hstacs', 'observations', 'of', 'the', 'massive', 'relic', 'galaxy', 'ngc', '1277', 'and', 'its', 'globular', 'clusters', 'a', 'nearby', 'unevolved', 'example', 'of', 'a', 'high', 'redshift', 'red', 'nugget', 'the', 'gz', 'cluster', 'colour', 'distribution', 'shows', 'that', 'the', 'globular', 'cluster', 'system', 'of', 'the', 'galaxy', 'is', 'unimodal', 'and', 'uniquely', 'red', 'this', 'is', 'in', 'strong', 'contrast', 'to', 'normal', 'galaxies', 'of', 'similar', 'and', 'larger', 'stellar', 'mass', 'whose', 'cluster', 'systems', 'always', 'exhibit', 'and', 'are', 'generally', 'dominated', 'by', 'blue', 'clusters', 'we', 'argue', 'that', 'the', 'globular', 'cluster', 'system', 'of', 'ngc', '1277', 'indicates', 'that', 'the', 'galaxy', 'has', 'undergone', 'little', 'if', 'any', 'mass', 'accretion', 'after', 'its', 'initial', 'collapse', 'and', 'use', 'analytic', 'merger', 'trees', 'to', 'show', 'that', 'the', 'total', 'stellar', 'mass', 'accretion', 'is', 'likely', 'less', 'than', '10', 'these', 'results', 'confirm', 'that', 'ngc', '1277', 'is', 'a', 'genuine', 'relic', 'galaxy', 'and', 'show', 'that', 'the', 'blue', 'metalpoor', 'globular', 'clusters', 'constitute', 'an', 'accreted', 'population', 'in', 'present', 'day', 'massive', 'galaxies']]
|
[-0.08321135525506396, 0.1268938350820111, -0.12693176707137882, 0.1249261536516543, -0.10539429766507322, -0.016815220295171802, 0.010320209544976032, 0.43872042039194653, -0.09140047933446405, -0.34293861953549304, 0.006509167652906766, -0.2657277619105921, -0.0653764322062824, 0.1888876624056617, -0.0554029930904201, -0.0771883794690057, 0.13193091757426906, -0.047201691664862655, -0.005023171514339281, -0.3572789828279611, 0.3359183707186347, 0.01788616499292507, 0.12112516655161241, -0.12090262534372785, 0.03519775060392579, -0.12072004998340406, -0.06236459051199936, -0.06769357122281575, -0.13413183985731575, 0.008230802118481201, 0.21404516755664577, 0.15884212216691962, 0.2534532742871838, -0.3607195189410491, -0.17900345928645062, 0.09330689666578125, 0.2964057257713236, 0.05803954222147571, -0.15655287547467456, -0.2865486922271458, 0.11382974594842965, -0.2307278086764761, -0.20865575342396955, 0.12440302716989698, 0.06455737108617653, 0.022933068064112338, -0.17312684743770557, 0.23989050099559112, 0.04943927499722429, 0.025233150541747885, -0.11232975360227426, -0.08745934718303812, -0.10203005733551006, 0.052263624142134875, -0.01153360861327227, 0.0783948659505925, 0.23978939890675152, -0.15516019176208862, 0.026745755688925447, 0.4357254618372569, 0.0029957007312904774, 0.07806902784095318, 0.279412598812899, -0.22148068325596224, -0.23567054603908041, 0.07758666910307765, 0.11721414048607948, 0.10006745419668134, -0.19569637569112114, -0.014452360030033706, -0.01954458228124635, 0.21766285683745096, 0.056509801339925315, 0.06380904007750016, 0.378477833114963, 0.10341783101505642, 0.06846275047395271, 0.10045804115541188, -0.15855025403860787, -0.04803538947378634, -0.14362618725635726, -0.0951915661950017, -0.12501628231544645, 0.08536709793805003, -0.17597248848985667, -0.16027809195833687, 0.2737856791718813, 0.03206334933648154, 0.24034559891708654, 0.04085717689142459, 0.28944975992381083, 0.08367442464841139, 0.15999664607220196, 0.13454358745941225, 0.27771289006005895, 0.2223779011485186, 0.04552194748721526, -0.26784917297979066, 0.0724558229165328, -0.038318495248892796]
|
1,803.04894
|
A Score-Driven Conditional Correlation Model for Noisy and Asynchronous
Data: an Application to High-Frequency Covariance Dynamics
|
The analysis of the intraday dynamics of correlations among high-frequency
returns is challenging due to the presence of asynchronous trading and market
microstructure noise. Both effects may lead to significant data reduction and
may severely underestimate correlations if traditional methods for
low-frequency data are employed. We propose to model intraday log-prices
through a multivariate local-level model with score-driven covariance matrices
and to treat asynchronicity as a missing value problem. The main advantages of
this approach are: (i) all available data are used when filtering correlations,
(ii) market microstructure noise is taken into account, (iii) estimation is
performed through standard maximum likelihood methods. Our empirical analysis,
performed on 1-second NYSE data, shows that opening hours are dominated by
idiosyncratic risk and that a market factor progressively emerges in the second
part of the day. The method can be used as a nowcasting tool for high-frequency
data, allowing to study the real-time response of covariances to macro-news
announcements and to build intraday portfolios with very short optimization
horizons.
|
q-fin.TR q-fin.GN
|
the analysis of the intraday dynamics of correlations among highfrequency returns is challenging due to the presence of asynchronous trading and market microstructure noise both effects may lead to significant data reduction and may severely underestimate correlations if traditional methods for lowfrequency data are employed we propose to model intraday logprices through a multivariate locallevel model with scoredriven covariance matrices and to treat asynchronicity as a missing value problem the main advantages of this approach are i all available data are used when filtering correlations ii market microstructure noise is taken into account iii estimation is performed through standard maximum likelihood methods our empirical analysis performed on 1second nyse data shows that opening hours are dominated by idiosyncratic risk and that a market factor progressively emerges in the second part of the day the method can be used as a nowcasting tool for highfrequency data allowing to study the realtime response of covariances to macronews announcements and to build intraday portfolios with very short optimization horizons
|
[['the', 'analysis', 'of', 'the', 'intraday', 'dynamics', 'of', 'correlations', 'among', 'highfrequency', 'returns', 'is', 'challenging', 'due', 'to', 'the', 'presence', 'of', 'asynchronous', 'trading', 'and', 'market', 'microstructure', 'noise', 'both', 'effects', 'may', 'lead', 'to', 'significant', 'data', 'reduction', 'and', 'may', 'severely', 'underestimate', 'correlations', 'if', 'traditional', 'methods', 'for', 'lowfrequency', 'data', 'are', 'employed', 'we', 'propose', 'to', 'model', 'intraday', 'logprices', 'through', 'a', 'multivariate', 'locallevel', 'model', 'with', 'scoredriven', 'covariance', 'matrices', 'and', 'to', 'treat', 'asynchronicity', 'as', 'a', 'missing', 'value', 'problem', 'the', 'main', 'advantages', 'of', 'this', 'approach', 'are', 'i', 'all', 'available', 'data', 'are', 'used', 'when', 'filtering', 'correlations', 'ii', 'market', 'microstructure', 'noise', 'is', 'taken', 'into', 'account', 'iii', 'estimation', 'is', 'performed', 'through', 'standard', 'maximum', 'likelihood', 'methods', 'our', 'empirical', 'analysis', 'performed', 'on', '1second', 'nyse', 'data', 'shows', 'that', 'opening', 'hours', 'are', 'dominated', 'by', 'idiosyncratic', 'risk', 'and', 'that', 'a', 'market', 'factor', 'progressively', 'emerges', 'in', 'the', 'second', 'part', 'of', 'the', 'day', 'the', 'method', 'can', 'be', 'used', 'as', 'a', 'nowcasting', 'tool', 'for', 'highfrequency', 'data', 'allowing', 'to', 'study', 'the', 'realtime', 'response', 'of', 'covariances', 'to', 'macronews', 'announcements', 'and', 'to', 'build', 'intraday', 'portfolios', 'with', 'very', 'short', 'optimization', 'horizons']]
|
[-0.07014146397793383, 0.04815829429408592, -0.11977278852383748, 0.1524700870716267, -0.09285625120427346, -0.15337400967819673, 0.05843865844618642, 0.42268835976155417, -0.2683552624939969, -0.3064522753896502, 0.1771825324934484, -0.31441658148542045, -0.12288242724978111, 0.19244390855063542, -0.0923196876379238, 0.03337123370306058, 0.08975905571415117, -0.05969771001290417, 0.007718738916358261, -0.25156346579138755, 0.24682412657209418, 0.0910860152809288, 0.3103291332883986, 0.007656893193383109, 0.08053577681227277, 0.033859305868320394, -0.09949042854096854, 0.03666704790243371, -0.04479223922870446, 0.1151133905962166, 0.28218043954534966, 0.12089447462366837, 0.3355846851386807, -0.4336445117651513, -0.19208738838717568, 0.13021654175650893, 0.09359651937953789, 0.057937861547212706, 0.025910866187857182, -0.27344057097127944, 0.024095674813019507, -0.17828214837160583, -0.0729711123516388, -0.14329084112224252, 0.01702758210753514, -0.007147080861878666, -0.32424345235481405, 0.1483012508996057, 0.026422037503851407, 0.041481861458018875, -0.055342301985982695, -0.13005412335818012, -0.002321067507463423, 0.14328692797236287, 0.14183923056433825, -0.0512939279927223, 0.1371070602499513, -0.08498321229902407, -0.12441792171907075, 0.3671714423788768, -0.0831148466462213, -0.14404657689544062, 0.12545300509893534, -0.1289310660213232, -0.11471103226032221, 0.15220315171913668, 0.22525958083993333, 0.02295372783573288, -0.18701125614135172, 0.00981431319625258, 0.03891535563337983, 0.21702994348932847, -0.01334400964957295, 0.0015610467106329671, 0.16996003999657025, 0.19464578827010523, 0.044631151149444506, 0.12616672050137298, -0.16111039647014078, -0.10658924187053785, -0.2487153644419529, -0.04945945026155448, -0.1512663464167748, 0.025114646662647525, -0.12734559018007888, -0.17540801337666131, 0.38458796770057896, 0.1847679804488452, 0.15150551365857776, 0.06082298511244131, 0.30734392173136726, 0.11124392235581057, 0.05655721689602642, 0.08677883761455164, 0.19255910415315267, 0.05538535638373684, 0.13576718371813046, -0.17981345616157562, 0.14437228449846082, -0.0337204426611689]
|
1,803.04895
|
Inverse source problem in a forced network
|
We address the nonlinear inverse source problem of identifying a
time-dependent source occurring in one node of a network governed by a wave
equation. We prove that time records of the associated state taken at a
strategic set of two nodes yield uniqueness of the two unknown elements: the
source position and the emitted signal. We develop a non-iterative
identification method that localizes the source node by solving a set of well
posed linear systems. Once the source node is localized, we identify the
emitted signal using a deconvolution problem or a Fourier expansion. Numerical
experiments on a $5$ node graph confirm the effectiveness of the approach.
|
math.OC
|
we address the nonlinear inverse source problem of identifying a timedependent source occurring in one node of a network governed by a wave equation we prove that time records of the associated state taken at a strategic set of two nodes yield uniqueness of the two unknown elements the source position and the emitted signal we develop a noniterative identification method that localizes the source node by solving a set of well posed linear systems once the source node is localized we identify the emitted signal using a deconvolution problem or a fourier expansion numerical experiments on a 5 node graph confirm the effectiveness of the approach
|
[['we', 'address', 'the', 'nonlinear', 'inverse', 'source', 'problem', 'of', 'identifying', 'a', 'timedependent', 'source', 'occurring', 'in', 'one', 'node', 'of', 'a', 'network', 'governed', 'by', 'a', 'wave', 'equation', 'we', 'prove', 'that', 'time', 'records', 'of', 'the', 'associated', 'state', 'taken', 'at', 'a', 'strategic', 'set', 'of', 'two', 'nodes', 'yield', 'uniqueness', 'of', 'the', 'two', 'unknown', 'elements', 'the', 'source', 'position', 'and', 'the', 'emitted', 'signal', 'we', 'develop', 'a', 'noniterative', 'identification', 'method', 'that', 'localizes', 'the', 'source', 'node', 'by', 'solving', 'a', 'set', 'of', 'well', 'posed', 'linear', 'systems', 'once', 'the', 'source', 'node', 'is', 'localized', 'we', 'identify', 'the', 'emitted', 'signal', 'using', 'a', 'deconvolution', 'problem', 'or', 'a', 'fourier', 'expansion', 'numerical', 'experiments', 'on', 'a', '5', 'node', 'graph', 'confirm', 'the', 'effectiveness', 'of', 'the', 'approach']]
|
[-0.1861342937537582, 0.02259296314599358, -0.05725184454208362, 0.04015706391258722, -0.06959624960148167, -0.1571121521981729, 0.0814945240609487, 0.34695394632241155, -0.3182888356359484, -0.2815192127600312, 0.12384843339199182, -0.3223020962883379, -0.12997116795828062, 0.16286786737695128, 0.008113933135276643, 0.07141399588740527, 0.12070606353205289, 0.06721461384130695, -0.019826577602076196, -0.18305236090406576, 0.34299722517118136, 0.021603509966527747, 0.23940304458733194, 0.01540461230030823, 0.17752786020304415, 0.02966395892620644, -0.0670526080251297, 0.03362531828472095, -0.03297595090135414, 0.09993260522442653, 0.2675289806461606, 0.16449716800571393, 0.30445808429862853, -0.4108387591299888, -0.22600880777898513, 0.09371552821771006, 0.1133302675525301, 0.11484596777324364, -0.06812218681443483, -0.31441624187559725, 0.07226670685737768, -0.1392688846877106, -0.1415339870221704, 0.029936520582952788, -0.02738726791429603, 0.01008490734585674, -0.2671791927227489, 0.0831152609501591, 0.04678554166104018, -0.0007427345317240074, -0.08497791836978258, -0.06732110057687649, 0.01768278777729894, 0.12050103725839371, -0.009330234962524237, 0.03959377789782865, 0.11184440724220927, -0.11677032611637472, -0.12761639985397336, 0.36446282392907364, -0.02849418845541218, -0.2098456536567657, 0.12744575842483857, -0.0891141268363762, -0.12190599036925237, 0.15295945887810716, 0.2042237528747766, 0.1500704274556347, -0.17154229597447476, 0.038502508865247226, -0.036718708719643674, 0.18423421950749705, 0.08192116202934532, -0.009495243347450116, 0.17966185839167823, 0.17588115144938787, 0.0795752489939332, 0.17670948561455044, -0.15303548222470803, -0.035122389108743345, -0.3008405243560115, -0.09803799268894037, -0.25509604667618035, 0.0227626567997776, -0.08479328201112672, -0.17060676944729325, 0.472416623347552, 0.14144694004381927, 0.19714005107591015, 0.025669149416890517, 0.26581512819583936, 0.16023730518645607, -0.006486703141235581, 0.10109398347786933, 0.17618451465930896, 0.11609756883677687, 0.07302878087247226, -0.24742317614450215, 0.064324174374429, 0.09067861862463232]
|
1,803.04896
|
Sub-voxel perfusion modeling in terms of coupled 3d-1d problem
|
We study perfusion by a multiscale model coupling diffusion in the tissue and
diffusion along the one-dimensional segments representing the vasculature. We
propose a block-diagonal preconditioner for the model equations and demonstrate
its robustness by numerical experiments. We compare our model to a macroscale
model by [P. Tofts, Modelling in DCE MRI, 2012].
|
math.AP math.NA
|
we study perfusion by a multiscale model coupling diffusion in the tissue and diffusion along the onedimensional segments representing the vasculature we propose a blockdiagonal preconditioner for the model equations and demonstrate its robustness by numerical experiments we compare our model to a macroscale model by p tofts modelling in dce mri 2012
|
[['we', 'study', 'perfusion', 'by', 'a', 'multiscale', 'model', 'coupling', 'diffusion', 'in', 'the', 'tissue', 'and', 'diffusion', 'along', 'the', 'onedimensional', 'segments', 'representing', 'the', 'vasculature', 'we', 'propose', 'a', 'blockdiagonal', 'preconditioner', 'for', 'the', 'model', 'equations', 'and', 'demonstrate', 'its', 'robustness', 'by', 'numerical', 'experiments', 'we', 'compare', 'our', 'model', 'to', 'a', 'macroscale', 'model', 'by', 'p', 'tofts', 'modelling', 'in', 'dce', 'mri', '2012']]
|
[-0.06186130017323314, 0.025819976005773498, -0.05393124610747931, 0.0020069585375066075, -0.0010702854268393428, -0.14062073679184015, -0.019969969214695803, 0.3778983328210295, -0.297473442266291, -0.26548449250535583, 0.06805110559798777, -0.2755734659731388, -0.24417893317932227, 0.15180146133632594, -0.02790433352039951, 0.11506314789942237, 0.1321983124120688, -0.05303115819422704, 0.003737300810105396, -0.14464438067011112, 0.25805577554933307, 0.05591628408797507, 0.31116720122496055, 0.017677993355494626, 0.13687243055165657, -0.046586391603890456, -0.039923966510818816, 0.02588485516959204, -0.16022220670403736, 0.12728620802034746, 0.19847967173412162, 0.07152205430199655, 0.28469685548565016, -0.46645322287420055, -0.30059115405475617, 0.029475582385752, 0.13834400829982083, 0.1326543594796193, -0.028676384673366008, -0.3346862641497041, 0.05145014109933432, -0.14171261962432907, -0.0879357598078402, -0.14805435550065255, -0.029959825218989038, -0.010041457447135504, -0.31254638248246236, 0.15491326237185243, 0.05585701022964885, 0.06812903395730932, -0.12692221966440315, -0.053122499008786, -0.011128348030395946, 0.052229032438810705, 0.001525365084163704, -0.03482482913125939, 0.11155735210181689, -0.15047487166692625, -0.10337693411154004, 0.3432095544237011, -0.08298725990209517, -0.28410083331378566, 0.1826263085921418, -0.10453934481648623, -0.050626531471761896, 0.0966479934681699, 0.24255395229062382, 0.12709987124885028, -0.17334809243011307, 0.08256462194631754, -0.06163992300928342, 0.15434527790277125, -0.005117097786047829, -0.15786213775710115, 0.09597878921161986, 0.26483964913015096, -0.02705006055393309, 0.1612907609427875, -0.14788588962324387, -0.07869006552786198, -0.2716793700534288, -0.16601049009148242, -0.16332828597921245, -0.0014737439341843128, -0.13497613995052646, -0.15072218903322826, 0.43953220581389824, 0.24522788272643425, 0.2263183971836214, 0.05150310353832847, 0.3172206113659689, 0.07634732601417334, 0.03218529144091145, 0.03201372081519298, 0.1711690582264707, 0.1331883655676513, 0.0902175858906769, -0.3106640116223749, 0.07083015956142742, 0.12616941214644545]
|
1,803.04897
|
Explosion in weighted Hyperbolic Random Graphs and Geometric
Inhomogeneous Random Graphs
|
In this paper we study weighted distances in scale-free spatial network
models: hyperbolic random graphs (HRG), geometric inhomogeneous random graphs
(GIRG) and scale-free percolation (SFP). In HRGs, $n=\Theta(\mathrm{e}^{R/2})$
vertices are sampled independently from the hyperbolic disk with radius $R$ and
two vertices are connected either when they are within hyperbolic distance $R$,
or independently with a probability depending on the hyperbolic distance. In
GIRGs and SFP, each vertex is given an independent weight and location from an
underlying measured metric space and $\mathbb{Z}^d$, respectively, and two
vertices are connected independently with a probability that is a function of
their distance and weights. We assign i.i.d. weights to the edges of the random
graphs and study the weighted distance between two uniformly chosen vertices.
In SFP, we study the weighted distance from the origin of vertex-sequences with
norm tending to infinity. In particular, we study the case when the parameters
are so that the degree distribution in the graph follows a power law with
exponent $\tau\in(2,3)$ (infinite variance), and the edge-weight distribution
is such that it produces an explosive age-dependent branching process with
power-law offspring distribution. We show that in all three models, typical
distances within the giant/infinite component converge in distribution, solving
an open question in [Explosion and distances in scale-free percolation (2017)].
The main tools of our proof are to couple the models to infinite versions, to
follow the shortest paths to infinity and to connect these paths using
weight-dependent percolation on the graphs: delete edges attached to vertices
with higher weight with higher probability. We realise this using the
edge-weights: only short edges connected to high weight vertices will stay,
yielding arbitrarily short upper bounds for the connections.
|
math.PR
|
in this paper we study weighted distances in scalefree spatial network models hyperbolic random graphs hrg geometric inhomogeneous random graphs girg and scalefree percolation sfp in hrgs nthetamathrmer2 vertices are sampled independently from the hyperbolic disk with radius r and two vertices are connected either when they are within hyperbolic distance r or independently with a probability depending on the hyperbolic distance in girgs and sfp each vertex is given an independent weight and location from an underlying measured metric space and mathbbzd respectively and two vertices are connected independently with a probability that is a function of their distance and weights we assign iid weights to the edges of the random graphs and study the weighted distance between two uniformly chosen vertices in sfp we study the weighted distance from the origin of vertexsequences with norm tending to infinity in particular we study the case when the parameters are so that the degree distribution in the graph follows a power law with exponent tauin23 infinite variance and the edgeweight distribution is such that it produces an explosive agedependent branching process with powerlaw offspring distribution we show that in all three models typical distances within the giantinfinite component converge in distribution solving an open question in explosion and distances in scalefree percolation 2017 the main tools of our proof are to couple the models to infinite versions to follow the shortest paths to infinity and to connect these paths using weightdependent percolation on the graphs delete edges attached to vertices with higher weight with higher probability we realise this using the edgeweights only short edges connected to high weight vertices will stay yielding arbitrarily short upper bounds for the connections
|
[['in', 'this', 'paper', 'we', 'study', 'weighted', 'distances', 'in', 'scalefree', 'spatial', 'network', 'models', 'hyperbolic', 'random', 'graphs', 'hrg', 'geometric', 'inhomogeneous', 'random', 'graphs', 'girg', 'and', 'scalefree', 'percolation', 'sfp', 'in', 'hrgs', 'nthetamathrmer2', 'vertices', 'are', 'sampled', 'independently', 'from', 'the', 'hyperbolic', 'disk', 'with', 'radius', 'r', 'and', 'two', 'vertices', 'are', 'connected', 'either', 'when', 'they', 'are', 'within', 'hyperbolic', 'distance', 'r', 'or', 'independently', 'with', 'a', 'probability', 'depending', 'on', 'the', 'hyperbolic', 'distance', 'in', 'girgs', 'and', 'sfp', 'each', 'vertex', 'is', 'given', 'an', 'independent', 'weight', 'and', 'location', 'from', 'an', 'underlying', 'measured', 'metric', 'space', 'and', 'mathbbzd', 'respectively', 'and', 'two', 'vertices', 'are', 'connected', 'independently', 'with', 'a', 'probability', 'that', 'is', 'a', 'function', 'of', 'their', 'distance', 'and', 'weights', 'we', 'assign', 'iid', 'weights', 'to', 'the', 'edges', 'of', 'the', 'random', 'graphs', 'and', 'study', 'the', 'weighted', 'distance', 'between', 'two', 'uniformly', 'chosen', 'vertices', 'in', 'sfp', 'we', 'study', 'the', 'weighted', 'distance', 'from', 'the', 'origin', 'of', 'vertexsequences', 'with', 'norm', 'tending', 'to', 'infinity', 'in', 'particular', 'we', 'study', 'the', 'case', 'when', 'the', 'parameters', 'are', 'so', 'that', 'the', 'degree', 'distribution', 'in', 'the', 'graph', 'follows', 'a', 'power', 'law', 'with', 'exponent', 'tauin23', 'infinite', 'variance', 'and', 'the', 'edgeweight', 'distribution', 'is', 'such', 'that', 'it', 'produces', 'an', 'explosive', 'agedependent', 'branching', 'process', 'with', 'powerlaw', 'offspring', 'distribution', 'we', 'show', 'that', 'in', 'all', 'three', 'models', 'typical', 'distances', 'within', 'the', 'giantinfinite', 'component', 'converge', 'in', 'distribution', 'solving', 'an', 'open', 'question', 'in', 'explosion', 'and', 'distances', 'in', 'scalefree', 'percolation', '2017', 'the', 'main', 'tools', 'of', 'our', 'proof', 'are', 'to', 'couple', 'the', 'models', 'to', 'infinite', 'versions', 'to', 'follow', 'the', 'shortest', 'paths', 'to', 'infinity', 'and', 'to', 'connect', 'these', 'paths', 'using', 'weightdependent', 'percolation', 'on', 'the', 'graphs', 'delete', 'edges', 'attached', 'to', 'vertices', 'with', 'higher', 'weight', 'with', 'higher', 'probability', 'we', 'realise', 'this', 'using', 'the', 'edgeweights', 'only', 'short', 'edges', 'connected', 'to', 'high', 'weight', 'vertices', 'will', 'stay', 'yielding', 'arbitrarily', 'short', 'upper', 'bounds', 'for', 'the', 'connections']]
|
[-0.11045110067694307, 0.17125786606756382, -0.06852129908825652, 0.04886850391064887, -0.07097303685314608, -0.1613670858129373, 0.05394374701342937, 0.4401889494282828, -0.2862165243267014, -0.2659370673152254, 0.0669606270836295, -0.35067992125961767, -0.1279025577380747, 0.0966192975773584, -0.07750323484166681, 0.022380308470177544, 0.07308259013486837, 0.08386397245846203, 0.01025841978633358, -0.2686216396620654, 0.3229358225320723, 0.014680882797751954, 0.2179890886451914, 0.032609774177045976, 0.06989612096968693, 0.019440327781131087, -0.013965287871753284, 0.05344834077740139, -0.1721763115017076, 0.10265246655225106, 0.20414576666739184, 0.09145970640771417, 0.2423190454095332, -0.3882347002922409, -0.17644842996842403, 0.19285949808376693, 0.1281263068749863, 0.05205253991838275, 0.03849615894706812, -0.2325734211970458, 0.10837892354196073, -0.11148662217923286, -0.1471076234919947, 0.05278004127288021, 0.05776994897599291, 0.10580973373219857, -0.26976804269909643, 0.028163206060855664, 0.05580210788310438, 0.004905011520811282, -0.003709932316796503, -0.14189573476239498, -0.032771724272026695, 0.15431747328936277, 0.003592003235784089, 0.05467159012366302, 0.06684601348251158, -0.08970441154847124, -0.1432696891074622, 0.3143914761072349, -0.04536629906194149, -0.20421732998743275, 0.17481959036735317, -0.16112320476373576, -0.14665264233548625, 0.0865470794682472, 0.19693903192081422, 0.11509642594859727, -0.14710615756991066, 0.0776479181749628, -0.028194469141190115, 0.11678604765051126, 0.10490568644330041, 0.010355075958785534, 0.156638665720348, 0.11462222594022076, 0.12256417651593253, 0.1391213745848053, -0.05448712746400143, -0.11942725412950823, -0.29223438934085594, -0.07753709500969347, -0.2560515846653025, 0.08144713416138825, -0.21478061258660644, -0.20348985649036258, 0.3761828012226244, 0.12628985658976372, 0.2933111386441126, 0.15739720036862823, 0.22237653975321006, 0.1029527840163201, 0.04222174732949234, 0.1662812407606828, 0.13958670501681586, 0.14860622906142953, 0.004427134374028368, -0.11884862743782056, 0.07971796539999744, 0.11174837817552676]
|
1,803.04898
|
Magneto-optic dynamics in a ferromagnetic nematic liquid crystal
|
We investigate dynamic magneto-optic effects in a ferromagnetic nematic
liquid crystal experimentally and theoretically. Experimentally we measure the
magnetization and the phase difference of the transmitted light when an
external magnetic field is applied. As a model we study the coupled dynamics of
the magnetization, M, and the director field, n, associated with the liquid
crystalline orientational order. We demonstrate that the experimentally studied
macroscopic dynamic behavior reveals the importance of a dynamic cross-coupling
between M and n. The experimental data are used to extract the value of the
dissipative cross-coupling coefficient. We also make concrete predictions about
how reversible cross-coupling terms between the magnetization and the director
could be detected experimentally by measurements of the transmitted light
intensity as well as by analyzing the azimuthal angle of the magnetization and
the director out of the plane spanned by the anchoring axis and the external
magnetic field. We derive the eigenmodes of the coupled system and study their
relaxation rates. We show that in the usual experimental set-up used for
measuring the relaxation rates of the splay-bend or twist-bend eigenmodes of a
nematic liquid crystal one expects for a ferromagnetic nematic liquid crystal a
mixture of at least two eigenmodes.
|
cond-mat.mtrl-sci cond-mat.soft
|
we investigate dynamic magnetooptic effects in a ferromagnetic nematic liquid crystal experimentally and theoretically experimentally we measure the magnetization and the phase difference of the transmitted light when an external magnetic field is applied as a model we study the coupled dynamics of the magnetization m and the director field n associated with the liquid crystalline orientational order we demonstrate that the experimentally studied macroscopic dynamic behavior reveals the importance of a dynamic crosscoupling between m and n the experimental data are used to extract the value of the dissipative crosscoupling coefficient we also make concrete predictions about how reversible crosscoupling terms between the magnetization and the director could be detected experimentally by measurements of the transmitted light intensity as well as by analyzing the azimuthal angle of the magnetization and the director out of the plane spanned by the anchoring axis and the external magnetic field we derive the eigenmodes of the coupled system and study their relaxation rates we show that in the usual experimental setup used for measuring the relaxation rates of the splaybend or twistbend eigenmodes of a nematic liquid crystal one expects for a ferromagnetic nematic liquid crystal a mixture of at least two eigenmodes
|
[['we', 'investigate', 'dynamic', 'magnetooptic', 'effects', 'in', 'a', 'ferromagnetic', 'nematic', 'liquid', 'crystal', 'experimentally', 'and', 'theoretically', 'experimentally', 'we', 'measure', 'the', 'magnetization', 'and', 'the', 'phase', 'difference', 'of', 'the', 'transmitted', 'light', 'when', 'an', 'external', 'magnetic', 'field', 'is', 'applied', 'as', 'a', 'model', 'we', 'study', 'the', 'coupled', 'dynamics', 'of', 'the', 'magnetization', 'm', 'and', 'the', 'director', 'field', 'n', 'associated', 'with', 'the', 'liquid', 'crystalline', 'orientational', 'order', 'we', 'demonstrate', 'that', 'the', 'experimentally', 'studied', 'macroscopic', 'dynamic', 'behavior', 'reveals', 'the', 'importance', 'of', 'a', 'dynamic', 'crosscoupling', 'between', 'm', 'and', 'n', 'the', 'experimental', 'data', 'are', 'used', 'to', 'extract', 'the', 'value', 'of', 'the', 'dissipative', 'crosscoupling', 'coefficient', 'we', 'also', 'make', 'concrete', 'predictions', 'about', 'how', 'reversible', 'crosscoupling', 'terms', 'between', 'the', 'magnetization', 'and', 'the', 'director', 'could', 'be', 'detected', 'experimentally', 'by', 'measurements', 'of', 'the', 'transmitted', 'light', 'intensity', 'as', 'well', 'as', 'by', 'analyzing', 'the', 'azimuthal', 'angle', 'of', 'the', 'magnetization', 'and', 'the', 'director', 'out', 'of', 'the', 'plane', 'spanned', 'by', 'the', 'anchoring', 'axis', 'and', 'the', 'external', 'magnetic', 'field', 'we', 'derive', 'the', 'eigenmodes', 'of', 'the', 'coupled', 'system', 'and', 'study', 'their', 'relaxation', 'rates', 'we', 'show', 'that', 'in', 'the', 'usual', 'experimental', 'setup', 'used', 'for', 'measuring', 'the', 'relaxation', 'rates', 'of', 'the', 'splaybend', 'or', 'twistbend', 'eigenmodes', 'of', 'a', 'nematic', 'liquid', 'crystal', 'one', 'expects', 'for', 'a', 'ferromagnetic', 'nematic', 'liquid', 'crystal', 'a', 'mixture', 'of', 'at', 'least', 'two', 'eigenmodes']]
|
[-0.18957466734806075, 0.22587347843284078, -0.07083198920590802, 0.013929028353304602, -0.043246537833474576, -0.10553677396965214, 0.02520874949870631, 0.38596366039884744, -0.28646308699971995, -0.29422874121926723, 0.05713738812482916, -0.27136156177381054, -0.14214158329530618, 0.1633321187098045, 0.0769684593315469, 0.05213841842720285, -0.05972731879039202, 0.01113244126434438, -0.06923634747741744, -0.17012064506066962, 0.25944699155632406, -0.0010770839871838689, 0.31908789147622885, 0.043383263244759294, 0.12530989239516202, 0.03535726002068259, 0.07177635226631537, 0.0541128578223288, -0.18113463568537555, 0.05316522734006867, 0.2235899535100907, -0.04091993550304324, 0.17622849476523697, -0.4520623258128762, -0.17135087517672218, 0.06733302729437128, 0.10958306861342862, 0.1312284837325569, -0.020312949564540758, -0.26623841050313785, 0.016183275978546588, -0.10408055356077967, -0.17058738205349072, -0.11313530877698214, -0.01932486021716613, 0.034592562141478995, -0.2522409251984209, 0.09271789561593323, 0.05819095658895094, 0.11431481539737433, -0.07636221177177503, -0.07104849184455815, -0.07526674457709305, 0.08699844352042418, 0.09025068329036003, 0.037419978932884984, 0.17206078374525532, -0.13343347022309898, -0.11045826309360564, 0.36803880271851086, -0.08398886044917163, -0.17505098729860039, 0.1230537699686829, -0.19212495767162183, -0.03245090503012762, 0.14537829828448592, 0.16606497876840876, 0.0996257702173898, -0.10730754573516606, 0.010182471068110316, -0.030057101473212243, 0.21025372812524437, 0.05802873513894156, 0.018145034082699567, 0.24491722795180976, 0.1839812255871948, 0.0052178063406609, 0.1993979476750246, -0.15709917263156967, -0.09111807289795251, -0.2644796630588826, -0.17772006594226697, -0.19094122695096302, 0.009478629088262096, -0.10199670821370091, -0.12136950924468692, 0.41175908108241854, 0.1375206986023113, 0.16775133269373327, -0.02224278402980417, 0.2685083576478064, 0.05999909956706688, 0.025441208525444382, 0.022275795300956816, 0.3103383700811537, 0.1966035665513482, 0.12478502094629221, -0.3429600570560433, 0.09195780222071334, -0.0036248736979905515]
|
1,803.04899
|
Optimal Transport for Multi-source Domain Adaptation under Target Shift
|
In this paper, we propose to tackle the problem of reducing discrepancies
between multiple domains referred to as multi-source domain adaptation and
consider it under the target shift assumption: in all domains we aim to solve a
classification problem with the same output classes, but with labels'
proportions differing across them. This problem, generally ignored in the vast
majority papers on domain adaptation papers, is nevertheless critical in
real-world applications, and we theoretically show its impact on the adaptation
success. To address this issue, we design a method based on optimal transport,
a theory that has been successfully used to tackle adaptation problems in
machine learning. Our method performs multi-source adaptation and target shift
correction simultaneously by learning the class probabilities of the unlabeled
target sample and the coupling allowing to align two (or more) probability
distributions. Experiments on both synthetic and real-world data related to
satellite image segmentation task show the superiority of the proposed method
over the state-of-the-art.
|
stat.ML
|
in this paper we propose to tackle the problem of reducing discrepancies between multiple domains referred to as multisource domain adaptation and consider it under the target shift assumption in all domains we aim to solve a classification problem with the same output classes but with labels proportions differing across them this problem generally ignored in the vast majority papers on domain adaptation papers is nevertheless critical in realworld applications and we theoretically show its impact on the adaptation success to address this issue we design a method based on optimal transport a theory that has been successfully used to tackle adaptation problems in machine learning our method performs multisource adaptation and target shift correction simultaneously by learning the class probabilities of the unlabeled target sample and the coupling allowing to align two or more probability distributions experiments on both synthetic and realworld data related to satellite image segmentation task show the superiority of the proposed method over the stateoftheart
|
[['in', 'this', 'paper', 'we', 'propose', 'to', 'tackle', 'the', 'problem', 'of', 'reducing', 'discrepancies', 'between', 'multiple', 'domains', 'referred', 'to', 'as', 'multisource', 'domain', 'adaptation', 'and', 'consider', 'it', 'under', 'the', 'target', 'shift', 'assumption', 'in', 'all', 'domains', 'we', 'aim', 'to', 'solve', 'a', 'classification', 'problem', 'with', 'the', 'same', 'output', 'classes', 'but', 'with', 'labels', 'proportions', 'differing', 'across', 'them', 'this', 'problem', 'generally', 'ignored', 'in', 'the', 'vast', 'majority', 'papers', 'on', 'domain', 'adaptation', 'papers', 'is', 'nevertheless', 'critical', 'in', 'realworld', 'applications', 'and', 'we', 'theoretically', 'show', 'its', 'impact', 'on', 'the', 'adaptation', 'success', 'to', 'address', 'this', 'issue', 'we', 'design', 'a', 'method', 'based', 'on', 'optimal', 'transport', 'a', 'theory', 'that', 'has', 'been', 'successfully', 'used', 'to', 'tackle', 'adaptation', 'problems', 'in', 'machine', 'learning', 'our', 'method', 'performs', 'multisource', 'adaptation', 'and', 'target', 'shift', 'correction', 'simultaneously', 'by', 'learning', 'the', 'class', 'probabilities', 'of', 'the', 'unlabeled', 'target', 'sample', 'and', 'the', 'coupling', 'allowing', 'to', 'align', 'two', 'or', 'more', 'probability', 'distributions', 'experiments', 'on', 'both', 'synthetic', 'and', 'realworld', 'data', 'related', 'to', 'satellite', 'image', 'segmentation', 'task', 'show', 'the', 'superiority', 'of', 'the', 'proposed', 'method', 'over', 'the', 'stateoftheart']]
|
[-0.0339735140070843, -0.01190473285096232, -0.03426710733328946, 0.06110091937553079, -0.11236821365018841, -0.13207340852823107, 0.0716336527839303, 0.4524948029866209, -0.2855936399369966, -0.35319200454396193, 0.08298577245514024, -0.24495716439851095, -0.17264262601529481, 0.19952566569991176, -0.15521093072020448, 0.10003486263412924, 0.10210219957807568, 0.01902832684572786, -0.05848441475391155, -0.2938351117787533, 0.3366714761374169, 0.004245413473108783, 0.39680454208428273, 0.04719346426245465, 0.11791342337455717, -0.01838171450071968, -0.04687871049973182, 0.015025448342203162, -0.08436778607742781, 0.15713600632807356, 0.33147701074776703, 0.1762886096825241, 0.3390606406959705, -0.371099295140948, -0.2546525326673873, 0.13794178439420648, 0.14682063517393545, 0.11962897129997145, -0.044812413651834505, -0.2975790935975965, 0.08663945298758335, -0.14676222447887993, -0.014834665457601658, -0.08249643701128662, -0.014740363726741635, -0.006056709063705057, -0.2747305930475704, 0.043549517783685585, 0.06125948068111029, 0.03612381123821251, -0.08219946421813802, -0.10187183548259782, 0.09054532935988391, 0.17594338113995037, 0.08258131385737215, 0.028954249137314036, 0.09732968097960111, -0.14151826930610695, -0.15776618033705744, 0.3760069962823763, -0.04317357355030253, -0.26023494246255724, 0.21520374123501823, -0.06275435292336624, -0.1604539085252327, 0.08087538819381734, 0.24299541077343748, 0.15921994163072667, -0.14246470661601052, 0.04829363264252606, -0.03315082348999567, 0.1689399104740005, 0.07137814383022487, -0.03762711079616565, 0.14820611301111059, 0.21104274334211368, 0.07104852917073004, 0.16968458654446295, -0.13591173898021225, -0.10665142477519111, -0.2087528128791746, -0.074830376963655, -0.20543843143459525, -0.03817943875910714, -0.03813317673293568, -0.12846669579157605, 0.3793660847120918, 0.24396758586080977, 0.22130660834081936, 0.06978520915272383, 0.334665177250281, 0.02961738144949777, 0.08081192441350141, 0.07608461190939124, 0.16165810909296852, 0.053639817093790045, 0.12909847935879953, -0.23615307748259512, 0.09767480464652181, 0.01899249973357655]
|
1,803.049
|
Microscopic approach to understand Brownian dynamics in viscoelastic
fluid
|
We present an entirely microscopic formulation of viscoleasticity of a fluid
starting from the microscopic Stokes-Oldroyd B Model assuming instantaneous
hydrodynamic friction, and show that linearization leads to a form for the
frequency dependent viscosity that can be directly applied to the Langevin
equation. Interestingly, the calculated expression of viscosity can be directly
mapped to the Jeffreys' model which is essentially macroscopic in nature with
the bulk viscoelasticity of the fluid being characterized by a complex elastic
modulus G(\omega). Further, we demonstrate that the concerned Green's function
is same as that in an incompressible, low Reynold's number Newtonian fluid with
the simple incorporation of frequency dependence in the viscosity term. We
proceed to evaluate the trajectory of a free Brownian particle in a
viscoelastic environment using our formalism and calculate parameters such as
the power spectral density, the autocorrelation function and the mean-square
displacement, which we then extend to the particle confined in a harmonic
potential in the fluid.
|
physics.flu-dyn cond-mat.soft
|
we present an entirely microscopic formulation of viscoleasticity of a fluid starting from the microscopic stokesoldroyd b model assuming instantaneous hydrodynamic friction and show that linearization leads to a form for the frequency dependent viscosity that can be directly applied to the langevin equation interestingly the calculated expression of viscosity can be directly mapped to the jeffreys model which is essentially macroscopic in nature with the bulk viscoelasticity of the fluid being characterized by a complex elastic modulus gomega further we demonstrate that the concerned greens function is same as that in an incompressible low reynolds number newtonian fluid with the simple incorporation of frequency dependence in the viscosity term we proceed to evaluate the trajectory of a free brownian particle in a viscoelastic environment using our formalism and calculate parameters such as the power spectral density the autocorrelation function and the meansquare displacement which we then extend to the particle confined in a harmonic potential in the fluid
|
[['we', 'present', 'an', 'entirely', 'microscopic', 'formulation', 'of', 'viscoleasticity', 'of', 'a', 'fluid', 'starting', 'from', 'the', 'microscopic', 'stokesoldroyd', 'b', 'model', 'assuming', 'instantaneous', 'hydrodynamic', 'friction', 'and', 'show', 'that', 'linearization', 'leads', 'to', 'a', 'form', 'for', 'the', 'frequency', 'dependent', 'viscosity', 'that', 'can', 'be', 'directly', 'applied', 'to', 'the', 'langevin', 'equation', 'interestingly', 'the', 'calculated', 'expression', 'of', 'viscosity', 'can', 'be', 'directly', 'mapped', 'to', 'the', 'jeffreys', 'model', 'which', 'is', 'essentially', 'macroscopic', 'in', 'nature', 'with', 'the', 'bulk', 'viscoelasticity', 'of', 'the', 'fluid', 'being', 'characterized', 'by', 'a', 'complex', 'elastic', 'modulus', 'gomega', 'further', 'we', 'demonstrate', 'that', 'the', 'concerned', 'greens', 'function', 'is', 'same', 'as', 'that', 'in', 'an', 'incompressible', 'low', 'reynolds', 'number', 'newtonian', 'fluid', 'with', 'the', 'simple', 'incorporation', 'of', 'frequency', 'dependence', 'in', 'the', 'viscosity', 'term', 'we', 'proceed', 'to', 'evaluate', 'the', 'trajectory', 'of', 'a', 'free', 'brownian', 'particle', 'in', 'a', 'viscoelastic', 'environment', 'using', 'our', 'formalism', 'and', 'calculate', 'parameters', 'such', 'as', 'the', 'power', 'spectral', 'density', 'the', 'autocorrelation', 'function', 'and', 'the', 'meansquare', 'displacement', 'which', 'we', 'then', 'extend', 'to', 'the', 'particle', 'confined', 'in', 'a', 'harmonic', 'potential', 'in', 'the', 'fluid']]
|
[-0.10640816616374928, 0.14938846106695125, -0.15622308219421158, 0.008245703853981178, -0.06206930821589461, -0.09802256357280692, -0.015456610621000599, 0.30216295935901677, -0.3273522751109236, -0.27082680353811783, 0.0326054909601689, -0.22991146027424914, -0.15549163348456715, 0.14721314654578782, -0.018221290257112804, 0.06663556033626768, 0.0016456819243230827, 0.042640327200868945, -0.04456553793257209, -0.14879774981160548, 0.2754412791128181, 0.054220739360542815, 0.25230341585008964, 0.04710014841436248, 0.129206673068641, 0.0006162247148373573, 0.009638882998101247, 0.09267758292436695, -0.1789648951882879, 0.04926365026225377, 0.19393602484143133, 0.016497950289089968, 0.23151017537868468, -0.4471438189043076, -0.2469770697067465, 0.055652210607555264, 0.13196948628982375, 0.11528103025541137, -0.008795688166075451, -0.22792688763113159, 0.03916407766852789, -0.18343074995413375, -0.1516572057060411, -0.08043747974239338, 0.037364281891922285, 0.0593657974883392, -0.27110713269490344, 0.17044438714766577, 0.03590694774582887, 0.020472978888328667, -0.13254093398654443, -0.08400807670869265, -0.036275625716788086, 0.09092013039559446, 0.06733011377598663, 0.0331720282285842, 0.18424711598285065, -0.17135076236663271, -0.033313903616515886, 0.4058843652723701, -0.12486015750498623, -0.296198722692859, 0.1931863766412731, -0.15236934063256166, -0.04462354937212387, 0.13377739598672053, 0.17551660172605685, 0.10549235887600074, -0.1919255080932431, 0.06827586087614007, -0.02747045435563062, 0.182781267415133, 0.05899109121613726, -0.04374484596833302, 0.18091024703251282, 0.16140030970452887, 0.021771115695784805, 0.1648837333210673, -0.08130306108991146, -0.11314756404104269, -0.32865749313169795, -0.17011513688235347, -0.24478539074682126, 0.07469536044640811, -0.11327347634806947, -0.19296984400327324, 0.3589415461741459, 0.14720437398097316, 0.19597535726323628, 0.0849205152128651, 0.28107957437539555, 0.17227284195291614, 0.02023667008000586, 0.06840298747774332, 0.2754276034890846, 0.15070858209210028, 0.11353550954710004, -0.27422895476927944, 0.02422875863096564, 0.08426111720793045]
|
1,803.04901
|
Topology and the optical Dirac equation
|
Through understanding Maxwell's equations as an effective Dirac equation (the
`optical Dirac equation'), we re--examine the relationship between
electromagnetic interface states and topology. We illustrate a simple case
where electromagnetic material parameters play the roles of `mass' and `energy'
in an equivalent Dirac equation. The modes trapped between a gyrotropic medium
and a mirror are then the counterpart of those at a `domain wall', where the
mass of the Dirac particle changes sign. Considering the general case of
arbitrary electromagnetic media, we provide an analytical proof relating the
integral of the Berry curvature (the Chern number) to the number of interface
states. We show that this reduces to the usual result for periodic media, and
also that the Chern number can be computed without knowledge of how the
material parameters depend on frequency.
|
physics.optics
|
through understanding maxwells equations as an effective dirac equation the optical dirac equation we reexamine the relationship between electromagnetic interface states and topology we illustrate a simple case where electromagnetic material parameters play the roles of mass and energy in an equivalent dirac equation the modes trapped between a gyrotropic medium and a mirror are then the counterpart of those at a domain wall where the mass of the dirac particle changes sign considering the general case of arbitrary electromagnetic media we provide an analytical proof relating the integral of the berry curvature the chern number to the number of interface states we show that this reduces to the usual result for periodic media and also that the chern number can be computed without knowledge of how the material parameters depend on frequency
|
[['through', 'understanding', 'maxwells', 'equations', 'as', 'an', 'effective', 'dirac', 'equation', 'the', 'optical', 'dirac', 'equation', 'we', 'reexamine', 'the', 'relationship', 'between', 'electromagnetic', 'interface', 'states', 'and', 'topology', 'we', 'illustrate', 'a', 'simple', 'case', 'where', 'electromagnetic', 'material', 'parameters', 'play', 'the', 'roles', 'of', 'mass', 'and', 'energy', 'in', 'an', 'equivalent', 'dirac', 'equation', 'the', 'modes', 'trapped', 'between', 'a', 'gyrotropic', 'medium', 'and', 'a', 'mirror', 'are', 'then', 'the', 'counterpart', 'of', 'those', 'at', 'a', 'domain', 'wall', 'where', 'the', 'mass', 'of', 'the', 'dirac', 'particle', 'changes', 'sign', 'considering', 'the', 'general', 'case', 'of', 'arbitrary', 'electromagnetic', 'media', 'we', 'provide', 'an', 'analytical', 'proof', 'relating', 'the', 'integral', 'of', 'the', 'berry', 'curvature', 'the', 'chern', 'number', 'to', 'the', 'number', 'of', 'interface', 'states', 'we', 'show', 'that', 'this', 'reduces', 'to', 'the', 'usual', 'result', 'for', 'periodic', 'media', 'and', 'also', 'that', 'the', 'chern', 'number', 'can', 'be', 'computed', 'without', 'knowledge', 'of', 'how', 'the', 'material', 'parameters', 'depend', 'on', 'frequency']]
|
[-0.18074515598468988, 0.16323322798000714, -0.06457615266308973, 0.04906250664848778, -0.13550071623719023, -0.0995550473164627, 0.03483312036378197, 0.3320407853706887, -0.25372564992902424, -0.32186448147968577, 0.03582686171744411, -0.2814369940240972, -0.18332215143311628, 0.18176650084796733, 0.016118807822318847, 0.0216020226681647, 0.014674689270611992, 0.03208566154812855, -0.07866821819356173, -0.15945992571182718, 0.3750477575668995, 0.004979865597490978, 0.26486912872502233, 0.08585796502411813, 0.08216616187132615, 0.020920779253181098, 0.020022431899674405, 0.0076074056411372095, -0.1316985926540311, 0.06547775748235049, 0.19884820369989575, -0.004554593350906345, 0.20461909255166924, -0.47472512257054333, -0.20176086269487115, 0.07895849411957022, 0.13016634600594135, 0.1238101129787729, -0.0722850169583847, -0.29200797726547245, 0.02231432373558444, -0.13658263640744345, -0.18641103446987786, -0.038483447276223874, 0.004234514836418002, 0.01702674510503622, -0.23677457712198557, 0.07347385379633713, 0.04091868788368048, 0.024183037521009493, -0.12027726333791432, -0.07267146902351423, -0.0660022849574181, 0.11665373648817938, 0.06357921641915196, -0.016650126158098754, 0.10850052424895584, -0.17456046243800424, -0.0684825019259706, 0.4056804963716663, -0.07474743511135641, -0.2684695385536529, 0.13956836058541125, -0.11798282980890874, -0.03321100881015111, 0.11984738276893259, 0.1602753545577757, 0.10688977000212535, -0.11035598331582698, 0.09624375156967208, -0.07534922221045297, 0.15478368590960517, 0.07263341223596967, 0.05508861638810415, 0.2163704979912679, 0.09859799528914623, 0.05344832261859726, 0.1357300541235862, -0.05274123483323457, -0.07265751457009885, -0.3353707192087532, -0.23029655043151287, -0.22787185143889452, 0.06698710734004512, -0.11263429114598994, -0.16893772598131931, 0.43204213914818557, 0.12941176799665155, 0.17203721060256535, 0.005629538971566616, 0.26687506888467905, 0.1741427676043214, 0.008643640768959335, 0.07859784749833713, 0.27054300495507405, 0.16203484868217624, 0.12477782218983131, -0.2695922123572852, -0.011446495011756966, 0.08183187696578584]
|
1,803.04902
|
Higher-order nonclassical properties of a shifted symmetric cat state
and a one-dimensional continuous superposition of coherent states
|
Role of quantum interference in the origin of higher-order nonclassical
characteristics of radiation field has been probed vis-a-vis a discrete and a
continuous superposition of coherent states. Specifically, the possibilities of
observing higher-order nonclassical properties (e.g., higher-order antibunching
(HOA), higher-order sub-Poissonian photon statistics (HOSPS), higher-order
squeezing (HOS) of Hong-Mandel type and Hillery type) have been investigated
using a shifted symmetric cat state that reduces to Yurke-Stoler, even and odd
coherent states at various limits. This shifted symmetric cat state which can
be viewed as a discrete superposition of coherent states is found to show HOA
and HOSPS. Similarly, higher-order nonclassical properties of a one-dimensional
continuous superposition of coherent states is also studied here. The
investigation has revealed the existence of HOS and HOSPS in the
one-dimensional continuous superposition of coherent states studied here.
Effect of non-Gaussianity inducing operations (e.g., photon addition and
addition followed by subtraction) on these superposition states have also been
investigated. Finally, some comparisons have been made between the higher-order
nonclassical properties of discrete and continuous superposition of coherent
states.
|
quant-ph
|
role of quantum interference in the origin of higherorder nonclassical characteristics of radiation field has been probed visavis a discrete and a continuous superposition of coherent states specifically the possibilities of observing higherorder nonclassical properties eg higherorder antibunching hoa higherorder subpoissonian photon statistics hosps higherorder squeezing hos of hongmandel type and hillery type have been investigated using a shifted symmetric cat state that reduces to yurkestoler even and odd coherent states at various limits this shifted symmetric cat state which can be viewed as a discrete superposition of coherent states is found to show hoa and hosps similarly higherorder nonclassical properties of a onedimensional continuous superposition of coherent states is also studied here the investigation has revealed the existence of hos and hosps in the onedimensional continuous superposition of coherent states studied here effect of nongaussianity inducing operations eg photon addition and addition followed by subtraction on these superposition states have also been investigated finally some comparisons have been made between the higherorder nonclassical properties of discrete and continuous superposition of coherent states
|
[['role', 'of', 'quantum', 'interference', 'in', 'the', 'origin', 'of', 'higherorder', 'nonclassical', 'characteristics', 'of', 'radiation', 'field', 'has', 'been', 'probed', 'visavis', 'a', 'discrete', 'and', 'a', 'continuous', 'superposition', 'of', 'coherent', 'states', 'specifically', 'the', 'possibilities', 'of', 'observing', 'higherorder', 'nonclassical', 'properties', 'eg', 'higherorder', 'antibunching', 'hoa', 'higherorder', 'subpoissonian', 'photon', 'statistics', 'hosps', 'higherorder', 'squeezing', 'hos', 'of', 'hongmandel', 'type', 'and', 'hillery', 'type', 'have', 'been', 'investigated', 'using', 'a', 'shifted', 'symmetric', 'cat', 'state', 'that', 'reduces', 'to', 'yurkestoler', 'even', 'and', 'odd', 'coherent', 'states', 'at', 'various', 'limits', 'this', 'shifted', 'symmetric', 'cat', 'state', 'which', 'can', 'be', 'viewed', 'as', 'a', 'discrete', 'superposition', 'of', 'coherent', 'states', 'is', 'found', 'to', 'show', 'hoa', 'and', 'hosps', 'similarly', 'higherorder', 'nonclassical', 'properties', 'of', 'a', 'onedimensional', 'continuous', 'superposition', 'of', 'coherent', 'states', 'is', 'also', 'studied', 'here', 'the', 'investigation', 'has', 'revealed', 'the', 'existence', 'of', 'hos', 'and', 'hosps', 'in', 'the', 'onedimensional', 'continuous', 'superposition', 'of', 'coherent', 'states', 'studied', 'here', 'effect', 'of', 'nongaussianity', 'inducing', 'operations', 'eg', 'photon', 'addition', 'and', 'addition', 'followed', 'by', 'subtraction', 'on', 'these', 'superposition', 'states', 'have', 'also', 'been', 'investigated', 'finally', 'some', 'comparisons', 'have', 'been', 'made', 'between', 'the', 'higherorder', 'nonclassical', 'properties', 'of', 'discrete', 'and', 'continuous', 'superposition', 'of', 'coherent', 'states']]
|
[-0.12911678190111597, 0.23166373657665587, -0.13044257908911483, 0.11092688375612926, -0.022362594864185834, -0.1562396675762801, 0.02142054040585187, 0.36781116095882965, -0.2648142867064173, -0.22423934969799378, 0.03784759749518438, -0.23855206327825096, -0.10387769761035014, 0.20573783938428442, 0.01048849737190916, 0.1098005320295433, 0.022670121866176066, 0.008612128410682169, -0.04261331816844513, -0.17429828456457638, 0.3375294766997154, -0.006087308275147282, 0.3207867419524818, 0.014599983322008842, 0.1050889519866922, 0.017924418387600796, -0.02206203185467351, 0.019479277684364058, -0.031059928039417567, 0.08417384752181407, 0.24074802056057218, 0.0759986346423346, 0.25832080570819405, -0.4085282523378816, -0.26204750315969905, 0.12798541867728694, 0.12651751808451375, 0.15909859882008198, -0.026174234735747166, -0.3805899732999202, 0.03421878873375971, -0.18722528530381663, -0.1406084200975652, -0.13051332950435923, 0.02240736991391824, 0.0446443462507487, -0.20191935307717737, 0.11480925407366978, 0.112496734127763, 0.05051955517759611, 0.016383174095555838, -0.0819056784946773, -0.07097301471808849, 0.06813977762647619, -0.056617882751423675, -0.059309621987530606, 0.06049809277036114, -0.13400405223718226, -0.22831444182726582, 0.3325530663671004, -0.07715085654477777, -0.1743690387017465, 0.15959964314141886, -0.12434663121572379, -0.1155009191494026, 0.12780421211983473, 0.14102584946930213, 0.10747984423291347, -0.06734193090855473, 0.042748696001507665, -0.04410520412910708, 0.18289259346195286, 0.17394672063545383, 0.22614796197774006, 0.17955409930588279, 0.0494635241493755, 0.00974658405478247, 0.20162109610681136, -0.09013643715533326, -0.1294378905982382, -0.29702603103689895, -0.14220671981002467, -0.20152767745621847, 0.08374535679181962, 0.017963446480827, -0.13601156929238684, 0.42278122201540397, 0.04535644848405712, 0.09662401349138404, -0.033365569399761284, 0.24197997068824795, 0.19388374629917668, 0.010783974608847861, -0.018186478493021897, 0.2756395797210549, 0.207059792653426, 0.031490427311348344, -0.24442749163082053, 0.055578734214293816, -0.015215785904771332]
|
1,803.04903
|
Global secondary bifurcation, symmetry breaking and period-doubling
|
In this paper we provide a criterion for global secondary bifurcation via
symmetry breaking. As an application, the occurrence of period-doubling
bifurcations for the Lugiato-Lefever equation is proved.
|
math.FA math.AP
|
in this paper we provide a criterion for global secondary bifurcation via symmetry breaking as an application the occurrence of perioddoubling bifurcations for the lugiatolefever equation is proved
|
[['in', 'this', 'paper', 'we', 'provide', 'a', 'criterion', 'for', 'global', 'secondary', 'bifurcation', 'via', 'symmetry', 'breaking', 'as', 'an', 'application', 'the', 'occurrence', 'of', 'perioddoubling', 'bifurcations', 'for', 'the', 'lugiatolefever', 'equation', 'is', 'proved']]
|
[-0.2344643721756126, 0.05407848590454835, -0.12530710947300708, 0.11085144896060228, -0.1111897431214207, -0.10319798611037966, 0.05461887453566305, 0.2464470308540123, -0.299295349179634, -0.1962722056279225, 0.16579556557865413, -0.1982242550833949, -0.2948153680190444, 0.1904358718810337, -0.022809593339583704, 0.08524421908493553, 0.035057158541998694, 0.035187241830239406, -0.0022105716301926543, -0.15772531128355435, 0.34894831265722004, 0.012909189531845706, 0.24387413822114468, 0.03320050813324217, 0.06471017618371531, -0.010073339649742203, 0.09647901449352503, -0.11885891688455429, -0.2593002960618053, -0.009927036140912346, 0.22953955448299115, 0.08656026093272626, 0.2561080679297447, -0.35102832057912436, -0.2373284819269819, 0.1175504536700568, 0.2543342538577105, 0.18963595646034395, -0.11028315027111343, -0.3150155876896211, 0.14513153310066887, -0.17277274946016924, -0.2186239769216627, -0.10914902455572571, 0.0065967354790440625, 0.018383795462016548, -0.3345114739744791, 0.11873065477370151, 0.1434763325710914, 0.20864153330746507, -0.09350284594776374, 0.07382881075942091, -0.13867851476451115, 0.0709309788653627, 0.09307405873966802, -0.057045125834909935, 0.028558272423522015, -0.06504567094712652, -0.15701967338100076, 0.374942405681525, -0.019301007335473384, -0.18452988597398093, 0.13747764312263047, -0.02035001166430967, -0.19535159555796003, 0.1517585970993553, 0.1450990730497454, 0.0951482914720795, -0.1373528428375721, 0.02110850079251187, -0.02282876068992274, 0.09462160856596061, 0.14258011101212884, -0.014811606163025967, 0.15006893408384972, 0.24600809545622074, 0.15344840670669718, 0.20298319469605172, -0.05415978745233068, -0.1028215644348945, -0.3710447543167642, -0.15085616494928086, -0.11796758915962917, 0.0699989559029096, -0.05071014481862741, -0.17254412533449276, 0.443473821106766, 0.07701410778931209, 0.21072578689615643, 0.026675902124095176, 0.2411557166737371, 0.23771417932169112, -0.05145546421408653, 0.0028765955108350943, 0.25231801103135304, 0.1580361086609108, 0.1351161252574197, -0.2425536656519398, 0.01109200351805027, 0.2003750425563859]
|
1,803.04904
|
On cosmology in nonlinear multidimensional gravity with multiple factor
spaces
|
Within the scope of multidimensional Kaluza--Klein gravity with nonlinear
curvature terms and two spherical extra spaces of dimensions $m$ and $n$, we
study the properties of an effective action for the scale factors of the extra
dimensions. Dimensional reduction leads to an effective 4D multiscalar-tensor
theory. Based on qualitative estimates of the Casimir energy contribution on a
physically reasonable length scale, we demonstrate the existence of such sets
of initial parameters of the theory in the case $m=n$ that provide a minimum of
the effective potential that yield a fine-tuned value of the effective 4D
cosmological constant. The corresponding size of extra dimensions depends of
which conformal frame is interpreted as the observational one: it is about
three orders of magnitude larger than the standard Planck length if we adhere
to the Einstein frame, but it is $n$-dependent in the Jordan frame, and its
invisibility requirement restricts the total dimension to values $D = 4+2n \leq
20$.
|
gr-qc
|
within the scope of multidimensional kaluzaklein gravity with nonlinear curvature terms and two spherical extra spaces of dimensions m and n we study the properties of an effective action for the scale factors of the extra dimensions dimensional reduction leads to an effective 4d multiscalartensor theory based on qualitative estimates of the casimir energy contribution on a physically reasonable length scale we demonstrate the existence of such sets of initial parameters of the theory in the case mn that provide a minimum of the effective potential that yield a finetuned value of the effective 4d cosmological constant the corresponding size of extra dimensions depends of which conformal frame is interpreted as the observational one it is about three orders of magnitude larger than the standard planck length if we adhere to the einstein frame but it is ndependent in the jordan frame and its invisibility requirement restricts the total dimension to values d 42n leq 20
|
[['within', 'the', 'scope', 'of', 'multidimensional', 'kaluzaklein', 'gravity', 'with', 'nonlinear', 'curvature', 'terms', 'and', 'two', 'spherical', 'extra', 'spaces', 'of', 'dimensions', 'm', 'and', 'n', 'we', 'study', 'the', 'properties', 'of', 'an', 'effective', 'action', 'for', 'the', 'scale', 'factors', 'of', 'the', 'extra', 'dimensions', 'dimensional', 'reduction', 'leads', 'to', 'an', 'effective', '4d', 'multiscalartensor', 'theory', 'based', 'on', 'qualitative', 'estimates', 'of', 'the', 'casimir', 'energy', 'contribution', 'on', 'a', 'physically', 'reasonable', 'length', 'scale', 'we', 'demonstrate', 'the', 'existence', 'of', 'such', 'sets', 'of', 'initial', 'parameters', 'of', 'the', 'theory', 'in', 'the', 'case', 'mn', 'that', 'provide', 'a', 'minimum', 'of', 'the', 'effective', 'potential', 'that', 'yield', 'a', 'finetuned', 'value', 'of', 'the', 'effective', '4d', 'cosmological', 'constant', 'the', 'corresponding', 'size', 'of', 'extra', 'dimensions', 'depends', 'of', 'which', 'conformal', 'frame', 'is', 'interpreted', 'as', 'the', 'observational', 'one', 'it', 'is', 'about', 'three', 'orders', 'of', 'magnitude', 'larger', 'than', 'the', 'standard', 'planck', 'length', 'if', 'we', 'adhere', 'to', 'the', 'einstein', 'frame', 'but', 'it', 'is', 'ndependent', 'in', 'the', 'jordan', 'frame', 'and', 'its', 'invisibility', 'requirement', 'restricts', 'the', 'total', 'dimension', 'to', 'values', 'd', '42n', 'leq', '20']]
|
[-0.13883054779263404, 0.13769073079385682, -0.03454918917664028, 0.07590066435081191, -0.061825767550498054, -0.11791146158849677, -0.014269074918373894, 0.3030954691960524, -0.20835863657964346, -0.31250660868588453, 0.07209234435606796, -0.2607781635030197, -0.10925026193935758, 0.1622182264109142, -0.03401166764393938, 0.02446977960108854, 0.000107941862482291, 0.11432293123876801, -0.10511460510464624, -0.2901102548930794, 0.3466643675406559, 0.0685674136904522, 0.2502127701811379, 0.04809345791223817, 0.11591634884452781, -0.0038346366356843365, -0.0039810283618489616, 0.05950083441805477, -0.1658107539948012, 0.1628335186650451, 0.16497166491059873, 0.0817253737940262, 0.2198774272767015, -0.3796715041434464, -0.22859866834150103, 0.09077300702950034, 0.11538417041391277, 0.11143092173696435, 0.016841216226263594, -0.22317323970417371, 0.08787558646424888, -0.13601419877243012, -0.16517564782108635, -0.03820148672765264, 0.07352889825900395, -0.07528644686905094, -0.2817054754003691, 0.09045138921609554, 0.05002410825676261, 0.040840134949972615, -0.10296989729230961, -0.12233180059000659, -0.017366923129138272, 0.1032711850271787, 0.10380827209416729, 0.03201445681490721, 0.112071365121758, -0.12854859505195912, -0.06874499742452127, 0.4024238005155124, -0.10112721282283206, -0.23496295139790538, 0.16926740716623428, -0.135188384430083, -0.0717014454287262, 0.10964711233436202, 0.12946708477848473, 0.11524495936166017, -0.08664572086388198, 0.17477528605116113, -0.03638687022687055, 0.21518703548906323, 0.11399495075322473, 0.08016884108469523, 0.18956325601828164, 0.151840431884361, 0.08774904125274564, 0.10189767302766156, -0.05297407976094968, -0.07719203546898476, -0.39218893890770584, -0.15300939520761275, -0.1618557037272228, 0.1014503653620919, -0.20451868299548948, -0.15348635336909539, 0.36729919468649685, 0.14202193903372226, 0.21499054595374334, 0.05984619990638935, 0.24693884979336497, 0.10440682200603008, 0.11398182033101478, 0.057724679088912524, 0.2612312690128023, 0.09817031724527717, 0.051599552133269846, -0.2281521737906867, -0.04412051290740074, 0.10889767795854893]
|
1,803.04905
|
On the KKLT Goldstino
|
We construct general asymptotically Klebanov-Strassler solutions of a five
dimensional $SU(2) \times SU(2) \times \mathbb{Z}_2\times \mathbb{Z}_{2R}$
truncation of IIB supergravity on $ T^{1,1} $, that break supersymmetry. This
generalizes results in the literature for the $SU(2) \times SU(2) \times
\mathbb{Z}_2\times U(1)_R$ case, to a truncation that is general enough to
capture the deformation of the conifold in the IR. We observe that there are
only two SUSY-breaking modes even in this generalized set up, and by
holographically computing Ward identities, we confirm that only one of them
corresponds to spontaneous breaking: this is the mode triggered by smeared
anti-D3 branes at the tip of the warped throat. Along the way, we address some
aspects of the holographic computation of one-point functions of marginal and
relevant operators in the cascading gauge theory. Our results strengthen the
evidence that {\it if} the KKLT construction is meta-stable, it is indeed a
spontaneously SUSY-broken (and therefore bona fide) vacuum of string theory.
|
hep-th
|
we construct general asymptotically klebanovstrassler solutions of a five dimensional su2 times su2 times mathbbz_2times mathbbz_2r truncation of iib supergravity on t11 that break supersymmetry this generalizes results in the literature for the su2 times su2 times mathbbz_2times u1_r case to a truncation that is general enough to capture the deformation of the conifold in the ir we observe that there are only two susybreaking modes even in this generalized set up and by holographically computing ward identities we confirm that only one of them corresponds to spontaneous breaking this is the mode triggered by smeared antid3 branes at the tip of the warped throat along the way we address some aspects of the holographic computation of onepoint functions of marginal and relevant operators in the cascading gauge theory our results strengthen the evidence that it if the kklt construction is metastable it is indeed a spontaneously susybroken and therefore bona fide vacuum of string theory
|
[['we', 'construct', 'general', 'asymptotically', 'klebanovstrassler', 'solutions', 'of', 'a', 'five', 'dimensional', 'su2', 'times', 'su2', 'times', 'mathbbz_2times', 'mathbbz_2r', 'truncation', 'of', 'iib', 'supergravity', 'on', 't11', 'that', 'break', 'supersymmetry', 'this', 'generalizes', 'results', 'in', 'the', 'literature', 'for', 'the', 'su2', 'times', 'su2', 'times', 'mathbbz_2times', 'u1_r', 'case', 'to', 'a', 'truncation', 'that', 'is', 'general', 'enough', 'to', 'capture', 'the', 'deformation', 'of', 'the', 'conifold', 'in', 'the', 'ir', 'we', 'observe', 'that', 'there', 'are', 'only', 'two', 'susybreaking', 'modes', 'even', 'in', 'this', 'generalized', 'set', 'up', 'and', 'by', 'holographically', 'computing', 'ward', 'identities', 'we', 'confirm', 'that', 'only', 'one', 'of', 'them', 'corresponds', 'to', 'spontaneous', 'breaking', 'this', 'is', 'the', 'mode', 'triggered', 'by', 'smeared', 'antid3', 'branes', 'at', 'the', 'tip', 'of', 'the', 'warped', 'throat', 'along', 'the', 'way', 'we', 'address', 'some', 'aspects', 'of', 'the', 'holographic', 'computation', 'of', 'onepoint', 'functions', 'of', 'marginal', 'and', 'relevant', 'operators', 'in', 'the', 'cascading', 'gauge', 'theory', 'our', 'results', 'strengthen', 'the', 'evidence', 'that', 'it', 'if', 'the', 'kklt', 'construction', 'is', 'metastable', 'it', 'is', 'indeed', 'a', 'spontaneously', 'susybroken', 'and', 'therefore', 'bona', 'fide', 'vacuum', 'of', 'string', 'theory']]
|
[-0.14337298481935454, 0.16060924776979993, -0.07111771295087473, 0.1179009684188772, -0.05829059710996526, -0.15625378954855185, 0.026871389610272262, 0.32430828289549435, -0.14367901903066424, -0.21830512762009616, 0.14117254763691417, -0.26145850387552094, -0.16422582608197003, 0.08608572325038333, -0.08628443115101676, -0.015911783494295614, -0.016173161319907634, 0.015827977331355214, -0.10878007655302363, -0.28295504516891895, 0.32615178214731594, -0.017439143591740678, 0.28975859054274133, 0.027524217349597282, 0.09520793376310217, -0.048879203843253276, 0.003307856790601246, -0.031860558490359014, -0.13150289516779595, 0.09380271204356705, 0.22917808240257023, 0.07629370479393871, 0.13046082485347024, -0.4550273358100845, -0.1821551345752537, 0.11125719334719883, 0.1753681541044986, 0.16807439777879946, -0.0009424269176839341, -0.27895368646319596, 0.10129720498357088, -0.17748337287095287, -0.20011135027368343, -0.09537340789327338, 0.01927211182191968, -0.12697666801752583, -0.2487973797901143, 0.094620170104768, 0.022022691819696658, -0.01106262132976084, -0.030537406712650293, -0.02167502834852184, -0.097098868003776, 0.028091478516017235, 0.18910650672210802, 0.07263843197330472, 0.12832148382740635, -0.16800812773782978, -0.13374609124035605, 0.33871795506246627, -0.03591708926664245, -0.17898357146599841, 0.152870732425682, -0.13340057752005036, -0.20736103265456135, 0.1250852869463063, 0.05290180156307836, 0.1719859414403477, -0.10383473115883046, 0.1865327415195474, -0.05851475250036005, 0.14844617040887956, 0.11487014967152068, 0.0598725106845039, 0.2303821053115591, 0.11117190059589883, 0.05830320992559615, 0.13737955274240624, -0.013819959807217182, -0.12446597970631575, -0.4397041427572408, -0.11026254375183564, -0.11663153604810847, 0.13264604395916385, -0.15623542647855732, -0.14578612533908697, 0.3780902430655495, 0.10534807544975211, 0.1869615891167233, 0.05373296889686777, 0.20736466113237603, 0.0914085867064592, 0.11489716154793578, 0.05757325806001562, 0.24435906918933464, 0.12141231987024508, 0.04554896026008552, -0.2503839159804967, -0.1271138688083738, 0.15785876681367236]
|
1,803.04906
|
Diagnostic-Driven Nonstationary Emulators Using Kernel Mixtures
|
Weakly stationary Gaussian processes (GPs) are the principal tool in the
statistical approaches to the design and analysis of computer experiments (or
Uncertainty Quantification). Such processes are fitted to computer model output
using a set of training runs to learn the parameters of the process covariance
kernel. The stationarity assumption is often adequate, yet can lead to poor
predictive performance when the model response exhibits nonstationarity, for
example, if its smoothness varies across the input space. In this paper, we
introduce a diagnostic-led approach to fitting nonstationary GP emulators by
specifying finite mixtures of region-specific covariance kernels. Our method
first fits a stationary GP and, if traditional diagnostics exhibit
nonstationarity, those diagnostics are used to fit appropriate mixing functions
for a covariance kernel mixture designed to capture the nonstationarity,
ensuring an emulator that is continuous in parameter space and readily
interpretable. We compare our approach to the principal nonstationary GP models
in the literature and illustrate its performance on a number of idealised test
cases and in an application to modelling the cloud parameterization of the
French climate model.
|
stat.ME
|
weakly stationary gaussian processes gps are the principal tool in the statistical approaches to the design and analysis of computer experiments or uncertainty quantification such processes are fitted to computer model output using a set of training runs to learn the parameters of the process covariance kernel the stationarity assumption is often adequate yet can lead to poor predictive performance when the model response exhibits nonstationarity for example if its smoothness varies across the input space in this paper we introduce a diagnosticled approach to fitting nonstationary gp emulators by specifying finite mixtures of regionspecific covariance kernels our method first fits a stationary gp and if traditional diagnostics exhibit nonstationarity those diagnostics are used to fit appropriate mixing functions for a covariance kernel mixture designed to capture the nonstationarity ensuring an emulator that is continuous in parameter space and readily interpretable we compare our approach to the principal nonstationary gp models in the literature and illustrate its performance on a number of idealised test cases and in an application to modelling the cloud parameterization of the french climate model
|
[['weakly', 'stationary', 'gaussian', 'processes', 'gps', 'are', 'the', 'principal', 'tool', 'in', 'the', 'statistical', 'approaches', 'to', 'the', 'design', 'and', 'analysis', 'of', 'computer', 'experiments', 'or', 'uncertainty', 'quantification', 'such', 'processes', 'are', 'fitted', 'to', 'computer', 'model', 'output', 'using', 'a', 'set', 'of', 'training', 'runs', 'to', 'learn', 'the', 'parameters', 'of', 'the', 'process', 'covariance', 'kernel', 'the', 'stationarity', 'assumption', 'is', 'often', 'adequate', 'yet', 'can', 'lead', 'to', 'poor', 'predictive', 'performance', 'when', 'the', 'model', 'response', 'exhibits', 'nonstationarity', 'for', 'example', 'if', 'its', 'smoothness', 'varies', 'across', 'the', 'input', 'space', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'diagnosticled', 'approach', 'to', 'fitting', 'nonstationary', 'gp', 'emulators', 'by', 'specifying', 'finite', 'mixtures', 'of', 'regionspecific', 'covariance', 'kernels', 'our', 'method', 'first', 'fits', 'a', 'stationary', 'gp', 'and', 'if', 'traditional', 'diagnostics', 'exhibit', 'nonstationarity', 'those', 'diagnostics', 'are', 'used', 'to', 'fit', 'appropriate', 'mixing', 'functions', 'for', 'a', 'covariance', 'kernel', 'mixture', 'designed', 'to', 'capture', 'the', 'nonstationarity', 'ensuring', 'an', 'emulator', 'that', 'is', 'continuous', 'in', 'parameter', 'space', 'and', 'readily', 'interpretable', 'we', 'compare', 'our', 'approach', 'to', 'the', 'principal', 'nonstationary', 'gp', 'models', 'in', 'the', 'literature', 'and', 'illustrate', 'its', 'performance', 'on', 'a', 'number', 'of', 'idealised', 'test', 'cases', 'and', 'in', 'an', 'application', 'to', 'modelling', 'the', 'cloud', 'parameterization', 'of', 'the', 'french', 'climate', 'model']]
|
[-0.004154423187654256, 0.02097949369047282, -0.11067421472987181, 0.11262507210301081, -0.09331285798650109, -0.14642991798699656, 0.01058040127443317, 0.4234416338855798, -0.28552203565532486, -0.2932552707517582, 0.1082848133961572, -0.22669543081821267, -0.14848870581690893, 0.2105802019856598, -0.07100945094265462, 0.12165713845948385, 0.060952822180736936, -0.016180997900141592, -0.06995463859174778, -0.23245869927877413, 0.2804300160503036, 0.07321549573222573, 0.3149092912626861, -0.0624940256938715, 0.09928327701263799, -0.03212706373188268, -0.060466421811234496, -0.02513558710126765, -0.08225002755258747, 0.11611146645442572, 0.27083239695044603, 0.18910237792565415, 0.2956090901842278, -0.38356893511196033, -0.26515364564766875, 0.14195767624874003, 0.11430015950986927, 0.05975647455832157, 0.04141539730147323, -0.28076162207034533, 0.03612287929333914, -0.17555783874763364, -0.11169554102574632, -0.15323993989025778, -0.0234092583688855, 0.023874928735280306, -0.37244493297688414, 0.07728922205814945, 0.08229768490471114, 0.059382184690487144, -0.0523707831966471, -0.09637371441767958, 0.019412735483630067, 0.11208864708847675, 0.04199748269718512, -0.018827243663600824, 0.1521363554030573, -0.12185592238995341, -0.07870772990706806, 0.3536826089898313, -0.07748785555582452, -0.26488688341184946, 0.21763771494557516, -0.10386438941154001, -0.14217551381410926, 0.0961631557033031, 0.2357794675136278, 0.060351551638581274, -0.1682324565446241, 0.09484014338964146, -0.012053944177015193, 0.17595270128784637, 0.009628774688495427, -0.04075362149291159, 0.15763559228390078, 0.20461632324555323, 0.022173315109724305, 0.126868732846499, -0.10371163899973009, -0.1159490071684436, -0.2973296114850496, -0.0971468984557504, -0.18458008113986907, -0.013652087043410983, -0.13430604259337997, -0.21577934879036895, 0.412754137634059, 0.2027233370260618, 0.18935783490999025, 0.07891410885864654, 0.3351223408440756, 0.11435923989140494, 0.020727100965221613, 0.07668956652351687, 0.1562582402688901, 0.10825331518661985, 0.046054046901905635, -0.17417312388862954, 0.13926981390961393, -0.008793292224428125]
|
1,803.04907
|
Quantization of Fully Convolutional Networks for Accurate Biomedical
Image Segmentation
|
With pervasive applications of medical imaging in health-care, biomedical
image segmentation plays a central role in quantitative analysis, clinical
diagno- sis, and medical intervention. Since manual anno- tation su ers limited
reproducibility, arduous e orts, and excessive time, automatic segmentation is
desired to process increasingly larger scale histopathological data. Recently,
deep neural networks (DNNs), par- ticularly fully convolutional networks
(FCNs), have been widely applied to biomedical image segmenta- tion, attaining
much improved performance. At the same time, quantization of DNNs has become an
ac- tive research topic, which aims to represent weights with less memory
(precision) to considerably reduce memory and computation requirements of DNNs
while maintaining acceptable accuracy. In this paper, we apply quantization
techniques to FCNs for accurate biomedical image segmentation. Unlike existing
litera- ture on quantization which primarily targets memory and computation
complexity reduction, we apply quan- tization as a method to reduce over tting
in FCNs for better accuracy. Speci cally, we focus on a state-of- the-art
segmentation framework, suggestive annotation [22], which judiciously extracts
representative annota- tion samples from the original training dataset, obtain-
ing an e ective small-sized balanced training dataset. We develop two new
quantization processes for this framework: (1) suggestive annotation with
quantiza- tion for highly representative training samples, and (2) network
training with quantization for high accuracy. Extensive experiments on the
MICCAI Gland dataset show that both quantization processes can improve the
segmentation performance, and our proposed method exceeds the current
state-of-the-art performance by up to 1%. In addition, our method has a
reduction of up to 6.4x on memory usage.
|
cs.CV
|
with pervasive applications of medical imaging in healthcare biomedical image segmentation plays a central role in quantitative analysis clinical diagno sis and medical intervention since manual anno tation su ers limited reproducibility arduous e orts and excessive time automatic segmentation is desired to process increasingly larger scale histopathological data recently deep neural networks dnns par ticularly fully convolutional networks fcns have been widely applied to biomedical image segmenta tion attaining much improved performance at the same time quantization of dnns has become an ac tive research topic which aims to represent weights with less memory precision to considerably reduce memory and computation requirements of dnns while maintaining acceptable accuracy in this paper we apply quantization techniques to fcns for accurate biomedical image segmentation unlike existing litera ture on quantization which primarily targets memory and computation complexity reduction we apply quan tization as a method to reduce over tting in fcns for better accuracy speci cally we focus on a stateof theart segmentation framework suggestive annotation 22 which judiciously extracts representative annota tion samples from the original training dataset obtain ing an e ective smallsized balanced training dataset we develop two new quantization processes for this framework 1 suggestive annotation with quantiza tion for highly representative training samples and 2 network training with quantization for high accuracy extensive experiments on the miccai gland dataset show that both quantization processes can improve the segmentation performance and our proposed method exceeds the current stateoftheart performance by up to 1 in addition our method has a reduction of up to 64x on memory usage
|
[['with', 'pervasive', 'applications', 'of', 'medical', 'imaging', 'in', 'healthcare', 'biomedical', 'image', 'segmentation', 'plays', 'a', 'central', 'role', 'in', 'quantitative', 'analysis', 'clinical', 'diagno', 'sis', 'and', 'medical', 'intervention', 'since', 'manual', 'anno', 'tation', 'su', 'ers', 'limited', 'reproducibility', 'arduous', 'e', 'orts', 'and', 'excessive', 'time', 'automatic', 'segmentation', 'is', 'desired', 'to', 'process', 'increasingly', 'larger', 'scale', 'histopathological', 'data', 'recently', 'deep', 'neural', 'networks', 'dnns', 'par', 'ticularly', 'fully', 'convolutional', 'networks', 'fcns', 'have', 'been', 'widely', 'applied', 'to', 'biomedical', 'image', 'segmenta', 'tion', 'attaining', 'much', 'improved', 'performance', 'at', 'the', 'same', 'time', 'quantization', 'of', 'dnns', 'has', 'become', 'an', 'ac', 'tive', 'research', 'topic', 'which', 'aims', 'to', 'represent', 'weights', 'with', 'less', 'memory', 'precision', 'to', 'considerably', 'reduce', 'memory', 'and', 'computation', 'requirements', 'of', 'dnns', 'while', 'maintaining', 'acceptable', 'accuracy', 'in', 'this', 'paper', 'we', 'apply', 'quantization', 'techniques', 'to', 'fcns', 'for', 'accurate', 'biomedical', 'image', 'segmentation', 'unlike', 'existing', 'litera', 'ture', 'on', 'quantization', 'which', 'primarily', 'targets', 'memory', 'and', 'computation', 'complexity', 'reduction', 'we', 'apply', 'quan', 'tization', 'as', 'a', 'method', 'to', 'reduce', 'over', 'tting', 'in', 'fcns', 'for', 'better', 'accuracy', 'speci', 'cally', 'we', 'focus', 'on', 'a', 'stateof', 'theart', 'segmentation', 'framework', 'suggestive', 'annotation', '22', 'which', 'judiciously', 'extracts', 'representative', 'annota', 'tion', 'samples', 'from', 'the', 'original', 'training', 'dataset', 'obtain', 'ing', 'an', 'e', 'ective', 'smallsized', 'balanced', 'training', 'dataset', 'we', 'develop', 'two', 'new', 'quantization', 'processes', 'for', 'this', 'framework', '1', 'suggestive', 'annotation', 'with', 'quantiza', 'tion', 'for', 'highly', 'representative', 'training', 'samples', 'and', '2', 'network', 'training', 'with', 'quantization', 'for', 'high', 'accuracy', 'extensive', 'experiments', 'on', 'the', 'miccai', 'gland', 'dataset', 'show', 'that', 'both', 'quantization', 'processes', 'can', 'improve', 'the', 'segmentation', 'performance', 'and', 'our', 'proposed', 'method', 'exceeds', 'the', 'current', 'stateoftheart', 'performance', 'by', 'up', 'to', '1', 'in', 'addition', 'our', 'method', 'has', 'a', 'reduction', 'of', 'up', 'to', '64x', 'on', 'memory', 'usage']]
|
[-0.024492799095334666, -0.01876803054462881, -0.013215922706705682, 0.04814369059331155, -0.09473988859749892, -0.17246847300534593, 0.04042108173358857, 0.4465243091697202, -0.20080459678509072, -0.3749293981813917, 0.0916158611249343, -0.26393472214832026, -0.13894803807522882, 0.21256577278505645, -0.18254397916584733, 0.12183020952449856, 0.17792019591137181, 0.021817032938512664, -0.04488975523477968, -0.31116883300162634, 0.21143085822136617, 0.09982074348281102, 0.4170652674109328, 0.02944334528623514, 0.1242929789642849, -0.025323306251712162, -0.03890040784015083, -0.048739958211651765, -0.05440965801418654, 0.1684737227249927, 0.3432006944546147, 0.16171949700744567, 0.3429144634682612, -0.42692724457923686, -0.24776493215422127, 0.07929530780461123, 0.17693232883061236, 0.0854216674713112, -0.05220150044187903, -0.31335647468290784, 0.12691963966388037, -0.15887657999261923, 0.06164687801262035, -0.180822096655474, 0.0055360344302493565, -0.05041082041296999, -0.28714789749287506, 0.05851751055531934, 0.057579373639515215, 0.09339356238351149, -0.06119284255649237, -0.14628308991280695, 0.03377748862520664, 0.1476730722778787, -0.020546175514955037, 0.11385185581485868, 0.14173709743418822, -0.21047544358426581, -0.12544222295617538, 0.31891149586687484, -0.0272698918499016, -0.19776485926818613, 0.18451114403558713, -0.01964054704808137, -0.17894858616203363, 0.1337610157927973, 0.23562740490055076, 0.10401035843088346, -0.1425672272384605, 0.014642981122540054, 0.05422578723804441, 0.19071389449276396, 0.08476276226323463, 0.007036634182155717, 0.10021172535112675, 0.3042527463367008, 0.03391537207667259, 0.11802769098430872, -0.15472064950119924, -0.04738302881208559, -0.1666960423598842, -0.11537896494384554, -0.15819849332283234, 0.006000254332891428, -0.08588720033385827, -0.14869515648221268, 0.35924200868124473, 0.23757020382429747, 0.16148098105126443, 0.09873930618084747, 0.3611497852220839, 0.014002437321880066, 0.1583783127264777, 0.07315168912412927, 0.15946136006546735, 0.023314579740376668, 0.16094024478567434, -0.18705438400582208, 0.0733358779228201, 0.0431861534851658]
|
1,803.04908
|
Low complexity algorithms in knot theory
|
We show that the genus problem for alternating knots with $n$ crossings has
linear time complexity and is in Logspace$(n)$. Almost all alternating knots of
given genus possess additional combinatorial structure, we call them standard.
We show that the genus problem for these knots belongs to $TC^0$ circuit
complexity class. We also show, that the equivalence problem for such knots
with $n$ crossings has time complexity $n\log (n)$ and is in Logspace$(n)$ and
$TC^{0}$ complexity classes.
|
math.GT math.CO math.GR
|
we show that the genus problem for alternating knots with n crossings has linear time complexity and is in logspacen almost all alternating knots of given genus possess additional combinatorial structure we call them standard we show that the genus problem for these knots belongs to tc0 circuit complexity class we also show that the equivalence problem for such knots with n crossings has time complexity nlog n and is in logspacen and tc0 complexity classes
|
[['we', 'show', 'that', 'the', 'genus', 'problem', 'for', 'alternating', 'knots', 'with', 'n', 'crossings', 'has', 'linear', 'time', 'complexity', 'and', 'is', 'in', 'logspacen', 'almost', 'all', 'alternating', 'knots', 'of', 'given', 'genus', 'possess', 'additional', 'combinatorial', 'structure', 'we', 'call', 'them', 'standard', 'we', 'show', 'that', 'the', 'genus', 'problem', 'for', 'these', 'knots', 'belongs', 'to', 'tc0', 'circuit', 'complexity', 'class', 'we', 'also', 'show', 'that', 'the', 'equivalence', 'problem', 'for', 'such', 'knots', 'with', 'n', 'crossings', 'has', 'time', 'complexity', 'nlog', 'n', 'and', 'is', 'in', 'logspacen', 'and', 'tc0', 'complexity', 'classes']]
|
[-0.2241047251768209, 0.11955799902411732, -0.032359515146880936, 0.08397951589054051, -0.07312149740126286, -0.19617552965929783, 0.04669039482502518, 0.44212171173578985, -0.3176659719666114, -0.35459920633080844, 0.03633358994045773, -0.2502054638556532, -0.17519130644300399, 0.21138250095316688, -0.08938228058930789, 0.062412603053490855, 0.050018505394660136, 0.039563686278573165, -0.07134908438191004, -0.34001896801920656, 0.31061302236205823, -0.09180240778604874, 0.15960628691607634, 0.025455254406945127, 0.07582012747062018, -0.060255476254718124, 0.08463941100431052, 0.06272983016773455, -0.15103004981181192, 0.06487148439643804, 0.29452144326893864, 0.11276308907749685, 0.17405245060138907, -0.40089470610601474, -0.16156375646037427, 0.1845271864377365, 0.15822957376823635, 0.04434039562034446, -0.026338262571575673, -0.16086196418650248, 0.11531052958044047, -0.08501407926952517, -0.1480476594328679, -0.037204764110061364, 0.08078428011739978, -0.0016957079941356504, -0.18319690530581675, 0.005330970327958238, 0.08582261679819911, 0.05811405916874473, 0.05023867036593524, -0.1485614308889175, 0.03704691580748437, 0.08874256109718133, 0.040028757006685074, 0.04027855595749979, -0.03885364305303508, -0.13844677954408768, -0.1839419248501292, 0.3180327620357275, -0.013866041925408551, -0.18033600596056595, 0.18315159920854746, -0.11422871354876112, -0.24742892435814784, 0.21077318896061262, 0.09042479345776341, 0.11347765100465433, 0.024934173359479, 0.21027002422960248, -0.147517209117477, 0.2088207564744595, 0.10670595098840627, 0.0033850302365986077, 0.05815437894843116, 0.10887383349315338, 0.12581533289866875, 0.2472950614535728, -0.04406773631588392, -0.01723569312535629, -0.2783188411613574, -0.2610585283538377, -0.13124098743444207, 0.09561116039450909, -0.12987540049948007, -0.17606708850409533, 0.41430380416883006, 0.07372278400470277, 0.1643351263467323, 0.2515317478997482, 0.2564887732921823, 0.09650743266605344, 0.04564745755664803, 0.19329290185123682, 0.10232037498389145, 0.09626515406007702, -0.07381943382977231, -0.1769327252121592, 0.06860251118731056, 0.19030920935895396]
|
1,803.04909
|
Around logical perfection
|
In this article we present and describe a notion of "logical perfection". We
extract the notion of "perfection" from the contemporary logical concept of
categoricity. Categoricity (in power) has become in the past half century a
main driver of ideas in model theory, both mathematically (stability theory may
be regarded as a way of approximating categoricity) and philosophically. In the
past two decades, categoricity notions have started to overlap with more
classical notions of robustness and smoothness. These have been crucial in
various parts of mathematics since the nineteenth century. We postulate and
present the category of logical perfection. We draw on various notions of
perfection from mathematics of the 19th and 20th centuries and then trace the
relation to the concept of categoricity in power as a logical notion of what a
"mathematically perfect" structure is.
|
math.LO math.AG quant-ph
|
in this article we present and describe a notion of logical perfection we extract the notion of perfection from the contemporary logical concept of categoricity categoricity in power has become in the past half century a main driver of ideas in model theory both mathematically stability theory may be regarded as a way of approximating categoricity and philosophically in the past two decades categoricity notions have started to overlap with more classical notions of robustness and smoothness these have been crucial in various parts of mathematics since the nineteenth century we postulate and present the category of logical perfection we draw on various notions of perfection from mathematics of the 19th and 20th centuries and then trace the relation to the concept of categoricity in power as a logical notion of what a mathematically perfect structure is
|
[['in', 'this', 'article', 'we', 'present', 'and', 'describe', 'a', 'notion', 'of', 'logical', 'perfection', 'we', 'extract', 'the', 'notion', 'of', 'perfection', 'from', 'the', 'contemporary', 'logical', 'concept', 'of', 'categoricity', 'categoricity', 'in', 'power', 'has', 'become', 'in', 'the', 'past', 'half', 'century', 'a', 'main', 'driver', 'of', 'ideas', 'in', 'model', 'theory', 'both', 'mathematically', 'stability', 'theory', 'may', 'be', 'regarded', 'as', 'a', 'way', 'of', 'approximating', 'categoricity', 'and', 'philosophically', 'in', 'the', 'past', 'two', 'decades', 'categoricity', 'notions', 'have', 'started', 'to', 'overlap', 'with', 'more', 'classical', 'notions', 'of', 'robustness', 'and', 'smoothness', 'these', 'have', 'been', 'crucial', 'in', 'various', 'parts', 'of', 'mathematics', 'since', 'the', 'nineteenth', 'century', 'we', 'postulate', 'and', 'present', 'the', 'category', 'of', 'logical', 'perfection', 'we', 'draw', 'on', 'various', 'notions', 'of', 'perfection', 'from', 'mathematics', 'of', 'the', '19th', 'and', '20th', 'centuries', 'and', 'then', 'trace', 'the', 'relation', 'to', 'the', 'concept', 'of', 'categoricity', 'in', 'power', 'as', 'a', 'logical', 'notion', 'of', 'what', 'a', 'mathematically', 'perfect', 'structure', 'is']]
|
[-0.0678629704409476, 0.0751162927910468, -0.16369321502670373, 0.0961046703066337, -0.09713230733453793, -0.06500785692465784, 0.02783388540617795, 0.31849054996957527, -0.3325360928335819, -0.3076576933597833, 0.08704244302769266, -0.24080455010879215, -0.1570549279546542, 0.159118203866044, -0.1737916673173326, 0.03360064189378036, -0.01559201069176197, 0.06493580315166908, -0.0767943515904574, -0.2581201638587934, 0.3500630858415452, 0.040324886448436625, 0.28029793844877804, 0.06697476135879538, 0.09588499347353015, -0.024022515587862173, -0.025788274321732294, 0.03208551951854007, -0.15062568154794428, 0.16463995769443193, 0.29998030423111943, 0.22948614886390847, 0.39665800078353936, -0.4558749247179197, -0.16290557699917008, 0.09482732047768731, 0.04424074940964661, 0.10877903873087282, 0.0018699459843532977, -0.2437264669387445, 0.08017727890796279, -0.20476818589126541, -0.12938728421437043, -0.056514372853698196, 0.04646187302670068, -0.01545515563338995, -0.09762362484143788, 0.013435570104217606, 0.13899929592739382, 0.1935527565732707, -0.014490634420492353, -0.0793514527230911, -0.004151703796628183, 0.13687441407967985, 0.04625739457415431, -0.010056547971823029, 0.057810216282161264, -0.1236644985432988, -0.17913133245518933, 0.3684906928127047, 0.0016596518086446246, -0.12688539277789365, 0.18090375663753408, -0.15747272655585387, -0.17326185072561467, 0.035455875866876464, 0.10028567568256255, 0.09762463173880004, -0.12330041577007934, 0.09488711496016324, -0.06186256091361934, 0.12028481060108781, 0.1607253220132858, 0.08451868164655582, 0.2294970182498006, 0.17001163164819896, 0.026776624445796666, 0.13022195693550725, -0.009261575247072718, -0.15613902710296595, -0.28961628441610476, -0.18722265685677364, -0.11497112778763212, 0.09111055664813322, -0.022650451048652907, -0.17623350865132834, 0.41416300406312423, 0.19226956200135029, 0.1289645408239406, 0.07905279159593484, 0.26528043625536407, 0.07058522562317067, 0.04774282671456789, 0.01400128939957188, 0.28387844996241324, 0.24005796409545155, 0.11963716148310442, -0.04021524556021947, 0.11655345403106653, 0.10983117452115636]
|
1,803.0491
|
Experimental evidence of robust acoustic valley Hall edge states in a
non-resonant topological elastic waveguide
|
This paper presents experimental evidence of the existence of acoustic valley
Hall (AVHE) edge states in topological elastic waveguides. The fundamental
lattice is assembled based on a non-resonant unit where space inversion
symmetry (SIS) is broken by simply perturbing the underlying lattice geometry.
This aspect is in net contrast with existing elastic AVHE designs that exploit
locally-resonant units and require the addition of masses in order to break
SIS. The experimental results presented in this study validate findings so far
presented only at theoretical and numerical level. In particular, it is found
that edge modes can effectively propagate along domain walls between
topologically dissimilar domains and that disorder-induced backscattering is
substantially suppressed due to the weak coupling between oppositely
valley-polarized modes. The coupling between valley modes is also further
investigated and linked to an evident chiral flux of the mechanical energy.
Finally, we show that the weak coupling between the valleys can be exploited to
achieve selective mode injection at the domain wall, hence realizing a very
effective excitation strategy of the chiral edge states.
|
cond-mat.mes-hall
|
this paper presents experimental evidence of the existence of acoustic valley hall avhe edge states in topological elastic waveguides the fundamental lattice is assembled based on a nonresonant unit where space inversion symmetry sis is broken by simply perturbing the underlying lattice geometry this aspect is in net contrast with existing elastic avhe designs that exploit locallyresonant units and require the addition of masses in order to break sis the experimental results presented in this study validate findings so far presented only at theoretical and numerical level in particular it is found that edge modes can effectively propagate along domain walls between topologically dissimilar domains and that disorderinduced backscattering is substantially suppressed due to the weak coupling between oppositely valleypolarized modes the coupling between valley modes is also further investigated and linked to an evident chiral flux of the mechanical energy finally we show that the weak coupling between the valleys can be exploited to achieve selective mode injection at the domain wall hence realizing a very effective excitation strategy of the chiral edge states
|
[['this', 'paper', 'presents', 'experimental', 'evidence', 'of', 'the', 'existence', 'of', 'acoustic', 'valley', 'hall', 'avhe', 'edge', 'states', 'in', 'topological', 'elastic', 'waveguides', 'the', 'fundamental', 'lattice', 'is', 'assembled', 'based', 'on', 'a', 'nonresonant', 'unit', 'where', 'space', 'inversion', 'symmetry', 'sis', 'is', 'broken', 'by', 'simply', 'perturbing', 'the', 'underlying', 'lattice', 'geometry', 'this', 'aspect', 'is', 'in', 'net', 'contrast', 'with', 'existing', 'elastic', 'avhe', 'designs', 'that', 'exploit', 'locallyresonant', 'units', 'and', 'require', 'the', 'addition', 'of', 'masses', 'in', 'order', 'to', 'break', 'sis', 'the', 'experimental', 'results', 'presented', 'in', 'this', 'study', 'validate', 'findings', 'so', 'far', 'presented', 'only', 'at', 'theoretical', 'and', 'numerical', 'level', 'in', 'particular', 'it', 'is', 'found', 'that', 'edge', 'modes', 'can', 'effectively', 'propagate', 'along', 'domain', 'walls', 'between', 'topologically', 'dissimilar', 'domains', 'and', 'that', 'disorderinduced', 'backscattering', 'is', 'substantially', 'suppressed', 'due', 'to', 'the', 'weak', 'coupling', 'between', 'oppositely', 'valleypolarized', 'modes', 'the', 'coupling', 'between', 'valley', 'modes', 'is', 'also', 'further', 'investigated', 'and', 'linked', 'to', 'an', 'evident', 'chiral', 'flux', 'of', 'the', 'mechanical', 'energy', 'finally', 'we', 'show', 'that', 'the', 'weak', 'coupling', 'between', 'the', 'valleys', 'can', 'be', 'exploited', 'to', 'achieve', 'selective', 'mode', 'injection', 'at', 'the', 'domain', 'wall', 'hence', 'realizing', 'a', 'very', 'effective', 'excitation', 'strategy', 'of', 'the', 'chiral', 'edge', 'states']]
|
[-0.16879072778379126, 0.20443722532297998, -0.04917913162138722, 0.017940307579089407, -0.0824470354507898, -0.1474425033746944, 0.06598476534022955, 0.4109022656248376, -0.2745941837420526, -0.26948722108466433, 0.056400185983191985, -0.2641915024548898, -0.1602581176863757, 0.12907011044949207, 0.0019728707558760755, 0.014303635314612978, 0.028855586885084328, -0.04699310741381924, -0.021148285399207233, -0.14772154674246218, 0.3040780118165936, 0.019016859100087186, 0.3667647184298045, 0.12470009223681826, 0.03503483999453248, -0.013638967423392944, 0.04038725282345505, 0.021051856553056844, -0.12707541679584616, 0.10458531780531792, 0.24660297231129613, -0.05159569638808166, 0.18665902416700916, -0.47692448430495454, -0.18920757947624203, 0.060492173679417935, 0.17771921272394975, 0.1507861511404976, -0.05970625135027453, -0.28271974287819485, 0.09329672398400961, -0.12133210985194569, -0.13256676863028394, -0.07427536907610538, -0.006096414570303666, -0.0490259260388032, -0.2588449173547715, 0.07995887445467605, 0.06271441584463754, 0.04129622559025453, -0.03560699572426003, -0.07178129436249032, -0.10665347865874196, 0.08561733862078302, 0.07358824864441713, 0.022262102985691354, 0.12546835660549538, -0.11627691233600625, -0.14999952505348046, 0.35370289451695675, -0.03765194426187061, -0.19983508547894505, 0.2202835961869471, -0.14581600132780526, -0.0694408104034959, 0.13323004798414562, 0.15634248461194117, 0.061301871159819166, -0.09788152895534055, 0.06011934156228137, -0.01870734270290617, 0.17459905025551925, 0.06776827961378704, 0.070881743617948, 0.2459067475694, 0.16906818408099128, 0.0877254517544384, 0.15366975602228194, -0.09333177130855082, -0.06288625114742731, -0.292176506105229, -0.12089745727814519, -0.21844045748928093, 0.013561911940187044, -0.028810352714183186, -0.1281412695453777, 0.40886344189750234, 0.1438266309624204, 0.19789948256691714, -0.0033250268161124576, 0.29347986210611343, 0.12030811252266255, 0.09657918496563428, 0.053462268811559056, 0.32337315674774303, 0.1351828114230541, 0.07071601588688145, -0.2821711359594039, 0.015127255567860914, -0.013326441941983362]
|
1,803.04911
|
Some overdetermined problems related to the anisotropic capacity
|
We characterize the Wulff shape of an anisotropic norm in terms of solutions
to overdetermined problems for the Finsler $p$-capacity of a convex set $\Omega
\subset \mathbb{R}^N$, with $1<p<N$. In particular we show that if the Finsler
$p$-capacitary potential $u$ associated to $\Omega$ has two homothetic level
sets then $\Omega$ is Wulff shape. Moreover, we show that the concavity
exponent of $u$ is $q=-(p-1)/(N-p)$ if and only if $\Omega$ is Wulff shape.
|
math.AP
|
we characterize the wulff shape of an anisotropic norm in terms of solutions to overdetermined problems for the finsler pcapacity of a convex set omega subset mathbbrn with 1pn in particular we show that if the finsler pcapacitary potential u associated to omega has two homothetic level sets then omega is wulff shape moreover we show that the concavity exponent of u is qp1np if and only if omega is wulff shape
|
[['we', 'characterize', 'the', 'wulff', 'shape', 'of', 'an', 'anisotropic', 'norm', 'in', 'terms', 'of', 'solutions', 'to', 'overdetermined', 'problems', 'for', 'the', 'finsler', 'pcapacity', 'of', 'a', 'convex', 'set', 'omega', 'subset', 'mathbbrn', 'with', '1pn', 'in', 'particular', 'we', 'show', 'that', 'if', 'the', 'finsler', 'pcapacitary', 'potential', 'u', 'associated', 'to', 'omega', 'has', 'two', 'homothetic', 'level', 'sets', 'then', 'omega', 'is', 'wulff', 'shape', 'moreover', 'we', 'show', 'that', 'the', 'concavity', 'exponent', 'of', 'u', 'is', 'qp1np', 'if', 'and', 'only', 'if', 'omega', 'is', 'wulff', 'shape']]
|
[-0.1486337594294422, 0.03458784395541084, -0.07036754355518292, 0.03495173981170577, -0.12090605840129567, -0.12448806789847956, -0.05589950116167606, 0.4030918873007029, -0.36325864812595327, -0.14027347361249193, 0.07207215567853983, -0.3368507575794635, -0.14199515219620415, 0.1549084997526042, -0.1401431877428377, 0.057408583107811044, 0.05368849207502856, 0.11382560843837933, -0.10136728611131998, -0.2065139415765732, 0.42172272461400906, -0.13905146639321891, 0.17692856119394723, 0.1071489486633472, 0.09423133132415233, -0.05031012351506613, 0.12981152079973213, 0.0886015018946688, -0.23088717565016698, 0.09141864429529704, 0.19303320928043882, 0.14643232752634605, 0.28755040802586246, -0.3398107724447905, -0.15188417684378652, 0.2097745554416742, 0.12843094724164883, -0.052173480076689115, -0.004418055631849967, -0.27880197663752126, 0.13856296464604076, -0.03610905099817565, -0.2222582968083066, -0.06329122545118902, 0.14577694864235294, 0.07562056477804681, -0.30201049629126636, 0.1029941789202497, 0.1214656053196219, -0.0239794579150916, -0.1626836265975111, -0.11760050626996328, -0.04628880961771897, 0.009030802864056657, 0.04695924457070798, 0.14480809750187892, 0.08772428988308555, -0.05118285001150634, -0.02087009337592975, 0.3913829015489195, -0.0324718956901154, -0.35361086685394105, 0.06905858832555757, -0.24301574347068516, -0.11494038628519211, 0.09043657782317048, 0.1304123110505162, 0.13024468310702014, -0.1178889775658551, 0.2603549127209551, -0.09537120027021623, 0.18566071627740288, 0.14687006377523215, -0.01777146229336799, 0.06604376611706446, 0.09802963043904116, 0.19406847974521593, 0.15351122011706023, -0.029748215249077167, -0.003820473656163249, -0.3956101737050733, -0.09946377563264064, -0.1923426782161417, 0.08983947204517752, -0.1493247110447043, -0.19986292681801068, 0.3321960403151076, 0.017475428610620364, 0.17432133635033814, 0.0827035994701822, 0.18273396212869966, 0.08689118096540177, -0.04221607075715569, 0.1279928030652768, 0.18779622509577115, 0.13122184839571865, 0.006896790038322059, -0.23469096077868426, 0.002558851522773924, 0.1200722618894258]
|
1,803.04912
|
Data-Driven Distributionally Robust Optimal Power Flow for Distribution
Systems
|
Increasing penetration of distributed energy resources complicate operations
of electric power distribution systems by amplifying volatility of nodal power
injections. On the other hand, these resources can provide additional control
means to the distribution system operator (DSO). This paper takes the DSO
perspective and leverages a data-driven distributionally robust decision-making
framework to overcome the uncertainty of these injections and its impact on the
distribution system operations. We develop an AC OPF formulation for radial
distribution systems based on the LinDistFlow AC power flow approximation and
exploit distributionally robust optimization to immunize the optimized
decisions against uncertainty in the probabilistic models of forecast errors
obtained from the available observations. The model is reformulated to be
computationally tractable and tested on multiple IEEE distribution test
systems. We also release the code supplement that implements the proposed model
in Julia and can be used to reproduce our numerical results.
|
math.OC
|
increasing penetration of distributed energy resources complicate operations of electric power distribution systems by amplifying volatility of nodal power injections on the other hand these resources can provide additional control means to the distribution system operator dso this paper takes the dso perspective and leverages a datadriven distributionally robust decisionmaking framework to overcome the uncertainty of these injections and its impact on the distribution system operations we develop an ac opf formulation for radial distribution systems based on the lindistflow ac power flow approximation and exploit distributionally robust optimization to immunize the optimized decisions against uncertainty in the probabilistic models of forecast errors obtained from the available observations the model is reformulated to be computationally tractable and tested on multiple ieee distribution test systems we also release the code supplement that implements the proposed model in julia and can be used to reproduce our numerical results
|
[['increasing', 'penetration', 'of', 'distributed', 'energy', 'resources', 'complicate', 'operations', 'of', 'electric', 'power', 'distribution', 'systems', 'by', 'amplifying', 'volatility', 'of', 'nodal', 'power', 'injections', 'on', 'the', 'other', 'hand', 'these', 'resources', 'can', 'provide', 'additional', 'control', 'means', 'to', 'the', 'distribution', 'system', 'operator', 'dso', 'this', 'paper', 'takes', 'the', 'dso', 'perspective', 'and', 'leverages', 'a', 'datadriven', 'distributionally', 'robust', 'decisionmaking', 'framework', 'to', 'overcome', 'the', 'uncertainty', 'of', 'these', 'injections', 'and', 'its', 'impact', 'on', 'the', 'distribution', 'system', 'operations', 'we', 'develop', 'an', 'ac', 'opf', 'formulation', 'for', 'radial', 'distribution', 'systems', 'based', 'on', 'the', 'lindistflow', 'ac', 'power', 'flow', 'approximation', 'and', 'exploit', 'distributionally', 'robust', 'optimization', 'to', 'immunize', 'the', 'optimized', 'decisions', 'against', 'uncertainty', 'in', 'the', 'probabilistic', 'models', 'of', 'forecast', 'errors', 'obtained', 'from', 'the', 'available', 'observations', 'the', 'model', 'is', 'reformulated', 'to', 'be', 'computationally', 'tractable', 'and', 'tested', 'on', 'multiple', 'ieee', 'distribution', 'test', 'systems', 'we', 'also', 'release', 'the', 'code', 'supplement', 'that', 'implements', 'the', 'proposed', 'model', 'in', 'julia', 'and', 'can', 'be', 'used', 'to', 'reproduce', 'our', 'numerical', 'results']]
|
[-0.12667643996055944, 0.0010701194157671375, -0.09843447342322305, 0.08320014039375659, -0.08858225155493309, -0.15652395518303946, 0.06864628072362393, 0.3670667713227007, -0.31221335250884297, -0.3168426785842869, 0.12407661984064455, -0.2683815924033266, -0.11923083407018567, 0.23838181862093766, -0.122517481571513, 0.13281951793911065, 0.07170733097169933, -0.058905523242870475, -0.008322114919729787, -0.21957299242374198, 0.2794564656953424, 0.10016070007635601, 0.3273821183464265, 0.002543948394856576, 0.09316954964386492, 0.0012992274610261465, -0.032371910838089116, 0.04422888151402103, -0.08660885884515852, 0.17664737011273873, 0.2374925549378155, 0.1833267977140073, 0.27977541891279917, -0.4576715691978561, -0.2307603733549858, 0.08766436216517769, 0.10551887778886433, 0.06137760851275304, -0.003101136079379197, -0.27436237257487817, 0.06179619150814311, -0.229393871661661, -0.07976193436068194, -0.14664932777141704, -0.03692746885634702, 0.05070917275573673, -0.3384752520456396, 0.045577296310963494, 0.03483312995462068, 0.054887717535341926, -0.08985097284733863, -0.10748792628693427, -0.01644504371034945, 0.1131240203912402, 0.01988708651464047, -0.01584946807987731, 0.16747709253867124, -0.07835088051245387, -0.12618134388186295, 0.3685363954382724, -0.026445726167153696, -0.22360298977843646, 0.1236350357805475, -0.0634831649122824, -0.1336171236820519, 0.09000765404118033, 0.2706853660080453, 0.07889105211943388, -0.1819497654246616, 0.042892356882883426, -0.0031205094226732337, 0.210997714269264, -0.02444922676759547, -0.0018262425678428904, 0.1924570379859029, 0.16586176074784378, 0.11187267553960455, 0.1470138897063564, -0.08189614204818318, -0.1206305196131419, -0.2527875908068381, -0.0659966035071632, -0.17171821481516136, 0.0018319140188395977, -0.07024757962158062, -0.1331175843446419, 0.40163821732175764, 0.24935145318700835, 0.13442650825620212, 0.09671210759190907, 0.3835817608340033, 0.16583250544981323, 0.04334914893401658, 0.12226797356751973, 0.19770896520730558, 0.07202012872098591, 0.10715297496524351, -0.23523720952617969, 0.10642812755922305, 0.009053465473497736]
|
1,803.04913
|
On non-commutativity in quantum theory (I): from classical to quantum
probability
|
A central feature of quantum mechanics is the non-commutativity of operators
used to describe physical observables. In this article, we present a critical
analysis on the role of non-commutativity in quantum theory, focusing on its
consequences in the probabilistic description. Typically, a random phenomenon
is described using the measure-theoretic formulation of probability theory.
Such a description can also be done using algebraic methods, which are capable
to deal with non-commutative random variables (like in quantum mechanics). Here
we propose a method to construct a non-commutative probability theory starting
from an ordinary measure-theoretic description of probability. This will be
done using the entropic uncertainty relations between random variables, in
order to evaluate the presence of non-commutativity in their algebraic
description.
|
quant-ph math-ph math.MP math.PR
|
a central feature of quantum mechanics is the noncommutativity of operators used to describe physical observables in this article we present a critical analysis on the role of noncommutativity in quantum theory focusing on its consequences in the probabilistic description typically a random phenomenon is described using the measuretheoretic formulation of probability theory such a description can also be done using algebraic methods which are capable to deal with noncommutative random variables like in quantum mechanics here we propose a method to construct a noncommutative probability theory starting from an ordinary measuretheoretic description of probability this will be done using the entropic uncertainty relations between random variables in order to evaluate the presence of noncommutativity in their algebraic description
|
[['a', 'central', 'feature', 'of', 'quantum', 'mechanics', 'is', 'the', 'noncommutativity', 'of', 'operators', 'used', 'to', 'describe', 'physical', 'observables', 'in', 'this', 'article', 'we', 'present', 'a', 'critical', 'analysis', 'on', 'the', 'role', 'of', 'noncommutativity', 'in', 'quantum', 'theory', 'focusing', 'on', 'its', 'consequences', 'in', 'the', 'probabilistic', 'description', 'typically', 'a', 'random', 'phenomenon', 'is', 'described', 'using', 'the', 'measuretheoretic', 'formulation', 'of', 'probability', 'theory', 'such', 'a', 'description', 'can', 'also', 'be', 'done', 'using', 'algebraic', 'methods', 'which', 'are', 'capable', 'to', 'deal', 'with', 'noncommutative', 'random', 'variables', 'like', 'in', 'quantum', 'mechanics', 'here', 'we', 'propose', 'a', 'method', 'to', 'construct', 'a', 'noncommutative', 'probability', 'theory', 'starting', 'from', 'an', 'ordinary', 'measuretheoretic', 'description', 'of', 'probability', 'this', 'will', 'be', 'done', 'using', 'the', 'entropic', 'uncertainty', 'relations', 'between', 'random', 'variables', 'in', 'order', 'to', 'evaluate', 'the', 'presence', 'of', 'noncommutativity', 'in', 'their', 'algebraic', 'description']]
|
[-0.10406900087308858, 0.12992143111037846, -0.16952261530027232, 0.1156556953777786, -0.057032290628931226, -0.1105217295385772, 0.03718474070725477, 0.2947648720925345, -0.28046257272675756, -0.25828552773582336, 0.041726881843608093, -0.23888080360508768, -0.1978698717821546, 0.1801774055313538, -0.1335837733657921, 0.07533514555964321, 0.0007238928619928721, 0.08351253692702461, -0.10741951128765315, -0.20367452138721817, 0.33829282388138043, 0.05045389634104125, 0.23983853105103456, 0.011103429557646023, 0.11178982718417249, 0.03980439940776613, -0.05231374545226328, 0.06710693162294622, -0.13855173880578714, 0.15878287042264178, 0.2850841208294566, 0.12288768086660684, 0.2614871968491739, -0.4353584771459343, -0.22487854257132076, 0.09884436430894777, 0.1026606063726319, 0.14234321568642563, -0.007055956567050654, -0.3013088749643384, 0.03704473061659256, -0.2057252259408476, -0.15822434384266243, -0.12087162585631639, -0.011103544227716302, -0.029777015970252892, -0.22502326128706962, 0.05659225740555102, 0.06734499511379405, 0.0994420376363672, -0.012049688923391788, -0.022885305531119473, 0.060591119098938814, 0.08622146237391133, -0.001343314250258087, 0.02702386333106258, 0.12209649853987478, -0.09171817661599332, -0.16897345316291107, 0.4014661797330159, -0.015333064993209512, -0.280747308466606, 0.1452830465620055, -0.12605254162697732, -0.1985965560526908, 0.043638036259598716, 0.17595956304321894, 0.11745242534025314, -0.15124270129761025, 0.1525546223035365, -0.022645157746219335, 0.13931130712945797, 0.03586745051033169, 0.0874296058235424, 0.21183563936345218, 0.12448615336618504, 0.0042257851944500656, 0.13881694835986347, -0.03203547397675384, -0.21259185940246372, -0.36382060869745597, -0.1536894045112764, -0.18704322996909314, 0.12146491924508185, -0.09829141220719624, -0.19185857338627346, 0.3577708373738437, 0.19901867170559884, 0.19770152434049285, 0.020258100322807723, 0.2608994609527603, 0.16702993351089604, -0.006727348064158519, -0.009156363456658706, 0.20093550982331357, 0.19601207401039972, 0.0711234636964793, -0.16055400876774445, 0.05210994875074184, 0.1548839335666359]
|
1,803.04914
|
A probabilistic generalization of the Stirling numbers of the second
kind
|
Associated to each random variable $Y$ having a finite moment generating
function, we introduce a different generalization of the Stirling numbers of
the second kind. Some characterizations and specific examples of such
generalized numbers are provided. As far as their applications are concerned,
attention is focused in extending in various ways the classical formula for
sums of powers on arithmetic progressions. Illustrations involving rising
factorials, Bell polynomials, polylogarithms, and a certain class of Appell
polynomials, in connection with appropriate random variables $Y$ in each case,
are discussed in detail.
|
math.NT
|
associated to each random variable y having a finite moment generating function we introduce a different generalization of the stirling numbers of the second kind some characterizations and specific examples of such generalized numbers are provided as far as their applications are concerned attention is focused in extending in various ways the classical formula for sums of powers on arithmetic progressions illustrations involving rising factorials bell polynomials polylogarithms and a certain class of appell polynomials in connection with appropriate random variables y in each case are discussed in detail
|
[['associated', 'to', 'each', 'random', 'variable', 'y', 'having', 'a', 'finite', 'moment', 'generating', 'function', 'we', 'introduce', 'a', 'different', 'generalization', 'of', 'the', 'stirling', 'numbers', 'of', 'the', 'second', 'kind', 'some', 'characterizations', 'and', 'specific', 'examples', 'of', 'such', 'generalized', 'numbers', 'are', 'provided', 'as', 'far', 'as', 'their', 'applications', 'are', 'concerned', 'attention', 'is', 'focused', 'in', 'extending', 'in', 'various', 'ways', 'the', 'classical', 'formula', 'for', 'sums', 'of', 'powers', 'on', 'arithmetic', 'progressions', 'illustrations', 'involving', 'rising', 'factorials', 'bell', 'polynomials', 'polylogarithms', 'and', 'a', 'certain', 'class', 'of', 'appell', 'polynomials', 'in', 'connection', 'with', 'appropriate', 'random', 'variables', 'y', 'in', 'each', 'case', 'are', 'discussed', 'in', 'detail']]
|
[-0.19111726788824865, 0.1388947001313058, -0.018522478378472033, 0.12885118615578106, -0.10757322949514295, -0.14214536359826668, 0.03574940608618153, 0.3493705861207642, -0.28083761958259856, -0.2301412947833822, 0.10414443145966513, -0.2951769528261731, -0.16752686814059703, 0.2506141097944104, -0.11392113871432924, 0.08554193184428503, -0.014578563590230567, 0.08049525243094129, -0.0960832135699522, -0.2975322248680998, 0.33461736641782386, -0.044489770349418596, 0.1911604262239645, -0.024428567566563576, 0.09352260807612806, 0.0036311696513733837, -0.0744518773614565, -0.014659948531914962, -0.11149551720473538, 0.12187698707926307, 0.27937310503984103, 0.10848341947630717, 0.3283482895054844, -0.3720398182494126, -0.1437488893319047, 0.14286498318876276, 0.11751337195851244, 0.010394736530594108, -0.04487395256344397, -0.20831698480355187, 0.032933215970393226, -0.17580448378275118, -0.17856171960795947, -0.11297016415033448, 0.026590680096591456, 0.2073297659458404, -0.2656551655905133, 0.027750375766955902, 0.08063053260714317, 0.14191278112150357, 0.02706418810098359, -0.20985008861995144, 0.04945021138782875, 0.05940364868369665, 0.05476536759531146, -0.017379287604158848, 0.025816247186340978, -0.11968039616607548, -0.15125194496966982, 0.3668376312831814, 0.008399474004210298, -0.28276071852345147, 0.12012214076527383, -0.17348900002563436, -0.22432406779818154, 0.06623805674797531, 0.13542186862297273, 0.16575625270939945, -0.0865122980197494, 0.07475281354913677, -0.0805514879744458, 0.0443561927394502, 0.20465239398495366, 0.09530626986636205, 0.16351814495054273, 0.030865332535520363, -0.021788329131943122, 0.255632153429677, 0.015227724213985036, -0.1313115236181975, -0.3667802257735408, -0.17449312452540805, -0.18726695808215757, 0.06383602418465896, -0.13604489441279563, -0.1894729408341345, 0.40051979872952687, 0.06582984649474874, 0.1959158152006985, 0.08294706292492285, 0.22821521564397249, 0.1550358208393406, 0.026353791426720747, -0.032634834492097746, 0.06532726473118744, 0.24241054218963543, 0.08506681632611565, -0.06450047800637876, 0.06332888501811396, 0.16777862899078663]
|
1,803.04915
|
Nutritionally recommended food for semi- to strict vegetarian diets
based on large-scale nutrient composition data
|
Diet design for vegetarian health is challenging due to the limited food
repertoire of vegetarians. This challenge can be partially overcome by
quantitative, data-driven approaches that utilise massive nutritional
information collected for many different foods. Based on large-scale data of
foods' nutrient compositions, the recent concept of nutritional fitness helps
quantify a nutrient balance within each food with regard to satisfying daily
nutritional requirements. Nutritional fitness offers prioritisation of
recommended foods using the foods' occurrence in nutritionally adequate food
combinations. Here, we systematically identify nutritionally recommendable
foods for semi- to strict vegetarian diets through the computation of
nutritional fitness. Along with commonly recommendable foods across different
diets, our analysis reveals favourable foods specific to each diet, such as
immature lima beans for a vegan diet as an amino acid and choline source, and
mushrooms for ovo-lacto vegetarian and vegan diets as a vitamin D source.
Furthermore, we find that selenium and other essential micronutrients can be
subject to deficiency in plant-based diets, and suggest nutritionally-desirable
dietary patterns. We extend our analysis to two hypothetical scenarios of
highly personalised, plant-based methionine-restricted diets. Our
nutrient-profiling approach may provide a useful guide for designing different
types of personalised vegetarian diets.
|
q-bio.OT cs.SI physics.soc-ph
|
diet design for vegetarian health is challenging due to the limited food repertoire of vegetarians this challenge can be partially overcome by quantitative datadriven approaches that utilise massive nutritional information collected for many different foods based on largescale data of foods nutrient compositions the recent concept of nutritional fitness helps quantify a nutrient balance within each food with regard to satisfying daily nutritional requirements nutritional fitness offers prioritisation of recommended foods using the foods occurrence in nutritionally adequate food combinations here we systematically identify nutritionally recommendable foods for semi to strict vegetarian diets through the computation of nutritional fitness along with commonly recommendable foods across different diets our analysis reveals favourable foods specific to each diet such as immature lima beans for a vegan diet as an amino acid and choline source and mushrooms for ovolacto vegetarian and vegan diets as a vitamin d source furthermore we find that selenium and other essential micronutrients can be subject to deficiency in plantbased diets and suggest nutritionallydesirable dietary patterns we extend our analysis to two hypothetical scenarios of highly personalised plantbased methioninerestricted diets our nutrientprofiling approach may provide a useful guide for designing different types of personalised vegetarian diets
|
[['diet', 'design', 'for', 'vegetarian', 'health', 'is', 'challenging', 'due', 'to', 'the', 'limited', 'food', 'repertoire', 'of', 'vegetarians', 'this', 'challenge', 'can', 'be', 'partially', 'overcome', 'by', 'quantitative', 'datadriven', 'approaches', 'that', 'utilise', 'massive', 'nutritional', 'information', 'collected', 'for', 'many', 'different', 'foods', 'based', 'on', 'largescale', 'data', 'of', 'foods', 'nutrient', 'compositions', 'the', 'recent', 'concept', 'of', 'nutritional', 'fitness', 'helps', 'quantify', 'a', 'nutrient', 'balance', 'within', 'each', 'food', 'with', 'regard', 'to', 'satisfying', 'daily', 'nutritional', 'requirements', 'nutritional', 'fitness', 'offers', 'prioritisation', 'of', 'recommended', 'foods', 'using', 'the', 'foods', 'occurrence', 'in', 'nutritionally', 'adequate', 'food', 'combinations', 'here', 'we', 'systematically', 'identify', 'nutritionally', 'recommendable', 'foods', 'for', 'semi', 'to', 'strict', 'vegetarian', 'diets', 'through', 'the', 'computation', 'of', 'nutritional', 'fitness', 'along', 'with', 'commonly', 'recommendable', 'foods', 'across', 'different', 'diets', 'our', 'analysis', 'reveals', 'favourable', 'foods', 'specific', 'to', 'each', 'diet', 'such', 'as', 'immature', 'lima', 'beans', 'for', 'a', 'vegan', 'diet', 'as', 'an', 'amino', 'acid', 'and', 'choline', 'source', 'and', 'mushrooms', 'for', 'ovolacto', 'vegetarian', 'and', 'vegan', 'diets', 'as', 'a', 'vitamin', 'd', 'source', 'furthermore', 'we', 'find', 'that', 'selenium', 'and', 'other', 'essential', 'micronutrients', 'can', 'be', 'subject', 'to', 'deficiency', 'in', 'plantbased', 'diets', 'and', 'suggest', 'nutritionallydesirable', 'dietary', 'patterns', 'we', 'extend', 'our', 'analysis', 'to', 'two', 'hypothetical', 'scenarios', 'of', 'highly', 'personalised', 'plantbased', 'methioninerestricted', 'diets', 'our', 'nutrientprofiling', 'approach', 'may', 'provide', 'a', 'useful', 'guide', 'for', 'designing', 'different', 'types', 'of', 'personalised', 'vegetarian', 'diets']]
|
[-0.03366811435470091, 0.10139927718236799, -0.026116244401289988, 0.08572200915120819, -0.1018174994076607, -0.15395900052750394, 0.11421782893458844, 0.37117693001631075, -0.2137170012291304, -0.3337358745830084, 0.08446622799180212, -0.2966296289805397, -0.15043135860530787, 0.18134453258028738, -0.1571994473473674, 0.007481757240990798, 0.05910663112071614, -0.00735247701070168, 0.0736932337688154, -0.2506181159741664, 0.24267989772164988, 0.057209511728533516, 0.34332884951351733, 0.08652691832723874, 0.09263569148683615, -0.024339789485869307, -0.04549634539788323, -0.019001319289956457, -0.12927404005444182, 0.18416811626838156, 0.3394649342212471, 0.23211627161972934, 0.34483542663375377, -0.42454877083815595, -0.2151735865539642, 0.12280190318808078, 0.1369936580941569, 0.06756305547983006, -0.057135751446901216, -0.27828299857814004, 0.08273503709573388, -0.20724876330446, -0.06835543930225035, -0.10892459842137421, -0.012968506496498194, 0.0776997456726219, -0.25870197946599943, 0.09478435811596533, -0.06361412822679129, 0.14018474527629754, -0.11798521060811937, -0.1806171187951116, -0.10720003971696965, 0.2348683585964695, 0.08029850681741087, -0.02737159279320468, 0.2064888797646201, -0.13720727176467085, -0.0783888655443671, 0.37691398918944063, -0.0023718916998299025, -0.18728122864628122, 0.22489342407111532, -0.034859825876078235, -0.16579936115347124, 0.07279568060335738, 0.19977185216075716, 0.07610005519609091, -0.22060898252363717, -0.0650315945752448, 0.029932112165692228, 0.17542027555302614, 0.08982150131471889, 0.0011178990563460276, 0.2069567643209464, 0.23250689802977142, 0.050287727093774943, 0.09487620290650903, -0.003949625817960296, -0.056823673918082566, -0.13261009788229353, -0.17865657130325283, -0.05267792041585953, 0.028027996988769954, -0.09989076329445375, -0.16503099197393686, 0.37256270837255573, 0.16690138835041407, 0.12795928039738327, 0.05972655893228924, 0.24346717972820872, -0.03339149902461382, 0.09696975347916127, -0.027328407574228192, 0.09047917021492684, -0.025855013126231455, 0.13791503337404085, -0.20300434996920919, 0.18956791668718867, -0.0282015990941396]
|
1,803.04916
|
On non-commutativity in quantum theory (II): toy models for
non-commutative kinematics
|
In this article, we continue our investigation on the role of
non-commutativity in quantum theory. Using the method explained in "On
non-commutativity in quantum theory (I): from classical to quantum
probability", we analyze two toy models which exhibit non-commutativity between
the corresponding position and velocity random variables. In particular, using
ordinary probability theory, we study the kinematics of a point-like particle
jumping at random over a discrete random space. We show that, after the removal
of the random space from the model, the position and velocity of the particle
do not commute, when represented as operators on the same Hilbert space.
|
quant-ph math-ph math.MP math.PR
|
in this article we continue our investigation on the role of noncommutativity in quantum theory using the method explained in on noncommutativity in quantum theory i from classical to quantum probability we analyze two toy models which exhibit noncommutativity between the corresponding position and velocity random variables in particular using ordinary probability theory we study the kinematics of a pointlike particle jumping at random over a discrete random space we show that after the removal of the random space from the model the position and velocity of the particle do not commute when represented as operators on the same hilbert space
|
[['in', 'this', 'article', 'we', 'continue', 'our', 'investigation', 'on', 'the', 'role', 'of', 'noncommutativity', 'in', 'quantum', 'theory', 'using', 'the', 'method', 'explained', 'in', 'on', 'noncommutativity', 'in', 'quantum', 'theory', 'i', 'from', 'classical', 'to', 'quantum', 'probability', 'we', 'analyze', 'two', 'toy', 'models', 'which', 'exhibit', 'noncommutativity', 'between', 'the', 'corresponding', 'position', 'and', 'velocity', 'random', 'variables', 'in', 'particular', 'using', 'ordinary', 'probability', 'theory', 'we', 'study', 'the', 'kinematics', 'of', 'a', 'pointlike', 'particle', 'jumping', 'at', 'random', 'over', 'a', 'discrete', 'random', 'space', 'we', 'show', 'that', 'after', 'the', 'removal', 'of', 'the', 'random', 'space', 'from', 'the', 'model', 'the', 'position', 'and', 'velocity', 'of', 'the', 'particle', 'do', 'not', 'commute', 'when', 'represented', 'as', 'operators', 'on', 'the', 'same', 'hilbert', 'space']]
|
[-0.07370490685455722, 0.16408670957702776, -0.11174958388062914, 0.06585776652232514, -0.006076527664917383, -0.08365302483117816, 0.04674172625844689, 0.36239434887498323, -0.2680074479615334, -0.25307028073042925, 0.029273075964486243, -0.24715442465857998, -0.18308118136950058, 0.17567883970534043, -0.08189315242360871, 0.029422649099390106, 0.02139917371038458, 0.09447019823393461, -0.0928498391767429, -0.24368799760900806, 0.36130232724019945, 0.01770313344273421, 0.23021048445734058, -0.025988728693216154, 0.12662098940812272, 0.0826031251782828, -0.06101551803640357, 0.04433602145279407, -0.11144177964463482, 0.09175656180791926, 0.16399787129111165, 0.08390425276103439, 0.2512476539774106, -0.42742783126264516, -0.2061444375811532, 0.11567013470990824, 0.14054024713759375, 0.12079695474222708, 0.004340805003816022, -0.3190903138383153, 0.02303125989614147, -0.16583598752409257, -0.14112505342553158, -0.04181270877655485, -0.011177319277188565, 0.008858547852568255, -0.19465996565799792, 0.07458373491587762, 0.061237309842674746, 0.06819793998637227, -0.05489265618587632, -0.058508851952703285, -0.007456611484602684, 0.10128308726056238, 0.011355994941233334, 0.00975583934243584, 0.11969347631485008, -0.11462612098571615, -0.13676659859680007, 0.38466451346579167, -0.08032071103035279, -0.25036092763674433, 0.1624867411164364, -0.20856043030847887, -0.17088734112348003, 0.05738301234697868, 0.20263813421738766, 0.12156763049949071, -0.07725483155881382, 0.1573718191979748, -0.06357144141145567, 0.13001397890638156, 0.06350059124945413, 0.056656500688837014, 0.205438565647248, 0.08142723252369773, 0.05575899565638513, 0.10443273842067338, -0.11253767051056286, -0.20481532383341305, -0.39087954834841265, -0.16340674712590061, -0.21666864438517258, 0.08169524458546473, -0.10544097447499291, -0.16955124144211853, 0.38071331053990687, 0.1891623668223942, 0.23463470302522182, 0.029070500211817868, 0.2408637497620196, 0.13554160809605428, 0.003952235721125461, 0.04477000886362304, 0.19625619405161332, 0.14106334152050537, 0.08681732583860176, -0.21668453796277984, 0.022101885085870132, 0.11970678831699609]
|
1,803.04917
|
Optical potential mapping with a levitated nanoparticle at
sub-wavelength distances from a membrane
|
The controllable positioning of a vacuum-levitated object near a material
surface is of importance for studying short-range forces, such as Casimir
forces, interfacial friction forces, or gravity in yet unexplored parameter
regimes. Here we optically levitate a nanoparticle in a laser beam strongly
focused on a dielectric membrane. By investigating the motion of the trapped
particle in vacuum, we map the position-dependent optical potential of the
particle. We interferometrically measure the distance between the particle and
the surface and demonstrate stable trapping in sub-wavelength proximity of the
dielectric surface. Our work is important for the development of on-chip
levitated optomechanics and for measuring short-range forces at sub-wavelength
distances.
|
physics.optics
|
the controllable positioning of a vacuumlevitated object near a material surface is of importance for studying shortrange forces such as casimir forces interfacial friction forces or gravity in yet unexplored parameter regimes here we optically levitate a nanoparticle in a laser beam strongly focused on a dielectric membrane by investigating the motion of the trapped particle in vacuum we map the positiondependent optical potential of the particle we interferometrically measure the distance between the particle and the surface and demonstrate stable trapping in subwavelength proximity of the dielectric surface our work is important for the development of onchip levitated optomechanics and for measuring shortrange forces at subwavelength distances
|
[['the', 'controllable', 'positioning', 'of', 'a', 'vacuumlevitated', 'object', 'near', 'a', 'material', 'surface', 'is', 'of', 'importance', 'for', 'studying', 'shortrange', 'forces', 'such', 'as', 'casimir', 'forces', 'interfacial', 'friction', 'forces', 'or', 'gravity', 'in', 'yet', 'unexplored', 'parameter', 'regimes', 'here', 'we', 'optically', 'levitate', 'a', 'nanoparticle', 'in', 'a', 'laser', 'beam', 'strongly', 'focused', 'on', 'a', 'dielectric', 'membrane', 'by', 'investigating', 'the', 'motion', 'of', 'the', 'trapped', 'particle', 'in', 'vacuum', 'we', 'map', 'the', 'positiondependent', 'optical', 'potential', 'of', 'the', 'particle', 'we', 'interferometrically', 'measure', 'the', 'distance', 'between', 'the', 'particle', 'and', 'the', 'surface', 'and', 'demonstrate', 'stable', 'trapping', 'in', 'subwavelength', 'proximity', 'of', 'the', 'dielectric', 'surface', 'our', 'work', 'is', 'important', 'for', 'the', 'development', 'of', 'onchip', 'levitated', 'optomechanics', 'and', 'for', 'measuring', 'shortrange', 'forces', 'at', 'subwavelength', 'distances']]
|
[-0.15732579153884096, 0.2252207832480563, -0.0870661101234363, -0.0007757595315941166, -0.012298349752395509, -0.16481047506209148, -0.0007747175067523929, 0.4327104657052833, -0.24316824306342227, -0.28638627890184104, -0.00014975686148505345, -0.2644241088043863, -0.13224085720003556, 0.22393801042953698, -0.0066382109729364236, 0.09012480421322529, -0.002684566958276468, -0.05696020045570124, 0.012086071548374178, -0.08859515938664152, 0.3037248737587829, 0.07921404020738936, 0.24333260738003615, 0.15792602205770873, 0.1504509423459036, 0.00680727014757658, 0.060861027760378945, 0.043213569894258945, -0.1629561766912447, 0.1358070308853933, 0.19239505078365035, -0.08474906563985153, 0.2652653687650982, -0.44751875161706844, -0.2437710104184878, 0.05376675931266814, 0.14111692717768878, 0.16902258685816116, -0.12223091689438915, -0.311100994454366, -0.039233366797773915, -0.10852856629432361, -0.18108234237270238, -0.03383877468687073, 0.06698971333974432, 0.04262939550060883, -0.20620839279275563, 0.0558441948650457, 0.05526308110962996, 0.08322861115556976, -0.11571034473132029, -0.022998817421704808, 0.011257088880237435, 0.1097330394327188, -0.009674540995054435, 0.029562233555539746, 0.29965857938193136, -0.18178674457681793, -0.03072673901828511, 0.4033480956889341, -0.0694564101895509, -0.18696760703269916, 0.21775818364172478, -0.1762163935089919, 0.020761844145012236, 0.129127365841626, 0.21712449688255508, 0.13518297559120387, -0.1772668853872151, 0.0651308764169367, 0.038210876651595685, 0.1723034799520022, 0.15202147920972833, 0.059720651995146944, 0.308292499229869, 0.2439688295517639, 0.08198689708538423, 0.14827000312333075, -0.1572781412222501, -0.02937140855851157, -0.271919149248295, -0.18150536736873824, -0.24448536157120612, 0.0007100067532264462, -0.10108840803054889, -0.1878525872288324, 0.3523610191611208, 0.12767396242331677, 0.12333832286019748, -0.03887120038532069, 0.31215470744227275, 0.03114280176879925, 0.07342696044633218, -0.00470258503125232, 0.3929467775258366, 0.14925817767741315, 0.060475529143238595, -0.31645141138094607, -0.01040194249302845, 0.03352053951315373]
|
1,803.04918
|
Uniform phases in fluids of hard isosceles triangles: one component and
binary mixtures
|
We formulate the scaled particle theory for a general mixture of hard
isosceles triangles and calculate different phase diagrams for the
one-component fluid and for certain binary mixtures. The fluid of hard
triangles exhibits a complex phase behavior: (i) the presence of a triatic
phase with sixfold symmetry, (ii) the isotropic-uniaxial nematic transition is
of first order for certain ranges of aspect ratios, and (iii) the one-component
system exhibits nematic-nematic transitions ending in critical points. We found
the triatic phase to be stable not only for equilateral triangles but also for
triangles of similar aspect ratios. We focus the study of binary mixtures on
the case of symmetric mixtures: equal particle areas with aspect ratios
($\kappa_i$) symmetric with respect to the equilateral one:
$\kappa_1\kappa_2=3$. For these mixtures we found, aside from first-order
isotropic-nematic and nematic-nematic transitions (the latter ending in a
critical point): (i) A region of triatic phase stability even for mixtures made
of particles that do not form this phase at the one-component limit, and (ii)
the presence of a Landau point at which two isotropic-nematic first-order
transitions and a nematic-nematic demixing transition coalesce. This phase
behavior is analog to that of a symmetric three-dimensional mixture of rods and
plates.
|
cond-mat.soft
|
we formulate the scaled particle theory for a general mixture of hard isosceles triangles and calculate different phase diagrams for the onecomponent fluid and for certain binary mixtures the fluid of hard triangles exhibits a complex phase behavior i the presence of a triatic phase with sixfold symmetry ii the isotropicuniaxial nematic transition is of first order for certain ranges of aspect ratios and iii the onecomponent system exhibits nematicnematic transitions ending in critical points we found the triatic phase to be stable not only for equilateral triangles but also for triangles of similar aspect ratios we focus the study of binary mixtures on the case of symmetric mixtures equal particle areas with aspect ratios kappa_i symmetric with respect to the equilateral one kappa_1kappa_23 for these mixtures we found aside from firstorder isotropicnematic and nematicnematic transitions the latter ending in a critical point i a region of triatic phase stability even for mixtures made of particles that do not form this phase at the onecomponent limit and ii the presence of a landau point at which two isotropicnematic firstorder transitions and a nematicnematic demixing transition coalesce this phase behavior is analog to that of a symmetric threedimensional mixture of rods and plates
|
[['we', 'formulate', 'the', 'scaled', 'particle', 'theory', 'for', 'a', 'general', 'mixture', 'of', 'hard', 'isosceles', 'triangles', 'and', 'calculate', 'different', 'phase', 'diagrams', 'for', 'the', 'onecomponent', 'fluid', 'and', 'for', 'certain', 'binary', 'mixtures', 'the', 'fluid', 'of', 'hard', 'triangles', 'exhibits', 'a', 'complex', 'phase', 'behavior', 'i', 'the', 'presence', 'of', 'a', 'triatic', 'phase', 'with', 'sixfold', 'symmetry', 'ii', 'the', 'isotropicuniaxial', 'nematic', 'transition', 'is', 'of', 'first', 'order', 'for', 'certain', 'ranges', 'of', 'aspect', 'ratios', 'and', 'iii', 'the', 'onecomponent', 'system', 'exhibits', 'nematicnematic', 'transitions', 'ending', 'in', 'critical', 'points', 'we', 'found', 'the', 'triatic', 'phase', 'to', 'be', 'stable', 'not', 'only', 'for', 'equilateral', 'triangles', 'but', 'also', 'for', 'triangles', 'of', 'similar', 'aspect', 'ratios', 'we', 'focus', 'the', 'study', 'of', 'binary', 'mixtures', 'on', 'the', 'case', 'of', 'symmetric', 'mixtures', 'equal', 'particle', 'areas', 'with', 'aspect', 'ratios', 'kappa_i', 'symmetric', 'with', 'respect', 'to', 'the', 'equilateral', 'one', 'kappa_1kappa_23', 'for', 'these', 'mixtures', 'we', 'found', 'aside', 'from', 'firstorder', 'isotropicnematic', 'and', 'nematicnematic', 'transitions', 'the', 'latter', 'ending', 'in', 'a', 'critical', 'point', 'i', 'a', 'region', 'of', 'triatic', 'phase', 'stability', 'even', 'for', 'mixtures', 'made', 'of', 'particles', 'that', 'do', 'not', 'form', 'this', 'phase', 'at', 'the', 'onecomponent', 'limit', 'and', 'ii', 'the', 'presence', 'of', 'a', 'landau', 'point', 'at', 'which', 'two', 'isotropicnematic', 'firstorder', 'transitions', 'and', 'a', 'nematicnematic', 'demixing', 'transition', 'coalesce', 'this', 'phase', 'behavior', 'is', 'analog', 'to', 'that', 'of', 'a', 'symmetric', 'threedimensional', 'mixture', 'of', 'rods', 'and', 'plates']]
|
[-0.15687377738417127, 0.20456985875964165, -0.06942051774822175, 0.02524073615670204, 0.013543592630885542, -0.1797600533440709, 0.07388913405535277, 0.34836550973239355, -0.2019433204969391, -0.2445716954083764, 0.09017877133912407, -0.2984826447721571, -0.1325237654952798, 0.05811883439484518, 0.017825783997395775, 0.03542817656882107, -0.01880245016072877, 0.003606095112627372, -0.13188665922149084, -0.16220669981325045, 0.32541653734166176, -0.027488188170827925, 0.26111231165006754, 0.016385980263730743, 0.0572791544906795, -0.011218935545766726, 0.09901083539705724, 0.05767477544490248, -0.16553269583302607, 0.021509964021388443, 0.23633248588768765, -0.0010944476048462093, 0.1283092084247619, -0.373181340303272, -0.1654719372279942, 0.1605662198807113, 0.16387681175488977, 0.09232191044313368, -0.03390267417591531, -0.24941827324219049, 0.014734416920691728, -0.12659940890036522, -0.16727920557837933, -0.048176147849299016, 0.03447131504537538, 0.026397665758850053, -0.2666615912062116, 0.10135158090721234, 0.11681058794725686, 0.06832033880986273, -0.048506672320654615, -0.14149641248513944, -0.003549937299685553, 0.0876652159052901, 0.023720021739136427, -0.008078435761854052, 0.11545847897243221, -0.15573062689742073, -0.05614558634453715, 0.4402985745295882, -0.02615780981432181, -0.15931317385286092, 0.21356812525540592, -0.1721644896036014, -0.164274829744827, 0.22075457294937223, 0.1481630653142929, 0.11083662659861147, -0.07124350879108533, 0.037665959124278746, -0.014238634843495674, 0.19747183487954317, 0.10550207250285894, -0.047582124835753345, 0.28349847394041716, 0.13519750460051, 0.03224986197077669, 0.22241741459292824, -0.10527429100649897, -0.20383710035588593, -0.2754541057907045, -0.16873822550056503, -0.15315472091548143, -0.02798279552938766, -0.1365555174015026, -0.24724754805210977, 0.33381614125915804, 0.06437079045455903, 0.2204008336090192, 0.03280326115025673, 0.21059920284780673, 0.0895556452171877, -0.02852974698645994, 0.017187727353884838, 0.26247922871261836, 0.11398841104237363, 0.10512751228408888, -0.19418182197608985, 0.04264284677687101, 0.10122993440949359]
|
1,803.04919
|
Implications of Neutron Star Mergers for Extraterrestrial Civilizations
|
The economy and fate of extraterrestrial civilizations should depend on the
abundance of gold and uranium, made in neutron star mergers.
|
physics.pop-ph astro-ph.GA
|
the economy and fate of extraterrestrial civilizations should depend on the abundance of gold and uranium made in neutron star mergers
|
[['the', 'economy', 'and', 'fate', 'of', 'extraterrestrial', 'civilizations', 'should', 'depend', 'on', 'the', 'abundance', 'of', 'gold', 'and', 'uranium', 'made', 'in', 'neutron', 'star', 'mergers']]
|
[-0.062476214819720814, 0.23639700100535438, -0.06139165992360739, 0.127075713926128, -0.1260333731160721, 0.025128248857245558, 0.14388180005231074, 0.33408190019517425, -0.10603785621268409, -0.31247944850474596, 0.045950909871386274, -0.4021762151803289, 0.005452908265093963, 0.20287939444893882, -0.004092049740609669, -0.04784698647424756, 0.10059099294067848, 0.04148089604097463, 0.02272222945023151, -0.30872160201293547, 0.3260606405591326, 0.1243406915593715, 0.2067056003780592, 0.07117187249518576, 0.004480239802173206, -0.08734259217800129, -0.08828657466386046, -0.11226457020356542, -0.1320872732571193, 0.08047027930262543, 0.27910470288424266, 0.2510009538160548, 0.17571002599738894, -0.5786669680050441, -0.16599442570337228, 0.14989222306758165, 0.15497078365158468, 0.01914835869822474, -0.13405863570958554, -0.2599698659586942, 0.024288071585553034, -0.2606933277455114, -0.16855530431937604, 0.08299854734823817, 0.047047910095508474, 0.10873038197557132, -0.15103023078214997, 0.06863111414990965, 0.015095729203451248, 0.041531813463994434, -0.16532736200661885, -0.155254517637548, -0.0797112708290418, 0.09165926882997155, 0.14528562328112976, -0.03901138449353831, 0.2930736607384114, -0.109426313745124, -0.04194224373038326, 0.46039714699699763, -0.03627637944494685, -0.023412085404353484, 0.1820119097828865, -0.22314924223437196, -0.19959998769419535, 0.05676459541012134, 0.1866685738343568, 0.12538610514075982, -0.12729447219698203, 0.006738621203805364, 0.06821882272405284, 0.24939029424318246, 0.15741347051447346, 0.010288503553186144, 0.4545118489435741, 0.23900272435553016, -0.002391226384567008, -0.03463477973959276, -0.15615705723342085, -0.03685524225944564, -0.13908961741253734, -0.19701334559136913, -0.16274219893273853, 0.18037336532558715, -0.1153517309562414, -0.17654323008000142, 0.24790452748891853, 0.06416395661376771, 0.02431860894319557, -0.1287752604555516, 0.18399610707447642, -0.07561622697505213, 0.02981628646098432, 0.003518034171845232, 0.3687621590104841, 0.11477294732772168, 0.07256066774772037, -0.2947905395579125, 0.2747601072436997, -0.007544807069713161]
|
1,803.0492
|
Unusual suppression of the superconducting energy gap and critical
temperature in atomically thin NbSe2
|
It is well known that superconductivity in thin films is generally suppressed
with decreasing thickness. This suppression is normally governed by either
disorder-induced localization of Cooper pairs, weakening of Coulomb screening,
or generation and unbinding of vortex-antivortex pairs as described by the
Berezinskii-Kosterlitz-Thouless (BKT) theory. Defying general expectations,
few-layer NbSe2 - an archetypal example of ultrathin superconductors - has been
found to remain superconducting down to monolayer thickness. Here we report
measurements of both the superconducting energy gap and critical temperature in
high-quality monocrystals of few-layer NbSe2, using planar-junction tunneling
spectroscopy and lateral transport. We observe a fully developed gap that
rapidly reduces for devices with the number of layers N < 5, as does their
ctitical temperature. We show that the observed reduction cannot be explained
by disorder, and the BKT mechanism is also excluded by measuring its transition
temperature that for all N remains very close to Tc. We attribute the observed
behavior to changes in the electronic band structure predicted for mono- and
bi- layer NbSe2 combined with inevitable suppression of the Cooper pair density
at the superconductor-vacuum interface. Our experimental results for N > 2 are
in good agreement with the dependences of the gap and Tc expected in the latter
case while the effect of band-structure reconstruction is evidenced by a
stronger suppression of the gap and the disappearance of its anisotropy for N =
2. The spatial scale involved in the surface suppression of the density of
states is only a few angstroms but cannot be ignored for atomically thin
superconductors.
|
cond-mat.supr-con
|
it is well known that superconductivity in thin films is generally suppressed with decreasing thickness this suppression is normally governed by either disorderinduced localization of cooper pairs weakening of coulomb screening or generation and unbinding of vortexantivortex pairs as described by the berezinskiikosterlitzthouless bkt theory defying general expectations fewlayer nbse2 an archetypal example of ultrathin superconductors has been found to remain superconducting down to monolayer thickness here we report measurements of both the superconducting energy gap and critical temperature in highquality monocrystals of fewlayer nbse2 using planarjunction tunneling spectroscopy and lateral transport we observe a fully developed gap that rapidly reduces for devices with the number of layers n 5 as does their ctitical temperature we show that the observed reduction cannot be explained by disorder and the bkt mechanism is also excluded by measuring its transition temperature that for all n remains very close to tc we attribute the observed behavior to changes in the electronic band structure predicted for mono and bi layer nbse2 combined with inevitable suppression of the cooper pair density at the superconductorvacuum interface our experimental results for n 2 are in good agreement with the dependences of the gap and tc expected in the latter case while the effect of bandstructure reconstruction is evidenced by a stronger suppression of the gap and the disappearance of its anisotropy for n 2 the spatial scale involved in the surface suppression of the density of states is only a few angstroms but cannot be ignored for atomically thin superconductors
|
[['it', 'is', 'well', 'known', 'that', 'superconductivity', 'in', 'thin', 'films', 'is', 'generally', 'suppressed', 'with', 'decreasing', 'thickness', 'this', 'suppression', 'is', 'normally', 'governed', 'by', 'either', 'disorderinduced', 'localization', 'of', 'cooper', 'pairs', 'weakening', 'of', 'coulomb', 'screening', 'or', 'generation', 'and', 'unbinding', 'of', 'vortexantivortex', 'pairs', 'as', 'described', 'by', 'the', 'berezinskiikosterlitzthouless', 'bkt', 'theory', 'defying', 'general', 'expectations', 'fewlayer', 'nbse2', 'an', 'archetypal', 'example', 'of', 'ultrathin', 'superconductors', 'has', 'been', 'found', 'to', 'remain', 'superconducting', 'down', 'to', 'monolayer', 'thickness', 'here', 'we', 'report', 'measurements', 'of', 'both', 'the', 'superconducting', 'energy', 'gap', 'and', 'critical', 'temperature', 'in', 'highquality', 'monocrystals', 'of', 'fewlayer', 'nbse2', 'using', 'planarjunction', 'tunneling', 'spectroscopy', 'and', 'lateral', 'transport', 'we', 'observe', 'a', 'fully', 'developed', 'gap', 'that', 'rapidly', 'reduces', 'for', 'devices', 'with', 'the', 'number', 'of', 'layers', 'n', '5', 'as', 'does', 'their', 'ctitical', 'temperature', 'we', 'show', 'that', 'the', 'observed', 'reduction', 'can', 'not', 'be', 'explained', 'by', 'disorder', 'and', 'the', 'bkt', 'mechanism', 'is', 'also', 'excluded', 'by', 'measuring', 'its', 'transition', 'temperature', 'that', 'for', 'all', 'n', 'remains', 'very', 'close', 'to', 'tc', 'we', 'attribute', 'the', 'observed', 'behavior', 'to', 'changes', 'in', 'the', 'electronic', 'band', 'structure', 'predicted', 'for', 'mono', 'and', 'bi', 'layer', 'nbse2', 'combined', 'with', 'inevitable', 'suppression', 'of', 'the', 'cooper', 'pair', 'density', 'at', 'the', 'superconductorvacuum', 'interface', 'our', 'experimental', 'results', 'for', 'n', '2', 'are', 'in', 'good', 'agreement', 'with', 'the', 'dependences', 'of', 'the', 'gap', 'and', 'tc', 'expected', 'in', 'the', 'latter', 'case', 'while', 'the', 'effect', 'of', 'bandstructure', 'reconstruction', 'is', 'evidenced', 'by', 'a', 'stronger', 'suppression', 'of', 'the', 'gap', 'and', 'the', 'disappearance', 'of', 'its', 'anisotropy', 'for', 'n', '2', 'the', 'spatial', 'scale', 'involved', 'in', 'the', 'surface', 'suppression', 'of', 'the', 'density', 'of', 'states', 'is', 'only', 'a', 'few', 'angstroms', 'but', 'can', 'not', 'be', 'ignored', 'for', 'atomically', 'thin', 'superconductors']]
|
[-0.15832802734559911, 0.20266342517300426, -0.01850017273716955, 0.0430933075156471, -0.010750566743707574, -0.16459653056894552, 0.10060623917214766, 0.38697805751344205, -0.2473127879295127, -0.3282710231239518, 0.004525095240149899, -0.3328931098256587, -0.11366965750926193, 0.1771275015915206, 0.022586781655872367, 0.03397308240447052, -0.027691027843411938, -0.04965016053919031, -0.09906996748376772, -0.2129872079142759, 0.31485427128878307, 0.04942782540096942, 0.3424260395897211, 0.13393293385091515, -0.006154903122692358, -0.020468229221119672, 0.09509445259911546, 0.06638407861429871, -0.13465111951338612, 0.041152650001116765, 0.26453934307024624, -0.0810241250333328, 0.1977791809096591, -0.4298223601691276, -0.23618551240807242, 0.025117057512432664, 0.17619972132458037, 0.14127379541741722, -0.08193358805390498, -0.24826154259656857, 0.10461731110346982, -0.1276270314101204, -0.10633004142013908, -0.07064464299446083, 0.0007562288651298509, -0.03846288129127959, -0.23723028620414666, 0.13021684546045406, 0.07817033936123019, 0.07301115782549271, -0.060628326016812645, -0.10124429464998815, -0.0929328713054023, 0.05566404405072242, 0.04928438161894961, 0.050812323059166865, 0.15475679781548568, -0.1533559894618723, -0.0789807201344594, 0.3400867594688003, -0.0669383550442169, -0.06275261490442512, 0.1758374217480228, -0.18961652789071973, -0.03601618723543101, 0.1655941362663421, 0.0745780277232903, 0.09682834803672188, -0.10492268231891251, 0.05764581758529064, -0.011527771606069222, 0.20718655625425011, 0.058319708944643396, 0.07867269967406115, 0.22645921123573978, 0.23012709924097793, 0.023994415357478885, 0.11399210878950265, -0.12334506244832776, -0.016418269915187144, -0.25096993363347364, -0.16155719327410142, -0.2281152798244136, 0.05484794264956585, -0.04587511670182272, -0.193034537296104, 0.35798863663425784, 0.13487726733954883, 0.24420886362828148, -0.015366669026281372, 0.21542227994910335, 0.12104224487192988, 0.10779134366954436, 0.032875744143799616, 0.28418446157083094, 0.14510181137783623, 0.10749687147115736, -0.26791274557780637, 0.11918744408020905, 0.00158287300004724]
|
1,803.04921
|
On non-commutativity in quantum theory (III): determinantal point
processes and non-relativistic quantum mechanics
|
This article concludes our critical analysis on the role of non-commutativity
in quantum theory. After a brief introduction of the necessary notions on point
processes, we re-analyse model B proposed in "On non-commutativity in quantum
theory (II): toy models for non-commutative kinematics", using the point
process theory. This viewpoint allows to generalize and modify the space
process of model B in a simple manner, obtaining a new model (model C). This
new model allows the recovery of non-relativistic quantum mechanics in a
suitable limit.
|
quant-ph math-ph math.MP
|
this article concludes our critical analysis on the role of noncommutativity in quantum theory after a brief introduction of the necessary notions on point processes we reanalyse model b proposed in on noncommutativity in quantum theory ii toy models for noncommutative kinematics using the point process theory this viewpoint allows to generalize and modify the space process of model b in a simple manner obtaining a new model model c this new model allows the recovery of nonrelativistic quantum mechanics in a suitable limit
|
[['this', 'article', 'concludes', 'our', 'critical', 'analysis', 'on', 'the', 'role', 'of', 'noncommutativity', 'in', 'quantum', 'theory', 'after', 'a', 'brief', 'introduction', 'of', 'the', 'necessary', 'notions', 'on', 'point', 'processes', 'we', 'reanalyse', 'model', 'b', 'proposed', 'in', 'on', 'noncommutativity', 'in', 'quantum', 'theory', 'ii', 'toy', 'models', 'for', 'noncommutative', 'kinematics', 'using', 'the', 'point', 'process', 'theory', 'this', 'viewpoint', 'allows', 'to', 'generalize', 'and', 'modify', 'the', 'space', 'process', 'of', 'model', 'b', 'in', 'a', 'simple', 'manner', 'obtaining', 'a', 'new', 'model', 'model', 'c', 'this', 'new', 'model', 'allows', 'the', 'recovery', 'of', 'nonrelativistic', 'quantum', 'mechanics', 'in', 'a', 'suitable', 'limit']]
|
[-0.0668226979683996, 0.08544565780487444, -0.12702489157839278, 0.0641475345448184, -0.03595854397419663, -0.1611609026080086, 0.08471894163466502, 0.29534154540548724, -0.2569766298734716, -0.250503591638768, 0.017430495142304738, -0.21624255911592627, -0.20584446677405918, 0.1689044875619445, -0.10443477124707508, 0.04841884640267208, 0.046237120111029414, 0.0313420969926353, -0.09042255849843579, -0.21185629891364702, 0.3358121138298884, 0.09659911282055657, 0.27176512824925814, 0.031289566604841855, 0.08734074978357446, 0.0666504943732261, -0.054251048383039666, -0.013366300784885729, -0.17920706316363066, 0.12258247215123404, 0.16712619298765016, 0.13262444389207909, 0.25046564427958357, -0.4256134763404372, -0.23880656762048602, 0.04684279396730874, 0.11074534194943096, 0.15107757285503404, -0.03562774856081454, -0.2890544270409182, 0.02692062778043605, -0.19948503115613545, -0.14948798550869383, -0.10437815665223059, 0.00796970376922261, -0.10504860315649282, -0.2354578598959571, 0.060309291495719834, 0.09813587050441475, 0.0811937323638371, -0.05214140286504213, -0.038653831906794084, 0.0804930225907204, 0.07239829470580887, -0.02538459908793725, 0.03032139684018191, 0.11793152415304489, -0.12077672384025175, -0.14880958564823404, 0.404329108429097, -0.06244764485329922, -0.20934685920586898, 0.1772328844318898, -0.11509991357923441, -0.20201527565950528, 0.03546005647097315, 0.18834169083718388, 0.139129994054591, -0.15177972241681778, 0.2019297166033149, -0.03673717077998888, 0.1041398794754752, -0.012761558505839534, 0.0040482900194114164, 0.22763547888912616, 0.17385666461528412, 0.015189015783280843, 0.13113676996103354, -0.04688375898071432, -0.21201284786331512, -0.430908238204817, -0.16623170868981452, -0.11484951477143027, 0.07951950092960726, -0.10137398288168784, -0.15716729407376123, 0.39329629525586607, 0.2374005043280444, 0.21015947992869077, 0.0003859491664029303, 0.27066766807720777, 0.11574739441303314, -0.011620927868837802, -0.010642232359497853, 0.20714174828580803, 0.1798372026311145, 0.12914411799560876, -0.15438086015083605, 0.0037778897787488644, 0.1241415539933812]
|
1,803.04922
|
A simple cure for numerical shock instability in HLLC Riemann solver
|
The Harten-Lax-van Leer with contact (HLLC) scheme is known to be plagued by
various forms of numerical shock instabilities. In this paper, we propose a new
framework for developing shock stable, contact and shear preserving approximate
Riemann solvers based on the HLLC scheme for the Euler system of equations. The
proposed framework termed as HLLC-SWM (\textbf{S}elective \textbf{W}ave
\textbf{M}odified) scheme identifies and increases the magnitude of the
inherent diffusive HLL component within the HLLC scheme in the vicinity of a
shock wave while leaving its antidiffusive component unmodified to retain
accuracy on linearly degenerate wavefields. We present two strategies to
compute the requisite supplementary dissipation which results in HLLC-SWM-E and
HLLC-SWM-P variants. Through a linear perturbation analysis of the HLLC-SWM
framework, we clarify how the additional dissipation introduced in this way
helps in damping of unphysical perturbations in primitive quantities under a
derived CFL constraint. A matrix based stability analysis of a steady
two-dimensional normal shock is used to show that both variants of the HLLC-SWM
scheme are shock stable over a wide range of inlet Mach numbers. Results from
standard test cases demonstrate that the HLLC-SWM schemes are capable of
computing shock stable solutions on a variety of problems while retaining
positivity and exact inviscid contact ability. On viscous flows, while the
HLLC-SWM-P variant is quite accurate, the HLLC-SWM-E variant introduces slight
inaccuracy which can be corrected through a simple Mach number based switching
function.
|
physics.comp-ph
|
the hartenlaxvan leer with contact hllc scheme is known to be plagued by various forms of numerical shock instabilities in this paper we propose a new framework for developing shock stable contact and shear preserving approximate riemann solvers based on the hllc scheme for the euler system of equations the proposed framework termed as hllcswm textbfselective textbfwave textbfmodified scheme identifies and increases the magnitude of the inherent diffusive hll component within the hllc scheme in the vicinity of a shock wave while leaving its antidiffusive component unmodified to retain accuracy on linearly degenerate wavefields we present two strategies to compute the requisite supplementary dissipation which results in hllcswme and hllcswmp variants through a linear perturbation analysis of the hllcswm framework we clarify how the additional dissipation introduced in this way helps in damping of unphysical perturbations in primitive quantities under a derived cfl constraint a matrix based stability analysis of a steady twodimensional normal shock is used to show that both variants of the hllcswm scheme are shock stable over a wide range of inlet mach numbers results from standard test cases demonstrate that the hllcswm schemes are capable of computing shock stable solutions on a variety of problems while retaining positivity and exact inviscid contact ability on viscous flows while the hllcswmp variant is quite accurate the hllcswme variant introduces slight inaccuracy which can be corrected through a simple mach number based switching function
|
[['the', 'hartenlaxvan', 'leer', 'with', 'contact', 'hllc', 'scheme', 'is', 'known', 'to', 'be', 'plagued', 'by', 'various', 'forms', 'of', 'numerical', 'shock', 'instabilities', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'framework', 'for', 'developing', 'shock', 'stable', 'contact', 'and', 'shear', 'preserving', 'approximate', 'riemann', 'solvers', 'based', 'on', 'the', 'hllc', 'scheme', 'for', 'the', 'euler', 'system', 'of', 'equations', 'the', 'proposed', 'framework', 'termed', 'as', 'hllcswm', 'textbfselective', 'textbfwave', 'textbfmodified', 'scheme', 'identifies', 'and', 'increases', 'the', 'magnitude', 'of', 'the', 'inherent', 'diffusive', 'hll', 'component', 'within', 'the', 'hllc', 'scheme', 'in', 'the', 'vicinity', 'of', 'a', 'shock', 'wave', 'while', 'leaving', 'its', 'antidiffusive', 'component', 'unmodified', 'to', 'retain', 'accuracy', 'on', 'linearly', 'degenerate', 'wavefields', 'we', 'present', 'two', 'strategies', 'to', 'compute', 'the', 'requisite', 'supplementary', 'dissipation', 'which', 'results', 'in', 'hllcswme', 'and', 'hllcswmp', 'variants', 'through', 'a', 'linear', 'perturbation', 'analysis', 'of', 'the', 'hllcswm', 'framework', 'we', 'clarify', 'how', 'the', 'additional', 'dissipation', 'introduced', 'in', 'this', 'way', 'helps', 'in', 'damping', 'of', 'unphysical', 'perturbations', 'in', 'primitive', 'quantities', 'under', 'a', 'derived', 'cfl', 'constraint', 'a', 'matrix', 'based', 'stability', 'analysis', 'of', 'a', 'steady', 'twodimensional', 'normal', 'shock', 'is', 'used', 'to', 'show', 'that', 'both', 'variants', 'of', 'the', 'hllcswm', 'scheme', 'are', 'shock', 'stable', 'over', 'a', 'wide', 'range', 'of', 'inlet', 'mach', 'numbers', 'results', 'from', 'standard', 'test', 'cases', 'demonstrate', 'that', 'the', 'hllcswm', 'schemes', 'are', 'capable', 'of', 'computing', 'shock', 'stable', 'solutions', 'on', 'a', 'variety', 'of', 'problems', 'while', 'retaining', 'positivity', 'and', 'exact', 'inviscid', 'contact', 'ability', 'on', 'viscous', 'flows', 'while', 'the', 'hllcswmp', 'variant', 'is', 'quite', 'accurate', 'the', 'hllcswme', 'variant', 'introduces', 'slight', 'inaccuracy', 'which', 'can', 'be', 'corrected', 'through', 'a', 'simple', 'mach', 'number', 'based', 'switching', 'function']]
|
[-0.17123251164479084, 0.05774690285570135, -0.09928787403674633, 0.06025105451587016, -0.07281536013173887, -0.13471361864848355, 0.029878272398746686, 0.30843677269213166, -0.27362721164000076, -0.2802533602378772, 0.09546586330147795, -0.2076487365054179, -0.13435270856726883, 0.23173403548762986, -0.03873910671283834, 0.0919746176190082, 0.06490444771796383, -0.04280723222600819, -0.09775142367263406, -0.21226517543127238, 0.31512434486904295, 0.04362709412714793, 0.2870062848751172, 0.055953009463305454, 0.14984156166227827, -0.042216854771443955, -0.009996721253468933, 0.04573622825173037, -0.11326194956538466, 0.07796763901173938, 0.20662605602914833, 0.06677967558712944, 0.285281553429964, -0.43953874513604924, -0.24532877712044865, 0.026966881270932948, 0.1457164443941509, 0.1091671498235021, -0.035980071355752125, -0.24527150249770402, 0.11104303865137984, -0.18697330302338264, -0.14816788716543988, -0.0937466420475271, -0.030464297553663255, 0.04943064665712882, -0.25790430421291505, 0.11966885330886662, 0.05791373813949656, 0.010152076743747386, -0.04435944384251917, -0.07609296385597095, -0.014401845262782126, 0.03730388112129284, 0.06899984738546457, 0.0007689568053792117, 0.11362978554034112, -0.12687531212781833, -0.0654431267441332, 0.4171116845151246, -0.09331382753780897, -0.2442510470078049, 0.20962231149570199, -0.06928321713042494, -0.09003887549739661, 0.1844856155650249, 0.17272395168619, 0.1345048320501136, -0.09334252284137173, 0.06077438442694154, -0.024143985074292766, 0.13636736415138698, 0.0819466117151151, -0.021751439650216253, 0.15771997193479093, 0.16852806891384126, 0.08174207604545365, 0.1341188576949654, -0.0910438928236034, -0.11620803513123017, -0.3118580216051717, -0.14390538864468558, -0.12333046079801167, -0.006528119463486323, -0.09543588003649156, -0.19230650225450008, 0.3762946100514774, 0.15619945135825364, 0.1338691373744759, 0.06722064004912809, 0.3344890673352781, 0.12841095970974206, 0.029584383935128387, 0.12836679326025197, 0.22876417518005168, 0.16687616870101346, 0.08237272411637955, -0.24143694591271414, 0.07116893842293505, 0.11482844544827872]
|
1,803.04923
|
Connectivity properties of the adjacency graph of SLE$_\kappa$ bubbles
for $\kappa \in (4,8)$
|
We study the adjacency graph of bubbles---i.e., complementary connected
components---of an SLE$_{\kappa}$ curve for $\kappa \in (4,8)$, with two such
bubbles considered to be adjacent if their boundaries intersect. We show that
this adjacency graph is a.s. connected for $\kappa \in (4,\kappa_0]$, where
$\kappa_0 \approx 5.6158$ is defined explicitly. This gives a partial answer to
a problem posed by Duplantier, Miller and Sheffield (2014). Our proof in fact
yields a stronger connectivity result for $\kappa \in (4,\kappa_0]$, which says
that there is a Markovian way of finding a path from any fixed bubble to
$\infty$. We also show that there is a (non-explicit) $\kappa_1 \in (\kappa_0,
8)$ such that this stronger condition does not hold for $\kappa \in
[\kappa_1,8)$.
Our proofs are based on an encoding of SLE$_\kappa$ in terms of a pair of
independent $\kappa/4$-stable processes, which allows us to reduce our problem
to a problem about stable processes. In fact, due to this encoding, our results
can be re-phrased as statements about the connectivity of the adjacency graph
of loops when one glues together an independent pair of so-called
$\kappa/4$-stable looptrees, as studied, e.g., by Curien and Kortchemski
(2014).
The above encoding comes from the theory of Liouville quantum gravity (LQG),
but the paper can be read without any knowledge of LQG if one takes the
encoding as a black box.
|
math.PR math-ph math.MP
|
we study the adjacency graph of bubblesie complementary connected componentsof an sle_kappa curve for kappa in 48 with two such bubbles considered to be adjacent if their boundaries intersect we show that this adjacency graph is as connected for kappa in 4kappa_0 where kappa_0 approx 56158 is defined explicitly this gives a partial answer to a problem posed by duplantier miller and sheffield 2014 our proof in fact yields a stronger connectivity result for kappa in 4kappa_0 which says that there is a markovian way of finding a path from any fixed bubble to infty we also show that there is a nonexplicit kappa_1 in kappa_0 8 such that this stronger condition does not hold for kappa in kappa_18 our proofs are based on an encoding of sle_kappa in terms of a pair of independent kappa4stable processes which allows us to reduce our problem to a problem about stable processes in fact due to this encoding our results can be rephrased as statements about the connectivity of the adjacency graph of loops when one glues together an independent pair of socalled kappa4stable looptrees as studied eg by curien and kortchemski 2014 the above encoding comes from the theory of liouville quantum gravity lqg but the paper can be read without any knowledge of lqg if one takes the encoding as a black box
|
[['we', 'study', 'the', 'adjacency', 'graph', 'of', 'bubblesie', 'complementary', 'connected', 'componentsof', 'an', 'sle_kappa', 'curve', 'for', 'kappa', 'in', '48', 'with', 'two', 'such', 'bubbles', 'considered', 'to', 'be', 'adjacent', 'if', 'their', 'boundaries', 'intersect', 'we', 'show', 'that', 'this', 'adjacency', 'graph', 'is', 'as', 'connected', 'for', 'kappa', 'in', '4kappa_0', 'where', 'kappa_0', 'approx', '56158', 'is', 'defined', 'explicitly', 'this', 'gives', 'a', 'partial', 'answer', 'to', 'a', 'problem', 'posed', 'by', 'duplantier', 'miller', 'and', 'sheffield', '2014', 'our', 'proof', 'in', 'fact', 'yields', 'a', 'stronger', 'connectivity', 'result', 'for', 'kappa', 'in', '4kappa_0', 'which', 'says', 'that', 'there', 'is', 'a', 'markovian', 'way', 'of', 'finding', 'a', 'path', 'from', 'any', 'fixed', 'bubble', 'to', 'infty', 'we', 'also', 'show', 'that', 'there', 'is', 'a', 'nonexplicit', 'kappa_1', 'in', 'kappa_0', '8', 'such', 'that', 'this', 'stronger', 'condition', 'does', 'not', 'hold', 'for', 'kappa', 'in', 'kappa_18', 'our', 'proofs', 'are', 'based', 'on', 'an', 'encoding', 'of', 'sle_kappa', 'in', 'terms', 'of', 'a', 'pair', 'of', 'independent', 'kappa4stable', 'processes', 'which', 'allows', 'us', 'to', 'reduce', 'our', 'problem', 'to', 'a', 'problem', 'about', 'stable', 'processes', 'in', 'fact', 'due', 'to', 'this', 'encoding', 'our', 'results', 'can', 'be', 'rephrased', 'as', 'statements', 'about', 'the', 'connectivity', 'of', 'the', 'adjacency', 'graph', 'of', 'loops', 'when', 'one', 'glues', 'together', 'an', 'independent', 'pair', 'of', 'socalled', 'kappa4stable', 'looptrees', 'as', 'studied', 'eg', 'by', 'curien', 'and', 'kortchemski', '2014', 'the', 'above', 'encoding', 'comes', 'from', 'the', 'theory', 'of', 'liouville', 'quantum', 'gravity', 'lqg', 'but', 'the', 'paper', 'can', 'be', 'read', 'without', 'any', 'knowledge', 'of', 'lqg', 'if', 'one', 'takes', 'the', 'encoding', 'as', 'a', 'black', 'box']]
|
[-0.11949071298477912, 0.12203373392403591, -0.09441465824669183, 0.059054684346585076, -0.08721248968937542, -0.16140187777535514, 0.060386455891827166, 0.3361610621473817, -0.2729129516032286, -0.271417578041207, 0.09090884059970808, -0.2774526340551918, -0.15192902290024038, 0.19786587178187315, -0.12293910498102736, -0.007025482589487246, 0.05435939250882109, 0.058094132750100176, -0.0026988332484697186, -0.23848015144345525, 0.324077567616261, -0.0031529408256891506, 0.1985671628786381, 0.09129771289177412, 0.0971645466777561, 0.031504232474930345, -0.0032432633315397125, 0.06169118346906332, -0.14588784893587514, 0.09257718727295829, 0.2511095228951511, 0.1429717792700949, 0.23524930704016844, -0.38532640519010464, -0.20507075481690726, 0.12316912601073814, 0.15083826827880287, 0.07374308899932996, 0.026715063163469176, -0.2554811497153931, 0.13549309369869703, -0.11567523049428886, -0.11927513590645651, -0.015076628375018752, 0.06083494876403102, -0.03351738309260285, -0.28668720511243095, 0.046764659531669, 0.15558510359463304, 0.013783402386836188, 0.000834918397662858, -0.08403258879647352, -0.02414377343808409, 0.12497549938473872, 0.01627345827294681, 0.09064178878419794, 0.06293683086067092, -0.09377019578363573, -0.1557208339783883, 0.3485596521172759, -0.04371163430407123, -0.20078840319846952, 0.15398910636526295, -0.1247966465431937, -0.1714009127536312, 0.08738972249679094, 0.10063715438672537, 0.11363763181644297, -0.12315525923846127, 0.11898012150371404, -0.0881250933457036, 0.1729817586171246, 0.13012156981844888, 0.012149558939732784, 0.15872450693890175, 0.11709671528728376, 0.10989310652190863, 0.15016501504050697, 0.0079687480457387, -0.07625554967021873, -0.3182781243480222, -0.1603123055738505, -0.191674205288291, 0.11036654902780482, -0.13894011606516446, -0.18465159027404043, 0.3317601088347823, 0.14383638233466203, 0.2322591037010276, 0.08003126857044218, 0.23489621461607343, 0.11664348757111057, 0.053767591163645996, 0.1148033132971546, 0.17724311742065257, 0.13857701717297882, 0.04989563131726585, -0.1470529769541869, 0.057901538528372036, 0.09983184183839448]
|
1,803.04924
|
Dense Limit of the Dawid-Skene Model for Crowdsourcing and Regions of
Sub-optimality of Message Passing Algorithms
|
Crowdsourcing is a strategy to categorize data through the contribution of
many individuals. A wide range of theoretical and algorithmic contributions are
based on the model of Dawid and Skene [1]. Recently it was shown in [2,3] that,
in certain regimes, belief propagation is asymptotically optimal for data
generated from the Dawid-Skene model. This paper is motivated by this recent
progress. We analyze the dense limit of the Dawid-Skene model. It is shown that
it belongs to a larger class of low-rank matrix estimation problems for which
it is possible to express the asymptotic, Bayes-optimal, performance in a
simple closed form. In the dense limit the mapping to a low-rank matrix
estimation problem provides an approximate message passing algorithm that
solves the problem algorithmically. We identify the regions where the algorithm
efficiently computes the Bayes-optimal estimates. Our analysis refines the
results of [2,3] about optimality of message passing algorithms by
characterizing regions of parameters where these algorithms do not match the
Bayes-optimal performance. We further study numerically the performance of
approximate message passing, derived in the dense limit, on sparse instances
and carry out experiments on a real world dataset.
|
stat.ML cond-mat.dis-nn cond-mat.stat-mech physics.data-an
|
crowdsourcing is a strategy to categorize data through the contribution of many individuals a wide range of theoretical and algorithmic contributions are based on the model of dawid and skene 1 recently it was shown in 23 that in certain regimes belief propagation is asymptotically optimal for data generated from the dawidskene model this paper is motivated by this recent progress we analyze the dense limit of the dawidskene model it is shown that it belongs to a larger class of lowrank matrix estimation problems for which it is possible to express the asymptotic bayesoptimal performance in a simple closed form in the dense limit the mapping to a lowrank matrix estimation problem provides an approximate message passing algorithm that solves the problem algorithmically we identify the regions where the algorithm efficiently computes the bayesoptimal estimates our analysis refines the results of 23 about optimality of message passing algorithms by characterizing regions of parameters where these algorithms do not match the bayesoptimal performance we further study numerically the performance of approximate message passing derived in the dense limit on sparse instances and carry out experiments on a real world dataset
|
[['crowdsourcing', 'is', 'a', 'strategy', 'to', 'categorize', 'data', 'through', 'the', 'contribution', 'of', 'many', 'individuals', 'a', 'wide', 'range', 'of', 'theoretical', 'and', 'algorithmic', 'contributions', 'are', 'based', 'on', 'the', 'model', 'of', 'dawid', 'and', 'skene', '1', 'recently', 'it', 'was', 'shown', 'in', '23', 'that', 'in', 'certain', 'regimes', 'belief', 'propagation', 'is', 'asymptotically', 'optimal', 'for', 'data', 'generated', 'from', 'the', 'dawidskene', 'model', 'this', 'paper', 'is', 'motivated', 'by', 'this', 'recent', 'progress', 'we', 'analyze', 'the', 'dense', 'limit', 'of', 'the', 'dawidskene', 'model', 'it', 'is', 'shown', 'that', 'it', 'belongs', 'to', 'a', 'larger', 'class', 'of', 'lowrank', 'matrix', 'estimation', 'problems', 'for', 'which', 'it', 'is', 'possible', 'to', 'express', 'the', 'asymptotic', 'bayesoptimal', 'performance', 'in', 'a', 'simple', 'closed', 'form', 'in', 'the', 'dense', 'limit', 'the', 'mapping', 'to', 'a', 'lowrank', 'matrix', 'estimation', 'problem', 'provides', 'an', 'approximate', 'message', 'passing', 'algorithm', 'that', 'solves', 'the', 'problem', 'algorithmically', 'we', 'identify', 'the', 'regions', 'where', 'the', 'algorithm', 'efficiently', 'computes', 'the', 'bayesoptimal', 'estimates', 'our', 'analysis', 'refines', 'the', 'results', 'of', '23', 'about', 'optimality', 'of', 'message', 'passing', 'algorithms', 'by', 'characterizing', 'regions', 'of', 'parameters', 'where', 'these', 'algorithms', 'do', 'not', 'match', 'the', 'bayesoptimal', 'performance', 'we', 'further', 'study', 'numerically', 'the', 'performance', 'of', 'approximate', 'message', 'passing', 'derived', 'in', 'the', 'dense', 'limit', 'on', 'sparse', 'instances', 'and', 'carry', 'out', 'experiments', 'on', 'a', 'real', 'world', 'dataset']]
|
[-0.08926499079251171, 0.0073236944601950725, -0.08829903484224097, 0.07064081178304102, -0.0676184618845582, -0.12187484984629249, 0.09404951954125672, 0.3837646740635759, -0.27806893530497817, -0.29651895040940296, 0.12580305119351434, -0.25408210492643873, -0.1948796424500056, 0.19580473043698524, -0.08384796506725252, 0.0786832369569885, 0.09304887299842544, 0.048490185359198794, -0.06565829866449349, -0.28233578113937063, 0.26623745443372937, 0.04356752474253115, 0.30215108800483376, 0.025135702497668957, 0.12003128560946176, -0.017387825800841184, -0.025478123904720536, 0.012602515328111814, -0.11917192478795187, 0.1249578511979627, 0.2761029017782819, 0.2187478199625682, 0.2917178781359996, -0.37069273950581094, -0.19082193356497507, 0.11582606173561592, 0.16394081220864073, 0.10920732983473787, -0.021311325535153677, -0.289593170796472, 0.13443486728019227, -0.14825808780365868, -0.06178099877250038, -0.08128560300867417, -0.019636485318187624, -0.021370002023238494, -0.3345428496525672, 0.03381393799117129, 0.05476167010094382, -0.008706827241143114, -0.02421331404904394, -0.09956670046039538, 0.0700049316302236, 0.1358350481531632, 0.049918542723293956, 0.02036021207375023, 0.10303337798502885, -0.12806206185517735, -0.10114605050828111, 0.35877236768872917, -0.027809199126893776, -0.21205000912304967, 0.15613900783937423, -0.0683562256262552, -0.15111343754014295, 0.15995691125403697, 0.20000221174927182, 0.14910901297438325, -0.1587846352130567, 0.11094740657779192, -0.12663015654604687, 0.14745094448475068, 0.028231802083993035, -0.028903793867089248, 0.13138512709104505, 0.17746819063874059, 0.08444002533521454, 0.14081257794812124, -0.07264067345592928, -0.13355283430550788, -0.2566181264174367, -0.10324069934063836, -0.20948106705358155, -0.00807230752260167, -0.1280797593366802, -0.15914200634150275, 0.39233742349805606, 0.21342929169523384, 0.2039432724104508, 0.10125981037027056, 0.3192843137946176, 0.0838247481074895, 0.002100434192528299, 0.13667674577353817, 0.23452089829860548, 0.1172626113641615, 0.04929970472202465, -0.1795444117001209, 0.09456325930261396, 0.07494076490157137]
|
1,803.04925
|
Ultra-efficient superconducting Dayem bridge field-effect transistor
|
Superconducting field-effect transitor (SuFET) and Josephson field-effect
transistor (JoFET) technologies take advantage of electric field induced
control of charge carrier concentration in order to modulate the channel
superconducting properties. Despite field-effect is believed to be unaffective
for superconducting metals, recent experiments showed electric field dependent
modulation of the critical current (IC) in a fully metallic transistor. Yet,
the grounding mechanism of this phenomenon is not completely understood. Here,
we show the experimental realization of Ti-based Dayem bridge field-effect
transistors (DB-FETs) able to control IC of the superconducting channel. Our
easy fabrication process DB-FETs show symmetric full suppression of IC for an
applied critical gate voltage as low as VCG~+-8V at temperatures reaching about
the 85% of the record critical temperature TC~550mK for titanium. The
gate-independent TC and normal state resistance (RN) coupled with the increase
of resistance in the supercoducting state (RS) for gate voltages close to the
critical value (VCG) suggest the creation of field-effect induced metallic
puddles in the superconducting sea. Our devices show extremely high values of
transconductance (gMAXm~15uA/V at VG~+-6.5V) and variations of Josephson
kinetic inductance (LK) with VG of two orders of magnitude. Therefore, the
DB-FET appears as an ideal candidate for the realization of superconducting
electronics, superconducting qubits, tunable interferometers as well as photon
detectors.
|
cond-mat.mes-hall cond-mat.supr-con
|
superconducting fieldeffect transitor sufet and josephson fieldeffect transistor jofet technologies take advantage of electric field induced control of charge carrier concentration in order to modulate the channel superconducting properties despite fieldeffect is believed to be unaffective for superconducting metals recent experiments showed electric field dependent modulation of the critical current ic in a fully metallic transistor yet the grounding mechanism of this phenomenon is not completely understood here we show the experimental realization of tibased dayem bridge fieldeffect transistors dbfets able to control ic of the superconducting channel our easy fabrication process dbfets show symmetric full suppression of ic for an applied critical gate voltage as low as vcg8v at temperatures reaching about the 85 of the record critical temperature tc550mk for titanium the gateindependent tc and normal state resistance rn coupled with the increase of resistance in the supercoducting state rs for gate voltages close to the critical value vcg suggest the creation of fieldeffect induced metallic puddles in the superconducting sea our devices show extremely high values of transconductance gmaxm15uav at vg65v and variations of josephson kinetic inductance lk with vg of two orders of magnitude therefore the dbfet appears as an ideal candidate for the realization of superconducting electronics superconducting qubits tunable interferometers as well as photon detectors
|
[['superconducting', 'fieldeffect', 'transitor', 'sufet', 'and', 'josephson', 'fieldeffect', 'transistor', 'jofet', 'technologies', 'take', 'advantage', 'of', 'electric', 'field', 'induced', 'control', 'of', 'charge', 'carrier', 'concentration', 'in', 'order', 'to', 'modulate', 'the', 'channel', 'superconducting', 'properties', 'despite', 'fieldeffect', 'is', 'believed', 'to', 'be', 'unaffective', 'for', 'superconducting', 'metals', 'recent', 'experiments', 'showed', 'electric', 'field', 'dependent', 'modulation', 'of', 'the', 'critical', 'current', 'ic', 'in', 'a', 'fully', 'metallic', 'transistor', 'yet', 'the', 'grounding', 'mechanism', 'of', 'this', 'phenomenon', 'is', 'not', 'completely', 'understood', 'here', 'we', 'show', 'the', 'experimental', 'realization', 'of', 'tibased', 'dayem', 'bridge', 'fieldeffect', 'transistors', 'dbfets', 'able', 'to', 'control', 'ic', 'of', 'the', 'superconducting', 'channel', 'our', 'easy', 'fabrication', 'process', 'dbfets', 'show', 'symmetric', 'full', 'suppression', 'of', 'ic', 'for', 'an', 'applied', 'critical', 'gate', 'voltage', 'as', 'low', 'as', 'vcg8v', 'at', 'temperatures', 'reaching', 'about', 'the', '85', 'of', 'the', 'record', 'critical', 'temperature', 'tc550mk', 'for', 'titanium', 'the', 'gateindependent', 'tc', 'and', 'normal', 'state', 'resistance', 'rn', 'coupled', 'with', 'the', 'increase', 'of', 'resistance', 'in', 'the', 'supercoducting', 'state', 'rs', 'for', 'gate', 'voltages', 'close', 'to', 'the', 'critical', 'value', 'vcg', 'suggest', 'the', 'creation', 'of', 'fieldeffect', 'induced', 'metallic', 'puddles', 'in', 'the', 'superconducting', 'sea', 'our', 'devices', 'show', 'extremely', 'high', 'values', 'of', 'transconductance', 'gmaxm15uav', 'at', 'vg65v', 'and', 'variations', 'of', 'josephson', 'kinetic', 'inductance', 'lk', 'with', 'vg', 'of', 'two', 'orders', 'of', 'magnitude', 'therefore', 'the', 'dbfet', 'appears', 'as', 'an', 'ideal', 'candidate', 'for', 'the', 'realization', 'of', 'superconducting', 'electronics', 'superconducting', 'qubits', 'tunable', 'interferometers', 'as', 'well', 'as', 'photon', 'detectors']]
|
[-0.20810819479941142, 0.17264712088421905, 0.02462636974713959, -0.038251116966160105, -0.015363191576019888, -0.22311092981616829, 0.11061537478379628, 0.391041033182035, -0.2082955514929156, -0.30269784654149473, -0.014861293844786464, -0.28345389577380314, -0.11074233862875711, 0.25763240738945903, -0.04364369684452246, 0.0318250395289892, -0.06082470621049201, -0.0375545312051712, -0.087067861409655, -0.2075588061741673, 0.24316859865183066, 0.06042246556899045, 0.3959625639127438, 0.09974212404156085, 0.10200058244915661, -0.07979184927391166, 0.13611965895443695, -0.010516229548980252, -0.10821995768456323, -0.00220013189470709, 0.3215628759843288, -0.09803561992841855, 0.1880037756867264, -0.4715428794411444, -0.20845631251830865, 0.013500150001497183, 0.1388623992483694, 0.11096510304470021, -0.055853166292988615, -0.2659936583987645, 0.09835809312206416, -0.18481449340470135, -0.10999889448992528, -0.03644574124178455, 0.01770699501294345, 0.00520564398110503, -0.2425984058305529, 0.040892436845679905, 0.048192436768244584, 0.044247748712907625, -0.03936251875877295, -0.13799762603882146, -0.019586877552746323, 0.031560691696963974, -0.03751353234399023, 0.05598134200070238, 0.2462230372837097, -0.16080763475222531, -0.13465503804122864, 0.24869719092586623, -0.027817105554565236, -0.05585211872474445, 0.1307859251737862, -0.16393763083494314, 0.006219638245425759, 0.1250179368578414, 0.09950344096396653, 0.053697339608334005, -0.15908099267410464, 0.044717645502417566, 0.061950275327521606, 0.18191852156559263, 0.05894346337184531, 0.1392787815348849, 0.2663992376361817, 0.27392164421369236, 0.08184704312127969, 0.13106142245993793, -0.115135552658409, 0.0035591930298521967, -0.27575533016409615, -0.1948726712561807, -0.1962887089685675, 0.14237471788726566, -0.061684572521500905, -0.24171566708465245, 0.38627952331271354, 0.21260674132350002, 0.14741766533127404, -0.05483486296466118, 0.2988952992225785, 0.1348545135357325, 0.11842161801984848, -0.0026086772963350483, 0.23225061567431077, 0.22333277392634512, 0.13710527357156618, -0.304723283154936, 0.10067243019926032, -0.0644972419451535]
|
1,803.04926
|
Active Reinforcement Learning with Monte-Carlo Tree Search
|
Active Reinforcement Learning (ARL) is a twist on RL where the agent observes
reward information only if it pays a cost. This subtle change makes exploration
substantially more challenging. Powerful principles in RL like optimism,
Thompson sampling, and random exploration do not help with ARL. We relate ARL
in tabular environments to Bayes-Adaptive MDPs. We provide an ARL algorithm
using Monte-Carlo Tree Search that is asymptotically Bayes optimal.
Experimentally, this algorithm is near-optimal on small Bandit problems and
MDPs. On larger MDPs it outperforms a Q-learner augmented with specialised
heuristics for ARL. By analysing exploration behaviour in detail, we uncover
obstacles to scaling up simulation-based algorithms for ARL.
|
cs.LG stat.ML
|
active reinforcement learning arl is a twist on rl where the agent observes reward information only if it pays a cost this subtle change makes exploration substantially more challenging powerful principles in rl like optimism thompson sampling and random exploration do not help with arl we relate arl in tabular environments to bayesadaptive mdps we provide an arl algorithm using montecarlo tree search that is asymptotically bayes optimal experimentally this algorithm is nearoptimal on small bandit problems and mdps on larger mdps it outperforms a qlearner augmented with specialised heuristics for arl by analysing exploration behaviour in detail we uncover obstacles to scaling up simulationbased algorithms for arl
|
[['active', 'reinforcement', 'learning', 'arl', 'is', 'a', 'twist', 'on', 'rl', 'where', 'the', 'agent', 'observes', 'reward', 'information', 'only', 'if', 'it', 'pays', 'a', 'cost', 'this', 'subtle', 'change', 'makes', 'exploration', 'substantially', 'more', 'challenging', 'powerful', 'principles', 'in', 'rl', 'like', 'optimism', 'thompson', 'sampling', 'and', 'random', 'exploration', 'do', 'not', 'help', 'with', 'arl', 'we', 'relate', 'arl', 'in', 'tabular', 'environments', 'to', 'bayesadaptive', 'mdps', 'we', 'provide', 'an', 'arl', 'algorithm', 'using', 'montecarlo', 'tree', 'search', 'that', 'is', 'asymptotically', 'bayes', 'optimal', 'experimentally', 'this', 'algorithm', 'is', 'nearoptimal', 'on', 'small', 'bandit', 'problems', 'and', 'mdps', 'on', 'larger', 'mdps', 'it', 'outperforms', 'a', 'qlearner', 'augmented', 'with', 'specialised', 'heuristics', 'for', 'arl', 'by', 'analysing', 'exploration', 'behaviour', 'in', 'detail', 'we', 'uncover', 'obstacles', 'to', 'scaling', 'up', 'simulationbased', 'algorithms', 'for', 'arl']]
|
[-0.05405435619753934, 0.06922921645098744, -0.1004883981849476, 0.17628945287199535, -0.20151386782962166, -0.21417370452066867, 0.14222622066562143, 0.5107287776908863, -0.23608593778493248, -0.3407331751050236, 0.10397805466434144, -0.23185986397128605, -0.18517999479843078, 0.226466573534368, -0.14023830036773613, 0.08291783032364378, 0.07761152085092542, 0.012225267679972365, -0.012480835100118002, -0.260242354037745, 0.23539089355465442, 0.11395272549903282, 0.2762604915345453, -0.04780151407347522, 0.15822418115893813, 0.036810510944157285, -0.0042562791152865945, 0.0272597883714833, -0.13395815066457128, 0.08702399299662804, 0.36458807787096353, 0.24134536021798153, 0.399430422225497, -0.3561815363746659, -0.12446008811304433, 0.1502889320428405, 0.14203274961360773, 0.09049527689370666, -0.04223356744294625, -0.30621348062060144, 0.035031240359470944, -0.16343743780575623, -0.0038270141589934023, -0.1203095918873795, -0.021067873130891923, -0.04330457882764183, -0.3010480883574792, -0.045118319227525565, 0.015366046241197352, 0.0458031549492729, -0.0120200786530693, -0.15666816102462672, 0.11375330298895313, 0.09079506361441443, 0.06911066646043594, 0.052712893273428985, 0.1734231841428397, -0.16397628534115224, -0.2397561331592918, 0.3099544441096798, 0.002013688036632315, -0.21499816613123865, 0.21754077328020863, -0.06352241021781185, -0.20694575184590627, 0.1608060923509439, 0.23978965047085396, 0.1523251117524804, -0.14205156321306583, 0.111631512941105, -0.055288036210270966, 0.15015940997471042, 0.023379889421304253, -0.055400242450185745, 0.08507471526407193, 0.2688962537186029, 0.16652663524053712, 0.1320932629326724, -0.01905127462635043, -0.1911117027853137, -0.21076558072067728, -0.10029023514285892, -0.1703103077445597, 0.020147107369794127, -0.16581329538799153, -0.1392816466053025, 0.25097622904299854, 0.2600524215045098, 0.11727220649073754, 0.21141256515598186, 0.31334479687578765, 0.09694831406645407, 0.04109462714431999, 0.18968317949291424, 0.2007219156709491, -0.01373266433713801, 0.09970498434920734, -0.2185324873387918, 0.19481398886130583, 0.03187996267872018]
|
1,803.04927
|
An Agent-Based Simulation of Residential Location Choice of Tenants in
Tehran, Iran
|
Residential location choice modeling is one of the substantial components of
land use and transportation models. While numerous aggregated mathematical and
statistical approaches have been developed to model the residence choice
behavior of households, disaggregated approaches such as the agent-based
modeling have shown interesting capabilities. In this article, a novel
agent-based approach is developed to simulate the residential location choice
of tenants in Tehran, the capital of Iran. Tenants are considered as agents who
select their desired residential alternatives according to their
characteristics and preferences for various criteria such as the rent,
accessibility to different services and facilities, environmental pollution,
and distance from their workplace and former residence. The choice set of
agents is limited to their desired residential alternatives by applying a
constrained NSGA-II algorithm. Then, agents compete with each other to select
their final residence among their alternatives. Results of the proposed
approach are validated by comparing simulated and actual residences of a sample
of tenants. Results show that the proposed approach is able to accurately
simulate the residence of 59.3% of tenants at the traffic analysis zone level.
|
cs.MA cs.AI cs.CY
|
residential location choice modeling is one of the substantial components of land use and transportation models while numerous aggregated mathematical and statistical approaches have been developed to model the residence choice behavior of households disaggregated approaches such as the agentbased modeling have shown interesting capabilities in this article a novel agentbased approach is developed to simulate the residential location choice of tenants in tehran the capital of iran tenants are considered as agents who select their desired residential alternatives according to their characteristics and preferences for various criteria such as the rent accessibility to different services and facilities environmental pollution and distance from their workplace and former residence the choice set of agents is limited to their desired residential alternatives by applying a constrained nsgaii algorithm then agents compete with each other to select their final residence among their alternatives results of the proposed approach are validated by comparing simulated and actual residences of a sample of tenants results show that the proposed approach is able to accurately simulate the residence of 593 of tenants at the traffic analysis zone level
|
[['residential', 'location', 'choice', 'modeling', 'is', 'one', 'of', 'the', 'substantial', 'components', 'of', 'land', 'use', 'and', 'transportation', 'models', 'while', 'numerous', 'aggregated', 'mathematical', 'and', 'statistical', 'approaches', 'have', 'been', 'developed', 'to', 'model', 'the', 'residence', 'choice', 'behavior', 'of', 'households', 'disaggregated', 'approaches', 'such', 'as', 'the', 'agentbased', 'modeling', 'have', 'shown', 'interesting', 'capabilities', 'in', 'this', 'article', 'a', 'novel', 'agentbased', 'approach', 'is', 'developed', 'to', 'simulate', 'the', 'residential', 'location', 'choice', 'of', 'tenants', 'in', 'tehran', 'the', 'capital', 'of', 'iran', 'tenants', 'are', 'considered', 'as', 'agents', 'who', 'select', 'their', 'desired', 'residential', 'alternatives', 'according', 'to', 'their', 'characteristics', 'and', 'preferences', 'for', 'various', 'criteria', 'such', 'as', 'the', 'rent', 'accessibility', 'to', 'different', 'services', 'and', 'facilities', 'environmental', 'pollution', 'and', 'distance', 'from', 'their', 'workplace', 'and', 'former', 'residence', 'the', 'choice', 'set', 'of', 'agents', 'is', 'limited', 'to', 'their', 'desired', 'residential', 'alternatives', 'by', 'applying', 'a', 'constrained', 'nsgaii', 'algorithm', 'then', 'agents', 'compete', 'with', 'each', 'other', 'to', 'select', 'their', 'final', 'residence', 'among', 'their', 'alternatives', 'results', 'of', 'the', 'proposed', 'approach', 'are', 'validated', 'by', 'comparing', 'simulated', 'and', 'actual', 'residences', 'of', 'a', 'sample', 'of', 'tenants', 'results', 'show', 'that', 'the', 'proposed', 'approach', 'is', 'able', 'to', 'accurately', 'simulate', 'the', 'residence', 'of', '593', 'of', 'tenants', 'at', 'the', 'traffic', 'analysis', 'zone', 'level']]
|
[-0.05452174631279291, 0.03958026128975438, -0.0895952882000132, 0.09113981662181757, -0.0813635623645943, -0.17102856167144456, 0.1193715616667036, 0.40177052221595416, -0.24081908812674369, -0.3742763502111669, 0.0920803731201906, -0.2910115382484886, -0.11729658640247707, 0.17464089412525172, -0.11823738339866476, 0.06792689623949195, 0.02735535247516381, 0.01135810013366503, 0.07057103216879645, -0.29946859603366965, 0.2568974869083922, 0.08041816711482382, 0.36672451341967227, 0.025007455753810828, 0.09400438725721935, -0.03233660514500553, -0.08492139062023521, 0.019709812701981737, -0.10459343629050002, 0.14462242801081987, 0.31247536520157615, 0.1860226828422274, 0.36716704887919416, -0.44263964696401875, -0.2111251479547306, 0.11283043101532848, 0.0871758292241341, 0.025469339652069285, 0.01419011453933273, -0.3008746650810894, 0.07989787019902418, -0.24364885062143948, -0.14305458904773985, -0.056902068157716354, -0.000616396715586686, 0.11180288018755234, -0.24898505529378495, -0.0024273739587412683, -0.04371570872698617, 0.06836931041611657, -0.08211686287991167, -0.1428584314301322, -0.07359677897599005, 0.23515371165562482, 0.09226783518152033, -0.0756472288262683, 0.21439696241746456, -0.11665601552932302, -0.13689200223606204, 0.42066537853309793, 0.02284428290894142, -0.17445801326893115, 0.24063595599052368, -0.061726824017704685, -0.10397225241202511, 0.05500307014644228, 0.2263159138167879, 0.07788164265330325, -0.21219535783262541, 0.006218200520218674, -0.021908447077595605, 0.10495569970129438, 0.047647357460378945, 0.002575831216353491, 0.17753630540544652, 0.19134135857142137, 0.10533568638762637, 0.05961735428276199, -0.059160326844215065, -0.1421752668189101, -0.20197756648145987, -0.1167528876875275, -0.17036780728881365, -0.026307949342878112, -0.08686738488727792, -0.11610466578395816, 0.41302938983153076, 0.21545863596115322, 0.13000616804794382, 0.07817334512979286, 0.32319681540270495, 0.038627918380089436, 0.07077112764253803, 0.06418186019287954, 0.1424310209605205, 0.0005054069300746874, 0.13979648264737296, -0.2008184556262722, 0.15737691439832277, -0.02336627112924879]
|
1,803.04928
|
Post-recombination Dark Matter for the 21-cm Signal
|
We have no certain knowledge of the early history of dark matter (DM). In
this paper we propose a scenario where DM is produced post-recombination but
prior to the cosmic dawn. It helps to relax the bounds on DM interactions, in
particular with baryons, from the CMB. It may be of interest in some
circumstances, for example, to understand the recent cosmic dawn 21-cm signal
anomaly. We argue that the cosmic gas cooling mechanism via the minicharged
DM-baryon scattering may be viable even if it takes up the total DM budget. We
also investigate the possibility of a gluon-philic mediator of a few 10 keV, to
find that the most reliable exclusion is from the neutron scattering.
|
hep-ph
|
we have no certain knowledge of the early history of dark matter dm in this paper we propose a scenario where dm is produced postrecombination but prior to the cosmic dawn it helps to relax the bounds on dm interactions in particular with baryons from the cmb it may be of interest in some circumstances for example to understand the recent cosmic dawn 21cm signal anomaly we argue that the cosmic gas cooling mechanism via the minicharged dmbaryon scattering may be viable even if it takes up the total dm budget we also investigate the possibility of a gluonphilic mediator of a few 10 kev to find that the most reliable exclusion is from the neutron scattering
|
[['we', 'have', 'no', 'certain', 'knowledge', 'of', 'the', 'early', 'history', 'of', 'dark', 'matter', 'dm', 'in', 'this', 'paper', 'we', 'propose', 'a', 'scenario', 'where', 'dm', 'is', 'produced', 'postrecombination', 'but', 'prior', 'to', 'the', 'cosmic', 'dawn', 'it', 'helps', 'to', 'relax', 'the', 'bounds', 'on', 'dm', 'interactions', 'in', 'particular', 'with', 'baryons', 'from', 'the', 'cmb', 'it', 'may', 'be', 'of', 'interest', 'in', 'some', 'circumstances', 'for', 'example', 'to', 'understand', 'the', 'recent', 'cosmic', 'dawn', '21cm', 'signal', 'anomaly', 'we', 'argue', 'that', 'the', 'cosmic', 'gas', 'cooling', 'mechanism', 'via', 'the', 'minicharged', 'dmbaryon', 'scattering', 'may', 'be', 'viable', 'even', 'if', 'it', 'takes', 'up', 'the', 'total', 'dm', 'budget', 'we', 'also', 'investigate', 'the', 'possibility', 'of', 'a', 'gluonphilic', 'mediator', 'of', 'a', 'few', '10', 'kev', 'to', 'find', 'that', 'the', 'most', 'reliable', 'exclusion', 'is', 'from', 'the', 'neutron', 'scattering']]
|
[-0.10783780240784961, 0.18173877463740265, -0.11144346694044512, 0.1372045886046494, -0.1243071042820169, -0.07021898580393915, 0.026150140502883508, 0.3431996982946093, -0.2574403622831973, -0.34903483494217025, 0.0518635180748694, -0.278842495577731, -0.07041041533751734, 0.17937007279873923, 0.03002045927408697, -0.03232798760993695, 0.004757160320878029, 0.03968177138474481, -0.0010654585544373199, -0.307852124519333, 0.2993942652788848, 0.13288038985297917, 0.1959471887023718, 0.10482408413284655, 0.07039436074134348, -0.04200816536844098, -0.05512167098289677, -0.07181749134806209, -0.13129489759351068, 0.0687681754091594, 0.21065828799729733, 0.17066171019215634, 0.17953368376916404, -0.4510693893735779, -0.2597271637541467, 0.23256733177374278, 0.16583495463067988, 0.13882194355868832, -0.11177319537643504, -0.26929797524393634, 0.07335325176546607, -0.2139335702462443, -0.06883810541656768, -0.024533248137168843, -0.0159931376231192, -0.05759948127951216, -0.2355475637114382, 0.09918325735885321, 0.022321952906826606, -0.0778762977690725, -0.07087466033006987, -0.07702382470296439, 0.031931072316967464, 0.026687171474773567, 0.09317346425839411, 0.01636887505722778, 0.19847012484638854, -0.18005692678030003, -0.04417028660275813, 0.4290494489451421, -0.11046315576270993, -0.08717534662995102, 0.18388123265347153, -0.1925565916282157, -0.1989792174306409, 0.12926746758728705, 0.15570673592998807, 0.06690449408929923, -0.17100379600767687, 0.10882877101639993, -0.043791458502427896, 0.1810775447139067, 0.056556066843392004, 0.020628437035564526, 0.34956600978681496, 0.16508594521216985, 0.08712852536901382, 0.06393193606696702, -0.12986654971910896, -0.024169118396520358, -0.31147491224190416, -0.13855448354974967, -0.12978770599925313, 0.06373705336290154, -0.07831630620960917, -0.07811310639954172, 0.32826363626899646, 0.20858823098764145, 0.23134784513767326, 0.004252397645955327, 0.3287344428164692, 0.050540629577630294, 0.0389571690566613, 0.043629807385953207, 0.3381570107597107, 0.11580428817502127, 0.10242961281268247, -0.19737438796939136, 0.09634098513473371, -0.04432936063325354]
|
1,803.04929
|
Structural Agnostic Modeling: Adversarial Learning of Causal Graphs
|
A new causal discovery method, Structural Agnostic Modeling (SAM), is
presented in this paper. Leveraging both conditional independencies and
distributional asymmetries, SAM aims to find the underlying causal structure
from observational data. The approach is based on a game between different
players estimating each variable distribution conditionally to the others as a
neural net, and an adversary aimed at discriminating the generated data against
the original data. A learning criterion combining distribution estimation,
sparsity and acyclicity constraints is used to enforce the optimization of the
graph structure and parameters through stochastic gradient descent. SAM is
extensively experimentally validated on synthetic and real data.
|
stat.ML
|
a new causal discovery method structural agnostic modeling sam is presented in this paper leveraging both conditional independencies and distributional asymmetries sam aims to find the underlying causal structure from observational data the approach is based on a game between different players estimating each variable distribution conditionally to the others as a neural net and an adversary aimed at discriminating the generated data against the original data a learning criterion combining distribution estimation sparsity and acyclicity constraints is used to enforce the optimization of the graph structure and parameters through stochastic gradient descent sam is extensively experimentally validated on synthetic and real data
|
[['a', 'new', 'causal', 'discovery', 'method', 'structural', 'agnostic', 'modeling', 'sam', 'is', 'presented', 'in', 'this', 'paper', 'leveraging', 'both', 'conditional', 'independencies', 'and', 'distributional', 'asymmetries', 'sam', 'aims', 'to', 'find', 'the', 'underlying', 'causal', 'structure', 'from', 'observational', 'data', 'the', 'approach', 'is', 'based', 'on', 'a', 'game', 'between', 'different', 'players', 'estimating', 'each', 'variable', 'distribution', 'conditionally', 'to', 'the', 'others', 'as', 'a', 'neural', 'net', 'and', 'an', 'adversary', 'aimed', 'at', 'discriminating', 'the', 'generated', 'data', 'against', 'the', 'original', 'data', 'a', 'learning', 'criterion', 'combining', 'distribution', 'estimation', 'sparsity', 'and', 'acyclicity', 'constraints', 'is', 'used', 'to', 'enforce', 'the', 'optimization', 'of', 'the', 'graph', 'structure', 'and', 'parameters', 'through', 'stochastic', 'gradient', 'descent', 'sam', 'is', 'extensively', 'experimentally', 'validated', 'on', 'synthetic', 'and', 'real', 'data']]
|
[-0.05308287719138039, -0.001623769293994715, -0.14696419285779855, 0.12547417526422702, -0.18147309273662207, -0.1738915830416587, 0.049459704870156926, 0.40692055670237076, -0.3260023615422469, -0.32787938015445056, 0.08952808991250881, -0.2439450164397871, -0.1716344686659071, 0.1266992943772811, -0.09607771114057419, 0.10474156116325299, 0.07478723606293641, -0.020863120005583588, -0.018260207913309626, -0.2618554593620537, 0.3119508980601592, 0.08927201714764521, 0.35596254302100594, -0.03686011833979667, 0.17200075187577665, 0.04890266771527749, -0.07451279134064623, 0.019822923692612394, -0.10228882557305607, 0.15560232094281073, 0.24801164901209544, 0.22565498737249867, 0.3197322915199674, -0.4067948386434791, -0.2085593066277724, 0.10765241996556954, 0.06781313322383901, 0.10763937338409059, -0.06375539309381353, -0.3172353476249767, 0.07568157274384522, -0.12047412335981154, 0.008724003300088847, -0.10705529316102416, -0.0267545779787221, 0.016323518089371398, -0.3459654509223256, 0.031818663686721864, 0.03402399656914391, 0.09333939624281185, -0.05509091962300675, -0.12018891546911406, -0.05423376381281962, 0.11488116957084502, 0.03535288735066803, 0.021918951863766585, 0.1322122367225515, -0.11870372344884407, -0.15907734527379203, 0.32451264211654807, -0.04782867542178668, -0.22660910754093846, 0.17589203122035754, -0.0683713255323542, -0.15215231027472223, 0.0452874889506877, 0.20689157036684672, 0.1140065522846377, -0.2042126636737415, 0.04694575515917041, -0.0389898432027639, 0.17452335743984046, -0.009936450239162422, -0.032350916017606424, 0.1663367703118479, 0.2026561474584685, 0.063610115477327, 0.1213240428303269, -0.13469152359373288, -0.116240957112151, -0.25575541119877865, -0.07680457548093665, -0.22339183035152918, -0.042717328164003136, -0.13605768991635944, -0.12419782364650549, 0.4140615988595104, 0.1944748023072782, 0.2341188882088777, 0.09867470425460939, 0.364648689361045, 0.05309961351805629, 0.03995740268937791, 0.10227929495130349, 0.1700546432838061, 0.14811691345231046, 0.09080900385234396, -0.20142483675752956, 0.20655290660159029, 0.014111673801875158]
|
1,803.0493
|
Polynomials and degrees of maps in real normed algebras
|
Let $\cal{A}$ be the algebra of quaternions $\mathbb{H}$ or octonions
$\mathbb{O}$. In this manuscript a new proof is given, based on ideas of Cauchy
and D' Alembert, of the fact that an ordinary polynomial $f(t) \in {\cal{A}}\,
[t]$ has a root in $\cal{A}$. As a consequence, the Jacobian determinant
$|J(f)|$ is always non negative in $\cal{A}$. Moreover, using the idea of the
topological degree we show that a regular polynomial $g(t)$ over $\cal{A}$ has
also a root in $\cal{A}$. Finally, utilizing multiplication $(*)$ in $\cal{A}$,
we prove various results on the topological degree of products of maps. In
particular, if $S$ is the unit sphere in $\cal{A}$ and $h_1, h_2: S \to S$ are
smooth maps, it is shown that $\hbox{deg} (h_1 * h_2)=\hbox{deg} (h_1) +
\hbox{deg} (h_2)$.
|
math.RA math.AG
|
let cala be the algebra of quaternions mathbbh or octonions mathbbo in this manuscript a new proof is given based on ideas of cauchy and d alembert of the fact that an ordinary polynomial ft in cala t has a root in cala as a consequence the jacobian determinant jf is always non negative in cala moreover using the idea of the topological degree we show that a regular polynomial gt over cala has also a root in cala finally utilizing multiplication in cala we prove various results on the topological degree of products of maps in particular if s is the unit sphere in cala and h_1 h_2 s to s are smooth maps it is shown that hboxdeg h_1 h_2hboxdeg h_1 hboxdeg h_2
|
[['let', 'cala', 'be', 'the', 'algebra', 'of', 'quaternions', 'mathbbh', 'or', 'octonions', 'mathbbo', 'in', 'this', 'manuscript', 'a', 'new', 'proof', 'is', 'given', 'based', 'on', 'ideas', 'of', 'cauchy', 'and', 'd', 'alembert', 'of', 'the', 'fact', 'that', 'an', 'ordinary', 'polynomial', 'ft', 'in', 'cala', 't', 'has', 'a', 'root', 'in', 'cala', 'as', 'a', 'consequence', 'the', 'jacobian', 'determinant', 'jf', 'is', 'always', 'non', 'negative', 'in', 'cala', 'moreover', 'using', 'the', 'idea', 'of', 'the', 'topological', 'degree', 'we', 'show', 'that', 'a', 'regular', 'polynomial', 'gt', 'over', 'cala', 'has', 'also', 'a', 'root', 'in', 'cala', 'finally', 'utilizing', 'multiplication', 'in', 'cala', 'we', 'prove', 'various', 'results', 'on', 'the', 'topological', 'degree', 'of', 'products', 'of', 'maps', 'in', 'particular', 'if', 's', 'is', 'the', 'unit', 'sphere', 'in', 'cala', 'and', 'h_1', 'h_2', 's', 'to', 's', 'are', 'smooth', 'maps', 'it', 'is', 'shown', 'that', 'hboxdeg', 'h_1', 'h_2hboxdeg', 'h_1', 'hboxdeg', 'h_2']]
|
[-0.15538884630545088, 0.13184482228599173, -0.0755005708407061, 0.02400401629961752, -0.044451153829510585, -0.14202356524383802, -0.05986244158368924, 0.3430167785464007, -0.321245157816371, -0.14682594333302046, 0.07849740457995871, -0.2756586645701929, -0.18429753657804465, 0.19314053170115794, -0.07932754882542631, -0.02129418889946136, 0.016067924046675203, 0.1275256201930222, -0.09179110465701058, -0.28428351299905935, 0.3371974332716133, -0.04059940194243519, 0.15145637893850808, 0.1014297039660274, 0.09306621570979841, -0.014414500521465402, -3.549393808438641e-05, -0.026825598066054345, -0.19229610662039734, 0.07283430547380942, 0.2133237910285195, 0.12630661237091742, 0.23099737459045575, -0.3410212567045552, -0.11767711269012729, 0.21183188119139829, 0.16361498283642176, -0.03738008115677255, -0.016984397342207185, -0.24232038105914339, 0.12640473369478447, -0.15847205784249113, -0.12609731685370207, -0.05845467970691255, 0.11260728658650254, -0.014844393306106452, -0.2967474940461946, 0.02975948637548918, 0.09909024245304163, 0.10481490738705167, -0.011885848442153608, -0.138455185228119, -0.07198894442704155, 0.011211608252182726, -0.026924868766981802, 0.10563988898132669, 0.060266143949626046, -0.0671765064938971, -0.12105209100991488, 0.35178301166590364, -0.1037355353087225, -0.2539026494611238, 0.07860328784769736, -0.18885917877625735, -0.16776789852692822, 0.08688692111125002, 0.076521651941489, 0.1181082892857614, -0.04072106910915282, 0.2501941417471781, -0.12034304813313924, 0.11462896387474458, 0.0964041137946178, -0.04785604756058301, 0.08753552157279165, 0.04081618804751788, 0.09123657104085947, 0.12145658071843723, -0.015580015035620967, -0.04198938369995258, -0.3451883987844235, -0.25790242626728704, -0.21088274556868633, 0.15961476872850697, -0.10276580762979766, -0.13949287532230928, 0.3818011706099525, 0.04604487060416551, 0.20253611646485745, 0.0534006336467249, 0.2045798849917521, 0.11358753848939249, 0.0898908372685985, 0.05260838798369418, 0.12584735918980947, 0.19905323097787675, 0.023533960985645773, -0.1541620821130966, -0.004011998143902079, 0.16992159259933062]
|
1,803.04931
|
A polynomial ideal associated to any $t$-$(v,k,\lambda)$ design
|
We consider ordered pairs $(X,\mathcal{B})$ where $X$ is a finite set of size
$v$ and $\mathcal{B}$ is some collection of $k$-element subsets of $X$ such
that every $t$-element subset of $X$ is contained in exactly $\lambda$ "blocks"
$B\in \mathcal{B}$ for some fixed $\lambda$. We represent each block $B$ by a
zero-one vector $\mathbf{c}_B$ of length $v$ and explore the ideal
$\mathcal{I}(\mathcal{B})$ of polynomials in $v$ variables with complex
coefficients which vanish on the set $\{ \mathbf{c}_B \mid B \in
\mathcal{B}\}$. After setting up the basic theory, we investigate two
parameters related to this ideal: $\gamma_1(\mathcal{B})$ is the smallest
degree of a non-trivial polynomial in the ideal $\mathcal{I}(\mathcal{B})$ and
$\gamma_2(\mathcal{B})$ is the smallest integer $s$ such that
$\mathcal{I}(\mathcal{B})$ is generated by a set of polynomials of degree at
most $s$. We first prove the general bounds $t/2 < \gamma_1(\mathcal{B}) \le
\gamma_2(\mathcal{B}) \le k$. Examining important families of examples, we find
that, for symmetric 2-designs and Steiner systems, we have
$\gamma_2(\mathcal{B}) \le t$. But we expect $\gamma_2(\mathcal{B})$ to be
closer to $k$ for less structured designs and we indicate this by constructing
infinitely many triple systems satisfying $\gamma_2(\mathcal{B})=k$.
|
math.CO
|
we consider ordered pairs xmathcalb where x is a finite set of size v and mathcalb is some collection of kelement subsets of x such that every telement subset of x is contained in exactly lambda blocks bin mathcalb for some fixed lambda we represent each block b by a zeroone vector mathbfc_b of length v and explore the ideal mathcalimathcalb of polynomials in v variables with complex coefficients which vanish on the set mathbfc_b mid b in mathcalb after setting up the basic theory we investigate two parameters related to this ideal gamma_1mathcalb is the smallest degree of a nontrivial polynomial in the ideal mathcalimathcalb and gamma_2mathcalb is the smallest integer s such that mathcalimathcalb is generated by a set of polynomials of degree at most s we first prove the general bounds t2 gamma_1mathcalb le gamma_2mathcalb le k examining important families of examples we find that for symmetric 2designs and steiner systems we have gamma_2mathcalb le t but we expect gamma_2mathcalb to be closer to k for less structured designs and we indicate this by constructing infinitely many triple systems satisfying gamma_2mathcalbk
|
[['we', 'consider', 'ordered', 'pairs', 'xmathcalb', 'where', 'x', 'is', 'a', 'finite', 'set', 'of', 'size', 'v', 'and', 'mathcalb', 'is', 'some', 'collection', 'of', 'kelement', 'subsets', 'of', 'x', 'such', 'that', 'every', 'telement', 'subset', 'of', 'x', 'is', 'contained', 'in', 'exactly', 'lambda', 'blocks', 'bin', 'mathcalb', 'for', 'some', 'fixed', 'lambda', 'we', 'represent', 'each', 'block', 'b', 'by', 'a', 'zeroone', 'vector', 'mathbfc_b', 'of', 'length', 'v', 'and', 'explore', 'the', 'ideal', 'mathcalimathcalb', 'of', 'polynomials', 'in', 'v', 'variables', 'with', 'complex', 'coefficients', 'which', 'vanish', 'on', 'the', 'set', 'mathbfc_b', 'mid', 'b', 'in', 'mathcalb', 'after', 'setting', 'up', 'the', 'basic', 'theory', 'we', 'investigate', 'two', 'parameters', 'related', 'to', 'this', 'ideal', 'gamma_1mathcalb', 'is', 'the', 'smallest', 'degree', 'of', 'a', 'nontrivial', 'polynomial', 'in', 'the', 'ideal', 'mathcalimathcalb', 'and', 'gamma_2mathcalb', 'is', 'the', 'smallest', 'integer', 's', 'such', 'that', 'mathcalimathcalb', 'is', 'generated', 'by', 'a', 'set', 'of', 'polynomials', 'of', 'degree', 'at', 'most', 's', 'we', 'first', 'prove', 'the', 'general', 'bounds', 't2', 'gamma_1mathcalb', 'le', 'gamma_2mathcalb', 'le', 'k', 'examining', 'important', 'families', 'of', 'examples', 'we', 'find', 'that', 'for', 'symmetric', '2designs', 'and', 'steiner', 'systems', 'we', 'have', 'gamma_2mathcalb', 'le', 't', 'but', 'we', 'expect', 'gamma_2mathcalb', 'to', 'be', 'closer', 'to', 'k', 'for', 'less', 'structured', 'designs', 'and', 'we', 'indicate', 'this', 'by', 'constructing', 'infinitely', 'many', 'triple', 'systems', 'satisfying', 'gamma_2mathcalbk']]
|
[-0.1951472476116959, 0.14471633813354348, 0.0033603147486505726, 0.005355030549924259, -0.030619199039133568, -0.1697623180121433, 0.04434539783191893, 0.3505190600063548, -0.2994863006511349, -0.20568402372977004, 0.0690041983307615, -0.3216615932051862, -0.10814792962807267, 0.17768636888267691, -0.04427807935248207, 0.022179372294535392, 0.024274984356432154, 0.09878731999473449, -0.0591777163010101, -0.2848998857519001, 0.31368125906583527, -0.07407178161093476, 0.14229918363915142, -0.0027235712174471863, 0.11217580993488098, 0.010024993932108765, 0.0013559960757574723, 0.04617251409477861, -0.20464376872596454, 0.08290729313820872, 0.27537833515284116, 0.1603601088281721, 0.24800623642207856, -0.3101779832366487, -0.12405546580300818, 0.20911854576558792, 0.11307779590985556, 0.010114481706301, 0.02154166183327767, -0.1938237334515733, 0.19675919065361208, -0.12396123595734117, -0.13018823689755116, -0.05146262391360461, 0.1493058446742719, 0.039526067593514756, -0.3256478916779525, -0.001678852468479279, 0.11155171423120289, 0.07394802678173522, 0.02886614229207515, -0.20096428849794198, -0.031351948444414156, 0.061870488270534485, -0.04292795988249816, 0.06367962893525232, 0.04150187484263156, -0.07479056209981358, -0.0847880869333804, 0.3681875357102582, -0.045870944300884973, -0.18910112094352616, 0.13965298649308652, -0.18824517241725958, -0.17468319638169177, 0.09891924050157921, 0.13752141236925924, 0.15555242130626512, -0.06832723354910339, 0.1845949597890208, -0.1468157889295432, 0.1397606709799027, 0.11397413839195861, 0.05309632213691291, 0.18152731344853035, 0.09489800069382279, 0.08884377028616197, 0.13152234594392273, -0.008693985798309671, 0.004575611021910799, -0.36015033120466344, -0.16294769921168353, -0.17610251241982733, 0.10866835186590945, -0.1163546361204584, -0.13972509745703543, 0.3322511537510423, 0.10948910074329327, 0.2471405623256952, 0.04953405173695724, 0.1745940329267659, 0.0789635099854168, 0.04047670907421589, 0.11959759109424604, 0.08696261121060272, 0.13919251686021913, -0.034425203433499654, -0.15120114478823735, 0.02958475458195079, 0.10963706701327969]
|
1,803.04932
|
Impacts of transport development on residence choice of renter
households: An agent-based evaluation
|
Because of improving accessibility, transport developments play an important
role in residence choice of renter households. In this paper, an agent-based
model is developed to investigate impacts of different transport developments
on residence choice of renter households in Tehran, the capital of Iran. In the
proposed model, renter households are considered as agents who make a
multi-objective decision and compete with each other to rent a preferred
residential zone. Then, three transport development scenarios including
construction a new highway, subway and bus rapid transit (BRT) line are
simulated and resulting changes in residence choice of agents are evaluated.
Results show that transport development scenarios significantly affect
residence choice behavior of different socio-economic categories of renter
households and lead to considerable changes in the residential demand,
composition of residents, mean income level and mean car ownership in their
vicinities.
|
cs.MA cs.AI cs.CY
|
because of improving accessibility transport developments play an important role in residence choice of renter households in this paper an agentbased model is developed to investigate impacts of different transport developments on residence choice of renter households in tehran the capital of iran in the proposed model renter households are considered as agents who make a multiobjective decision and compete with each other to rent a preferred residential zone then three transport development scenarios including construction a new highway subway and bus rapid transit brt line are simulated and resulting changes in residence choice of agents are evaluated results show that transport development scenarios significantly affect residence choice behavior of different socioeconomic categories of renter households and lead to considerable changes in the residential demand composition of residents mean income level and mean car ownership in their vicinities
|
[['because', 'of', 'improving', 'accessibility', 'transport', 'developments', 'play', 'an', 'important', 'role', 'in', 'residence', 'choice', 'of', 'renter', 'households', 'in', 'this', 'paper', 'an', 'agentbased', 'model', 'is', 'developed', 'to', 'investigate', 'impacts', 'of', 'different', 'transport', 'developments', 'on', 'residence', 'choice', 'of', 'renter', 'households', 'in', 'tehran', 'the', 'capital', 'of', 'iran', 'in', 'the', 'proposed', 'model', 'renter', 'households', 'are', 'considered', 'as', 'agents', 'who', 'make', 'a', 'multiobjective', 'decision', 'and', 'compete', 'with', 'each', 'other', 'to', 'rent', 'a', 'preferred', 'residential', 'zone', 'then', 'three', 'transport', 'development', 'scenarios', 'including', 'construction', 'a', 'new', 'highway', 'subway', 'and', 'bus', 'rapid', 'transit', 'brt', 'line', 'are', 'simulated', 'and', 'resulting', 'changes', 'in', 'residence', 'choice', 'of', 'agents', 'are', 'evaluated', 'results', 'show', 'that', 'transport', 'development', 'scenarios', 'significantly', 'affect', 'residence', 'choice', 'behavior', 'of', 'different', 'socioeconomic', 'categories', 'of', 'renter', 'households', 'and', 'lead', 'to', 'considerable', 'changes', 'in', 'the', 'residential', 'demand', 'composition', 'of', 'residents', 'mean', 'income', 'level', 'and', 'mean', 'car', 'ownership', 'in', 'their', 'vicinities']]
|
[-0.1037270359026835, 0.11849643509228464, -0.06101696486787304, 0.061449879642063075, -0.052308710909489055, -0.15473560602539152, 0.08117305851698367, 0.3840551504433371, -0.23083606277983906, -0.33699673555278475, 0.08017506017568994, -0.2778215689071711, -0.13025670749176652, 0.18333305152254584, -0.16310232791179063, -0.01650948592029728, 0.06697231494109619, -0.016358953142248472, 0.07185738719409278, -0.30668868507896346, 0.23876957529210957, 0.07807903568449336, 0.3751066647389013, 0.08328503779088403, 0.05933994321368527, 0.015660480062976694, -0.06680434211275364, 0.016369793627350387, -0.12249747747952916, 0.1370162073672754, 0.3103217782614672, 0.1231899103284746, 0.3550505265812862, -0.458704536024859, -0.2112024331402516, 0.11764585825722611, 0.11006765300745441, -0.0033915018750543613, -0.010016143609654915, -0.261901773073697, -0.008393875642244551, -0.2503246433317553, -0.1321031902646781, -0.004063461927454109, 0.02546776022316645, 0.07989727646834555, -0.24754329749376283, 0.029648437566272376, -0.059860867925622646, 0.12771173833154034, -0.07923212270184919, -0.16731553388071124, -0.07722689123635275, 0.2352524982407635, 0.09413884034839229, -0.08346009381900818, 0.25343280573092075, -0.15039193403630424, -0.14286854961023165, 0.39291238178755494, -0.006950940641547567, -0.14944573346883114, 0.17608485389939524, -0.11181807502124803, -0.14513367372295022, 0.06432728007084866, 0.26922503714804014, 0.03466017820629413, -0.18737847459893944, -0.005395178693646997, -0.023718957018201658, 0.09573595854453743, 0.05749365280591545, 0.0009838318809920895, 0.1819868912461443, 0.2235499611681165, 0.11835238353038828, 0.04665998405096985, -0.0586477931558519, -0.1962966692154768, -0.20883443576378236, -0.16076391279563287, -0.08321449686300711, 0.008629321546059276, -0.08358433163010741, -0.1423846928105838, 0.4226633113997894, 0.1874944231375053, 0.13282070474942093, 0.03935799178113972, 0.23138996627876887, 0.04591249043806928, 0.030180830540526928, 0.08999946143856083, 0.14463354778759505, -0.019065301048744848, 0.17766499180900122, -0.22015192249513138, 0.18318182310642864, -0.024230835218907527]
|
1,803.04933
|
Approximate Quantum Fourier Transform with $O(n \log(n))$ T gates
|
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a
quantum computer facilitates the advantages offered by a variety of fundamental
quantum algorithms, such as those for integer factoring, computing discrete
logarithm over Abelian groups, solving systems of linear equations, and phase
estimation, to name a few. The standard fault-tolerant implementation of an
$n$-qubit unitary QFT approximates the desired transformation by removing
small-angle controlled rotations and synthesizing the remaining ones into
Clifford+T gates, incurring the T-count complexity of $O(n \log^2(n))$. In this
paper, we show how to obtain approximate QFT with the T-count of $O(n
\log(n))$. Our approach relies on quantum circuits with measurements and
feedforward, and on reusing a special quantum state that induces the phase
gradient transformation. We report asymptotic analysis as well as concrete
circuits, demonstrating significant advantages in both theory and practice.
|
quant-ph cs.ET
|
the ability to implement the quantum fourier transform qft efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms such as those for integer factoring computing discrete logarithm over abelian groups solving systems of linear equations and phase estimation to name a few the standard faulttolerant implementation of an nqubit unitary qft approximates the desired transformation by removing smallangle controlled rotations and synthesizing the remaining ones into cliffordt gates incurring the tcount complexity of on log2n in this paper we show how to obtain approximate qft with the tcount of on logn our approach relies on quantum circuits with measurements and feedforward and on reusing a special quantum state that induces the phase gradient transformation we report asymptotic analysis as well as concrete circuits demonstrating significant advantages in both theory and practice
|
[['the', 'ability', 'to', 'implement', 'the', 'quantum', 'fourier', 'transform', 'qft', 'efficiently', 'on', 'a', 'quantum', 'computer', 'facilitates', 'the', 'advantages', 'offered', 'by', 'a', 'variety', 'of', 'fundamental', 'quantum', 'algorithms', 'such', 'as', 'those', 'for', 'integer', 'factoring', 'computing', 'discrete', 'logarithm', 'over', 'abelian', 'groups', 'solving', 'systems', 'of', 'linear', 'equations', 'and', 'phase', 'estimation', 'to', 'name', 'a', 'few', 'the', 'standard', 'faulttolerant', 'implementation', 'of', 'an', 'nqubit', 'unitary', 'qft', 'approximates', 'the', 'desired', 'transformation', 'by', 'removing', 'smallangle', 'controlled', 'rotations', 'and', 'synthesizing', 'the', 'remaining', 'ones', 'into', 'cliffordt', 'gates', 'incurring', 'the', 'tcount', 'complexity', 'of', 'on', 'log2n', 'in', 'this', 'paper', 'we', 'show', 'how', 'to', 'obtain', 'approximate', 'qft', 'with', 'the', 'tcount', 'of', 'on', 'logn', 'our', 'approach', 'relies', 'on', 'quantum', 'circuits', 'with', 'measurements', 'and', 'feedforward', 'and', 'on', 'reusing', 'a', 'special', 'quantum', 'state', 'that', 'induces', 'the', 'phase', 'gradient', 'transformation', 'we', 'report', 'asymptotic', 'analysis', 'as', 'well', 'as', 'concrete', 'circuits', 'demonstrating', 'significant', 'advantages', 'in', 'both', 'theory', 'and', 'practice']]
|
[-0.11464189725550081, 0.08681194670255839, -0.07720216059301427, 0.009035057560338275, -0.05688263563628214, -0.18097914947851468, 0.09114850919349524, 0.3705593607577401, -0.28135722866146895, -0.3163369518765451, 0.09364027534847728, -0.22987771645842958, -0.18872346032741547, 0.271834931343092, -0.08763489435912798, 0.13855326212807625, 0.04323267061060861, 0.003011154128994415, -0.14543863134905763, -0.2842364926498545, 0.2294416438207786, 0.018712827675145767, 0.29009780216206243, -0.02135990190225235, 0.13049621484748533, 0.04818046889788778, 0.0006170273164584153, -0.028364602948768414, -0.03555498131327508, 0.11953453840080487, 0.28298007671896747, 0.14225635280414228, 0.25658580570387235, -0.4725299736997787, -0.17268127700199198, 0.07319075176897256, 0.1369484796229264, 0.15530173292221583, -0.07571454918555294, -0.30746421572225896, 0.06294301620927518, -0.14268719060076535, -0.05477935879194326, -0.1682870721468108, -0.014363518355927174, -0.04672762155667811, -0.22013366418937896, 0.02004353952461447, 0.07543926680227742, 0.0576878897537835, 0.02246358309555259, -0.09952229213682796, 0.07505610367229236, 0.10213038438772512, -0.06913108705455248, 0.028052577057151473, 0.15664107976413832, -0.12494275444760865, -0.19292534990371138, 0.38306330060721305, -0.028234100364067632, -0.20247992712234997, 0.13067379798335227, -0.06428157070827117, -0.13619544163204567, 0.06118705228014944, 0.15308711455419552, 0.10609877575188875, -0.07913211409164511, 0.15712630808264003, -0.00572652288078182, 0.19088846692065473, 0.05465500107021543, 0.08153690563589064, 0.11788004676160146, 0.12645242072344906, 0.07405959779693597, 0.1794629474237993, -0.008971768531752616, -0.17309658864742497, -0.32705627977375645, -0.19778024141028847, -0.21288801073029207, 0.08406987098683401, -0.10314931139378197, -0.19332864820920065, 0.40488963022126234, 0.12868467688752824, 0.14299186712900258, 0.10947032795672346, 0.3524228461640145, 0.1305111915259487, 0.08076932485066894, 0.08700757363197002, 0.15178266201552976, 0.17116848224490558, 0.025078047848934228, -0.24961588360315215, 0.032661272752760116, 0.09971470330682401]
|
1,803.04934
|
An agent-based evaluation of impacts of transport developments on the
modal shift in Tehran, Iran
|
Changes in travel modes used by people, particularly reduction of the private
car use, is an important determinant of effectiveness of transportation plans.
Because of dependencies between the choices of residential location and travel
mode, integrated modelling of these choices has been proposed by some
researchers. In this paper, an agent-based microsimulation model has been
developed to evaluate impacts of different transport development plans on
choices of residential location and commuting mode of tenant households in
Tehran, the capital of Iran. In the proposed model, households are considered
as agents who select their desired residential location using a constrained
NSGA-II algorithm and in a competition with other households. In addition, they
choose their commuting mode by applying a multi-criteria decision making
method. Afterwards, effects of development of a new highway, subway and bus
rapid transit (BRT) line on their residential location and commuting mode
choices are evaluated. Results show that despite the residential self-selection
effects, these plans result in considerable changes in the commuting mode of
different socioeconomic categories of households. Development of the new subway
line shows promising results by reducing the private car use among the all
socio-economic categories of households. But the new highway development
unsatisfactorily results in increase in the private car use. In addition,
development of the new BRT line does not show significant effects on the
commuting mode change, particularly on decrease in the private car use.
|
cs.MA cs.AI cs.CY
|
changes in travel modes used by people particularly reduction of the private car use is an important determinant of effectiveness of transportation plans because of dependencies between the choices of residential location and travel mode integrated modelling of these choices has been proposed by some researchers in this paper an agentbased microsimulation model has been developed to evaluate impacts of different transport development plans on choices of residential location and commuting mode of tenant households in tehran the capital of iran in the proposed model households are considered as agents who select their desired residential location using a constrained nsgaii algorithm and in a competition with other households in addition they choose their commuting mode by applying a multicriteria decision making method afterwards effects of development of a new highway subway and bus rapid transit brt line on their residential location and commuting mode choices are evaluated results show that despite the residential selfselection effects these plans result in considerable changes in the commuting mode of different socioeconomic categories of households development of the new subway line shows promising results by reducing the private car use among the all socioeconomic categories of households but the new highway development unsatisfactorily results in increase in the private car use in addition development of the new brt line does not show significant effects on the commuting mode change particularly on decrease in the private car use
|
[['changes', 'in', 'travel', 'modes', 'used', 'by', 'people', 'particularly', 'reduction', 'of', 'the', 'private', 'car', 'use', 'is', 'an', 'important', 'determinant', 'of', 'effectiveness', 'of', 'transportation', 'plans', 'because', 'of', 'dependencies', 'between', 'the', 'choices', 'of', 'residential', 'location', 'and', 'travel', 'mode', 'integrated', 'modelling', 'of', 'these', 'choices', 'has', 'been', 'proposed', 'by', 'some', 'researchers', 'in', 'this', 'paper', 'an', 'agentbased', 'microsimulation', 'model', 'has', 'been', 'developed', 'to', 'evaluate', 'impacts', 'of', 'different', 'transport', 'development', 'plans', 'on', 'choices', 'of', 'residential', 'location', 'and', 'commuting', 'mode', 'of', 'tenant', 'households', 'in', 'tehran', 'the', 'capital', 'of', 'iran', 'in', 'the', 'proposed', 'model', 'households', 'are', 'considered', 'as', 'agents', 'who', 'select', 'their', 'desired', 'residential', 'location', 'using', 'a', 'constrained', 'nsgaii', 'algorithm', 'and', 'in', 'a', 'competition', 'with', 'other', 'households', 'in', 'addition', 'they', 'choose', 'their', 'commuting', 'mode', 'by', 'applying', 'a', 'multicriteria', 'decision', 'making', 'method', 'afterwards', 'effects', 'of', 'development', 'of', 'a', 'new', 'highway', 'subway', 'and', 'bus', 'rapid', 'transit', 'brt', 'line', 'on', 'their', 'residential', 'location', 'and', 'commuting', 'mode', 'choices', 'are', 'evaluated', 'results', 'show', 'that', 'despite', 'the', 'residential', 'selfselection', 'effects', 'these', 'plans', 'result', 'in', 'considerable', 'changes', 'in', 'the', 'commuting', 'mode', 'of', 'different', 'socioeconomic', 'categories', 'of', 'households', 'development', 'of', 'the', 'new', 'subway', 'line', 'shows', 'promising', 'results', 'by', 'reducing', 'the', 'private', 'car', 'use', 'among', 'the', 'all', 'socioeconomic', 'categories', 'of', 'households', 'but', 'the', 'new', 'highway', 'development', 'unsatisfactorily', 'results', 'in', 'increase', 'in', 'the', 'private', 'car', 'use', 'in', 'addition', 'development', 'of', 'the', 'new', 'brt', 'line', 'does', 'not', 'show', 'significant', 'effects', 'on', 'the', 'commuting', 'mode', 'change', 'particularly', 'on', 'decrease', 'in', 'the', 'private', 'car', 'use']]
|
[-0.09199141029991977, 0.0871294357409439, -0.042087406627514076, 0.0431645471917949, -0.08926987932203538, -0.16482652589486904, 0.10158977714415177, 0.3784444583459985, -0.2162142184606949, -0.32225656574951733, 0.10941795977192248, -0.29604713031582436, -0.13792937153015014, 0.21009965076075282, -0.16079498763304093, 0.034384662093586676, 0.08189879383795891, 0.002458674792208321, 0.03399996844404117, -0.2774135107094574, 0.28700787468129857, 0.05130883692683804, 0.3693732603217271, 0.055606224606125396, 0.07283622198018681, 0.020142069235011884, -0.08692227911402456, -0.00032678289866562566, -0.0718560360509529, 0.13791232329141623, 0.3047584358696694, 0.17694757886174986, 0.3416731282289224, -0.44299323605813185, -0.17544811553933334, 0.1118683597870379, 0.11914490461709226, 0.018660854557209325, -0.01754436343298753, -0.2970655804915681, 0.027980164086829386, -0.2375293494473999, -0.12392941041541777, -0.04260685086618038, 0.029070259691435892, 0.04898530889558306, -0.2616523515868756, 0.0012924967737380783, -0.03324938344353482, 0.1145150242915453, -0.05413221051145041, -0.13100336590989656, -0.0671556195196228, 0.214868803498587, 0.08750936318820446, -0.05912293457823842, 0.19333780878283435, -0.12849918182695344, -0.18024291910976573, 0.3693179482586138, -0.015207023684598921, -0.16331531777638192, 0.1622940620113676, -0.09378407803531975, -0.13363865451575477, 0.06848324561849349, 0.255532195218519, 0.06883132746722949, -0.17621307426168237, 0.0040846384660532704, -0.03978431811596191, 0.10497855884722503, 0.06290492862103259, -0.011401844908415375, 0.1765564999707011, 0.19311635229584678, 0.11155395982027566, 0.08644100603504634, -0.07505385621846554, -0.12989775773713388, -0.22701040528866545, -0.15393583932636673, -0.10727002243426441, -0.021361040408548682, -0.1007341437434349, -0.11279044799954338, 0.4302355480887987, 0.1979660938090201, 0.14289925518133897, 0.019814615070923778, 0.28455611368613276, 0.0553949436681473, 0.0956410829031784, 0.09645943859264318, 0.18654699854279444, 0.004638767201661296, 0.165120799955812, -0.23493095551809304, 0.13331842106515182, -0.021123870484762757]
|
1,803.04935
|
Design and Analysis of Passband Transmitted Reference Pulse Cluster UWB
Systems in the Presence of Phase Noise
|
Transmitted reference pulse cluster (TRPC) signaling was recently proposed
and developed for noncoherent ultra-wideband (UWB) communications. In this
paper, a practical passband TRPC-UWB system is designed and analyzed to deal
with the carrier frequency offset, phase offset and phase noise inherent in
voltage-controlled oscillators (VCO) of the transmitter and the receiver. Based
on a general model of noisy VCO and employing some reasonable assumptions, an
equivalent linear time-invariant (LTI) analytical model is obtained to
facilitate the bit error rate (BER) analysis. Our analysis shows that the
constant carrier frequency offset and the phase offset can be removed by
employing the passband transmitter and the noncoherent receiver. Furthermore, a
semi-analytical BER expression is derived to show the impact of phase noise on
the system error performance. Simulation results validate the semi-analytical
expressions and both of them indicate that TRPC is more robust to the effect of
phase noise than conventional transmitted reference (TR) and coherent UWB Rake
receivers.
|
eess.SP
|
transmitted reference pulse cluster trpc signaling was recently proposed and developed for noncoherent ultrawideband uwb communications in this paper a practical passband trpcuwb system is designed and analyzed to deal with the carrier frequency offset phase offset and phase noise inherent in voltagecontrolled oscillators vco of the transmitter and the receiver based on a general model of noisy vco and employing some reasonable assumptions an equivalent linear timeinvariant lti analytical model is obtained to facilitate the bit error rate ber analysis our analysis shows that the constant carrier frequency offset and the phase offset can be removed by employing the passband transmitter and the noncoherent receiver furthermore a semianalytical ber expression is derived to show the impact of phase noise on the system error performance simulation results validate the semianalytical expressions and both of them indicate that trpc is more robust to the effect of phase noise than conventional transmitted reference tr and coherent uwb rake receivers
|
[['transmitted', 'reference', 'pulse', 'cluster', 'trpc', 'signaling', 'was', 'recently', 'proposed', 'and', 'developed', 'for', 'noncoherent', 'ultrawideband', 'uwb', 'communications', 'in', 'this', 'paper', 'a', 'practical', 'passband', 'trpcuwb', 'system', 'is', 'designed', 'and', 'analyzed', 'to', 'deal', 'with', 'the', 'carrier', 'frequency', 'offset', 'phase', 'offset', 'and', 'phase', 'noise', 'inherent', 'in', 'voltagecontrolled', 'oscillators', 'vco', 'of', 'the', 'transmitter', 'and', 'the', 'receiver', 'based', 'on', 'a', 'general', 'model', 'of', 'noisy', 'vco', 'and', 'employing', 'some', 'reasonable', 'assumptions', 'an', 'equivalent', 'linear', 'timeinvariant', 'lti', 'analytical', 'model', 'is', 'obtained', 'to', 'facilitate', 'the', 'bit', 'error', 'rate', 'ber', 'analysis', 'our', 'analysis', 'shows', 'that', 'the', 'constant', 'carrier', 'frequency', 'offset', 'and', 'the', 'phase', 'offset', 'can', 'be', 'removed', 'by', 'employing', 'the', 'passband', 'transmitter', 'and', 'the', 'noncoherent', 'receiver', 'furthermore', 'a', 'semianalytical', 'ber', 'expression', 'is', 'derived', 'to', 'show', 'the', 'impact', 'of', 'phase', 'noise', 'on', 'the', 'system', 'error', 'performance', 'simulation', 'results', 'validate', 'the', 'semianalytical', 'expressions', 'and', 'both', 'of', 'them', 'indicate', 'that', 'trpc', 'is', 'more', 'robust', 'to', 'the', 'effect', 'of', 'phase', 'noise', 'than', 'conventional', 'transmitted', 'reference', 'tr', 'and', 'coherent', 'uwb', 'rake', 'receivers']]
|
[-0.20940272223610715, 0.025080679780243788, -0.04983875367814188, 0.022598508403600923, -0.05041758402304095, -0.24699378201358352, 0.10073261919867389, 0.430620942478347, -0.2181265315717193, -0.25421659315337136, 0.0917485337096391, -0.21213909322366262, -0.2039869676172069, 0.22058540951330097, -0.13316534233878657, 0.06957650620039481, 0.03733858347063659, 0.016829479998867414, -0.07239717320734813, -0.19359573371898217, 0.21993853963294607, 0.1485330554876168, 0.3572794380034231, -0.04839738492059053, 0.13510836715881186, -0.02024003793188863, -0.03468967623160381, -0.054960108041810764, -0.1037379065073417, 0.026643802014410876, 0.2938222774529865, 0.09336560418247987, 0.20699202946749082, -0.3829934840108369, -0.26470995987439233, 0.03818470550475606, 0.13245799105223655, 0.13672950647913726, -0.07901623887560481, -0.35527613457695695, 0.09763747422250023, -0.20101543839436595, -0.026039508955885367, 0.025131508061413173, -0.05029178623726983, 0.059821849025246114, -0.33053445583505997, 0.08899398746746029, 0.022313422581275843, 0.06244348831012086, -0.06302818701940642, -0.13147541077638483, 0.014390678748571474, 0.13252750874473268, -0.03625911928173511, 0.023529783665398315, 0.1321190636854168, -0.022097232186526154, -0.06119466594058522, 0.3299223883878321, -0.05407059954519748, -0.19696988227071277, 0.11538281550951254, -0.1131802480934769, -0.01577697646697378, 0.204800972827728, 0.188985320800251, 0.007642447539148437, -0.17917072778540977, 0.009348889934062174, 0.07724060444606196, 0.2930257213035017, 0.08212529285959187, 0.12288083846326384, 0.12101101106667453, 0.14138709970862623, 0.06246847883912373, 0.15137525772821206, -0.17072634522637772, -0.10319005888938655, -0.22587622546110372, -0.07643289081040461, -0.2192566864656664, -0.02866370741360981, -0.08312255028362021, -0.08073559940857872, 0.3873686437868768, 0.18230509046453294, 0.08053576140100979, 0.09831270170664996, 0.42778745813259655, 0.17407687919905446, -0.016395868865512073, 0.07324782297442294, 0.25663697546304226, 0.1638102327298468, 0.09340481623817401, -0.26093988064498563, 0.05157223764575638, -0.033092296458365526]
|
1,803.04936
|
Momentum-space indirect interlayer excitons in transition metal
dichalcogenide van der Waals heterostructures
|
Monolayers of transition metal dichalcogenides (TMDCs) feature exceptional
optical properties that are dominated by excitons, tightly bound electron-hole
pairs. Forming van der Waals heterostructures by deterministically stacking
individual monolayers allows to tune various properties via choice of materials
and relative orientation of the layers. In these structures, a new type of
exciton emerges, where electron and hole are spatially separated. These
interlayer excitons allow exploration of many-body quantum phenomena and are
ideally suited for valleytronic applications. Mostly, a basic model of fully
spatially-separated electron and hole stemming from the $K$ valleys of the
monolayer Brillouin zones is applied to describe such excitons. Here, we
combine photoluminescence spectroscopy and first principle calculations to
expand the concept of interlayer excitons. We identify a partially
charge-separated electron-hole pair in MoS$_2$/WSe$_2$ heterostructures
residing at the $\Gamma$ and $K$ valleys. We control the emission energy of
this new type of momentum-space indirect, yet strongly-bound exciton by
variation of the relative orientation of the layers. These findings represent a
crucial step towards the understanding and control of excitonic effects in TMDC
heterostructures and devices.
|
cond-mat.mes-hall
|
monolayers of transition metal dichalcogenides tmdcs feature exceptional optical properties that are dominated by excitons tightly bound electronhole pairs forming van der waals heterostructures by deterministically stacking individual monolayers allows to tune various properties via choice of materials and relative orientation of the layers in these structures a new type of exciton emerges where electron and hole are spatially separated these interlayer excitons allow exploration of manybody quantum phenomena and are ideally suited for valleytronic applications mostly a basic model of fully spatiallyseparated electron and hole stemming from the k valleys of the monolayer brillouin zones is applied to describe such excitons here we combine photoluminescence spectroscopy and first principle calculations to expand the concept of interlayer excitons we identify a partially chargeseparated electronhole pair in mos_2wse_2 heterostructures residing at the gamma and k valleys we control the emission energy of this new type of momentumspace indirect yet stronglybound exciton by variation of the relative orientation of the layers these findings represent a crucial step towards the understanding and control of excitonic effects in tmdc heterostructures and devices
|
[['monolayers', 'of', 'transition', 'metal', 'dichalcogenides', 'tmdcs', 'feature', 'exceptional', 'optical', 'properties', 'that', 'are', 'dominated', 'by', 'excitons', 'tightly', 'bound', 'electronhole', 'pairs', 'forming', 'van', 'der', 'waals', 'heterostructures', 'by', 'deterministically', 'stacking', 'individual', 'monolayers', 'allows', 'to', 'tune', 'various', 'properties', 'via', 'choice', 'of', 'materials', 'and', 'relative', 'orientation', 'of', 'the', 'layers', 'in', 'these', 'structures', 'a', 'new', 'type', 'of', 'exciton', 'emerges', 'where', 'electron', 'and', 'hole', 'are', 'spatially', 'separated', 'these', 'interlayer', 'excitons', 'allow', 'exploration', 'of', 'manybody', 'quantum', 'phenomena', 'and', 'are', 'ideally', 'suited', 'for', 'valleytronic', 'applications', 'mostly', 'a', 'basic', 'model', 'of', 'fully', 'spatiallyseparated', 'electron', 'and', 'hole', 'stemming', 'from', 'the', 'k', 'valleys', 'of', 'the', 'monolayer', 'brillouin', 'zones', 'is', 'applied', 'to', 'describe', 'such', 'excitons', 'here', 'we', 'combine', 'photoluminescence', 'spectroscopy', 'and', 'first', 'principle', 'calculations', 'to', 'expand', 'the', 'concept', 'of', 'interlayer', 'excitons', 'we', 'identify', 'a', 'partially', 'chargeseparated', 'electronhole', 'pair', 'in', 'mos_2wse_2', 'heterostructures', 'residing', 'at', 'the', 'gamma', 'and', 'k', 'valleys', 'we', 'control', 'the', 'emission', 'energy', 'of', 'this', 'new', 'type', 'of', 'momentumspace', 'indirect', 'yet', 'stronglybound', 'exciton', 'by', 'variation', 'of', 'the', 'relative', 'orientation', 'of', 'the', 'layers', 'these', 'findings', 'represent', 'a', 'crucial', 'step', 'towards', 'the', 'understanding', 'and', 'control', 'of', 'excitonic', 'effects', 'in', 'tmdc', 'heterostructures', 'and', 'devices']]
|
[-0.14021424575855307, 0.19231836734800023, -0.022224998561367185, 0.030134766124544687, -0.02586594435224163, -0.1851906647926636, 0.10572455647098047, 0.4406183568938646, -0.28219715643967136, -0.2884750265282778, -0.08746132036877713, -0.3070492628541431, -0.14797406348993666, 0.1913262601494475, 0.08171817774428347, 0.013496349106563695, -0.01745150492917694, -0.17936804385337812, -0.041484815203270804, -0.1761029533246595, 0.32817797478173305, -0.0048095045298641404, 0.3032305183182104, 0.12263433937129847, 0.03372631740777261, 0.017087490197135072, 0.08927101364851081, -0.02515041938030653, -0.19423935600652736, 0.1602236307278443, 0.30600605158428296, -0.11550455122893111, 0.26242764692837267, -0.4551103330123123, -0.18999476219119316, 3.7857968349721325e-05, 0.18267681709558733, 0.17934453809941894, -0.09293279581535817, -0.31057858257292864, 0.03503696185280307, -0.12313480804454577, -0.07570716379898053, -0.08307390171953404, -0.020518847079319735, 0.0437151882774589, -0.2055435516806764, 0.09689242837772694, 0.045195184810642344, 0.006912342747148542, -0.09303615599214374, -0.08982671180634048, -0.08937021534630946, 0.09348121626051457, -0.022334904197388945, -0.020096125638405425, 0.2258359115869016, -0.1332589070210652, -0.14476612068482497, 0.3952892356044665, -0.02467551737045346, -0.06733700103032288, 0.2076439342547857, -0.14451191662496815, -0.03967296291833346, 0.1460210548562071, 0.1445766434235645, 0.1514554475172517, -0.1326111824973748, 0.06647423475724383, 0.01071305203367956, 0.1563736922002994, 0.07192414738545247, 0.17766301255029615, 0.31564714513415615, 0.16147682874390248, 0.0500322891284157, 0.09847550192230455, -0.1090794138537113, -0.044314079426145285, -0.19870652919216605, -0.2234474201990799, -0.2316797125804646, 0.088005914344986, -0.03856985668293358, -0.2031328091057792, 0.4310584845324832, 0.09413870244046275, 0.19591807937406505, -0.0842300479684883, 0.22347265628579838, 0.07781580536040279, 0.08382561373827832, -0.03246222344080635, 0.28265889300807806, 0.17940727867227926, 0.06710151066804786, -0.2348861439255579, 0.046721338304910764, 0.03254929199171242]
|
1,803.04937
|
An improved lattice Boltzmann D3Q19 method based on an alternative
equilibrium discretization
|
Lattice Boltzmann simulations of three-dimensional, isothermal hydrodynamics
often use either the D3Q19 or the D3Q27 velocity sets. While both models
correctly approximate Navier-Stokes in the continuum limit, the D3Q19 model is
computationally less expensive but has some known deficiencies regarding
Galilean invariance, especially for high Reynolds number flows. In this work we
present a novel methodology to construct lattice Boltzmann equilibria for
hydrodynamics directly from the continuous Maxwellian equilibrium. While our
new approach reproduces the well known LBM equilibrium for D2Q9 and D3Q27
lattice models, it yields a different equilibrium formulation for the D3Q19
stencil. This newly proposed formulation is shown to be more accurate than the
widely used second order equilibrium, while having the same computation costs.
We present a steady state Chapman-Enskog analysis of the standard and the
improved D3Q19 model and conduct numerical experiments that demonstrate the
superior accuracy of our newly developed D3Q19 equilibrium.
|
physics.comp-ph physics.app-ph
|
lattice boltzmann simulations of threedimensional isothermal hydrodynamics often use either the d3q19 or the d3q27 velocity sets while both models correctly approximate navierstokes in the continuum limit the d3q19 model is computationally less expensive but has some known deficiencies regarding galilean invariance especially for high reynolds number flows in this work we present a novel methodology to construct lattice boltzmann equilibria for hydrodynamics directly from the continuous maxwellian equilibrium while our new approach reproduces the well known lbm equilibrium for d2q9 and d3q27 lattice models it yields a different equilibrium formulation for the d3q19 stencil this newly proposed formulation is shown to be more accurate than the widely used second order equilibrium while having the same computation costs we present a steady state chapmanenskog analysis of the standard and the improved d3q19 model and conduct numerical experiments that demonstrate the superior accuracy of our newly developed d3q19 equilibrium
|
[['lattice', 'boltzmann', 'simulations', 'of', 'threedimensional', 'isothermal', 'hydrodynamics', 'often', 'use', 'either', 'the', 'd3q19', 'or', 'the', 'd3q27', 'velocity', 'sets', 'while', 'both', 'models', 'correctly', 'approximate', 'navierstokes', 'in', 'the', 'continuum', 'limit', 'the', 'd3q19', 'model', 'is', 'computationally', 'less', 'expensive', 'but', 'has', 'some', 'known', 'deficiencies', 'regarding', 'galilean', 'invariance', 'especially', 'for', 'high', 'reynolds', 'number', 'flows', 'in', 'this', 'work', 'we', 'present', 'a', 'novel', 'methodology', 'to', 'construct', 'lattice', 'boltzmann', 'equilibria', 'for', 'hydrodynamics', 'directly', 'from', 'the', 'continuous', 'maxwellian', 'equilibrium', 'while', 'our', 'new', 'approach', 'reproduces', 'the', 'well', 'known', 'lbm', 'equilibrium', 'for', 'd2q9', 'and', 'd3q27', 'lattice', 'models', 'it', 'yields', 'a', 'different', 'equilibrium', 'formulation', 'for', 'the', 'd3q19', 'stencil', 'this', 'newly', 'proposed', 'formulation', 'is', 'shown', 'to', 'be', 'more', 'accurate', 'than', 'the', 'widely', 'used', 'second', 'order', 'equilibrium', 'while', 'having', 'the', 'same', 'computation', 'costs', 'we', 'present', 'a', 'steady', 'state', 'chapmanenskog', 'analysis', 'of', 'the', 'standard', 'and', 'the', 'improved', 'd3q19', 'model', 'and', 'conduct', 'numerical', 'experiments', 'that', 'demonstrate', 'the', 'superior', 'accuracy', 'of', 'our', 'newly', 'developed', 'd3q19', 'equilibrium']]
|
[-0.03779976176274185, 0.036208564318036915, -0.12289651745389141, 0.07535204078335114, -0.04289900719320301, -0.1604523921190333, 0.02903372629205822, 0.33888947638380973, -0.2469183707332893, -0.2856660400681682, 0.10540061251486878, -0.2414758494627234, -0.09353382689909809, 0.16245548537856824, -0.011654953465826897, 0.15787854306777385, 0.11376763285276152, -0.02909880134000166, -0.07442133787018876, -0.2416437515545309, 0.2416310210293788, 0.09476253172898716, 0.32385695737635567, 0.005123598754368219, 0.10822914128909139, -0.04382463299663033, -0.0062180250156293245, 0.06407776312285883, -0.15182171881733175, 0.09420243712658113, 0.17879019287082318, 0.05103423139961386, 0.25516916224984704, -0.44706686226197995, -0.283944120404084, 0.05491749739519799, 0.1418798758799361, 0.16632457374676912, -0.015367313991855308, -0.21311379333555297, 0.07225126577415378, -0.19889993305519424, -0.14769856230614586, -0.18338857557014185, -0.03072756516583566, 0.018020150696503225, -0.27686541531599956, 0.133228203157479, 0.03461757926600734, 0.0736667772729856, -0.08238518915636264, -0.1581628780207924, -0.03854426074414388, 0.06400052363263771, 0.006797691490941656, 0.029580951526735885, 0.07920220656622504, -0.1270188343840198, -0.09779234389094887, 0.46418812986765356, -0.056655557833732315, -0.24343135054978365, 0.23946579840864884, -0.10243840005903228, -0.11228566539687784, 0.144353185007915, 0.13804907475384204, 0.15275368314374843, -0.16568446826391123, 0.048062867263561695, -0.08194676059222705, 0.1619477589532884, 0.008467463038647798, -0.06742664846604236, 0.14911371952778585, 0.17415478018213165, 0.03284505036080609, 0.1351181248421592, -0.061601469598433656, -0.19338669808663278, -0.2615668333727061, -0.12300414980042684, -0.20116012904956634, 0.02061601768867616, -0.09008468915930574, -0.17989898254411338, 0.3318420948485869, 0.22571752975204004, 0.11845435538506953, 0.11830417035978187, 0.3429030882748398, 0.1164491012129253, 0.025071623942789598, 0.1548286579247262, 0.23603210752578987, 0.10472182205223755, 0.13170926067569116, -0.25169914616039807, 0.03732837382955728, 0.12735056319286595]
|
1,803.04938
|
Parity and the modular bootstrap
|
We consider unitary, modular invariant, two-dimensional CFTs which are
invariant under the parity transformation $P$. Combining $P$ with modular
inversion $S$ leads to a continuous family of fixed points of the $SP$
transformation. A particular subset of this locus of fixed points exists along
the line of positive left- and right-moving temperatures satisfying $\beta_L
\beta_R = 4\pi^2$. We use this fixed locus to prove a conjecture of Hartman,
Keller, and Stoica that the free energy of a large-$c$ CFT$_2$ with a suitably
sparse low-lying spectrum matches that of AdS$_3$ gravity at all temperatures
and all angular potentials. We also use the fixed locus to generalize the
modular bootstrap equations, obtaining novel constraints on the operator
spectrum and providing a new proof of the statement that the twist gap is
smaller than $(c-1)/12$ when $c>1$. At large $c$ we show that the operator
dimension of the first excited primary lies in a region in the
$(h,\overline{h})$-plane that is significantly smaller than
$h+\overline{h}<c/6$. Our results for the free energy and constraints on the
operator spectrum extend to theories without parity symmetry through the
construction of an auxiliary parity-invariant partition function.
|
hep-th
|
we consider unitary modular invariant twodimensional cfts which are invariant under the parity transformation p combining p with modular inversion s leads to a continuous family of fixed points of the sp transformation a particular subset of this locus of fixed points exists along the line of positive left and rightmoving temperatures satisfying beta_l beta_r 4pi2 we use this fixed locus to prove a conjecture of hartman keller and stoica that the free energy of a largec cft_2 with a suitably sparse lowlying spectrum matches that of ads_3 gravity at all temperatures and all angular potentials we also use the fixed locus to generalize the modular bootstrap equations obtaining novel constraints on the operator spectrum and providing a new proof of the statement that the twist gap is smaller than c112 when c1 at large c we show that the operator dimension of the first excited primary lies in a region in the hoverlinehplane that is significantly smaller than hoverlinehc6 our results for the free energy and constraints on the operator spectrum extend to theories without parity symmetry through the construction of an auxiliary parityinvariant partition function
|
[['we', 'consider', 'unitary', 'modular', 'invariant', 'twodimensional', 'cfts', 'which', 'are', 'invariant', 'under', 'the', 'parity', 'transformation', 'p', 'combining', 'p', 'with', 'modular', 'inversion', 's', 'leads', 'to', 'a', 'continuous', 'family', 'of', 'fixed', 'points', 'of', 'the', 'sp', 'transformation', 'a', 'particular', 'subset', 'of', 'this', 'locus', 'of', 'fixed', 'points', 'exists', 'along', 'the', 'line', 'of', 'positive', 'left', 'and', 'rightmoving', 'temperatures', 'satisfying', 'beta_l', 'beta_r', '4pi2', 'we', 'use', 'this', 'fixed', 'locus', 'to', 'prove', 'a', 'conjecture', 'of', 'hartman', 'keller', 'and', 'stoica', 'that', 'the', 'free', 'energy', 'of', 'a', 'largec', 'cft_2', 'with', 'a', 'suitably', 'sparse', 'lowlying', 'spectrum', 'matches', 'that', 'of', 'ads_3', 'gravity', 'at', 'all', 'temperatures', 'and', 'all', 'angular', 'potentials', 'we', 'also', 'use', 'the', 'fixed', 'locus', 'to', 'generalize', 'the', 'modular', 'bootstrap', 'equations', 'obtaining', 'novel', 'constraints', 'on', 'the', 'operator', 'spectrum', 'and', 'providing', 'a', 'new', 'proof', 'of', 'the', 'statement', 'that', 'the', 'twist', 'gap', 'is', 'smaller', 'than', 'c112', 'when', 'c1', 'at', 'large', 'c', 'we', 'show', 'that', 'the', 'operator', 'dimension', 'of', 'the', 'first', 'excited', 'primary', 'lies', 'in', 'a', 'region', 'in', 'the', 'hoverlinehplane', 'that', 'is', 'significantly', 'smaller', 'than', 'hoverlinehc6', 'our', 'results', 'for', 'the', 'free', 'energy', 'and', 'constraints', 'on', 'the', 'operator', 'spectrum', 'extend', 'to', 'theories', 'without', 'parity', 'symmetry', 'through', 'the', 'construction', 'of', 'an', 'auxiliary', 'parityinvariant', 'partition', 'function']]
|
[-0.16234988985029428, 0.13030705743451992, -0.0912076421031678, 0.04609118197113275, -0.05758645011842049, -0.1659662306761822, 0.037259369699057895, 0.30368094390409217, -0.2324246656640458, -0.22638547724565944, 0.06411583443625352, -0.2856653287994197, -0.10944205456589524, 0.1583691675996257, -0.043958586396262475, 0.03268161366781774, 0.017348188479003067, 0.0523109406251712, -0.1331574845945815, -0.21359482144030767, 0.39030365362209646, 0.023638972831336227, 0.2484573607408517, 0.057651729425855884, 0.0939517421182245, 0.029021968189123514, 0.03067425836280391, -0.020641359011013362, -0.1469713544646495, 0.1234243061071784, 0.2137319413290636, 0.07586162106410878, 0.20295064270597052, -0.36382475606090314, -0.17657527173098453, 0.14095409704321946, 0.12489699237300335, 0.08306841862551566, -0.014881538791028229, -0.23983816311858291, 0.11961715743826652, -0.12882389069811717, -0.17922999486956442, -0.06342078682186233, 0.03141276694305644, -0.04219237888181532, -0.2807227233600979, 0.04936863091342447, 0.07954366709030158, 0.08528072339737461, -0.078586837609072, -0.1219221872227216, -0.08873256855711932, 0.07008909164389872, 0.04653536909656297, 0.06917418666825806, 0.09328902775383982, -0.10392626695133544, -0.07295406775901446, 0.3264597847815477, -0.06478823059996766, -0.2072003890735072, 0.14839312463394694, -0.17206514773865206, -0.17505262681106862, 0.12104191674624343, 0.0810853086185415, 0.15066502636197854, -0.06645355113708049, 0.1782593496870627, -0.098329880096119, 0.14112650820658215, 0.10616614524325406, 0.01686260215182965, 0.17257515871771487, 0.057147063302329264, 0.1278917634482118, 0.1506534473878108, -0.028020962256610996, -0.06757486253423063, -0.3706239508213224, -0.15237198771194654, -0.17167324036787693, 0.07940171827511812, -0.11243639522022883, -0.16043311578758074, 0.40134784162950676, 0.10650147166405176, 0.228311957425054, 0.1318438962309596, 0.22300944258395985, 0.1566184730105404, 0.0847712672133049, 0.09967842264906378, 0.15889267320367131, 0.12652803770820234, 0.02344107079835659, -0.22975013020976975, -0.05477578315028065, 0.13217583677127354]
|
1,803.04939
|
Onsager's Conjecture with Physical Boundaries and an Application to the
Vanishing Viscosity Limit
|
We consider the incompressible Euler equations in a bounded domain in three
space dimensions. Recently, the first two authors proved Onsager's conjecture
for bounded domains, i.e., that the energy of a solution to these equations is
conserved provided the solution is H\"older continuous with exponent greater
than 1/3, uniformly up to the boundary. In this contribution we relax this
assumption, requiring only interior H\"older regularity and continuity of the
normal component of the energy flux near the boundary. The significance of this
improvement is given by the fact that our new condition is consistent with the
possible formation of a Prandtl-type boundary layer in the vanishing viscosity
limit.
|
math.AP
|
we consider the incompressible euler equations in a bounded domain in three space dimensions recently the first two authors proved onsagers conjecture for bounded domains ie that the energy of a solution to these equations is conserved provided the solution is holder continuous with exponent greater than 13 uniformly up to the boundary in this contribution we relax this assumption requiring only interior holder regularity and continuity of the normal component of the energy flux near the boundary the significance of this improvement is given by the fact that our new condition is consistent with the possible formation of a prandtltype boundary layer in the vanishing viscosity limit
|
[['we', 'consider', 'the', 'incompressible', 'euler', 'equations', 'in', 'a', 'bounded', 'domain', 'in', 'three', 'space', 'dimensions', 'recently', 'the', 'first', 'two', 'authors', 'proved', 'onsagers', 'conjecture', 'for', 'bounded', 'domains', 'ie', 'that', 'the', 'energy', 'of', 'a', 'solution', 'to', 'these', 'equations', 'is', 'conserved', 'provided', 'the', 'solution', 'is', 'holder', 'continuous', 'with', 'exponent', 'greater', 'than', '13', 'uniformly', 'up', 'to', 'the', 'boundary', 'in', 'this', 'contribution', 'we', 'relax', 'this', 'assumption', 'requiring', 'only', 'interior', 'holder', 'regularity', 'and', 'continuity', 'of', 'the', 'normal', 'component', 'of', 'the', 'energy', 'flux', 'near', 'the', 'boundary', 'the', 'significance', 'of', 'this', 'improvement', 'is', 'given', 'by', 'the', 'fact', 'that', 'our', 'new', 'condition', 'is', 'consistent', 'with', 'the', 'possible', 'formation', 'of', 'a', 'prandtltype', 'boundary', 'layer', 'in', 'the', 'vanishing', 'viscosity', 'limit']]
|
[-0.1665800241322291, 0.09662744520809846, -0.07238714128336007, 0.02722500199646068, -0.07838165592154299, -0.09326581551296706, 0.011075547262508836, 0.28569633192900157, -0.2880690555191702, -0.24390631748570335, 0.13903936366895558, -0.265864148843792, -0.06737207690322841, 0.14952654023309825, -0.06757769589980685, 0.08843577578146425, 0.0389297086297086, 0.03134172195913615, -0.08144140966221501, -0.2475537363271643, 0.38933625755210716, -0.044369586555856384, 0.2613288283917225, 0.0785416592757597, 0.124315307548925, -0.08246129042796653, 0.0009837898822432315, 0.03342031882251225, -0.18675795002235207, 0.12110001097122829, 0.18658641282538022, 0.017268875018796988, 0.27976333949266485, -0.3957670292368642, -0.2442519198607274, 0.1195713808518593, 0.11105493169829801, 0.04473036721228035, -0.02463691537721186, -0.24761464962459825, 0.1366485549165022, -0.11214680214093446, -0.2125281026819721, -0.0007429249213870477, 0.03300547661880652, 0.0014343923992580837, -0.29599727165919765, 0.13523829907299606, 0.12314197424523256, 0.038213825405195904, -0.16682791812949022, -0.08190419113358345, -0.05305025224461807, 0.07845065607775555, 0.08817247808716881, 0.06855831481947529, 0.048056653498928494, -0.14425924577517435, -0.051269170953202305, 0.31524555111321173, -0.07441980048382969, -0.2816198774682427, 0.18983944774501854, -0.19286775498875175, -0.11834108656168812, 0.14495265543788532, 0.09024129200864721, 0.14525070754569713, -0.14790082556471504, 0.12072943829601475, -0.06712812919027379, 0.16037549733839654, 0.11946092827969955, -0.024149024039851846, 0.11290050650670848, 0.15307941632690253, 0.16477271358706747, 0.14515837892260472, -0.04355334058723033, -0.09715922377816039, -0.38874315111725416, -0.18835102514519045, -0.21485859896185705, 0.09592730431231083, -0.11020426628062895, -0.16480583160322299, 0.35639641292746765, 0.14359169791418094, 0.15455597982293479, 0.09081721322447131, 0.25855380453652255, 0.16733188449062356, 0.023719041276274732, 0.13579168411282203, 0.2658457391640965, 0.12601938894820502, 0.14218390933927838, -0.17041580240604365, 0.05328377966199898, 0.11469663111401368]
|
1,803.0494
|
Nearly Optimal Time Bounds for kPath in Hypergraphs
|
We give almost tight conditional lower bounds on the running time of the
kHyperPath problem. Given an $r$-uniform hypergraph for some integer $r$,
kHyperPath seeks a tight path of length $k$. That is, a sequence of $k$ nodes
such that every consecutive $r$ of them constitute a hyperedge in the graph.
This problem is a natural generalization of the extensively-studied kPath
problem in graphs. We show that solving kHyperPath in time
$O^*(2^{(1-\gamma)k})$ where $\gamma>0$ is independent of $r$ is probably
impossible. Specifically, it implies that Set Cover on $n$ elements can be
solved in time $O^*(2^{(1 - \delta)n})$ for some $\delta>0$. The only known
lower bound for the kPath problem is $2^{\Omega(k)} poly(n)$ where $n$ is the
number of nodes assuming the Exponential Time Hypothesis (ETH), and finding any
conditional lower bound with an explicit constant in the exponent has been an
important open problem.
We complement our lower bound with an almost tight upper bound. Formally, for
every integer $r\geq 3$ we give algorithms that solve kHyperPath and
kHyperCycle on $r$-uniform hypergraphs with $n$ nodes and $m$ edges in time
$2^k m \cdot poly(n)$ and $2^k m^2 poly(n)$ respectively, and that is even for
the directed version of these problems. To the best of our knowledge, this is
the first algorithm for kHyperPath. The fastest algorithms known for kPath run
in time $2^k poly(n)$ for directed graphs (Williams, 2009), and in time $1.66^k
poly(n)$ for undirected graphs (Bj\"orklund \etal, 2014).
|
cs.DS
|
we give almost tight conditional lower bounds on the running time of the khyperpath problem given an runiform hypergraph for some integer r khyperpath seeks a tight path of length k that is a sequence of k nodes such that every consecutive r of them constitute a hyperedge in the graph this problem is a natural generalization of the extensivelystudied kpath problem in graphs we show that solving khyperpath in time o21gammak where gamma0 is independent of r is probably impossible specifically it implies that set cover on n elements can be solved in time o21 deltan for some delta0 the only known lower bound for the kpath problem is 2omegak polyn where n is the number of nodes assuming the exponential time hypothesis eth and finding any conditional lower bound with an explicit constant in the exponent has been an important open problem we complement our lower bound with an almost tight upper bound formally for every integer rgeq 3 we give algorithms that solve khyperpath and khypercycle on runiform hypergraphs with n nodes and m edges in time 2k m cdot polyn and 2k m2 polyn respectively and that is even for the directed version of these problems to the best of our knowledge this is the first algorithm for khyperpath the fastest algorithms known for kpath run in time 2k polyn for directed graphs williams 2009 and in time 166k polyn for undirected graphs bjorklund etal 2014
|
[['we', 'give', 'almost', 'tight', 'conditional', 'lower', 'bounds', 'on', 'the', 'running', 'time', 'of', 'the', 'khyperpath', 'problem', 'given', 'an', 'runiform', 'hypergraph', 'for', 'some', 'integer', 'r', 'khyperpath', 'seeks', 'a', 'tight', 'path', 'of', 'length', 'k', 'that', 'is', 'a', 'sequence', 'of', 'k', 'nodes', 'such', 'that', 'every', 'consecutive', 'r', 'of', 'them', 'constitute', 'a', 'hyperedge', 'in', 'the', 'graph', 'this', 'problem', 'is', 'a', 'natural', 'generalization', 'of', 'the', 'extensivelystudied', 'kpath', 'problem', 'in', 'graphs', 'we', 'show', 'that', 'solving', 'khyperpath', 'in', 'time', 'o21gammak', 'where', 'gamma0', 'is', 'independent', 'of', 'r', 'is', 'probably', 'impossible', 'specifically', 'it', 'implies', 'that', 'set', 'cover', 'on', 'n', 'elements', 'can', 'be', 'solved', 'in', 'time', 'o21', 'deltan', 'for', 'some', 'delta0', 'the', 'only', 'known', 'lower', 'bound', 'for', 'the', 'kpath', 'problem', 'is', '2omegak', 'polyn', 'where', 'n', 'is', 'the', 'number', 'of', 'nodes', 'assuming', 'the', 'exponential', 'time', 'hypothesis', 'eth', 'and', 'finding', 'any', 'conditional', 'lower', 'bound', 'with', 'an', 'explicit', 'constant', 'in', 'the', 'exponent', 'has', 'been', 'an', 'important', 'open', 'problem', 'we', 'complement', 'our', 'lower', 'bound', 'with', 'an', 'almost', 'tight', 'upper', 'bound', 'formally', 'for', 'every', 'integer', 'rgeq', '3', 'we', 'give', 'algorithms', 'that', 'solve', 'khyperpath', 'and', 'khypercycle', 'on', 'runiform', 'hypergraphs', 'with', 'n', 'nodes', 'and', 'm', 'edges', 'in', 'time', '2k', 'm', 'cdot', 'polyn', 'and', '2k', 'm2', 'polyn', 'respectively', 'and', 'that', 'is', 'even', 'for', 'the', 'directed', 'version', 'of', 'these', 'problems', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'algorithm', 'for', 'khyperpath', 'the', 'fastest', 'algorithms', 'known', 'for', 'kpath', 'run', 'in', 'time', '2k', 'polyn', 'for', 'directed', 'graphs', 'williams', '2009', 'and', 'in', 'time', '166k', 'polyn', 'for', 'undirected', 'graphs', 'bjorklund', 'etal', '2014']]
|
[-0.1953002310314762, 0.12548422234801906, -0.030405096238172506, 0.03485218516771017, -0.06523539937118006, -0.20688151476613958, 0.061261039508707066, 0.36975409313721996, -0.2495097544492234, -0.3735686893523808, 0.08508475837671052, -0.27890951401172875, -0.1257223425686501, 0.17475438985496147, -0.055993894950136985, 0.06463242744494481, 0.07465395501142816, 0.10498501029737954, 0.018992530049378925, -0.34238075483101615, 0.22523773175699613, 0.01770610464854708, 0.14063822933893164, 0.07781737748305569, 0.0688035188170095, 0.010742437253600056, 0.04002231097178934, 0.023914307813682763, -0.19150010440767526, 0.0562640315541636, 0.27751152522131045, 0.18317352478582888, 0.26902234554683735, -0.39714798603461315, -0.12882059851842087, 0.20982078985578306, 0.1513744159503388, 0.05989467215877545, 0.015585977043308129, -0.1925911542248248, 0.12270514952325368, -0.059034511644907986, -0.06393490310263218, 0.046782370713954, 0.15586351350594296, -0.04401578786114883, -0.3266532982420569, 0.024948272625188724, 0.14933226176219272, -0.004243099058790128, 0.003183140544680572, -0.2077273590458785, 0.06565162746082473, 0.0829698647773247, -0.06449878391444305, 0.09800182850559867, -0.020740758220445098, -0.06463338293966284, -0.16714451398124786, 0.3112194333775637, -0.06791304045932502, -0.14865862854013714, 0.08836132956998824, -0.09204147452732178, -0.21655534637526055, 0.1083621601082919, 0.14280655778716575, 0.19260922583598125, -0.06885667542341452, 0.19350413953981713, -0.17184458661014962, 0.16836648069976393, 0.11567898471505707, 0.008822620158645674, 0.05413336234545077, 0.14163660291063634, 0.2104641936821588, 0.14746010769109483, 0.02279600533664144, -0.018737171018173925, -0.2852073430009029, -0.14437056694450917, -0.2783615996693713, 0.057484072804026586, -0.19538697666345647, -0.1392541202959184, 0.3452050074982115, 0.11326962768174866, 0.20306626734036937, 0.1849431659366134, 0.24116448418704894, 0.11427228796873723, 0.000912622954619789, 0.245084420726373, 0.12890968108986886, 0.11615989533919087, 0.012434717753061137, -0.1728339596491362, 0.08615398335561376, 0.1317961069407484]
|
1,803.04941
|
Comparative study of plasmonic antennas for strong coupling and quantum
nonlinearities with single emitters
|
Realizing strong coupling between a single quantum emitter (QE) and an
optical cavity is of crucial importance in the context of various quantum
optical applications. While Rabi splitting of single quantum emitters coupled
to high-Q diffraction limited cavities have been reported in numerous
configurations, attaining single emitter Rabi splitting with a plasmonic
nanostructure is still elusive. Here, we establish the analytical condition for
strong coupling between a single QE and a plasmonic nanocavity and apply it to
study various plasmonic arrangements that were shown to enable Rabi splitting.
We investigate numerically the optical response and the resulting Rabi
splitting in metallic nanostructures such as bow-tie nanoantennas, nanosphere
dimers and nanospheres on a surface and find the optimal geometries for
emergence of the strong coupling regime with single QEs. We also provide a
master equation approach to show the saturation of a single QE in the gap of a
silver bow-tie nanoantenna. Our results will be useful for implementation of
realistic quantum plasmonic nanosystems involving single QEs.
|
physics.optics
|
realizing strong coupling between a single quantum emitter qe and an optical cavity is of crucial importance in the context of various quantum optical applications while rabi splitting of single quantum emitters coupled to highq diffraction limited cavities have been reported in numerous configurations attaining single emitter rabi splitting with a plasmonic nanostructure is still elusive here we establish the analytical condition for strong coupling between a single qe and a plasmonic nanocavity and apply it to study various plasmonic arrangements that were shown to enable rabi splitting we investigate numerically the optical response and the resulting rabi splitting in metallic nanostructures such as bowtie nanoantennas nanosphere dimers and nanospheres on a surface and find the optimal geometries for emergence of the strong coupling regime with single qes we also provide a master equation approach to show the saturation of a single qe in the gap of a silver bowtie nanoantenna our results will be useful for implementation of realistic quantum plasmonic nanosystems involving single qes
|
[['realizing', 'strong', 'coupling', 'between', 'a', 'single', 'quantum', 'emitter', 'qe', 'and', 'an', 'optical', 'cavity', 'is', 'of', 'crucial', 'importance', 'in', 'the', 'context', 'of', 'various', 'quantum', 'optical', 'applications', 'while', 'rabi', 'splitting', 'of', 'single', 'quantum', 'emitters', 'coupled', 'to', 'highq', 'diffraction', 'limited', 'cavities', 'have', 'been', 'reported', 'in', 'numerous', 'configurations', 'attaining', 'single', 'emitter', 'rabi', 'splitting', 'with', 'a', 'plasmonic', 'nanostructure', 'is', 'still', 'elusive', 'here', 'we', 'establish', 'the', 'analytical', 'condition', 'for', 'strong', 'coupling', 'between', 'a', 'single', 'qe', 'and', 'a', 'plasmonic', 'nanocavity', 'and', 'apply', 'it', 'to', 'study', 'various', 'plasmonic', 'arrangements', 'that', 'were', 'shown', 'to', 'enable', 'rabi', 'splitting', 'we', 'investigate', 'numerically', 'the', 'optical', 'response', 'and', 'the', 'resulting', 'rabi', 'splitting', 'in', 'metallic', 'nanostructures', 'such', 'as', 'bowtie', 'nanoantennas', 'nanosphere', 'dimers', 'and', 'nanospheres', 'on', 'a', 'surface', 'and', 'find', 'the', 'optimal', 'geometries', 'for', 'emergence', 'of', 'the', 'strong', 'coupling', 'regime', 'with', 'single', 'qes', 'we', 'also', 'provide', 'a', 'master', 'equation', 'approach', 'to', 'show', 'the', 'saturation', 'of', 'a', 'single', 'qe', 'in', 'the', 'gap', 'of', 'a', 'silver', 'bowtie', 'nanoantenna', 'our', 'results', 'will', 'be', 'useful', 'for', 'implementation', 'of', 'realistic', 'quantum', 'plasmonic', 'nanosystems', 'involving', 'single', 'qes']]
|
[-0.15280797609046706, 0.1321237222250328, -0.007165769061791789, 0.02072747892851616, -0.03405214728737048, -0.22658521491832223, 0.041309090107483, 0.4943509296491652, -0.20888078116239553, -0.30036430968903005, -0.02559121414817062, -0.2500367044942476, -0.17580098139279218, 0.263153848322445, 0.03249769365830145, 0.07915270670881833, 0.05697010710964495, -0.05495356225407912, -0.0013049590718337749, -0.13702125687303626, 0.2623977813861299, 0.03217802030253168, 0.3546752259612128, 0.1135852018662964, 0.07856662905107376, 0.003856476500114224, 0.17019200054592037, -0.02261270707226302, -0.12323045357662928, 0.14234487965025558, 0.25135370420224695, -0.03327125861135547, 0.26531345706225473, -0.43208536296993133, -0.19250286556780338, 0.02946269043710038, 0.18774039527479874, 0.2111874679313883, -0.11143726232273683, -0.28409841739437935, 0.028062701738630253, -0.1103860747226211, -0.12263939796430788, -0.07009285183746862, -0.03648923648835485, 0.03168648784434569, -0.24419866726805275, -0.007375114980463713, 0.03459430402053621, 0.048599721633840395, -0.0036848277072366103, -0.039124863248890696, 0.0314612958751372, 0.08064651725735202, -0.08069044672210801, -0.05719466472790767, 0.1686890792937568, -0.1274692463893331, -0.16180709932639029, 0.3836918316040951, -0.0811070024810103, -0.1523455203095653, 0.16522402872881256, -0.16877936188647724, -0.02468834810957582, 0.14714751056260822, 0.14790190531590292, 0.12127494990421706, -0.14293199340835303, 0.06421122369314376, -0.01800971084655857, 0.21506128644119074, 0.10660313340801611, 0.15912175102787743, 0.2477719604811934, 0.22230521226105426, 0.01225606188127569, 0.1973791960016712, -0.09391786907981879, -0.06965308580042637, -0.23837761568881752, -0.16548309229098326, -0.1941286968628326, 0.09558865950156721, -0.07377663239817758, -0.21014382203824183, 0.3914798002392727, 0.0850177992637415, 0.12540346466240485, -0.03156416403011879, 0.26604874813312057, 0.14302090607605963, 0.07743582311955965, -0.04034098778593253, 0.33688081437665746, 0.20358807851240623, 0.05537738471645413, -0.33684746712636965, -0.06491064756873052, -0.04978503626126078]
|
1,803.04942
|
Slodowy slices and the complete integrability of Mishchenko-Fomenko
subalgebras on regular adjoint orbits
|
This work is concerned with Mishchenko-Fomenko subalgebras and their
restrictions to the adjoint orbits in a finite-dimensional complex semisimple
Lie algebra. In this setting, it is known that each Mishchenko-Fomenko
subalgebra restricts to a completely integrable system on every orbit in
general position. We improve upon this result, showing that each
Mishchenko-Fomenko subalgebra yields a completely integrable system on all
regular orbits (i.e. orbits of maximal dimension). Our approach incorporates
the theory of regular $\mathfrak{sl}_2$-triples and associated Slodowy slices,
as developed by Kostant.
|
math.SG math.AG math.DG
|
this work is concerned with mishchenkofomenko subalgebras and their restrictions to the adjoint orbits in a finitedimensional complex semisimple lie algebra in this setting it is known that each mishchenkofomenko subalgebra restricts to a completely integrable system on every orbit in general position we improve upon this result showing that each mishchenkofomenko subalgebra yields a completely integrable system on all regular orbits ie orbits of maximal dimension our approach incorporates the theory of regular mathfraksl_2triples and associated slodowy slices as developed by kostant
|
[['this', 'work', 'is', 'concerned', 'with', 'mishchenkofomenko', 'subalgebras', 'and', 'their', 'restrictions', 'to', 'the', 'adjoint', 'orbits', 'in', 'a', 'finitedimensional', 'complex', 'semisimple', 'lie', 'algebra', 'in', 'this', 'setting', 'it', 'is', 'known', 'that', 'each', 'mishchenkofomenko', 'subalgebra', 'restricts', 'to', 'a', 'completely', 'integrable', 'system', 'on', 'every', 'orbit', 'in', 'general', 'position', 'we', 'improve', 'upon', 'this', 'result', 'showing', 'that', 'each', 'mishchenkofomenko', 'subalgebra', 'yields', 'a', 'completely', 'integrable', 'system', 'on', 'all', 'regular', 'orbits', 'ie', 'orbits', 'of', 'maximal', 'dimension', 'our', 'approach', 'incorporates', 'the', 'theory', 'of', 'regular', 'mathfraksl_2triples', 'and', 'associated', 'slodowy', 'slices', 'as', 'developed', 'by', 'kostant']]
|
[-0.18040974814126767, 0.04590035983781535, -0.06706421740534829, 0.030618094866129954, -0.12683192132858606, -0.15825302265698044, -0.02477988005167146, 0.3427711789518958, -0.3028026159296221, -0.14962907212718232, 0.13958367136187805, -0.20512529680641686, -0.17055156463530005, 0.22296844339906807, -0.20056292049944538, -0.0027778774355083887, 0.13500978224115764, 0.12835090800909688, -0.1015925061911708, -0.2928295896229584, 0.402426892897205, -0.012700131571874386, 0.20853447239482548, -0.03125215661939143, 0.15057745385665175, 0.07445174794098953, 0.008960888698333648, -0.013703401859213666, -0.11994230057337894, 0.12077205684660684, 0.27718023044943085, 0.07427837535250569, 0.2113475218648091, -0.2991735941951203, -0.11426947701427086, 0.144754165790623, 0.19579353115930245, 0.06367138421117532, 0.017154802156544132, -0.31622398733274965, 0.08770707230333512, -0.23584534600377083, -0.2131744379166332, -0.05591832116677812, 0.08178834379196348, -0.04330383823821094, -0.2158642810110639, 0.04444696781475369, 0.16080743529572628, 0.0969420143902847, -0.11416641415505693, -0.06394656463781735, -0.09644972478187211, 0.08799610982461628, -0.054024559848873714, 0.034386448516714865, 0.12303545019268512, -0.011925054126328266, -0.14127749381814061, 0.3848284412027768, 0.020803067015438544, -0.292721303043569, 0.20324036150193978, -0.22971097472487245, -0.18439361620012942, 0.08616520410471755, 0.07964042494664104, 0.13382173012714924, -0.08392034078062308, 0.2318805022968729, -0.1308444356375442, 0.06018305173081278, 0.0833082797414646, -0.010221026053442052, 0.16978360124488884, 0.1109140313786977, 0.11220332768904727, 0.08278180415764815, 0.11646731183566039, -0.04655964760018921, -0.3095946817590696, -0.13202992075963355, -0.10657429829290954, 0.10516515915372932, -0.06127185346068894, -0.17550565928175318, 0.4321986492041771, 0.13884200638432692, 0.20307021273481773, 0.11185006457153798, 0.23650596447561573, 0.0881382533315024, 0.09877927333014314, 0.08215948213573272, 0.1407172736689085, 0.21779097547675141, -0.004084089214391098, -0.16754498671763007, -0.06099532778579288, 0.21338513278879406]
|
1,803.04943
|
Spin wave localization and guiding by magnon band structure engineering
in yttrium iron garnet
|
In spintronics the propagation of spin-wave excitations in magnetically
ordered materials can also be used to transport and process information. One of
the most popular materials in this regard is the ferrimagnetic insulator
yttrium-iron-garnet due its exceptionally small spin-wave damping parameter.
While the small relaxation rate allows for large propagation length of magnetic
excitations, it also leads to non-locality of the magnetic properties. By
imaging spin waves their band structure is mapped. In doing so wave vector
selection is shown to suppress dispersion effects to a large extent allowing
for local measurements of spin relaxation. Moreover we demonstrate even higher
control of magnon propagation by employing the wave vector selectivity near an
avoided crossing of different spin-wave modes where the group velocity
approaches zero. Here local engineering of the dispersion allows constructing
magnonic waveguides and at the same time reveals the local relaxation
properties.
|
cond-mat.mes-hall
|
in spintronics the propagation of spinwave excitations in magnetically ordered materials can also be used to transport and process information one of the most popular materials in this regard is the ferrimagnetic insulator yttriumirongarnet due its exceptionally small spinwave damping parameter while the small relaxation rate allows for large propagation length of magnetic excitations it also leads to nonlocality of the magnetic properties by imaging spin waves their band structure is mapped in doing so wave vector selection is shown to suppress dispersion effects to a large extent allowing for local measurements of spin relaxation moreover we demonstrate even higher control of magnon propagation by employing the wave vector selectivity near an avoided crossing of different spinwave modes where the group velocity approaches zero here local engineering of the dispersion allows constructing magnonic waveguides and at the same time reveals the local relaxation properties
|
[['in', 'spintronics', 'the', 'propagation', 'of', 'spinwave', 'excitations', 'in', 'magnetically', 'ordered', 'materials', 'can', 'also', 'be', 'used', 'to', 'transport', 'and', 'process', 'information', 'one', 'of', 'the', 'most', 'popular', 'materials', 'in', 'this', 'regard', 'is', 'the', 'ferrimagnetic', 'insulator', 'yttriumirongarnet', 'due', 'its', 'exceptionally', 'small', 'spinwave', 'damping', 'parameter', 'while', 'the', 'small', 'relaxation', 'rate', 'allows', 'for', 'large', 'propagation', 'length', 'of', 'magnetic', 'excitations', 'it', 'also', 'leads', 'to', 'nonlocality', 'of', 'the', 'magnetic', 'properties', 'by', 'imaging', 'spin', 'waves', 'their', 'band', 'structure', 'is', 'mapped', 'in', 'doing', 'so', 'wave', 'vector', 'selection', 'is', 'shown', 'to', 'suppress', 'dispersion', 'effects', 'to', 'a', 'large', 'extent', 'allowing', 'for', 'local', 'measurements', 'of', 'spin', 'relaxation', 'moreover', 'we', 'demonstrate', 'even', 'higher', 'control', 'of', 'magnon', 'propagation', 'by', 'employing', 'the', 'wave', 'vector', 'selectivity', 'near', 'an', 'avoided', 'crossing', 'of', 'different', 'spinwave', 'modes', 'where', 'the', 'group', 'velocity', 'approaches', 'zero', 'here', 'local', 'engineering', 'of', 'the', 'dispersion', 'allows', 'constructing', 'magnonic', 'waveguides', 'and', 'at', 'the', 'same', 'time', 'reveals', 'the', 'local', 'relaxation', 'properties']]
|
[-0.18854522583407946, 0.2216404684789571, -0.053419379701760285, 0.039694189442103484, -0.13361257221226375, -0.10844523086497146, 0.02286566765865751, 0.3815250223269686, -0.32597394540547003, -0.2610607291054394, 0.04375058215171319, -0.26929488463166407, -0.12071128689947525, 0.1866975421499875, 0.07134685817032328, 0.0624211474993596, -0.022298366667301808, -0.011678083414962102, -0.07767832892487705, -0.16427567740255553, 0.2563981846421181, 0.055000978431457445, 0.34501107261328595, 0.06299514534637435, 0.07539052867246533, 0.051635775706320906, 0.07826351692589621, 0.024203795538697805, -0.13373695536979036, 0.07547795410694864, 0.27055087677824, -0.03306750963545508, 0.2535020831645751, -0.46159160185036147, -0.22542890324904066, 0.014651752326042496, 0.1967008473681441, 0.19551757133093714, -0.026076069483274802, -0.2703276640224633, 0.05619385387075858, -0.12410125162427398, -0.15551852263484356, -0.10717382705641082, -0.0022518226695764395, -0.010654625195456902, -0.2269752327883907, 0.10310363939909924, 0.06885485039027925, 0.05268950544996187, -0.06620652861440451, -0.07267010446068728, -0.08438964219142993, 0.06665262492606416, 0.06593037216367116, 0.012842180969730381, 0.1292281811345472, -0.1358211166209205, -0.12881895188345677, 0.3712358545550766, -0.07649265306988834, -0.17152441541192173, 0.17552726452090106, -0.17366722186226172, -0.038993749039946124, 0.1803423353525836, 0.16120480120702674, 0.1055598876692885, -0.11381400548796389, 0.06909188018552312, 0.025452810967180994, 0.16988384352427804, 0.05234435231735309, 0.13765860027827634, 0.24818399750640513, 0.1791934249857958, 0.07318159557568531, 0.13745138610142427, -0.15290057488164166, -0.029917600066659764, -0.220279427007578, -0.1499412923003547, -0.2250334009877406, 0.02625720121492729, -0.08677065650711786, -0.1623328862873071, 0.4297642885422748, 0.1747317913977895, 0.15264247917608978, -0.028112685207613848, 0.2570580561037382, 0.14644614917455734, 0.11358780629396076, 0.08451034636042702, 0.278409122942119, 0.2014813071008474, 0.09611713485436565, -0.3095056421298068, 0.06731987782889821, -0.014611309950446917]
|
1,803.04944
|
Quantum hypothesis testing and state discrimination
|
This expository article gives an overview of the theory of hypothesis testing
of quantum states in finite dimensional Hilbert spaces. Optimal measurement
strategy for testing binary quantum hypotheses, which result in minimum error
probability, is discussed. Collective and individual adaptive measurement
strategies in testing hypotheses in the multiple copy scenario, with various
upper and lower bounds on error probability, are outlined. A brief account on
quantum channel discrimination and the role of entangled states in achieving
enhanced precision in the task of channel discrimination is given.
|
quant-ph
|
this expository article gives an overview of the theory of hypothesis testing of quantum states in finite dimensional hilbert spaces optimal measurement strategy for testing binary quantum hypotheses which result in minimum error probability is discussed collective and individual adaptive measurement strategies in testing hypotheses in the multiple copy scenario with various upper and lower bounds on error probability are outlined a brief account on quantum channel discrimination and the role of entangled states in achieving enhanced precision in the task of channel discrimination is given
|
[['this', 'expository', 'article', 'gives', 'an', 'overview', 'of', 'the', 'theory', 'of', 'hypothesis', 'testing', 'of', 'quantum', 'states', 'in', 'finite', 'dimensional', 'hilbert', 'spaces', 'optimal', 'measurement', 'strategy', 'for', 'testing', 'binary', 'quantum', 'hypotheses', 'which', 'result', 'in', 'minimum', 'error', 'probability', 'is', 'discussed', 'collective', 'and', 'individual', 'adaptive', 'measurement', 'strategies', 'in', 'testing', 'hypotheses', 'in', 'the', 'multiple', 'copy', 'scenario', 'with', 'various', 'upper', 'and', 'lower', 'bounds', 'on', 'error', 'probability', 'are', 'outlined', 'a', 'brief', 'account', 'on', 'quantum', 'channel', 'discrimination', 'and', 'the', 'role', 'of', 'entangled', 'states', 'in', 'achieving', 'enhanced', 'precision', 'in', 'the', 'task', 'of', 'channel', 'discrimination', 'is', 'given']]
|
[-0.15269066876905082, 0.1530821852585325, -0.09685159107226185, 0.09989295418639559, 0.011396491607694431, -0.21064990275366188, 0.10142727695042701, 0.335345110225188, -0.20477056524954562, -0.30890642035059457, 0.09194665915213612, -0.21476116838193562, -0.10607818254204683, 0.19170464206010449, -0.1375521509691553, 0.10967395004144935, 0.11398796468626621, 0.060465174532213874, -0.04807387742885323, -0.2989821389620734, 0.3140105776716197, 0.11695796945592561, 0.3492928933633795, 0.04823129032305334, 0.09208477774721592, 0.0626817469939936, -0.07219041322444587, -0.053873470724495345, -0.16564871416072535, 0.11759746914355863, 0.31598212342536036, 0.16920596656801049, 0.2849150504592026, -0.38692021940707577, -0.15871260822534042, 0.10827774982249667, 0.10438810200917772, 0.12186819896897907, -0.06898855266626924, -0.30823106271536954, 0.05161842355926976, -0.15464397857702056, -0.06465234581467717, -0.031990957998692296, -0.0011306963427815326, -0.06777605145823123, -0.31330798015128386, 0.07972229310571281, 0.09517632719659962, 0.0883541838235498, -0.058784699557500694, -0.14265142123453145, 0.10839151900104615, 0.12211832369212061, 0.012544077485366616, 0.011957263725614824, 0.10707217348173673, -0.14452837891499362, -0.19043214912634604, 0.30911005862317115, -0.03658941736225537, -0.21800864414788437, 0.13777453850597404, -0.10992882191745001, -0.15647651983403363, 0.0824610471433072, 0.2084865816652255, 0.06993704419149908, -0.1232085462421352, 0.07590738627423402, -0.011394545912396076, 0.14246552038482976, 0.04344613830082465, 0.16112998754414187, 0.17752837378878233, 0.18591829752657824, 0.08561308604805883, 0.13476787531900025, -0.0789388549286699, -0.14684127220480572, -0.3591926892478896, -0.19969335714961553, -0.18016720197141864, 0.03923810485663802, -0.08509984617828809, -0.13166922346964954, 0.36723910872066434, 0.11819272355899367, 0.14189526959603957, 0.0456684626067642, 0.291006445083334, 0.09543995209428113, -0.05901896133802311, 0.020514668647042843, 0.22540571999757789, 0.16653983136855585, -0.03268720985520198, -0.19391294511381624, 0.10183041883350978, 0.07116937833069283]
|
1,803.04945
|
On fully commutative elements of type $\tilde B$ and $\tilde D$
|
We define a tower of injections of $\tilde{B}$-type (resp. $\tilde{D}$-type)
Coxeter groups $W(\tilde B_{n})$ (resp. $W(\tilde D_{n})$) for $n\geq 3$. Let
$W^c(\tilde B_{n})$ (resp. $W^c(\tilde D_{n})$) be the set of fully commutative
elements in $W(\tilde B_{n})$ (resp. $W(\tilde D_{n})$), we classify the
elements of this set by giving a normal form for them. We define a
$\tilde{B}$-type tower of Hecke algebras and we use the faithfulness at the
Coxeter level to show that this last tower is a tower of injections.
We use this normal form to define two injections from $W^c(\tilde B_{n-1})$
into $W^c(\tilde B_{n})$. We then define the tower of affine Temperley-Lieb
algebras of type $\tilde{B }$ and use the injections above to prove the
faithfulness of this tower. We follow the same track for $\tilde{D}$-type
objects
|
math.GR
|
we define a tower of injections of tildebtype resp tildedtype coxeter groups wtilde b_n resp wtilde d_n for ngeq 3 let wctilde b_n resp wctilde d_n be the set of fully commutative elements in wtilde b_n resp wtilde d_n we classify the elements of this set by giving a normal form for them we define a tildebtype tower of hecke algebras and we use the faithfulness at the coxeter level to show that this last tower is a tower of injections we use this normal form to define two injections from wctilde b_n1 into wctilde b_n we then define the tower of affine temperleylieb algebras of type tildeb and use the injections above to prove the faithfulness of this tower we follow the same track for tildedtype objects
|
[['we', 'define', 'a', 'tower', 'of', 'injections', 'of', 'tildebtype', 'resp', 'tildedtype', 'coxeter', 'groups', 'wtilde', 'b_n', 'resp', 'wtilde', 'd_n', 'for', 'ngeq', '3', 'let', 'wctilde', 'b_n', 'resp', 'wctilde', 'd_n', 'be', 'the', 'set', 'of', 'fully', 'commutative', 'elements', 'in', 'wtilde', 'b_n', 'resp', 'wtilde', 'd_n', 'we', 'classify', 'the', 'elements', 'of', 'this', 'set', 'by', 'giving', 'a', 'normal', 'form', 'for', 'them', 'we', 'define', 'a', 'tildebtype', 'tower', 'of', 'hecke', 'algebras', 'and', 'we', 'use', 'the', 'faithfulness', 'at', 'the', 'coxeter', 'level', 'to', 'show', 'that', 'this', 'last', 'tower', 'is', 'a', 'tower', 'of', 'injections', 'we', 'use', 'this', 'normal', 'form', 'to', 'define', 'two', 'injections', 'from', 'wctilde', 'b_n1', 'into', 'wctilde', 'b_n', 'we', 'then', 'define', 'the', 'tower', 'of', 'affine', 'temperleylieb', 'algebras', 'of', 'type', 'tildeb', 'and', 'use', 'the', 'injections', 'above', 'to', 'prove', 'the', 'faithfulness', 'of', 'this', 'tower', 'we', 'follow', 'the', 'same', 'track', 'for', 'tildedtype', 'objects']]
|
[-0.15512563734345378, 0.1633171347315393, -0.026384422506746507, 0.05355399672126007, -0.07538478124526239, -0.13138605570120196, 0.015235777643899764, 0.3094964559159933, -0.3580431864867287, -0.18660734750841174, 0.07530267764119461, -0.28188018559388095, -0.09537340511733125, 0.12670304901116797, -0.15256329912001326, -0.14714483024116845, 0.021561448589988774, 0.1521869125145097, -0.08056089897722667, -0.2578790587703547, 0.38524819835419616, -0.09101921321088148, 0.1905510907151526, -0.09005090960812184, 0.11568734851560646, -0.004708495903609981, 0.015027224371630338, -0.02911257952068662, -0.2075303058281861, 0.14878731654513808, 0.2768292993836616, 0.15191380767294416, 0.18760214188706972, -0.3833696824543539, -0.009568580890059351, 0.26948535880787416, 0.19774488624065154, -0.017957882170805767, 0.004367844958323985, -0.26482243308677306, 0.1769466572844859, -0.2515686409836147, -0.1755782985766869, -0.014833984318219366, 0.05499423161569622, 0.02199952517666163, -0.29071981587537354, -0.03861105137114083, 0.11581120147339759, 0.11432625492283653, -0.04352783692264629, -0.14406372340125662, -0.044906019807733115, 0.16119117702868196, -0.08942364803853355, -0.03211262936195952, 0.07063431874989727, -0.03927758551435545, -0.133583951504871, 0.33364639854839734, -0.018137025699440028, -0.1965483337220165, 0.08279698555387797, -0.23782354467473324, -0.1770665753565188, 0.08377433855709951, 0.10563957340068995, 0.09197431292024351, -0.028621398528376894, 0.168562045064567, -0.14843027452157148, 0.06501696607278239, 0.13626887243721755, -0.056108073635597625, 0.11094637113743491, 0.08255765654687439, 0.05820914139715774, 0.1606125074594597, 0.01473519587471533, 0.08609211888735092, -0.38493178980124576, -0.2470775327810477, -0.02445603124872451, 0.2059202452806095, -0.08450068976150849, -0.19615972755033703, 0.3655085316896739, 0.0793054500752459, 0.14349833766989892, 0.19712666495733203, 0.144635658733727, 0.05376251658350567, 0.11681350225943231, 0.040394420175993394, 0.036204125837332776, 0.24092551586105518, -0.03778085250580203, -0.16748454486913678, -0.07411789311651862, 0.2672608195683889]
|
1,803.04946
|
On a conjecture of Buium and Poonen
|
Given a correspondence between a modular curve $S$ and an elliptic curve $A$,
we prove that the intersection of any finite-rank subgroup of $A$ with the set
of points on $A$ corresponding to an isogeny class on $S$ is finite. The
question was proposed by A. Buium and B. Poonen in 2009. We follow the strategy
proposed by the authors, using a result about the equidistribution of Hecke
points on Shimura varieties and Serre's open image theorem. The result is an
instance of the Zilber-Pink conjecture.
|
math.NT
|
given a correspondence between a modular curve s and an elliptic curve a we prove that the intersection of any finiterank subgroup of a with the set of points on a corresponding to an isogeny class on s is finite the question was proposed by a buium and b poonen in 2009 we follow the strategy proposed by the authors using a result about the equidistribution of hecke points on shimura varieties and serres open image theorem the result is an instance of the zilberpink conjecture
|
[['given', 'a', 'correspondence', 'between', 'a', 'modular', 'curve', 's', 'and', 'an', 'elliptic', 'curve', 'a', 'we', 'prove', 'that', 'the', 'intersection', 'of', 'any', 'finiterank', 'subgroup', 'of', 'a', 'with', 'the', 'set', 'of', 'points', 'on', 'a', 'corresponding', 'to', 'an', 'isogeny', 'class', 'on', 's', 'is', 'finite', 'the', 'question', 'was', 'proposed', 'by', 'a', 'buium', 'and', 'b', 'poonen', 'in', '2009', 'we', 'follow', 'the', 'strategy', 'proposed', 'by', 'the', 'authors', 'using', 'a', 'result', 'about', 'the', 'equidistribution', 'of', 'hecke', 'points', 'on', 'shimura', 'varieties', 'and', 'serres', 'open', 'image', 'theorem', 'the', 'result', 'is', 'an', 'instance', 'of', 'the', 'zilberpink', 'conjecture']]
|
[-0.18898447342271116, 0.0009599703038855845, -0.18004286572943592, 0.039813801085814664, -0.0632147069229896, -0.12020293344353694, 0.0810861516375701, 0.281021342417875, -0.2895077827581486, -0.26146407217480416, 0.09050433178091162, -0.26274324276993527, -0.13843536857775476, 0.24700979842955983, -0.20247551360232538, 0.03734030100776879, 0.08065171534910279, 0.07223716333811712, -0.05190987516530291, -0.3457408830588467, 0.41014031346800717, -0.03940679931601639, 0.2320161220119443, 0.08466038362361318, 0.10021653493628079, 0.04708939535153467, 0.003355739010108072, -0.07398748979362291, -0.12537776796070407, 0.18114066080645072, 0.2665216688521553, 0.11636877711050125, 0.22372937574441176, -0.3193685302922372, -0.1415651009220435, 0.1854463493516452, 0.058104607493205125, 0.045984838563992186, -0.023587167091115357, -0.2821715223971148, 0.11802574291522074, -0.149034928053964, -0.18301431588330414, -0.028943863218152073, 0.08342866998891411, 0.0026518487869653593, -0.2808196278895403, -0.03103930665569943, 0.1581639989907312, 0.18864432780808488, -0.06122328276031239, -0.07624494202629944, -0.012838248059229363, 0.04380438016012831, 0.005819965998620488, 0.09763960587402243, 0.041596809976062805, -0.09045020477889582, -0.13890402954678202, 0.34429048746824265, -0.06653076008525352, -0.1508074237986706, 0.11006888922650454, -0.11221505846113486, -0.13067297367812242, 0.09312609012433609, 0.09929237091307376, 0.15312618231617434, -0.04168849396194483, 0.1589030154505582, -0.20776212018329737, 0.09818533471065335, 0.12176496473812433, -0.1265549391757177, 0.13669977666333663, 0.07404938008268039, 0.08233844175350008, 0.12238608771761836, -0.030339805195432935, 0.0007641655392944813, -0.3614004107062207, -0.19634586201201, -0.17298572566793408, 0.13321413479604607, -0.09738670180630897, -0.15276453193537023, 0.43567102272496666, 0.05333188340219474, 0.23813104157357715, 0.08221751620429893, 0.17493406914954268, 0.09691408577494913, 0.029693586571104175, 0.1068973027290773, 0.10633038551828196, 0.2000892289296919, -0.014421872540138835, -0.1684153277946766, -0.000604082451223634, 0.21411577660893633]
|
1,803.04947
|
Information-Corrected Estimation: A Generalization Error Reducing
Parameter Estimation Method
|
Modern computational models in supervised machine learning are often highly
parameterized universal approximators. As such, the value of the parameters is
unimportant, and only the out of sample performance is considered. On the other
hand much of the literature on model estimation assumes that the parameters
themselves have intrinsic value, and thus is concerned with bias and variance
of parameter estimates, which may not have any simple relationship to out of
sample model performance. Therefore, within supervised machine learning, heavy
use is made of ridge regression (i.e., L2 regularization), which requires the
the estimation of hyperparameters and can be rendered ineffective by certain
model parameterizations. We introduce an objective function which we refer to
as Information-Corrected Estimation (ICE) that reduces KL divergence based
generalization error for supervised machine learning. ICE attempts to directly
maximize a corrected likelihood function as an estimator of the KL divergence.
Such an approach is proven, theoretically, to be effective for a wide class of
models, with only mild regularity restrictions. Under finite sample sizes, this
corrected estimation procedure is shown experimentally to lead to significant
reduction in generalization error compared to maximum likelihood estimation and
L2 regularization.
|
stat.CO stat.ME
|
modern computational models in supervised machine learning are often highly parameterized universal approximators as such the value of the parameters is unimportant and only the out of sample performance is considered on the other hand much of the literature on model estimation assumes that the parameters themselves have intrinsic value and thus is concerned with bias and variance of parameter estimates which may not have any simple relationship to out of sample model performance therefore within supervised machine learning heavy use is made of ridge regression ie l2 regularization which requires the the estimation of hyperparameters and can be rendered ineffective by certain model parameterizations we introduce an objective function which we refer to as informationcorrected estimation ice that reduces kl divergence based generalization error for supervised machine learning ice attempts to directly maximize a corrected likelihood function as an estimator of the kl divergence such an approach is proven theoretically to be effective for a wide class of models with only mild regularity restrictions under finite sample sizes this corrected estimation procedure is shown experimentally to lead to significant reduction in generalization error compared to maximum likelihood estimation and l2 regularization
|
[['modern', 'computational', 'models', 'in', 'supervised', 'machine', 'learning', 'are', 'often', 'highly', 'parameterized', 'universal', 'approximators', 'as', 'such', 'the', 'value', 'of', 'the', 'parameters', 'is', 'unimportant', 'and', 'only', 'the', 'out', 'of', 'sample', 'performance', 'is', 'considered', 'on', 'the', 'other', 'hand', 'much', 'of', 'the', 'literature', 'on', 'model', 'estimation', 'assumes', 'that', 'the', 'parameters', 'themselves', 'have', 'intrinsic', 'value', 'and', 'thus', 'is', 'concerned', 'with', 'bias', 'and', 'variance', 'of', 'parameter', 'estimates', 'which', 'may', 'not', 'have', 'any', 'simple', 'relationship', 'to', 'out', 'of', 'sample', 'model', 'performance', 'therefore', 'within', 'supervised', 'machine', 'learning', 'heavy', 'use', 'is', 'made', 'of', 'ridge', 'regression', 'ie', 'l2', 'regularization', 'which', 'requires', 'the', 'the', 'estimation', 'of', 'hyperparameters', 'and', 'can', 'be', 'rendered', 'ineffective', 'by', 'certain', 'model', 'parameterizations', 'we', 'introduce', 'an', 'objective', 'function', 'which', 'we', 'refer', 'to', 'as', 'informationcorrected', 'estimation', 'ice', 'that', 'reduces', 'kl', 'divergence', 'based', 'generalization', 'error', 'for', 'supervised', 'machine', 'learning', 'ice', 'attempts', 'to', 'directly', 'maximize', 'a', 'corrected', 'likelihood', 'function', 'as', 'an', 'estimator', 'of', 'the', 'kl', 'divergence', 'such', 'an', 'approach', 'is', 'proven', 'theoretically', 'to', 'be', 'effective', 'for', 'a', 'wide', 'class', 'of', 'models', 'with', 'only', 'mild', 'regularity', 'restrictions', 'under', 'finite', 'sample', 'sizes', 'this', 'corrected', 'estimation', 'procedure', 'is', 'shown', 'experimentally', 'to', 'lead', 'to', 'significant', 'reduction', 'in', 'generalization', 'error', 'compared', 'to', 'maximum', 'likelihood', 'estimation', 'and', 'l2', 'regularization']]
|
[-0.023360664638719907, 0.03396726940252333, -0.10020127483394914, 0.10846703166278635, -0.11395858676314198, -0.1891936958518796, 0.03883282116099861, 0.3983015786583355, -0.28600099624783115, -0.3337433543933936, 0.11841818013262609, -0.24312311441135345, -0.14097910885289505, 0.20161938552832456, -0.1516760208245357, 0.12860072960989324, 0.0694339519649432, 0.044389741453805365, -0.10249364668142577, -0.281971561807788, 0.29043198953241267, 0.09190686943779909, 0.3156966704787462, 0.006054092190991502, 0.11789001626951781, -0.00754051087838622, -0.012571410622194175, 0.031028294350698357, -0.11812280491276349, 0.11353501672393286, 0.2691522051928963, 0.14410545451430049, 0.34816738785883283, -0.32829369232488986, -0.24277764060949, 0.165192917631744, 0.1650154260761246, 0.09301817368811084, 0.004836811101385904, -0.2274578826706759, 0.05897950188193412, -0.15566601785002226, -0.0450101715124929, -0.13347266703912336, -0.03378841020069353, -0.0029352402384027216, -0.33408208309272935, 0.08914080969011046, 0.0555906766325879, 0.06116155954885433, -0.03864926433419877, -0.184350842814795, 0.014477748138566759, 0.07062055424333633, 0.08753878474589047, 0.058636856379343384, 0.13789576187447025, -0.17143101535898422, -0.07354583648028563, 0.32102421517800833, -0.0717415774694561, -0.2624130659878098, 0.17689128022480036, -0.044352513734319525, -0.1264851552639059, 0.10662557885869947, 0.21856992501711853, 0.11692790058807162, -0.17154738079776002, 0.04681204054449777, -0.027175329135565078, 0.1774405779796092, 0.00973941569450599, 0.009716849435237845, 0.1505419688569918, 0.18970690148331576, 0.09103438065811524, 0.1217458594010787, -0.12313416189055754, -0.08122783955991152, -0.2763525273953199, -0.10368233806507282, -0.2178141302087817, 0.0039671394128763205, -0.11826938421900338, -0.20604252667914155, 0.32386974005408936, 0.19689725582787757, 0.2172860424985124, 0.09543809758045793, 0.3027970515464613, 0.13813817339000922, 0.1211055290083162, 0.09452935783143755, 0.26477185336882686, 0.09762202629530607, 0.011354829317582917, -0.196080961846137, 0.15377906421979606, 0.0433055197061844]
|
1,803.04948
|
Hyperball packings related to octahedron and cube tilings in hyperbolic
space
|
In this paper we study congruent and non-congruent hyperball (hypersphere)
packings of the truncated regular octahedron and cube tilings. These are
derived from the Coxeter simplex tilings $\{p,3,4\}$ $(7\le p \in \mathbb{N})$
and $\{p,4,3\}$ $(5\le p \in \mathbb{N})$ in $3$-dimensional hyperbolic space
$\mathbb{H}^3$. We determine the densest hyperball packing arrangement and its
density with congruent and non-congruent hyperballs related to the above
tilings in $\mathbb{H}^3$.
We prove that the locally densest congruent or non-congruent hyperball
configuration belongs to the regular truncated cube with density $\approx
0.86145$. This is larger than the B\"or\"oczky-Florian density upper bound for
balls and horoballs. Our locally optimal non-congruent hyperball packing
configuration cannot be extended to the entire hyperbolic space $\mathbb{H}^3$,
but we determine the extendable densest non-congruent hyperball packing
arrangement related to a regular cube tiling with density $\approx 0.84931$.
|
math.MG
|
in this paper we study congruent and noncongruent hyperball hypersphere packings of the truncated regular octahedron and cube tilings these are derived from the coxeter simplex tilings p34 7le p in mathbbn and p43 5le p in mathbbn in 3dimensional hyperbolic space mathbbh3 we determine the densest hyperball packing arrangement and its density with congruent and noncongruent hyperballs related to the above tilings in mathbbh3 we prove that the locally densest congruent or noncongruent hyperball configuration belongs to the regular truncated cube with density approx 086145 this is larger than the boroczkyflorian density upper bound for balls and horoballs our locally optimal noncongruent hyperball packing configuration cannot be extended to the entire hyperbolic space mathbbh3 but we determine the extendable densest noncongruent hyperball packing arrangement related to a regular cube tiling with density approx 084931
|
[['in', 'this', 'paper', 'we', 'study', 'congruent', 'and', 'noncongruent', 'hyperball', 'hypersphere', 'packings', 'of', 'the', 'truncated', 'regular', 'octahedron', 'and', 'cube', 'tilings', 'these', 'are', 'derived', 'from', 'the', 'coxeter', 'simplex', 'tilings', 'p34', '7le', 'p', 'in', 'mathbbn', 'and', 'p43', '5le', 'p', 'in', 'mathbbn', 'in', '3dimensional', 'hyperbolic', 'space', 'mathbbh3', 'we', 'determine', 'the', 'densest', 'hyperball', 'packing', 'arrangement', 'and', 'its', 'density', 'with', 'congruent', 'and', 'noncongruent', 'hyperballs', 'related', 'to', 'the', 'above', 'tilings', 'in', 'mathbbh3', 'we', 'prove', 'that', 'the', 'locally', 'densest', 'congruent', 'or', 'noncongruent', 'hyperball', 'configuration', 'belongs', 'to', 'the', 'regular', 'truncated', 'cube', 'with', 'density', 'approx', '086145', 'this', 'is', 'larger', 'than', 'the', 'boroczkyflorian', 'density', 'upper', 'bound', 'for', 'balls', 'and', 'horoballs', 'our', 'locally', 'optimal', 'noncongruent', 'hyperball', 'packing', 'configuration', 'can', 'not', 'be', 'extended', 'to', 'the', 'entire', 'hyperbolic', 'space', 'mathbbh3', 'but', 'we', 'determine', 'the', 'extendable', 'densest', 'noncongruent', 'hyperball', 'packing', 'arrangement', 'related', 'to', 'a', 'regular', 'cube', 'tiling', 'with', 'density', 'approx', '084931']]
|
[-0.14317170119281414, 0.17928629140578098, -0.02264470417823976, 0.059359293447550275, -0.044375657840673606, -0.0830253001768142, 0.016311711531806626, 0.37219632817988296, -0.26915086299153185, -0.2213580063804845, 0.12950549647385784, -0.3666153635079069, -0.1310428632232152, 0.06788558155339934, -0.1466265126590186, 0.05364849938882459, -0.04279064354938524, 0.05663230120506939, -0.07065774288216133, -0.30771497197261555, 0.2611470451290066, -0.04239496890344282, 0.18100460487202422, 0.021342027261714216, 0.03260181634339379, 0.004267411224835955, 0.06550849429957235, 0.08984243621790795, -0.35482080597909377, 0.14579619749087785, 0.25970639746267793, 0.06491072983793747, 0.09526983845315234, -0.3633598776833057, -0.1102333892069048, 0.23633682645106716, 0.17655658081118294, -0.04750955302907682, -0.027428372073293066, -0.21017698599581622, 0.09152633208892684, -0.06001119266278041, -0.22671906528438426, -0.01607664958782383, 0.0985186335060801, 0.03722300712860176, -0.20734967518278133, 0.05849297787236578, 0.12383733010058527, 0.009073377452893253, -0.11722168099715499, -0.14046229565960924, -0.049257582545266555, 0.04815196418794178, -0.11897117015731924, 0.10642163070968227, 0.11282319524116925, 0.026548672453569833, -0.060102147887697195, 0.4509504906721969, 0.1084794740381767, -0.2489069705731722, 0.14257888914843492, -0.31158104836515066, -0.1675403812212119, 0.2535450262670864, 0.14959191774198813, 0.13728788390116237, -0.003377653467260412, 0.1577453988981294, -0.1960309536505574, 0.18486570584354922, 0.22313270466610677, -0.09392030233753595, 0.19847698300493075, 0.07659460346687084, 0.1839432489794137, 0.2767517008712696, -0.03165964938616797, -0.08168199171534558, -0.25064652193851994, -0.16184734146991647, -0.24957264331169426, 0.055361966055287086, -0.19327861783307554, -0.23737082437181206, 0.23863048963387734, 0.0006916028857509147, 0.19778668394797905, 0.11182634589443011, 0.17572966686685818, -0.02530735056437274, 0.0441695249000036, 0.14390023154164874, 0.08344964946641016, 0.12562653056081774, -0.0808623054259415, -0.14580777467840086, -0.08018202812466492, 0.20498849495327962]
|
1,803.04949
|
Conformal Net Realizability of Tambara-Yamagami Categories and
Generalized Metaplectic Modular Categories
|
We show that all isomorphism classes of even rank Tambara-Yamagami categories
arise as $\mathbb{Z}_2$-twisted representations of conformal nets. As a
consequence, we show that their Drinfel'd centers are realized by (generalized)
orbifolds of conformal nets associated with (self-dual) lattices. The quantum
double subfactors of even rank Tambara-Yamagami categories are Bisch-Haagerup
subfactors and we describe their (dual) principal graphs.
For every abelian group of odd order the Drinfel'd centers of the associated
Tambara-Yamagami categories give a fusion ring generalizing the Verlinde ring
$\mathrm{Spin}(2n+1)_2$ in the case of $\mathbb{Z}_{2n+1}$. We classify all
generalized metaplectic modular categories, i.e. unitary modular tensor
category with those fusion rules and show that they are realized as
$\mathbb{Z}_2$-orbifolds of conformal nets associated with lattices. We further
show that twisted doubles of generalized dihedral groups of abelian groups of
odd order are group-theoretical generalized metaplectic modular categories and
vice versa.
We give some examples of twisted orbifolds of conformal nets and show how
generalized metaplectic modular categories arise by condensation of simpler
ones.
|
math.QA math-ph math.CT math.MP math.OA
|
we show that all isomorphism classes of even rank tambarayamagami categories arise as mathbbz_2twisted representations of conformal nets as a consequence we show that their drinfeld centers are realized by generalized orbifolds of conformal nets associated with selfdual lattices the quantum double subfactors of even rank tambarayamagami categories are bischhaagerup subfactors and we describe their dual principal graphs for every abelian group of odd order the drinfeld centers of the associated tambarayamagami categories give a fusion ring generalizing the verlinde ring mathrmspin2n1_2 in the case of mathbbz_2n1 we classify all generalized metaplectic modular categories ie unitary modular tensor category with those fusion rules and show that they are realized as mathbbz_2orbifolds of conformal nets associated with lattices we further show that twisted doubles of generalized dihedral groups of abelian groups of odd order are grouptheoretical generalized metaplectic modular categories and vice versa we give some examples of twisted orbifolds of conformal nets and show how generalized metaplectic modular categories arise by condensation of simpler ones
|
[['we', 'show', 'that', 'all', 'isomorphism', 'classes', 'of', 'even', 'rank', 'tambarayamagami', 'categories', 'arise', 'as', 'mathbbz_2twisted', 'representations', 'of', 'conformal', 'nets', 'as', 'a', 'consequence', 'we', 'show', 'that', 'their', 'drinfeld', 'centers', 'are', 'realized', 'by', 'generalized', 'orbifolds', 'of', 'conformal', 'nets', 'associated', 'with', 'selfdual', 'lattices', 'the', 'quantum', 'double', 'subfactors', 'of', 'even', 'rank', 'tambarayamagami', 'categories', 'are', 'bischhaagerup', 'subfactors', 'and', 'we', 'describe', 'their', 'dual', 'principal', 'graphs', 'for', 'every', 'abelian', 'group', 'of', 'odd', 'order', 'the', 'drinfeld', 'centers', 'of', 'the', 'associated', 'tambarayamagami', 'categories', 'give', 'a', 'fusion', 'ring', 'generalizing', 'the', 'verlinde', 'ring', 'mathrmspin2n1_2', 'in', 'the', 'case', 'of', 'mathbbz_2n1', 'we', 'classify', 'all', 'generalized', 'metaplectic', 'modular', 'categories', 'ie', 'unitary', 'modular', 'tensor', 'category', 'with', 'those', 'fusion', 'rules', 'and', 'show', 'that', 'they', 'are', 'realized', 'as', 'mathbbz_2orbifolds', 'of', 'conformal', 'nets', 'associated', 'with', 'lattices', 'we', 'further', 'show', 'that', 'twisted', 'doubles', 'of', 'generalized', 'dihedral', 'groups', 'of', 'abelian', 'groups', 'of', 'odd', 'order', 'are', 'grouptheoretical', 'generalized', 'metaplectic', 'modular', 'categories', 'and', 'vice', 'versa', 'we', 'give', 'some', 'examples', 'of', 'twisted', 'orbifolds', 'of', 'conformal', 'nets', 'and', 'show', 'how', 'generalized', 'metaplectic', 'modular', 'categories', 'arise', 'by', 'condensation', 'of', 'simpler', 'ones']]
|
[-0.1683016059942907, 0.13241959890214408, -0.033861384389172425, 0.1322255746075293, -0.09591827630746837, -0.18804718737445045, -0.06679092072910152, 0.3960134627342951, -0.32368198360838907, -0.17985016415917837, 0.0943015507137028, -0.2174805699813566, -0.19881542484707584, 0.17012159764289675, -0.15163221886514958, -0.05246140519952083, 0.04952667158653551, 0.1318312721474596, -0.13257239155667244, -0.34383706743942527, 0.46228317295132976, -0.05085645927394536, 0.2726857936259632, 0.00886021508755753, 0.06053964227506119, 0.03270197753998928, -0.024468790625488932, -0.013766788678788921, -0.06720034963974485, 0.1549086249248897, 0.3511596176114569, 0.021412968090394648, 0.09805872353154416, -0.4024146774848682, -0.10234284926938438, 0.18485519427965144, 0.11142180620965253, 0.051190598691790934, -0.002307665488887124, -0.3087354759024115, 0.11083272706558246, -0.28843644367269716, -0.11476618057775606, -0.16830294163011741, 0.035367894121275355, 0.021169367587057557, -0.20509062577947612, 0.006076099833746146, 0.13018893087055625, 0.12774531674718984, -0.09110023891808829, -0.12272597470841791, -0.0735345898144992, 0.0879005120304788, -0.04601490066568481, -0.051743076517240985, 0.13371213971567625, -0.15898793622590146, -0.2133074803363032, 0.36681300621173096, 0.01333726535706707, -0.17627644987504293, 0.13257418875014637, -0.10106212094925889, -0.20365592288194087, 0.07333365403024888, 0.05043365155231696, 0.12450417817077633, 0.0219916271673311, 0.15714581239906072, -0.1686533090158752, 0.011067704020672132, 0.14609981585356474, 0.006443028120684619, 0.15919180805248312, 0.02803684824441628, 0.01015641317715607, 0.20263030881448307, 0.034267139756305305, -0.040358498275120995, -0.38393754529108, -0.17239495405143626, -0.05199135290657556, 0.12467662665550029, -0.11456629744391582, -0.1749889756029006, 0.40053025578012375, 0.06345193023706798, 0.17053517499401252, 0.17927903801248204, 0.1254570814177519, 0.03715447927952926, 0.17884519256412892, 0.03648244830135188, 0.11369541509862402, 0.26841460406019285, -0.08886653696266343, -0.08993333898677786, -0.15487640048235246, 0.2445314668357463]
|
1,803.0495
|
Steady distribution of the incremental model for bacteria proliferation
|
We study the mathematical properties of a model of cell division structured
by two variables, the size and the size increment, in the case of a linear
growth rate and a self-similar fragmentation kernel. We first show that one can
construct a solution to the related two dimensional eigenproblem associated to
the eigenvalue 1 from a solution of a certain one dimensional fixed point
problem. Then we prove the existence and uniqueness of this fixed point in the
appropriate $\mathrm{L}^1$ weighted space under general hypotheses on the
division rate. Knowing such an eigenfunction proves useful as a first step in
studying the long time asymptotic behaviour of the Cauchy problem.
|
math.AP
|
we study the mathematical properties of a model of cell division structured by two variables the size and the size increment in the case of a linear growth rate and a selfsimilar fragmentation kernel we first show that one can construct a solution to the related two dimensional eigenproblem associated to the eigenvalue 1 from a solution of a certain one dimensional fixed point problem then we prove the existence and uniqueness of this fixed point in the appropriate mathrml1 weighted space under general hypotheses on the division rate knowing such an eigenfunction proves useful as a first step in studying the long time asymptotic behaviour of the cauchy problem
|
[['we', 'study', 'the', 'mathematical', 'properties', 'of', 'a', 'model', 'of', 'cell', 'division', 'structured', 'by', 'two', 'variables', 'the', 'size', 'and', 'the', 'size', 'increment', 'in', 'the', 'case', 'of', 'a', 'linear', 'growth', 'rate', 'and', 'a', 'selfsimilar', 'fragmentation', 'kernel', 'we', 'first', 'show', 'that', 'one', 'can', 'construct', 'a', 'solution', 'to', 'the', 'related', 'two', 'dimensional', 'eigenproblem', 'associated', 'to', 'the', 'eigenvalue', '1', 'from', 'a', 'solution', 'of', 'a', 'certain', 'one', 'dimensional', 'fixed', 'point', 'problem', 'then', 'we', 'prove', 'the', 'existence', 'and', 'uniqueness', 'of', 'this', 'fixed', 'point', 'in', 'the', 'appropriate', 'mathrml1', 'weighted', 'space', 'under', 'general', 'hypotheses', 'on', 'the', 'division', 'rate', 'knowing', 'such', 'an', 'eigenfunction', 'proves', 'useful', 'as', 'a', 'first', 'step', 'in', 'studying', 'the', 'long', 'time', 'asymptotic', 'behaviour', 'of', 'the', 'cauchy', 'problem']]
|
[-0.13563857330855997, 0.05075083273497347, -0.1048212980851531, 0.07126083309148354, -0.03873609316704625, -0.08958854747682132, 0.04729750586874698, 0.30974854544567115, -0.33856698460876944, -0.1756938204761933, 0.17132980597988617, -0.23054956712929361, -0.15670744472140954, 0.16666521355298095, -0.03543039753779092, 0.08339122894050723, 0.05142431724393232, 0.0749220309779048, -0.05609813141424886, -0.2293221663090993, 0.36073261602062057, 0.012731750957159834, 0.2636953798038038, 0.014482375426450745, 0.12682351128790867, 0.012501534502106634, -0.0183268641289694, 0.025476518006392078, -0.1569921030052435, 0.0915929776595228, 0.2327947535128756, 0.12038030130788684, 0.3363028429871933, -0.39283819398419423, -0.18586932330138303, 0.1449700398201292, 0.13056755641062576, 0.09096552387980575, -0.04866307130908932, -0.2095308749238029, 0.10308311904187907, -0.12201527148823846, -0.2124394900504161, -0.005550822084346278, 0.012810524177356538, 0.025963029570729386, -0.3126699318410829, 0.06755487798099322, 0.10364463062353686, 0.02377543528140946, -0.12001611321148548, -0.08430235205451027, 0.019433338413099674, 0.12172117907638577, 0.06091145052553409, -0.019339622237550265, 0.04981845090673728, -0.11369960076051278, -0.10332402159798551, 0.3624977018726482, -0.0658037099817937, -0.249961347353052, 0.18012967705726624, -0.1611439678140662, -0.1380730028285391, 0.09715556044724177, 0.17829513484612108, 0.14528802346692166, -0.13040569477121938, 0.10518319126567803, -0.08299444555728273, 0.16182878019383432, 0.12027759033001283, -0.01260509015304375, 0.1562318206383762, 0.17999149190939284, 0.11898072357712822, 0.17540482958270745, -0.05397187748511152, -0.10899785015393387, -0.33052277890542014, -0.1913585582218895, -0.1901179930872538, 0.11012778762219981, -0.1557473175858666, -0.18110200463878837, 0.42228592931800946, 0.10126455881823362, 0.23530652336776256, 0.08003208705816757, 0.23503611533140595, 0.15945803654189644, 0.007774975354021245, 0.06670327287336641, 0.1467232071371241, 0.10854502578308298, 0.06878233049488203, -0.22030789821451022, 0.041722525224428285, 0.14205305760895665]
|
1,803.04951
|
Topological protection can arise from thermal fluctuations and
interactions
|
Topological quantum and classical materials can exhibit robust properties
that are protected against disorder, for example for noninteracting particles
and linear waves. Here, we demonstrate how to construct topologically protected
states that arise from the combination of strong interactions and thermal
fluctuations inherent to soft materials or miniaturized mechanical structures.
Specifically, we consider fluctuating lines under tension (e.g., polymer or
vortex lines), subject to a class of spatially modulated substrate potentials.
At equilibrium, the lines acquire a collective tilt proportional to an integer
topological invariant called the Chern number. This quantized tilt is robust
against substrate disorder, as verified by classical Langevin dynamics
simulations. This robustness arises because excitations in this system of
thermally fluctuating lines are gapped by virtue of inter-line interactions. We
establish the topological underpinning of this pattern via a mapping that we
develop between the interacting-lines system and a hitherto unexplored
generalization of Thouless pumping to imaginary time. Our work points to a new
class of classical topological phenomena in which the topological signature
manifests itself in a structural property observed at finite temperature rather
than a transport measurement.
|
cond-mat.soft
|
topological quantum and classical materials can exhibit robust properties that are protected against disorder for example for noninteracting particles and linear waves here we demonstrate how to construct topologically protected states that arise from the combination of strong interactions and thermal fluctuations inherent to soft materials or miniaturized mechanical structures specifically we consider fluctuating lines under tension eg polymer or vortex lines subject to a class of spatially modulated substrate potentials at equilibrium the lines acquire a collective tilt proportional to an integer topological invariant called the chern number this quantized tilt is robust against substrate disorder as verified by classical langevin dynamics simulations this robustness arises because excitations in this system of thermally fluctuating lines are gapped by virtue of interline interactions we establish the topological underpinning of this pattern via a mapping that we develop between the interactinglines system and a hitherto unexplored generalization of thouless pumping to imaginary time our work points to a new class of classical topological phenomena in which the topological signature manifests itself in a structural property observed at finite temperature rather than a transport measurement
|
[['topological', 'quantum', 'and', 'classical', 'materials', 'can', 'exhibit', 'robust', 'properties', 'that', 'are', 'protected', 'against', 'disorder', 'for', 'example', 'for', 'noninteracting', 'particles', 'and', 'linear', 'waves', 'here', 'we', 'demonstrate', 'how', 'to', 'construct', 'topologically', 'protected', 'states', 'that', 'arise', 'from', 'the', 'combination', 'of', 'strong', 'interactions', 'and', 'thermal', 'fluctuations', 'inherent', 'to', 'soft', 'materials', 'or', 'miniaturized', 'mechanical', 'structures', 'specifically', 'we', 'consider', 'fluctuating', 'lines', 'under', 'tension', 'eg', 'polymer', 'or', 'vortex', 'lines', 'subject', 'to', 'a', 'class', 'of', 'spatially', 'modulated', 'substrate', 'potentials', 'at', 'equilibrium', 'the', 'lines', 'acquire', 'a', 'collective', 'tilt', 'proportional', 'to', 'an', 'integer', 'topological', 'invariant', 'called', 'the', 'chern', 'number', 'this', 'quantized', 'tilt', 'is', 'robust', 'against', 'substrate', 'disorder', 'as', 'verified', 'by', 'classical', 'langevin', 'dynamics', 'simulations', 'this', 'robustness', 'arises', 'because', 'excitations', 'in', 'this', 'system', 'of', 'thermally', 'fluctuating', 'lines', 'are', 'gapped', 'by', 'virtue', 'of', 'interline', 'interactions', 'we', 'establish', 'the', 'topological', 'underpinning', 'of', 'this', 'pattern', 'via', 'a', 'mapping', 'that', 'we', 'develop', 'between', 'the', 'interactinglines', 'system', 'and', 'a', 'hitherto', 'unexplored', 'generalization', 'of', 'thouless', 'pumping', 'to', 'imaginary', 'time', 'our', 'work', 'points', 'to', 'a', 'new', 'class', 'of', 'classical', 'topological', 'phenomena', 'in', 'which', 'the', 'topological', 'signature', 'manifests', 'itself', 'in', 'a', 'structural', 'property', 'observed', 'at', 'finite', 'temperature', 'rather', 'than', 'a', 'transport', 'measurement']]
|
[-0.20095587429330827, 0.23223691792708662, -0.07927558980280902, 0.040753023990603925, -0.06427352858712426, -0.18714310519734992, 0.05462736104087965, 0.34242555952456954, -0.3071948659048508, -0.265057804891942, 0.03584242246502622, -0.27997312271087377, -0.19475717508172677, 0.15422547696884925, -0.03451220942712338, 0.0378749808178227, -0.02454929432580964, -0.0686287698284774, -0.04884191220216862, -0.15081388281740166, 0.3058208412219576, 0.015300901982150358, 0.31585783378354143, 0.05044435301845494, 0.06819871632934926, -0.022295545352300487, 0.0589573034724978, 0.07348734102529156, -0.1306127740529089, 0.06378812236797095, 0.23253115472271219, -0.05065857482163215, 0.20701652185244301, -0.44847214355000425, -0.24767689032040044, 0.0930786173046147, 0.1258960906943085, 0.16074791699993313, -0.07368331626032039, -0.3048483301363476, 0.07850359630090399, -0.12348413517299507, -0.15334649127652192, -0.12400005306859224, 0.01903559152384872, -0.029616103996266865, -0.21330268293680563, 0.08642360618962282, 0.0698718516729199, 0.11217377696911981, -0.04715210561288996, -0.02842823767927117, -0.06394310042922191, 0.07601180349049352, 0.03252550157280844, -0.009571583596170767, 0.1712667643077221, -0.14334622674025493, -0.13802469031281442, 0.39105121945900906, -0.06874714481715014, -0.1898243000761575, 0.22821674208607073, -0.09904478572738859, -0.11021976698583995, 0.164264680400675, 0.14273131290254962, 0.09479339644926918, -0.09725026043827881, 0.04742072540038562, -0.01583636325405358, 0.17912508297972585, 0.014814323443755672, 0.10894532147846134, 0.27619437357042353, 0.11632094382830374, 0.0736648233039407, 0.21051778222541684, -0.0706079450517811, -0.11762812454253435, -0.2764531795068511, -0.14726397363407598, -0.22346893266344872, 0.09505475329613866, -0.01929171053196334, -0.22722316340922, 0.4211950475007173, 0.1539626828152405, 0.17922508338025572, 0.02361330899325517, 0.2603956836980645, 0.10626736929855095, 0.05050092876970686, 0.026134090147564536, 0.24165676057000982, 0.14907853015452868, 0.08032012939872732, -0.25024935574165885, 0.04502995576611003, 0.04999596070866663]
|
1,803.04952
|
Strong-field control and enhancement of chiral response in bi-elliptical
high-order harmonic generation: an analytical model
|
The generation of high-order harmonics in a medium of chiral molecules driven
by intense bi-elliptical laser fields can lead to strong chiroptical response
in a broad range of harmonic numbers and ellipticities [D. Ayuso et al, J.
Phys. B 51, 06LT01 (2018)]. Here we present a comprehensive analytical model
that can describe the most relevant features arising in the high-order harmonic
spectra of chiral molecules driven by strong bi-elliptical fields. Our model
recovers the physical picture underlying chiral high-order harmonic generation
based on ultrafast chiral hole motion and identifies the rotationally invariant
molecular pseudoscalars responsible for chiral dynamics. Using the chiral
molecule propylene oxide as an example, we show that one can control and
enhance the chiral response in bi-elliptical high-order harmonic generation by
tailoring the driving field, in particular by tuning its frequency, intensity
and ellipticity, exploiting a suppression mechanism of achiral background based
on the linear Stark effect.
|
physics.optics
|
the generation of highorder harmonics in a medium of chiral molecules driven by intense bielliptical laser fields can lead to strong chiroptical response in a broad range of harmonic numbers and ellipticities d ayuso et al j phys b 51 06lt01 2018 here we present a comprehensive analytical model that can describe the most relevant features arising in the highorder harmonic spectra of chiral molecules driven by strong bielliptical fields our model recovers the physical picture underlying chiral highorder harmonic generation based on ultrafast chiral hole motion and identifies the rotationally invariant molecular pseudoscalars responsible for chiral dynamics using the chiral molecule propylene oxide as an example we show that one can control and enhance the chiral response in bielliptical highorder harmonic generation by tailoring the driving field in particular by tuning its frequency intensity and ellipticity exploiting a suppression mechanism of achiral background based on the linear stark effect
|
[['the', 'generation', 'of', 'highorder', 'harmonics', 'in', 'a', 'medium', 'of', 'chiral', 'molecules', 'driven', 'by', 'intense', 'bielliptical', 'laser', 'fields', 'can', 'lead', 'to', 'strong', 'chiroptical', 'response', 'in', 'a', 'broad', 'range', 'of', 'harmonic', 'numbers', 'and', 'ellipticities', 'd', 'ayuso', 'et', 'al', 'j', 'phys', 'b', '51', '06lt01', '2018', 'here', 'we', 'present', 'a', 'comprehensive', 'analytical', 'model', 'that', 'can', 'describe', 'the', 'most', 'relevant', 'features', 'arising', 'in', 'the', 'highorder', 'harmonic', 'spectra', 'of', 'chiral', 'molecules', 'driven', 'by', 'strong', 'bielliptical', 'fields', 'our', 'model', 'recovers', 'the', 'physical', 'picture', 'underlying', 'chiral', 'highorder', 'harmonic', 'generation', 'based', 'on', 'ultrafast', 'chiral', 'hole', 'motion', 'and', 'identifies', 'the', 'rotationally', 'invariant', 'molecular', 'pseudoscalars', 'responsible', 'for', 'chiral', 'dynamics', 'using', 'the', 'chiral', 'molecule', 'propylene', 'oxide', 'as', 'an', 'example', 'we', 'show', 'that', 'one', 'can', 'control', 'and', 'enhance', 'the', 'chiral', 'response', 'in', 'bielliptical', 'highorder', 'harmonic', 'generation', 'by', 'tailoring', 'the', 'driving', 'field', 'in', 'particular', 'by', 'tuning', 'its', 'frequency', 'intensity', 'and', 'ellipticity', 'exploiting', 'a', 'suppression', 'mechanism', 'of', 'achiral', 'background', 'based', 'on', 'the', 'linear', 'stark', 'effect']]
|
[-0.1481963717126967, 0.19546010553598092, -0.03186877062418372, -0.01061584973531599, -0.06116278392791345, -0.095496261898252, -0.00755195999423646, 0.3976094200200326, -0.20900493071530946, -0.26575908441146884, -0.013385617448728078, -0.22674396472693598, -0.17619823824261893, 0.17930698059058772, 0.010432075932496102, 0.04862613770269122, -0.04411764832440059, -0.05916028982028365, 0.016383017340951878, -0.13339702999911499, 0.2670699521093755, 0.04335730823092761, 0.2791913342137107, 0.06773562617584232, 0.07542134233202936, 0.013723157969227916, 0.002963231777382159, -0.03803096393538589, -0.0988001315387452, 0.12863243162329938, 0.1996823944311866, -0.027877537665787985, 0.2218932738715749, -0.45486770920782676, -0.2546320932325781, 0.0376412281357507, 0.10882685132280646, 0.17379441650936733, -0.11417106277224014, -0.2966973360885891, 0.031598676939973154, -0.14916158786572115, -0.15911501484948234, -0.15991517395485896, 0.020993784228119546, 0.054574702523422204, -0.3069007114909992, 0.12039912758218879, 0.10077811618228569, 0.09492023119300201, -0.04617890742107143, -0.07390525673100776, -0.06122496567754629, 0.04602502808729942, -0.00805096435392074, 0.05306734873699276, 0.17412721056757005, -0.15815501039331728, -0.14177994066975205, 0.42095840660024536, -0.14694539322108785, -0.14661020037365724, 0.16454480726561332, -0.1593082162954316, -0.11446090633005558, 0.15143784022625736, 0.18893495365675236, 0.14625590767812086, -0.1308612063034702, 0.06373537691605806, -0.012710553263565776, 0.20396200816754276, 0.10348417317043247, 0.05697078927344567, 0.2693486306879267, 0.13056164661365738, -0.0029641114288588635, 0.12538467261097017, -0.1104335345003779, -0.08156202255151977, -0.2756311747000074, -0.07503177223151324, -0.18852942062673989, 0.0516034082707798, -0.034190874392201344, -0.1054586307947977, 0.4280887933611568, 0.1376753553427202, 0.1637434434913401, -0.0668603229978298, 0.2765035747638526, 0.13473922783836118, 0.03783413238636205, 0.003949444904621388, 0.28126689676207967, 0.19675162695096554, 0.08621982761935608, -0.2924081478614008, -0.013474219651716584, 0.08163489632047335]
|
1,803.04953
|
Automatic Pixelwise Object Labeling for Aerial Imagery Using Stacked
U-Nets
|
Automation of objects labeling in aerial imagery is a computer vision task
with numerous practical applications. Fields like energy exploration require an
automated method to process a continuous stream of imagery on a daily basis. In
this paper we propose a pipeline to tackle this problem using a stack of
convolutional neural networks (U-Net architecture) arranged end-to-end. Each
network works as post-processor to the previous one. Our model outperforms
current state-of-the-art on two different datasets: Inria Aerial Image Labeling
dataset and Massachusetts Buildings dataset each with different characteristics
such as spatial resolution, object shapes and scales. Moreover, we
experimentally validate computation time savings by processing sub-sampled
images and later upsampling pixelwise labeling. These savings come at a
negligible degradation in segmentation quality. Though the conducted
experiments in this paper cover only aerial imagery, the technique presented is
general and can handle other types of images.
|
cs.CV
|
automation of objects labeling in aerial imagery is a computer vision task with numerous practical applications fields like energy exploration require an automated method to process a continuous stream of imagery on a daily basis in this paper we propose a pipeline to tackle this problem using a stack of convolutional neural networks unet architecture arranged endtoend each network works as postprocessor to the previous one our model outperforms current stateoftheart on two different datasets inria aerial image labeling dataset and massachusetts buildings dataset each with different characteristics such as spatial resolution object shapes and scales moreover we experimentally validate computation time savings by processing subsampled images and later upsampling pixelwise labeling these savings come at a negligible degradation in segmentation quality though the conducted experiments in this paper cover only aerial imagery the technique presented is general and can handle other types of images
|
[['automation', 'of', 'objects', 'labeling', 'in', 'aerial', 'imagery', 'is', 'a', 'computer', 'vision', 'task', 'with', 'numerous', 'practical', 'applications', 'fields', 'like', 'energy', 'exploration', 'require', 'an', 'automated', 'method', 'to', 'process', 'a', 'continuous', 'stream', 'of', 'imagery', 'on', 'a', 'daily', 'basis', 'in', 'this', 'paper', 'we', 'propose', 'a', 'pipeline', 'to', 'tackle', 'this', 'problem', 'using', 'a', 'stack', 'of', 'convolutional', 'neural', 'networks', 'unet', 'architecture', 'arranged', 'endtoend', 'each', 'network', 'works', 'as', 'postprocessor', 'to', 'the', 'previous', 'one', 'our', 'model', 'outperforms', 'current', 'stateoftheart', 'on', 'two', 'different', 'datasets', 'inria', 'aerial', 'image', 'labeling', 'dataset', 'and', 'massachusetts', 'buildings', 'dataset', 'each', 'with', 'different', 'characteristics', 'such', 'as', 'spatial', 'resolution', 'object', 'shapes', 'and', 'scales', 'moreover', 'we', 'experimentally', 'validate', 'computation', 'time', 'savings', 'by', 'processing', 'subsampled', 'images', 'and', 'later', 'upsampling', 'pixelwise', 'labeling', 'these', 'savings', 'come', 'at', 'a', 'negligible', 'degradation', 'in', 'segmentation', 'quality', 'though', 'the', 'conducted', 'experiments', 'in', 'this', 'paper', 'cover', 'only', 'aerial', 'imagery', 'the', 'technique', 'presented', 'is', 'general', 'and', 'can', 'handle', 'other', 'types', 'of', 'images']]
|
[-0.08709512041110931, -0.03755580320671313, -0.05902766142490095, 0.031035273769884953, -0.09208989378450246, -0.15751590052748035, 0.003966620444833976, 0.5021122207415515, -0.25045704526890966, -0.3933808327877316, 0.10605807422563948, -0.24969335651860156, -0.1791891525917012, 0.22751429814299376, -0.20856804082085828, 0.08577406653243214, 0.2137038683839913, 0.0017196383519933142, -0.029039835525227004, -0.2817581759251911, 0.238374544328464, 0.046002977847218, 0.3654094345225342, -0.0025561530945886826, 0.14825754202902316, -0.04786049843623287, -0.04205962364353111, -0.00881497110159875, -0.029489668776634437, 0.17557616801209877, 0.3532405861155612, 0.17456007733186385, 0.29837580063412417, -0.44716650563581234, -0.26267705563162774, 0.09010136112378075, 0.162507200305318, 0.07182860090648194, -0.05159564746447421, -0.35996861321980067, 0.06312660770490766, -0.18964635803412389, 0.03568405324978561, -0.09736001712173738, -0.007394341104824481, -0.020394085264154548, -0.27078101624702583, 0.0166383584559863, 0.0035334204949823947, 0.11619950442189543, -0.056018344349838024, -0.09973437168298226, 0.03250693321260142, 0.20219324369240424, -0.019405928428549768, 0.07111957553485088, 0.16227148561256713, -0.20743232904612247, -0.16427506748265747, 0.3816757579301966, -0.016545714431538665, -0.20532886003111972, 0.20672051641961625, -0.020134932003465705, -0.1926485994573811, 0.11365739310738342, 0.24677251862554714, 0.13739986322370581, -0.14612736967633125, -0.006696226328996749, -0.06414976717326148, 0.18923162605998844, 0.09476400252255, -0.027114896906302952, 0.1572131448232665, 0.3050931483892531, 0.05684208103319116, 0.15277401866302986, -0.19992653927605214, -0.006107734718584809, -0.19168922419434992, -0.09952803925643193, -0.21622100036976666, -0.04045985778472547, -0.0914550887513103, -0.11338795174298616, 0.4003860630544609, 0.24749843852658723, 0.19119553036730866, 0.09947917379824252, 0.4407197186787581, -0.03470773037988693, 0.13242907863399336, 0.047013571565109706, 0.10585732851312937, -0.04518122176352712, 0.1911461713394664, -0.13025934793825808, 0.0035964324331746018, 0.06275700904139928]
|
1,803.04954
|
A Cure for numerical shock instability in HLLC Riemann solver using
antidiffusion control
|
Various forms of numerical shock instabilities are known to plague many
contact and shear preserving approximate Riemann solvers, including the popular
Harten-Lax-van Leer with Contact (HLLC) scheme, during high speed flow
simulations. In this paper we propose a simple and inexpensive novel strategy
to prevent the HLLC scheme from developing such spurious solutions without
compromising on its linear wave resolution ability. The cure is primarily based
on a reinterpretation of the HLLC scheme as a combination of its well-known
diffusive counterpart, the HLL scheme, and an antidiffusive term responsible
for its accuracy on linear wavefields. In our study, a linear analysis of this
alternate form indicates that shock instability in the HLLC scheme could be
triggered due to the unwanted activation of the antidiffusive terms of its mass
and interface-normal flux components on interfaces that are not aligned with
the shock front. This inadvertent activation results in weakening of the
favourable dissipation provided by its inherent HLL scheme and causes
unphysical mass flux variations along the shock front. To mitigate this, we
propose a modified HLLC scheme that employs a simple differentiable pressure
based multidimensional shock sensor to achieve smooth control of these critical
antidiffusive terms near shocks. Using a linear perturbation analysis and a
matrix based stability analysis, we establish that the resulting scheme, called
HLLC-ADC (Anti-Diffusion Control), is shock stable over a wide range of
freestream Mach numbers. Results from standard numerical test cases demonstrate
that the HLLC-ADC scheme is indeed free from the most common manifestations of
shock instability including the Carbuncle phenomenon without significant loss
of accuracy on shear dominated viscous flows.
|
physics.comp-ph
|
various forms of numerical shock instabilities are known to plague many contact and shear preserving approximate riemann solvers including the popular hartenlaxvan leer with contact hllc scheme during high speed flow simulations in this paper we propose a simple and inexpensive novel strategy to prevent the hllc scheme from developing such spurious solutions without compromising on its linear wave resolution ability the cure is primarily based on a reinterpretation of the hllc scheme as a combination of its wellknown diffusive counterpart the hll scheme and an antidiffusive term responsible for its accuracy on linear wavefields in our study a linear analysis of this alternate form indicates that shock instability in the hllc scheme could be triggered due to the unwanted activation of the antidiffusive terms of its mass and interfacenormal flux components on interfaces that are not aligned with the shock front this inadvertent activation results in weakening of the favourable dissipation provided by its inherent hll scheme and causes unphysical mass flux variations along the shock front to mitigate this we propose a modified hllc scheme that employs a simple differentiable pressure based multidimensional shock sensor to achieve smooth control of these critical antidiffusive terms near shocks using a linear perturbation analysis and a matrix based stability analysis we establish that the resulting scheme called hllcadc antidiffusion control is shock stable over a wide range of freestream mach numbers results from standard numerical test cases demonstrate that the hllcadc scheme is indeed free from the most common manifestations of shock instability including the carbuncle phenomenon without significant loss of accuracy on shear dominated viscous flows
|
[['various', 'forms', 'of', 'numerical', 'shock', 'instabilities', 'are', 'known', 'to', 'plague', 'many', 'contact', 'and', 'shear', 'preserving', 'approximate', 'riemann', 'solvers', 'including', 'the', 'popular', 'hartenlaxvan', 'leer', 'with', 'contact', 'hllc', 'scheme', 'during', 'high', 'speed', 'flow', 'simulations', 'in', 'this', 'paper', 'we', 'propose', 'a', 'simple', 'and', 'inexpensive', 'novel', 'strategy', 'to', 'prevent', 'the', 'hllc', 'scheme', 'from', 'developing', 'such', 'spurious', 'solutions', 'without', 'compromising', 'on', 'its', 'linear', 'wave', 'resolution', 'ability', 'the', 'cure', 'is', 'primarily', 'based', 'on', 'a', 'reinterpretation', 'of', 'the', 'hllc', 'scheme', 'as', 'a', 'combination', 'of', 'its', 'wellknown', 'diffusive', 'counterpart', 'the', 'hll', 'scheme', 'and', 'an', 'antidiffusive', 'term', 'responsible', 'for', 'its', 'accuracy', 'on', 'linear', 'wavefields', 'in', 'our', 'study', 'a', 'linear', 'analysis', 'of', 'this', 'alternate', 'form', 'indicates', 'that', 'shock', 'instability', 'in', 'the', 'hllc', 'scheme', 'could', 'be', 'triggered', 'due', 'to', 'the', 'unwanted', 'activation', 'of', 'the', 'antidiffusive', 'terms', 'of', 'its', 'mass', 'and', 'interfacenormal', 'flux', 'components', 'on', 'interfaces', 'that', 'are', 'not', 'aligned', 'with', 'the', 'shock', 'front', 'this', 'inadvertent', 'activation', 'results', 'in', 'weakening', 'of', 'the', 'favourable', 'dissipation', 'provided', 'by', 'its', 'inherent', 'hll', 'scheme', 'and', 'causes', 'unphysical', 'mass', 'flux', 'variations', 'along', 'the', 'shock', 'front', 'to', 'mitigate', 'this', 'we', 'propose', 'a', 'modified', 'hllc', 'scheme', 'that', 'employs', 'a', 'simple', 'differentiable', 'pressure', 'based', 'multidimensional', 'shock', 'sensor', 'to', 'achieve', 'smooth', 'control', 'of', 'these', 'critical', 'antidiffusive', 'terms', 'near', 'shocks', 'using', 'a', 'linear', 'perturbation', 'analysis', 'and', 'a', 'matrix', 'based', 'stability', 'analysis', 'we', 'establish', 'that', 'the', 'resulting', 'scheme', 'called', 'hllcadc', 'antidiffusion', 'control', 'is', 'shock', 'stable', 'over', 'a', 'wide', 'range', 'of', 'freestream', 'mach', 'numbers', 'results', 'from', 'standard', 'numerical', 'test', 'cases', 'demonstrate', 'that', 'the', 'hllcadc', 'scheme', 'is', 'indeed', 'free', 'from', 'the', 'most', 'common', 'manifestations', 'of', 'shock', 'instability', 'including', 'the', 'carbuncle', 'phenomenon', 'without', 'significant', 'loss', 'of', 'accuracy', 'on', 'shear', 'dominated', 'viscous', 'flows']]
|
[-0.16280423805401784, 0.05119870138712477, -0.08291147489493762, 0.053530967012207116, -0.10277126249485426, -0.12357350264431576, 0.037919458099454996, 0.33471425022122525, -0.2839371329213284, -0.27114798190220907, 0.11135165644065963, -0.21894643017836268, -0.152549377221175, 0.24197369460954893, -0.05404810306612586, 0.0743251806773518, 0.07630439870592433, -0.04705105250623403, -0.0819540366356902, -0.18307209192923918, 0.3084184065347842, 0.0820197468804339, 0.28318845365858664, 0.08519458838078077, 0.15608767559397754, -0.03931780846589404, -0.0330283721721246, 0.026164165572993385, -0.10022328553184935, 0.0686102478548941, 0.19301315548319808, 0.06153290469585405, 0.29187563355983775, -0.45141953281604974, -0.2687397225128713, 0.04286654088194677, 0.14107877597612942, 0.0963743474607147, -0.05846625742477723, -0.24210497392199848, 0.09735061285464879, -0.1823330941661385, -0.1499354379949206, -0.06637540807462379, -0.05389178575179451, 0.05585888411208789, -0.2592017304226614, 0.14012916160910302, 0.05870322559290909, 0.02808325882901937, -0.04217830751606479, -0.05738788451415136, -0.028555568648916545, 0.030809957141449726, 0.08363840252138008, 0.04269047720869472, 0.1275933152631265, -0.13429073009377934, -0.07977101149766957, 0.39946065630813343, -0.07856608555429109, -0.20633957385254392, 0.23827129866867663, -0.07578588880093046, -0.07032377800298678, 0.21293497544858506, 0.18633333605198685, 0.11146703778373028, -0.09446683323485316, 0.02292306528793216, 0.0022437326777075724, 0.14223573778086684, 0.08666835472115206, -0.016747729645416976, 0.17301949474627698, 0.16770065689331962, 0.06729291716920625, 0.11284193961691649, -0.11628684862486942, -0.08316163664874922, -0.3183092906262846, -0.13245245281734394, -0.13385844706759537, -0.006508560654018499, -0.10649313300703263, -0.1999844955492892, 0.3614615546051826, 0.16434901215741587, 0.14734801020740598, 0.04005321176163144, 0.3401683220859376, 0.13537185131563334, 0.056124269740988886, 0.11241964173074741, 0.24154896565496978, 0.13026835250370772, 0.0895356897963211, -0.27043793778760294, 0.0750806639130323, 0.09611497120046457]
|
1,803.04955
|
Particle-in-cell studies of fast-ion slowing-down rates in cool tenuous
magnetized plasma
|
We report on 3D-3V particle-in-cell simulations of fast-ion energy-loss rates
in cold, weakly-magnetized, weakly-coupled plasma where the electron
gyroradius, $\rho_{e}$, is comparable to or less than the Debye length,
$\lambda_{De}$, and the fast-ion velocity exceeds the electron thermal
velocity, a regime in which the electron response may be impeded. These
simulations use explicit algorithms, spatially resolve $\rho_{e}$ and
$\lambda_{De}$, and temporally resolve the electron cyclotron and plasma
frequencies. For mono-energetic dilute fast ions with isotropic velocity
distributions, these scaling studies of the slowing-down time, $\tau_{s}$,
\versus fast-ion charge are in agreement with unmagnetized slowing-down theory;
with an applied magnetic field, no consistent anisotropy between $\tau_{s}$ in
the cross-field and field-parallel directions could be resolved. Scaling the
fast-ion charge is confirmed as a viable way to reduce the required
computational time for each simulation. The implications of these slowing down
processes are described for one magnetic-confinement fusion concept, the small,
advanced-fuel, field-reversed configuration device.
|
physics.plasm-ph
|
we report on 3d3v particleincell simulations of fastion energyloss rates in cold weaklymagnetized weaklycoupled plasma where the electron gyroradius rho_e is comparable to or less than the debye length lambda_de and the fastion velocity exceeds the electron thermal velocity a regime in which the electron response may be impeded these simulations use explicit algorithms spatially resolve rho_e and lambda_de and temporally resolve the electron cyclotron and plasma frequencies for monoenergetic dilute fast ions with isotropic velocity distributions these scaling studies of the slowingdown time tau_s versus fastion charge are in agreement with unmagnetized slowingdown theory with an applied magnetic field no consistent anisotropy between tau_s in the crossfield and fieldparallel directions could be resolved scaling the fastion charge is confirmed as a viable way to reduce the required computational time for each simulation the implications of these slowing down processes are described for one magneticconfinement fusion concept the small advancedfuel fieldreversed configuration device
|
[['we', 'report', 'on', '3d3v', 'particleincell', 'simulations', 'of', 'fastion', 'energyloss', 'rates', 'in', 'cold', 'weaklymagnetized', 'weaklycoupled', 'plasma', 'where', 'the', 'electron', 'gyroradius', 'rho_e', 'is', 'comparable', 'to', 'or', 'less', 'than', 'the', 'debye', 'length', 'lambda_de', 'and', 'the', 'fastion', 'velocity', 'exceeds', 'the', 'electron', 'thermal', 'velocity', 'a', 'regime', 'in', 'which', 'the', 'electron', 'response', 'may', 'be', 'impeded', 'these', 'simulations', 'use', 'explicit', 'algorithms', 'spatially', 'resolve', 'rho_e', 'and', 'lambda_de', 'and', 'temporally', 'resolve', 'the', 'electron', 'cyclotron', 'and', 'plasma', 'frequencies', 'for', 'monoenergetic', 'dilute', 'fast', 'ions', 'with', 'isotropic', 'velocity', 'distributions', 'these', 'scaling', 'studies', 'of', 'the', 'slowingdown', 'time', 'tau_s', 'versus', 'fastion', 'charge', 'are', 'in', 'agreement', 'with', 'unmagnetized', 'slowingdown', 'theory', 'with', 'an', 'applied', 'magnetic', 'field', 'no', 'consistent', 'anisotropy', 'between', 'tau_s', 'in', 'the', 'crossfield', 'and', 'fieldparallel', 'directions', 'could', 'be', 'resolved', 'scaling', 'the', 'fastion', 'charge', 'is', 'confirmed', 'as', 'a', 'viable', 'way', 'to', 'reduce', 'the', 'required', 'computational', 'time', 'for', 'each', 'simulation', 'the', 'implications', 'of', 'these', 'slowing', 'down', 'processes', 'are', 'described', 'for', 'one', 'magneticconfinement', 'fusion', 'concept', 'the', 'small', 'advancedfuel', 'fieldreversed', 'configuration', 'device']]
|
[-0.1115165950116199, 0.2744709458180104, -0.02865558822859863, 0.07872879297907562, -0.010240743436090844, -0.13732627879117468, -0.018178969810833223, 0.40232164857565966, -0.2304666582586881, -0.2749955292774279, 0.0112502701821014, -0.2640056880466689, 0.03203034989143673, 0.24778963943773355, 0.043524986134511175, 0.04243360369123126, 0.02026263015623523, -0.05492485649148492, -0.030552644925927252, -0.1260141767749079, 0.20776672402127205, 0.15678918130211777, 0.2832956481296079, 0.07019453230742856, 0.06277351089336566, -0.03760806909658162, -0.013907336783105214, 0.05507742559022613, -0.1665458708033073, 0.002516267449735958, 0.21744074691454635, -0.02656920807203278, 0.22398815486935506, -0.4866531097864744, -0.2422355018513228, 0.02305239925963657, 0.21367200698832198, 0.10861486374434255, -0.05755519776644896, -0.2043726935899988, 0.023605303295832863, -0.14529900813910276, -0.17122381393442324, -0.03213726864027864, 0.0310871404002874, 0.06007264852278719, -0.28914511760108563, 0.18729145486998422, -0.006301952725104792, 0.038855325118148404, -0.09835580993852713, -0.09190574551528123, 0.0018517300333386582, 0.030885652053831637, 0.08638242394111953, 0.08120230149162173, 0.20720623774870642, -0.10821630037772641, -0.08068682273580252, 0.36017094350934614, -0.03809695249076053, -0.1587328055420106, 0.19696044503852086, -0.2308677702584598, -0.054305027205325464, 0.20150693017058074, 0.11677010499529149, 0.09558724667754416, -0.11133824921776786, 0.01850818507921902, -0.02007445861511913, 0.19765574113606768, 0.10046584508381784, 0.044478050940453706, 0.2328799994578922, 0.16884456709407172, 0.007892240678254319, 0.04770905335164188, -0.15472628070825808, -0.05594403238654578, -0.23598176826673903, -0.13140628716332445, -0.1546129190124032, 0.05719893526341031, -0.08510639590751548, -0.13185436445852056, 0.34361279498797986, 0.17009094360171156, 0.1545272510003614, -0.010756724566913602, 0.31525658434992165, 0.14905629624033617, 0.023616601149306485, 0.1206580383372248, 0.23172085388949581, 0.18101689036044072, 0.13183516804067613, -0.32389809869499386, 0.048127657462732475, 0.01969342491754919]
|
1,803.04956
|
Geometric convergence results for closed minimal surfaces via bubbling
analysis
|
We present some geometric applications, of global character, of the bubbling
analysis developed by Buzano and Sharp for closed minimal surfaces, obtaining
smooth multiplicity one convergence results under upper bounds on the Morse
index and suitable lower bounds on either the genus or the area. For instance,
we show that given any Riemannian metric of positive scalar curvature on the
three-dimensional sphere the class of embedded minimal surfaces of index one
and genus $\gamma$ is sequentially compact for any $\gamma\geq 1$. Furthemore,
we give a quantitative description of how the genus drops as a sequence of
minimal surfaces converges smoothly, with mutiplicity $m\geq 1$, away from
finitely many points where curvature concentration may happen. This result
exploits a sharp estimate on the multiplicity of convergence in terms of the
number of ends of the bubbles that appear in the process.
|
math.DG
|
we present some geometric applications of global character of the bubbling analysis developed by buzano and sharp for closed minimal surfaces obtaining smooth multiplicity one convergence results under upper bounds on the morse index and suitable lower bounds on either the genus or the area for instance we show that given any riemannian metric of positive scalar curvature on the threedimensional sphere the class of embedded minimal surfaces of index one and genus gamma is sequentially compact for any gammageq 1 furthemore we give a quantitative description of how the genus drops as a sequence of minimal surfaces converges smoothly with mutiplicity mgeq 1 away from finitely many points where curvature concentration may happen this result exploits a sharp estimate on the multiplicity of convergence in terms of the number of ends of the bubbles that appear in the process
|
[['we', 'present', 'some', 'geometric', 'applications', 'of', 'global', 'character', 'of', 'the', 'bubbling', 'analysis', 'developed', 'by', 'buzano', 'and', 'sharp', 'for', 'closed', 'minimal', 'surfaces', 'obtaining', 'smooth', 'multiplicity', 'one', 'convergence', 'results', 'under', 'upper', 'bounds', 'on', 'the', 'morse', 'index', 'and', 'suitable', 'lower', 'bounds', 'on', 'either', 'the', 'genus', 'or', 'the', 'area', 'for', 'instance', 'we', 'show', 'that', 'given', 'any', 'riemannian', 'metric', 'of', 'positive', 'scalar', 'curvature', 'on', 'the', 'threedimensional', 'sphere', 'the', 'class', 'of', 'embedded', 'minimal', 'surfaces', 'of', 'index', 'one', 'and', 'genus', 'gamma', 'is', 'sequentially', 'compact', 'for', 'any', 'gammageq', '1', 'furthemore', 'we', 'give', 'a', 'quantitative', 'description', 'of', 'how', 'the', 'genus', 'drops', 'as', 'a', 'sequence', 'of', 'minimal', 'surfaces', 'converges', 'smoothly', 'with', 'mutiplicity', 'mgeq', '1', 'away', 'from', 'finitely', 'many', 'points', 'where', 'curvature', 'concentration', 'may', 'happen', 'this', 'result', 'exploits', 'a', 'sharp', 'estimate', 'on', 'the', 'multiplicity', 'of', 'convergence', 'in', 'terms', 'of', 'the', 'number', 'of', 'ends', 'of', 'the', 'bubbles', 'that', 'appear', 'in', 'the', 'process']]
|
[-0.14646045348888412, 0.11395356658236425, -0.08770126701674337, 0.08105815398863447, -0.039072101878792904, -0.16085967736774318, 0.02233415529242442, 0.3240479591516979, -0.22331927561623266, -0.2718265564616421, 0.12535148718990655, -0.2767425073786444, -0.13842314380604653, 0.25187336741410626, -0.12415265614207056, 0.03139793647456539, 0.05106652440442938, 0.1103681974421195, -0.06995805513730152, -0.2519809650592238, 0.3836176221480044, -0.04851914248797748, 0.2055932100755062, 0.10827047895286701, 0.06787970077527834, -0.015444089953365514, 0.027778971203261144, 0.023251131887165762, -0.228432605040227, 0.1541495947803793, 0.20890775637821757, 0.08081783639709297, 0.21425341562872163, -0.39585825684312864, -0.21744851347749128, 0.18389873392450734, 0.1194017662598899, 0.019711309564869394, -0.07778372589445157, -0.23540708590164888, 0.12793357345349282, -0.062072083735068014, -0.19284821574060287, -0.048581518293123876, 0.001982146505561235, 0.02805991459423475, -0.22505168947424714, 0.04379577697891233, 0.13271013144638202, 0.06682156507916608, -0.05220257419516607, -0.1151483096249348, -0.05401882163429861, 0.12254618150316071, 0.06817479373651839, 0.04536295271388141, 0.10264421539488348, -0.11064148064964055, -0.08085489890239998, 0.30170365442394564, -0.11023836970168481, -0.2405601724540051, 0.16888669693654926, -0.1703747576873133, -0.13614971753169627, 0.17236202814542562, 0.16751059090799028, 0.17292540925789437, -0.04181018659992398, 0.1604256136028813, -0.05342725792350315, 0.14138937982723868, 0.12425666189209807, -0.015656299165470136, 0.15057842537975138, 0.0991754640670989, 0.155920496782901, 0.1416304749453427, -0.07188245386811536, -0.04537784847558188, -0.38549362455340597, -0.21001404722509304, -0.1906639893787156, 0.11560484792337009, -0.18268193226785437, -0.20821175651220486, 0.4040638420516424, 0.020334964139862723, 0.2210568029152082, 0.13094543351744897, 0.25062974680570227, 0.07960865272480405, -0.011956110107544944, 0.11560921515790384, 0.16634150813337878, 0.12549678379797088, 0.00345993385710519, -0.12234595256837473, 0.01592924370113827, 0.1492725817902054]
|
1,803.04957
|
Common anesthetic molecules prefer to partition in liquid disorder phase
domain in a composite multicomponent membrane
|
Despite a vast clinical application of anesthetics, the molecular level of
understanding of general anesthesia is far from our reach. Using atomistic
molecular dynamics simulation, we study the effects of common anesthetics:
ethanol, chloroform and methanol in the fully hydrated symmetric multicomponent
lipid bilayer membrane comprising of an unsaturated
palmitoyl-oleoyl-phosphatidyl-choline (POPC), a saturated
palmitoyl-sphingomyelin (PSM) and cholesterol (Chol) which exhibits phase
coexistence of liquid-ordered (lo) - liquid disordered (ld) phase domains. We
find that the mechanical and physical properties such as the thickness and
rigidity of the membrane are reduced while the lateral expansion of the
membrane is exhibited in presence of anesthetic molecules. Our simulation shows
both lateral and transverse heterogeneity of the anesthetics in the composite
multicomponent lipid membrane. Both ethanol and chloroform partition in the
POPC-rich ld phase domain, while methanol is distributed in both lo-ld phase
domains. Chloroform can penetrate deep into the membrane, while methanol
partitions mostly at the water layer closed to the head-group and ethanol at
the neck of the lipids in the membrane.
|
cond-mat.soft physics.bio-ph
|
despite a vast clinical application of anesthetics the molecular level of understanding of general anesthesia is far from our reach using atomistic molecular dynamics simulation we study the effects of common anesthetics ethanol chloroform and methanol in the fully hydrated symmetric multicomponent lipid bilayer membrane comprising of an unsaturated palmitoyloleoylphosphatidylcholine popc a saturated palmitoylsphingomyelin psm and cholesterol chol which exhibits phase coexistence of liquidordered lo liquid disordered ld phase domains we find that the mechanical and physical properties such as the thickness and rigidity of the membrane are reduced while the lateral expansion of the membrane is exhibited in presence of anesthetic molecules our simulation shows both lateral and transverse heterogeneity of the anesthetics in the composite multicomponent lipid membrane both ethanol and chloroform partition in the popcrich ld phase domain while methanol is distributed in both lold phase domains chloroform can penetrate deep into the membrane while methanol partitions mostly at the water layer closed to the headgroup and ethanol at the neck of the lipids in the membrane
|
[['despite', 'a', 'vast', 'clinical', 'application', 'of', 'anesthetics', 'the', 'molecular', 'level', 'of', 'understanding', 'of', 'general', 'anesthesia', 'is', 'far', 'from', 'our', 'reach', 'using', 'atomistic', 'molecular', 'dynamics', 'simulation', 'we', 'study', 'the', 'effects', 'of', 'common', 'anesthetics', 'ethanol', 'chloroform', 'and', 'methanol', 'in', 'the', 'fully', 'hydrated', 'symmetric', 'multicomponent', 'lipid', 'bilayer', 'membrane', 'comprising', 'of', 'an', 'unsaturated', 'palmitoyloleoylphosphatidylcholine', 'popc', 'a', 'saturated', 'palmitoylsphingomyelin', 'psm', 'and', 'cholesterol', 'chol', 'which', 'exhibits', 'phase', 'coexistence', 'of', 'liquidordered', 'lo', 'liquid', 'disordered', 'ld', 'phase', 'domains', 'we', 'find', 'that', 'the', 'mechanical', 'and', 'physical', 'properties', 'such', 'as', 'the', 'thickness', 'and', 'rigidity', 'of', 'the', 'membrane', 'are', 'reduced', 'while', 'the', 'lateral', 'expansion', 'of', 'the', 'membrane', 'is', 'exhibited', 'in', 'presence', 'of', 'anesthetic', 'molecules', 'our', 'simulation', 'shows', 'both', 'lateral', 'and', 'transverse', 'heterogeneity', 'of', 'the', 'anesthetics', 'in', 'the', 'composite', 'multicomponent', 'lipid', 'membrane', 'both', 'ethanol', 'and', 'chloroform', 'partition', 'in', 'the', 'popcrich', 'ld', 'phase', 'domain', 'while', 'methanol', 'is', 'distributed', 'in', 'both', 'lold', 'phase', 'domains', 'chloroform', 'can', 'penetrate', 'deep', 'into', 'the', 'membrane', 'while', 'methanol', 'partitions', 'mostly', 'at', 'the', 'water', 'layer', 'closed', 'to', 'the', 'headgroup', 'and', 'ethanol', 'at', 'the', 'neck', 'of', 'the', 'lipids', 'in', 'the', 'membrane']]
|
[-0.10522656931451586, 0.15262288222597245, -0.024271055926013918, -0.0457297166883332, 0.04685634578310489, -0.11074362420281786, 0.04128966182414554, 0.37535472570857153, -0.23374788111778433, -0.22583281638067282, 0.05442355348154189, -0.25720318382003615, -0.16043489090094487, 0.09828896974464377, -0.010314702887985923, 0.005019703517461609, -0.013113621142720747, -0.0793482504365408, -0.0035940640519546, -0.1346829296326722, 0.18992353915334484, -0.00401253458046254, 0.32228287282639634, 0.14232985282380936, 0.09281198876703571, -0.055307668545924706, 0.0774166510303778, 0.026117271828412184, -0.15747754266200634, 0.10420455453952414, 0.27590761843840117, -0.0337164215353167, 0.20090063351825505, -0.4777662168329437, -0.2679569787191768, 0.0354658005630854, 0.13706040699982983, 0.13685049336127558, -0.011394190483323638, -0.27058280483557434, 0.041729589115582895, -0.13725637861466158, -0.1239096844850476, -0.02180526422860915, -0.007102745862588465, 0.06743021689103416, -0.2135793387689098, 0.18834634889809493, 0.038701048656227345, 0.09679791738675116, -0.14526518782277306, -0.15711122897835617, -0.13261645276958267, 0.13664050336402958, 0.03278864809858451, -0.0031435963602577653, 0.2941784880982857, -0.16080997187454632, -0.023170582436005623, 0.39160138916664805, -0.04645603380171571, -0.16360675663726326, 0.22226626674148314, -0.16974265896889498, -0.12334028147941756, 0.2293005429018668, 0.1138679469729255, 0.10885623676568537, -0.15596269021747622, 0.00603415768260337, -0.02173074934921579, 0.22805930523712098, 0.12013982416097142, -0.019520703121436993, 0.23130147916844818, 0.2512649714188305, -0.01865939486180683, 0.22134127975636703, -0.11550427262265581, -0.14099123321953203, -0.1913921321758967, -0.21951418711272666, -0.12234456597933334, 0.009432742742314088, -0.10398684965363288, -0.21254308781625625, 0.3577249465663785, 0.032715633369335334, 0.10793406542803267, 0.04149683905712435, 0.22649119327243553, -0.04357503476053543, 0.07044437222815715, -0.018666535016416966, 0.23897381326250597, 0.1313536258994373, 0.12767661240057807, -0.29322082367669905, 0.11887218174106347, -0.016630491534593755]
|
1,803.04958
|
Spanning trees in randomly perturbed graphs
|
A classical result of Koml\'os, S\'ark\"ozy and Szemer\'edi states that every
$n$-vertex graph with minimum degree at least $(1/2+ o(1))n$ contains every
$n$-vertex tree with maximum degree $O(n/\log{n})$ as a subgraph, and the
bounds on the degree conditions are sharp. On the other hand, Krivelevich, Kwan
and Sudakov recently proved that for every $n$-vertex graph $G_\alpha$ with
minimum degree at least $\alpha n$ for any fixed $\alpha >0$ and every
$n$-vertex tree $T$ with bounded maximum degree, one can still find a copy of
$T$ in $G_\alpha$ with high probability after adding $O(n)$ randomly-chosen
edges to $G_\alpha$. We extend their results to trees with unbounded maximum
degree. More precisely, for a given $n^{o(1)}\leq \Delta\leq cn/\log n$ and
$\alpha>0$, we determine the precise number (up to a constant factor) of random
edges that we need to add to an arbitrary $n$-vertex graph $G_\alpha$ with
minimum degree $\alpha n$ in order to guarantee a copy of any fixed $n$-vertex
tree $T$ with maximum degree at most~$\Delta$ with high probability.
|
math.CO
|
a classical result of komlos sarkozy and szemeredi states that every nvertex graph with minimum degree at least 12 o1n contains every nvertex tree with maximum degree onlogn as a subgraph and the bounds on the degree conditions are sharp on the other hand krivelevich kwan and sudakov recently proved that for every nvertex graph g_alpha with minimum degree at least alpha n for any fixed alpha 0 and every nvertex tree t with bounded maximum degree one can still find a copy of t in g_alpha with high probability after adding on randomlychosen edges to g_alpha we extend their results to trees with unbounded maximum degree more precisely for a given no1leq deltaleq cnlog n and alpha0 we determine the precise number up to a constant factor of random edges that we need to add to an arbitrary nvertex graph g_alpha with minimum degree alpha n in order to guarantee a copy of any fixed nvertex tree t with maximum degree at mostdelta with high probability
|
[['a', 'classical', 'result', 'of', 'komlos', 'sarkozy', 'and', 'szemeredi', 'states', 'that', 'every', 'nvertex', 'graph', 'with', 'minimum', 'degree', 'at', 'least', '12', 'o1n', 'contains', 'every', 'nvertex', 'tree', 'with', 'maximum', 'degree', 'onlogn', 'as', 'a', 'subgraph', 'and', 'the', 'bounds', 'on', 'the', 'degree', 'conditions', 'are', 'sharp', 'on', 'the', 'other', 'hand', 'krivelevich', 'kwan', 'and', 'sudakov', 'recently', 'proved', 'that', 'for', 'every', 'nvertex', 'graph', 'g_alpha', 'with', 'minimum', 'degree', 'at', 'least', 'alpha', 'n', 'for', 'any', 'fixed', 'alpha', '0', 'and', 'every', 'nvertex', 'tree', 't', 'with', 'bounded', 'maximum', 'degree', 'one', 'can', 'still', 'find', 'a', 'copy', 'of', 't', 'in', 'g_alpha', 'with', 'high', 'probability', 'after', 'adding', 'on', 'randomlychosen', 'edges', 'to', 'g_alpha', 'we', 'extend', 'their', 'results', 'to', 'trees', 'with', 'unbounded', 'maximum', 'degree', 'more', 'precisely', 'for', 'a', 'given', 'no1leq', 'deltaleq', 'cnlog', 'n', 'and', 'alpha0', 'we', 'determine', 'the', 'precise', 'number', 'up', 'to', 'a', 'constant', 'factor', 'of', 'random', 'edges', 'that', 'we', 'need', 'to', 'add', 'to', 'an', 'arbitrary', 'nvertex', 'graph', 'g_alpha', 'with', 'minimum', 'degree', 'alpha', 'n', 'in', 'order', 'to', 'guarantee', 'a', 'copy', 'of', 'any', 'fixed', 'nvertex', 'tree', 't', 'with', 'maximum', 'degree', 'at', 'mostdelta', 'with', 'high', 'probability']]
|
[-0.17349034642419695, 0.18963079876028296, -0.02097760285109733, -0.008030386514623056, -0.07627311136968659, -0.2198367371449642, 0.09117126501532215, 0.37675588895058765, -0.24640235142556555, -0.3718072460682103, 0.0651666006404963, -0.37894567590997075, -0.11715186568061736, 0.06862846423279155, -0.09196941263296388, 0.07418476924808189, 0.12098398400527058, 0.1552934249333868, 0.05948593055575409, -0.3084958276681419, 0.2436348922889341, -0.008665948706876599, 0.12592339753314402, 0.09056340921811308, 0.14099041808001472, 0.06178481126147689, 0.05291314206622315, 0.062277501558701535, -0.23066819921964038, 0.046517967099718976, 0.2299892429500522, 0.14250393227081407, 0.26274455075124, -0.3199355893591983, -0.15954274345810215, 0.2624849905683236, 0.09237897636573479, 0.042290160599319886, 0.0194644203510975, -0.1621678291319051, 0.19551226627222743, -0.06575582892506976, -0.17791170383605992, 0.02683815261574857, 0.1273824636005994, -0.002927066803430066, -0.3364582576372689, -0.004103500906829581, 0.10830685496330261, 0.04984026803832614, 0.10840138299672893, -0.20150467509149828, -0.08729723126793529, 0.08680895096904627, -0.08451167916258176, 0.16049746001336837, -0.00804571607573466, -0.11147796308840484, -0.18574366614674076, 0.29180695239849613, -0.09335697390999871, -0.1388272741922375, 0.10781087755070379, -0.2152450545662732, -0.2289270722279043, 0.14581793999355852, 0.09936713454398242, 0.16110402539541777, -0.041903794500412365, 0.15631496894815372, -0.06002975112448136, 0.18683077218575458, 0.19935856521073164, 0.006997674412912491, 0.05331598271361806, 0.06915022990750995, 0.2293686633224063, 0.1543981097317583, 0.019406853146343068, 0.06198417172682556, -0.30112148945530254, -0.10349066965846401, -0.23183149925687097, 0.10696159127930349, -0.28943332871095856, -0.17393153070994286, 0.3487578190573858, 0.08275744981012505, 0.23057519579588465, 0.18475953124350672, 0.19863827888938515, 0.10275206185072999, 0.02087441202337769, 0.2501879228970431, 0.06676435149980314, 0.16363216418152055, -0.04454612431652618, -0.15784423225982622, 0.1074979895006188, 0.14360258240900073]
|
1,803.04959
|
Large Deviations Optimal Scheduling of Closed Queueing Networks
|
We study the design of dynamic scheduling controls in closed queueing
networks with a fixed number of jobs. Each time a server becomes available, the
controller has (limited) flexibility in choosing the buffer from which to serve
a job. If no jobs are available at any compatible buffer, the server idles. If
the job is served, it relocates to a ``destination'' buffer. We study how to
maximize throughput in steady state via a large deviations analysis.
We propose a family of simple state-dependent policies called Scaled
MaxWeight (SMW) policies that dynamically manage the distribution of jobs in
the network. We prove that under a complete resource pooling condition
(analogous to the condition in Hall's marriage theorem), any SMW policy leads
to exponential decay of throughput-loss probability as the number of jobs
scales to infinity. Further, there is an SMW policy that achieves the optimal
loss exponent among all scheduling policies, and we analytically specify this
policy in terms of the service rates and routing probabilities. The optimal SMW
policy maintains high job levels adjacent to structurally under-supplied
servers. Our methodology also applies to the open network setting and leads to
exponent-optimal policies.
|
math.PR math.OC
|
we study the design of dynamic scheduling controls in closed queueing networks with a fixed number of jobs each time a server becomes available the controller has limited flexibility in choosing the buffer from which to serve a job if no jobs are available at any compatible buffer the server idles if the job is served it relocates to a destination buffer we study how to maximize throughput in steady state via a large deviations analysis we propose a family of simple statedependent policies called scaled maxweight smw policies that dynamically manage the distribution of jobs in the network we prove that under a complete resource pooling condition analogous to the condition in halls marriage theorem any smw policy leads to exponential decay of throughputloss probability as the number of jobs scales to infinity further there is an smw policy that achieves the optimal loss exponent among all scheduling policies and we analytically specify this policy in terms of the service rates and routing probabilities the optimal smw policy maintains high job levels adjacent to structurally undersupplied servers our methodology also applies to the open network setting and leads to exponentoptimal policies
|
[['we', 'study', 'the', 'design', 'of', 'dynamic', 'scheduling', 'controls', 'in', 'closed', 'queueing', 'networks', 'with', 'a', 'fixed', 'number', 'of', 'jobs', 'each', 'time', 'a', 'server', 'becomes', 'available', 'the', 'controller', 'has', 'limited', 'flexibility', 'in', 'choosing', 'the', 'buffer', 'from', 'which', 'to', 'serve', 'a', 'job', 'if', 'no', 'jobs', 'are', 'available', 'at', 'any', 'compatible', 'buffer', 'the', 'server', 'idles', 'if', 'the', 'job', 'is', 'served', 'it', 'relocates', 'to', 'a', 'destination', 'buffer', 'we', 'study', 'how', 'to', 'maximize', 'throughput', 'in', 'steady', 'state', 'via', 'a', 'large', 'deviations', 'analysis', 'we', 'propose', 'a', 'family', 'of', 'simple', 'statedependent', 'policies', 'called', 'scaled', 'maxweight', 'smw', 'policies', 'that', 'dynamically', 'manage', 'the', 'distribution', 'of', 'jobs', 'in', 'the', 'network', 'we', 'prove', 'that', 'under', 'a', 'complete', 'resource', 'pooling', 'condition', 'analogous', 'to', 'the', 'condition', 'in', 'halls', 'marriage', 'theorem', 'any', 'smw', 'policy', 'leads', 'to', 'exponential', 'decay', 'of', 'throughputloss', 'probability', 'as', 'the', 'number', 'of', 'jobs', 'scales', 'to', 'infinity', 'further', 'there', 'is', 'an', 'smw', 'policy', 'that', 'achieves', 'the', 'optimal', 'loss', 'exponent', 'among', 'all', 'scheduling', 'policies', 'and', 'we', 'analytically', 'specify', 'this', 'policy', 'in', 'terms', 'of', 'the', 'service', 'rates', 'and', 'routing', 'probabilities', 'the', 'optimal', 'smw', 'policy', 'maintains', 'high', 'job', 'levels', 'adjacent', 'to', 'structurally', 'undersupplied', 'servers', 'our', 'methodology', 'also', 'applies', 'to', 'the', 'open', 'network', 'setting', 'and', 'leads', 'to', 'exponentoptimal', 'policies']]
|
[-0.20294670232882103, 0.0721274401984706, -0.09987608288912467, 0.06467422281290902, -0.09264932862617244, -0.23178581916603935, 0.20480480364267592, 0.41845830474969703, -0.28885435186346214, -0.26750519812580137, 0.08918113746463503, -0.2267343914154769, -0.07825060620184535, 0.12909944251761155, -0.1589244884394464, 0.09217210043660272, 0.09248211169270454, 0.07070816855843144, 0.03220896934474469, -0.2843560526805324, 0.28165782151728985, 0.06867227590243731, 0.34186843122606947, 0.0475397757830458, 0.09360359073246992, -0.003414937906046078, 0.0474157361362977, -0.0063130498836654675, -0.13966533010538326, 0.044663376229071114, 0.3255212858920454, 0.2036316755693406, 0.34305657783434507, -0.41946621852182836, -0.12836120033725387, 0.13557417873938682, 0.1078236859868325, 0.04966994281057466, -0.004478942884979819, -0.2174462232475105, 0.1371219324775868, -0.21937276901204197, -0.07590453981091737, -0.03096917627758726, -0.018713337635355338, 0.04137653621928717, -0.361554719980747, -0.015185920789094996, 0.007393742116936852, -0.026913350072896317, -0.08887121864353065, -0.06183993008613547, -0.011686225664412613, 0.17358938096061585, 0.06767281416067764, 0.010162851573633296, 0.14910745865754074, -0.09559079483718114, -0.15735963326459998, 0.378419792388933, -0.016224305845166324, -0.20524611227490283, 0.13386478710047428, -0.05749196046963334, -0.16153453560496764, 0.12622808475923852, 0.22309727600385143, 0.09244052816253825, -0.18436216988241072, 0.03247698434294699, -0.0762170080130023, 0.163623272918692, 0.09486705264958636, 0.03895236111169671, 0.09582693937909666, 0.2009513055284818, 0.19250623933064243, 0.18309487358336804, -0.013454489173397186, -0.14511689791953555, -0.2601719207411248, -0.14098280437275887, -0.17391355125856878, 0.04047840148661404, -0.11733251760404854, -0.12685357140150494, 0.35060221294345206, 0.12829036846271563, 0.1631813438993598, 0.17693084736994316, 0.2996527458092681, 0.10701237801245596, 0.08675978483050746, 0.23397038465995734, 0.10800428088340494, 0.016833392723042163, 0.14611191516674354, -0.21976572623760957, 0.13178339243817844, 0.0065615867885450525]
|
1,803.0496
|
Frame-invariant approach to higher-dimensional scalar-tensor gravity
|
The recent interest in modified theories of gravity, involving some type of
non-minimal coupling to the Ricci scalar, and the calculation of cosmological
observables in the Einstein or the Jordan frame, motivate the formulation of
these theories in terms of quantities that are invariant under frame
transformations. Furthermore, in view of the description of gravity and its
geometry motivated by string theory, such a formulation could be extended to
include theories of extra spatial dimensions. In the present article, we
generalize the construction of frame-invariant quantities, concerning a
general, $D$-dimensional scalar-tensor theory. Then, we limit our scope to the
5D braneworld scenario, where we study thick brane solutions that are localized
on the 3-brane and extend the invariant formulation to the case of multiple
scalar fields (non-)minimally coupled to gravity.
|
gr-qc hep-th
|
the recent interest in modified theories of gravity involving some type of nonminimal coupling to the ricci scalar and the calculation of cosmological observables in the einstein or the jordan frame motivate the formulation of these theories in terms of quantities that are invariant under frame transformations furthermore in view of the description of gravity and its geometry motivated by string theory such a formulation could be extended to include theories of extra spatial dimensions in the present article we generalize the construction of frameinvariant quantities concerning a general ddimensional scalartensor theory then we limit our scope to the 5d braneworld scenario where we study thick brane solutions that are localized on the 3brane and extend the invariant formulation to the case of multiple scalar fields nonminimally coupled to gravity
|
[['the', 'recent', 'interest', 'in', 'modified', 'theories', 'of', 'gravity', 'involving', 'some', 'type', 'of', 'nonminimal', 'coupling', 'to', 'the', 'ricci', 'scalar', 'and', 'the', 'calculation', 'of', 'cosmological', 'observables', 'in', 'the', 'einstein', 'or', 'the', 'jordan', 'frame', 'motivate', 'the', 'formulation', 'of', 'these', 'theories', 'in', 'terms', 'of', 'quantities', 'that', 'are', 'invariant', 'under', 'frame', 'transformations', 'furthermore', 'in', 'view', 'of', 'the', 'description', 'of', 'gravity', 'and', 'its', 'geometry', 'motivated', 'by', 'string', 'theory', 'such', 'a', 'formulation', 'could', 'be', 'extended', 'to', 'include', 'theories', 'of', 'extra', 'spatial', 'dimensions', 'in', 'the', 'present', 'article', 'we', 'generalize', 'the', 'construction', 'of', 'frameinvariant', 'quantities', 'concerning', 'a', 'general', 'ddimensional', 'scalartensor', 'theory', 'then', 'we', 'limit', 'our', 'scope', 'to', 'the', '5d', 'braneworld', 'scenario', 'where', 'we', 'study', 'thick', 'brane', 'solutions', 'that', 'are', 'localized', 'on', 'the', '3brane', 'and', 'extend', 'the', 'invariant', 'formulation', 'to', 'the', 'case', 'of', 'multiple', 'scalar', 'fields', 'nonminimally', 'coupled', 'to', 'gravity']]
|
[-0.15338978993061644, 0.11108317006236086, -0.07407110549527435, 0.08109780003746542, -0.10486702781042997, -0.1538472602967746, -0.06499278892476398, 0.2659249797069396, -0.19903868838356664, -0.27059321409771936, 0.05497829682336977, -0.24091970371798827, -0.1712555343697134, 0.1255050141346426, -0.08929282987776857, 0.01642837701096701, -0.02399723202509519, 0.05998051156504796, -0.0992581351982573, -0.25993210757867646, 0.3935663977924448, 0.050533377001276955, 0.21583111360131835, 0.03629297847062564, 0.07965284088411584, -0.027894464095767874, -0.028077249440292898, 0.0791609620102323, -0.1813141450112408, 0.14699205032084137, 0.2000217039961941, 0.12080423253355548, 0.18404203019319818, -0.44725914565989605, -0.2944671759791583, 0.08218810254564653, 0.12047097948738016, 0.15555595382331655, -0.01367552012581235, -0.30215990631303824, 0.03830159493507101, -0.16879799856732672, -0.1577463161052527, -0.08270509915354733, -0.021783222096900527, -0.07495428945761747, -0.2504345144951143, 0.08134752556215971, 0.03031983693363145, -0.004580165101931645, -0.10967801238069884, -0.02638048919258066, -0.004000190400088636, 0.024211623958455254, 0.15604656788233953, 0.0394869071091167, 0.12084653207387488, -0.14651507394558463, -0.1152660792818866, 0.412143792054401, -0.1401502949687151, -0.28163017872362756, 0.17243017806098437, -0.13797307298518718, -0.1722228437375564, 0.016715298843784976, 0.16205047000772677, 0.19875261413936432, -0.140987957067913, 0.22323620548122564, -0.03301443764581703, 0.10135023161553992, 0.10074809216177807, 0.094632456382253, 0.28914555804803965, 0.07174032869605491, -0.0005038507855855502, 0.13023035809164868, 0.012398400825734896, -0.17171150271852428, -0.4375810011903433, -0.16229150846282628, -0.10802496665049917, 0.0660041259870363, -0.15362241506686236, -0.16165444900353368, 0.3861429792757218, 0.16491123073591063, 0.12085603506734165, 0.07182174724383424, 0.21010564118981934, 0.07086907324040882, 0.048961318065770545, 0.020574298626385056, 0.2809421398509025, 0.18621173912408548, 0.0960883384409289, -0.20893983783988426, -0.122500610352458, 0.14075394039615416]
|
1,803.04961
|
Dark decay of the neutron
|
New decay channels for the neutron into dark matter plus other particles have
been suggested for explaining a long-standing discrepancy between the neutron
lifetime measured from trapped neutrons versus those decaying in flight. Many
such scenarios are already ruled out by their effects on neutron stars, and the
decay into dark matter plus photon has been experimentally excluded. Here we
explore the decay into a dark Dirac fermion $\chi$ and a dark photon $A'$,
which can be consistent with all constraints if $\chi$ is a subdominant
component of the dark matter. Neutron star constraints are evaded if the dark
photon mass to coupling ratio is $m_{A'}/g' \lesssim (45-60)\,$MeV, depending
upon the nuclear equation of state. $g'$ and the kinetic mixing between U(1)$'$
and electromagnetism are tightly constrained by direct and indirect dark matter
detection, supernova constraints, and cosmological limits.
|
hep-ph astro-ph.CO astro-ph.HE nucl-th
|
new decay channels for the neutron into dark matter plus other particles have been suggested for explaining a longstanding discrepancy between the neutron lifetime measured from trapped neutrons versus those decaying in flight many such scenarios are already ruled out by their effects on neutron stars and the decay into dark matter plus photon has been experimentally excluded here we explore the decay into a dark dirac fermion chi and a dark photon a which can be consistent with all constraints if chi is a subdominant component of the dark matter neutron star constraints are evaded if the dark photon mass to coupling ratio is m_ag lesssim 4560mev depending upon the nuclear equation of state g and the kinetic mixing between u1 and electromagnetism are tightly constrained by direct and indirect dark matter detection supernova constraints and cosmological limits
|
[['new', 'decay', 'channels', 'for', 'the', 'neutron', 'into', 'dark', 'matter', 'plus', 'other', 'particles', 'have', 'been', 'suggested', 'for', 'explaining', 'a', 'longstanding', 'discrepancy', 'between', 'the', 'neutron', 'lifetime', 'measured', 'from', 'trapped', 'neutrons', 'versus', 'those', 'decaying', 'in', 'flight', 'many', 'such', 'scenarios', 'are', 'already', 'ruled', 'out', 'by', 'their', 'effects', 'on', 'neutron', 'stars', 'and', 'the', 'decay', 'into', 'dark', 'matter', 'plus', 'photon', 'has', 'been', 'experimentally', 'excluded', 'here', 'we', 'explore', 'the', 'decay', 'into', 'a', 'dark', 'dirac', 'fermion', 'chi', 'and', 'a', 'dark', 'photon', 'a', 'which', 'can', 'be', 'consistent', 'with', 'all', 'constraints', 'if', 'chi', 'is', 'a', 'subdominant', 'component', 'of', 'the', 'dark', 'matter', 'neutron', 'star', 'constraints', 'are', 'evaded', 'if', 'the', 'dark', 'photon', 'mass', 'to', 'coupling', 'ratio', 'is', 'm_ag', 'lesssim', '4560mev', 'depending', 'upon', 'the', 'nuclear', 'equation', 'of', 'state', 'g', 'and', 'the', 'kinetic', 'mixing', 'between', 'u1', 'and', 'electromagnetism', 'are', 'tightly', 'constrained', 'by', 'direct', 'and', 'indirect', 'dark', 'matter', 'detection', 'supernova', 'constraints', 'and', 'cosmological', 'limits']]
|
[-0.10089467811749141, 0.2801029407267418, -0.11543609384123397, 0.1562136915407778, -0.13627175617274706, -0.15588213200680912, 0.025294830388241055, 0.29655683613584743, -0.20787662838963603, -0.3928533102507177, 0.012861717574170156, -0.30854817890170694, 0.057315188972954303, 0.1866578288457316, 0.08801040086014521, 0.027819534654870793, 0.0250906205885416, 0.03097157188407753, -0.04228228908217768, -0.21635387880403711, 0.31291927589884744, 0.027778144372438175, 0.14998280297141467, 0.09449779764627633, 0.08744533077908168, -0.05006654752411334, -0.03523670194630066, -0.0627342226807082, -0.162748984358125, -0.004329973916131733, 0.1591553072158485, 0.08697860063941756, 0.1340254107338336, -0.43996470607817173, -0.2510393266836046, 0.22734550119418165, 0.1887481597731349, 0.050495138244224254, -0.10772925268848547, -0.35202101862354984, 0.04246198907798237, -0.23266461135758815, -0.041999527084492685, -0.03713147754551492, 0.009481509526570639, -0.004198332573624624, -0.24785461917222626, 0.1337476743974021, -0.03062317909780836, -0.09429359264955249, -0.06886117407660661, -0.1635356853881419, -0.019447765515550323, -0.025379732996900228, 0.14056761272460816, -0.007540700444276782, 0.1965442400297447, -0.21801088286388287, -0.06730805800137771, 0.41771141901288344, -0.11613839552265362, -0.1403051707016277, 0.16019158372216843, -0.13984160483485777, -0.1423428124829155, 0.14756114565787595, 0.11656086946554158, 0.07849488490045178, -0.15329908071156673, 0.11228774096968624, -0.041720392420361546, 0.20404159116045828, 0.06259385657334782, 0.0667054968263614, 0.3989473259670363, 0.19459177298974112, 0.031437039261842416, 0.031033816749476355, -0.13074444766676027, -0.050840134157097316, -0.31906503397107555, -0.13398287628196937, -0.14038929621945473, 0.045204381559691996, -0.03538352176648281, -0.052091322491701314, 0.3154530880999738, 0.013584428726681981, 0.1682173971515284, -0.018887551846421338, 0.31763028101219487, 0.10425242300455768, 0.04899953548674998, 0.045422489457912205, 0.3790877476854223, 0.22602704833801565, 0.03987700680095325, -0.26100259616910276, 0.014481461073771336, -0.03594527492785583]
|
1,803.04962
|
Galaxy And Mass Assembly (GAMA): Gas Fuelling of Spiral Galaxies in the
Local Universe II. -- Direct Measurement of the Dependencies on Redshift and
Host Halo Mass of Stellar Mass Growth in Central Disk Galaxies
|
We present a detailed analysis of the specific star formation rate -- stellar
mass ($\mathrm{sSFR}-M_*$) of $z\le 0.13$ disk central galaxies using a
morphologically selected mass-complete sample ($M_* \ge 10^{9.5} M_{\odot}$).
Considering samples of grouped and ungrouped galaxies, we find the
$\mathrm{sSFR}-M_*$ relations of disk-dominated central galaxies to have no
detectable dependence on host dark-matter halo (DMH) mass, even where
weak-lensing measurements indicate a difference in halo mass of a factor
$\gtrsim5$. We further detect a gradual evolution of the $\mathrm{sSFR}-M_*$
relation of non-grouped (field) central disk galaxies with redshift, even over
a $\Delta z \approx 0.04$ ($\approx5\cdot10^{8}\mathrm{yr}$) interval, while
the scatter remains constant. This evolution is consistent with extrapolation
of the "main-sequence-of-star-forming-galaxies" from previous literature that
uses larger redshift baselines and coarser sampling.
Taken together, our results present new constraints on the paradigm under
which the SFR of galaxies is determined by a self-regulated balance between gas
inflows and outflows, and consumption of gas by star-formation in disks, with
the inflow being determined by the product of the cosmological accretion rate
and a fuelling-efficiency -- $\dot{M}_{\mathrm{b,halo}}\zeta$. In particular,
maintaining the paradigm requires $\dot{M}_{\mathrm{b,halo}}\zeta$ to be
independent of the mass $M_{\mathrm{halo}}$ of the host DMH. Furthermore, it
requires the fuelling-efficiency $\zeta$ to have a strong redshift dependence
($\propto (1+z)^{2.7}$ for $M_*=10^{10.3} M_{\odot}$ over $z=0 - 0.13$), even
though no morphological transformation to spheroids can be invoked to explain
this in our disk-dominated sample. The physical mechanisms capable of giving
rise to such dependencies of $\zeta$ on $M_{\mathrm{halo}}$ and $z$ for disks
are unclear.
|
astro-ph.GA
|
we present a detailed analysis of the specific star formation rate stellar mass mathrmssfrm_ of zle 013 disk central galaxies using a morphologically selected masscomplete sample m_ ge 1095 m_odot considering samples of grouped and ungrouped galaxies we find the mathrmssfrm_ relations of diskdominated central galaxies to have no detectable dependence on host darkmatter halo dmh mass even where weaklensing measurements indicate a difference in halo mass of a factor gtrsim5 we further detect a gradual evolution of the mathrmssfrm_ relation of nongrouped field central disk galaxies with redshift even over a delta z approx 004 approx5cdot108mathrmyr interval while the scatter remains constant this evolution is consistent with extrapolation of the mainsequenceofstarforminggalaxies from previous literature that uses larger redshift baselines and coarser sampling taken together our results present new constraints on the paradigm under which the sfr of galaxies is determined by a selfregulated balance between gas inflows and outflows and consumption of gas by starformation in disks with the inflow being determined by the product of the cosmological accretion rate and a fuellingefficiency dotm_mathrmbhalozeta in particular maintaining the paradigm requires dotm_mathrmbhalozeta to be independent of the mass m_mathrmhalo of the host dmh furthermore it requires the fuellingefficiency zeta to have a strong redshift dependence propto 1z27 for m_10103 m_odot over z0 013 even though no morphological transformation to spheroids can be invoked to explain this in our diskdominated sample the physical mechanisms capable of giving rise to such dependencies of zeta on m_mathrmhalo and z for disks are unclear
|
[['we', 'present', 'a', 'detailed', 'analysis', 'of', 'the', 'specific', 'star', 'formation', 'rate', 'stellar', 'mass', 'mathrmssfrm_', 'of', 'zle', '013', 'disk', 'central', 'galaxies', 'using', 'a', 'morphologically', 'selected', 'masscomplete', 'sample', 'm_', 'ge', '1095', 'm_odot', 'considering', 'samples', 'of', 'grouped', 'and', 'ungrouped', 'galaxies', 'we', 'find', 'the', 'mathrmssfrm_', 'relations', 'of', 'diskdominated', 'central', 'galaxies', 'to', 'have', 'no', 'detectable', 'dependence', 'on', 'host', 'darkmatter', 'halo', 'dmh', 'mass', 'even', 'where', 'weaklensing', 'measurements', 'indicate', 'a', 'difference', 'in', 'halo', 'mass', 'of', 'a', 'factor', 'gtrsim5', 'we', 'further', 'detect', 'a', 'gradual', 'evolution', 'of', 'the', 'mathrmssfrm_', 'relation', 'of', 'nongrouped', 'field', 'central', 'disk', 'galaxies', 'with', 'redshift', 'even', 'over', 'a', 'delta', 'z', 'approx', '004', 'approx5cdot108mathrmyr', 'interval', 'while', 'the', 'scatter', 'remains', 'constant', 'this', 'evolution', 'is', 'consistent', 'with', 'extrapolation', 'of', 'the', 'mainsequenceofstarforminggalaxies', 'from', 'previous', 'literature', 'that', 'uses', 'larger', 'redshift', 'baselines', 'and', 'coarser', 'sampling', 'taken', 'together', 'our', 'results', 'present', 'new', 'constraints', 'on', 'the', 'paradigm', 'under', 'which', 'the', 'sfr', 'of', 'galaxies', 'is', 'determined', 'by', 'a', 'selfregulated', 'balance', 'between', 'gas', 'inflows', 'and', 'outflows', 'and', 'consumption', 'of', 'gas', 'by', 'starformation', 'in', 'disks', 'with', 'the', 'inflow', 'being', 'determined', 'by', 'the', 'product', 'of', 'the', 'cosmological', 'accretion', 'rate', 'and', 'a', 'fuellingefficiency', 'dotm_mathrmbhalozeta', 'in', 'particular', 'maintaining', 'the', 'paradigm', 'requires', 'dotm_mathrmbhalozeta', 'to', 'be', 'independent', 'of', 'the', 'mass', 'm_mathrmhalo', 'of', 'the', 'host', 'dmh', 'furthermore', 'it', 'requires', 'the', 'fuellingefficiency', 'zeta', 'to', 'have', 'a', 'strong', 'redshift', 'dependence', 'propto', '1z27', 'for', 'm_10103', 'm_odot', 'over', 'z0', '013', 'even', 'though', 'no', 'morphological', 'transformation', 'to', 'spheroids', 'can', 'be', 'invoked', 'to', 'explain', 'this', 'in', 'our', 'diskdominated', 'sample', 'the', 'physical', 'mechanisms', 'capable', 'of', 'giving', 'rise', 'to', 'such', 'dependencies', 'of', 'zeta', 'on', 'm_mathrmhalo', 'and', 'z', 'for', 'disks', 'are', 'unclear']]
|
[-0.0946395605056179, 0.1065859226067358, -0.0684530327966329, 0.10425134192505651, -0.07585721251108368, -0.05620316003472352, 0.0637288620216341, 0.4138111797553941, -0.132865866513204, -0.35553511146990935, 0.0323487893176267, -0.2649989492098285, 0.011670403091106101, 0.20666688017634682, -0.01663442375715668, -0.020291451859280222, 0.010899874965481322, -0.09081574381629298, -0.09493523402831543, -0.27783024287493974, 0.3296771643333106, 0.06097472508530294, 0.16038881650594763, -0.031277609153213905, 0.08975430418186905, -0.08357531745814187, -0.08441183744176399, -0.02269966573038808, -0.20716734984058002, 0.010636864754386738, 0.21824773366578415, 0.12069349574169393, 0.24545096638343059, -0.3302016855014391, -0.18562950044947346, 0.08194609860550951, 0.21473772134362482, 0.019130454066282616, -0.12800026950397536, -0.2208142661574212, 0.0962763003040921, -0.19833367530517243, -0.10432571580660942, 0.054675753760653784, 0.03980137864830095, 0.01873963302114886, -0.25951882136200577, 0.23594617765220466, 0.05354573577450019, 0.0664244666907259, -0.07560677653705809, -0.08473715588762155, -0.09255947620961007, 0.07032473532536859, 0.05642585776946392, 0.11114401865917958, 0.2163797918248206, -0.13809234544072946, 0.008004406562329015, 0.4086254492694558, -0.051047596229963806, -0.05192374984213259, 0.22781981824640346, -0.21847452743417653, -0.17625865752978082, 0.10637286979097042, 0.160217702730072, 0.08119642674058969, -0.13797509287722592, 0.03400879526705181, -0.02429642356414548, 0.2581117394642927, 0.025896987260111477, 0.03124243380455685, 0.32828412492459347, 0.12086064651827828, 0.04968756145686065, 0.05223562345072273, -0.12432917227876211, -0.032065975368176854, -0.22307197943239374, -0.10101210824521797, -0.1149304579204518, 0.11446501895610228, -0.1759770224675438, -0.09135106334574367, 0.31842502845597476, 0.09460792789715082, 0.2877739640895647, 0.1426189486769582, 0.2731389435958733, 0.10049642352358445, 0.15564382418293568, 0.10674414001713114, 0.2684131693094969, 0.17730778970751787, 0.040693546479860364, -0.2408544214630946, 0.0700144061591661, -0.011895861451644913]
|
1,803.04963
|
Remote RF excitation for a small-bore MR imager at 15.2 T
|
The travelling-wave MRI approach is an alternative to overcome the B1
inhomogeneity at UHF MRI for human applications. More recently, this concept
has been also used with animal MR imagers. We used a parallel-plate waveguide
and a bio-inspired surface coil to generate mouse images at 15.2T. Ex vivo
mouse images were acquired without high dielectric materials to conduct the
signal at the right frequency. These results are in very good concordance with
results obtained at 3T and 9.4T. These results show that travelling wave MRI
with high SNR can be performed with a simple waveguide.
|
physics.med-ph
|
the travellingwave mri approach is an alternative to overcome the b1 inhomogeneity at uhf mri for human applications more recently this concept has been also used with animal mr imagers we used a parallelplate waveguide and a bioinspired surface coil to generate mouse images at 152t ex vivo mouse images were acquired without high dielectric materials to conduct the signal at the right frequency these results are in very good concordance with results obtained at 3t and 94t these results show that travelling wave mri with high snr can be performed with a simple waveguide
|
[['the', 'travellingwave', 'mri', 'approach', 'is', 'an', 'alternative', 'to', 'overcome', 'the', 'b1', 'inhomogeneity', 'at', 'uhf', 'mri', 'for', 'human', 'applications', 'more', 'recently', 'this', 'concept', 'has', 'been', 'also', 'used', 'with', 'animal', 'mr', 'imagers', 'we', 'used', 'a', 'parallelplate', 'waveguide', 'and', 'a', 'bioinspired', 'surface', 'coil', 'to', 'generate', 'mouse', 'images', 'at', '152t', 'ex', 'vivo', 'mouse', 'images', 'were', 'acquired', 'without', 'high', 'dielectric', 'materials', 'to', 'conduct', 'the', 'signal', 'at', 'the', 'right', 'frequency', 'these', 'results', 'are', 'in', 'very', 'good', 'concordance', 'with', 'results', 'obtained', 'at', '3t', 'and', '94t', 'these', 'results', 'show', 'that', 'travelling', 'wave', 'mri', 'with', 'high', 'snr', 'can', 'be', 'performed', 'with', 'a', 'simple', 'waveguide']]
|
[-0.04979835747756024, 0.08136549616926672, -0.052771354738147334, 0.008003942766276367, -0.10493000790952368, -0.17468249598181151, -0.06820950690320039, 0.4925332226433811, -0.22493382372417825, -0.2982791232420726, 0.08411784815240374, -0.2788210424119012, -0.16497428128693967, 0.2808343246083786, -0.07674904488661188, 0.09107700436118435, 0.10536692923608612, 0.02204855698893996, 0.018664375390916903, -0.16136865854818136, 0.19687623212589545, 0.06743248818105364, 0.3011414528764943, 0.002118628249166811, 0.1253375209659893, -0.08988424918634143, 0.07190351532970338, 0.04298772503364277, -0.1414974846588751, 0.101735306140828, 0.3187218196194698, 0.08168247808514044, 0.26479166109075253, -0.5060007703351848, -0.2394630504014129, 0.03757191169016222, 0.15524120594404558, 0.10484561506421008, -0.09097724547934782, -0.33875587844151134, 0.168594937898501, -0.11450524773309997, -0.1048632700471802, -0.08297013061026984, -0.05466010944640383, -0.02446072535314399, -0.3174335596131835, 0.06961000828348606, -0.036347672937715306, 0.12945468469641785, -0.09174922599576096, -0.09908538442005978, 0.02558123207765017, 0.12650378065758405, 0.02141887381266644, 0.07339491263190483, 0.16393891491114776, -0.1548207237507821, -0.1068817151839191, 0.29452971269455835, -0.024206242652887358, -0.19511353466263476, 0.24585907837683138, -0.18308143315717895, -0.05572004295003779, 0.1846760632544558, 0.1462135863827264, 0.066793438953724, -0.13228555895918187, -0.005931185975799614, -0.021132799177374838, 0.1900266478967635, 0.1483293875477257, -0.009184109091639836, 0.15700411158514785, 0.19750938072126914, -0.026219977885781925, 0.1462695445887685, -0.19864117527043723, 0.08572751718593087, -0.19030968414153904, -0.1505404534957748, -0.19345661019411017, 0.0004356603585233159, -0.08613244952612924, -0.12484420728968813, 0.36834239596104684, 0.1402352830504087, 0.16628106620578847, 0.029944312179144075, 0.33541864404415195, 0.05741981808294324, 0.11158614028790133, 0.005755692455382582, 0.24180006603908508, 0.07873099868215541, 0.17051711918270968, -0.19479150129383074, 0.003722425252991788, -0.0443875532513088]
|
1,803.04964
|
Onion-Peeling Outlier Detection in 2-D data Sets
|
Outlier Detection is a critical and cardinal research task due its array of
applications in variety of domains ranging from data mining, clustering,
statistical analysis, fraud detection, network intrusion detection and
diagnosis of diseases etc. Over the last few decades, distance-based outlier
detection algorithms have gained significant reputation as a viable alternative
to the more traditional statistical approaches due to their scalable,
non-parametric and simple implementation. In this paper, we present a modified
onion peeling (Convex hull) genetic algorithm to detect outliers in a Gaussian
2-D point data set. We present three different scenarios of outlier detection
using a) Euclidean Distance Metric b) Standardized Euclidean Distance Metric
and c) Mahalanobis Distance Metric. Finally, we analyze the performance and
evaluate the results.
|
cs.LG cs.CV eess.SP
|
outlier detection is a critical and cardinal research task due its array of applications in variety of domains ranging from data mining clustering statistical analysis fraud detection network intrusion detection and diagnosis of diseases etc over the last few decades distancebased outlier detection algorithms have gained significant reputation as a viable alternative to the more traditional statistical approaches due to their scalable nonparametric and simple implementation in this paper we present a modified onion peeling convex hull genetic algorithm to detect outliers in a gaussian 2d point data set we present three different scenarios of outlier detection using a euclidean distance metric b standardized euclidean distance metric and c mahalanobis distance metric finally we analyze the performance and evaluate the results
|
[['outlier', 'detection', 'is', 'a', 'critical', 'and', 'cardinal', 'research', 'task', 'due', 'its', 'array', 'of', 'applications', 'in', 'variety', 'of', 'domains', 'ranging', 'from', 'data', 'mining', 'clustering', 'statistical', 'analysis', 'fraud', 'detection', 'network', 'intrusion', 'detection', 'and', 'diagnosis', 'of', 'diseases', 'etc', 'over', 'the', 'last', 'few', 'decades', 'distancebased', 'outlier', 'detection', 'algorithms', 'have', 'gained', 'significant', 'reputation', 'as', 'a', 'viable', 'alternative', 'to', 'the', 'more', 'traditional', 'statistical', 'approaches', 'due', 'to', 'their', 'scalable', 'nonparametric', 'and', 'simple', 'implementation', 'in', 'this', 'paper', 'we', 'present', 'a', 'modified', 'onion', 'peeling', 'convex', 'hull', 'genetic', 'algorithm', 'to', 'detect', 'outliers', 'in', 'a', 'gaussian', '2d', 'point', 'data', 'set', 'we', 'present', 'three', 'different', 'scenarios', 'of', 'outlier', 'detection', 'using', 'a', 'euclidean', 'distance', 'metric', 'b', 'standardized', 'euclidean', 'distance', 'metric', 'and', 'c', 'mahalanobis', 'distance', 'metric', 'finally', 'we', 'analyze', 'the', 'performance', 'and', 'evaluate', 'the', 'results']]
|
[-0.09404603845737143, -0.046815399436495646, -0.08239488255170997, 0.07918848805437403, -0.11051400620798188, -0.20572911477686207, 0.07756694789768066, 0.41837603351378366, -0.26334701792129184, -0.2913230815594477, 0.128348739279919, -0.3035052367909388, -0.20499490258766892, 0.1739600624134841, -0.14255757125533255, 0.1230862929850378, 0.10323918105895855, 0.03181543584897622, -0.08739645631352733, -0.266162320001682, 0.2861311581112783, 0.051477816871806116, 0.3465361938299996, 0.05066750690433358, 0.08414427222768692, -0.011412306396244479, -0.10536701042081945, 0.042108469077940136, -0.10554250846193595, 0.16495897846434973, 0.3349950418072514, 0.27020222325001125, 0.3215041082998938, -0.3361416407591425, -0.23058095157592873, 0.17870830765286508, 0.15118646205687694, 0.0709873944220772, -0.06587840645434047, -0.3376225794180612, 0.08822621759469813, -0.20438421773146992, -0.03923178907514604, -0.10102064707431911, 0.05792343604940275, -0.030408284372904083, -0.2065385172820904, 0.08081856803306617, 0.01598573259505143, 0.11103639723194286, -0.021006107521782176, -0.14210547430610115, 0.1069051175405202, 0.08607238426819937, 0.05975097621221496, 0.06425860220920449, 0.1873870575223272, -0.10885558371601216, -0.18081366038719607, 0.3677523933882125, -0.02829408148651912, -0.17175559542519003, 0.24714437898340796, -0.017182248590652607, -0.1598286931556919, 0.08108201419765299, 0.2830718558797351, 0.13093750712592617, -0.19321568397235525, 0.030387808835761206, 0.013124965900970885, 0.11496478064906444, 0.08303738787216096, -0.008340678208561476, 0.17664572910005458, 0.2259597635466205, 0.11044376133941114, 0.12996927687820348, -0.2089000261457991, -0.06049104795352486, -0.2145830895693988, -0.12678552657550524, -0.19293532899603988, 0.0041365709919713375, -0.17618984296041915, -0.213470223529095, 0.390666314369945, 0.2053201442415064, 0.16110310434702446, 0.08243004511272119, 0.3540093266397468, -0.009560557869181214, 0.053623271949708555, 0.07505082073457893, 0.20168050050096634, 0.05992804012407572, 0.06842828334082103, -0.1244238366753879, 0.08988189476172724, 0.017045491082547617]
|
1,803.04965
|
Coregionalised Locomotion Envelopes - A Qualitative Approach
|
'Sharing of statistical strength' is a phrase often employed in machine
learning and signal processing. In sensor networks, for example, missing
signals from certain sensors may be predicted by exploiting their correlation
with observed signals acquired from other sensors. For humans, our hands move
synchronously with our legs, and we can exploit these implicit correlations for
predicting new poses and for generating new natural-looking walking sequences.
We can also go much further and exploit this form of transfer learning, to
develop new control schemas for robust control of rehabilitation robots. In
this short paper we introduce coregionalised locomotion envelopes - a method
for multi-dimensional manifold regression, on human locomotion variates. Herein
we render a qualitative description of this method.
|
stat.ML cs.RO
|
sharing of statistical strength is a phrase often employed in machine learning and signal processing in sensor networks for example missing signals from certain sensors may be predicted by exploiting their correlation with observed signals acquired from other sensors for humans our hands move synchronously with our legs and we can exploit these implicit correlations for predicting new poses and for generating new naturallooking walking sequences we can also go much further and exploit this form of transfer learning to develop new control schemas for robust control of rehabilitation robots in this short paper we introduce coregionalised locomotion envelopes a method for multidimensional manifold regression on human locomotion variates herein we render a qualitative description of this method
|
[['sharing', 'of', 'statistical', 'strength', 'is', 'a', 'phrase', 'often', 'employed', 'in', 'machine', 'learning', 'and', 'signal', 'processing', 'in', 'sensor', 'networks', 'for', 'example', 'missing', 'signals', 'from', 'certain', 'sensors', 'may', 'be', 'predicted', 'by', 'exploiting', 'their', 'correlation', 'with', 'observed', 'signals', 'acquired', 'from', 'other', 'sensors', 'for', 'humans', 'our', 'hands', 'move', 'synchronously', 'with', 'our', 'legs', 'and', 'we', 'can', 'exploit', 'these', 'implicit', 'correlations', 'for', 'predicting', 'new', 'poses', 'and', 'for', 'generating', 'new', 'naturallooking', 'walking', 'sequences', 'we', 'can', 'also', 'go', 'much', 'further', 'and', 'exploit', 'this', 'form', 'of', 'transfer', 'learning', 'to', 'develop', 'new', 'control', 'schemas', 'for', 'robust', 'control', 'of', 'rehabilitation', 'robots', 'in', 'this', 'short', 'paper', 'we', 'introduce', 'coregionalised', 'locomotion', 'envelopes', 'a', 'method', 'for', 'multidimensional', 'manifold', 'regression', 'on', 'human', 'locomotion', 'variates', 'herein', 'we', 'render', 'a', 'qualitative', 'description', 'of', 'this', 'method']]
|
[-0.08047086420930667, 0.09416088217105238, -0.10002999744799912, 0.07380703534795624, -0.14004595576721823, -0.20192718177906469, 0.03882699862468797, 0.4530880169099213, -0.30512558844370335, -0.3349928943814439, 0.04898605720860422, -0.24519963367468017, -0.21752403734419018, 0.21413936302002168, -0.17389203703556305, 0.0884285733087832, 0.09399230874533582, 0.015956654903900802, -0.009526398128423935, -0.17877024503098402, 0.2696441685836603, -0.0033996871266609584, 0.26576738625478286, -0.018450125948422484, 0.12962093042671427, 0.02412834823028081, -0.019928713743057516, -0.00487501257393732, -0.06526538494847015, 0.20584237825575197, 0.3246187039762417, 0.1680547947016282, 0.2974617404656278, -0.4539805595946108, -0.22491694087337735, 0.11859335512336758, 0.18215587943728662, 0.13761839516357416, -0.08681303152563767, -0.33588180389318967, 0.07947678669578691, -0.16310057495760485, -0.028358697055433042, -0.1693650776337291, -0.026179723907262087, 0.030229623596637677, -0.29611341345211506, 0.02140283480492564, 0.03668707709074912, 0.12860545102888957, -0.06891583006940463, -0.08345374725679429, 0.06814333436111164, 0.20012056497602254, 0.027666313205567054, 0.0036927488927020985, 0.15908043280753315, -0.17026041448713305, -0.1457451691201283, 0.3565655697742079, -0.0003287355200602458, -0.23792007437341997, 0.2226524499650949, -0.07648020840058915, -0.15065550610311648, 0.08396606245197547, 0.2714315187743204, 0.11866130114684248, -0.17649874204180688, -0.03768231575854887, 0.004636331210629298, 0.15620927087580547, 0.0629054717401154, -0.0024019347774422066, 0.1963829277242478, 0.21395908191035956, 0.05781381422828915, 0.11786512601633087, -0.11010338513491054, -0.046376151430746936, -0.23999064722850633, -0.1432821354510374, -0.1593850914301335, 0.008027743595914964, -0.07222159762427004, -0.11988253306804432, 0.3912373315443436, 0.23091387927918258, 0.18747298266643134, 0.1325769875712024, 0.3378932754525071, 0.051477185993765794, 0.09222742224522094, 0.06130051954935949, 0.2052540369053236, 0.03213969326944242, 0.14803030546436197, -0.15662351122890145, 0.11089037299060668, 0.006807855198072254]
|
1,803.04966
|
An Improvement Technique based on Structural Similarity Thresholding for
Digital Watermarking
|
Digital watermarking is extensively used in ownership authentication and
copyright protection. In this paper, we propose an efficient thresholding
scheme to improve the watermark embedding procedure in an image. For the
proposed algorithm, watermark casting is performed separately in each block of
an image, and embedding in each block continues until a certain structural
similarity threshold is reached. Numerical evaluations demonstrate that our
scheme improves the imperceptibility of the watermark when the capacity remains
fix, and at the same time, robustness against attacks is assured. The proposed
method is applicable to most image watermarking algorithms. We verify this
issue on watermarking schemes in Discrete Cosine Transform (DCT), wavelet, and
spatial domain.
|
cs.MM eess.IV
|
digital watermarking is extensively used in ownership authentication and copyright protection in this paper we propose an efficient thresholding scheme to improve the watermark embedding procedure in an image for the proposed algorithm watermark casting is performed separately in each block of an image and embedding in each block continues until a certain structural similarity threshold is reached numerical evaluations demonstrate that our scheme improves the imperceptibility of the watermark when the capacity remains fix and at the same time robustness against attacks is assured the proposed method is applicable to most image watermarking algorithms we verify this issue on watermarking schemes in discrete cosine transform dct wavelet and spatial domain
|
[['digital', 'watermarking', 'is', 'extensively', 'used', 'in', 'ownership', 'authentication', 'and', 'copyright', 'protection', 'in', 'this', 'paper', 'we', 'propose', 'an', 'efficient', 'thresholding', 'scheme', 'to', 'improve', 'the', 'watermark', 'embedding', 'procedure', 'in', 'an', 'image', 'for', 'the', 'proposed', 'algorithm', 'watermark', 'casting', 'is', 'performed', 'separately', 'in', 'each', 'block', 'of', 'an', 'image', 'and', 'embedding', 'in', 'each', 'block', 'continues', 'until', 'a', 'certain', 'structural', 'similarity', 'threshold', 'is', 'reached', 'numerical', 'evaluations', 'demonstrate', 'that', 'our', 'scheme', 'improves', 'the', 'imperceptibility', 'of', 'the', 'watermark', 'when', 'the', 'capacity', 'remains', 'fix', 'and', 'at', 'the', 'same', 'time', 'robustness', 'against', 'attacks', 'is', 'assured', 'the', 'proposed', 'method', 'is', 'applicable', 'to', 'most', 'image', 'watermarking', 'algorithms', 'we', 'verify', 'this', 'issue', 'on', 'watermarking', 'schemes', 'in', 'discrete', 'cosine', 'transform', 'dct', 'wavelet', 'and', 'spatial', 'domain']]
|
[-0.09530114306992776, -0.07128434898900728, -0.13862784484166418, 0.03331864541207717, -0.03701564314280142, -0.2059675654404805, 0.08003855450603238, 0.45341306825394967, -0.2937027484583375, -0.22823167258353383, 0.16562946967000292, -0.23875383574616266, -0.1704739702190063, 0.16654731621042834, -0.2287736624512855, 0.17476568724655941, 0.017519044354222378, 0.019425763022825792, -0.049503123863843514, -0.3512306937461232, 0.24764013983310776, 0.047299395130762645, 0.42629564503157463, 0.04695911440360653, 0.10560938481006536, 0.010670209114716665, -0.1044421975022635, -0.06812800253232257, -0.057991486003211815, 0.06823752872092095, 0.29415538616746933, 0.20126112673309976, 0.30343394361117537, -0.3713457613956888, -0.19979291078676512, 0.09089249844016793, 0.19858921748829317, 0.1280177897345778, -0.1146928413775288, -0.34177682759357736, 0.20871113714770423, -0.15045274706842662, 0.009611898076695364, -0.11427826644970221, -0.03471180102116688, -0.08179507965037415, -0.282400436917538, 0.01091318231847909, 0.07518319191142649, 0.03354183275688876, -0.032915926196503346, -0.061353642724219476, 0.03517905914493174, 0.13299630756772057, 0.03587924792341952, 0.047177135285728415, 0.14815887579744733, -0.09985646794902513, -0.1193844253188922, 0.38902143033238146, -0.010065444138924684, -0.25146208763928024, 0.11824206475101344, -0.008877211764008058, -0.13351805711181852, 0.14470719174179877, 0.1844787063530168, 0.09637179659880898, -0.1439033991827363, 0.06045676843967993, -0.01665641231512701, 0.25077766060896284, 0.09134659597331339, 0.04395433910073595, 0.07886645729393438, 0.20723105013173343, 0.09844105900999427, 0.19658279643805177, -0.1388036137109052, -0.023223400271187227, -0.23213573816223992, -0.18893868803373864, -0.27920138305640435, -0.11837081970995175, -0.12405931338749675, -0.1408450672285514, 0.42025105893287573, 0.21932895274346206, 0.17228496146833036, 0.039032938562937686, 0.43283893617587416, 0.06768504463173952, 0.10071244990025219, 0.11024357508112853, 0.17396455051100537, 0.04605911829852843, 0.1098720867077711, -0.16923309611534146, 0.1014773168869585, 0.14064442936901575]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.