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.07267
|
Does the chiral magnetic effect change the dynamic universality class in
QCD?
|
In QCD matter under an external magnetic field, the chiral magnetic effect
(CME) leads to the collective gapless mode called the chiral magnetic wave
(CMW). Since dynamic universality class generally depends on low-energy gapless
modes, it is nontrivial whether the CME and the resulting CMW change that of
the second-order chiral phase transition in QCD. To address this question, we
study the critical dynamics near the chiral phase transition in massless
two-flavor QCD under an external magnetic field. By performing the dynamic
renormalization-group analysis within the epsilon expansion, we find that the
presence of the CME changes the dynamic universality class to that of model A.
We also show that the transport coefficient of the CME is not renormalized by
the critical fluctuations of the order parameter.
|
hep-ph cond-mat.mes-hall cond-mat.stat-mech nucl-th
|
in qcd matter under an external magnetic field the chiral magnetic effect cme leads to the collective gapless mode called the chiral magnetic wave cmw since dynamic universality class generally depends on lowenergy gapless modes it is nontrivial whether the cme and the resulting cmw change that of the secondorder chiral phase transition in qcd to address this question we study the critical dynamics near the chiral phase transition in massless twoflavor qcd under an external magnetic field by performing the dynamic renormalizationgroup analysis within the epsilon expansion we find that the presence of the cme changes the dynamic universality class to that of model a we also show that the transport coefficient of the cme is not renormalized by the critical fluctuations of the order parameter
|
[['in', 'qcd', 'matter', 'under', 'an', 'external', 'magnetic', 'field', 'the', 'chiral', 'magnetic', 'effect', 'cme', 'leads', 'to', 'the', 'collective', 'gapless', 'mode', 'called', 'the', 'chiral', 'magnetic', 'wave', 'cmw', 'since', 'dynamic', 'universality', 'class', 'generally', 'depends', 'on', 'lowenergy', 'gapless', 'modes', 'it', 'is', 'nontrivial', 'whether', 'the', 'cme', 'and', 'the', 'resulting', 'cmw', 'change', 'that', 'of', 'the', 'secondorder', 'chiral', 'phase', 'transition', 'in', 'qcd', 'to', 'address', 'this', 'question', 'we', 'study', 'the', 'critical', 'dynamics', 'near', 'the', 'chiral', 'phase', 'transition', 'in', 'massless', 'twoflavor', 'qcd', 'under', 'an', 'external', 'magnetic', 'field', 'by', 'performing', 'the', 'dynamic', 'renormalizationgroup', 'analysis', 'within', 'the', 'epsilon', 'expansion', 'we', 'find', 'that', 'the', 'presence', 'of', 'the', 'cme', 'changes', 'the', 'dynamic', 'universality', 'class', 'to', 'that', 'of', 'model', 'a', 'we', 'also', 'show', 'that', 'the', 'transport', 'coefficient', 'of', 'the', 'cme', 'is', 'not', 'renormalized', 'by', 'the', 'critical', 'fluctuations', 'of', 'the', 'order', 'parameter']]
|
[-0.19651118749532642, 0.27915272899874943, -0.07137253648953468, 0.042168013763423336, -0.08208570546859245, -0.04558208357088092, 0.02990001898284591, 0.3408566253098447, -0.22033639620864895, -0.2549553049185614, 0.017859655851314916, -0.2545147331534173, -0.18175768416272256, 0.07743381230732588, 0.06987216779558854, 0.06824887011522852, -0.04111845434210667, 0.06880223333439607, -0.10023140697831684, -0.15424460614114766, 0.3412346609567446, 0.013188608581068243, 0.30283898943815174, 0.11880699586852886, 0.03077742631187824, -0.0037454639554141073, 0.07762972047134471, 0.037250346533484816, -0.14174372405221677, -0.03488304974243373, 0.17602314460494622, -0.03389176907105826, 0.1879186254933359, -0.40939139776430494, -0.23968402417303306, 0.061852883026883826, 0.1454993454724785, 0.13571981380246287, -0.022039516078212893, -0.3062750252594394, 0.08347735250383381, -0.15318702169378676, -0.17401044234252117, -0.11733546609601636, -0.019495097221806645, -0.07857544273761373, -0.3011641856924609, 0.11674405368183388, 0.05764574300145774, 0.058788450251472744, -0.050916271449220694, -0.03744715757257357, -0.030158185026073082, 0.09574467556433768, 0.13054182538377693, 0.0966539802359725, 0.1752807184005171, -0.22120431058042808, -0.11091809067141822, 0.40940825036895556, -0.05788069163122779, -0.13048011146661803, 0.12161559070365166, -0.20635205035750556, -0.14736405700650507, 0.1714332233601081, 0.15303520595024186, 0.08622500264474492, -0.12427135889132426, 0.08935991186221445, -0.03269082422936097, 0.1619600304695741, 0.00400958008015543, 0.0026216565843994225, 0.2516487915450194, 0.13213471794962942, 0.05485776408142814, 0.12758855329181149, -0.08874907964055874, -0.12789653442932045, -0.3377861218952288, -0.09837695322637482, -0.18298290950850232, 0.02662382256853812, -0.12260135557623049, -0.24595664463493622, 0.4521382108081396, 0.2308366750385319, 0.14580396665846856, -0.048892489029461236, 0.2583701747183607, 0.16318011918200517, 0.02519616749372304, 0.10561911031369149, 0.3100144302208475, 0.16854143668860783, 0.15381442306299262, -0.37873760609352214, 0.01763036049990438, 0.11539148033860572]
|
1,803.07268
|
Learning Dynamic Memory Networks for Object Tracking
|
Template-matching methods for visual tracking have gained popularity recently
due to their comparable performance and fast speed. However, they lack
effective ways to adapt to changes in the target object's appearance, making
their tracking accuracy still far from state-of-the-art. In this paper, we
propose a dynamic memory network to adapt the template to the target's
appearance variations during tracking. An LSTM is used as a memory controller,
where the input is the search feature map and the outputs are the control
signals for the reading and writing process of the memory block. As the
location of the target is at first unknown in the search feature map, an
attention mechanism is applied to concentrate the LSTM input on the potential
target. To prevent aggressive model adaptivity, we apply gated residual
template learning to control the amount of retrieved memory that is used to
combine with the initial template. Unlike tracking-by-detection methods where
the object's information is maintained by the weight parameters of neural
networks, which requires expensive online fine-tuning to be adaptable, our
tracker runs completely feed-forward and adapts to the target's appearance
changes by updating the external memory. Moreover, unlike other tracking
methods where the model capacity is fixed after offline training --- the
capacity of our tracker can be easily enlarged as the memory requirements of a
task increase, which is favorable for memorizing long-term object information.
Extensive experiments on OTB and VOT demonstrates that our tracker MemTrack
performs favorably against state-of-the-art tracking methods while retaining
real-time speed of 50 fps.
|
cs.CV
|
templatematching methods for visual tracking have gained popularity recently due to their comparable performance and fast speed however they lack effective ways to adapt to changes in the target objects appearance making their tracking accuracy still far from stateoftheart in this paper we propose a dynamic memory network to adapt the template to the targets appearance variations during tracking an lstm is used as a memory controller where the input is the search feature map and the outputs are the control signals for the reading and writing process of the memory block as the location of the target is at first unknown in the search feature map an attention mechanism is applied to concentrate the lstm input on the potential target to prevent aggressive model adaptivity we apply gated residual template learning to control the amount of retrieved memory that is used to combine with the initial template unlike trackingbydetection methods where the objects information is maintained by the weight parameters of neural networks which requires expensive online finetuning to be adaptable our tracker runs completely feedforward and adapts to the targets appearance changes by updating the external memory moreover unlike other tracking methods where the model capacity is fixed after offline training the capacity of our tracker can be easily enlarged as the memory requirements of a task increase which is favorable for memorizing longterm object information extensive experiments on otb and vot demonstrates that our tracker memtrack performs favorably against stateoftheart tracking methods while retaining realtime speed of 50 fps
|
[['templatematching', 'methods', 'for', 'visual', 'tracking', 'have', 'gained', 'popularity', 'recently', 'due', 'to', 'their', 'comparable', 'performance', 'and', 'fast', 'speed', 'however', 'they', 'lack', 'effective', 'ways', 'to', 'adapt', 'to', 'changes', 'in', 'the', 'target', 'objects', 'appearance', 'making', 'their', 'tracking', 'accuracy', 'still', 'far', 'from', 'stateoftheart', 'in', 'this', 'paper', 'we', 'propose', 'a', 'dynamic', 'memory', 'network', 'to', 'adapt', 'the', 'template', 'to', 'the', 'targets', 'appearance', 'variations', 'during', 'tracking', 'an', 'lstm', 'is', 'used', 'as', 'a', 'memory', 'controller', 'where', 'the', 'input', 'is', 'the', 'search', 'feature', 'map', 'and', 'the', 'outputs', 'are', 'the', 'control', 'signals', 'for', 'the', 'reading', 'and', 'writing', 'process', 'of', 'the', 'memory', 'block', 'as', 'the', 'location', 'of', 'the', 'target', 'is', 'at', 'first', 'unknown', 'in', 'the', 'search', 'feature', 'map', 'an', 'attention', 'mechanism', 'is', 'applied', 'to', 'concentrate', 'the', 'lstm', 'input', 'on', 'the', 'potential', 'target', 'to', 'prevent', 'aggressive', 'model', 'adaptivity', 'we', 'apply', 'gated', 'residual', 'template', 'learning', 'to', 'control', 'the', 'amount', 'of', 'retrieved', 'memory', 'that', 'is', 'used', 'to', 'combine', 'with', 'the', 'initial', 'template', 'unlike', 'trackingbydetection', 'methods', 'where', 'the', 'objects', 'information', 'is', 'maintained', 'by', 'the', 'weight', 'parameters', 'of', 'neural', 'networks', 'which', 'requires', 'expensive', 'online', 'finetuning', 'to', 'be', 'adaptable', 'our', 'tracker', 'runs', 'completely', 'feedforward', 'and', 'adapts', 'to', 'the', 'targets', 'appearance', 'changes', 'by', 'updating', 'the', 'external', 'memory', 'moreover', 'unlike', 'other', 'tracking', 'methods', 'where', 'the', 'model', 'capacity', 'is', 'fixed', 'after', 'offline', 'training', 'the', 'capacity', 'of', 'our', 'tracker', 'can', 'be', 'easily', 'enlarged', 'as', 'the', 'memory', 'requirements', 'of', 'a', 'task', 'increase', 'which', 'is', 'favorable', 'for', 'memorizing', 'longterm', 'object', 'information', 'extensive', 'experiments', 'on', 'otb', 'and', 'vot', 'demonstrates', 'that', 'our', 'tracker', 'memtrack', 'performs', 'favorably', 'against', 'stateoftheart', 'tracking', 'methods', 'while', 'retaining', 'realtime', 'speed', 'of', '50', 'fps']]
|
[-0.0545911859494608, 0.03443895507173936, -0.058830632574175167, 0.04102331536025115, -0.11721819851072542, -0.195514439005939, 0.05053655938252313, 0.4509273368672308, -0.28755708572740457, -0.36604348599235437, 0.12667215099433934, -0.25386579722848784, -0.13149335558815634, 0.1767419513641482, -0.15214547261677355, 0.10051457504871714, 0.12013859223793316, 0.0752059944846901, -0.054222631058794823, -0.2777403267295252, 0.240830284233513, 0.12562539390811467, 0.32241269289534463, -0.018056255559329375, 0.13459458890922027, -0.008066345571143278, -0.052425327835571155, -0.03437811402424027, -0.01542784137108903, 0.12425219931110296, 0.27597071382423966, 0.16957026068741535, 0.2848228126675247, -0.42712864549867663, -0.22665401444625688, 0.07535089943298247, 0.13097212615003623, 0.1156647958685143, -0.049206010399449364, -0.3198362183251578, 0.10641921916048959, -0.1574803491928188, -0.028961247130041102, -0.12866888524485803, 0.013748490941744164, 0.005600933125845539, -0.29650241068788835, 0.012356704093893412, 0.07485972215380683, 0.006363486027923891, -0.05542200580202192, -0.08573807657657347, 0.008439815157942801, 0.1951897195577473, 0.038811617079019305, 0.07584505364859098, 0.1937951504649869, -0.19517615488990103, -0.12539148018454235, 0.3478322695732948, -0.06312607962497142, -0.2176850748701073, 0.2124043254152059, -0.024406044224492343, -0.09693229302997697, 0.13633037679661733, 0.21264106888079132, 0.12483342797439768, -0.1549786489208292, 0.026758793479646093, 0.025065446801463224, 0.2141191100876081, 0.0469567486691656, 0.03227149600912613, 0.16764477405426245, 0.2662382836776426, 0.06798363034427908, 0.15853719028066363, -0.15993267436422764, -0.09046772046631993, -0.2078929633517616, -0.09414920026057982, -0.18155936473809867, -0.05650523162829092, -0.07185551293714453, -0.12316832770834643, 0.4077697161536857, 0.23810050195914162, 0.21055069378024316, 0.08976084584707907, 0.37415875546426414, 0.03538329944949582, 0.15959970781995184, 0.09865603259503952, 0.2149267976368922, -0.0038373862649221345, 0.16387362216146611, -0.22902260308870043, 0.14251572545675795, 0.03153547220139864]
|
1,803.07269
|
Evolution of LMC/M33-mass dwarf galaxies in the EAGLE simulation
|
We investigate the population of dwarf galaxies with stellar masses similar
to the Large Magellanic Cloud (LMC) and M33 in the EAGLE galaxy formation
simulation. In the field, galaxies reside in haloes with stellar-to-halo mass
ratios of $1.03^{+0.50}_{-0.31}\times10^{-2}$ (68% confidence level); systems
like the LMC, which have an SMC-mass satellite, reside in haloes about 1.3
times more massive, which suggests an LMC halo mass at infall,
$M_{200}=3.4^{+1.8}_{-1.2}\times10^{11}M_\odot$ (68% confidence level). The
colour distribution of dwarfs is bimodal, with the red galaxies ($g-r>0.6$)
being mostly satellites. The fraction of red LMC-mass dwarfs is 15% for
centrals, and for satellites this fraction increases rapidly with host mass:
from 10% for satellites of Milky Way (MW)-mass haloes to nearly 90% for
satellites of groups and clusters. The quenching timescale, defined as the time
after infall when half of the satellites have acquired red colours, decreases
with host mass from ${>}5$ Gyrs for MW-mass hosts to $2.5$ Gyrs for cluster
mass hosts. The satellites of MW-mass haloes have higher star formation rates
and bluer colours than field galaxies. This is due to enhanced star formation
triggered by gas compression shortly after accretion. Both the LMC and M33 have
enhanced recent star formation that could be a manifestation of this process.
After infall into their MW-mass hosts, the $g-r$ colours of LMC-mass dwarfs
become bluer for the first 2 Gyrs, after which they rapidly redden. LMC-mass
dwarfs fell into their MW-mass hosts only relatively recently, with more than
half having an infall time of less than 3.5 Gyrs.
|
astro-ph.GA astro-ph.CO
|
we investigate the population of dwarf galaxies with stellar masses similar to the large magellanic cloud lmc and m33 in the eagle galaxy formation simulation in the field galaxies reside in haloes with stellartohalo mass ratios of 103050_031times102 68 confidence level systems like the lmc which have an smcmass satellite reside in haloes about 13 times more massive which suggests an lmc halo mass at infall m_2003418_12times1011m_odot 68 confidence level the colour distribution of dwarfs is bimodal with the red galaxies gr06 being mostly satellites the fraction of red lmcmass dwarfs is 15 for centrals and for satellites this fraction increases rapidly with host mass from 10 for satellites of milky way mwmass haloes to nearly 90 for satellites of groups and clusters the quenching timescale defined as the time after infall when half of the satellites have acquired red colours decreases with host mass from 5 gyrs for mwmass hosts to 25 gyrs for cluster mass hosts the satellites of mwmass haloes have higher star formation rates and bluer colours than field galaxies this is due to enhanced star formation triggered by gas compression shortly after accretion both the lmc and m33 have enhanced recent star formation that could be a manifestation of this process after infall into their mwmass hosts the gr colours of lmcmass dwarfs become bluer for the first 2 gyrs after which they rapidly redden lmcmass dwarfs fell into their mwmass hosts only relatively recently with more than half having an infall time of less than 35 gyrs
|
[['we', 'investigate', 'the', 'population', 'of', 'dwarf', 'galaxies', 'with', 'stellar', 'masses', 'similar', 'to', 'the', 'large', 'magellanic', 'cloud', 'lmc', 'and', 'm33', 'in', 'the', 'eagle', 'galaxy', 'formation', 'simulation', 'in', 'the', 'field', 'galaxies', 'reside', 'in', 'haloes', 'with', 'stellartohalo', 'mass', 'ratios', 'of', '103050_031times102', '68', 'confidence', 'level', 'systems', 'like', 'the', 'lmc', 'which', 'have', 'an', 'smcmass', 'satellite', 'reside', 'in', 'haloes', 'about', '13', 'times', 'more', 'massive', 'which', 'suggests', 'an', 'lmc', 'halo', 'mass', 'at', 'infall', 'm_2003418_12times1011m_odot', '68', 'confidence', 'level', 'the', 'colour', 'distribution', 'of', 'dwarfs', 'is', 'bimodal', 'with', 'the', 'red', 'galaxies', 'gr06', 'being', 'mostly', 'satellites', 'the', 'fraction', 'of', 'red', 'lmcmass', 'dwarfs', 'is', '15', 'for', 'centrals', 'and', 'for', 'satellites', 'this', 'fraction', 'increases', 'rapidly', 'with', 'host', 'mass', 'from', '10', 'for', 'satellites', 'of', 'milky', 'way', 'mwmass', 'haloes', 'to', 'nearly', '90', 'for', 'satellites', 'of', 'groups', 'and', 'clusters', 'the', 'quenching', 'timescale', 'defined', 'as', 'the', 'time', 'after', 'infall', 'when', 'half', 'of', 'the', 'satellites', 'have', 'acquired', 'red', 'colours', 'decreases', 'with', 'host', 'mass', 'from', '5', 'gyrs', 'for', 'mwmass', 'hosts', 'to', '25', 'gyrs', 'for', 'cluster', 'mass', 'hosts', 'the', 'satellites', 'of', 'mwmass', 'haloes', 'have', 'higher', 'star', 'formation', 'rates', 'and', 'bluer', 'colours', 'than', 'field', 'galaxies', 'this', 'is', 'due', 'to', 'enhanced', 'star', 'formation', 'triggered', 'by', 'gas', 'compression', 'shortly', 'after', 'accretion', 'both', 'the', 'lmc', 'and', 'm33', 'have', 'enhanced', 'recent', 'star', 'formation', 'that', 'could', 'be', 'a', 'manifestation', 'of', 'this', 'process', 'after', 'infall', 'into', 'their', 'mwmass', 'hosts', 'the', 'gr', 'colours', 'of', 'lmcmass', 'dwarfs', 'become', 'bluer', 'for', 'the', 'first', '2', 'gyrs', 'after', 'which', 'they', 'rapidly', 'redden', 'lmcmass', 'dwarfs', 'fell', 'into', 'their', 'mwmass', 'hosts', 'only', 'relatively', 'recently', 'with', 'more', 'than', 'half', 'having', 'an', 'infall', 'time', 'of', 'less', 'than', '35', 'gyrs']]
|
[-0.062185077058631986, 0.1631937744831699, -0.07529740848103501, 0.12348384862459817, -0.0773471039055985, 0.0010021945712227658, 0.06006167599455412, 0.4271250565313775, -0.05488109276686088, -0.40815472127832325, 0.015900657244819594, -0.3077607092421397, 0.027358980985904433, 0.18764464747175635, -0.06579578848907268, -0.09210110871199832, 0.07282624089946395, -0.09788025415738125, -0.05745058647126902, -0.4086698158588036, 0.2834277078546733, 0.0526426120466706, 0.08516162536742847, -0.13817307111913765, 0.023199455318860262, -0.12509696269370466, -0.04643744900266277, -0.08397668172010636, -0.1846733844773173, -0.04805401307843947, 0.22198873283304124, 0.09978994044351829, 0.26537288638228274, -0.36593016980021414, -0.14979106222791785, 0.08708150470470374, 0.2819184754212129, 0.028532052555226207, -0.14979240226703808, -0.2902746461416, 0.12471724149535399, -0.25199651023761993, -0.17991548270383573, 0.15606375894954347, 0.12806942416859948, -0.015023803401992742, -0.1517733509525382, 0.23944915975088696, 0.004282859313006262, 0.10045864411730723, -0.09494494232928836, -0.11003924460415859, -0.14592420755619984, 0.04920488712728495, 0.029651169673456476, 0.09845601927185614, 0.26543512511399975, -0.14976685172335868, 0.04394933655970248, 0.4637425322287593, -0.03786324896847588, 0.08685383008022504, 0.2579296260032369, -0.24142455790438747, -0.19018057932813995, 0.10743332196056962, 0.14354266016463557, 0.104285867689327, -0.15877489788939542, -0.03729937016991076, 0.0119197109216697, 0.20364130272887213, 0.06765598049349933, 0.08155684391450162, 0.3988305897242483, 0.1273246465033915, 0.09533945152939982, 0.00921576879647407, -0.20318205840418108, -0.06618313005906586, -0.08993677038467493, -0.09510227408127796, -0.09282944035009448, 0.09967444720023487, -0.1869056768615213, -0.0602784315881555, 0.30813272604456987, 0.07706270938791544, 0.2879390111230463, 0.15799238053047618, 0.33095888349126623, 0.09084801624078363, 0.21978246400985552, 0.1636204653490619, 0.2924029229612774, 0.19022848695071495, 0.028965996104258908, -0.2020995626843209, 0.06636101020131649, -0.05088528687411164]
|
1,803.0727
|
Optimal Control and Stabilization Problem for Discrete-time Markov Jump
Systems with Indefinite Weight Costs
|
It is well known that stability is the most fundamental nature with regard to
a control system, in view of this, the stabilization becomes an inevitable
control problem. This article mainly discusses the optimal control and
stabilization problem for discrete-time systems involving Markov jump and
multiplicative noise. The state and control weighting matrices in the cost
function are allowed to be indefinite. By solving the forward-backward
stochastic difference equations with Markov jump (FBSDEs-MJ) derived from the
maximum principle, we conclude that the necessary and sufficient conditions of
the solvability of indefinite optimal control problem in finite-horizon, whose
method is different from most previous works [13], etc. Furthermore, necessary
and sufficient conditions that stabilize the Markov jump discrete- time systems
in the mean square sense with indefinite weighting matrices in the cost are
first developed under the basic assumption of exactly observable, which is
different from the previous works [12], [14] where an additional assumption of
stabilization of systems is made. The key points of this article can be summed
up as that an analytic solution to FBSDEs- MJ which makes the optimal
controller to be explicitly expressed and the method of trans- formation, i.e.,
the stabilization problem of indefinite case is boiled down to a definite one
whose stabilization is expressed by defining Lyapunov function via the optimal
cost subject to a new algebraic Riccati equation involving Markov jump
(NGARE-MJ).
|
math.OC
|
it is well known that stability is the most fundamental nature with regard to a control system in view of this the stabilization becomes an inevitable control problem this article mainly discusses the optimal control and stabilization problem for discretetime systems involving markov jump and multiplicative noise the state and control weighting matrices in the cost function are allowed to be indefinite by solving the forwardbackward stochastic difference equations with markov jump fbsdesmj derived from the maximum principle we conclude that the necessary and sufficient conditions of the solvability of indefinite optimal control problem in finitehorizon whose method is different from most previous works 13 etc furthermore necessary and sufficient conditions that stabilize the markov jump discrete time systems in the mean square sense with indefinite weighting matrices in the cost are first developed under the basic assumption of exactly observable which is different from the previous works 12 14 where an additional assumption of stabilization of systems is made the key points of this article can be summed up as that an analytic solution to fbsdes mj which makes the optimal controller to be explicitly expressed and the method of trans formation ie the stabilization problem of indefinite case is boiled down to a definite one whose stabilization is expressed by defining lyapunov function via the optimal cost subject to a new algebraic riccati equation involving markov jump ngaremj
|
[['it', 'is', 'well', 'known', 'that', 'stability', 'is', 'the', 'most', 'fundamental', 'nature', 'with', 'regard', 'to', 'a', 'control', 'system', 'in', 'view', 'of', 'this', 'the', 'stabilization', 'becomes', 'an', 'inevitable', 'control', 'problem', 'this', 'article', 'mainly', 'discusses', 'the', 'optimal', 'control', 'and', 'stabilization', 'problem', 'for', 'discretetime', 'systems', 'involving', 'markov', 'jump', 'and', 'multiplicative', 'noise', 'the', 'state', 'and', 'control', 'weighting', 'matrices', 'in', 'the', 'cost', 'function', 'are', 'allowed', 'to', 'be', 'indefinite', 'by', 'solving', 'the', 'forwardbackward', 'stochastic', 'difference', 'equations', 'with', 'markov', 'jump', 'fbsdesmj', 'derived', 'from', 'the', 'maximum', 'principle', 'we', 'conclude', 'that', 'the', 'necessary', 'and', 'sufficient', 'conditions', 'of', 'the', 'solvability', 'of', 'indefinite', 'optimal', 'control', 'problem', 'in', 'finitehorizon', 'whose', 'method', 'is', 'different', 'from', 'most', 'previous', 'works', '13', 'etc', 'furthermore', 'necessary', 'and', 'sufficient', 'conditions', 'that', 'stabilize', 'the', 'markov', 'jump', 'discrete', 'time', 'systems', 'in', 'the', 'mean', 'square', 'sense', 'with', 'indefinite', 'weighting', 'matrices', 'in', 'the', 'cost', 'are', 'first', 'developed', 'under', 'the', 'basic', 'assumption', 'of', 'exactly', 'observable', 'which', 'is', 'different', 'from', 'the', 'previous', 'works', '12', '14', 'where', 'an', 'additional', 'assumption', 'of', 'stabilization', 'of', 'systems', 'is', 'made', 'the', 'key', 'points', 'of', 'this', 'article', 'can', 'be', 'summed', 'up', 'as', 'that', 'an', 'analytic', 'solution', 'to', 'fbsdes', 'mj', 'which', 'makes', 'the', 'optimal', 'controller', 'to', 'be', 'explicitly', 'expressed', 'and', 'the', 'method', 'of', 'trans', 'formation', 'ie', 'the', 'stabilization', 'problem', 'of', 'indefinite', 'case', 'is', 'boiled', 'down', 'to', 'a', 'definite', 'one', 'whose', 'stabilization', 'is', 'expressed', 'by', 'defining', 'lyapunov', 'function', 'via', 'the', 'optimal', 'cost', 'subject', 'to', 'a', 'new', 'algebraic', 'riccati', 'equation', 'involving', 'markov', 'jump', 'ngaremj']]
|
[-0.1398863787272651, 0.08207959026523831, -0.06047687124616156, 0.046756176580378166, -0.09227533818104125, -0.15787758873244584, 0.03445845545093905, 0.33444634112202676, -0.34754188113800955, -0.2905131851510847, 0.1859824489245575, -0.19902342627756298, -0.1611300571739935, 0.18616743279996803, -0.09792398816952891, 0.11653262217990695, 0.026251296133922183, 0.029979446963121166, -0.07384312030498813, -0.262402541138918, 0.3368709096414437, 0.04831115297259346, 0.24483288279040144, 0.014594055138571238, 0.16637598761978248, 0.012706220807127752, -6.913877982776939e-05, -0.010496967984771911, -0.10450367171895841, 0.10167115346708319, 0.270934926693148, 0.09075551681943532, 0.3150907807182847, -0.3809549674399916, -0.171786789577342, 0.13963466506551445, 0.13064678473254612, 0.09800279576659689, -0.006010718780504376, -0.24855195892578513, 0.09379459536131962, -0.1297941733613251, -0.12829360050729297, -0.02882715299717363, -0.012088188256153412, 0.04266187134239692, -0.32509735095102277, 0.07065750949448302, 0.061030912093038, 0.039882818772049064, -0.09701441752871401, -0.10933854185114206, -0.003080841048677828, 0.10520768805362056, 0.03997378344310595, 0.011819861900763945, 0.10355441085381531, -0.07453821131473473, -0.13385620878334362, 0.3436965292009215, -0.04145268072846975, -0.2637966131421803, 0.15787072473291405, -0.08507573120745324, -0.136832500726246, 0.15743018790421875, 0.14661037992469542, 0.1388953005478374, -0.20580180173151588, 0.09002827611811083, -0.019159234259604363, 0.1690017888608405, 0.05717121907448592, 0.011294095454280052, 0.12741933256926896, 0.14426988466405882, 0.17290543013848692, 0.14706655401632338, 0.01682080698695867, -0.17505378827959167, -0.3356857124405603, -0.1348104844944094, -0.16121589538249137, 0.06790074564949528, -0.07748253192518237, -0.16359375222390027, 0.3435400461271536, 0.14323499425020264, 0.16814101994723865, 0.06997951565069359, 0.2583833634935058, 0.21187415555336006, 0.002196514889140401, 0.0688706402679121, 0.19894918057201594, 0.16373745394409062, 0.09156746257774598, -0.25337936839378816, 0.10305080771356363, 0.0729483098808774]
|
1,803.07271
|
Dynamical Gauge Boson of Hidden Local Symmetry within the Standard Model
|
The Standard Model (SM) Higgs Lagrangian is straightforwardly rewritten into
the {\it scale-invariant} nonlinear sigma model $G/H=[SU(2)_L \times
SU(2)_R]/SU(2)_{V}\simeq O(4)/O(3)$, with the (approximate) scale symmetry
realized nonlinearly by the (pseudo) dilaton ($=$ SM Higgs). It is further
gauge equivalent to that having the symmetry $O(4)_{\rm global}\times O(3)_{\rm
local}$, with $O(3)_{\rm local}$ being the Hidden Local Symmetry (HLS). In the
large $N$ limit of the scale-invariant version of the Grassmannian model
$G/H=O(N)/[O(N-3)\times O(3)] $ $\simeq O(N)_{\rm global}\times [O(N-3)\times
O(3)]_{\rm local}$, identical to the SM for $N\rightarrow 4$, we show that the
kinetic term of the HLS gauge bosons ("SM rho") $\rho_\mu$ of the $O(3)_{\rm
local}\simeq [SU(2)_V]_{\rm local}$ are dynamically generated by the
nonperturbative dynamics of the SM itself. The dynamical SM rho stabilizes the
skyrmion ("SM skyrmion") $X_s$ as a dark matter candidate within the SM: The
mass $M_{X_s} ={\cal O}(10\, {\rm GeV})$ consistent with the direct search
experiments implies the induced HLS gauge coupling $g_{_{\rm HLS}}={\cal
O}(10^3)$, which realizes the relic abundance, $\Omega_{X_s} h^2 ={\cal
O}(0.1)$. If instead $g_{_{\rm HLS}}\lesssim 3.5$ ($M_\rho \lesssim 1.2 $ TeV),
the SM rho could be detected with "narrow width" $\lesssim 100 \,{\rm GeV}$ at
LHC, having all the "$a=2$ results" of the generic HLS Lagrangian ${\cal L}_A+
a {\cal L}_V$, i.e., $\rho$-universality, KSRF relations and the vector meson
dominance, independently of "$a$". There exists the second order phase phase
transition to the unbroken phase having massless $\rho_\mu$ and massive $\pi$
(no longer NG bosons), both becoming massless free particles just on the
transition point (scale-invariant ultraviolet fixed point).The results readily
apply to the 2-flavored QCD as well.
|
hep-ph hep-th nucl-th
|
the standard model sm higgs lagrangian is straightforwardly rewritten into the it scaleinvariant nonlinear sigma model ghsu2_l times su2_rsu2_vsimeq o4o3 with the approximate scale symmetry realized nonlinearly by the pseudo dilaton sm higgs it is further gauge equivalent to that having the symmetry o4_rm globaltimes o3_rm local with o3_rm local being the hidden local symmetry hls in the large n limit of the scaleinvariant version of the grassmannian model ghonon3times o3 simeq on_rm globaltimes on3times o3_rm local identical to the sm for nrightarrow 4 we show that the kinetic term of the hls gauge bosons sm rho rho_mu of the o3_rm localsimeq su2_v_rm local are dynamically generated by the nonperturbative dynamics of the sm itself the dynamical sm rho stabilizes the skyrmion sm skyrmion x_s as a dark matter candidate within the sm the mass m_x_s cal o10 rm gev consistent with the direct search experiments implies the induced hls gauge coupling g__rm hlscal o103 which realizes the relic abundance omega_x_s h2 cal o01 if instead g__rm hlslesssim 35 m_rho lesssim 12 tev the sm rho could be detected with narrow width lesssim 100 rm gev at lhc having all the a2 results of the generic hls lagrangian cal l_a a cal l_v ie rhouniversality ksrf relations and the vector meson dominance independently of a there exists the second order phase phase transition to the unbroken phase having massless rho_mu and massive pi no longer ng bosons both becoming massless free particles just on the transition point scaleinvariant ultraviolet fixed pointthe results readily apply to the 2flavored qcd as well
|
[['the', 'standard', 'model', 'sm', 'higgs', 'lagrangian', 'is', 'straightforwardly', 'rewritten', 'into', 'the', 'it', 'scaleinvariant', 'nonlinear', 'sigma', 'model', 'ghsu2_l', 'times', 'su2_rsu2_vsimeq', 'o4o3', 'with', 'the', 'approximate', 'scale', 'symmetry', 'realized', 'nonlinearly', 'by', 'the', 'pseudo', 'dilaton', 'sm', 'higgs', 'it', 'is', 'further', 'gauge', 'equivalent', 'to', 'that', 'having', 'the', 'symmetry', 'o4_rm', 'globaltimes', 'o3_rm', 'local', 'with', 'o3_rm', 'local', 'being', 'the', 'hidden', 'local', 'symmetry', 'hls', 'in', 'the', 'large', 'n', 'limit', 'of', 'the', 'scaleinvariant', 'version', 'of', 'the', 'grassmannian', 'model', 'ghonon3times', 'o3', 'simeq', 'on_rm', 'globaltimes', 'on3times', 'o3_rm', 'local', 'identical', 'to', 'the', 'sm', 'for', 'nrightarrow', '4', 'we', 'show', 'that', 'the', 'kinetic', 'term', 'of', 'the', 'hls', 'gauge', 'bosons', 'sm', 'rho', 'rho_mu', 'of', 'the', 'o3_rm', 'localsimeq', 'su2_v_rm', 'local', 'are', 'dynamically', 'generated', 'by', 'the', 'nonperturbative', 'dynamics', 'of', 'the', 'sm', 'itself', 'the', 'dynamical', 'sm', 'rho', 'stabilizes', 'the', 'skyrmion', 'sm', 'skyrmion', 'x_s', 'as', 'a', 'dark', 'matter', 'candidate', 'within', 'the', 'sm', 'the', 'mass', 'm_x_s', 'cal', 'o10', 'rm', 'gev', 'consistent', 'with', 'the', 'direct', 'search', 'experiments', 'implies', 'the', 'induced', 'hls', 'gauge', 'coupling', 'g__rm', 'hlscal', 'o103', 'which', 'realizes', 'the', 'relic', 'abundance', 'omega_x_s', 'h2', 'cal', 'o01', 'if', 'instead', 'g__rm', 'hlslesssim', '35', 'm_rho', 'lesssim', '12', 'tev', 'the', 'sm', 'rho', 'could', 'be', 'detected', 'with', 'narrow', 'width', 'lesssim', '100', 'rm', 'gev', 'at', 'lhc', 'having', 'all', 'the', 'a2', 'results', 'of', 'the', 'generic', 'hls', 'lagrangian', 'cal', 'l_a', 'a', 'cal', 'l_v', 'ie', 'rhouniversality', 'ksrf', 'relations', 'and', 'the', 'vector', 'meson', 'dominance', 'independently', 'of', 'a', 'there', 'exists', 'the', 'second', 'order', 'phase', 'phase', 'transition', 'to', 'the', 'unbroken', 'phase', 'having', 'massless', 'rho_mu', 'and', 'massive', 'pi', 'no', 'longer', 'ng', 'bosons', 'both', 'becoming', 'massless', 'free', 'particles', 'just', 'on', 'the', 'transition', 'point', 'scaleinvariant', 'ultraviolet', 'fixed', 'pointthe', 'results', 'readily', 'apply', 'to', 'the', '2flavored', 'qcd', 'as', 'well']]
|
[-0.12006700712401176, 0.28170114499135096, -0.02167272516888887, 0.1284854684433457, -0.06301871363644214, -0.18560963031047664, 0.0014249046712915307, 0.2903504394544441, -0.22762933110657957, -0.27413181900848316, 0.021082464541159723, -0.28471916268167435, -0.025579687088182135, 0.050575350618302886, 0.0761570311270723, 0.04139774686277111, -0.0406353536494206, 0.06883068710086547, -0.08526241504346888, -0.23809694223388359, 0.2234841396910001, 0.009793730426892699, 0.19951644473562216, 0.0207703538357326, 0.061871583235724906, 0.00040215268191026493, 0.04904104911671669, -0.0770586946211969, -0.1313397645224272, 0.04392112522411301, 0.14672471783085742, 0.0486105592161814, 0.10833325995166679, -0.325960523174068, -0.15038021196244802, 0.17078107208601337, 0.16847294064135612, 0.055953411435513745, -0.026733533864302682, -0.35011715513699854, 0.13497815841640018, -0.1762585748086271, -0.1514403058476479, -0.044496329834295405, -0.033438774927893315, -0.1381561924745405, -0.31842056942386093, 0.12216499410703259, -0.0033753442476154305, 0.03611863366295736, -0.004571674315289396, -0.13160578676520418, -0.14199799382305306, -0.0317136791675947, 0.1254786300672348, 0.12138032130171834, 0.18575105794131008, -0.1614273551142448, -0.08635289830701487, 0.44606679450476266, -0.14599474093477913, -0.1369376595286637, 0.13690730592849729, -0.1506797295029382, -0.16498393567414243, 0.16121832401774153, 0.10627405784709451, 0.05820773172070135, -0.11508336861533891, 0.25156645092027274, -0.07101372433501892, 0.226840307767294, 0.0297651583515871, 0.05386758632299521, 0.234983565098774, 0.12439458735943695, 0.05304836398028753, 0.03863363251706478, -0.03512507241952126, -0.10667662584169417, -0.4170090978675079, -0.11426700207514051, -0.08577461011629536, 0.07876313657649663, -0.1437206730617737, -0.09037910553924434, 0.34116614248496707, 0.09285165509113615, 0.23757208280788247, 0.06887471767031009, 0.240546492952758, 0.11262899944577824, 0.12323473393058282, 0.06575965636684636, 0.29329062817278545, 0.1436582238901956, 0.0882718213452179, -0.22859140973813455, -0.09238054796890642, 0.10053482470598804]
|
1,803.07272
|
Electric-field switching of two-dimensional van der Waals magnets
|
Controlling magnetism by purely electrical means is a key challenge to better
information technology1. A variety of material systems, including ferromagnetic
(FM) metals2,3,4, FM semiconductors5, multiferroics6,7,8 and magnetoelectric
(ME) materials9,10, have been explored for the electric-field control of
magnetism. The recent discovery of two-dimensional (2D) van der Waals
magnets11,12 has opened a new door for the electrical control of magnetism at
the nanometre scale through a van der Waals heterostructure device platform13.
Here we demonstrate the control of magnetism in bilayer CrI3, an
antiferromagnetic (AFM) semiconductor in its ground state12, by the application
of small gate voltages in field-effect devices and the detection of
magnetization using magnetic circular dichroism (MCD) microscopy. The applied
electric field creates an interlayer potential difference, which results in a
large linear ME effect, whose sign depends on the interlayer AFM order. We also
achieve a complete and reversible electrical switching between the interlayer
AFM and FM states in the vicinity of the interlayer spin-flip transition. The
effect originates from the electric-field dependence of the interlayer exchange
bias.
|
cond-mat.mes-hall
|
controlling magnetism by purely electrical means is a key challenge to better information technology1 a variety of material systems including ferromagnetic fm metals234 fm semiconductors5 multiferroics678 and magnetoelectric me materials910 have been explored for the electricfield control of magnetism the recent discovery of twodimensional 2d van der waals magnets1112 has opened a new door for the electrical control of magnetism at the nanometre scale through a van der waals heterostructure device platform13 here we demonstrate the control of magnetism in bilayer cri3 an antiferromagnetic afm semiconductor in its ground state12 by the application of small gate voltages in fieldeffect devices and the detection of magnetization using magnetic circular dichroism mcd microscopy the applied electric field creates an interlayer potential difference which results in a large linear me effect whose sign depends on the interlayer afm order we also achieve a complete and reversible electrical switching between the interlayer afm and fm states in the vicinity of the interlayer spinflip transition the effect originates from the electricfield dependence of the interlayer exchange bias
|
[['controlling', 'magnetism', 'by', 'purely', 'electrical', 'means', 'is', 'a', 'key', 'challenge', 'to', 'better', 'information', 'technology1', 'a', 'variety', 'of', 'material', 'systems', 'including', 'ferromagnetic', 'fm', 'metals234', 'fm', 'semiconductors5', 'multiferroics678', 'and', 'magnetoelectric', 'me', 'materials910', 'have', 'been', 'explored', 'for', 'the', 'electricfield', 'control', 'of', 'magnetism', 'the', 'recent', 'discovery', 'of', 'twodimensional', '2d', 'van', 'der', 'waals', 'magnets1112', 'has', 'opened', 'a', 'new', 'door', 'for', 'the', 'electrical', 'control', 'of', 'magnetism', 'at', 'the', 'nanometre', 'scale', 'through', 'a', 'van', 'der', 'waals', 'heterostructure', 'device', 'platform13', 'here', 'we', 'demonstrate', 'the', 'control', 'of', 'magnetism', 'in', 'bilayer', 'cri3', 'an', 'antiferromagnetic', 'afm', 'semiconductor', 'in', 'its', 'ground', 'state12', 'by', 'the', 'application', 'of', 'small', 'gate', 'voltages', 'in', 'fieldeffect', 'devices', 'and', 'the', 'detection', 'of', 'magnetization', 'using', 'magnetic', 'circular', 'dichroism', 'mcd', 'microscopy', 'the', 'applied', 'electric', 'field', 'creates', 'an', 'interlayer', 'potential', 'difference', 'which', 'results', 'in', 'a', 'large', 'linear', 'me', 'effect', 'whose', 'sign', 'depends', 'on', 'the', 'interlayer', 'afm', 'order', 'we', 'also', 'achieve', 'a', 'complete', 'and', 'reversible', 'electrical', 'switching', 'between', 'the', 'interlayer', 'afm', 'and', 'fm', 'states', 'in', 'the', 'vicinity', 'of', 'the', 'interlayer', 'spinflip', 'transition', 'the', 'effect', 'originates', 'from', 'the', 'electricfield', 'dependence', 'of', 'the', 'interlayer', 'exchange', 'bias']]
|
[-0.22666795512539953, 0.15005240329735056, -0.013336049375783017, -0.03128656945063551, -0.06935436773772646, -0.1619354334827399, 0.10288829029368793, 0.38808945282404994, -0.309617128424778, -0.3119085279688035, -0.03796962662898118, -0.3125112153718918, -0.19235987241220912, 0.24366840501543044, 0.06341401161058102, 0.03361281170758203, -0.06861411206276588, -0.09327341573846686, -0.08405835618174112, -0.19154438207837435, 0.2781385499657495, 0.005135392574252697, 0.3319288837856886, 0.15531249748040332, 0.08352781479848867, 0.04454244687165156, 0.17013661307282746, 0.04705075668980277, -0.15831457036149846, 0.09886717521862365, 0.23744500097506338, -0.19172880934159522, 0.2739308143755784, -0.46431798460643464, -0.1679914559680605, -0.029370265298738804, 0.09038814859288721, 0.1993482279635273, -0.1118561868682197, -0.30003738849105815, 0.06904527297947646, -0.1732061060100067, -0.04954462034566393, -0.12451596687925502, 0.0005549483615961834, 0.030697662578526567, -0.2586878229971839, 0.08782401771363434, 0.08158416837942219, 0.15232905514166328, -0.08902304264102429, -0.09868284567009385, -0.04730209145161164, 0.11860015205598845, -0.0032775387204842777, 0.06387505060978937, 0.20751022871174826, -0.12188371992953939, -0.15042661427997234, 0.3210382052972663, -0.05022491173600074, -0.06038781548438526, 0.13177571825756942, -0.16350941564717397, -0.013441577078149905, 0.11285181819438571, 0.11574860011005955, 0.06260964328922876, -0.1525458551477641, 0.11164844750068946, 0.055921699945451465, 0.20632726433488155, 0.06271036872753828, 0.0660214946412186, 0.2964036114039695, 0.2434518521980996, 0.0939830009635288, 0.1357369761723775, -0.13214187584419892, -0.01982160710882986, -0.1585640220266835, -0.17816910185146986, -0.27268720110991923, 0.10016141259736132, -0.09020972609833712, -0.236202036226509, 0.40488198524477276, 0.1709842154012266, 0.13004435143268825, -0.12817701143453966, 0.28339637634230824, 0.06076469556314916, 0.08896237308238973, -0.03642446113824518, 0.3128047312271608, 0.22297001243909684, 0.17007152108750986, -0.3208159717416005, 0.10813378018863704, -0.004211077036438283]
|
1,803.07273
|
First Multicolor Photometry of 1SWASP J130111.22+420214.0 and 1SWASP
J231839.72+352848.2
|
The first multicolor observations and light curve solutions of the stars
1SWASP J130111.22+420214.0 and 1SWASP J231839.72+352848.2 are presented. The
estimated physical parameters of 1SWASP J130111.22+420214.0 are
$M_1=1.0M_{\odot}$, $M_2=1.63M_{\odot}$, $R_1=0.77R_{\odot}$,
$R_2=0.91R_{\odot}$, $L_1=0.59L_{\odot}$, and $L_2=0.68L_{\odot}$. While a
binary model could not be fitted to the light curve of 1SWASP
J231839.72+352848.2, its Fourier series representation indicates that this
system could well be a rotating ellipsoidal variable. The components of 1SWASP
J130111.22+420214.0 are also compared to other well--known binary systems and
their position in mass--radius plane and the Hertzsprung--Russel diagram are
argued and possible evolutionary statuses are discussed.
|
astro-ph.SR
|
the first multicolor observations and light curve solutions of the stars 1swasp j130111224202140 and 1swasp j231839723528482 are presented the estimated physical parameters of 1swasp j130111224202140 are m_110m_odot m_2163m_odot r_1077r_odot r_2091r_odot l_1059l_odot and l_2068l_odot while a binary model could not be fitted to the light curve of 1swasp j231839723528482 its fourier series representation indicates that this system could well be a rotating ellipsoidal variable the components of 1swasp j130111224202140 are also compared to other wellknown binary systems and their position in massradius plane and the hertzsprungrussel diagram are argued and possible evolutionary statuses are discussed
|
[['the', 'first', 'multicolor', 'observations', 'and', 'light', 'curve', 'solutions', 'of', 'the', 'stars', '1swasp', 'j130111224202140', 'and', '1swasp', 'j231839723528482', 'are', 'presented', 'the', 'estimated', 'physical', 'parameters', 'of', '1swasp', 'j130111224202140', 'are', 'm_110m_odot', 'm_2163m_odot', 'r_1077r_odot', 'r_2091r_odot', 'l_1059l_odot', 'and', 'l_2068l_odot', 'while', 'a', 'binary', 'model', 'could', 'not', 'be', 'fitted', 'to', 'the', 'light', 'curve', 'of', '1swasp', 'j231839723528482', 'its', 'fourier', 'series', 'representation', 'indicates', 'that', 'this', 'system', 'could', 'well', 'be', 'a', 'rotating', 'ellipsoidal', 'variable', 'the', 'components', 'of', '1swasp', 'j130111224202140', 'are', 'also', 'compared', 'to', 'other', 'wellknown', 'binary', 'systems', 'and', 'their', 'position', 'in', 'massradius', 'plane', 'and', 'the', 'hertzsprungrussel', 'diagram', 'are', 'argued', 'and', 'possible', 'evolutionary', 'statuses', 'are', 'discussed']]
|
[-0.11789174160248665, 0.10654319717202249, -0.15881895163464685, 0.08218040574358257, -0.15194165251802566, -0.16372460976979414, 0.06600980345852846, 0.39785947429752627, -0.21745700124911096, -0.29659528586320405, 0.14792216824622131, -0.29491073190949335, -0.12199932312441253, 0.27169600449405, -0.1157116893527293, 0.05513053462261248, 0.08657723411560318, -0.009075355426365034, -0.039717552315059315, -0.25682882790258804, 0.25902482453560416, -0.035590711526226164, 0.12080287484203053, -0.07119084448488645, 0.02561948698577146, -0.032247506550426575, -0.03374557415034275, -0.020490084449912228, -0.09873392284879269, 0.0508722897976377, 0.20404779796250339, 0.15876293713010328, 0.08527862209133631, -0.2915226584002592, -0.2243784860989382, 0.06811305215084103, 0.17759755952825207, 0.03340390607695025, -0.011458514983830758, -0.27632439254815583, 0.0589681631658053, -0.15345357224984138, -0.1940511573257661, -0.047817676728807906, 0.07035101978324873, 0.11559569831263426, -0.19888438046151816, 0.06305209777235367, 0.028684278583251545, 0.06435110178494523, -0.15078382118913713, -0.17940431241308838, -0.09706823663450344, 0.07434849057693121, 0.02853102143718536, 0.07946456341765994, 0.072852797448895, -0.06859677046439935, -0.053486031030716245, 0.41152146865808686, -0.05078512041147278, -0.10589536251283663, 0.18697645928342502, -0.14455957371514117, -0.12100783078173219, 0.08345697754127689, 0.14908928796107512, 0.15441553760319948, -0.20714602852595543, -0.03025609359373934, 0.0017147210621556571, 0.19552963191296818, 0.027734880698411617, 0.03086042772913568, 0.33695202012178166, 0.1436070104151271, -0.12286504480500805, 0.11684106247090778, -0.16485737695163766, -0.0975393503586231, -0.2293345095240511, -0.11611321504596014, -0.1077752745463946, -0.02878684475513711, -0.11632243915749335, -0.1373598859970306, 0.35088241925506397, 0.055719803955113556, 0.20181722939014435, 0.0007478812855646707, 0.2679079806128907, 0.10636306175187793, 0.0388344993928534, 0.09123348453363707, 0.3180356225063808, 0.1782438340380268, 0.07468434197145926, -0.22386394339332052, 0.09503252387079301, 0.011060778168030083]
|
1,803.07274
|
eSCAPE: a Large-scale Synthetic Corpus for Automatic Post-Editing
|
Training models for the automatic correction of machine-translated text
usually relies on data consisting of (source, MT, human post- edit) triplets
providing, for each source sentence, examples of translation errors with the
corresponding corrections made by a human post-editor. Ideally, a large amount
of data of this kind should allow the model to learn reliable correction
patterns and effectively apply them at test stage on unseen (source, MT) pairs.
In practice, however, their limited availability calls for solutions that also
integrate in the training process other sources of knowledge. Along this
direction, state-of-the-art results have been recently achieved by systems
that, in addition to a limited amount of available training data, exploit
artificial corpora that approximate elements of the "gold" training instances
with automatic translations. Following this idea, we present eSCAPE, the
largest freely-available Synthetic Corpus for Automatic Post-Editing released
so far. eSCAPE consists of millions of entries in which the MT element of the
training triplets has been obtained by translating the source side of
publicly-available parallel corpora, and using the target side as an artificial
human post-edit. Translations are obtained both with phrase-based and neural
models. For each MT paradigm, eSCAPE contains 7.2 million triplets for
English-German and 3.3 millions for English-Italian, resulting in a total of
14,4 and 6,6 million instances respectively. The usefulness of eSCAPE is proved
through experiments in a general-domain scenario, the most challenging one for
automatic post-editing. For both language directions, the models trained on our
artificial data always improve MT quality with statistically significant gains.
The current version of eSCAPE can be freely downloaded from:
http://hltshare.fbk.eu/QT21/eSCAPE.html.
|
cs.CL
|
training models for the automatic correction of machinetranslated text usually relies on data consisting of source mt human post edit triplets providing for each source sentence examples of translation errors with the corresponding corrections made by a human posteditor ideally a large amount of data of this kind should allow the model to learn reliable correction patterns and effectively apply them at test stage on unseen source mt pairs in practice however their limited availability calls for solutions that also integrate in the training process other sources of knowledge along this direction stateoftheart results have been recently achieved by systems that in addition to a limited amount of available training data exploit artificial corpora that approximate elements of the gold training instances with automatic translations following this idea we present escape the largest freelyavailable synthetic corpus for automatic postediting released so far escape consists of millions of entries in which the mt element of the training triplets has been obtained by translating the source side of publiclyavailable parallel corpora and using the target side as an artificial human postedit translations are obtained both with phrasebased and neural models for each mt paradigm escape contains 72 million triplets for englishgerman and 33 millions for englishitalian resulting in a total of 144 and 66 million instances respectively the usefulness of escape is proved through experiments in a generaldomain scenario the most challenging one for automatic postediting for both language directions the models trained on our artificial data always improve mt quality with statistically significant gains the current version of escape can be freely downloaded from httphltsharefbkeuqt21escapehtml
|
[['training', 'models', 'for', 'the', 'automatic', 'correction', 'of', 'machinetranslated', 'text', 'usually', 'relies', 'on', 'data', 'consisting', 'of', 'source', 'mt', 'human', 'post', 'edit', 'triplets', 'providing', 'for', 'each', 'source', 'sentence', 'examples', 'of', 'translation', 'errors', 'with', 'the', 'corresponding', 'corrections', 'made', 'by', 'a', 'human', 'posteditor', 'ideally', 'a', 'large', 'amount', 'of', 'data', 'of', 'this', 'kind', 'should', 'allow', 'the', 'model', 'to', 'learn', 'reliable', 'correction', 'patterns', 'and', 'effectively', 'apply', 'them', 'at', 'test', 'stage', 'on', 'unseen', 'source', 'mt', 'pairs', 'in', 'practice', 'however', 'their', 'limited', 'availability', 'calls', 'for', 'solutions', 'that', 'also', 'integrate', 'in', 'the', 'training', 'process', 'other', 'sources', 'of', 'knowledge', 'along', 'this', 'direction', 'stateoftheart', 'results', 'have', 'been', 'recently', 'achieved', 'by', 'systems', 'that', 'in', 'addition', 'to', 'a', 'limited', 'amount', 'of', 'available', 'training', 'data', 'exploit', 'artificial', 'corpora', 'that', 'approximate', 'elements', 'of', 'the', 'gold', 'training', 'instances', 'with', 'automatic', 'translations', 'following', 'this', 'idea', 'we', 'present', 'escape', 'the', 'largest', 'freelyavailable', 'synthetic', 'corpus', 'for', 'automatic', 'postediting', 'released', 'so', 'far', 'escape', 'consists', 'of', 'millions', 'of', 'entries', 'in', 'which', 'the', 'mt', 'element', 'of', 'the', 'training', 'triplets', 'has', 'been', 'obtained', 'by', 'translating', 'the', 'source', 'side', 'of', 'publiclyavailable', 'parallel', 'corpora', 'and', 'using', 'the', 'target', 'side', 'as', 'an', 'artificial', 'human', 'postedit', 'translations', 'are', 'obtained', 'both', 'with', 'phrasebased', 'and', 'neural', 'models', 'for', 'each', 'mt', 'paradigm', 'escape', 'contains', '72', 'million', 'triplets', 'for', 'englishgerman', 'and', '33', 'millions', 'for', 'englishitalian', 'resulting', 'in', 'a', 'total', 'of', '144', 'and', '66', 'million', 'instances', 'respectively', 'the', 'usefulness', 'of', 'escape', 'is', 'proved', 'through', 'experiments', 'in', 'a', 'generaldomain', 'scenario', 'the', 'most', 'challenging', 'one', 'for', 'automatic', 'postediting', 'for', 'both', 'language', 'directions', 'the', 'models', 'trained', 'on', 'our', 'artificial', 'data', 'always', 'improve', 'mt', 'quality', 'with', 'statistically', 'significant', 'gains', 'the', 'current', 'version', 'of', 'escape', 'can', 'be', 'freely', 'downloaded', 'from', 'httphltsharefbkeuqt21escapehtml']]
|
[-0.056564178926726945, 0.06109036391208065, -3.289377603393335e-07, 0.06447315658826763, -0.10301765205804259, -0.14522560506056134, 0.08410431277289508, 0.4114391754094798, -0.23994931155108273, -0.37853500961791725, 0.09010878693230692, -0.32879752800083506, -0.05306662702932954, 0.25478312053735586, -0.07383079135145705, 0.057517938133465715, 0.17625997778198396, 0.06909857982178577, -0.020906409773921882, -0.30085054447990844, 0.2734444577184219, 0.04569486710422028, 0.3313448098523972, -0.010592675842165661, 0.12584592684601936, -0.048214350959572654, -0.06246034348688017, -0.04322006441473674, -0.024565505199195915, 0.17717178887150323, 0.2753646071741549, 0.20005044338938135, 0.2832754978014586, -0.4005684259813279, -0.1987091553513892, 0.07865032939097057, 0.14821790973029028, 0.13037914731853212, -0.07371677597716021, -0.31658996396805517, 0.10463102466847676, -0.1467440794616078, -0.026142818315957602, -0.07672745787646049, 0.03091708692865303, 0.003431316219100084, -0.26288584119331343, 0.03769541757904405, 0.06406684396340727, 0.1204664279993337, -0.03769918928692977, -0.12456906499976937, -0.002238540169603836, 0.19477884352851946, 0.045069465748943355, 0.06810976397201347, 0.11088611682912765, -0.1428566811694719, -0.13213676611463038, 0.37353185816453055, -0.08059356963987319, -0.21612457715942024, 0.18531947404665586, -0.04609285705507948, -0.15055397007381544, 0.13053973880238257, 0.22543208253829597, 0.1025695319930002, -0.20977022563859535, 0.027800488390270262, -0.027247255492525605, 0.22679215013139092, 0.07486591141473932, -0.03311488959186066, 0.20330597676578552, 0.18722529761905138, -0.035478601979915626, 0.15353762400045526, -0.12619299255949534, -0.05410852644753714, -0.24362366183911666, -0.11342304825890236, -0.1699478132027882, 0.007212873860267931, -0.07427541044615701, -0.14354933649620552, 0.36474449110862156, 0.212798441762033, 0.1874073540276955, 0.09469939478664086, 0.3050835757695425, 0.0002342269397698916, 0.14944003921969293, 0.08322719908140314, 0.19686459176994572, -0.015705360816970753, 0.13622069737981432, -0.15633278887880106, 0.08462480830583864, 0.024958678308981828]
|
1,803.07275
|
Geometric extension of Clauser-Horne inequality to more qubits
|
We propose a geometric multiparty extension of Clauser-Horne (CH) inequality.
The standard CH inequality can be shown to be an implication of the fact that
statistical separation between two events, $A$ and $B$, defined as $P(A\oplus
B)$, where $A\oplus B=(A-B)\cup(B-A)$, satisfies the axioms of a distance. Our
extension for tripartite case is based on triangle inequalities for the
statistical separations of three probabilistic events $P(A\oplus B \oplus C)$.
We show that Mermin inequality can be retrieved from our extended CH inequality
for three subsystems. With our tripartite CH inequality, we investigate quantum
violations by GHZ-type and W-type states. Our inequalities are compared to
another type, so-called $N$-site CH inequality. In addition we argue how to
generalize our method for more subsystems and measurement settings. Our method
can be used to write down several Bell-type inequalities in a systematic
manner.
|
quant-ph
|
we propose a geometric multiparty extension of clauserhorne ch inequality the standard ch inequality can be shown to be an implication of the fact that statistical separation between two events a and b defined as paoplus b where aoplus babcupba satisfies the axioms of a distance our extension for tripartite case is based on triangle inequalities for the statistical separations of three probabilistic events paoplus b oplus c we show that mermin inequality can be retrieved from our extended ch inequality for three subsystems with our tripartite ch inequality we investigate quantum violations by ghztype and wtype states our inequalities are compared to another type socalled nsite ch inequality in addition we argue how to generalize our method for more subsystems and measurement settings our method can be used to write down several belltype inequalities in a systematic manner
|
[['we', 'propose', 'a', 'geometric', 'multiparty', 'extension', 'of', 'clauserhorne', 'ch', 'inequality', 'the', 'standard', 'ch', 'inequality', 'can', 'be', 'shown', 'to', 'be', 'an', 'implication', 'of', 'the', 'fact', 'that', 'statistical', 'separation', 'between', 'two', 'events', 'a', 'and', 'b', 'defined', 'as', 'paoplus', 'b', 'where', 'aoplus', 'babcupba', 'satisfies', 'the', 'axioms', 'of', 'a', 'distance', 'our', 'extension', 'for', 'tripartite', 'case', 'is', 'based', 'on', 'triangle', 'inequalities', 'for', 'the', 'statistical', 'separations', 'of', 'three', 'probabilistic', 'events', 'paoplus', 'b', 'oplus', 'c', 'we', 'show', 'that', 'mermin', 'inequality', 'can', 'be', 'retrieved', 'from', 'our', 'extended', 'ch', 'inequality', 'for', 'three', 'subsystems', 'with', 'our', 'tripartite', 'ch', 'inequality', 'we', 'investigate', 'quantum', 'violations', 'by', 'ghztype', 'and', 'wtype', 'states', 'our', 'inequalities', 'are', 'compared', 'to', 'another', 'type', 'socalled', 'nsite', 'ch', 'inequality', 'in', 'addition', 'we', 'argue', 'how', 'to', 'generalize', 'our', 'method', 'for', 'more', 'subsystems', 'and', 'measurement', 'settings', 'our', 'method', 'can', 'be', 'used', 'to', 'write', 'down', 'several', 'belltype', 'inequalities', 'in', 'a', 'systematic', 'manner']]
|
[-0.08265810040243463, 0.08585022764910878, -0.08214604366666582, 0.09863683162685073, -0.018826786706032342, -0.2487255240420756, 0.05650305186966708, 0.31758828945406575, -0.28807056056992975, -0.28964190738385215, 0.06846040349474232, -0.2837333312730634, -0.10447232647771564, 0.21593252127401202, -0.09196102566099451, 0.039186305113081986, 0.06483216772047694, -0.001147784207098405, -0.08041868423221304, -0.2384337311326389, 0.29089300530990037, -0.062439990603974475, 0.23679821696885697, 0.05822483723322341, 0.029672399361836996, 0.004466995911891846, 0.03587723080208354, 0.05774948883181958, -0.134851457500297, 0.14938712126176518, 0.23796083398081144, 0.2171775078168139, 0.22213025252088248, -0.36122670604655627, -0.16620954944450847, 0.13828423456288874, 0.10838441114174202, 0.08421438758480637, 0.010959513273465907, -0.3465976017126677, 0.028351848595775664, -0.1721767015645609, -0.10683197346310515, -0.10917230904348851, 0.02280338796074776, -0.016663500861100414, -0.34028446255251765, 0.151109827323714, 0.10205277993330075, 0.037149647096050425, -0.006056736014536856, -0.08719965107465054, 0.015030394414412406, 0.03298887254769558, -0.03865318468203494, 0.01665044785134823, 0.10548506144037031, 0.013160455410423525, -0.18126418360043317, 0.35221220029737144, -0.05328483305236338, -0.244469360972289, 0.18025798584601624, -0.11007064216263483, -0.2233319975613781, -0.0245260609765811, 0.11092411500730497, 0.11484563300687381, -0.1619163086733726, 0.04177257486127714, -0.10116121237960589, 0.17384404092958636, 0.08413606460260994, 0.09949464133858461, 0.09577295847702771, 0.05401573799249223, 0.11311538042911493, 0.1887588992848417, -0.061702468417078146, -0.09042167854289908, -0.3691935932318516, -0.24066442245983874, -0.18019159264889928, 0.089005293276654, -0.1181226062537248, -0.049888996366943876, 0.303851183706737, 0.10213924641378552, 0.153139215455774, 0.06597935893018182, 0.19233639292446347, 0.08800389182579238, 0.06527786506451187, 0.06192890290677657, 0.2566234640942318, 0.18629193465697907, 0.07873403424438198, -0.16679658289135926, 0.07591574555536841, 0.0937204948379932]
|
1,803.07276
|
Removing Confounding Factors Associated Weights in Deep Neural Networks
Improves the Prediction Accuracy for Healthcare Applications
|
The proliferation of healthcare data has brought the opportunities of
applying data-driven approaches, such as machine learning methods, to assist
diagnosis. Recently, many deep learning methods have been shown with impressive
successes in predicting disease status with raw input data. However, the
"black-box" nature of deep learning and the high-reliability requirement of
biomedical applications have created new challenges regarding the existence of
confounding factors. In this paper, with a brief argument that inappropriate
handling of confounding factors will lead to models' sub-optimal performance in
real-world applications, we present an efficient method that can remove the
influences of confounding factors such as age or gender to improve the
across-cohort prediction accuracy of neural networks. One distinct advantage of
our method is that it only requires minimal changes of the baseline model's
architecture so that it can be plugged into most of the existing neural
networks. We conduct experiments across CT-scan, MRA, and EEG brain wave with
convolutional neural networks and LSTM to verify the efficiency of our method.
|
stat.ML cs.LG
|
the proliferation of healthcare data has brought the opportunities of applying datadriven approaches such as machine learning methods to assist diagnosis recently many deep learning methods have been shown with impressive successes in predicting disease status with raw input data however the blackbox nature of deep learning and the highreliability requirement of biomedical applications have created new challenges regarding the existence of confounding factors in this paper with a brief argument that inappropriate handling of confounding factors will lead to models suboptimal performance in realworld applications we present an efficient method that can remove the influences of confounding factors such as age or gender to improve the acrosscohort prediction accuracy of neural networks one distinct advantage of our method is that it only requires minimal changes of the baseline models architecture so that it can be plugged into most of the existing neural networks we conduct experiments across ctscan mra and eeg brain wave with convolutional neural networks and lstm to verify the efficiency of our method
|
[['the', 'proliferation', 'of', 'healthcare', 'data', 'has', 'brought', 'the', 'opportunities', 'of', 'applying', 'datadriven', 'approaches', 'such', 'as', 'machine', 'learning', 'methods', 'to', 'assist', 'diagnosis', 'recently', 'many', 'deep', 'learning', 'methods', 'have', 'been', 'shown', 'with', 'impressive', 'successes', 'in', 'predicting', 'disease', 'status', 'with', 'raw', 'input', 'data', 'however', 'the', 'blackbox', 'nature', 'of', 'deep', 'learning', 'and', 'the', 'highreliability', 'requirement', 'of', 'biomedical', 'applications', 'have', 'created', 'new', 'challenges', 'regarding', 'the', 'existence', 'of', 'confounding', 'factors', 'in', 'this', 'paper', 'with', 'a', 'brief', 'argument', 'that', 'inappropriate', 'handling', 'of', 'confounding', 'factors', 'will', 'lead', 'to', 'models', 'suboptimal', 'performance', 'in', 'realworld', 'applications', 'we', 'present', 'an', 'efficient', 'method', 'that', 'can', 'remove', 'the', 'influences', 'of', 'confounding', 'factors', 'such', 'as', 'age', 'or', 'gender', 'to', 'improve', 'the', 'acrosscohort', 'prediction', 'accuracy', 'of', 'neural', 'networks', 'one', 'distinct', 'advantage', 'of', 'our', 'method', 'is', 'that', 'it', 'only', 'requires', 'minimal', 'changes', 'of', 'the', 'baseline', 'models', 'architecture', 'so', 'that', 'it', 'can', 'be', 'plugged', 'into', 'most', 'of', 'the', 'existing', 'neural', 'networks', 'we', 'conduct', 'experiments', 'across', 'ctscan', 'mra', 'and', 'eeg', 'brain', 'wave', 'with', 'convolutional', 'neural', 'networks', 'and', 'lstm', 'to', 'verify', 'the', 'efficiency', 'of', 'our', 'method']]
|
[-0.03499402917559674, -0.00890150252392681, -0.06807524897298406, 0.045863884579704466, -0.1266557311061321, -0.17968798945209077, 0.02737081573549546, 0.43685438296566886, -0.2579487548132584, -0.3372432193550539, 0.07679729849304892, -0.26209891132213714, -0.25118691747564914, 0.22470711293512485, -0.14612316252125135, 0.11321244725792007, 0.16007013374053122, 0.03147285116320274, -0.04405829686873469, -0.32145733349249667, 0.28533974372086124, 0.04359556886988849, 0.3653053864331759, 0.06682070346229362, 0.10957117523038648, -0.050265871015368925, -0.044765604604512496, -0.003244415705417653, -0.03174282105570148, 0.18157885143648536, 0.3569158611625678, 0.2465145432780194, 0.39109260586640204, -0.4617811779278409, -0.2971365505391844, 0.1302783734176353, 0.16304425249950602, 0.09915797302712608, -0.03635026221808764, -0.32267262262056573, 0.09199255786089967, -0.19007915184070098, -0.0447584020299276, -0.17380197972889586, -0.018893773948033172, 0.01680991765888722, -0.2802756157681256, 0.05960486005256738, 0.06353448058691728, 0.07443319305957082, -0.02704993726163878, -0.1469612862768931, 0.05443106030663812, 0.19676933652743786, 0.11003892790843138, 0.05502810621148828, 0.13965233539915586, -0.2137076440000772, -0.17888769416520037, 0.32726666330309384, -0.03289854032526084, -0.18412338173948228, 0.20005354941864667, -0.012771110362457448, -0.18403700469847184, 0.08576361638920224, 0.24327597239178167, 0.05406666415356414, -0.16998926497692893, 0.010454553269559562, 0.01687243787849852, 0.16331339894700742, 0.028161932808958578, 0.018580658728795416, 0.16944151872864374, 0.290144131378641, -0.012109336401518232, 0.08232107329538586, -0.1316811466903269, -0.030397512468212026, -0.18626467926786786, -0.10398218991706171, -0.14725694415462484, 0.0023053099129717878, -0.10170497273206108, -0.1529042460197928, 0.39880149403631865, 0.25415448381015693, 0.16952503539715805, 0.04386509666818963, 0.3491366451973634, 0.03604790069869753, 0.16293607837329788, 0.06391550002743053, 0.20090715424999236, 0.047626090381351995, 0.11646040186779685, -0.1871817671751368, 0.1326344497067046, -0.01639072233754917]
|
1,803.07277
|
Anisotropic Pauli spin-blockade effect and spin-orbit interaction field
in an InAs nanowire double quantum dot
|
We report on experimental detection of the spin-orbit interaction field in an
InAs nanowire double quantum dot device. In the spin blockade regime, leakage
current through the double quantum dot is measured and is used to extract the
effects of spin-orbit interaction and hyperfine interaction on spin state
mixing. At finite magnetic fields, the leakage current arising from the
hyperfine interaction is suppressed and the spin-orbit interaction dominates
spin state mixing. We observe dependence of the leakage current on the applied
magnetic field direction and determine the direction of the spin-orbit
interaction field. We show that the spin-orbit field lies in a direction
perpendicular to the nanowire axis but with a pronounced off-substrate-plane
angle. It is for the first time that such an off-substrate-plane spin-orbit
field in an InAs nanowire has been detected. The results are expected to have
an important implication in employing InAs nanowires to construct spin-orbit
qubits and topological quantum devices.
|
cond-mat.mes-hall
|
we report on experimental detection of the spinorbit interaction field in an inas nanowire double quantum dot device in the spin blockade regime leakage current through the double quantum dot is measured and is used to extract the effects of spinorbit interaction and hyperfine interaction on spin state mixing at finite magnetic fields the leakage current arising from the hyperfine interaction is suppressed and the spinorbit interaction dominates spin state mixing we observe dependence of the leakage current on the applied magnetic field direction and determine the direction of the spinorbit interaction field we show that the spinorbit field lies in a direction perpendicular to the nanowire axis but with a pronounced offsubstrateplane angle it is for the first time that such an offsubstrateplane spinorbit field in an inas nanowire has been detected the results are expected to have an important implication in employing inas nanowires to construct spinorbit qubits and topological quantum devices
|
[['we', 'report', 'on', 'experimental', 'detection', 'of', 'the', 'spinorbit', 'interaction', 'field', 'in', 'an', 'inas', 'nanowire', 'double', 'quantum', 'dot', 'device', 'in', 'the', 'spin', 'blockade', 'regime', 'leakage', 'current', 'through', 'the', 'double', 'quantum', 'dot', 'is', 'measured', 'and', 'is', 'used', 'to', 'extract', 'the', 'effects', 'of', 'spinorbit', 'interaction', 'and', 'hyperfine', 'interaction', 'on', 'spin', 'state', 'mixing', 'at', 'finite', 'magnetic', 'fields', 'the', 'leakage', 'current', 'arising', 'from', 'the', 'hyperfine', 'interaction', 'is', 'suppressed', 'and', 'the', 'spinorbit', 'interaction', 'dominates', 'spin', 'state', 'mixing', 'we', 'observe', 'dependence', 'of', 'the', 'leakage', 'current', 'on', 'the', 'applied', 'magnetic', 'field', 'direction', 'and', 'determine', 'the', 'direction', 'of', 'the', 'spinorbit', 'interaction', 'field', 'we', 'show', 'that', 'the', 'spinorbit', 'field', 'lies', 'in', 'a', 'direction', 'perpendicular', 'to', 'the', 'nanowire', 'axis', 'but', 'with', 'a', 'pronounced', 'offsubstrateplane', 'angle', 'it', 'is', 'for', 'the', 'first', 'time', 'that', 'such', 'an', 'offsubstrateplane', 'spinorbit', 'field', 'in', 'an', 'inas', 'nanowire', 'has', 'been', 'detected', 'the', 'results', 'are', 'expected', 'to', 'have', 'an', 'important', 'implication', 'in', 'employing', 'inas', 'nanowires', 'to', 'construct', 'spinorbit', 'qubits', 'and', 'topological', 'quantum', 'devices']]
|
[-0.2467742050326993, 0.18659343177147858, 0.019892807501539784, 0.013629701135582045, -0.025762368238678102, -0.16346908210758365, -0.009536928371648844, 0.43746905753045884, -0.2703773663930693, -0.30425050540974263, -0.035827773942544716, -0.288824507084332, -0.06936736714621809, 0.22469427455584273, 0.06704794265648448, -0.016478037170600146, 0.016351049612766427, -0.01441890846839861, -0.06844431135840223, -0.1842292191653733, 0.32666516084665137, 0.005995524922342922, 0.3104827314474326, 0.14931199770408535, 0.07303494038244121, 0.022420866506811427, 0.13759940422115555, -0.0031372622822680952, -0.11461547259702791, 0.03054435653336297, 0.19266168785658297, -0.10543634562207826, 0.18142198224569783, -0.4816053468292873, -0.14329682332218477, -0.00788028178565008, 0.16348738218718945, 0.21476633328558437, -0.0961517338605757, -0.33600633957432463, 0.004166977575024296, -0.16635630789096467, -0.07872288845742571, -0.03707866085154053, 0.014429561115991274, -0.03999877825845033, -0.26245805654233617, 0.04180590827998362, 0.056653042462513487, 0.05421783383970155, -0.02076273027925804, -0.08211610060626347, -0.02670870636785893, 0.0990175605953769, 0.061207222796694716, 0.10786455048946664, 0.21859418236540237, -0.14786733588966613, -0.16493891707106836, 0.32202971450935464, -0.11566668452992178, -0.15193945428013408, 0.1205342857053773, -0.1953109764849375, -0.03897600088538112, 0.1050844777798231, 0.15572444277840028, 0.0853343214357186, -0.10735081067909241, 0.13146104593263436, 0.03399219083918357, 0.167664268312939, -0.018080216480149448, 0.09729166895053104, 0.27178984200336825, 0.16765838638361616, 0.06649217468619004, 0.12412013404919937, -0.21138996457969034, -0.08446786702782112, -0.23056381424937986, -0.16825904758451016, -0.24114286219456085, 0.11690094355971699, -0.03794271633054641, -0.16498704482556173, 0.4194008444472657, 0.19749990427992184, 0.136051228951577, -0.07124774802574202, 0.3039442951251802, 0.151767688990252, 0.10284510749931398, -0.001462172232813349, 0.35123724652160154, 0.26093627853735696, 0.06749360121811103, -0.36029390753461293, 0.07659167420321242, -0.06809078080359061]
|
1,803.07278
|
Text Detection and Recognition in images: A survey
|
Text Detection and recognition is a one of the important aspect of image
processing. This paper analyzes and compares the methods to handle this task.
It summarizes the fundamental problems and enumerates factors that need
consideration when addressing these problems. Existing techniques are
categorized as either stepwise or integrated and sub-problems are highlighted
including digit localization, verification, segmentation and recognition.
Special issues associated with the enhancement of degraded text and the
processing of video text and multi-oriented text are also addressed. The
categories and sub-categories of text are illustrated, benchmark datasets are
enumerated, and the performance of the most representative approaches is
compared. This review also provides a fundamental comparison and analysis of
the remaining problems in the field.
|
cs.CV
|
text detection and recognition is a one of the important aspect of image processing this paper analyzes and compares the methods to handle this task it summarizes the fundamental problems and enumerates factors that need consideration when addressing these problems existing techniques are categorized as either stepwise or integrated and subproblems are highlighted including digit localization verification segmentation and recognition special issues associated with the enhancement of degraded text and the processing of video text and multioriented text are also addressed the categories and subcategories of text are illustrated benchmark datasets are enumerated and the performance of the most representative approaches is compared this review also provides a fundamental comparison and analysis of the remaining problems in the field
|
[['text', 'detection', 'and', 'recognition', 'is', 'a', 'one', 'of', 'the', 'important', 'aspect', 'of', 'image', 'processing', 'this', 'paper', 'analyzes', 'and', 'compares', 'the', 'methods', 'to', 'handle', 'this', 'task', 'it', 'summarizes', 'the', 'fundamental', 'problems', 'and', 'enumerates', 'factors', 'that', 'need', 'consideration', 'when', 'addressing', 'these', 'problems', 'existing', 'techniques', 'are', 'categorized', 'as', 'either', 'stepwise', 'or', 'integrated', 'and', 'subproblems', 'are', 'highlighted', 'including', 'digit', 'localization', 'verification', 'segmentation', 'and', 'recognition', 'special', 'issues', 'associated', 'with', 'the', 'enhancement', 'of', 'degraded', 'text', 'and', 'the', 'processing', 'of', 'video', 'text', 'and', 'multioriented', 'text', 'are', 'also', 'addressed', 'the', 'categories', 'and', 'subcategories', 'of', 'text', 'are', 'illustrated', 'benchmark', 'datasets', 'are', 'enumerated', 'and', 'the', 'performance', 'of', 'the', 'most', 'representative', 'approaches', 'is', 'compared', 'this', 'review', 'also', 'provides', 'a', 'fundamental', 'comparison', 'and', 'analysis', 'of', 'the', 'remaining', 'problems', 'in', 'the', 'field']]
|
[-0.09206904491268787, -0.024152256865367417, -0.0034669429169451238, 0.06916005573990684, -0.07402673106984932, -0.17224944237337894, -0.025147018561867542, 0.40640701785558414, -0.27874976355179426, -0.3201339085187231, 0.17876595995161965, -0.31018160104320164, -0.14266220359092563, 0.23664369178004563, -0.15215107283218443, 0.06867868016266554, 0.14876231429472314, 0.05950772181591567, -0.05286126940691171, -0.2920139698211902, 0.326414488365545, -0.010406429538925906, 0.3330225735010595, 0.07594406598505854, 0.07682852515121218, -0.055435578668971364, -0.1311016573586321, 0.009793089284021565, -0.06030488764005566, 0.19188684046644122, 0.3658884695942412, 0.19924745638267832, 0.2672166717786561, -0.3670114346940321, -0.18104269084918798, 0.04978361037195887, 0.20025853626821347, 0.08427068420420225, -0.04707639877285276, -0.3339017177892833, 0.10873284751741107, -0.11342268755675114, 0.0489697259295137, -0.10001346243138448, 0.02072959559668294, 0.012491822811117506, -0.2392097985168465, 0.05197247850880841, 0.10663474886091191, 0.09987525363304034, -0.04994421838117497, -0.17285238654243157, 0.09184990961402029, 0.19256787003676346, 0.1183438646331226, 0.027594841264399598, 0.14029069892482973, -0.22083670868804411, -0.1653267185256558, 0.4618522059015867, 0.02934609216974438, -0.21043651384504966, 0.20584975434917205, -0.003284196727400442, -0.18874164420657424, 0.07706949811041386, 0.17850907049494005, 0.1222841403752315, -0.1395415820778365, 0.03893602937127331, -0.024635646617462655, 0.1638004275023186, 0.10195446263670045, 0.008293540097509917, 0.1650060867800714, 0.2641987658219271, -0.013852169825754152, 0.15817930892955104, -0.10253788728096734, -0.04947690329193568, -0.2577063234820336, -0.13691493050985726, -0.12881928947441154, -0.059906434924185216, -0.07751486429571909, -0.13981574459173599, 0.4165701749695449, 0.21715886934030362, 0.17081403630167372, 0.03326596325545126, 0.34849981894763576, 0.06411482343433558, 0.06229605879478094, 0.038864777861221715, 0.1456516902657038, 0.0595536823472509, 0.1055903882414353, -0.14796289948633082, 0.047952761609467265, 0.045367026568523476]
|
1,803.07279
|
Spin-orbit-coupled ferroelectric superconductivity
|
Motivated by recent studies on ferroelectric-like order coexisting with
metallicity, we investigate ferroelectric (FE) superconductivity in which a
FE-like structural phase transition occurs in the superconducting state. We
consider a two-dimensional s-wave superconductor with Rashba-type antisymmetric
spin-orbit coupling (ASOC). Assuming linear relationship between polar lattice
displacement and strength of the ASOC, we treat the Rashba-type ASOC as a
molecular field of FE-like order. It is shown that the FE-like order is induced
by the magnetic field when the system is superconducting. Furthermore, we
clarify the FE superconductivity in a low carrier density regime, which was
recently discovered in doped SrTiO$_3$. It is demonstrated that the FE
superconducting state can be stable in this regime in the absence of the
magnetic field. Our results open a way to control the electric polarization by
superconductivity, that is, superconducting multiferroics.
|
cond-mat.supr-con
|
motivated by recent studies on ferroelectriclike order coexisting with metallicity we investigate ferroelectric fe superconductivity in which a felike structural phase transition occurs in the superconducting state we consider a twodimensional swave superconductor with rashbatype antisymmetric spinorbit coupling asoc assuming linear relationship between polar lattice displacement and strength of the asoc we treat the rashbatype asoc as a molecular field of felike order it is shown that the felike order is induced by the magnetic field when the system is superconducting furthermore we clarify the fe superconductivity in a low carrier density regime which was recently discovered in doped srtio_3 it is demonstrated that the fe superconducting state can be stable in this regime in the absence of the magnetic field our results open a way to control the electric polarization by superconductivity that is superconducting multiferroics
|
[['motivated', 'by', 'recent', 'studies', 'on', 'ferroelectriclike', 'order', 'coexisting', 'with', 'metallicity', 'we', 'investigate', 'ferroelectric', 'fe', 'superconductivity', 'in', 'which', 'a', 'felike', 'structural', 'phase', 'transition', 'occurs', 'in', 'the', 'superconducting', 'state', 'we', 'consider', 'a', 'twodimensional', 'swave', 'superconductor', 'with', 'rashbatype', 'antisymmetric', 'spinorbit', 'coupling', 'asoc', 'assuming', 'linear', 'relationship', 'between', 'polar', 'lattice', 'displacement', 'and', 'strength', 'of', 'the', 'asoc', 'we', 'treat', 'the', 'rashbatype', 'asoc', 'as', 'a', 'molecular', 'field', 'of', 'felike', 'order', 'it', 'is', 'shown', 'that', 'the', 'felike', 'order', 'is', 'induced', 'by', 'the', 'magnetic', 'field', 'when', 'the', 'system', 'is', 'superconducting', 'furthermore', 'we', 'clarify', 'the', 'fe', 'superconductivity', 'in', 'a', 'low', 'carrier', 'density', 'regime', 'which', 'was', 'recently', 'discovered', 'in', 'doped', 'srtio_3', 'it', 'is', 'demonstrated', 'that', 'the', 'fe', 'superconducting', 'state', 'can', 'be', 'stable', 'in', 'this', 'regime', 'in', 'the', 'absence', 'of', 'the', 'magnetic', 'field', 'our', 'results', 'open', 'a', 'way', 'to', 'control', 'the', 'electric', 'polarization', 'by', 'superconductivity', 'that', 'is', 'superconducting', 'multiferroics']]
|
[-0.24061349438703925, 0.22735169426075788, 0.011870627588911975, 0.011066463670564176, -0.05486137513241248, -0.13778956444172638, 0.07286587016262712, 0.4124990071911011, -0.23537515720393318, -0.25442907575817003, -0.022237766185693824, -0.27897153109869494, -0.15364850219339132, 0.13144808987930526, 0.048400375699746784, -0.022861848269201762, -0.08970768048162878, -0.04059565389345325, -0.12020073698690828, -0.23338960394616762, 0.33031406493884696, -0.014891098175252224, 0.3218929736847806, 0.08943848685789717, 0.015917598444927673, -0.041816095952420446, 0.17378179561584697, 0.06024933536027143, -0.13328709566780242, 0.032909046063186044, 0.2742284831937647, -0.11274651171857097, 0.20406103615451904, -0.4295965770708166, -0.24274228354720534, 0.016635459995604236, 0.11445895463472953, 0.17937414287198608, -0.08323386044115726, -0.29952437693022027, 0.0568188851457905, -0.14657347315555289, -0.12333912432706154, -0.0844940721162724, -0.0068991079180413025, -0.013130688541874725, -0.2803431455739332, 0.0736185294664363, 0.08212329578130459, 0.09815607040467923, -0.08673097097049773, -0.07376093848312722, -0.06363535546493737, -0.013782790692711766, 0.07124318685603538, 0.12467240077191896, 0.11392155931038904, -0.11101520291094526, -0.08734024351591883, 0.32521007366029775, -0.0767229099708684, -0.057588058557823625, 0.14269904091437585, -0.19058874223965908, -0.05715988999076296, 0.13536256830459528, 0.0917245784407332, 0.06637848298792748, -0.12679298139352735, 0.13741234100715216, -0.03684933612507217, 0.2180138445641152, 0.00840728029771878, 0.0754582723228764, 0.2486143510781881, 0.21727839050250278, 0.047041553378540234, 0.15070548224395452, -0.13727865400248254, -0.04963066007425315, -0.21167497304234192, -0.18474996070900973, -0.22622682517870282, 0.05044911359096911, -0.04298517705834841, -0.18266824373604057, 0.3735443114976052, 0.16297850339082035, 0.15626523655798477, -0.13449963004613824, 0.23241634932295657, 0.10893492466586567, 0.07603779681244471, 0.04373869216613417, 0.3089278723095394, 0.24157021241432505, 0.1199887904243367, -0.3536710060069025, 0.10120723974112639, 0.030346625322224503]
|
1,803.0728
|
Stability of the wave equations on a tree with local Kelvin-Voigt
damping
|
In this paper we study the stability problem of a tree of elastic strings
with local Kelvin-Voigt damping on some of the edges. Under the compatibility
condition of displacement and strain and continuity condition of damping
coefficients at the vertices of the tree, exponential/polynomial stability are
proved.
|
math.AP
|
in this paper we study the stability problem of a tree of elastic strings with local kelvinvoigt damping on some of the edges under the compatibility condition of displacement and strain and continuity condition of damping coefficients at the vertices of the tree exponentialpolynomial stability are proved
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'stability', 'problem', 'of', 'a', 'tree', 'of', 'elastic', 'strings', 'with', 'local', 'kelvinvoigt', 'damping', 'on', 'some', 'of', 'the', 'edges', 'under', 'the', 'compatibility', 'condition', 'of', 'displacement', 'and', 'strain', 'and', 'continuity', 'condition', 'of', 'damping', 'coefficients', 'at', 'the', 'vertices', 'of', 'the', 'tree', 'exponentialpolynomial', 'stability', 'are', 'proved']]
|
[-0.2300823550829862, 0.14619509033620992, -0.06098450610334886, -0.0021648736834090124, -0.07104624046924267, -0.06272476890738657, 0.032470538699504066, 0.3143519192458467, -0.33947920363317147, -0.24050529903553902, 0.13075377179824926, -0.25853287246316037, -0.1511576749542926, 0.10164068902822886, -0.037862567607551176, 0.11052191818251889, 0.08937207480615124, 0.07952691107354265, -0.022662078565422523, -0.25613957928850295, 0.3594745097562988, 0.04993509661723325, 0.2912432352437618, 0.0813731426469724, 0.11305306764676216, 0.025482357241847414, 0.01979620130534502, 0.050415811168545106, -0.2203136372152082, 0.06747843467561092, 0.1458211231263394, 0.026820590471888475, 0.2401166966462389, -0.44809602375360247, -0.1489150726089026, 0.09684236529976764, 0.07075252232359762, 0.08959439983393283, 0.02952032318546813, -0.21789444289467436, 0.13884865686772985, -0.05104985690497337, -0.15391034735961162, 0.012164441581339912, 0.008215730316302877, 0.05655215791069922, -0.30671385318991984, 0.12356764250534012, 0.1140600185682799, 0.0785166301189902, -0.1391146195794832, -0.10380015490536994, -0.07423074707448324, 0.047504240825296716, 0.08120030228127824, -0.032916755965375834, 0.07718142769002218, -0.15877864400340996, -0.0809754480786146, 0.3654065899392392, -0.06201979803278091, -0.24201747675505567, 0.15695639717531332, -0.11605781071046566, -0.1337689404732528, 0.08396439965655829, 0.17427565212896529, 0.0952627800325764, -0.16553838681825933, 0.1267575061003222, -0.02016793706384983, 0.0738008519079774, 0.21176802710768708, 0.04912403003966555, 0.11004777918470666, 0.1816272592925011, 0.1343472495358041, 0.1759380821183205, -0.02019292130035923, 0.0019171901958736969, -0.37359432337131904, -0.13083502810765454, -0.1521636384360968, 0.0232328076232621, -0.14579596632950384, -0.2308651284374138, 0.4008193509430288, 0.10361677592501362, 0.1741053164401587, 0.1325450238791552, 0.22479528135203936, 0.12862274932496726, -0.017979506997668995, 0.05247445634387909, 0.23373115628752164, 0.20884084206153739, 0.07461143230543808, -0.2659111225982494, 0.09757421867045118, 0.12976246804712302]
|
1,803.07281
|
Offset Hypersurfaces and Persistent Homology of Algebraic Varieties
|
In this paper, we study the persistent homology of the offset filtration of
algebraic varieties. We prove the algebraicity of two quantities central to the
computation of persistent homology. Moreover, we connect persistent homology
and algebraic optimization. Namely, we express the degree corresponding to the
distance variable of the offset hypersurface in terms of the Euclidean Distance
Degree of the starting variety, obtaining a new way to compute these degrees.
Finally, we describe the non-properness locus of the offset construction and
use this to describe the set of points that are topologically interesting (the
medial axis and center points of the bounded components of the complement of
the variety) and relevant to the computation of persistent homology.
|
math.AG math.AT math.OC
|
in this paper we study the persistent homology of the offset filtration of algebraic varieties we prove the algebraicity of two quantities central to the computation of persistent homology moreover we connect persistent homology and algebraic optimization namely we express the degree corresponding to the distance variable of the offset hypersurface in terms of the euclidean distance degree of the starting variety obtaining a new way to compute these degrees finally we describe the nonproperness locus of the offset construction and use this to describe the set of points that are topologically interesting the medial axis and center points of the bounded components of the complement of the variety and relevant to the computation of persistent homology
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'persistent', 'homology', 'of', 'the', 'offset', 'filtration', 'of', 'algebraic', 'varieties', 'we', 'prove', 'the', 'algebraicity', 'of', 'two', 'quantities', 'central', 'to', 'the', 'computation', 'of', 'persistent', 'homology', 'moreover', 'we', 'connect', 'persistent', 'homology', 'and', 'algebraic', 'optimization', 'namely', 'we', 'express', 'the', 'degree', 'corresponding', 'to', 'the', 'distance', 'variable', 'of', 'the', 'offset', 'hypersurface', 'in', 'terms', 'of', 'the', 'euclidean', 'distance', 'degree', 'of', 'the', 'starting', 'variety', 'obtaining', 'a', 'new', 'way', 'to', 'compute', 'these', 'degrees', 'finally', 'we', 'describe', 'the', 'nonproperness', 'locus', 'of', 'the', 'offset', 'construction', 'and', 'use', 'this', 'to', 'describe', 'the', 'set', 'of', 'points', 'that', 'are', 'topologically', 'interesting', 'the', 'medial', 'axis', 'and', 'center', 'points', 'of', 'the', 'bounded', 'components', 'of', 'the', 'complement', 'of', 'the', 'variety', 'and', 'relevant', 'to', 'the', 'computation', 'of', 'persistent', 'homology']]
|
[-0.22687239688622135, 0.016717392014952488, -0.10633193850358072, 0.057909298471262693, -0.071223016983519, -0.07990450052838996, 0.04935912575481189, 0.32884601447890455, -0.3690746571773138, -0.25034914248519474, 0.11035286689487596, -0.23387769291288832, -0.16958792514215487, 0.17300571805327877, -0.13902314239068148, -0.0185464039309603, 0.028128774637658883, 0.058150068084653624, -0.09914541007895182, -0.23211881659256342, 0.38474532114899057, -0.01931760773763188, 0.20122013608805644, 0.0554904972609037, 0.12569955508742067, -0.0044309141464595105, -0.05634655878266208, 0.01766090979003626, -0.18008042027623816, 0.22551160670307457, 0.27149355443369627, 0.08522823367578287, 0.1480715874518849, -0.36606968890151215, -0.11100551628275838, 0.18423579628459918, 0.12409119623808716, 0.07286253328729644, 0.020492921939565457, -0.23003521786891243, 0.1307719181267879, -0.1697582990594276, -0.21534027241600248, -0.07406708473960559, 0.05277881286958726, 0.06099993899329287, -0.1483176206278368, 0.00474805234429928, 0.0546017461655359, 0.11746839453808518, -0.041730969686570585, -0.08959672703909186, -0.041034320060911976, 0.15158417853964573, 0.037633170598608434, 0.06202188610401737, 0.13584444579135022, -0.11260789613892189, -0.1355160281667088, 0.34215180521719474, -0.013381865881005319, -0.17699812120224676, 0.1790374955958408, -0.1612942032277202, -0.17565829384849113, 0.11492489677511601, 0.14058595660946563, 0.12169232489003871, -0.06047274274990345, 0.09952418154511505, -0.04296516963384218, 0.09663191095838307, 0.07831062175906621, 0.03466271255244939, 0.186190691897964, 0.07418145203931081, 0.10188264874725267, 0.18631925383725992, -0.11896315626163259, -0.12564656837310037, -0.33691802277014804, -0.21467508324128418, -0.14924360792606306, 0.07408765927713333, -0.13630817007048565, -0.2045407660751261, 0.4741091043011755, 0.14498858195610154, 0.22141125022123256, 0.11746814510283562, 0.27398394275074583, 0.07896546719699768, 0.024444415926551208, 0.06442882600996612, 0.17079134449028435, 0.17556129361733666, 0.006984001662359279, -0.19487736659904575, 0.020038530497182894, 0.14179721204840087]
|
1,803.07282
|
Observation of Rydberg exciton polaritons and their condensate in a
perovskite cavity
|
The condensation of half-light half-matter exciton polaritons in
semiconductor optical cavities is a striking example of macroscopic quantum
coherence in a solid state platform. Quantum coherence is possible only when
there are strong interactions between the exciton polaritons provided by their
excitonic constituents. Rydberg excitons with high principle value exhibit
strong dipole-dipole interactions in cold atoms. However, polaritons with the
excitonic constituent that is an excited state, namely Rydberg exciton
polaritons (REPs), have not yet been experimentally observed. Here, for the
first time, we observe the formation of REPs in a single crystal CsPbBr3
perovskite cavity without any external fields. These polaritons exhibit strong
nonlinear behavior that leads to a coherent polariton condensate with a
prominent blue shift. Furthermore, the REPs in CsPbBr3 are highly anisotropic
and have a large extinction ratio, arising from the perovskite's orthorhombic
crystal structure. Our observation not only sheds light on the importance of
many-body physics in coherent polariton systems involving higher-order excited
states, but also paves the way for exploring these coherent interactions for
solid state quantum optical information processing.
|
cond-mat.mtrl-sci cond-mat.mes-hall
|
the condensation of halflight halfmatter exciton polaritons in semiconductor optical cavities is a striking example of macroscopic quantum coherence in a solid state platform quantum coherence is possible only when there are strong interactions between the exciton polaritons provided by their excitonic constituents rydberg excitons with high principle value exhibit strong dipoledipole interactions in cold atoms however polaritons with the excitonic constituent that is an excited state namely rydberg exciton polaritons reps have not yet been experimentally observed here for the first time we observe the formation of reps in a single crystal cspbbr3 perovskite cavity without any external fields these polaritons exhibit strong nonlinear behavior that leads to a coherent polariton condensate with a prominent blue shift furthermore the reps in cspbbr3 are highly anisotropic and have a large extinction ratio arising from the perovskites orthorhombic crystal structure our observation not only sheds light on the importance of manybody physics in coherent polariton systems involving higherorder excited states but also paves the way for exploring these coherent interactions for solid state quantum optical information processing
|
[['the', 'condensation', 'of', 'halflight', 'halfmatter', 'exciton', 'polaritons', 'in', 'semiconductor', 'optical', 'cavities', 'is', 'a', 'striking', 'example', 'of', 'macroscopic', 'quantum', 'coherence', 'in', 'a', 'solid', 'state', 'platform', 'quantum', 'coherence', 'is', 'possible', 'only', 'when', 'there', 'are', 'strong', 'interactions', 'between', 'the', 'exciton', 'polaritons', 'provided', 'by', 'their', 'excitonic', 'constituents', 'rydberg', 'excitons', 'with', 'high', 'principle', 'value', 'exhibit', 'strong', 'dipoledipole', 'interactions', 'in', 'cold', 'atoms', 'however', 'polaritons', 'with', 'the', 'excitonic', 'constituent', 'that', 'is', 'an', 'excited', 'state', 'namely', 'rydberg', 'exciton', 'polaritons', 'reps', 'have', 'not', 'yet', 'been', 'experimentally', 'observed', 'here', 'for', 'the', 'first', 'time', 'we', 'observe', 'the', 'formation', 'of', 'reps', 'in', 'a', 'single', 'crystal', 'cspbbr3', 'perovskite', 'cavity', 'without', 'any', 'external', 'fields', 'these', 'polaritons', 'exhibit', 'strong', 'nonlinear', 'behavior', 'that', 'leads', 'to', 'a', 'coherent', 'polariton', 'condensate', 'with', 'a', 'prominent', 'blue', 'shift', 'furthermore', 'the', 'reps', 'in', 'cspbbr3', 'are', 'highly', 'anisotropic', 'and', 'have', 'a', 'large', 'extinction', 'ratio', 'arising', 'from', 'the', 'perovskites', 'orthorhombic', 'crystal', 'structure', 'our', 'observation', 'not', 'only', 'sheds', 'light', 'on', 'the', 'importance', 'of', 'manybody', 'physics', 'in', 'coherent', 'polariton', 'systems', 'involving', 'higherorder', 'excited', 'states', 'but', 'also', 'paves', 'the', 'way', 'for', 'exploring', 'these', 'coherent', 'interactions', 'for', 'solid', 'state', 'quantum', 'optical', 'information', 'processing']]
|
[-0.15057475411793514, 0.29083443196321407, -0.07231361053279463, 0.05325681068246591, -0.017473271703982555, -0.17601455629020082, 0.045221214850740085, 0.47292719065973704, -0.2270546657647091, -0.24848315853159875, -0.05699715182179881, -0.2860577702469362, -0.12175687008791349, 0.19777880193644456, 0.05770789786368947, 0.034080350189469755, 0.03508050454018468, -0.061041348494737496, 0.0008791472484352363, -0.17637109996311748, 0.2835713852592479, -0.031667938995021606, 0.31977264108189213, 0.12335368061956781, 0.0817986482844307, -0.0304130680187055, 0.1476249625133774, -0.05643345194403082, -0.12029356373758757, 0.11868935027946877, 0.2809801726041108, -0.06474725036836886, 0.2583775443492662, -0.4479216818528419, -0.2286206248417412, 0.059700633134608244, 0.17429566833727056, 0.23542189815039324, -0.13205626806236317, -0.3385083563599354, -0.045950009849713584, -0.1256935551341898, -0.10612629826011305, -0.11078670934975063, 0.018500786563064055, 7.407242678296329e-05, -0.17456984524621724, 0.09754113457678283, 0.06331293641877975, 0.0673084366823208, -0.07253115023195278, -0.047578264041889765, -0.04810741692463952, 0.046361110551019505, -0.059503508354034486, -0.008071279553405475, 0.15365730855476364, -0.168546463015611, -0.12989016946944917, 0.42333041064293037, -0.08966910794234453, -0.07699589915996925, 0.20026390898353633, -0.16134896905515977, -0.030152215326035566, 0.1789398873912763, 0.1332490386018683, 0.07861544212474572, -0.09030006494611537, 0.05300174025383471, -0.05202845992277038, 0.23297548929060047, 0.07557110467711357, 0.23578914064141412, 0.27704143240539864, 0.1717839503574148, 0.00431198830218901, 0.14271184152676142, -0.061086631708101115, -0.12409245182623801, -0.2094016100639816, -0.17913948512002456, -0.21923146570373897, 0.09318241652454162, -0.04645366512960953, -0.175680955344102, 0.37736377775647933, 0.06257031576040556, 0.14400279317421585, -0.05504124238822525, 0.255095607093112, 0.12055594299586532, 0.08397920475611252, -0.001742190324214541, 0.3419901554999259, 0.1861827977766304, 0.06245536018237048, -0.3201600916628112, 0.0443794045594669, -0.02447745311259165]
|
1,803.07283
|
On the turbulent flow field over riblets of various groove sizes at low
Reynolds number
|
In this work, low Reynolds number turbulent flow through a corrugated
channel, formed by standard V-groove riblets, are investigated via direct
numerical simulations (DNS). The simulations attempt to assess the variation of
flow dynamics caused by a change in the characteristic size of the V-groove
riblets. Such characterization of size effects provides a means to identify the
local flow features arising from fluid-riblet interaction, and to investigate
their relevance to the change in viscous drag and turbulence statistics. The
present simulations confirmed an improved variation trend when the flow
dynamics is examined in the light of the groove size. At the lower end of the
range of groove size considered, the profiles of turbulence statistics more or
less resemble the plane channel flow, except for a systematic shift with the
groove size. When the groove size becomes increasingly large, the lodging of
near-wall flow structures and the generation of mean secondary flows tend to be
more apparent. The collective impact of the lodging of flow structures and the
mean secondary flow correlates with the increase in viscous drag, and leads to
significant alterations of the turbulence statistics.
|
physics.flu-dyn
|
in this work low reynolds number turbulent flow through a corrugated channel formed by standard vgroove riblets are investigated via direct numerical simulations dns the simulations attempt to assess the variation of flow dynamics caused by a change in the characteristic size of the vgroove riblets such characterization of size effects provides a means to identify the local flow features arising from fluidriblet interaction and to investigate their relevance to the change in viscous drag and turbulence statistics the present simulations confirmed an improved variation trend when the flow dynamics is examined in the light of the groove size at the lower end of the range of groove size considered the profiles of turbulence statistics more or less resemble the plane channel flow except for a systematic shift with the groove size when the groove size becomes increasingly large the lodging of nearwall flow structures and the generation of mean secondary flows tend to be more apparent the collective impact of the lodging of flow structures and the mean secondary flow correlates with the increase in viscous drag and leads to significant alterations of the turbulence statistics
|
[['in', 'this', 'work', 'low', 'reynolds', 'number', 'turbulent', 'flow', 'through', 'a', 'corrugated', 'channel', 'formed', 'by', 'standard', 'vgroove', 'riblets', 'are', 'investigated', 'via', 'direct', 'numerical', 'simulations', 'dns', 'the', 'simulations', 'attempt', 'to', 'assess', 'the', 'variation', 'of', 'flow', 'dynamics', 'caused', 'by', 'a', 'change', 'in', 'the', 'characteristic', 'size', 'of', 'the', 'vgroove', 'riblets', 'such', 'characterization', 'of', 'size', 'effects', 'provides', 'a', 'means', 'to', 'identify', 'the', 'local', 'flow', 'features', 'arising', 'from', 'fluidriblet', 'interaction', 'and', 'to', 'investigate', 'their', 'relevance', 'to', 'the', 'change', 'in', 'viscous', 'drag', 'and', 'turbulence', 'statistics', 'the', 'present', 'simulations', 'confirmed', 'an', 'improved', 'variation', 'trend', 'when', 'the', 'flow', 'dynamics', 'is', 'examined', 'in', 'the', 'light', 'of', 'the', 'groove', 'size', 'at', 'the', 'lower', 'end', 'of', 'the', 'range', 'of', 'groove', 'size', 'considered', 'the', 'profiles', 'of', 'turbulence', 'statistics', 'more', 'or', 'less', 'resemble', 'the', 'plane', 'channel', 'flow', 'except', 'for', 'a', 'systematic', 'shift', 'with', 'the', 'groove', 'size', 'when', 'the', 'groove', 'size', 'becomes', 'increasingly', 'large', 'the', 'lodging', 'of', 'nearwall', 'flow', 'structures', 'and', 'the', 'generation', 'of', 'mean', 'secondary', 'flows', 'tend', 'to', 'be', 'more', 'apparent', 'the', 'collective', 'impact', 'of', 'the', 'lodging', 'of', 'flow', 'structures', 'and', 'the', 'mean', 'secondary', 'flow', 'correlates', 'with', 'the', 'increase', 'in', 'viscous', 'drag', 'and', 'leads', 'to', 'significant', 'alterations', 'of', 'the', 'turbulence', 'statistics']]
|
[-0.15375538672128397, 0.16265988505080214, -0.09089403183159409, 0.05165574164067205, -0.027593647206192135, -0.06410919385398889, -0.01991750485256254, 0.32721940134351535, -0.30721997496451664, -0.3213353379108813, 0.0803195557598355, -0.27199503854017265, -0.09940709295727673, 0.18498223500641725, -0.0220270255875964, 0.0497762916749844, 0.04626670551876868, -0.010906367913208983, -0.029307737977804758, -0.17703654077554984, 0.284198855473009, 0.10779580414815935, 0.2997973230066559, 0.05906655561142621, 0.025670762529336318, -0.033173046988605334, -0.06838822317051811, 0.08911355381758923, -0.18778322536938935, 0.08291070422367944, 0.15947606201284886, 0.015045137742974906, 0.25423858403022465, -0.44638144569371335, -0.2596454898313862, 0.046990479450292326, 0.16586403866418667, 0.10831050452856367, -0.04695496346156228, -0.22155616357196523, 0.08722925578276576, -0.16160908637328014, -0.13475518369226044, 0.0092455215717075, 0.03898043795463739, 0.047427953291003425, -0.24427833723565262, 0.13149000427895977, 0.03982453383955984, 0.11629720305102648, -0.024295142724088604, -0.06249926828088299, -0.08302143056656644, 0.14022988153299848, 0.08159633995890017, -0.005910864956076106, 0.17817386205186717, -0.19444890332693654, -0.03492129586326579, 0.41340043024730777, -0.05940987263438142, -0.2053917635755453, 0.19483758839190266, -0.16788725199892002, -0.018839866373567812, 0.19916103471330898, 0.23232402589913176, 0.07826464657261166, -0.058588348925695755, -0.03477380339382342, -0.022260590541547023, 0.18056079080723908, 0.07157268600227933, -0.017992211991460415, 0.208650426132985, 0.20660063345986668, 0.05420120974241566, 0.1665979809977705, -0.14357667965629833, -0.10547320701317081, -0.2525135256520282, -0.1180426472853068, -0.13016486846465086, -0.001966175412939441, -0.09863390104154499, -0.17852184872183027, 0.36763067747796735, 0.12357493678248056, 0.21263879224387627, 0.029031706133967525, 0.312795766689364, 0.09464277290101965, 0.078545250508043, 0.09806158619191778, 0.2626597427072064, 0.16294392034842042, 0.13219665164899042, -0.2846039366577902, 0.09477027561215143, 0.012104173839938457]
|
1,803.07284
|
Updated study of the $\eta$-$\eta'$ mixing and the thermal properties of
light pseudoscalar mesons at low temperatures
|
Within the framework of the $U(3)$ chiral perturbation theory, we revisit the
masses, decay constants and the mixing parameters of the light pseudoscalar
mesons $\pi, K, \eta$ and $\eta'$. The low energy constants up to
next-to-next-to-leading order are determined by including the light-quark mass
dependences of the various quantities from different lattice QCD simulations
and relevant phenomenological inputs. Then we study the finite-temperature
behaviors of the masses of the light pseudoscalar mesons. The thermal behaviors
of the $\eta$-$\eta'$ mixing angles in singlet-octet and quark-flavor bases are
also explored. While the masses of the $\pi, K$, and $\eta$ are increased when
increasing the temperatures, the mass of the $\eta'$ turns out to be slightly
decreased in the low-temperature region.
|
hep-ph
|
within the framework of the u3 chiral perturbation theory we revisit the masses decay constants and the mixing parameters of the light pseudoscalar mesons pi k eta and eta the low energy constants up to nexttonexttoleading order are determined by including the lightquark mass dependences of the various quantities from different lattice qcd simulations and relevant phenomenological inputs then we study the finitetemperature behaviors of the masses of the light pseudoscalar mesons the thermal behaviors of the etaeta mixing angles in singletoctet and quarkflavor bases are also explored while the masses of the pi k and eta are increased when increasing the temperatures the mass of the eta turns out to be slightly decreased in the lowtemperature region
|
[['within', 'the', 'framework', 'of', 'the', 'u3', 'chiral', 'perturbation', 'theory', 'we', 'revisit', 'the', 'masses', 'decay', 'constants', 'and', 'the', 'mixing', 'parameters', 'of', 'the', 'light', 'pseudoscalar', 'mesons', 'pi', 'k', 'eta', 'and', 'eta', 'the', 'low', 'energy', 'constants', 'up', 'to', 'nexttonexttoleading', 'order', 'are', 'determined', 'by', 'including', 'the', 'lightquark', 'mass', 'dependences', 'of', 'the', 'various', 'quantities', 'from', 'different', 'lattice', 'qcd', 'simulations', 'and', 'relevant', 'phenomenological', 'inputs', 'then', 'we', 'study', 'the', 'finitetemperature', 'behaviors', 'of', 'the', 'masses', 'of', 'the', 'light', 'pseudoscalar', 'mesons', 'the', 'thermal', 'behaviors', 'of', 'the', 'etaeta', 'mixing', 'angles', 'in', 'singletoctet', 'and', 'quarkflavor', 'bases', 'are', 'also', 'explored', 'while', 'the', 'masses', 'of', 'the', 'pi', 'k', 'and', 'eta', 'are', 'increased', 'when', 'increasing', 'the', 'temperatures', 'the', 'mass', 'of', 'the', 'eta', 'turns', 'out', 'to', 'be', 'slightly', 'decreased', 'in', 'the', 'lowtemperature', 'region']]
|
[-0.11862371913828272, 0.3206671996977401, -0.06582946228100207, 0.08052284557025059, -0.008937754828119808, -0.0914852346877678, 0.10977721591854973, 0.3153011191604754, -0.2335788301681563, -0.23515007277887504, 0.004412972794498427, -0.32104958213423773, -0.02909207802021213, 0.12616748458279645, 0.10225294541021991, 0.10634529785158396, -0.011496220950147736, 0.054777426034965854, -0.11918164360715802, -0.19431874262646504, 0.32246985719776, 0.0067018592390784264, 0.1771698910424829, 0.14831698809008478, -0.00392845812869274, -0.033465167387167656, -0.018333238024674986, -0.07218210315489668, -0.19377550910921545, 0.036907817677089595, 0.17868153746950172, 0.017638191908313814, 0.12759622805988638, -0.32591123040765524, -0.15174911761167065, 0.10232144058682024, 0.14805066823698895, 0.08086180618877317, 0.021107183185295534, -0.3032593888988308, 0.09154438045491481, -0.15589666153477916, -0.15579955893473985, -0.1326739551278494, -0.00010506262986968129, -0.03411194185925632, -0.31959496149635414, 0.09481478921878665, -0.06538144984061561, 0.056072954056879225, -0.04881224249710597, -0.2558489768939503, -0.05788836541873703, 0.10881905123947574, 0.18269837509556594, 0.04514419376037194, 0.1687825177322631, -0.17527346970450322, -0.07051390341988181, 0.4302528399137496, -0.04603827041593554, -0.15129968829100784, 0.11297681208865686, -0.17997756131956258, -0.10327180153769204, 0.16091705910403722, 0.190557670258617, 0.11721907907276083, -0.16517959182188646, 0.11723723382885386, -0.024126871524504937, 0.17138332263980913, 0.08396242737130782, 0.07769683137401875, 0.2091444833544517, 0.13987124656816408, -0.08387082602860312, 0.05406326356134772, -0.05976987719314836, -0.11156581944422954, -0.3299243756948765, -0.08929470293144932, -0.08007105855050228, 0.043276327867376604, -0.16643250782091576, -0.044853833290921935, 0.3845991604266909, 0.09495455560558555, 0.2724211567744486, 0.034254471862183535, 0.29537004691753854, 0.11804034349792716, 0.06321790349133061, 0.07305693971308863, 0.32687446448194274, 0.23715847667693396, 0.11078084542187151, -0.33241649489194725, -0.0312255716377522, 0.04502187564700716]
|
1,803.07285
|
Liftings of a monomial curve
|
We study an operation, that we call lifting, creating non-isomorphic monomial
curves from a single monomial curve. Our main result says that all but finitely
many liftings of a monomial curve have Cohen-Macaulay tangent cones even if the
tangent cone of the original curve is not Cohen-Macaulay. This implies that the
Betti sequence of the tangent cone is eventually constant under this operation.
Moreover, all liftings have Cohen-Macaulay tangent cones when the original
monomial curve has a Cohen-Macaulay tangent cone. In this case, all the Betti
sequences are nothing but the Betti sequence of the original curve.
|
math.AC math.AG
|
we study an operation that we call lifting creating nonisomorphic monomial curves from a single monomial curve our main result says that all but finitely many liftings of a monomial curve have cohenmacaulay tangent cones even if the tangent cone of the original curve is not cohenmacaulay this implies that the betti sequence of the tangent cone is eventually constant under this operation moreover all liftings have cohenmacaulay tangent cones when the original monomial curve has a cohenmacaulay tangent cone in this case all the betti sequences are nothing but the betti sequence of the original curve
|
[['we', 'study', 'an', 'operation', 'that', 'we', 'call', 'lifting', 'creating', 'nonisomorphic', 'monomial', 'curves', 'from', 'a', 'single', 'monomial', 'curve', 'our', 'main', 'result', 'says', 'that', 'all', 'but', 'finitely', 'many', 'liftings', 'of', 'a', 'monomial', 'curve', 'have', 'cohenmacaulay', 'tangent', 'cones', 'even', 'if', 'the', 'tangent', 'cone', 'of', 'the', 'original', 'curve', 'is', 'not', 'cohenmacaulay', 'this', 'implies', 'that', 'the', 'betti', 'sequence', 'of', 'the', 'tangent', 'cone', 'is', 'eventually', 'constant', 'under', 'this', 'operation', 'moreover', 'all', 'liftings', 'have', 'cohenmacaulay', 'tangent', 'cones', 'when', 'the', 'original', 'monomial', 'curve', 'has', 'a', 'cohenmacaulay', 'tangent', 'cone', 'in', 'this', 'case', 'all', 'the', 'betti', 'sequences', 'are', 'nothing', 'but', 'the', 'betti', 'sequence', 'of', 'the', 'original', 'curve']]
|
[-0.2266348499718324, 0.035060932159036176, -0.13083336160508627, 0.059549582487250646, -0.10420681739264388, -0.19791022931062377, -0.05550577002577484, 0.3671405289283733, -0.4209964196629745, -0.0822668626398021, 0.10359231484741856, -0.2670152623820858, -0.16937188133981423, 0.20252981266371675, -0.21302447636064487, -0.016397615066566264, 0.10712988986201662, 0.07116372952448953, -0.07973785088253543, -0.42211987172282234, 0.44087144636462644, -0.02787415222678881, 0.24261536728590727, 0.017136031153885473, 0.11919396550673031, -0.009461335242562686, 0.07404368194108157, -0.007577959611320619, -0.14861644293562948, 0.08984996830641302, 0.2960955300896438, 0.15879473599038788, 0.1772354598128304, -0.3556254602891883, -0.08281178555460934, 0.28952947945679663, 0.10569454955666796, 0.001856467676992269, -0.010116963413275164, -0.12456135429470733, 0.11953041995347467, -0.10823180584822656, -0.2258280142469658, -0.10855637788388532, 0.029662434266131257, 0.02069238337841768, -0.16039127947224938, -0.051047991010715665, 0.18771464235542976, 0.1723891572316283, -0.010804410980649522, -0.07248391435222373, -0.16125988287937626, -0.01510897170381438, -0.023902724895472686, 0.04328084418060469, 0.0707519101651059, -0.0728329553475277, -0.11442290913054393, 0.40034860975502695, -0.0378596274057384, -0.1697941879098563, 0.051163086600448056, -0.24900607910660125, -0.07879456316514574, 0.2128030268821059, -0.019684447311633026, 0.19650270630960764, -0.005390186101160992, 0.1710071372463531, -0.19070876445429227, 0.036238123537953366, 0.1622496198469139, -0.02050041484636898, 0.2072005823792256, 0.04506381464577232, 0.1105722804624616, 0.12558243141543196, -0.015921963532407258, -0.02131121275111188, -0.3820978848302026, -0.22730208129007562, -0.1447477069654569, 0.16461171259273674, -0.15349212609538712, -0.16740115839008665, 0.46995766453214527, 0.059184665628468865, 0.23757261111756267, 0.15406678128296258, 0.3084012478129151, 0.014581440800330457, 0.05373447234250279, 0.10993214305874306, 0.1969479184607332, 0.167567864463655, -0.0380489527171036, -0.0687357124646876, 0.0553479962022111, 0.2214979157235819]
|
1,803.07286
|
1.4 GHz on the Fundamental Plane of Black Hole Activity
|
The fundamental plane of black hole activity is an empirical relationship
between the OIII/X-ray luminosity depicting the accretion power, the radio
luminosity as a probe of the instantaneous jet power and the mass of the black
hole. For the first time, we use the 1.4 GHz FIRST radio luminosities on the
optical fundamental plane, to investigate whether or not FIRST fluxes can trace
nuclear activity. We use a SDSS-FIRST cross-correlated sample of 10149 active
galaxies and analyse their positioning on the optical fundamental plane. We
focus on various reasons that can cause the discrepancy between the observed
FIRST radio fluxes and the theoretically expected core radio fluxes, and show
that that FIRST fluxes are heavily contaminated by non-nuclear, extended
components and other environmental factors. We show that the subsample of
'compact sources', which should have negligible lobe contribution,
statistically follow the fundamental plane when corrected for relativistic
beaming, while all the other sources lie above the plane. The sample of LINERs,
which should have negligible lobe and beaming contribution, also follow the
fundamental plane. A combined fit of the low-luminosity AGN and the X-ray
binaries, with the LINERs, results in the relation log L$_R$ = 0.77 log
L$_{OIII}$ + 0.69 log M. Assuming that the original fundamental plane relation
is correct, we conclude that 1.4 GHz FIRST fluxes do not trace the pure 'core'
jet and instantaneous nuclear activity in the AGN, and one needs to be careful
while using it on the fundamental plane of black hole activity.
|
astro-ph.HE
|
the fundamental plane of black hole activity is an empirical relationship between the oiiixray luminosity depicting the accretion power the radio luminosity as a probe of the instantaneous jet power and the mass of the black hole for the first time we use the 14 ghz first radio luminosities on the optical fundamental plane to investigate whether or not first fluxes can trace nuclear activity we use a sdssfirst crosscorrelated sample of 10149 active galaxies and analyse their positioning on the optical fundamental plane we focus on various reasons that can cause the discrepancy between the observed first radio fluxes and the theoretically expected core radio fluxes and show that that first fluxes are heavily contaminated by nonnuclear extended components and other environmental factors we show that the subsample of compact sources which should have negligible lobe contribution statistically follow the fundamental plane when corrected for relativistic beaming while all the other sources lie above the plane the sample of liners which should have negligible lobe and beaming contribution also follow the fundamental plane a combined fit of the lowluminosity agn and the xray binaries with the liners results in the relation log l_r 077 log l_oiii 069 log m assuming that the original fundamental plane relation is correct we conclude that 14 ghz first fluxes do not trace the pure core jet and instantaneous nuclear activity in the agn and one needs to be careful while using it on the fundamental plane of black hole activity
|
[['the', 'fundamental', 'plane', 'of', 'black', 'hole', 'activity', 'is', 'an', 'empirical', 'relationship', 'between', 'the', 'oiiixray', 'luminosity', 'depicting', 'the', 'accretion', 'power', 'the', 'radio', 'luminosity', 'as', 'a', 'probe', 'of', 'the', 'instantaneous', 'jet', 'power', 'and', 'the', 'mass', 'of', 'the', 'black', 'hole', 'for', 'the', 'first', 'time', 'we', 'use', 'the', '14', 'ghz', 'first', 'radio', 'luminosities', 'on', 'the', 'optical', 'fundamental', 'plane', 'to', 'investigate', 'whether', 'or', 'not', 'first', 'fluxes', 'can', 'trace', 'nuclear', 'activity', 'we', 'use', 'a', 'sdssfirst', 'crosscorrelated', 'sample', 'of', '10149', 'active', 'galaxies', 'and', 'analyse', 'their', 'positioning', 'on', 'the', 'optical', 'fundamental', 'plane', 'we', 'focus', 'on', 'various', 'reasons', 'that', 'can', 'cause', 'the', 'discrepancy', 'between', 'the', 'observed', 'first', 'radio', 'fluxes', 'and', 'the', 'theoretically', 'expected', 'core', 'radio', 'fluxes', 'and', 'show', 'that', 'that', 'first', 'fluxes', 'are', 'heavily', 'contaminated', 'by', 'nonnuclear', 'extended', 'components', 'and', 'other', 'environmental', 'factors', 'we', 'show', 'that', 'the', 'subsample', 'of', 'compact', 'sources', 'which', 'should', 'have', 'negligible', 'lobe', 'contribution', 'statistically', 'follow', 'the', 'fundamental', 'plane', 'when', 'corrected', 'for', 'relativistic', 'beaming', 'while', 'all', 'the', 'other', 'sources', 'lie', 'above', 'the', 'plane', 'the', 'sample', 'of', 'liners', 'which', 'should', 'have', 'negligible', 'lobe', 'and', 'beaming', 'contribution', 'also', 'follow', 'the', 'fundamental', 'plane', 'a', 'combined', 'fit', 'of', 'the', 'lowluminosity', 'agn', 'and', 'the', 'xray', 'binaries', 'with', 'the', 'liners', 'results', 'in', 'the', 'relation', 'log', 'l_r', '077', 'log', 'l_oiii', '069', 'log', 'm', 'assuming', 'that', 'the', 'original', 'fundamental', 'plane', 'relation', 'is', 'correct', 'we', 'conclude', 'that', '14', 'ghz', 'first', 'fluxes', 'do', 'not', 'trace', 'the', 'pure', 'core', 'jet', 'and', 'instantaneous', 'nuclear', 'activity', 'in', 'the', 'agn', 'and', 'one', 'needs', 'to', 'be', 'careful', 'while', 'using', 'it', 'on', 'the', 'fundamental', 'plane', 'of', 'black', 'hole', 'activity']]
|
[-0.08053062583452889, 0.0828990455560638, -0.041489703075162004, 0.14565907278934456, -0.09841284159076762, -0.07603139297238418, 0.08342381831714693, 0.44251859147785877, -0.17200893132130102, -0.3313881696163848, 0.10412048623060846, -0.29558252834391835, -0.0545344592670777, 0.2228023167972795, -0.027334546328199153, -0.02927367675631326, -0.008177568103966056, -0.043978719842829264, -0.06746466749594832, -0.19873235157158758, 0.3411177533393612, 0.08312190411498352, 0.2495546277945063, -0.008256729085910686, 0.06872718636782801, -0.04578345050959259, -0.07608178370461172, 0.0057400175598354974, -0.09334049362550272, 0.06311981542872228, 0.22532072830565122, 0.11911612252172615, 0.17672210170754366, -0.37319342074696005, -0.19210760341387015, 0.10596250065089184, 0.14623834155690002, 0.019710796180523325, -0.04198269108120276, -0.19873084353083478, 0.059947848112835565, -0.1877807572864148, -0.13508662259757367, 0.05212320375959484, 0.05917442854664916, 0.042684662580128985, -0.15633926343134774, 0.12156729860960658, 0.05855727163523588, 0.021538401216420592, -0.09713688224734625, -0.08904946304439586, -0.06942426812103285, 0.14749024605951083, 0.03580289107310224, 0.07183955284494821, 0.1860032305563325, -0.10926777089052662, -0.08598965035884508, 0.3919796855340959, -0.02517431245128415, -0.06417560815735131, 0.19413787942303687, -0.23214723433044795, -0.17315765320304402, 0.12762427231349166, 0.18246889407461395, 0.09913991957597615, -0.14236633281861386, 0.004290860174556396, -0.02708085992050414, 0.2450380760111979, 0.020421416378979172, 0.051360558110232254, 0.301129049184371, 0.07874287500412071, 0.041507701117430136, 0.10750214862637222, -0.18806926181197775, -0.0006229657793835717, -0.3047255158405371, -0.08390179212556734, -0.1383427457537084, 0.11027665982101284, -0.12694077811587592, -0.0930336182495123, 0.3468569979926913, 0.08991637733213756, 0.19849415671327436, 0.047977528097678204, 0.3183603188118004, 0.1226941656606386, 0.06172381187100154, 0.13943865176982825, 0.3547405262116571, 0.15154547422877226, 0.07678339820288654, -0.26264257125784546, 0.03111311426120145, 0.0210268977687371]
|
1,803.07287
|
Betti numbers for certain Cohen-Macaulay tangent cones
|
In this article, we compute Betti numbers for a Cohen-Macaulay tangent cone
of a monomial curve in the affine $4$-space corresponding to a pseudo symmetric
numerical semigroup. As a byproduct, we also show that for these semigroups,
being of homogeneous type and homogeneous are equivalent properties.
|
math.AC math.AG
|
in this article we compute betti numbers for a cohenmacaulay tangent cone of a monomial curve in the affine 4space corresponding to a pseudo symmetric numerical semigroup as a byproduct we also show that for these semigroups being of homogeneous type and homogeneous are equivalent properties
|
[['in', 'this', 'article', 'we', 'compute', 'betti', 'numbers', 'for', 'a', 'cohenmacaulay', 'tangent', 'cone', 'of', 'a', 'monomial', 'curve', 'in', 'the', 'affine', '4space', 'corresponding', 'to', 'a', 'pseudo', 'symmetric', 'numerical', 'semigroup', 'as', 'a', 'byproduct', 'we', 'also', 'show', 'that', 'for', 'these', 'semigroups', 'being', 'of', 'homogeneous', 'type', 'and', 'homogeneous', 'are', 'equivalent', 'properties']]
|
[-0.13143432670799288, 0.07265281667882252, -0.0734980417182669, 0.12419358883609834, -0.1136582286765232, -0.11704954513065192, -0.02115100707210924, 0.39191986264094064, -0.3735217912041623, -0.1087067627813667, 0.14385089129918133, -0.2731575679195964, -0.18357420538592598, 0.22290835370127435, -0.11647958737676559, 0.0036451361223083477, 0.030590213855485552, 0.08202583225362975, -0.16304541247107252, -0.2881863043142442, 0.4243903947265252, -0.031172831340328506, 0.20561553033716654, 0.018500503921962303, 0.11131136546559307, -0.068387990868043, -0.0135636072031364, 0.08403453664125307, -0.20565956633151433, 0.11331762179337523, 0.28827839960222656, 0.07577358408952536, 0.1531983498159958, -0.3693181892614002, -0.08428297898448679, 0.22896037789304619, 0.14703741061258252, 0.01374536256670304, -0.06474967801983914, -0.20176840441949342, 0.13318489378561144, -0.1666732106519782, -0.24776791137359713, -0.11335207246567892, 0.057996238176913364, 0.06661776007841462, -0.2615558032310851, 0.03266927757257414, 0.11874899579940931, 0.14634117127760596, -0.043387943868646806, -0.057752478705800095, -0.08240115444135407, -0.013652462694470001, -0.06076397240647803, -0.03366785748537792, 0.048469560835814184, -0.08110761708762172, -0.12999978280909683, 0.3753763843003822, -0.0705546471087829, -0.2567696954812045, 0.09293050794740734, -0.14971225894987583, -0.1200569064417125, 0.12633056251291672, 0.12381221904702809, 0.194013523666755, -0.041315316404823374, 0.13280280823085416, -0.1748982616700232, 0.02253765560200681, 0.08017573628129195, 0.002624787866016445, 0.14409395268834804, 0.06639815358768987, 0.07551202779311848, 0.21418456935688204, 0.025345950630371986, -0.0663893853324344, -0.42622525018194446, -0.28855891162327124, -0.12481794209705423, 0.17985353552047972, -0.10338303567202631, -0.21453043783043066, 0.42469593153699586, 0.057981080861519214, 0.19966987648007015, 0.14640451364381157, 0.2236605663176464, 0.049401397125937205, -0.016585727242509955, 0.07421662551148431, 0.15645366734015229, 0.21596337609883884, -0.006511009257772695, -0.10368889821288378, -0.035711986113987536, 0.21323422048969762]
|
1,803.07288
|
Face Recognition Techniques: A Survey
|
Nowadays research has expanded to extracting auxiliary information from
various biometric techniques like fingerprints, face, iris, palm and voice .
This information contains some major features like gender, age, beard,
mustache, scars, height, hair, skin color, glasses, weight, facial marks and
tattoos. All this information contributes strongly to identification of human.
The major challenges that come across face recognition are to find age & gender
of the person. This paper contributes a survey of various face recognition
techniques for finding the age and gender. The existing techniques are
discussed based on their performances. This paper also provides future
directions for further research.
|
cs.CV
|
nowadays research has expanded to extracting auxiliary information from various biometric techniques like fingerprints face iris palm and voice this information contains some major features like gender age beard mustache scars height hair skin color glasses weight facial marks and tattoos all this information contributes strongly to identification of human the major challenges that come across face recognition are to find age gender of the person this paper contributes a survey of various face recognition techniques for finding the age and gender the existing techniques are discussed based on their performances this paper also provides future directions for further research
|
[['nowadays', 'research', 'has', 'expanded', 'to', 'extracting', 'auxiliary', 'information', 'from', 'various', 'biometric', 'techniques', 'like', 'fingerprints', 'face', 'iris', 'palm', 'and', 'voice', 'this', 'information', 'contains', 'some', 'major', 'features', 'like', 'gender', 'age', 'beard', 'mustache', 'scars', 'height', 'hair', 'skin', 'color', 'glasses', 'weight', 'facial', 'marks', 'and', 'tattoos', 'all', 'this', 'information', 'contributes', 'strongly', 'to', 'identification', 'of', 'human', 'the', 'major', 'challenges', 'that', 'come', 'across', 'face', 'recognition', 'are', 'to', 'find', 'age', 'gender', 'of', 'the', 'person', 'this', 'paper', 'contributes', 'a', 'survey', 'of', 'various', 'face', 'recognition', 'techniques', 'for', 'finding', 'the', 'age', 'and', 'gender', 'the', 'existing', 'techniques', 'are', 'discussed', 'based', 'on', 'their', 'performances', 'this', 'paper', 'also', 'provides', 'future', 'directions', 'for', 'further', 'research']]
|
[-0.04059466717299074, 0.036935851016896774, -0.0778367363428697, 0.053493034639395774, -0.14273804875556378, -0.19256113824318163, -0.04542185427388176, 0.4319481247663498, -0.25064440777990965, -0.305402122088708, 0.13451072901487351, -0.35462902882136405, -0.1955630329810083, 0.19327428920660167, -0.21566153972409666, 0.04863533031850238, 0.10228663575369865, 0.10209491346147842, -0.045210961762059014, -0.274284908445552, 0.30096808715723455, 0.015425642780028283, 0.34451439153403046, 0.11841050317045301, 0.05125819404609502, -0.002387259091483429, -0.11079569452675059, -0.042643897063098846, -0.12210707212107082, 0.2063786373101175, 0.3637579877488315, 0.24063038832042366, 0.31785026922821996, -0.3639303230494261, -0.17451834750361742, 0.06152115519624204, 0.18586231919471174, 0.12820401119068264, -0.11134828754584306, -0.3504934758134186, 0.07586424184206407, -0.1442671819217503, -0.058439783945214006, -0.03469175554811955, 0.022065516060683875, -0.050223061125725506, -0.1747539120260626, 0.08436785160301952, 0.0832413714658469, 0.19988484850153326, -0.07416308594867588, -0.21093179350020363, 0.030574919150676578, 0.2792107132496312, 0.11099712735041976, 0.032952167324256154, 0.21386351934168488, -0.24563216751645087, -0.13653909620828927, 0.33364478922216223, 0.022399465346243232, -0.142770309234038, 0.19036339948652312, -0.05333751196973026, -0.18418484836351126, 0.056026085029589015, 0.19280388333369047, 0.06043882318539545, -0.19166545343585312, -0.045500418044393885, -0.027835639454424382, 0.1855564354173839, 0.10146812926977873, 0.0473689101357013, 0.2737450688146055, 0.17131595231359825, 0.03351561449468136, 0.11899049225263297, -0.18067317055771126, -0.027926262663677336, -0.1512113476730883, -0.12142475564964116, -0.1018175329931546, -0.045553977284580466, -0.08113175888036495, -0.17612211188301444, 0.4400474628806114, 0.24344854211900382, 0.15099594613537193, 0.02752324843982933, 0.32117431837366894, -0.028636862863786517, 0.14960265771253034, 0.003659606997389346, 0.15624739867431345, -0.019409025413478956, 0.1638400912610814, -0.19374402494519016, 0.13610581998160343, 0.037597685107029974]
|
1,803.07289
|
Flex-Convolution (Million-Scale Point-Cloud Learning Beyond Grid-Worlds)
|
Traditional convolution layers are specifically designed to exploit the
natural data representation of images -- a fixed and regular grid. However,
unstructured data like 3D point clouds containing irregular neighborhoods
constantly breaks the grid-based data assumption. Therefore applying
best-practices and design choices from 2D-image learning methods towards
processing point clouds are not readily possible. In this work, we introduce a
natural generalization flex-convolution of the conventional convolution layer
along with an efficient GPU implementation. We demonstrate competitive
performance on rather small benchmark sets using fewer parameters and lower
memory consumption and obtain significant improvements on a million-scale
real-world dataset. Ours is the first which allows to efficiently process 7
million points concurrently.
|
cs.CV
|
traditional convolution layers are specifically designed to exploit the natural data representation of images a fixed and regular grid however unstructured data like 3d point clouds containing irregular neighborhoods constantly breaks the gridbased data assumption therefore applying bestpractices and design choices from 2dimage learning methods towards processing point clouds are not readily possible in this work we introduce a natural generalization flexconvolution of the conventional convolution layer along with an efficient gpu implementation we demonstrate competitive performance on rather small benchmark sets using fewer parameters and lower memory consumption and obtain significant improvements on a millionscale realworld dataset ours is the first which allows to efficiently process 7 million points concurrently
|
[['traditional', 'convolution', 'layers', 'are', 'specifically', 'designed', 'to', 'exploit', 'the', 'natural', 'data', 'representation', 'of', 'images', 'a', 'fixed', 'and', 'regular', 'grid', 'however', 'unstructured', 'data', 'like', '3d', 'point', 'clouds', 'containing', 'irregular', 'neighborhoods', 'constantly', 'breaks', 'the', 'gridbased', 'data', 'assumption', 'therefore', 'applying', 'bestpractices', 'and', 'design', 'choices', 'from', '2dimage', 'learning', 'methods', 'towards', 'processing', 'point', 'clouds', 'are', 'not', 'readily', 'possible', 'in', 'this', 'work', 'we', 'introduce', 'a', 'natural', 'generalization', 'flexconvolution', 'of', 'the', 'conventional', 'convolution', 'layer', 'along', 'with', 'an', 'efficient', 'gpu', 'implementation', 'we', 'demonstrate', 'competitive', 'performance', 'on', 'rather', 'small', 'benchmark', 'sets', 'using', 'fewer', 'parameters', 'and', 'lower', 'memory', 'consumption', 'and', 'obtain', 'significant', 'improvements', 'on', 'a', 'millionscale', 'realworld', 'dataset', 'ours', 'is', 'the', 'first', 'which', 'allows', 'to', 'efficiently', 'process', '7', 'million', 'points', 'concurrently']]
|
[-0.07081636824482761, -0.0023641874232711783, -0.05132945499451267, 0.05371479426333139, -0.12486655353952986, -0.14148263283364407, 0.07614652472847236, 0.4363877667678059, -0.2880841746900675, -0.3611783216228931, 0.10590610511647965, -0.2832148904003547, -0.1341156693636824, 0.2200874805289167, -0.10968524885279836, 0.07385639936466692, 0.15425892522849075, -0.004013381283217614, -0.08588312181415583, -0.277311356642087, 0.3120028632992041, 0.07493764415400428, 0.3366700364853503, -0.032569344334919516, 0.10050601449713897, -0.06019200657391835, -0.045691947083185434, -0.02073689961993913, -0.0509012544531922, 0.1543096880740358, 0.23922542785294354, 0.1385485822176817, 0.2651725044867041, -0.4887311489859579, -0.1972523442033781, 0.09074513088920316, 0.14616268627781318, 0.09209888065426072, -0.06641625324392332, -0.2680796043532943, 0.09667860034323476, -0.13713187796764348, -0.05389456989226538, -0.1442887651095372, -0.0034560904220823164, 0.0003871294624949677, -0.296511087876343, 0.020524121662858157, 0.04448168452427543, 0.0820080791788289, -0.008462597792775908, -0.14901367785118588, 0.02149656938747802, 0.12728851982776862, -0.04445104964997047, 0.0413981368380744, 0.15226663963083142, -0.11301845272815009, -0.11074352601795125, 0.3926653155561434, -0.0344256166616506, -0.21487815464513565, 0.23803032926121437, -0.041351745650599445, -0.153270965847913, 0.13078588871028993, 0.22344752132824255, 0.11262128669811293, -0.16584379009372735, 0.04697956097602776, -0.03591958306934855, 0.19242073063911666, 0.08114673241272295, 0.009995147721508706, 0.16124347405755943, 0.23131498582490267, 0.08206062130854302, 0.14928198426346714, -0.13034093675605202, -0.11544655022529646, -0.19811029849283465, -0.10940445271329186, -0.18164430553341335, -0.004167826435984744, -0.14144738879505495, -0.15137003463000878, 0.35436192146340095, 0.22053862164019172, 0.21739719512898031, 0.08051036641005974, 0.385765295954199, 0.02409659320949961, 0.14944089540716157, 0.14040042897857247, 0.11154430721023488, -0.017473029134017545, 0.1295942591691236, -0.09821622167103027, 0.026412758213647324, 0.014437683986141047]
|
1,803.0729
|
A New State-Space Representation of Lyapunov Stability for Coupled PDEs
and Scalable Stability Analysis in the SOS Framework - with Lemma Proofs
|
In this paper, we present a framework for Stability Analysis of Systems of
Coupled Linear Partial-Differential Equations. The class of PDE systems
considered in this paper includes parabolic, elliptic and hyperbolic systems
with Dirichelet, Neuman and mixed boundary conditions. The results in this
paper apply to systems with a single spatial variable and assume existence and
continuity of solutions except in such cases when existence and continuity can
be inferred from existence of a Lyapunov function. Our approach is based on a
new concept of state for PDE systems which allows us to express the derivative
of the Lyapunov function as a Linear Operator Inequality directly on $L_2$ and
allows for any type of suitably well-posed boundary conditions. This approach
obviates the need for integration by parts, spacing functions or similar
mathematical encumbrances. The resulting algorithms are implemented in Matlab,
tested on several motivating examples, and the codes have been posted online.
Numerical testing indicates the approach has little or no conservatism for a
large class of systems.
|
math.OC cs.SY math.AP
|
in this paper we present a framework for stability analysis of systems of coupled linear partialdifferential equations the class of pde systems considered in this paper includes parabolic elliptic and hyperbolic systems with dirichelet neuman and mixed boundary conditions the results in this paper apply to systems with a single spatial variable and assume existence and continuity of solutions except in such cases when existence and continuity can be inferred from existence of a lyapunov function our approach is based on a new concept of state for pde systems which allows us to express the derivative of the lyapunov function as a linear operator inequality directly on l_2 and allows for any type of suitably wellposed boundary conditions this approach obviates the need for integration by parts spacing functions or similar mathematical encumbrances the resulting algorithms are implemented in matlab tested on several motivating examples and the codes have been posted online numerical testing indicates the approach has little or no conservatism for a large class of systems
|
[['in', 'this', 'paper', 'we', 'present', 'a', 'framework', 'for', 'stability', 'analysis', 'of', 'systems', 'of', 'coupled', 'linear', 'partialdifferential', 'equations', 'the', 'class', 'of', 'pde', 'systems', 'considered', 'in', 'this', 'paper', 'includes', 'parabolic', 'elliptic', 'and', 'hyperbolic', 'systems', 'with', 'dirichelet', 'neuman', 'and', 'mixed', 'boundary', 'conditions', 'the', 'results', 'in', 'this', 'paper', 'apply', 'to', 'systems', 'with', 'a', 'single', 'spatial', 'variable', 'and', 'assume', 'existence', 'and', 'continuity', 'of', 'solutions', 'except', 'in', 'such', 'cases', 'when', 'existence', 'and', 'continuity', 'can', 'be', 'inferred', 'from', 'existence', 'of', 'a', 'lyapunov', 'function', 'our', 'approach', 'is', 'based', 'on', 'a', 'new', 'concept', 'of', 'state', 'for', 'pde', 'systems', 'which', 'allows', 'us', 'to', 'express', 'the', 'derivative', 'of', 'the', 'lyapunov', 'function', 'as', 'a', 'linear', 'operator', 'inequality', 'directly', 'on', 'l_2', 'and', 'allows', 'for', 'any', 'type', 'of', 'suitably', 'wellposed', 'boundary', 'conditions', 'this', 'approach', 'obviates', 'the', 'need', 'for', 'integration', 'by', 'parts', 'spacing', 'functions', 'or', 'similar', 'mathematical', 'encumbrances', 'the', 'resulting', 'algorithms', 'are', 'implemented', 'in', 'matlab', 'tested', 'on', 'several', 'motivating', 'examples', 'and', 'the', 'codes', 'have', 'been', 'posted', 'online', 'numerical', 'testing', 'indicates', 'the', 'approach', 'has', 'little', 'or', 'no', 'conservatism', 'for', 'a', 'large', 'class', 'of', 'systems']]
|
[-0.11912908131384965, 0.013535950012215062, -0.09272316086153405, 0.045009393482692096, -0.07751407665284184, -0.16079680839955005, 0.003605791131274295, 0.3177225317437938, -0.267228925714972, -0.26738121788000724, 0.17626927988701305, -0.2400488035398198, -0.16360284482034113, 0.236845014630789, -0.08387450954993952, 0.13141325255472514, 0.08363166531411273, 0.015903438870867568, -0.09560522192222635, -0.21908447690151944, 0.3914687275805672, -0.03281983543427181, 0.2336175713331221, 0.04523523526982834, 0.11760506337553174, 0.00639583543500679, -0.01350030563994796, 0.03586333145989023, -0.1320979174123352, 0.13674143632779087, 0.24097676076619567, 0.09949038127328487, 0.32018786561284995, -0.3966192042547094, -0.22448038569690582, 0.10637818730074124, 0.1234473453550237, 0.09633814442755019, -0.047128244257855514, -0.2695115386748207, 0.09026762905104008, -0.15062445251851114, -0.1601047117101352, -0.09509450203005759, -0.015467497676298647, 0.04754282149812485, -0.3294470721721917, 0.08345413898692249, 0.05759412505730853, 0.0757135099391202, -0.10959445310458206, -0.08507332280222438, 0.0027801779804271674, 0.0882589183156978, 0.023623103800112615, -0.022699154035082297, 0.053616643092779075, -0.06788358702686821, -0.1219330853238858, 0.3618576636337145, -0.060714231745457044, -0.28281636728520343, 0.21350053884158704, -0.09023171862654254, -0.155328424416014, 0.08846554999758166, 0.2166607902673893, 0.15688887147879796, -0.17577615938148347, 0.11489395079416262, -0.045586797036509405, 0.182091743292142, 0.047489937247072685, 0.01730339092127198, 0.13248749774156424, 0.15255778559489164, 0.10702443717976107, 0.14884380595047517, -0.0034884605246517965, -0.10232882647326183, -0.32677332500851863, -0.173540908687129, -0.14833654926164064, 0.03058369469223823, -0.06982762683791173, -0.19212872204984244, 0.38818486721650836, 0.13974785388023508, 0.1422109096840827, 0.08935748203378728, 0.24681940562688484, 0.15344224572509338, 0.06461132645138545, 0.07654087812257067, 0.20236837258701865, 0.12623399867352744, 0.1314806263338953, -0.185578091323451, 0.07171480772001836, 0.10373294368263579]
|
1,803.07291
|
Generalized Statistical limit points and cluster points via ideal
|
In this paper we have extended the notion of statistical limit point as
introduced by Fridy[8] to I-statistical limit point of sequences of real
numbers and studied some basic properties of the set of all I-statistical limit
points and I-statistical cluster points of real sequences.
|
math.FA
|
in this paper we have extended the notion of statistical limit point as introduced by fridy8 to istatistical limit point of sequences of real numbers and studied some basic properties of the set of all istatistical limit points and istatistical cluster points of real sequences
|
[['in', 'this', 'paper', 'we', 'have', 'extended', 'the', 'notion', 'of', 'statistical', 'limit', 'point', 'as', 'introduced', 'by', 'fridy8', 'to', 'istatistical', 'limit', 'point', 'of', 'sequences', 'of', 'real', 'numbers', 'and', 'studied', 'some', 'basic', 'properties', 'of', 'the', 'set', 'of', 'all', 'istatistical', 'limit', 'points', 'and', 'istatistical', 'cluster', 'points', 'of', 'real', 'sequences']]
|
[-0.15487016219942068, 0.05192178792574189, -0.0849985835057768, 0.06607025479421612, 0.04232308714100244, -0.021254832835190675, 0.1727473404157949, 0.28577752580696886, -0.2856014140627601, -0.2563130713321946, 0.11947797588866459, -0.27028131832114677, -0.17497635996815833, 0.19613952445797622, -0.0986835448896851, 0.10218291606923396, 0.044300769550979814, 0.04248695337975567, -0.026663039429959925, -0.27379432966170664, 0.40040944019247865, -0.011409371921961958, 0.21539446275511925, -0.014361839127642188, 0.10943614445965398, 0.031871960159729824, -0.009957966585220262, 0.056053459009324964, -0.15035330576144837, 0.11399137533523819, 0.21552668452601542, 0.11798512986437841, 0.25522278118031944, -0.35063482787121425, -0.15513987140730023, 0.18315998303957962, 0.15513592336157506, 0.025253773393739142, -0.0014418296261944554, -0.27915563756092027, 0.17891452664678748, -0.1012785928323865, -0.20265878525308587, -0.07846356424587694, 0.030573155625130643, 0.13531562412919645, -0.1994939614934, 0.0021805273665284567, 0.11556439901786772, 0.15483615016141397, -0.012045863465490666, -0.12108675593679602, -0.00747831383804706, 0.14379582017533143, 0.059851515128023246, -0.012054802786389535, 0.08451854832343418, -0.08759711457903242, -0.13700973712415856, 0.3856376184319908, -0.017851421990516512, -0.1636573007668961, 0.20050480572337454, -0.16734207918952135, -0.18929245373742146, 0.08181139080658216, 0.12382015266286378, 0.12295507838610899, -0.14929187488318843, 0.157038781556449, -0.08640010834840889, 0.08180012664657128, 0.13121233040212907, 0.08567970309575851, 0.17766759409145874, 0.12038665573874657, 0.04673410740956156, 0.16519841318950057, -0.10418183127926155, -0.12515360456679694, -0.3197286880405789, -0.14549609432155688, -0.1957869299168868, 0.07031705497171391, -0.10986026945796436, -0.2295718840535053, 0.35798823266205465, 0.177224334244701, 0.2413681108419868, 0.08328270050697029, 0.1919405805238057, 0.13011188607759488, -0.025055054665162144, 0.020420423079155047, 0.1485462652615917, 0.17697817312066697, 0.0633928138043054, -0.09376588443675163, -0.039127234517681325, 0.14430838009998712]
|
1,803.07292
|
Natural Language or Not (NLoN) - A Package for Software Engineering Text
Analysis Pipeline
|
The use of natural language processing (NLP) is gaining popularity in
software engineering. In order to correctly perform NLP, we must pre-process
the textual information to separate natural language from other information,
such as log messages, that are often part of the communication in software
engineering. We present a simple approach for classifying whether some textual
input is natural language or not. Although our NLoN package relies on only 11
language features and character tri-grams, we are able to achieve an area under
the ROC curve performances between 0.976-0.987 on three different data sources,
with Lasso regression from Glmnet as our learner and two human raters for
providing ground truth. Cross-source prediction performance is lower and has
more fluctuation with top ROC performances from 0.913 to 0.980. Compared with
prior work, our approach offers similar performance but is considerably more
lightweight, making it easier to apply in software engineering text mining
pipelines. Our source code and data are provided as an R-package for further
improvements.
|
cs.SE
|
the use of natural language processing nlp is gaining popularity in software engineering in order to correctly perform nlp we must preprocess the textual information to separate natural language from other information such as log messages that are often part of the communication in software engineering we present a simple approach for classifying whether some textual input is natural language or not although our nlon package relies on only 11 language features and character trigrams we are able to achieve an area under the roc curve performances between 09760987 on three different data sources with lasso regression from glmnet as our learner and two human raters for providing ground truth crosssource prediction performance is lower and has more fluctuation with top roc performances from 0913 to 0980 compared with prior work our approach offers similar performance but is considerably more lightweight making it easier to apply in software engineering text mining pipelines our source code and data are provided as an rpackage for further improvements
|
[['the', 'use', 'of', 'natural', 'language', 'processing', 'nlp', 'is', 'gaining', 'popularity', 'in', 'software', 'engineering', 'in', 'order', 'to', 'correctly', 'perform', 'nlp', 'we', 'must', 'preprocess', 'the', 'textual', 'information', 'to', 'separate', 'natural', 'language', 'from', 'other', 'information', 'such', 'as', 'log', 'messages', 'that', 'are', 'often', 'part', 'of', 'the', 'communication', 'in', 'software', 'engineering', 'we', 'present', 'a', 'simple', 'approach', 'for', 'classifying', 'whether', 'some', 'textual', 'input', 'is', 'natural', 'language', 'or', 'not', 'although', 'our', 'nlon', 'package', 'relies', 'on', 'only', '11', 'language', 'features', 'and', 'character', 'trigrams', 'we', 'are', 'able', 'to', 'achieve', 'an', 'area', 'under', 'the', 'roc', 'curve', 'performances', 'between', '09760987', 'on', 'three', 'different', 'data', 'sources', 'with', 'lasso', 'regression', 'from', 'glmnet', 'as', 'our', 'learner', 'and', 'two', 'human', 'raters', 'for', 'providing', 'ground', 'truth', 'crosssource', 'prediction', 'performance', 'is', 'lower', 'and', 'has', 'more', 'fluctuation', 'with', 'top', 'roc', 'performances', 'from', '0913', 'to', '0980', 'compared', 'with', 'prior', 'work', 'our', 'approach', 'offers', 'similar', 'performance', 'but', 'is', 'considerably', 'more', 'lightweight', 'making', 'it', 'easier', 'to', 'apply', 'in', 'software', 'engineering', 'text', 'mining', 'pipelines', 'our', 'source', 'code', 'and', 'data', 'are', 'provided', 'as', 'an', 'rpackage', 'for', 'further', 'improvements']]
|
[-0.00840239858603322, -0.02964400733603976, -0.0911564487161149, 0.09184069615543071, -0.17087051225540462, -0.19869536574804253, 0.02474363552880662, 0.45826036345922144, -0.25260117777731794, -0.3583170097304131, 0.09502279926434251, -0.3281484462143682, -0.13630553653915098, 0.285507542265442, -0.14174642170596571, 0.08009969231678299, 0.10719602301565394, 0.07628556959719562, -0.03625261753014049, -0.3054834254817363, 0.26260222584520543, 0.051769881065009286, 0.3373223975846441, 0.031614622712189594, 0.041614575110850115, -0.013711451949548845, -0.035649281847890624, -0.05637733806838836, -0.04869794081547476, 0.1790803366617808, 0.3904000265478082, 0.24999614478877397, 0.28457160715722235, -0.3783688812282371, -0.19195898074622444, 0.045451456123814446, 0.12478751140972313, 0.077549088378494, -0.02920470966623976, -0.3009497548904887, 0.09774461641702001, -0.16686194700594603, 0.03415567534575753, -0.14498522853695908, 0.004964605329466835, -0.030530318517832118, -0.25539889152624584, 0.0074681161040085955, 0.06878410284893095, 0.14822209263906067, -0.0005452280701280921, -0.14296113336858757, 0.0049303038577132065, 0.18571742849590178, 0.05656183988678675, 0.08093644476615669, 0.1349109539596444, -0.13626962957083835, -0.11793425593359476, 0.40792935941528324, -0.06518464238437155, -0.22756013488454138, 0.23361693750886586, -0.019876024584383048, -0.1681400867653268, 0.08748006804109168, 0.19016054388067108, 0.05454685550434458, -0.19155013565962528, 0.027734148712468796, 0.012347454353709894, 0.2398081198820353, 0.06248032287665946, 0.01594668631106215, 0.17407712421774224, 0.2357919985168482, 0.019604926408937007, 0.13760792046386827, -0.07776501716794504, -0.04943784024063612, -0.218359485649978, -0.14657690029797013, -0.16450573599674492, -0.021779910246952312, -0.08600836065476418, -0.1497960244987497, 0.3735019260434651, 0.2314841577831793, 0.14017485273556293, 0.10734600434936811, 0.35297396445384055, 0.01870404823434659, 0.09121288093481145, 0.11797849513073252, 0.13730103386072529, 0.004775525594952922, 0.11517421072748907, -0.11924685898202649, 0.09941275872610097, -0.008264097505094815]
|
1,803.07293
|
Unsupervised Cross-dataset Person Re-identification by Transfer Learning
of Spatial-Temporal Patterns
|
Most of the proposed person re-identification algorithms conduct supervised
training and testing on single labeled datasets with small size, so directly
deploying these trained models to a large-scale real-world camera network may
lead to poor performance due to underfitting. It is challenging to
incrementally optimize the models by using the abundant unlabeled data
collected from the target domain. To address this challenge, we propose an
unsupervised incremental learning algorithm, TFusion, which is aided by the
transfer learning of the pedestrians' spatio-temporal patterns in the target
domain. Specifically, the algorithm firstly transfers the visual classifier
trained from small labeled source dataset to the unlabeled target dataset so as
to learn the pedestrians' spatial-temporal patterns. Secondly, a Bayesian
fusion model is proposed to combine the learned spatio-temporal patterns with
visual features to achieve a significantly improved classifier. Finally, we
propose a learning-to-rank based mutual promotion procedure to incrementally
optimize the classifiers based on the unlabeled data in the target domain.
Comprehensive experiments based on multiple real surveillance datasets are
conducted, and the results show that our algorithm gains significant
improvement compared with the state-of-art cross-dataset unsupervised person
re-identification algorithms.
|
cs.CV
|
most of the proposed person reidentification algorithms conduct supervised training and testing on single labeled datasets with small size so directly deploying these trained models to a largescale realworld camera network may lead to poor performance due to underfitting it is challenging to incrementally optimize the models by using the abundant unlabeled data collected from the target domain to address this challenge we propose an unsupervised incremental learning algorithm tfusion which is aided by the transfer learning of the pedestrians spatiotemporal patterns in the target domain specifically the algorithm firstly transfers the visual classifier trained from small labeled source dataset to the unlabeled target dataset so as to learn the pedestrians spatialtemporal patterns secondly a bayesian fusion model is proposed to combine the learned spatiotemporal patterns with visual features to achieve a significantly improved classifier finally we propose a learningtorank based mutual promotion procedure to incrementally optimize the classifiers based on the unlabeled data in the target domain comprehensive experiments based on multiple real surveillance datasets are conducted and the results show that our algorithm gains significant improvement compared with the stateofart crossdataset unsupervised person reidentification algorithms
|
[['most', 'of', 'the', 'proposed', 'person', 'reidentification', 'algorithms', 'conduct', 'supervised', 'training', 'and', 'testing', 'on', 'single', 'labeled', 'datasets', 'with', 'small', 'size', 'so', 'directly', 'deploying', 'these', 'trained', 'models', 'to', 'a', 'largescale', 'realworld', 'camera', 'network', 'may', 'lead', 'to', 'poor', 'performance', 'due', 'to', 'underfitting', 'it', 'is', 'challenging', 'to', 'incrementally', 'optimize', 'the', 'models', 'by', 'using', 'the', 'abundant', 'unlabeled', 'data', 'collected', 'from', 'the', 'target', 'domain', 'to', 'address', 'this', 'challenge', 'we', 'propose', 'an', 'unsupervised', 'incremental', 'learning', 'algorithm', 'tfusion', 'which', 'is', 'aided', 'by', 'the', 'transfer', 'learning', 'of', 'the', 'pedestrians', 'spatiotemporal', 'patterns', 'in', 'the', 'target', 'domain', 'specifically', 'the', 'algorithm', 'firstly', 'transfers', 'the', 'visual', 'classifier', 'trained', 'from', 'small', 'labeled', 'source', 'dataset', 'to', 'the', 'unlabeled', 'target', 'dataset', 'so', 'as', 'to', 'learn', 'the', 'pedestrians', 'spatialtemporal', 'patterns', 'secondly', 'a', 'bayesian', 'fusion', 'model', 'is', 'proposed', 'to', 'combine', 'the', 'learned', 'spatiotemporal', 'patterns', 'with', 'visual', 'features', 'to', 'achieve', 'a', 'significantly', 'improved', 'classifier', 'finally', 'we', 'propose', 'a', 'learningtorank', 'based', 'mutual', 'promotion', 'procedure', 'to', 'incrementally', 'optimize', 'the', 'classifiers', 'based', 'on', 'the', 'unlabeled', 'data', 'in', 'the', 'target', 'domain', 'comprehensive', 'experiments', 'based', 'on', 'multiple', 'real', 'surveillance', 'datasets', 'are', 'conducted', 'and', 'the', 'results', 'show', 'that', 'our', 'algorithm', 'gains', 'significant', 'improvement', 'compared', 'with', 'the', 'stateofart', 'crossdataset', 'unsupervised', 'person', 'reidentification', 'algorithms']]
|
[0.00265850793565273, -0.03365136556236902, -0.07792818069618235, 0.06329789384323302, -0.16777517007143106, -0.1943580075868115, 0.06534762829492088, 0.47559834100426207, -0.2823838988669224, -0.3748702569013482, 0.04663685848560905, -0.2857626892225091, -0.18604079865905587, 0.17946268001778468, -0.18327345583532806, 0.10297929306116496, 0.20335693691947287, 0.07357821096221775, -0.030067737218022587, -0.34817835207658027, 0.31252355654148123, 0.0574220897084082, 0.4026725074997352, -0.002762170034080183, 0.1665359683033149, -0.05576132817609456, -0.0626126334912354, -0.014929386482308668, -0.03134020130101983, 0.20347565670137205, 0.35796251621208264, 0.23754670478213297, 0.3224366568729922, -0.39755438854016606, -0.2103527356827912, 0.11561553576029837, 0.13986139190233043, 0.12812426085261533, -0.03860991020306384, -0.4356636942617135, 0.10009677955187277, -0.1438990074575388, 0.05735805122462172, -0.14635699044697748, -0.06293218300467537, -0.026787872525728156, -0.3401119645574801, 0.009886133898880774, 0.03304436570534142, 0.07918054308061317, -0.05132801095662158, -0.1072881484957492, 0.03974294792034573, 0.18989821207228927, 0.06662478311405447, 0.05958485693961222, 0.1492070863649289, -0.18757930943136533, -0.15981973205775685, 0.3380358393894889, -0.045710285941842364, -0.22368656690182384, 0.21370545538487815, -0.0016035045176664346, -0.11242355231786527, 0.12886504597507506, 0.29908288794855076, 0.15251746410954622, -0.18731934661346097, -0.03278925566576041, -0.07772732513483553, 0.2046578313294117, 0.02675335791828211, -0.07098534201041505, 0.14925448285097817, 0.3079354808795997, 0.03366806424192844, 0.16630052941255472, -0.19659044785720486, -0.04726943317600476, -0.16000161301225715, -0.007148978612085264, -0.22959150548057972, -0.06904970794826651, -0.12830169639103892, -0.13448062940146738, 0.36674005435078694, 0.28813427733570357, 0.24254916935047555, 0.11063856389110667, 0.37739646798300164, -0.029816663770195376, 0.1315953522164535, 0.10203716576209552, 0.1482989098250826, -0.059449661076219094, 0.14840403838603888, -0.21281542215603955, 0.08926359550671913, 0.02954880338943293]
|
1,803.07294
|
GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal
Graphs
|
We propose a new network architecture, Gated Attention Networks (GaAN), for
learning on graphs. Unlike the traditional multi-head attention mechanism,
which equally consumes all attention heads, GaAN uses a convolutional
sub-network to control each attention head's importance. We demonstrate the
effectiveness of GaAN on the inductive node classification problem. Moreover,
with GaAN as a building block, we construct the Graph Gated Recurrent Unit
(GGRU) to address the traffic speed forecasting problem. Extensive experiments
on three real-world datasets show that our GaAN framework achieves
state-of-the-art results on both tasks.
|
cs.LG cs.SI
|
we propose a new network architecture gated attention networks gaan for learning on graphs unlike the traditional multihead attention mechanism which equally consumes all attention heads gaan uses a convolutional subnetwork to control each attention heads importance we demonstrate the effectiveness of gaan on the inductive node classification problem moreover with gaan as a building block we construct the graph gated recurrent unit ggru to address the traffic speed forecasting problem extensive experiments on three realworld datasets show that our gaan framework achieves stateoftheart results on both tasks
|
[['we', 'propose', 'a', 'new', 'network', 'architecture', 'gated', 'attention', 'networks', 'gaan', 'for', 'learning', 'on', 'graphs', 'unlike', 'the', 'traditional', 'multihead', 'attention', 'mechanism', 'which', 'equally', 'consumes', 'all', 'attention', 'heads', 'gaan', 'uses', 'a', 'convolutional', 'subnetwork', 'to', 'control', 'each', 'attention', 'heads', 'importance', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'gaan', 'on', 'the', 'inductive', 'node', 'classification', 'problem', 'moreover', 'with', 'gaan', 'as', 'a', 'building', 'block', 'we', 'construct', 'the', 'graph', 'gated', 'recurrent', 'unit', 'ggru', 'to', 'address', 'the', 'traffic', 'speed', 'forecasting', 'problem', 'extensive', 'experiments', 'on', 'three', 'realworld', 'datasets', 'show', 'that', 'our', 'gaan', 'framework', 'achieves', 'stateoftheart', 'results', 'on', 'both', 'tasks']]
|
[-0.11165337547681284, -0.051746028427291535, 0.0297923416177603, 0.018531964288960243, -0.1344438759401312, -0.23674088468689514, 0.08871903042469559, 0.5162224017254923, -0.24164545084296288, -0.2507636112899616, 0.07196833509764496, -0.2876942187130194, -0.2512107519365997, 0.20588332650133934, -0.15876782849837823, 0.07727445972462495, 0.1815495147830111, 0.08106516928192237, 0.002807250281196387, -0.28489945557713775, 0.25987318893841027, 0.038007257998674764, 0.4369713193897543, 0.04453339192202722, 0.16421326617014476, -0.019697068874649275, -0.005652123609900303, -0.023646530337984962, -0.03181863519613666, 0.17940081716193979, 0.26789667538699063, 0.16726795350597506, 0.37566654319907056, -0.45104422694307633, -0.29861592796855957, 0.07713576803390665, 0.11934932029067442, 0.07110683507056527, -0.06389462564879193, -0.295724437796864, 0.10292877098438384, -0.2230961323961958, 0.09851333627948301, -0.12139225348658945, -0.0325888566747736, -0.022269980310216205, -0.2804753303356554, -0.0311937531665096, 0.09148611080693617, -0.017651292340209086, -0.016636133584697014, -0.11959228057403588, 0.022328797789376187, 0.15959348767760329, -0.018861465669911485, 0.024583050317462832, 0.18496842643824116, -0.1401157831537655, -0.23880226648380531, 0.3245921104332839, -0.018824793013005423, -0.21863089425853272, 0.1658886254861437, 0.016865464066551334, -0.2199628716762895, 0.01657873013688401, 0.28304222602953855, 0.13682632773429498, -0.10434764235055652, 0.015815183201847577, -0.11563891450735345, 0.17052635551569448, 0.04540454532854773, -0.013728612747535795, 0.1541379200208975, 0.3359694870873943, 0.05726506489318335, 0.20446653330923412, -0.1618481228481336, -0.12491889748101433, -0.15795296099807682, -0.062232394006916845, -0.19204618971414822, -0.03761381096870307, -0.10558326508121929, -0.1396327446717983, 0.4677253507248972, 0.2353466678218081, 0.2223927628934041, 0.20147709319523224, 0.36783381525812475, -0.03576366456182695, 0.16014156955155148, 0.1463492975313345, 0.11712020282879815, 0.030919256984074224, 0.13537243850617509, -0.17664435520853805, 0.05729546507916831, 0.10945662147975688]
|
1,803.07295
|
Expressivity in TTS from Semantics and Pragmatics
|
In this paper we present ongoing work to produce an expressive TTS reader
that can be used both in text and dialogue applications. The system called
SPARSAR has been used to read (English) poetry so far but it can now be applied
to any text. The text is fully analyzed both at phonetic and phonological
level, and at syntactic and semantic level. In addition, the system has access
to a restricted list of typical pragmatically marked phrases and expressions
that are used to convey specific discourse function and speech acts and need
specialized intonational contours. The text is transformed into a poem-like
structures, where each line corresponds to a Breath Group, semantically and
syntactically consistent. Stanzas correspond to paragraph boundaries.
Analogical parameters are related to ToBI theoretical indices but their number
is doubled. In this paper, we concentrate on short stories and fables.
|
cs.CL
|
in this paper we present ongoing work to produce an expressive tts reader that can be used both in text and dialogue applications the system called sparsar has been used to read english poetry so far but it can now be applied to any text the text is fully analyzed both at phonetic and phonological level and at syntactic and semantic level in addition the system has access to a restricted list of typical pragmatically marked phrases and expressions that are used to convey specific discourse function and speech acts and need specialized intonational contours the text is transformed into a poemlike structures where each line corresponds to a breath group semantically and syntactically consistent stanzas correspond to paragraph boundaries analogical parameters are related to tobi theoretical indices but their number is doubled in this paper we concentrate on short stories and fables
|
[['in', 'this', 'paper', 'we', 'present', 'ongoing', 'work', 'to', 'produce', 'an', 'expressive', 'tts', 'reader', 'that', 'can', 'be', 'used', 'both', 'in', 'text', 'and', 'dialogue', 'applications', 'the', 'system', 'called', 'sparsar', 'has', 'been', 'used', 'to', 'read', 'english', 'poetry', 'so', 'far', 'but', 'it', 'can', 'now', 'be', 'applied', 'to', 'any', 'text', 'the', 'text', 'is', 'fully', 'analyzed', 'both', 'at', 'phonetic', 'and', 'phonological', 'level', 'and', 'at', 'syntactic', 'and', 'semantic', 'level', 'in', 'addition', 'the', 'system', 'has', 'access', 'to', 'a', 'restricted', 'list', 'of', 'typical', 'pragmatically', 'marked', 'phrases', 'and', 'expressions', 'that', 'are', 'used', 'to', 'convey', 'specific', 'discourse', 'function', 'and', 'speech', 'acts', 'and', 'need', 'specialized', 'intonational', 'contours', 'the', 'text', 'is', 'transformed', 'into', 'a', 'poemlike', 'structures', 'where', 'each', 'line', 'corresponds', 'to', 'a', 'breath', 'group', 'semantically', 'and', 'syntactically', 'consistent', 'stanzas', 'correspond', 'to', 'paragraph', 'boundaries', 'analogical', 'parameters', 'are', 'related', 'to', 'tobi', 'theoretical', 'indices', 'but', 'their', 'number', 'is', 'doubled', 'in', 'this', 'paper', 'we', 'concentrate', 'on', 'short', 'stories', 'and', 'fables']]
|
[-0.044504233676785326, 0.0724708102353491, -0.06331492563975709, 0.1117115654558542, -0.18982506453924414, -0.148363968733299, 0.04171329616302891, 0.45150435481752665, -0.2624750984998952, -0.29165885600003616, 0.0671216731275698, -0.31255431762630387, -0.13241385417724294, 0.1871226248560041, -0.13324777289027614, 0.03848606382629701, 0.05357675489670198, 0.1134266849973106, -0.004868247519646372, -0.2577291937677988, 0.29240427800853336, 0.024579839937255852, 0.28694412065669894, 0.027976913380968783, 0.08497353148912745, -0.07465233449558062, -0.04918933644491647, -0.013694590692674475, -0.06862664679782549, 0.13784560232223678, 0.3861638290940651, 0.1985669933276118, 0.24461017500476112, -0.407638784404844, -0.15016827888404286, 0.06259153868138258, 0.18148984034861704, 0.1221128643598474, 0.01890582956756199, -0.3302382328281445, 0.11860558233456686, -0.16356460297746317, 0.04072563857106226, -0.09708891940037055, 0.0452741799377171, -0.012598312632845981, -0.20964736502085413, -0.0032961434913366767, 0.11091682727648211, 0.10371382558452232, -0.018748394835607283, -0.0949015361705928, -0.006872443244459906, 0.2029413790475311, 0.031558392517867365, 0.10774321165143712, 0.11072615649152015, -0.1277502404043584, -0.09916742315732076, 0.4143009982337909, -0.04652172572179032, -0.2620633377244563, 0.20386591080626074, -0.07256941408018715, -0.15867388042554792, 0.10261904843417662, 0.18701057213890765, 0.08069756200004902, -0.18093831551460815, 0.026784749187312887, -0.03164764157762485, 0.24794577058471207, 0.11396118207235954, 0.015129254016626095, 0.22371198088803795, 0.16655844304311487, -0.04355484986611243, 0.13284473102706085, -0.05110972666381193, -0.02527294566056558, -0.24823277538110103, -0.1403746355574445, -0.1355596780045224, -0.0415952691874866, 0.010959144053984866, -0.15394411003882333, 0.39478909986625826, 0.2146365808889511, 0.18454332313766436, 0.07216869499866983, 0.25249614267210874, 0.10081846702710859, 0.1037015417890091, 0.06401566535558752, 0.11548574745122875, 0.030858051372758512, 0.14103225119678037, -0.08839805512938516, 0.11019899787913476, 0.043389223419528986]
|
1,803.07296
|
A spectral inequality for degenerated operators and applications
|
In this paper we establish a Lebeau-Robbiano spectral inequality for a
degenerated one dimensional elliptic operator and show how it can be used to
impulse control and finite time stabilization for a degenerated parabolic
equation. R{\'e}sum{\'e} .-Dans cet article, on s'int{\'e}r{\`e}ss{\`e} a
l'in{\'e}galit{\'e} spectrale de type Lebeau-Robbiano sur la somme de fonctions
propres pour une famille d'op{\'e}rateurs d{\'e}g{\'e}n{\'e}r{\'e}s. Les
applications sont donn{\'e}es en th{\'e}orie du contr{\^o}le comme le
contr{\^o}le impulsionnel et la stabilisation en temps fini.
|
math.AP
|
in this paper we establish a lebeaurobbiano spectral inequality for a degenerated one dimensional elliptic operator and show how it can be used to impulse control and finite time stabilization for a degenerated parabolic equation resume dans cet article on sinteresse a linegalite spectrale de type lebeaurobbiano sur la somme de fonctions propres pour une famille doperateurs degeneres les applications sont donnees en theorie du controle comme le controle impulsionnel et la stabilisation en temps fini
|
[['in', 'this', 'paper', 'we', 'establish', 'a', 'lebeaurobbiano', 'spectral', 'inequality', 'for', 'a', 'degenerated', 'one', 'dimensional', 'elliptic', 'operator', 'and', 'show', 'how', 'it', 'can', 'be', 'used', 'to', 'impulse', 'control', 'and', 'finite', 'time', 'stabilization', 'for', 'a', 'degenerated', 'parabolic', 'equation', 'resume', 'dans', 'cet', 'article', 'on', 'sinteresse', 'a', 'linegalite', 'spectrale', 'de', 'type', 'lebeaurobbiano', 'sur', 'la', 'somme', 'de', 'fonctions', 'propres', 'pour', 'une', 'famille', 'doperateurs', 'degeneres', 'les', 'applications', 'sont', 'donnees', 'en', 'theorie', 'du', 'controle', 'comme', 'le', 'controle', 'impulsionnel', 'et', 'la', 'stabilisation', 'en', 'temps', 'fini']]
|
[-0.172005546434472, 0.02412480459962454, -0.19010830484977406, 0.06678588824676505, -0.1258222108396391, -0.1906055063009262, -0.18828510571782114, 0.09286264939388882, -0.22242634950412643, -0.213220438751806, 0.12452381101482185, -0.3525376751462722, -0.1888597521206571, 0.1961388140011372, -0.31789743001314086, -0.04771490771478663, -0.10075505421910849, -0.12743404590421253, 0.0381398624190802, -0.2675787485722039, 0.2878397875045064, 0.0976639173079295, 0.27344852591502583, -0.04079703082647433, 0.24166237517622197, 0.16638046433864576, 0.12298847517619531, -0.1535383751615882, -0.3447532481125866, 0.04755175236884194, 0.40661364095285535, 0.09703784683046655, 0.26960039438886774, -0.3276285940988196, -0.04715813239777668, 0.1365441218432453, 0.12546340451485272, -0.005344245398494725, -0.013057081586642502, -0.41036505993300426, 0.13800072997239315, -0.240698723974573, -0.10211920864983565, -0.04626984156655251, -0.12787124477391545, 0.03941363329067826, -0.2930729155260552, 0.14103023189171734, 0.034863933151225664, 0.1223827283958801, -0.03804270242754784, -0.22166508046858427, -0.18670537917771274, -0.05981463709354608, -0.1669076140387915, 0.09126472012657258, -0.030719375891041838, 0.10309710408778806, -0.0315337075606092, 0.2399830609663493, -0.14665841542753494, -0.10332832988610284, 0.13866143704702458, -0.04914076396703927, -0.28478748962515965, 0.03951215269302742, 0.13608546066744667, 0.21267581177461478, 0.14739898792403336, 0.3466054450109368, 0.041667104362406664, 0.13013144820514652, 0.26676917844451964, -0.0873078028154042, 0.04610564181995061, 0.04608905085155533, 0.02220136133433294, -0.18117810073858387, -0.013979950677215433, 0.030267463337319594, -0.21728839159024776, -0.4090420137314747, -0.015483526952771677, 0.12446640070993453, -0.019176036562081816, -0.27566613701896536, 0.16258670249953866, 0.027247393105224345, 0.10624834001323001, 0.052799748243867524, 0.11289804498988411, -0.07865175924962386, -0.12600695149093452, 0.056357384618523715, 0.0943397364527401, 0.04060786644307276, 0.288340756931575, -0.27703962568193674, -0.09134728993133952, 0.31538167568699765]
|
1,803.07297
|
Polarization and Index Modulations: a Theoretical and Practical
Perspective
|
Radiocommunication systems have evolved significantly in recent years in
order to meet present and future demands. Historically, time, frequency and
more recently, spatial dimensions have been used to improve capacity and
robustness. Paradoxically, radiocommunications that leverage the polarization
dimension have not evolved at the same pace. In particular, these
communications are widely used by satellites, where several streams are
multiplexed in each orthogonal polarization. Current communication trends
advocate for simplifying and unifying different frameworks in order to increase
flexibility and address future needs. Due to this, systems that do not require
channel information are progressively gaining traction. This dissertation aims
at challenging this perspective and promoting the use of polarization in new
radiocommunication systems. Consequently, the goal of this thesis is twofold:
first, we aim at increasing the current capacity of point-to-point and
point-to-multipoint links. Secondly, we introduce new mechanisms to increase
the robustness of communications in particularly hostile environments. In this
context, this thesis advocates for the use of polarization as a dimension to be
exploited in radiocommunications. In addition to the use of polarization, index
modulations help increase transmission rates whilst improving robustness
against errors and imperfections with a low computational complexity. Thus, the
study of polarization in these systems is essential. This dissertation explores
primordial aspects in this area, such as channel capacity, transmitter and
receiver design and performance benchmarking with current systems. Finally, we
identify and discuss various characteristic aspects of polarization. In this
thesis, the reader will navigate the mathematical foundations of the proposed
concepts as well as their implementation in real-life scenarios.
|
eess.SP cs.IT math.IT
|
radiocommunication systems have evolved significantly in recent years in order to meet present and future demands historically time frequency and more recently spatial dimensions have been used to improve capacity and robustness paradoxically radiocommunications that leverage the polarization dimension have not evolved at the same pace in particular these communications are widely used by satellites where several streams are multiplexed in each orthogonal polarization current communication trends advocate for simplifying and unifying different frameworks in order to increase flexibility and address future needs due to this systems that do not require channel information are progressively gaining traction this dissertation aims at challenging this perspective and promoting the use of polarization in new radiocommunication systems consequently the goal of this thesis is twofold first we aim at increasing the current capacity of pointtopoint and pointtomultipoint links secondly we introduce new mechanisms to increase the robustness of communications in particularly hostile environments in this context this thesis advocates for the use of polarization as a dimension to be exploited in radiocommunications in addition to the use of polarization index modulations help increase transmission rates whilst improving robustness against errors and imperfections with a low computational complexity thus the study of polarization in these systems is essential this dissertation explores primordial aspects in this area such as channel capacity transmitter and receiver design and performance benchmarking with current systems finally we identify and discuss various characteristic aspects of polarization in this thesis the reader will navigate the mathematical foundations of the proposed concepts as well as their implementation in reallife scenarios
|
[['radiocommunication', 'systems', 'have', 'evolved', 'significantly', 'in', 'recent', 'years', 'in', 'order', 'to', 'meet', 'present', 'and', 'future', 'demands', 'historically', 'time', 'frequency', 'and', 'more', 'recently', 'spatial', 'dimensions', 'have', 'been', 'used', 'to', 'improve', 'capacity', 'and', 'robustness', 'paradoxically', 'radiocommunications', 'that', 'leverage', 'the', 'polarization', 'dimension', 'have', 'not', 'evolved', 'at', 'the', 'same', 'pace', 'in', 'particular', 'these', 'communications', 'are', 'widely', 'used', 'by', 'satellites', 'where', 'several', 'streams', 'are', 'multiplexed', 'in', 'each', 'orthogonal', 'polarization', 'current', 'communication', 'trends', 'advocate', 'for', 'simplifying', 'and', 'unifying', 'different', 'frameworks', 'in', 'order', 'to', 'increase', 'flexibility', 'and', 'address', 'future', 'needs', 'due', 'to', 'this', 'systems', 'that', 'do', 'not', 'require', 'channel', 'information', 'are', 'progressively', 'gaining', 'traction', 'this', 'dissertation', 'aims', 'at', 'challenging', 'this', 'perspective', 'and', 'promoting', 'the', 'use', 'of', 'polarization', 'in', 'new', 'radiocommunication', 'systems', 'consequently', 'the', 'goal', 'of', 'this', 'thesis', 'is', 'twofold', 'first', 'we', 'aim', 'at', 'increasing', 'the', 'current', 'capacity', 'of', 'pointtopoint', 'and', 'pointtomultipoint', 'links', 'secondly', 'we', 'introduce', 'new', 'mechanisms', 'to', 'increase', 'the', 'robustness', 'of', 'communications', 'in', 'particularly', 'hostile', 'environments', 'in', 'this', 'context', 'this', 'thesis', 'advocates', 'for', 'the', 'use', 'of', 'polarization', 'as', 'a', 'dimension', 'to', 'be', 'exploited', 'in', 'radiocommunications', 'in', 'addition', 'to', 'the', 'use', 'of', 'polarization', 'index', 'modulations', 'help', 'increase', 'transmission', 'rates', 'whilst', 'improving', 'robustness', 'against', 'errors', 'and', 'imperfections', 'with', 'a', 'low', 'computational', 'complexity', 'thus', 'the', 'study', 'of', 'polarization', 'in', 'these', 'systems', 'is', 'essential', 'this', 'dissertation', 'explores', 'primordial', 'aspects', 'in', 'this', 'area', 'such', 'as', 'channel', 'capacity', 'transmitter', 'and', 'receiver', 'design', 'and', 'performance', 'benchmarking', 'with', 'current', 'systems', 'finally', 'we', 'identify', 'and', 'discuss', 'various', 'characteristic', 'aspects', 'of', 'polarization', 'in', 'this', 'thesis', 'the', 'reader', 'will', 'navigate', 'the', 'mathematical', 'foundations', 'of', 'the', 'proposed', 'concepts', 'as', 'well', 'as', 'their', 'implementation', 'in', 'reallife', 'scenarios']]
|
[-0.13247934237863443, 0.06901592211870029, -0.03618611604184663, 0.029951155186150685, -0.07427634989261599, -0.14502977504748707, 0.040073499494131165, 0.38381758330447613, -0.254474295610959, -0.31168640527762326, 0.1296765260820732, -0.2367789675752351, -0.1718497761162431, 0.16977882174081926, -0.13809936933937778, 0.0733125195777596, 0.021590940583887143, -0.015731239191422514, -0.0378204257833923, -0.2737907708104512, 0.3030435218279026, 0.11968342257959609, 0.335879064923109, 0.07166396060691381, 0.03457800969936074, -0.003292995519474033, -0.04987409906714519, 0.0016651217457513477, -0.1056502797901328, 0.1427143917115795, 0.3306626280979073, 0.1598026915854962, 0.28543549610388486, -0.4524998495052027, -0.2471112879710597, 0.10075867070382494, 0.174996641260579, 0.1164069262273653, -0.05239217839269879, -0.23784020315321494, 0.0810969669905188, -0.20061304208248593, -0.118662943492297, -0.08012830632126912, 0.010641715802024877, 0.016676138017990793, -0.20556825699281062, 0.023158476888310423, 0.034711705851494946, 0.084118264734514, -0.004644732116432788, -0.12271868338079242, 0.037562249994984746, 0.17306465982520852, 0.044926787572263115, 0.024218401290898667, 0.08611368241019604, -0.12497193784120875, -0.13703475439877705, 0.37492388383532305, -0.01721078612098954, -0.18479040748793488, 0.23007926966339826, -0.13635542394201697, -0.1683251878748424, 0.08166070724544187, 0.2677712710709636, 0.05805247460217612, -0.16480248784258342, 0.04284426618884985, 0.07464223388625785, 0.16074942200184736, 0.06870014701388748, 0.13923456789582767, 0.22677190504812947, 0.1900108964642683, 0.07442250324308497, 0.14089033985826324, -0.07108933542486887, -0.0852508082951585, -0.22579934790571646, -0.16813815171855626, -0.13736968575579714, 0.0022348838312553185, -0.017600323040457534, -0.0499492425962474, 0.39128023701135156, 0.236527906310232, 0.1510895852693501, 0.05255008310615627, 0.3669452111222312, 0.05607531724006746, 0.06953314566071499, 0.08238712379026639, 0.24391126853608808, 0.09375324800462541, 0.17975144181174926, -0.17687387183279724, 0.08808035888238051, -0.05383296811938748]
|
1,803.07298
|
Robust Limits on Photon Mass from Statistical Samples of Extragalactic
Radio Pulsars
|
The photon zero-mass hypothesis has been investigated for a long time using
the frequency-dependent time delays of radio emissions from astrophysical
sources. However, the search for a rest mass of the photon has been hindered by
the similarity between the frequency-dependent dispersions due to the plasma
and nonzero photon mass effects. Considering the contributions to the observed
dispersion measure from both the plasma and nonzero photon mass effects, and
assuming the dispersion induced by the plasma effect is an unknown constant, we
obtain a robust limit on the photon mass by directly fitting a combination of
the dispersion measures of radio sources. Using the observed dispersion
measures from two statistical samples of extragalactic pulsars, here we show
that at the 68\% confidence level, the constraints on the photon mass can be as
low as $m_{\gamma}\leq1.51\times10^{-48}~\rm kg\simeq8.47\times10^{-13}~{\rm
eV}/c^{2}$ for the sample of 22 radio pulsars in the Large Magellanic Cloud and
$m_{\gamma}\leq1.58\times10^{-48}~\rm kg\simeq8.86\times10^{-13} {\rm
eV}/c^{2}$ for the other sample of 5 radio pulsars in the Small Magellanic
Cloud, which are comparable with that obtained by a single extragalactic
pulsar. Furthermore, the statistical approach presented here can also be used
when more fast radio bursts with known redshifts are detected in the future.
|
astro-ph.HE astro-ph.CO gr-qc hep-ph
|
the photon zeromass hypothesis has been investigated for a long time using the frequencydependent time delays of radio emissions from astrophysical sources however the search for a rest mass of the photon has been hindered by the similarity between the frequencydependent dispersions due to the plasma and nonzero photon mass effects considering the contributions to the observed dispersion measure from both the plasma and nonzero photon mass effects and assuming the dispersion induced by the plasma effect is an unknown constant we obtain a robust limit on the photon mass by directly fitting a combination of the dispersion measures of radio sources using the observed dispersion measures from two statistical samples of extragalactic pulsars here we show that at the 68 confidence level the constraints on the photon mass can be as low as m_gammaleq151times1048rm kgsimeq847times1013rm evc2 for the sample of 22 radio pulsars in the large magellanic cloud and m_gammaleq158times1048rm kgsimeq886times1013 rm evc2 for the other sample of 5 radio pulsars in the small magellanic cloud which are comparable with that obtained by a single extragalactic pulsar furthermore the statistical approach presented here can also be used when more fast radio bursts with known redshifts are detected in the future
|
[['the', 'photon', 'zeromass', 'hypothesis', 'has', 'been', 'investigated', 'for', 'a', 'long', 'time', 'using', 'the', 'frequencydependent', 'time', 'delays', 'of', 'radio', 'emissions', 'from', 'astrophysical', 'sources', 'however', 'the', 'search', 'for', 'a', 'rest', 'mass', 'of', 'the', 'photon', 'has', 'been', 'hindered', 'by', 'the', 'similarity', 'between', 'the', 'frequencydependent', 'dispersions', 'due', 'to', 'the', 'plasma', 'and', 'nonzero', 'photon', 'mass', 'effects', 'considering', 'the', 'contributions', 'to', 'the', 'observed', 'dispersion', 'measure', 'from', 'both', 'the', 'plasma', 'and', 'nonzero', 'photon', 'mass', 'effects', 'and', 'assuming', 'the', 'dispersion', 'induced', 'by', 'the', 'plasma', 'effect', 'is', 'an', 'unknown', 'constant', 'we', 'obtain', 'a', 'robust', 'limit', 'on', 'the', 'photon', 'mass', 'by', 'directly', 'fitting', 'a', 'combination', 'of', 'the', 'dispersion', 'measures', 'of', 'radio', 'sources', 'using', 'the', 'observed', 'dispersion', 'measures', 'from', 'two', 'statistical', 'samples', 'of', 'extragalactic', 'pulsars', 'here', 'we', 'show', 'that', 'at', 'the', '68', 'confidence', 'level', 'the', 'constraints', 'on', 'the', 'photon', 'mass', 'can', 'be', 'as', 'low', 'as', 'm_gammaleq151times1048rm', 'kgsimeq847times1013rm', 'evc2', 'for', 'the', 'sample', 'of', '22', 'radio', 'pulsars', 'in', 'the', 'large', 'magellanic', 'cloud', 'and', 'm_gammaleq158times1048rm', 'kgsimeq886times1013', 'rm', 'evc2', 'for', 'the', 'other', 'sample', 'of', '5', 'radio', 'pulsars', 'in', 'the', 'small', 'magellanic', 'cloud', 'which', 'are', 'comparable', 'with', 'that', 'obtained', 'by', 'a', 'single', 'extragalactic', 'pulsar', 'furthermore', 'the', 'statistical', 'approach', 'presented', 'here', 'can', 'also', 'be', 'used', 'when', 'more', 'fast', 'radio', 'bursts', 'with', 'known', 'redshifts', 'are', 'detected', 'in', 'the', 'future']]
|
[-0.07896034848175441, 0.18141072584609536, -0.06014636985669244, 0.11311145856099553, -0.060821299262694674, -0.06684617166582325, 0.08676111600290852, 0.397808056517958, -0.20114847893595014, -0.35698015695002855, 0.052040802951320665, -0.29984178377060117, -0.011690380238469331, 0.2584278363353918, 0.023610180475498517, 0.04117204594487315, 0.03577995976329152, -0.03559942747262983, -0.03941723891075341, -0.1672338934231586, 0.2985525353171102, 0.09557164581445268, 0.24441939624508624, 0.04333260614155475, 0.12662819137579293, -0.06985200217896646, -0.07027474699097538, 0.009908537737325515, -0.0663448692495027, 0.04391887546682418, 0.20747699701525082, 0.08208781177872972, 0.19669553575101237, -0.36140126024860697, -0.2241991407315951, 0.10247957189791945, 0.15559729223073399, 0.05800008173644316, -0.06222133284830902, -0.31146482427410666, 0.06456504431157255, -0.19816316812426835, -0.1459676838588669, 0.04026933078450827, 0.04327679974580099, 0.04962578958827, -0.21897993271202462, 0.12770452247125919, -0.030196678025770914, 0.024031297355738994, -0.06181058146267524, -0.10890925915316126, -0.009938682961339122, 0.08987038072891802, 0.06982312561012805, 0.03507063883019323, 0.13523599599265887, -0.13138784236761594, -0.08603006308463397, 0.4198289841205487, -0.09878414932420941, -0.12363994135497715, 0.16988863137451374, -0.21227350710479892, -0.16738686867018093, 0.15339594150935937, 0.18433687376416275, 0.08972318678385777, -0.18913014588068267, 0.043321547483898895, -0.014067840344050361, 0.20580292600892522, 0.05772930057010221, 0.08994183879402386, 0.27277717368232873, 0.11970033577133944, 0.02248409753523502, 0.10035683762023301, -0.24198148746591835, 0.014014200477028824, -0.2524846074960861, -0.07543326747074232, -0.196777277727739, 0.08143703154935904, -0.12134397536637924, -0.1006582847064796, 0.35920401215836933, 0.12086702904990179, 0.17455470715389412, 0.07679982060568909, 0.3374105405043527, 0.16516494478080138, 0.09152963267447814, 0.10857797611438608, 0.33775088864941205, 0.14208044610482637, 0.06551768159408708, -0.2205538077003365, 0.0686093340509661, -0.046992442405163336]
|
1,803.07299
|
Quantum ergodicity for large equilateral quantum graphs
|
Consider a sequence of finite regular graphs (GN) converging, in the sense of
Benjamini-Schramm, to the infinite regular tree. We study the induced quantum
graphs with equilateral edge lengths, Kirchhoff conditions (possibly with a
non-zero coupling constant $\alpha$) and a symmetric potential U on the edges.
We show that in the spectral regions where the infinite quantum tree has
absolutely continuous spectrum, the eigenfunctions of the converging quantum
graphs satisfy a quantum ergodicity theorem. In case $\alpha$ = 0 and U = 0,
the limit measure is the uniform measure on the edges. In general, it has an
explicit analytic density. We finally prove a stronger quantum ergodicity
theorem involving integral operators, the purpose of which is to study
eigenfunction correlations.
|
math.SP math-ph math.MP
|
consider a sequence of finite regular graphs gn converging in the sense of benjaminischramm to the infinite regular tree we study the induced quantum graphs with equilateral edge lengths kirchhoff conditions possibly with a nonzero coupling constant alpha and a symmetric potential u on the edges we show that in the spectral regions where the infinite quantum tree has absolutely continuous spectrum the eigenfunctions of the converging quantum graphs satisfy a quantum ergodicity theorem in case alpha 0 and u 0 the limit measure is the uniform measure on the edges in general it has an explicit analytic density we finally prove a stronger quantum ergodicity theorem involving integral operators the purpose of which is to study eigenfunction correlations
|
[['consider', 'a', 'sequence', 'of', 'finite', 'regular', 'graphs', 'gn', 'converging', 'in', 'the', 'sense', 'of', 'benjaminischramm', 'to', 'the', 'infinite', 'regular', 'tree', 'we', 'study', 'the', 'induced', 'quantum', 'graphs', 'with', 'equilateral', 'edge', 'lengths', 'kirchhoff', 'conditions', 'possibly', 'with', 'a', 'nonzero', 'coupling', 'constant', 'alpha', 'and', 'a', 'symmetric', 'potential', 'u', 'on', 'the', 'edges', 'we', 'show', 'that', 'in', 'the', 'spectral', 'regions', 'where', 'the', 'infinite', 'quantum', 'tree', 'has', 'absolutely', 'continuous', 'spectrum', 'the', 'eigenfunctions', 'of', 'the', 'converging', 'quantum', 'graphs', 'satisfy', 'a', 'quantum', 'ergodicity', 'theorem', 'in', 'case', 'alpha', '0', 'and', 'u', '0', 'the', 'limit', 'measure', 'is', 'the', 'uniform', 'measure', 'on', 'the', 'edges', 'in', 'general', 'it', 'has', 'an', 'explicit', 'analytic', 'density', 'we', 'finally', 'prove', 'a', 'stronger', 'quantum', 'ergodicity', 'theorem', 'involving', 'integral', 'operators', 'the', 'purpose', 'of', 'which', 'is', 'to', 'study', 'eigenfunction', 'correlations']]
|
[-0.19725595726122877, 0.1715306642538909, -0.08654802719702427, 0.0819054193102105, -0.04342297450913226, -0.13658366154707155, 0.028753512177984192, 0.3603334918680812, -0.28060290069483657, -0.17076026742393544, 0.0984134302169335, -0.31048731150559516, -0.12054907125342607, 0.1053429617616935, -0.031634322101516385, 0.06698073033231679, 0.08211522082164258, 0.11851902068553477, -0.04034247635785459, -0.17597706723339981, 0.330189026657398, -0.04482633998997103, 0.22452549453229964, 0.09138988240175888, 0.07574772664165798, 0.003521998992048893, 0.016479775243039643, 0.010087722114154271, -0.22575139497953883, 0.07896286116114684, 0.22508735614711373, 0.029199922737125465, 0.27004058774905043, -0.3782990204107736, -0.17487623789856413, 0.213185970217553, 0.0999655917192958, 0.05445702283490574, -0.015244710583928503, -0.283531653403281, 0.1259759353383781, -0.11307341764591039, -0.1994331905289608, -0.022803495207629285, 0.06425660887748755, 0.035130239080074205, -0.2983729220112833, 0.06552725764257568, 0.1582895047872664, 0.03507333172939154, -0.012689856217563654, -0.06721967162599615, -0.020201596936226644, 0.11339154531553138, -0.02290418093041869, 0.02685649672272701, 0.04607738178426854, -0.09475727155491584, -0.12916950801555693, 0.3347822178914329, -0.11595326653307993, -0.22156524678551348, 0.12247579158557688, -0.18171358309067911, -0.1709606456492065, 0.0739610635777231, 0.10161256080321154, 0.1455741029217088, -0.0678109668465253, 0.24067964172284237, -0.07383266789153875, 0.11673938556077319, 0.11494696197420859, 0.05034279721806671, 0.13081478746999212, 0.05203742139088381, 0.19071586009021066, 0.1926798923019351, -0.022464027119596965, -0.12252288660378892, -0.3149156843100776, -0.14044681402752882, -0.22371093970488662, 0.13637190459280454, -0.18056154011591227, -0.2773766735130373, 0.3877662753357607, 0.07838389643726229, 0.1971359363257662, 0.11335398168733515, 0.23515033611573843, 0.19066173416570203, 0.006393142416290626, 0.09431565863994036, 0.13064530737572858, 0.2032746282335715, 0.01932917471912478, -0.18540318093865232, 0.01838530271173212, 0.14467093772489673]
|
1,803.073
|
Risk and parameter convergence of logistic regression
|
Gradient descent, when applied to the task of logistic regression, outputs
iterates which are biased to follow a unique ray defined by the data. The
direction of this ray is the maximum margin predictor of a maximal linearly
separable subset of the data; the gradient descent iterates converge to this
ray in direction at the rate $\mathcal{O}(\ln\ln t / \ln t)$. The ray does not
pass through the origin in general, and its offset is the bounded global
optimum of the risk over the remaining data; gradient descent recovers this
offset at a rate $\mathcal{O}((\ln t)^2 / \sqrt{t})$.
|
cs.LG math.OC stat.ML
|
gradient descent when applied to the task of logistic regression outputs iterates which are biased to follow a unique ray defined by the data the direction of this ray is the maximum margin predictor of a maximal linearly separable subset of the data the gradient descent iterates converge to this ray in direction at the rate mathcalolnln t ln t the ray does not pass through the origin in general and its offset is the bounded global optimum of the risk over the remaining data gradient descent recovers this offset at a rate mathcaloln t2 sqrtt
|
[['gradient', 'descent', 'when', 'applied', 'to', 'the', 'task', 'of', 'logistic', 'regression', 'outputs', 'iterates', 'which', 'are', 'biased', 'to', 'follow', 'a', 'unique', 'ray', 'defined', 'by', 'the', 'data', 'the', 'direction', 'of', 'this', 'ray', 'is', 'the', 'maximum', 'margin', 'predictor', 'of', 'a', 'maximal', 'linearly', 'separable', 'subset', 'of', 'the', 'data', 'the', 'gradient', 'descent', 'iterates', 'converge', 'to', 'this', 'ray', 'in', 'direction', 'at', 'the', 'rate', 'mathcalolnln', 't', 'ln', 't', 'the', 'ray', 'does', 'not', 'pass', 'through', 'the', 'origin', 'in', 'general', 'and', 'its', 'offset', 'is', 'the', 'bounded', 'global', 'optimum', 'of', 'the', 'risk', 'over', 'the', 'remaining', 'data', 'gradient', 'descent', 'recovers', 'this', 'offset', 'at', 'a', 'rate', 'mathcaloln', 't2', 'sqrtt']]
|
[-0.10325180126452133, 0.07552744400148328, -0.08940402174270466, 0.05907762147559735, -0.0791664999713631, -0.1364209274712362, 0.0783645836636424, 0.3962556857811777, -0.40694902080454326, -0.20576774559817032, 0.08808462150872833, -0.30058042220771314, -0.045485870709250635, 0.20226735938340426, -0.11347369911443246, 0.0417459617019631, 0.0427748422089376, 0.07647427308226103, -0.09499975090331741, -0.3190053922271258, 0.223118508430688, 0.1153416699386741, 0.27537647445784197, -0.04731394501501008, 0.1730274300764952, -0.011696794795754709, -0.0010029607991638937, -0.0009262907857957639, -0.07187434329014075, 0.09107714085594604, 0.2543017149002193, 0.1611071993057665, 0.32362042281188463, -0.334454812893742, -0.18657951142246787, 0.17858563060627172, 0.14330350939846156, 0.039954424903139864, -0.023808936960995196, -0.2057081215573769, 0.10708032024436091, -0.06933851422447908, -0.11713877560472802, 0.0013646873694501424, -0.03268015768477007, 0.0939406432211399, -0.2930879977041561, 0.10614915846994048, 0.08342488184081097, 0.05147588877987705, -0.018249282269052376, -0.10051521847000051, -0.02745768808220562, 0.07615044131096893, 0.126945396282367, 0.1597368690136232, 0.1704289309337343, -0.09551269013287597, -0.0548934874075808, 0.31011902765419924, -0.11920212305543063, -0.1675025172335537, 0.1261036173587567, -0.15167113145029074, -0.10049931721173619, 0.16387053538407934, 0.18462421762707987, 0.1492518705217854, -0.1367646976798393, 0.11992779460821398, -0.03794260861254052, 0.11795609434821495, 0.04563503698445857, -0.07238075811795792, 0.10972793428840018, 0.09280747145071233, 0.20818428184935137, 0.07967764864626684, -0.14001683231112302, -0.07702983441076389, -0.33477854697327863, -0.11484820025139733, -0.20410118367719024, 0.04998090128968837, -0.15252375785050007, -0.1605109166157873, 0.3919749843446832, 0.09383572611688196, 0.26119079293781206, 0.14066791330145573, 0.28580092115352224, 0.11300830986154707, 0.05968136906525806, 0.16068898056033312, 0.2275432882242297, 0.11146035341938075, 0.09683023328329192, -0.28995220587637865, 0.13381626018273987, 0.10057915604572229]
|
1,803.07301
|
Segmentation of histological images and fibrosis identification with a
convolutional neural network
|
Segmentation of histological images is one of the most crucial tasks for many
biomedical analyses including quantification of certain tissue type. However,
challenges are posed by high variability and complexity of structural features
in such images, in addition to imaging artifacts. Further, the conventional
approach of manual thresholding is labor-intensive, and highly sensitive to
inter- and intra-image intensity variations. An accurate and robust automated
segmentation method is of high interest. We propose and evaluate an elegant
convolutional neural network (CNN) designed for segmentation of histological
images, particularly those with Masson's trichrome stain. The network comprises
of 11 successive convolutional - rectified linear unit - batch normalization
layers, and outperformed state-of-the-art CNNs on a dataset of cardiac
histological images (labeling fibrosis, myocytes, and background) with a Dice
similarity coefficient of 0.947. With 100 times fewer (only 300 thousand)
trainable parameters, our CNN is less susceptible to overfitting, and is
efficient. Additionally, it retains image resolution from input to output,
captures fine-grained details, and can be trained end-to-end smoothly. To the
best of our knowledge, this is the first deep CNN tailored for the problem of
concern, and may be extended to solve similar segmentation tasks to facilitate
investigations into pathology and clinical treatment.
|
cs.CV
|
segmentation of histological images is one of the most crucial tasks for many biomedical analyses including quantification of certain tissue type however challenges are posed by high variability and complexity of structural features in such images in addition to imaging artifacts further the conventional approach of manual thresholding is laborintensive and highly sensitive to inter and intraimage intensity variations an accurate and robust automated segmentation method is of high interest we propose and evaluate an elegant convolutional neural network cnn designed for segmentation of histological images particularly those with massons trichrome stain the network comprises of 11 successive convolutional rectified linear unit batch normalization layers and outperformed stateoftheart cnns on a dataset of cardiac histological images labeling fibrosis myocytes and background with a dice similarity coefficient of 0947 with 100 times fewer only 300 thousand trainable parameters our cnn is less susceptible to overfitting and is efficient additionally it retains image resolution from input to output captures finegrained details and can be trained endtoend smoothly to the best of our knowledge this is the first deep cnn tailored for the problem of concern and may be extended to solve similar segmentation tasks to facilitate investigations into pathology and clinical treatment
|
[['segmentation', 'of', 'histological', 'images', 'is', 'one', 'of', 'the', 'most', 'crucial', 'tasks', 'for', 'many', 'biomedical', 'analyses', 'including', 'quantification', 'of', 'certain', 'tissue', 'type', 'however', 'challenges', 'are', 'posed', 'by', 'high', 'variability', 'and', 'complexity', 'of', 'structural', 'features', 'in', 'such', 'images', 'in', 'addition', 'to', 'imaging', 'artifacts', 'further', 'the', 'conventional', 'approach', 'of', 'manual', 'thresholding', 'is', 'laborintensive', 'and', 'highly', 'sensitive', 'to', 'inter', 'and', 'intraimage', 'intensity', 'variations', 'an', 'accurate', 'and', 'robust', 'automated', 'segmentation', 'method', 'is', 'of', 'high', 'interest', 'we', 'propose', 'and', 'evaluate', 'an', 'elegant', 'convolutional', 'neural', 'network', 'cnn', 'designed', 'for', 'segmentation', 'of', 'histological', 'images', 'particularly', 'those', 'with', 'massons', 'trichrome', 'stain', 'the', 'network', 'comprises', 'of', '11', 'successive', 'convolutional', 'rectified', 'linear', 'unit', 'batch', 'normalization', 'layers', 'and', 'outperformed', 'stateoftheart', 'cnns', 'on', 'a', 'dataset', 'of', 'cardiac', 'histological', 'images', 'labeling', 'fibrosis', 'myocytes', 'and', 'background', 'with', 'a', 'dice', 'similarity', 'coefficient', 'of', '0947', 'with', '100', 'times', 'fewer', 'only', '300', 'thousand', 'trainable', 'parameters', 'our', 'cnn', 'is', 'less', 'susceptible', 'to', 'overfitting', 'and', 'is', 'efficient', 'additionally', 'it', 'retains', 'image', 'resolution', 'from', 'input', 'to', 'output', 'captures', 'finegrained', 'details', 'and', 'can', 'be', 'trained', 'endtoend', 'smoothly', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'deep', 'cnn', 'tailored', 'for', 'the', 'problem', 'of', 'concern', 'and', 'may', 'be', 'extended', 'to', 'solve', 'similar', 'segmentation', 'tasks', 'to', 'facilitate', 'investigations', 'into', 'pathology', 'and', 'clinical', 'treatment']]
|
[-0.01563457432414659, -0.008538127287686097, -0.01462958108709015, 0.05735526462920443, -0.10729491787567509, -0.19538867213108313, -0.018814132108489486, 0.4764527520447066, -0.24665826460584114, -0.34588830006506405, 0.09306625736468105, -0.2878344480931345, -0.19121969619888174, 0.20208457559864554, -0.17883943700269242, 0.10829614618184007, 0.15370875917671417, 0.01807168764156299, -0.04722243076604274, -0.27571229963513993, 0.24269325683725942, 0.04836101504380819, 0.3489013147843776, 0.022427900594946072, 0.14194682336910958, -0.03483150445478686, -0.06727725326441078, -0.01731703734857905, -0.026415814171695723, 0.17938318613385196, 0.3300009417204149, 0.1715595855558705, 0.31421038265471735, -0.44069410111717505, -0.23953363023265595, 0.06663694202128534, 0.16601428387891953, 0.08268645664058494, 0.014035190885411481, -0.32572734473870524, 0.10281051281778461, -0.09835596897432373, 0.033747984807834856, -0.1415224705124274, -0.004887088848691847, -0.041985922096340104, -0.304071393533377, 0.1190112175013061, 0.04792321123173366, 0.09095132870204521, -0.07223564048410591, -0.1117523558146198, 0.010162350203079934, 0.1834154791625527, 0.009545534207118732, 0.09683801603196024, 0.17136128601909736, -0.2288434504283427, -0.08124931186503458, 0.3460722165323342, -0.002521381990965268, -0.19425558827398814, 0.19235621447759596, -0.03382221449194758, -0.1434268308039096, 0.17800734875573201, 0.19964908944875603, 0.10791738743592769, -0.17146808344922546, -0.05459911488037735, 0.009845365718421008, 0.2294814437674829, 0.08031104285166496, -0.013560883273991445, 0.14252483683010336, 0.29466180678344134, -0.0032022739393105073, 0.14942236013964497, -0.19582097926820896, 0.011803673089639463, -0.18161871645486716, -0.10781701498850416, -0.15741609612531546, -0.016558235932454334, -0.1290629565792371, -0.17763708411531307, 0.4234652063630597, 0.21436315039325637, 0.20955633711730684, 0.06725363220638511, 0.3463838827917399, -0.007594941682511508, 0.16611299261414314, 0.014197623079661468, 0.17219614841730682, 0.041113521665043076, 0.1018932184864146, -0.16359519184686977, 0.0914545120233952, 0.04718000829370335]
|
1,803.07302
|
X-ray study of Variable Gamma-ray Pulsar PSR J2021+4026
|
PSR~J2021+4026 showed a sudden decrease in the gamma-ray emission at the
glitch that occurred around 2011, October 16, and a relaxation of the flux to
the pre-glitch state at around 2014 December. We report X-ray analysis results
of the data observed by XMM-Newton on 2015 December 20 in the post-relaxation
state. To examine any change in the X-ray emission, we compare the properties
of the pulse profiles and spectra at the low gamma-ray flux state and at the
post-relaxation state. The phase-averaged spectra for both states can be well
described by a power-law component plus a blackbody component. The former is
dominated by unpulsed emission and is probably originated from the pulsar wind
nebula as reported by Hui et al (2015). The emission property of the blackbody
component is consistent with the emission from the polar cap heated by the
back-flow bombardment of the high-energy electrons or positrons that were
accelerated in the magnetosphere. We found no significant change in the X-ray
emission properties between two states. We suggest that the change of the X-ray
luminosity is at an order of ~4%, which is difficult to measure with the
current observations. We model the observed X-ray light curve with the heated
polar cap emission and we speculate that the observed large pulsed fraction is
owing to asymmetric magnetospheric structure.
|
astro-ph.HE
|
psrj20214026 showed a sudden decrease in the gammaray emission at the glitch that occurred around 2011 october 16 and a relaxation of the flux to the preglitch state at around 2014 december we report xray analysis results of the data observed by xmmnewton on 2015 december 20 in the postrelaxation state to examine any change in the xray emission we compare the properties of the pulse profiles and spectra at the low gammaray flux state and at the postrelaxation state the phaseaveraged spectra for both states can be well described by a powerlaw component plus a blackbody component the former is dominated by unpulsed emission and is probably originated from the pulsar wind nebula as reported by hui et al 2015 the emission property of the blackbody component is consistent with the emission from the polar cap heated by the backflow bombardment of the highenergy electrons or positrons that were accelerated in the magnetosphere we found no significant change in the xray emission properties between two states we suggest that the change of the xray luminosity is at an order of 4 which is difficult to measure with the current observations we model the observed xray light curve with the heated polar cap emission and we speculate that the observed large pulsed fraction is owing to asymmetric magnetospheric structure
|
[['psrj20214026', 'showed', 'a', 'sudden', 'decrease', 'in', 'the', 'gammaray', 'emission', 'at', 'the', 'glitch', 'that', 'occurred', 'around', '2011', 'october', '16', 'and', 'a', 'relaxation', 'of', 'the', 'flux', 'to', 'the', 'preglitch', 'state', 'at', 'around', '2014', 'december', 'we', 'report', 'xray', 'analysis', 'results', 'of', 'the', 'data', 'observed', 'by', 'xmmnewton', 'on', '2015', 'december', '20', 'in', 'the', 'postrelaxation', 'state', 'to', 'examine', 'any', 'change', 'in', 'the', 'xray', 'emission', 'we', 'compare', 'the', 'properties', 'of', 'the', 'pulse', 'profiles', 'and', 'spectra', 'at', 'the', 'low', 'gammaray', 'flux', 'state', 'and', 'at', 'the', 'postrelaxation', 'state', 'the', 'phaseaveraged', 'spectra', 'for', 'both', 'states', 'can', 'be', 'well', 'described', 'by', 'a', 'powerlaw', 'component', 'plus', 'a', 'blackbody', 'component', 'the', 'former', 'is', 'dominated', 'by', 'unpulsed', 'emission', 'and', 'is', 'probably', 'originated', 'from', 'the', 'pulsar', 'wind', 'nebula', 'as', 'reported', 'by', 'hui', 'et', 'al', '2015', 'the', 'emission', 'property', 'of', 'the', 'blackbody', 'component', 'is', 'consistent', 'with', 'the', 'emission', 'from', 'the', 'polar', 'cap', 'heated', 'by', 'the', 'backflow', 'bombardment', 'of', 'the', 'highenergy', 'electrons', 'or', 'positrons', 'that', 'were', 'accelerated', 'in', 'the', 'magnetosphere', 'we', 'found', 'no', 'significant', 'change', 'in', 'the', 'xray', 'emission', 'properties', 'between', 'two', 'states', 'we', 'suggest', 'that', 'the', 'change', 'of', 'the', 'xray', 'luminosity', 'is', 'at', 'an', 'order', 'of', '4', 'which', 'is', 'difficult', 'to', 'measure', 'with', 'the', 'current', 'observations', 'we', 'model', 'the', 'observed', 'xray', 'light', 'curve', 'with', 'the', 'heated', 'polar', 'cap', 'emission', 'and', 'we', 'speculate', 'that', 'the', 'observed', 'large', 'pulsed', 'fraction', 'is', 'owing', 'to', 'asymmetric', 'magnetospheric', 'structure']]
|
[-0.049404141936476714, 0.16674741526240894, -0.07639519770132149, 0.0844858741700292, -0.04698536764473131, -0.05024567395065949, 0.028703391373893203, 0.42097613919679433, -0.21871023367639614, -0.36247679018776985, 0.0688035207259422, -0.3487577847466638, -0.028705597868971696, 0.2010328623425794, -0.022361458806516646, -0.04045049573579743, 0.05027611798619571, -0.060855242554481104, -0.038737747899031255, -0.18064199943465156, 0.2613176170983203, 0.13047924697650043, 0.2189773734266653, 0.05451304285008818, 0.07019432557833946, -0.052466353265458045, -0.006475288037117145, -0.03846837702254046, -0.07329576016899696, 0.03991429270808606, 0.17486623638909157, 0.08729117108959722, 0.1418747389827298, -0.40688214457878785, -0.24038376172655793, 0.05628425211615894, 0.09612608032054416, -0.002388441634973613, -0.027597733259256334, -0.2641042088919647, 0.011038401838951238, -0.20225825367844133, -0.1607886731250373, 0.06420053970217535, 0.058938347818234246, 0.008303047225865872, -0.21486980957430937, 0.1257541633666106, 0.05566621170226127, 0.05285814600410211, -0.13235793160232098, -0.06316288974195651, -0.04306005235000186, 0.02351763458671601, 0.06942853822477042, 0.08392865242028277, 0.15292064127082763, -0.09804420359007436, -0.12522128202073216, 0.33314326068505506, -0.09764170753036, 0.04317383977614309, 0.18264998272316504, -0.2398438693819457, -0.15435008141190903, 0.24730356002851606, 0.1273428990418457, 0.0741062897106539, -0.11330992988758341, 0.01428234907171873, -0.027528562432061456, 0.22526917579375447, 0.052806297982681424, 0.004536914645022283, 0.2824461721819421, 0.08806950372476853, -0.025324452022031017, 0.18264102112538008, -0.2525252304252526, -0.021059202846005712, -0.2639010749187439, -0.07517582037679896, -0.17510822124685668, 0.08520780430870667, -0.02534531120407702, -0.11259799197499032, 0.40621116669257445, 0.07700329115741873, 0.2090829302467508, -0.03247326373581915, 0.2697568372887087, 0.14019883008882164, 0.02464755749187462, 0.18390435610629924, 0.3572676242733179, 0.13320579811224723, 0.14476319451520822, -0.25774194328241967, 0.1025288898506325, -0.025669710606455665]
|
1,803.07303
|
Containment of Shape Expression Schemas for RDF
|
We study the problem of containment for shape expression schemas (ShEx) for
RDF graphs. We identify a subclass of ShEx that has a natural graphical
representation in the form of shape graphs and their semantics is captured with
a tractable notion of embedding of an RDF graph in a shape graph. When applied
to pairs of shape graphs, an embedding is a sufficient condition for
containment, and for a practical subclass of deterministic shape graphs, it is
also a necessary one, thus yielding a subclass with tractable containment.
While for general shape graphs a minimal counter-example i.e., an instance
proving non-containment, might be of exponential size, we show that containment
is EXP-hard and in coNEXP. Finally, we show that containment for arbitrary ShEx
is coNEXP-hard and in coTwoNEXP^NP.
|
cs.LO
|
we study the problem of containment for shape expression schemas shex for rdf graphs we identify a subclass of shex that has a natural graphical representation in the form of shape graphs and their semantics is captured with a tractable notion of embedding of an rdf graph in a shape graph when applied to pairs of shape graphs an embedding is a sufficient condition for containment and for a practical subclass of deterministic shape graphs it is also a necessary one thus yielding a subclass with tractable containment while for general shape graphs a minimal counterexample ie an instance proving noncontainment might be of exponential size we show that containment is exphard and in conexp finally we show that containment for arbitrary shex is conexphard and in cotwonexpnp
|
[['we', 'study', 'the', 'problem', 'of', 'containment', 'for', 'shape', 'expression', 'schemas', 'shex', 'for', 'rdf', 'graphs', 'we', 'identify', 'a', 'subclass', 'of', 'shex', 'that', 'has', 'a', 'natural', 'graphical', 'representation', 'in', 'the', 'form', 'of', 'shape', 'graphs', 'and', 'their', 'semantics', 'is', 'captured', 'with', 'a', 'tractable', 'notion', 'of', 'embedding', 'of', 'an', 'rdf', 'graph', 'in', 'a', 'shape', 'graph', 'when', 'applied', 'to', 'pairs', 'of', 'shape', 'graphs', 'an', 'embedding', 'is', 'a', 'sufficient', 'condition', 'for', 'containment', 'and', 'for', 'a', 'practical', 'subclass', 'of', 'deterministic', 'shape', 'graphs', 'it', 'is', 'also', 'a', 'necessary', 'one', 'thus', 'yielding', 'a', 'subclass', 'with', 'tractable', 'containment', 'while', 'for', 'general', 'shape', 'graphs', 'a', 'minimal', 'counterexample', 'ie', 'an', 'instance', 'proving', 'noncontainment', 'might', 'be', 'of', 'exponential', 'size', 'we', 'show', 'that', 'containment', 'is', 'exphard', 'and', 'in', 'conexp', 'finally', 'we', 'show', 'that', 'containment', 'for', 'arbitrary', 'shex', 'is', 'conexphard', 'and', 'in', 'cotwonexpnp']]
|
[-0.11776952345110477, 0.020396620919345878, -0.06026553913205862, 0.1324794875206426, -0.13026375129073858, -0.1393050036095083, 0.009335808286443353, 0.43071836431697014, -0.2812671445608139, -0.28781659552454947, 0.09980888285860419, -0.22997736227884888, -0.156081149764359, 0.18451448488235472, -0.1324545321026817, 0.04968883336335421, 0.08870188367087393, 0.09870530429854989, -0.02462820397131145, -0.18843569653714076, 0.32685380754433574, -0.0048292517438530925, 0.21973732938989998, 0.09765271409973503, 0.07776593304425478, 0.03283458948880434, 0.02985783523507416, 0.11878645328991115, -0.14637570598063757, 0.1386855653040111, 0.2790058220475912, 0.25399270751327274, 0.22437612029910087, -0.3625813777297735, -0.170233407728374, 0.19182957832887768, 0.12184497234225274, 0.1144265554714948, -0.04187954922020436, -0.24949165547825397, 0.14056402884051203, -0.1479365233462304, -0.08678230782132595, -0.06769943485036492, 0.11957724012434483, -0.009434145266655833, -0.3307338183224201, -0.023839936303207653, 0.18438499147072435, 0.060788659539073704, -0.03227443411294371, -0.03920880150515586, 0.017096919901669026, 0.10707818859745748, -0.0801236555420328, -0.001025812780484557, 0.015656712368130685, -0.16673142185807227, -0.1386414365246892, 0.3893608137220144, 0.016843721935059876, -0.22855064409971237, 0.10377767611294984, -0.06436995719000697, -0.21387062568217516, 0.08722588305175305, 0.14666428890265523, 0.13128620378300548, -0.15701150977949146, 0.12147818919830024, -0.1118568488880992, 0.16729955020546913, 0.11834753508865833, 0.010722847344819457, 0.15132186963409186, 0.20359299228154124, 0.13680291429907082, 0.23551782528217882, 0.012210388049483299, -0.061515140326693654, -0.2738471042662859, -0.1510325097218156, -0.13575150221586227, 0.0007670108433812856, -0.17797563000721858, -0.25243689033389094, 0.41769576784037055, 0.08891192111000419, 0.18892572485283018, 0.17239055556058883, 0.22195374530553819, 0.08234954272350296, 0.04301261197216809, 0.11137253114784836, 0.10668772858008742, 0.12590953571349384, 0.0012596072833985091, -0.14012687075510621, 0.137078606730327, 0.07363974391296506]
|
1,803.07304
|
Evidence of nematic order and nodal superconducting gap along [110]
direction in RbFe2As2
|
Unconventional superconductivity often intertwines with various forms of
order, such as the "nematic" order which breaks the rotational symmetry of the
lattice. Investigation of these ordered phases sheds crucial light on the
superconductivity itself. Here we report a low-temperature scanning tunneling
microscopy (STM) study on RbFe2As2, a heavily hole-doped Fe-based
superconductor (FeSC). We observe significant symmetry breaking in its
electronic structure and magnetic vortex which differentiates the ({\pi},
{\pi}) and ({\pi}, -{\pi}) directions of the unfolded Brillouin zone (BZ). It
is thus a novel nematic state, distinct from the nematicity of
undoped/lightly-doped FeSCs which breaks the ({\pi}, 0) / (0, {\pi})
equivalence. Moreover, we observe a clear "V"-shaped superconducting gap which
can be well fitted with a nodal gap function. The gap is found to be suppressed
on surface Rb vacancies and at step edges, and the suppression is particularly
strong at the [110]-oriented edges. This is possibly due to a dx2-y2 like
pairing component with nodes along the [110] directions. We further
demonstrated that such ({\pi}, {\pi}) nematic state can be suppressed via
surface electron doping to RbFe2As2, and the superconductivity is subsequently
enhanced. Our results thus highlight the intimate connection between nematicity
and superconducting pairing in iron-based superconductors.
|
cond-mat.supr-con cond-mat.str-el
|
unconventional superconductivity often intertwines with various forms of order such as the nematic order which breaks the rotational symmetry of the lattice investigation of these ordered phases sheds crucial light on the superconductivity itself here we report a lowtemperature scanning tunneling microscopy stm study on rbfe2as2 a heavily holedoped febased superconductor fesc we observe significant symmetry breaking in its electronic structure and magnetic vortex which differentiates the pi pi and pi pi directions of the unfolded brillouin zone bz it is thus a novel nematic state distinct from the nematicity of undopedlightlydoped fescs which breaks the pi 0 0 pi equivalence moreover we observe a clear vshaped superconducting gap which can be well fitted with a nodal gap function the gap is found to be suppressed on surface rb vacancies and at step edges and the suppression is particularly strong at the 110oriented edges this is possibly due to a dx2y2 like pairing component with nodes along the 110 directions we further demonstrated that such pi pi nematic state can be suppressed via surface electron doping to rbfe2as2 and the superconductivity is subsequently enhanced our results thus highlight the intimate connection between nematicity and superconducting pairing in ironbased superconductors
|
[['unconventional', 'superconductivity', 'often', 'intertwines', 'with', 'various', 'forms', 'of', 'order', 'such', 'as', 'the', 'nematic', 'order', 'which', 'breaks', 'the', 'rotational', 'symmetry', 'of', 'the', 'lattice', 'investigation', 'of', 'these', 'ordered', 'phases', 'sheds', 'crucial', 'light', 'on', 'the', 'superconductivity', 'itself', 'here', 'we', 'report', 'a', 'lowtemperature', 'scanning', 'tunneling', 'microscopy', 'stm', 'study', 'on', 'rbfe2as2', 'a', 'heavily', 'holedoped', 'febased', 'superconductor', 'fesc', 'we', 'observe', 'significant', 'symmetry', 'breaking', 'in', 'its', 'electronic', 'structure', 'and', 'magnetic', 'vortex', 'which', 'differentiates', 'the', 'pi', 'pi', 'and', 'pi', 'pi', 'directions', 'of', 'the', 'unfolded', 'brillouin', 'zone', 'bz', 'it', 'is', 'thus', 'a', 'novel', 'nematic', 'state', 'distinct', 'from', 'the', 'nematicity', 'of', 'undopedlightlydoped', 'fescs', 'which', 'breaks', 'the', 'pi', '0', '0', 'pi', 'equivalence', 'moreover', 'we', 'observe', 'a', 'clear', 'vshaped', 'superconducting', 'gap', 'which', 'can', 'be', 'well', 'fitted', 'with', 'a', 'nodal', 'gap', 'function', 'the', 'gap', 'is', 'found', 'to', 'be', 'suppressed', 'on', 'surface', 'rb', 'vacancies', 'and', 'at', 'step', 'edges', 'and', 'the', 'suppression', 'is', 'particularly', 'strong', 'at', 'the', '110oriented', 'edges', 'this', 'is', 'possibly', 'due', 'to', 'a', 'dx2y2', 'like', 'pairing', 'component', 'with', 'nodes', 'along', 'the', '110', 'directions', 'we', 'further', 'demonstrated', 'that', 'such', 'pi', 'pi', 'nematic', 'state', 'can', 'be', 'suppressed', 'via', 'surface', 'electron', 'doping', 'to', 'rbfe2as2', 'and', 'the', 'superconductivity', 'is', 'subsequently', 'enhanced', 'our', 'results', 'thus', 'highlight', 'the', 'intimate', 'connection', 'between', 'nematicity', 'and', 'superconducting', 'pairing', 'in', 'ironbased', 'superconductors']]
|
[-0.22628991441998744, 0.2356032824897527, -0.07833285214417059, 0.04650134582194791, -0.09988317722360594, -0.17446915664465515, 0.14198416601978195, 0.38041576180393066, -0.2993471551946108, -0.24053247757208995, -0.0332737925163743, -0.34804848134940997, -0.1493684039368868, 0.11556176393001218, 0.055236237316458214, 0.0024307718347038394, -0.06512864161226334, -0.042108505167010604, -0.14346806936182382, -0.1994792637274121, 0.31999586077849146, -0.010345672291346045, 0.34872625616139197, 0.10691079558014419, -0.008220189145173539, 0.003331298702349416, 0.13228135765294988, -0.009182554215776047, -0.16175015054007721, 0.04804505876764053, 0.30573087355658185, -0.11358587703940393, 0.1525272494311341, -0.4411612298772341, -0.19771483803468973, 0.01747521732679822, 0.17659012719193906, 0.11802266267271751, -0.05097119844074107, -0.31722316585217764, 0.08139498172929943, -0.10392488504059123, -0.11907720361422333, -0.11613149029635494, -0.025241553171942332, -0.06455834054580956, -0.2058285953182459, 0.0844764329747043, 0.07910228309731912, 0.11088951239291804, -0.04808159155190236, -0.12338277725785067, -0.0863959986458984, 0.0036889085924779676, 0.10973612745198412, 0.12420926565619543, 0.12278542855185354, -0.09044937981819415, -0.09460207316648177, 0.3382043228284785, 0.009616116159407403, -0.06357899101714444, 0.15531557485240163, -0.15394722605296093, -0.0847944684510091, 0.1704217288572567, 0.06990066988892252, 0.05659987647533229, -0.06699317729722643, 0.07504488438699451, -0.04357459556312545, 0.1942798418058741, 0.04492864013658931, 0.08534728259911215, 0.26091612315021756, 0.19878284470883734, 0.07412658441538988, 0.09989737647743142, -0.1420938114705025, -0.033858503904099564, -0.2586020800623704, -0.21095678132295495, -0.18700196011893855, 0.04901958253784952, -0.03168035471783081, -0.15099045166256603, 0.3985808898219745, 0.10531995546912323, 0.2503827779065533, -0.10973640287240892, 0.21789925118597844, 0.09791934747258295, 0.07347115513785141, 0.042185006841353956, 0.21066482681216617, 0.15833812373610345, 0.07861848096033991, -0.32962956193321846, 0.09616847275144826, -0.006539220190865712]
|
1,803.07305
|
Cluster-based Wireless Energy Transfer for Low Complex Energy Receivers
|
This paper proposes a novel channel estimation method and a cluster-based
opportunistic scheduling policy, for a wireless energy transfer (WET) system
consisting of multiple low-complex energy receivers (ERs) with limited
processing capabilities. Firstly, in the training stage, the energy transmitter
(ET) obtains a set of Received Signal Strength Indicator (RSSI) feedback values
from all ERs, and these values are used to estimate the channels between the ET
and all ERs. Next, based on the channel estimates, the ERs are grouped into
clusters, and the cluster that has its members closest to its centroid in phase
is selected for dedicated WET. The beamformer that maximizes the minimum
harvested energy among all ERs in the selected cluster is found by solving a
convex optimization problem. All ERs have the same chance of being selected
regardless of their distances from the ET, and hence, this scheduling policy
can be considered to be opportunistic as well as fair. It is shown that the
proposed method achieves significant performance gains over benchmark schemes.
|
cs.IT math.IT
|
this paper proposes a novel channel estimation method and a clusterbased opportunistic scheduling policy for a wireless energy transfer wet system consisting of multiple lowcomplex energy receivers ers with limited processing capabilities firstly in the training stage the energy transmitter et obtains a set of received signal strength indicator rssi feedback values from all ers and these values are used to estimate the channels between the et and all ers next based on the channel estimates the ers are grouped into clusters and the cluster that has its members closest to its centroid in phase is selected for dedicated wet the beamformer that maximizes the minimum harvested energy among all ers in the selected cluster is found by solving a convex optimization problem all ers have the same chance of being selected regardless of their distances from the et and hence this scheduling policy can be considered to be opportunistic as well as fair it is shown that the proposed method achieves significant performance gains over benchmark schemes
|
[['this', 'paper', 'proposes', 'a', 'novel', 'channel', 'estimation', 'method', 'and', 'a', 'clusterbased', 'opportunistic', 'scheduling', 'policy', 'for', 'a', 'wireless', 'energy', 'transfer', 'wet', 'system', 'consisting', 'of', 'multiple', 'lowcomplex', 'energy', 'receivers', 'ers', 'with', 'limited', 'processing', 'capabilities', 'firstly', 'in', 'the', 'training', 'stage', 'the', 'energy', 'transmitter', 'et', 'obtains', 'a', 'set', 'of', 'received', 'signal', 'strength', 'indicator', 'rssi', 'feedback', 'values', 'from', 'all', 'ers', 'and', 'these', 'values', 'are', 'used', 'to', 'estimate', 'the', 'channels', 'between', 'the', 'et', 'and', 'all', 'ers', 'next', 'based', 'on', 'the', 'channel', 'estimates', 'the', 'ers', 'are', 'grouped', 'into', 'clusters', 'and', 'the', 'cluster', 'that', 'has', 'its', 'members', 'closest', 'to', 'its', 'centroid', 'in', 'phase', 'is', 'selected', 'for', 'dedicated', 'wet', 'the', 'beamformer', 'that', 'maximizes', 'the', 'minimum', 'harvested', 'energy', 'among', 'all', 'ers', 'in', 'the', 'selected', 'cluster', 'is', 'found', 'by', 'solving', 'a', 'convex', 'optimization', 'problem', 'all', 'ers', 'have', 'the', 'same', 'chance', 'of', 'being', 'selected', 'regardless', 'of', 'their', 'distances', 'from', 'the', 'et', 'and', 'hence', 'this', 'scheduling', 'policy', 'can', 'be', 'considered', 'to', 'be', 'opportunistic', 'as', 'well', 'as', 'fair', 'it', 'is', 'shown', 'that', 'the', 'proposed', 'method', 'achieves', 'significant', 'performance', 'gains', 'over', 'benchmark', 'schemes']]
|
[-0.1656199365672711, 0.019046450929073172, -0.07115488291657086, 0.017245034609610837, -0.08436383134435996, -0.1667934327824263, 0.11306401662642158, 0.40337251616680686, -0.2618291008541183, -0.350320408863592, 0.07148454698160224, -0.2549652187486312, -0.12576565335932952, 0.17619995555252813, -0.09570595731548522, 0.038720242103452276, 0.07694964270229407, 0.03530525002584216, -0.012027048631959284, -0.30776092000970884, 0.26307131081315066, 0.13512613847463703, 0.34137939528972355, -0.009170602327988794, 0.11773396597709507, 0.017021858833253474, -0.03551137692834129, -0.010034779565536328, -0.09174987876096045, 0.0751780114435297, 0.3244650475237341, 0.19461093125920298, 0.32694858336998595, -0.3451800769682796, -0.22519324960358927, 0.13621577152073205, 0.14388510612064107, 0.06446847438790082, -0.03873090068546368, -0.2591529097851543, 0.12518407083726266, -0.19281629119290128, 0.039174966497479806, 0.02277890163046929, -0.04221629950084856, 0.08261455972713823, -0.34264244324904647, 0.05040458198692206, -0.050898146490605235, -0.006163956625165329, -0.1359169801483707, -0.18202123235719878, -0.036057669322915556, 0.17744704728552496, 0.00044779868732716535, 0.034415160342524315, 0.1011882539564145, -0.08342695508118984, -0.11027845128860679, 0.3599568865902256, 0.02507296226879892, -0.1664798606015254, 0.15105107087583747, -0.04890088180296256, -0.09687541986239098, 0.15353811479213791, 0.2257247832905185, 0.09043807187117636, -0.20353415664396293, 0.009755823304918263, -0.0209583892775256, 0.15791394398894182, 0.056605909568523724, 0.08829894723714374, 0.17898532892632785, 0.1474351605644361, 0.13673307270038917, 0.1403813336108301, -0.14923056906748874, -0.09121153779588417, -0.22441247018598784, -0.1020803464066592, -0.25405143800890073, -0.021354092739611155, -0.049261180112547924, -0.0567358242924023, 0.3838489528058008, 0.12548883907896066, 0.1608956519436712, 0.08866880883579142, 0.3758997908416426, 0.0943179036404174, 0.09045995159179993, 0.1539296137939562, 0.2581546675036883, 0.07613167187996407, 0.1290623317053403, -0.20797062539246067, 0.08084009160354201, -0.005777753145334178]
|
1,803.07306
|
Capacity Analysis of Index Modulations over Spatial, Polarization and
Frequency Dimensions
|
Determining the capacity of a modulation scheme is a fundamental topic of
interest. Index Modulations (IM), such as Spatial Modulation (SMod), Polarized
Modulation (PMod) or Frequency Index Modulation (FMod), are widely studied in
the literature. However, finding a closed-form analytical expression for their
capacity still remains an open topic. In this paper, we formulate closed-form
expressions for the instantaneous capacity of IM, together with its $2$nd and
$4$th order approximations. We show that, in average, the $2$nd approximation
error tends to zero for low Signal to Noise Ratio (SNR) and is
$o\left(\textrm{SNR}\right)$. Also, a detailed analysis of the ergodic capacity
over Rayleigh, Rice and Nakagami-$m$ channel distributions is provided. As
application of the capacity analysis, we leverage the proposed expressions to
compute the ergodic capacities of SMod for different antenna configuration and
correlations, PMod for different channel components and conditions, and FMod
for different frequency separations.
|
eess.SP cs.IT math.IT
|
determining the capacity of a modulation scheme is a fundamental topic of interest index modulations im such as spatial modulation smod polarized modulation pmod or frequency index modulation fmod are widely studied in the literature however finding a closedform analytical expression for their capacity still remains an open topic in this paper we formulate closedform expressions for the instantaneous capacity of im together with its 2nd and 4th order approximations we show that in average the 2nd approximation error tends to zero for low signal to noise ratio snr and is olefttextrmsnrright also a detailed analysis of the ergodic capacity over rayleigh rice and nakagamim channel distributions is provided as application of the capacity analysis we leverage the proposed expressions to compute the ergodic capacities of smod for different antenna configuration and correlations pmod for different channel components and conditions and fmod for different frequency separations
|
[['determining', 'the', 'capacity', 'of', 'a', 'modulation', 'scheme', 'is', 'a', 'fundamental', 'topic', 'of', 'interest', 'index', 'modulations', 'im', 'such', 'as', 'spatial', 'modulation', 'smod', 'polarized', 'modulation', 'pmod', 'or', 'frequency', 'index', 'modulation', 'fmod', 'are', 'widely', 'studied', 'in', 'the', 'literature', 'however', 'finding', 'a', 'closedform', 'analytical', 'expression', 'for', 'their', 'capacity', 'still', 'remains', 'an', 'open', 'topic', 'in', 'this', 'paper', 'we', 'formulate', 'closedform', 'expressions', 'for', 'the', 'instantaneous', 'capacity', 'of', 'im', 'together', 'with', 'its', '2nd', 'and', '4th', 'order', 'approximations', 'we', 'show', 'that', 'in', 'average', 'the', '2nd', 'approximation', 'error', 'tends', 'to', 'zero', 'for', 'low', 'signal', 'to', 'noise', 'ratio', 'snr', 'and', 'is', 'olefttextrmsnrright', 'also', 'a', 'detailed', 'analysis', 'of', 'the', 'ergodic', 'capacity', 'over', 'rayleigh', 'rice', 'and', 'nakagamim', 'channel', 'distributions', 'is', 'provided', 'as', 'application', 'of', 'the', 'capacity', 'analysis', 'we', 'leverage', 'the', 'proposed', 'expressions', 'to', 'compute', 'the', 'ergodic', 'capacities', 'of', 'smod', 'for', 'different', 'antenna', 'configuration', 'and', 'correlations', 'pmod', 'for', 'different', 'channel', 'components', 'and', 'conditions', 'and', 'fmod', 'for', 'different', 'frequency', 'separations']]
|
[-0.21086860055360815, 0.05854358656807594, -0.042198994229065964, 0.07745392017612426, -0.04110134439221744, -0.1751810619511224, 0.11383230860489581, 0.3876688326741087, -0.23943862636605728, -0.2510917488935179, 0.1295146176198112, -0.24252489712731592, -0.1643489027652761, 0.1974071610349648, -0.07513383876468087, 0.04952711554982796, -0.011621200314804245, 0.064257730463327, -0.05470688358101801, -0.2037842466054356, 0.2608433636226531, 0.09757172659296413, 0.3389612622575128, 0.07286257066699708, 0.08291807230561972, 0.01811636226444409, -0.04848115679583159, -0.04504262702539563, -0.16038132089793336, 0.08180864880158534, 0.2919856811745157, 0.11195229397171402, 0.1878288594781068, -0.3344183235397113, -0.24461701523897977, 0.08003005109895985, 0.17065732019857086, 0.04872213137689336, -0.027545175214844016, -0.20056630926656313, 0.10635504882204636, -0.22532855462411355, -0.08546675529716344, -0.04724098099074487, 0.05273743222933262, 0.0730007272944304, -0.3568335322342042, 0.07961265006371582, 0.06302362256522837, 0.08507659876847576, -0.08031354679260402, -0.1817772739470519, 0.0646801355680258, 0.18487516369445828, 0.05769525882788003, -0.018311278753239534, 0.035082008750659636, -0.11642338643011091, -0.07497089744930895, 0.32599463128195755, -0.09207019926096988, -0.23986433884450073, 0.14641384797829107, -0.15919183592215694, -0.08542571604444549, 0.16704612068253857, 0.20002540049367937, 0.062286860572880715, -0.1602894963809, 0.04675552533429662, 0.006223873010483281, 0.19764915331796712, 0.1143740512045293, 0.08770772514479427, 0.16810638959969168, 0.10286672802577759, 0.06366658527198336, 0.15480528566022886, -0.14353252368947042, -0.1067884984008711, -0.24270433346773015, -0.14645534159037574, -0.19063066042044424, 0.018532751216392578, -0.10047343422052579, -0.1316594339264878, 0.3638530707172196, 0.10400386147104718, 0.12283821287083214, 0.09218183073439988, 0.3492390167353482, 0.16864008464015506, -0.033077134659256914, 0.10043733524367342, 0.18634105627906733, 0.18494941093637768, 0.1100993862688734, -0.18987606818595065, 0.05147873650722463, 0.009139360082817488]
|
1,803.07307
|
Information content of coevolutionary game landscapes
|
Coevolutionary game dynamics is the result of players that may change their
strategies and their network of interaction. For such games, and based on
interpreting strategies as configurations, strategy-to-payoff maps can be
defined for every interaction network, which opens up to derive game
landscapes. This paper presents an analysis of these game landscapes by their
information content. By this analysis, we particularly study the effect of a
rescaled payoff matrix generalizing social dilemmas and differences between
well-mixed and structured populations.
|
q-bio.PE cs.NE physics.soc-ph
|
coevolutionary game dynamics is the result of players that may change their strategies and their network of interaction for such games and based on interpreting strategies as configurations strategytopayoff maps can be defined for every interaction network which opens up to derive game landscapes this paper presents an analysis of these game landscapes by their information content by this analysis we particularly study the effect of a rescaled payoff matrix generalizing social dilemmas and differences between wellmixed and structured populations
|
[['coevolutionary', 'game', 'dynamics', 'is', 'the', 'result', 'of', 'players', 'that', 'may', 'change', 'their', 'strategies', 'and', 'their', 'network', 'of', 'interaction', 'for', 'such', 'games', 'and', 'based', 'on', 'interpreting', 'strategies', 'as', 'configurations', 'strategytopayoff', 'maps', 'can', 'be', 'defined', 'for', 'every', 'interaction', 'network', 'which', 'opens', 'up', 'to', 'derive', 'game', 'landscapes', 'this', 'paper', 'presents', 'an', 'analysis', 'of', 'these', 'game', 'landscapes', 'by', 'their', 'information', 'content', 'by', 'this', 'analysis', 'we', 'particularly', 'study', 'the', 'effect', 'of', 'a', 'rescaled', 'payoff', 'matrix', 'generalizing', 'social', 'dilemmas', 'and', 'differences', 'between', 'wellmixed', 'and', 'structured', 'populations']]
|
[-0.10129076837786014, 0.09305008693433903, -0.13958381775094644, 0.1199882661237063, -0.03749396706212171, -0.15404151754359466, 0.09388375748096246, 0.4305613480885572, -0.28957791046145126, -0.34005113241934704, 0.06516955759305554, -0.2564412024214015, -0.255661511966882, 0.07968894767433499, -0.09266436183117802, -0.048164009028173325, 0.07637709999291957, -0.04309376567908669, 0.037259265524040484, -0.23974712495544714, 0.40738764537286154, 0.05428229262934455, 0.22270983695700952, 0.0663992902028221, 0.0911007928647266, 0.03538255578590722, -0.04787692102261736, 0.07608074439937083, -0.13816676828525798, 0.13833537256003275, 0.2905661678192194, 0.20254516443001885, 0.3736090698527007, -0.4196526817310619, -0.19917027506965532, 0.17999442517639527, 0.14660534484656765, 0.13216494005969195, -0.037098347994829, -0.30920879380140875, 0.025209260868686665, -0.16372090432044306, -0.07108928318005762, -0.08495259964308124, -0.003116397198902655, 0.05915110375248839, -0.29372079559613634, -0.012976532012129886, 0.03021392508563173, 0.11065852472299262, -0.04349827630256739, -0.11852216975810596, -0.03404742573046043, 0.2372721540800567, 0.03132047130183989, -0.042865912263470266, 0.17472083051320567, -0.16466658913141377, -0.19945355739497544, 0.39062328471601765, -0.058236495518019495, -0.16610229503263166, 0.1766770945632052, -0.05908895480811973, -0.10321712266370843, 0.050834976348884495, 0.1963117392969471, 0.12264135211140295, -0.1781656462699175, 0.02297149101107181, -0.07019623677847506, 0.1399993414672304, 0.04930312651551411, 0.06059072802323683, 0.20061390691354306, 0.21502387813068455, 0.12566419094329392, 0.10937936930427965, 0.0246114605312719, -0.19141043092513196, -0.19998862543673832, -0.10261424888172953, -0.1330887767946041, 0.03787510771646247, -0.13769565312754764, -0.1367445691854139, 0.38971298212138344, 0.13972224530475097, 0.149613916361115, 0.1285717732971534, 0.2384729702143541, 0.06644428927374744, 0.00798692952994776, 0.025988298639230713, 0.1638988607675073, 0.10460648669778735, 0.14792436694349104, -0.2156716794588992, 0.14999563712921418, 0.016722224082479465]
|
1,803.07308
|
Compton Scattering from the Deuteron above Pion-Production Threshold
|
The electromagnetic polarizabilities of the nucleon are fundamental
nucleon-structure observables that characterize its response to external
electromagnetic fields. The neutron polarizabilities can be accessed from
Compton-scattering data on light nuclear targets. Recent measurements of the
differential cross section for Compton scattering on the deuteron below the
pion-production threshold have decreased the uncertainties in the neutron
polarizabilities, yet the proton polarizabilities remain known substantially
more accurately. As the sensitivity of the cross section to the
polarizabilities increases with incident photon energy, measurements above the
pion threshold may offer a way for an improved determination of the neutron
polarizabilities. In this article, the first measurement of the cross section
for Compton scattering on the deuteron above the pion-production threshold is
presented.
|
nucl-ex
|
the electromagnetic polarizabilities of the nucleon are fundamental nucleonstructure observables that characterize its response to external electromagnetic fields the neutron polarizabilities can be accessed from comptonscattering data on light nuclear targets recent measurements of the differential cross section for compton scattering on the deuteron below the pionproduction threshold have decreased the uncertainties in the neutron polarizabilities yet the proton polarizabilities remain known substantially more accurately as the sensitivity of the cross section to the polarizabilities increases with incident photon energy measurements above the pion threshold may offer a way for an improved determination of the neutron polarizabilities in this article the first measurement of the cross section for compton scattering on the deuteron above the pionproduction threshold is presented
|
[['the', 'electromagnetic', 'polarizabilities', 'of', 'the', 'nucleon', 'are', 'fundamental', 'nucleonstructure', 'observables', 'that', 'characterize', 'its', 'response', 'to', 'external', 'electromagnetic', 'fields', 'the', 'neutron', 'polarizabilities', 'can', 'be', 'accessed', 'from', 'comptonscattering', 'data', 'on', 'light', 'nuclear', 'targets', 'recent', 'measurements', 'of', 'the', 'differential', 'cross', 'section', 'for', 'compton', 'scattering', 'on', 'the', 'deuteron', 'below', 'the', 'pionproduction', 'threshold', 'have', 'decreased', 'the', 'uncertainties', 'in', 'the', 'neutron', 'polarizabilities', 'yet', 'the', 'proton', 'polarizabilities', 'remain', 'known', 'substantially', 'more', 'accurately', 'as', 'the', 'sensitivity', 'of', 'the', 'cross', 'section', 'to', 'the', 'polarizabilities', 'increases', 'with', 'incident', 'photon', 'energy', 'measurements', 'above', 'the', 'pion', 'threshold', 'may', 'offer', 'a', 'way', 'for', 'an', 'improved', 'determination', 'of', 'the', 'neutron', 'polarizabilities', 'in', 'this', 'article', 'the', 'first', 'measurement', 'of', 'the', 'cross', 'section', 'for', 'compton', 'scattering', 'on', 'the', 'deuteron', 'above', 'the', 'pionproduction', 'threshold', 'is', 'presented']]
|
[-0.06703210161204505, 0.23743363722541053, -0.04666730196913704, 0.1090394069573709, -0.043707484927247554, -0.018061979933536195, 0.05431991380819378, 0.3574529180005819, -0.1972783041037932, -0.30025794793765587, -0.04842175331412807, -0.37466287247038316, 0.031311047623450515, 0.21258461275020568, 0.10638296650331311, 0.09336790846251812, 0.024344953475520015, 0.08804448481116976, -0.05148269052758124, -0.14835110840000243, 0.3657878056606826, 0.13827215968592077, 0.23289335881625967, 0.20354389885495253, 0.04268250435085952, 0.11250582427968185, -0.00887668049823837, -0.05901899597286677, -0.09388828699941945, 0.11098817454165771, 0.28110412556771974, 0.06949578160263535, 0.05591361704008544, -0.4052750692710656, -0.140489864628762, 0.06828104635454058, 0.12166291395859684, 0.1315690066270186, -0.026417140725304513, -0.29687934220150236, 0.006754888984679925, -0.19406647664815688, -0.15571295171819566, -0.11932786256701004, 0.03489848492400987, 0.05696600124224269, -0.25396709611341983, 0.037861513905227184, -0.03790707141845761, -0.017867879112478065, -0.14460391349828325, -0.24866448266102986, 0.05294171310256885, 0.059921959552037364, 0.06442255324277119, 0.05692965897316692, 0.2453259768340142, -0.17701981030600225, -0.11348136950346853, 0.38013152546491946, -0.0203999483707447, -0.14461025518576512, 0.031412664605226334, -0.23557497095316648, -0.08559544303013254, 0.22787474717224845, 0.21368518112493412, 0.13007611587072307, -0.1920386497831332, 0.037573113153148596, -0.00976078215391696, 0.23713679757250958, 0.14547039664686978, 0.03743335299444299, 0.1801935684076753, 0.1932122124272923, -0.012254922515751809, 0.03710354506449007, -0.16055812638746025, 0.008194179728063716, -0.34320502602612646, -0.05054825196089614, -0.10264189321031215, 0.08087655869723462, -0.04881391240877663, -0.10856828811194967, 0.3125691159017885, 0.12257804580036738, 0.18233184227543814, 0.00474774103392573, 0.39071461725432205, 0.1674381405899708, 0.0792743234676035, 0.005521418507203084, 0.4086373640584345, 0.25545848797255455, 0.13656116777467503, -0.25087846878782977, 0.08785876123520288, -0.044320674315721044]
|
1,803.07309
|
A Construction of Colimits in Monoidal Closed Categories
|
We prove that a category which is symmetric (relaxed) monoidal closed,
(small) complete, well-powered and has a small cogenerating family, is
cocomplete.
|
math.CT
|
we prove that a category which is symmetric relaxed monoidal closed small complete wellpowered and has a small cogenerating family is cocomplete
|
[['we', 'prove', 'that', 'a', 'category', 'which', 'is', 'symmetric', 'relaxed', 'monoidal', 'closed', 'small', 'complete', 'wellpowered', 'and', 'has', 'a', 'small', 'cogenerating', 'family', 'is', 'cocomplete']]
|
[-0.2138001288456673, 0.07398932198570533, -0.032149334607476536, 0.1327111550543288, -0.182268271392042, -0.1818260743113404, -0.05657294396819039, 0.4025555986233733, -0.32492799176411197, -0.12297322567213666, 0.08427875554612414, -0.16689832500097426, -0.08759321088225326, 0.08917054974220016, -0.21633393308994445, -0.125445674427531, 0.13167917398227888, 0.13491260218010706, -0.05566287274599414, -0.23126729315316136, 0.4235566912049597, -0.10122307085178116, 0.2516436546363614, 0.052048328586600044, 0.14323739705353297, -0.039712857878343624, 0.0905384284825149, 0.11410230364311826, -0.14887591538883332, 0.08948567695915699, 0.29820978319780395, 0.10360065833877095, 0.23197293472582137, -0.3079153483902866, -0.05175743137740276, 0.2193007372658361, 0.07717966129580005, 0.11353971472073515, -0.12143032948105512, -0.3201035236601125, 0.23119948965243317, -0.27189028974283824, -0.10239961527457292, -0.09849863435903733, 0.1699211588976058, -0.04496238672767173, -0.32453586042604665, -0.04594695204022256, 0.14133926047096876, 0.037152640648524866, -0.0765136939219453, -0.030973793134431948, -0.10615592077374458, 0.036649178925224325, -0.12886237880130383, 0.07599932886660099, 0.1104488803327761, -0.011619516309689392, -0.012668284799226305, 0.3723400140006561, -0.08118957137181, -0.23216337490488181, 0.11321394264020702, -0.12322816057977351, -0.16867463527755303, 0.17979453300887888, 0.025978432417931883, 0.228638540614735, -0.10151447529311884, 0.28074798309402965, -0.292188456451351, 0.10314466475657272, 0.07553602687337181, 0.029090052407065577, 0.15535543372177266, 0.16967284317467024, 0.08338735383850607, 0.1996221108870073, 0.032628707587718964, -0.10854791862551462, -0.32975309138948267, -0.14931188100440937, -0.06670137343462557, 0.17960149413821372, -0.051554442223939324, -0.2553426618211564, 0.31783260487612675, -0.038244982080703434, 0.13108894123103132, 0.18985753490018065, 0.23579020036215131, 0.026755406690592117, 0.10161328260702165, 0.09100793712687763, 0.1522937583821741, 0.212745127691464, -0.08882817710135979, 0.0034762373702092605, 0.048393336929042234, 0.12059540136463263]
|
1,803.0731
|
The CTTC 5G end-to-end experimental platform: Integrating heterogeneous
wireless/optical networks, distributed cloud, and IoT devices
|
The Internet of Things (IoT) will facilitate a wide variety of applications
in different domains, such as smart cities, smart grids, industrial automation
(Industry 4.0), smart driving, assistance of the elderly, and home automation.
Billions of heterogeneous smart devices with different application requirements
will be connected to the networks and will generate huge aggregated volumes of
data that will be processed in distributed cloud infrastructures. On the other
hand, there is also a general trend to deploy functions as software (SW)
instances in cloud infrastructures [e.g., network function virtualization (NFV)
or mobile edge computing (MEC)]. Thus, the next generation of mobile networks,
the fifth-generation (5G), will need not only to develop new radio interfaces
or waveforms to cope with the expected traffic growth but also to integrate
heterogeneous networks from end to end (E2E) with distributed cloud resources
to deliver E2E IoT and mobile services. This article presents the E2E 5G
platform that is being developed by the Centre Tecnol\`ogic de
Telecomunicacions de Catalunya (CTTC), the first known platform capable of
reproducing such an ambitious scenario.
|
cs.NI cs.IT math.IT
|
the internet of things iot will facilitate a wide variety of applications in different domains such as smart cities smart grids industrial automation industry 40 smart driving assistance of the elderly and home automation billions of heterogeneous smart devices with different application requirements will be connected to the networks and will generate huge aggregated volumes of data that will be processed in distributed cloud infrastructures on the other hand there is also a general trend to deploy functions as software sw instances in cloud infrastructures eg network function virtualization nfv or mobile edge computing mec thus the next generation of mobile networks the fifthgeneration 5g will need not only to develop new radio interfaces or waveforms to cope with the expected traffic growth but also to integrate heterogeneous networks from end to end e2e with distributed cloud resources to deliver e2e iot and mobile services this article presents the e2e 5g platform that is being developed by the centre tecnologic de telecomunicacions de catalunya cttc the first known platform capable of reproducing such an ambitious scenario
|
[['the', 'internet', 'of', 'things', 'iot', 'will', 'facilitate', 'a', 'wide', 'variety', 'of', 'applications', 'in', 'different', 'domains', 'such', 'as', 'smart', 'cities', 'smart', 'grids', 'industrial', 'automation', 'industry', '40', 'smart', 'driving', 'assistance', 'of', 'the', 'elderly', 'and', 'home', 'automation', 'billions', 'of', 'heterogeneous', 'smart', 'devices', 'with', 'different', 'application', 'requirements', 'will', 'be', 'connected', 'to', 'the', 'networks', 'and', 'will', 'generate', 'huge', 'aggregated', 'volumes', 'of', 'data', 'that', 'will', 'be', 'processed', 'in', 'distributed', 'cloud', 'infrastructures', 'on', 'the', 'other', 'hand', 'there', 'is', 'also', 'a', 'general', 'trend', 'to', 'deploy', 'functions', 'as', 'software', 'sw', 'instances', 'in', 'cloud', 'infrastructures', 'eg', 'network', 'function', 'virtualization', 'nfv', 'or', 'mobile', 'edge', 'computing', 'mec', 'thus', 'the', 'next', 'generation', 'of', 'mobile', 'networks', 'the', 'fifthgeneration', '5g', 'will', 'need', 'not', 'only', 'to', 'develop', 'new', 'radio', 'interfaces', 'or', 'waveforms', 'to', 'cope', 'with', 'the', 'expected', 'traffic', 'growth', 'but', 'also', 'to', 'integrate', 'heterogeneous', 'networks', 'from', 'end', 'to', 'end', 'e2e', 'with', 'distributed', 'cloud', 'resources', 'to', 'deliver', 'e2e', 'iot', 'and', 'mobile', 'services', 'this', 'article', 'presents', 'the', 'e2e', '5g', 'platform', 'that', 'is', 'being', 'developed', 'by', 'the', 'centre', 'tecnologic', 'de', 'telecomunicacions', 'de', 'catalunya', 'cttc', 'the', 'first', 'known', 'platform', 'capable', 'of', 'reproducing', 'such', 'an', 'ambitious', 'scenario']]
|
[-0.2098469069299834, 0.06401461456447703, 0.007789463745483637, 0.01223948356580396, -0.12617981666832861, -0.1852765045558295, 0.025555035416685825, 0.39160586268127223, -0.26789490961544643, -0.32339907208478996, 0.12331291916044215, -0.2798501729467434, -0.16853881015404845, 0.2370351933065973, -0.14707537344523075, 0.0710101215083195, 0.07353259172911446, -0.038933167731169956, 0.03501520412117671, -0.27507275987106067, 0.29159045707696685, 0.06018930751209458, 0.39931289605989023, 0.0905595048191561, -0.002106728879922209, -0.04965864123185112, -0.018348263831201663, -0.05896660221818214, -0.03306621302030619, 0.21269749529424242, 0.41579954277980946, 0.21961841191400655, 0.3451359513932946, -0.512441200621683, -0.2065063614997713, 0.10634048616088092, 0.1798883743450178, 0.0076842841025891485, -0.07042864991429572, -0.32012305649040246, 0.14540674705419626, -0.3365019014722068, -0.17421079006428422, -0.026213781041061056, 0.025686516726239658, 0.09728541464047057, -0.23895384257541563, -0.0968279291533774, -0.09500987433437687, 0.0369842198902163, -0.028850341397461392, -0.03676442706879849, -0.021622344147649474, 0.20654437040385587, -0.021536629360661596, 0.017409601922537703, 0.20143398655670156, -0.16023548518477446, -0.1251761315821338, 0.40988705725002306, 0.06357131475026066, -0.10521142170483504, 0.21116300928607135, -0.027383401826687758, -0.1802161277095177, 0.03852235095511223, 0.27619891235305144, 0.017519005872683877, -0.2301372204339881, 0.033178474919016786, 0.07846189462432596, 0.15058264560427453, 0.03673303948083743, 0.05668428901953612, 0.24828286878577294, 0.25366832240987786, 0.18803722028829287, 0.0709277618025435, -0.04535089761832322, -0.10931999943501466, -0.1778580974479709, -0.16845653032825125, -0.1996421870941446, 0.03452319003403757, -0.09151607899414442, -0.15219844427982068, 0.3324643602713825, 0.20756519731969156, 0.09439815819027951, 0.07570751063959223, 0.4145158284327722, 0.027773067260150337, 0.17764694234704193, 0.12789472800026508, 0.10669128937264048, -0.05312535696898469, 0.3237988195547984, -0.0796182555341879, 0.06269427376863515, -0.04423322999614409]
|
1,803.07311
|
SOTorrent: Reconstructing and Analyzing the Evolution of Stack Overflow
Posts
|
Stack Overflow (SO) is the most popular question-and-answer website for
software developers, providing a large amount of code snippets and free-form
text on a wide variety of topics. Like other software artifacts, questions and
answers on SO evolve over time, for example when bugs in code snippets are
fixed, code is updated to work with a more recent library version, or text
surrounding a code snippet is edited for clarity. To be able to analyze how
content on SO evolves, we built SOTorrent, an open dataset based on the
official SO data dump. SOTorrent provides access to the version history of SO
content at the level of whole posts and individual text or code blocks. It
connects SO posts to other platforms by aggregating URLs from text blocks and
by collecting references from GitHub files to SO posts. In this paper, we
describe how we built SOTorrent, and in particular how we evaluated 134
different string similarity metrics regarding their applicability for
reconstructing the version history of text and code blocks. Based on a first
analysis using the dataset, we present insights into the evolution of SO posts,
e.g., that post edits are usually small, happen soon after the initial creation
of the post, and that code is rarely changed without also updating the
surrounding text. Further, our analysis revealed a close relationship between
post edits and comments. Our vision is that researchers will use SOTorrent to
investigate and understand the evolution of SO posts and their relation to
other platforms such as GitHub.
|
cs.SE
|
stack overflow so is the most popular questionandanswer website for software developers providing a large amount of code snippets and freeform text on a wide variety of topics like other software artifacts questions and answers on so evolve over time for example when bugs in code snippets are fixed code is updated to work with a more recent library version or text surrounding a code snippet is edited for clarity to be able to analyze how content on so evolves we built sotorrent an open dataset based on the official so data dump sotorrent provides access to the version history of so content at the level of whole posts and individual text or code blocks it connects so posts to other platforms by aggregating urls from text blocks and by collecting references from github files to so posts in this paper we describe how we built sotorrent and in particular how we evaluated 134 different string similarity metrics regarding their applicability for reconstructing the version history of text and code blocks based on a first analysis using the dataset we present insights into the evolution of so posts eg that post edits are usually small happen soon after the initial creation of the post and that code is rarely changed without also updating the surrounding text further our analysis revealed a close relationship between post edits and comments our vision is that researchers will use sotorrent to investigate and understand the evolution of so posts and their relation to other platforms such as github
|
[['stack', 'overflow', 'so', 'is', 'the', 'most', 'popular', 'questionandanswer', 'website', 'for', 'software', 'developers', 'providing', 'a', 'large', 'amount', 'of', 'code', 'snippets', 'and', 'freeform', 'text', 'on', 'a', 'wide', 'variety', 'of', 'topics', 'like', 'other', 'software', 'artifacts', 'questions', 'and', 'answers', 'on', 'so', 'evolve', 'over', 'time', 'for', 'example', 'when', 'bugs', 'in', 'code', 'snippets', 'are', 'fixed', 'code', 'is', 'updated', 'to', 'work', 'with', 'a', 'more', 'recent', 'library', 'version', 'or', 'text', 'surrounding', 'a', 'code', 'snippet', 'is', 'edited', 'for', 'clarity', 'to', 'be', 'able', 'to', 'analyze', 'how', 'content', 'on', 'so', 'evolves', 'we', 'built', 'sotorrent', 'an', 'open', 'dataset', 'based', 'on', 'the', 'official', 'so', 'data', 'dump', 'sotorrent', 'provides', 'access', 'to', 'the', 'version', 'history', 'of', 'so', 'content', 'at', 'the', 'level', 'of', 'whole', 'posts', 'and', 'individual', 'text', 'or', 'code', 'blocks', 'it', 'connects', 'so', 'posts', 'to', 'other', 'platforms', 'by', 'aggregating', 'urls', 'from', 'text', 'blocks', 'and', 'by', 'collecting', 'references', 'from', 'github', 'files', 'to', 'so', 'posts', 'in', 'this', 'paper', 'we', 'describe', 'how', 'we', 'built', 'sotorrent', 'and', 'in', 'particular', 'how', 'we', 'evaluated', '134', 'different', 'string', 'similarity', 'metrics', 'regarding', 'their', 'applicability', 'for', 'reconstructing', 'the', 'version', 'history', 'of', 'text', 'and', 'code', 'blocks', 'based', 'on', 'a', 'first', 'analysis', 'using', 'the', 'dataset', 'we', 'present', 'insights', 'into', 'the', 'evolution', 'of', 'so', 'posts', 'eg', 'that', 'post', 'edits', 'are', 'usually', 'small', 'happen', 'soon', 'after', 'the', 'initial', 'creation', 'of', 'the', 'post', 'and', 'that', 'code', 'is', 'rarely', 'changed', 'without', 'also', 'updating', 'the', 'surrounding', 'text', 'further', 'our', 'analysis', 'revealed', 'a', 'close', 'relationship', 'between', 'post', 'edits', 'and', 'comments', 'our', 'vision', 'is', 'that', 'researchers', 'will', 'use', 'sotorrent', 'to', 'investigate', 'and', 'understand', 'the', 'evolution', 'of', 'so', 'posts', 'and', 'their', 'relation', 'to', 'other', 'platforms', 'such', 'as', 'github']]
|
[-0.04301134312221062, 0.03763572342734368, -0.07081217285315324, 0.09144024381929217, -0.15706176505933744, -0.163276408190333, 0.08712111712812894, 0.4223806163750765, -0.2738126983694681, -0.35924702748614107, 0.1415878287576117, -0.35538492873897704, -0.11134064796850027, 0.2030982133569416, -0.06542674086687308, 0.0066684465759111146, 0.12381743211720843, 0.05157263074106881, -0.03631481322951204, -0.3326869132400556, 0.34137610734374385, 0.11103769014296158, 0.2716616502391013, 0.07479915354312874, 0.03789442446949987, -0.013954678125034167, -0.12427168037177716, -0.025908548184500925, -0.11329086591792911, 0.11490463059121471, 0.28699919462156315, 0.2596869456570772, 0.28178164995950095, -0.42745646182172675, -0.1519517714724194, -0.007971881974972492, 0.16518610019041327, 0.13834763225534652, -0.041677862884099574, -0.3127577100499115, 0.1056573405453026, -0.1927284536861235, -0.027745374214402804, -0.055663860393834745, 0.05891273858934993, 0.016150543870914025, -0.18409277634066346, -0.0412456271116939, 0.0167989096224792, 0.09998485153379637, 0.008021515166188964, -0.08959796904696483, -0.013851778941067655, 0.21109503833084334, 0.058003189374956736, 0.05172029762140633, 0.15979220572580385, -0.13230277363767326, -0.08117376781512403, 0.40650286886650394, -0.05248450724532696, -0.18513842310030454, 0.17398048797713989, -0.02715703584143789, -0.13976607260827753, 0.0554459215266498, 0.2286597974635074, 0.0944934288107636, -0.1734814951373342, 0.01509477794454543, -0.028235764704703344, 0.25508458102827775, 0.0875583584814545, -0.003160415943272001, 0.23068019511511798, 0.17148494292563926, -0.04435969514251635, 0.13406984122514937, -0.03393223518267362, -0.05691510111122854, -0.22038990443235074, -0.1616931259705443, -0.14660180551843263, 0.025691962488340287, -0.03722166296360028, -0.174831404092201, 0.39095331891256524, 0.22007295053807915, 0.17196524992042522, 0.031249967178899985, 0.2775672697324643, -0.03673732728380197, 0.10854340195985819, 0.1286885625174944, 0.0901395387170235, -0.013073468855838842, 0.16373129548664447, -0.10814945913730263, 0.07220352108142977, 0.030352168346161213]
|
1,803.07312
|
Curvature-sensitive kinesin binding can explain microtubule ring
formation and reveals chaotic dynamics in a mathematical model
|
Microtubules are filamentous tubular protein polymers which are essential for
a range of cellular behaviour, and are generally straight over micron length
scales. However, in some gliding assays, where microtubules move over a carpet
of molecular motors, individual microtubules can also form tight arcs or rings,
even in the absence of crosslinking proteins. Understanding this phenomenon may
provide important explanations for similar highly curved microtubules which can
be found in nerve cells undergoing neurodegeneration. We propose a model for
gliding assays where the kinesins moving the microtubules over the surface
induce ring formation through differential binding, substantiated by recent
findings that a mutant version of the motor protein kinesin applied in solution
is able to lock-in microtubule curvature. For certain parameter regimes, our
model predicts that both straight and curved microtubules can exist
simultaneously as stable steady-states, as has been seen experimentally.
Additionally, unsteady solutions are found, where a wave of differential
binding propagates down the microtubule as it glides across the surface, which
can lead to chaotic motion. Whilst this model explains two-dimensional
microtubule behaviour in an experimental gliding assay, it has the potential to
be adapted to explain pathological curling in nerve cells.
|
q-bio.SC nlin.CD
|
microtubules are filamentous tubular protein polymers which are essential for a range of cellular behaviour and are generally straight over micron length scales however in some gliding assays where microtubules move over a carpet of molecular motors individual microtubules can also form tight arcs or rings even in the absence of crosslinking proteins understanding this phenomenon may provide important explanations for similar highly curved microtubules which can be found in nerve cells undergoing neurodegeneration we propose a model for gliding assays where the kinesins moving the microtubules over the surface induce ring formation through differential binding substantiated by recent findings that a mutant version of the motor protein kinesin applied in solution is able to lockin microtubule curvature for certain parameter regimes our model predicts that both straight and curved microtubules can exist simultaneously as stable steadystates as has been seen experimentally additionally unsteady solutions are found where a wave of differential binding propagates down the microtubule as it glides across the surface which can lead to chaotic motion whilst this model explains twodimensional microtubule behaviour in an experimental gliding assay it has the potential to be adapted to explain pathological curling in nerve cells
|
[['microtubules', 'are', 'filamentous', 'tubular', 'protein', 'polymers', 'which', 'are', 'essential', 'for', 'a', 'range', 'of', 'cellular', 'behaviour', 'and', 'are', 'generally', 'straight', 'over', 'micron', 'length', 'scales', 'however', 'in', 'some', 'gliding', 'assays', 'where', 'microtubules', 'move', 'over', 'a', 'carpet', 'of', 'molecular', 'motors', 'individual', 'microtubules', 'can', 'also', 'form', 'tight', 'arcs', 'or', 'rings', 'even', 'in', 'the', 'absence', 'of', 'crosslinking', 'proteins', 'understanding', 'this', 'phenomenon', 'may', 'provide', 'important', 'explanations', 'for', 'similar', 'highly', 'curved', 'microtubules', 'which', 'can', 'be', 'found', 'in', 'nerve', 'cells', 'undergoing', 'neurodegeneration', 'we', 'propose', 'a', 'model', 'for', 'gliding', 'assays', 'where', 'the', 'kinesins', 'moving', 'the', 'microtubules', 'over', 'the', 'surface', 'induce', 'ring', 'formation', 'through', 'differential', 'binding', 'substantiated', 'by', 'recent', 'findings', 'that', 'a', 'mutant', 'version', 'of', 'the', 'motor', 'protein', 'kinesin', 'applied', 'in', 'solution', 'is', 'able', 'to', 'lockin', 'microtubule', 'curvature', 'for', 'certain', 'parameter', 'regimes', 'our', 'model', 'predicts', 'that', 'both', 'straight', 'and', 'curved', 'microtubules', 'can', 'exist', 'simultaneously', 'as', 'stable', 'steadystates', 'as', 'has', 'been', 'seen', 'experimentally', 'additionally', 'unsteady', 'solutions', 'are', 'found', 'where', 'a', 'wave', 'of', 'differential', 'binding', 'propagates', 'down', 'the', 'microtubule', 'as', 'it', 'glides', 'across', 'the', 'surface', 'which', 'can', 'lead', 'to', 'chaotic', 'motion', 'whilst', 'this', 'model', 'explains', 'twodimensional', 'microtubule', 'behaviour', 'in', 'an', 'experimental', 'gliding', 'assay', 'it', 'has', 'the', 'potential', 'to', 'be', 'adapted', 'to', 'explain', 'pathological', 'curling', 'in', 'nerve', 'cells']]
|
[-0.14189958301274322, 0.20208276161895647, -0.04496855741330924, 0.038648084724823444, -0.06068738734063048, -0.1885118518788845, -0.0010867034940299793, 0.4446557996078179, -0.282001249338142, -0.2167882624679269, 0.015312000303171001, -0.20936401864060034, -0.2601013616921428, 0.19393919515662278, -0.0838906491557375, 0.007886376059972323, 0.07108976122600814, 0.01459827525436711, 0.12382535795824459, -0.14911920878057106, 0.15581864991392463, 0.026664655547714435, 0.2901279985092771, 0.05580484930139321, 0.11362173541759452, -0.06597134803827756, 0.0849735925750186, 0.058682821609844, -0.17775801868000343, 0.1052968419282339, 0.26627461126026436, 0.01951798584359961, 0.22471337107559428, -0.5208374965935946, -0.2680193941831254, 0.09365714360506107, 0.26729601564315647, 0.15674555597122378, -0.022960762638980763, -0.24622356930317787, 0.08430462623826969, -0.10611683971320207, -0.14089549922814162, -0.08077455616126267, 0.038826676443792306, 0.09860677875739594, -0.1945589614721636, 0.11940279588900292, 0.054372423979191065, 0.08692203853279352, -0.1038829112604547, -0.02897009927397355, -0.0800097399068853, 0.13495140535374864, 0.08705126015791813, 0.04388149744138504, 0.2805185444461994, -0.11534412284262287, -0.12530642308247014, 0.3917955750838304, -0.006202970095910132, -0.2135207442449591, 0.2051772939065137, -0.12975866590172816, -0.11139847042325597, 0.1987334764156586, 0.13453938752794878, 0.08090220151636272, -0.15587343477572385, -0.009643686143084406, -0.059975943342298985, 0.16290947522442692, 0.14173212422010226, -0.04314994208801251, 0.242483783303163, 0.22244531124448164, 0.04921800632952139, 0.09338199785934427, -0.1038059193115586, -0.1317537434781209, -0.24094107476158594, -0.17395129039740334, -0.07576831001967478, 0.0464805572910103, -0.040838868244855595, -0.20155391576580511, 0.35728064980238483, 0.07437853398195539, 0.22059038521733898, 0.08112993284101741, 0.208473790754588, -0.019102356067070593, 0.1266727616234372, -0.014111863487423994, 0.20264325076311182, 0.10153693321626633, 0.0878008658430563, -0.2349794868639527, 0.12910521528623903, 0.05319786969637976]
|
1,803.07313
|
On Natural Deduction for Herbrand Constructive Logics III: The Strange
Case of the Intuitionistic Logic of Constant Domains
|
The logic of constant domains is intuitionistic logic extended with the
so-called forall-shift axiom, a classically valid statement which implies the
excluded middle over decidable formulas. Surprisingly, this logic is
constructive and so far this has been proved by cut-elimination for ad-hoc
sequent calculi. Here we use the methods of natural deduction and Curry-Howard
correspondence to provide a simple computational interpretation of the logic.
|
math.LO cs.LO
|
the logic of constant domains is intuitionistic logic extended with the socalled forallshift axiom a classically valid statement which implies the excluded middle over decidable formulas surprisingly this logic is constructive and so far this has been proved by cutelimination for adhoc sequent calculi here we use the methods of natural deduction and curryhoward correspondence to provide a simple computational interpretation of the logic
|
[['the', 'logic', 'of', 'constant', 'domains', 'is', 'intuitionistic', 'logic', 'extended', 'with', 'the', 'socalled', 'forallshift', 'axiom', 'a', 'classically', 'valid', 'statement', 'which', 'implies', 'the', 'excluded', 'middle', 'over', 'decidable', 'formulas', 'surprisingly', 'this', 'logic', 'is', 'constructive', 'and', 'so', 'far', 'this', 'has', 'been', 'proved', 'by', 'cutelimination', 'for', 'adhoc', 'sequent', 'calculi', 'here', 'we', 'use', 'the', 'methods', 'of', 'natural', 'deduction', 'and', 'curryhoward', 'correspondence', 'to', 'provide', 'a', 'simple', 'computational', 'interpretation', 'of', 'the', 'logic']]
|
[-0.09952161778947191, 0.03002501382595963, -0.11742530295640112, 0.17424525690102388, -0.22522478450148825, -0.19256956241137924, 0.10957903613332688, 0.3294134174902288, -0.30006952501005596, -0.24902535111658156, 0.07357532754983931, -0.17599993994429944, -0.07916354127819576, 0.17334312813297387, -0.19061666831909124, 0.042384269558602854, 0.002129574040217059, 0.07094084738711236, -0.03254869810142924, -0.20653843214469297, 0.2518013850120561, -0.048409626952239444, 0.2165730051060636, 0.08828357700997638, 0.14491494919823866, 0.03450295781820185, 0.040511422982764625, 0.06757670667554651, -0.14283974095809435, 0.15574134784632376, 0.3850465792763446, 0.23375310127564247, 0.3087476139503812, -0.42980372556854807, -0.12382569078296896, 0.08033764175701118, 0.11860934372932191, 0.1204037433249935, 0.02500183723630413, -0.3150633093679235, 0.05597766378657922, -0.19412079565818346, -0.06363446102108038, -0.11234355935206015, 0.1086093691059403, -0.04934785985905263, -0.19411945136057007, -0.02791950786634097, 0.31688432256498983, 0.18427406350475928, 0.004806664181015794, -0.04194494163883584, 0.027548430110549645, -0.01832298187923337, -0.05573924133620624, -0.008124405244690559, 0.07551711703842831, -0.027174222556548933, -0.2369573162572961, 0.3225172868678494, 0.001837121444709954, -0.2086103701638797, 0.1562190180282212, -0.07141378283914593, -0.21427022199338627, 0.08696058804967574, -0.04115274079912712, 0.16040432345240363, -0.137206654833068, 0.23306845440270585, -0.08849063945106334, 0.24276198112657146, 0.20817729795262926, 0.06157210336199829, 0.18238730681320978, 0.2020475663584731, 0.030420525500269992, 0.16195918036447393, 0.09029780193749401, -0.14234042892025578, -0.35118858746829484, -0.15568838436858698, -0.08424872511790858, -0.02249165632141133, -0.05636583168811667, -0.19993331741600756, 0.2840706090191527, 0.1502063027860242, 0.06020370060725817, 0.22149092094447936, 0.3287523062234478, 0.16808332637366322, 0.14553947333202122, -0.016538295185282118, 0.23522113467611017, 0.2247733176456735, 0.1360416181573999, -0.08346973263495971, 0.11890333202771014, 0.12751796358220635]
|
1,803.07314
|
Dual Polarized Modulation and Reception for Next Generation Mobile
Satellite Communications
|
This paper presents the novel application of Polarized Modulation (PMod) for
increasing the throughput in mobile satellite transmissions. One of the major
drawbacks in mobile satellite communications is the fact that the power budget
is often restrictive, making unaffordable to improve the spectral efficiency
without an increment of transmitted power. By using dual polarized antennas in
the transmitter and receiver, the PMod technique achieves an improvement in
throughput of up to $100$\% with respect to existing deployments, with an
increase of less than $1$ dB at low \ebn regime. Additionally, the proposed
scheme implies minimum hardware modifications with respect to the existing dual
polarized systems and does not require additional channel state information at
the transmitter; thus it can be used in current deployments. Demodulation (i.e.
detection and decoding) alternatives, with different processing complexity and
performance, are studied. The results are validated in a typical mobile
interactive scenario, the newest version of TS 102 744 standard (Broadband
Global Area Network (BGAN)), which aims to provide interactive mobile satellite
communications.
|
eess.SP cs.IT math.IT
|
this paper presents the novel application of polarized modulation pmod for increasing the throughput in mobile satellite transmissions one of the major drawbacks in mobile satellite communications is the fact that the power budget is often restrictive making unaffordable to improve the spectral efficiency without an increment of transmitted power by using dual polarized antennas in the transmitter and receiver the pmod technique achieves an improvement in throughput of up to 100 with respect to existing deployments with an increase of less than 1 db at low ebn regime additionally the proposed scheme implies minimum hardware modifications with respect to the existing dual polarized systems and does not require additional channel state information at the transmitter thus it can be used in current deployments demodulation ie detection and decoding alternatives with different processing complexity and performance are studied the results are validated in a typical mobile interactive scenario the newest version of ts 102 744 standard broadband global area network bgan which aims to provide interactive mobile satellite communications
|
[['this', 'paper', 'presents', 'the', 'novel', 'application', 'of', 'polarized', 'modulation', 'pmod', 'for', 'increasing', 'the', 'throughput', 'in', 'mobile', 'satellite', 'transmissions', 'one', 'of', 'the', 'major', 'drawbacks', 'in', 'mobile', 'satellite', 'communications', 'is', 'the', 'fact', 'that', 'the', 'power', 'budget', 'is', 'often', 'restrictive', 'making', 'unaffordable', 'to', 'improve', 'the', 'spectral', 'efficiency', 'without', 'an', 'increment', 'of', 'transmitted', 'power', 'by', 'using', 'dual', 'polarized', 'antennas', 'in', 'the', 'transmitter', 'and', 'receiver', 'the', 'pmod', 'technique', 'achieves', 'an', 'improvement', 'in', 'throughput', 'of', 'up', 'to', '100', 'with', 'respect', 'to', 'existing', 'deployments', 'with', 'an', 'increase', 'of', 'less', 'than', '1', 'db', 'at', 'low', 'ebn', 'regime', 'additionally', 'the', 'proposed', 'scheme', 'implies', 'minimum', 'hardware', 'modifications', 'with', 'respect', 'to', 'the', 'existing', 'dual', 'polarized', 'systems', 'and', 'does', 'not', 'require', 'additional', 'channel', 'state', 'information', 'at', 'the', 'transmitter', 'thus', 'it', 'can', 'be', 'used', 'in', 'current', 'deployments', 'demodulation', 'ie', 'detection', 'and', 'decoding', 'alternatives', 'with', 'different', 'processing', 'complexity', 'and', 'performance', 'are', 'studied', 'the', 'results', 'are', 'validated', 'in', 'a', 'typical', 'mobile', 'interactive', 'scenario', 'the', 'newest', 'version', 'of', 'ts', '102', '744', 'standard', 'broadband', 'global', 'area', 'network', 'bgan', 'which', 'aims', 'to', 'provide', 'interactive', 'mobile', 'satellite', 'communications']]
|
[-0.19052707339422062, 0.030428454229872007, -0.014011681895116179, 0.009933436328694005, -0.06296069860408778, -0.2070972657013001, 0.060527995257010164, 0.40068641610680555, -0.2452078351954869, -0.34900475562117533, 0.0987596252799508, -0.2764774592808233, -0.1145442986127937, 0.20923841102654941, -0.14937618251314067, 0.05168978607326129, 0.05388848392100669, 0.02613631085531935, -0.041735905325921946, -0.2921717593504237, 0.22717495093717288, 0.14809483390841524, 0.3594152205045054, 0.03211467673715491, 0.05942554631168519, 0.0066490810827390685, -0.01796095106838899, -0.05869359790744293, -0.06022694804341451, 0.1103663452303026, 0.29934757994074573, 0.17393174961473815, 0.24650379449966744, -0.42647972154105906, -0.2270091156469735, 0.08351039213056748, 0.15752040152989064, 0.027503497864480666, -0.047604213191124685, -0.255674947330111, 0.1597090107283745, -0.22782195017662055, -0.07596291014070473, 0.007427101753674139, -0.03980634406693941, 0.03856759953736906, -0.30671342430614246, 0.01441852873764359, 0.008923654633260072, 0.07087399293641014, -0.02175540043752001, -0.10963943192305473, 0.021137384127428722, 0.11752415472812422, 0.02066959193962786, 0.04623901417421056, 0.10562377743086827, -0.1324481640338964, -0.12809793043264447, 0.3638456666252449, -0.041182110585239934, -0.16172409239955268, 0.1866414508442725, -0.08448635123376652, -0.10318555837199533, 0.19102150663050146, 0.20024368773109813, 0.04995627657988401, -0.1360149880452357, 0.03308688945391149, 0.04433435618880166, 0.23379132142786443, 0.07216537540458892, 0.10567300110785345, 0.16193379749428238, 0.2026937448436163, 0.13203260633741787, 0.1136454698862508, -0.1326456194217923, -0.0802947028516654, -0.20712045593374578, -0.13640504397214914, -0.1975411749734218, 0.017133475370934514, -0.08765990334699349, -0.040258263700680266, 0.3494985391980286, 0.17378107546801133, 0.12515562322381993, 0.08942007981226972, 0.43387625331180335, 0.09233780232734824, 0.07794651954528495, 0.13036659568377368, 0.2320705506642013, 0.06171517977187928, 0.15435486035345716, -0.1816306384280324, 0.03562898449489527, -0.05311702747316756]
|
1,803.07315
|
Rapid Prototyping of Standard-Compliant Visible Light Communications
System
|
This article describes the implementation of a prototype visible light
communications system based on the IEEE 802.15.7 standard using low-cost
commercial off-the-shelf analog devices. The aim of this article is to show
that this standard provides a framework that could promote the introduction of
applications into the market. Thus, these specifications could be further
developed, reducing the gap between the industry and research communities. The
implemented prototype makes use of software defined radio platforms to
interface between the analog devices and the computer where the signal
processing is performed. The use of this concept provides the system with
enough flexibility and modularity to include new features in the prototype
without requiring long development time.
|
eess.SP cs.IT math.IT
|
this article describes the implementation of a prototype visible light communications system based on the ieee 802157 standard using lowcost commercial offtheshelf analog devices the aim of this article is to show that this standard provides a framework that could promote the introduction of applications into the market thus these specifications could be further developed reducing the gap between the industry and research communities the implemented prototype makes use of software defined radio platforms to interface between the analog devices and the computer where the signal processing is performed the use of this concept provides the system with enough flexibility and modularity to include new features in the prototype without requiring long development time
|
[['this', 'article', 'describes', 'the', 'implementation', 'of', 'a', 'prototype', 'visible', 'light', 'communications', 'system', 'based', 'on', 'the', 'ieee', '802157', 'standard', 'using', 'lowcost', 'commercial', 'offtheshelf', 'analog', 'devices', 'the', 'aim', 'of', 'this', 'article', 'is', 'to', 'show', 'that', 'this', 'standard', 'provides', 'a', 'framework', 'that', 'could', 'promote', 'the', 'introduction', 'of', 'applications', 'into', 'the', 'market', 'thus', 'these', 'specifications', 'could', 'be', 'further', 'developed', 'reducing', 'the', 'gap', 'between', 'the', 'industry', 'and', 'research', 'communities', 'the', 'implemented', 'prototype', 'makes', 'use', 'of', 'software', 'defined', 'radio', 'platforms', 'to', 'interface', 'between', 'the', 'analog', 'devices', 'and', 'the', 'computer', 'where', 'the', 'signal', 'processing', 'is', 'performed', 'the', 'use', 'of', 'this', 'concept', 'provides', 'the', 'system', 'with', 'enough', 'flexibility', 'and', 'modularity', 'to', 'include', 'new', 'features', 'in', 'the', 'prototype', 'without', 'requiring', 'long', 'development', 'time']]
|
[-0.14332172734123705, 0.017997563727763725, -0.0906885168964468, -0.0030206079378299285, -0.11552117850321035, -0.15156144075432135, 0.025207374530860728, 0.37750812609712675, -0.25619037971390707, -0.3416104848709023, 0.13603506327439263, -0.21266293772006115, -0.19403793402588027, 0.2557700583057707, -0.08092665018742545, 0.05621964563697315, 0.06739111622721937, -0.02066969311502027, -0.04220303007139336, -0.20908298810919454, 0.2413121504319031, 0.10410756779949001, 0.3393848096919164, 0.08789992071851566, 0.0737325306736717, 0.014441733505870951, -0.04072301171050129, -0.03452258001555476, -0.06619940053024677, 0.19714836045903594, 0.2809374574469729, 0.17886543317632586, 0.3143721109117267, -0.46948986830549283, -0.19099369685149245, 0.06562465740972313, 0.11260325785955055, 0.0491737447384941, -0.07965552187300075, -0.29397680644730206, 0.10282380222097824, -0.2314224245083894, -0.11703321453272733, -0.0477423196619687, -0.04218939863341419, 0.01980964989777197, -0.2240326966755419, -0.0467939146992489, 0.01583949076787879, 0.056413395738784684, 0.013199765330666611, -0.07067489460225038, 0.041468253894300575, 0.15856330626513482, -0.0044721000778831935, -0.006467032969292057, 0.14321967301759542, -0.09554744859863269, -0.13214790370119245, 0.39850155243715435, -0.056051032687128896, -0.145883053767887, 0.22044218424911888, -0.04523599477231568, -0.11002891457419058, 0.05714340102572909, 0.21037060983086886, 0.034097095718607306, -0.20301868934837872, 0.10090095937311273, 0.04465714961355716, 0.23371052693804367, 0.004639103444979379, 0.051328596993954034, 0.21619291146073424, 0.2739945268585232, 0.04806249172083641, 0.17250196730387152, -0.07346997398213205, -0.07098318215075619, -0.27302944706242305, -0.2172524832646575, -0.17840978855740997, -0.006786271590706811, -0.016242720942005816, -0.14013769229253134, 0.41230870467169506, 0.21826598707488493, 0.08856580625369884, 0.04777807140673854, 0.37241596831498963, 0.05042813907034303, 0.13163305529783348, 0.061154014512635115, 0.21413130885022774, 0.06260504639756523, 0.21044119029191502, -0.1609730636129123, 0.06148190260047845, 0.0012357456103097974]
|
1,803.07316
|
Numerical simulation of vortex-induced drag of elastic swimmer models
|
We present numerical simulations of simplified models for swimming organisms
or robots, using chordwise flexible elastic plates. We focus on the tip
vortices originating from three-dimensional effects due to the finite span of
the plate. These effects play an important role when predicting the swimmer's
cruising velocity, since they contribute significantly to the drag force. First
we simulate swimmers with rectangular plates of different aspect ratio and
compare the results with a recent experimental study. Then we consider plates
with expanding and contracting shapes. We find the cruising velocity of the
contracting swimmer to be higher than the rectangular one, which in turn is
higher than the expanding one. We provide some evidence that this result is due
to the tip vortices interacting differently with the swimmer.
|
physics.flu-dyn
|
we present numerical simulations of simplified models for swimming organisms or robots using chordwise flexible elastic plates we focus on the tip vortices originating from threedimensional effects due to the finite span of the plate these effects play an important role when predicting the swimmers cruising velocity since they contribute significantly to the drag force first we simulate swimmers with rectangular plates of different aspect ratio and compare the results with a recent experimental study then we consider plates with expanding and contracting shapes we find the cruising velocity of the contracting swimmer to be higher than the rectangular one which in turn is higher than the expanding one we provide some evidence that this result is due to the tip vortices interacting differently with the swimmer
|
[['we', 'present', 'numerical', 'simulations', 'of', 'simplified', 'models', 'for', 'swimming', 'organisms', 'or', 'robots', 'using', 'chordwise', 'flexible', 'elastic', 'plates', 'we', 'focus', 'on', 'the', 'tip', 'vortices', 'originating', 'from', 'threedimensional', 'effects', 'due', 'to', 'the', 'finite', 'span', 'of', 'the', 'plate', 'these', 'effects', 'play', 'an', 'important', 'role', 'when', 'predicting', 'the', 'swimmers', 'cruising', 'velocity', 'since', 'they', 'contribute', 'significantly', 'to', 'the', 'drag', 'force', 'first', 'we', 'simulate', 'swimmers', 'with', 'rectangular', 'plates', 'of', 'different', 'aspect', 'ratio', 'and', 'compare', 'the', 'results', 'with', 'a', 'recent', 'experimental', 'study', 'then', 'we', 'consider', 'plates', 'with', 'expanding', 'and', 'contracting', 'shapes', 'we', 'find', 'the', 'cruising', 'velocity', 'of', 'the', 'contracting', 'swimmer', 'to', 'be', 'higher', 'than', 'the', 'rectangular', 'one', 'which', 'in', 'turn', 'is', 'higher', 'than', 'the', 'expanding', 'one', 'we', 'provide', 'some', 'evidence', 'that', 'this', 'result', 'is', 'due', 'to', 'the', 'tip', 'vortices', 'interacting', 'differently', 'with', 'the', 'swimmer']]
|
[-0.1112344390346016, 0.18436902457049326, -0.0905041024308857, 0.0051647191326405235, -0.07091965519375806, -0.13691386492834903, -0.02891987726077672, 0.3898953481716669, -0.2126025449609252, -0.2833024869988284, 0.06699872322244878, -0.2596571611762542, -0.15699936912255727, 0.18671349916189145, -0.04844860228394547, -0.012047888062102354, 0.07364872604696535, -0.03908606592403527, -0.009871453291545878, -0.20072600422802886, 0.2908725866820575, 0.041219916842294875, 0.28102034072604354, 0.03584562328930094, 0.08673721944957268, -0.027282500925554534, -0.01974770531982301, 0.08539256310515751, -0.20266878100206726, 0.10068373561389451, 0.15931175400514552, -0.010479449452172348, 0.21871089801104285, -0.519855910923156, -0.1752143887842833, 0.10420151052659186, 0.1833383533516972, 0.14817285493009827, -0.0384280214198007, -0.2519756647222859, 0.03706054871362876, -0.14841215612777459, -0.1634247354708436, -0.022662508118105686, 0.0404616779350771, 0.07187495550588066, -0.21365783898174528, 0.0752106388383655, 0.04489645803361896, 0.0799256033249434, -0.08270938893208118, -0.10084829439489743, -0.01609217247735034, 0.14090793180361016, 0.10871304093959089, 0.023514580263666384, 0.20286735300869335, -0.1509766334898799, -0.05041561916096532, 0.4364956590075662, -0.04559394985819639, -0.23016679457088154, 0.2453542194937862, -0.16743588445370827, -0.03999362206526511, 0.13733444834406686, 0.22095010883548832, 0.10256304026500682, -0.06085361334860534, -0.037629539378933374, -0.06019043357672507, 0.12475862071343412, 0.09084133605113415, -0.06271959863617782, 0.23121150758660097, 0.19521814525516074, 0.06239319810511794, 0.1782761326611526, -0.10937844191340539, -0.0984674478023071, -0.2624955708087664, -0.14171455397571284, -0.11729780081054562, 0.003154766533430299, -0.10490213670400264, -0.16540318133500148, 0.33281705367166226, 0.16607595318708362, 0.20521374982891707, 0.05609665119444849, 0.31947213572662647, 0.06850375247180579, 0.07160450293733849, 0.0862659779267283, 0.3077876845305496, 0.09082030045880576, 0.1153509461863597, -0.23494000789364727, 0.03143383389591848, 0.056617391479062286]
|
1,803.07317
|
Influence of spin and charge fluctuations on spectra of the
two-dimensional Hubbard model
|
The influence of spin and charge fluctuations on spectra of the
two-dimensional fermionic Hubbard model is considered using the strong coupling
diagram technique. Infinite sequences of diagrams containing ladder inserts,
which describe the interaction of electrons with these fluctuations, are
summed, and obtained equations are self-consistently solved for the ranges of
Hubbard repulsions $2t\leq U\leq 10t$, temperatures $0.2t\lesssim T\lesssim t$
and electron concentrations $0.7\lesssim\bar{n}\leq1$ with $t$ the intersite
hopping constant. For all considered $U$ the system exhibits a transition to
the long-range antiferromagnetic order at $T_{\rm AF}\approx 0.2t$. At the same
time no indication of charge ordering is observed. Obtained solutions agree
satisfactorily with results of other approaches and obey moments sum rules. In
the considered region of the $U$-$T$ plane, the curve separating metallic
solutions passes from $U\approx6t$ at the highest temperatures to $U=2t$ at
$T\approx T_{\rm AF}$ for half-filling. If only short-range fluctuations are
allowed for the remaining part of this region is occupied by insulating
solutions. Taking into account long-range fluctuations leads to strengthening
of maxima tails, which transform a part of insulating solutions into bad-metal
states. For low $T$, obtained results allow us to trace the gradual transition
from the regime of strong correlations with the pronounced four-band structure
and well-defined Mott gap for $U\gtrsim6t$ to the Slater regime of weak
correlations with the spectral intensity having a dip along the boundary of the
magnetic Brillouin zone due to an antiferromagnetic ordering for $U\lesssim3t$.
For $T\approx T_{\rm AF}$ and $U\gtrsim 7t$ doping leads to the occurrence of a
pseudogap near the Fermi level, which is a consequence of the splitting out of
a narrow band from a Hubbard subband.
|
cond-mat.str-el
|
the influence of spin and charge fluctuations on spectra of the twodimensional fermionic hubbard model is considered using the strong coupling diagram technique infinite sequences of diagrams containing ladder inserts which describe the interaction of electrons with these fluctuations are summed and obtained equations are selfconsistently solved for the ranges of hubbard repulsions 2tleq uleq 10t temperatures 02tlesssim tlesssim t and electron concentrations 07lesssimbarnleq1 with t the intersite hopping constant for all considered u the system exhibits a transition to the longrange antiferromagnetic order at t_rm afapprox 02t at the same time no indication of charge ordering is observed obtained solutions agree satisfactorily with results of other approaches and obey moments sum rules in the considered region of the ut plane the curve separating metallic solutions passes from uapprox6t at the highest temperatures to u2t at tapprox t_rm af for halffilling if only shortrange fluctuations are allowed for the remaining part of this region is occupied by insulating solutions taking into account longrange fluctuations leads to strengthening of maxima tails which transform a part of insulating solutions into badmetal states for low t obtained results allow us to trace the gradual transition from the regime of strong correlations with the pronounced fourband structure and welldefined mott gap for ugtrsim6t to the slater regime of weak correlations with the spectral intensity having a dip along the boundary of the magnetic brillouin zone due to an antiferromagnetic ordering for ulesssim3t for tapprox t_rm af and ugtrsim 7t doping leads to the occurrence of a pseudogap near the fermi level which is a consequence of the splitting out of a narrow band from a hubbard subband
|
[['the', 'influence', 'of', 'spin', 'and', 'charge', 'fluctuations', 'on', 'spectra', 'of', 'the', 'twodimensional', 'fermionic', 'hubbard', 'model', 'is', 'considered', 'using', 'the', 'strong', 'coupling', 'diagram', 'technique', 'infinite', 'sequences', 'of', 'diagrams', 'containing', 'ladder', 'inserts', 'which', 'describe', 'the', 'interaction', 'of', 'electrons', 'with', 'these', 'fluctuations', 'are', 'summed', 'and', 'obtained', 'equations', 'are', 'selfconsistently', 'solved', 'for', 'the', 'ranges', 'of', 'hubbard', 'repulsions', '2tleq', 'uleq', '10t', 'temperatures', '02tlesssim', 'tlesssim', 't', 'and', 'electron', 'concentrations', '07lesssimbarnleq1', 'with', 't', 'the', 'intersite', 'hopping', 'constant', 'for', 'all', 'considered', 'u', 'the', 'system', 'exhibits', 'a', 'transition', 'to', 'the', 'longrange', 'antiferromagnetic', 'order', 'at', 't_rm', 'afapprox', '02t', 'at', 'the', 'same', 'time', 'no', 'indication', 'of', 'charge', 'ordering', 'is', 'observed', 'obtained', 'solutions', 'agree', 'satisfactorily', 'with', 'results', 'of', 'other', 'approaches', 'and', 'obey', 'moments', 'sum', 'rules', 'in', 'the', 'considered', 'region', 'of', 'the', 'ut', 'plane', 'the', 'curve', 'separating', 'metallic', 'solutions', 'passes', 'from', 'uapprox6t', 'at', 'the', 'highest', 'temperatures', 'to', 'u2t', 'at', 'tapprox', 't_rm', 'af', 'for', 'halffilling', 'if', 'only', 'shortrange', 'fluctuations', 'are', 'allowed', 'for', 'the', 'remaining', 'part', 'of', 'this', 'region', 'is', 'occupied', 'by', 'insulating', 'solutions', 'taking', 'into', 'account', 'longrange', 'fluctuations', 'leads', 'to', 'strengthening', 'of', 'maxima', 'tails', 'which', 'transform', 'a', 'part', 'of', 'insulating', 'solutions', 'into', 'badmetal', 'states', 'for', 'low', 't', 'obtained', 'results', 'allow', 'us', 'to', 'trace', 'the', 'gradual', 'transition', 'from', 'the', 'regime', 'of', 'strong', 'correlations', 'with', 'the', 'pronounced', 'fourband', 'structure', 'and', 'welldefined', 'mott', 'gap', 'for', 'ugtrsim6t', 'to', 'the', 'slater', 'regime', 'of', 'weak', 'correlations', 'with', 'the', 'spectral', 'intensity', 'having', 'a', 'dip', 'along', 'the', 'boundary', 'of', 'the', 'magnetic', 'brillouin', 'zone', 'due', 'to', 'an', 'antiferromagnetic', 'ordering', 'for', 'ulesssim3t', 'for', 'tapprox', 't_rm', 'af', 'and', 'ugtrsim', '7t', 'doping', 'leads', 'to', 'the', 'occurrence', 'of', 'a', 'pseudogap', 'near', 'the', 'fermi', 'level', 'which', 'is', 'a', 'consequence', 'of', 'the', 'splitting', 'out', 'of', 'a', 'narrow', 'band', 'from', 'a', 'hubbard', 'subband']]
|
[-0.17616406361978584, 0.20365366103094557, -0.04046804535506741, 0.06648049552538048, -0.006823249664542763, -0.15533081471527876, 0.10155376590809372, 0.35209977448938934, -0.24825515382384, -0.2648701789365255, 0.019784449397925903, -0.36072514300003533, -0.026787427761697007, 0.12047298878161727, 0.104726166809039, -0.04434558254923419, -0.020217109627363488, 0.0031205298325670114, -0.13287116022591472, -0.19643619167924808, 0.2881830861683431, 0.004480316238022668, 0.24496120213061795, 0.0959595406920994, 0.05971485257601274, 0.013662987674894581, 0.1206432625802787, 0.027680348405348405, -0.15430081469581036, -0.003537115876613661, 0.26169753894389297, -0.0811710237416866, 0.19594280706469977, -0.38849131966751993, -0.20397649646283275, 0.025657355249684332, 0.15489998248342732, 0.10116367583964861, -0.0008219052408121638, -0.3019031537346598, 0.034967199922014115, -0.14945624381412326, -0.15080337246829167, -0.07332960783072426, -0.0011798708759383054, 0.008596460979179781, -0.3103685579597477, 0.14493483343840877, 0.08274953425432996, 0.06676602782681584, -0.10486578968632791, -0.1362742628706129, -0.08025475684728445, 0.10330080631787755, 0.05763347221484156, 0.06248530280818774, 0.08260502708599643, -0.11393891015882389, -0.050331277210839596, 0.3497861778631428, -0.07203078421998657, -0.048972798664235734, 0.1705888720059459, -0.21685930535624406, -0.07163685421053236, 0.24424203513522766, 0.06842582746359863, 0.06253851823424711, -0.1208169041208037, 0.10938262832283192, 0.022621637598884508, 0.16477233831091484, 0.04315708808187759, 0.0633408165080788, 0.25519008026020673, 0.1430655638757337, 0.06440055033776741, 0.13472568112643457, -0.13600654755178507, -0.10496136205642015, -0.2788951682150924, -0.09567511724693266, -0.196899289545372, 0.01782766170974793, -0.08921707227541208, -0.1891236931831345, 0.4013821044901764, 0.13372740377601994, 0.2164510005189603, -0.003706679021006562, 0.1977443284043496, 0.16361305989606018, 0.0769612704630402, 0.07550626285496707, 0.21555612724768067, 0.15830845529602183, 0.12052106562935348, -0.2798782878527348, 0.04040977729158826, 0.07306767086834556]
|
1,803.07318
|
Link Adaptation Algorithms for Dual Polarization Mobile Satellite
Systems
|
The use of dual polarization in mobile satellite systems is very promising as
a means for increasing the transmission capacity. In this paper we study a
system which uses simultaneously two orthogonal polarizations in order to
communicate with the users. The application of MIMO signal processing
techniques along with Adaptive Coding and Modulation in the forward link can
provide remarkable throughput gains up to 100 % when compared with the single
polarization system. The gateway is allowed to vary the MIMO and Modulation and
Coding Schemes for each frame. The selection is done by means of a link
adaptation algorithm which uses a tunable margin to achieve a prede ned target
Frame Error Rate.
|
eess.SP cs.IT math.IT
|
the use of dual polarization in mobile satellite systems is very promising as a means for increasing the transmission capacity in this paper we study a system which uses simultaneously two orthogonal polarizations in order to communicate with the users the application of mimo signal processing techniques along with adaptive coding and modulation in the forward link can provide remarkable throughput gains up to 100 when compared with the single polarization system the gateway is allowed to vary the mimo and modulation and coding schemes for each frame the selection is done by means of a link adaptation algorithm which uses a tunable margin to achieve a prede ned target frame error rate
|
[['the', 'use', 'of', 'dual', 'polarization', 'in', 'mobile', 'satellite', 'systems', 'is', 'very', 'promising', 'as', 'a', 'means', 'for', 'increasing', 'the', 'transmission', 'capacity', 'in', 'this', 'paper', 'we', 'study', 'a', 'system', 'which', 'uses', 'simultaneously', 'two', 'orthogonal', 'polarizations', 'in', 'order', 'to', 'communicate', 'with', 'the', 'users', 'the', 'application', 'of', 'mimo', 'signal', 'processing', 'techniques', 'along', 'with', 'adaptive', 'coding', 'and', 'modulation', 'in', 'the', 'forward', 'link', 'can', 'provide', 'remarkable', 'throughput', 'gains', 'up', 'to', '100', 'when', 'compared', 'with', 'the', 'single', 'polarization', 'system', 'the', 'gateway', 'is', 'allowed', 'to', 'vary', 'the', 'mimo', 'and', 'modulation', 'and', 'coding', 'schemes', 'for', 'each', 'frame', 'the', 'selection', 'is', 'done', 'by', 'means', 'of', 'a', 'link', 'adaptation', 'algorithm', 'which', 'uses', 'a', 'tunable', 'margin', 'to', 'achieve', 'a', 'prede', 'ned', 'target', 'frame', 'error', 'rate']]
|
[-0.1995997096734344, 0.019623904851619647, -0.04425850051838443, -0.0035177887488461504, -0.07992113656900098, -0.21870776051160903, 0.11511865709145941, 0.4248881210136203, -0.28420216553902206, -0.28892312198877335, 0.08663033977546523, -0.23700849795137094, -0.14400695649437212, 0.1991506826165503, -0.10591758777741837, 0.07335703802682393, 0.043966997519910206, 0.06019772712241207, -0.05743414421557589, -0.2528391475129905, 0.26208355052363685, 0.12886493593718099, 0.3416271876477826, -0.033079695187311256, 0.12531691829393726, 0.04734075016680017, -0.033903612458534474, -0.014994154783147098, -0.06209361222284162, 0.14132814225946774, 0.30190930583110426, 0.12859235616994247, 0.25987446049343693, -0.3425315793076184, -0.22360629725797448, 0.057355395411100005, 0.17343928783604529, 0.09953685043239555, -0.06730240624628764, -0.25266330483147, 0.10852153497064009, -0.2141593331679706, -0.05009335865044093, -0.020306694871474025, -0.05723974861171657, 0.06469643972113531, -0.35746798851214084, -0.003772326547289844, -0.01949412447804239, 0.04966314157586446, -0.03528728571605036, -0.04811253582654867, 0.04904286142446892, 0.15396570080434863, 0.014240208817481071, 0.08340646749551911, 0.08310356251977846, -0.08758384003757244, -0.15072095680536818, 0.3767805871166355, -0.07511012530700197, -0.23588609088014448, 0.17407847943394322, -0.09086119544494535, -0.08603274255405814, 0.16253385157942507, 0.22503047317999983, 0.06014688719327735, -0.15180627644266542, 0.00870233706447947, 0.02246051918781173, 0.20894874831809934, 0.11991423284799783, 0.11672922719344167, 0.18850580617925564, 0.20747695139411473, 0.1146962386349925, 0.14980003663206853, -0.1303990345203062, -0.07726714703093687, -0.21992131121522557, -0.15972862341976932, -0.17944816759564972, -0.0160065324630885, -0.09849243785990752, -0.04663805991609012, 0.3802127182088067, 0.1300902107598639, 0.15689002758353554, 0.07419778358199494, 0.3707099162470714, 0.09040965558445922, 0.10167105751425291, 0.10334056846599664, 0.23304117347043732, 0.1345937085292607, 0.15810174104526836, -0.20084265567902146, 0.04685350080985015, -0.012299863275437228]
|
1,803.07319
|
Wigner measures and effective mass theorems
|
We study a semi-classical Schr{\"o}dinger equation which describes the
dynamics of an electron in a crystal in the presence of impurities. It is
well-known that under suitable assumptions on the initial data, the wave
function can be approximated in the semi-classical limit by the solution of a
simpler equation, the effective mass equation. Using Floquet-Bloch
decomposition and with a non-degeneracy condition on the critical points of the
Bloch bands, as it is classical in this subject, we establish effective mass
equations for more general initial data. Then, when the critical points are
degenerated (which may occur in dimension strictly larger than one), we prove
that a similar analysis can be performed, leading to a new type of effective
mass equations which are operator-valued and of Heisenberg form. Our analysis
relies on Wigner measure theory and, more precisely, to its applications to the
analysis of dispersion effects.
|
math.AP math-ph math.MP
|
we study a semiclassical schrodinger equation which describes the dynamics of an electron in a crystal in the presence of impurities it is wellknown that under suitable assumptions on the initial data the wave function can be approximated in the semiclassical limit by the solution of a simpler equation the effective mass equation using floquetbloch decomposition and with a nondegeneracy condition on the critical points of the bloch bands as it is classical in this subject we establish effective mass equations for more general initial data then when the critical points are degenerated which may occur in dimension strictly larger than one we prove that a similar analysis can be performed leading to a new type of effective mass equations which are operatorvalued and of heisenberg form our analysis relies on wigner measure theory and more precisely to its applications to the analysis of dispersion effects
|
[['we', 'study', 'a', 'semiclassical', 'schrodinger', 'equation', 'which', 'describes', 'the', 'dynamics', 'of', 'an', 'electron', 'in', 'a', 'crystal', 'in', 'the', 'presence', 'of', 'impurities', 'it', 'is', 'wellknown', 'that', 'under', 'suitable', 'assumptions', 'on', 'the', 'initial', 'data', 'the', 'wave', 'function', 'can', 'be', 'approximated', 'in', 'the', 'semiclassical', 'limit', 'by', 'the', 'solution', 'of', 'a', 'simpler', 'equation', 'the', 'effective', 'mass', 'equation', 'using', 'floquetbloch', 'decomposition', 'and', 'with', 'a', 'nondegeneracy', 'condition', 'on', 'the', 'critical', 'points', 'of', 'the', 'bloch', 'bands', 'as', 'it', 'is', 'classical', 'in', 'this', 'subject', 'we', 'establish', 'effective', 'mass', 'equations', 'for', 'more', 'general', 'initial', 'data', 'then', 'when', 'the', 'critical', 'points', 'are', 'degenerated', 'which', 'may', 'occur', 'in', 'dimension', 'strictly', 'larger', 'than', 'one', 'we', 'prove', 'that', 'a', 'similar', 'analysis', 'can', 'be', 'performed', 'leading', 'to', 'a', 'new', 'type', 'of', 'effective', 'mass', 'equations', 'which', 'are', 'operatorvalued', 'and', 'of', 'heisenberg', 'form', 'our', 'analysis', 'relies', 'on', 'wigner', 'measure', 'theory', 'and', 'more', 'precisely', 'to', 'its', 'applications', 'to', 'the', 'analysis', 'of', 'dispersion', 'effects']]
|
[-0.11647939552036306, 0.11477214346286181, -0.13630885701014162, 0.09933690516013423, -0.06964271920589628, -0.12493437532756528, 0.028111006043156073, 0.2941334138892285, -0.2401101974107019, -0.2419285279928311, 0.1138363181221082, -0.2801519236399805, -0.15144270698042356, 0.2168068926118008, -0.024222495732828975, 0.05535530382791241, 0.06604063580106076, 0.05390813074087444, -0.11826085032295588, -0.20670216568037614, 0.3768025048169601, 0.0005960390322573789, 0.27105482062484354, 0.04670718150039535, 0.07460595267882239, 0.020841900708970344, 0.04701299069621537, 0.01867457358038997, -0.1469810586363876, 0.10477272108713905, 0.20628728063407112, 0.0478565460453703, 0.26438391496657, -0.4216499060698568, -0.21794140144978483, 0.08294095957256241, 0.14057297932545412, 0.13288042389019072, -0.024905427542637894, -0.288669647368258, 0.0741099005099386, -0.10884138281068012, -0.20456163578488137, -0.08373683235649504, 0.010808709906796887, 0.020981923209771207, -0.2947402690371422, 0.11578005731569473, 0.06250991721395148, 0.01273178001100274, -0.10682937141255897, -0.0709372105958795, -0.03750958948153747, 0.05520310833566178, 0.04156875184877482, 0.026077392369138766, 0.08704433485798614, -0.09763622373878343, -0.046067634705862365, 0.400856272939414, -0.0860660336135244, -0.26905195866647647, 0.1603574879655466, -0.15177023293106012, -0.1090056098908288, 0.10562626008671543, 0.15741711032651812, 0.13142470401123307, -0.16494516571172377, 0.09730108049323412, -0.05871128196792585, 0.1581809209302476, 0.06225570042502798, 0.027730132904850994, 0.155553750209, 0.15730174874395694, 0.10423245465331903, 0.1116200238577894, -0.045489244190146765, -0.11747209247431323, -0.2971740864107245, -0.15257410567623805, -0.19632699245217014, 0.11522934075446133, -0.10442039775408961, -0.17981244582516995, 0.3910800812411926, 0.14640269144191023, 0.17426383252931785, 0.010257066000246583, 0.26651389429932587, 0.2245796739270477, 0.054068275924280845, 0.06242884831719917, 0.22443121981692232, 0.14916547921116222, 0.06908905340601014, -0.20497730200670097, 0.007595404705083738, 0.09264012665666435]
|
1,803.0732
|
The $H_0$ Tension in Non-flat QCDM Cosmology
|
The recent local measurement of Hubble constant leads to a more than
$3\sigma$ tension with Planck + $\Lambda$CDM (Riess {\it et al} 2018). In this
article we study the $H_0$ tension in non-flat QCDM cosmology, where Q stands
for a minimally coupled and slowly-or-moderately rolling quintessence field
$\phi$ with a smooth potential $V(\phi)$. By generalizing the QCDM
one-parameter and three-parameter parametrizations in Huang {\it et al} 2011 to
non-flat universe and using the latest cosmological data, we find that the
$H_0$ tension remains above $3.2\sigma$ level for this class of model.
|
astro-ph.CO gr-qc hep-ph
|
the recent local measurement of hubble constant leads to a more than 3sigma tension with planck lambdacdm riess it et al 2018 in this article we study the h_0 tension in nonflat qcdm cosmology where q stands for a minimally coupled and slowlyormoderately rolling quintessence field phi with a smooth potential vphi by generalizing the qcdm oneparameter and threeparameter parametrizations in huang it et al 2011 to nonflat universe and using the latest cosmological data we find that the h_0 tension remains above 32sigma level for this class of model
|
[['the', 'recent', 'local', 'measurement', 'of', 'hubble', 'constant', 'leads', 'to', 'a', 'more', 'than', '3sigma', 'tension', 'with', 'planck', 'lambdacdm', 'riess', 'it', 'et', 'al', '2018', 'in', 'this', 'article', 'we', 'study', 'the', 'h_0', 'tension', 'in', 'nonflat', 'qcdm', 'cosmology', 'where', 'q', 'stands', 'for', 'a', 'minimally', 'coupled', 'and', 'slowlyormoderately', 'rolling', 'quintessence', 'field', 'phi', 'with', 'a', 'smooth', 'potential', 'vphi', 'by', 'generalizing', 'the', 'qcdm', 'oneparameter', 'and', 'threeparameter', 'parametrizations', 'in', 'huang', 'it', 'et', 'al', '2011', 'to', 'nonflat', 'universe', 'and', 'using', 'the', 'latest', 'cosmological', 'data', 'we', 'find', 'that', 'the', 'h_0', 'tension', 'remains', 'above', '32sigma', 'level', 'for', 'this', 'class', 'of', 'model']]
|
[-0.08338292430055569, 0.10202596657987935, -0.05361532543137083, 0.020867710857223092, -0.14071322275911657, -0.183274015517424, 0.002121724477404038, 0.2833798230740796, -0.17112509599688014, -0.3459562580990657, -0.00920529136031322, -0.2905641681818145, -0.09111874452739786, 0.193960402126874, -0.06507659136262733, 0.028898327679322964, 0.027004923901698563, -0.06362322867544515, -0.03670360511325802, -0.3322568669590806, 0.30924616518608306, 0.14356657385491253, 0.23233188931526763, -0.02598237410564436, 0.046372953353690384, -0.05562373970143413, -0.05820390515113145, 0.05940101412909754, -0.30310943478686025, 0.04699373384937644, 0.16059601269505416, 0.10208953509965304, 0.2171162874385547, -0.31548249758413754, -0.25869241833629275, 0.2086723623012475, 0.07769225675513278, 0.13320514604219058, -0.03154449446962, -0.3156503795258952, -0.0018982604882428736, -0.17307295237950396, -0.11076738402310214, -0.014054212546541114, 0.07494656562810408, -0.11519306602893041, -0.2824940387358408, 0.2507172981067822, -0.035284723422040094, -0.003965522016116073, -0.08758325011500817, -0.08388721457358157, -0.037332796894558026, -0.06400890835806769, 0.047126205035045825, 0.17613804268060787, 0.08753638810823473, -0.13649123282370607, -0.02988059427903107, 0.3481160256634937, -0.15881496006338414, -0.13457830766676349, 0.12727707000240013, -0.1321153129003628, -0.18572742307265655, -0.011274390738834156, 0.07228143444138296, 0.011178773343877008, -0.13253808119909816, 0.2500781297815828, -0.013044832169674756, 0.1521184690966365, 0.11394520353504949, -0.13448460968642945, 0.2349339264832186, 0.133845502971096, 0.050171627742212184, 0.02386562241597122, -0.06372883067835185, -0.06205180523461882, -0.3671114659041501, -0.12640802145512445, -0.1169495547839095, 0.08557363024525595, -0.1384558011144936, -0.15859264611486304, 0.35417402462426867, 0.1242084697181924, 0.26538927485287356, 0.09147722148493434, 0.24603945129875388, 0.024874063637735467, -0.022319580404757615, 0.11707797985042581, 0.3443467367539873, 0.12465480228708115, 0.11242517137251208, -0.16719888533946922, -0.07177155070514366, 0.010402932674153133]
|
1,803.07321
|
Advanced Signal Processing Techniques for Fixed and Mobile Satellite
Communications
|
Enabling ultra fast systems has been widely investigated during recent
decades. Although polarization has been deployed from the beginning in
satellite communications, nowadays it is being exploited to increase the
throughput of satellite links. More precisely, the application of diversity
techniques to the polarization domain may provide reliable, robust, and fast
satellite communications. Better and more flexible spectrum use is also
possible if transmission and reception can take place simultaneously in close
or even overlapping frequency bands. In this paper we investigate novel signal
processing techniques to increase the throughput of satellite communications in
fixed and mobile scenarios. First, we investigate four-dimensional (4D)
constellations for the forward link. Second, we focus on the mobile scenario
and introduce an adaptive algorithm which selects the optimal tuple of
modulation order, coding rate, and MIMO scheme that maximizes the throughput
constraint to a maximum packet error rate. Finally, we describe the operation
of radio transceivers which cancel actively the self-interference posed by the
transmit signal when operating in full-duplex mode.
|
eess.SP cs.IT math.IT
|
enabling ultra fast systems has been widely investigated during recent decades although polarization has been deployed from the beginning in satellite communications nowadays it is being exploited to increase the throughput of satellite links more precisely the application of diversity techniques to the polarization domain may provide reliable robust and fast satellite communications better and more flexible spectrum use is also possible if transmission and reception can take place simultaneously in close or even overlapping frequency bands in this paper we investigate novel signal processing techniques to increase the throughput of satellite communications in fixed and mobile scenarios first we investigate fourdimensional 4d constellations for the forward link second we focus on the mobile scenario and introduce an adaptive algorithm which selects the optimal tuple of modulation order coding rate and mimo scheme that maximizes the throughput constraint to a maximum packet error rate finally we describe the operation of radio transceivers which cancel actively the selfinterference posed by the transmit signal when operating in fullduplex mode
|
[['enabling', 'ultra', 'fast', 'systems', 'has', 'been', 'widely', 'investigated', 'during', 'recent', 'decades', 'although', 'polarization', 'has', 'been', 'deployed', 'from', 'the', 'beginning', 'in', 'satellite', 'communications', 'nowadays', 'it', 'is', 'being', 'exploited', 'to', 'increase', 'the', 'throughput', 'of', 'satellite', 'links', 'more', 'precisely', 'the', 'application', 'of', 'diversity', 'techniques', 'to', 'the', 'polarization', 'domain', 'may', 'provide', 'reliable', 'robust', 'and', 'fast', 'satellite', 'communications', 'better', 'and', 'more', 'flexible', 'spectrum', 'use', 'is', 'also', 'possible', 'if', 'transmission', 'and', 'reception', 'can', 'take', 'place', 'simultaneously', 'in', 'close', 'or', 'even', 'overlapping', 'frequency', 'bands', 'in', 'this', 'paper', 'we', 'investigate', 'novel', 'signal', 'processing', 'techniques', 'to', 'increase', 'the', 'throughput', 'of', 'satellite', 'communications', 'in', 'fixed', 'and', 'mobile', 'scenarios', 'first', 'we', 'investigate', 'fourdimensional', '4d', 'constellations', 'for', 'the', 'forward', 'link', 'second', 'we', 'focus', 'on', 'the', 'mobile', 'scenario', 'and', 'introduce', 'an', 'adaptive', 'algorithm', 'which', 'selects', 'the', 'optimal', 'tuple', 'of', 'modulation', 'order', 'coding', 'rate', 'and', 'mimo', 'scheme', 'that', 'maximizes', 'the', 'throughput', 'constraint', 'to', 'a', 'maximum', 'packet', 'error', 'rate', 'finally', 'we', 'describe', 'the', 'operation', 'of', 'radio', 'transceivers', 'which', 'cancel', 'actively', 'the', 'selfinterference', 'posed', 'by', 'the', 'transmit', 'signal', 'when', 'operating', 'in', 'fullduplex', 'mode']]
|
[-0.23033997066134956, 0.04960941998742892, -0.03472146246035745, 0.037103237386954625, -0.08971409130044014, -0.20802703918889165, 0.09771507240700797, 0.4271577302154577, -0.264597224350461, -0.27911852191977515, 0.11982549596396637, -0.23027194341126003, -0.19505896425560607, 0.18672070036988014, -0.13462919331278406, 0.06712467125812155, 0.030530421549878166, 0.026472205835886713, -0.024622216303818886, -0.27658641755212837, 0.2437965497597606, 0.16464897129171624, 0.36357271024388466, 0.0035235276334210784, 0.07765339037527548, 0.040661887958656974, -0.0517149468926395, -0.07181027133162775, -0.10074404301980132, 0.08735459202253622, 0.319186771394473, 0.17660306245200114, 0.2629015617982992, -0.43896813338209767, -0.25069782425632736, 0.11702518361762813, 0.19184599520741755, 0.07609767661273792, -0.06071673409576238, -0.24598218004280578, 0.11862623175148836, -0.22414369873345613, -0.06499304299376638, -0.011087478599288016, -0.010776933374630655, 0.019707659481812693, -0.2921140088879609, 0.009728851150073011, -0.017968270888630143, 0.03259631553609036, -0.025565418819088245, -0.046621400692840355, 0.03193796909843644, 0.16248512134868456, 0.028184311924513407, 0.022509203604729234, 0.08107863189541027, -0.07522538781771157, -0.11636746400109767, 0.376929099738464, -0.015332565224286124, -0.1414896480008558, 0.172639446249399, -0.1257074364463793, -0.11985601487842773, 0.15347456323640968, 0.2666841919818324, 0.05623679511070608, -0.1689634882482668, 0.03867358083538376, 0.047981641935686506, 0.1895703832524087, 0.11301463332395265, 0.13366949802242264, 0.20331779066166522, 0.1893524823899933, 0.16153729136219014, 0.12133516280348608, -0.15868214301870923, -0.06637790700135625, -0.1729311856000634, -0.1253487767657254, -0.19374158848157225, -0.014339892031948366, -0.05173908153630397, -0.03953256818583001, 0.36343818903882125, 0.14693936657611542, 0.1284374870327831, 0.05258458673334987, 0.41534118710676887, 0.12839522783248547, 0.08839657288992744, 0.1099930200349361, 0.2655828465828895, 0.09001255138013177, 0.14604237854960347, -0.18735327230767113, 0.03602065247536531, -0.023181665083672292]
|
1,803.07322
|
Non-Abelian sigma models from Yang-Mills theory compactified on a circle
|
We consider SU($N$) Yang-Mills theory on ${\mathbb R}^{2,1}\times S^1$, where
$S^1$ is a spatial circle. In the infrared limit of a small-circle radius the
Yang-Mills action reduces to the action of a sigma model on ${\mathbb R}^{2,1}$
whose target space is a $2(N{-}1)$-dimensional torus modulo the Weyl-group
action. We argue that there is freedom in the choice of the framing of the
gauge bundles, which leads to more general options. In particular, we show that
this low-energy limit can give rise to a target space
SU$(N){\times}$SU$(N)/{\mathbb Z}_N$. The latter is the direct product of
SU($N$) and its Langlands dual SU$(N)/{\mathbb Z}_N$, and it contains the
above-mentioned torus as its maximal Abelian subgroup. An analogous result is
obtained for any non-Abelian gauge group.
|
hep-th math-ph math.MP
|
we consider sun yangmills theory on mathbb r21times s1 where s1 is a spatial circle in the infrared limit of a smallcircle radius the yangmills action reduces to the action of a sigma model on mathbb r21 whose target space is a 2n1dimensional torus modulo the weylgroup action we argue that there is freedom in the choice of the framing of the gauge bundles which leads to more general options in particular we show that this lowenergy limit can give rise to a target space suntimessunmathbb z_n the latter is the direct product of sun and its langlands dual sunmathbb z_n and it contains the abovementioned torus as its maximal abelian subgroup an analogous result is obtained for any nonabelian gauge group
|
[['we', 'consider', 'sun', 'yangmills', 'theory', 'on', 'mathbb', 'r21times', 's1', 'where', 's1', 'is', 'a', 'spatial', 'circle', 'in', 'the', 'infrared', 'limit', 'of', 'a', 'smallcircle', 'radius', 'the', 'yangmills', 'action', 'reduces', 'to', 'the', 'action', 'of', 'a', 'sigma', 'model', 'on', 'mathbb', 'r21', 'whose', 'target', 'space', 'is', 'a', '2n1dimensional', 'torus', 'modulo', 'the', 'weylgroup', 'action', 'we', 'argue', 'that', 'there', 'is', 'freedom', 'in', 'the', 'choice', 'of', 'the', 'framing', 'of', 'the', 'gauge', 'bundles', 'which', 'leads', 'to', 'more', 'general', 'options', 'in', 'particular', 'we', 'show', 'that', 'this', 'lowenergy', 'limit', 'can', 'give', 'rise', 'to', 'a', 'target', 'space', 'suntimessunmathbb', 'z_n', 'the', 'latter', 'is', 'the', 'direct', 'product', 'of', 'sun', 'and', 'its', 'langlands', 'dual', 'sunmathbb', 'z_n', 'and', 'it', 'contains', 'the', 'abovementioned', 'torus', 'as', 'its', 'maximal', 'abelian', 'subgroup', 'an', 'analogous', 'result', 'is', 'obtained', 'for', 'any', 'nonabelian', 'gauge', 'group']]
|
[-0.17180163729368483, 0.14732792198341516, -0.09327334306372072, 0.058491006998360906, -0.09199944070047315, -0.10033634601223494, 0.005990205926452803, 0.3621515799000734, -0.2086015841884523, -0.21135533116601346, 0.12333496779050804, -0.22930079779172896, -0.1350443409657998, 0.1436539283100547, -0.13360310576762222, -0.05311181554580577, -0.007495159218713892, 0.15489038943602634, -0.10899002178759948, -0.2550518849019368, 0.3088224386491132, -0.0245971244705074, 0.2356461196660432, 0.041008370588024874, 0.11993694950497764, 0.02399542205771353, 0.0033346123195120265, -0.03786221913604003, -0.12392804690330003, 0.12367363667561665, 0.20319804459998086, 0.058542398277801236, 0.15293377582199028, -0.3796004979018153, -0.2160092708732964, 0.16436948516088667, 0.14152464087066405, 0.043054138696674224, 0.025948093034412142, -0.2928061496325526, 0.04335021149531445, -0.16902194597891398, -0.18530059718730382, -0.03598872629315162, 0.07331452244783149, -0.07642016921411543, -0.26840802347835374, 0.006639607770157149, 0.07222761462213659, 0.06723696539695022, -0.043795311183692155, -0.06280964178897973, -0.08343430020760338, 0.09657004869253445, 0.10032194950656981, 0.14922877106162086, 0.13213001346575612, -0.16282246461379765, -0.0969350051307002, 0.4462024228287344, -0.10078576531949915, -0.23461421181940856, 0.1368249927749153, -0.1640212275205227, -0.17399381837971947, 0.13490166718202853, 0.08836936265887584, 0.16496723311945422, -0.03470807625841694, 0.22520074794487635, -0.17170430400003797, 0.1357893122931426, 0.04036761330393683, 0.02392995426237599, 0.19209046297151, 0.11345153838149546, 0.1279244967188467, 0.12230655494607798, -0.05723155357194047, -0.08331923399261441, -0.40404914501084, -0.16811882871586611, -0.11998901318195236, 0.16133325079362057, -0.14094821837615268, -0.13833331290491613, 0.35182003068792467, 0.1053567784515546, 0.1794271233898564, 0.0734581985640997, 0.17767952675265924, 0.12682129682859547, 0.06783846606883932, 0.06272301242585067, 0.1742815450029526, 0.16090676163424963, -0.04331711449605577, -0.22104573276817424, -0.11665367837134405, 0.1979978970338066]
|
1,803.07323
|
Intersecting branes, Higgs sector, and chirality from $\mathcal{N}=4$
SYM with soft SUSY breaking
|
We consider $SU(N)$ $\mathcal{N}=4$ super Yang-Mills with cubic and quadratic
soft SUSY breaking potential, such that the global $SU(4)_R$ is broken to
$SU(3)$ or further. As shown recently, this set-up supports a rich set of
non-trivial vacua with the geometry of self-intersecting $SU(3)$ branes in 6
extra dimensions. The zero modes on these branes can be interpreted as 3
generations of bosonic and chiral fermionic strings connecting the branes at
their intersections. Here, we uncover a large class of exact solutions
consisting of branes connected by Higgs condensates, leading to Yukawa
couplings between the chiral fermionic zero modes. Under certain decoupling
conditions, the backreaction of the Higgs on the branes vanishes exactly. The
resulting physics is that of a spontaneously broken chiral gauge theory on
branes with fluxes. In particular, we identify combined brane plus Higgs
configurations which lead to gauge fields that couple to chiral fermions at low
energy. This turns out to be quite close to the Standard Model and its
constructions via branes in string theory. As a by-product, we construct a
$G_2$-brane solution corresponding to a squashed fuzzy coadjoint orbit of
$G_2$.
|
hep-th
|
we consider sun mathcaln4 super yangmills with cubic and quadratic soft susy breaking potential such that the global su4_r is broken to su3 or further as shown recently this setup supports a rich set of nontrivial vacua with the geometry of selfintersecting su3 branes in 6 extra dimensions the zero modes on these branes can be interpreted as 3 generations of bosonic and chiral fermionic strings connecting the branes at their intersections here we uncover a large class of exact solutions consisting of branes connected by higgs condensates leading to yukawa couplings between the chiral fermionic zero modes under certain decoupling conditions the backreaction of the higgs on the branes vanishes exactly the resulting physics is that of a spontaneously broken chiral gauge theory on branes with fluxes in particular we identify combined brane plus higgs configurations which lead to gauge fields that couple to chiral fermions at low energy this turns out to be quite close to the standard model and its constructions via branes in string theory as a byproduct we construct a g_2brane solution corresponding to a squashed fuzzy coadjoint orbit of g_2
|
[['we', 'consider', 'sun', 'mathcaln4', 'super', 'yangmills', 'with', 'cubic', 'and', 'quadratic', 'soft', 'susy', 'breaking', 'potential', 'such', 'that', 'the', 'global', 'su4_r', 'is', 'broken', 'to', 'su3', 'or', 'further', 'as', 'shown', 'recently', 'this', 'setup', 'supports', 'a', 'rich', 'set', 'of', 'nontrivial', 'vacua', 'with', 'the', 'geometry', 'of', 'selfintersecting', 'su3', 'branes', 'in', '6', 'extra', 'dimensions', 'the', 'zero', 'modes', 'on', 'these', 'branes', 'can', 'be', 'interpreted', 'as', '3', 'generations', 'of', 'bosonic', 'and', 'chiral', 'fermionic', 'strings', 'connecting', 'the', 'branes', 'at', 'their', 'intersections', 'here', 'we', 'uncover', 'a', 'large', 'class', 'of', 'exact', 'solutions', 'consisting', 'of', 'branes', 'connected', 'by', 'higgs', 'condensates', 'leading', 'to', 'yukawa', 'couplings', 'between', 'the', 'chiral', 'fermionic', 'zero', 'modes', 'under', 'certain', 'decoupling', 'conditions', 'the', 'backreaction', 'of', 'the', 'higgs', 'on', 'the', 'branes', 'vanishes', 'exactly', 'the', 'resulting', 'physics', 'is', 'that', 'of', 'a', 'spontaneously', 'broken', 'chiral', 'gauge', 'theory', 'on', 'branes', 'with', 'fluxes', 'in', 'particular', 'we', 'identify', 'combined', 'brane', 'plus', 'higgs', 'configurations', 'which', 'lead', 'to', 'gauge', 'fields', 'that', 'couple', 'to', 'chiral', 'fermions', 'at', 'low', 'energy', 'this', 'turns', 'out', 'to', 'be', 'quite', 'close', 'to', 'the', 'standard', 'model', 'and', 'its', 'constructions', 'via', 'branes', 'in', 'string', 'theory', 'as', 'a', 'byproduct', 'we', 'construct', 'a', 'g_2brane', 'solution', 'corresponding', 'to', 'a', 'squashed', 'fuzzy', 'coadjoint', 'orbit', 'of', 'g_2']]
|
[-0.1731946691612688, 0.23689727000829236, -0.07363913902561368, 0.10422200124358406, -0.08534885481427852, -0.1923068207361408, 0.021663829681111146, 0.29422147329896686, -0.16972499248395498, -0.24260659518878203, 0.07280675233971025, -0.2733322323677508, -0.12296900372524318, 0.059026528711153846, -0.04156800743846877, 0.013344599149580038, -0.021326485746917694, 0.052563275019260676, -0.08674390890031448, -0.2802151783960997, 0.330336084700114, -0.040678871372664294, 0.26013131478071416, 0.05712555533344228, 0.10099123078901824, -0.03229043528412444, 0.06426306314187477, -0.003075600095798035, -0.11479721562114915, 0.08927710832197319, 0.20701058660508007, -0.002002767501147212, 0.06772429545888224, -0.46928235851731653, -0.1844737688834603, 0.12059250606878384, 0.18743505525729945, 0.16134821956763296, -0.0062623094987577285, -0.30617640851619277, 0.0968991692700247, -0.17744549318795672, -0.19630364950721127, -0.11298653055926332, -0.025541502932036244, -0.11440744732028327, -0.26341955022936736, 0.04100477054362764, 0.004088179848307894, 0.04624804007644589, -0.006988337938044522, -0.06944169162244007, -0.12788808972329355, 0.035327899739196575, 0.1696732477347895, 0.038348866845606955, 0.1150917043582209, -0.18818907506159835, -0.16526953212514117, 0.38055657177307717, -0.08489670940750355, -0.22868320604761105, 0.20425708103245377, -0.09944902663244992, -0.1563055501747373, 0.09972993776302885, 0.13356656931919625, 0.14363127604498202, -0.10307510925104489, 0.21546862007644205, -0.041925200077428205, 0.12517840716534773, 0.12806199816483502, 0.059830966496185675, 0.3311528612280617, 0.10544303353825533, 0.07930909424416117, 0.16585721040421442, -0.010442650286996787, -0.1421953489500526, -0.4208347535566301, -0.08259190868246495, -0.10381210794219294, 0.12698630202070785, -0.12538494842254394, -0.18372040397811656, 0.38361958667031815, 0.06488705994183751, 0.21672789792505068, 0.013142114605855298, 0.18974474881070894, 0.08019405154179392, 0.1054259209553837, 0.02395890875895684, 0.24815921078222125, 0.1690417253154305, 0.06010428121363794, -0.24937669054693165, -0.19304818016149708, 0.15991393981023214]
|
1,803.07324
|
Degenerations of SL(2,C) representations and Lyapunov exponents
|
We study the asymptotic behavior of the Lyapunov exponent in a meromorphic
family of random products of matrices in SL(2, C), as the parameter converges
to a pole. We show that the blow-up of the Lyapunov exponent is governed by a
quantity which can be interpreted as the non-Archimedean Lyapunov exponent of
the family. We also describe the limit of the corresponding family of
stationary measures on P 1 (C).
|
math.DS math.GT
|
we study the asymptotic behavior of the lyapunov exponent in a meromorphic family of random products of matrices in sl2 c as the parameter converges to a pole we show that the blowup of the lyapunov exponent is governed by a quantity which can be interpreted as the nonarchimedean lyapunov exponent of the family we also describe the limit of the corresponding family of stationary measures on p 1 c
|
[['we', 'study', 'the', 'asymptotic', 'behavior', 'of', 'the', 'lyapunov', 'exponent', 'in', 'a', 'meromorphic', 'family', 'of', 'random', 'products', 'of', 'matrices', 'in', 'sl2', 'c', 'as', 'the', 'parameter', 'converges', 'to', 'a', 'pole', 'we', 'show', 'that', 'the', 'blowup', 'of', 'the', 'lyapunov', 'exponent', 'is', 'governed', 'by', 'a', 'quantity', 'which', 'can', 'be', 'interpreted', 'as', 'the', 'nonarchimedean', 'lyapunov', 'exponent', 'of', 'the', 'family', 'we', 'also', 'describe', 'the', 'limit', 'of', 'the', 'corresponding', 'family', 'of', 'stationary', 'measures', 'on', 'p', '1', 'c']]
|
[-0.21162481653903212, 0.09861235209308299, -0.14419820025297148, 0.0556578019717043, -0.007058169884840026, -0.10931374614925257, 0.05306924783757755, 0.25025713558175733, -0.3200200254363673, -0.16308584956319205, 0.12415666503366082, -0.2823983896523714, -0.18816157717789922, 0.22580300949380866, -0.036652129349697915, 0.11097850320262036, -0.053538735064544846, 0.10967912933390056, -0.06118909245955625, -0.2088715455095683, 0.3895052440830373, -0.018239221815019847, 0.2177491923395012, 0.009466950355895927, 0.07658664947375655, -0.03431940313561686, -0.0001794374265175845, 0.02059382094802069, -0.19592078478859287, 0.07643871061237795, 0.23137555588036776, 0.09481376576503472, 0.24729862710727113, -0.2550901401521904, -0.15663763042539358, 0.17717067716377122, 0.18714425089502973, 0.012179422423443092, 0.03110817269189283, -0.27011112737735465, 0.13098078368763838, -0.17695136892476251, -0.239127573031666, -0.07553420761334044, 0.04938456895095961, 0.05909761764508273, -0.31407480144074984, 0.07665902277346634, 0.08215360338134425, 0.08785125013174755, -0.05729298345145902, -0.1035092143474945, -0.06090464404385005, 0.08549339231768889, 0.08457689741293767, 0.030676991429312954, 0.14421092635020613, -0.06262439316404718, -0.10882847039029002, 0.3010861245857086, -0.12018070308757679, -0.23706866720957415, 0.10861259730798857, -0.1932737943516778, -0.1379462664148637, 0.10389465470133083, 0.1895137387726988, 0.15083701446253275, -0.09049711120980126, 0.1883432211820036, -0.09287589002134544, 0.12669984457482183, 0.07231145887968264, 0.02985911932773888, 0.11463169962433832, 0.08436696811446122, 0.1104824412481061, 0.1766557768635851, -0.0261732520901465, -0.1352964011819235, -0.35711064924086844, -0.19454768185636828, -0.21659533580698606, 0.15967330077130878, -0.16656141459742294, -0.2101909877732396, 0.4460776809602976, 0.06663672141065555, 0.22886422513318913, 0.15056289008851828, 0.12780275765274252, 0.17686483423458413, 0.00929287471475878, 0.07233735465311579, 0.19014817539802087, 0.12566265693000916, 0.04827995612286031, -0.2112737638410181, 0.07829862970725766, 0.17046183446821359]
|
1,803.07325
|
NOMA Assisted Joint Broadcast and Multicast Transmission in 5G Networks
|
In this paper, we employ the non-orthogonal multiple access (NOMA) technique
to convey joint broadcast and multicast streams to a set of users. Thanks to
the spatial beamforming, different groups of users is able to receive different
streams in addition to the common broadcast information. With the proposed
scheme, the same time-frequency resources can be shared between different
streams, without requiring additional bandwidth. The transmitter implementation
is presented and two receiver classes are considered based on Successive
Interference Cancellation (SIC) and Joint Decoding (JD) approaches. In addition
to the performance assessment via simulation, a real hardware proof of concept
implementation of the proposed technique is performed in order to show the
practical viability of the proposed scheme.
|
eess.SP cs.IT math.IT
|
in this paper we employ the nonorthogonal multiple access noma technique to convey joint broadcast and multicast streams to a set of users thanks to the spatial beamforming different groups of users is able to receive different streams in addition to the common broadcast information with the proposed scheme the same timefrequency resources can be shared between different streams without requiring additional bandwidth the transmitter implementation is presented and two receiver classes are considered based on successive interference cancellation sic and joint decoding jd approaches in addition to the performance assessment via simulation a real hardware proof of concept implementation of the proposed technique is performed in order to show the practical viability of the proposed scheme
|
[['in', 'this', 'paper', 'we', 'employ', 'the', 'nonorthogonal', 'multiple', 'access', 'noma', 'technique', 'to', 'convey', 'joint', 'broadcast', 'and', 'multicast', 'streams', 'to', 'a', 'set', 'of', 'users', 'thanks', 'to', 'the', 'spatial', 'beamforming', 'different', 'groups', 'of', 'users', 'is', 'able', 'to', 'receive', 'different', 'streams', 'in', 'addition', 'to', 'the', 'common', 'broadcast', 'information', 'with', 'the', 'proposed', 'scheme', 'the', 'same', 'timefrequency', 'resources', 'can', 'be', 'shared', 'between', 'different', 'streams', 'without', 'requiring', 'additional', 'bandwidth', 'the', 'transmitter', 'implementation', 'is', 'presented', 'and', 'two', 'receiver', 'classes', 'are', 'considered', 'based', 'on', 'successive', 'interference', 'cancellation', 'sic', 'and', 'joint', 'decoding', 'jd', 'approaches', 'in', 'addition', 'to', 'the', 'performance', 'assessment', 'via', 'simulation', 'a', 'real', 'hardware', 'proof', 'of', 'concept', 'implementation', 'of', 'the', 'proposed', 'technique', 'is', 'performed', 'in', 'order', 'to', 'show', 'the', 'practical', 'viability', 'of', 'the', 'proposed', 'scheme']]
|
[-0.22160699482784313, -0.02576624259002443, -0.07168960093488741, 0.008506130914673464, -0.12154023527589619, -0.21098677347350514, 0.10402203651451561, 0.4204589021511567, -0.2666855456912492, -0.30488320397069824, 0.061069485998083636, -0.20960829839205894, -0.16749681017369542, 0.14272509901346558, -0.11163237893309158, 0.05509978449459657, 0.047142967821544625, 0.029343936385379896, -0.051401136037057794, -0.3153229096972057, 0.28922632054632735, 0.09953685088130908, 0.38777965603348535, 0.020644512727983996, 0.10324408181318137, 0.024845947698554676, -0.0831909568534575, -0.07546105418099552, -0.039864203005105764, 0.11316434487413901, 0.3318221737236644, 0.2215308220251105, 0.278592992374976, -0.4320838878520279, -0.24014807787811399, 0.06563900211730446, 0.1616488594102124, 0.08589268682731523, -0.05104026376393138, -0.2983811672311276, 0.1502936353914949, -0.222868740469074, 0.013698417283435408, -0.014670901240295388, -0.12225210155623081, 0.025706289511205804, -0.3562029678549649, -0.012863619706760615, -0.013798981773643157, 0.01686156634838344, -0.007834728150509106, -0.09858393023371632, 0.049335248225058116, 0.18937847109384134, 0.03305206199686051, -0.02034856295750405, 0.06326086521069081, -0.009424131894961763, -0.16700337225427994, 0.38041692847807884, 0.019698338596046798, -0.23787407907378724, 0.2255433603631667, -0.07299814349772711, -0.09912086105268672, 0.14960049006602386, 0.2473711324786035, 0.05637472974231992, -0.18841053487864348, -0.008357366572361058, 0.0009323869967180439, 0.17899416979306784, 0.11922361352281947, 0.13553685538120505, 0.12140714486416143, 0.15256314118130085, 0.08836363383337982, 0.1479479277667661, -0.1193809240586801, -0.1021652638944041, -0.23908268711499822, -0.1340359614477453, -0.23729932859030545, -0.05383667612496095, -0.08735533695009788, -0.06738602726035711, 0.39164875292349316, 0.19336692010585824, 0.11351733286984456, 0.0668704024492166, 0.4385529146489934, 0.045542618899698704, 0.08629256851262708, 0.12222269428575523, 0.1415488411887334, 0.09779128068500859, 0.121128910527185, -0.20547176563801864, 0.03640823509209813, 0.011855650239456922]
|
1,803.07326
|
Pushing for higher rates and efficiency in Satcom: the different
perspectives within SatNExIV
|
SatNEx IV project aims at studying medium and long term directions of
satellite telecommunication systems for any of the commercial or institutional
applications that can be considered appealing by key players although still not
mature enough for attracting industry or initiating dedicated ESA R&D
activities. This paper summarizes the first year activities identified as very
promising techniques for next generation satellite communication systems.
Concretely, very high throughput satellite trunking, physical layer advances
for full-duplex and multipolarization systems, network coding applications and
multiple access schemes for information centric networking are briefly
presented. For all the activities, we identify the scenarios under study so as
the preliminary technical solutions to be further investigated.
|
eess.SP cs.IT math.IT
|
satnex iv project aims at studying medium and long term directions of satellite telecommunication systems for any of the commercial or institutional applications that can be considered appealing by key players although still not mature enough for attracting industry or initiating dedicated esa rd activities this paper summarizes the first year activities identified as very promising techniques for next generation satellite communication systems concretely very high throughput satellite trunking physical layer advances for fullduplex and multipolarization systems network coding applications and multiple access schemes for information centric networking are briefly presented for all the activities we identify the scenarios under study so as the preliminary technical solutions to be further investigated
|
[['satnex', 'iv', 'project', 'aims', 'at', 'studying', 'medium', 'and', 'long', 'term', 'directions', 'of', 'satellite', 'telecommunication', 'systems', 'for', 'any', 'of', 'the', 'commercial', 'or', 'institutional', 'applications', 'that', 'can', 'be', 'considered', 'appealing', 'by', 'key', 'players', 'although', 'still', 'not', 'mature', 'enough', 'for', 'attracting', 'industry', 'or', 'initiating', 'dedicated', 'esa', 'rd', 'activities', 'this', 'paper', 'summarizes', 'the', 'first', 'year', 'activities', 'identified', 'as', 'very', 'promising', 'techniques', 'for', 'next', 'generation', 'satellite', 'communication', 'systems', 'concretely', 'very', 'high', 'throughput', 'satellite', 'trunking', 'physical', 'layer', 'advances', 'for', 'fullduplex', 'and', 'multipolarization', 'systems', 'network', 'coding', 'applications', 'and', 'multiple', 'access', 'schemes', 'for', 'information', 'centric', 'networking', 'are', 'briefly', 'presented', 'for', 'all', 'the', 'activities', 'we', 'identify', 'the', 'scenarios', 'under', 'study', 'so', 'as', 'the', 'preliminary', 'technical', 'solutions', 'to', 'be', 'further', 'investigated']]
|
[-0.16628366167050437, 0.06339482175305895, -0.006878033429896886, 0.06881464008132952, -0.06671416769316847, -0.20575073915063788, 0.05933845441023725, 0.4081570575816916, -0.2552120093119527, -0.2809177861813832, 0.17615571625769957, -0.26096331668641726, -0.182746091208724, 0.23882835350691453, -0.08930714593328741, 0.0733140311203897, 0.08186382102275934, -0.019883441422647294, 0.016228988922602678, -0.2761816676330129, 0.292757095357856, 0.12413543000509707, 0.32570658572906747, 0.04955123055356751, 0.055642196524102204, -0.008974750880835526, -0.08236871484598708, -0.035427932814671444, -0.09193861403604253, 0.12023177759138731, 0.3809380907599532, 0.17831480420630322, 0.3216948426337144, -0.45312788727086617, -0.2507121724718989, 0.06651187890610837, 0.17271697672870046, 0.04468635274439093, -0.1140388559481693, -0.2905129782274502, 0.10884443987075479, -0.24087275865427946, -0.13222966880170167, -0.07074210771419313, 0.03979154980374039, 0.05320311968061014, -0.23316362005585822, -0.06026870749758369, -0.008627093085216, 0.07778852507301154, -0.0423036164063704, -0.10415153390804835, 0.03172611769869787, 0.21348983197528526, 0.041289155688692195, 0.026838070735412247, 0.1282310758224996, -0.15532308635237807, -0.15629826629653984, 0.42718107471618494, -0.0026069147514452763, -0.08547623992102955, 0.21987803716750798, -0.07035501878452274, -0.23152069622274796, 0.05441238745671073, 0.2454720271554767, 0.05818430163444729, -0.2232324330204534, 0.02162765912175469, 0.049190363522038, 0.1520848570735575, 0.07248092575613922, 0.12362203675689637, 0.24478971779585704, 0.2291907712565137, 0.11265295474798581, 0.06574533464506678, -0.043942721082119766, -0.08248879693751864, -0.25178716288304914, -0.14710073919599415, -0.1441645148891631, 0.001871186631241463, -0.009283386875363708, -0.05167608876892049, 0.35362835707134405, 0.13965896881717352, 0.08673440811113206, 0.005487969647153118, 0.3674057207215543, 0.014743884476414377, 0.10546036767816051, 0.07530177220565464, 0.21839458285724112, 0.027247801947676033, 0.22236570312615928, -0.10957319426474187, 0.09543053731065962, -0.025500142997036766]
|
1,803.07327
|
Enhanced figure of merit in nanostructured (Bi, Sb) 2 Te 3 with
optimized composition, prepared by a straightforward arc-melting procedure
|
Sb-doped Bi2Te3 is known since the 1950s as the best thermoelectric material
for near-room temperature operation. Improvements in material performance are
expected from nanostructuring procedures. We present a straightforward and fast
method to synthesize already nanostructured pellets that show an enhanced ZT
due to a remarkably low thermal conductivity and unusually high Seebeck
coefficient for a nominal composition optimized for arc-melting:
Bi0.35Sb1.65Te3. We provide a detailed structural analysis of the Bi2-xSbxTe3
series based on neutron powder diffraction as a function of composition and
temperature that reveals the important role played by atomic vibrations.
Arc-melting produces layered platelets with less than 50 nm-thick sheets. The
low thermal conductivity is attributed to the phonon scattering at the grain
boundaries of the nanosheets. This is a fast and cost-effective production
method of highly efficient thermoelectric materials.
|
cond-mat.mtrl-sci
|
sbdoped bi2te3 is known since the 1950s as the best thermoelectric material for nearroom temperature operation improvements in material performance are expected from nanostructuring procedures we present a straightforward and fast method to synthesize already nanostructured pellets that show an enhanced zt due to a remarkably low thermal conductivity and unusually high seebeck coefficient for a nominal composition optimized for arcmelting bi035sb165te3 we provide a detailed structural analysis of the bi2xsbxte3 series based on neutron powder diffraction as a function of composition and temperature that reveals the important role played by atomic vibrations arcmelting produces layered platelets with less than 50 nmthick sheets the low thermal conductivity is attributed to the phonon scattering at the grain boundaries of the nanosheets this is a fast and costeffective production method of highly efficient thermoelectric materials
|
[['sbdoped', 'bi2te3', 'is', 'known', 'since', 'the', '1950s', 'as', 'the', 'best', 'thermoelectric', 'material', 'for', 'nearroom', 'temperature', 'operation', 'improvements', 'in', 'material', 'performance', 'are', 'expected', 'from', 'nanostructuring', 'procedures', 'we', 'present', 'a', 'straightforward', 'and', 'fast', 'method', 'to', 'synthesize', 'already', 'nanostructured', 'pellets', 'that', 'show', 'an', 'enhanced', 'zt', 'due', 'to', 'a', 'remarkably', 'low', 'thermal', 'conductivity', 'and', 'unusually', 'high', 'seebeck', 'coefficient', 'for', 'a', 'nominal', 'composition', 'optimized', 'for', 'arcmelting', 'bi035sb165te3', 'we', 'provide', 'a', 'detailed', 'structural', 'analysis', 'of', 'the', 'bi2xsbxte3', 'series', 'based', 'on', 'neutron', 'powder', 'diffraction', 'as', 'a', 'function', 'of', 'composition', 'and', 'temperature', 'that', 'reveals', 'the', 'important', 'role', 'played', 'by', 'atomic', 'vibrations', 'arcmelting', 'produces', 'layered', 'platelets', 'with', 'less', 'than', '50', 'nmthick', 'sheets', 'the', 'low', 'thermal', 'conductivity', 'is', 'attributed', 'to', 'the', 'phonon', 'scattering', 'at', 'the', 'grain', 'boundaries', 'of', 'the', 'nanosheets', 'this', 'is', 'a', 'fast', 'and', 'costeffective', 'production', 'method', 'of', 'highly', 'efficient', 'thermoelectric', 'materials']]
|
[-0.079308275286222, 0.15510456793764268, -0.08214904911787684, -0.015741281865434793, -0.048735478274410465, -0.12434194902427324, 0.10301726738182927, 0.4419244869633485, -0.2690148504792165, -0.2991892591061938, 0.06641436085542167, -0.31189999999194085, -0.1310575579200651, 0.28133390890167786, -0.01200599203469189, 0.06677350354068096, 0.027107675232789445, -0.08639346243158687, -0.08459813015549693, -0.21043842090453724, 0.19222908458878635, 0.15217412045609405, 0.344955968627891, 0.09686899866076996, 0.07422600658823743, -0.021369290093798902, 0.07200836392611848, 0.04561770426194745, -0.12308310043435092, 0.10141847822246433, 0.2699755182674595, -0.08421187699384293, 0.18091368024727997, -0.44608864769737683, -0.22661349547756765, -0.031155079217513895, 0.10943229983823786, 0.08116938224247167, -0.12443656181536245, -0.15138114979561731, 0.09275977918700465, -0.14922462466691855, -0.09555225140052556, -0.1298410858006309, 0.0057835183319642795, -0.027000256128011997, -0.2546498774202498, 0.09560253189073321, 0.05912284912072293, 0.08744022492959186, -0.09365377386939491, -0.20953812290388266, -0.03962268074974418, 0.027871447718410772, 0.02054923443116589, 0.006944749852685073, 0.22590868210576417, -0.11484886603501007, -0.04858325157342976, 0.40533249728552256, -0.058313911827481066, -0.05590342182687391, 0.18068054745165732, -0.15517126056561176, -0.06852059105396953, 0.2149563042859312, 0.12420579439157066, 0.14112224976198023, -0.19636846735419436, 0.00657204482997661, 0.02057771706768802, 0.19724250530632112, 0.08952902420601658, 0.06806824142326608, 0.2337431705802082, 0.2682975024602088, 0.02302021564887339, 0.1842801452406419, -0.09867694488200465, 0.06391478290795598, -0.16313775747886483, -0.21502630716147086, -0.20113906033251805, 0.08079642724363091, -0.11474359525991462, -0.2200713596006372, 0.34248997644300905, 0.13282624992563297, 0.16519098886722372, -0.04156633128788863, 0.26730883995094157, 0.0892845998182253, 0.09258030135564876, 0.03322472005997223, 0.2462436618454015, 0.1751112381159861, 0.16122056022002043, -0.2712640688747509, 0.1456760972301042, 0.006724622335199637]
|
1,803.07328
|
End-to-end 5G services via an SDN/NFV-based multi-tenant network and
cloud testbed
|
5G has a main requirement of highly flexible, ultralow latency and ultra-high
bandwidth virtualized infrastructure in order to deliver end-to-end services.
This requirement can be met by efficiently integrating all network segments
(radio access, aggregation and core) with heterogeneous wireless and optical
technologies (5G, mmWave, LTE/LTE-A, Wi-Fi, Ethernet, MPLS, WDM,
software-defined optical transmission, etc.), and massive computing and storage
cloud services (offered in edge/core data centers). This paper introduces the
preliminary architecture aiming at integrating three consolidated and
standalone experimental infrastructures at CTTC, in order to deploy the
required end-to-end top-to-bottom converged infrastructure pointed out above
for testing and developing advanced 5G services.
|
cs.NI cs.IT math.IT
|
5g has a main requirement of highly flexible ultralow latency and ultrahigh bandwidth virtualized infrastructure in order to deliver endtoend services this requirement can be met by efficiently integrating all network segments radio access aggregation and core with heterogeneous wireless and optical technologies 5g mmwave lteltea wifi ethernet mpls wdm softwaredefined optical transmission etc and massive computing and storage cloud services offered in edgecore data centers this paper introduces the preliminary architecture aiming at integrating three consolidated and standalone experimental infrastructures at cttc in order to deploy the required endtoend toptobottom converged infrastructure pointed out above for testing and developing advanced 5g services
|
[['5g', 'has', 'a', 'main', 'requirement', 'of', 'highly', 'flexible', 'ultralow', 'latency', 'and', 'ultrahigh', 'bandwidth', 'virtualized', 'infrastructure', 'in', 'order', 'to', 'deliver', 'endtoend', 'services', 'this', 'requirement', 'can', 'be', 'met', 'by', 'efficiently', 'integrating', 'all', 'network', 'segments', 'radio', 'access', 'aggregation', 'and', 'core', 'with', 'heterogeneous', 'wireless', 'and', 'optical', 'technologies', '5g', 'mmwave', 'lteltea', 'wifi', 'ethernet', 'mpls', 'wdm', 'softwaredefined', 'optical', 'transmission', 'etc', 'and', 'massive', 'computing', 'and', 'storage', 'cloud', 'services', 'offered', 'in', 'edgecore', 'data', 'centers', 'this', 'paper', 'introduces', 'the', 'preliminary', 'architecture', 'aiming', 'at', 'integrating', 'three', 'consolidated', 'and', 'standalone', 'experimental', 'infrastructures', 'at', 'cttc', 'in', 'order', 'to', 'deploy', 'the', 'required', 'endtoend', 'toptobottom', 'converged', 'infrastructure', 'pointed', 'out', 'above', 'for', 'testing', 'and', 'developing', 'advanced', '5g', 'services']]
|
[-0.27733783942747714, 0.019815906370971716, 0.06580282953184317, -0.019738697914826665, -0.07917446088429321, -0.2506566856960383, 0.09213536600131478, 0.45699475523011357, -0.23932611912160234, -0.2971333590993548, 0.1001633632124639, -0.24625467934061354, -0.13582962413327584, 0.16866756759255247, -0.0697583386893658, 0.1588647186336126, 0.07219614835876022, -0.10169826855645607, 0.014931707453512239, -0.26456666511355664, 0.2241018197576826, 0.1705785902746606, 0.44279523913328556, 0.13966142324109873, 0.043309131300524245, -0.04150487581843182, -0.08036633659218091, -0.11255178857234069, -0.024175161176233317, 0.2173147002992896, 0.44847635933946745, 0.2127047486822395, 0.3067545120138675, -0.5223395105487868, -0.2444966461637295, 0.06675240832527041, 0.21024772745794526, -0.03640012405630128, -0.028482668202224316, -0.29648360234740023, 0.1736792296704188, -0.33995260692694607, -0.1315464575035388, -0.03765618749985508, -0.05720287331325166, 0.06829993506692641, -0.2718525124238987, -0.0856187608773254, -0.11898160426347863, 0.043843419701956654, -0.03883152385242283, -0.03366737824170759, 0.022404843964157442, 0.1383816715667718, -0.0859043458876127, 0.01887196875359936, 0.17696699081901826, -0.12750677882657185, -0.0792954391708561, 0.4175930229727836, 0.060963404476733915, -0.09858379936229218, 0.165017471765168, 0.017101344344315723, -0.1779515805435093, 0.09708081163333583, 0.25808572653206246, -0.05901482426013578, -0.2537290275407334, 0.014809855367810302, 0.1158192785395145, 0.13941596424681882, 0.12156786602766563, 0.14763314899641508, 0.24914248382636145, 0.3287126021824923, 0.14875765365785829, 0.06724023900460452, -0.07680647215787686, -0.07254793182216293, -0.16726537308582634, -0.13862166803458012, -0.18933291109758155, 0.041492110323708725, -0.0847399457388925, -0.06996620521314588, 0.33184921434468717, 0.19764340026578045, 0.03951596813824247, 0.10623694221744788, 0.49234885477698315, 0.019570354954339564, 0.20164839673431262, 0.20931913753898412, 0.16117633295510256, -0.04413668818397484, 0.3081706169143538, -0.08758952155681875, 0.024898458299610543, -0.05157802757971427]
|
1,803.07329
|
Zero-sum stochastic differential games of generalized McKean-Vlasov type
*
|
We study zero-sum stochastic differential games where the state dynamics of
the two players is governed by a generalized McKean-Vlasov (or mean-field)
stochastic differential equation in which the distribution of both state and
controls of each player appears in the drift and diffusion coefficients, as
well as in the running and terminal payoff functions. We prove the dynamic
programming principle (DPP) in this general setting, which also includes the
control case with only one player, where it is the first time that DPP is
proved for open-loop controls. We also show that the upper and lower value
functions are viscosity solutions to a corresponding upper and lower Master
Bellman-Isaacs equation. Our results extend the seminal work of Fleming and
Souganidis [15] to the McKean-Vlasov setting.
|
math.PR math.OC
|
we study zerosum stochastic differential games where the state dynamics of the two players is governed by a generalized mckeanvlasov or meanfield stochastic differential equation in which the distribution of both state and controls of each player appears in the drift and diffusion coefficients as well as in the running and terminal payoff functions we prove the dynamic programming principle dpp in this general setting which also includes the control case with only one player where it is the first time that dpp is proved for openloop controls we also show that the upper and lower value functions are viscosity solutions to a corresponding upper and lower master bellmanisaacs equation our results extend the seminal work of fleming and souganidis 15 to the mckeanvlasov setting
|
[['we', 'study', 'zerosum', 'stochastic', 'differential', 'games', 'where', 'the', 'state', 'dynamics', 'of', 'the', 'two', 'players', 'is', 'governed', 'by', 'a', 'generalized', 'mckeanvlasov', 'or', 'meanfield', 'stochastic', 'differential', 'equation', 'in', 'which', 'the', 'distribution', 'of', 'both', 'state', 'and', 'controls', 'of', 'each', 'player', 'appears', 'in', 'the', 'drift', 'and', 'diffusion', 'coefficients', 'as', 'well', 'as', 'in', 'the', 'running', 'and', 'terminal', 'payoff', 'functions', 'we', 'prove', 'the', 'dynamic', 'programming', 'principle', 'dpp', 'in', 'this', 'general', 'setting', 'which', 'also', 'includes', 'the', 'control', 'case', 'with', 'only', 'one', 'player', 'where', 'it', 'is', 'the', 'first', 'time', 'that', 'dpp', 'is', 'proved', 'for', 'openloop', 'controls', 'we', 'also', 'show', 'that', 'the', 'upper', 'and', 'lower', 'value', 'functions', 'are', 'viscosity', 'solutions', 'to', 'a', 'corresponding', 'upper', 'and', 'lower', 'master', 'bellmanisaacs', 'equation', 'our', 'results', 'extend', 'the', 'seminal', 'work', 'of', 'fleming', 'and', 'souganidis', '15', 'to', 'the', 'mckeanvlasov', 'setting']]
|
[-0.09739810222387314, 0.05684846585895866, -0.09669677393883466, 0.0700554305538535, -0.06539993934705854, -0.1725429676026106, 0.049271617396268994, 0.2960020603686571, -0.3171460712365806, -0.2693937260657549, 0.1281221606582403, -0.2777003707997501, -0.17535422714985907, 0.16229721425287424, -0.07858963606506586, 0.0627429221663624, 0.02948387893848121, 0.03495811871439219, 0.005932184038683772, -0.25760864301770925, 0.33509163442254064, -0.016823798936791718, 0.2001217699199915, 0.029672747574746607, 0.16520429059118033, 0.018508914813399314, 0.019359770335257053, 0.02560415120050311, -0.1651288090540329, 0.0565033967718482, 0.25670633804798126, 0.0798450086619705, 0.34720361456274984, -0.3817478392869234, -0.17216872889362275, 0.0999694654531777, 0.08966355167655274, 0.1184665972534567, -0.00035061923507601024, -0.2766276584342122, 0.05017746044322848, -0.1387907733488828, -0.11278471948578954, -0.019703449789085427, 0.01174258415400982, 0.07557883131317794, -0.34600331059098244, 0.07055551273701713, 0.08672503992635756, -0.00557160430168733, -0.11500154976174236, -0.14808438697364182, -0.021764567956328393, 0.09699982433952391, 0.039235657254233954, -0.0027275141086429357, 0.09701167214289308, -0.14279603827465326, -0.16761315466463567, 0.32663685820996763, -0.12990025016665457, -0.2355030401647091, 0.15669129737094045, -0.17083708603307604, -0.11716085520759224, 0.09746271707862615, 0.17777433101087808, 0.2004013805706054, -0.18926900577545167, 0.10574938340205699, -0.07899656446278096, 0.14524649187549948, 0.058827641416341066, -0.006181557381059974, 0.03924377200752497, 0.16091354114376008, 0.17571141701191664, 0.12554025007598102, 0.011228958051651717, -0.23732215425372125, -0.32405593297630547, -0.1544308320954442, -0.14321471713483333, 0.07106881918013096, -0.1012921690151561, -0.11927191822975874, 0.3469150609523058, 0.12742175944894552, 0.1479846033975482, 0.12774286714382468, 0.2567988756634295, 0.23936862863879652, -0.03020601060241461, 0.11786052087228745, 0.2197650571167469, 0.14508858019299806, 0.14507499541342259, -0.22891977337002753, 0.12017595176771283, 0.09971125294733793]
|
1,803.0733
|
Helical vortices generated by flapping wings of bumblebees
|
High resolution direct numerical simulations of rotating and flapping
bumblebee wings are presented and their aerodynamics is studied focusing on the
role of leading edge vortices and the associated helicity production. We first
study the flow generated by only one rotating bumblebee wing in circular motion
with $45^{\circ}$ angle of attack. We then consider a model bumblebee flying in
a numerical wind tunnel, which is tethered and has rigid wings flapping with a
prescribed generic motion. The inflow condition of the wind varies from laminar
to strongly turbulent regimes. Massively parallel simulations show that inflow
turbulence does not significantly alter the wings' leading edge vortex (LEV),
which enhances lift production. Finally, we focus on studying the helicity of
the generated vortices and analyze their contribution at different scales using
orthogonal wavelets.
|
physics.flu-dyn
|
high resolution direct numerical simulations of rotating and flapping bumblebee wings are presented and their aerodynamics is studied focusing on the role of leading edge vortices and the associated helicity production we first study the flow generated by only one rotating bumblebee wing in circular motion with 45circ angle of attack we then consider a model bumblebee flying in a numerical wind tunnel which is tethered and has rigid wings flapping with a prescribed generic motion the inflow condition of the wind varies from laminar to strongly turbulent regimes massively parallel simulations show that inflow turbulence does not significantly alter the wings leading edge vortex lev which enhances lift production finally we focus on studying the helicity of the generated vortices and analyze their contribution at different scales using orthogonal wavelets
|
[['high', 'resolution', 'direct', 'numerical', 'simulations', 'of', 'rotating', 'and', 'flapping', 'bumblebee', 'wings', 'are', 'presented', 'and', 'their', 'aerodynamics', 'is', 'studied', 'focusing', 'on', 'the', 'role', 'of', 'leading', 'edge', 'vortices', 'and', 'the', 'associated', 'helicity', 'production', 'we', 'first', 'study', 'the', 'flow', 'generated', 'by', 'only', 'one', 'rotating', 'bumblebee', 'wing', 'in', 'circular', 'motion', 'with', '45circ', 'angle', 'of', 'attack', 'we', 'then', 'consider', 'a', 'model', 'bumblebee', 'flying', 'in', 'a', 'numerical', 'wind', 'tunnel', 'which', 'is', 'tethered', 'and', 'has', 'rigid', 'wings', 'flapping', 'with', 'a', 'prescribed', 'generic', 'motion', 'the', 'inflow', 'condition', 'of', 'the', 'wind', 'varies', 'from', 'laminar', 'to', 'strongly', 'turbulent', 'regimes', 'massively', 'parallel', 'simulations', 'show', 'that', 'inflow', 'turbulence', 'does', 'not', 'significantly', 'alter', 'the', 'wings', 'leading', 'edge', 'vortex', 'lev', 'which', 'enhances', 'lift', 'production', 'finally', 'we', 'focus', 'on', 'studying', 'the', 'helicity', 'of', 'the', 'generated', 'vortices', 'and', 'analyze', 'their', 'contribution', 'at', 'different', 'scales', 'using', 'orthogonal', 'wavelets']]
|
[-0.20187038975547403, 0.19699190172743591, -0.0335673445138995, 0.015611839973019393, -0.0959957435741338, -0.13365332586761877, -0.05666987932791919, 0.3729320555309523, -0.2588702296795508, -0.24770235430577214, 0.07041874200013246, -0.2296474168347266, -0.10940416237581095, 0.20977752754386542, -0.03212177329199062, 0.020032901604809153, 0.0942494087987615, -0.050852820877952655, 0.007516839415304192, -0.12533452397191058, 0.3083758493138918, 0.0671664246052276, 0.2958640361645522, 0.031047804352208858, 0.10450839993494157, -0.07262539647462714, -0.04974852261250796, 0.0562724033797174, -0.1781928003999473, 0.0543078241073562, 0.11343111543034609, 0.02502704935325203, 0.212215670263608, -0.47634451560505475, -0.18124436875734165, 0.04207502014380489, 0.20232002205350472, 0.10789450995076647, -0.05109581834714831, -0.27008368454532317, 0.06950202214759099, -0.19303025778930435, -0.16716068431038325, -0.026363121967705835, 0.025895960892031666, 0.062114431776945256, -0.2449222316641986, 0.07071958819603305, 0.04784149575608832, 0.09914541866217974, -0.034953835135937195, -0.019413960402660812, -0.11666304235993565, 0.07857397725300877, 0.1102761602320687, 0.023330047728408496, 0.22836870293822567, -0.18960013318067517, -0.1139466603897967, 0.4172812859662844, -0.050277250906441875, -0.22410385103768293, 0.2075740377647973, -0.21509539776755843, -0.053325675477678997, 0.17651611821057686, 0.20995814730733178, 0.1317801241832252, -0.031060767658623575, 0.005213379169874718, -0.07738408029705059, 0.10244528534075686, 0.12476579579418055, -0.07213621119122582, 0.24232344368458478, 0.14798230245240204, 0.053333180554865196, 0.1435985477598569, -0.17968975645285598, -0.1367425755757611, -0.2710521833416615, -0.10187330810737064, -0.12065622119769767, 0.008628037916465292, -0.06206083734431357, -0.15116493939244338, 0.38614814144111315, 0.1391541164133783, 0.17929210992799255, 0.024241615321401875, 0.3449516523245523, 0.09655768101464403, 0.01831357180894502, 0.1364730453289306, 0.29927959565414497, 0.13659893886456337, 0.1340904335228314, -0.2928943473699979, 0.031780729717255096, 0.06275898166256778]
|
1,803.07331
|
Low thermal conductivity in La-filled cobalt antimonide skutterudites
with an inhomogeneous filling factor prepared under high-pressure conditions
|
La-filled skutterudites LaxCo4Sb12 (x : 0.25 and 0.5) have been synthesized
and sintered in one step under high-pressure conditions at 3.5 GPa in a
piston-cylinder hydrostatic press. The structural properties of the reaction
products were characterized by synchrotron X-ray powder diffraction, clearly
showing an uneven filling factor of the skutterudite phases, confirmed by
transmission electron microscopy. The non-homogeneous distribution of La
filling atoms is adequate to produce a significant decrease in lattice thermal
conductivity, mainly due to strain field scattering of high-energy phonons.
Furthermore, the lanthanum filler primarily acts as an Einstein-like
vibrational mode having a strong impact on the phonon scattering. Extra-low
thermal conductivity values of 2.39 W/mK and 1.30 W/mK are measured for
La0.25Co4Sb12 and La0.5Co4Sb12 nominal compositions at 780 K, respectively.
Besides this, lanthanum atoms have contributed to increase the charge carrier
concentration in the samples. In the case of La0.25Co4Sb12, there is an
enhancement of the power factor and an improvement of the thermoelectric
properties.
|
cond-mat.mtrl-sci
|
lafilled skutterudites laxco4sb12 x 025 and 05 have been synthesized and sintered in one step under highpressure conditions at 35 gpa in a pistoncylinder hydrostatic press the structural properties of the reaction products were characterized by synchrotron xray powder diffraction clearly showing an uneven filling factor of the skutterudite phases confirmed by transmission electron microscopy the nonhomogeneous distribution of la filling atoms is adequate to produce a significant decrease in lattice thermal conductivity mainly due to strain field scattering of highenergy phonons furthermore the lanthanum filler primarily acts as an einsteinlike vibrational mode having a strong impact on the phonon scattering extralow thermal conductivity values of 239 wmk and 130 wmk are measured for la025co4sb12 and la05co4sb12 nominal compositions at 780 k respectively besides this lanthanum atoms have contributed to increase the charge carrier concentration in the samples in the case of la025co4sb12 there is an enhancement of the power factor and an improvement of the thermoelectric properties
|
[['lafilled', 'skutterudites', 'laxco4sb12', 'x', '025', 'and', '05', 'have', 'been', 'synthesized', 'and', 'sintered', 'in', 'one', 'step', 'under', 'highpressure', 'conditions', 'at', '35', 'gpa', 'in', 'a', 'pistoncylinder', 'hydrostatic', 'press', 'the', 'structural', 'properties', 'of', 'the', 'reaction', 'products', 'were', 'characterized', 'by', 'synchrotron', 'xray', 'powder', 'diffraction', 'clearly', 'showing', 'an', 'uneven', 'filling', 'factor', 'of', 'the', 'skutterudite', 'phases', 'confirmed', 'by', 'transmission', 'electron', 'microscopy', 'the', 'nonhomogeneous', 'distribution', 'of', 'la', 'filling', 'atoms', 'is', 'adequate', 'to', 'produce', 'a', 'significant', 'decrease', 'in', 'lattice', 'thermal', 'conductivity', 'mainly', 'due', 'to', 'strain', 'field', 'scattering', 'of', 'highenergy', 'phonons', 'furthermore', 'the', 'lanthanum', 'filler', 'primarily', 'acts', 'as', 'an', 'einsteinlike', 'vibrational', 'mode', 'having', 'a', 'strong', 'impact', 'on', 'the', 'phonon', 'scattering', 'extralow', 'thermal', 'conductivity', 'values', 'of', '239', 'wmk', 'and', '130', 'wmk', 'are', 'measured', 'for', 'la025co4sb12', 'and', 'la05co4sb12', 'nominal', 'compositions', 'at', '780', 'k', 'respectively', 'besides', 'this', 'lanthanum', 'atoms', 'have', 'contributed', 'to', 'increase', 'the', 'charge', 'carrier', 'concentration', 'in', 'the', 'samples', 'in', 'the', 'case', 'of', 'la025co4sb12', 'there', 'is', 'an', 'enhancement', 'of', 'the', 'power', 'factor', 'and', 'an', 'improvement', 'of', 'the', 'thermoelectric', 'properties']]
|
[-0.09698449156180121, 0.22533827791412, -0.041430888577475476, -0.05699950364323978, 0.009956858134554589, -0.09211876140785666, 0.1123758738432871, 0.4258040277640414, -0.26625768884444256, -0.29416467183653044, 0.027518050873719058, -0.3819586786447592, -0.03053672229901589, 0.17431309892266406, 0.005474831227188796, 0.007321631270434154, -0.03960708365623468, -0.04678292590759549, -0.0779230494715663, -0.2510654256325116, 0.2262993575579006, 0.12453564692568643, 0.3452042610159302, 0.10306042107088442, 0.052919576254983745, -0.01681350985712378, 0.0677425426741441, 0.023526964410896006, -0.15410138545649163, 0.03713231853261176, 0.258895364736079, -0.08735554971050447, 0.1769931110115174, -0.4040006230755715, -0.21735670557549966, -0.006140711386322829, 0.08932053207365029, 0.046750387006433185, -0.0811753126349775, -0.19787041403907138, 0.08012163294768387, -0.1394944775730122, -0.12143348299386893, -0.04775847334816467, 0.010000568331414042, -0.024359731673220406, -0.23647942793025983, 0.1351034157101774, 0.034232544633590316, 0.15587381666885336, -0.13980442161361376, -0.21310439265144418, -0.05208868384543879, 0.02391612072767434, 0.05116086715247994, 0.024539256795024913, 0.20932415416281597, -0.10490128582227805, -0.05377814130480188, 0.398148784353063, -0.05510681635681905, -0.022546001722171805, 0.13915233426039514, -0.18902493853457167, -0.0748884981875521, 0.27205575579850405, 0.10569365431548529, 0.07950862599354164, -0.1545953211721544, 0.046158967788857745, 0.014062719987218385, 0.22855738312724272, 0.15334752684739095, 0.04505047113238986, 0.19307462639765802, 0.17998398622814443, -0.01555437185905046, 0.14303016062944615, -0.1403060961024702, 0.056715321428830325, -0.17311585642202618, -0.17990757275340025, -0.1663134717053408, 0.11032149081842767, -0.11910270691613037, -0.15254065644580359, 0.3309884083037283, 0.07772544849537666, 0.16609856192314743, -0.07927402811964937, 0.21825726199940795, 0.1322733275249929, 0.06455548777744506, 0.0274910567742255, 0.27133055760074726, 0.2019150490839083, 0.13369557743867724, -0.27791889401052294, 0.07790614383331701, -0.03511063961975666]
|
1,803.07332
|
Dual Polarized Modulation and Receivers for Mobile Communications in
Urban Areas
|
Achieving an increase in the spectral efficiency (SE) has always been a major
driver in the design of communication systems. The use of MIMO techniques in
mobile communications has achieved significant benefits in improving the system
throughput. The basic underlying concept of MIMO is to exploit the signal and
channel characteristics to eliminate interference between multiple
transmissions. Departing from the work carried out under the industrial
projects \cite{NGW,Henarejos}, we extend the results provided in their
respective reports. The goal is to increase the SE without an increment of
radiated energy without any Channel State Information at Transmitter (CSIT) and
feedback at the transmitter and maintaining a very low computational complexity
at the receiver. Although a priori additional power is required to increase the
SE, we demonstrate that the proposed Polarized Modulation (PMod) scheme
exploits the polarization diversity reducing the required EbN0 and adding an
extra bit. We also introduce two receivers to demodulate this scheme of
different computational complexities. We describe a Near Optimal Detector (NOD)
which achieves almost the same performance as the optimal detector based on the
Maximum Likelihood Detection (MLD), but with lower computational complexity.
Finally, the results demonstrate that the PMod requires less EbN0 compared with
the single polarization case, guarantees the robustness in the presence of the
cross-polarization and validates that PMod can multiplex two streams of
different Quality of Service (QoS).
|
eess.SP cs.IT math.IT
|
achieving an increase in the spectral efficiency se has always been a major driver in the design of communication systems the use of mimo techniques in mobile communications has achieved significant benefits in improving the system throughput the basic underlying concept of mimo is to exploit the signal and channel characteristics to eliminate interference between multiple transmissions departing from the work carried out under the industrial projects citengwhenarejos we extend the results provided in their respective reports the goal is to increase the se without an increment of radiated energy without any channel state information at transmitter csit and feedback at the transmitter and maintaining a very low computational complexity at the receiver although a priori additional power is required to increase the se we demonstrate that the proposed polarized modulation pmod scheme exploits the polarization diversity reducing the required ebn0 and adding an extra bit we also introduce two receivers to demodulate this scheme of different computational complexities we describe a near optimal detector nod which achieves almost the same performance as the optimal detector based on the maximum likelihood detection mld but with lower computational complexity finally the results demonstrate that the pmod requires less ebn0 compared with the single polarization case guarantees the robustness in the presence of the crosspolarization and validates that pmod can multiplex two streams of different quality of service qos
|
[['achieving', 'an', 'increase', 'in', 'the', 'spectral', 'efficiency', 'se', 'has', 'always', 'been', 'a', 'major', 'driver', 'in', 'the', 'design', 'of', 'communication', 'systems', 'the', 'use', 'of', 'mimo', 'techniques', 'in', 'mobile', 'communications', 'has', 'achieved', 'significant', 'benefits', 'in', 'improving', 'the', 'system', 'throughput', 'the', 'basic', 'underlying', 'concept', 'of', 'mimo', 'is', 'to', 'exploit', 'the', 'signal', 'and', 'channel', 'characteristics', 'to', 'eliminate', 'interference', 'between', 'multiple', 'transmissions', 'departing', 'from', 'the', 'work', 'carried', 'out', 'under', 'the', 'industrial', 'projects', 'citengwhenarejos', 'we', 'extend', 'the', 'results', 'provided', 'in', 'their', 'respective', 'reports', 'the', 'goal', 'is', 'to', 'increase', 'the', 'se', 'without', 'an', 'increment', 'of', 'radiated', 'energy', 'without', 'any', 'channel', 'state', 'information', 'at', 'transmitter', 'csit', 'and', 'feedback', 'at', 'the', 'transmitter', 'and', 'maintaining', 'a', 'very', 'low', 'computational', 'complexity', 'at', 'the', 'receiver', 'although', 'a', 'priori', 'additional', 'power', 'is', 'required', 'to', 'increase', 'the', 'se', 'we', 'demonstrate', 'that', 'the', 'proposed', 'polarized', 'modulation', 'pmod', 'scheme', 'exploits', 'the', 'polarization', 'diversity', 'reducing', 'the', 'required', 'ebn0', 'and', 'adding', 'an', 'extra', 'bit', 'we', 'also', 'introduce', 'two', 'receivers', 'to', 'demodulate', 'this', 'scheme', 'of', 'different', 'computational', 'complexities', 'we', 'describe', 'a', 'near', 'optimal', 'detector', 'nod', 'which', 'achieves', 'almost', 'the', 'same', 'performance', 'as', 'the', 'optimal', 'detector', 'based', 'on', 'the', 'maximum', 'likelihood', 'detection', 'mld', 'but', 'with', 'lower', 'computational', 'complexity', 'finally', 'the', 'results', 'demonstrate', 'that', 'the', 'pmod', 'requires', 'less', 'ebn0', 'compared', 'with', 'the', 'single', 'polarization', 'case', 'guarantees', 'the', 'robustness', 'in', 'the', 'presence', 'of', 'the', 'crosspolarization', 'and', 'validates', 'that', 'pmod', 'can', 'multiplex', 'two', 'streams', 'of', 'different', 'quality', 'of', 'service', 'qos']]
|
[-0.19569599093659162, 0.01209177564698492, -0.039532801441320806, 0.007373161761263237, -0.04494930723521331, -0.1782839836272518, 0.09391575918194994, 0.3839219503055236, -0.24697878695942, -0.3414043629401883, 0.0743930229445326, -0.2776982364681574, -0.1332252925118654, 0.17021262907604398, -0.11939093442860398, 0.06076428481219007, 0.04741715867715204, 0.025320108846011283, -0.07461942547821003, -0.29104193298875525, 0.25058412025847465, 0.14796530914109662, 0.37139412605376765, 0.04875800211731534, 0.1165840953539035, 0.009036194879264959, -0.014455956703595884, -0.044394825090163806, -0.06793731882347519, 0.0963406389892365, 0.28625362700642604, 0.1992414861647577, 0.270970449364637, -0.41995695770117536, -0.21563678594054736, 0.08963018532047065, 0.1552218075169959, 0.0775601143308192, -0.051454624135207655, -0.22572846029806817, 0.13153290639186394, -0.18718384158389592, -0.058264215762183005, 0.009328829894662398, -0.08646625289034131, 0.027785250323515066, -0.2983098004499566, 0.00918839131654508, 0.04317112112174684, 0.059205826590315695, -0.03392491987041008, -0.1416788806657686, -0.011624485225441445, 0.15910211138930008, 0.029194230268363205, 0.00022194309487724595, 0.08100715213464532, -0.13421622254634358, -0.1312081096379655, 0.3399849362996926, -0.031368652015844094, -0.21021674345948, 0.1787773019214886, -0.12630317355011614, -0.09539177119773112, 0.20175065453250818, 0.2044638284344012, 0.029108012867761792, -0.12607965124379514, 0.03796815385913736, 0.03396305923177078, 0.24447385649571804, 0.0865455292457863, 0.12279854115073989, 0.12685613869998472, 0.20210932961287, 0.11401864088890432, 0.14845762935475307, -0.12401719033755197, -0.06169520641174332, -0.24028774739816924, -0.15312995884332609, -0.20408457352272935, -0.00038010533693024016, -0.10743070567052232, -0.042141065829787897, 0.37702419185521985, 0.16644326293973905, 0.12279949582746434, 0.09112505986204833, 0.38463942734607026, 0.10331564078847177, 0.046295542287458955, 0.115449631780353, 0.2591940597105623, 0.07184591563624552, 0.13693363250329044, -0.25933997734141767, 0.0861884043531377, -0.05435316697941615]
|
1,803.07333
|
Statistical evaluation of the azimuth and elevation angles seen at the
output of the receiving antenna
|
A method to evaluate the statistical properties of the reception angle seen
at the input receiver that considers the receiving antenna pattern is
presented. In particular, the impact of the direction and beamwidth of the
antenna pattern on distribution of the reception angle is shown on the basis of
3D simulation studies. The obtained results show significant differences
between distributions of angle of arrival and angle of reception. This means
that the presented new method allows assessing the impact of the receiving
antenna pattern on the correlation and spectral characteristics at the receiver
input in simulation studies of wireless channel. The use of this method also
provides an opportunity for analysis of a co-existence between small cells and
wireless backhaul, what is currently a significant problem in designing 5G
networks.
|
cs.IT math.IT
|
a method to evaluate the statistical properties of the reception angle seen at the input receiver that considers the receiving antenna pattern is presented in particular the impact of the direction and beamwidth of the antenna pattern on distribution of the reception angle is shown on the basis of 3d simulation studies the obtained results show significant differences between distributions of angle of arrival and angle of reception this means that the presented new method allows assessing the impact of the receiving antenna pattern on the correlation and spectral characteristics at the receiver input in simulation studies of wireless channel the use of this method also provides an opportunity for analysis of a coexistence between small cells and wireless backhaul what is currently a significant problem in designing 5g networks
|
[['a', 'method', 'to', 'evaluate', 'the', 'statistical', 'properties', 'of', 'the', 'reception', 'angle', 'seen', 'at', 'the', 'input', 'receiver', 'that', 'considers', 'the', 'receiving', 'antenna', 'pattern', 'is', 'presented', 'in', 'particular', 'the', 'impact', 'of', 'the', 'direction', 'and', 'beamwidth', 'of', 'the', 'antenna', 'pattern', 'on', 'distribution', 'of', 'the', 'reception', 'angle', 'is', 'shown', 'on', 'the', 'basis', 'of', '3d', 'simulation', 'studies', 'the', 'obtained', 'results', 'show', 'significant', 'differences', 'between', 'distributions', 'of', 'angle', 'of', 'arrival', 'and', 'angle', 'of', 'reception', 'this', 'means', 'that', 'the', 'presented', 'new', 'method', 'allows', 'assessing', 'the', 'impact', 'of', 'the', 'receiving', 'antenna', 'pattern', 'on', 'the', 'correlation', 'and', 'spectral', 'characteristics', 'at', 'the', 'receiver', 'input', 'in', 'simulation', 'studies', 'of', 'wireless', 'channel', 'the', 'use', 'of', 'this', 'method', 'also', 'provides', 'an', 'opportunity', 'for', 'analysis', 'of', 'a', 'coexistence', 'between', 'small', 'cells', 'and', 'wireless', 'backhaul', 'what', 'is', 'currently', 'a', 'significant', 'problem', 'in', 'designing', '5g', 'networks']]
|
[-0.21456709926647957, 0.03117277014456564, -0.05538310192955228, -0.0015104872702907484, -0.03674331554569877, -0.13340076505063245, 0.07859970170359772, 0.4162715616134497, -0.24475597578745623, -0.2923545140486497, 0.04305673638591543, -0.26176299167485784, -0.19661337995471861, 0.20074666732778915, -0.050429887116815036, 0.059933763054700995, 0.07779597027513843, 0.013719129025076444, -0.06223227947484702, -0.17018670480017764, 0.2881454296159343, 0.15197943741312395, 0.3721785948253595, 0.0698671293588212, 0.1039331164466253, 0.030687894518128953, -0.08420747496330967, -0.0313576881093188, -0.10234720000444213, 0.10185889842328974, 0.254545692096536, 0.18283744048542128, 0.24239133169086508, -0.3935803833632515, -0.23465447337008438, 0.06074758912078463, 0.1288641069460517, 0.058165910152288586, -0.0765673333295406, -0.25842357493865376, 0.08523768024214615, -0.176917065491076, -0.11187536089609448, 0.06074690153965583, -0.027856870165739494, 0.06270652056600039, -0.29671779163181783, 0.003528030271991156, -0.005032048257999122, 0.06062172641261266, -0.026926116545039874, -0.13036968402851087, 0.0009576740603034312, 0.1970842206098426, 0.06722266904006784, -0.004465560930279585, 0.08381300063517232, -0.12008567659957826, -0.08892367103253492, 0.39263847226706833, 0.0026719078896209024, -0.23330682434428196, 0.11939714235441688, -0.18951595363995202, -0.09054669550476739, 0.14230097718895054, 0.2536057332530618, 0.0718980197293254, -0.1309054418037144, 0.008225565469967057, -0.019610172635517443, 0.18671386676052443, 0.08842654324208314, 0.07686624853656843, 0.19183724582768402, 0.20818561418161083, 0.10105438756828125, 0.13385397761236303, -0.18800327974693992, -0.08658321697349983, -0.24061721881959014, -0.11874942157345895, -0.21414141614312449, -0.014185470793073853, -0.11538874868599053, -0.1042164875344427, 0.4369963880771628, 0.1663597447099164, 0.14473081896654688, 0.05157587638196464, 0.37938571868894194, 0.06438086027136215, 0.04821077811603363, 0.03464020187071023, 0.2528829924332408, 0.11466107794012015, 0.13316051247529687, -0.23564755738211365, 0.12117910595395817, -0.026921108999074652]
|
1,803.07334
|
Multi-wavelength campaign on NGC 7469 IV. The broad-band X-ray spectrum
|
We conducted a multi-wavelength six-month campaign to observe the Seyfert
galaxy NGC~7469, using the space-based observatories \textit{HST},
\textit{Swift}, \textit{XMM-Newton} and \textit{NuSTAR}. Here we report the
results of the spectral analysis of the 7 simultaneous \textit{XMM-Newton} and
\textit{NuSTAR} observations. The sources shows significant flux variability
within each observation, but the average flux is less variable among the
different pointings of our campaign. Our spectral analysis reveals a prominent
narrow neutral \ion{Fe} K$\alpha$ emission line in all the spectra, with weaker
contributions from Fe K$\beta$, neutral Ni K$\alpha$ and ionised iron. We find
no evidence for variability or relativistic effects acting on the emission
lines, which indicates that they originate from distant material. Analysing
jointly \textit{XMM-Newton} and \textit{NuSTAR} data a constant photon index is
found ($\Gamma$=$1.78\pm0.02$), together with a high energy cut-off
$E_{\rm{cut}}=170^{+60}_{-40}$ keV. Adopting a self-consistent Comptonization
model, these values correspond to an average coronal electron temperature of
kT=$45^{+15}_{-12}$ keV and, assuming a spherical geometry, an optical depth
$\tau=2.6\pm0.9$. The reflection component is consistent with being constant,
with a reflection fraction in the range $R=0.3-0.6$. A prominent soft excess
dominates the spectra below 4 keV. This is best fit with a second
Comptonization component, arising from a \virg{warm corona} with an average
$kT=0.67\pm0.03$ keV and a corresponding optical depth $\tau=9.2\pm0.2$.
|
astro-ph.GA astro-ph.HE
|
we conducted a multiwavelength sixmonth campaign to observe the seyfert galaxy ngc7469 using the spacebased observatories textithst textitswift textitxmmnewton and textitnustar here we report the results of the spectral analysis of the 7 simultaneous textitxmmnewton and textitnustar observations the sources shows significant flux variability within each observation but the average flux is less variable among the different pointings of our campaign our spectral analysis reveals a prominent narrow neutral ionfe kalpha emission line in all the spectra with weaker contributions from fe kbeta neutral ni kalpha and ionised iron we find no evidence for variability or relativistic effects acting on the emission lines which indicates that they originate from distant material analysing jointly textitxmmnewton and textitnustar data a constant photon index is found gamma178pm002 together with a high energy cutoff e_rmcut17060_40 kev adopting a selfconsistent comptonization model these values correspond to an average coronal electron temperature of kt4515_12 kev and assuming a spherical geometry an optical depth tau26pm09 the reflection component is consistent with being constant with a reflection fraction in the range r0306 a prominent soft excess dominates the spectra below 4 kev this is best fit with a second comptonization component arising from a virgwarm corona with an average kt067pm003 kev and a corresponding optical depth tau92pm02
|
[['we', 'conducted', 'a', 'multiwavelength', 'sixmonth', 'campaign', 'to', 'observe', 'the', 'seyfert', 'galaxy', 'ngc7469', 'using', 'the', 'spacebased', 'observatories', 'textithst', 'textitswift', 'textitxmmnewton', 'and', 'textitnustar', 'here', 'we', 'report', 'the', 'results', 'of', 'the', 'spectral', 'analysis', 'of', 'the', '7', 'simultaneous', 'textitxmmnewton', 'and', 'textitnustar', 'observations', 'the', 'sources', 'shows', 'significant', 'flux', 'variability', 'within', 'each', 'observation', 'but', 'the', 'average', 'flux', 'is', 'less', 'variable', 'among', 'the', 'different', 'pointings', 'of', 'our', 'campaign', 'our', 'spectral', 'analysis', 'reveals', 'a', 'prominent', 'narrow', 'neutral', 'ionfe', 'kalpha', 'emission', 'line', 'in', 'all', 'the', 'spectra', 'with', 'weaker', 'contributions', 'from', 'fe', 'kbeta', 'neutral', 'ni', 'kalpha', 'and', 'ionised', 'iron', 'we', 'find', 'no', 'evidence', 'for', 'variability', 'or', 'relativistic', 'effects', 'acting', 'on', 'the', 'emission', 'lines', 'which', 'indicates', 'that', 'they', 'originate', 'from', 'distant', 'material', 'analysing', 'jointly', 'textitxmmnewton', 'and', 'textitnustar', 'data', 'a', 'constant', 'photon', 'index', 'is', 'found', 'gamma178pm002', 'together', 'with', 'a', 'high', 'energy', 'cutoff', 'e_rmcut17060_40', 'kev', 'adopting', 'a', 'selfconsistent', 'comptonization', 'model', 'these', 'values', 'correspond', 'to', 'an', 'average', 'coronal', 'electron', 'temperature', 'of', 'kt4515_12', 'kev', 'and', 'assuming', 'a', 'spherical', 'geometry', 'an', 'optical', 'depth', 'tau26pm09', 'the', 'reflection', 'component', 'is', 'consistent', 'with', 'being', 'constant', 'with', 'a', 'reflection', 'fraction', 'in', 'the', 'range', 'r0306', 'a', 'prominent', 'soft', 'excess', 'dominates', 'the', 'spectra', 'below', '4', 'kev', 'this', 'is', 'best', 'fit', 'with', 'a', 'second', 'comptonization', 'component', 'arising', 'from', 'a', 'virgwarm', 'corona', 'with', 'an', 'average', 'kt067pm003', 'kev', 'and', 'a', 'corresponding', 'optical', 'depth', 'tau92pm02']]
|
[-0.05330549863982014, 0.09620875328451803, -0.03284856314770877, 0.07632590664958115, -0.06809766815975309, -0.11907132390420884, 0.04830722116515972, 0.485896100490354, -0.15255286269355564, -0.3622096717450768, 0.05807783313910477, -0.3792941229464486, 0.003837670482462272, 0.19596055527566933, 0.019267843662237282, -0.047906172199218416, 0.04469622405944392, -0.10017293503158725, -0.038295682158204725, -0.14446764316642657, 0.26990699249727185, 0.11631602398934775, 0.20189845341898036, 0.024629928055219352, 0.06829983293369878, -0.018090172415832058, -0.08630254836782114, 0.0007599010970443487, -0.08522358101694408, 0.09138129473663867, 0.21433292718138547, 0.0725658721482614, 0.19761676181940857, -0.319723934532376, -0.2510687750062789, 0.06845443866564892, 0.1308845291886246, -0.004983701971941628, -0.01976257858274039, -0.2544022469874471, -0.0041351474984548985, -0.16790272435871884, -0.1425110241258517, 0.06303400689270347, 0.013040376408025623, 0.008938012454891578, -0.24609697905601935, 0.12036836031591519, 0.010375365634536138, 0.12086000488314312, -0.16281277323025278, -0.09628858523559757, -0.03956016422249377, 0.05042858032276854, 0.06382555275515188, 0.026419437309959902, 0.14718127441126852, -0.08225036297894803, -0.08348818314727396, 0.366508521665819, -0.11061771124484948, 0.039389190051006155, 0.16607803730294107, -0.19386485047522, -0.18223953035660087, 0.2603150719916448, 0.10083680230891331, 0.09880983760827804, -0.10751704229740426, 0.02789825630839914, -0.06805411025183275, 0.32514855556830297, 0.0024431031302083283, 0.04760971359857649, 0.27094445647671817, 0.08777995920972899, 0.01449861951659841, 0.13367810231429758, -0.2591285637614783, 0.02316351335030049, -0.29566184316179717, -0.07640658900520066, -0.1096830778295407, 0.10937157028121874, -0.11099657416998525, -0.1490823143531452, 0.38085243504494426, 0.07995362493878928, 0.2470254104374908, 0.0005709383223438635, 0.32737489190883934, 0.1352570951927919, 0.05215817875694483, 0.12589089076034723, 0.31140695927198975, 0.13778139903675765, 0.11731231550333178, -0.21456531701740458, 0.014596130900317804, -0.023434625845402478]
|
1,803.07335
|
Forward Link Interference Mitigation in Mobile Interactive Satellite
Systems
|
We present the results of the performance evaluation of polarization-time
coding and soft interference cancellation in multi-beam satellite systems
affected by co-channel interference in realistic setups. The standard of
Broadband Global Area Network service (BGAN) has been considered as reference
for the physical layer and realistic interference and channel models have been
adopted. The work has been carried out in the framework of the Next Generation
Waveform for Increased Spectral Efficiency (NGWISE) project founded by the
European Space Agency (ESA).
|
eess.SP cs.IT math.IT
|
we present the results of the performance evaluation of polarizationtime coding and soft interference cancellation in multibeam satellite systems affected by cochannel interference in realistic setups the standard of broadband global area network service bgan has been considered as reference for the physical layer and realistic interference and channel models have been adopted the work has been carried out in the framework of the next generation waveform for increased spectral efficiency ngwise project founded by the european space agency esa
|
[['we', 'present', 'the', 'results', 'of', 'the', 'performance', 'evaluation', 'of', 'polarizationtime', 'coding', 'and', 'soft', 'interference', 'cancellation', 'in', 'multibeam', 'satellite', 'systems', 'affected', 'by', 'cochannel', 'interference', 'in', 'realistic', 'setups', 'the', 'standard', 'of', 'broadband', 'global', 'area', 'network', 'service', 'bgan', 'has', 'been', 'considered', 'as', 'reference', 'for', 'the', 'physical', 'layer', 'and', 'realistic', 'interference', 'and', 'channel', 'models', 'have', 'been', 'adopted', 'the', 'work', 'has', 'been', 'carried', 'out', 'in', 'the', 'framework', 'of', 'the', 'next', 'generation', 'waveform', 'for', 'increased', 'spectral', 'efficiency', 'ngwise', 'project', 'founded', 'by', 'the', 'european', 'space', 'agency', 'esa']]
|
[-0.17866275237144855, 0.004830820330729087, -0.04761783431212489, 0.05515472640474446, -0.031950165857919134, -0.11506515452399468, 0.07153054873327701, 0.4112751325353598, -0.18374625136717582, -0.3426811671696412, 0.1136970388977669, -0.23137048573997349, -0.16772201404838155, 0.18262719585058781, -0.097059703969325, 0.13383026741659984, 0.05075724058163663, -0.04201085161035641, -0.006748377291772228, -0.2376096631782368, 0.30307770742533297, 0.1887285357866532, 0.3945531909449551, 0.019917115604934785, 0.07551020342641725, -0.00038584786204573436, -0.1107582782025043, -0.02554414921196906, -0.07034578064504342, 0.07659887896182063, 0.27018208954788675, 0.16722032823898375, 0.2418434714946227, -0.43932920006605297, -0.32411453309349525, 0.05027319223452837, 0.1292765016357104, 0.02196753924139417, -0.06762916621011801, -0.32870992445028746, 0.05402993944545205, -0.28178956756033957, -0.05162393462915833, -0.016587878195330117, -0.013407101842741936, 0.019824790672805064, -0.2817374839184758, -0.008653474505990744, -0.0020390273525546757, 0.06020908313206373, -0.03430853456927416, -0.1306760982514765, 0.0034382380545139313, 0.2107461871436009, 0.016485474860438935, 0.021609475143635884, 0.08705376821065632, -0.10848803550918372, -0.1419107845554558, 0.4045525296137501, -0.047092512966348574, -0.13872781863961464, 0.12741024959578703, -0.10629123660664146, -0.143699172224539, 0.1328011665863391, 0.2129220365642164, 0.04377495817458018, -0.21279982323400104, 0.08819225790256706, 0.005592128011183097, 0.1449961814468201, 0.08801741403742479, 0.10385151237297134, 0.19963954816249987, 0.25552255614923364, 0.053174143719773456, 0.14873495834987038, -0.17829461042987158, -0.11852222129266757, -0.21427863555697677, -0.08634885197851616, -0.1810305578341612, -0.044911535731397376, -0.002324991578345175, -0.02916857848564784, 0.38870322743120295, 0.12750561507896352, 0.0511397991496592, -0.01790505874221428, 0.3828471184063416, 0.07493376245763965, 0.11312654544599354, 0.0198843436411176, 0.32335918532827723, 0.05564540632379552, 0.15139556739366247, -0.1910569803484787, 0.04942049896822144, -0.01243577311293055]
|
1,803.07336
|
Remark About Non-Relativistic String in Newton-Cartan Background and
Null Reduction
|
We analyze non-relativistic string in Newton-Cartan background that was found
recently in [arXiv:1705.03535 [hep-th]]. We find its Hamiltonian formulation
and study structure of constraints. We also discuss a relation between string
in Newton-Cartan Background and T-duality along null reduction.
|
hep-th
|
we analyze nonrelativistic string in newtoncartan background that was found recently in arxiv170503535 hepth we find its hamiltonian formulation and study structure of constraints we also discuss a relation between string in newtoncartan background and tduality along null reduction
|
[['we', 'analyze', 'nonrelativistic', 'string', 'in', 'newtoncartan', 'background', 'that', 'was', 'found', 'recently', 'in', 'arxiv170503535', 'hepth', 'we', 'find', 'its', 'hamiltonian', 'formulation', 'and', 'study', 'structure', 'of', 'constraints', 'we', 'also', 'discuss', 'a', 'relation', 'between', 'string', 'in', 'newtoncartan', 'background', 'and', 'tduality', 'along', 'null', 'reduction']]
|
[-0.17712237948159637, 0.10913820341719609, -0.1142189332872237, 0.16182404173243986, -0.12034372083450619, -0.11521314461960604, -0.0004515697640415869, 0.3707255137790191, -0.1792676114526234, -0.31000799077906105, -0.0317295112886074, -0.28060548887343, -0.25193571485579014, 0.0823564127479729, -0.09888898613127439, 0.004116777182054265, 0.0030047983715408727, 0.04815705315405993, -0.1847660697837311, -0.2120462308552018, 0.3135138818700063, 0.11282464518750969, 0.3435180461046433, 0.03382847815948097, 0.13310488483770505, -0.003021836280822754, -0.07547158029812731, 0.07516029635199199, -0.16912066765641948, 0.0602334295399487, 0.17917178828563346, 0.13575369381884994, 0.04646258044522256, -0.46503005666952385, -0.23598873737807335, 0.023690718556999377, 0.14770756534447796, 0.20949767927001967, -0.01163418567126715, -0.28191852491152913, 0.045937545376976856, -0.17921007181958934, -0.12432216925203408, -0.09593438946543947, 0.08130751648231556, -0.11687847938217026, -0.11520927700391774, 0.06136927357185509, 0.059907951588301284, 0.022172233996618735, -0.11664769379728425, 0.0053065435985397355, -0.04463465609832814, -0.019472767170028465, 0.186957516609446, 0.09489738913620577, 0.10367537484700351, -0.1440660219492489, -0.15421584797532936, 0.38862694951852683, -0.12567887904343047, -0.2524728413279119, 0.10651167536056355, -0.13985266583806247, -0.2794183143169472, -0.007768549637770967, 0.14063516857200548, 0.08638532077403445, -0.2106743641090457, 0.26815772448409053, -0.02507667150348425, 0.09161660290862385, 0.1551992390059719, 0.020665112502970977, 0.23828729099937176, 0.09089611284434795, 0.03042790089047661, 0.21846044573344683, -0.07834260904622313, -0.11986290771318109, -0.402870929750957, -0.16311001885486276, -0.040187775157392025, 0.0876544019342155, -0.08567927612258293, -0.13337880024980558, 0.290371372241919, 0.16226718534476517, 0.1803322338106993, 0.02171631561788289, 0.16541940346360207, 0.09398415312170982, -0.029868337730141848, 0.09496434856402247, 0.3083068322586386, 0.22551394582382941, 0.06959471278088658, -0.2671447887918667, -0.1962102804651582, 0.14750999371570192]
|
1,803.07337
|
An SDR Implementation of a Visible Light Communication System Based on
the IEEE 802.15.7 Standard
|
The aim of this paper is to present an implementation of a functional IEEE
802.15.7 real-time testbed based on the Software Defined Radio (SDR) concept.
This implementation is built with low cost commercial off-the-shelf (COTS)
analog devices and the use of Universal Software Radio Peripheral version 2
(USRP2) equipment combined with a generic object-oriented framework that takes
advantage of several open source software libraries. The prototype is validated
in a controlled laboratory environment with an over-the-air measurement
campaign.
|
eess.SP cs.IT math.IT
|
the aim of this paper is to present an implementation of a functional ieee 802157 realtime testbed based on the software defined radio sdr concept this implementation is built with low cost commercial offtheshelf cots analog devices and the use of universal software radio peripheral version 2 usrp2 equipment combined with a generic objectoriented framework that takes advantage of several open source software libraries the prototype is validated in a controlled laboratory environment with an overtheair measurement campaign
|
[['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'present', 'an', 'implementation', 'of', 'a', 'functional', 'ieee', '802157', 'realtime', 'testbed', 'based', 'on', 'the', 'software', 'defined', 'radio', 'sdr', 'concept', 'this', 'implementation', 'is', 'built', 'with', 'low', 'cost', 'commercial', 'offtheshelf', 'cots', 'analog', 'devices', 'and', 'the', 'use', 'of', 'universal', 'software', 'radio', 'peripheral', 'version', '2', 'usrp2', 'equipment', 'combined', 'with', 'a', 'generic', 'objectoriented', 'framework', 'that', 'takes', 'advantage', 'of', 'several', 'open', 'source', 'software', 'libraries', 'the', 'prototype', 'is', 'validated', 'in', 'a', 'controlled', 'laboratory', 'environment', 'with', 'an', 'overtheair', 'measurement', 'campaign']]
|
[-0.17295156410919169, -0.03658782032531841, -0.0737255244980005, -0.022895130693005063, -0.10854754911269993, -0.196893240737084, 0.004523830427131496, 0.4140714693139904, -0.2004427688482862, -0.3176032679919631, 0.1449822881900801, -0.19729891442096767, -0.14671449731283176, 0.28688414347095365, -0.08062960160896182, 0.07866492337332322, 0.10569413994343425, -0.04675573530869606, -0.02516497853325862, -0.1884374177107253, 0.2488150107390725, 0.15418790334549087, 0.3363546614582913, 0.056009891138483696, 0.09970153926107554, 0.009713352657854557, -0.051084110650639884, -0.038682175728564076, -0.02255809001778685, 0.15254207630044755, 0.3106867024818292, 0.2159840672288854, 0.3037240118182336, -0.43591413589624256, -0.1390157040590659, 0.0010983465502086359, 0.0769171893166808, 0.004983175402650466, -0.09157561629156892, -0.30382901025362885, 0.11377725094700089, -0.31587929462488645, -0.14036363388022904, 0.016235566181608308, -0.04819423804441706, 0.0037731696517230608, -0.22124345044199473, -0.08086964256989841, -0.042965322219504, 0.143852524805623, -0.03238936930910523, -0.07708372302257861, 0.07230118725401087, 0.12923050958376664, -0.08140671350814116, 0.05953890134174472, 0.20513710250797418, -0.026499908650293946, -0.16036925999782023, 0.36622585441009736, -0.04876906379388693, -0.14252766787719268, 0.2014199970409465, -0.003300849157266128, -0.17321939404624012, 0.07169028287992263, 0.22266262968799147, 0.0411474409346015, -0.25376258134985197, 0.1110816000246604, 0.008490559336048765, 0.25781193657819995, -0.0360851388794776, 0.018024847944243215, 0.146599817292717, 0.28607471923654276, 0.016260163637642294, 0.1779965017325221, -0.06489201892653886, -0.04019612388518185, -0.2836410550949856, -0.16519482704237676, -0.17937557138084698, 0.02404012551937157, -0.03904106626149046, -0.1596502683734378, 0.3808720574284402, 0.15472336815004475, 0.04075648911440602, 0.08906673667474817, 0.45051876684794057, 0.04646896972703055, 0.11091113389015962, 0.12892705649256897, 0.1551911636040761, 0.048066106353265546, 0.18125891241913614, -0.1767591632789192, 0.04143669521316695, 0.008860632013051938]
|
1,803.07338
|
The $\beta$-transformation with a hole at 0
|
For $\beta\in(1,2]$ the $\beta$-transformation $T_\beta: [0,1) \to [0,1)$ is
defined by $T_\beta ( x) = \beta x \pmod 1$. For $t\in[0, 1)$ let $K_\beta(t)$
be the survivor set of $T_\beta$ with hole $(0,t)$ given by
\[K_\beta(t):=\{x\in[0, 1): T_\beta^n(x)\not \in (0, t) \textrm{ for all }n\ge
0\}.\] In this paper we characterise the bifurcation set $E_\beta$ of all
parameters $t\in[0,1)$ for which the set valued function $t\mapsto K_\beta(t)$
is not locally constant. We show that $E_\beta$ is a Lebesgue null set of full
Hausdorff dimension for all $\beta\in(1,2)$. We prove that for Lebesgue almost
every $\beta\in(1,2)$ the bifurcation set $E_\beta$ contains both infinitely
many isolated and accumulation points arbitrarily close to zero. On the other
hand, we show that the set of $\beta\in(1,2)$ for which $E_\beta$ contains no
isolated points has zero Hausdorff dimension. These results contrast with the
situation for $E_2$, the bifurcation set of the doubling map. Finally, we give
for each $\beta \in (1,2)$ a lower and upper bound for the value $\tau_\beta$,
such that the Hausdorff dimension of $K_\beta(t)$ is positive if and only if
$t< \tau_\beta$. We show that $\tau_\beta \le 1-\frac1{\beta}$ for all $\beta
\in (1,2)$.
|
math.DS
|
for betain12 the betatransformation t_beta 01 to 01 is defined by t_beta x beta x pmod 1 for tin0 1 let k_betat be the survivor set of t_beta with hole 0t given by k_betatxin0 1 t_betanxnot in 0 t textrm for all nge 0 in this paper we characterise the bifurcation set e_beta of all parameters tin01 for which the set valued function tmapsto k_betat is not locally constant we show that e_beta is a lebesgue null set of full hausdorff dimension for all betain12 we prove that for lebesgue almost every betain12 the bifurcation set e_beta contains both infinitely many isolated and accumulation points arbitrarily close to zero on the other hand we show that the set of betain12 for which e_beta contains no isolated points has zero hausdorff dimension these results contrast with the situation for e_2 the bifurcation set of the doubling map finally we give for each beta in 12 a lower and upper bound for the value tau_beta such that the hausdorff dimension of k_betat is positive if and only if t tau_beta we show that tau_beta le 1frac1beta for all beta in 12
|
[['for', 'betain12', 'the', 'betatransformation', 't_beta', '01', 'to', '01', 'is', 'defined', 'by', 't_beta', 'x', 'beta', 'x', 'pmod', '1', 'for', 'tin0', '1', 'let', 'k_betat', 'be', 'the', 'survivor', 'set', 'of', 't_beta', 'with', 'hole', '0t', 'given', 'by', 'k_betatxin0', '1', 't_betanxnot', 'in', '0', 't', 'textrm', 'for', 'all', 'nge', '0', 'in', 'this', 'paper', 'we', 'characterise', 'the', 'bifurcation', 'set', 'e_beta', 'of', 'all', 'parameters', 'tin01', 'for', 'which', 'the', 'set', 'valued', 'function', 'tmapsto', 'k_betat', 'is', 'not', 'locally', 'constant', 'we', 'show', 'that', 'e_beta', 'is', 'a', 'lebesgue', 'null', 'set', 'of', 'full', 'hausdorff', 'dimension', 'for', 'all', 'betain12', 'we', 'prove', 'that', 'for', 'lebesgue', 'almost', 'every', 'betain12', 'the', 'bifurcation', 'set', 'e_beta', 'contains', 'both', 'infinitely', 'many', 'isolated', 'and', 'accumulation', 'points', 'arbitrarily', 'close', 'to', 'zero', 'on', 'the', 'other', 'hand', 'we', 'show', 'that', 'the', 'set', 'of', 'betain12', 'for', 'which', 'e_beta', 'contains', 'no', 'isolated', 'points', 'has', 'zero', 'hausdorff', 'dimension', 'these', 'results', 'contrast', 'with', 'the', 'situation', 'for', 'e_2', 'the', 'bifurcation', 'set', 'of', 'the', 'doubling', 'map', 'finally', 'we', 'give', 'for', 'each', 'beta', 'in', '12', 'a', 'lower', 'and', 'upper', 'bound', 'for', 'the', 'value', 'tau_beta', 'such', 'that', 'the', 'hausdorff', 'dimension', 'of', 'k_betat', 'is', 'positive', 'if', 'and', 'only', 'if', 't', 'tau_beta', 'we', 'show', 'that', 'tau_beta', 'le', '1frac1beta', 'for', 'all', 'beta', 'in', '12']]
|
[-0.1612494701409452, 0.1439413325153842, -0.021301433342629142, 0.05659585761504688, -0.0002868202369740253, -0.16805788471053043, 0.0674103298431052, 0.3295588551279438, -0.26103061866716193, -0.17067910662742072, 0.11269638353397929, -0.36594457017077553, -0.08276890233529591, 0.21378181562809054, -0.04283179387967202, 0.031998302507144145, 0.016669383739441712, 0.13780081690970047, -0.02718199208574069, -0.2626274940908276, 0.3480858206323358, -0.11859703149961968, 0.14559035219242095, 0.029275790402685763, 0.11805209865598308, -0.0185255742399022, 0.07451210276383946, 0.01805854050482633, -0.23375680677875812, 0.02034096047282219, 0.2290736012966923, 0.13824483606856697, 0.26072592646764814, -0.2755213603239647, -0.14191197652259582, 0.23410778055568376, 0.1426972700758607, -0.056349061390695475, 0.008703067297897032, -0.22056081050060883, 0.21179985963008416, -0.11369800405021036, -0.15873586105292922, -0.05208759025360147, 0.14789752685214563, 0.014202561594986467, -0.34726387913018386, 0.03618437118617998, 0.10265527996585093, 0.06672180761562495, -0.07312231122826536, -0.1698743405098456, -0.0700770027782788, 0.10593489672981142, -0.003382341650825354, 0.12227998192044055, 0.03791093928658063, -0.02440540886375182, -0.0761410478484987, 0.30000504332854944, -0.08395963605970234, -0.22993333295353197, 0.13333651439164093, -0.27973994221388093, -0.1708996614906937, 0.14153633890072664, 0.06015498614312971, 0.12683915393927725, -0.06440785388031633, 0.2180796775491833, -0.08941572355807469, 0.15541284177602538, 0.12992039605754838, -0.007609753219175443, 0.10321647325851104, 0.09932789528211679, 0.1743757636580486, 0.07594778667728577, -0.07074041031326057, 0.021310683848055942, -0.37660142937574975, -0.15381812798866992, -0.177959003622183, 0.16352755674644517, -0.12578138296959623, -0.19528639538373838, 0.307320752033403, 0.11406097326819505, 0.23481811474888556, 0.13277443926105456, 0.18391327547430192, 0.105252737537759, -0.02422835150988953, 0.12687112484127283, 0.12257323359259434, 0.07281652373457027, 0.0005031263190371695, -0.1292881657324371, 0.003536387657125791, 0.12523656510259776]
|
1,803.07339
|
Prototyping with SDR: a quick way to play with next-gen communications
systems
|
In this paper we present our approach regarding the implementation of new
wireless radio receiver exploiting filterbank techniques, using a
software-development driven approach. Since most of the common radio
communications systems share a similar structure, this can be exploited
creating a framework which provides a generic layout and tools to construct a
reconfigurable transmitter and/or receiver. By combining the use of the
Universal Software Radio Peripheral version 2 (USRP2) with a generic
object-oriented framework of our own built on top of the GNU Radio software
framework, we have been able to quickly implement a working proof of concept of
an Uplink (UL) Filterbank Multicarrier (FBMC) receiver, both for SingleInput
Single-Output (SISO) and Multiple-Input Multiple-Output (MIMO) scenario, within
the project of the 7th European framework called PHYDYAS. We described here the
methodology we have applied from software engineering in order to build this
demonstrator, which shows the suitability of using Software Defined Radio (SDR)
technologies for fast prototyping of new wireless communication systems.
|
eess.SP cs.IT math.IT
|
in this paper we present our approach regarding the implementation of new wireless radio receiver exploiting filterbank techniques using a softwaredevelopment driven approach since most of the common radio communications systems share a similar structure this can be exploited creating a framework which provides a generic layout and tools to construct a reconfigurable transmitter andor receiver by combining the use of the universal software radio peripheral version 2 usrp2 with a generic objectoriented framework of our own built on top of the gnu radio software framework we have been able to quickly implement a working proof of concept of an uplink ul filterbank multicarrier fbmc receiver both for singleinput singleoutput siso and multipleinput multipleoutput mimo scenario within the project of the 7th european framework called phydyas we described here the methodology we have applied from software engineering in order to build this demonstrator which shows the suitability of using software defined radio sdr technologies for fast prototyping of new wireless communication systems
|
[['in', 'this', 'paper', 'we', 'present', 'our', 'approach', 'regarding', 'the', 'implementation', 'of', 'new', 'wireless', 'radio', 'receiver', 'exploiting', 'filterbank', 'techniques', 'using', 'a', 'softwaredevelopment', 'driven', 'approach', 'since', 'most', 'of', 'the', 'common', 'radio', 'communications', 'systems', 'share', 'a', 'similar', 'structure', 'this', 'can', 'be', 'exploited', 'creating', 'a', 'framework', 'which', 'provides', 'a', 'generic', 'layout', 'and', 'tools', 'to', 'construct', 'a', 'reconfigurable', 'transmitter', 'andor', 'receiver', 'by', 'combining', 'the', 'use', 'of', 'the', 'universal', 'software', 'radio', 'peripheral', 'version', '2', 'usrp2', 'with', 'a', 'generic', 'objectoriented', 'framework', 'of', 'our', 'own', 'built', 'on', 'top', 'of', 'the', 'gnu', 'radio', 'software', 'framework', 'we', 'have', 'been', 'able', 'to', 'quickly', 'implement', 'a', 'working', 'proof', 'of', 'concept', 'of', 'an', 'uplink', 'ul', 'filterbank', 'multicarrier', 'fbmc', 'receiver', 'both', 'for', 'singleinput', 'singleoutput', 'siso', 'and', 'multipleinput', 'multipleoutput', 'mimo', 'scenario', 'within', 'the', 'project', 'of', 'the', '7th', 'european', 'framework', 'called', 'phydyas', 'we', 'described', 'here', 'the', 'methodology', 'we', 'have', 'applied', 'from', 'software', 'engineering', 'in', 'order', 'to', 'build', 'this', 'demonstrator', 'which', 'shows', 'the', 'suitability', 'of', 'using', 'software', 'defined', 'radio', 'sdr', 'technologies', 'for', 'fast', 'prototyping', 'of', 'new', 'wireless', 'communication', 'systems']]
|
[-0.19680250874953345, -0.019566792769819586, -0.06978308935576934, -0.008430611422954825, -0.10678863564389758, -0.2465673421655083, 0.034819582656928104, 0.4052079824206885, -0.22251880909097962, -0.2626001222641207, 0.11231185887445463, -0.16445248949894448, -0.23141898332432903, 0.22467684341172572, -0.08683956625027349, 0.07214433983099297, 0.0428953746210027, -0.06327122449001762, -0.04037538016709732, -0.19177380662040378, 0.276819057535613, 0.12455643056309781, 0.35524977183958983, -0.011021879732288653, 0.09920431379287038, 0.02545496294624172, -0.06218627582420595, -0.08355953794380185, -0.05522090840968304, 0.1665624500150443, 0.3671102396881906, 0.2662125753980945, 0.2808300358374254, -0.39946282013552264, -0.20515431597596034, 0.0355283687094925, 0.16439722071008872, 0.058626036798523275, -0.07985872078352259, -0.32845727549283765, 0.13249386230600066, -0.3372161745588528, -0.10077647835423705, 0.013535042371495365, -0.12182730664499104, 0.03414171222029836, -0.2749032831739896, -0.05270557538315188, 0.012245937714260436, 0.08821472862036898, -0.024516838176350576, -0.08719688680430408, 0.07710460764646995, 0.13824151730223094, -0.05910028544894885, 0.01299084158235928, 0.08969991729973117, -0.04536728826496983, -0.1581487950810697, 0.3826165729042259, -0.01178107941595954, -0.18990833615825978, 0.18590956837288103, -0.06027824168995721, -0.17455663629807533, 0.09677112498902715, 0.28933058353577507, 0.05805454093497246, -0.25028690117214863, 0.07411591011555174, 0.02065024260664359, 0.20308736675069666, 0.04417610830714693, 0.09901692643179558, 0.19158879605383844, 0.2482166878791759, 0.0760839430935448, 0.17634968898710213, -0.11780357308307429, -0.07462219869485125, -0.2263530145981349, -0.13955566519289278, -0.19373810872493777, 0.015594371961196885, -0.035418807351197755, -0.11973055021371692, 0.4173178645782173, 0.1698798653727863, 0.03976356818457134, 0.09998720471576235, 0.40790340551175175, 0.06989982016821158, 0.11681824777479051, 0.16026552154216916, 0.18175491751244408, 0.12474877029453638, 0.18394422752899117, -0.15415682220263988, 0.01495235369366128, -0.01379702407593868]
|
1,803.0734
|
Efficient Robust Model Predictive Control using Chordality
|
In this paper we show that chordal structure can be used to devise efficient
optimization methods for robust model predictive control problems. The chordal
structure is used both for computing search directions efficiently as well as
for distributing all the other computations in an interior-point method for
solving the problem. The framework enables efficient parallel computations.
|
math.OC
|
in this paper we show that chordal structure can be used to devise efficient optimization methods for robust model predictive control problems the chordal structure is used both for computing search directions efficiently as well as for distributing all the other computations in an interiorpoint method for solving the problem the framework enables efficient parallel computations
|
[['in', 'this', 'paper', 'we', 'show', 'that', 'chordal', 'structure', 'can', 'be', 'used', 'to', 'devise', 'efficient', 'optimization', 'methods', 'for', 'robust', 'model', 'predictive', 'control', 'problems', 'the', 'chordal', 'structure', 'is', 'used', 'both', 'for', 'computing', 'search', 'directions', 'efficiently', 'as', 'well', 'as', 'for', 'distributing', 'all', 'the', 'other', 'computations', 'in', 'an', 'interiorpoint', 'method', 'for', 'solving', 'the', 'problem', 'the', 'framework', 'enables', 'efficient', 'parallel', 'computations']]
|
[-0.0706890260335058, -0.014593973059163545, -0.08376705219104354, 0.10400918739781316, -0.11623767064052767, -0.1889774790033698, -0.006823729247636428, 0.4549280228592189, -0.3778227960823902, -0.3514750108588487, 0.1418905706265962, -0.19117748460433046, -0.18242629524320364, 0.27771346928784624, -0.024873357665325915, 0.14846442378724792, 0.10538224207370409, -0.05869179902531739, -0.060607703880772794, -0.2402257450739853, 0.20972179755335674, 0.06000221963040531, 0.2994644977318655, 0.04253474051698244, 0.07683695106866903, 0.044430553717705025, -0.0014309566218539008, 0.06815099001063832, -0.07150382987687667, 0.19500891797568848, 0.35026927571743727, 0.20280359153236663, 0.29017605766421184, -0.432559529219621, -0.19477238126897387, 0.12910873755546554, 0.2220033728517592, 0.147786757110485, -0.053505300145064084, -0.18196652646708703, 0.10695590537839703, -0.12373718875460327, -0.09704154412195619, -0.18792502638617797, -0.03448747011965939, -0.048481965520685275, -0.32419181025761645, 0.030969981320335398, 0.020357104868578193, -0.042363688798754344, -0.046306324657052755, -0.10653804252589387, 0.0937258560069105, 0.11461923271417618, -0.04299115860054111, 0.02262170010778521, 0.08634338781536956, -0.09272378774143622, -0.21633255095054796, 0.41351452230342794, -0.03541930927063471, -0.2656839287124707, 0.14624170095859362, 0.04515302246103862, -0.1821165119264541, 0.0726785399518641, 0.24485685956564598, 0.2747834693041763, -0.1590092164218991, 0.09001688300798248, -0.024327523590597724, 0.09480451802457017, -0.01314375875517726, -0.040387841615094136, 0.15174612872319163, 0.19358538109476545, 0.18821988624819955, 0.1796503291438317, -0.042663230610612245, -0.10858394560636953, -0.22456186574085482, -0.16946968073690577, -0.15123685139406007, -0.07572288080284904, -0.11294606596597337, -0.1766383296011814, 0.3964766975093101, 0.21924935630938439, 0.14449206846100943, 0.09726283175405115, 0.3744059767840164, 0.11016566379112191, 0.06747802247160248, 0.201263972117366, 0.17745683882718108, 0.10478065182854022, 0.07113554258830845, -0.216509122239326, 0.10150466918379866, 0.0815126058046839]
|
1,803.07341
|
Ultrashort PW laser pulse interaction with target and ion acceleration
|
We present the experimental results on ion acceleration by petawatt
femtosecond laser solid interaction and explore strategies to enhance ion
energy. The irradiation of micrometer thick (0.2 - 6.0 micron) Al foils with a
virtually unexplored intensity regime (8x10^19 W/cm^2 - 1x10^21 W/cm^2)
resulting in ion acceleration along the rear and the front surface target
normal direction is investigated. The maximum energy of protons and carbon
ions, obtained at optimised laser intensity condition (by varying laser energy
or focal spot size), exhibit a rapid intensity scaling as I^0.8 along the rear
surface target normal direction and I^0.6 along the front surface target normal
direction. It was found that proton energy scales much faster with laser energy
rather than the laser focal spot size. Additionally, the ratio of maximum ion
energy along the both directions is found to be constant for the broad range of
target thickness and laser intensities. A proton flux is strongly dominated in
the forward direction at relatively low laser intensities. Increasing the laser
intensity results in the gradual increase in the backward proton flux and leads
to almost equalisation of ion flux in both directions in the entire energy
range. These experimental findings may open new perspectives for applications.
|
physics.plasm-ph
|
we present the experimental results on ion acceleration by petawatt femtosecond laser solid interaction and explore strategies to enhance ion energy the irradiation of micrometer thick 02 60 micron al foils with a virtually unexplored intensity regime 8x1019 wcm2 1x1021 wcm2 resulting in ion acceleration along the rear and the front surface target normal direction is investigated the maximum energy of protons and carbon ions obtained at optimised laser intensity condition by varying laser energy or focal spot size exhibit a rapid intensity scaling as i08 along the rear surface target normal direction and i06 along the front surface target normal direction it was found that proton energy scales much faster with laser energy rather than the laser focal spot size additionally the ratio of maximum ion energy along the both directions is found to be constant for the broad range of target thickness and laser intensities a proton flux is strongly dominated in the forward direction at relatively low laser intensities increasing the laser intensity results in the gradual increase in the backward proton flux and leads to almost equalisation of ion flux in both directions in the entire energy range these experimental findings may open new perspectives for applications
|
[['we', 'present', 'the', 'experimental', 'results', 'on', 'ion', 'acceleration', 'by', 'petawatt', 'femtosecond', 'laser', 'solid', 'interaction', 'and', 'explore', 'strategies', 'to', 'enhance', 'ion', 'energy', 'the', 'irradiation', 'of', 'micrometer', 'thick', '02', '60', 'micron', 'al', 'foils', 'with', 'a', 'virtually', 'unexplored', 'intensity', 'regime', '8x1019', 'wcm2', '1x1021', 'wcm2', 'resulting', 'in', 'ion', 'acceleration', 'along', 'the', 'rear', 'and', 'the', 'front', 'surface', 'target', 'normal', 'direction', 'is', 'investigated', 'the', 'maximum', 'energy', 'of', 'protons', 'and', 'carbon', 'ions', 'obtained', 'at', 'optimised', 'laser', 'intensity', 'condition', 'by', 'varying', 'laser', 'energy', 'or', 'focal', 'spot', 'size', 'exhibit', 'a', 'rapid', 'intensity', 'scaling', 'as', 'i08', 'along', 'the', 'rear', 'surface', 'target', 'normal', 'direction', 'and', 'i06', 'along', 'the', 'front', 'surface', 'target', 'normal', 'direction', 'it', 'was', 'found', 'that', 'proton', 'energy', 'scales', 'much', 'faster', 'with', 'laser', 'energy', 'rather', 'than', 'the', 'laser', 'focal', 'spot', 'size', 'additionally', 'the', 'ratio', 'of', 'maximum', 'ion', 'energy', 'along', 'the', 'both', 'directions', 'is', 'found', 'to', 'be', 'constant', 'for', 'the', 'broad', 'range', 'of', 'target', 'thickness', 'and', 'laser', 'intensities', 'a', 'proton', 'flux', 'is', 'strongly', 'dominated', 'in', 'the', 'forward', 'direction', 'at', 'relatively', 'low', 'laser', 'intensities', 'increasing', 'the', 'laser', 'intensity', 'results', 'in', 'the', 'gradual', 'increase', 'in', 'the', 'backward', 'proton', 'flux', 'and', 'leads', 'to', 'almost', 'equalisation', 'of', 'ion', 'flux', 'in', 'both', 'directions', 'in', 'the', 'entire', 'energy', 'range', 'these', 'experimental', 'findings', 'may', 'open', 'new', 'perspectives', 'for', 'applications']]
|
[-0.06736218104810279, 0.2719156323993569, -0.01630284620548225, 0.037523775684722906, 0.006682134374059018, -0.14409006101718683, 0.024755803587477712, 0.503773489125489, -0.25452080340157757, -0.32474803966162774, 0.00027245703522059216, -0.27320243951954365, 0.06493084064831361, 0.25088918146081646, -0.011085442112531834, 0.017652947326819532, 0.041833366139739904, -0.05825124189333262, -0.019823147947214508, -0.13533610859554884, 0.23361794605406785, 0.176445546594264, 0.3586025940571075, 0.11030466195318829, 0.1086420417990214, -0.02076254747595241, 0.023375636002115036, -0.016978670046357485, -0.14790350842239544, 0.07937521425543854, 0.23429856481010491, 0.006165034135302463, 0.2283699465584634, -0.45548497144898714, -0.2406360530554492, 0.00796986353432353, 0.13113461745794164, 0.08980047860334102, -0.09349599177712754, -0.20928793491530917, 0.024178497578362525, -0.07873351576969709, -0.20103049991170163, 0.06325811115217626, 0.041504720578130885, 0.12041043768415871, -0.24409589500799964, 0.020389042284131655, 0.015201318699412691, 0.07201433475992079, -0.0789168203287394, -0.11479104098008218, -0.06333179817284425, -0.00877052245704164, 0.09345009281574204, 0.12623386312427406, 0.251626490167523, -0.12161777793254873, -0.02148766470848474, 0.31963776840549435, -0.09256237880883769, -0.08504273333506385, 0.15362619454996085, -0.2199315733801063, -0.016337591202144848, 0.2706810594536364, 0.1677864464425345, 0.11873604835668192, -0.093389378430388, 0.0037079255676031736, 0.03808150401925148, 0.21435135993756768, 0.1962190754522527, 0.025899758202562743, 0.211729871477875, 0.19158693076688135, 0.09253689271916735, 0.11728428667129034, -0.21540477359903798, -0.03357497661706618, -0.26461172078175915, -0.1185549770477157, -0.11271551629081653, 0.013050829167926901, -0.08247857745030664, -0.08662524290600328, 0.4109515811831969, 0.1111910345882584, 0.15244597167031942, -0.034705886788675706, 0.3142885356753838, 0.11825226485400654, 0.031321305605502524, 0.051676313834841635, 0.27302383340252234, 0.11929401769870089, 0.1612096061944243, -0.2500619059534942, 0.058187430810778956, -0.027958429659608052]
|
1,803.07342
|
Evolution of Spatial and Multicarrier Scheduling: Towards Multi-cell
Scenario
|
OFDMA systems are considered as the promising multiple access scheme of next
generation multi-cellular wireless systems. In order to ensure the optimum
usage of radio resources, OFDMA radio resource management algorithms have to
maximize the allocated power and rate of the different subchannels to the users
taking also into account the generated co-channel interference between
neighboring cells, which affects the received Quality of Service. This paper
discusses various schemes for power distribution schemes in multiple co-channel
cells. These schemes include centralized and distributed solutions, which may
involve various degrees of complexity and related overhead and may employ
procedures such as linear programming. Finally, the paper introduces a new
solution that uses a network flow model to solve the maximization of the
multi-cell system sum rate. The application of spatial beamforming at each cell
is suggested in order to better cope with interference.
|
eess.SP
|
ofdma systems are considered as the promising multiple access scheme of next generation multicellular wireless systems in order to ensure the optimum usage of radio resources ofdma radio resource management algorithms have to maximize the allocated power and rate of the different subchannels to the users taking also into account the generated cochannel interference between neighboring cells which affects the received quality of service this paper discusses various schemes for power distribution schemes in multiple cochannel cells these schemes include centralized and distributed solutions which may involve various degrees of complexity and related overhead and may employ procedures such as linear programming finally the paper introduces a new solution that uses a network flow model to solve the maximization of the multicell system sum rate the application of spatial beamforming at each cell is suggested in order to better cope with interference
|
[['ofdma', 'systems', 'are', 'considered', 'as', 'the', 'promising', 'multiple', 'access', 'scheme', 'of', 'next', 'generation', 'multicellular', 'wireless', 'systems', 'in', 'order', 'to', 'ensure', 'the', 'optimum', 'usage', 'of', 'radio', 'resources', 'ofdma', 'radio', 'resource', 'management', 'algorithms', 'have', 'to', 'maximize', 'the', 'allocated', 'power', 'and', 'rate', 'of', 'the', 'different', 'subchannels', 'to', 'the', 'users', 'taking', 'also', 'into', 'account', 'the', 'generated', 'cochannel', 'interference', 'between', 'neighboring', 'cells', 'which', 'affects', 'the', 'received', 'quality', 'of', 'service', 'this', 'paper', 'discusses', 'various', 'schemes', 'for', 'power', 'distribution', 'schemes', 'in', 'multiple', 'cochannel', 'cells', 'these', 'schemes', 'include', 'centralized', 'and', 'distributed', 'solutions', 'which', 'may', 'involve', 'various', 'degrees', 'of', 'complexity', 'and', 'related', 'overhead', 'and', 'may', 'employ', 'procedures', 'such', 'as', 'linear', 'programming', 'finally', 'the', 'paper', 'introduces', 'a', 'new', 'solution', 'that', 'uses', 'a', 'network', 'flow', 'model', 'to', 'solve', 'the', 'maximization', 'of', 'the', 'multicell', 'system', 'sum', 'rate', 'the', 'application', 'of', 'spatial', 'beamforming', 'at', 'each', 'cell', 'is', 'suggested', 'in', 'order', 'to', 'better', 'cope', 'with', 'interference']]
|
[-0.23813453769888465, 0.006101009999992142, 0.00828992037928965, 0.01666900196930879, -0.08585993831724742, -0.19927118977033337, 0.10118801702423887, 0.3769166130887371, -0.2986043416632628, -0.2823900671177347, 0.07776534721225789, -0.22596207249280012, -0.17473109093048728, 0.14177505502601903, -0.13184843187279421, 0.08198635175727426, 0.020207977022411644, 0.0020434802683385114, 0.00604531658701861, -0.28797673248738365, 0.2898000513775681, 0.107908575743122, 0.406072703288527, 0.01928755036279769, 0.09105491668353198, -0.013167427193609551, -0.06163707894640384, -0.028725743688098614, -0.05536968091980949, 0.11135093006469361, 0.34065091981500073, 0.21390127638128625, 0.32880810412748807, -0.469951496656302, -0.2511259834085342, 0.09840538502592121, 0.2056371143455027, 0.058035674968957375, -0.01896499034056676, -0.2227822797189296, 0.14082291375675146, -0.25739665658042676, -0.04091846768770524, -0.008517659820196494, -0.10518597612734622, 0.08967804942119369, -0.36634172075493654, 0.01969303488776475, -0.02823589240450045, 0.010526551337073177, -0.07390054599972258, -0.12455271132057533, 0.04406616855642273, 0.20256934907536586, 0.05733568447356729, -0.050194566485695015, 0.09290529648948816, -0.08105117458240195, -0.16831818556832806, 0.4338187579144265, 0.05917424933360168, -0.23112515510964982, 0.1846071431072245, -0.062433123319659015, -0.12271115980537373, 0.14807584700764906, 0.2943233873819749, 0.04437852574800941, -0.19125297186817503, 0.007429403615262831, 0.030780845236452952, 0.1573076268591841, 0.103237859990028, 0.1721983012795763, 0.17205139582986537, 0.18057637267523038, 0.155212772782223, 0.1336740947092398, -0.08118238517175048, -0.12565804437183264, -0.19574978919847358, -0.12943048359380221, -0.17791922342911048, -0.01366981484559955, -0.08239525535371824, -0.09207959508549579, 0.39036817392784734, 0.12575841779840297, 0.10682687705749987, 0.08937214016356886, 0.4114530196964321, 0.11684979233008638, 0.10116114564326881, 0.10191623167738213, 0.14463400728934983, 0.07970237667126331, 0.17455116896168657, -0.24993339208656476, 0.05365849265330274, 0.005710974794773149]
|
1,803.07343
|
Laser Ablation of Gold into Water: near Critical Point Phenomena and
Hydrodynamic Instability
|
Laser ablation of gold irradiated through the transparent water is studied.
We follow dynamics of gold expansion into the water along very long (up to
200 ns) time interval. This is significant because namely at these late times
pressure at a contact boundary between gold (Au) and water decreases down to
the saturation pressure of gold.
Thus the saturation pressure begins to influence dynamics near the contact.
The inertia of displaced water decelerates the contact.
In the reference frame connected with the contact, the deceleration is
equivalent to the free fall acceleration in a gravity field.
Such conditions are favorable for the development of Rayleigh-Taylor
instability (RTI) because heavy fluid (gold) is placed above the light one
(water) in a gravity field.
We extract the increment of RTI from 2T-HD 1D runs.
Surface tension and especially viscosity significantly dump the RTI gain
during deceleration. Atomistic simulation with Molecular Dynamics method
combined with Monte-Carlo method (MD-MC) for large electron heat conduction in
gold is performed to gain a clear insight into the underlying mechanisms. MD-MC
runs show that significant amplification of surface perturbations takes place.
These perturbations start just from thermal fluctuations and the noise
produced by bombardment of the atmosphere by fragments of foam.
The perturbations achieve amplification enough to separate the droplets from
the RTI jets of gold. Thus the gold droplets fall into the water.
|
physics.comp-ph
|
laser ablation of gold irradiated through the transparent water is studied we follow dynamics of gold expansion into the water along very long up to 200 ns time interval this is significant because namely at these late times pressure at a contact boundary between gold au and water decreases down to the saturation pressure of gold thus the saturation pressure begins to influence dynamics near the contact the inertia of displaced water decelerates the contact in the reference frame connected with the contact the deceleration is equivalent to the free fall acceleration in a gravity field such conditions are favorable for the development of rayleightaylor instability rti because heavy fluid gold is placed above the light one water in a gravity field we extract the increment of rti from 2thd 1d runs surface tension and especially viscosity significantly dump the rti gain during deceleration atomistic simulation with molecular dynamics method combined with montecarlo method mdmc for large electron heat conduction in gold is performed to gain a clear insight into the underlying mechanisms mdmc runs show that significant amplification of surface perturbations takes place these perturbations start just from thermal fluctuations and the noise produced by bombardment of the atmosphere by fragments of foam the perturbations achieve amplification enough to separate the droplets from the rti jets of gold thus the gold droplets fall into the water
|
[['laser', 'ablation', 'of', 'gold', 'irradiated', 'through', 'the', 'transparent', 'water', 'is', 'studied', 'we', 'follow', 'dynamics', 'of', 'gold', 'expansion', 'into', 'the', 'water', 'along', 'very', 'long', 'up', 'to', '200', 'ns', 'time', 'interval', 'this', 'is', 'significant', 'because', 'namely', 'at', 'these', 'late', 'times', 'pressure', 'at', 'a', 'contact', 'boundary', 'between', 'gold', 'au', 'and', 'water', 'decreases', 'down', 'to', 'the', 'saturation', 'pressure', 'of', 'gold', 'thus', 'the', 'saturation', 'pressure', 'begins', 'to', 'influence', 'dynamics', 'near', 'the', 'contact', 'the', 'inertia', 'of', 'displaced', 'water', 'decelerates', 'the', 'contact', 'in', 'the', 'reference', 'frame', 'connected', 'with', 'the', 'contact', 'the', 'deceleration', 'is', 'equivalent', 'to', 'the', 'free', 'fall', 'acceleration', 'in', 'a', 'gravity', 'field', 'such', 'conditions', 'are', 'favorable', 'for', 'the', 'development', 'of', 'rayleightaylor', 'instability', 'rti', 'because', 'heavy', 'fluid', 'gold', 'is', 'placed', 'above', 'the', 'light', 'one', 'water', 'in', 'a', 'gravity', 'field', 'we', 'extract', 'the', 'increment', 'of', 'rti', 'from', '2thd', '1d', 'runs', 'surface', 'tension', 'and', 'especially', 'viscosity', 'significantly', 'dump', 'the', 'rti', 'gain', 'during', 'deceleration', 'atomistic', 'simulation', 'with', 'molecular', 'dynamics', 'method', 'combined', 'with', 'montecarlo', 'method', 'mdmc', 'for', 'large', 'electron', 'heat', 'conduction', 'in', 'gold', 'is', 'performed', 'to', 'gain', 'a', 'clear', 'insight', 'into', 'the', 'underlying', 'mechanisms', 'mdmc', 'runs', 'show', 'that', 'significant', 'amplification', 'of', 'surface', 'perturbations', 'takes', 'place', 'these', 'perturbations', 'start', 'just', 'from', 'thermal', 'fluctuations', 'and', 'the', 'noise', 'produced', 'by', 'bombardment', 'of', 'the', 'atmosphere', 'by', 'fragments', 'of', 'foam', 'the', 'perturbations', 'achieve', 'amplification', 'enough', 'to', 'separate', 'the', 'droplets', 'from', 'the', 'rti', 'jets', 'of', 'gold', 'thus', 'the', 'gold', 'droplets', 'fall', 'into', 'the', 'water']]
|
[-0.09421295785155576, 0.1929432278070434, -0.11221856039828225, 0.04279819041886161, -0.017635679700766252, -0.12733441228829984, 0.014342536183436755, 0.3545759743887239, -0.27403380492775786, -0.3175906729369334, 0.05729124659313861, -0.28217899467614765, -0.03175281512188371, 0.18547959859993934, 0.0133377540531049, 0.0162073910628874, 0.08512535318526217, -0.019276098286386874, -0.03772702184660294, -0.1905559011914281, 0.26918944583657667, 0.12093759510682615, 0.2709114691345598, 0.08837564473979967, 0.08894410038746037, -0.05575589270874924, 0.012994190837685184, 0.028332933120066878, -0.16092030485687994, 0.0242977256173746, 0.18684430449818049, -0.0039007873604057636, 0.2627372521150778, -0.5268578279137084, -0.2542016344820767, 0.013821557526831079, 0.10737240246076764, 0.12823031896898374, -0.05432034491569595, -0.2435173756686097, 0.019889221295912182, -0.13115884710836792, -0.11885333930328179, 0.03293378822056296, 0.004891864040586273, 0.005040473131611284, -0.22407606433854496, 0.09702002945865001, 0.051638737987712506, 0.03592158078042939, -0.06443211398256399, -0.07003812621289913, -0.06807002637213903, 0.09560875215081382, 0.08285961481248054, 0.04310500382474599, 0.2603227384434807, -0.13419285905238373, 0.008544131671490592, 0.3992593498762483, -0.11815214250494306, -0.1214540374415836, 0.22973099669474548, -0.18824409075345086, -0.023947632118474397, 0.26353269338039104, 0.18242347763080677, 0.07485970342995402, -0.12333639051489104, -0.0007639891203736012, 0.03849277546087412, 0.1689133722844031, 0.1629787689359216, -0.047903087397056544, 0.25629984295671493, 0.23745630739619378, 0.01735419761987024, 0.1535577983840109, -0.13884204366672948, -0.08799486734030719, -0.26466182959719303, -0.1597042834392411, -0.12656235738566754, 0.04574447275557662, -0.10149681089484325, -0.1580489941283368, 0.3514122270105357, 0.1333528244785503, 0.13373775467424925, 0.0038703567579190814, 0.3052229601209901, 0.046444199273601765, 0.06746010418849445, 0.08211552063456481, 0.2989832773352396, 0.12580080593079, 0.12718318765818148, -0.2710313736901524, 0.0766917945403993, 0.010688207231758706]
|
1,803.07344
|
A Low Complexity Space-Frequency Multiuser Scheduling Algorithm
|
This work presents a resource allocation algorithm in K-user, M-subcarrier
and NT-antenna systems for on-line scheduling. To exploit temporal diversity
and to reduce complexity, the ergodic sum rate is maximized instead of the
instantaneous one. Dual optimization is applied to further diminish complexity
together with a stochastic approximation, which is more suitable for online
algorithms. Weighted sum rate is considered so that users can be either
prioritized by higher layers or differentiated by proportional rate
constraints. The performance and complexity of this algorithm is compared with
well-known benchmarks and also evaluated under real system conditions for the
MIMO Broadcast channel.
|
eess.SP
|
this work presents a resource allocation algorithm in kuser msubcarrier and ntantenna systems for online scheduling to exploit temporal diversity and to reduce complexity the ergodic sum rate is maximized instead of the instantaneous one dual optimization is applied to further diminish complexity together with a stochastic approximation which is more suitable for online algorithms weighted sum rate is considered so that users can be either prioritized by higher layers or differentiated by proportional rate constraints the performance and complexity of this algorithm is compared with wellknown benchmarks and also evaluated under real system conditions for the mimo broadcast channel
|
[['this', 'work', 'presents', 'a', 'resource', 'allocation', 'algorithm', 'in', 'kuser', 'msubcarrier', 'and', 'ntantenna', 'systems', 'for', 'online', 'scheduling', 'to', 'exploit', 'temporal', 'diversity', 'and', 'to', 'reduce', 'complexity', 'the', 'ergodic', 'sum', 'rate', 'is', 'maximized', 'instead', 'of', 'the', 'instantaneous', 'one', 'dual', 'optimization', 'is', 'applied', 'to', 'further', 'diminish', 'complexity', 'together', 'with', 'a', 'stochastic', 'approximation', 'which', 'is', 'more', 'suitable', 'for', 'online', 'algorithms', 'weighted', 'sum', 'rate', 'is', 'considered', 'so', 'that', 'users', 'can', 'be', 'either', 'prioritized', 'by', 'higher', 'layers', 'or', 'differentiated', 'by', 'proportional', 'rate', 'constraints', 'the', 'performance', 'and', 'complexity', 'of', 'this', 'algorithm', 'is', 'compared', 'with', 'wellknown', 'benchmarks', 'and', 'also', 'evaluated', 'under', 'real', 'system', 'conditions', 'for', 'the', 'mimo', 'broadcast', 'channel']]
|
[-0.15980246253858074, 0.028532473555747038, -0.03703511830381289, 0.05063361834083703, -0.0947438540455068, -0.2187481917041753, 0.11182297962451619, 0.39897103892753316, -0.2994547374689077, -0.2703527759722605, 0.13840030147385193, -0.21049761884294602, -0.1657852381444061, 0.17257679681227142, -0.13280454080323784, 0.06455369693303138, 0.06634872540717526, 0.057370188349040646, -0.04831012471208387, -0.34512726769649554, 0.273993829075171, 0.11523588439354635, 0.33981610162715825, 0.024350885151557585, 0.07907736631186336, 0.010842799149662713, -0.01067428679528589, 0.029062382990912516, -0.08009464456499328, 0.10111178611690293, 0.3006261470062392, 0.23128420254690762, 0.3050143461227797, -0.3855773046688766, -0.21407526047254094, 0.11964371757182692, 0.18935289660591054, 0.025820026016195437, -0.006317867420652967, -0.24231711000546205, 0.12959469109773636, -0.19317790733564796, 0.0012292064802379024, -0.035543684926055065, -0.05988286783424567, 0.04782501026531871, -0.38481179130624754, 0.05743391066522347, 0.0029668862959940216, 0.0029053416516517804, -0.06704447934480041, -0.1307527176615288, 0.06201635209881529, 0.12125757242771512, 0.05637232277884471, 0.032413442312663764, 0.09342983417327003, -0.10233978434864964, -0.16935461268247087, 0.3957420242475156, -0.04337436929749021, -0.26320679826372095, 0.17475337511681646, -0.04281587006372153, -0.0879416788455422, 0.19392739231603182, 0.24805741583719393, 0.10698711370089453, -0.19756669320679288, 0.03150825544821136, -0.010620065613136607, 0.18236522213555872, 0.06260592783136028, 0.0970267808606506, 0.10876534605512814, 0.20534763189403302, 0.17455136332166743, 0.19099300928599183, -0.012587488918774287, -0.1352816347545963, -0.17584866521837267, -0.1458909398857124, -0.20106043253207997, -0.004886685115076146, -0.1025915964861752, -0.059454487437116246, 0.3340927475911318, 0.1218865810826953, 0.12211952967645258, 0.15106088190448794, 0.37888190747067635, 0.1556168228853494, 0.06441674288362265, 0.14930259798919515, 0.16551108308948995, 0.08428303387291654, 0.10800440913085274, -0.24912880505767784, 0.1084115071773377, 0.038797473354379136]
|
1,803.07345
|
A generalization of a theorem of Swan with applications to Iwasawa
theory
|
Let $p$ be a prime and let $G$ be a finite group. By a celebrated theorem of
Swan, two finitely generated projective $\mathbb Z_p[G]$-modules $P$ and $P'$
are isomorphic if and only if $\mathbb Q_p \otimes_{\mathbb Z_p} P$ and
$\mathbb Q_p \otimes_{\mathbb Z_p} P'$ are isomorphic as $\mathbb
Q_p[G]$-modules. We prove an Iwasawa-theoretic analogue of this result and
apply this to the Iwasawa theory of local and global fields. We thereby
determine the structure of natural Iwasawa modules up to (pseudo-)isomorphism.
|
math.NT math.RA
|
let p be a prime and let g be a finite group by a celebrated theorem of swan two finitely generated projective mathbb z_pgmodules p and p are isomorphic if and only if mathbb q_p otimes_mathbb z_p p and mathbb q_p otimes_mathbb z_p p are isomorphic as mathbb q_pgmodules we prove an iwasawatheoretic analogue of this result and apply this to the iwasawa theory of local and global fields we thereby determine the structure of natural iwasawa modules up to pseudoisomorphism
|
[['let', 'p', 'be', 'a', 'prime', 'and', 'let', 'g', 'be', 'a', 'finite', 'group', 'by', 'a', 'celebrated', 'theorem', 'of', 'swan', 'two', 'finitely', 'generated', 'projective', 'mathbb', 'z_pgmodules', 'p', 'and', 'p', 'are', 'isomorphic', 'if', 'and', 'only', 'if', 'mathbb', 'q_p', 'otimes_mathbb', 'z_p', 'p', 'and', 'mathbb', 'q_p', 'otimes_mathbb', 'z_p', 'p', 'are', 'isomorphic', 'as', 'mathbb', 'q_pgmodules', 'we', 'prove', 'an', 'iwasawatheoretic', 'analogue', 'of', 'this', 'result', 'and', 'apply', 'this', 'to', 'the', 'iwasawa', 'theory', 'of', 'local', 'and', 'global', 'fields', 'we', 'thereby', 'determine', 'the', 'structure', 'of', 'natural', 'iwasawa', 'modules', 'up', 'to', 'pseudoisomorphism']]
|
[-0.21184823234695233, 0.10746045121381537, -0.13349102795878542, -0.0016843051475743892, -0.08521513829502879, -0.15824184435290062, -0.05862658043669042, 0.28921875235023375, -0.397410127746908, -0.17792801868429856, 0.05669146923265785, -0.23054523959378653, -0.0823168528820329, 0.20118997546643774, -0.15943749307925942, -0.0659150167138469, -0.033053324973399315, 0.15713336107415396, -0.042994477833279324, -0.345885429481233, 0.3291325539975321, -0.1143065084102033, 0.1812737374271773, 0.04719277873305203, 0.05318840578952922, 0.06189301146689472, 0.017786328421457658, -0.05993439387412199, -0.21783961662197415, 0.07702364273888024, 0.3465541221696553, 0.039898713352158666, 0.25949729182698494, -0.3802349007205118, -0.11584588974902901, 0.33757864214079103, 0.16778158331643553, -0.11514894823437627, 0.00012161887451251851, -0.2701991110851493, 0.22484134011489304, -0.178046145900801, -0.17101708038627536, -0.08384579428341947, 0.15087525886660325, 0.02373432511127778, -0.33455900529390675, -0.01826880206177129, 0.14696110660782014, 0.1766931669715839, -0.048647488146147964, -0.10852072605438813, -0.0935289771181879, 0.028388854357873715, -0.03850778450458488, 0.1632656274552021, 0.08843785875677308, 0.020369535872028974, -0.11755284582135044, 0.4255259661357614, -0.07726519194408026, -0.17280112700006348, 0.06173539669783432, -0.2177913388697124, -0.15384007471648953, 0.10590456311791381, 0.06780526878995986, 0.17744531369284738, 0.0729821251633082, 0.3056867764157514, -0.18800247310884768, 0.05106156001079686, 0.08662795260124191, -0.049705756450944306, 0.11857093547624123, -0.020225648953921243, 0.06640953428548159, 0.08225682152942106, 0.028493768340300863, 0.10842016941125068, -0.39494040820606147, -0.16577406555319887, -0.11921044868193095, 0.23629305338711018, -0.09311172378999535, -0.10182538575528166, 0.3296186439457196, 0.07108839392025448, 0.14509586163478183, 0.1293693006899255, 0.19778376763474337, 0.04023325841585056, 0.022651982322759643, 0.047211165704964836, -0.011193555744388435, 0.2967360903880311, -0.14954469758498518, -0.10601102397482418, -0.06822128850330092, 0.20555298487196053]
|
1,803.07346
|
Simulations of Cold Electroweak Baryogenesis: Dependence on the source
of CP-violation
|
We compute the baryon asymmetry created in a tachyonic electroweak symmetry
breaking transition, focusing on the dependence on the source of effective
CP-violation. Earlier simulations of Cold Electroweak Baryogenesis have almost
exclusively considered a very specific CP-violating term explicitly biasing
Chern-Simons number. We compare four different dimension six, scalar-gauge
CP-violating terms, involving both the Higgs field and another dynamical scalar
coupled to SU(2) or U(1) gauge fields. We find that for sensible values of
parameters, all implementations can generate a baryon asymmetry consistent with
observations, showing that baryogenesis is a generic outcome of a fast
tachyonic electroweak transition.
|
hep-ph hep-lat hep-th
|
we compute the baryon asymmetry created in a tachyonic electroweak symmetry breaking transition focusing on the dependence on the source of effective cpviolation earlier simulations of cold electroweak baryogenesis have almost exclusively considered a very specific cpviolating term explicitly biasing chernsimons number we compare four different dimension six scalargauge cpviolating terms involving both the higgs field and another dynamical scalar coupled to su2 or u1 gauge fields we find that for sensible values of parameters all implementations can generate a baryon asymmetry consistent with observations showing that baryogenesis is a generic outcome of a fast tachyonic electroweak transition
|
[['we', 'compute', 'the', 'baryon', 'asymmetry', 'created', 'in', 'a', 'tachyonic', 'electroweak', 'symmetry', 'breaking', 'transition', 'focusing', 'on', 'the', 'dependence', 'on', 'the', 'source', 'of', 'effective', 'cpviolation', 'earlier', 'simulations', 'of', 'cold', 'electroweak', 'baryogenesis', 'have', 'almost', 'exclusively', 'considered', 'a', 'very', 'specific', 'cpviolating', 'term', 'explicitly', 'biasing', 'chernsimons', 'number', 'we', 'compare', 'four', 'different', 'dimension', 'six', 'scalargauge', 'cpviolating', 'terms', 'involving', 'both', 'the', 'higgs', 'field', 'and', 'another', 'dynamical', 'scalar', 'coupled', 'to', 'su2', 'or', 'u1', 'gauge', 'fields', 'we', 'find', 'that', 'for', 'sensible', 'values', 'of', 'parameters', 'all', 'implementations', 'can', 'generate', 'a', 'baryon', 'asymmetry', 'consistent', 'with', 'observations', 'showing', 'that', 'baryogenesis', 'is', 'a', 'generic', 'outcome', 'of', 'a', 'fast', 'tachyonic', 'electroweak', 'transition']]
|
[-0.1939136494825385, 0.2910422046136643, -0.043984816542693546, 0.155977590091536, -0.14103639167638457, -0.18123669463461645, -0.0027040029704874877, 0.31087315401860643, -0.1436542014790965, -0.2779514645131267, 0.03419334848520669, -0.2478090340594704, -0.07206342465538836, 0.09054649296948421, 0.08478743917004643, 0.02672942240181384, -0.010267237405653815, 0.016998341345057195, -0.09957721481118731, -0.27927910829229013, 0.30793810993128895, -0.03543148329956647, 0.2276186609108533, 0.04396175407110808, 0.09862992335205936, -0.06427074330074865, -0.014494851046260826, -0.03750610905129234, -0.12789445901268795, 0.01016041537989121, 0.16438113633372195, 0.06304580643440463, 0.10880707050388565, -0.3674125593982409, -0.2048769860186291, 0.18085410532883692, 0.1689874436136107, 0.1914096670557878, -0.13009501688362918, -0.3147048569303386, 0.031416146350758414, -0.20547076374558465, -0.09601574849660452, -0.13574812891512958, -0.04597812218054635, -0.12337156026018309, -0.37804918542352256, 0.1087624832630818, -0.09161176055352613, 0.05278290150573059, -0.01403614728502473, -0.09762578255173807, -0.08287270145718845, -0.0005039208264527273, 0.15235979043241896, 0.03888449523293851, 0.1723730439398609, -0.19865408780858662, -0.1425539011638184, 0.4146429709852578, -0.11777677791245396, -0.15930575729889454, 0.13296441083811983, -0.15040090461368483, -0.19604523357346046, 0.10149954907044921, 0.1499672709413025, 0.07650342396441467, -0.13587993006126917, 0.1542615603877716, -0.03335078269936981, 0.16220247239226057, 0.09799742219703537, 0.03311532058239895, 0.2860300633866264, 0.1309758543455023, 0.03283101976706589, 0.07080037816788773, -0.010213254491849956, -0.13007583672998055, -0.4545489674890224, -0.07374972387036423, -0.0918612595117765, 0.06812101686658452, -0.1277127516863105, -0.14947730839746642, 0.434054054300852, 0.1639606090933999, 0.223704745270768, -0.008035163238302482, 0.2924051730827029, 0.07592969422456713, 0.07895479651586133, 0.00437287769603486, 0.30109521004844136, 0.15847269473454859, 0.1066333179324105, -0.3070092927498211, -0.04062693032711668, 0.08945354295666424]
|
1,803.07347
|
Optimizing Sponsored Search Ranking Strategy by Deep Reinforcement
Learning
|
Sponsored search is an indispensable business model and a major revenue
contributor of almost all the search engines. From the advertisers' side,
participating in ranking the search results by paying for the sponsored search
advertisement to attract more awareness and purchase facilitates their
commercial goal. From the users' side, presenting personalized advertisement
reflecting their propensity would make their online search experience more
satisfactory. Sponsored search platforms rank the advertisements by a ranking
function to determine the list of advertisements to show and the charging price
for the advertisers. Hence, it is crucial to find a good ranking function which
can simultaneously satisfy the platform, the users and the advertisers.
Moreover, advertisements showing positions under different queries from
different users may associate with advertisement candidates of different bid
price distributions and click probability distributions, which requires the
ranking functions to be optimized adaptively to the traffic characteristics. In
this work, we proposed a generic framework to optimize the ranking functions by
deep reinforcement learning methods. The framework is composed of two parts: an
offline learning part which initializes the ranking functions by learning from
a simulated advertising environment, allowing adequate exploration of the
ranking function parameter space without hurting the performance of the
commercial platform. An online learning part which further optimizes the
ranking functions by adapting to the online data distribution. Experimental
results on a large-scale sponsored search platform confirm the effectiveness of
the proposed method.
|
cs.IR cs.AI cs.LG
|
sponsored search is an indispensable business model and a major revenue contributor of almost all the search engines from the advertisers side participating in ranking the search results by paying for the sponsored search advertisement to attract more awareness and purchase facilitates their commercial goal from the users side presenting personalized advertisement reflecting their propensity would make their online search experience more satisfactory sponsored search platforms rank the advertisements by a ranking function to determine the list of advertisements to show and the charging price for the advertisers hence it is crucial to find a good ranking function which can simultaneously satisfy the platform the users and the advertisers moreover advertisements showing positions under different queries from different users may associate with advertisement candidates of different bid price distributions and click probability distributions which requires the ranking functions to be optimized adaptively to the traffic characteristics in this work we proposed a generic framework to optimize the ranking functions by deep reinforcement learning methods the framework is composed of two parts an offline learning part which initializes the ranking functions by learning from a simulated advertising environment allowing adequate exploration of the ranking function parameter space without hurting the performance of the commercial platform an online learning part which further optimizes the ranking functions by adapting to the online data distribution experimental results on a largescale sponsored search platform confirm the effectiveness of the proposed method
|
[['sponsored', 'search', 'is', 'an', 'indispensable', 'business', 'model', 'and', 'a', 'major', 'revenue', 'contributor', 'of', 'almost', 'all', 'the', 'search', 'engines', 'from', 'the', 'advertisers', 'side', 'participating', 'in', 'ranking', 'the', 'search', 'results', 'by', 'paying', 'for', 'the', 'sponsored', 'search', 'advertisement', 'to', 'attract', 'more', 'awareness', 'and', 'purchase', 'facilitates', 'their', 'commercial', 'goal', 'from', 'the', 'users', 'side', 'presenting', 'personalized', 'advertisement', 'reflecting', 'their', 'propensity', 'would', 'make', 'their', 'online', 'search', 'experience', 'more', 'satisfactory', 'sponsored', 'search', 'platforms', 'rank', 'the', 'advertisements', 'by', 'a', 'ranking', 'function', 'to', 'determine', 'the', 'list', 'of', 'advertisements', 'to', 'show', 'and', 'the', 'charging', 'price', 'for', 'the', 'advertisers', 'hence', 'it', 'is', 'crucial', 'to', 'find', 'a', 'good', 'ranking', 'function', 'which', 'can', 'simultaneously', 'satisfy', 'the', 'platform', 'the', 'users', 'and', 'the', 'advertisers', 'moreover', 'advertisements', 'showing', 'positions', 'under', 'different', 'queries', 'from', 'different', 'users', 'may', 'associate', 'with', 'advertisement', 'candidates', 'of', 'different', 'bid', 'price', 'distributions', 'and', 'click', 'probability', 'distributions', 'which', 'requires', 'the', 'ranking', 'functions', 'to', 'be', 'optimized', 'adaptively', 'to', 'the', 'traffic', 'characteristics', 'in', 'this', 'work', 'we', 'proposed', 'a', 'generic', 'framework', 'to', 'optimize', 'the', 'ranking', 'functions', 'by', 'deep', 'reinforcement', 'learning', 'methods', 'the', 'framework', 'is', 'composed', 'of', 'two', 'parts', 'an', 'offline', 'learning', 'part', 'which', 'initializes', 'the', 'ranking', 'functions', 'by', 'learning', 'from', 'a', 'simulated', 'advertising', 'environment', 'allowing', 'adequate', 'exploration', 'of', 'the', 'ranking', 'function', 'parameter', 'space', 'without', 'hurting', 'the', 'performance', 'of', 'the', 'commercial', 'platform', 'an', 'online', 'learning', 'part', 'which', 'further', 'optimizes', 'the', 'ranking', 'functions', 'by', 'adapting', 'to', 'the', 'online', 'data', 'distribution', 'experimental', 'results', 'on', 'a', 'largescale', 'sponsored', 'search', 'platform', 'confirm', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method']]
|
[-0.062316959881681504, 0.004878101941142369, -0.06905710203099553, 0.10292705695462508, -0.1857858331581988, -0.17757797311849388, 0.1470682120407681, 0.4407599535889103, -0.26117596220248773, -0.36718257638414675, 0.05104630844276872, -0.33615024782735975, -0.15875325387864672, 0.17615833365253836, -0.06536986879457846, 0.04545933597127244, 0.048827380727250444, 0.060087930194054874, -0.010516201088725889, -0.33286126115915793, 0.2923531271171977, 0.12242612661682839, 0.347952410945732, 0.047346856104460606, 0.033972774194731076, 0.05278062087609985, -0.09316627723875187, -0.04972211119604901, -0.08901825699544812, 0.16643916310987167, 0.36378308271563026, 0.23089591656630007, 0.38080757833085954, -0.35504514535975845, -0.1301030206081647, 0.143569179064243, 0.08249473676699119, 0.01939186945427367, -0.10736787180385209, -0.344168820720308, 0.059514907446701744, -0.2118461881132828, -0.017552961656523838, -0.10520521110176283, -0.031489733726445236, 0.036544936835386996, -0.3326390360196425, -0.07441192355709371, -0.017750801404117274, -0.008538739548569893, -0.07874841025391183, -0.10712911609670747, -0.010930646862045435, 0.1974087254838797, 0.08815459679009124, 0.0037165089171000963, 0.18971928280198125, -0.19630555459199536, -0.19793332406414388, 0.4165259703160885, -0.015203511437117043, -0.1665647536954227, 0.15215629593161392, -0.02977167605225123, -0.09423030850130244, 0.11990935645575272, 0.26972014091956287, 0.13749968376362368, -0.1978832110091728, -0.00547528789221838, -0.04044972940848034, 0.17891385064409035, 0.029276934584308717, -0.024474570650007514, 0.21245355202946653, 0.21668921093756366, 0.12228403529112811, 0.13771954552966992, -0.003956273733835541, -0.11305760847941293, -0.1943331425466922, -0.15596533726439102, -0.17244253452557487, -0.011355087270573477, -0.14335416976757834, -0.13947861988572957, 0.41332095169849, 0.18108562938721015, 0.1420725704332561, 0.07081350659501691, 0.3294546711771607, 0.05054778157401893, 0.0864415495435439, 0.11533041221634248, 0.16665464207743122, -0.09438336544701735, 0.18877398139615623, -0.16212708630374142, 0.16630437412354462, 0.04227543175437535]
|
1,803.07348
|
Frank-Wolfe with Subsampling Oracle
|
We analyze two novel randomized variants of the Frank-Wolfe (FW) or
conditional gradient algorithm. While classical FW algorithms require solving a
linear minimization problem over the domain at each iteration, the proposed
method only requires to solve a linear minimization problem over a small
\emph{subset} of the original domain. The first algorithm that we propose is a
randomized variant of the original FW algorithm and achieves a
$\mathcal{O}(1/t)$ sublinear convergence rate as in the deterministic
counterpart. The second algorithm is a randomized variant of the Away-step FW
algorithm, and again as its deterministic counterpart, reaches linear (i.e.,
exponential) convergence rate making it the first provably convergent
randomized variant of Away-step FW. In both cases, while subsampling reduces
the convergence rate by a constant factor, the linear minimization step can be
a fraction of the cost of that of the deterministic versions, especially when
the data is streamed. We illustrate computational gains of the algorithms on
regression problems, involving both $\ell_1$ and latent group lasso penalties.
|
math.OC cs.LG stat.ML
|
we analyze two novel randomized variants of the frankwolfe fw or conditional gradient algorithm while classical fw algorithms require solving a linear minimization problem over the domain at each iteration the proposed method only requires to solve a linear minimization problem over a small emphsubset of the original domain the first algorithm that we propose is a randomized variant of the original fw algorithm and achieves a mathcalo1t sublinear convergence rate as in the deterministic counterpart the second algorithm is a randomized variant of the awaystep fw algorithm and again as its deterministic counterpart reaches linear ie exponential convergence rate making it the first provably convergent randomized variant of awaystep fw in both cases while subsampling reduces the convergence rate by a constant factor the linear minimization step can be a fraction of the cost of that of the deterministic versions especially when the data is streamed we illustrate computational gains of the algorithms on regression problems involving both ell_1 and latent group lasso penalties
|
[['we', 'analyze', 'two', 'novel', 'randomized', 'variants', 'of', 'the', 'frankwolfe', 'fw', 'or', 'conditional', 'gradient', 'algorithm', 'while', 'classical', 'fw', 'algorithms', 'require', 'solving', 'a', 'linear', 'minimization', 'problem', 'over', 'the', 'domain', 'at', 'each', 'iteration', 'the', 'proposed', 'method', 'only', 'requires', 'to', 'solve', 'a', 'linear', 'minimization', 'problem', 'over', 'a', 'small', 'emphsubset', 'of', 'the', 'original', 'domain', 'the', 'first', 'algorithm', 'that', 'we', 'propose', 'is', 'a', 'randomized', 'variant', 'of', 'the', 'original', 'fw', 'algorithm', 'and', 'achieves', 'a', 'mathcalo1t', 'sublinear', 'convergence', 'rate', 'as', 'in', 'the', 'deterministic', 'counterpart', 'the', 'second', 'algorithm', 'is', 'a', 'randomized', 'variant', 'of', 'the', 'awaystep', 'fw', 'algorithm', 'and', 'again', 'as', 'its', 'deterministic', 'counterpart', 'reaches', 'linear', 'ie', 'exponential', 'convergence', 'rate', 'making', 'it', 'the', 'first', 'provably', 'convergent', 'randomized', 'variant', 'of', 'awaystep', 'fw', 'in', 'both', 'cases', 'while', 'subsampling', 'reduces', 'the', 'convergence', 'rate', 'by', 'a', 'constant', 'factor', 'the', 'linear', 'minimization', 'step', 'can', 'be', 'a', 'fraction', 'of', 'the', 'cost', 'of', 'that', 'of', 'the', 'deterministic', 'versions', 'especially', 'when', 'the', 'data', 'is', 'streamed', 'we', 'illustrate', 'computational', 'gains', 'of', 'the', 'algorithms', 'on', 'regression', 'problems', 'involving', 'both', 'ell_1', 'and', 'latent', 'group', 'lasso', 'penalties']]
|
[-0.0832538668122707, -0.015507378835569728, -0.08506181623899575, 0.0694554560726057, -0.10311829223805531, -0.1851456813401345, 0.11976682687739164, 0.394138645866152, -0.3686380047266456, -0.2604256559219776, 0.14953868943901563, -0.22764496900367015, -0.17373424802314152, 0.1951051030110455, -0.10931515868005315, 0.1274692222416034, 0.08951861536638303, 0.03070823664805203, -0.11500669486827753, -0.3273368713191964, 0.18877806865088076, 0.05214532371575126, 0.24808802912999509, -0.04515995299725822, 0.18517397695827778, 0.024165530611450475, 0.00682590531015938, 0.035265734939292255, -0.037020593832483316, 0.0960870289201425, 0.21834141934629192, 0.21225269748547088, 0.4386359345506538, -0.3847127339266466, -0.14113445886495438, 0.15468534650986618, 0.14915809618330306, 0.11433203288946639, -0.05717642419110758, -0.20529577608474275, 0.09525590504265645, -0.10629121929153122, -0.010658002634370474, -0.07631502900216164, -0.06421885249543596, 0.02781630399933254, -0.35216954070510287, 0.11232896472581408, 0.09004678390708498, -0.017951026826984053, -0.04540922502690757, -0.1520927489706964, 0.08812260672901616, 0.007355185313975777, 0.06456059364065754, 0.07080999953728734, 0.09305983879744555, -0.11696987377310342, -0.16746955213390968, 0.37334284049769245, -0.08159806383773685, -0.2085650180776914, 0.13305311691797353, -0.034662311679373184, -0.13140232665323173, 0.14661903675984253, 0.2121672024923927, 0.18182564068190527, -0.11509827172117322, 0.1302046615958468, -0.0727312398622885, 0.1553232542916455, 0.04900108510910561, -0.019809777993059746, 0.01404746678290945, 0.1784780774300805, 0.20844662709824854, 0.17225713212656873, -0.07017474270453959, -0.12538077296181158, -0.24886665566062385, -0.14522893663185338, -0.22261238744002626, -0.03338505815375935, -0.15963744823088882, -0.15810244737305876, 0.3814153482742382, 0.1002658150098851, 0.17785749748123414, 0.19671709118128727, 0.3456383904498635, 0.1417599903821776, 0.02492761822156326, 0.1754309374819224, 0.18277107767309203, 0.1174063703849573, 0.08062590781535783, -0.2635919758275673, 0.11659497534962032, 0.1538727450777184]
|
1,803.07349
|
Progressive Structure from Motion
|
Structure from Motion or the sparse 3D reconstruction out of individual
photos is a long studied topic in computer vision. Yet none of the existing
reconstruction pipelines fully addresses a progressive scenario where images
are only getting available during the reconstruction process and intermediate
results are delivered to the user. Incremental pipelines are capable of growing
a 3D model but often get stuck in local minima due to wrong (binding) decisions
taken based on incomplete information. Global pipelines on the other hand need
the access to the complete viewgraph and are not capable of delivering
intermediate results. In this paper we propose a new reconstruction pipeline
working in a progressive manner rather than in a batch processing scheme. The
pipeline is able to recover from failed reconstructions in early stages, avoids
to take binding decisions, delivers a progressive output and yet maintains the
capabilities of existing pipelines. We demonstrate and evaluate our method on
diverse challenging public and dedicated datasets including those with highly
symmetric structures and compare to the state of the art.
|
cs.CV
|
structure from motion or the sparse 3d reconstruction out of individual photos is a long studied topic in computer vision yet none of the existing reconstruction pipelines fully addresses a progressive scenario where images are only getting available during the reconstruction process and intermediate results are delivered to the user incremental pipelines are capable of growing a 3d model but often get stuck in local minima due to wrong binding decisions taken based on incomplete information global pipelines on the other hand need the access to the complete viewgraph and are not capable of delivering intermediate results in this paper we propose a new reconstruction pipeline working in a progressive manner rather than in a batch processing scheme the pipeline is able to recover from failed reconstructions in early stages avoids to take binding decisions delivers a progressive output and yet maintains the capabilities of existing pipelines we demonstrate and evaluate our method on diverse challenging public and dedicated datasets including those with highly symmetric structures and compare to the state of the art
|
[['structure', 'from', 'motion', 'or', 'the', 'sparse', '3d', 'reconstruction', 'out', 'of', 'individual', 'photos', 'is', 'a', 'long', 'studied', 'topic', 'in', 'computer', 'vision', 'yet', 'none', 'of', 'the', 'existing', 'reconstruction', 'pipelines', 'fully', 'addresses', 'a', 'progressive', 'scenario', 'where', 'images', 'are', 'only', 'getting', 'available', 'during', 'the', 'reconstruction', 'process', 'and', 'intermediate', 'results', 'are', 'delivered', 'to', 'the', 'user', 'incremental', 'pipelines', 'are', 'capable', 'of', 'growing', 'a', '3d', 'model', 'but', 'often', 'get', 'stuck', 'in', 'local', 'minima', 'due', 'to', 'wrong', 'binding', 'decisions', 'taken', 'based', 'on', 'incomplete', 'information', 'global', 'pipelines', 'on', 'the', 'other', 'hand', 'need', 'the', 'access', 'to', 'the', 'complete', 'viewgraph', 'and', 'are', 'not', 'capable', 'of', 'delivering', 'intermediate', 'results', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'reconstruction', 'pipeline', 'working', 'in', 'a', 'progressive', 'manner', 'rather', 'than', 'in', 'a', 'batch', 'processing', 'scheme', 'the', 'pipeline', 'is', 'able', 'to', 'recover', 'from', 'failed', 'reconstructions', 'in', 'early', 'stages', 'avoids', 'to', 'take', 'binding', 'decisions', 'delivers', 'a', 'progressive', 'output', 'and', 'yet', 'maintains', 'the', 'capabilities', 'of', 'existing', 'pipelines', 'we', 'demonstrate', 'and', 'evaluate', 'our', 'method', 'on', 'diverse', 'challenging', 'public', 'and', 'dedicated', 'datasets', 'including', 'those', 'with', 'highly', 'symmetric', 'structures', 'and', 'compare', 'to', 'the', 'state', 'of', 'the', 'art']]
|
[-0.07105796090772123, 0.021532477594874585, -0.0875503542329902, 0.048458775489084005, -0.10716072046037378, -0.15572799371833773, 0.039314351810661584, 0.4169408181438359, -0.25994576232764743, -0.34967227467474926, 0.1304812721865273, -0.2657701441852226, -0.1297043638368105, 0.19381907699768827, -0.11217843732347005, 0.06514380363768887, 0.16281651243789594, 0.032069095358554935, -0.06046288630432695, -0.2724622236156633, 0.2526346955571495, 0.08333303215217659, 0.3323984618523511, -0.005757913115867895, 0.09354267071600704, 0.008738455022738754, -0.10984217660082103, -0.00642332214134178, -0.06045482262444479, 0.14097728966012726, 0.2867263844879023, 0.182037683760469, 0.28661680663266786, -0.48880383237425623, -0.21387834191434726, 0.05468981645381795, 0.1579758421111124, 0.14713552972141603, -0.07706268992202742, -0.2824284790576189, 0.0935998651762386, -0.1497944038275672, -0.027008594468706983, -0.12505697986573025, -0.04355229680016958, -0.02116189237641192, -0.271324791476176, 0.07045863083384439, 0.030110227145683142, 0.03371201798683782, -0.07639640288617483, -0.09725617676646844, -0.006804071587574636, 0.18043027138979784, 0.013432961961370893, 0.04172372934609202, 0.1245795205408097, -0.18284040884526773, -0.09566787879475146, 0.4081666798427187, -0.011509565010699632, -0.1729108094455689, 0.2440628897333143, -0.07063531893139555, -0.14095526193696792, 0.17208685865090495, 0.20088790177271285, 0.13074115184189258, -0.166045802985599, 0.02220608913085434, 0.037526380135570706, 0.17474226586336014, 0.02807079565352707, -0.0031420448794960976, 0.206357485015245, 0.21744793650544322, 0.04715518206866437, 0.12813793551531386, -0.10529453340056753, -0.08552979306390124, -0.2075614629142072, -0.08981403010099827, -0.1614835489402129, -0.019587229115968094, -0.026833632872098702, -0.15408937007071044, 0.38981839735000295, 0.2042996170315035, 0.21077435639494196, 0.05422480354950651, 0.3901745705897438, -0.012671758893786276, 0.10895273437049112, 0.09022120774546959, 0.1966665831137577, 0.00020161602356244982, 0.14530357121671925, -0.1419467319314229, 0.10834361587506558, 0.03475803519340216]
|
1,803.0735
|
Entropy driven stability of chiral single-walled carbon nanotubes
|
Single-walled carbon nanotubes are hollow cylinders, that can grow
centimeters long by carbon incorporation at the interface with a catalyst. They
display semi-conducting or metallic characteristics, depending on their
helicity, that is determined during their growth. To support the quest for a
selective synthesis, we develop a thermodynamic model, that relates the
tube-catalyst interfacial energies, temperature, and the resulting tube
chirality. We show that nanotubes can grow chiral because of the
configurational entropy of their nanometer-sized edge, thus explaining
experimentally observed temperature evolutions of chiral distributions. Taking
the chemical nature of the catalyst into account through interfacial energies,
structural maps and phase diagrams are derived, that will guide a rational
choice of a catalyst and growth parameters towards a better selectivity.
|
cond-mat.mtrl-sci
|
singlewalled carbon nanotubes are hollow cylinders that can grow centimeters long by carbon incorporation at the interface with a catalyst they display semiconducting or metallic characteristics depending on their helicity that is determined during their growth to support the quest for a selective synthesis we develop a thermodynamic model that relates the tubecatalyst interfacial energies temperature and the resulting tube chirality we show that nanotubes can grow chiral because of the configurational entropy of their nanometersized edge thus explaining experimentally observed temperature evolutions of chiral distributions taking the chemical nature of the catalyst into account through interfacial energies structural maps and phase diagrams are derived that will guide a rational choice of a catalyst and growth parameters towards a better selectivity
|
[['singlewalled', 'carbon', 'nanotubes', 'are', 'hollow', 'cylinders', 'that', 'can', 'grow', 'centimeters', 'long', 'by', 'carbon', 'incorporation', 'at', 'the', 'interface', 'with', 'a', 'catalyst', 'they', 'display', 'semiconducting', 'or', 'metallic', 'characteristics', 'depending', 'on', 'their', 'helicity', 'that', 'is', 'determined', 'during', 'their', 'growth', 'to', 'support', 'the', 'quest', 'for', 'a', 'selective', 'synthesis', 'we', 'develop', 'a', 'thermodynamic', 'model', 'that', 'relates', 'the', 'tubecatalyst', 'interfacial', 'energies', 'temperature', 'and', 'the', 'resulting', 'tube', 'chirality', 'we', 'show', 'that', 'nanotubes', 'can', 'grow', 'chiral', 'because', 'of', 'the', 'configurational', 'entropy', 'of', 'their', 'nanometersized', 'edge', 'thus', 'explaining', 'experimentally', 'observed', 'temperature', 'evolutions', 'of', 'chiral', 'distributions', 'taking', 'the', 'chemical', 'nature', 'of', 'the', 'catalyst', 'into', 'account', 'through', 'interfacial', 'energies', 'structural', 'maps', 'and', 'phase', 'diagrams', 'are', 'derived', 'that', 'will', 'guide', 'a', 'rational', 'choice', 'of', 'a', 'catalyst', 'and', 'growth', 'parameters', 'towards', 'a', 'better', 'selectivity']]
|
[-0.11306160767562687, 0.24701372498335938, -0.0824730179621838, -0.0044999551872024314, -0.028881022301114476, -0.13337163404406358, 0.07681180752503375, 0.4617460320703685, -0.2521996289806945, -0.28305955822579565, 0.0371367493198098, -0.24797943142863613, -0.11282936470233836, 0.13735489236423745, 0.02040551232001538, 0.011725076920326198, 0.03291211046598619, -0.07041727801940094, -0.0677799559586371, -0.1824337552350092, 0.24014600351608048, 0.05999001610713701, 0.3393224727207174, 0.13988688189031867, 0.05564279026196649, -0.04129421883650745, 0.0648331904085353, 0.05035514623547594, -0.181377281764253, 0.11347368463951474, 0.22228980711273227, -0.005042392500520994, 0.19656481054456285, -0.5072284404033174, -0.24632467198847127, 0.04139151972873757, 0.15538291755462222, 0.1442482153729846, -0.0667132138905193, -0.22224383576152226, 0.07923998888193941, -0.12040469470472696, -0.14761240567313508, -0.08621299225681772, 0.014149143127724528, 0.0437586424096177, -0.20444282042056633, 0.04221803522571766, 0.07650716757343616, 0.0402213232460781, -0.11773639881672958, -0.14205745835788547, -0.16697198978702849, 0.1249058431344262, 0.03913438899908215, -0.04945369895625239, 0.262891944689909, -0.11172301291953772, -0.06774400162200132, 0.3796760980039835, -0.033032096130773424, -0.12726864137875965, 0.19368722870325047, -0.14479117534356192, -0.07433167668641545, 0.1841001882198422, 0.13932700336154086, 0.08765672356045494, -0.14287587420549244, 0.03084462158003589, 0.026618006336987795, 0.1565303968915638, 0.1039006438300324, 0.04913400529573361, 0.31754830668602757, 0.20448697850612613, 0.02422943975155552, 0.14253704610746354, -0.07339329503204985, -0.06135611663630698, -0.22345992199455697, -0.2236057653091848, -0.17907082893652843, 0.07458641073123241, -0.11469894334792723, -0.217125410574954, 0.37902890885404, 0.08827761954162269, 0.20793214029084386, 0.02948625248391181, 0.21870768538695604, 0.08228262363748702, 0.11208689952618442, -0.022711432294454426, 0.23982190986474355, 0.17053246241412126, 0.11528372009440015, -0.259524979601459, 0.14172951948324528, 0.028928249864839016]
|
1,803.07351
|
Discrete Potts Model for Generating Superpixels on Noisy Images
|
Many computer vision applications, such as object recognition and
segmentation, increasingly build on superpixels. However, there have been so
far few superpixel algorithms that systematically deal with noisy images. We
propose to first decompose the image into equal-sized rectangular patches,
which also sets the maximum superpixel size. Within each patch, a Potts model
for simultaneous segmentation and denoising is applied, that guarantees
connected and non-overlapping superpixels and also produces a denoised image.
The corresponding optimization problem is formulated as a mixed integer linear
program (MILP), and solved by a commercial solver. Extensive experiments on the
BSDS500 dataset images with noises are compared with other state-of-the-art
superpixel methods. Our method achieves the best result in terms of a combined
score (OP) composed of the under-segmentation error, boundary recall and
compactness.
|
cs.CV
|
many computer vision applications such as object recognition and segmentation increasingly build on superpixels however there have been so far few superpixel algorithms that systematically deal with noisy images we propose to first decompose the image into equalsized rectangular patches which also sets the maximum superpixel size within each patch a potts model for simultaneous segmentation and denoising is applied that guarantees connected and nonoverlapping superpixels and also produces a denoised image the corresponding optimization problem is formulated as a mixed integer linear program milp and solved by a commercial solver extensive experiments on the bsds500 dataset images with noises are compared with other stateoftheart superpixel methods our method achieves the best result in terms of a combined score op composed of the undersegmentation error boundary recall and compactness
|
[['many', 'computer', 'vision', 'applications', 'such', 'as', 'object', 'recognition', 'and', 'segmentation', 'increasingly', 'build', 'on', 'superpixels', 'however', 'there', 'have', 'been', 'so', 'far', 'few', 'superpixel', 'algorithms', 'that', 'systematically', 'deal', 'with', 'noisy', 'images', 'we', 'propose', 'to', 'first', 'decompose', 'the', 'image', 'into', 'equalsized', 'rectangular', 'patches', 'which', 'also', 'sets', 'the', 'maximum', 'superpixel', 'size', 'within', 'each', 'patch', 'a', 'potts', 'model', 'for', 'simultaneous', 'segmentation', 'and', 'denoising', 'is', 'applied', 'that', 'guarantees', 'connected', 'and', 'nonoverlapping', 'superpixels', 'and', 'also', 'produces', 'a', 'denoised', 'image', 'the', 'corresponding', 'optimization', 'problem', 'is', 'formulated', 'as', 'a', 'mixed', 'integer', 'linear', 'program', 'milp', 'and', 'solved', 'by', 'a', 'commercial', 'solver', 'extensive', 'experiments', 'on', 'the', 'bsds500', 'dataset', 'images', 'with', 'noises', 'are', 'compared', 'with', 'other', 'stateoftheart', 'superpixel', 'methods', 'our', 'method', 'achieves', 'the', 'best', 'result', 'in', 'terms', 'of', 'a', 'combined', 'score', 'op', 'composed', 'of', 'the', 'undersegmentation', 'error', 'boundary', 'recall', 'and', 'compactness']]
|
[-0.012030465593344943, -0.041159337954126414, -0.06773257423047871, 0.04718851159749076, -0.06804432600462275, -0.18238446452517726, -0.013899610861558323, 0.46989758396449016, -0.24871355272981144, -0.3533455262126675, 0.15301330726460172, -0.278469794538132, -0.13912459094774035, 0.17303439150492178, -0.13156195604892143, 0.11810969701397789, 0.1770022625605352, 0.06122277533841254, -0.06348169938292961, -0.3072762148736348, 0.23035209054170652, -0.023170831772072832, 0.30569708397496465, -0.008228831379421691, 0.15143887872641631, -0.034895011570391266, -0.03329355461349667, 0.08896123589370256, -0.05769441445241231, 0.1452498496988384, 0.31891075951993003, 0.1682742519228351, 0.3133860159044464, -0.4157719597321495, -0.21087532151894745, 0.07066451769697574, 0.15470533815750404, 0.07752783254940467, -0.057938461367026434, -0.3609013494136635, 0.10531599308064482, -0.10743536203810873, 0.06398891782037942, -0.09570589542836529, -0.00915104845834737, -0.019413389992004967, -0.31256536599393037, 0.05705175957193078, 0.061336679174519654, 0.05243730335496366, -0.09018087491407528, -0.18388122008290403, 0.0157807789428896, 0.1406096344156725, -0.008968092599529917, 0.09719894664333195, 0.13720469286596734, -0.16537212578818028, -0.15433391915497102, 0.37972015729751585, -0.02715743469911837, -0.2415612637473256, 0.18882589236573252, -0.014979839476561823, -0.1471490958225444, 0.15059606713611026, 0.20447325696374558, 0.15350325386826844, -0.1156178545062394, 0.03303131290130289, -0.08914477422079, 0.20974550838762707, 0.10325117182174279, -0.03898225248386982, 0.160766869207642, 0.23012419346026902, 0.10562645135376993, 0.19355283057282846, -0.161844357619849, -0.037375719835187574, -0.2106411987324252, -0.07111465516536272, -0.23227085990383645, -0.08741360784385556, -0.12121566970829939, -0.18802821694678346, 0.3950075970515031, 0.1943571187570229, 0.1954372792194287, 0.11806212159599243, 0.37449165875482004, 0.05615072372927179, 0.11172499638339577, 0.07074270675738537, 0.1482842689796979, 0.05432454600042209, 0.05729850579112725, -0.15920369426698186, 0.034701681699488285, 0.13425605317808745]
|
1,803.07352
|
Disentangling top-down vs. bottom-up and low-level vs. high-level
influences on eye movements over time
|
Bottom-up and top-down, as well as low-level and high-level factors influence
where we fixate when viewing natural scenes. However, the importance of each of
these factors and how they interact remains a matter of debate. Here, we
disentangle these factors by analysing their influence over time. For this
purpose we develop a saliency model which is based on the internal
representation of a recent early spatial vision model to measure the low-level
bottom-up factor. To measure the influence of high-level bottom-up features, we
use a recent DNN-based saliency model. To account for top-down influences, we
evaluate the models on two large datasets with different tasks: first, a
memorisation task and, second, a search task. Our results lend support to a
separation of visual scene exploration into three phases: The first saccade, an
initial guided exploration characterised by a gradual broadening of the
fixation density, and an steady state which is reached after roughly 10
fixations. Saccade target selection during the initial exploration and in the
steady state are related to similar areas of interest, which are better
predicted when including high-level features. In the search dataset, fixation
locations are determined predominantly by top-down processes. In contrast, the
first fixation follows a different fixation density and contains a strong
central fixation bias. Nonetheless, first fixations are guided strongly by
image properties and as early as 200 ms after image onset, fixations are better
predicted by high-level information. We conclude that any low-level bottom-up
factors are mainly limited to the generation of the first saccade. All saccades
are better explained when high-level features are considered, and later this
high-level bottom-up control can be overruled by top-down influences.
|
q-bio.NC
|
bottomup and topdown as well as lowlevel and highlevel factors influence where we fixate when viewing natural scenes however the importance of each of these factors and how they interact remains a matter of debate here we disentangle these factors by analysing their influence over time for this purpose we develop a saliency model which is based on the internal representation of a recent early spatial vision model to measure the lowlevel bottomup factor to measure the influence of highlevel bottomup features we use a recent dnnbased saliency model to account for topdown influences we evaluate the models on two large datasets with different tasks first a memorisation task and second a search task our results lend support to a separation of visual scene exploration into three phases the first saccade an initial guided exploration characterised by a gradual broadening of the fixation density and an steady state which is reached after roughly 10 fixations saccade target selection during the initial exploration and in the steady state are related to similar areas of interest which are better predicted when including highlevel features in the search dataset fixation locations are determined predominantly by topdown processes in contrast the first fixation follows a different fixation density and contains a strong central fixation bias nonetheless first fixations are guided strongly by image properties and as early as 200 ms after image onset fixations are better predicted by highlevel information we conclude that any lowlevel bottomup factors are mainly limited to the generation of the first saccade all saccades are better explained when highlevel features are considered and later this highlevel bottomup control can be overruled by topdown influences
|
[['bottomup', 'and', 'topdown', 'as', 'well', 'as', 'lowlevel', 'and', 'highlevel', 'factors', 'influence', 'where', 'we', 'fixate', 'when', 'viewing', 'natural', 'scenes', 'however', 'the', 'importance', 'of', 'each', 'of', 'these', 'factors', 'and', 'how', 'they', 'interact', 'remains', 'a', 'matter', 'of', 'debate', 'here', 'we', 'disentangle', 'these', 'factors', 'by', 'analysing', 'their', 'influence', 'over', 'time', 'for', 'this', 'purpose', 'we', 'develop', 'a', 'saliency', 'model', 'which', 'is', 'based', 'on', 'the', 'internal', 'representation', 'of', 'a', 'recent', 'early', 'spatial', 'vision', 'model', 'to', 'measure', 'the', 'lowlevel', 'bottomup', 'factor', 'to', 'measure', 'the', 'influence', 'of', 'highlevel', 'bottomup', 'features', 'we', 'use', 'a', 'recent', 'dnnbased', 'saliency', 'model', 'to', 'account', 'for', 'topdown', 'influences', 'we', 'evaluate', 'the', 'models', 'on', 'two', 'large', 'datasets', 'with', 'different', 'tasks', 'first', 'a', 'memorisation', 'task', 'and', 'second', 'a', 'search', 'task', 'our', 'results', 'lend', 'support', 'to', 'a', 'separation', 'of', 'visual', 'scene', 'exploration', 'into', 'three', 'phases', 'the', 'first', 'saccade', 'an', 'initial', 'guided', 'exploration', 'characterised', 'by', 'a', 'gradual', 'broadening', 'of', 'the', 'fixation', 'density', 'and', 'an', 'steady', 'state', 'which', 'is', 'reached', 'after', 'roughly', '10', 'fixations', 'saccade', 'target', 'selection', 'during', 'the', 'initial', 'exploration', 'and', 'in', 'the', 'steady', 'state', 'are', 'related', 'to', 'similar', 'areas', 'of', 'interest', 'which', 'are', 'better', 'predicted', 'when', 'including', 'highlevel', 'features', 'in', 'the', 'search', 'dataset', 'fixation', 'locations', 'are', 'determined', 'predominantly', 'by', 'topdown', 'processes', 'in', 'contrast', 'the', 'first', 'fixation', 'follows', 'a', 'different', 'fixation', 'density', 'and', 'contains', 'a', 'strong', 'central', 'fixation', 'bias', 'nonetheless', 'first', 'fixations', 'are', 'guided', 'strongly', 'by', 'image', 'properties', 'and', 'as', 'early', 'as', '200', 'ms', 'after', 'image', 'onset', 'fixations', 'are', 'better', 'predicted', 'by', 'highlevel', 'information', 'we', 'conclude', 'that', 'any', 'lowlevel', 'bottomup', 'factors', 'are', 'mainly', 'limited', 'to', 'the', 'generation', 'of', 'the', 'first', 'saccade', 'all', 'saccades', 'are', 'better', 'explained', 'when', 'highlevel', 'features', 'are', 'considered', 'and', 'later', 'this', 'highlevel', 'bottomup', 'control', 'can', 'be', 'overruled', 'by', 'topdown', 'influences']]
|
[-0.028736418825997548, 0.12870387673028744, -0.1036637077158825, 0.06976964606818828, -0.08408327988264236, -0.12474618080495434, 0.04224233615635471, 0.45311512277546256, -0.2617112162472172, -0.35005205767313863, 0.0792058539005335, -0.22699648920277302, -0.15773182424801316, 0.13079150667160072, -0.09237737332386049, 0.03621708857890388, 0.07596650386313823, 0.029987226711078122, -0.04529773464680396, -0.2162823872670362, 0.29903213479736057, 0.05767197492447766, 0.3025377180579711, 0.021895739825611764, 0.09394690131175924, -0.03163589377675883, -0.06239436171864244, 0.008211881975558671, -0.07999036718257808, 0.13016867175613614, 0.26781998928695844, 0.18350229116453026, 0.28878383039781264, -0.45139675675383345, -0.23402199257842518, 0.042211255658079275, 0.1428721234202385, 0.12405240171636582, -0.04265182940045964, -0.3520336372981017, 0.08428625251081857, -0.13467698741413187, -0.008630765622312372, -0.09223694285272029, 0.03762653954496438, 0.0072813635302538225, -0.2459265334235335, 0.05772968601012094, 0.0890979136784815, 0.07033980226059529, -0.06643632979386233, -0.11313169199380685, -0.03470399756492539, 0.21445746577842245, 0.03185408259699629, 0.0619589235548946, 0.20214663969755003, -0.21367213411899602, -0.15133616488426924, 0.378866551857103, -0.05621814910576425, -0.1481306420726998, 0.2372300796066834, -0.10270276340407276, -0.15818740801462394, 0.1244613653912463, 0.19075437282783572, 0.1381944906914776, -0.15003627697847233, -0.03809684245699001, 0.014194771716032516, 0.17961573640392586, 0.05478708437220617, 0.004556964798407121, 0.2594667052257467, 0.24809389931488443, 0.006951837715777484, 0.11455349672352895, -0.09069722098552369, -0.09331551538611, -0.256004877818579, -0.09170033059506254, -0.13438134086783976, -0.01620662754316899, -0.08564787170548119, -0.09763928732623092, 0.42218308817595246, 0.18652656367852946, 0.2661073197962039, 0.05892854764168574, 0.3120437567816539, 0.08428338010245087, 0.06155469534283673, 0.04206435831729323, 0.19240634289316155, 0.008636061615225944, 0.07713038404260508, -0.18524535698276437, 0.12581156259402632, 0.03577536197548563]
|
1,803.07353
|
Bottom of spectra and amenability of coverings
|
For a Riemannian covering $\pi\colon M_1\to M_0$, the bottoms of the spectra
of $M_0$ and $M_1$ coincide if the covering is amenable. The converse
implication does not always hold. Assuming completeness and a lower bound on
the Ricci curvature, we obtain a converse under a natural condition on the
spectrum of $M_0$.
|
math.DG math.SP
|
for a riemannian covering picolon m_1to m_0 the bottoms of the spectra of m_0 and m_1 coincide if the covering is amenable the converse implication does not always hold assuming completeness and a lower bound on the ricci curvature we obtain a converse under a natural condition on the spectrum of m_0
|
[['for', 'a', 'riemannian', 'covering', 'picolon', 'm_1to', 'm_0', 'the', 'bottoms', 'of', 'the', 'spectra', 'of', 'm_0', 'and', 'm_1', 'coincide', 'if', 'the', 'covering', 'is', 'amenable', 'the', 'converse', 'implication', 'does', 'not', 'always', 'hold', 'assuming', 'completeness', 'and', 'a', 'lower', 'bound', 'on', 'the', 'ricci', 'curvature', 'we', 'obtain', 'a', 'converse', 'under', 'a', 'natural', 'condition', 'on', 'the', 'spectrum', 'of', 'm_0']]
|
[-0.1913003628500379, 0.13455878127402124, -0.09917884662998123, 0.14017077744266807, -0.0989481025429156, -0.150298569817096, 0.04380540766466696, 0.35406922076184016, -0.19087967375078455, -0.2257912784922295, 0.1662815410303525, -0.22174517129762814, -0.04633485946732645, 0.24720778859829387, -0.10119949463898173, -0.05883189839481089, 0.05082042649603234, 0.13558189062258372, -0.10296050154675658, -0.21591193200527833, 0.38846512891065615, -0.05661058626495875, 0.22868767314447233, 0.1571986975737113, 0.10769148791083492, 0.010488567318624029, 0.06090075019388818, 0.004911228656195677, -0.2675619146141868, 0.07485888848000635, 0.14161545181503662, 0.13089115208444688, 0.17369269979043075, -0.253760676114605, -0.14243646052021247, 0.17917125706131068, 0.09668992339776686, -0.04464012233970257, -0.05828517501000673, -0.2321898040290062, 0.15642851157687032, -0.10082422311489399, -0.0953333598478751, 0.013708824515700914, -0.007356717609442198, -0.07459509364203908, -0.3014268717244984, 0.10557935125409411, 0.20045356577835405, 0.036386387709241644, -0.11825122902742945, -0.13989315464053875, -0.09618588147434191, 0.07545828165558095, 0.014235924221933462, -0.014516223383207735, 0.07114158067941809, -0.0779146174273382, 3.926061953489597e-07, 0.3820801442130827, -0.10552574866093122, -0.2283496716991067, 0.12484999283669122, -0.18579186425687602, -0.15316015249342085, 0.12004351285465348, 0.11191582067224842, 0.1877420746918338, -0.04352674725053545, 0.24191862828089283, -0.1360544330941943, 0.18183350598869416, 0.10378648321001002, 0.04022158037584562, 0.17306300976242012, 0.09661081085841243, 0.22644583612250593, 0.07670998987920868, 0.006688601677664197, -0.005375677934632852, -0.4020532275048586, -0.1736647279254752, -0.2030784967713631, 0.17480613923516314, -0.10086781362266405, -0.13977401956127813, 0.3050422837169698, 0.024980891639223464, 0.22568617861431378, 0.18780445826884645, 0.25128303333902013, 0.07009760578736089, 0.058808990861647405, 0.12952781122070378, 0.26635468600747675, 0.23233069414989307, 0.02546120143065659, -0.13310130725865468, -0.010221898385610145, 0.08059985997925441]
|
1,803.07354
|
Anisotropy in electrical conductivity and transparency of films of
aligned conducting rods
|
Numerical simulations by means of the Monte Carlo method have been performed
to study the electrical properties of a two-dimensional composite filled with
rodlike particles. The main goal was to study the effect of the alignment of
such rods on the anisotropy of its electrical conductivity. A continuous model
was used. In this model, the rods have zero-width (i.e. infinite aspect ratio)
and they may intersect each other. To involve both the low conductive host
matrix, and highly conductive fillers (rods) in the consideration, a
discretization algorithm based on the use of a supporting mesh was applied. The
discretization is equivalent to the substitution of rods with the polyominoes.
Once discretized, the Frank--Lobb algorithm was applied to evaluate the
electrical conductivity. Our main findings are (i) the alignment of the rods
essentially affects the electrical conductivity and its anisotropy, (ii)the
discrete nature of computer simulations is crucial. For slightly disordered
system, high electrical anisotropy was observed at small filler content,
suggesting a method to enable the production of optically transparent and
highly anisotropic conducting films.
|
cond-mat.stat-mech
|
numerical simulations by means of the monte carlo method have been performed to study the electrical properties of a twodimensional composite filled with rodlike particles the main goal was to study the effect of the alignment of such rods on the anisotropy of its electrical conductivity a continuous model was used in this model the rods have zerowidth ie infinite aspect ratio and they may intersect each other to involve both the low conductive host matrix and highly conductive fillers rods in the consideration a discretization algorithm based on the use of a supporting mesh was applied the discretization is equivalent to the substitution of rods with the polyominoes once discretized the franklobb algorithm was applied to evaluate the electrical conductivity our main findings are i the alignment of the rods essentially affects the electrical conductivity and its anisotropy iithe discrete nature of computer simulations is crucial for slightly disordered system high electrical anisotropy was observed at small filler content suggesting a method to enable the production of optically transparent and highly anisotropic conducting films
|
[['numerical', 'simulations', 'by', 'means', 'of', 'the', 'monte', 'carlo', 'method', 'have', 'been', 'performed', 'to', 'study', 'the', 'electrical', 'properties', 'of', 'a', 'twodimensional', 'composite', 'filled', 'with', 'rodlike', 'particles', 'the', 'main', 'goal', 'was', 'to', 'study', 'the', 'effect', 'of', 'the', 'alignment', 'of', 'such', 'rods', 'on', 'the', 'anisotropy', 'of', 'its', 'electrical', 'conductivity', 'a', 'continuous', 'model', 'was', 'used', 'in', 'this', 'model', 'the', 'rods', 'have', 'zerowidth', 'ie', 'infinite', 'aspect', 'ratio', 'and', 'they', 'may', 'intersect', 'each', 'other', 'to', 'involve', 'both', 'the', 'low', 'conductive', 'host', 'matrix', 'and', 'highly', 'conductive', 'fillers', 'rods', 'in', 'the', 'consideration', 'a', 'discretization', 'algorithm', 'based', 'on', 'the', 'use', 'of', 'a', 'supporting', 'mesh', 'was', 'applied', 'the', 'discretization', 'is', 'equivalent', 'to', 'the', 'substitution', 'of', 'rods', 'with', 'the', 'polyominoes', 'once', 'discretized', 'the', 'franklobb', 'algorithm', 'was', 'applied', 'to', 'evaluate', 'the', 'electrical', 'conductivity', 'our', 'main', 'findings', 'are', 'i', 'the', 'alignment', 'of', 'the', 'rods', 'essentially', 'affects', 'the', 'electrical', 'conductivity', 'and', 'its', 'anisotropy', 'iithe', 'discrete', 'nature', 'of', 'computer', 'simulations', 'is', 'crucial', 'for', 'slightly', 'disordered', 'system', 'high', 'electrical', 'anisotropy', 'was', 'observed', 'at', 'small', 'filler', 'content', 'suggesting', 'a', 'method', 'to', 'enable', 'the', 'production', 'of', 'optically', 'transparent', 'and', 'highly', 'anisotropic', 'conducting', 'films']]
|
[-0.10404524907818996, 0.14720447429854955, -0.06864100957023246, -0.016530773822617317, -0.04864718070120684, -0.14043094010491455, 0.023699900358915327, 0.4279251386863845, -0.2600579879699009, -0.30992462695975387, 0.0784680601142879, -0.30180482094425576, -0.11541409972789032, 0.1498191767265754, -0.0013142173384715404, 0.07600454124422477, 0.019342689822827067, -0.04846180755778083, -0.03608734690251627, -0.225449729620346, 0.2374899016812976, 0.0756263821891376, 0.33343631559982895, 0.06660161198649023, 0.07916060385959489, 0.007497545001429639, -0.007762645465388362, 0.08320882749610714, -0.12017907869735998, 0.09722817211944078, 0.19792846602786865, -0.04854622007746782, 0.21103577075260027, -0.46211137124470303, -0.19684464136271604, 0.04739885861320155, 0.14855551298308586, 0.10352788040946637, -0.0463627688786281, -0.2252249685462032, 0.08413955645286478, -0.11496445142530969, -0.13604685262909957, -0.03526490241954369, -0.014367381401825696, 0.04434781022935307, -0.23453694791965451, 0.07981211214193276, 0.04322535941909467, 0.058661667024716736, -0.09510963470542005, -0.12036957666211362, -0.039989297737234406, 0.11120604049946581, 0.040528997291943855, -0.0050207393722874775, 0.17933615946876152, -0.09502468194043363, -0.07314195162284055, 0.41589840579777954, -0.012100668457735862, -0.2109559604259474, 0.2052703549619764, -0.13491422328831895, -0.08115882171317935, 0.18099203631814037, 0.1620510775915214, 0.12326836087874003, -0.13854098564812115, 0.05115179681368837, -0.02201720414949315, 0.18605635610076465, 0.018252728302031757, -0.04140625458742891, 0.22701923554663414, 0.23514227033193622, 0.002291610057332686, 0.19134705950140155, -0.08933313113038562, -0.0525576900078782, -0.20515298438624346, -0.18137668092602066, -0.22271321375654743, 0.03635344764882965, -0.10677229968598112, -0.2275053290463984, 0.3661506054656846, 0.14865497065774563, 0.14862441362280931, -0.0012838735338300466, 0.2951814598377262, 0.08540144913231155, 0.07442403782192351, 0.027058889272489717, 0.26334511432264535, 0.1815365046043215, 0.12887196101913495, -0.2571740119957498, 0.10898048224991985, 0.052599500847448195]
|
1,803.07355
|
Double-slit photoelectron interference in strong-field ionization of the
neon dimer
|
Wave-particle duality is an inherent peculiarity of the quantum world. The
double-slit experiment has been frequently used for understanding different
aspects of this fundamental concept. The occurrence of interference rests on
the lack of which-way information and on the absence of decoherence mechanisms,
which could scramble the wave fronts. In this letter, we report on the
observation of two-center interference in the molecular frame photoelectron
momentum distribution upon ionization of the neon dimer by a strong laser
field. Postselection of ions, which were measured in coincidence with
electrons, allowed choosing the symmetry of the continuum electronic wave
function, leading to observation of both, gerade and ungerade, types of
interference.
|
physics.atom-ph
|
waveparticle duality is an inherent peculiarity of the quantum world the doubleslit experiment has been frequently used for understanding different aspects of this fundamental concept the occurrence of interference rests on the lack of whichway information and on the absence of decoherence mechanisms which could scramble the wave fronts in this letter we report on the observation of twocenter interference in the molecular frame photoelectron momentum distribution upon ionization of the neon dimer by a strong laser field postselection of ions which were measured in coincidence with electrons allowed choosing the symmetry of the continuum electronic wave function leading to observation of both gerade and ungerade types of interference
|
[['waveparticle', 'duality', 'is', 'an', 'inherent', 'peculiarity', 'of', 'the', 'quantum', 'world', 'the', 'doubleslit', 'experiment', 'has', 'been', 'frequently', 'used', 'for', 'understanding', 'different', 'aspects', 'of', 'this', 'fundamental', 'concept', 'the', 'occurrence', 'of', 'interference', 'rests', 'on', 'the', 'lack', 'of', 'whichway', 'information', 'and', 'on', 'the', 'absence', 'of', 'decoherence', 'mechanisms', 'which', 'could', 'scramble', 'the', 'wave', 'fronts', 'in', 'this', 'letter', 'we', 'report', 'on', 'the', 'observation', 'of', 'twocenter', 'interference', 'in', 'the', 'molecular', 'frame', 'photoelectron', 'momentum', 'distribution', 'upon', 'ionization', 'of', 'the', 'neon', 'dimer', 'by', 'a', 'strong', 'laser', 'field', 'postselection', 'of', 'ions', 'which', 'were', 'measured', 'in', 'coincidence', 'with', 'electrons', 'allowed', 'choosing', 'the', 'symmetry', 'of', 'the', 'continuum', 'electronic', 'wave', 'function', 'leading', 'to', 'observation', 'of', 'both', 'gerade', 'and', 'ungerade', 'types', 'of', 'interference']]
|
[-0.15207326972703322, 0.14466782944362905, -0.08711943749942894, 0.05628989919178495, -0.0430885559340956, -0.0911359833681597, 0.06155752356232511, 0.3658749137688941, -0.23046911636863007, -0.30891979638758915, -0.018923110902147076, -0.25856855940159174, -0.12047187691776577, 0.12727390582579265, -0.018247791258361908, 0.0619305430584664, 0.037106003436054864, -0.0043405575609398546, -0.037519714461827496, -0.15531424209347353, 0.33865931793970455, 0.10280999968388041, 0.3229710045313343, 0.10142456578227495, 0.09570499179551566, 0.0635521657286434, -0.015132029892218837, -0.05858426857227032, -0.09769030555296655, 0.09045554853339227, 0.23154275590519702, 0.10431497864459359, 0.2399328722225485, -0.47844000145314486, -0.22635641912374338, 0.04410303038557769, 0.14107505017528396, 0.15300734353320108, -0.055543454469677164, -0.3332771840120811, -0.048726301794068526, -0.11209778436630485, -0.11489500480046103, 0.0001551933135888582, -0.00755465257413036, 0.032796004481630725, -0.21245739172392208, 0.07903552662854621, 0.050468482218101754, 0.048800885678405674, -0.020780412574221783, -0.06619689204311426, 0.01010708787281989, 0.07695106410051893, 0.04744699891921509, 0.012256572382960367, 0.1320455986728738, -0.12193526808650942, -0.16468474350510798, 0.3876388333908735, -0.018572207339483938, -0.13045219258072044, 0.19967695005203878, -0.20195337604953473, -0.0949158322113062, 0.17738095809141635, 0.11270258393685478, 0.06885529794770831, -0.1392037583976437, 0.040020064167772346, -0.040764972404950646, 0.17072335610149103, 0.15112899538608046, 0.14936026156700533, 0.22937135565855088, 0.138792629001252, -0.0039271338535216424, 0.11550612054624244, -0.14960360857487204, -0.12158185952351591, -0.30035359853314697, -0.15905980416893994, -0.18486724814417166, 0.07006889312403114, -0.01883644226552927, -0.12890530218703483, 0.39020246550560406, 0.12242307773056449, 0.13759321874913272, -0.08852189013503765, 0.2889077490657021, 0.12520139087247875, 0.019744242678199887, -0.04404053352175093, 0.2924142682224239, 0.15994950074386363, 0.09077581351007753, -0.32580567671225297, 0.1051460806229109, 0.010890412313111742]
|
1,803.07356
|
Classical and quantum rotation numbers of asymmetric top molecules
|
We study the classical and quantum rotation numbers of the free rotation of
asymmetric top molecules. We show numerically that the quantum rotation number
converges to its classical analog in the semi-classical limit. Different
asymmetric molecules such as the water molecule are taken as illustrative
example. A simple approximation of the classical rotation number is derived in
a neighborhood of the separatrix connecting the two unstable fixed points of
the system. Furthermore, a signature of the classical tennis racket effect in
the spectrum of asymmetric molecules is identified.
|
quant-ph
|
we study the classical and quantum rotation numbers of the free rotation of asymmetric top molecules we show numerically that the quantum rotation number converges to its classical analog in the semiclassical limit different asymmetric molecules such as the water molecule are taken as illustrative example a simple approximation of the classical rotation number is derived in a neighborhood of the separatrix connecting the two unstable fixed points of the system furthermore a signature of the classical tennis racket effect in the spectrum of asymmetric molecules is identified
|
[['we', 'study', 'the', 'classical', 'and', 'quantum', 'rotation', 'numbers', 'of', 'the', 'free', 'rotation', 'of', 'asymmetric', 'top', 'molecules', 'we', 'show', 'numerically', 'that', 'the', 'quantum', 'rotation', 'number', 'converges', 'to', 'its', 'classical', 'analog', 'in', 'the', 'semiclassical', 'limit', 'different', 'asymmetric', 'molecules', 'such', 'as', 'the', 'water', 'molecule', 'are', 'taken', 'as', 'illustrative', 'example', 'a', 'simple', 'approximation', 'of', 'the', 'classical', 'rotation', 'number', 'is', 'derived', 'in', 'a', 'neighborhood', 'of', 'the', 'separatrix', 'connecting', 'the', 'two', 'unstable', 'fixed', 'points', 'of', 'the', 'system', 'furthermore', 'a', 'signature', 'of', 'the', 'classical', 'tennis', 'racket', 'effect', 'in', 'the', 'spectrum', 'of', 'asymmetric', 'molecules', 'is', 'identified']]
|
[-0.18829226339320568, 0.12101744441315532, -0.09041618384865367, 0.09779829425282184, -0.013156539085850289, -0.12068015185650438, 0.06306937499373982, 0.3125842551420316, -0.27832917792891915, -0.27075998912650073, 0.06834511189134157, -0.25489083711396565, -0.1514600416306745, 0.206476881634444, -0.018728703017007898, 0.03668942540521543, 0.039902836237822405, 0.09014138872258957, -0.03206591758697124, -0.18586617819329893, 0.2717708103961989, 0.01072535233900205, 0.2411588169343304, 0.0007171104556288232, 0.08417653918149881, -0.025576157625023785, 0.03480864217801189, 0.019981013428398663, -0.11293979663580765, 0.09187521468001333, 0.17661546093454075, 0.0501281946410679, 0.19741404784673994, -0.4174082397525622, -0.1773757655279372, 0.09504593807187947, 0.15193689552622594, 0.16176199123517357, -0.062174790482128046, -0.2484504700193859, 0.04882890755437653, -0.15407879307167605, -0.2048065262814899, -0.028662472531405827, 0.03854125839213587, 0.06954715486922809, -0.20476264265281233, 0.06031704147674397, 0.07363360307433388, 0.08747548584572294, -0.03293859652926172, -0.10481643179214602, -0.07044408948753368, 0.13988760624356059, 0.010712515938476745, -0.013909383691498078, 0.1787676731209186, -0.10173338797705417, -0.10289736685808748, 0.4082475883081894, -0.09919353228178807, -0.1987091313243251, 0.18744867090506226, -0.1441763609393754, -0.09512948815245181, 0.12492294240192595, 0.13419103416063907, 0.13733753926036033, -0.06596673410174182, 0.07680147610517452, -0.10034093041692606, 0.11235962935130704, 0.10531266590855508, 0.01950054209869863, 0.21633056732190942, 0.12563736372711984, 0.04395362233150412, 0.19422102723778648, -0.15696658220986137, -0.20898780556374483, -0.3106822734698653, -0.17693296657473018, -0.19227620904249224, 0.07088103346441957, -0.08234716080303107, -0.1857878612777726, 0.37264401370405476, 0.059061457971851763, 0.19530209539119492, -0.0031147172187708998, 0.32635396337983286, 0.12950085004823367, 0.005406579230277037, 0.041652535956183616, 0.23621177375951613, 0.16665537464326585, 0.05673164770599793, -0.2790769704469395, 0.015663043431810696, 0.05208990925563161]
|
1,803.07357
|
The Dirichlet problem without the maximum principle
|
Consider the Dirichlet problem with respect to an elliptic operator \[ A = -
\sum_{k,l=1}^d \partial_k \, a_{kl} \, \partial_l
- \sum_{k=1}^d \partial_k \, b_k
+ \sum_{k=1}^d c_k \, \partial_k
+ c_0 \] on a bounded Wiener regular open set $\Omega \subset R^d$, where
$a_{kl}, c_k \in L_\infty(\Omega,R)$ and $b_k,c_0 \in L_\infty(\Omega,C)$.
Suppose that the associated operator on $L_2(\Omega)$ with Dirichlet boundary
conditions is invertible. Then we show that for all $\varphi \in C(\partial
\Omega)$ there exists a unique $u \in C(\overline \Omega) \cap H^1_{\rm
loc}(\Omega)$ such that $u|_{\partial \Omega} = \varphi$ and $A u = 0$.
In the case when $\Omega$ has a Lipschitz boundary and $\varphi \in
C(\overline \Omega) \cap H^{1/2}(\overline \Omega)$, then we show that $u$
coincides with the variational solution in $H^1(\Omega)$.
|
math.AP
|
consider the dirichlet problem with respect to an elliptic operator a sum_kl1d partial_k a_kl partial_l sum_k1d partial_k b_k sum_k1d c_k partial_k c_0 on a bounded wiener regular open set omega subset rd where a_kl c_k in l_inftyomegar and b_kc_0 in l_inftyomegac suppose that the associated operator on l_2omega with dirichlet boundary conditions is invertible then we show that for all varphi in cpartial omega there exists a unique u in coverline omega cap h1_rm locomega such that u_partial omega varphi and a u 0 in the case when omega has a lipschitz boundary and varphi in coverline omega cap h12overline omega then we show that u coincides with the variational solution in h1omega
|
[['consider', 'the', 'dirichlet', 'problem', 'with', 'respect', 'to', 'an', 'elliptic', 'operator', 'a', 'sum_kl1d', 'partial_k', 'a_kl', 'partial_l', 'sum_k1d', 'partial_k', 'b_k', 'sum_k1d', 'c_k', 'partial_k', 'c_0', 'on', 'a', 'bounded', 'wiener', 'regular', 'open', 'set', 'omega', 'subset', 'rd', 'where', 'a_kl', 'c_k', 'in', 'l_inftyomegar', 'and', 'b_kc_0', 'in', 'l_inftyomegac', 'suppose', 'that', 'the', 'associated', 'operator', 'on', 'l_2omega', 'with', 'dirichlet', 'boundary', 'conditions', 'is', 'invertible', 'then', 'we', 'show', 'that', 'for', 'all', 'varphi', 'in', 'cpartial', 'omega', 'there', 'exists', 'a', 'unique', 'u', 'in', 'coverline', 'omega', 'cap', 'h1_rm', 'locomega', 'such', 'that', 'u_partial', 'omega', 'varphi', 'and', 'a', 'u', '0', 'in', 'the', 'case', 'when', 'omega', 'has', 'a', 'lipschitz', 'boundary', 'and', 'varphi', 'in', 'coverline', 'omega', 'cap', 'h12overline', 'omega', 'then', 'we', 'show', 'that', 'u', 'coincides', 'with', 'the', 'variational', 'solution', 'in', 'h1omega']]
|
[-0.21117721915612458, 0.09934516713878144, 0.0035093601989568375, -0.02858833527222378, -0.09275984356325086, -0.1647310977536809, -0.007539549893742308, 0.3622784213667069, -0.35092340479818507, -0.02278841529393979, 0.11481424441631592, -0.38592603850528734, -0.07725220224008374, 0.1517383167744452, -0.11063636096467802, 0.03955790730740089, 0.06420091005606116, 0.15844028867746984, -0.032218878082674714, -0.12789516004204, 0.3635061946483927, -0.24190762614267408, 0.11098353423759205, 0.07915444100924998, 0.1047543836244886, -0.05783622935756084, 0.0944892505078081, -0.031504675938209534, -0.2890086306268114, 0.010116897231830848, 0.23459994113884455, 0.09970761577966153, 0.31097810313857477, -0.32322309830935175, -0.10253834543288301, 0.22099588169724843, 0.1351089679482265, -0.19269267784927144, 0.002492467007693758, -0.28930762319381287, 0.13246201841510968, -0.07706279907409751, -0.12180667326341324, -0.008418478590218402, 0.13896371372719082, 0.02338161725559434, -0.44866231459816663, 0.07521638879979696, 0.08293791440712851, 0.01867261935674816, -0.12106792890432573, -0.20638673263388352, -0.07849154778469969, -0.007543618710436046, -0.035581030595594795, 0.2635813752069659, -0.02265738178933159, -0.05394021867253228, 0.004928195156977264, 0.337751065406504, -0.14512406820495433, -0.3314712066032471, 0.0445267789176913, -0.2523033880209977, -0.15649696621497017, 0.025325789928026157, 0.057960964042966794, 0.16095418022911345, -0.04560375559331161, 0.3452565828322245, -0.13927074307960313, 0.14450499660083427, 0.1579336255934055, -0.03380131457159039, 0.004282736791930067, 0.062053479807485545, 0.1918289030842278, 0.0940478383777065, 0.03432503130250619, 0.02619665747064106, -0.3962810884887746, -0.11021252382555208, -0.1278792723400279, 0.1569495953260622, -0.09767669581964616, -0.2208265522238585, 0.23911860043294045, 0.03460743300266427, 0.20997443572199398, 0.05507009810503196, 0.15942458675452295, 0.11610982339701577, -0.03504964648617791, 0.14741347077806746, 0.035917374702734414, 0.12567268876965507, 0.05681739457019972, -0.241674358228119, -0.025116065115488452, 0.13902396774984824]
|
1,803.07358
|
Self-Controlled Jamming Resilient Design Using Physical Layer Secret
Keys
|
Direct-sequence spread spectrum (DSSS) has been recognized as an effective
jamming resilient technique. However, the effectiveness of DSSS relies on the
use of either pre-shared unique secret keys or a bank of public codes, which
can be prohibitively expensive in future large-scale decentralized wireless
networks, e.g., the Internet of Things. To tackle this problem, in this work we
develop a new framework for self-controlled physical-layer-security-based
spreading sequence generation. Specifically, we exploit the shared randomness
inherent in wireless channels to generate and refresh secret seeds at each
communicating node using shared randomness extraction, entropy pooling and
random seed generation. The generated secret seeds are then utilized to perform
DSSS. To evaluate the performance, we implement our framework on software
defined radio platform and examine the successful transmission probability of
the system under various models of broadband jamming along with an special case
wherein adversary is assumed to have leaked information on key rate. Both our
analysis and real-world measurements confirm that communication systems based
on our framework can achieve jamming-resilient communications without requiring
pre-shared sequences.
|
cs.IT math.IT
|
directsequence spread spectrum dsss has been recognized as an effective jamming resilient technique however the effectiveness of dsss relies on the use of either preshared unique secret keys or a bank of public codes which can be prohibitively expensive in future largescale decentralized wireless networks eg the internet of things to tackle this problem in this work we develop a new framework for selfcontrolled physicallayersecuritybased spreading sequence generation specifically we exploit the shared randomness inherent in wireless channels to generate and refresh secret seeds at each communicating node using shared randomness extraction entropy pooling and random seed generation the generated secret seeds are then utilized to perform dsss to evaluate the performance we implement our framework on software defined radio platform and examine the successful transmission probability of the system under various models of broadband jamming along with an special case wherein adversary is assumed to have leaked information on key rate both our analysis and realworld measurements confirm that communication systems based on our framework can achieve jammingresilient communications without requiring preshared sequences
|
[['directsequence', 'spread', 'spectrum', 'dsss', 'has', 'been', 'recognized', 'as', 'an', 'effective', 'jamming', 'resilient', 'technique', 'however', 'the', 'effectiveness', 'of', 'dsss', 'relies', 'on', 'the', 'use', 'of', 'either', 'preshared', 'unique', 'secret', 'keys', 'or', 'a', 'bank', 'of', 'public', 'codes', 'which', 'can', 'be', 'prohibitively', 'expensive', 'in', 'future', 'largescale', 'decentralized', 'wireless', 'networks', 'eg', 'the', 'internet', 'of', 'things', 'to', 'tackle', 'this', 'problem', 'in', 'this', 'work', 'we', 'develop', 'a', 'new', 'framework', 'for', 'selfcontrolled', 'physicallayersecuritybased', 'spreading', 'sequence', 'generation', 'specifically', 'we', 'exploit', 'the', 'shared', 'randomness', 'inherent', 'in', 'wireless', 'channels', 'to', 'generate', 'and', 'refresh', 'secret', 'seeds', 'at', 'each', 'communicating', 'node', 'using', 'shared', 'randomness', 'extraction', 'entropy', 'pooling', 'and', 'random', 'seed', 'generation', 'the', 'generated', 'secret', 'seeds', 'are', 'then', 'utilized', 'to', 'perform', 'dsss', 'to', 'evaluate', 'the', 'performance', 'we', 'implement', 'our', 'framework', 'on', 'software', 'defined', 'radio', 'platform', 'and', 'examine', 'the', 'successful', 'transmission', 'probability', 'of', 'the', 'system', 'under', 'various', 'models', 'of', 'broadband', 'jamming', 'along', 'with', 'an', 'special', 'case', 'wherein', 'adversary', 'is', 'assumed', 'to', 'have', 'leaked', 'information', 'on', 'key', 'rate', 'both', 'our', 'analysis', 'and', 'realworld', 'measurements', 'confirm', 'that', 'communication', 'systems', 'based', 'on', 'our', 'framework', 'can', 'achieve', 'jammingresilient', 'communications', 'without', 'requiring', 'preshared', 'sequences']]
|
[-0.18727248585458064, 0.015304848154618264, -0.04079706903796123, 0.05025066381393455, -0.05649679031786184, -0.2514291085197244, 0.0862205344594766, 0.40689363545023427, -0.2993946069293807, -0.2822351480189841, 0.12291246424679547, -0.26104342751712595, -0.15377128494870956, 0.1896111337118782, -0.12520404256403792, 0.11100111765378198, 0.052565604307537164, 0.019349904965100334, 0.02933837548656346, -0.2798638263525073, 0.3234395010987037, 0.10234550389780685, 0.38054870687923287, 0.024827075643982024, 0.08728146544376085, 0.03575933033798085, -0.0629130476154387, -0.07699368767667734, -0.08203107033329805, 0.13196270060549534, 0.3143812813047568, 0.2068517824572641, 0.32348860949169583, -0.4419683236033158, -0.26740472940294896, 0.1409350376370428, 0.17790604283148898, 0.13265825340018045, -0.08635246403905195, -0.30116013796908003, 0.15758704736139786, -0.2421881554081094, -0.01791863391774187, -0.0727010976393209, -0.07600073513932266, 0.03278071142436644, -0.3188587837462682, -0.005578180756941059, -0.018071094305839305, 0.04005965066337308, 0.021127270688275742, -0.015287453880625626, 0.018867691779146403, 0.21918667630200425, -0.011983382397840275, -0.0006202153846632342, 0.14272606191171203, -0.09669951449866984, -0.16935558557215277, 0.36232711231000286, -0.008672829159687078, -0.17714868371678127, 0.17144018608797884, -0.012529262547316245, -0.14807353387613845, 0.08200415930789245, 0.2714207282704085, 0.09981273616485428, -0.17428487888537347, -0.0043729375066652925, -0.02574762783749679, 0.24579664910730614, 0.06326637832924377, 0.1357370896324472, 0.18524153396449333, 0.17001390889243678, 0.08082491856441985, 0.14099400210516463, -0.09026948672849251, -0.11371530351488916, -0.1814992381300409, -0.12636209485597563, -0.2543756740031017, 0.03831558051142776, -0.08079737699069461, -0.10281374649588712, 0.35437943881139333, 0.20676118211617164, 0.12194279937322663, 0.07999252293429468, 0.39202991211353694, 0.02332245148677747, 0.09686230955074195, 0.14957612679545704, 0.162674454306144, 0.053899943863778096, 0.1323366185411984, -0.15459412152817686, 0.13896518958418436, -0.0004973217576260267]
|
1,803.07359
|
Conductance of fractional Luttinger liquids at finite temperatures
|
We study the electrical conductance in single-mode quantum wires with Rashba
spin-orbit interaction subjected to externally applied magnetic fields in the
regime in which the ratio of spin-orbit momentum to the Fermi momentum is close
to an odd integer, so that a combined effect of multi-electron interaction and
applied magnetic field leads to a partial gap in the spectrum. We study how
this partial gap manifests itself in the temperature dependence of the
fractional conductance of the quantum wire. We use two complementing techniques
based on bosonization: refermionization of the model at a particular value of
the interaction parameter and a semiclassical approach within a dilute soliton
gas approximation of the functional integral. We show how the low-temperature
fractional conductance can be affected by the finite length of the wire, by the
properties of the contacts, and by a shift of the chemical potential, which
takes the system away from the resonance condition. We also predict an internal
resistivity caused by a dissipative coupling between gapped and gapless modes.
|
cond-mat.mes-hall cond-mat.str-el
|
we study the electrical conductance in singlemode quantum wires with rashba spinorbit interaction subjected to externally applied magnetic fields in the regime in which the ratio of spinorbit momentum to the fermi momentum is close to an odd integer so that a combined effect of multielectron interaction and applied magnetic field leads to a partial gap in the spectrum we study how this partial gap manifests itself in the temperature dependence of the fractional conductance of the quantum wire we use two complementing techniques based on bosonization refermionization of the model at a particular value of the interaction parameter and a semiclassical approach within a dilute soliton gas approximation of the functional integral we show how the lowtemperature fractional conductance can be affected by the finite length of the wire by the properties of the contacts and by a shift of the chemical potential which takes the system away from the resonance condition we also predict an internal resistivity caused by a dissipative coupling between gapped and gapless modes
|
[['we', 'study', 'the', 'electrical', 'conductance', 'in', 'singlemode', 'quantum', 'wires', 'with', 'rashba', 'spinorbit', 'interaction', 'subjected', 'to', 'externally', 'applied', 'magnetic', 'fields', 'in', 'the', 'regime', 'in', 'which', 'the', 'ratio', 'of', 'spinorbit', 'momentum', 'to', 'the', 'fermi', 'momentum', 'is', 'close', 'to', 'an', 'odd', 'integer', 'so', 'that', 'a', 'combined', 'effect', 'of', 'multielectron', 'interaction', 'and', 'applied', 'magnetic', 'field', 'leads', 'to', 'a', 'partial', 'gap', 'in', 'the', 'spectrum', 'we', 'study', 'how', 'this', 'partial', 'gap', 'manifests', 'itself', 'in', 'the', 'temperature', 'dependence', 'of', 'the', 'fractional', 'conductance', 'of', 'the', 'quantum', 'wire', 'we', 'use', 'two', 'complementing', 'techniques', 'based', 'on', 'bosonization', 'refermionization', 'of', 'the', 'model', 'at', 'a', 'particular', 'value', 'of', 'the', 'interaction', 'parameter', 'and', 'a', 'semiclassical', 'approach', 'within', 'a', 'dilute', 'soliton', 'gas', 'approximation', 'of', 'the', 'functional', 'integral', 'we', 'show', 'how', 'the', 'lowtemperature', 'fractional', 'conductance', 'can', 'be', 'affected', 'by', 'the', 'finite', 'length', 'of', 'the', 'wire', 'by', 'the', 'properties', 'of', 'the', 'contacts', 'and', 'by', 'a', 'shift', 'of', 'the', 'chemical', 'potential', 'which', 'takes', 'the', 'system', 'away', 'from', 'the', 'resonance', 'condition', 'we', 'also', 'predict', 'an', 'internal', 'resistivity', 'caused', 'by', 'a', 'dissipative', 'coupling', 'between', 'gapped', 'and', 'gapless', 'modes']]
|
[-0.20062906916436501, 0.17080323110743062, -0.08741497831452175, 0.01780605316299879, -0.03959073853188542, -0.12720228794730715, 0.06885138414207757, 0.3388862764385678, -0.2920634543809753, -0.28170952935683813, -0.014422007208860882, -0.2751137971018369, -0.1397376878148485, 0.1769471145303887, 0.02470306764334749, 0.024133193865969512, 0.0008213440047235355, 0.018313680448949602, -0.08660091169608328, -0.18387477137368813, 0.3512395964797652, 0.014218367901410268, 0.2586587433973272, 0.11067563711153068, 0.05150615598334099, 0.022435354014456316, 0.09158286702483011, 0.07045148155988144, -0.14856535353245434, 0.04574920841597417, 0.20174038134475333, -0.09852688951616193, 0.24008645376289736, -0.4643722211931055, -0.19101201394605918, 0.026980880355826145, 0.14057999497180332, 0.14474411741224222, -0.024777383519441285, -0.30219154542080573, 0.008510676463349508, -0.16817223391521133, -0.1307077422213173, -0.060624136564668994, -0.002269885548908462, -0.004981839792395132, -0.26077977529886737, 0.11411298233474958, 0.06975805888726712, 0.0616690557885408, -0.06295574630318573, -0.0659456854237012, -0.03748173805879506, 0.08045606301083455, 0.033723653580018005, 0.02993728587687699, 0.1560497596569238, -0.15726314910643419, -0.0886021813146285, 0.3414148819473016, -0.12635177919316, -0.17808985697469237, 0.14219427741953783, -0.16924445832819132, -0.05337382378828155, 0.1478753490401046, 0.13485780805790212, 0.07851559431746756, -0.13112627550650982, 0.11955844856021629, -0.0027589244801088197, 0.16166658422871102, 0.025580152951886315, 0.04720400997090357, 0.23946756478288822, 0.1619976183011048, 0.05496075667837668, 0.1744410300499225, -0.134697282113708, -0.07446190153287184, -0.2724344854700495, -0.15733506893546226, -0.22704851704983028, 0.07625857485766858, -0.05226697828434683, -0.17476943292857056, 0.4209484035292497, 0.17788674663366563, 0.19838247686960686, -0.035422925516334774, 0.28063751122578096, 0.1846488287669645, 0.08037552937449192, 0.03447948805140552, 0.25114090181646054, 0.21154155162061128, 0.09557448626501408, -0.35742058632578483, 0.005786908666476519, 0.027648763689791134]
|
1,803.0736
|
Adaptive Co-weighting Deep Convolutional Features For Object Retrieval
|
Aggregating deep convolutional features into a global image vector has
attracted sustained attention in image retrieval. In this paper, we propose an
efficient unsupervised aggregation method that uses an adaptive Gaussian filter
and an elementvalue sensitive vector to co-weight deep features. Specifically,
the Gaussian filter assigns large weights to features of region-of-interests
(RoI) by adaptively determining the RoI's center, while the element-value
sensitive channel vector suppresses burstiness phenomenon by assigning small
weights to feature maps with large sum values of all locations. Experimental
results on benchmark datasets validate the proposed two weighting schemes both
effectively improve the discrimination power of image vectors. Furthermore,
with the same experimental setting, our method outperforms other very recent
aggregation approaches by a considerable margin.
|
cs.CV
|
aggregating deep convolutional features into a global image vector has attracted sustained attention in image retrieval in this paper we propose an efficient unsupervised aggregation method that uses an adaptive gaussian filter and an elementvalue sensitive vector to coweight deep features specifically the gaussian filter assigns large weights to features of regionofinterests roi by adaptively determining the rois center while the elementvalue sensitive channel vector suppresses burstiness phenomenon by assigning small weights to feature maps with large sum values of all locations experimental results on benchmark datasets validate the proposed two weighting schemes both effectively improve the discrimination power of image vectors furthermore with the same experimental setting our method outperforms other very recent aggregation approaches by a considerable margin
|
[['aggregating', 'deep', 'convolutional', 'features', 'into', 'a', 'global', 'image', 'vector', 'has', 'attracted', 'sustained', 'attention', 'in', 'image', 'retrieval', 'in', 'this', 'paper', 'we', 'propose', 'an', 'efficient', 'unsupervised', 'aggregation', 'method', 'that', 'uses', 'an', 'adaptive', 'gaussian', 'filter', 'and', 'an', 'elementvalue', 'sensitive', 'vector', 'to', 'coweight', 'deep', 'features', 'specifically', 'the', 'gaussian', 'filter', 'assigns', 'large', 'weights', 'to', 'features', 'of', 'regionofinterests', 'roi', 'by', 'adaptively', 'determining', 'the', 'rois', 'center', 'while', 'the', 'elementvalue', 'sensitive', 'channel', 'vector', 'suppresses', 'burstiness', 'phenomenon', 'by', 'assigning', 'small', 'weights', 'to', 'feature', 'maps', 'with', 'large', 'sum', 'values', 'of', 'all', 'locations', 'experimental', 'results', 'on', 'benchmark', 'datasets', 'validate', 'the', 'proposed', 'two', 'weighting', 'schemes', 'both', 'effectively', 'improve', 'the', 'discrimination', 'power', 'of', 'image', 'vectors', 'furthermore', 'with', 'the', 'same', 'experimental', 'setting', 'our', 'method', 'outperforms', 'other', 'very', 'recent', 'aggregation', 'approaches', 'by', 'a', 'considerable', 'margin']]
|
[-0.04067364392675838, 0.0247880250694757, -0.06418152022672723, 0.01842311829016781, -0.10075563557891933, -0.20239087941284858, 0.03903089643759906, 0.45835807512245946, -0.30041735868711594, -0.2663372790409347, 0.0471633789504452, -0.2836467993240488, -0.17721219438175528, 0.13166250518949354, -0.12909526392912207, 0.09844403706357313, 0.11568362644295306, 0.026502156937968428, -0.05406363329283353, -0.29971024969107296, 0.30941825642613535, 0.1071941133347336, 0.4121144263357934, -0.009195540455501463, 0.15404769596673343, 0.010152277248611643, -0.1142977602943636, -0.018907956234416216, -0.06489862957842286, 0.17039099518383333, 0.29154289558813984, 0.16063819047047803, 0.35457804314871083, -0.35990997958707355, -0.25240461535404546, 0.12445439749113205, 0.16811212266882156, 0.09569688326734911, -0.06803735525157871, -0.34897595610848425, 0.12278046998416342, -0.15533005147856677, 0.0416497990362725, -0.15850153314423257, -0.01712583360593703, 0.0022463157720729646, -0.3579828276188444, 0.04135817056521773, 0.05475936511973456, 0.02419519766186506, -0.08694135499388074, -0.15801439528606073, 0.018403000168707537, 0.13325733401204887, 0.012742012803308602, 0.0706832793588608, 0.15476300113960723, -0.19021312930518602, -0.13739644580666702, 0.3031690308073895, -0.08411941320193395, -0.2504116616006378, 0.1531282834974078, -0.031770249915514456, -0.10742120274295242, 0.1551757585316486, 0.22328288820414346, 0.10540767272113491, -0.10854941857505147, -0.009538901086316555, -0.08161762798741712, 0.17963019311349143, 0.053045809892463984, 0.0361687120541504, 0.17810603760634708, 0.21074301234478035, 0.062074631167441545, 0.1596896059685821, -0.20216202712864456, -0.08665103362123402, -0.19729730584145666, -0.04273803850391217, -0.2133249295549862, -0.08917593561069471, -0.16430297694788057, -0.12486406153667781, 0.4273736676106514, 0.21436519927929265, 0.29167753227560195, 0.06431994462875112, 0.35001465184140507, 0.04518934206393847, 0.151791610960233, 0.0757126202254351, 0.1658176857982052, 0.03053015041741211, 0.08922776148133611, -0.15927431868168257, 0.07940984770588545, 0.0821871133462005]
|
1,803.07361
|
Characterizing Bounded Orthogonally Additive Polynomials on Vector
Lattices
|
We derive formulas for characterizing bounded orthogonally additive
polynomials in two ways. Firstly, we prove that certain formulas for
orthogonally additive polynomials derived in \cite{Kusa} actually characterize
them. Secondly, by employing complexifications of the unique symmetric
multilinear maps associated with orthogonally additive maps we derive new
characterizing formulas.
|
math.FA
|
we derive formulas for characterizing bounded orthogonally additive polynomials in two ways firstly we prove that certain formulas for orthogonally additive polynomials derived in citekusa actually characterize them secondly by employing complexifications of the unique symmetric multilinear maps associated with orthogonally additive maps we derive new characterizing formulas
|
[['we', 'derive', 'formulas', 'for', 'characterizing', 'bounded', 'orthogonally', 'additive', 'polynomials', 'in', 'two', 'ways', 'firstly', 'we', 'prove', 'that', 'certain', 'formulas', 'for', 'orthogonally', 'additive', 'polynomials', 'derived', 'in', 'citekusa', 'actually', 'characterize', 'them', 'secondly', 'by', 'employing', 'complexifications', 'of', 'the', 'unique', 'symmetric', 'multilinear', 'maps', 'associated', 'with', 'orthogonally', 'additive', 'maps', 'we', 'derive', 'new', 'characterizing', 'formulas']]
|
[-0.1530716044907557, 0.10557972043356363, -0.04507650260595565, 0.07777514215558767, -0.05343756143082964, -0.20080991493577652, -0.001453990433761414, 0.3939407585545423, -0.3554955782626379, -0.14640065556035398, 0.08364620147287806, -0.21294940366072856, -0.2632263424865743, 0.21433284248601883, -0.09879106822692382, 0.03690161894848372, -0.0529043765372022, -0.010198541421522486, -0.13824862308621882, -0.22349005262367427, 0.4328591248139422, -0.09287034997597654, 0.1762704774737358, -0.02737895991811727, 0.18761659855458965, 0.021887145074520338, -0.1734340203172983, -0.011728265778498446, -0.26285557041983143, 0.1792030074891258, 0.30944794636873646, 0.10477949046292045, 0.18481594419225733, -0.39065962966452256, -0.09378237401115451, 0.2105281786953515, 0.1057903163253944, 0.03227002680935758, -0.0165023564291682, -0.28057241126736426, 0.1049425353870747, -0.12764885062549977, -0.1863801929743049, -0.16278769172965846, 0.013021355752456696, 0.13378287645235182, -0.3015595013077589, -0.042808180749218196, 0.15683196825867005, 0.06391261660672248, -0.0939641926794293, -0.18679440382154697, 0.04994225389066529, 0.1273144229830421, -0.04848569278862882, -0.07493264865912894, 0.025034988645781228, -0.06571307076398838, -0.11973659741751691, 0.2972210834318019, -0.14689315547374018, -0.30872194164809075, 0.07826389962351545, -0.1628602391128686, -0.19944928652864505, 0.10913753204488572, 0.1288691720271364, 0.08100738073203792, -0.20385921924830752, 0.14520608388046, -0.13026792544158214, 0.06572727792391038, 0.23146005916072332, 0.06080328071727715, 0.14098604221610314, -0.10564201127024407, 0.14168117133940153, 0.31903259789055965, 0.01177361486987409, -0.07406141303796718, -0.288190278858739, -0.11038261253703782, -0.10897049349435467, 0.04924914639126113, -0.14401332021472937, -0.170065659672973, 0.35934874978154263, 0.05764062657080432, 0.12913852700210632, 0.20608879615394202, 0.27964731507954443, 0.19201219021937155, -0.04721071303604131, 0.0798720862478652, 0.12244054484874645, 0.27518903566623465, -0.06390859507658381, -0.0717347281727385, 0.046907963280744376, 0.17155290111754476]
|
1,803.07362
|
Towards a reversed Faber-Krahn inequality for the truncated Laplacian
|
We consider the nonlinear eigenvalue problem, with Dirichlet boundary
condition, for a class of very degenerate elliptic operators, with the aim to
show that, at least for square type domains having fixed volume, the symmetry
of the domain maximize the principal eigenvalue, contrary to what happens for
the Laplacian.
|
math.AP math.SP
|
we consider the nonlinear eigenvalue problem with dirichlet boundary condition for a class of very degenerate elliptic operators with the aim to show that at least for square type domains having fixed volume the symmetry of the domain maximize the principal eigenvalue contrary to what happens for the laplacian
|
[['we', 'consider', 'the', 'nonlinear', 'eigenvalue', 'problem', 'with', 'dirichlet', 'boundary', 'condition', 'for', 'a', 'class', 'of', 'very', 'degenerate', 'elliptic', 'operators', 'with', 'the', 'aim', 'to', 'show', 'that', 'at', 'least', 'for', 'square', 'type', 'domains', 'having', 'fixed', 'volume', 'the', 'symmetry', 'of', 'the', 'domain', 'maximize', 'the', 'principal', 'eigenvalue', 'contrary', 'to', 'what', 'happens', 'for', 'the', 'laplacian']]
|
[-0.13036482490371076, 0.05541894320702674, -0.028516984022013386, 0.04825018428513134, -0.14377432152134728, -0.15818764758771475, -0.043095504446905485, 0.3291185381917321, -0.30264907368287747, -0.22495307294385775, 0.19487976188277256, -0.3248878145704464, -0.10708867503824282, 0.10452836132323255, -0.04511913364487035, 0.10520257779910248, 0.08560987312004578, 0.13113103320403974, -0.08053647282495334, -0.2033805802359949, 0.4663765049558513, -0.050001640138881545, 0.24543097919347334, 0.048345281623722036, 0.07512016235185522, -0.026536193980398227, 0.0460947989913806, -0.012635195580292113, -0.15564853694288142, 0.12900779119037015, 0.27438126096730026, -0.010774267210187961, 0.31971158513001036, -0.4028745707200498, -0.190032117116284, 0.20935195853591573, 0.09532574423569806, 0.028961888248366967, 0.01819696257185495, -0.20208875481419417, 0.14172034887169316, -0.05946619436144829, -0.23431913040540353, 0.0305364010903072, -0.03477320778278672, -0.015938002252666165, -0.33737852990779343, 0.11762388399326984, 0.08422091572868581, 0.04824553739887719, -0.08362284599214184, -0.1538187804993014, 0.006289797920581638, 0.05981082000712655, 0.05784496231413237, -0.04046222022069352, 0.0033622792071415757, -0.1372831352815336, -0.07503924830531587, 0.3930386336026143, -0.04915520012834851, -0.2715190161323669, 0.12420921651076297, -0.18356057159526615, -0.11819981190623069, 0.08006228155893635, 0.17503960966607746, 0.14618718903511763, -0.07762594011669256, 0.114360155423685, -0.0564991030343143, 0.12848535433829744, 0.09240886521506675, -0.032197267472820014, 0.13637825170037698, 0.1225334119184741, 0.21779903303831816, 0.16365257261810368, -0.04877850520234479, -0.11173662360833615, -0.3495907569114043, -0.1355928458672549, -0.23642881272113597, 0.0848175681253173, -0.08948901452466237, -0.22626005379217012, 0.39507150912315264, 0.08267406039700216, 0.21404384969904713, 0.10601914508686382, 0.17479271126188795, 0.17281160385785055, 0.05801329826365928, 0.08585600321399695, 0.16992531587578813, 0.14466961043321394, 0.10464262675341902, -0.2681327430645422, -0.027783627412757094, 0.1410655228383079]
|
1,803.07363
|
Low temperature magnetic properties of Nd2Ru2O7
|
We present magnetic susceptibility, heat capacity, and neutron diffraction
measurements of polycrystalline Nd2Ru2O7 down to 0.4 K. Three anomalies in the
magnetic susceptibility measurements at 146, 21 and 1.8 K are associated with
an antiferromagnetic ordering of the Ru4+ moments, a weak ferromagnetic signal
attributed to a canting of the Ru4+ and Nd3+ moments, and a long-range-ordering
of the Nd3+ moments, respectively. The long-range order of the Nd3+ moments was
observed in all the measurements, indicating that the ground state of the
compound is not a spin glass. The magnetic entropy of Rln2 accumulated up to 5
K, suggests the Nd3+ has a doublet ground state. Lattice distortions accompany
the transitions, as revealed by neutron diffraction measurements, and in
agreement with earlier synchrotron x-ray studies. The magnetic moment of the
Nd3+ ion at 0.4 K is estimated to be 1.54(2){\mu}B and the magnetic structure
is all-in all-out as determined by our neutron diffraction measurements.
|
cond-mat.str-el
|
we present magnetic susceptibility heat capacity and neutron diffraction measurements of polycrystalline nd2ru2o7 down to 04 k three anomalies in the magnetic susceptibility measurements at 146 21 and 18 k are associated with an antiferromagnetic ordering of the ru4 moments a weak ferromagnetic signal attributed to a canting of the ru4 and nd3 moments and a longrangeordering of the nd3 moments respectively the longrange order of the nd3 moments was observed in all the measurements indicating that the ground state of the compound is not a spin glass the magnetic entropy of rln2 accumulated up to 5 k suggests the nd3 has a doublet ground state lattice distortions accompany the transitions as revealed by neutron diffraction measurements and in agreement with earlier synchrotron xray studies the magnetic moment of the nd3 ion at 04 k is estimated to be 1542mub and the magnetic structure is allin allout as determined by our neutron diffraction measurements
|
[['we', 'present', 'magnetic', 'susceptibility', 'heat', 'capacity', 'and', 'neutron', 'diffraction', 'measurements', 'of', 'polycrystalline', 'nd2ru2o7', 'down', 'to', '04', 'k', 'three', 'anomalies', 'in', 'the', 'magnetic', 'susceptibility', 'measurements', 'at', '146', '21', 'and', '18', 'k', 'are', 'associated', 'with', 'an', 'antiferromagnetic', 'ordering', 'of', 'the', 'ru4', 'moments', 'a', 'weak', 'ferromagnetic', 'signal', 'attributed', 'to', 'a', 'canting', 'of', 'the', 'ru4', 'and', 'nd3', 'moments', 'and', 'a', 'longrangeordering', 'of', 'the', 'nd3', 'moments', 'respectively', 'the', 'longrange', 'order', 'of', 'the', 'nd3', 'moments', 'was', 'observed', 'in', 'all', 'the', 'measurements', 'indicating', 'that', 'the', 'ground', 'state', 'of', 'the', 'compound', 'is', 'not', 'a', 'spin', 'glass', 'the', 'magnetic', 'entropy', 'of', 'rln2', 'accumulated', 'up', 'to', '5', 'k', 'suggests', 'the', 'nd3', 'has', 'a', 'doublet', 'ground', 'state', 'lattice', 'distortions', 'accompany', 'the', 'transitions', 'as', 'revealed', 'by', 'neutron', 'diffraction', 'measurements', 'and', 'in', 'agreement', 'with', 'earlier', 'synchrotron', 'xray', 'studies', 'the', 'magnetic', 'moment', 'of', 'the', 'nd3', 'ion', 'at', '04', 'k', 'is', 'estimated', 'to', 'be', '1542mub', 'and', 'the', 'magnetic', 'structure', 'is', 'allin', 'allout', 'as', 'determined', 'by', 'our', 'neutron', 'diffraction', 'measurements']]
|
[-0.15983549336363612, 0.26847568614414885, 0.006030266580637544, 0.015721557268989272, -0.030765446861838235, -0.056019894726647944, 0.10127555092874804, 0.37599696524098125, -0.22712609893642366, -0.3491765128718199, 0.032930671124823244, -0.4100622524948497, 0.02646345209704075, 0.12046962981357386, 0.13516107092819815, -0.00810122695494149, -0.04556041474202893, 0.06676520598978784, -0.11219880358456928, -0.18584904015312387, 0.22397092651686093, 0.04575851882844673, 0.28706495579650726, 0.08059783443796302, 0.06487090538384539, -0.016437609617959856, 0.12118051055585966, 0.02793581951041951, -0.1238557496125826, 0.02983760730191869, 0.24653352252330238, -0.03933925878817191, 0.11838198677593793, -0.39546242165134143, -0.18187892669811845, 0.025086405956627505, 0.08863947275217231, 0.10559925283632765, -0.032252906419575754, -0.285604219062646, 0.07558726436630088, -0.09829278455091346, -0.11709404901002447, -0.13915221255439592, -0.05250931232800021, 0.025452509785904305, -0.318333070812897, 0.14170668665074596, 0.13460286357440054, 0.16060320150695348, -0.14603643507488365, -0.1825174262416304, -0.05176685628401557, 0.019797906423551274, 0.07356725115402553, 0.138830086966903, 0.12154070225752596, -0.0664638532593687, -0.13891739727573862, 0.3461648411681189, -0.07415098708435452, -0.005689764509282357, 0.10017222261338152, -0.2908497984079938, -0.12277373557873561, 0.24293974995625353, 0.06696332770699978, 0.12879429727993402, -0.14017390497802376, 0.0058198388073115465, -0.0009177291312402016, 0.22685539678913733, 0.035743620402890405, 0.020875253472168925, 0.24609738927469343, 0.13497133311083367, 0.006223381680779551, 0.1573241327401583, -0.20262409891065067, -0.008736684912276504, -0.19422180922150514, -0.14921824222026198, -0.21231571682744144, 0.08437678469568996, -0.08315310369519131, -0.11121590078906401, 0.3163239234770452, 0.11903038958859581, 0.18876699964809968, -0.09858056582283768, 0.2426714564453026, 0.06668127738521434, 0.06851808028601993, 0.036136449084264506, 0.249085429718865, 0.27910908010457397, 0.1692601286156691, -0.3200299216244419, 0.12017660708730354, -0.017011955702113675]
|
1,803.07364
|
Coupled Kohn-Sham equations for electrons and phonons
|
This work establishes the algebraic structure of the Kohn-Sham equations to
be solved in a density formulation of electron and phonon dynamics, including
the superconducting order parameter. A Bogoliubov transform is required to
diagonalize both the fermionic and bosonic Kohn-Sham Hamiltonians since they
both represent a non-interacting quantum field theory. The Bogoliubov transform
for phonons is non-Hermitian in the general case, and the corresponding
time-evolution is non-unitary. Several sufficient conditions for ensuring that
the bosonic eigenvalues are real are provided and a practical method for
solving the system is described. Finally, we produce a set of approximate
mean-field potentials which are functionals of the electronic and phononic
density matrices and depend on the electron-phonon vertex.
|
cond-mat.supr-con
|
this work establishes the algebraic structure of the kohnsham equations to be solved in a density formulation of electron and phonon dynamics including the superconducting order parameter a bogoliubov transform is required to diagonalize both the fermionic and bosonic kohnsham hamiltonians since they both represent a noninteracting quantum field theory the bogoliubov transform for phonons is nonhermitian in the general case and the corresponding timeevolution is nonunitary several sufficient conditions for ensuring that the bosonic eigenvalues are real are provided and a practical method for solving the system is described finally we produce a set of approximate meanfield potentials which are functionals of the electronic and phononic density matrices and depend on the electronphonon vertex
|
[['this', 'work', 'establishes', 'the', 'algebraic', 'structure', 'of', 'the', 'kohnsham', 'equations', 'to', 'be', 'solved', 'in', 'a', 'density', 'formulation', 'of', 'electron', 'and', 'phonon', 'dynamics', 'including', 'the', 'superconducting', 'order', 'parameter', 'a', 'bogoliubov', 'transform', 'is', 'required', 'to', 'diagonalize', 'both', 'the', 'fermionic', 'and', 'bosonic', 'kohnsham', 'hamiltonians', 'since', 'they', 'both', 'represent', 'a', 'noninteracting', 'quantum', 'field', 'theory', 'the', 'bogoliubov', 'transform', 'for', 'phonons', 'is', 'nonhermitian', 'in', 'the', 'general', 'case', 'and', 'the', 'corresponding', 'timeevolution', 'is', 'nonunitary', 'several', 'sufficient', 'conditions', 'for', 'ensuring', 'that', 'the', 'bosonic', 'eigenvalues', 'are', 'real', 'are', 'provided', 'and', 'a', 'practical', 'method', 'for', 'solving', 'the', 'system', 'is', 'described', 'finally', 'we', 'produce', 'a', 'set', 'of', 'approximate', 'meanfield', 'potentials', 'which', 'are', 'functionals', 'of', 'the', 'electronic', 'and', 'phononic', 'density', 'matrices', 'and', 'depend', 'on', 'the', 'electronphonon', 'vertex']]
|
[-0.1431584579748628, 0.1619996771408731, -0.09826672611677129, 0.07806260549240625, -0.055388896027579904, -0.15507531082257628, 0.004694554781662705, 0.3327732960410092, -0.24197253250800396, -0.2382917847200904, 0.03252004695266647, -0.29745448903869026, -0.157654289111657, 0.17567638893125823, 0.03358966771148793, 0.09941366641255825, 0.03052216775958305, 0.027720083039172966, -0.1336202783520212, -0.24312302391955873, 0.30185972698761715, 0.0004762118510173067, 0.24904685000403096, 0.07020700826593067, 0.0729753031435868, 0.017282416560160725, 0.047262160028533444, -0.02400593633318077, -0.0845986145146763, 0.10124308475009773, 0.2946378730399453, 0.03629378491364743, 0.24768244324697425, -0.48344917090042777, -0.20183480070984883, 0.06922008744238511, 0.12662471456291235, 0.18710521647767367, -0.001636910995306528, -0.29553526560371013, 0.022775022750315458, -0.15202862283862803, -0.15104174554428976, -0.1546123970299959, -0.019868428012072715, 0.00979688317798402, -0.29284147660946475, 0.10440651433056464, 0.031732771241956434, 0.023470740425197974, -0.10639024462459772, -0.0749245362346182, -0.024802699990813498, 0.04930482954191773, -0.031362559259666696, -0.030980723235837143, 0.12262233499761509, -0.10258212533536488, -0.04588013267873422, 0.40800333968971086, -0.01799507513794157, -0.2503326279637606, 0.1536665268647282, -0.09009246169488229, -0.08393680251243969, 0.11984967140521369, 0.09869248495315729, 0.09931089980527759, -0.1808758300825265, 0.19092862395596255, -0.04369451916047736, 0.11439514297425099, 0.02202794058248401, 0.0874842025769834, 0.16383905463406573, 0.09322388456810428, 0.07697535718527987, 0.10193874507474349, -0.024257834743627388, -0.15629569543525576, -0.3183575555682182, -0.16335950969191998, -0.2739812359456783, 0.04368576078837656, -0.06709471517773953, -0.21280257727788843, 0.462457654317436, 0.14429399872795962, 0.14268325813438582, 0.03644933968316764, 0.23053486100195542, 0.24838187369459774, 0.01719792770302814, 0.0840355867843913, 0.20412160483715328, 0.2255195387598613, 0.04102848610719261, -0.3051318785297158, -0.04998100260677545, 0.1050963448603516]
|
1,803.07365
|
Weighted Null-Space Fitting for Identification of Cascade Networks
|
For identification of systems embedded in dynamic networks, applying the
prediction error method (PEM) to a correct tailor-made parametrization of the
complete network provided asymptotically efficient estimates. However, the
network complexity often hinders a successful application of PEM, which
requires minimizing a non-convex cost function that in general becomes more
difficult for more complex networks. For this reason, identification in dynamic
networks often focuses in obtaining consistent estimates of particular network
modules of interest. A downside of such approaches is that splitting the
network in several modules for identification often costs asymptotic
efficiency. In this paper, we consider the particular case of a dynamic network
with the individual systems connected in a serial cascaded manner, with
measurements affected by sensor noise. We propose an algorithm that estimates
all the modules in the network simultaneously without requiring the
minimization of a non-convex cost function. This algorithm is an extension of
Weighted Null-Space Fitting (WNSF), a weighted least-squares method that
provides asymptotically efficient estimates for single-input single-output
systems. We illustrate the performance of the algorithm with simulation
studies, which suggest that a network WNSF may also be asymptotically efficient
estimates when applied to cascade networks, and discuss the possibility of
extension to more general networks affected by sensor noise.
|
cs.SY
|
for identification of systems embedded in dynamic networks applying the prediction error method pem to a correct tailormade parametrization of the complete network provided asymptotically efficient estimates however the network complexity often hinders a successful application of pem which requires minimizing a nonconvex cost function that in general becomes more difficult for more complex networks for this reason identification in dynamic networks often focuses in obtaining consistent estimates of particular network modules of interest a downside of such approaches is that splitting the network in several modules for identification often costs asymptotic efficiency in this paper we consider the particular case of a dynamic network with the individual systems connected in a serial cascaded manner with measurements affected by sensor noise we propose an algorithm that estimates all the modules in the network simultaneously without requiring the minimization of a nonconvex cost function this algorithm is an extension of weighted nullspace fitting wnsf a weighted leastsquares method that provides asymptotically efficient estimates for singleinput singleoutput systems we illustrate the performance of the algorithm with simulation studies which suggest that a network wnsf may also be asymptotically efficient estimates when applied to cascade networks and discuss the possibility of extension to more general networks affected by sensor noise
|
[['for', 'identification', 'of', 'systems', 'embedded', 'in', 'dynamic', 'networks', 'applying', 'the', 'prediction', 'error', 'method', 'pem', 'to', 'a', 'correct', 'tailormade', 'parametrization', 'of', 'the', 'complete', 'network', 'provided', 'asymptotically', 'efficient', 'estimates', 'however', 'the', 'network', 'complexity', 'often', 'hinders', 'a', 'successful', 'application', 'of', 'pem', 'which', 'requires', 'minimizing', 'a', 'nonconvex', 'cost', 'function', 'that', 'in', 'general', 'becomes', 'more', 'difficult', 'for', 'more', 'complex', 'networks', 'for', 'this', 'reason', 'identification', 'in', 'dynamic', 'networks', 'often', 'focuses', 'in', 'obtaining', 'consistent', 'estimates', 'of', 'particular', 'network', 'modules', 'of', 'interest', 'a', 'downside', 'of', 'such', 'approaches', 'is', 'that', 'splitting', 'the', 'network', 'in', 'several', 'modules', 'for', 'identification', 'often', 'costs', 'asymptotic', 'efficiency', 'in', 'this', 'paper', 'we', 'consider', 'the', 'particular', 'case', 'of', 'a', 'dynamic', 'network', 'with', 'the', 'individual', 'systems', 'connected', 'in', 'a', 'serial', 'cascaded', 'manner', 'with', 'measurements', 'affected', 'by', 'sensor', 'noise', 'we', 'propose', 'an', 'algorithm', 'that', 'estimates', 'all', 'the', 'modules', 'in', 'the', 'network', 'simultaneously', 'without', 'requiring', 'the', 'minimization', 'of', 'a', 'nonconvex', 'cost', 'function', 'this', 'algorithm', 'is', 'an', 'extension', 'of', 'weighted', 'nullspace', 'fitting', 'wnsf', 'a', 'weighted', 'leastsquares', 'method', 'that', 'provides', 'asymptotically', 'efficient', 'estimates', 'for', 'singleinput', 'singleoutput', 'systems', 'we', 'illustrate', 'the', 'performance', 'of', 'the', 'algorithm', 'with', 'simulation', 'studies', 'which', 'suggest', 'that', 'a', 'network', 'wnsf', 'may', 'also', 'be', 'asymptotically', 'efficient', 'estimates', 'when', 'applied', 'to', 'cascade', 'networks', 'and', 'discuss', 'the', 'possibility', 'of', 'extension', 'to', 'more', 'general', 'networks', 'affected', 'by', 'sensor', 'noise']]
|
[-0.14019788871687985, -0.017549055863980537, -0.039696411595225405, 0.08006478344137524, -0.05296224915615962, -0.18127276340571508, 0.04786344572445063, 0.413977913774442, -0.2549690292419299, -0.291391866578572, 0.12635712127160767, -0.2086168373192566, -0.22754176193848252, 0.2233027148022258, -0.1305422905792037, 0.0983589757323841, 0.12300802954666065, 0.014752663246801367, -0.07106467992447514, -0.23342544538506582, 0.30313686794457406, 0.0963707502508437, 0.31000876405550803, 0.006387182308927826, 0.10529217907398543, 0.040427059700019696, -0.02588131727388124, 0.03329710288092512, -0.06187191178574669, 0.17884922661067207, 0.28996057870037456, 0.1445784496890318, 0.34027403673035617, -0.4188030073149265, -0.24643432599568857, 0.16145560521506458, 0.16704881246143205, 0.09315736412018952, -0.04075698349797808, -0.234230487048401, 0.09797479602444134, -0.17936101966033632, -0.07315447160767184, -0.08860722970631388, -0.04099556567723264, 0.01703409618160413, -0.34847803871880695, 0.06504359541577287, 0.05093435800166414, 0.011625886656307944, -0.06355529013967169, -0.10067245245186819, 0.03742037553020758, 0.10311702369773594, 0.0049197032945320586, -1.3954719249609013e-05, 0.12021150774039004, -0.14415379217600874, -0.1231391836758613, 0.3377400595438329, -0.03545021991906823, -0.25677178052348504, 0.15097318519275763, -0.04427693824616715, -0.16314694876467656, 0.1475893226204719, 0.2085673720508382, 0.13966451981442346, -0.19225242703958753, 0.024867719893876896, -0.011244476665990148, 0.15517197708837724, -0.0031435277115031716, 0.032685554361956165, 0.1175796982296855, 0.2552924033238638, 0.14872832632295174, 0.15973509975724767, -0.06237600636128606, -0.07623597202993533, -0.24915322851713584, -0.12014699229916585, -0.1888316470892326, 0.006563385939540495, -0.12027672179270218, -0.1776471367276809, 0.3937000943795476, 0.17132597907327096, 0.18257372539545577, 0.13169694406875737, 0.3609973229107937, 0.0859418463199242, 0.061691313124923174, 0.1120711065162927, 0.20677498930723268, 0.10815491103949611, 0.09632944551427007, -0.17774272895224644, 0.10714408689839901, 0.0369303444881838]
|
1,803.07366
|
Anomalies of Duality Groups and Extended Conformal Manifolds
|
A self-duality group $\cal G$ in quantum field theory can have anomalies. In
that case, the space of ordinary coupling constants $\cal M$ can be extended to
include the space $\cal F$ of coefficients of counterterms in background
fields. The extended space $\cal N$ forms a bundle over $\cal M$ with fiber
$\cal F$, and the topology of the bundle is determined by the anomaly. For
example, the ${\cal G}=SL(2,\mathbb{Z})$ duality of the 4d Maxwell theory has
an anomaly, and the space ${\cal F}=S^1$ for the gravitational theta-angle is
nontrivially fibered over ${\cal M}=\mathbb{H}/SL(2,\mathbb{Z})$. We will
explain a simple method to determine the anomaly when the 4d theory is obtained
by compactifying a 6d theory on a Riemann surface in terms of the anomaly
polynomial of the parent 6d theory. Our observations resolve an apparent
contradiction associated with the global structure of the Kahler potential on
the space of exactly marginal couplings of supersymmetric theories.
|
hep-th
|
a selfduality group cal g in quantum field theory can have anomalies in that case the space of ordinary coupling constants cal m can be extended to include the space cal f of coefficients of counterterms in background fields the extended space cal n forms a bundle over cal m with fiber cal f and the topology of the bundle is determined by the anomaly for example the cal gsl2mathbbz duality of the 4d maxwell theory has an anomaly and the space cal fs1 for the gravitational thetaangle is nontrivially fibered over cal mmathbbhsl2mathbbz we will explain a simple method to determine the anomaly when the 4d theory is obtained by compactifying a 6d theory on a riemann surface in terms of the anomaly polynomial of the parent 6d theory our observations resolve an apparent contradiction associated with the global structure of the kahler potential on the space of exactly marginal couplings of supersymmetric theories
|
[['a', 'selfduality', 'group', 'cal', 'g', 'in', 'quantum', 'field', 'theory', 'can', 'have', 'anomalies', 'in', 'that', 'case', 'the', 'space', 'of', 'ordinary', 'coupling', 'constants', 'cal', 'm', 'can', 'be', 'extended', 'to', 'include', 'the', 'space', 'cal', 'f', 'of', 'coefficients', 'of', 'counterterms', 'in', 'background', 'fields', 'the', 'extended', 'space', 'cal', 'n', 'forms', 'a', 'bundle', 'over', 'cal', 'm', 'with', 'fiber', 'cal', 'f', 'and', 'the', 'topology', 'of', 'the', 'bundle', 'is', 'determined', 'by', 'the', 'anomaly', 'for', 'example', 'the', 'cal', 'gsl2mathbbz', 'duality', 'of', 'the', '4d', 'maxwell', 'theory', 'has', 'an', 'anomaly', 'and', 'the', 'space', 'cal', 'fs1', 'for', 'the', 'gravitational', 'thetaangle', 'is', 'nontrivially', 'fibered', 'over', 'cal', 'mmathbbhsl2mathbbz', 'we', 'will', 'explain', 'a', 'simple', 'method', 'to', 'determine', 'the', 'anomaly', 'when', 'the', '4d', 'theory', 'is', 'obtained', 'by', 'compactifying', 'a', '6d', 'theory', 'on', 'a', 'riemann', 'surface', 'in', 'terms', 'of', 'the', 'anomaly', 'polynomial', 'of', 'the', 'parent', '6d', 'theory', 'our', 'observations', 'resolve', 'an', 'apparent', 'contradiction', 'associated', 'with', 'the', 'global', 'structure', 'of', 'the', 'kahler', 'potential', 'on', 'the', 'space', 'of', 'exactly', 'marginal', 'couplings', 'of', 'supersymmetric', 'theories']]
|
[-0.1796254846328273, 0.1346030069373965, -0.046099690986748515, 0.043402730882186075, -0.08284689249848229, -0.10031847864864211, -0.02820095852903072, 0.2983358555345559, -0.21911617002017747, -0.2810817633670286, 0.08106378914204006, -0.2677927536500338, -0.1898037664230085, 0.10336822348348552, -0.07412001948341046, 0.006927919656257419, -0.02450941539570397, 0.1191835422373188, -0.15124141899534058, -0.2577318679906574, 0.3371754590501047, 0.013774916609548325, 0.2059747790978625, 0.037817654546861555, 0.1079878151459388, -0.016184045927099933, 0.019112881677821766, 0.039355674906735756, -0.1118697615881436, 0.12885280707059732, 0.2296034455652428, 0.08203712185111287, 0.11055326174634199, -0.41218621862041793, -0.24198761746516373, 0.1326694603692862, 0.12885134001916845, 0.03035214550494904, 0.053263862798404366, -0.302557196098325, 0.06078139937549732, -0.14250961644879354, -0.168156875825481, -0.07392134981722955, 0.06101581811360114, -0.12161499515078426, -0.27982407806972287, 0.017616648940686014, -0.009187206853442868, 0.05113600756899983, -0.03155928719339868, -0.056572074029485095, -0.08798426045013555, 0.03534919631555585, 0.08284737555511004, 0.11760110641507054, 0.10549072606574281, -0.15756866635352956, -0.12150947051122785, 0.398754950253646, -0.13988791849873913, -0.2151073357369979, 0.08498271246702453, -0.170547197375057, -0.16588187413716238, 0.15244332732620583, 0.1046015480837596, 0.18519068193725413, -0.054975314077322396, 0.2881622793041839, -0.0783325120102115, 0.11206760043065289, 0.03748528041125099, 0.010331523641213482, 0.21580940477391766, 0.09023355693538107, 0.054258076913861766, 0.08282113414534727, -0.022439369786488125, -0.062015181440811334, -0.4295179244934344, -0.1889144977527287, -0.1363811461270933, 0.10691483723444048, -0.14591760588242988, -0.1399502282463063, 0.3439812054766305, 0.06151692581277803, 0.1992533865439541, 0.062268720146913835, 0.16738368934507367, 0.12856693767784225, 0.09962762035490348, 0.01613080220942209, 0.24649252245214834, 0.18924414903668116, 0.012911372457393537, -0.2610062258485461, -0.09278002431847496, 0.17019361097767366]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.